Reply to Re: Error in map_tile(); documentation.
If you don't have an account, just leave the password field blank.
I'll go one further: The engine counts 128 tiles per tileset (probably a power of 2 was chosen because that makes division and modulo calculations faster... even though the modulo operator isn't used in the original Dink source), with 12 tiles per row. What does this mean for the amount of rows? You might in theory get 10 full rows, and 8 tiles on the 11th row.
If the engine doesn't do any bounds checks on the row of tiles (and I haven't seen it in the code, but I may have missed something), this may mean that you *can* have tilesets of 600x550, where only the last 4 tiles on the last row would be unusable.
Not that this matters for the contest, as we can't add new tilesets, but it's something to experiment with
Edit: If that indeed works, then the upper bound isn't 5355 either, but 5375.
If the engine doesn't do any bounds checks on the row of tiles (and I haven't seen it in the code, but I may have missed something), this may mean that you *can* have tilesets of 600x550, where only the last 4 tiles on the last row would be unusable.
Not that this matters for the contest, as we can't add new tilesets, but it's something to experiment with
Edit: If that indeed works, then the upper bound isn't 5355 either, but 5375.
