본문 바로가기
  • Home

Units' Path-finding method Proposal for A* Alaorithm in the Tilemap

  • Journal of The Korea Society of Computer and Information
  • Abbr : JKSCI
  • 2004, 9(3), pp.71-77
  • Publisher : The Korean Society Of Computer And Information
  • Research Area : Engineering > Computer Science

이세일 1

1공주대학교

Candidate

ABSTRACT

While doing games, units have to find goal. And according to algorism, there is great difference in time and distance. In this paper, the researcher compared and described characteristics of each of the improved algorism and A* algorism by giving depth-first search, breadth-first search and distance value and then argued algorism. In addition, by actually calculating the presumed value in A* algorism, the researcher finds the most improved value. Finally, by means of comparison between A* algorism and other one, the researcher verified its excellence and did simple path-finding using A* algorism.

Citation status

* References for papers published after 2022 are currently being built.