At the ETH Zurich Probabilistic Computing Hackathon I reframed the recursion in TRM/PTRM/GRAM as annealed sampling on an energy-based model, ran the whole loop on Extropic’s THRML simulator, and solved the hardest known Sudoku as a ground-state problem. The recursion buys roughly 7x fewer sampling sweeps, and when the network is confidently wrong the physics rescues it. It won 2nd place.
