Computer Chess Club Archives


Search

Terms

Messages

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

Author: Hristo

Date: 15:58:19 06/14/98

Go up one level in this thread


On June 14, 1998 at 18:45:02, Mark Young wrote:

>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


Mark :)))
I hope I'm not dense !

Guess I'm just tired of listening to "prophets" that claim the Earth is
flat because they don not see any other way, and also, because beer is
way too expensive :))))


BTW I do not know who Thorsten Czub is ?!


Hristo
"Always look on the bright side of life!!!
Always look on the bright side of life!!!
...
Live's a piece of sh*t, when you look at it .... lalala
Always look on the bright side of life!!!
Always look on the bright side of life!!!
"
:)))) I love these bastards! :) (Monthy Python)





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.