One of the classic games was simply redeveloped with the familiar mechanics: The player controls the yellow figure called Pac-Man and the four ghosts (Shadow, Speedy, Bashful and Pokey) are the enemies. The goal is to collect all yellow points on the map without running into one of the ghosts. The focus here was to implement the behavior of the ghosts and as an extension an artificial intelligence for Pac-Man was also built in. Therefore it is possible to switch between a manual control and the automatic game play. Each of the ghosts has another strategy to catch Pac-Man, which is related to their names.
The game was developed with C++ and the game SDK ClanLib. The source code can be found on GitHub.
This application shows, how to find the optimal path from one point to another with the help of the A* search. In doing so, the type of territory and the enemies moving on a two dimensional map are taken into consideration by calculating way costs for each field. On the picture you find the white point as start and the violet point as the target position. The big red points are visualizing enemies with their range as small red points. The hexagonal fields of the mapped are colored, for showing different types of territory: light green = grass, dark green = wood, blue = water and brown = mountain. Finally the orange points show the best possible solution for reaching the target and avoiding enemies.
It was developed with C++ and the game SDK ClanLib. The source code can be found on GitHub.
The classic four connected game: the player (red color) and a computer controlled enemy (white color) throw alternately tokens into the different columns of the game. The first one with four tokens in a row (vertical, horizontal or diagonal) wins the game. The difficulty here was to build an artificial intelligence combining three techniques: Negamax search, Alpha-beta pruning and a heuristic evaluation.
Four Connected was developed with C++ and the game SDK ClanLib. The source code can be found on GitHub.