ktron
A tron clone...
I recently tried a computer opponent for ktron (kde-games):
I started with a shortest path algorithm (implemented - works!) and the following definition: You/The Opponent control a square, if you can reach it (via shortest path), before your opponent can.
I plan to implement a counting of reachable areas via each of the 3 possible moves.
I'm looking for some people that are also interested in writing/trying to write one. Perhaps we could have a small contest and run our programs against each other or compare how they do against a human player.
If you like to participate, download kde-games.tar.gz (kde-homepage), configure, make (only some libs+ktron-directory), edit in tron.cpp/tron.h the function think() which has to call Switchdir
If you like, I can send you what I have until now (mainly the shortest path algorithm); this saves you perhaps some time. <abraendle--at-gmx---dot--de>
My first goal is not to have a algorithm that runs in real time, but that plays as good as possible.
Does a winning strategy exist for one player from the starting position? (e.g. divide the board fast in 2 areas and give the opponent the smaller one)