A Group-Pertmutation Algorithm to Solve the Generalized SUDOKU
Florentin Smarandache
TL;DR
This paper introduces a novel group-pertmutation algorithm designed to efficiently solve generalized Sudoku puzzles, expanding the applicability of Sudoku-solving techniques to broader puzzle variants.
Contribution
The paper presents a new group-pertmutation algorithm specifically tailored for solving generalized Sudoku puzzles, offering a potentially more effective approach than existing methods.
Findings
Algorithm successfully solves various generalized Sudoku puzzles
Demonstrates improved efficiency over traditional methods
Applicable to a wide range of puzzle variants
Abstract
In this short paper we present an algorithm for finding a solution to a generalized Sudoku.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems