用A算法解决十五数码问题

openList[0] = temp; }

//找到目标状态

public ArrayList findResult() {

ArrayList result = new ArrayList();

result.Add(closedList[closedList.Count - 1]);

while (((_15DigitalNode)result[result.Count - 1]).Level != 0) {

} } }

result.Add(((_15DigitalNode)result[result.Count - 1]).parentNode); }

result.Reverse(); return result;