Question

It s difficult to tell what is being asked here. This question is ambiguous, vague, incomplete, overly broad, or rhetorical and cannot be reasonably answered in its current form. For help clarifying this question so that it can be reopened, visit the help center.

Closed 11 years ago.

我的讲师在其课程说明中就N-Queens问题提供了一些假装。不幸的是,我有一点时间难以理解,在 Java执行。 The pseudocode in question is:

Queens (currentBoard , currentRow, n) :
    if currentRow == n:
        if currentBoard is legal:
            return <currentBoard, 1>
        else:
            return <currentBoard, 0>
    else:
        for k = 1..n:
            newBoard = currentBoard + <currentRow+1, k>
            board [k], success[k] = Queens(newBoard, currentRow+1, n)
        kmax = index of max(success[k])
        return <board[kmax], success[kmax]>

我的理解是,但我不相信我所说的话与正文法中置于角圈的部分有关。

Answer 1

这里的方括号只是说,多个“目标”已经归还。

因此,例如,该法典

return <currentBoard, 1>

一方面,<条码>现为<<>条/代码>,另一方面是简单的<条码>1<>。

守则

board [k], success[k] = Queens(newBoard, currentRow+1, n)

您可以看到,这两种物体都储存在不同的变数中,登上<条码>>,编号为<条码>。

友情链接