Generiranje in reševanje sudokuja

diplomsko delo

Katja Tuma (Author), Branko Šter (Mentor)

Abstract

V diplomskem delu so raziskani različni pristopi in algoritmi generiranja, ocenjevanja ter reševanja sudoku mreže. Cilj je ugotoviti, kateri pristopi in algoritmi so za posamezen del programa bolj učinkoviti ter kako se med seboj razlikujejo. Matematična uganka sudoku je neke vrste latinski kvadrat, katerega lastnosti narekujejo obliko rešitve problema ter posledično število možnih rešitev problema. Generiranje mrež lahko poteka na dva nasprotna si načina: generiranje s polnenjem prazne mreže ter generiranje z brisanjem vrednosti iz polne mreže. Generiranje mreže je s strani računalnika podoben problem kot reševanje mreže. Ocenjevanje težavnostne stopnje mreže je delikaten problem, saj je potrebno upoštevati tudi načine človeškega reševanja. S pomočjo prebrane literature in programske rešitve sem tekom diplomskega dela potrdila ugotovitve o časovni zahtevnosti reševanja sudoku mrež ter uporabnosti ocenjevanja težavnostne stopnje mreže s pomočjo entropije.

Keywords

latinski kvadrat;sudoku;generator;reševalnik;ocenjevalnik;računalništvo;računalništvo in informatika;univerzitetni študij;diplomske naloge;

Data

Language:	Slovenian
Year of publishing:	2014
Typology:	2.11 - Undergraduate Thesis
Organization:	UL FRI - Faculty of Computer and Information Science
Publisher:	[K. Tuma]
UDC:	793.2/.8:004(043.2)
COBISS:	10768724
Views:	795
Downloads:	177
Average score:	0 (0 votes)
Metadata:

Other data

Secondary language:	English
Secondary title:	Generating and solving Sudoku puzzles
Secondary abstract:	The thesis explores different approaches and algorithms for generating, grading and solving the sudoku grid. The aim of the thesis is to determine which approaches and algorithms are more efficient and how they differ from each other. Mathematical puzzle sudoku is a kind of Latin square, features of which dictate the form of a solution and, consequently, the number of possible solutions to the problem. Generating grids can be done in two opposite ways: generating with filling an empty grid and generating with deleting values from a full grid. Generating a grid is from a computer's perspective similar to solving one. Determining the difficulty level of a grid is a delicate problem, since it is necessary to consider human techniques of solving sudoku. With the help of listed literature and software solution I confirm, during the thesis, the findings on time complexity of solving sudoku grids and usefulness of grading sudoku grids by using information entropy.
Secondary keywords:	latin square;sudoku;generator;solver;grader;computer science;computer and information science;diploma;
File type:	application/pdf
Type (COBISS):	Bachelor thesis/paper
Study programme:	1000468
Thesis comment:	Univerza v Ljubljani, Fak. za računalništvo in informatiko
Pages:	50 str.
ID:	8739373