Jeong-AYeong's Projects
A* (A-Star) algorithm for finding the shortest path in a maze
A* algorithm visualization desktop application
Implemented with pygame, this script will find the shortest distance between two nodes using A* Algorithm
A python Maze solver using A* Algorithm.
ํธ์์ ์ ๋ฌผํ ์ฌ๊ณ ๊ด๋ฆฌ์ ๊ฒฐ์ ๋ฅผ ๋์์ฃผ๋ ํ๋ก๊ทธ๋จ
Haskell MOOC University of Helsinki
์ด๋๋ก๋ด๋ชจ๋ธ๊ธฐ๋ฐ A* ํ์ ์๊ณ ๋ฆฌ์ฆ์ ๊ฐ์
์ธ์คํ๊ทธ๋จ ๊ฐ์ง ๊ณ์ ์ ํน์ง ๋ถ์ ๋ฐ ๊ฐ์ง ๊ณ์ ์๋ณ ํ๋ก์ ํธ
Config files for my GitHub profile.
์์ ์ ์ฐจ๋ ๋ฒํธํ detect ๋ฐ ํ
์คํธ ๋ณํ(ocr) ํ๋ก์ ํธ
Implementation of A* baseline, A* lifelong and D* lite algorithm for the PACMAN world as per the research paper "D* Lite" by Sven Koenig and Maxim Likhachev.
์ํ ๊ณ์ฐ์ ์ํ ์ฝ๋๋ฅผ ์ ๊ณตํ๋ ํ๋ก์ ํธ
์ธ์คํ๊ทธ๋จ ํ์ด์ง๋ฅผ ๊ตฌํํ๋ ํ๋ก์ ํธ
In this project, the Pacman agent will find paths through his maze world, both to reach a particular location and to collect food efficiently. I implemented general search algorithms such as depth-first, breadth-first, uniform cost, and A* search algorithms which are used to solve navigation problems in the Pacman world.
MediaPipe๋ฅผ ์ด์ฉํ ์์ด์ธ์ ํ๋ก๊ทธ๋จ(๋์ปค๋ฅผ ํตํด ๋ฐฐํฌ)