3 ms·

You could have said the same thing about chess when a program beat Kasparov about 20 years ago.

• leeoniya 11y ago
  the program that beat Kasparov did so using a brute-force search (full?) of a very limited search space. the reason that AI is different is because it doesnt need to (and cannot do so because the space is simply too large.) and 20 years ago is still well "within our lifetimes"
  • Retric 11y ago
    The program that beat Kasparov avoided a full breadth first search because it was fairly easy to decide if something was a bad move. So, it could generally pick from a fairly small number of moves when branching. What makes GO so much harder than chess is how hard it is to evaluate the board and decide if a move is good or bad.
    • daveguy 11y ago
      >What makes GO so much harder than chess is how hard it is to evaluate the board. And the 300-fold increase in branching factor.
      • Retric 11y ago
        First order branching factor is less important than you might think. You could setup a game of Nim: https://en.wikipedia.org/wiki/Nim https://en.wikipedia.org/wiki/Nim with much higher branching factor vs Go, but because you can trivially separate a winning moves vs. losing moves those branches become irrelevant in Nim. AKA, if there are 2,000 winning moves then they are all equivalent.
  • cjbprime 11y ago
    Deep Blue wasn't a full brute-force search, and AlphaGo does perform plenty of brute-force searching too.