in reply to [code challenge] knights move

A couple of questions:

  1. Do moves have to progress black, white, black white; or is any ordering acceptable?
  2. Do you count every move (black or white) as a move; or pairs of moves, 1 black & 1 white, as in some chess descriptions?
With the rise and rise of 'Social' network sites: 'Computers are making people easier to use everyday'
Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.
"Science is about questioning the status quo. Questioning authority".
In the absence of evidence, opinion is indistinguishable from prejudice.
I'm with torvalds on this Agile (and TDD) debunked I told'em LLVM was the way to go. But did they listen!

Replies are listed 'Best First'.
Re^2: [code challenge] knights move
by LanX (Saint) on Jun 21, 2015 at 23:23 UTC
    1. any ordering

    2. no pairing. (one color might even be moved more often at the end)

    see also Knight's Tour for a similar problem class.

    Cheers Rolf
    (addicted to the Perl Programming Language and ☆☆☆☆ :)
    Je suis Charlie!

[reply]

In Section Seekers of Perl Wisdom