Return to Question

In a tile-grid where movement in any of 8 directions takes exactly the same amount of turns (chess-board style rules), can I prevent diagonal movement from showing more new tiles than orthogonal movement?

For example, you are the red box in the image below. The green cells are presently visible to you (square field of view). You can move one tile in any of eight directions.

If you move north-east, you will explore 13 new tiles (shown in blue). If you instead move south, you will only explore 7 new tiles (shown in purple).

This problem arises because of the game-rule that diagonal movement (north-east) costs the same amount of turns as orthogonal movement (south); it's not solved by altering the field-of-view to be circular.

Is this possible to solve? Can it be made so that traveling in a specific direction isn't always more favorable for exploring the most new tiles per turn?

In a tile-grid where movement in any of 8 directions takes exactly the same amount of turns (chess-board style rules), can I prevent diagonal movement from showing more new tiles than orthogonal movement?

For example: You are the red box in the image below. The green cells are presently visible to you (square field of view). You can move a distance of one tile in any of the eight directions.

If you move north-east, you will explore 13 new tiles (shown in blue). If you instead move south, you will only explore 7 new tiles (shown in purple).

How can I make traveling in each direction equally favorable for exploration?

In a tile-grid where movement in any of 8 directions takes exactly the same amount of turns (chess-board style rules), can I prevent diagonal movement from showing more new tiles than orthogonal movement?

For example, you are the red box in the image below. The green cells are presently visible to you (square field of view). You can move one tile in any of eight directions.

If you move north-east, you will explore 13 new tiles (shown in blue). If you instead move south, you will only explore 7 new tiles (shown in purple).

This problem arises because of the game-rule that diagonal movement (north-east) costs the same amount of turns as orthogonal movement (south); it's not solved by altering the field-of-view to be circular.

Is this possible to solve? Can it be made so that traveling diagonally isn't always more favorable for exploring the most new tiles per turn?

In a tile-grid where movement in any of 8 directions takes exactly the same amount of turns (chess-board style rules), can I prevent diagonal movement from showing more new tiles than orthogonal movement?

For example, you are the red box in the image below. The green cells are presently visible to you (square field of view). You can move one tile in any of eight directions.

If you move north-east, you will explore 13 new tiles (shown in blue). If you instead move south, you will only explore 7 new tiles (shown in purple).

This problem arises because of the game-rule that diagonal movement (north-east) costs the same amount of turns as orthogonal movement (south); it's not solved by altering the field-of-view to be circular.

Is this possible to solve? Can it be made so that traveling in a specific direction isn't always more favorable for exploring the most new tiles per turn?

In a tile-grid where movement in any of 8 directions takes exactly the same amount of turns (chess-board style rules), can I prevent diagonal movement from showing more new tiles than orthogonal movement?

For example, you are the red box in the image below. The green cells are presently visible to you (square field of view). You can move one tile in any of eight directions.

If you move north-east, you will explore 13 new tiles (shown in blue). If you instead move south, you will only explore 7 new tiles (shown in purple).

This problem arises because of the game-rule that diagonal movement (north-east) costs the same amount of turns as orthogonal movement (south); it's not solved by altering the field-of-view to be circular.

Is it possible to remove this bias towards diagonal movement?

In a tile-grid where movement in any of 8 directions takes exactly the same amount of turns (chess-board style rules), can I prevent diagonal movement from showing more new tiles than orthogonal movement?

For example, you are the red box in the image below. The green cells are presently visible to you (square field of view). You can move one tile in any of eight directions.

If you move north-east, you will explore 13 new tiles (shown in blue). If you instead move south, you will only explore 7 new tiles (shown in purple).

This problem arises because of the game-rule that diagonal movement (north-east) costs the same amount of turns as orthogonal movement (south); it's not solved by altering the field-of-view to be circular.

Is this possible to solve? Can it be made so that traveling diagonally isn't always more favorable for exploring the most new tiles per turn?