[citation needed] There are many Othello programs such as NTest, Saio, Edax, Cassio, Pointy Stone, Herakles, WZebra, and Logistello that can be downloaded from the Internet for free.

These programs, when run on any up-to-date computer, can play games in which the best human players are easily defeated.

[1] Computer Othello programs search for any possible legal moves using a game tree.

In theory, they examine all positions / nodes, where each move by one player is called a "ply".

[2] The alphabeta algorithm is a method for speeding up the Minimax searching routine by pruning off cases that will not be used anyway.

Several experiments have been made with the game Othello, like ABDADA[5] or APHID[6] On recent programs, the YBWC[7] seems the preferred approach.

[9] It is particularly useful in games such as Othello where there is a strong correlation between evaluations scores at deeper and shallower levels.

Most programs have knowledge of edge and corner configurations and try to minimize the number of disks during the early midgame, another strategy used by human players.

[12] Mobility maximization and frontier minimization can be broken down into local configurations which can be added together; the usual implementation is to evaluate each row, column, diagonal and corner configuration separately and add together the values, many different patterns have to be evaluated.

Faster hardware and additional processors can improve Othello-playing program abilities, such as deeper ply searching.

[1] Othello is strongly solved on 4×4 and 6×6 boards, with the second player (white) winning in perfect play.