Backtracking: N Bishops Problem
Posted
by Cinnamon
on Stack Overflow
See other posts from Stack Overflow
or by Cinnamon
Published on 2010-04-11T14:58:13Z
Indexed on
2010/04/11
15:03 UTC
Read the original article
Hit count: 265
Filed under:
c
This problem is driving me crazy... Place N bishops on NxN board in a way, where all squares would be occupied or attacked with at least one of them.
Could anyone help me out?
© Stack Overflow or respective owner
