3-Hats Problem and the N-Prisoners PuzzleA solution to the 3-Hats Problem involves the implementation of Hamming codes. This makes an interesting and challenging task for automatic programming and heuristic search methods, particularly those related to the genetic programming method.Iteration and recursion allows one to easily specify a solution in the genetic programming framework. However, finding a solution using heuristic search will likely be difficult (see the paper ``A Puzzle to Challenge Genetic Programming''). The problem will require careful fitness function design and many representational considerations (e.g. loops, recursion, operators). It may be more useful to first attempt to discover solution components rather than the entire solution. Below are a collection of resources and information on the puzzle. If you are interested in working with me or discussing this problem as a potential application for evolutionary algorithms (or other search methods), please email me (smg AT cs.nott.ac.uk). Todd Ebert's Page (plus NY Times Article and ABC News) |