Rosetta Code:Village Pump/Suggest a programming task: Difference between revisions

Line 421:
** http://www.rubyquiz.com/quiz137.html
* Ternary and quaternary search (binary search is already present).
 
*Maximum Unchecked Problem
Place 8 queens on a chessboard so that as many squares as possible are not attacked by any queen. (Cells occupied by queens are counted as attacked.) Rouse Ball in "Mathematical Recreations and Essays" believes the answer to be 11, but was never able to prove it. [[User:Jon Rob|Jon Rob]] 14:41, 30 October 2012 (UTC)
 
==Insufficient information==
Anonymous user