@sol_hsa@mastodon.gamedev.place
Post #3121064
2026-04-25 19:07 UTC
@thomastc@mastodon.gamedev.place I'm sure there's some way to prove it.
Or give the problem to some people who solve advent of code puzzles in five lines of python that run for 5 milliseconds.
Replies (1)
-
@ashdnazg@fosstodon.org 2026-04-27 13:43
@sol_hsa@mastodon.gamedev.place @thomastc@mastodon.gamedev.place You can just take a subset of 2x2 from the 3x3, and since these dice can only be rotated in the same manner as the regular 2x2 case, it's clear that you can't reach all possible states for this 2x2 subset and therefore for the entire 3x3.