Modifications Greedy Best-first Search To Efficiency Memory of Pathfinding Algorithm In Hajjgame
This paper describes the research conducted to improve the efficiency of memory usage algorithms pathfinding on interactive learning media in the form of 3-dimensional game, namely HajjGame. Modifications made is to reduce the number of nodes that must be checked at while agent running pathfinding a...
Saved in:
Main Author: | FAJAR HARIADI (NIM: 23207132), AGUS |
---|---|
Format: | Theses |
Language: | Indonesia |
Online Access: | https://digilib.itb.ac.id/gdl/view/11748 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Institut Teknologi Bandung |
Language: | Indonesia |
Similar Items
-
Scalable distributed depth-first search with greedy work stealing
by: Jaffar, J., et al.
Published: (2013) -
Hexarotor using A*algorithm pathfinding
by: Ho, Don Shusheng
Published: (2015) -
PLAYER'S SCORE ACHIEVEMENT SCHEMA USING COMBINATION OF EXPERIENCE POINT AND EDUCATIONAL CREDIT IN HAJJGAME
by: AGUNG YULIANTO (NIM: 23207090), ARDHIAN -
Pathfinder II
by: Bersales, Luther, et al.
Published: (2002) -
Experimental implementation on external memory breadth-first search algorithm
by: Poh, Eric Jian Wen.
Published: (2011)