A place to air possible concerns or difficulties in understanding ProjectEuler problems. This forum is not meant to publish solutions. This forum is NOT meant to discuss solution methods or giving hints how a problem can be solved.
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.
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
Unrelated, but am I one of the only ones that thought 198 really wasn't all that difficult? Especially considering we've had another earlier problem that practically gave away one method of solving it?
Yes but many did not solve that earlier problem in one of the intended ways. That's no problem if one studies afterwards how it should have been solved to be prepared for a follow up. Obviously they failed to do so.
War ruins the life and health of untold numbers of innocent children.
Anyway, 198 definitely was a tough one but this one I just failed to wrap my brain around so to speak. Most of the other probability questions have been fine but this one was extremely tough for me!
Most of the other probability questions have been fine but this one was extremely tough for me!
I loved this problem in part because, while it didn't require any sort of advanced knowledge, it really tested your understanding of the fundamentals of probabilites and expected values.
Unrelated, but am I one of the only ones that thought 198 really wasn't all that difficult? Especially considering we've had another earlier problem that practically gave away one method of solving it?
For that very reason, 198 was essentially trivial for me. Meanwhile, 202, which many have solved, was extraordinarily elusive. Clearly, there is no such thing as a toughest problem on any remotely absolute scale.
As pointed earlier, the expected number of empty square after one toll is equal to 1 in case of 2X2 grid. Will it remain the same forever(i.e. remains 1 irrespective of number of tolls).
I am sure that my algorithm is correct but I am still not getting the right answer.
Can anybody please tell me if I am correct for the following values:
expected empty cells for 4X4 after 2 tolls are 4.86548889746 and after 50 tolls are 4.93827160494
in case of 20X20 after 50 tolls expected empty cells are 126.37819102.
Oh, sorry, I posted because I was about sure they were wrong... I read in the last page it was close to 147, but didn't realize that was a 20x20 simulation!
Assato wrote:Oh, sorry, I posted because I was about sure they were wrong... I read in the last page it was close to 147, but didn't realize that was a 20x20 simulation!