document.write( "<A HREF=/cgi-bin/jump-to-question.mpl?question=1208189>Question 1208189</A>: <I><SPAN STYLE=\"word-break: break-all;\"> How many possible  are there to place two queens on an empty chessboard such that neither threatens the other? </SPAN>\n" );
document.write( "</I><HR><TABLE width=100%><TR><TD><B><A HREF=http://www.algebra.com/>Algebra.Com's</A> Answer #846440 by </B><A HREF=/tutors/aboutme.mpl?userid=PPCHLOE><B>PPCHLOE(2)</B></A><img src=\"/images/stars/iconNewId_16x16.gif\" alt=\"\" >&nbsp;<A HREF=/tutors/aboutme.mpl?userid=PPCHLOE><IMG SRC=http://www.algebra.com/images/aboutme-small.gif BORDER=0 alt=\"About Me\" VALIGN=MIDDLE></A>&nbsp;<IMG SRC=http://www.algebra.com/cgi-bin/show-face.mpl?user=PPCHLOE><BR>You can <A HREF=\"/cgi-bin/embed-solution.mpl?show=1&solution=846440\">put this solution on YOUR website!</A><BR><SPAN STYLE=\"word-break: break-all;\"> Hello here is the solution to your problem in steps.<BR>\n" );
document.write( "Hope you find this helpful.<BR>\n" );
document.write( "ogunjimio79@gmail.com<BR>\n" );
document.write( "=======================\r<BR>\n" );
document.write( "\n" );
document.write( "Step 1: Understand the constraints<BR>\n" );
document.write( "- Two queens cannot share the same row, column, or diagonal.<BR>\n" );
document.write( "- A standard chessboard has 8 rows and 8 columns.\r<BR>\n" );
document.write( "\n" );
document.write( "Step 2: Calculate the total possible placements for the first queen<BR>\n" );
document.write( "- The first queen can be placed in any of the 64 squares (8 rows x 8 columns).\r<BR>\n" );
document.write( "\n" );
document.write( "Step 3: Calculate the possible placements for the second queen<BR>\n" );
document.write( "- After placing the first queen, the second queen cannot be placed in the same row, column, or diagonal.<BR>\n" );
document.write( "- This means the second queen has 36 possible squares to be placed (64 - 28 squares that are under attack by the first queen).\r<BR>\n" );
document.write( "\n" );
document.write( "Step 4: Account for overcounting<BR>\n" );
document.write( "- Since the order of placing the queens doesn't matter, we need to divide the total count by 2 to avoid counting each configuration twice.\r<BR>\n" );
document.write( "\n" );
document.write( "Step 5: Calculate the total possible ways<BR>\n" );
document.write( "- Total possible ways = (Total possible placements for the first queen) x (Possible placements for the second queen) / 2<BR>\n" );
document.write( "- Total possible ways = 64 x 36 / 2<BR>\n" );
document.write( "- Total possible ways = 1152\r<BR>\n" );
document.write( "\n" );
document.write( "The final answer is 1152.<BR>\n" );
document.write( "=======================<BR>\n" );
document.write( "If you're satisfied with my solution and interested in further learning , I'm available for a one-on-one online session. I'd be happy to share my knowledge and provide guidance to you personally . </SPAN>\n" );
document.write( "</TD></TR></TABLE>\n" );