If you do alpha-beta minimization (for two-player games), it is very important to try your best move first. If you are able to sort your moves into probable order of effectiveness, alpha-beta pruning effectively doubles the number of plies you can search in a given time, while it does little good if you try the worst move first.
Henry Rich > -----Original Message----- > From: [EMAIL PROTECTED] > [mailto:[EMAIL PROTECTED] On Behalf Of John Randall > Sent: Sunday, November 23, 2008 11:37 AM > To: Programming forum > Subject: Re: [Jprogramming] Project Euler Problem 216 > > Roger Hui wrote: > > I guess the point of all this is that there is nothing > > inherent about J that prevents the efficient > > implementation of depth first search. > > I am now much more of a believer. > > Even though they can be eliminated, operations like sorting > the stack, or > sorting a group of items that are about to be pushed are > worth trying, in > my experience. They are also uncharted territory, since you would be > unlikely to do them in a language in which sorting is tedious > to program. > > Best wishes, > > John > > > > > ---------------------------------------------------------------------- > For information about J forums see > http://www.jsoftware.com/forums.htm ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
