Abstract

Two methods are presented for counting small ‘essentially different’ sudoku puzzles using elementary group theory: one method (due to Jarvis and Russell) uses Burnside's counting formula, while the other employs an invariant property of sudoku puzzles. Ideas are included for incorporating this material into an introductory abstract algebra course.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call