Problem 202
Forum rules
As your posts will be visible to the general public you are requested to be thoughtful in not posting anything that might explicitly give away how to solve a particular problem.
This forum is NOT meant to discuss solution methods for a problem.
See also the topics:
Don't post any spoilers
Comments, questions and clarifications about PE problems.
As your posts will be visible to the general public you are requested to be thoughtful in not posting anything that might explicitly give away how to solve a particular problem.
This forum is NOT meant to discuss solution methods for a problem.
In particular don't post any code fragments or results.
Don't start begging others to give partial answers to problems
Don't ask for hints how to solve a problem
Don't start a new topic for a problem if there already exists one
Don't start begging others to give partial answers to problems
Don't ask for hints how to solve a problem
Don't start a new topic for a problem if there already exists one
See also the topics:
Don't post any spoilers
Comments, questions and clarifications about PE problems.
-
miodrag.milenkovic
- Posts: 17
- Joined: Wed Apr 02, 2008 7:14 pm
202 hitting a vertex
In problem 202 what happens if the beam hits a vertex other than the exit one, or is that not allowed? I can't see it being explicitly disallowed in the statement.
-
miodrag.milenkovic
- Posts: 17
- Joined: Wed Apr 02, 2008 7:14 pm
Re: 202 hitting a vertex
... and if it's allowed does it bounce in the direction symmetric to the bisectrix of the angle, and does it count as having bounced off of 0, 1 or 2 surfaces?
- daniel.is.fischer
- Posts: 2400
- Joined: Sun Sep 02, 2007 11:15 pm
- Location: Bremen, Germany
Re: 202 hitting a vertex
If the beam hits a vertex, it exits the chamber.
Il faut respecter la montagne -- c'est pourquoi les gypaètes sont là.
-
miodrag.milenkovic
- Posts: 17
- Joined: Wed Apr 02, 2008 7:14 pm
- elendiastarman
- Posts: 410
- Joined: Sat Dec 22, 2007 8:15 pm
Problem 202
Am I correct in guessing that there are 2 ways for such a path to hit 7 (and for 13) surfaces?
Want some
3.14159265358979323846264338327950288419716939937510
58209749445923078164062862089986280348253421170679...?

3.14159265358979323846264338327950288419716939937510
58209749445923078164062862089986280348253421170679...?

- daniel.is.fischer
- Posts: 2400
- Joined: Sun Sep 02, 2007 11:15 pm
- Location: Bremen, Germany
Re: Problem 202
You shouldn't guess that but count or calculate it
, but the numbers are correct.
Il faut respecter la montagne -- c'est pourquoi les gypaètes sont là.
- elendiastarman
- Posts: 410
- Joined: Sat Dec 22, 2007 8:15 pm
Re: Problem 202
actually, I wasn't guessing...
so now I have 2 pieces of the problem..now for the third!
so now I have 2 pieces of the problem..now for the third!
Want some
3.14159265358979323846264338327950288419716939937510
58209749445923078164062862089986280348253421170679...?

3.14159265358979323846264338327950288419716939937510
58209749445923078164062862089986280348253421170679...?

- sfabriz
- Posts: 175
- Joined: Thu Apr 06, 2006 12:18 am
- Location: London - UK
- Tommy137
- Posts: 238
- Joined: Sun Feb 24, 2008 6:02 pm
- Location: Cologne, Germany
- Contact:
Re: Problem 202
sfabriz wrote:Does anybody have a quantum computer to lend me?
I do use one for some other problems... estimated duration is still three times the age of the universe. You'll have to wait a bit

- sfabriz
- Posts: 175
- Joined: Thu Apr 06, 2006 12:18 am
- Location: London - UK
Re: Problem 202
D'oh!Tommy137 wrote:I do use one for some other problems... estimated duration is still three times the age of the universe. You'll have to wait a bit

- elendiastarman
- Posts: 410
- Joined: Sat Dec 22, 2007 8:15 pm
Re: Problem 202
Don't worry, just hack into the supercomputer in "A Hitchhiker's Guide to the Galaxy" and it'll take a few thousand years...
OR hack into the Earth itself, and it'll be done in 2 seconds...
OR hack into the Earth itself, and it'll be done in 2 seconds...
Want some
3.14159265358979323846264338327950288419716939937510
58209749445923078164062862089986280348253421170679...?

3.14159265358979323846264338327950288419716939937510
58209749445923078164062862089986280348253421170679...?

-
Ikcelaks
- Posts: 28
- Joined: Wed Oct 15, 2008 9:08 pm
Problem 202
I'm having an incredibly difficult time building an intuition on problem 202. I don't seem to be able to mentally trace laser beams for enough bounces to get more than the one distinct path to exit (not including the uninteresting reverse path). I've figured out some interesting properties on how the beams bounce around, but I fear that I'll never make the final connection until I can precisely visualize more interesting cases.
I don't want someone to give me a hint on how to discover these interesting cases. I want some suggestions for simple, lightweight programming languages that will let me quickly create something that will draw out the paths of a laser bouncing off mirrors (similar to the picture in the problem description). I could do it with openGL connectors, but that's complete overkill, so I'd like to use this as an opportunity to learn a new tool.
Any popular suggestions? (Remember, I definitely don't want hints about the problem. I mention it only to demonstrate what kind of simple functionality I need.)
I don't want someone to give me a hint on how to discover these interesting cases. I want some suggestions for simple, lightweight programming languages that will let me quickly create something that will draw out the paths of a laser bouncing off mirrors (similar to the picture in the problem description). I could do it with openGL connectors, but that's complete overkill, so I'd like to use this as an opportunity to learn a new tool.
Any popular suggestions? (Remember, I definitely don't want hints about the problem. I mention it only to demonstrate what kind of simple functionality I need.)
- stijn263
- Posts: 1505
- Joined: Sat Sep 15, 2007 11:57 pm
- Location: Netherlands
Re: Programming Light-weight Interactive Graphics (prob 202)
I made a little program in Maple to draw the paths depending on the incoming angle. Maple allows you to draw linesegments by specifying the endpoints coordinates. There are probably a lot of other programs that can do this too 
It didn't help any at all though ..
It didn't help any at all though ..
-
Ikcelaks
- Posts: 28
- Joined: Wed Oct 15, 2008 9:08 pm
Re: Programming Light-weight Interactive Graphics (prob 202)
I wish I still had free access to Maple and especially Mathematica. There ought to be a "harmless math geek" license for ex-students who want to play around but aren't doing anything productive enough to justify the extreme license costs. Maybe I need to look deeper into Sage.
This problem taunts me like no other. So many people (relatively speaking) have solved it, but I can't even get in the front door. Small examples exist to be generated, but every time I try to sketch one I mess up. It's maddening, and I don't think my mind will ever be at rest until it clicks.
*sigh* I'm still going to write my program (in Visual C#, for now). Hopefully I'll be able to create just one example of multiple distinct paths with the same number of reflections.It didn't help any at all though ..
This problem taunts me like no other. So many people (relatively speaking) have solved it, but I can't even get in the front door. Small examples exist to be generated, but every time I try to sketch one I mess up. It's maddening, and I don't think my mind will ever be at rest until it clicks.
-
quilan
- Posts: 182
- Joined: Fri Aug 03, 2007 11:08 pm
Re: Programming Light-weight Interactive Graphics (prob 202)
Does it count as a clue to say I had to draw it on paper before it finally clicked? I hope not. Very very deceptive problem. Actually experimenting & trying to find an angle that did those reflections didn't do a lick of help for me.
ex ~100%'er... until the gf came along.


- jdrandall123
- Posts: 65
- Joined: Sun Mar 26, 2006 11:57 am
- Location: New York, USA
Re: Programming Light-weight Interactive Graphics (prob 202)
This is good advice. The diagram given with the problem is (intentionally?) useless. If you can redraw it so that you can solve the warmup problem you are on your way to a programmed solution.quilan wrote:Does it count as a clue to say I had to draw it on paper before it finally clicked? I hope not. Very very deceptive problem. Actually experimenting & trying to find an angle that did those reflections didn't do a lick of help for me.
- ed_r
- Posts: 1009
- Joined: Sun Jul 29, 2007 10:57 am
Re: Programming Light-weight Interactive Graphics (prob 202)
As its creator, I can tell you that the diagram's uselessness was totally unintentional
(I used R, btw)
As its creator, I can tell you that the diagram's uselessness was totally unintentional
(I used R, btw)
!647 = &8FDF4C
-
Ikcelaks
- Posts: 28
- Joined: Wed Oct 15, 2008 9:08 pm
Re: Programming Light-weight Interactive Graphics (prob 202)
Done! And this completes my interim goal of solving the twenty-five most recent problems. Man, I haven't been this satisfied in a while.
Thanks, although I tripped over other means of understanding this problem, it looks like an interesting tool.(I used R, btw)
-
quilan
- Posts: 182
- Joined: Fri Aug 03, 2007 11:08 pm
Re: Programming Light-weight Interactive Graphics (prob 202)
Yus, I hope my non-clue helped some
.
ex ~100%'er... until the gf came along.


-
Ikcelaks
- Posts: 28
- Joined: Wed Oct 15, 2008 9:08 pm
Re: Programming Light-weight Interactive Graphics (prob 202)
It helped me not dispair when I couldn't make heads or tails of the output of the crappy drawing program I stubbornly wrote. So, thanks.