TalkChess.com

[Bill Henry]

1. How can you get an exact score for each root move? (So you can sort them for the next iteration)
The obvious way is to reset alpha beta to infinity window for each root move, however...this will slow down the search quite a bit...

2. When you do a null widow search and it failed so you have to re-search with a bigger window. Does research mean to go back to the first root move?

3. When implementing SEE, don't you have to considered discover checks? (i.e. pawn can't capture Queen because King is enprise)

Thanks in advance!

Bill
mytopcoder.com/gmol