public void TestIsGoal()
{
int[,] board = new int[5, 5];
GameBoard gameBoard = new GameBoard(board, new MazeOfLife.Vector2(5, 5), new Vector2(1, 1));
for (int i = 1; i < 5; i++) {
for (int j = 1; j < 5; j++) {
if (i == 1 && j == 1) {
Assert.IsTrue(gameBoard.isGoal(new Vector2(i, j)));
} else {
Assert.IsFalse(gameBoard.isGoal(new Vector2(i, j)));
}
}
}
}
public static List<Vector2> BFTS(GameBoard gameBoard)
{
Vector2 playerPosition;
bool[,] visited = new bool[gameBoard.Dimensions.X, gameBoard.Dimensions.Y];
Vector2[,] previousPosition = new Vector2[gameBoard.Dimensions.X, gameBoard.Dimensions.Y];
try {
playerPosition = gameBoard.playerPosition;
} catch (PlayerNotFoundException) {
Console.WriteLine("Invalid game board, player not found!");
return null;
}
if (gameBoard.isGoal(playerPosition)) {
List<Vector2> pathToGoal = new List<Vector2>();
pathToGoal.Add(playerPosition);
return pathToGoal;
}
Queue<Vector2> moveQueue = new Queue<Vector2>();
moveQueue.Enqueue(playerPosition);
visited[playerPosition.X, playerPosition.Y] = true;
while (moveQueue.Count > 0) {
Vector2 move = moveQueue.Dequeue();
foreach (Vector2 newPosition in gameBoard.getAllDirections(move)) {
if (gameBoard.isValidPlayerPosition(newPosition) && !visited[newPosition.X, newPosition.Y]) {
visited[newPosition.X, newPosition.Y] = true;
previousPosition[newPosition.X, newPosition.Y] = move;
if (gameBoard.isGoal(newPosition)) {
//when goal is found retrace path from goal to start
List<Vector2> pathToGoal = new List<Vector2>();
Vector2 lastPosition = newPosition;
while (lastPosition.Equals(playerPosition) == false) {
pathToGoal.Add(lastPosition);
lastPosition = previousPosition[lastPosition.X, lastPosition.Y];
}
pathToGoal.Add(lastPosition);
pathToGoal.Reverse();
return pathToGoal;
} else {
moveQueue.Enqueue(newPosition);
}
}
}
}
Console.WriteLine("No solution could be found!");
return null;
}