🚀 go-pugleaf

In article <2s678r$h7m@nuscc.nus.sg> nsrccks@leonis.nus.sg (Chua Kong Sian) writes:

   I'll talk about the pick() routine first as its easier :).  The post
   is right that pick() is a bubble sort (or maybe selection sort which
   is just as bad).  However most of the time it is unnecessary to
   completely sort the movelist.  This is because if a move is "picked"
   and causes a beta cut, then the rest of the moves need not be searched
   and thus any effort spent in sorting them would have been wasted.  So
   IMHO, I think pick() works pretty efficiently.

If you're going to sort a short list with an O(n^2) time algorithm,
its better to use insertion sort. That way, if the list is already
close to being in order, you get close to linear performance.

--
Dietrich Kappe
kap1@wimpy.cpe.uchicago.edu
-finger for PGP public key-