I built 3D Minesweeper in Three.js – real cube grid, up to 26 neighbors, with a constraint-based No-Guess generator

Side project I've been working on for a few months: Minesweeper in a real 3D cube grid built with Three.js.

The grid is a genuine 3D structure – each cell has up to 26 neighbors (vs. 8 in classic 2D). That one change breaks all the usual solving strategies and required building everything from scratch.

What's inside technically:

- No-Guess board generator: starts from a random valid mine placement, then runs a subset-constraint solver to verify full logical solvability before presenting the board

- Logic Solver: uses single-cell deduction, constraint subtraction and subset analysis – explains every step in plain language via speech bubbles

- Sub-region detection: on large grids (6³–8³) it automatically isolates logically independent border zones

- Rendering: pure Three.js, ~4000 lines single HTML file, 5 grid sizes (4³ to 8³ And Enterprise Geometrie in Level 6 :-) ), 5 mine densities. Play free: https://minesweeper3d.online/ Happy to talk about the Three.js setup or the solver algorithm!