URL: https://sourceforge.net/tracker/?fun...atid=1383 661


If chess can do 3-4-5 so easily, why not giventake? This rewrite of my
initial engine actually started with endgame.h (which was then quickly
forgotten and is currently disabled)

A gapless index function should be pretty feasible. From the game
state, all you need is:
1) side_to_move
2) tactical_square
3) this piece must take must be -1 (branching factor is minimal here)
4) captured_piece, promotion, last_pawn are all irrelevant for the
index function so ignore these
5) finally the board[] pieces permutations of course, note that pawns
can only occupy 6 out of the 8 rows.

The actual retrograde algorithm needs to be implemented also, and then
lookups from the search()

Anyone wants to do this?