Interesting Problem...
Vector 14:2, page 16
Transcribed from the printed issue; not yet reviewed. Read it in the PDF of the issue, page 16
Given a chess board (8×8 cells), place exactly 16 dots, one in any given cell such that:
- each row
- each column
- each diagonal
is either empty or has exactly 2 dots in it.
This can be judged by APL solution + execution time. (The solution is not unique … but how many solutions are there?)
[An available solution has 3 lines & executes in 0.5 seconds on a 33Mhz 486]