Movatterモバイル変換


[0]ホーム

URL:


University of Reading

CentAUR: Central Archive at the University of Reading

Accessibility navigation


Strategies for Constrained Optimisation

Add to AnyAdd to TwitterAdd to FacebookAdd to LinkedinAdd to PinterestAdd to Email

Haworth, G. M.ORCID: https://orcid.org/0000-0001-9896-1448 (2000)Strategies for Constrained Optimisation. ICGA Journal, 23 (1). pp. 9-20. ISSN 1389-6911

[img]
Preview
Text - Published Version
· Please see ourEnd User Agreement before downloading.

498kB

It is advisable to refer to the publisher's version if you intend to cite from this work. SeeGuidance on citing.

Official URL:http://ticc.uvt.nl/icga/journal/

Abstract/Summary

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.

Item Type:Article
Refereed:Yes
Divisions:Science
ID Code:4566
Uncontrolled Keywords:chess, depth, endgame, metrics, optimisation, strategies
Publisher:The International Computer Games Association

Downloads

Downloads per month over past year

Date Deposited:01 Jul 2010 18:53Date item deposited into CentAUR
Last Modified:25 Jan 2024 03:41Date item last modified
ChessBase (2000). http://www.chessbase.com/. CD publisher of Nalimov and Thompson endgame tables. ChessLab (2000). http://chesslab.com/. Database of 2 million games dating from 1485. Croskill (1864). The rook and bishop against rook. The Chess Player’s Magazine, Vol. 2, pp. 305-311. Dekker, S.T., Herik, H.J. van den and Herschberg, I.S. (1990). Perfect Knowledge Revisited. Artificial Intelli-gence, Vol. 43, No. 1, pp. 111-123. Herik, H.J. van den, Herschberg, I.S. and Nakad, N. (1987). A Six-Men-Endgame Database: KRP(a2)-KbBP(a3). ICCA Journal, Vol. 10, No. 4, pp. 163-180. Herschberg, I.S. and Van den Herik, H.J. (1993). Back to Fifty. ICCA Journal, Vol. 16, No. 1, pp. 1-2. Hyatt, R. (2000). ftp://ftp.cis.uab.edu/pub/hyatt/TB/. Server providing Nalimov’s EG statistics and tables. Kažíc, B.M. (1989). The 50-Move Rule Adapted (2). ICCA Journal, Vol. 12, No. 2, p. 123. Karrer, P (2000). KQQKQP and KQPKQP≈. ICGA Journal, Vol. 23, No. 2. Levy, D. (1991). First among equals. ICCA Journal, Vol. 14, No. 3, p. 142. Levy, D. and Newborn, M. (1991). How Computers Play Chess. Freeman & Co. ISBN 0-7167-8121-2 (pbk.), esp. pp. 128-152. Lincke, T. (2000). http://wwwjn.inf.ethz.ch/games/chess/statistics/chs_statistics.html. DTC win and draw sta-tistics for 3-man to 6-man endgames. Mednis, E. (1989). The 50-Move Rule Adapted (1). ICCA Journal, Vol. 12, No. 2, p. 123. Nalimov, E.V., Wirth, C., and Haworth, G.McC. (1999). KQQKQQ and the Kasparov-World Game. ICCA Journal, Vol. 22, No. 4, pp. 195-212. Nalimov, E.V. and Heinz, E.A. (2000). Space-Efficient Indexing of Endgame Databases for Chess. Advances in Computer Games 9, (eds. H. J. van den Herik and B. Monien). Institute for Knowledge and Agent Technology (IKAT), Maastricht, The Netherlands. To appear. Nefkens, H.J.J. (1991). How to Win with a Knight Ahead. ICCA Journal, Vol. 14, No. 4, pp. 201-203. Nunn, J. (1994). Secrets of Pawnless Endings. B.T. Batsford, London. ISBN 0-7134-7508-0. Roycroft, A.J. (1983). A Prophecy Fulfilled. EG, Vol. V, No. 74, pp. 217-220. Roycroft, A.J. (1984). A Proposed Revision of the ‘50-Move Rule’. ICCA Journal, Vol. 7, No. 3, pp. 164-170. Roycroft, A.J. (1986). Adjudicate This!! EG, No. 83, p. 22. Roycroft, A.J. (1988). Expert against the Oracle. Machine Intelligence 11 (eds. J.E. Hayes, D. Michie and J. Richards) pp. 347-373. Oxford University Press, Oxford. ISBN 0-1985-3718-2. Stiller, L.B. (1989). Parallel Analysis of Certain Endgames. ICCA Journal, Vol. 12, No. 2, pp. 55-64. Stiller, L.B. (1991). Some Results from a Massively Parallel Retrograde Analysis. ICCA Journal, Vol. 14, No. 3, pp. 129-134. Stiller, L.B. (1991b). Karpov and Kasparov: the End is Perfection. ICCA Journal, Vol. 14, No. 4, pp. 198-201. Stiller, L.B. (1992). KQNKRR. ICCA Journal, Vol. 15, No. 1, pp. 16-18. Stiller, L.B. (1996). Multilinear Algebra and Chess Endgames. Games of No Chance (ed. R.J. Nowakowski), pp. 151-192. MSRI Publications, v29, CUP, Cambridge, England. ISBN 0-521-64652-9. Strategies for Constrained Optimisation 19 Tamplin, J. (2000). http://chess.liveonthenet.com/chess/endings/index.shtml. Position evaluation via Karrer’s KQQKQP≈/KQPKQP≈ sub-EGTs, Nalimov’s 3-6-man EGTs and Thompson’s 5-man EGTs and maximals. Thompson, K. (1986). Retrograde Analysis of Certain Endgames. ICCA Journal, Vol. 9, No. 3, pp. 131-139. Thompson, K. (1996). 6-Piece Endgames. ICCA Journal, Vol. 19, No. 4, pp. 215-226. Thompson, K. (2000). http://cm.bell-labs.com/cm/cs/who/ken/chesseg.html. 6-man EGT maximal positions, maximal mutual zugzwangs and endgame statistics. Troitzkiĭ, A.A. (1906-1910) Serialised analysis of KNNKP. Deutsche Schachzeitung. Troitzkiĭ, A.A. (1934). Два коня против пешек (теоретический очерк). Сборник шахматных этюдов, pp. 248-288. Leningrad. [Dva Konya protiv pešek. Sbornik šakhmatnykh étyudov.] Partly republished (1937) in Collection of Chess Studies, with a Supplement on the Theory of the End-Game of Two Knights against Pawns. (trans. A.D. Pritzson), David McKay Company, the latter again re-published (1985) by Olms, Zürich. Wirth, C. and Nievergelt, J. (1999). Exhaustive and Heuristic Retrograde Analysis of the KPPKP Endgame. ICCA Journal, Vol. 22, No. 2, pp. 67-80.

University Staff:Request a correction | Centaur Editors:Update this record

Page navigation

See also

 

Footer navigation

© University of Reading


[8]ページ先頭

©2009-2025 Movatter.jp