public double Evaluate(IChromosome chromosome) { var m = this.maze.Copy(); var genes = chromosome.GetGenes(); var walker = new MazeWalker(m, genes); int repeatedSteps; int closest; var steps = walker.Walk(out repeatedSteps, out closest); if (steps < int.MaxValue) { steps = steps + repeatedSteps; } else { steps -= this.maze.Height * this.maze.Width * 50; // prevent overflow var open = 0; for (int x = 0; x < this.maze.Width; x++) { for (int y = 0; y < this.maze.Height; y++) { if (m[x, y] == Maze.State.Open) { open++; } } } steps += (open * 50) + ((int)closest * 2); } return(-(steps)); }
private static Maze FillMazeStepsWalked(Maze m, IChromosome chromosome) { var winnerSteps = m.Copy(); var w = new MazeWalker(winnerSteps, chromosome.GetGenes()); int repeatedSteps; int closest; w.Walk(out repeatedSteps, out closest); return(winnerSteps); }
private void Run(string mazeFilePath) { // MazeGrid maze = GetMaze(mazeFilePath); // MazeGrid maze = GetMaze2(mazeFilePath); MazeGrid maze = GetMaze3(mazeFilePath); IWalkerStateDumper dumper = new BlandWalkerStateDumper(); // IWalkerStateDumper dumper = new FancyWalkerStateDumper(MazeVisualDumper, maze); var entity = new MazeWalker(maze, dumper); Console.Write(MazeVisualDumper.Dump(maze)); // bool mazeSolved = MazeSolver.SolveMaze(entity, maze.Finish); // TODO: Delete bool mazeSolved = AdvancedMazeSolver.SolveMaze(new MazeWalkerAdapter(entity), maze.Finish); Console.WriteLine(mazeSolved ? "Reached end of maze! :)" : "Failed to reach end of maze. :("); Console.ReadKey(); }