Permana, Silvester and Bintoro, Ketut and Arifitama, Budi and Syahputra, Ade (2018) Maze Runner: Angel and Demon Path Finding Game Application using C-Theta* Algorithm. In: The 1st International Conference on Computer Science and Engineering Technology Universitas Muria Kudus.
![[thumbnail of 28776.pdf]](http://eprints.eai.eu/style/images/fileicons/application_pdf.png "28776.pdf")
PDF
28776.pdf
Download (1MB)
Abstract
Pathfinding algorithm is an algorithm used to find the shortest path between two locations. This algorithm is used by some puzzle and strategy games. In maze game, pathfinding algorithm is used to find the shortest path to reach the finish point. However, the usual pathfinding algorithm has not been
| Item Type: | Conference or Workshop Item (UNSPECIFIED) |
|---|---|
| Date Deposited: | 04 Mar 2026 11:36 |
| Last Modified: | 17 Apr 2026 15:23 |
| URI: | http://eprints.eai.eu/id/eprint/19818 |
Actions (login required)
- View Item