Allis holds a Ph.D. in Artificial Intelligence from Maastricht University, The Netherlands,[citation needed] and graduated cum laude with a M. Sc. in Computer Science from the Vrije Universiteit, The Netherlands.[citation needed] He has more than 30 publications to his name;[citation needed] the majority of his published work reports on research in search technologies.[citation needed]
He started his career in 1987 as a freelance teacher, course developer and mentor of various AMBI courses for NOVI.[citation needed] Allis has lectured at the Vrije Universiteit in Amsterdam as an assistant professor in artificial intelligence.[citation needed] In 1992, his program Victoria won the 4th Computer Olympiad in the game of Gomoku without losing a single game.[6] His programs had also won first places at the Computer Olympiad in games of Connect Four (1989), Awari (1990, 1991, 1992), and Qubic (1991), thus making him winner of all four early Computer Olympiads. He co-authored a solution of 4×4×4 Qubic game using his proof-number search technique.[7]
In 1995 he joined Bolesian (a knowledge technology firm in the Netherlands which is a daughter company of Capgemini and specialized in developing advanced systems based on artificial intelligence) as a senior consultant and manager.[citation needed] In 1997 he co-founded Quintiq and was appointed as the company's CEO.[citation needed]
Allis relocated to the Philadelphia office Quintiq in 2010, remaining CEO and a co-owner.[8] Quintiq was acquired by Dassault Systemes in July 2014.[9]
↑ Saito, Jahn-Takeshi; Chaslot, Guillaume; Uiterwijk, Jos W. H. M.; Van den Herik, H. Jaap (2007). "Monte-Carlo Proof-Number Search for Computer Go". Lecture Notes in Computer Science. Vol.4630. pp.50–61. doi:10.1007/978-3-540-75538-8_5. ISBN978-3-540-75537-1.
↑ L .V. Allis & P. N. A. Schoo (1992). "Qubic solved again". In H. J. van den Herik & L. V. Allis (eds.). Heuristic Programming in Artificial Intelligence 3: The Third Computer Olympiad. Ellis Horwood, Chichester, UK. pp.192–204.
Gomoku, also called Five in a Row, is an abstract strategy board game. It is traditionally played with Go pieces on a Go board. It is played using a 15×15 board while in the past a 19×19 board was standard. Because pieces are typically not moved or removed from the board, gomoku may also be played as a paper-and-pencil game. The game is known in several countries under different names.
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.
The Computer Olympiad is a multi-games event in which computer programs compete against each other. For many games, the Computer Olympiads are an opportunity to claim the "world's best computer player" title. First contested in 1989, the majority of the games are board games but other games such as bridge take place as well. In 2010, several puzzles were included in the competition.
International draughts is a strategy board game for two players, one of the variants of draughts. The gameboard comprises 10×10 squares in alternating dark and light colours, of which only the 50 dark squares are used. Each player has 20 pieces, light for one player and dark for the other, at opposite sides of the board. In conventional diagrams, the board is displayed with the light pieces at the bottom; in this orientation, the lower-left corner square must be dark.
In the context of Combinatorial game theory, which typically studies sequential games with perfect information, a game tree is a graph representing all possible game states within such a game. Such games include well-known ones such as chess, checkers, Go, and tic-tac-toe. This can be used to measure the complexity of a game, as it represents all the possible ways a game can pan out. Due to the large game trees of complex games such as chess, algorithms that are designed to play this class of games will use partial game trees, which makes computation feasible on modern computers. Various methods exist to solve game trees. If a complete game tree can be generated, a deterministic algorithm, such as backward induction or retrograde analysis can be used. Randomized algorithms and minimax algorithms such as MCTS can be used in cases where a complete game tree is not feasible.
Connect Four is a two-player connection board game, in which the players choose a color and then take turns dropping colored tokens into a seven-column, six-row vertically suspended grid. The pieces fall straight down, occupying the lowest available space within the column. The objective of the game is to be the first to form a horizontal, vertical, or diagonal line of four of one's own tokens. Connect Four is a solved game. The first player can always win by playing the right moves.
Combinatorial game theory has several ways of measuring game complexity. This article describes five of them: state-space complexity, game tree size, decision complexity, game-tree complexity, and computational complexity.
An m,n,k-game is an abstract board game in which two players take turns in placing a stone of their color on an m-by-n board, the winner being the player who first gets k stones of their own color in a row, horizontally, vertically, or diagonally. Thus, tic-tac-toe is the 3,3,3-game and free-style gomoku is the 15,15,5-game. An m,n,k-game is also called a k-in-a-row game on an m-by-n board.
3D tic-tac-toe, also known by the trade name Qubic, is an abstract strategy board game, generally for two players. It is similar in concept to traditional tic-tac-toe but is played in a cubical array of cells, usually 4x4x4. Players take turns placing their markers in blank cells in the array. The first player to achieve four of their own markers in a row wins. The winning row can be horizontal, vertical, or diagonal on a single board as in regular tic-tac-toe, or vertically in a column, or a diagonal line through four boards.
Connect6 introduced in 2003 by Professor I-Chen Wu at Department of Computer Science and Information Engineering, National Chiao Tung University in Taiwan, is a two-player strategy game similar to Gomoku.
The Shannon number, named after the American mathematician Claude Shannon, is a conservative lower bound of the game-tree complexity of chess of 10120, based on an average of about 103 possibilities for a pair of moves consisting of a move for White followed by a move for Black, and a typical game lasting about 40 such pairs of moves.
Frank van Harmelen is a Dutch computer scientist and professor in Knowledge Representation & Reasoning in the AI department at the Vrije Universiteit Amsterdam. He was scientific director of the LarKC project (2008-2011), "aiming to develop the Large Knowledge Collider, a platform for very large scale semantic web reasoning."
The ICGA Journal is a quarterly academic journal published by the International Computer Games Association. It was renamed in 2000. Its previous name was the ICCA Journal of the International Computer Chess Association, which was founded in 1977.
In combinatorial game theory, a two-player deterministic perfect information turn-based game is a first-player-win if with perfect play the first player to move can always force a win. Similarly, a game is second-player-win if with perfect play the second player to move can always force a win. With perfect play, if neither side can force a win, the game is a draw.
Proof-number search is a game tree search algorithm invented by Victor Allis, with applications mostly in endgame solvers, but also for sub-goals during games.
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.
Hendrik Jacob (Jaap) van den Herik is a Dutch computer scientist, and professor at the University of Leiden, known for his contribution in the fields of computer chess and artificial intelligence.
In discrete mathematics, the social golfer problem (SGP) is a combinatorial-design problem derived from a question posted in the usenet newsgroup sci.op-research in May 1998. It is listed as Problem 010 in the online test problem library CSPLib.
A group of 32 golfers plays golf once a week in groups of 4. Schedule these golfers to play for as many weeks as possible without any two golfers playing in the same group more than once.
Ingo Althöfer is a German mathematician at the University of Jena, where he holds the chair of operations research.
This page is based on this Wikipedia article Text is available under the CC BY-SA 4.0 license; additional terms may apply. Images, videos and audio are available under their respective licenses.
