Author: Colin Frayn
Date: 02:31:34 06/12/00
Go up one level in this thread
On June 11, 2000 at 22:18:41, Ricardo Gibert wrote: >How about this version: > >1. Alpha-Beta search Algotihm > >2. Iterative Deepening > >3. Transposition Tables > >4. Null Move Pruning > >5. Killers/History > >6. Aspiration Search > >7. Bitboards > >8. Endgame Tablebases (Thompson/Edwards/Nalimov) > >9. Tim Mann's Winboard > >10. Robert Hyatt's source listing of Crafty That's pretty close to mine. I have two lists; (BTW - I presume we're taking negamax search for granted? ;) ) (1) The overall most important algorithms etc... 1. A-B Search 2. Iterative Deepening 3. Transposition Tables 4. Opening Books 5. Killers & History 6. Null Move 7. Selective Search Extensions 8. Aspiration/PV Search 9. Endgame Tablebases 10.Bitboards (2) Most important for me & my chess program; 1. A-B Search 2. Iterative deepening 3. Transposition tables 4. Opening books 5. Killer & History 6. Quiescence Search Extensions 7. Transposition Search 8. PV Search 9. Preliminary Move Analysis (for mate testing) 10.EPD test suites (no, really....) Though of course it's completely impossible to rank some of these as they're all totally vital, e.g. Negamax search (which I didn't even mention) and AB Search and Iterative deepening. It's impossible to write a chess program of any appreciable standard without all the above (or some similar variants). Cheers, Col
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.