7
votes
Accepted
Could AI kill the joy of competitive sports and games?
Unlikely!
Chess has been "solved" by AI much longer than GO (chess engines even before AI are way too strong for human players) and still people are playing and competing.
Simply put competition ...
5
votes
Accepted
How powerful is OpenAI's Gym and Universe in board games area?
OpenAI's Gym is a standardised API, useful for reinforcement learning, applied to a range of interesting environments many of which you can then access for free with little effort. It is very simple ...
4
votes
Accepted
Is the play of strong Chess AI easily distinguishable from human play?
AI programs that exist in today's world fall into the category of Narrow Intelligence. Narrow Intelligence
are easy to distinguish when compared to General Intelligence (ones that resemble more like ...
4
votes
Is the play of strong Chess AI easily distinguishable from human play?
There are three cases in which it is easily possible to distinguish strong AI play from the strong human play:
The AI is playing at superhuman skill level
This seems obvious, but I want to mention ...
4
votes
Are there human predictions of when a computer would have been better than a human at Go?
Go predictions were included in the paper:
The experts are far from infallible. They predicted that AI would be better than humans at Go by about 2027. (This was in 2015, remember.) SOURCE: Experts ...
4
votes
Accepted
How Does AlphaGo Zero Implement Reinforcement Learning?
If you learn a policy or a value function from experience (that is, interaction with an environment), that's RL. In the case of AlphaGo, the MCTS is used to acquire the experience.
RL could in fact ...
3
votes
Can games be solved without an evaluation function?
Human chess and go experts clearly use evaluation functions. They do come up with moves that look sensible without evaluating the board position, but to validate these candidate moves they evaluate ...
3
votes
Accepted
Why was Go a harder game for an AI to master than Chess?
The branching factor is important, as it limits the effectiveness of search.
However, the branching factor in chess is already too high to effectively search without techniques that reduce the size ...
2
votes
Were AI strategies identified at go or starcraft games and how?
Truth be told, I have no idea how to play Go, but luckily this is a AI forum and not a Go forum. Addressing your questions about the specific strategies that AI discovered, there's a paper released by ...
1
vote
Accepted
What is the significance of move 37? (to a non go player)
The significance can be mostly summed up as changing the perspective of people on how creativity can be produced by a computer.
There is a widespread belief, which has been largely true until ...
1
vote
Accepted
Do the mathematics of Go imply an AI could solve it, or does a complexity bound imply AI skill will plateau?
Consider that solving whatever problem with AI or not is a computational matter. Simply put: you can't break the rules of computational complexity.
Let's consider the game of Go, you can enumerate all ...
1
vote
How to design a good evaluation function for a go-like game?
If you have the best combination of distance between the stones, you should choose the best move to win. In this case, you have to be close to where your opponent plays. It is best to do this by ...
1
vote
Is the play of strong Chess AI easily distinguishable from human play?
Yes - in chess the term "computer move" is used to denote a move found by a chess engine that a human player would never find (often because they make some slight improvement that a human would not be ...
1
vote
Is the play of strong Chess AI easily distinguishable from human play?
I recall a friend saying that yes, it is somewhat obvious if you are playing against an AI.
From what he said, against normal players, there is a certain rhythm and structure that "makes sense". But ...
Only top scored, non community-wiki answers of a minimum length are eligible
Related Tags
go × 12game-ai × 5
chess × 5
reinforcement-learning × 2
agi × 2
combinatorial-games × 2
evaluation-functions × 2
neural-networks × 1
machine-learning × 1
reference-request × 1
image-recognition × 1
papers × 1
philosophy × 1
monte-carlo-tree-search × 1
supervised-learning × 1
open-ai × 1
gym × 1
turing-test × 1
alphago-zero × 1
branching-factors × 1
board-games × 1
ai-milestones × 1
decision-trees × 1