Difference between revisions of "Karlo Balla"

From Chessprogramming wiki
Jump to: navigation, search
Line 28: Line 28:
 
* [http://www.talkchess.com/forum/viewtopic.php?topic_view=threads&p=490672&t=45846 Re: Move Tables - explain as if I'm five] by [[Karlo Balla]], [[CCC]], November 05, 2012 » [[Belzebub#Repetitions|Repetitions in Belzebub]]
 
* [http://www.talkchess.com/forum/viewtopic.php?topic_view=threads&p=490672&t=45846 Re: Move Tables - explain as if I'm five] by [[Karlo Balla]], [[CCC]], November 05, 2012 » [[Belzebub#Repetitions|Repetitions in Belzebub]]
 
==2015 ...==
 
==2015 ...==
* [http://www.talkchess.com/forum/viewtopic.php?t=57560&start=14 Re: Interesting ideas] by [[Karlo Balla]], [[CCC]], September 09, 2015 » [[B*]], [[BPIP-DFISA]], [[Monte-Carlo Tree Search]] <ref>[[Ronald L. Rivest]] ('''1987'''). ''Game Tree Searching by Min/Max Approximation''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_(journal) Artificial Intelligence], Vol. 34, 1, [http://people.csail.mit.edu/rivest/Rivest-GameTreeSearchingByMinMaxApproximation.pdf pdf 1995]</ref> <ref>[[Eric B. Baum]], [[Warren D. Smith]] ('''1995'''). ''[https://www.semanticscholar.org/paper/Best-Play-for-Imperfect-Players-and-Game-Tree-part-Baum-Warren/5838432c92c8905c7066962400c55ddc8803f11a Best Play for Imperfect Players and Game Tree Search]''. And with pseudocode appendix by [[Charles Garrett]]</ref> <ref>[[Yan Radovilsky]], [[Solomon Eyal Shimony]]  ('''2004'''). ''Generalized Model for Rational Game Tree Search''. [https://www.cs.bgu.ac.il/~yanr/Publications/smc04.pdf pdf]</ref>
+
* [http://www.talkchess.com/forum/viewtopic.php?t=57560&start=14 Re: Interesting ideas] by [[Karlo Balla]], [[CCC]], September 09, 2015 » [[B*]], [[BPIP-DFISA]], [[Monte-Carlo Tree Search]] <ref>[[Ronald L. Rivest]] ('''1987'''). ''Game Tree Searching by Min/Max Approximation''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_(journal) Artificial Intelligence], Vol. 34, 1, [http://people.csail.mit.edu/rivest/Rivest-GameTreeSearchingByMinMaxApproximation.pdf pdf 1995]</ref> <ref>[[Eric B. Baum]], [[Warren D. Smith]] ('''1995'''). ''[https://www.semanticscholar.org/paper/Best-Play-for-Imperfect-Players-and-Game-Tree-part-Baum-Warren/5838432c92c8905c7066962400c55ddc8803f11a Best Play for Imperfect Players and Game Tree Search - ; part I - theory]''. with pseudocode appendix by [[Charles Garrett]]</ref> <ref>[[Yan Radovilsky]], [[Solomon Eyal Shimony]]  ('''2004'''). ''Generalized Model for Rational Game Tree Search''. [https://www.cs.bgu.ac.il/~yanr/Publications/smc04.pdf pdf]</ref>
 
* [http://www.talkchess.com/forum/viewtopic.php?t=63126&start=40 Re: PieceLists ?] by [[Karlo Balla]], [[CCC]], February 17, 2017 » [[Table-driven Move Generation]]
 
* [http://www.talkchess.com/forum/viewtopic.php?t=63126&start=40 Re: PieceLists ?] by [[Karlo Balla]], [[CCC]], February 17, 2017 » [[Table-driven Move Generation]]
 
* [http://www.talkchess.com/forum3/viewtopic.php?f=2&t=67300 Leela on more then one GPU?] by [[Karlo Balla]], [[CCC]], May 01, 2018 » [[Leela Chess Zero]]
 
* [http://www.talkchess.com/forum3/viewtopic.php?f=2&t=67300 Leela on more then one GPU?] by [[Karlo Balla]], [[CCC]], May 01, 2018 » [[Leela Chess Zero]]

Revision as of 18:56, 19 February 2020

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

[4]

Forum Posts

2005 ...

2010 ...

2015 ...

External Links

References

Up one level