🚀 go-pugleaf

In article <CqB7u6.Ftu@cs.ruu.nl> vdiepeve@cs.ruu.nl (Vincent Diepeveen) writes:


> 
> In <2rqmo3$34j@search01.news.aol.com> dsmjl@aol.com (DSMJL) writes:
> 
> >In article <CoGEL1.5Ao@cs.ruu.nl>, vdiepeve@cs.ruu.nl (Vincent
> >Diepeveen) writes:
> >
> >The reason the present UpdatePieceList is the way it is goes:
> >
> >It keeps the piece list in an order that is more effective in keeping
> >the
> >tree small (efficiency).
> 
> Why does there exist a function 'pick' that gets the best
> move from the movelist: if all moves are picked, then you have
> a bubblesort( after experimenting in my own programm with heapsort,
> my conclusion was that this pick function, so bubblesort, was  
> better as any other sort, as memcpy is the most slowest command on the PC, 
> except HALT .....-)))
> of the list, in both cases it doesn't matter the way it is generated.

I believe the answer is that, in general, a large % of the time the
first move will be the "best" so that it's a waste of time to sort
when the first move will do.  And if the 1st isn't the best, then the
2nd best probably is....this of course is the whole point of move
ordering heuristics.

		- Dave



--

     + ------------------------+
     | David Spencer           |
     | david-spencer@retix.com |
     + ------------------------+