25,161
edits
Changes
no edit summary
'''[[Main Page|Home]] * [[Evaluation]] * Mobility'''
[[FILE:SamuelBakQuiteClear.jpg|border|right|thumb|link=http://chgs.elevator.umn.edu/asset/viewAsset/57f3b6787d58ae5f74bf8ba9#57f3b6d77d58ae5574bf8bcb| [[Arts#:Category:Samuel Bak|Samual Samuel Bak]], Quite Clear <ref>[http://chgs.elevator.umn.edu/asset/viewAsset/57f3b6787d58ae5f74bf8ba9#57f3b6d77d58ae5574bf8bcb Chess in the Art of Samuel Bak], [http://chgs.elevator.umn.edu/ Center for Holocaust & Genocide Studies], [https://en.wikipedia.org/wiki/University_of_Minnesota [University of Minnesota]]</ref> <ref>The mountain in the background looks like [https://en.wikipedia.org/wiki/Torghatten Torghatten] near [https://en.wikipedia.org/wiki/Br%C3%B8nn%C3%B8ysund Brønnøysund]</ref> ]]
'''Mobility''',<br/>
<span id="TheValueofReachingaSquare"></span>
=The Value of Reaching a Square=
[[Dan Heisman]] <ref>[[Dan Heisman]] ('''1990, 1999, 2010, 2015''').''[http://www.danheisman.com/elements-of-positional-evaluation.html The Positional Elements of ChessPositional Evaluation]''. Russell Enterprises</ref> represents an attempt at mathematical abstraction applied to chess, introducing seven concepts as fundamental in analyzing a chess position: mobility, flexibility, vulnerability, [[Center Control|center control]], piece coordination, time and speed. Heisman applies two [https://en.wikipedia.org/wiki/Dichotomy dichotomies]: ''actual'' versus ''potential'' and ''local'' versus ''global'':
{| class="wikitable"
|-
=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.
==2000 ...==
* [[Mark Levene]], [[Trevor Fenner]] ('''2001'''). ''The Effect of Mobility on Minimaxing of Game Trees with Random Leaf Values''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_(journal) Artificial Intelligence], Vol. 130, No. 1, Review in [[ICGA Journal#24_4|ICGA Journal, Vol. 24, No. 4]], [http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.21.6342&rep=rep1&type=pdf pdf]
* [[Chrilly Donninger]] ('''2006'''). ''Plättchen zählen''. [https://brigitte-godot.com/wp-content/uploads/2018/03/PlaettchenZaehlen.pdf pdf] (German) » [[Square Control]]
* [[John L. Jerz]] ('''2008, 2013'''). ''[http://www.johnljerz.com/superduper/tlxdownloadsiteMAIN/id80.html A Proposed Heuristic for a Computer Chess Program]''.
==1993 ...==
* [https://groups.google.com/d/msg/rec.games.chess/au2AlGf7T30/jgAq306Bix4J deriving piece values from mobility] by [[Barney Pell]], [[Computer Chess Forums|rgc]], August 09, 1993
* [https://groups.google.com/d/msg/rec.games.chess/6vwtkcF6sRU/4M3oOiDNYwgJ Mobility Measure: Proposed Algorithm] by [[Dietrich Kappe]], [[Computer Chess Forums|rgc]], September 23, 1993
==1995 ...==
* [http://groups.google.com/group/rec.games.chess.computer/browse_frm/thread/aeb03d37e406bf27 Playing for position (mobility)] by S.Read, [[Computer Chess Forums|rgcc]], September 29, 1995
* [http://www.talkchess.com/forum/viewtopic.php?t=61693 Mobility Evaluation ?] by [[Mahmoud Uthman]], [[CCC]], October 12, 2016
* [http://www.talkchess.com/forum/viewtopic.php?t=64645 Safe mobility?] by [[J. Wesley Cleveland]], [[CCC]], July, 18, 2017
==2020 ...==
* [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=75223 Excluding squares from mobility] by [[Oliver Brausch]], [[CCC]], September 27, 2020
=External Links=
* [https://en.wikibooks.org/wiki/Chess_Strategy/Mobility Chess Strategy/Mobility - Wikibooks]
* [http://radagast.se/othello/bitmob.c bitboard mobility] Copyright (c) 2003, [[Gunnar Andersson]] » [[Othello]]
* [https://www.madchess.net/2020/02/01/madchess-3-0-beta-5c5d4fc-piece-mobility/ MadChess 3.0 Beta 5c5d4fc (Piece Mobility)] by [[Erik Madsen]], February 1, 2020 » [[MadChess]]
=References=
<references />
'''[[Evaluation|Up one level]]'''
[[Category:Samuel Bak]]
[[Category:Quotes]]
[[Category:Turing Quotes]]
