MindGuerrillas

In the previous example the first move the search made was to look south-east to node 'j'. This was OK since, luckily, the best path involved going around the bottom of the obstacle and so we were always going in the right direction. What though if there were no way around the...

The next game type I've been working on is the isometric turn-based strategy game. This one is based on a kind of Civilization style game. Again, the game is written in C++ using the SDL libraries. The game runs on Windows, Mac and Linux. The game is still only in very early...

So, how do you get your player from point A to point B without falling off a cliff or climbing over too many mountains? Answer, A* The A* (A-star) search algorithm is used for path finding, the system of finding the least cost route from one point (node) to another. A* is said...

Recently, I've spent some time putting together a Super Mario type game. The game is developed in C++ using the SDL library for graphics and sound handling. This one is loosely based on Super Mario World for SNES. Game rules do not exactly match those of the real game...