Author: Pham Minh Tri
Date: 17:01:31 10/24/00
Hi, In the book "Scalable Search in Computer Chess" you listed the move-ordering scheme as following: 1. hashed move 2. good capture moves 3. killer moves 4. history moves, 5. statically pre-sorted remaining moves 6. bad capture moves. My question are: 1. How about pv move? Do you install them into hash table? If yes, what is benefit (I think if we keep separating pv and hashed moves, we will have more good moves for searching first). 2. How do you divide good and bad capture moves? Are the bad capture moves really "bad" therefore you listed them in the end (I mean they would be higher order)? 3. Could you explain more details about statically pre-sorted remaining moves? Thank you in advance, Pham
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.