Strategies for Constrained Optimisation
Data(s) |
01/03/2000
|
---|---|
Resumo |
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. |
Formato |
text |
Identificador |
http://centaur.reading.ac.uk/4566/1/2000a_ICGA_J_H_Strategies_for_Constrained_Optimisation.pdf Haworth, G. M. <http://centaur.reading.ac.uk/view/creators/90000763.html> (2000) Strategies for Constrained Optimisation. ICGA Journal, 23 (1). pp. 9-20. ISSN 1389-6911 |
Idioma(s) |
en |
Publicador |
The International Computer Games Association |
Relação |
http://centaur.reading.ac.uk/4566/ http://ticc.uvt.nl/icga/journal/ http://ticc.uvt.nl/icga/journal/ |
Tipo |
Article PeerReviewed |
Direitos |