Chess Pure Strategies are Probably Chaotic

08/21/1998
by   M. Chaves, et al.
0

It is odd that chess grandmasters often disagree in their analysis of positions, sometimes even of simple ones, and that a grandmaster can hold his own against an powerful analytic machine such as Deep Blue. The fact that there must exist pure winning strategies for chess is used to construct a control strategy function. It is then shown that chess strategy is equivalent to an autonomous system of differential equations, and conjectured that the system is chaotic. If true the conjecture would explain the forenamed peculiarities and would also imply that there cannot exist a static evaluator for chess.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/25/2019

Pure Strategy Best Responses to Mixed Strategies in Repeated Games

Repeated games are difficult to analyze, especially when agents play mix...
research
03/01/2018

Algorithm for Evolutionarily Stable Strategies Against Pure Mutations

Evolutionarily stable strategy (ESS) is an important solution concept in...
research
06/01/2023

Linear codes with arbitrary dimensional hull and pure LCD code

In this paper, we introduce a general construction of linear codes with ...
research
06/19/2023

Optimal Pure Strategies for a Discrete Search Game

Consider a two-person zero-sum search game between a Hider and a Searche...
research
12/29/2022

Betting strategies with bounded splits

We show that a pair of Kolmogorov-Loveland betting strategies cannot win...
research
03/13/2013

Mixed Strategy May Outperform Pure Strategy: An Initial Study

In pure strategy meta-heuristics, only one search strategy is applied fo...
research
09/17/2022

Survival of dominated strategies under imitation dynamics

The literature on evolutionary game theory suggests that pure strategies...

Please sign up or login with your details

Forgot password? Click here to reset