TreeviewCopyright © aleen42 all right reserved, powered by aleen42

N-Queen Problem(N皇后問題) Back


n = 8

  • 給定8*8的棋盤, 放置8個皇后且這些皇后不能在同一直線或斜線上.
  • 限界條件: 判斷某節點的所有孩子是否符合的條件.
  • : 表示第i行放第几列.

Search Solution

  • 為了找出可行解, 我們使用一種比窮舉要好但並不高效的算法 (回溯).
  • 類似DFS Algorithmn (深度優先搜索)


  • 活節點不符合限界條件時, 則把其變成死節點
  • 回溯過程就是當遍曆所有子節點後, 回溯到父親節點的兄弟節點繼續遍曆
  • 當訪問到某葉子節點則表示有一可行解
Empty Comments
Sign in GitHub

As the plugin is integrated with a code management system like GitLab or GitHub, you may have to auth with your account before leaving comments around this article.

Notice: This plugin has used Cookie to store your token with an expiration.