The first line of this equation deals with a board modeled as squares indexed on codice_25 at the lowest bound and codice_24 at the highest bound. The second line specifies what happens at the first rank; providing a base case. The third line, the recursion, is the important part. It represents the codice_33 terms in the example. From this definition we can derive straightforward recursive code for codice_34. In the following pseudocode, codice_24 is the size of the board, codice_14 is the cost function, and codice_37 returns the minimum of a number of values: