It tells you ; what 3 mods , solve all 128 values , ( 0 to 127 )..
I thought ; maybe the mods i was using , weren't getting all 128 values correct...
Then i thought ; maybe it was due to , overlaps , one mod going over 10.. But it sometimes decompresses when there are overlaps of values.
I can't find the bug or error....
Here's my "Moderator" program...
Code: Select all
dim as longint v , v1 , v2 , v3 , v4
dim as longint md1 , md2 , md3 , md4
'ADJUST ( RND * ? ) TO DIFFERENT VALUES , HAS TO BE 3 OR GREATER
'YOU CAN PLAY AROUND AND FIND THE LOWEST MODS THAT EQUAL ( V ) BELOW.
md1 = int( rnd * 3 )
md2 = int( rnd * 8 )
md3 = int( rnd * 16 )
loop until md1 > 1 and md2 > 1 and md3 > 1
'SET ( V ) TO MAX BIT VALUE YOU WANT TO SEARCH.
dim as longint count = 0
for v as longint = 0 to 127
v1 = v mod md1
v2 = v mod md2
v3 = v mod md3
dim as longint s , s1 , s2 , s3 , s4 , value
'IF YOUR DOING MORE THAN 16 BITS SET ,BELOW TO MAX BIT VALUE
for b as longint = 0 to 127 step 1
s = b
s1 = s mod md1
s2 = s mod md2
s3 = s mod md3
if s1 = v1 and s2 = v2 and s3 = v3 then value = b : exit for
if value = v then count+=1
if count = 128 then print count , md1 , md2 , md3 : sleep
'if v = value then print v , value , md1 , md2 , md3 : sleep
loop until inkey = chr( 27 )