Login / Signup

An upper bound for the minimum number of queens covering the n x n chessboard.

Alewyn P. BurgerChristina M. Mynhardt
Published in: Discret. Appl. Math. (2002)
Keyphrases
  • upper bound
  • small number
  • computational effort
  • worst case
  • maximum number
  • minimum distance
  • image processing
  • image segmentation
  • three dimensional
  • simulated annealing
  • fixed number