Welcome to the Java Programming Forums
The professional, friendly Java community. 21,500 members and growing!
The Java Programming Forums are a community of Java programmers from all around the World. Our members have a wide range of skills and they all have one thing in common: A passion to learn and code Java. We invite beginner Java programmers right through to Java professionals to post here and share your knowledge. Become a part of the community, help others, expand your knowledge of Java and enjoy talking with like minded people. Registration is quick and best of all free. We look forward to meeting you.
>> REGISTER NOW TO START POSTING
Members have full access to the forums. Advertisements are removed for registered users.
LinkBack URL
About LinkBacks
Please help ! k Queens domination nxm chessboard problems.
This is my homework. And I don't want to ask for solution of any kind. I just want some clue, hint, strategy to start.
P/s : I have solved the n queens problem using stack before, but I have got stuck with this one for 3 days.Find a placement of k queens on an n x m chessboard such that the queens will dominate each of the n x m cells. And I have to solve this problem using stack.
Related threads:
Re: Please help ! k Queens domination nxm chessboard problems.
Hmm... Well, since you can fit most any program to a stack...try doing it without a stack first. Keep in mind you can probably use more than one stack.
bruce88 (October 22nd, 2012)
Reply With Quote