Shortest path problem is a problem of finding a path that minimizes the cost of connecting two nodes in a weighted graph. A∗algorithm for solving shortest path search has been applied in various fields such as path navigation systems, automatic robot planning and VLSI design. However, in recent years, the scale of graphs has become large. We need to solve the problem faster and with less power consumption. In this study, we propose a hardware accelerator for solving the shortest path problem using A∗algorithm based on HDA∗(Hash Distributed A∗) using FPGA. In evaluation we compare execution time and power consumption between CPU, GPU and FPGA. FPGA was able to solve Maze problem using the least amount of power. The energy efficiency of FPGA was up to 9 times higher than that of CPU.