Contact us

Decision making algorithms for board or card games

Author: Piotr Beling

Decision making algorithm is an algorithm which tries to calculate the best move possible to make in a given position in a game. In other words, for given input position, it points the move which is possible the best one. For instance, in this tic-tac-toe position shown in Figure 1, it should chose the move in the bottom-right corner, because every other can result in its defeat. A good decision making algorithm is a crucial element of each game-playing program.

Read whole article – Decision_making_algorithms_for_board_or_card_games2

You might also like

AAIA’17 Data Mining Challenge Concluded

AAIA’17 Data Mining Challenge is the fourth data mining competition organized within the framework of International Symposium Advances in Artificial Intelligence and Applications. This time, the task is to come up with an efficient prediction model which would help AI to play the game of Hearthstone: Heroes of Warcraft. The competition is kindly sponsored by Silver Bullet Solutions and Polish Information Processing Society (PTI).

Read more
Next challenge for AI after winning with top human chess, go and poker players

In chess and go games all information needed for AI analysis is literally on the table. According to game experts winning in no-limit poker shows that AI is ready to win in cybersecurity, negotiations, military, auctions and even in containing infections.

Read more
Praga 2017

AAIA’17 Data Mining Challenge: Helping AI to Play Hearthstone took place between March 23 and May 15, 2017. It was organized under the auspices of the 12th International Symposium on Advances in Artificial Intelligence and Applications and sponsored by Silver Bullet Solutions and Polish Information Processing Society.

Read more
Lecture on Artificial Intelligence in Games

29.12.2016 Leon Koźminski Academy of Entrepreneurship and Management, Warsaw, Poland

A lecture given by dr. Maciej Świechowski and dr. Piotr Beling

The goal of the lecture was to present an overview of modern approach to artificial intelligence in games.  The lecture was organized in two parts. First was devoted to application of Artificial Neural Networks (ANN) to different aspects of Machine Learning in general and to computer games in particular. The second part was devoted to Monte Carlo Tree Search (MCTS), a technique which might be applied to find optimal decisions in games with perfect or imperfect information.

Read more