Good Will Hunting Match problem is actually quite easy - everyone here can do it
PostPosted:Mon Jul 22, 2019 4:41 pm
So the problem is to draw all possible homeomorphically Irreducible trees to the order of ten. That is, dots connected by lines which are unique in structure and either has 1 dot, or 3 dots and greater connected to them (so you can't just draw a string of 10 dots).
According to the film, an MIT professor was unable to solve it in over two years of trying, yet Will Hunting manages to do it overnight.
In the clip above, on the chalkboard, there are 8 different diagrams shown. The reality is that there are 10 different possibilities. They're also not very difficult to get. Start with 1 dot connecting to 9 dots, and then start working down from there (next, go with two dots and then connect a second and third to the right dot, and the remaining 6 dots to the left, then start stretching it out). There is one possible diagram which has a little complexity to it (hint: it is the second one on the bottom row on the chalkboard).
Can you do in ten minutes or less what Good Will Hunting's MIT professor couldn't do in two years?
Then go to 1:47 of this clip, and that can be you! =D