Re: One for the programmers or maths/logic geeks

Snidely <Snidely.too@[EMAIL PROTECTED]
> wrote:
> On May 11, 2:52 pm, xhos...@[EMAIL PROTECTED]
 wrote:
> > How im****tant is the even coverage?  I'd be tempted to just make it
> > fly around at pseudo-random (or maybe depth-first systematically),
> > checking each non-checked square before entering it and remembering
> > the result for future use. That way it would cover all accessible
> > land regardless of the shape, although perhaps not evenly.
> I'd be tempted to just set it up as a random walk, choosing dir->next
> if dir-Owner !match.  And let it wind its own way through the plot,
> rather than manually moving it.  You only have to have it move one
> square at a time at some arbitrary interval ~= len(birdsong).  And why
> bother remembering?

Because if you remember, once you've found all the contiguous space, 
1) you no longer have to check, which makes the code more efficient, and 
2) (presumably) future objects can inherit the knowledge, so they don't  
   have to check either, which makes the whole environment more 
   efficient, and 
3) it makes the code ****table, because then anybody can start the object 
   in any space, and it'll find its own borders. If he hardcodes the 
   space it's allowed to go in, it only works in his space.

-- 
Huey