Computer Chess Club Archives

Search

Terms

Messages

Subject: About move ordering

Author: Mathieu Pagé

Date: 10:13:31 11/03/03

Hi,

I'm know implementing iterative deepening and i've got to the point where I must
re-order move between iteration according to there result from the last search.

The question is how should i sort them. Do I, simply, have to sort them with a
standard algorithm like quicksort (that seem to me that will not be so quick :)

Can you confirm this, or explain me what should I do.

Thanks

Mathieu Pagé

Re: About move ordering Dann Corbit 20:04:26 11/03/03
- Re: About move ordering Joel 21:49:30 11/03/03
  - Re: About move ordering Dann Corbit 22:32:31 11/03/03
    - Re: About move ordering Joel 04:46:10 11/04/03
Re: About move ordering scott farrell 18:17:42 11/03/03
Re: About move ordering Matthew White 12:47:48 11/03/03
Re: About move ordering William H Rogers 12:30:54 11/03/03
Re: About move ordering Gerd Isenberg 11:31:49 11/03/03
Re: About move ordering Tord Romstad 10:57:28 11/03/03
- Re: About move ordering Tord Romstad 11:34:34 11/03/03

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.