Deep Junior won the World Computer Chess Championship (2002), organised by the International Computer Games Association.
In terms of raw power, 'Deep Junior' is dwarfed by other earlier programs such as Deep Blue (which can calculate 200-300 million combinations per second). Deep Junior, which is designed to run on commodity SMP multiprocessor computer hardware, calculates only around 2-3 million combinations per second, but is more selective about the positions it analyzes.
According to Bushinsky one of the inovations of Deep Junior over other chess programs is its way to count moves. It counts orthodox, ordinary moves as two moves, while an interesting move is one or even less. In this way interesting variations are analysed more deeply than less promising lines. This seems to be a generalization of search extensions already used by other programs.
Another approach they claim to use is 'Opponent modelling'. Deep Junior might play moves with are not objectively the strongest but that play more towards the weaknesses of the opponent.