Made a puzzlescript web toy. Colour some procedurally generated maps in “Four Colour Theorem” – [Author’s description]
I enjoyed that game a ton, despite its short length!
But how do you know the levels will always be solvable?!?!?!
Whoops, it seems the commenting app ate my tag.
It’s a computationally proven property of 2d maps. If you find an unsolvable configuration, notify the nearest mathematician right away! [1] https://en.wikipedia.org/wiki/Four_color_theorem [2] https://mathworld.wolfram.com/Four-ColorTheorem.html
Apparently anything involving angle brackets is digested by the commenting system, even if it’s a non-HTML tag like “sarcasm”.
The game would be more fun on a torus. Just saying.
I enjoyed that game a ton, despite its short length!
But how do you know the levels will always be solvable?!?!?!
Whoops, it seems the commenting app ate my tag.
It’s a computationally proven property of 2d maps. If you find an unsolvable configuration, notify the nearest mathematician right away!
[1] https://en.wikipedia.org/wiki/Four_color_theorem
[2] https://mathworld.wolfram.com/Four-ColorTheorem.html
Apparently anything involving angle brackets is digested by the commenting system, even if it’s a non-HTML tag like “sarcasm”.
The game would be more fun on a torus. Just saying.