Difficulty of Various Games for Computers
[[A diagram. The left column describes various levels of skill for the most capable computers in decreasing performance against humans. The right side lists games in each particular section, in increasing game difficulty. There are labels denoting the hard and easy ends of the diagram.]]
Easy
Solved - Computers can play perfectly
Solved for all possible positions
Tic-Tac-Toe
NIM
Ghost(1989)
Connect Four(1995)
Solved for starting positions
Gomoku
Checkers(2007)
Computers can beat top humans
Scrabble
CounterStrike
Beer Pong (UIUC robot)
Reversi
Chess (February 10, 1996 - First win by computer against top human; November 21, 2005 - Last win by human against top computer)
Jeopardy
Computers still lose to top humans (but focused R&D could change this)
Starcraft
Poker
Arimaa
Go
Computers may *never* outplay humans
Snakes and Ladders
Mao
Seven Minutes in Heaven
Calvinball
Hard
{{Title text: The top computer champion at Seven Minutes in Heaven is a Honda-built Realdoll, but to date it has been unable to outperform the human Seven Minutes in Heaven champion, Ken Jennings.}}
xkcd.com is best viewed with Netscape Navigator 4.0 or below on a Pentium 3±1 emulated in Javascript on an Apple IIGS at a screen resolution of 1024x1. Please enable your ad blockers, disable high-heat drying, and remove your device from Airplane Mode and set it to Boat Mode. For security reasons, please leave caps lock on while browsing.