I'm thinking that checking all the 29 angles of the form of "n degrees" (61 - 89) for overlaps, disregarding any "target" (number of reflections), might be a better strategy to follow. Although i haven't yet got to doing it myself.quilan wrote:Actually experimenting & trying to find an angle that did those reflections didn't do a lick of help for me.
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.
-
Napoleon9th
- Posts: 3
- Joined: Wed Nov 12, 2008 6:29 pm
Re: Programming Light-weight Interactive Graphics (prob 202)
-
thundre
- Posts: 356
- Joined: Sun Mar 27, 2011 10:01 am
Re: Problem 202
I am close, but my number for 1000001 is off by 4. I'm getting 80844 instead of 80840.
Can someone verify my answer for 227 bounces, 28 paths? That is, 19 paths per side but 5 of them exit before the required number of bounces.
121198 paths with 1000007 bounces?
Edit: Rewrote my code using a slightly different approach, now it gets 121200 and the correct final answer.
Can someone verify my answer for 227 bounces, 28 paths? That is, 19 paths per side but 5 of them exit before the required number of bounces.
121198 paths with 1000007 bounces?
Edit: Rewrote my code using a slightly different approach, now it gets 121200 and the correct final answer.
Last edited by thundre on Fri Nov 18, 2011 6:06 pm, edited 2 times in total.

-
davidFashion
- Posts: 14
- Joined: Fri Mar 04, 2011 10:53 pm
Re: Problem 202
For 227, I also get 28 paths.thundre wrote:I am close, but my number for 1000001 is off by 4. I'm getting 80844 instead of 80840.
Can someone verify my answer for 227 bounces, 28 paths? That is, 19 paths per side but 5 of them exit before the required number of bounces.
121198 paths with 1000007 bounces?
For 1000007, I get 121200 paths.
-
sivakd
- Posts: 217
- Joined: Fri Jul 17, 2009 9:37 am
- Location: California, USA
- Contact:
Re: Programming Light-weight Interactive Graphics (prob 202)
Very deceptive clue as well
. After a long long time, I finally managed to solve the problem and I posted how I solved it in the private forum along with an image of the various solutions for a specific value of bounces. I would say trying to find an angle that did those reflections is going to make it tough due to precision issues but experimenting and observing the pattern certainly helps. This problem made me also realize the obvious that spotting patterns out of integers is a lot easier than those that are (seemingly) out of real numbers. Looking back, may be one of the very few Project Euler problems for which I had to write so many different pieces of code to study the problem.
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.

puzzle is a euphemism for lack of clarity