- Max Heap Data Structure Implemented with Python List
- Simple implementation of nxn Dense Matrix in Java
- JS Procedural Hangman
- Unit test for class converting between DTOs and entities
- Converting graphviz (dot) files to mxGraph (draw.io) files
- Looking for a Sci Fi story - mining colony with robots?
- Where did Percy sleep when he was away from the Weasleys?
- Soundtrack (background music) Stargate SG-1 9x06 (Beachhead)
- sf apocalyptic short story probably from the 50s
- In Twilight, could the vampire head still live if only the body was burned?
- Left join with WHERE (microsoft access SQL)
- What Happens to dirty pages if the system fails before the next checkpoint?
- Photoshop - slice and save image - can't get save dialog. Has something changed?
- what graphic designing tool is used by big platforms like Facebook & Google?
- Looking for Photoshop script to batch replace all black portions into green color in all images in a folder?
- Heal edges between shapes
- What attacks exs
- How to detect a scan on a local machine?
- Why is the Schwarzschild radius of a Schwarzschild black hole $\frac{2GM}{c^2}$?
- Schrödinger's variational method

# How to determine the size of the complete game tree for basic [M]?

You can read the rules of the game here, or actually play it free on the mobile mbrane app, but it's not required to address the question.

Essentially: players take turns placing integers onto an empty Sudoku until no more integers may be legally placed.

Part of the complete gametree involves ~6.67x10²¹ complete Sudoku, reduced for rotation but not substitution because the integers have magnitude.

(Full disclosure: this part of the tree is almost entirely meaningless as strategic placement of the integers, influenced by the topology, seems to always result in incompletable Sudoku, which leads to the real problem.)

Here is an image to illustrate how the dead sectors occur, for those interested. (x's mark the dead sectors):

At some point I plan to figure out how to derive total number of broken Sudoku--dead sectors can be created with as few as 9 placements--but for now I just want to make sure I understand how the exponential expansion of placement sequence inter