Welcome to Fast Fortress
Why Fast Fortress? because the algorithm has been improved,
using a special version of iterative deepening, heuristic
cut, a FastEnd to search the end with a good depth...
it includes xfortress 2.0.0 and
a way to generate brains using a genetic algorithm.
Some functions are optimized and are quite ugly ;)
The "brain" used in this version (seedfor-21.brn) has been
calculated, you may find a better one (or create a better one by
enhancing the "evolve" stuff (must be easy to upgrade, i didn't
have time to do that).
Compilation options:
use -DNOMEMCPY to use inlined copy (faster or slower than a
memcpy call, machine dependant).
use -DNO_ADD_SCORE for an older version of fortress AI
use -DADD_RANDOM to select randomly between the equivalent moves.
use -DNOCUT to keep searching the best move during FastEnd,
otherwise, it will only find a winning position.
(really slower on high depths)
use -DSILENT to remove the prediction of the end score.
Enjoy!
Yves Lafon <lafon@w3.org>
PS: Thanks to Adam Przezdziecki <adamp@math.uchicago.edu> for
testing and the "last played square" patch.
|
