stoneyrich

Hi everyone ...i would like your ideas on how to go about this list problem.

attached is a sample of the list am trying to work with:

I want to achieve a list of possible route like this

possible route 1 - 272<309<308>312>48

route 2 - 316<315>319>99

route 3 - 48<1420

< it begins from the left of the node
> it end at the right side of the node

any help ?

I am trying to implement a transposition table in my search incorporating zobrist key a brief description - at each position you have 13 different pieces, 1-6 from player 1, 1-6 from player 2, and 0 (empty) that means my zobrist key table will be of size 13 * 25. I filled my table with some random values wit the code below

public void intZobristKeys() {

Random ranZobristKey;
ranZobristKey = new Random();

for (int positon = 0; positon < 325; positon++) {
zobrist_table[positon][EMPTY] = ranZobristKey.nextInt();
zobrist_table[positon][PLAYER_ONE] = ranZobristKey.nextInt();
zobrist_table[positon][PLAYER_TWO] = ranZobristKey.nextInt();
}

}

am stuck where do i move from here as in the link between this and recording the actual moves in the transposition table eg {hashkey, state value, depth} etc any help ?