Need some help...

This is a discussion on Need some help... within the C Programming forums, part of the General Programming Boards category; My code manage to build without errors, but it crashes when I try to run it. Anybody can give me ...

About my code...

New problem...

Ok, I manage to get the code working now, but now I have a new problem. I want to create an automatic mode so that the rubik cube can solve itself and shows the sequence of the operations used. Any ideas?

needs to be adjusted to handle multiple "back ups" in ply. After moves of 1, 3, 3, you need to back up 2 ply, for instance, not just one. That makes your next move 2.
The program prints the board array now, but even more helpful is getting it to print the line of moves as it goes through it's search.
If you change the lines array to print < deep right after the if(solved) break, line of code, then you can get a better reference for debugging the DFS.
The moves should be:
1
11
111
112
113
12
121
122
123
13
131
132
133
2
21
211
212
213
22
221
222
223
23
231
232
233
Which will solve this position:
b[0][0][0] = 8; b[0][1][0] = 3; b[0][2][0] = 2; b[0][3][0] = 5;
b[1][0][0] = 1; b[1][1][0] = 6; b[1][2][0] = 7; b[1][3][0] = 4;
Since this is a student's project, I'm going to refrain from posting any more code on this.
Original starting position of:
2684
1375
the first solution found for it was: 3 3 1 3 1 1 1