Piotr Beling
International Joint Conferences on Artificial Intelligence (IJCAI), Montral, August 19-26, 2021
Presentation of the results included in the paper On pruning search trees of impartial games, published in Artificial Intelligence.
Piotr Beling, Marek Rogalski
Artificial Intelligence, volume 283, pages 103262, March 2020, doi: 10.1016/j.artint.2020.103262
In this paper we study computing Sprague-Grundy values for short impartial games under the normal play convention. We put forward new game-agnostic methods for effective pruning search trees of impartial games.
Piotr Beling
IEEE Transactions on Computational Intelligence and AI in Games, volume 9, number 1, pages 76-87, March 2017, doi: 10.1109/TCIAIG.2015.2505240
In this paper, some improvements of the partition search algorithm are proposed.
Piotr Beling
Ph.D. thesis, University of Łódź, Łódź, 2016, in polish
Ph.D. thesis, prepared under the supervision of Prof. Goldstein at the University of Łódź and defended at the Łódź University of Technology in 2006.
Piotr Beling
Metody Informatyki Stosowanej, no. 3/2011 (28), pages 5-18
The paper presents a review of algorithms to efficiently solve the double dummy problem in the card game of bridge.
Piotr Beling
Master’s thesis, Łódź University of Technology, Łódź, 2006, in polish
Master’s thesis on programming of logical games. It describes an artificial intelligence engine used in a checkers program.
A set of freeware programs which solve problems in the Bridge card game.
A program which plays Brazilian (classics, 8x8 with international rules) checkers (draughts).
A multi-platform, component-based universal engine for embedding advanced artificial intelligence in video games.