Posts Tagged ‘Junior chess’

World Computer Chess Championships 2008

October 3, 2008

Kasparov vs. Deep Blue

   On 9/28/2008 the 16’th World Computer Chess Championships began in Beijing, China. The IGCA has scheduled an eleven round accelerated swiss tournament format for the top  chess engines in the world to compete for the the title of World Computer Chess Champion 2008. The accelerated swiss structure strikes me as odd being that there are only ten competing chess programs.  The principle of a Swiss tournament is that each player will be pitted against another player who has done as well (or as poorly) as him or herself. The first round is seeded according to rating. Players who win receive a point, those who draw receive half a point and losers receive no points. Win, lose, or draw, all players proceed to the next round where winners are pitted against winners, losers are pitted against losers, and so on. In subsequent rounds, players face opponents with the same (or almost the same) score. No player is paired up against the same opponent twice however. This is where the organizers of the 16’th World Computer Chess Championships are going to run into trouble. With only ten competitors and eleven rounds, it will be impossible to follow a swiss format. The schedule of the chess events have been taken off the the IGCA website and I expect them to alter the pairings and tournament schedule. Obviously this should have been done before the tournament started.

   My criticism of the tournament structure aside, this event should, once again, demonstrate that computers are now playing much better chess than humans ever will. Case and point: When Viswanathan Anand faces off against Vladimir Kramnik in eleven days, it will be computer chess engines that will provide humans with the most definative analysis as to who won the championship and why. I doubt we will see any humans evaluating Rybka’s games with out the help of a chess engine.

   Speaking of Rybka… After five rounds the reigning 2007 champion is tied with Hiarcs at 4.5/5. The two leading engines have yet to play each other. Below is the cross-table and a nice game played by Rybka.

  1 2 3 4 5 6 7 8 9 1
0
1 Rybka       =   1 1 1 1  
2 Hiarcs       = 1     1 1 1
3 Junior       1   =   1 = 1
4 Cluster Toga = = 0     = 1      
5 Sjeng   0         = 0 1 1
6 Shredder 0   = =     = =    
7 The Baron 0     0 = =       1
8 Jonny 0 0 0   1 =        
9 Falcon 0 0 =   0         1
10 Mobile Chess   0 0   0   0   0  
    = = = = = = = = = =

 

[Event “16th World Computer Chess Championship”]
[Site “Beijing, China”]
[Date “2008.09.28”]
[Round “1”]
[White “Rybka”]
[Black “The Baron”]
[Result “1-0”]

1. e4 e5 2.Nf3 Nf6 3.Nxe5 d6 4.Nc4 Nxe4 5.Nc3 Nxc3 6.bxc3 g6 7.d4 Bg7 8.Bd3 o-o
9.o-o Nc6 10.Qf3 Re8 11.Bf4 Bd7 12.Ne3 Na5 13.Qg3 Bc6 14.h4 Be4 15.h5 Qd7 16.Rae1 Qc6
17.h6 Bxd3 18.cxd3 Bf6 19.c4 Bxd4 20.Nd5 Rxe1 21.Rxe1 Qc5 22.Re7 Nc6 23. Rxc7 Qa5 24.Qh4 Qxa2
25.Nf6 Kh8 26.Rxf7 Qa1 27.Kh2 Bxf6 28.Qxf6 Qxf6 29.Rxf6 Kg8 30.Rxd6 Rf8 31.Kg3 a5 32.Bc1 a4
33.f3 Rd8 34.Rxd8 Nxd8 35.Kf4 Kf7 36.d4 g5 37.Ke4 Ne6 38.Kd3 Kg6 39.d5 Nc5 40.Kc3 Kxh6
41.Be3 Nd7 42.Kb4 a3 43.Kxa3 Kg6 44.Bd4 Kf7 45.Ka4 Ke8 46.g4 Nf8 47.Ka5 Kd7 48.Kb6 Kc8
49.Kc5 Kc7 50.Be5 Kd7 51.Bf6 h6 52.Bg7 Ng6 53.Bxh6 Ne5 54.Bxg5 Nxf3 1-0

Advertisements

Vladimir Kramnik in Germany

September 27, 2008

   The upcoming World Championship Chess Match against Viswanathan Anand is not Vladimir Kramnik’s first chess match in Germany. In July of 2000 Kramnik played another high profile match in Deutschland. This time his opponent was the highly touted computer program Deep Junior. Because his opponent was a computer, Kramnik used anti-computer strategy that would not work against someone like Anand. This does not take anything away from Kramnik’s achievement in the game below. His play was nothing short of brilliant.
   Playing 2. e3, Kramnik is obviously playing a slightly inferior move to take the computer out of its opening book. Kramnik’s strategy is to eliminate any opening advantage the computer may have and then lock up the pawns to reduce the computer’s calculation advantage. Kramnik then will use the human advantage of being able to form a long term plan to set up a position that favors the human. Its amazing how coordinated Kramnik’s pieces become after 23. Bd1. His bishop, 2 rooks, queen and knight are all focused on Deep Junior’s king. In contrast, Deep Junior showed little understanding of what was happening when Kramnik played his 12, 15 and 18 move. Becuse of this lack of understanding the aspects of the advancing pawns in a closed position, Deep Junior’s pieces are caught in the wrong locations late in the game. After 25. e4 Kramnik unleashes his dark square bishop thus using all his pieces together in the same attack. The rest of the game Kramnik plays with the great accuracy that is needed to defeat a strong computer opponent.

 

 

[Event “SuperGM”]

[Site “Dortmund GER”]

[Date “2000.07.12”]

[EventDate “2000.07.07”]

[Round “5”]

[Result “1-0”]

[White “Vladimir Kramnik”]

[Black “Junior (Computer)”]

[ECO “D00”]

[WhiteElo “2770”]

[BlackElo “?”]

[PlyCount “65”]
1. d4 d5 2. e3 Nf6 3. Bd3 e6 4. f4 Be7 5. Nf3 c5 6. c3 O-O
7. Nbd2 Ng4 8. Qe2 c4 9. Bc2 f5 10. Rg1 Nc6 11. h3 Nf6 12. g4
Ne4 13. Qg2 g6 14. Qh2 Kh8 15. h4 Nxd2 16. Bxd2 fxg4 17. Ng5
Qe8 18. h5 gxh5 19. Rxg4 Rf6 20. Rh4 Rh6 21. O-O-O a5 22. Rh1
b5 23. Bd1 Ra7 24. Bxh5 Qf8 25. e4 Bd8 26. f5 b4 27. Bg6 Rxh4
28. Qxh4 bxc3 29. bxc3 Bf6 30. Qxh7+ Rxh7 31. Rxh7+ Kg8
32. Bf7+ Qxf7 33. Rxf7 1-0


%d bloggers like this: