Fast table-driven move generation

Discussion of chess software programming and technical issues.

Moderators: hgm, Rebel, chrisw

User avatar
hgm
Posts: 27811
Joined: Fri Mar 10, 2006 10:06 am
Location: Amsterdam
Full name: H G Muller

Re: Fast table-driven move generation

Post by hgm »

brtzsnr wrote:
Why not just generate moves progressively until you get an alpha-beta cutoff? Saves on generating wasteful moves that only bloat the search tree.
Sorting: Most engines sort the moves in order of their relevance (MVV/LVA or history). Moves cannot be sorted if they are generated one by one.
But you could of course generate the captures in MVV/LVA order. History would be more difficult.