in reply to Re^4: Google Code Jam 2019 Round 1A Problem 1: Pylons
in thread Google Code Jam 2019 Round 1A Problem 1: Pylons

I guess I didn't understand ;(

However, for this problem the code had to produce a complete valid path for each POSSIBLE solution, and those paths were not hard coded.

  • Comment on Re^5: Google Code Jam 2019 Round 1A Problem 1: Pylons

Replies are listed 'Best First'.
Re^6: Google Code Jam 2019 Round 1A Problem 1: Pylons
by LanX (Saint) on Apr 15, 2019 at 20:03 UTC
    The input set could be infinite, only the test cases are limited.

    Testing all 20 x 20 grids doesn't mean you know "ALL IMPOSSIBLE" input.

    This would imply a proof, hence my question.

    Clearer now? :)

    Cheers Rolf
    (addicted to the Perl Programming Language :)
    Wikisyntax for the Monastery FootballPerl is like chess, only without the dice

[reply]

      I should have said "All IMPOSSIBLEs within the stated specifications given for this problem."

[reply]

In Section Meditations