Correct predictions are in blue. If we detect only a subset of a labelled sentence, we highlight the caught part as blue, the missing part light blue. False positives are in green and false negatives are in red.

Problem 054 (N-queens) — Constraint detection

Can $ n $ queens -LRB- of the same colour -RRB- be placed on a $ n \ times n $ chessboard so that none of the queens can attack each other ? In chess a queen attacks other squares on the same row , column , or either diagonal as itself . So the n-queens problem is to find a set of n locations on a chessboard , no two of which are on the same row , column or diagonal .

Problem 054 (N-queens) — Detection of the decisions and objects to be modeled

Can $ n $ queens -LRB- of the same colour -RRB- be placed on a $ n \ times n $ chessboard so that none of the queens can attack each other ? In chess a queen attacks other squares on the same row , column , or either diagonal as itself . So the n-queens problem is to find a set of n locations on a chessboard , no two of which are on the same row , column or diagonal .

Back to list