This page executes an evolutionary programming simulator. The purpose is to evolve
programs that can solve the max sum subarray problem. Each trial program is given
a fixed budget of CPU cycles to try to solve the max-sum subarray problem for a
given array. Those programs that come closest to the actual maxsum (without
going over) are given the highest score.
Programs are also given bonus points for executing in the fewest number of CPU
cycles (if they HALT before their CPU budget has been consumed).
To simplify the programming model, I've developed a virtual machine that is
especially suited to the Max-Sum-Subarray problem.
These are the opcodes that are available: