Özet (EN)
ABSTRACT: In this thesis, Maze Router Problem (MRP) solved by using Connected Component Labeling, Depth First Search, Lee and A* Algorithms. The main goal of this research is to find a complete set of path which directs an agent to move from the Source node in the Maze towards a Target node in a Single-layer routing environment. In experiments different sized Maze Router Problem (MRP) instances are solved by using different Algorithms. From the results obtained we can conclude that Lee and A* Algorithms finds the shortest path for all the problem instances. It can also be concluded that A* Algorithm is the fastest Algorithm that finds the shortest path. Keywords: Maze, Maze Router, Maze Router Problem, Connected Component Labeling Algorithm, Depth First Search Algorithm, Lee Algorithm, A* Algorithm. …………………………………………………………………………………………………………………………
Yazar
Dr. Nashat Salih Abdulkarim Alsandi
Bu Yayına Nasıl Atıf Yapılır
Nashat Salih Abdulkarim Alsandi (Master Thesis). Maze Router: Collected Techniques, 2015, Eastern Mediterranean University, Department of Computer Engineering.
Anahtar Kelimeler
Lisans
Tüm Hakları Saklıdır
Bu eser belirtilen lisans koşulları altında paylaşılmaktadır.
Eastern Mediterranean University tezlerinden daha fazlası
- An Investigation on Time and Cost Overrun in Construction Projects(2012)
- Radial Power-Law Position-dependent Mass, Cylindrical Coordinates, Spectral Signatures(2015)
- Predicting performance level of reinforced concrete structures subject to corrosion as a function of time(2012)
- Discussion of Conservation Approaches for the Selected Heritage Buildings in the Walled City of Famagusta(2019)
- High School Students' Learning Styles in North Cyprus(2011)
- Afyonkarahisar İl Merkezinde Yaşayan 18 Yaş ve Üzeri Kadınların Diyet Posasıyla İlgili Bilgi Düzeylerinin ve Posa Alım Miktarlarının Belirlenmesi(2018)