Zobrazeno 1 - 10
of 24
pro vyhledávání: '"G. McC. Haworth"'
Autor:
G. McC. Haworth, Galen Huntington
Publikováno v:
ICGA Journal. 38:94-99
The most popular endgame tables (EGTs) documenting ‘DTM’ Depth to Mate in chess endgames are those of Eugene Nalimov but these do not recognise the FIDE 50-move rule ‘50mr’. This paper marks the creation by the first author of EGTs for sub-6-
Autor:
G. McC. Haworth, Karsten Müller
Publikováno v:
ICGA Journal. 36:195-202
Autor:
Joe Leslie-Hurd, G. McC. Haworth
Publikováno v:
ICGA Journal. 36:100-103
Theorem-proving is a one-player game. The history of computer programs being the players goes back to 1956 and the ‘LT’ LOGIC THEORY MACHINE of Newell, Shaw and Simon. In game-playing terms, the ‘initial position’ is the core set of axioms ch
Autor:
R. B. Andrist, G. McC. Haworth
Publikováno v:
Theoretical Computer Science. 349:158-167
A reference model of Fallible Endgame Play has been implemented and exercised with the chess-engine WILHELM. Past experiments have demonstrated the value of the model and the robustness of decisions based on it: experiments agree well with a Markov M
Autor:
G. McC. Haworth
Publikováno v:
ICGA Journal. 36:46-48
The 'Turing 100' Conference in Manchester was the main event of the Turing Centenary Year in 2012. This is a report and reflection on Kasparov's popular talk. Within it, he explained how Turing and influenced computer chess, his career and the chess
Autor:
G. McC. Haworth
Publikováno v:
ICGA Journal. 26:115-118
Heinz recently completed a comprehensive experiment in self-play using the FRITZ chess engine to establish the ‘decreasing returns’ hypothesis with specific levels of statistical confidence. This note revisits the results and recalculates the con
Autor:
G. McC. Haworth
Publikováno v:
ICGA Journal. 26:81-91
A reference model of fallible endgame play is defined in terms of a spectrum of endgame players whose play ranges in competence from the optimal to the anti-optimal choice of move. They may be used as suitably skilled practice partners, to assess a p
Publikováno v:
ICGA Journal. 33:212-214
This is a report on the data-mining of two chess databases, the objective being to compare their sub-7-man content with perfect play as documented in Nalimov endgame tables. Van der Heijden’s ENDGAME STUDY DATABASE IV is a definitive collection of
Publikováno v:
ICGA Journal. 23:148-162
Chess endgame tables should provide efficiently the value and depth of any required position during play. The indexing of an endgame’s positions is crucial to meeting this objective. This paper updates Heinz’ previous review of approaches to inde
Autor:
G. McC. Haworth
Publikováno v:
ICGA Journal. 23:9-20
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 f