An Automated Solution for Sudoku Puzzles

A tétel rövid nézete
dc.contributor.advisorNagy, Dávid
dc.contributor.authorGeevarghese, David
dc.contributor.departmentDE--Informatikai Karhu_HU
dc.date.accessioned2020-11-19T13:18:01Z
dc.date.available2020-11-19T13:18:01Z
dc.date.created2020-11-18
dc.description.abstractMy thesis is about finding an automated solution for Sudoku puzzles (2x2, 2x3, 3x3, and X-Sudoku). Sudoku is a puzzle where in you have to fill a 9x9 grid with numbers from 1 to 9 in such a way so each box, row and column only contains one occurrence of those nine numbers. I will be using the backtracking algorithm and regarding the problem as a Constraint Satisfaction Problem. I will mainly use Java and JavaFX to accomplish this goal.hu_HU
dc.description.correctorN.I.
dc.description.courseComputer Science Engineeringhu_HU
dc.description.degreeBSc/BAhu_HU
dc.format.extent40hu_HU
dc.identifier.urihttp://hdl.handle.net/2437/298717
dc.language.isoenhu_HU
dc.subjectsudoku solverhu_HU
dc.subjectCSPhu_HU
dc.subjectbacktrackinghu_HU
dc.subject.dspaceDEENK Témalista::Informatikahu_HU
dc.titleAn Automated Solution for Sudoku Puzzleshu_HU
Fájlok
Gyűjtemények
Theses (IK)