Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
Shiv Sankaranarayanan
What this presentation will leave you with
„ Some interesting inferences from Game Theory and how
Computers “see” a chess position.
„ A look at how software has changed the way a 400+ year old
game is played at the highest levels.
Welcome our new overlords … and let’s ask them for help!
Pint-sized Grand Masters : Younger and
Younger
Player Nationality Age Year
Sergey Karjakin Ukraine 12 2002
Parimarjan Negi India 13 2006
Magnus Carlsen Norway 13 2004
Bu Xiangzhi China 13 1999
Richard Rapport Hungary 13 2010
… … … …
Bobby Fischer (#16 on the list) USA 15 1958
Failing to do any of the 3 consistently + efficiently is why most chess players never
advance beyond a certain point!
„ Computer tools help with the critiquing phase as well adding plusses!
Seeing a Game with “Computer Eyes”
- Evaluation and Analysis in Turn-based Games
- Evaluation : Who is winning
- Analysis : All the calculation you need to make an accurate
Evaluation
Consider a Tic-Tac-Toe Game in progress
„ But that doesn’t mean you’ll always win now, does it?
Seeing it with “Computer Eyes” (4/8)
Let’s look at some famous results from Game Theory for turn-based
zero-sum games such as tic-tac-toe (and chess!)
„ #1 : At the beginning of the game, the forces stand in equilibrium.
(Nobody’s winning, nobody’s losing!)
„ #2 : Correct play on both sides maintains this equilibrium and leads to
a drawn game.
„ #3 : A player can change this equilibrium only by exploiting an error
made by the opponent.
- How BIG this evaluation score can get in either direction is constrained by
side-to-move, material and positional factors on the board right now.
- How ACCURATE this score is based on position complexity, algorithm
quality and how much time a chess engine has to perform the evaluation
Seeing it with “Computer Eyes” (7/8)
Putting it all together ….
Intermediate-level Players
„ Fewer errors / move average
„ Smaller error magnitudes
„ Failures to exploit errors still exist
Evaluation Score Graphs (2/2)
A Grand Master vs Grand Master Game:
Capablanca vs. Spielmann (1911)
Caveat : When Engines “don’t help”
Often enough, positions DO occur in chess where there are multiple
candidate moves with fairly equal evaluation scores.
„ Example : ply-depth of 19+ moves, best 3 lines:
„ Move A : Eval. Score = +0.45
„ Move B : Eval. Score = +0.43
„ Move C : Eval. Score = +0.39
„ Even over time, the Scores drift by small margins
„ The score differences are underneath a noise floor so it
cannot be conclusive that A is indeed better than B or C
„ One line may historically be far more playable by humans
than the others.
„ So where does a truth-seeking chess player find answers in
these types of positions?
„ Stronger Players/Coaches
„ Databases (Statistical fact-finding)
Databases can supplement Engine deficiencies