DSproject Intro: make use of data structure knowledge Use union find set to generate the maze Use AVLTree to store the information and speed up the query efficiency Use A* to find a shortest path to the target