The minimaxalgorithm is a method of selecting the best choice of action in a situation, or game, where two opposing forces, or players, are working toward mutually exclusive goals, acting on the same set of perfect information about the outcome of the situation.
The minimaxalgorithm is a recursive algorithm that takes as arguments the current layout of the game board and a parity number which reflects whether you want a minimax or maximin.
Since the amount of work a minimax search generates increases exponentially as a move is examined to a greater depth, to reduce the time required for the search it must be restricted so that no time is wasted searching moves that are obviously bad for the player.
The first thing I noticed about the MiniMax, as I removed the top layer of Styrofoam from the packing box, was the glossy, gray metalflake automotive-quality paint with which the chassis and transformer top were finished.
The front panel of the MiniMax is a thick slab of aluminum, with the edges nicely finished and the ends thinner than the middle.
The circuit that’s employed in the MiniMax is a basic voltage amplifier, which is directly coupled to a cathode follower.
Feeds |
Contact