Strategies for Constrained Optimisation

[thumbnail of 2000a_ICGA_J_H_Strategies_for_Constrained_Optimisation.pdf]
Preview
Text
- Published Version

Please see our End User Agreement.

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

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

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

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
URI https://reading-clone.eprints-hosting.org/id/eprint/4566
Refereed Yes
Divisions Science
Uncontrolled Keywords chess, depth, endgame, metrics, optimisation, strategies
Publisher The International Computer Games Association
Download/View statistics View download statistics for this item

Downloads

Downloads per month over past year

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

Search Google Scholar