Karlo Balla

From Chessprogramming wiki
Jump to: navigation, search

Home * People * Karlo Balla

Karlo Balla [1]

Karlo Balla, (Karlo Balla Jr., Karlo Bala Jr.)
a Serbian computer scientist and assistant professor at Department of Media Studies, Faculty of Philosophy, University of Novi Sad, where he already obtained his Diploma and Master's degrees in CS in 2004 and 2010 respectively. His research interests include combinatorial optimization, artificial intelligence, logistics, data structures and algorithms, and E-learning. As a chess player [2], he is further interested in chess programming, also working on an own, private engine [3].

Selected Publications


Forum Posts

2005 ...

2010 ...

2015 ...

External Links


  1. Karlo Bala, asistent – Odsek za medijske studije
  2. Bala, Karlo FIDE Chess Profile
  3. TT behavior by Karlo Balla, CCC, June 25, 2011
  4. dblp: Karlo Bala
  5. Ronald L. Rivest (1987). Game Tree Searching by Min/Max Approximation. Artificial Intelligence, Vol. 34, 1, pdf 1995
  6. Eric B. Baum, Warren D. Smith (1995). Best Play for Imperfect Players and Game Tree Search. Part I - theory, with pseudocode appendix by Charles Garrett
  7. Yan Radovilsky, Solomon Eyal Shimony (2004). Generalized Model for Rational Game Tree Search. pdf

Up one level