On this subject, consider the following problem. You have a bar of chocolat, made up of n x m units. You want to break the bar into n x m chuncks, and you do so by 'snaping' a piece of chocolat along one of the lines. There is no additional cost to snap along a line of length m vs a line of length one.
Find the algorithm to produce the minimal number of 'snaps'. Prove your algorithm is minimal. > This is a nice link > http://www.earlham.edu/~peters/courses/logsys/math-ind.htm > > (Peter Suber invented the game of Nomic, described in Douglas > Hofstadter's 'Metamagical Themas'). > >
