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 029 (Prime queen attacking) — Constraint detection

This problem , posed first by G.L. Honaker , is to put a queen and the $ n ^ 2 $ numbers $ 1 , - , n ^ 2 $ , on a $ n \ times n $ chessboard so that : no two numbers are on the same cell , any number $ i +1 $ is reachable by a knight move from the cell containing $ i $ , the number of `` free '' primes -LRB- i.e. , primes not attacked by the queen -RRB- is minimal . Note that 1 is not prime , and that the queen does not attack its own cell .

Problem 029 (Prime queen attacking) — Detection of the decisions and objects to be modeled

This problem , posed first by G.L. Honaker , is to put a queen and the $ n ^ 2 $ numbers $ 1 , - , n ^ 2 $ , on a $ n \ times n $ chessboard so that : no two numbers are on the same cell , any number $ i +1 $ is reachable by a knight move from the cell containing $ i $ , the number of `` free '' primes -LRB- i.e. , primes not attacked by the queen -RRB- is minimal . Note that 1 is not prime , and that the queen does not attack its own cell .

Back to list