let's make a decision tree with interruptible branch evaluation that can make very simple code !!!!
let's give it 1 register and 2 operations: increment and double and see if it can find the optimal path to any integer above the starting register value :D
