Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Fast sort? - Bubble Sort!? (Question to Dr. Hyatt)

Author: Robert Hyatt

Date: 20:49:36 10/19/99

Go up one level in this thread


On October 19, 1999 at 22:25:50, Oliver Roese wrote:

>On October 18, 1999 at 19:49:30, Jeremiah Penery wrote:
>(...)
>
>>This is in even the new Crafty versions. :)  It says:
>>
>>/*
>> ----------------------------------------------------------
>>|                                                          |
>>|   don't disdain the lowly bubble sort here.  the list of |
>>|   captures is always short, and experiments with other   |
>>|   algorithms are always slightly slower.                 |
>>|                                                          |
>> ----------------------------------------------------------
>>*/
>
>Yes.
>It can be found three times.
>(quiesece.c, next.c, nexte.c)


Note that if you want to fiddle with this, fiddle with Quiesce() as it is
done at least twice as often as the other two combined, maybe more.
NextEvasion() is not called often 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.