static void Main()
{
var start = new Point(9, 3);
var end = new Point(1, 8);
Func <Point, char> getCell = GetCell(MAZE);
Func <Point, IEnumerable <Point> > getNeighbours = GetNeighbours(getCell);
Func <Point, Point, int> getCost = (from, to) => getCell(to) == '@' ? 4:1;
Func <Point, int> manhattanHeuristic = (to) => Math.Abs(to.X - end.X) + Math.Abs(to.Y - end.Y);
Func <Point, double> manhattanHeuristicD = (to) => Math.Abs(to.X - end.X) + Math.Abs(to.Y - end.Y);
var millisecondsTimeout = 100;
var algorithms = new Dictionary <int, Tuple <string, Func <IEnumerable <Point> >, Func <IEnumerable <Point> > > >
{
{ 1, "Depth First Search", () => DepthFirstSearch.Explore(start, getNeighbours), () => DepthFirstSearch.FindPath(start, getNeighbours, p => p.Equals(end)) },
{ 2, "Breadth First Search", () => BreadthFirstSearch.Explore(start, getNeighbours), () => BreadthFirstSearch.FindPath(start, getNeighbours, p => p.Equals(end)) },
{ 3, "Dijkstra", () => Dijkstra.Explore(start, getNeighbours, getCost), () => Dijkstra.FindPath(start, getNeighbours, getCost, p => p.Equals(end)) },
{ 4, "Greedy Best-First Search (with manhattan)", () => GreedyBestFirstSearch.Explore(start, getNeighbours, manhattanHeuristic), () => GreedyBestFirstSearch.FindPath(start, getNeighbours, manhattanHeuristic, p => p.Equals(end)) },
{ 5, "A* (with manhattan)", () => AStar.Explore(start, getNeighbours, getCost, manhattanHeuristicD), () => AStar.FindPath(start, getNeighbours, getCost, manhattanHeuristicD, p => p.Equals(end)) },
};
int choice = 0;
while (choice != 10)
{
Console.Clear();
Console.WriteLine("Choose traversal algorithm :");
foreach (var algorithm in algorithms)
{
Console.WriteLine($"\t{algorithm.Key} - {algorithm.Value.Item1}");
}
while (choice == 0)
{
int.TryParse(Console.ReadLine(), out choice);
}
var currentMaze = MAZE;
var result = algorithms[choice].Item2();
var path = algorithms[choice].Item3().ToList();
var visited = new List <Point>();
foreach (var item in result)
{
visited.Add(item);
var lines = currentMaze.Split(new[] { Environment.NewLine }, StringSplitOptions.None);
var line = lines[item.Y].ToCharArray();
line[item.X] = '*';
lines[item.Y] = new string(line);
currentMaze = string.Join(Environment.NewLine, lines);
DisplayMaze(currentMaze, visited.Count, 0, 0, algorithms[choice].Item1);
Thread.Sleep(millisecondsTimeout);
if (item == end)
{
break;
}
}
foreach (var item in path)
{
var lines = currentMaze.Split(new[] { Environment.NewLine }, StringSplitOptions.None);
var line = lines[item.Y].ToCharArray();
line[item.X] = '+';
lines[item.Y] = new string(line);
currentMaze = string.Join(Environment.NewLine, lines);
}
var pathcost = path.Aggregate(0, (current, point) => current + getCost(Point.Empty, point));
DisplayMaze(currentMaze, visited.Count(), path.Count(), pathcost, algorithms[choice].Item1);
choice = 0;
Console.WriteLine();
Console.WriteLine($"Press any key to reset");
Console.Read();
}
}
