Method for Hua Rongdao Based on Breadth-First Search
一种改进的广度优先求解华容道问题的方法

Hua Rongdao is a very famous puzzled of China.In this paper,through analysis of Hua Rongdao,an efficient and convenient algorithm was used to express the layout.And then we use a Hash algorithm,which HashCode was found based on cumulative fold,to solve the problems.The experiment shows that this method is a very efficient way in finding the answer.