algorithms

Beyond Google

What should we expect of search engines and companies behind them today?

To be able to find the richest (with the most material on board) chess position ever seen in a real high ranking tournament, for example!

Heavy

[Event “Australia”|Site “Australia”|Date “1965.??.??”|Round “1”|White “Sumpter”|Black “King”|Result “1-0″|ECO “B47”]1. e4 c5 2. Nf3 Nc6 3. d4 cxd4 4. Nxd4 e6 5. Nc3 Qc7 6. Be2 a6 7. O-O b5 8. Kh1 Nf6 9. f4 b4 10. e5 bxc3 11. exf6 cxb2 12. fxg7 bxa1=Q 13. gxh8=Q Qxa2 14. Qxh7 a5 15. h4 a4 16. h5 a3 17. h6 Qb1 18. Qg8 a2 19. h7 a1=Q 20. h8=Q …

88 points in pieces. 10 more than in the opening position. It ends like this:

Qb4 21. Be3 Nxd4 22. Bxd4 Qaa3 23. Bh5 d5 24. f5 Ba6 25. fxe6 O-O-O 26. Rxf7 Qca5 27. c3 Qd6 28. Bg4 Re8 1-0

 

And how about a position with the most queens ever?

6queens

Event “FSIMB October”|Site “Budapest HUN”|Date “2009.10.04”|Round “2”|White “Szalanczy, E.”|Black “Nguyen, T.”|Result “1/2-1/2″|WhiteElo “2354”|BlackElo “2437”|ECO “B90”] …

6 queens only, just as many as in the first (the heaviest of them all) situation. There are more than 35 of such among more than two hundred fifty million positions derivable from 2 million games recorded in the last 200 years or so.

Which game ever played has returned to the opening position as late as possible?

It was: [Event “Australian Open”|Site “Cammeray AUS”|Date “2011.01.13”|Round “11.24”|White “McGuirk, Michael”|Black “Perera, Pasan”|Result “1/2-1/2″|BlackElo “1866”|ECO “A05”]1. Nf3 Nf6 2. Nc3 Nc6 3. Nh4 Nb8 4. Nf3 Na6 5. Nb1 Nc5 6. Nd4 Na6 7. Nb5 Nb8 8. N5a3 Nh5 9. Nc3 Nf4 10. Na4 Ne6 11. Nb6 Nc6 12. Nd5 Nc5 13. Nc4 Nd4 14. Na3 Nf5 15. Nb5 Na6 16. Nd4 Nd6 17. Ne3 Nb8 18. Nef5 Ne4 19. Nf3 Nc6 20. N5h4 Nc5 21. Ng1 Na6 22. Ng6 Nab8 23. Ne5 Nd4 24. Nc4 Nf5 25. Na3 Nh6 26. Nb1 Ng8 …

They played 52 plys or half moves only with horses. Returning them back home and begin to play for real only then.

Which was the “bloodiest” game ever played by grand masters? The most aggressive from both sides?

The answer is:

[Event “Steinhart Mem”|Site “Herzeliya ISR”|Date “2006.12.08”|Round “2”|White “Haimovich, T.”|Black “Zifroni, D.”|Result “1/2-1/2″|WhiteElo “2436”|BlackElo “2523”|ECO “A10”]1. c4 d5 2. cxd5 Qxd5 3. Qc2 Qxg2 4. Qxc7 Qxg1 5. Qxb7 Qxh2 6. Qxb8 Qe5 7. Qxc8+ Rxc8 8. Rxh7 Qxb2 9. Rxh8 Qxa2 10. Rxg8 Qxd2+ 11. Kxd2 Rxc1 12. Rxg7 Rxb1 13. Rxf7 Rxf1 14. Rxf8+ Kxf8 15. Rxa7 Rxf2 16. Rxe7 Rxe2+ 17. Kxe2 Kxe7 1/2

All pieces except kings have fallen in 34 plys or half moves. As if it was a staged game.

Well … Google should know where the so called million chess base is, on the Internet. Google should also know where to get and how to run those PGN algorithms, scattered all around – on the Internet. And how to further advance chess knowledge from there. Automatically, 100%. And to suggest not only answers, but questions as well.

Have you ever wondered which position is the  earliest, from which grand-masters have always won?

Have you ever wondered what is the largest cycle from position X, back to the position X?

You may wonder that now!

Of course, it’s not only chess, it is everything.

Advertisements
Standard

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s