Location

Portland State University

Start Date

4-5-2016 1:30 PM

End Date

4-5-2016 3:00 PM

Subjects

Graph theory, Sudoku, Combinatorial analysis

Description

Encoding Sudoku puzzles as partially colored graphs, we state and prove Akman’s theorem [1] regarding the associated partial chromatic polynomial [5]; we count the 4x4 sudoku boards, in total and fundamentally distinct; we count the diagonally distinct 4x4 sudoku boards; and we classify and enumerate the different structure types of 4x4 boards.

Description

Faculty Advisor: John Caughman

Persistent Identifier

http://archives.pdx.edu/ds/psu/17164

Share

COinS
 
May 4th, 1:30 PM May 4th, 3:00 PM

Math and Sudoku: Exploring Sudoku Boards Through Graph Theory, Group Theory, and Combinatorics

Portland State University

Encoding Sudoku puzzles as partially colored graphs, we state and prove Akman’s theorem [1] regarding the associated partial chromatic polynomial [5]; we count the 4x4 sudoku boards, in total and fundamentally distinct; we count the diagonally distinct 4x4 sudoku boards; and we classify and enumerate the different structure types of 4x4 boards.