Author: Dann Corbit
Date: 10:42:15 01/15/99
Go up one level in this thread
On January 15, 1999 at 00:34:40, KarinsDad wrote:
>On January 14, 1999 at 20:20:51, Dann Corbit wrote:
>>
>>I have a notion about solving chess equations. Chess looks very much like a
>>fractal equation to me (in n-space). If we could find a fractal equation for a
>>given position, we might be able to solve forward. Perhaps we could even
>>differentiate the function and glide down the maximal slope.
>
>Wow Dann, you are way beyond me here. I take it you are not being serious. If
>you are, I would be interested in you posting more on this. Knowing what I do
>about fractals, I cannot even begin to imagine a solution here (except maybe in
>extremely limited endgames).
>
>Now don't be pulling an old man's leg here. It isn't polite to make fun of your
>elders.
It was largely tongue in cheek in a sense. I clearly don't think it is doable
right now. But when you look at chess, everything about it says fractal.
Self-same similarity (but not exact -- look at how king & queen are reversed),
reflections, transpositions, taking off in new directions with similar themes
being repeated. We can consider an epd string as a big binary number. The
rules of the game allow certain trajectories (I'm visualizing the Lorentz
Transformation butterfly right now -- and thinking of the butterfly effect at
the same time {I wish I could do that in a haiku}).
If there is to be a *revolution* in chess algorithms, it will be the encoding of
chess as a fractal.
The slope thing was just a joke. I doubt if the equation would even be
differentiable since chess hardly seems like a smooth, continuous function.
In another sense it was a teaser. I was kind of hoping someone might have a
brainchild from it. Maybe you?
;-)
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.