Yup - Checkerboard patterns.  I've used it before in drawing things like this:
. . . . .
 . . . . .
. . . . .
 . . . . .

For(A,1,8)
For(B,1,16)
If fpart(A/2) xor fpart(B/2)
Output(A,B,"O
End
End

Things like this.

I'm not to sure if the title really says what I mean. But what I'm looking for is a good way to access or check or just be able to do something to the spots surrounding a single spot. But also, now that I think about the situation, I just need a way to get access the points surrounding a point. Whether eight, five, or three (I think those are all the options...).

Code: [Select]

123
4█5
678

█1
12

12
█3
45
Those are the points I mean. I have one method that in theory would work, haven't tested it yet, but it only works for checking all eight points. Which might work for the situation but if someone knows a better way I'd like to hear it

Thanks for any help.

You know, something like that would be VERY useful if I decided to do that dynamic bit-based tilemapper I wanted to make at one point in Axe, where walls are different depending of if there's a floor sprite at the top, bottom, left or right.

Nice. I want to give this a try because I had some RPGs that used maps where each tile was 1 bit and, while they are limited, those maps are really small in size.

EDIT: There was also a screenshot showing this in action:

Original topic:
http://ourl.ca/6544/106719

EDIT: I think they are called automated tiles.

But the glitch is only if the If statement is false. I ran both versions, mine and yours, and yours is technically slower (it's negligible). It's odd, I know, but ya. It doesn't really matter though.

Well both the ones he just showed are the same size, it looks like anyways, and guarantee no slow down but when I tested his original one and mine I didn't experience any at all when I ran mine.

BrandonW fixed it, I believe. (Him or penguin, but I'm fairly sure it was BrandonW.)