Suppose we have a MxN grid with each cell having a particular (random) number. Also suppose that you are an organism capable of moving one cell left/right/up/down and accessing the number on the cell you are presently standing on. Moving takes away X units of energy/time and accessing the number takes Y units/time. You are assigned the task to search for a particular number NUM in the grid using the least amount of energy/time. You are allowed to choose the location (middle/corner/random) where you want to start searching. What will be your search strategy?
Will you do a systematic search or a clumsy search? Well, this is what I want to find out. I want to find out which is the best search strategy when there is a random chance of hitting upon the goal. Maybe, someone ( me, perhaps! ) should apply genetic programming to evolve agents who do this and then analyze their strategy.
This problem can be very exciting and can have huge applications.