Author: Dann Corbit
Date: 17:27:03 02/24/05
Go up one level in this thread
On February 24, 2005 at 16:11:30, Bo Persson wrote: >On February 24, 2005 at 03:20:27, Guillaume MOYA wrote: > >>On February 23, 2005 at 11:26:47, Mathieu Pagé wrote: >> >>Hi guys, thanks a lot I fixed my alpha beta functions, and now, there are >>cut-off, there was a bug. Now I try different ways to sort the generated move, >>the quicksort method is rather slow, I'm going to have a try with radix sort, or >>just moving the 3 or 4 best moves to the beginning of the list. >> > >Yes, please try that - it's called Selection Sort in this context. :-) > >Quicksort has some set up cost which is hard to recover on a short sequence. >Also remember that is has its worst case timing for an already sorted sequence. >Not too unlikely here! Quick select is O(n). Selection sort is O(n^2)
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.