Author Topic: Looking for a million?  (Read 130 times)

felipe

  • Member
  • ***
  • Posts: 282
  • I love assembly language programming.
Felipe.

hutch--

  • Administrator
  • Member
  • ******
  • Posts: 4811
  • Mnemonic Driven API Grinder
    • The MASM32 SDK
Re: Looking for a million?
« Reply #1 on: September 27, 2017, 10:55:43 AM »
 :biggrin:

A challenge like this seems to be for folks who are both very good programmers and even better chess players.
hutch at movsd dot com
http://www.masm32.com    :biggrin:  :biggrin:

felipe

  • Member
  • ***
  • Posts: 282
  • I love assembly language programming.
Re: Looking for a million?
« Reply #2 on: September 27, 2017, 12:41:21 PM »
 :P

 i tried a little bit with 8 queens only (just by looking a chess board, not  coding) and i didn't get it!  :redface:

 :lol:
Felipe.

aw27

  • Member
  • ****
  • Posts: 700
Re: Looking for a million?
« Reply #3 on: September 27, 2017, 10:14:44 PM »
I will pay 1 million for 2 queens on a 2x2 chessboard. Anyone? ;)

rrr314159

  • Member
  • *****
  • Posts: 1381
Re: Looking for a million?
« Reply #4 on: September 27, 2017, 10:51:57 PM »
I'll pay a billion for a solution on 3 x 3 board !!

felipe, here are two hints

1. Place the queens separated by knight's moves to start. Of course it's not that simple, but in all solutions, there are many knight's moves between queens.
2. Really, it's very easy - for me, anyway. No big deal. The solution is trivial! Just google it. This is guaranteed to work! Thank you, thank you <applause>
I am NaN ;)

HSE

  • Member
  • ****
  • Posts: 532
  • <AMD>< 7-32>
Re: Looking for a million?
« Reply #5 on: September 28, 2017, 11:10:52 AM »
An hour trying to find a process without sucess. Just 15 minutes looking the chessboard, and I have a solution... but not the process! 8)
Later: like RRR say, the solution is valid for queens (and number of cells by side) >= 4
« Last Edit: September 28, 2017, 09:43:43 PM by HSE »