A (hopefully) intelliegent AI that plays Chinese Checkers better than most humans.
Created by Dan.Cruwys@du.edu and Paul.Heinen@du.edu
The neat AgentTester.jar was created by William.Mitchell@du.edu.
Instructor: Dr. Nathan Sturtevant sturtevant@cs.du.edu
TA: Will Mitchell William.Mitchell@du.edu
Course Description: This course covers traditional work in the area of AI for games. Students in the course will learn about the history of AI and games, and the techniques used to create human-level AI for traditional games. Topics include approaches for games of perfect and imperfect information and games with two or more players.
Inside the binaries folder, there are a few differant types of binaries. As of right now, there are only the linux binaries.
Each one represents a differant state of the AI in chronological order:
- heurstic.out, a basic "choose the farthest postion" implentation.
- minimax.out, a greedy minimax function. You can read about minimax here.
- ideepening.out, a interative deepening of the minimax, given ~10s per move. At this point it is not effective.
- alphabeta.out, same as mininmax, but runs much faster.
There are also two binaries for testing:
- ChineseCheckersRandom, chooses a random move.
- ChineseCheckersModerator, contains the rules and decides the winner. This is not a player and only for GameMaster.jar.
There are also two jars in the root folder.
- AgentTester.jar, runs a SINGLE binary agent to test it's moves.
- GameMaster.jar, simulates a game given two player agent binaries and a moderator binary.
To run, select a jar, and then select the binaries for each of the top parameters. AgentTester runs one move at a time, GameMaster simulates automaticly.
You can find more detailed notes on the jars here.