三维张量 Sinkhorn-Knopp 连续松弛求解数独。将数独视为 9×9×9 概率张量连续优化问题,通过熵减和交替投影到四个约束集求解,无需搜索树或约束传播。含 Phistomefel 环计算分析。
python entropy sudoku tensor optimal-transport open-research continuous-optimization sinkhorn-algorithm one-person-lab neural-solvers phistomefel-ring
-
Updated
May 24, 2026 - Python