Re: To sort or not to sort?

Article View: gnu.chess

Article #3751

#3751

From: Yves Debillo�z
Date: Fri, 20 Dec 1996 00:00

16 lines
857 bytes

brucemo <brucemo@nwlink.com> wrote in article 
<32B864E7.2A6E@nwlink.com>...

Sorting seems ok for the main moves, it is not important to sort 
bad moves.

Can we consider updating the algorithm in order to stop after 'n' 
good
moves are found.

-- 
Yves Debillo�z, Belgium
101361.2061@compuserve.com
yde@ficsgrp.com
http://ourworld.compuserve

Technical Details

Message-ID: <59dusn$4n$1@mhafc.production.compuserve.com>

Path: arc1-ca.pugleaf.net!unknown!not-for-mail

Show Full Headers

Complete Article Headers

X-Google-Language: ENGLISH,ASCII
X-Google-Thread: 10d71d,1d03c3c9facc2503,start
X-Google-Attributes: gid10d71d,public
X-Google-Thread: 110df2,74603dfbdf933ad5
X-Google-Attributes: gid110df2,public
From: Yves Debillo�z <101361.2061@CompuServe.COM>
Subject: Re: To sort or not to sort?
Date: 1996/12/20
Message-ID: <59dusn$4n$1@mhafc.production.compuserve.com>
X-Deja-AN: 205082148
organization: CompuServe, Inc. (1-800-689-0736)
newsgroups: gnu.chess,rec.games.chess.computer