In 1992, a novel Award was instituted by the ICCA, the ICCA Journal Award. The Award is to be adjudicated annually to a first-time author for the best article in the ICCA/ICGA Journal in the year under consideration.
Year |
Award Winner |
Article |
Published in |
|---|---|---|---|
1993 |
Peter Jansen (1993). KQKR: Speculatively Thwarting a Human Opponent. |
||
1994 |
Chrilly Donninger (1993). Null Move and Deep Search: Selective-Search Heuristics for Obtuse Chess Programs. |
||
1995 |
Bradley Kuszmaul (1995). The StarTech Massively Parallel Chess Program. |
||
1996 |
Michael Buro (1995). ProbCut: An Effective Selective Extension of the Alpha-Beta Algorithm. |
||
1997 |
Mark Brockington (1996). A Taxonomy of Parallel Game-Tree Search Algorithms. |
||
1998 |
Andreas Junghanns (1998). Are there Practical Alternatives to Alpha-Beta? |
||
1999 |
|||
2000 |
Darse Billings (2000). Thoughts on RoShamBo. |
||
2001 |
Thomas Thomsen |
Thomas Thomsen (2000). Lambda-Search in Game Trees with Application to Go. |
|
2002 |
Ren Wu, Don Beal (2001). Fast, Memory-efficient Retrograde Algorithms. |
||
2003 |
|||
2004 |
Haw-ren Fang, Tsan-sheng Hsu, Shun-Chin Hsu (2004). |
||
2005 |
Kohei Noshita |
Kohei Noshita (2005). Union-Connections and Straightforward Winning Strategies in Hex. + Companion pdf |
|
2006 |
Fridel Fainshtein, Yaakov HaCohen-Kerner (2006). A Chess Composer of Two-Move Mate Problems. |
||
2007 |
Gian Piero Favini |
Paolo Ciancarini, Gian Piero Favini (2007). A Program to Play Kriegspiel. |
|
2008 |
Rémi Coulom (2007). Computing “Elo Ratings” of Move Patterns in the Game of Go. |
||
2009 |
Nathan Sturtevant (2008). An Analysis of UCT in Multi-Player Games. |
||
2010 |
Yoshikuni Sato, Daisuke Takahashi, Reijer Grimbergen (2010). |
||
2011 |
Petr Baudiš |
Petr Baudiš (2011). Balancing MCTS by Dynamically Adjusting the Komi Value. |
|
2012 |
Diogo R. Ferreira (2012). Determining the Strength of Chess Players Based on Actual Play. |
||
2013 |
Kunihito Hoki, Tomoyuki Kaneko, Akihiro Kishimoto, Takeshi Ito (2013). |