This work introduces a method for NP-class combinatorial problems using a vanilla Transformer. By combining Sudoku rules and guesses, the approach achieves SOTA results (99.8%). Solution length is analyzed via the Min-Sum Set Cover problem.

This study propose a comprehensive benchmark for evaluating ML-based SAT solvers on cryptographic problems.