Hello all, I'm not getting how to solve a 3 d version of n queen problem. The specification are A n*n*n board is given, arrange n*n queens such that not a single queen crosses(kills) any other queen. Use back tracking or divide and conquer.
All solutions / suggestions are welcome !! Thanking You in advance !! Regards Ashish VIT Pune -- 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 algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.