[随缘一题]回溯法解决N皇后问题

最新推荐文章于 2021-05-18 17:18:24 发布

呼延十

最新推荐文章于 2021-05-18 17:18:24 发布

阅读量241

点赞数

分类专栏：数据结构及算法随缘一题笔试面试文章标签：数据结构算法 N皇后回溯法

本文链接：https://blog.csdn.net/qq_24629159/article/details/87904865

版权

数据结构及算法同时被 3 个专栏收录

38 篇文章 1 订阅

订阅专栏

随缘一题

14 篇文章 0 订阅

订阅专栏

笔试面试

12 篇文章 0 订阅

订阅专栏

来源:

维基百科-N皇后问题

解题思路

采用回溯法,即逐一位置放置,然后放置下一行,如果下一行没有合法位置,则回溯到上一行,调整位置,直到得到所有值.

实现代码

/**
 * solve the N-Queen problem
 */
public class NQueen {

  //the number of chess board,example 8
  private static final int N = 8;

  // result, the result[i] mean: the location of [i] line is on result[i] column.
  private int[] result = new int[N];

  //total num of possible result
  private int resultNum = 0;

  /**
   * calculation
   */
  private void calculation(int n) {

    //if n == N, print the result
    if (n == N) {
      for (int i = 0; i < result.length; i++) {
        System.out.print(result[i] + ",");
      }
      System.out.println();
      resultNum++;
    } else {
      for (int i = 0; i < N; i++) {
        // test every location possible
        result[n] = i;
        //if line n is allowed, locate the next line
        if (isAllowed(n)) {
          calculation(n + 1);
        }
      }
    }
  }

  /**
   * judge current line is allowed or not.
   */
  private boolean isAllowed(int i) {
    // i is not allowed while it in same line or diagonal with the pre line
    for (int j = 0; j < i; j++) {
      if (result[i] == result[j] || Math.abs(i - j) == Math.abs(result[i] - result[j])) {
        return false;
      }
    }
    return true;
  }

  //main method, include some test cases
  public static void main(String[] args) {
    NQueen queen = new NQueen();

    queen.calculation(0);

    System.out.println(queen.resultNum);
  }

}