am looking for an algorithm that can generate bit batterns similar to the following:
PF1:
%11111111 %11111100 %11111110 %11110000 %11000000
PF2:
%00000001 %00000011 %00000111 %00000011 %00011111
PF0 will always be filled, so no worry there.
am wondering if I can start with an initial value, and temporarily generate another random value which would be the # of bits to shift left (in the case of PF1) or right (in the case of PF0) and do the appropriate loop which does the bit rotation, stores into the landscape... or is there a more efficient way to do it?
-Thom














