Course:CPSC312-2024/Killer-Sudoku

Authors:　Rustam Nassyrov, Dora Qi

What is the problem?

Killer Sudoku is one of the most popular Sudoku variants. The Japanese name for Killer is Samunamupure, and it is also known as Sum-Sudoku.

The puzzle has no givens, but it has the same grid format as a standard Sudoku. This grid is covered by cages, each of which enclose 2 or more cells. The cages are usually marked with dotted outlines or with separate background colors. The top-left cell is labeled with a cage sum, which is the sum of all solution digits for the cells inside the cage. Unless otherwise stated, all Killer puzzles follow the Killer Convention: all digits in a cage should be distinct. In Killer nomenclature, the boxes are often referred to as nonets.

We will be developing a web interface using prolog that will display killer sudoku puzzles, and allow users to fill in and verify their solutions and generate solutions.

What is the something extra?

- We will develop a reactive web interface.

- We will generate random killer-sudoku boards with the ability to select difficulty level.

What did we learn from doing this?

- How to create an http server in Prolog

- How to generate random solutions

- How to use Prolog to search for solutions and grounding variables.

Work division

Rustam: puzzle generator, web UI, server API endpoints

Dora: puzzle solver, server API endpoints

Links

GitHub Repo: https://github.com/DoraQi/killer-sudoku

Course title
Course title
Instructor:
Email:
Office:
Office Hours:
Class Schedule:
Important Course Pages