CaptainEd
-
Content count
1318 -
Joined
-
Last visited
-
Days Won
9
Everything posted by CaptainEd
-
-
Amazing!
-
Is it possible that the needles are actually...
-
Rodocmac, thank you, but I’ll pass. I’ve posted “oops” enough for now :-)
-
Thanks, rodocmac Ants on octahedron Once again attempting to count unique permutations
-
Cute, Bonanova! Good solve Molly Mae!
-
Ants on octahedron Once again attempting to count unique permutations
-
Please disregard this post. I now understand that 50/50 does not mean probability 1.
-
Rocdocmac, we are clearly well matched: I had a misenumeration and a miscount, and I’ll raise you my typographical error.
-
Oops can’t count
-
Ants on cube Now I see it would be easier if I counted permutations.
-
Shortest set of lines in a square, revisited
CaptainEd replied to bonanova's question in New Logic/Math Puzzles
Nice job, Plasmid -
Plasmid, that’s an impressively simple solution to all the n=3 mazes! Of course, the 5x5 solution is impressive, too! Harey, this is a very interesting puzzle.
-
tetrahedron: success only if no two ants arrive at same cell
-
Woops, I did not consider the possibility of two ants arriving at the same vertex through different paths...
-
(a) and (b), haven't done (c) yet: I assume a trial consists of all ants moving from one vertex to one other vertex. (In other words, we aren't asked about the probability of them never colliding, no matter how far they wander)). icosagon tetrahedron
-
interesting question.
-
Here’s a degenerate answer
-
Shortest set of lines in a square, revisited
CaptainEd replied to bonanova's question in New Logic/Math Puzzles
Ok, Another try: -
Kay_Kay, I don’t follow the argument.
-
Shortest set of lines in a square, revisited
CaptainEd replied to bonanova's question in New Logic/Math Puzzles
Oh well, here’s an upper bound, as it’s an easy answer: -
Thanks for pruning unnecessary instructions.
-
Harey, I’m with you: there’s a crazy number of possible mazes just in n=3. I think I’ve got them covered:
-
Harey, can we assume as Molly Mae did, that there is no maze, but only a simple path? I assumed otherwise, that it can be a maze, so I imagined a figure H, with only two cells with cement (top center and bottom center).
-
I must be wrong, imagine a capital H in a 3x3 grid. How do I get to the crossbar? Any Down or Up would take me to the bottom or top of the left vertical bar, with no way to stop in the middle. So, now I guess that each instruction moves the robots either 0 or 1 spaces.