using System; using System.Threading; //VISUAL STUDIO OR OTHER COMPIELR ONLY //This is an update for A* path finding code,now its a maze with walls //with a display namespace A_star_Maze_Project { class Program { /*This program shows A* path finding in a 18x18 matrix A* path finding shows the fastest way to reach a point (A-->B) The formula for the shortest path : f(x) = g(x) + h(x) Which is the sum of the distance of the point you want to check To the point your'e at and the ending point WORKS IN VISUAL STUDIO */ const int N = 18;//Size of matrix static void Main(string[] args) { place player = new place(0, 0);//start point place end = new place(17, 16);//end point PlayGroundUpdate.DisplayPlayGround(player, end); Start(player, end); } //f(x) = g(x) + h(x) static int FindDistance(place p, place toP, place end) { int f = toP.Dist(p) + toP.Dist(end); return f; } //returns the best place to go to get closer to the ending point static place FindBestPath(place p, place end,ref int last) { int d1 = 999, d2 = 999, d3 = 999, d4 = 999; int smallestD = 999;//smallest distnace that i can get closer to end point int k = 1;//1 : x + 1,2: y + 1,3 : x-1,4 : y-1 if (p.x + 1 < N && !PlayGroundUpdate.CheckIfWall(new place(p.x+1,p.y))) { d1 = FindDistance(p, new place(p.x + 1, p.y), end); if (d1 < smallestD && last != 3) { smallestD = d1; k = 1; } } if (p.y + 1 < N && !PlayGroundUpdate.CheckIfWall(new place(p.x, p.y + 1))) { d2 = FindDistance(p, new place(p.x, p.y + 1), end); if (d2 < smallestD && last != 4) { smallestD = d2; k = 2; } } if (p.x - 1 >= 0 && !PlayGroundUpdate.CheckIfWall(new place(p.x-1, p.y))) { d3 = FindDistance(p, new place(p.x - 1, p.y), end); if (d3 < smallestD && last != 1) { smallestD = d3; k = 3; } } if (p.y - 1 >= 0 && !PlayGroundUpdate.CheckIfWall(new place(p.x, p.y - 1))) { d4 = FindDistance(p, new place(p.x, p.y - 1), end); if (d4 < smallestD && last != 2) { smallestD = d4; k = 4; } } if (k == 1) { last = k; return new place(p.x + 1, p.y); } if (k == 2) { last = k; return new place(p.x, p.y + 1); } if (k == 3) { last = k; return new place(p.x - 1, p.y); } if (k == 4) { last = k; return new place(p.x, p.y - 1); } return p; } static void Start(place p, place end) { string str = ""; int count = 0; // counts number of moves int last = -1; while (!p.Equals(end)) { str += p + "\n"; place toGo = FindBestPath(p, end,ref last); p.x = toGo.x; p.y = toGo.y; PlayGroundUpdate.ChangeWay(p); count++; Thread.Sleep(500); } Console.WriteLine(str); Console.WriteLine(p); Console.WriteLine("count = " + count); Console.WriteLine("Time = " + (double)count / 2 + " seconds"); } } class place { public int x { get; set; } public int y { get; set; } public place(int x, int y) { this.x = x; this.y = y; } public int Dist(place p) // returns distance of two points { int dist = Math.Abs(this.x - p.x) + Math.Abs(this.y - p.y); return dist; } public bool Equals(place p) { return this.x == p.x && this.y == p.y; } public override string ToString() { return "( " + this.x + " , " + this.y + " )"; } } static class PlayGroundUpdate { const int N = 18; static int[,] PlayGround = new int[N, N]; public static void DisplayPlayGround(place start,place end) { ChangeStart(start); ChangeEnd(end); UpdateWalls(); Draw(); } public static void ChangeEnd(place end) { PlayGround[end.x, end.y] = 4; }//update end position public static void ChangeStart(place start) { PlayGround[start.x, start.y] = 1; }//update start postioin public static void ChangeWay(place way) { PlayGround[way.x, way.y] = 2; Draw(); }//update walk places public static void UpdateWalls() { for (int i = 0; i < 7; i++) { PlayGround[1, i] = 3; } for (int i = 0; i < 5; i++) { PlayGround[i, 8] = 3; } for (int i = 2; i < 15; i++) { PlayGround[6, i] = 3; } for (int i = 8; i < 13; i++) { PlayGround[i, 15] = 3; } PlayGround[16, 16] = 3; Draw(); }//update wall places public static void Draw() { Console.SetCursorPosition(0, 0); for (int i = 0; i < PlayGround.GetLength(0); i++) { for (int j = 0; j < PlayGround.GetLength(1); j++) { Console.Write(" " + PlayGround[i, j]); } Console.WriteLine(); } }//draws the playground public static bool CheckIfWall(place p) { return (PlayGround[p.x, p.y] == 3); }//returns if there is a wall in a point } }

Console Maze with walls using A*