On Feb 20, 11:18 pm, "ramtin" <[EMAIL PROTECTED]> wrote:
> Hi,
>
> could anybody help me to solve this problem
>
> http://acm.zju.edu.cn/show_problem.php?pid=1002
This is a neat variant of the n-Queens problem: place n Queens on an
nxn chess board so that no two queens attack each other. The most
effective solutions employ Backtracking and are correctly suggested so
by the other group members. Google around for this problem (fondly
known as 8-queens problem) and you'll get very helpful (but not exact)
solutions to your problem.
Regards,
Nupul
--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/algogeeks
-~----------~----~----~----~------~----~------~--~---
