Patzer
Team Mitglieder
| Person | Role |
|---|---|
| Roland Pfister | engine programmer |
Teilnehmungen
| Turnier | Teilnehmer | Punktestand | Spiele |
|---|---|---|---|
| Schach, 1999, Paderborn | 30 | 3.0 | 7 |
| Schach, 1997, Paris | 34 | 5.0 | 11 |
| Schach (Blitz), 1997, Paris | 22 | 2.0 | |
| Schach, 1996, Jakarta | 27 | 4.5 | 11 |
| Schach, 1991, Vancouver | 15 | 3.0 | 7 |
| Schach, 1990, Lyon | 12 | 3.0 | 7 |
Descriptions
- Description given in 1999:
Patzer uses the standard alpha-beta PVS search, enhanced by hashtables (4 retries replacement scheme), recursive nullmove (R=2) with verification if only one piece present, special pruning heuristic for ALL-nodes, various extensions. It also uses a special material hash table to adjust the material balance values for certain endgames where the "usual" values do not apply. It values king safety and passed pawns rather high (too high?). It is a incremental bitboard program with attack tables that are also used during move generation and sorting.
- Description given in 1997:
Patzer uses state of the art methods as minimal window, hash tables, history table, static exchange evaluation with bitboards, various extensions, recursive nullmove . It has small databases for KPK and KPKP with blocked pawns to decide if it is a win or not. Additionally it can use Thompsons Endgame CDs at ply 0.
At the moment I am working on including endgame table base support. Patzer has a text interface a well as GUIs for DOS, Windows, OS/2 and X11. It can read/write PGN and EPD files. It has an Interface for Autoplayer232 and for XBoard/WinBoard. It has knowledge of the "wrong" bishop in endgames. A Hypertext User Online Manual is available in German for DOS, Windows, OS/2 and Unix.