Computer Chess Club Archives

Search

Messages

Subject: Re: Deeper Search Is Better, but Is the Best Search?

Author: Mark Young

Date: 15:45:02 06/14/98

Go up one level in this thread

On June 14, 1998 at 18:32:20, Hristo wrote:

>>computation time to come to a valid conclusion as it is going to take my
>>search algorithm to reach that same conclusion.  But, from experience,
>>my
>>search algorithm is going to be orders of magnitude simpler, and more>bug-
>>free.
>
>Bob(my Lord :-)) .
>Crafty is not an example of bug free and simple software.
>Bug-free is a level of debuging capabilities not an algorithm!
>Besides what is the point ... even if it takes more time to debug ...
>

Are you just dense?  The more I read your posts the more you sound like
a poor mans Thorsten Czub. :)

>Hristo

• Re: Deeper Search Is Better, but Is the Best Search? Hristo 15:58:19 06/14/98
  • Re: Deeper Search Is Better, but Is the Best Search? Robert Hyatt 21:22:58 06/14/98
  • Re: Deeper Search Is Better, but Is the Best Search? Mark Young 16:14:14 06/14/98
    • Re: Deeper Search Is Better, but Is the Best Search? Hristo 16:24:36 06/14/98
      • Re: Deeper Search Is Better, but Is the Best Search? Mark Young 16:58:49 06/14/98
        • Re: Deeper Search Is Better, but Is the Best Search? Hristo 17:06:00 06/14/98

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.