Members · Prefs · Collections · Openings · Endgames · Sacrifices · History · Search Kibitzing · Kibitzer's Café · Chessforums · Tournament Index · Players · Kibitzing User Profile Chessforum
Member since Dec-31-08 · Last seen Feb-07-16
About Me (in case you care):

Old timer from Fischer, Reshevky, Spassky, Petrosian, etc. era. Active while in high school and early college, but not much since. Never rated above low 1800s and highly erratic; I would occasionally beat much higher rated players and equally often lose to much lower rated players. Highly entertaining combinatorial style, everybody liked to play me since they were never sure what I was going to do (neither did I!). When facing a stronger player many try to even their chances by steering towards simple positions to be able to see what was going on. My philosophy in those situations was to try to even the chances by complicating the game to the extent that neither I nor the stronger player would be able to see what was going on! Alas, this approach no longer works in the computer age. And, needless to say, my favorite all-time player is Tal.

I also have a computer background and have been following with interest the development in computer chess since the days when computers couldn't always recognize illegal moves and a patzer like me could beat them with ease. Now it’s me that can’t always recognize illegal moves and any chess program can beat me with ease.

But after about 4 years (a lifetime in computer-related activities) of playing computer-assisted chess, I think I have learned a thing or two about the subject. I have conceitedly defined "AylerKupp's corollary to Murphy's Law" (AKC2ML) as follows:

"If you use your engine to analyze a position to a search depth=N, your opponent's killer move (the move that will refute your entire analysis) will be found at search depth=N+1, regardless of the value you choose for N."

I’m also a food and wine enthusiast. Some of my favorites are German wines (along with French, Italian, US, New Zealand, Australia, Argentina, Spain, ... well, you probably get the idea). One of my early favorites were wines from the Ayler Kupp vineyard in the Saar region, hence my user name. Here is a link to a picture of the village of Ayl with a portion of the Kupp vineyard on the left:

You can send me an e-mail whenever you'd like to aylerkupp(at)

And check out a picture of me with my "partner", Rybka (Aylerkupp / Rybka) from the Masters - Machines Invitational (2011). No, I won't tell you which one is me.


Analysis Tree Spreadsheet (ATSS).

The ATSS is a spreadsheet developed to track the analyses posted by team members in various on-line games (XXXX vs. The World, Team White vs. Team Black, etc.). It is a poor man's database which provides some tools to help organize and find analyses.

I'm in the process of developing a series of tutorials on how to use it and related information. The tutorials are spread all over this forum, so here's a list of the tutorials developed to date and links to them:

Overview: AylerKupp chessforum (kibitz #843)

Minimax algorithm: AylerKupp chessforum (kibitz #861)

Principal Variation: AylerKupp chessforum (kibitz #862)

Finding desired moves: AylerKupp chessforum (kibitz #863)

Average Move Evaluation Calculator (AMEC): AylerKupp chessforum (kibitz #876)


ATSS Analysis Viewer

I added a capability to the Analysis Tree Spreadsheet (ATSS) to display each analysis in PGN-viewer style. You can read a brief summary of its capabilities here AylerKupp chessforum (kibitz #1044) and download a beta version for evaluation.


Chess Engine Evaluation Project

The Chess Engine Evaluation Project was an attempt to evaluate different engines’ performance in solving the “insane” Sunday puzzles with the following goals:

(1) Determining whether various engines were capable of solving the Sunday puzzles within a reasonable amount of time, how long it took them to do so, and what search depth they required.

(2) Classifying the puzzles as Easy, Medium, or Hard from the perspective of how many engines successfully solved the puzzle, and to determine whether any one engine(s) excelled at the Hard problems.

(3) Classifying the puzzle positions as Open, Semi-Open, or Closed and determine whether any engine excelled at one type of positions that other engines did not.

(4) Classifying the puzzle position as characteristic of the opening, middle game, or end game and determine which engines excelled at one phase of the game vs. another.

(5) Comparing the evals of the various engines to see whether one engine tends to generate higher or lower evals than other engines for the same position. If anybody is interested in participating in the restarted project, either post

Unfortunately I had to stop work on the project. It simply took more time that I had available to run analyses on the many text positions for each of the engines. And, it seems that each time that I had reasonably categorized an engine, a new version was released making the results obtained with the previous version obsolete. Oh well.


Ratings Inflation

I have recently become interested in the increase in top player ratings since the mid-1980s and whether this represents a true increase in player strength (and if so, why) or if it is simply a consequence of a larger chess population from which ratings are derived. So I've opened up my forum for discussions on this subject.

I have updated the list that I initially completed in Mar-2013 with the FIDE rating list through 2014 (published in Jan-2015), and you can download the complete data from It is quite large (116 MB) and to open it you will need Excel 2007 or later version or a compatible spreadsheet since several of the later tabs contain more than 65,536 rows.

The spreadsheet also contains several charts and summary information. If you are only interested in that and not the actual rating lists, you can download a much smaller (596 KB) spreadsheet containing the charts and summary information from You can open this file with a pre-Excel 2007 version or a compatible spreadsheet.

FWIW, after looking at the data I think that ratings inflation, which I define to be the unwarranted increase in ratings not necessarily accompanied by a corresponding increase in playing strength, is real, but it is a slow process. I refer to this as my "Bottom Feeder" hypothesis and it goes something like this:

1. Initially (late 1960s and 1970s) the ratings for the strongest players were fairly constant.

2. In the 1980s the number of rated players began to increase exponentially, and they entered the FIDE-rated chess playing population mostly at the lower rating levels. The ratings of the stronger of these players increased as a result of playing weaker players, but their ratings were not sufficiently high to play in tournaments, other than open tournaments, where they would meet middle and high rated players.

3. Eventually they did. The ratings of the middle rated players then increased as a result of beating the lower rated players, and the ratings of the lower rated players then leveled out and even started to decline. You can see this effect in the 'Inflation Charts' tab, "Rating Inflation: Nth Player" chart, for the 1500th to 5000th rated player.

4. Once the middle rated players increased their ratings sufficiently, they began to meet the strongest players. And the cycle repeated itself. The ratings of the middle players began to level out and might now be ready to start a decrease. You can see this effect in the same chart for the 100th to 1000th rated player.

5. The ratings of the strongest players, long stable, began to increase as a result of beating the middle rated players. And, because they are at the top of the food chain, their ratings, at least so far, continue to climb. I think that they will eventually level out but if this hypothesis is true there is no force to drive them down so they will stay relatively constant like the pre-1986 10th rated player and the pre-1981 50th rated player. When this leveling out will take place, if it does, and at what level, I have no idea. But a look at the 2013 ratings data indicates that, indeed, it may have already started.

You can see in the chart that the rating increase, leveling off, and decline first starts with the lowest ranking players, then through the middle ranking players, and finally affects the top ranked players. It's not precise, it's not 100% consistent, but it certainly seems evident. And the process takes decades so it's not easy to see unless you look at all the years and many ranked levels.

Of course, this is just a hypothesis and the chart may look very different 20 years from now. But, at least on the surface, it doesn't sound unreasonable to me.

But looking at the data through 2014 it is even more evident that the era of ratings inflation appears to be over. The previous year's trends have either continued or accelerated; the rating for every ranking category, except for possibly the 10th ranked player (a possible trend is unclear), has either flattened out or has started to decline.

Any comments, suggestions, criticisms, etc. are both welcomed and encouraged.

------------------- Full Member

   AylerKupp has kibitzed 8841 times to chessgames   [more...]
   Feb-07-16 Tata Steel (2016)
AylerKupp: <morfishine> Good Luck with that one> I would say that I would need more than luck to try to anticipate any or all of those factors. Luckily I probably don't have to. All that I need to know is whether a player is playing better than expected (think Caruana at the 2014 ...
   Feb-06-16 Team White vs Team Black, 2015 (replies)
   Feb-05-16 Fischer vs Geller, 1967 (replies)
AylerKupp: <<Howard> Probably not, I suspect, especially because Kasparov's MGP doesn't even address this move.> That might be due, at least in part, because in the position after 21...Ba4 [DIAGRAM] ... 22.Rh6 is not a legal move. So at least that saves you from pawing through ...
   Feb-05-16 Nisipeanu vs Caruana, 2015
AylerKupp: <Zhbugnoimt> Well, we shall consider your vision to be Zhbugnoimt's Immortal. Seriously, good job.
   Jan-31-16 Stockfish (Computer)
AylerKupp: This link indicating what's new in Stockfish 7 should be of interest to Stockfish users:
   Jan-27-16 M Admiraal vs E Warmelink, 2009 (replies)
AylerKupp: <Phony Benoni> Stop submitting puns on Monday! The <> staff is tired and not thinking straight after a weekend of partying, so their judgement is impaired. Actually, I'm just jealous that they don't invite me to them. I would fit right in since my ...
   Jan-26-16 Spassky vs Fischer, 1972 (replies)
AylerKupp: <chessarkitek> From the position after 42.Kh5 [DIAGRAM] The FinalGen tablebase generator indicates that White wins regardless of Black's move: 42...Kf5 White wins in 22 42...Ke5 White wins in 18 42...Ke4 White wins in 18 42...Kf3 White wins in 17 42...g5 White wins ...
   Jan-25-16 G Barcza vs Soos, 1962 (replies)
AylerKupp: If anyone is interested in a thorough investigation of the bishop vs. knight issue, see , although it's not worth the current price for the used book, much less the current price for a new book ($ 423.32!, they must think that chess players ...
   Jan-23-16 Eljanov vs Carlsen, 2016 (replies)
AylerKupp: Yes, at this rate Carlsen is going to get fat, very fat.
   Jan-11-16 Qatar Masters (2015) (replies)
AylerKupp: <latvalatvian> So I suppose that you judge human greatness by our ability to drink coffee and go to the bathroom?
(replies) indicates a reply to the comment.

De Gustibus Non Disputandum Est

Kibitzer's Corner
< Earlier Kibitzing  · PAGE 51 OF 51 ·  Later Kibitzing>
Premium Chessgames Member
  AylerKupp: <cro777> With regards to "The influence of technological tools over the game of chess is controversial", that is certainly true. And I think that a lot of it has to do with players' and authors' ignorance of how computers work in general and how chess engines work in particular, as well as a failure to understand certain basic mathematical and engineering principles.

Take for example "A Chess Engine is NOT Your Friend!" ( by IM Jeremy Silman. The second and third paragraphs say:

"A zillion people were using a zillion chess engines and they were all raving about how the grandmaster was in trouble."

"I found this funny, since the computer only had White a tiny bit ahead. (Why is the grandmaster in trouble if the number shows only a small plus?)" (The engine apparently evaluated the position at [+0.21])

I'm clearly biased but I think that whenever an author uses the world "zillion" he is automatically exaggerating to make a point, and his impartiality becomes immediately questionable. And to consider an evaluation of [+0.21] to be significant just shows that the people being referred to don't understand that such an evaluation is in the noise and effectively means that the position is even. They also don't understand the concept of significant digits, and it might be better if engines reported evaluations with a resolution of 0.5. Should computers in general and chess engines in particular be blamed because they don't know the lack of significance of an evaluation like [+0.21]? That's like saying that ¾ of the world's population should be considered illiterate because they might not be able to read and write English.

Mr. Silman later goes on to say that " CHESS ENGINES ARE OFTEN DETRIMENTAL TO THE CHESS HEALTH OF NON-MASTERS", further saying that "once the engine’s alarm bells go off, the innocent reader often views the concept as false, and all that he might have learned gets thrown out the window." Is that the fault of the engine or the fault of the "innocent reader".

Later on he discusses Fischer vs Reshevsky, 1966 which Fischer won partly (or perhaps largely) because Reshevsky didn't find 39...Rh8!! (found by Houdini). He does not consider the game any less beautiful and artistic in spite of Reshevsky not finding the drawing line, and I agree with him. But then he goes on to say that "When amateurs look at master games, the point is NOT to find errors, but to learn enough to appreciate the game’s beauty, and learn the lessons that eventually will allow you to create that same beauty in your games." I guess that I don't consider those two objectives to be mutually exclusive; one can learn enough to BOTH appreciate a game's beauty and learn the lessons that will eventually allow you to create the same beauty. But how can you do the latter if you don't find that your "beautiful" concept was in error?

His opinion and bias can be summarized in his last sentence: " As for Mr. Weski, please do yourself a favor and turn off the engine. You’ll be a better player if you do." Needless to say, I disagree with ALL his recommendations. He just doesn't know how to use chess engines to improve your chess and has a built-in bias against them because of his ignorance.

Premium Chessgames Member
  AylerKupp: <kwid> Thanks for thinking of me but, while interested, I probably wouldn't be able to make good use of them. I also have a significant chess book collection (but I suspect that it is nowhere as good as yours) and I don't have the time or ability to make much use of them. It reminds me at a restaurant I visited recently when, after a big multi-course dinner, the server asked me if I was interested in dessert. My answer: Interested, yes; capable, no."
Premium Chessgames Member
  cro777: Argumentum ad ignorantiam.

<I think that a lot of it has to do with players' and authors' ignorance of how computers work in general and how chess engines work in particular, as well as a failure to understand certain basic mathematical and engineering principles.>

The other component is the kowledge of the characteristics and processes of creativity in general, and creativity in chess in particular.

The widening of one's horizon is a necessary step to "understand why work with computers adds a new creative layer to the game."

Premium Chessgames Member
  AylerKupp: <<cro777> The widening of one's horizon is a necessary step to "understand why work with computers adds a new creative layer to the game.">

I agree, but unfortunately as far as this step is concerned we are all Luddites to a certain degree. Many apparently see computers as dehumanizing and tend to downplay any accomplishments made with their help, as though getting inferior results with computer assistance is somehow more "noble". I suppose that whenever a radical new technology that impacts our lives is introduced there is a time where that attitude prevails in many people, particularly those that do not fully understand it or, as Heinlein would say, "grok" it.

If these people would only realize that using computers in different and more effective ways is the same as exhibiting creativity in that particular domain and does not demean the final result, we will have moved forward a step or two.

May-13-15  morfishine: <AylerKupp> I wanted to clear something up. I always enjoy non-engine 'Brain Games'. I think those are the most rewarding. As for engine-assisted White vs Black games, those are fine too since these are fairly balanced.

The point I was trying to make is that WT games vs ANY individual do not interest me anymore since there is nothing to prove. IMO, there just isn't any challenge when hundreds of engines are lined up against any single GM.

So, I look forward to the next Brain Game and hope we end up on the same team!


Premium Chessgames Member
  AylerKupp: <morfishine> I like both engine and non-engine games since they are very different in many ways and yet similar in so many others. They exercise different brain cells, at least for me.

One aspect of these team games that is not mentioned as much as I think it should be are the interactions with the various players and the efforts necessary to support your move preferences, particularly if you feel strongly about a particular move. The latter is both funny and sad; to see the emotional state that some players work themselves into in support for or antagonism against a particular move. But, after all, it's only a game, and I don't think that anyone's livelihood is dependent on whether their team wins, so the emphasis should be on having fun and enjoying yourself. Unfortunately some players seem to get carried away and spoil the game to some extent for many of us.

I agree with you that there isn't much to prove anymore when playing against a single GM. In the original Chessgames Challenge the question was: "Can a group of chess amateurs team up to beat a grandmaster?" The answer is clearly YES, at least with engine assistance. Any grandmaster regardless of their talent and experience, with their busy schedule and limited computer resources is going to have a hard time against a group of amateurs with lots of time and dedication and supported by an array of computers and the latest chess engines. So I've occasionally mentioned that the question should be reversed into something like "Can a grandmaster beat a group of dedicated amateurs armed with the latest chess technology?" Still, it would be great fun to play against, say, Carlsen or Nakamura, regardless of computer assistance don’t you think?

And, yes, I'm also looking forward to the next Battle of the Brains game. As far as being on the same team, be careful what you ask for. You might need to read all my verbose posts just in the rare case that I say something useful. :-)

Premium Chessgames Member
  AylerKupp: <Investigation of search tree pruning improvements in the last several years> (part 1 of 2)

In Kasparov vs Deep Blue, 1997 (kibitz #123), in response to a question by <Alan Vera> as to which computer system would win in a match, Komodo 9 or Deep Blue, I stated my opinioin that Komodo 9 would win easily because of its ability to prune its search tree much more effectively, thus compensating for its relatively much slower position evaluation time due to Deep Blue's special hardware assistance. I therefore ran an analysis of this critical position from The World vs Naiditsch, 2014 after 13...d5, when the World Team needed to decide between 14.e5 and 14.exd5:

click for larger view

The World Team narrowly chose 14.e5, 135 votes vs. 127 votes for 14.exd5, and the character of the game would have been very different if 14.exd5 had been chosen.

At any rate, I decided to see how quickly earlier versions of Komodo, Houdini, and Stockfish reached the various search depths compared to the latest versions of Komodo, Houdini, and Stockfish on the same computer, and thus see how search tree pruning efficiently had improved in the last few years. Of course, this wouldn't be the entire reason since evaluation function efficiency might also have been improved as well as the overall code.

The earliest versions of these engines I have are Komodo 1.3 (Jan-2011), Houdini 1.03 (Oct-2010), and Stockfish 1.91 (Nov-2010). The latest versions of these engines I have (which I believe are close to the latest versions available) are Komodo 9.01 (May-2015), Houdini 4 (June 2014), and Stockfish 6 (Jan-2015). Komodo was a little bit more complicated since up to version 5 it was a single-processor (SP) engine and only starting with version 5.1 did it become a multi-procesor (MP) engine, and I didn't think that it would prove much comparing the time to search depth between SP and MP engines. So I ran and compared analyses between Komodo 1.3 and Komodo 5, and between Komodo 5.1 and Komodo 9.01.

And, since I had some time on my hands, I also ran analyses of intermediate versions of Komodo and Stockfish; Komodo 3 (SP, Aug-2011), Komodo 7 (MP, Jun-2014), and Stockfish 3 (May-2013). I chose these intermediate versions so that their release dates would be roughly half-way between the earliest and latest engine versions, just to see the expected improvement. Unfortuantely, I was too cheap to buy any intermediate Houdini versions (Houdini went commercial starting with version 2.0), but at least Houdini 1.03 was also MP.

Premium Chessgames Member
  AylerKupp: <Investigation of search tree pruning improvements in the last several years> (part 2 of 2)

Summary of Results:
Engine <Nodes/Sec> Max Depth

Komodo 1.03 (SP) <750,800> 26

Komodo 3 (SP) <449,064> 26

Komodo 5 (SP) <428,054> 26

Komodo 5.1 (MP) <1,638,104> 32

Komodo 7 (MP) <1,917,337> 27

Komodo 9.01 (MP) <1,768,387> 24

Houdini 1.03: <4,229,000> 30

Houdini 4: <4,885,000> 33

Stockfish 1.91 <3,202,904> 31

Stockfish 3 <2,816,137> 36

Stockfish 6 <2,928,442> 38


1. As expected, the more recent the version of Houdini, Stockfish, and Komodo MP, the quicker it reached a specific search depth. But this did not apply to Komodo SP; the latest SP version (Komodo 5), took longer to reach a specific depth than either of the 2 earlier SP versions, Komodo 1.03 and Komodo 3.

2. Komodo 9.01 seems to be a substantial improvement over Komodo 7 in terms of reaching deeper depths more quickly. So Komodo's claim seems accurate, although its improvement over Komodo 8 (which I didn't run) is probably less than its improvement over Komodo. Still, no challenge to Stockfish.

3. The fastest Nodes/sec rate does not necessarily correspond to the latest engine version. The reduction in Nodes/sec might indicate the additional time spent per node in pruning the search tree (time well spent).

4. As expected the Nodes/sec figure improved dramatically between the Komodo SP and the Komodo MP versions, almost 4X between the latest SP version and the first MP version. However, the changes in the Nodes/sec between all engines' versions was not strictly monotonic.

5. The evaluation trends for all the engines seem consistent except for Stockfish 3 which had substantially different evaluations from d=25 to d=33 for its top line.

6. All engines evaluated the two moves, 14.exd5 and 14.e5 quite closely, with not much to chose between either move. Later versions of Komodo seemed to evaluate 14.e5 somewhat higher than 14.exd5, but not enough to be significant.

Those interested in seeing the ply-by-ply changes and charts of the time-to-depth and evaluation change trends can download an Excel spreadsheet from

Jun-07-15  morfishine: <AylerKupp> Thanks for the reply. On some of your comments: <One aspect of these team games that is not mentioned as much as I think it should be are the interactions with the various players and the efforts necessary to support your move preferences, particularly if you feel strongly about a particular move. The latter is both funny and sad; to see the emotional state that some players work themselves into in support for or antagonism against a particular move. > I'm not sure where you are going with this. I really don't know if interactions with other members needs to be mentioned. However, the social aspect is powerful. I've made many friends here at <CG> through such interactions. One learns who is and who isn't their friend(s) pretty quickly. Also, one must proceed with caution since there's a separation through digital communication. For example, what may sound sarcastic was actually not intended, or vice versa. <I agree with you that there isn't much to prove anymore when playing against a single GM...Still, it would be great fun to play against, say, Carlsen or Nakamura, regardless of computer assistance don’t you think?> Well, that depends on your definition of 'fun'. I don't think any single GM has any chance at all of So regardless of whether its Carlsen or Nakamura, where is the challenge? IMO, if there's no challenge, there's no fun. And the other thing that bugs me is no GM has expressed the slightest interest in any meaningful post-mortem. Its invariably “Thanks for the game” and thats it. There's no discussion with the GM, which I think most people desire. <And, yes, I'm also looking forward to the next Battle of the Brains game> Me too. These are not identical to regular OTB conditions of any time control. We have access to opening and ending books and can setup the pieces or use a PGN viewer to work out lines. Still, the lines are purely our own creation without any engine input


Premium Chessgames Member
  AylerKupp: <morfishine> I wasn't consciously going anywhere with my statement about needing to support your move preferences if you feel strongly about a particular move. Just mentioning what I think is a fact, some players feel strongly about particular moves and, if they do, they sometimes go to what I think are extremes to either campaign in favor of a particular move or campaign against other moves. That's just human nature, I guess. I think that <RandomVisitor>'s approach is best; provide the data and let others do with it what they wish.

As far as my definition of "fun", I think that having bragging rights is "fun". If we were able to beat Carlsen or Kasparov in a team game with engine assistance then being able to brag about it would be "fun", even if the outcome might have been predictable. But I don't think that the outcome of playing against a <motivated> current or former OTB world chess champion, with the <resources> to have a staff performing engine analyses, and one who is willing to devote <adequate time> to the game is necessarily predictable. As a team we would probably still have the advantage of numbers (unless out opponent was <really> serious about defeating us and was willing and able to hire a staff of 100 players to perform engine analyses) and our opponent would have the advantage of superior chess knowledge, experience, and judgment.

I share your disappointment about not having our GM opponents participate in our post-mortems. I think that Arno Nickel both in his rematch game and to a lesser extent in the first game was the only one who participated extensively in post mortem discussions. Unfortunately, that was before I began to participate in these games.

But in a way I can't blame them for not participating. They are typically very busy people and if they lost the game that was probably one of the reasons, their inability to devote a sufficient amount of time and effort to the game. Besides, it's probably not much fun losing to a bunch of amateurs, whether supported by immense computer power or not, and then having to relive the experience.

Hopefully I'll see you during the next Battle of the Brains.

Premium Chessgames Member
  juan31: < AylerKupp> you're are invited to the <♔ Game Prediction Contest for Sinquefield Cup 2015 ♔> Golden Executive forum. Line-up:
Carlsen, Caruana, Nakamura, Anand, Topalov, So, Grischuk, Giri, Aronian, Vachier-Lagrave. < We hope your attendance>
Premium Chessgames Member
  Golden Executive: Hi <AylerKupp>. I am so glad you visited my forum to participate in the prediction contest. I feel honored. Thanks.

I want to share with you my 'secret weapon' to make the predictions when I have no idea what to do. I bought it about 30 years ago in Radio Shack:

Premium Chessgames Member
  NeverAgain: Hey, AK!

Seeing how often you refer to your setup as "antiquated" and you being one of the handful of regulars whose posts are always worth reading, I thought I'd share the results of the upgrade I undertook last week.

My main box is even older than your laptop, as you no doubt saw in my posts in the Stockfish thread. Even after overclocking that Core 2 Duo to 3.6 GHz I don't get more than about 2,000 kN/s with the official SF6 32-bit release.

Last week, after several hours of research I decided to break down for a dual Xeon X5670, which I reckoned to be the best deal for chess analysis. In your earlier post you mentioned reaching d=29 in under 3 minutes on your setup. Well, how 'bout 9 *seconds* with the Sep 18 x64 POPCNT (aka "modern"/"sse4") build?

Lenovo ThinkStation D20 Workstation:

benchmark in Arena (The World vs Naiditsch, 2014 position above):

The moves/lines have been edited out for better readability. In short, you reach d=35 (our mutually agreed minimum trustworthiness level) in 3:05 and d=40 in 26:28, with the speed maxing out at just over 13.3 mN/s.

That's quite a complex position to analyze from scratch, you can expect faster speed when you go through the whole game move by move with automatic analysis. That's why I advocate this particular workstation model, for its generous 48 GB memory bank. A 32 GB hash really helps for up to 9,000 mN (about d=36 here), then things slow down somewhat. Also note that I leave one core out of 12 for the system, so you can do other stuff on it at the same time and keep the CPU temps down a bit.

With 5-pcs Syzygy TBs you can reach pretty ridiculous depths in endgames, I've seen d=60+ reached literally within a couple of minutes, with kN/s going over 20,000.

All in all, it's a great deal, IMO.
For comparison to other top systems benchmarking an August build of SF6, see Sedat's site:

As you can see, my box is in the 6th place, above a lineup of more recent i7s, each costing a couple of grand (and most of which are overclocked to boot, which you can't do with this system). Which is pretty damn amazing for an under-$800 box, shipped.

Of the top five entries, four are from the much more recent Xeon E5 crop. Those babies retail for $4000-6000 - a *chip*. I haven't had a good look at the complete workstation prices, they were too scary. ;) So if 1/2 the speed for 1/20th the price is your idea of a good deal, the D20 should be right up your alley.

A note about Sedat's benchmarks: the position and the engine setup he uses allows for some pretty inflated numbers, don't expect to see them in your everyday deep analyses. However, as long as everyone uses the same benchmark, I see no big problem: the numbers should reflect the ratios between various systems.

If that particular model sells out before you get there, or if you opt for a different config, here's a handy Amazon search link for "Dual Xeon X5670":

Note that most of these come with an OS (typically Win7 Pro x64), but some may come without, so read the small print in the descriptions carefully. And of course, they are all refurbished (the MSRP on this particular box was close to 10 grand) but as the seller has a nearly 100% feedback rating, I think it's a safe choice.

Please post *your* benches if you decide to go for it. ;)

Premium Chessgames Member
  AylerKupp: <NeverAgain> Thanks for the information and links. I have been thinking about upgrading my system for the last 2 years but, just like my analog Sony TV that I was happy with for so many years, my current "oldish" system has been running reasonably well for almost everything I use it for and it just grates me to replace something that is still working reasonably well. But I finally gave up on my TV and I replaced it, and the other analog TVs I had in the house, with recent LCD TVs.

In my experience in order to get a noticeable increase in performance you need to double your system's speed. In my case that would be a minimum of 8 processors. But that's not that much anymore, so I have set my sights on what I refer to as my "sweet 16" system; 16 cores, 16 GB RAM, 16 TB disk. But 16 GB of RAM is not that much anymore, and 16 TB disk is probably overkill and unnecessary unless I wanted to install 7-piece Lomonosov tablebases, and then it wouldn't be enough.

Christmas is coming up and so is my birthday (January). So maybe those will be the excuse and push I need to do it. And you can count on my posting benchmarks; that will probably be one of the first things I do when I get a new system to see how much faster the new system is compared to my old one.

One question, though. Why are you only running 5-piece Syzygy tablebases when 6-piece are relatively compact (about 160 GB)? You can get SSDs that will hold them easily and provide you fast access. But even that is probably not necessary.

Premium Chessgames Member
  NeverAgain: SSDs are a must for the 6-men Syzygy, as these tables feature a dozen files larger than 1 GB and two over 2 GB. Reading those repeatedly from a regular HDD will kill the NPS *and* the drive quickly, heh.

At the time of your post I already had the 6-men Syzygy downloaded, two torrents a little under 150 GB combined - thanks to the 64 Mbit cable, I shudder to think how long it would have taken to leech them with my old DSL, never mind dial-up! - but had trouble making them work on my main box, the 32-bit XP Core 2 Duo one. Both Komodo and SF kept throwing up an exception and dying as soon as TB were accessed. Seems like a 64-bit OS is another requirement, as they work fine on the Win 7 Pro x64 with the new 240 GB Samsung SSD (from Amazon as well).

You are right - it was all worth the hassle in the end, though. With Komodo 9.2 I get usually around 14-15 mN/s. With the 3+4+5 Syzygy it went up to 20+ in endgames. With the 6-men TB I have seen over 30!

BTW, Komodo has been going the SF way pruning-wise. Remember those earlier versions, v5 and v6 (now both freeware) - they were like Rybka and Houdini, starting in low-to-mid teens and slowly working their way over the 20-ply hump. Then v9.02 started reaching mid-20s pretty quickly, and now v9.2 will typically get you to d=30 in seconds!

I agree with you on HDD space, those terabytes are completely redundant for chess. What engines support the Lomonosov TB anyway? And is there even consumer-grade hardware capable of handling them? I think for now it's strictly super-comp stuff for scientists and enthusiasts with more disposable income than common sense (wish I were one of the latter ;).

As for memory, I urge you not to consider anything below 24 GB. This way you'll be able to have a 16 GB hash table, at least. Remember, that its size is limited to powers of two (for the mainstream engines, at least). Additionally, Komodo will use some 10% less of the hash table allocated. So if you go for a 16 GB box now your max hash will be 8 GB. That's good for about 4,000 mN, give or take a couple hundred, not an exceedingly impressive number for someone who habitually does overnight analyses.

I did some hash tests with SF, and it seems to perform progressively slower (500-1,000 kN/s) as you go over 1 gig. That's on individual positions. If you do the whole game at once - either automatically, or by sliding back or forth a ply at a time - the benefits of a large hash really come to the fore. In some middle-game positions it can take over 5 minutes to get to d=35, about 10 min to d=38. Then you slide a ply and - boom - you get d=33 almost instantly!

Go for at least 24, I say and if you can find (and afford) 48 or 96 you won't regret it in the long run.

Premium Chessgames Member
  NeverAgain: <With the 3+4+5 Syzygy it went up to 20+ in endgames. With the 6-men TB I have seen over 30!>

Heh. The question is, if you put the Lomonosov TB on a today's Cray equivalent, will it be *over 9,000!* ?

Premium Chessgames Member
  AylerKupp: <NeverAgain> I had found out some time ago that 6-piece Syzygy tablebases don't work on 32-bit machines. I suspect that there are some 64-bit data structures that don't map well or were improperly mapped to 32-bit machines and that were not properly tested. After all, who bothers with 32-bit machines these days? But, as you have also properly found out, if you restrict the tablebases to contain only 5-pieces then they work just fine. So I run with 5-piece Syzygy databases on my 32-bit machines and with 6-piece databases in my slow 64-bit laptop, and neither has an SSD.

Yes, I know about Komodo entering the search tree pruning wars with Stockfish. This started with Komodo 9.01 and its Selectivity (minimum 10; maximum 200; default 80 for Komodo 9.01 and 9.02, 68 for Komodo 9.1, and 74 for Komodo 9.2; I guess they must still be calibrating it for best overall performance) and Reduction (minimum -1500, maximum 150, default 0) parameters. I have been curious for a while but haven't had the time (and keep forgetting) to try a race between Stockfish and Komodo with its Selectivity and Reduction parameters set at the maximum and see what happens. At least Komodo gives you the option to change them.

I don't think that any engine yet that supports 7-piece Lomonosov tablebases nor do I know whether the tablebase probing code has been released (a quick search did not show anything) because their size, approximately 140 TB, is pretty much out of reach for mere mortals like us. So, without a ready market capable of having the tablebases, there wouldn't likely be any motivation for the engine developers to include their usage in their engines, particularly if, in the absence of freely distributed tablebase probing code, they would have to invest their resources to develop it.

And, yes, I will definitely get as much memory as I can afford when the time comes. I remember quite a few years ago when a friend told me that he had a spare memory board (yes, they were boards in those days) and whether I needed more memory in my computer. I of course told him that one always needs more memory that one has.

Premium Chessgames Member
  juan31: ♔ ANNOUNCEMENT ♔
<Game Prediction Contest> for the <Bilbao Masters 2015> tournament. In <Golden Executive Forum>

Round 1 will be played next Monday October 26 16:00 CET(UTC+1:00). The posting pairings (probably sometime Sunday). At that point, the game prediction contest will be open.


Viswanathan Anand, Anish Giri, Liren Ding, Wesley So.

Rounds: 6 (double round robin).
Sofia and Bilbao rules apply.


Premium Chessgames Member
  juan31: ♔ ANNOUNCEMENT ♔ <Game Prediction Contest> for the <Bilbao Masters 2015> tournament. In <Golden Executive Forum>. < IS OPEN > < TODAY> Line-up: Viswanathan Anand, Anish Giri, Liren Ding, Wesley So.

Rounds: 6 (double round robin).
Sofia and Bilbao rules apply.


Premium Chessgames Member
  NeverAgain: AK: time to gather the stones ;)

Y Gusev vs E Auerbach, 1946

Premium Chessgames Member
  juan31: To < AylerKupp>

In < Golden Executive forum > <Game Prediction Contest> for the <London Chess Classic 2015> tournament. Round 1 will be played next Friday December 4 16:00 GMT(UTC +0:00).

Carlsen, Caruana, Nakamura, Anand, Topalov, Grischuk, Giri, Aronian, Vachier-Lagrave, Adams.

Rounds: 9

The full pairings are released; the game prediction contest is open right now.

Just post your predictions before each round begins.

Premium Chessgames Member
  Golden Executive: Merry Christmas and a Happy New Year 2016 to you and yours <AylerKupp>!
Premium Chessgames Member
  WinKing: Merry Christmas & Happy Holidays to you <AylerKupp>!
Premium Chessgames Member
  wordfunph: <AylerKupp> Merry Christmas!
Jan-02-16  Dionyseus: <AylerKupp> My computer analysis shows that Fischer could have drawn the first game in his 1972 match against Spassky with 31...Ke7. I posted my analysis at Spassky vs Fischer, 1972
Jump to page #    (enter # from 1 to 51)
< Earlier Kibitzing  · PAGE 51 OF 51 ·  Later Kibitzing>

Bobby Fischer Tribute Shirt
NOTE: You need to pick a username and password to post a reply. Getting your account takes less than a minute, totally anonymous, and 100% free--plus, it entitles you to features otherwise unavailable. Pick your username now and join the chessgames community!
If you already have an account, you should login now.
Please observe our posting guidelines:
  1. No obscene, racist, sexist, or profane language.
  2. No spamming, advertising, or duplicating posts.
  3. No personal attacks against other members.
  4. Nothing in violation of United States law.
  5. No posting personal information of members.
Blow the Whistle See something that violates our rules? Blow the whistle and inform an administrator.

NOTE: Keep all discussion on the topic of this page. This forum is for this specific user and nothing else. If you want to discuss chess in general, or this site, you might try the Kibitzer's Café.
Messages posted by Chessgames members do not necessarily represent the views of, its employees, or sponsors.
Participating Grandmasters are Not Allowed Here!

You are not logged in to
If you need an account, register now;
it's quick, anonymous, and free!
If you already have an account, click here to sign-in.

View another user profile:

home | about | login | logout | F.A.Q. | your profile | preferences | Premium Membership | Kibitzer's Café | Biographer's Bistro | new kibitzing | chessforums | Tournament Index | Player Directory | World Chess Championships | Opening Explorer | Guess the Move | Game Collections | ChessBookie Game | Chessgames Challenge | Store | privacy notice | advertising | contact us
Copyright 2001-2016, Chessgames Services LLC
Web design & database development by 20/20 Technologies