poj1915求移动棋子到特定位置的最少次数,BFS经典题目-poj1915 for mobile pawn to a specific location of the minimum number, BFS Classic Title

ACM POJ题目 2159.cpp 1918.cpp 1887.cpp 1835.cpp 1458.c 1258.c 1125.c-ACM POJ 2159.cpp 1918.cpp 1887.cpp 1835.cpp 1458.c 1258.c 1125.cpp