Slashdot Mirror


The New (Computer) Chess World Champion

An anonymous reader writes: The 7th Thoresen Chess Engines Competition (TCEC) has ended, and a new victor has been crowned: Komodo. The article provides some background on how the different competitive chess engines have been developed, and how we can expect Moore's Law to affect computer dominance in other complex games in the future.

"Although it is coming on 18 years since Deep Blue beat Kasparov, humans are still barely fending off computers at shogi, while we retain some breathing room at Go. ... Ten years ago, each doubling of speed was thought to add 50 Elo points to strength. Now the estimate is closer to 30. Under the double-in-2-years version of Moore's Law, using an average of 50 Elo gained per doubling since Kasparov was beaten, one gets 450 Elo over 18 years, which again checks out. To be sure, the gains in computer chess have come from better algorithms, not just speed, and include nonlinear jumps, so Go should not count on a cushion of (25 – 14)*9 = 99 years."

107 comments

  1. Playing chess by Anonymous Coward · · Score: 0, Redundant

    Playing chess is good for brain development. I recommend it.

    1. Re:Playing chess by metrix007 · · Score: 1

      Like what?

      --
      If you ignore ACs because they are anonymous - you're an idiot.
    2. Re:Playing chess by retchdog · · Score: 2

      i'd say go, probably. the rules are more minimal; the state space is larger and more connected with fewer dead-ends and "gotchas"; and it seems just as difficult/competitive. it's not unreasonable to think that games with more rules will tend to produce more specialized skills, and that specialized skills are inferior to general skills as far as "brain development" (whatever that means) is concerned.

      also, dual n-back is supposedly shown to increase general intelligence rather than just skill. it's not exactly a lot of fun, but that's not the point.

      --
      "They were pure niggers." – Noam Chomsky
    3. Re:Playing chess by Paradise+Pete · · Score: 1

      Computer programming, even setting aside the practical value, is a much better brain trainer than chess. I was a chess master in my youth and made my living programming. The two were not even in the same ballpark as far as learning to think.

    4. Re:Playing chess by TheRaven64 · · Score: 2

      I went to school with someone who was UK national chess champion for his age bracket for most of the time until about age 14. He never demonstrated any exceptional ability in anything else (not top in his class in maths at any age, for example) and didn't get exceptionally good results in his later exams. I realise that this is a single anecdote, but it left me quite sceptical about the ability of chess to train the mind. I was on my school chess team for a bit, but eventually I found purely deterministic games to be as tedious as purely nondeterministic ones.

      --
      I am TheRaven on Soylent News
    5. Re:Playing chess by Vermonter · · Score: 3, Informative

      To add to this, Go also uses both hemispheres of the brain. There is the logical aspect of the game, where you read out a sequence of moves, and there is also the visual pattern aspect, where a player will look for moves that make "good shape", or will look for other patterns on the board that have their own traits.

    6. Re:Playing chess by Anonymous Coward · · Score: 0

      sorry, but at least for those of us who have a highly developed spatial sense, chess is incredibly spatial.

      there is an enormous difference between attempting to play on a computer screen vs. over a (3D) real life board, and many moves just feel right by their appearance, how they fit in the interlocking web of moves all the other pieces on the board can make.

      sure, computers can play excellent chess by analyzing a lot of moves, but the same is true for go, and the same for go and chess, humans use spatial reasoning however that is accomplished.

    7. Re:Playing chess by phantomfive · · Score: 1

      there is also the visual pattern aspect, where a player will look for moves that make "good shape", or will look for other patterns on the board that have their own traits.

      Chess is the same.

      --
      "First they came for the slanderers and i said nothing."
    8. Re:Playing chess by retchdog · · Score: 1

      Yeah, they both have spatial components, but go is basically nothing else. There are no distinct pieces with special rules; practically all of the strategy is from spatial arrangements without obvious shortcut heuristics. Counting material doesn't work so well and neither does combinatorially forcing your opponent.

      This isn't to say that go is better than chess, and i definitely think the left/right-brain distinction is overrated, but they are not "the same."

      --
      "They were pure niggers." – Noam Chomsky
    9. Re:Playing chess by phantomfive · · Score: 1

      it's still just a move tree with pruning

      --
      "First they came for the slanderers and i said nothing."
    10. Re:Playing chess by retchdog · · Score: 1

      well, yes, and so is all of life, if you want to think of it that way. what's your point?

      --
      "They were pure niggers." – Noam Chomsky
    11. Re:Playing chess by phantomfive · · Score: 1

      My point was that chess is visual, where a player will look for moves that make "good shape", or will look for other patterns on the board that have their own traits. lol

      --
      "First they came for the slanderers and i said nothing."
    12. Re:Playing chess by retchdog · · Score: 1

      you either don't get it, or are being purposely obtuse. i have no patience either way.

      --
      "They were pure niggers." – Noam Chomsky
    13. Re:Playing chess by phantomfive · · Score: 1

      Either that, or Go is a lot more similar to chess than you realize lol. The major difference is the branching factor is so huge in Go, it gives the computer problems. If that weren't so, then the monte carlo algorithm for Go wouldn't be effective.

      --
      "First they came for the slanderers and i said nothing."
  2. Progress of Chess since Deep Blue by Anonymous Coward · · Score: 0

    Another excellent article on how computer chess has progressed since the time of Deep Blue is here

      http://en.chessbase.com/post/komodo-8-deep-blue-revisited-1-2

    1. Re:Progress of Chess since Deep Blue by Anonymous Coward · · Score: 0

      Also see the related article talking about the significant increase in strength resulting from software improvements over the last 8 years as opposed to pure hardware gains

      http://en.chessbase.com/post/komodo-8-the-smartphone-vs-desktop-challenge

  3. Big Data for chess by lucm · · Score: 3, Interesting

    I would be curious to see how an algorithm based on millions of actual games fares against a pure mathematical model. "Based on your interest in taking queens with a pawn, you might be interested into taking a bishop with your rook".

    --
    lucm, indeed.
    1. Re:Big Data for chess by Anonymous Coward · · Score: 1

      Or ... "It looks like you're possibly planning to sacrifice your bishop to the opponent's rook." Click here to see the usual counter.

    2. Re:Big Data for chess by SeaFox · · Score: 2

      Is it bad I mentally saw the message appearing in a speech balloon from Clippy?

    3. Re:Big Data for chess by AK+Marc · · Score: 1

      I imagine all messages as having come from Clippy.

    4. Re:Big Data for chess by lucm · · Score: 3, Insightful

      I always wondered, why does it become evermore more pressing as we get closer to home? As my ass lands on the toilet it seems it couldn't have waited even one more second before exploding.

      It's a manifestation of enantiodromia. In layman's terms, the sudden availability of the toilet causes a paradigm shift as the quest is now fulfilled; the subject decathects from his need for restraint but cognitive dissonance (or more accurately: an availability heuristic bias) usually misleads him into discarding the crossing of the motivational inflection point and to falsely believe that he couldn't have waited longer.

      --
      lucm, indeed.
    5. Re:Big Data for chess by phantomfive · · Score: 1

      I would be curious to see how an algorithm based on millions of actual games fares against a pure mathematical model.

      Poorly, unless you have a new algorithm the world hasn't seen yet. Presumably there's a way to do it (because humans do it), but so far no one's figured out how to get a computer to do it.

      --
      "First they came for the slanderers and i said nothing."
    6. Re:Big Data for chess by Anonymous Coward · · Score: 0

      Thank you, much informative!

    7. Re:Big Data for chess by Anonymous Coward · · Score: 0

      My understanding is that all modern chess programs make use of both because without an opening book, computers do very poorly at openings. So I would expect the "pure mathematical model" to do much worse.

    8. Re:Big Data for chess by Anonymous Coward · · Score: 0

      If I remember correctly the Deep Blue already employed heuristics based on actual game statistics.

    9. Re:Big Data for chess by Anonymous Coward · · Score: 0

      usually misleads him into discarding the crossing of the motivational inflection point and to falsely believe that he couldn't have waited longer.

      I take it you rarely take your seat on the throne with fecal matter beginning to emit before you have made contact. Or, conversely, minor defecation having begun during your final scurry to the facilities.

      That's my definition of "couldn't have waited any longer".

    10. Re:Big Data for chess by Anonymous Coward · · Score: 0

      I would be curious to see how an algorithm based on millions of actual games fares against a pure mathematical model. "Based on your interest in taking queens with a pawn, you might be interested into taking a bishop with your rook".

      Today's chess programs are tuned by playing millions of (quick) games against itself. So we already have something like that

    11. Re:Big Data for chess by Paradise+Pete · · Score: 2
      The tactics (he takes and I take...) computers have down cold. That's how they beat humans. They never miss a trick, and so even the best humans get worn out sweating every crazy possibility. Many many computer games have been won by some one crazy move that makes a seemingly lost position tenable.
      The strategy (long-term planning and positioning) is where computers are weaker. Not weak, but weaker.

      Once the end game is reached a large database of positions is used. (Humans effectively do this too, in the sense that a particular ending is a known win, and so they can steer for it without having to work it all out ahead of time.)

    12. Re:Big Data for chess by Stephen+Chadfield · · Score: 1

      Clippy is the only one still speaking to me.

    13. Re:Big Data for chess by wonkey_monkey · · Score: 2

      You just took my knight. You won't believe what happens next!

      Check out this one weird trick with a pawn.

      --
      systemd is Roko's Basilisk.
    14. Re:Big Data for chess by Anonymous Coward · · Score: 0

      You have been touched by his metallic appendage...

    15. Re:Big Data for chess by GTRacer · · Score: 1

      And of course /today/ is the day I don't have points... +1, sadly true

      --
      Defending IP by destroying access to it? That makes sense, RIAA/MPAA. Go to the corner until you can play nice!
    16. Re:Big Data for chess by electrosoccertux · · Score: 1

      why bother with theoretical games? Just pre-calculate a lookup table that tells you every move you should make in every situation.

    17. Re: Big Data for chess by smaddox · · Score: 1

      Because the lookup table would have to have ~ 10^46 entries.

    18. Re:Big Data for chess by lucm · · Score: 1

      That's not the same, that's like those blackjack simulators that nobody every got rich with.

      The point of big data is to spot trends in actual events, not compute simulation results. Especially if the simulation is performed with the same algorithm working both sides.

      --
      lucm, indeed.
    19. Re:Big Data for chess by lucm · · Score: 1

      This applies to computer vs computer situations. Once you put a human in the mix, it's a whole different situation because the frame of reference is different.

      You can't predict what you don't understand. That's why a chess computer that uses past human games to make decisions would be, in my opinion, a pretty nasty opponent.

      --
      lucm, indeed.
    20. Re:Big Data for chess by lucm · · Score: 1

      You misunderstand the point at which the paradigm is shifting. This is not a matter of physical contact, this is a matter of confidence threshold.

      Also if you experience incidents like that more than once every 6 years, you should reconsider your allegiance to taco bell and/or indian buffets.

      --
      lucm, indeed.
    21. Re:Big Data for chess by SternisheFan · · Score: 1

      lucm, re: this is me saying it was me.:^)

    22. Re: Big Data for chess by electrosoccertux · · Score: 1

      you sure about that?

    23. Re:Big Data for chess by Vintermann · · Score: 1

      That has been tried with computer Go. It turns out that you can make a computer very, very good at predicting what moves top-level players will make, and still fail abysmally at making a strong program.

      --
      xkcd is not in the sudoers file. This incident will be reported.
  4. chess championship by phantomfive · · Score: 5, Interesting

    I don't know about the chess championship, but that is one of the best blogs on the internet. Where did it come from? In a world of 7-second attention spans, "you won't believe what happens next....", and pop culture domination, here is a guy who is talking about math, computers, and games in a friendly relaxed manner, because it is interesting to him. He talks about Godel (who apparently said, "Religions are, for the most part, bad—but religion is not"), some recent ideas in information theory, and a comparison between linear algebra and quantum computing. He uses LaTeX.

    Also, from the post I learned about a game called Arimaa, which was designed to be hard for computers but easy for people. There is a bet that no computer will be able to beat a human, and you can win thousands of dollars if you do. So far it's apparently not even close. Also, got this great quote: "It’s not that chess is 99% tactics, it’s just that tactics takes up 99% of your time."

    --
    "First they came for the slanderers and i said nothing."
    1. Re:chess championship by loufoque · · Score: 1

      You can blog in LaTeX!?

    2. Re:chess championship by doug141 · · Score: 1

      Arimaa might make an interesting turing test. Your sig made me think of captain Paul Watson of the Sea Shepard telling the story of the time he got a job testing the intelligence of a captive orca. The orca got all answers right immediately after training, then suddenly started getting them all wrong. Paul realized the Orca was testing him, too.

  5. I don't know if you've heard of this by Anonymous Coward · · Score: 0

    but Moore's law clock speed doubling has been dead now for more than a decade.

    You might want to check your assumptions before making any more sweeping predictions of future performance.

  6. Show me a computer chess program.... by mark-t · · Score: 1

    ... that can challenge a human grandmaster just by using heuristics and considering perhaps at most only a few hundred board combinations instead of millions.

    Because really, the fact that a computer can beat the best human players at chess just by analyzing millions upon millions of board combinations is no more surprising than the fact that even a small child can figure out how to never lose when playing tic tac toe.

    1. Re:Show me a computer chess program.... by MrBigInThePants · · Score: 0, Redundant

      These competitions explicitly prohibit the use of the above technique. This is because chess is already a 100% solved solution space. We already can make a player that will play the "perfect" game of chess - just that the above competition bans it. So now you have a whole bunch of computer programs attempting to optimally search said space in real-time without appearing to...its all rather ridiculous although still a challenge.

      For that reason these competitions are not very interesting at all - just high publicity.

      You may be more interested in the world of GO - which is still unsolved and recently had a very interesting article talking about a breakthrough. The solution space of GO is so large that the same "cheating" technique would never work in the foreseeable future.
      http://www.technologyreview.com/view/533496/why-neural-networks-look-set-to-thrash-the-best-human-go-players-for-the-first-time/

      Its even possible that the solutions and tools for such pattern recognition problems could be more broadly useful in other areas of AI. (unlike almost all of the chess stuff most of which appears to be dick measuring for publicity at this late stage)

    2. Re:Show me a computer chess program.... by itzly · · Score: 1

      Why ? The current method works better. Occasionally, a grandmaster overlooks a mate in 1, or other easy things. This never happens with computers that do a brute force search.

    3. Re:Show me a computer chess program.... by claar · · Score: 4, Informative

      I'm not sure where you got the idea that chess is solved, but we're still a looong way from solving chess. We have only solved chess with 7 pieces, not the full 32, and unless quantum computers arrive in force, we have no shot at solving it in our lifetimes.

      http://en.wikipedia.org/wiki/S...

      --
      I'd give my right arm to be ambidextrous...
    4. Re:Show me a computer chess program.... by Anonymous Coward · · Score: 1

      To reply to both parent and grandparent:

      Moore's law has not made this development possible, algorithm breakthroughs has. Pocket Fritz managed to beat grandmaster despite only being able to evaluate some 30,000 positions per second (which is a factor 100 from what other engines are able to do).

      In 2005 the top engine Fruit was made open source. From there a huge amount of tricks and techniques were revealed, combined and improved upon. All top engines today are Fruit clones/derivatives (some allegedly even on source code level).

      As a result, the competition rules are indeed biased, and if you are not a Fruit derivative (or use very similar techniques) you are banned from attending (there are explicit rules on what sizes your hash tables etc. hast to be, which are very implementation specific details). That makes the TCEC a yawn, and disincentivise developers who want to try other techniques.

    5. Re:Show me a computer chess program.... by Vintermann · · Score: 1

      Neural net-based Go programs have been tried countless times since neural nets were invented, and losing to GNU Go 20 out of 200 games is very very far from state of the art. I don't know which version of Fuego they used, but if it was rated 4-5k it must have been an old and weak one. It's currently rated 2d on KGS.

      Worth noting that KGS is stingy on ratings, and especially hard on bots since matches are self-selected. If there's an exploitable weakness in a bot, people will ruthlessly mine it for rating.

      The real revolution is the technique that CrazyStone pioneered: Monte carlo tree search. Even basic MCTS programs can beat GNU Go 90% of the time. CrazyStone was on 7d on KGS for a while, although in september it dropped to 6d (presumably because very strong players found a way to exploit its weaknesses - since programs play consistently, rating shouldn't vary too much otherwise).

      Monte Carlo is the way forward. I'm convinced that the basic approach of it (randomized search, weighted with a tree towards positions more likely to be fruitful) is going to stay. Improvements are going to be about which moves to weigh the exploration towards in the playouts as opposed to the tree part.

      --
      xkcd is not in the sudoers file. This incident will be reported.
    6. Re:Show me a computer chess program.... by Anonymous Coward · · Score: 0

      Yeah, I'd be curious to know if the opening position is a "mate in xxx", unwinnable by either side or a case of Zugzwang!

    7. Re:Show me a computer chess program.... by Paradise+Pete · · Score: 2

      This is because chess is already a 100% solved solution space.

      No it isn't. Far far from it.

    8. Re:Show me a computer chess program.... by Kjella · · Score: 1

      Even if it wouldn't be a mathematical proof, for practical purposes the potential would be tapped out if the top computers started drawing all the time. I just checked an in the "superfinal" between the top two 11 out of 64 rounds ended in a victory, 7 in favor of the strongest and 4 in favor of the other. That's a pretty good indication there's potential for improvement.

      --
      Live today, because you never know what tomorrow brings
    9. Re:Show me a computer chess program.... by Anonymous Coward · · Score: 0

      Why ? The current method works better. Occasionally, a grandmaster overlooks a mate in 1, or other easy things. This never happens with computers that do a brute force search.

      When grandmasters miss a mate in one, it is a sensasion. It virtually never happens (it has happened, but the occasions are so rare each one is remembered).

    10. Re:Show me a computer chess program.... by itzly · · Score: 1

      Sure, the mate in 1 is an extreme example, but human grandmasters overlook plenty of other tactics that the computer can find in a fraction of a second, using brute force searches that include seemingly illogical moves. It would be very hard to develop a more 'human-like' playing style for a computer that wouldn't suffer the same problems.

    11. Re:Show me a computer chess program.... by Anonymous Coward · · Score: 0

      How can you write so much bullshit ? I mean, it is obvious that you have *some* understanding, but anyone with even remote interest in either the field of Game Theory or Chess knows that the game isn't solved.

      You go as far as saying that "the above competition bans it", which is such an amazing amount of bullshit. Human competitions bans computer, but Computer competition obviously don't. There are even Centaurs competitions (man+machine against man+machine).

      You end up asserting your opinion as some sort of expert on the subject, and even qualify the Chess problem to be "dick measuring", while being completely clueless...

      This, to me, looks like good old /. trolltalk trolling. You wanted to troll, didn't you ? I can't fathom someone being so full of shit to actually have such appearence of knowledge without knowing it is fake...

    12. Re:Show me a computer chess program.... by Aighearach · · Score: 1

      As a chess player, I just had to stop and laugh this down.

      Show me a human grandmaster, (or even a B-class player) who can play without all the knowledge they have remembered.

      Show me a human who can consider a problem, and restrict their thinking to only a few hundred connections between different brain cells.

      Show me a human who can temporarily forget everything they know and approach problems using only a single class of algorithm.

      The only "chess player" who can play the way you'd hobble the computer is somebody playing their first few awful games.

      I don't know why people get so hung up over computers being better at humans than chess. Humans are still perfectly good at enjoying chess, and playing chess against other humans. Some people feel threatened or cheated for no reason at all. It is like worrying that an airplane can run faster than a human. Yes, they can. No, it is not a threat to olympic sprinters, or joggers, or walkers.

    13. Re:Show me a computer chess program.... by mark-t · · Score: 1

      Obviously human players don't forget the games they have played in the past, but they don't need to recount every detail of every game in order to exercise that experience in game, as a chess program would.

    14. Re:Show me a computer chess program.... by Aighearach · · Score: 1

      They do, though. Grandmasters know tens of thousands of games by memory and on sight.

      My friend is a FM (FIDE Master) which is 2 levels below Grandmaster, and he remembers not only all the games he ever played, but also many thousands of games he has studied, and thousands more of other players who were playing in tournaments at the same time.

      Computers are even better at this, but the idea that a human can get even to the 90th percentile in chess without memorizing anything is absurd. Very often a player at the 50th percentile will make it past the 60th entirely by memorizing more things.

      The computer is doing a subset of the same fundamental things that a human is doing, intellectually. The reason for this is that the computer is programmed by a human. All of the algorithms used in modern chess programs were developed by human software engineers. They were not invented by niche AI researchers using random selection. Modern chess computers are even good at "positional" evaluation. When you have a problem domain like chess where there are clear, fixed rules and easily measurable parameters then anything a human can do can then be programmed into an expert system. Where a computer uses a search tree, there are also chess books that teach humans to use an organized sorted search tree. Even where the human isn't using a formalized system, they are still most likely repeating the same general processes as the computer, because the history of programming chess computers has included chess players in the process from the start. In the beginning the humans were better, and then the algorithms were developed to do similar types of analysis as humans. Then those algorithms were improved and tuned to the specifics of the design of modern computers, leading to the computers being much stronger than the human players.

      Just as, humanoid robots start out a lot slower than us, are taught to walk more smoothly like a human, and then are easily able to be made to run much faster than us. Until you mimic the human gait, the engineering is much more difficult. Once you have a "natural" motion, you can just crank the speed up to the limits of the your hardware, and easily tune/upgrade as needed to get higher speeds.

    15. Re:Show me a computer chess program.... by mark-t · · Score: 1

      Human players generalize from their experience, they do not explicitly recount every game they have ever played in order to exercise their knowledge from that experience. A grandmaster may only explicitly consider a few hundred actual board combinations, on any given turn.

    16. Re:Show me a computer chess program.... by Aighearach · · Score: 1

      Human players generalize from their experience, they do not explicitly recount every game they have ever played in order to exercise their knowledge from that experience. A grandmaster may only explicitly consider a few hundred actual board combinations, on any given turn.

      You're just wrong, and you're clearly outside your expertise. They do explicitly recount all their games, and the games of their chess friends, and the notable historical games, and the notable games in the openings they play. Higher level grandmasters remember games that they studied for a couple days during preparation for a match a decade ago, and will play those lines in future games if the position comes up. If you knew, you'd know this.

      A grandmaster doesn't know how many "board positions" his brain actually calculates. Nobody understands the mechanics of their own thinking, including the computer. ;) And they don't actually "explicitly consider" hundreds of board positions on a given turn. They explicitly consider many less than that, because of the high-level nature of "explicit" thinking and the low-level nature of most of the pattern matching that their brain is doing. They do often create an explicit search tree and consider a few dozen positions.

      Your use of the word "combinations" there is unclear, so I parsed it as being the literary word, and not the chess jargon term. Using the chess jargon meaning of "combination" it would be even more incorrect.

      Even just chess "masters," (multiple levels below Grandmaster) explicitly remember most of their games. If you spend more time with higher level chess players you'll realize that they can indeed remember those games. One might say to the other, "hey, remember that game you played in 2006 at the Blah Blah Tournament with the Whatever Gambit opening?" "Oh, yeah, [starts moving the pieces replaying the game] he played the line Grandmaster So-and-so vs Somebody Else, but then he did this crazy thing on move 20..."

      Just like the "average" person on slashdot might not fit the average demographic of the general population, so also tournament chess players are substantially... differently-minded than most people. Surprising memorization skills are typical, as is braindead-stupid politics.

    17. Re:Show me a computer chess program.... by mark-t · · Score: 1

      They do often create an explicit search tree and consider a few dozen positions.

      You are aware, I assume, that a few dozen can easily exceed a hundred. The several hundred I mentioned may be admittedly have been very generous, but my point was that grandmasters don't ever have to evaluate every board combination the way computers do. In fact, a modern computer can sometimes consider more board variations in even a single move during a single game than a chess player may have seen in their entire lifetime.... and still, even then, a grandmaster can frequently hold his own against a machine, only the very best computer chess engines created frequently having any chance at beating them. A grandmaster, as you yourself stated, only explicitly considers a few dozen positions in any single move, and they can play *extremely* well. And yet, the best we can do with computers to challenge this is to evaluate orders of magnitude more board combinations than the human opponent is likely to have ever experienced... and in my view, it is no more surprising that we can make a chess program that can beat a human grandmaster by using such techniques than the fact that you can always find a particular card in a shuffled and complete deck by flipping over every single one.

      All that we've ever done to solve chess is nothing more than a parlor trick....it's no more intelligence than the fact that it can always find the n'th digit of pi for any arbitrary large n.

    18. Re:Show me a computer chess program.... by Aighearach · · Score: 1

      The computer is not any more aware of the millions of calculations it is doing than the human is. In fact, I'd say the human is aware of a larger number of explicit calculations. I'd also point out, this is obvious.

      The computer calculations are "explicit" to the human programmer, sure. But in the same way, a physiologist might consider the entire human process of calculations to be explicit. Then you're stuck with the reality that the human mind is doing a large number of analog calculations, where each calculation is equivalent to whole series of digital calculations. And it is all explicitly happening, a totally physical process inside the human brain. And it actually has very little to do with the subjective human experience.

      So you can make the same mistake with the human as with the computer, and it comes out the same. There is no inherent dichotomy between "explicit" thought, as the term is used here, and anything else. The computer is still programmed by humans, and mimics the human understanding of how to evaluate chess positions. Of course it is better, it is just the human processes that contribute to chess evaluation mimicked, with the whole rest of the human processes intentionally omitted. But in the same way, it is no threat to human chess, because the non-chess human features are omitted.

    19. Re:Show me a computer chess program.... by mark-t · · Score: 1

      Although the brain can be likened to a massively parallel computer, humans cannot perform calculations as fast as a digital computer, so there is no basis to presume that humans are considering considerably more than the few dozen or so positions that grandmasters are typically assumed to analyze before making a move

      And this point cannot be emphasized enough... even though the grandmaster considers such a small set of positions, the grandmaster plays at an *EXCELLENT* level, while any computer that were to consider such a small number of board positions could probably be beaten by anyone with even a very modest amount of chess skill.

      If you could program a computer with every chess game ever made, and then have it make generalizations from those games so that it was capable of recognizing patterns that occur in other games, being able to recognize potential winning strategies from a given board position, only analyzing a few dozen or so moves in advance during any actual game, just as a chess grandmaster does, and *STILL* be able to beat any human player.... then you'll have something.

    20. Re:Show me a computer chess program.... by Aighearach · · Score: 1

      If you could program a computer with every chess game ever made, and then have it make generalizations from those games so that it was capable of recognizing patterns that occur in other games, being able to recognize potential winning strategies from a given board position, only analyzing a few dozen or so moves in advance during any actual game, just as a chess grandmaster does, and *STILL* be able to beat any human player.... then you'll have something.

      Straight assertion with no apparent point. WTF does "have something" mean here? You can't claim the human analyzes only a few dozen things during the game. An fMRI will blow that one up in an instant. (BTW, the chess community already has seen that scan and the analysis and we know the answer, this isn't speculation or opinion) And the computer is aware of exactly 0 calculations. So your only real point is that humans are minimally aware of ourselves and that we have thought processes. Except, we don't understand them ourselves, or have any sensory apparatus that tells us what our brains our doing.

      But being wrong about that stuff, out of ignorance, doesn't forgive simply asserting over and over that Grandmasters don't have amazing powers of memory compared to the common man. They simply do. There is a wide distribution of traits, and the vast majority of chess GMs are in the top percentile on memory. A significant percent, probably close to half, of mere "masters" have memory far beyond the capabilities of the average. They already seem as mythical creatures to most non-chess-players who meet them.

      Another funny part of all this nonsense is that human grandmasters didn't used to require such excellent memory. They used to be able to use other mental skills alone to be at or near the top. But starting in the 60s with pocket opening books, that changed. And then when the computer databases hit in the late 80s, it changed again; even more. Most of the players in the top 10 in 1985 were not in the top 100 anymore by `95, even where their play had not changed or gotten weaker. The whole equation of what mental skills translate to chess success changed with the advent of large quantities of concrete data that lends itself well to memorization. It was after this revolution in human chess thinking that the programmers started working heavily with strong (IM and GM) chess players to tune the positional evaluation of the chess engines. That is the era, and the human effort, where the ability of the computers passed that of the "typical grandmaster." It wasn't CPU updates that did that, it was years of collaboration between GMs and programmers (who were mostly FMs at this point, stronger than the State Champions in over half of US States, and could therefore understand the GMs) that catapulted the engines to the strong tool they are today.

      Interestingly, it is access to the data to memorize that increased the human strength, and access to traditional human algorithms like building trees and trimming the trees early based on identifying "killer lines" that increased the computer strength. It makes perfect sense once you understand that the computers know nothing and are strictly machines that mimic human thought, as understood and programmed by humans.

    21. Re:Show me a computer chess program.... by mark-t · · Score: 1

      My poiing is, and has always been, that a computer being able to beat an excellent human player at chess is nothing more than mathematical stage magic, and cannot be shown to emulate human thought unless or until human thought itself can be shown to be equally illusory.

    22. Re:Show me a computer chess program.... by Vintermann · · Score: 1

      They are good at memorizing chess games because chess games make profound sense to them. The more you understand the why's of a chess move, the easier it is to remember it. They aren't good at memorizing arbitrary stuff, and being good at memorizing arbitrary stuff won't help you much getting good at chess.

      Playing from randomized positions, computers are vastly better than humans, since they don't rely on "moves making sense" the same way. Go programs (which are a lot weaker than the best humans) trounce humans if they play from a position of, say, 20 random moves - even if the human gets to pick color.

      --
      xkcd is not in the sudoers file. This incident will be reported.
    23. Re:Show me a computer chess program.... by Aighearach · · Score: 1

      Chess software also does not remember arbitrary stuff. ;)

      It could. But so could the human, if the reason stopped being arbitrary.

      There are a lot of theories why Go computers are weak. I saw one analysis that compared the amount of effort to the amount of success, chess vs go. I don't have a link, but the conclusion was that go computers are actually just as far along as chess computers were with similar total effort.

  7. General artificial intelligence? by bunratty · · Score: 1

    So when will these chess playing programs attain general artificial intelligence on par with a human? With each improved player, we must surely be getting closer...

    --
    What a fool believes, he sees, no wise man has the power to reason away.
    1. Re:General artificial intelligence? by bigsexyjoe · · Score: 1

      No. They win by crunching data. What we have learned is what games humans are still better at. I would say chess research is no longer AI research. The new horizon is figuring out how to beat humans at the games humans are still better at. That is how they'll get closer to humans.

    2. Re:General artificial intelligence? by AK+Marc · · Score: 1

      That's the same as saying that each improvement in the car brings us closer to an airplane. I'm not sure that works.

    3. Re:General artificial intelligence? by bunratty · · Score: 1

      Yes, exactly! I would say that the AI programs we hear so much about: Watson, Google's self-driving cars, deep-learning neural networks, and so on will never reach general artificial intelligence. It's like climbing a tree and expecting to reach the moon. All those programs use simple algorithms geared towards just one purpose. You present those programs with any task other than the specific one they were designed for, and they fail miserably. General artificial intelligence, the ability to handle a wide variety of tasks autonomously, is a different beast altogether.

      --
      What a fool believes, he sees, no wise man has the power to reason away.
    4. Re:General artificial intelligence? by itzly · · Score: 1

      Any AI problem that is solved, is no longer an AI problem.

    5. Re:General artificial intelligence? by Anonymous Coward · · Score: 0

      So when will these chess playing programs attain general artificial intelligence on par with a human? With each improved player, we must surely be getting closer...

      Well, no not exactly. Chess and other games like it are what those in AI call a "search" type problem. The game begins with some initial configuration and players alternate turns, changing the state in sequence according to the rules until some end state is reached (i.e. somebody wins). The series of state changes can be viewed as what's called a decision tree. In tic-tac-toe the decision tree is quite simple, whereas it becomes larger for a game like Checkers, which has more possible situations than tic-tac-toe and larger still for Chess. In Chess the decision tree is so large that naive search isn't effective and various optimizations are necessary to reduce the number of boards considered. However, a search is still a search, however clever the optimizations. This is not "intelligence" in the way that most people think about it from their experience with science fiction and will not lead to that sort of breakthrough that you seem to be expecting. In other words, there are limits to what can be accomplished with search and Data from Star Trek cannot be reduced to a search problem.

    6. Re:General artificial intelligence? by serviscope_minor · · Score: 1

      I don't get your point. I doubt anyone here thinks that.

      --
      SJW n. One who posts facts.
    7. Re:General artificial intelligence? by sed+quid+in+infernos · · Score: 1

      The GP seems to think that: "So when will these chess playing programs attain general artificial intelligence on par with a human? With each improved player, we must surely be getting closer..."

  8. Moore never said clock speed. 64 bit twice 32 bit by raymorris · · Score: 3, Insightful

    Moore never said anything about clock speed. He said the number of transistors. A CPU with more transistors can compute a complex problem faster. There is a science to trying to come up with problems that aren't solvable faster with more transistors (even at the same clock), but those problems are rare in the real world. Today's 3Ghz processor is faster than a 3 GHz processor from five years ago.

    Recently, the big improvements have come from organizing the increased transistors into increased cores. Today's 8-core CPU can analyze eight moves at once. The older dual-core system could only analyze two moves at once. Therefore, the 8-core system is four times as fast, on a parallel problem like this.*

    * Actually even better than four times, because a fractional core is needed to manage the overall process. The dual core chip could analyze 1.5 moves simultaneously, the 8-core can analyze seven simultaneously.

  9. But is it best at beating humans? by bigsexyjoe · · Score: 1

    I wonder if there is a difference between the best engine at beating other engines and the best engine at beating humans. Obviously, you need to put them on low powered machines to bring them down to the level of occasionally losing to humans to check.

    1. Re:But is it best at beating humans? by ThatsMyNick · · Score: 1

      They pretty much beat humans everytime. You may not get statistically significant results among the top chess engines.

    2. Re:But is it best at beating humans? by Rockoon · · Score: 1

      I wonder if there is a difference between the best engine at beating other engines and the best engine at beating humans.

      Yes. I spent a lot of time watching this event and in the chat this subject came up more than a few times in various flavors.

      Probably the most important of the factors involved here is that these chess engines use a symmetric evaluation function. In layman's terms this means that they evaluate a given position the same regardless of which side the engine is actually playing. An anti-human optimal evaluation function would also consider which side of the board a human is playing on. Open positions greatly favor the chess engine when it plays vs a human regardless of which pieces the computer is playing with. The more possibility for tactics the better.

      On the flip-side, there are people who specialize in anti-computer chess. Its becoming harder and harder for them, but the main idea is the play for a closed position and then to find a positional break that the chess engine culls from its search for various reasons.

      Even in computer vs computer chess, often the highest rated engine does quite poorly against the second highest rated engine. This was true about 1 year ago when "Houdini 4" topped the rating lists while it also had a very poor record vs the second highest rated engine "Stockfish DD." Houdini was simply better at beating 3rd, 4th, 5th, etc than Stockfish was.

      Now Komodo seems to rate highest on nearly all the rating lists, as well as having just won the unofficial championship. At this moment Komodo when running on good hardware in the strongest chess entity in the universe.

      --
      "His name was James Damore."
  10. Playing chess by Anonymous Coward · · Score: 0

    There are now much, much better games than chess for "brain development". Chess still has a cultural value, but that's about it.

  11. Bet Battle Chess would kicks its ass by Anonymous Coward · · Score: 0

    Royally!

  12. Re:Moore never said clock speed. 64 bit twice 32 b by phantomfive · · Score: 1

    There is a science to trying to come up with problems that aren't solvable faster with more transistors (even at the same clock)

    It's not hard, anything with linear dependencies. If you have to solve step A before moving on to step B, then it doesn't matter how many cores you have, they all have to wait until step A is solved.

    --
    "First they came for the slanderers and i said nothing."
  13. Re:The Computer Won by Anonymous Coward · · Score: 0

    Come on, everyone say Yippppeee for everyone else! Yipppeeeee!!

  14. A computer beat me at chess once by Snotnose · · Score: 1

    Then again, I beat a computer at kick boxing once.
    Not original, I read that somewhere not 30 minutes ago.

  15. Re:The Computer Won by Anonymous Coward · · Score: 0

    It is late so

    Good night to all and to all a good night!

    nah!

    Good Yiiippppeeeee to all and to all a good Yiiipppeeeee!

    That's more like it folks!

  16. Big Data for chess by szap · · Score: 1

    You mean like what the runner up is already doing? http://stockfishchess.org/get-...

  17. Re:Moore never said clock speed. 64 bit twice 32 b by itzly · · Score: 1

    Solving chess also benefits from bigger memories for transposition caches. Multiple cores help too. So, Moore's law certainly helps chess engines. But it's not just the hardware that has improved since Deep Blue. There has also been tremendous progress in the engine software. Especially the technique of letting the computer play millions of blitz games against itself helps to tune the many evaluation parameters has been very successful in improving engine strength.

  18. Re:Moore never said clock speed. 64 bit twice 32 b by TheRaven64 · · Score: 1

    Even that is coming to an end, with the end of Denard scaling. You can still double the number of transistors on a chip for a fixed investment, but you can't double the number that you can have powered at any given time. That's why accelerator cores and things like dedicated AES instructions have become common: its worth spending some transistors on things that speed up a single algorithm or class of algorithms.

    --
    I am TheRaven on Soylent News
  19. parallel all A, all B. Also branch prediction etc by raymorris · · Score: 2

    If you have to solve A before B, you can work all possible A in parallel, then all possible B in parallel. More cores is better.

    Also, just because you have to solve step A before you can solve step B doesn't mean you can't START working on B, such as solving B for likely values of A, storing them in a lookup table, then selecting the precomputed answer from A. In fact I won a prize doing exactly that with my software playing a game against humans.

    >. It's not hard.

    Harder than it first appears, we just demonstrated.

  20. Mr. Don Dailey by nusuth · · Score: 3, Interesting

    I am disappointed to see only one mention of late Don Dailey in TFA. He is actually the guy who wrote the whole thing. I had followed his posts for years in computer go mailing list. I have learned a lot from him as an R&D engineer in an unrelated field (chemical industry). While many people adopted "improvements" only because it made sense to them, Mr. Dailey had a very systematic and methodological approach to changing the program. He had ideas and insights for improvement like many others, but he never fell in love with his own ideas. If something did not work, it did not. No matter how plausible it seemed. He also had most patience I have seen of an online person. He would carry on discussions long after it was obvious the other party was not paying enough attention or was simply stupid. He did this almost to the day he died.
    Congrats Mr. Dailey. You have done it.

    --

    Gentlemen, you can't fight in here, this is the War Room!

    1. Re:Mr. Don Dailey by itzly · · Score: 1

      Congrats Mr. Dailey. You have done it.

      He's done it twice now. Komodo was also the winner of the TCEC Season 5 final against Stockfish. Mr Dailey passed away just after Komodo had made it to the final, but unfortunately, just too soon to witness the result.

  21. PS, also compute symmetrys of B on A by raymorris · · Score: 2

    PS, the other thing I did (successfully) was pre-compute symmetry of A and B, so I knew that any value of A in this list would give the same result in B. So I didn't have to compute the value of B, after I knew A I only had to select which bucket it was in to get the value of B.

  22. ELO ?? by Anonymous Coward · · Score: 0

    I kind of like their version of "Roll Over Beethoven".

  23. Re:parallel all A, all B. Also branch prediction e by phantomfive · · Score: 0

    Harder than it first appears, we just demonstrated.

    I'm not going to write a full proof. If you can't figure it out based on what I wrote, you are a moron.
    Clearly however, you can figure it out, because you are reasoning about the topic clearly. You just like to argue.

    --
    "First they came for the slanderers and i said nothing."
  24. indeed your not by raymorris · · Score: 1

    >. I'm not going to write a full proof

    Of course you're not, because you'd be trying to prove that it's impossible to do the things that we do all the time. I just showed that you're OBVIOUSLY wrong, so it would be pretty silly to try to write a formal proof otherwise.

    When you discover that an idea you once had was mistaken, you can either a) get butt-hurt or b) learn something.

  25. Contender for years by ruebarb · · Score: 1

    komodo won but it has been the main contender with stockfish for a while. I think it has been number two in the last two or three tourneys

    --

    ----------
    ah honey, we're all resplendent - Bill Mallonee
  26. closed source by loxosceles · · Score: 1

    Stockfish is only slightly weaker, and is open source.

    What's the point of closed source chess engines when a lot of engines are already far stronger than humans? Who's going to pay the money for a closed-source chess engine? Idiots? A grandmaster may want it to study its playing "style", and chess algorithm researchers might want it to study it, and other chess engine designers might want it to reverse engineer it, but there's no practical reason for even a strong chess player to buy chess engines anymore.

  27. shogi? by suplemen+fitness · · Score: 1

    However for me it's harder to play shogi than chess. suplemen fitness murah jual suplemen fitness