It come from me ;-)
This was a sequel of the first brute force I have used. I must start it
with a number, and it search from this one the first number bigger that
doesn't violate the violate the tests, add it to the list and repeat
this until it have enough numbers. This implementation was very
On 12/11/2007, Petr Baudis [EMAIL PROTECTED] wrote:
I have rewritten it so that it now picks a random point at the board,
then searches the whole board starting from that point and picks up the
first valid point.
That is a bad way to random choose a point. Some point will be choosen
a lot
On Nov 16, 2007 10:54 AM, A van Kessel [EMAIL PROTECTED] wrote:
Yep, I think I had a bug. I just removed an optimization that I
I just checked your array, and found that {14 56 383 3047} -- 3500 -- 875,
which is also in the array. Back to the old drawing board.
BTW I don't get this
Neat. Was the 15-bit version for 81 values or 361? At the risk of
putting my foot in my mouth, I don't think there exist 361 15-bit
numbers that satisfy minimum requirements (if the floating-point
average of any four code values is a code value, then the four code
values are identical).
On 11/15/07, Chris Fant [EMAIL PROTECTED] wrote:
On Nov 15, 2007 3:20 PM, Eric Boesch [EMAIL PROTECTED] wrote:
On 11/14/07, Chris Fant [EMAIL PROTECTED] wrote:
Based on more recent emails, this may not be useful anymore, but I
have a list of 361 32-bit numbers that satisfy these
Start with 500 random numbers.
Throw out the ones that violate the tests.
Hope that you are left with enough (361).
This actually worked all the way down to 15-bit numbers.
Neat. Was the 15-bit version for 81 values or 361? At the risk of
putting my foot in my mouth, I don't think
On 11/16/07, John Tromp [EMAIL PROTECTED] wrote:
On Nov 16, 2007 10:05 AM, Chris Fant [EMAIL PROTECTED] wrote:
Neat. Was the 15-bit version for 81 values or 361? At the risk of
putting my foot in my mouth, I don't think there exist 361 15-bit
numbers that satisfy minimum requirements
(compressed) bitmaps. You don't just keep a sorted list?
With (compressd) I mean that (most of) the bitmaps are relatively
sparse. For an isolated stone, the needed size only needs to be about
((2*19) +1) / sizeof(bitmap_element), ~= 2 or 3 32bit ints.
By skipping the leading and trailing zeros,
On Nov 16, 2007 10:05 AM, Chris Fant [EMAIL PROTECTED] wrote:
Neat. Was the 15-bit version for 81 values or 361? At the risk of
putting my foot in my mouth, I don't think there exist 361 15-bit
numbers that satisfy minimum requirements (if the floating-point
average of any four code
Neat. Was the 15-bit version for 81 values or 361? At the risk of
putting my foot in my mouth, I don't think there exist 361 15-bit
numbers that satisfy minimum requirements (if the floating-point
average of any four code values is a code value, then the four code
values are
On Nov 16, 2007 6:38 PM, Chris Fant [EMAIL PROTECTED] wrote:
Neat. Was the 15-bit version for 81 values or 361? At the risk of
putting my foot in my mouth, I don't think there exist 361 15-bit
numbers that satisfy minimum requirements (if the floating-point
average of any four code
11 matches
Mail list logo
