Penyelesaian Puzzle Sudoku Menggunakan Pemrograman Linear Integer

Abstract

Sudoku can be viewed as a puzzle in mathematics. Players must fill in a n2 × n2 matrix which is containing some given enteries, so that each row, column, and n × n mini grid contains each integer 1 through n2. The objectives of this research are to study the traditional Sudoku puzzle, Sudoku X puzzle (diagonal Sudoku) and use branch and bound method, to find the relation between the number of possible solution with the size of sudoku, and the number quantity givens. The solutions are determined using branch and bound method that was implemented on m-file script. We can find the relation between the number of possible solution with the size of sudoku, and the number quantity givens. On the other hand, we can not find such relation for general size of sudoku and general configuration