본문 바로가기
  • Home
Basic Search

Design and Implementation of a friendly maze program for early childhood based on a path searching algorithm

  • Journal of The Korea Society of Computer and Information
  • Abbr : JKSCI
  • 2017, 22(6), pp.49-55
  • DOI : 10.9708/jksci.2017.22.06.049
  • Publisher : The Korean Society Of Computer And Information
  • Research Area : Engineering > Computer Science
  • Received : January 7, 2017
  • Accepted : June 7, 2017
  • Published : June 30, 2017

Unil Yun 1,  Yun EunMi 2

1세종대학교
2백석예술대학교

Accredited

ABSTRACT

Robots, games and life applications have been developed while computer areas are developed. Moreover, various applications have been utilized for various users including the early childhood. Recently, smart phones have been dramatically used by various users including early childhood. Many applications need to find a path from a starting point to destinations. For example, without using real maps, users can find the direct paths for the destinations in realtime. Specifically, path exploration in game programs is so important to have accurate results. Nowadays, with these techniques, diverse applications for educations of early childhood have been developed. To deal with the functions, necessity of efficient path search programs with high accuracy becomes much higher. In this paper, we design and develop a friendly maze program for early childhood based on a path searching algorithm. Basically, the path of lineal distance from a starting location to destination is considered. Moreover, weight values are calculated by considering heuristic weighted h(x). In our approach, A* algorithm searches the path considering weight values. Moreover, we utilize depth first search approach instead of breadth first search in order to reduce the search space. so it is proper to use A* algorithm in finding efficient paths although it is not optimized paths.

Statistics

  • 404 Viewed
  • 139 Downloaded

Tools

Issue List

Citation status

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

This paper was written with support from the National Research Foundation of Korea.
Basic Search Advanced Search