Skip to content
  • Categories
  • Recent
  • Tags
  • Popular
  • Users
  • Groups
Skins
  • Light
  • Cerulean
  • Cosmo
  • Flatly
  • Journal
  • Litera
  • Lumen
  • Lux
  • Materia
  • Minty
  • Morph
  • Pulse
  • Sandstone
  • Simplex
  • Sketchy
  • Spacelab
  • United
  • Yeti
  • Zephyr
  • Dark
  • Cyborg
  • Darkly
  • Quartz
  • Slate
  • Solar
  • Superhero
  • Vapor

  • Default (No Skin)
  • No Skin
Collapse

The New Coffee Room

  1. TNCR
  2. General Discussion
  3. Puzzle time

Puzzle time

Scheduled Pinned Locked Moved General Discussion
21 Posts 6 Posters 290 Views
  • Oldest to Newest
  • Newest to Oldest
  • Most Votes
Reply
  • Reply as topic
Log in to reply
This topic has been deleted. Only users with topic management privileges can see it.
  • J Offline
    J Offline
    jon-nyc
    wrote on 27 Jun 2020, 17:36 last edited by
    #11

    Yes that is the answer. From reversibility it follows.

    (assuming you meant 'all on' not 'all off')

    "You never know what worse luck your bad luck has saved you from."
    -Cormac McCarthy

    1 Reply Last reply
    • H Offline
      H Offline
      Horace
      wrote on 27 Jun 2020, 17:43 last edited by
      #12

      Whichever one is less racist, that’s the one I meant.

      Education is extremely important.

      1 Reply Last reply
      • J jon-nyc
        27 Jun 2020, 17:10

        My first guess was that it would return because lower numbers do. But you need to do better than guess.

        Like Ax I wrote code to play a bit but after 36 bulbs ran for a full day I gave up on the brute force method.

        A Offline
        A Offline
        Axtremus
        wrote on 27 Jun 2020, 17:45 last edited by
        #13

        @jon-nyc said in Puzzle time:

        Like Ax I wrote code to play a bit but after 36 bulbs ran for a full day I gave up on the brute force method.

        Just out of curiosity, I ran a simulation for 36 bulbs on a MacBook Air (1.6 GHz Intel Core i5). It took 10 minutes and 36 seconds to reach the "all on" state at the 22,839,252,821st iteration. I implemented my simulator using Go.

        What did you use to implement and run your simulation?

        1 Reply Last reply
        • H Offline
          H Offline
          Horace
          wrote on 27 Jun 2020, 18:07 last edited by
          #14

          I would add the reversibility isn’t a sufficient condition to answer the problem, you also need a finite number of possible states.

          Education is extremely important.

          1 Reply Last reply
          • J Offline
            J Offline
            jon-nyc
            wrote on 27 Jun 2020, 18:09 last edited by jon-nyc
            #15

            yes yes. there are fewer than 100*2^100 states.

            "You never know what worse luck your bad luck has saved you from."
            -Cormac McCarthy

            1 Reply Last reply
            • J Offline
              J Offline
              jon-nyc
              wrote on 27 Jun 2020, 18:09 last edited by
              #16

              Ax I was exaggerating but I used python on the Mac

              "You never know what worse luck your bad luck has saved you from."
              -Cormac McCarthy

              1 Reply Last reply
              • K Offline
                K Offline
                Klaus
                wrote on 27 Jun 2020, 20:21 last edited by Klaus
                #17

                Nice puzzle!

                Let's analyze this some more.

                Every state is in a cycle that has a length n. We just established that the set of states is the disjoint union of all cycles.

                Let's consider a histogram of cycle lengths. For instance, "000....000" is in a cycle of length one, hence we add one to the bin for cycles of length 1.

                What kind of shape will the histogram have? And the extra Nassim Taleb Black Swan question is: does it have a "fat tail"?

                1 Reply Last reply
                • J Offline
                  J Offline
                  jon-nyc
                  wrote on 27 Jun 2020, 21:08 last edited by
                  #18

                  I graphed out some early ones, they do not. THey're in the general shape of a normal curve (not saying they're normal).

                  "You never know what worse luck your bad luck has saved you from."
                  -Cormac McCarthy

                  K 1 Reply Last reply 28 Jun 2020, 09:00
                  • B Offline
                    B Offline
                    brenda
                    wrote on 28 Jun 2020, 00:40 last edited by
                    #19

                    Are these Christmas tree bulbs? If so, the answer is that they will never all be on again until you buy new ones.

                    1 Reply Last reply
                    • J jon-nyc
                      27 Jun 2020, 21:08

                      I graphed out some early ones, they do not. THey're in the general shape of a normal curve (not saying they're normal).

                      K Offline
                      K Offline
                      Klaus
                      wrote on 28 Jun 2020, 09:00 last edited by
                      #20

                      @jon-nyc what do you mean by "early ones"? . I was talking about cycle length distributions. I'm not sure we talk about the same thing.

                      1 Reply Last reply
                      • J Offline
                        J Offline
                        jon-nyc
                        wrote on 28 Jun 2020, 11:51 last edited by
                        #21

                        No we’re not. I graphed out the sum of lightbulbs that were on in each state change (every toggle changes the sum by +-1) so it moves around in a jerky continuous fashion). That formed a narrow bell curve.

                        When I say early ones, I did it to the completion of the cycle, or even multiple cycles for smaller n. I did also graph them for n=100 but just for the first few million ticks.

                        "You never know what worse luck your bad luck has saved you from."
                        -Cormac McCarthy

                        1 Reply Last reply
                        Reply
                        • Reply as topic
                        Log in to reply
                        • Oldest to Newest
                        • Newest to Oldest
                        • Most Votes

                        20/21

                        28 Jun 2020, 09:00


                        • Login

                        • Don't have an account? Register

                        • Login or register to search.
                        20 out of 21
                        • First post
                          20/21
                          Last post
                        0
                        • Categories
                        • Recent
                        • Tags
                        • Popular
                        • Users
                        • Groups