This is a temporary, read-only recovery of the chessprogrammingwiki while a longer-term plan is worked out. Editing is not possible right now, but will be again soon.
Chess Programming Wiki All pages Other namespaces

Patzer

Home * Engines * Patzer

Patzer,
a Chess Engine Communication Protocol compatible chess engine by Roland Pfister, later versions were UCI compliant, featuring a parallel search and own endgame bitbases, and were able to play Chess960 1. Patzer is famous for solving the Behting Study 2 3 and a special draw heuristic for checking sequences. Patzer was available as Young Talent by ChessBase running under the Fritz6 GUI 4.

Contents
  1. Tournament Play
  2. Descriptions
    1. 1997
    2. 1999
  3. Photos
  4. See also
  5. Namesake
  6. Forum Posts
    1. 1998 ...
    2. 2000 ...
    3. 2010 ...
    4. 2020 ...
  7. External Links
    1. Chess Engine
    2. Misc
  8. References

Tournament Play

Patzer played the WMCCC 1996 in Jakarta, the WMCCC 1997 in Paris, the WCCC 1999 in Paderborn, and the Chess960CWC 2005 and Chess960CWC 2006 in Mainz. Further, Patzer was active over the board at IPCCCs, the 5th Spanish Open Computer Chess Championship, Dutch Open Computer Chess Championships, International CSVN Tournaments, and the BELCT 2001.

Descriptions

5

1997

Patzer uses state of the art methods as minimal windowhash tableshistory tablestatic exchange evaluation with bitboards, various extensionsrecursive 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 Thompson's 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 DOSWindows, 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 DOSWindows, OS/2 and Unix

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

Photos

Patzer team Frank Quisinsky and Roland Pfister at ICT 2001 6

See also

Namesake

Forum Posts

1998 ...

2000 ...

2010 ...

2020 ...

Chess Engine

Misc

patzer - Wiktionary

References

Up one Level


  1. Patzer 3.80, Wayback Machine↩︎

  2. Meet the Authors - PATZER, Roland Pfister hosted by Ed Schröder↩︎

  3. Re: Position solved by Roland Pfister, CCC, October 14, 2002↩︎

  4. Support - ChessBase, May 28th, 2000 (dead link)↩︎

  5. Patzer's ICGA Tournaments↩︎

  6. 1st International CSVN-Tournament 2001 by Thomas Mayer, ICT 2001↩︎

  7. Bobby Fischer (1969). My 60 Memorable Games. Simon & Schuster↩︎

Categories: XBoard · WinBoard · ChessBase · X86 · X64 · PC · Linux · Windows · Chess960

What links here

Contributors: GerdIsenberg.