Author: chandler yergin
Date: 12:04:36 10/11/05
Go up one level in this thread
On October 11, 2005 at 14:35:21, Dan Honeycutt wrote:
>No but ...
>
>Your link describes how scores are propogated through the tree with a min max
>search. They mention alpha beta pruning at the end, but say nothing about it
>except it's about twice as fast.
>
>The engine displaying a 12/40 search is looking at a tree that is very different
>than the one presented in the link.
>
>Best
>Dan H.
Iused Examples:
This is of course the main point!
" Each player has 16 pieces. Let's say that white starts. White has 20 possible
moves:
The white player can move any pawn forward one or two positions.
The white player can move either knight in two different ways.
The white player chooses one of those 20 moves and makes it.
For the black player the options are the same - 20 possible moves. So black
chooses a move.
Now white can move again. It depends on what white chose to do in the first
move, but there are about 20 or so moves white can make given the current board
position, and then black has 20 or so moves it can make... and so on.
This is how a computer looks at chess. It thinks about it in a world of "all
possible moves", and it makes a big tree for all of those moves."
What's hard to understand? The analysis module window shows you how many legal
moves there are for any position, and which move it is evaluating, and how
it rates it.
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.