Perfect knowledge revisited

Dekker, S.T.; Herik, H.J. van den; Herschberg, I.S.

doi:10.1016/0004-3702(90)90074-a

Cited by 5 publications

(5 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…If not, SY (k-)fails on P and SY risks a draw claim on any positions from which Y-optimal play can arrive at P. Let σ denote any move-subsetting strategy. If SY succeeds on P, SYσ succeeds on P. However, as position Q-NN2 of (Dekker, 1990). max DTM pos.…”

Section: Gz Gc Gm Grmentioning

confidence: 99%

“…Below is a list of known endgames with k-wins for k > 50 (Thompson, 1986(Thompson, , 2000Van den Herik et al, 1987;Stiller, 1989Stiller, , 1991Stiller, , 1992Stiller, , 1996Dekker, Van den Herik and Herschberg, 1990;Hyatt, 2000;Lincke, 2000;Nalimov, 2000;Tamplin, 2000). Obtrusive forces are in italics: mxR is in brackets.…”

Section: Endgames Deeper Than 50 Movesmentioning

confidence: 99%

“…The maximal KNNKP position mxNN-P1(Dekker, Van den Herik and Herschberg, 1990) leads by MC-CM play to NN-P2 after 24. ... h4.…”

mentioning

confidence: 99%

See 2 more Smart Citations

Strategies for Constrained Optimisation

Haworth

2000

ICG

View full text Add to dashboard Cite

The latest 6-man chess endgame results confirm that there are many deep forced mates beyond the 50-move rule. Players with potential wins near this limit naturally want to avoid a claim for a draw: optimal play to current metrics does not guarantee feasible wins or maximise the chances of winning against fallible opposition. A new metric and further strategies are defined which support players' aspirations and improve their prospects of securing wins in the context of a k-move rule.

show abstract

Section: Gz Gc Gm Grmentioning

confidence: 99%

Section: Endgames Deeper Than 50 Movesmentioning

confidence: 99%

See 1 more Smart Citation

Strategies for Constrained Optimisation

Haworth

2000

ICG

View full text Add to dashboard Cite

show abstract

“…Making such a function efficient can save a significant amount of space in the database. 28,29 The function we used consists of two parts: (1) a function to transform the pieces on the board to a number, independent of the color of a piece and (2) a function to convert the order of black and white pieces to a number. The combined index function identifies uniquely all possible board positions disregarding symmetry.…”

Section: Retrograde Analysismentioning

confidence: 99%

Best Play in Fanorona Leads to Draw

Schadd

Winands

Uiterwijk

et al. 2008

New Math. and Nat. Computation

View full text Add to dashboard Cite

Fanorona is the national board game of Madagascar. The game's complexity is approximately the same as that of checkers. In this article, we present a search-based approach for weakly solving this game. It is a well-chosen combination of Proof-Number search and endgame databases. Retrograde analysis is used to generate the endgame databases in which every position with 7 or fewer pieces on the board has been solved. Then, a Proof-Number search variant, P N 2 , exploits the databases to prove that the game-theoretical value of the initial position is a draw. Future research should develop techniques for strongly solving the game.

show abstract

“…This function has to be a one-to-one mapping. Making such a function efficient can save a significant amount of space in the database (Dekker, Van den Herik, and Herschberg, 1990;Lake, Schaeffer, and Lu, 1994). The function we used consists of two parts: (1) a function to transform the pieces on the board to a number, independent of the color of a piece and (2) a function to convert the order of black and white pieces to a number.…”

Section: Retrograde Analysismentioning

confidence: 99%

Selective search in games of different complexity

Schadd

View full text Add to dashboard Cite

People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website.• The final author version and the galley proof are versions of the publication after peer review.• The final published version features the final layout of the paper including the volume, issue and page numbers. Link to publication General rightsCopyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights.• Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication in the public portal.If the publication is distributed under the terms of Article 25fa of the Dutch Copyright Act, indicated by the "Taverne" license above, please follow below link for the End User Agreement:

show abstract

Perfect knowledge revisited

Cited by 5 publications

References 8 publications

Strategies for Constrained Optimisation

Strategies for Constrained Optimisation

Best Play in Fanorona Leads to Draw

Selective search in games of different complexity

Contact Info

Product

Resources

About