Last time: Finished 5.1: Graphs and their representations | Next time: section 5.3: Decision trees |
Today: Dr. Don Krug makes a special guest appearance
Trees and tree-like graphs appear in funny places: I was listening to NPR (3/13/05) and Will Short, the Puzzle Guy, gave this puzzle:
W | ||||
A | I | |||
R | G | T |
This is a graph like the Hexstat probability generator (draining from top to bottom): connected, directed, acyclic. Let's turn it into a tree, by duplicating some nodes:
W | ||||||
A | I | |||||
R | G | G | T |
In traversing this graph from root to leaf, in four possible ways, every way spells out a word: WAR, WAG, WIG, WIT; he asked us to create a tree of depth 3 that uses the ten letters in ANALOGIES+K and does the same thing.... (as a hint, he said that an A is the left-most leaf, only not in those those words!).
Links: