Since the first two puzzles were fairly mathematical (or at least numerical, in the case of the first one), I decided to make the next puzzle a word-based one. This is a word game I remember playing in elementary school, but I think it is still a fun mental exercise. The premise of the game is that you must transform a word into another word by changing one letter at a time, and all transitional forms must be words themselves. So, for example, sod could be transformed into can by sod -> sad -> cad -> can. The challenge is to find a pathway with the minimum number of transitions.
Since these are relatively simple, I will give three pairs of words.
1.) some -> curb
2.) bare -> bear
3.) dread -> pried
Subscribe to Computing Intelligence
Monday, April 6, 2009
Subscribe to:
Post Comments (Atom)
1 comments:
See e-mail.
Post a Comment