Back to bitmaps with most of the bits at zero... Let's take an extreme case, a bitmap with one out of 32 bits set. We're assuming this map is a member of a class with a significant property which we want to recognize.
If it were a perfectly random bitmap, the probability of it turning out this way would be quite low. We can't expect that the actual probability that a bit will be 1, in a bitmap with this property, is 1/32. But from what we know so far, that is our best guess. If that's true, is it likely that this particular bit being on is purely by chance. Not likely; someone with more facility with statistics can probably tell us exactly how likely, and that may be useful. Meanwhile, in deciding which bits to mask out for a map intended to test for this particular property, I am guessing that I'd want to make the probability of this bit being masked is (at most) 1/32, while the ideal probability that any particular other bit in the test map should be masked might be 31/32. ? A good conjecture? Or just plausible? Anyone here have ideas on this? Forrest Curo ----------------------------------------- This email was sent using AIS WebMail. http://www.americanis.net/ _______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
