Chess Pure Strategies are Probably Chaotic

Details Chess Pure Strategies are Probably Chaotic Chess Pure Strategies are Probably Chaotic

1998-08-21

arxiv.org/abs/cs/9808001v1

Computer Science

Computational Complexity

7 pages, no figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Chess Pure Strategies are Probably Chaotic does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Chess Pure Strategies are Probably Chaotic, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Chess Pure Strategies are Probably Chaotic will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-21334