[r-t] Delta-based transposition representation

[Alan Burlison]

On 15/06/2016 00:25, Alexander Holroyd wrote:

> I found a way to do this using bit operations.  A row r on up to 16
> bells is represented as a 64-bit word, with 4 bits per place.  A change
> c is represented by 3 64-bit masks, representing the positions of bells
> that move up, down, or make a place.

Interesting. Why did you use 4 bits per place, wouldn't 1 have worked 
just as well?

-- 
Alan Burlison
--