SOLVING PUZZLE PROBLEM USING HEURISTIC SEARCH

Adinugroho, Daniel and Haryono, Esti (2006) SOLVING PUZZLE PROBLEM USING HEURISTIC SEARCH. Seminar Ilmiah Nasional Komputer dan Sistem Intelijen (KOMMIT 2006) . ISSN 1411-6286

[img]
Preview
Text
SOLVING PUZZLE PROBLEM USING HEURISTIC SEARCH_UG.pdf - Submitted Version

Download (49Kb) | Preview

Abstract

Puzzle is common example problems in basic Artificial Intelligence study. There are many types of puzzle problem. The one that will be discussed in this paper is one similiar to the Tetravex game. The puzzle has nine tiles. Each tile has four faces, top, bottom, left and right. Each tile also contains a number from 1-9. In the beginning, the puzzle is empty and the user should put each tile in the puzle.

Item Type: Article
Uncontrolled Keywords: Heuristic Search; Algoritm; Puzzle Problem
Subjects: A General Works > AI Indexes (General)
Divisions: Fakultas Ilmu Komputer dan Teknologi Informasi > Program Studi Sistem Informasi
Depositing User: Mr Reza Chandra
Date Deposited: 25 Feb 2014 04:38
Last Modified: 25 Feb 2014 04:38
URI: http://repository.gunadarma.ac.id/id/eprint/54

Actions (login required)

View Item View Item