Author: Joshua Haglund
Date: 16:24:51 12/16/02
I need some help with an idea. Can anyone think of an algorithm that I could use
for this idea?
legal movelist > rank move list to highest score >move list >best move list
score >move >
move > legal move list > rank move list1 > best move list score > move > ply 2
ply 2 > legal move list > rank move list2 > best move list score > move > ply 3
ply 3 > legal move list > rank move list3 > best move list score > move > ply 4
if(ply = 4) { search rank 2 of ply 1 };
move > legal move list > rank move list1 > best move list score > move > ply 2
ply 2 > legal move list > rank move list2 > best move list score > move > ply 3
ply 3 > legal move list > rank move list3 > best move list score > move > ply 4
if (ply = 4) { search rank 3 of ply 1};
move > legal move list > rank move list1 > best move list score > move > ply 2
ply 2 > legal move list > rank move list2 > best move list score > move > ply 3
ply 3 > legal move list > rank move list3 > best move list score > move > ply 4
if (ply = 4) { search rank 1 of ply 2};
move > legal move list > rank move list1 > best move list score > move > ply 2
ply 2 > legal move list > rank move list2 > best move list score > move > ply 3
ply 3 > legal move list > rank move list3 > best move list score > move > ply 4
if (ply = 4) { search rank 2 of ply 2};
move > legal move list > rank move list1 > best move list score > move > ply 2
ply 2 > legal move list > rank move list2 > best move list score > move > ply 3
ply 3 > legal move list > rank move list3 > best move list score > move > ply 4
if (ply = 4) { search rank 3 of ply 2};
move > legal move list > rank move list1 > best move list score > move > ply 2
ply 2 > legal move list > rank move list2 > best move list score > move > ply 3
ply 3 > legal move list > rank move list3 > best move list score > move > ply 4
if (ply = 4) { search rank 1 of ply 3};
move > legal move list > rank move list1 > best move list score > move > ply 2
ply 2 > legal move list > rank move list2 > best move list score > move > ply 3
ply 3 > legal move list > rank move list3 > best move list score > move > ply 4
if (ply = 4) { search rank 2 of ply 3};
move > legal move list > rank move list1 > best move list score > move > ply 2
ply 2 > legal move list > rank move list2 > best move list score > move > ply 3
ply 3 > legal move list > rank move list3 > best move list score > move > ply 4
if (ply = 4) { search rank 3 of ply 3};
move > legal move list > rank move list1 > best move list score > move > ply 2
ply 2 > legal move list > rank move list2 > best move list score > move > ply 3
ply 3 > legal move list > rank move list3 > best move list score > move > ply 4
if (ply = 4) { search rank 1 of ply 4};
move > legal move list > rank move list1 > best move list score > move > ply 2
ply 2 > legal move list > rank move list2 > best move list score > move > ply 3
ply 3 > legal move list > rank move list3 > best move list score > move > ply 4
if (ply = 4) { search rank 2 of ply 4};
move > legal move list > rank move list1 > best move list score > move > ply 2
ply 2 > legal move list > rank move list2 > best move list score > move > ply 3
ply 3 > legal move list > rank move list3 > best move list score > move > ply 4
if (ply = 4) { search rank 3 of ply 4};
return best move at ply 4;
I'm having difficulty trying to come up with an algorithm. I hope you know what
I mean by the example above.
Thanks,
Joshua
toneewa@yahoo.com
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.