Home * Engines * Gustav

a program for solving orthodox chess problems by Olaf Jenkner, written in Delphi [1], program texts and manual available in German only. Initially developed since 1990 for the MS-DOS operating system in Pascal, Gustav was later ported and improved to run under Windows. Gustav is able to solve checkmate, stalemate, helpmate, helpstalemate, selfmate and selfstalemate in N moves. It has a dedicated GUI with various dialogs to edit positions, to load and save FEN or proprietary GST-files of problem collections, and to control the search. Beside brute-force search accelerated by a transposition table, several automatic or user defined constraints such as number of escape squares for the checked king, allow shallow and deep searches of up to 170 moves (339 plies). The longest for Gustav solvable problem so far has 163 moves, a composition by Ottó Titusz Bláthy [2]:

external image 4N1N1%20w%20-%20-&size=large&coord=yes&cap=no&stm=yes&fb=no&theme=classic&color1=E3CEAA&color2=635147&color3=000000
K7/p3p1p1/1p2p1p1/rp4B1/brpn4/Rnk5/8/4N1N1 w - -

See also

Forum Posts

External Links

Chess Program



  1. ^ Delphi/Kylix Compiler by Olaf Jenkner, CCC, March 14, 2001
  2. ^ Gustav 3.2 from Schachversand Niggemann (German)

What links here?

Up one level