• NCC Sunday Puzzle

    From David Entwistle@qnivq.ragjvfgyr@ogvagrearg.pbz to rec.puzzles on Sun Oct 4 21:13:02 2026
    From Newsgroup: rec.puzzles

    The National Cipher Challenge is getting underway with a couple of
    puzzles. The first week's puzzle is here:

    https://www.cipherchallenge.org/sunday-puzzle-2/

    This week's puzzle is described here:

    https://www.cipherchallenge.org/sunday-puzzle-3/

    The data hall is a rectangular box:

    20 metres long
    6 metres wide
    8 metres high

    S.P.I.D.E.R. starts in the middle of one end wall, exactly 1 metre below
    the ceiling.

    The faulty sensor is in the middle of the opposite end wall, exactly 1
    metre above the floor.

    Spider may crawl anywhere on the walls, floor or ceiling, but it must
    remain in contact with the surface at all times.

    What is the shortest distance Spider needs to travel to reach the sensor?

    And, perhaps more importantly:

    How can you be certain that your route really is the shortest one?

    (See link for full description).
    --
    David Entwistle
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From David Entwistle@qnivq.ragjvfgyr@ogvagrearg.pbz to rec.puzzles on Mon Oct 5 02:01:20 2026
    From Newsgroup: rec.puzzles

    On Sun, 4 Oct 2026 21:13:02 -0000 (UTC), David Entwistle wrote:

    The National Cipher Challenge is getting underway with a couple of
    puzzles.

    I'd invite anyone, who may be interested, to have a look at National
    Cipher Challenge and any associated puzzles. I should have made it clear
    not to post any answers, nor spoilers here.

    Thanks,
    --
    David Entwistle
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From Mike Terry@news.dead.person.stones@darjeeling.plus.com to rec.puzzles on Mon Oct 5 16:01:02 2026
    From Newsgroup: rec.puzzles

    On 05/10/2026 03:01, David Entwistle wrote:
    On Sun, 4 Oct 2026 21:13:02 -0000 (UTC), David Entwistle wrote:

    The National Cipher Challenge is getting underway with a couple of
    puzzles.

    I'd invite anyone, who may be interested, to have a look at National
    Cipher Challenge and any associated puzzles. I should have made it clear
    not to post any answers, nor spoilers here.

    Thanks,


    I've registered and will give it a try.

    On their website there's a Forum where someone linked to a very readable and informative article
    explaining in straight forward terms how the Enigma machine worked, and a decryption approach that
    exploits a weakness in the system, used by the Bombe [developed by Turing, aided by Welchman] to
    decrypt the messages. Interesting, because I'd always assumed that the Enigma machine would be
    horribly complicated internally, but it is actually a fairly simple combination of engineering
    (rotating cogs etc.) and electric circuitry (the cogs routing wired circuits connected to each
    keyboard key... If you understand how 2-way light switches work, that's the level of electronics
    involved!). [That's not to suggest the encryption wasn't a fiend to break, particulaly given the
    technology available at the time.]

    Hmm.
    There was another decryption/puzzle contest I had a go at earlier this year, but I can't recall who
    ran it - it was some UK university (but not Southampton), and to submit answers you had to answer a
    question in the decrypted message, along with a "guard question" which was typically like "if x=4,
    y=9, z=2, then what is what is 4x+3y-2z?". I'm sure you'll recognise what I'm describing? How does
    the NCC compare with that one?

    Well, the web site for the earlier one was the sort of website I might have created! Which is to
    say I really have no skills at creating websites and would start by reading HTTP standards etc. so
    you can imagine the result (LOL). The NCC website OTOH is very professional and clearly has some
    funding, unlike the earlier competition I suspect... But how about difficulty? I imagine the NCC
    is much more "serious"?


    Mike.



    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From Mike Terry@news.dead.person.stones@darjeeling.plus.com to rec.puzzles on Mon Oct 5 16:11:41 2026
    From Newsgroup: rec.puzzles

    On 05/10/2026 16:01, Mike Terry wrote:
    On 05/10/2026 03:01, David Entwistle wrote:
    On Sun, 4 Oct 2026 21:13:02 -0000 (UTC), David Entwistle wrote:

    The National Cipher Challenge is getting underway with a couple of
    puzzles.

    I'd invite anyone, who may be interested, to have a look at National
    Cipher Challenge and any associated puzzles. I should have made it clear
    not to post any answers, nor spoilers here.

    Thanks,


    I've registered and will give it a try.

    On their website there's a Forum where someone linked to a very readable and informative article
    explaining in straight forward terms how the Enigma machine worked, and a decryption approach that
    exploits a weakness in the system, used by the Bombe [developed by Turing, aided by Welchman] to
    decrypt the messages.a Interesting, because I'd always assumed that the Enigma machine would be
    horribly complicated internally, but it is actually a fairly simple combination of engineering
    (rotating cogs etc.) and electric circuitry (the cogs routing wired circuits connected to each
    keyboard key...a If you understand how 2-way light switches work, that's the level of electronics
    involved!).a [That's not to suggest the encryption wasn't a fiend to break, particulaly given the
    technology available at the time.]

    Since it's not part of the challenge I'll give the link, for those interested:

    <https://www.cipherchallenge.org/wp-content/uploads/2025/12/CC2025-the-bombe.pdf>

    Mike.
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From David Entwistle@qnivq.ragjvfgyr@ogvagrearg.pbz to rec.puzzles on Mon Oct 5 19:59:52 2026
    From Newsgroup: rec.puzzles

    On Mon, 5 Oct 2026 16:01:02 +0100, Mike Terry wrote:

    Hmm.
    There was another decryption/puzzle contest I had a go at earlier this
    year, but I can't recall who ran it - it was some UK university (but not Southampton), and to submit answers you had to answer a question in the decrypted message, along with a "guard question" which was typically
    like "if x=4, y=9, z=2, then what is what is 4x+3y-2z?". I'm sure
    you'll recognise what I'm describing? How does the NCC compare with
    that one?

    That sounds like The Alan Turing Cryptography Competition, run by The University of Manchester.

    https://www.maths.manchester.ac.uk/cryptography/

    There's also Mathsbombe, also run by University of Manchester.

    https://www.maths.manchester.ac.uk/mathsbombe/

    The National Cipher Challenge is somewhat more structured, with a well- thought-out background story providing the context in which the ciphers
    are supposed to have been written. Anyone who has taken part will know
    what to expect for the first few rounds, but then... You are on your own.
    As (if), you get to the final rounds, there is no textbook solution. The ciphers will not be anything you've seen before, but will be based on classical ciphers, but variations of those. It is very well thought out. Anyone is welcome to pose puzzles and ciphers, or answer any of the
    questions posed by others. The competition is aimed at school-age
    children, but don't take that as indicating anything, the top-teams demonstrate a range of skills that will be of use in many walks of life. I don't believe I've ever finished the final challenge.
    --
    David Entwistle
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From Mike Terry@news.dead.person.stones@darjeeling.plus.com to rec.puzzles on Mon Oct 5 23:33:14 2026
    From Newsgroup: rec.puzzles

    On 05/10/2026 20:59, David Entwistle wrote:
    On Mon, 5 Oct 2026 16:01:02 +0100, Mike Terry wrote:

    Hmm.
    There was another decryption/puzzle contest I had a go at earlier this
    year, but I can't recall who ran it - it was some UK university (but not
    Southampton), and to submit answers you had to answer a question in the
    decrypted message, along with a "guard question" which was typically
    like "if x=4, y=9, z=2, then what is what is 4x+3y-2z?". I'm sure
    you'll recognise what I'm describing? How does the NCC compare with
    that one?

    That sounds like The Alan Turing Cryptography Competition, run by The University of Manchester.

    https://www.maths.manchester.ac.uk/cryptography/

    Yes, that's it!


    There's also Mathsbombe, also run by University of Manchester.

    https://www.maths.manchester.ac.uk/mathsbombe/

    The National Cipher Challenge is somewhat more structured, with a well- thought-out background story providing the context in which the ciphers
    are supposed to have been written. Anyone who has taken part will know
    what to expect for the first few rounds, but then... You are on your own.
    As (if), you get to the final rounds, there is no textbook solution. The ciphers will not be anything you've seen before, but will be based on classical ciphers, but variations of those. It is very well thought out. Anyone is welcome to pose puzzles and ciphers, or answer any of the
    questions posed by others. The competition is aimed at school-age
    children, but don't take that as indicating anything, the top-teams demonstrate a range of skills that will be of use in many walks of life. I don't believe I've ever finished the final challenge.

    ok, sounds tough, but we'll see how it goes :)

    Mike



    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From Phil Carmody@pc+usenet@asdf.org to rec.puzzles on Tue Oct 6 16:49:40 2026
    From Newsgroup: rec.puzzles

    David Entwistle <qnivq.ragjvfgyr@ogvagrearg.pbz> writes:
    The National Cipher Challenge is getting underway with a couple of
    puzzles. The first week's puzzle is here:

    https://www.cipherchallenge.org/sunday-puzzle-2/

    This week's puzzle is described here:

    https://www.cipherchallenge.org/sunday-puzzle-3/

    The data hall is a rectangular box:

    20 metres long
    6 metres wide
    8 metres high

    S.P.I.D.E.R. starts in the middle of one end wall, exactly 1 metre below
    the ceiling.

    The faulty sensor is in the middle of the opposite end wall, exactly 1
    metre above the floor.

    Spider may crawl anywhere on the walls, floor or ceiling, but it must
    remain in contact with the surface at all times.

    What is the shortest distance Spider needs to travel to reach the sensor?

    Unfold the walls into a net with the end walls hanging off the end of
    the unrolled other walls, and which places the spider and sensor at
    either end of, and one metre away from those other walls.

    distance = sqrt((20+1+1)^2 + (3+8+3)^2) = sqrt(484+196) ~= 26.077

    And, perhaps more importantly:

    How can you be certain that your route really is the shortest one?

    The number of nets is very very finite, and exhaustive doesn't mean
    exhausting.

    Phil
    --
    We are no longer hunters and nomads. No longer awed and frightened, as we have gained some understanding of the world in which we live. As such, we can cast aside childish remnants from the dawn of our civilization.
    -- NotSanguine on SoylentNews, after Eugen Weber in /The Western Tradition/
    --- Synchronet 3.22a-Linux NewsLink 1.2
  • From David Entwistle@qnivq.ragjvfgyr@ogvagrearg.pbz to rec.puzzles on Sun Oct 11 09:24:56 2026
    From Newsgroup: rec.puzzles

    On Sun, 4 Oct 2026 21:13:02 -0000 (UTC), David Entwistle wrote:

    This week's puzzle is described here:

    https://www.cipherchallenge.org/sunday-puzzle-3/

    The data hall is a rectangular box:

    The answer is now available here:

    https://www.cipherchallenge.org/sunday-puzzle-2-solution/

    I didn't get this solution, incorrectly accepting a slightly longer route
    of 26.68 m, as being the shortest ...

    Nice question based on one of Dudeney's.
    --
    David Entwistle
    --- Synchronet 3.22a-Linux NewsLink 1.2