
Content count
55 
Joined

Last visited

Days Won
11
Posts posted by rocdocmac



SpoilerA further clue ... One of the white squares of the 4square piece (middle row, far left in diagram) fits into one corner.

SpoilerThey start on opposite sides of the river! One crosses and then the other.

Spoiler... one of the squares of the 4square piece occupies a corner of the completed board ...

SpoilerThe minimums for 10 and 11 are 3778888999 and 277777788888899

SpoilerNeed a hint?

... rotate and/or flip!

Conjoined twins?
 1

SpoilerIt is stated that D got more than C. Thus D did not necessarily get more than A or B [C<=B<=A & D>C].


SpoilerI've done this exercise before (round about 2005), working through each and every possible move, which naturally took a long time. I saw my solution that I printed out at that time about three months ago, but now I can't find it anywhere! I'm almost certain that the mouse's path went through all 27 cubes, but so far I couldn't replicate that! Till I find that printed solution again, we'll have to accept 25 as the maximum and Thalia was indeed the winner. So, apology for the "have another go"!. Incidentally, if the center is omitted, you still get 25 of the 26 remaining cubes.

SpoilerYou'll get 25 if you start with the middle of an edge. Remember, however, there are 8 corners plus 6 faces (total 14), but 12 corners and a single center (total 13). Thus, to obtain the maximum one has to start at a corner or middle of a face and end with a corner or middle of a face.


Have another go!

SpoilerNope  more than 18!

Hopefully this one has not appeared before...
Suppose 27 identical cubical chunks of cheese are piled together to form a cubical stack, as illustrated below. What is the maximum number of these cheese chunks through which a mouse of negligible size could munch before exiting the stack, assuming that the mouse always travels along the grid of 27 straight lines that pass through the centers of the chunks parallel or perpendicular to their sides, always makes a 90 degree turn at the center of each chunk it enters, and never enters any chunk more than once?
 1


Shot!
From A to B, yes ... 14, e.g. A or B (see attached Chess Knight.xlsx)
From A to anywhere but B, you'll get one more, e.g. C

Maximum, not minimum ... more than 12 moves from A to B, inclusive!

Well done all of you! The correct answer is indeed 166 667 166 667 000 000

23 hours ago, rocdocmac said:Has this one appeared before?
[Not 9]



Answer:
((Bottom Right/Bottom Left)+Top Right)*Top Left, i.e. for 4th diagram ...
(6/2 + 3)*5 = 30
Simple classic puzzle on profit
in New Logic/Math Puzzles
Posted · Report reply
18 %