Analysis of Multiple Shortest Path Finding Algorithm in Novel Gaming Scenario

Zafar, Aqsa; Agrawal, Krishna Kant; Kumar, Wg. Cdr Anil

doi:10.1007/978-981-10-5903-2_132

Cited by 5 publications

(3 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Gaming is one of many scenarios where intelligence search is mostly used. For example, in a classic TicTacToe game (Hutahaean, 2018), an Indonesian popular traditional game of "Congklak" (Rahim et al, 2018b) and general pathfinding task in the game (Zafar et al, 2018).…”

Section: Related Workmentioning

confidence: 99%

A Comparative Study of Informed and Uninformed Search Algorithm to Solve Eight-Puzzle Problem

Hidayat¹,

Susanti²,

Wijaya³

2021

Journal of Computer Science

View full text Add to dashboard Cite

Problems in artificial intelligence can be solved using intelligent tracking methods through intelligent search mechanisms. Understandably, search algorithm performances are highly dependent on the problem solved. In this study, we evaluate and compare the performance of five uninformed and informed search (breadth-first search, depth first search, optimal search and best first search using two heuristic functions, namely mismatched tile and Manhattan distance) algorithms to solve the eight-puzzle game problem. For each algorithm, the numbers of raised and explored nodes were assessed and analyzed. Our experiment demonstrates that informed search with heuristic outperforms uninformed search significantly, both in terms of memory usage efficiency and computational power efficiency. On average, the informed search using heuristic requires only 5.33% of memory used by uninformed search and only 4.45% of computational power demanded by uninformed search. Boxplot analysis also confirms that informed search using heuristic also delivers more stable performance contrasted to uninformed search. These could be a concern for researchers and game developers to consider implementing the heuristically enhanced search algorithm to utilize memory and computational power efficiently to solve similar problems.

show abstract

Section: Related Workmentioning

confidence: 99%

A Comparative Study of Informed and Uninformed Search Algorithm to Solve Eight-Puzzle Problem

Hidayat¹,

Susanti²,

Wijaya³

2021

Journal of Computer Science

View full text Add to dashboard Cite

show abstract

“…The memory requirement of Breadth-first Search is high because it saves each level record [14] and this is its main limitation. It is mainly used to find the shortest path between any two nodes in a graph such as road networks, computer networks; social networks (e.g.…”

Section: Breadth-first Searchmentioning

confidence: 99%

A review on graph search algorithms for optimal energy efficient path planning for an unmanned air vehicle

Debnath

Omar

Latip

et al. 2019

IJEECS

View full text Add to dashboard Cite

<span>Unmanned Air Vehicle (UAV) has attracted attention in recent years in conducting missions for longer time with higher levels of autonomy. For the enhanced autonomous characteristic of UAV, path planning is one of the crucial issues. Current researches on the graph search algorithms under combinatorial method are mainly reviewed in this paper by keeping focus on the comprehensive surveys of its properties for path planning. The outcome is a pen picture of their assumptions and drawbacks.</span>

show abstract

“…In the discussion, game images from Age of Empire and Civilization V are provided but not yet clearly explained about the use and the application of the game. What can be drawn from this research is the attention to the A* algorithm make it seen as the best algorithm compared to the others [8].…”

Section: Rudimentarymentioning

confidence: 99%

Comparative Analysis of Pathfinding Algorithms A *, Dijkstra, and BFS on Maze Runner Game

et al. 2018

View full text Add to dashboard Cite

show abstract

Analysis of Multiple Shortest Path Finding Algorithm in Novel Gaming Scenario

Cited by 5 publications

References 2 publications

A Comparative Study of Informed and Uninformed Search Algorithm to Solve Eight-Puzzle Problem

A Comparative Study of Informed and Uninformed Search Algorithm to Solve Eight-Puzzle Problem

A review on graph search algorithms for optimal energy efficient path planning for an unmanned air vehicle

Comparative Analysis of Pathfinding Algorithms A *, Dijkstra, and BFS on Maze Runner Game

Contact Info

Product

Resources

About