Algoritma Cellular Automata (CA) Dan Backtracking Untuk Simulasi Pencarian Jalan Pada Maze

Syopiansyah Jaya Putra, Yusuf Durachman, M. Qamarul Huda

Sari


Human being wishes to finish problems and gain advantages as much as possible with efficiency of resources.The research discusses and compares the use of algorithms: back-tracking and cellular automata (CA) to look for the best way and solution. The main objective of this research is to learn the characteristic of CA and backtracking methos with their implementation at seeking walke at maze. It was found that CA method is more effective than backtracking method.

Keywords:  Cellular Automata (CA), Finite Automata (FA), Backtracking

Teks Lengkap:

PDF

Referensi


Ardiyana dan Adityarani, “Analisis Penerapan Algoritma Backtracking Dalam Penca-rian Solusi Game “Mummy Maze Deluxe”, 2005

Fowler, Martin, ”UML Distilled”, Edisi ke-3. Penerbit Andi, Yogyakarta, 2004

Gardner, Martin. “Mathematical Games The Fantastic Combinations of John Con-way’s New Solitaire Game Life”, Scientific American 223, October 1970

Hariyanto, Bambang, “Teori Bahasa, Otomata, dan Komputasi Serta Terapannya”. Penerbit : Informatika, Bandung, 2004.

Hermawan, Benny, “Menguasai Java 2 dan Object Oriented Programming”, Penerbit : Andi, Yogyakarta, 2004.

Hornby, A S. “Oxford Advanced Learner’s Dictionary Of Current English”, Fifth Edition, Oxford University Press, Oxford,1995.

John, Rajeev dan Jeffrey, ”Toeri Bahasa Automata”, Edisi 2, Penerbit Andi, Yogyakarta, 2001.

Limanto, Susana dan Anton Muljono. “Algoritma dan Pemrograman”. Penerbit: Dinastindo, Jakarta, 2002.

Munir, Rinaldi, “Buku Teks Ilmu Komputer Algoritma dan Pemrograman dalam Bahasa Pascal dan C”, Edisi 2, Penerbit Informatika, Bandung, 2002.

Nasuhi, Hamid dkk, “Pedoman Penulisan Karya Ilmiah”, Cetakan pertama, Penerbit : CeQDA, Jakarta, 2007.

Nazir, Moh, “Metode Penelitian”, Penerbit: Ghalia Indonesia, Jakarta, 985.

Preiss, Bruno, “Abstract Backtracking Solvers”, 1997.

Pressman, Roger S, “Rekayasa Perangkat Lunak”, Edisi 1, Penerbit: Andi, Yogyakarta, 2002.

Primanio, “Pencarian Jalan Keluar Labirin Dengan Metode Wall Follower, 2007.

Pullen, Walter D, “Think Labyrinth”, Maze Algorithms, 2001.

Rucker, Rudy, “Getting Started with Cellular Automata”, Cellular Automata Laboratory, 1990.

Sarkar, Palash, “A Brief History of Cellular Automata”, ACM Computing Surveys, Vol 32, No. 1, March 2000.

Schatten, Alexander, “Cellular Automata”, Digital World, 1999.

Sediyono, Eko, “Teknik Kompilasi Teori dan Praktek”. Penerbit : Yogyakarta, 2005.

Slamet, Sumantri dan Heru Suhartanto,”Teknik Kompulasi”, Penerbit: Elex Media Komputindo, Jakarta, 1992.

Suhendar, A dan Hariman Gunadi, ”Visual Modeling Menggunakan UML dan Rational Rose”, Penerbit: Informatika, Bandung, 2002.

Suryadi,MT. “Pengantar Analisis Algoritma”, Edisi Pertama Cetakan ke-5, Penerbit : Gunadarma, Jakarta, 1996.

Tarakanov dan Prokaev, “Pada jurnal Mengidentifikasi Cellular Automata dengan immunocomputin”, 2006.

Toffoli, Tomasso, Norman Margolus, “Cellular Automata Machine: A New Environment for Modelling”, The MIT Press, Cambridge Massachusetts, 1991.

Vollmar, “John von Neumann dan Cellular Automata self-reproducing”, 2005.

Weimar, Joe R, “Simulation with Cellular Automata Lecture Notes”, Technical University Braunschweig Institute of Scientific Computation, 1996.

Yacoubi dan Jacewicz, “Pendekatan Program Genetik untuk Identifikasi Struktur Cellular Automata”, 2006.

http://www.astrolog.org/labyrnth/algorithm.html. Diakses pada 26 Desember 2007.

http://www.brpreiss.com/books. diakses pada 5 Januari 2008

http://www.ifs.tuwien.ac.at/~aschatt/info/ca/ca.html. diakses pada 23 September 2007

http://www.mathcs.sjsu.edu/faculty/rucker/celdoc/chap1.html. diakses pada 19 September 2007

http://www.tubs.de/institute/WiR/weimar/ZAscript. diakses pada 31 Oktober 2007


Refbacks

  • Saat ini tidak ada refbacks.


VISITOR COUNTER:

gerEGGe