Penerapan Algoritma Runut-Balik Pada Aplikasi Permainan Sudoku

Purgianto, Felli Cisimus Sixta Puji (2013) Penerapan Algoritma Runut-Balik Pada Aplikasi Permainan Sudoku. Other thesis, Sekolah Tinggi Teknik Musi.

	Text IF-2013-308018-cover.pdf Download (1MB)
	Text IF-2013-308018-abstract.pdf Download (3MB)
	Text IF-2013-308018-tableofcontent.pdf Download (23MB)
	Text IF-2013-308018-chapter1.pdf Download (15MB)
	Text IF-2013-308018-chapter2.pdf Restricted to Repository staff only Download (56MB)
	Text IF-2013-308018-chapter3.pdf Restricted to Repository staff only Download (112MB)
	Text IF-2013-308018-chapter4.pdf Restricted to Repository staff only Download (57MB)
	Text IF-2013-308018-conclusion.pdf Download (4MB)
	Text IF-2013-308018-reference.pdf Download (9MB)
	Text IF-2013-308018-complete.pdf Restricted to Repository staff only Download (5MB)
	Text IF-2013-308018-summary_id.pdf Restricted to Repository staff only Download (533kB)

Abstract

In areas of the game, sudoku is one of a very popular logic game. Sudoku games can be classified into the type of Latin Square, with an additional constraint on the contents of each region separately. Sudoku board made up of nine pieces measuring 3 × 3 boxes (called blocks / subgrid) are arranged in such a way as to generate a large box measuring 9 × 9. This game is very difficult to play because they have to fill in the numbers in each column, with a unique number or none of the rows, columns and gridnya. With the existing difficulties created hint function. Hint's function is to provide assistance to fill in any blanks as a guide to determine the next value that will fill into the blanks in the game Sudoku. There are some troubleshooting with one algorithm using Backtracking algorithm based on DFS. With Backtracking algorithm based on DFS (Depth First Search) is solving the problem that is going on selesaiakan recursively and conduct problems in a systematic search for solutions to all possible solutions exist. Searches done by visiting the tree nodes. Trees that are traced dynamic tree, a tree that is constructed during the search for solutions takes place. search solution is complete when there are no more unvisited nodes of node that can be achieved. Testing of the algorithm implementation into the Backtracking Sudoku game between playing matches that manually using the settlement's easier with the completion or with the help of Backtracking algorithm and turnaround time faster Sudoku game.

Actions (login required)

View Item