Programming Assignment 2 – The Othello Champion Firebrand
نویسندگان
چکیده
The following report describes the process of building a good Othello player, using wellknown results from the field of artificial intelligence. We describe the features we use to evaluate the board, and also other ways we try to speed up our program such as best-first search to increase the gain from αβ-pruning and more. The final game, Firebrand, beats the authors even though it might need some more features to beat a world-class player.
منابع مشابه
Improving heuristic mini-max search by supervised learning
This article surveys three techniques for enhancing heuristic game-tree search pioneered in the author’s Othello program LOGISTELLO, which dominated the computer Othello scene for several years and won against the human World-champion 6–0 in 1997. First, a generalized linear evaluation model (GLEM) is described that combines conjunctions of Boolean features linearly. This approach allows an aut...
متن کاملA World-Championship-Level Othello Program
Othello is a recent addition to the collection of games that have been examined within artificial intelligence. Advances have been rapid, yielding programs that have reached the level of world-championship play. This article describes the current champion Othello program, Iago. The work described here includes: (1) a task analysis of Othello; (2) the implemenation of a program based on this ana...
متن کاملLearning Othello using Cooperative and Competitive Neuroevolution
From early days in computing, making computers play games like chess and Othello with a high level of skill has been a challenging and, lately, rewarding task. As computing power becomes increasingly more powerful, more and more complex learning techniques are employed to allow computers to learn different tasks. Games, however, remain a challenging and exciting domain for testing new technique...
متن کامل1 - opt neural approaches to quadratic assignment problems
In this paper, we propose new analog neural approaches to combinatorial optimization problems, in particular, quadratic assignment problems (QAPs). Our proposed methods are based on an analog version of the -opt heuristics, which simultaneously changes assignments for elements in a permutation. Since we can take a relatively large value, our new methods can achieve a middle-range search over po...
متن کاملBus Assignment to Iranian Pilgrims During Pilgrimage
Among the multitude of activities of Hajj Organization which require careful planning bus assignment to the Iranian pilgrim caravans d g pilgrimage is the most important one. The objective of this assignment is to have a minimum number o standing passengers/empty seats, while satisfying a large number of operational and religious constrain. This problem was formulated as a large scale zero-one ...
متن کامل