A* Simulation

Quite a demonstration of the A* algorithm and my ability.

This simulator was an assignment for Artificial Intelligence for Games. Not only does this simulator do A* with the 3 key, it also does two different pathfinding algorithms. 

Keypad 1: First bot, algorithm created to pick a possible cardinal position and move to it.

Keypad 2: Second bot, algorithm created to walk until a wall it hit, then decides to pick a new cardinal position and rinse/repeat.

Keypad 3: Third bot: algorithm created to pick the most efficient path via A*

This assignment taught me about the importance of knowing how to program and the best way of doing so via O.O.P. Furthermore, it has shown me the way of creating an algorithm by using what I've learned in data structures and that in itself is powerful.

I specifically choose this topic because I felt proud that after three long days, I've got an algorithm working and debugging by using primitives. These primitives are particularly strong because it shows exactly where the bot tried to go and how it's backtracking! I absolutely love it in all honestly.

The usefulness of this is far too great. The main lessons learned include basic things like: come up with a class diagram before tackling a difficult algorithm and create more class utilities such that the code becomes shorter. A* happens to be one of the most difficult algorithms to study and I've tackled this problem myself with my own code that I could easily place into a library--with my name on it!