KJCKorea
Journal Central

@article{ART002235487},
author={Unil Yun and Yun EunMi},
title={Design and Implementation of a friendly maze program for early childhood based on a path searching algorithm},
journal={Journal of The Korea Society of Computer and Information},
issn={1598-849X},
year={2017},
volume={22},
number={6},
pages={49-55},
doi={10.9708/jksci.2017.22.06.049}

TY - JOUR
AU - Unil Yun
AU - Yun EunMi
TI - Design and Implementation of a friendly maze program for early childhood based on a path searching algorithm
JO - Journal of The Korea Society of Computer and Information
PY - 2017
VL - 22
IS - 6
PB - The Korean Society Of Computer And Information
SP - 49
EP - 55
SN - 1598-849X
AB - 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.
KW - maze traversal;path searching algorithm;early childhood
DO - 10.9708/jksci.2017.22.06.049
ER -

Unil Yun and Yun EunMi. (2017). 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, 22(6), 49-55.

Unil Yun and Yun EunMi. 2017, "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, vol.22, no.6 pp.49-55. Available from: doi:10.9708/jksci.2017.22.06.049

Unil Yun, Yun EunMi "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 22.6 pp.49-55 (2017) : 49.

Unil Yun, Yun EunMi. Design and Implementation of a friendly maze program for early childhood based on a path searching algorithm. 2017; 22(6), 49-55. Available from: doi:10.9708/jksci.2017.22.06.049

Unil Yun and Yun EunMi. "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 22, no.6 (2017) : 49-55.doi: 10.9708/jksci.2017.22.06.049

Unil Yun; Yun EunMi. 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, 22(6), 49-55. doi: 10.9708/jksci.2017.22.06.049

Unil Yun; Yun EunMi. 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. 2017; 22(6) 49-55. doi: 10.9708/jksci.2017.22.06.049

Unil Yun, Yun EunMi. Design and Implementation of a friendly maze program for early childhood based on a path searching algorithm. 2017; 22(6), 49-55. Available from: doi:10.9708/jksci.2017.22.06.049

Unil Yun and Yun EunMi. "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 22, no.6 (2017) : 49-55.doi: 10.9708/jksci.2017.22.06.049