2.png)
Algoritma Cellular Automata (CA) Dan Backtracking Untuk Simulasi Pencarian Jalan Pada Maze
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), BacktrackingTeks Lengkap:
PDFReferensi
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
DOI: https://doi.org/10.47007/komp.v6i2.464
Refbacks
- Saat ini tidak ada refbacks.
VISITOR COUNTER: