Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: The 16 ply challenge restated

Author: Peter McKenzie

Date: 15:00:33 09/14/00

Go up one level in this thread


On September 14, 2000 at 16:43:24, Dann Corbit wrote:
<snip>
>>I do not see the point of searching to 16 plies.
>
>Stop at two plies then.  Deeper is better.
>
>>It is easy to search faster if you do more pruning.
>
>But more error prone.  If you search 20 plies by pruning but lose in 5 moves
>because of something you pruned out, it's not such a great idea.  But if you can
>search 20 plies by extensive pruning and always get the same answers as a brute
>force search, then you have found something spectacular.  Alpha-Beta (in
>particular) gets the same answer as exhaustive search, and only requres sqrt(n)
>tests provided you order the moves correctly.

I you could do that, you wouldn't need to search at all :-)



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.