ParSOS
On this page
ParSOS, (Parallel SOS)
the parallel version of Rudolf Huber’s MTD(f) searcher SOS, written in C. ParSOS played the WMCCC 2001, WCCC 2002, WCCC 2003, WCCC 2004 and the WCCC 2006 World Microcomputer Chess and World Computer Chess Championships, the Chess960CWC 2005 and Chess960CWC 2006 Livingston Chess960 Computer World Championships, and the IPCCC 2004 and IPCCC 2007. According to a CCC discussion with Dieter Bürßner [1] and Vincent Diepeveen [2] involved, ParSOS uses a kind of ABDADA to parallelize MTD(f), utilizing a Shared Hash Table.
Forum Posts
- Parallel algorithms in chess programming by Dieter Bürßner, CCC, April 16, 2001 » ABDADA, Parallel Search
- CI 89 and Combinations from Graz 2003 - Parsos/DJ & List/Shredder by Mike Byrne, May 08, 2004
External Links
- SOS’ ICGA Tournaments includes ParSOS
- The chess games of ParSOS from chessgames.com
- Interview with SOS programmer Rudolf Huber in German language! by Frank Quisinsky, Arena Chess GUI 3.0 - Archive 9, 132, May 10, 2005 ( Wayback Machine)
References
- ↑ Parallel algorithms in chess programming by Dieter Bürßner, CCC, April 16, 2001
- ↑ Re: Parallel algorithms in chess programming by Vincent Diepeveen, CCC, April 16, 2001
- ↑ Brutus auf WM-Kurs? by Peter Schreiner, Images by Matthias Wüllenweber, ChessBase News, November 24, 2003 (German)
- ↑ WCCC (4) ParSOS vs Hossa (1-0) PGN by Kurt Utzinger, CCC, November 24, 2003