八数码问题的C++实现，最经典的广度有限算法-eight digital realization of the C and classic algorithms limited breadth

采用有界深度优先搜索算法求解八数码难题，代码简单易懂-Using bounded depth-first search algorithm for Eight puzzle, the code easy to understand

八数码难题，又称九宫格问题，也是我们平时玩的华容道，用分支限界法解决该问题-Eight digital problem, also known as the squared problem, we usually play Huarong, branch and bound method to solve the problem