Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl: the Markov chain saw
 
PerlMonks  

Re: •Re: Puzzle: need a more general algorithm

by Anonymous Monk
on Jul 08, 2002 at 21:21 UTC ( #180329=note: print w/ replies, xml ) Need Help??


in reply to •Re: Puzzle: need a more general algorithm
in thread Puzzle: need a more general algorithm

Counter example:

1 2 3 4 1 2 3 4 1 2 3 4 5 6 5 6 5 6 1 3 4 5 1 3 4 5 1 3 4 5 2 6 2 6 2 6 1 2 3 6 1 2 3 6 1 2 3 6 4 5 4 5 4 5 1 2 3 6 1 2 3 6 1 2 3 6 4 5 4 5 4 5 ...

That's twelve tries and there are more still.


Comment on Re: •Re: Puzzle: need a more general algorithm
Download Code
Re: Re: •Re: Puzzle: need a more general algorithm
by dws (Chancellor) on Jul 08, 2002 at 21:27 UTC
    That's twelve tries and there are more still.

    No, there are only 10. Your attempt at a counter example violates the requirement that "The categories must remain in order".

      My apologies. I misread that requirement entirely.

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://180329]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others imbibing at the Monastery: (6)
As of 2015-07-02 00:09 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The top three priorities of my open tasks are (in descending order of likelihood to be worked on) ...









    Results (25 votes), past polls