press h to hide variables and s to show them back in this project two cats are on a grid, and they both do one move at a time they can move to any square orthogonally, or diagonally, and whenever they move to a square, the square gets filled. although the important rule is that any cat can't move to a square that is already filled the goal is to make the other player have no squares to move to, then you win now play
This is inspired by the challenge from survivor/outlaster and I used the grid list tutorial which helped update i added a menu screen so you can change the tile size in order to stay true to the original openprocessing version, although if the tile size is small it starts to lag update 2, i changed it so it doesn't lag as much, and i added a tile density tool to change the chance that a tile will be filled when starting
