25,161
edits
Changes
Created page with "'''Home * Engines * Endspiel''' '''Endspiel''',<br/> a Windows chess program and explanation tool dedicated for simple Endgames, written by..."
'''[[Main Page|Home]] * [[Engines]] * Endspiel'''
'''Endspiel''',<br/>
a [[Windows]] chess program and explanation tool dedicated for simple [[Endgame|Endgames]], written by [[Wilhelm Barth]].
Endspiel combines rule-based [[Knowledge|knowledge]] with a modified [[Alpha-Beta|alpha-beta]] search to generate explanations.
The rules cover a large part of the positions of an endgame. For each such position they define a [[Score|score]] interval guaranteed to contain the true value.
Multiple rules may be applied, resulting in the intersection and narrowing of intervals.
Further, an [[Alpha-Beta|alpha-beta]] search finds the values for all positions not covered and removes uncertainties
left by too wide intervals in rule-scored positions. Thus, the method yields a correct evaluation for every position and.
furthermore, the rules governing the position of its successors provide some tutorial insight to the user about the reasons behind the evaluations.
Moreover, automatic validation assures that mistakes in the rules will be discovered and then can be eliminated in dialogue
<ref>[[Wilhelm Barth]] ('''1995'''). ''Combining Knowledge and Search to Yield Infallible Endgame Programs A study of passed Pawns in the KPKP endgame.'' [[ICGA Journal#18_3|ICCA Journal, Vol. 18, No. 3]]</ref>.
=Rules=
For a specific endgame, e.g. [[KPK]], KQKQ, [[Queen versus Pawn|KQKP]], or [[KPKP]],
a system of rules is developed, which decides for the positions whether they are won, drawn or lost. The remainder of the positions may be left undecided.
The rules may be arranged by [https://en.wikipedia.org/wiki/Decision_tree decision trees] <ref>[[Ross Quinlan]] ('''1983'''). ''[https://link.springer.com/chapter/10.1007/978-3-662-12405-5_15 Learning Efficient Classification Procedures and Their Application to Chess End Games]''. [https://link.springer.com/book/10.1007%2F978-3-662-12405-5 Machine Learning: An Artificial Intelligence Approach]</ref> <ref>[[Gerhard Mehlsam]], [[Hermann Kaindl]], [[Wilhelm Barth]] ('''1991'''). ''[https://link.springer.com/chapter/10.1007/978-3-662-02711-0_6 Feature Construction during Tree Learning]''. [https://dblp.uni-trier.de/db/conf/ki/gwai91.html GWAI 1991]</ref>,
or they may be examined sequentially until applicable to the position involved <ref>[[Jaap van den Herik]] ('''1983'''). ''[https://www.semanticscholar.org/paper/Representation-of-Experts'-Knowledge-in-a-Subdomain-Herik/5f29c029a69f2d69980da4b35402050203421ed4 Representation of Experts' Knowledge in a Subdomain of Chess Intelligence]''. [[Conferences#IJCAI1983|IJCAI 1983]]</ref>.
The rules consist of conditions to match and associated [[Score|score]] intervals which may express some uncertainty.
A winning position obtains the value of (maxval - k), where maxval is a huge positive integer, i.e. minus [[Checkmate#MateScore|mate score]], and k the minimum of
* number of plies on the shortest path to [[Checkmate|mate]], and
* minimal number of plies ending with an irreversible move on the winning path
For instance in [[KPK]] (BTM), the case of [[Opposition|opposition]] on the same file, white king on the [[Stop Square|stop square]],
the interval is defined by <nowiki>value[maxval-8, maxval-4]</nowiki>.
=KPKP=
In his 1995 [[ICGA Journal#18_3|ICCA Journal]] article on KPKP with [[Passed Pawn|passed pawns]] <ref>[[Wilhelm Barth]] ('''1995'''). ''Combining Knowledge and Search to Yield Infallible Endgame Programs A study of passed Pawns in the KPKP endgame''. [[ICGA Journal#18_3|ICCA Journal, Vol. 18, No. 3]]</ref>,
Wilhelm Barth elaborates on following six rules applied in his Endspiel program, along with several examples.
{| class="wikitable"
! #
! Description
! Conditions
! Assessment
|-
| 1
| wP can promote without support of<br/>its king and bP is blocked
| ♚∉[[Rule of the Square|□]] ∧ ♔∈[[Pawn Spans|⤋]]
| White wins
|-
| <span id="R2"></span> 2
| wK stops bP definitely
| ♔∈[[Rule of the Square|■]] ∧ ([[Distance|D (♔,♟)]] < [[Distance|D (♚,♟)]] ∨ [[Distance|D (♔]],[[Stop Square#Tele|🛑)]] < [[Distance|D (♚]],[[Stop Square#Tele|🛑)]])
| White achieves at least a draw
|-
| 3
| wp reaches promotion before bP does
| 𝒘 ::= [[Distance|D (♙]],[[Promotion Square|♕)]] - [[Distance|D (♟]],[[Promotion Square|♛)]]<br/>
𝒘 >= 3 usually wins, but 8/3K4/4P3/5p2/8/8/8/5k2 w - -<br/>
𝒘 == 2 usually wins, but [[Queen versus Pawn|rook and bishop pawn cases]]<br/>
𝒘 == 1 often wins, but more exceptions with other pawn files<br/>
𝒘 == 0 normally draw, but some [[Skewer|skewer]] cases that win<br/>
𝒘 == -1 despite exceptional drawn positions,<br/> left without evaluation<br/>
| White wins or achieves a draw depending<br/>on 𝒘 and some other conditions
|-
| 4
| wk stops bP definitely after wP<br/>has attracted the bK
| (𝒘 > 0 ∨ (𝒘 == 0 ∧ ♟[[Promotion Square|♛]]![[Check|+]])) ∧ ♚∈[[Rule of the Square|□]] ⇒ [[#R2|rule 2]]
| White achieves at least a draw
|-
| 5
| with support of its King, wP promotes<br/>before bP does
| conditions similar to rule 3
| White wins or achieves a draw depending<br/>on 𝒘 and some other conditions
|-
| 6
| bP is unstoppable and bK stops wP<br/>and wK cannot parry both threats
| addresses [[Réti Endgame Study]]
| Black wins
|}
Symbols:
* ∧ - and
* ∨ - or
* ∈ / ∉ - Element of / Not Element of
* ■, □ - [[Rule of the Square|Square of The White, Black Pawn]]
* ⤋ - Black [[Pawn Spans|Pawn's Front Span]]
* D - [[Distance|Chebyshev Distance]]
* 🛑 - Black Pawn's [[Stop Square#Tele|Tele Stop]]
* ♕ / ♛ - White / Black Pawn's [[Promotion Square|Promotion Square]]
* !+ - No [[Check]] after Queening
=See also=
* [[Chunker]]
* [[Queen versus Pawn|KQKP]]
* [[KPK]]
* [[Pawn Endgame]]
=Selected Publications=
* [[Wilhelm Barth]], [[Stephan Barth]] ('''1991'''). ''Programme für korrekte Schachendspiele und deren Validierung''. Institutsbericht, Nr. 34. Institut für Computergraphik, [[Vienna University of Technology|TU Wien]] (German)
* [[Wilhelm Barth]], [[Stephan Barth]] ('''1992'''). ''Validating a Range of Endgame Programs''. [[ICGA Journal#15_3|ICCA Journal, Vol. 15, No. 3]] <ref>[[Ulrich Thiemonds]] ('''1999'''). ''Ein regelbasiertes Spielprogramm für Schachendspiele''. [https://en.wikipedia.org/wiki/University_of_Bonn University of Bonn], Diplom thesis (German)</ref>
* [[Wilhelm Barth]] ('''1994'''). ''Computerschach - Ein korrektes Programm für das Endspiel König und Bauer gegen König und Bauer - Unterteilung von Endspielen in Klassen - Behandlung der Stellungswiederholung bei der Intervallbewertung''. Institutsbericht Nr. 36, Institut für Computergraphik, [[Vienna University of Technology|TU Wien]] (German)
* [[Wilhelm Barth]] ('''1995'''). ''Combining Knowledge and Search to Yield Infallible Endgame Programs A study of passed Pawns in the KPKP endgame.'' [[ICGA Journal#18_3|ICCA Journal, Vol. 18, No. 3]]
* [[Steven Edwards]] ('''1995'''). ''Comments on Barth’s Article “Combining Knowledge and Search to Yield Infallible Endgame Programs.”'' [[ICGA Journal#18_4|ICCA Journal, Vol. 18, No. 4]]
* [[Heinz Herbeck]], [[Wilhelm Barth]] ('''1996'''). ''An Explanation Tool for Chess Endgames Based on the Rule Method''. [[ICGA Journal#19_2|ICCA Journal, Vol. 19, No. 2]]
=External Links=
* [https://idw-online.de/de/news4179 Neues Schachprogramm für Spezialprobleme], October 28, 1996 (German)
* [https://web.archive.org/web/20130612090002/https://www.ads.tuwien.ac.at/research/Chess.html Computer Chess site (Barth, Herbeck)] ([https://en.wikipedia.org/wiki/Wayback_Machine Wayback Machine])
=References=
<references />
'''[[Engines|Up one level]]'''
[[Category:PC]]
[[Category:Windows]]
'''Endspiel''',<br/>
a [[Windows]] chess program and explanation tool dedicated for simple [[Endgame|Endgames]], written by [[Wilhelm Barth]].
Endspiel combines rule-based [[Knowledge|knowledge]] with a modified [[Alpha-Beta|alpha-beta]] search to generate explanations.
The rules cover a large part of the positions of an endgame. For each such position they define a [[Score|score]] interval guaranteed to contain the true value.
Multiple rules may be applied, resulting in the intersection and narrowing of intervals.
Further, an [[Alpha-Beta|alpha-beta]] search finds the values for all positions not covered and removes uncertainties
left by too wide intervals in rule-scored positions. Thus, the method yields a correct evaluation for every position and.
furthermore, the rules governing the position of its successors provide some tutorial insight to the user about the reasons behind the evaluations.
Moreover, automatic validation assures that mistakes in the rules will be discovered and then can be eliminated in dialogue
<ref>[[Wilhelm Barth]] ('''1995'''). ''Combining Knowledge and Search to Yield Infallible Endgame Programs A study of passed Pawns in the KPKP endgame.'' [[ICGA Journal#18_3|ICCA Journal, Vol. 18, No. 3]]</ref>.
=Rules=
For a specific endgame, e.g. [[KPK]], KQKQ, [[Queen versus Pawn|KQKP]], or [[KPKP]],
a system of rules is developed, which decides for the positions whether they are won, drawn or lost. The remainder of the positions may be left undecided.
The rules may be arranged by [https://en.wikipedia.org/wiki/Decision_tree decision trees] <ref>[[Ross Quinlan]] ('''1983'''). ''[https://link.springer.com/chapter/10.1007/978-3-662-12405-5_15 Learning Efficient Classification Procedures and Their Application to Chess End Games]''. [https://link.springer.com/book/10.1007%2F978-3-662-12405-5 Machine Learning: An Artificial Intelligence Approach]</ref> <ref>[[Gerhard Mehlsam]], [[Hermann Kaindl]], [[Wilhelm Barth]] ('''1991'''). ''[https://link.springer.com/chapter/10.1007/978-3-662-02711-0_6 Feature Construction during Tree Learning]''. [https://dblp.uni-trier.de/db/conf/ki/gwai91.html GWAI 1991]</ref>,
or they may be examined sequentially until applicable to the position involved <ref>[[Jaap van den Herik]] ('''1983'''). ''[https://www.semanticscholar.org/paper/Representation-of-Experts'-Knowledge-in-a-Subdomain-Herik/5f29c029a69f2d69980da4b35402050203421ed4 Representation of Experts' Knowledge in a Subdomain of Chess Intelligence]''. [[Conferences#IJCAI1983|IJCAI 1983]]</ref>.
The rules consist of conditions to match and associated [[Score|score]] intervals which may express some uncertainty.
A winning position obtains the value of (maxval - k), where maxval is a huge positive integer, i.e. minus [[Checkmate#MateScore|mate score]], and k the minimum of
* number of plies on the shortest path to [[Checkmate|mate]], and
* minimal number of plies ending with an irreversible move on the winning path
For instance in [[KPK]] (BTM), the case of [[Opposition|opposition]] on the same file, white king on the [[Stop Square|stop square]],
the interval is defined by <nowiki>value[maxval-8, maxval-4]</nowiki>.
=KPKP=
In his 1995 [[ICGA Journal#18_3|ICCA Journal]] article on KPKP with [[Passed Pawn|passed pawns]] <ref>[[Wilhelm Barth]] ('''1995'''). ''Combining Knowledge and Search to Yield Infallible Endgame Programs A study of passed Pawns in the KPKP endgame''. [[ICGA Journal#18_3|ICCA Journal, Vol. 18, No. 3]]</ref>,
Wilhelm Barth elaborates on following six rules applied in his Endspiel program, along with several examples.
{| class="wikitable"
! #
! Description
! Conditions
! Assessment
|-
| 1
| wP can promote without support of<br/>its king and bP is blocked
| ♚∉[[Rule of the Square|□]] ∧ ♔∈[[Pawn Spans|⤋]]
| White wins
|-
| <span id="R2"></span> 2
| wK stops bP definitely
| ♔∈[[Rule of the Square|■]] ∧ ([[Distance|D (♔,♟)]] < [[Distance|D (♚,♟)]] ∨ [[Distance|D (♔]],[[Stop Square#Tele|🛑)]] < [[Distance|D (♚]],[[Stop Square#Tele|🛑)]])
| White achieves at least a draw
|-
| 3
| wp reaches promotion before bP does
| 𝒘 ::= [[Distance|D (♙]],[[Promotion Square|♕)]] - [[Distance|D (♟]],[[Promotion Square|♛)]]<br/>
𝒘 >= 3 usually wins, but 8/3K4/4P3/5p2/8/8/8/5k2 w - -<br/>
𝒘 == 2 usually wins, but [[Queen versus Pawn|rook and bishop pawn cases]]<br/>
𝒘 == 1 often wins, but more exceptions with other pawn files<br/>
𝒘 == 0 normally draw, but some [[Skewer|skewer]] cases that win<br/>
𝒘 == -1 despite exceptional drawn positions,<br/> left without evaluation<br/>
| White wins or achieves a draw depending<br/>on 𝒘 and some other conditions
|-
| 4
| wk stops bP definitely after wP<br/>has attracted the bK
| (𝒘 > 0 ∨ (𝒘 == 0 ∧ ♟[[Promotion Square|♛]]![[Check|+]])) ∧ ♚∈[[Rule of the Square|□]] ⇒ [[#R2|rule 2]]
| White achieves at least a draw
|-
| 5
| with support of its King, wP promotes<br/>before bP does
| conditions similar to rule 3
| White wins or achieves a draw depending<br/>on 𝒘 and some other conditions
|-
| 6
| bP is unstoppable and bK stops wP<br/>and wK cannot parry both threats
| addresses [[Réti Endgame Study]]
| Black wins
|}
Symbols:
* ∧ - and
* ∨ - or
* ∈ / ∉ - Element of / Not Element of
* ■, □ - [[Rule of the Square|Square of The White, Black Pawn]]
* ⤋ - Black [[Pawn Spans|Pawn's Front Span]]
* D - [[Distance|Chebyshev Distance]]
* 🛑 - Black Pawn's [[Stop Square#Tele|Tele Stop]]
* ♕ / ♛ - White / Black Pawn's [[Promotion Square|Promotion Square]]
* !+ - No [[Check]] after Queening
=See also=
* [[Chunker]]
* [[Queen versus Pawn|KQKP]]
* [[KPK]]
* [[Pawn Endgame]]
=Selected Publications=
* [[Wilhelm Barth]], [[Stephan Barth]] ('''1991'''). ''Programme für korrekte Schachendspiele und deren Validierung''. Institutsbericht, Nr. 34. Institut für Computergraphik, [[Vienna University of Technology|TU Wien]] (German)
* [[Wilhelm Barth]], [[Stephan Barth]] ('''1992'''). ''Validating a Range of Endgame Programs''. [[ICGA Journal#15_3|ICCA Journal, Vol. 15, No. 3]] <ref>[[Ulrich Thiemonds]] ('''1999'''). ''Ein regelbasiertes Spielprogramm für Schachendspiele''. [https://en.wikipedia.org/wiki/University_of_Bonn University of Bonn], Diplom thesis (German)</ref>
* [[Wilhelm Barth]] ('''1994'''). ''Computerschach - Ein korrektes Programm für das Endspiel König und Bauer gegen König und Bauer - Unterteilung von Endspielen in Klassen - Behandlung der Stellungswiederholung bei der Intervallbewertung''. Institutsbericht Nr. 36, Institut für Computergraphik, [[Vienna University of Technology|TU Wien]] (German)
* [[Wilhelm Barth]] ('''1995'''). ''Combining Knowledge and Search to Yield Infallible Endgame Programs A study of passed Pawns in the KPKP endgame.'' [[ICGA Journal#18_3|ICCA Journal, Vol. 18, No. 3]]
* [[Steven Edwards]] ('''1995'''). ''Comments on Barth’s Article “Combining Knowledge and Search to Yield Infallible Endgame Programs.”'' [[ICGA Journal#18_4|ICCA Journal, Vol. 18, No. 4]]
* [[Heinz Herbeck]], [[Wilhelm Barth]] ('''1996'''). ''An Explanation Tool for Chess Endgames Based on the Rule Method''. [[ICGA Journal#19_2|ICCA Journal, Vol. 19, No. 2]]
=External Links=
* [https://idw-online.de/de/news4179 Neues Schachprogramm für Spezialprobleme], October 28, 1996 (German)
* [https://web.archive.org/web/20130612090002/https://www.ads.tuwien.ac.at/research/Chess.html Computer Chess site (Barth, Herbeck)] ([https://en.wikipedia.org/wiki/Wayback_Machine Wayback Machine])
=References=
<references />
'''[[Engines|Up one level]]'''
[[Category:PC]]
[[Category:Windows]]
