ok,thx. yeah,i chose a prime number for the table (do you think that 500009 is enough?) and for the bit mixing part, the function you posted already does that i suppose(?).

By the way, i do keep the lowest free square of each column in an array called height[] (size 7) but i am only using the exact 42 bits for the board,unlike john tromp's 49 bits representation. when i make a move and updating ( height[n]++ ), when i reach the column topMost square , the height[n] becomes equal to the next column lowest bottom square. (this is how i also check for if a certain column is full or not). e.g i don't have extra 7 dummy bits.

so i guess the method you showed above still works in my case..?

### Show differencesHistory of post edits

### #Actualpatishi

Posted 01 July 2013 - 08:07 PM

### #3patishi

Posted 01 July 2013 - 08:06 PM

ok,thx. yeah,i chose a prime number for the table (do you think that 500009 is enough?) and for the bit mixing part, the function you posted already does that i suppose(?).

By the way, i do keep the lowest free square of each column in an array called height[] (size 7) but i am only using the exact 42 bits for the board,unlike john tromp's 49 bits representation. when i make a move and updating ( height[n]++ ), when i reach the column topMost square , the height[n] becomes equal to the next column lowest bottom square. (this is how i also check for if a certain column is full or not). e.g i don't have extra 7 dummy bits.

so i guess the method you showed above still work in my case..?

### #2patishi

Posted 01 July 2013 - 08:05 PM

ok,thx. yeah,i chose a prime number for the table (do you think that 500009 is enough?) and for the bit mixing part, the function you posted already does that i suppose(?).

By the way, i do keep the lowest free square of each column in an array called height[] (size 7) but i am only using the exact 42 bits for the board,unlike john tromp's 49 bits representation. when i make a move and updating ( height[n]++ ), when i reach the column topMost square , the height[n] becomes equal to the next column lowest bottom square. (this is how i also check for if a certain column is full or not). e.g i don't have extra 7 dummy bits.

so i guess the methos you showed above still work in my case..?

### #1patishi

Posted 01 July 2013 - 08:04 PM

ok,thx. yeah,i chose a prime number for me table (do you think that 500009 is enough?) and for the bit mixing part, the function you posted already does that i suppose(?).

By the way, i do keep the lowest free square of each column in an array called height[] (size 7) but i am only using the exact 42 bits for the board,unlike john tromp's 49 bits representation. when i make a move and updating ( height[n]++ ), when i reach the column topMost square , the height[n] becomes equal to the next column lowest bottom square. (this is how i also check for if a certain column is full or not). e.g i don't have extra 7 dummy bits.

so i guess the methos you showed above still work in my case..?