MIG-21
It is a maze-game I developed after knowing about A* star algorithm. I learned A* star algorithm and took help from here. I loved this algorithm while understanding and implementing it I learned about a lot about Dynamic Programming first time in my life.
About Game
This game is inspired by air-strikers done by Indian Airforce on J-e-M Camps. Therefore, In this game, your initial position is from IAF block/cell, and you have to reach to J-e-M camps with the smallest possible route. There is no undo or Uno reverse card in real life, just like that there is not an option to take your move back. If you mistakenly stepped on the wrong, your path will be not considered as a solution.
Instructions
-
It may happen that your screen will not fit the maze-like the following images attached. In case of such discrepancy, change properties of your .exe file window. Right-click on the title bar and change to appropriate settings.
-
I have developed the numeric-pad movement based on the following structure.
7 8 9 4 5 6 1 2 3 5 - Mark your starting position with 5, if you move forward without marking your initial position it will show wrong answer.
9 - To move to upper right diagonal.
7 - To move to upper left diagonal.
8 - To move upwards.
2 - To move downwards.
1 - To move lower left diagonal.
3 - To move lower right diagonal.
Screenshots
