Genetic Programming Example

• develop an algorithm for stacking blocks in a single stack that spells the word ``universal'' independent of the initial configuration of the blocks
• In GP applications, problem representation has a significant impact on the ease of solving the problem, 3 terminal arguments:
• CS returns the name of the top block on the stack or F if there is no current stack,
• TB returns the top block on the stack that is in the correct order,
• NN returns the name of the next block needed or F if no blocks are needed
• Imagine the difficulty if the terminal arguments returned x,y coordinates of the blocks