CPMagical CP Library

Problem solution · Java

The Knight’s Tour

The Knight’s Tour: a Java solution using depth-first search. Learn the idea, check the complexity, and read the full code, with credit to walkccc LeetCode Solutions.

Technique
Depth-first search
Source
walkccc LeetCode Solutions
Length
27 lines
Start with the idea.

Try the problem first. If you get stuck, read the approach below, then write your own solution. The full code is at the bottom.

Approach

Depth-first search

For The Knight’s Tour, the implementation follows one branch at a time, making it suitable for components, trees, backtracking, or dependency exploration.

  1. Define the state carried into one recursive or stack frame.
  2. Mark or choose the current state before exploring children.
  3. Combine child results or undo the choice when the branch finishes.

Code notes

  • 27 lines of Java from the credited upstream file 2664.java.
  • The implementation visibly relies on sequence storage.
  • 1 loop block detected, together with recursive traversal.

Complexity

Count unique states for graph traversal; for backtracking, count the branching factor and maximum depth.

Check the problem constraints before deciding whether this complexity will pass.

Source

Code and credit

This code comes from walkccc LeetCode Solutions by P.-Y. Chen (walkccc) and is used under the MIT licence.

Open problem ↗Original source ↗
Full codeThe Knight’s Tour · JavaJava
Use this to learn the idea, then write your own version.
class Solution {  public int[][] tourOfKnight(int m, int n, int r, int c) {    int[][] ans = new int[m][n];    Arrays.stream(ans).forEach(A -> Arrays.fill(A, -1));    dfs(m, n, r, c, 0, ans);    return ans;  }   private static final int[][] DIRS = {{1, 2},   {2, 1},   {2, -1}, {1, -2},                                       {-1, -2}, {-2, -1}, {-2, 1}, {-1, 2}};   private boolean dfs(int m, int n, int i, int j, int step, int[][] ans) {    if (step == m * n)      return true;    if (i < 0 || i >= m || j < 0 || j >= n)      return false;    if (ans[i][j] != -1)      return false;    ans[i][j] = step;    for (int[] dir : DIRS)      if (dfs(m, n, i + dir[0], j + dir[1], step + 1, ans))        return true;    ans[i][j] = -1;    return false;  }}

Keep practising

Did this explanation save you time? I'm a Grade 11 student building this free library to make difficult algorithms easier to understand.

Buy me a coffee ↗