Strategi Menemukan Jalan Keluar Labirin dengan Waktu Tercepat Menggunakan Metode DFS

  • Mustika Rahmasuci
  • Husnul Hotimatus s
  • Maulia Azizah
  • Putri Wulandari
  • Diah Adistia A
  • Saiful Bukhori

Abstract

Depth-first search algorithm are blind search process and deepen search follow a single track until found goal. Maze is complicated network way and tortuous, also have many deadlock. Maze often become a challenge in a game like puzzle, which one there’s an object in start position have find way out on specify position. in this journal we’ll discuss about utilization DFS on maze and fastest time to find way out.

Published
2019-02-25
How to Cite
RAHMASUCI, Mustika et al. Strategi Menemukan Jalan Keluar Labirin dengan Waktu Tercepat Menggunakan Metode DFS. INFORMAL: Informatics Journal, [S.l.], v. 3, n. 1, p. 12-16, feb. 2019. ISSN 2503-250X. Available at: <https://jurnal.unej.ac.id/index.php/INFORMAL/article/view/9852>. Date accessed: 02 apr. 2020. doi: https://doi.org/10.19184/isj.v3i1.9852.