-
Seems to occur when shallow search plays against alphabeta search, but does not seem to occur when either plays against random player.
-
The bots must be benchmarked against each other. We want to know who wins against who. This is going in the report.
The minimax and alphabeta bots are not yet set in stone, so benchmarking them will …
-
Sorry for being MIA so long; but SML finally finished!
I've spent today having a browse through all the code and I gotta say it's looking mighty fine.
Is there anything important left to do before t…
CapnP updated
12 years ago
-
I've spent some considerable time thinking about this, and I can find no reason to keep the threaded alphabeta/negascout functions in the code base. Threading functionality should be handled at a hig…
-
In commit d746891b63ef6c595c3aa641fc6066fd4dd52109.
The example program when run with the parameters `-d 4 2 4` results in a segfault for the moves (1: d1-e1 a5-a4 e5-e4 h4-h5).
The following GDB ou…
-
Right now we have code to do tree search using MiniMax. Once that is tested and optimized we should create an AlphaBeta version.
knhjp updated
15 years ago
-
Migrated from [rt.perl.org#72130](https://rt-archive.perl.org/perl5/Ticket/Display.html?id=72130) (status was 'resolved')
Searchable as RT72130$
p5pRT updated
14 years ago