Computer Chess Club Archives




Subject: Re: Artificial Intelligence in Computer Chess

Author: Uri Blass

Date: 15:33:46 03/28/04

Go up one level in this thread

On March 28, 2004 at 18:21:33, Artem Pyatakov wrote:

>Thanks - this is a nice example!
>I do think people do search, I just don't think they use anything as
>sophisticated as Alpha-Beta with two bounds being propagated down and back up
>the search tree. But yes, there is a definitely search going on.

2 bounds is to define lines that are bad for one side.

Humans do not define it by numbers but they define better and worse.
The tree that humans search is certainly similiar to the tree that programs
search except the fact that humans search smaller tree and have rules when to
prune but selective search does not mean not using alphabeta.


This page took 0.01 seconds to execute

Last modified: Thu, 07 Jul 11 08:48:38 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.