All nodes

id	kind	status	title
brute-force-enumeration	route	INVALIDATED	Claimed exhaustive enumeration of all partial tilings
deficient-board-tromino-tiling	claim	OPEN	One-square-deficient power-of-two boards are L-tromino tileable
domino-color-balance	claim	ESTABLISHED	Every domino covers one dark and one light square
enumeration-lower-bound	claim	ESTABLISHED	Exhaustive enumeration exceeds any feasible case budget
mutilated-board-color-count	claim	ESTABLISHED	Opposite corners share a color, leaving a 32–30 imbalance
mutilated-board-untileable	claim	ESTABLISHED	The mutilated chessboard admits no domino tiling
prove-color-balance	route	COMPLETE	Direct proof by adjacency
prove-color-count	route	COMPLETE	Direct computation of the color census
prove-enumeration-lower-bound	route	COMPLETE	Counting bound on partial placements
quadrant-induction-step	claim	OPEN	The quadrant split preserves the induction hypothesis
via-color-counting	route	COMPLETE	Color-counting argument
via-quadrant-induction	route	OPEN	Induction on n via the quadrant split