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 - Medieval etiquette and rivers

Puzzle time - Medieval etiquette and rivers

Scheduled Pinned Locked Moved General Discussion
8 Posts 5 Posters 63 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.
  • jon-nycJ Offline
    jon-nycJ Offline
    jon-nyc
    wrote on last edited by
    #1

    In eighth century Europe, it was considered unseemly for a man to be in the presence of a married woman, unless her husband was there as well.  This posed problems for three married couples who wished to cross a river, the only means being a rowboat that could carry at most two people.

    Can they get to the other side without violating their social norms?  If so, what's the minimum number of crossings needed?

    You were warned.

    1 Reply Last reply
    • KlausK Offline
      KlausK Offline
      Klaus
      wrote on last edited by
      #2

      (insert Mike Pence joke here)

      1 Reply Last reply
      • KlausK Offline
        KlausK Offline
        Klaus
        wrote on last edited by
        #3

        Sounds similar to the wolf/goat/cabbage puzzle.

        1 Reply Last reply
        • KlausK Offline
          KlausK Offline
          Klaus
          wrote on last edited by Klaus
          #4

          :::
          Let's designate the people M 0,W 0,M 1,W 1,M 2,W 2, whereby M x is married to W x.

          Here's a valid move sequence.

          [M 0,W 0],[M 0],[W 1,W 2],[W 1],[M 2,M 0],[W 0,M 0],[M 1,M 0],[W 2],[W 1,W 0],[M 2],[W 2,M 2]

          From what I can see, there are 192 different solutions. If you factor out permutations, 32 distinct solutions remain, 8 of which have length 11, 8 of which have length 13, and 16 of which have length 15. So, the minimum number of crossings is 11.

          Would be a nice exercise to model and verify this in a class on verification of finite state systems. It would be easy to express the safety condition and the desired final state in LTL.
          :::

          1 Reply Last reply
          • brendaB Offline
            brendaB Offline
            brenda
            wrote on last edited by brenda
            #5

            :::

            W1 makes 2 trips to ferry W2 and W3 across.
            W1 ferries H1 across, and W2W3 return.
            H2 ferries H3 across.
            H2 ferries W2 across. H3 returns.
            H3 ferries W3 across.
            :::

            1 Reply Last reply
            • KlausK Offline
              KlausK Offline
              Klaus
              wrote on last edited by
              #6

              So, what's the "official" solution?

              1 Reply Last reply
              • jon-nycJ Offline
                jon-nycJ Offline
                jon-nyc
                wrote on last edited by
                #7

                It is 11 under the ‘hard constraint’ where you can’t violate the taboos even in the moments of switching in and out of boats.

                Under the ‘soft constraint’, where you only prevent taboo-violations on the shores and in the boat itself you can do 9.

                You were warned.

                1 Reply Last reply
                • bachophileB Offline
                  bachophileB Offline
                  bachophile
                  wrote on last edited by
                  #8

                  Which reminds me of an important PSA. Don’t ever try to fuck in a canoe.

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


                  • Login

                  • Don't have an account? Register

                  • Login or register to search.
                  • First post
                    Last post
                  0
                  • Categories
                  • Recent
                  • Tags
                  • Popular
                  • Users
                  • Groups