i coded up a quick puzzley thing..... might add more levels and stuff but its just one puzzle now....

these are the somewhat complicated rules. the game takes place on a grid, and is divided into "rounds" that proceed as follows:

1. when you click "Split", all big blobs split into two small blobs

2. one of the two small blobs can move any distance on the grid but only horizontally, and the other can move any distance but only vertically. when you click a small blob, it will turn red and a bunch of blue blobs will appear; the blue blobs represent legal moves for the red blob (you click the blue blob to move the red blob there)

3. a blob is allowed to stay in the same square (it counts as a move of distance zero)

4. multiple small blobs are allowed to move onto the same square (in-game they just overlap each other)

5. (important! this is what makes the puzzle hard) horizontal-moving small blobs that are in the same column must make the same move. vertical-moving small blobs that are in the same row must make the same move. when you click a blob, it will also highlight all the other blobs that are forced to make the same move

6. once all small blobs have been moved, you can click "Grow" to end the round. the small blobs all regrow into big blobs, and small blobs that ended up on the same square are subsumed into one big blob

my code is kind of shitty and probably buggy so let me know if you manage to do anything that violates these rules

how did i come up with this terribly convoluted puzzle you ask. well its based on an open problem in theoretical computer science that i am working on. its not a famous problem with a $1000000000 prize or anything but its important to a small community of researchers. say a configuration of big blobs on the grid is "valid" if the topmost row contains at least one blob, and the leftmost column contains at least one blob. the problem is to formally prove that for all m x n grids (where m and n are arbitrary positive integers), every valid configuration is reachable from the initial configuration (with one big blob in the top-left). if you can figure this out then pm me and we can write a joint paper about it

html5 version:

love-game.net/blobpuzzlewindows version:

love-game.net/blobpuzzle.zipthe undo feature currently does not work in the html5 version (i used the gm built in save feature bc i was lazy) so i recommend the windows version if you can be bothered to download it