Changes

Jump to: navigation, search

Mobility

117 bytes added, 10:22, 17 May 2018
m
no edit summary
=Quotes=
==Alan Turing==
Quote by [[Alan Turing]] on [[Eliot Slater|Slater's]] 1950 paper ''Statistics for the Chess Computer and the Factor of Mobility''. <ref>[[Eliot Slater]] ('''1950'''). ''[http://www.eliotslater.org/index.php/chess/147-statistics-for-the-chess-computer-and-the-factor-of-mobility Statistics for the Chess Computer and the Factor of Mobility]''. Proceedings of the Symposium on Information Theory, London. Reprinted ('''1988''') in [[Computer Chess Compendium]], pp. 113-117. Including the [http://www.eliotslater.org/index.php/chess/159-discussion-on-the-above-paper-alan-turing-et-al-1950 transcript of a discussion] with [[Alan Turing]] and [[Jack Good]]</ref> <ref>[http://www.turing.org.uk/sources/info50index.html Conference on Information theory, 26-29 September 1950]</ref>:
I wish to make two points concerning Dr. Slater's paper. I was greatly interested by the statistics provided, but fear that some people might draw invalid conclusions from them. It might for instance be thought that a good way of playing is to maximize one's mobility at one's next move, or perhaps to minimize that of one's opponent at his next move but one. It is evidently not feasible to foresee mobilities many moves ahead. Although the immediate mobility is a useful measure of the relative advantage of the players in normal play it by no means follows that it is wise to direct one's play to maximizing such a measure. To do so would be like taking a statistical analysis of the laundry of men in various positions and deciding, from the data collected, that an infallible method of getting ahead in life was to send a large number of shirts to the wash each week.

Navigation menu