private static void testAlgorithm(State state) { PuzzleSolver solver = new NonRecursiveAStarPuzzleSolver(); State winner = solver.solve(state); ArrayList<State> path = new ArrayList<>(); while (winner.parent != null) { path.add(winner); winner = winner.parent; } for (int i = path.size() - 1; i >= 0; i--) { HelpfullAlorithms.printInfo(path.get(i)); } }