Jump to content
BrainDen.com - Brain Teasers


  • Content Count

  • Joined

  • Last visited

  • Days Won


plasmid last won the day on March 8 2017

plasmid had the most liked content!

Community Reputation



About plasmid

  • Rank
    Senior Lolcat

Profile Fields

  • Gender

Recent Profile Visitors

The recent visitors block is disabled and is not being shown to other users.

  1. CaptainEd has the best answer so far and asked to see my solution so I'll go ahead and PM it, but will leave this open in case anyone else drops in and wants to take a crack.
  2. Putting coordinates into a spreadsheet and calculating distances sure is a good way of checking your work; now I wish I had thought of doing that! I believe I have a way of doing it with five breadcrumbs aside from the five vertices. Up to you if you'd like to look at it a little longer or if I should go ahead and convert my chicken scratch to an intelligible post when I get a chance.
  3. Well, I blew it with the first guess...
  4. I see what you're saying -- if we don't care whether the mouse goes from C to B or from C to D then that would work and you could let the mouse just flip a coin after it reaches C. The OP was phrased sort of ambiguously since I first talked about making the mouse take as many diagonals as possible (in which case that would be fine to do) and later said the specific letter sequence of ACBD (in which case that wouldn't). The only thing I'd say, though, is that if you drop a breadcrumb in region E, it seems like the mouse would go eat the breadcrumb there and then go to either B or D instead of C -- either of those two points would be closer to region E than C is.
  5. Yep, this gets harder than it looks
  6. ... wut? ... Wat? The mouse always goes and eats the nearest bit of food to its current position. So like Captain Ed says, putting multiple pieces of food at one spot wouldn't be helpful. If the mouse starts at point A of the square, then the food at either B or D will be closer than C (even if there are multiple breadcrumbs at C), so the mouse will go to the closer food at either B or D. Nah, this mouse really is pretty dumb. It won't manage to learn, it'll still keep right on pursuing whatever bit of food is closest until it eats everything in sight.
  7. This gets tricky with rolls like (1, 1, 6) that look isosceles but don't actually form triangles. How would you handle such rolls? Would you omit rolls that don't form a triangle from analysis (equivalent to saying that if you get a roll that doesn't form a valid triangle then roll again), or count them as a failure to form an isosceles triangle? And would you consider a "straight line" throw like (3, 3, 6) to be a valid triangle albeit with zero area or nah?
  8. This sounds like it might be a homework problem, so I won’t flat out answer it but will give a hint on how to approach it.
  9. Right on, that solves the square problem with the minimum number of breadcrumbs.
  10. Good start, that would work, but the square can be done with fewer breadcrumbs.
  11. That's definitely not a silly question. In the question I had in mind, the paths don't need to be straight lines. But down the line when we solve the pentagon case and start thinking about generalizations, we could talk about solving for cases with straight line paths.
  12. You could be telling the truth because such a number does exist. Of course I can't say with certainty that you're telling the truth because I don't know whether you actually have such a number in mind right now. Back in a bit with a description of how to handle this problem.
  13. In case this helps clarity: the warm up problem is to take this setup with the mouse at A (I told you it was cute!) and breadcrumbs at B, C, D, and your job is to place more breadcrumbs to ensure the mouse goes first to C, then B, then D. Ideally, using as few breadcrumbs as possible. The real problem is to take this setup with breadcrumbs at points B, C, D, E and place more breadcrumbs to make the mouse go first to C, then E, then B, then D. Again, using as few breadcrumbs as possible.
  • Create New...