ePrints.FRI - University of Ljubljana, Faculty of Computer and Information Science

Constructing and solving of Sudoku

Tadej Bukovec (2018) Constructing and solving of Sudoku. EngD thesis.

Download (1964Kb)


    The goal of the thesis is to study how to create and solve a sudoku puzzle. We will look into the individual components which every sudoku puzzle contains. Furthermore, we will take a closer look into the exact set cover problem and how sudoku puzzle can be represented as one. We will present how to represent a sudoku puzzle so that our program can use it for solving. Sudoku solver was created using "Algorithm X'', using Java programming language. We will get better acquainted with an alternative way to implement "Algorithm X'', the "Dancing Links'' method which unfortunately was not implemented. With the help of time and space complexity analysis we will compare both implementations and also have a closer look at the limitations of our implementation. After that, we will have a look at how to create a custom sudoku grid which consists of multiple other sudoku grids. We also mention problems which we can encounter during the creation. Lastly, a simple user interface proposal will be introduced, using HTML and javascript, which enables users to create any kind of sudoku they wish.

    Item Type: Thesis (EngD thesis)
    Keywords: Algorithm, Java, NP-completeness, complete coverage problem.
    Number of Pages: 43
    Language of Content: Slovenian
    Mentor / Comentors:
    Name and SurnameIDFunction
    doc. dr. Andrej Brodnik5540Mentor
    Link to COBISS: http://www.cobiss.si/scripts/cobiss?command=search&base=51012&select=(ID=1537703875)
    Institution: University of Ljubljana
    Department: Faculty of Computer and Information Science
    Item ID: 4042
    Date Deposited: 26 Jan 2018 14:08
    Last Modified: 02 Feb 2018 12:34
    URI: http://eprints.fri.uni-lj.si/id/eprint/4042

    Actions (login required)

    View Item