PENYELESAIAN PUZZLE SUDOKU MENGGUNAKAN ALGORITMA BRUTE FORCE DAN BACKTRACKING
Sudoku games is the most popular Numeric Puzzle Games in the world. This game requires you to fill in the numbers on a blank column matrix with certain regulations. This study will discuss how to solve Sudoku primarily to take advantage of the Brute Force Algorithm and Backtracking by trying all possible contents of the box element of the matrix. This testing process using black box method, where the program uses four levels of Sudoku puzzle consists of three levels of difficulty beginner level, intermediate level, advanced level, expert level, master level. Sudoku generally consists of a table with the number of boxes 9 x 9, which made the area (region) 3 x 3. Questions Beginners and Intermediate is used. Examiners performed by using an Intel Pentium III 550MHz processor with a 1.6 GHz Core2 Duo with clock speed 694ms and 320ms for about the first and second largest known differences exist at the level of the processor.
Davis, Tom. 2010. The Mathematics of Sudoku. Diambil dari: http://www.geometer.org/mathcircles. (20 Juni 2011).
Gurari, Eitan, 1999. Data Structures Chapter: General Algorithms & State Search Algorithms. www.cse.ohiostate.edu/~gurari/course/cis680/cis680 No1.html##QQ1-29-103. (24 Juni 2011).
Jussien, Narendra. 2007. A-Z Sudoku. ISTE Ltd.
Kadir, Abdul. 2007. Dasar Pemrograman Java 2. Yogyakarta: ANDI OFFSET.
Mepham, Michael. 2005. Solving Sudoku. Crosswords Ltd.
Omimura, Satsuko. 2009. Sudoku The Black Hat. Jakarta: Prestasi Pustaka.
Abstract viewed = 28 times
PDF downloaded = 19 times
Copyright (c) 2013 Andreas Yusuf & Hendra
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.