NTest

Last updated
Ntest computer othello.jpg

NTest [1] is a free Othello/Reversi program created by Chris Welty (not to be confused with the other computer scientist named Chris Welty who worked on the IBM Watson project).

NTest is a strong Othello program with a high-quality evaluation function and fast search algorithms. It has many features, with the most important one being the display of the search evaluation for all possible moves. [2] NTest is among the strongest programs in the world. It is able to do bitboard-based move generation and parallel searches on multiple CPU cores.

Other programs' opening books—such as Edax's book—can be used in NBoard, the GUI created by Chris Welty for NTest. [3]

Related Research Articles

<i>Othello</i> 1603 play by William Shakespeare

Othello is a tragedy written by William Shakespeare, probably in 1603, set in the contemporary Ottoman–Venetian War (1570–1573) fought for the control of the Island of Cyprus, since 1489 a possession of the Venetian Republic. The port city of Famagusta finally fell to the Ottomans in 1571 after a protracted siege. The story revolves around two characters, Othello and Iago. Othello is a Moorish military commander who was serving as a general of the Venetian army in defence of Cyprus against invasion by Ottoman Turks. He has recently married Desdemona, a beautiful and wealthy Venetian lady much younger than himself, against the wishes of her father. Iago is Othello's malevolent ensign, who maliciously stokes his master's jealousy until the usually stoic Moor kills his beloved wife in a fit of blind rage. Due to its enduring themes of passion, jealousy and race, Othello is still topical and popular and is widely performed, with numerous adaptations.

Reversi Strategy board game

Reversi is a strategy board game for two players, played on an 8×8 uncheckered board. It was invented in 1883. Othello, a variant with a fixed initial setup of the board, was patented in 1971.

Abalone (board game) 1987 board game

Abalone is a two-player abstract strategy board game designed by Michel Lalet and Laurent Lévi in 1987. Players are represented by opposing black and white marbles on a hexagonal board with the objective of pushing six of the opponent's marbles off the edge of the board.

A solved game is a game whose outcome can be correctly predicted from any position, assuming that both players play perfectly. This concept is usually applied to abstract strategy games, and especially to games with full information and no element of chance; solving such a game may use combinatorial game theory and/or computer assistance.

Computer chess Computer hardware and software capable of playing chess

Computer chess includes both hardware and software capable of playing chess. Computer chess provides opportunities for players to practice even in the absence of human opponents, and also provides opportunities for analysis, entertainment and training.

Eudora Welty American short story writer, novelist and photographer

Eudora Alice Welty was an American short story writer, novelist and photographer, who wrote about the American South. Her novel The Optimist's Daughter won the Pulitzer Prize in 1973. Welty received numerous awards, including the Presidential Medal of Freedom and the Order of the South. She was the first living author to have her works published by the Library of America. Her house in Jackson, Mississippi, has been designated as a National Historic Landmark and is open to the public as a house museum.

Evaluation function Function in a computer game-playing program that evaluates a game position

An evaluation function, also known as a heuristic evaluation function or static evaluation function, is a function used by game-playing computer programs to estimate the value or goodness of a position in a game tree. Most of the time, the value is either a real number or a quantized integer, often in nths of the value of a playing piece such as a stone in go or a pawn in chess, where n may be tenths, hundredths or other convenient fraction, but sometimes, the value is an array of three values in the unit interval, representing the win, draw, and loss percentages of the position.

Computer Go Field of artificial intelligence around Go computer programs

Computer Go is the field of artificial intelligence (AI) dedicated to creating a computer program that plays the traditional board game Go. The field is sharply divided into two eras. Before 2015, the programs of the era were weak. The best efforts of the 1980s produced only AIs that could be defeated by beginners, and AIs of the 1990s and early 2000s were intermediate level at best. Professionals could defeat these programs even given handicaps of 10+ stones in favor of the AI. Many of the algorithms such as alpha-beta minimax that performed well as AIs for checkers and chess fell apart on Go's 19x19 board, as there were too many branching possibilities to consider. Creation of a human professional quality program with the techniques and hardware of the time was out of reach. Some AI researchers speculated that the problem was unsolvable without creation of human-like AI.

A bitboard is a specialized bit array data structure commonly used in computer systems that play board games, where each bit corresponds to a game board space or piece. This allows parallel bitwise operations to set or query the game state, or determine moves or plays in the game.

Minimo

Minimo was a project to create a version of the Mozilla web browser for small devices like personal digital assistants and mobile phones.

MTD(f) is an alpha-beta game tree search algorithm modified to use ‘zero-window’ initial search bounds, and memory to reuse intermediate search results. MTD(f) is a shortened form of MTD(n,f) which stands for Memory-enhanced Test Driver with node ‘n’ and value ‘f’. The efficacy of this paradigm depends on a good initial guess, and the supposition that the final minimax value lies in a narrow window around the guess. The memory structure is used to save an initial guess determined elsewhere.

Endgame tablebase Database of precalculated chess analysis

An endgame tablebase is a computerized database that contains precalculated exhaustive analysis of chess endgame positions. It is typically used by a computer chess engine during play, or by a human or computer that is retrospectively analysing a game that has already been played.

John D. Welty, a native of Amboy, Illinois, was the president of California State University, Fresno before retiring in the summer of 2013. He was appointed president on July 29, 1991. Before coming to Fresno, he had previously served as president of Indiana University of Pennsylvania for seven years. Welty has a doctorate in administration of higher education from Indiana University.

Chris Welty American computer scientist

Christopher A. Welty is an American computer scientist, who works at Google Research in New York. He is best known for his work on ontologies, in the Semantic Web, and on IBM's Watson. While on sabbatical from Vassar College from 1999 to 2000, he collaborated with Nicola Guarino on OntoClean; he was co-chair of the W3C Rule Interchange Format working group from 2005 to 2009.

In computer science, B* is a best-first graph search algorithm that finds the least-cost path from a given initial node to any goal node. First published by Hans Berliner in 1979, it is related to the A* search algorithm.

Othello station Light rail station in Seattle, Washington

Othello station is a light rail station located in Seattle, Washington. It is situated between the Rainier Beach and Columbia City stations on Line 1, which runs from Angle Lake through Seattle-Tacoma International Airport to Downtown Seattle and the University of Washington as part of the Link light rail system. The station consists of two at-grade side platforms between South Othello Street and South Myrtle Street in the median of Martin Luther King Jr. Way South in the NewHolly neighborhood, part of Seattle's Rainier Valley.

<i>Catch My Soul</i> (musical)

Disambiguation: for Film version see Catch My Soul

Computer Othello Abstract strategy game

Computer Othello refers to computer architecture encompassing computer hardware and computer software capable of playing the game of Othello.

Edax is a regularly updated Computer Othello program written by Richard Delorme in 1998. The main algorithms applied by the program are bitboard move generator, negascout tree search, multi-probcut selective search, parallel search using the Young Brother Wait concept, and pattern based evaluation function. Edax's source code is available under the terms of the GNU General Public License.

In computer science, Monte Carlo tree search (MCTS) is a heuristic search algorithm for some kinds of decision processes, most notably those employed in software that plays board games. In that context MCTS is used to solve the game tree.

References

  1. "NBoard". www.orbanova.com. Retrieved 2017-08-22.
  2. "Chris's Othello Stuff". Othello Gateway. Archived from the original on Jan 9, 2007.
  3. "Othello Programming". Edax. Archived from the original on Jan 7, 2013.