🚀 go-pugleaf

Markus Bachmayr wrote:
> 
> i am just writing on a computer chess program for my final exams. at the
> moment i am using alpha-beta pruning, minimal window search, killer and
> history heuristics, a transposition table and a rather simple evaluation
> function. i already have to think a bit myself to beat it, but unfortunately
> i also have fairly enough time to do so because it is quite slow - what can
> i do to optimize the speed, and where can i find extensive information about
> mtd(f)?

mtdf reference have been posted in another thread.

As regards speed many of the techniques are just general computing
techniques - these belong in another place.

Both Crafty and GnuChess have open source, and share some techniques
(Some donated by Bob Hyatt from Crafty to GnuChess) - such as some fast
techniques for find the first occupied square (used to locate pieces
during evaluation). But these typically depend on you using a similar
board representation. Still worth a look.