What is the Minimax tree?

The Minimax tree is a commonly used algorithm in chess engines. It was written in quickbasic by Dieter Steinwender and Chrilly Donninger. It evaluates all moves to a certain depth. This means that it is given the value of the depth (the number of moves to be evaluated) and then calculates.