It is an interesting problem. Let’s go over the rules again. Players Chicken: takes shortest path to field (there could be multiple shortest paths) and away from eagle (maximise the distance between itself and eagle among shortest paths). Eagle: takes shortest path to chicken To solve the problem we have to assume it is played … Read more
So this is my solution, there are better ways you can use backtracking to generate sudoku, like just calling fuelleArray(fieldIndex, numberInField). With that, backtracking would be more visible and clear in the code and you won’t have to deal, like I had, with the cases when its on the end of a row. public static … Read more
Let’s try to understand the code step by step. First of all, we call the function solution(), which is what leads to the execution of the puzzle answer. Solution funcion: public void solution() { int y = 0; b[0] = -1; while (y >= 0) { do { b[y]++; //if last cell was unsafe or … Read more
The problem is that you’re both looping and recursing. print(“22”, “”, 0); will recurse into print(“22”, “a”, 1); print(“22”, “b”, 1); print(“22”, “c”, 1); print(“22”, “a”, 2); print(“22”, “b”, 2); print(“22”, “c”, 2); and your extra bits are the last three calls. Get rid of the loop over the input digits (you’re already doing that … Read more