Beefy Boxes and Bandwidth Generously Provided by pair Networks
Keep It Simple, Stupid
 
PerlMonks  

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

by Anonymous Monk
on Jul 08, 2002 at 21:21 UTC ( [id://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.

Replies are listed 'Best First'.
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
Domain Nodelet?
Node Status?
node history
Node Type: note [id://180329]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others chanting in the Monastery: (2)
As of 2024-03-19 10:28 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found