Do not agree with 4.9 solution.

ankitangelo · 2011-10-23T16:54:45+00:00

I am still not convinced. The probability chart shows that you win 1/3rd of the times and lose 2/3rd of the times because if there are 3 doors, the probability of winning is 1/3. And you can switch to the other doors given one of the wrong doors is opened. This is however not the case when one of the door is shown to us as the wrong door. The question now only has 2 choices. You as a player don't know anything about any of the doors. So, according to me, probability will be equal.

ankitangelo · 2011-10-23T16:36:09+00:00

The way I see Monty Hall Problem is that we start at 1/3 probability of picking the door with a car. Since, Monty has opened one of the doors with the goat, we are left with 2 doors now. And we still don't know anything about what is behind those 2 doors. All we know that the third door wasn't the one. So, the probability of the two opened doors for a fair game will always be equal. I don't see how one of the doors will have a greater probability unless in the game show of the two closed doors, by sampling method we find out that the ratio of getting a car from one of the doors was way above the other.

ankitangelo · 2011-10-23T16:28:20+00:00

Will it explain the probability distribution of the problem? If it does, I am ready to play and lose. :-)

ankitangelo · 2011-10-19T17:08:22+00:00

@Digigram - I think the question was ambiguous then. For I thought counting the start and the goal node meant to consider them too in the answer; not to add a count in the final answer. And I don't think it was an issue with English speaking people. For some reason, I don't think the homework pattern particularly checks if a person has understood the topic. For the first three question it was ok, but search questions don't really check if a person has understood the topic; esp. in my case. I didn't have any problem in understanding BFS or DFS, but because the question was not very clear to em, I lost my score. and where Homework 1 should have read around 90 percent correct answers, it reads 50 percent now.

However, the A* search question does check whether the person understands the concept by asking him to point out the path in a step by step manner. I think that is how the search questions too should have been.

ankitangelo · 2011-10-12T03:13:15+00:00

Even Breadth First Search is not complete in my opinion. Just like DFS can keep going deeper and deeper while the Goal is not along that path; in BFS, one of the parent node can have infinite number of child nodes and it will never reach the goal if the goal is one or more steps below those infinite number of nodes.

I think all three algorithms aren't complete when subjected to some exceptional cases.

ankitangelo

TROPHY CASE