Author: Daniel Pineo
Date: 06:40:40 05/05/05
Go up one level in this thread
On May 04, 2005 at 14:13:10, Werner Kraft wrote: >In computer chess , the method to find a move is based on " tree - searching " >- you >have a move ( 1.e4 ) - then the 20 reply moves for black . SO you build up >trees - every variation move is a new branch on it. >Now - as a complete analysis of a chess game involves 10-power 120 positions - >you introduce evaluation system ... > >Was there ever another way of looking at that - may be from exotic branches of >mathematics - topology e,g ? Try googling "surreal numbers". It's an entirely new number system by mathematician John Conway (creater of the game of life) and is quite intresting. It was developed specificly to analyze games, I believe he used it to analyze the game of go. The entire theory is based on only two axioms: First axiom: Every number corresponds to two sets of previously created numbers, such that no member of the left set is greater than or equal to any member of the right set Second axiom: One number is less than or equal to another number if and only if no member of the first number's left set is greater than or equal to the second number, and no member of the second number's right set is less than or equal to the first number'.
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.