Difference between revisions of "Gustav"
GerdIsenberg (talk | contribs) (Created page with "'''Home * Engines * Gustav''' '''Gustav''',<br/> a program for solving orthodox Chess Problems, Compositions and Studies|chess probl...") |
GerdIsenberg (talk | contribs) |
||
| Line 6: | Line 6: | ||
It has a dedicated [[GUI]] with various dialog windows to edit positions, to load and save [[Forsyth-Edwards Notation|FEN]] or proprietary GST-files of problem collections, and to control the search. | It has a dedicated [[GUI]] with various dialog windows to edit positions, to load and save [[Forsyth-Edwards Notation|FEN]] or proprietary GST-files of problem collections, and to control the search. | ||
Beside [[Brute-Force|brute-force search]] accelerated by a [[Transposition Table|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). | Beside [[Brute-Force|brute-force search]] accelerated by a [[Transposition Table|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). | ||
| + | |||
| + | =Longest Problem= | ||
The longest for Gustav solvable problem so far has 163 moves, a composition by [https://en.wikipedia.org/wiki/Ott%C3%B3_Bl%C3%A1thy Ottó Titusz Bláthy] <ref>[https://www.schachversand.de/en/gustav-4-0-i.html Gustav 4.0] from [[Schachversand Niggemann]] (German)</ref>: | The longest for Gustav solvable problem so far has 163 moves, a composition by [https://en.wikipedia.org/wiki/Ott%C3%B3_Bl%C3%A1thy Ottó Titusz Bláthy] <ref>[https://www.schachversand.de/en/gustav-4-0-i.html Gustav 4.0] from [[Schachversand Niggemann]] (German)</ref>: | ||
Latest revision as of 12:04, 16 May 2019
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 dialog windows 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).
Contents
Longest Problem
The longest for Gustav solvable problem so far has 163 moves, a composition by Ottó Titusz Bláthy [2]:
♔ ♟ ♟ ♟ ♟ ♟ ♟ ♜♟ ♗ ♝♜♟♞ ♖♞♚ ♘ ♘ |
K7/p3p1p1/1p2p1p1/rp4B1/brpn4/Rnk5/8/4N1N1 w - -
See also
- Alybadix
- Checkmate
- Chess Problems, Compositions and Studies
- Chest
- Mate Search
- Popeye
- Proof-Number Search
- Stalemate
Forum Posts
- Can Alybadix or Gustav solve this studies by Uri Blass, CCC, December 10, 1998
- Gustav new version ? by Michael Diosi, CCC, December 11, 1999
- Delphi/Kylix Compiler by Olaf Jenkner, CCC, March 14, 2001
- Gustav by Olaf Jenkner, CCC, December 08, 2003
- Searching for Gustav mate solver by David Dahlem, CCC, August 02, 2011
- Anyone sells Gustav besides Schach Niggemann ? by Dann Corbit, CCC, May 10, 2019
External Links
Chess Program
- GUSTAV - fastest program for orthodox selfmates and moremovers review by Václav Kotěšovec, October 6, 2009
- Gustav 4.0 from Schachversand Niggemann (German)
Misc
References
- ↑ Delphi/Kylix Compiler by Olaf Jenkner, CCC, March 14, 2001
- ↑ Gustav 4.0 from Schachversand Niggemann (German)
