Arkadiusz+Nowakowski

toc
 * Home * People * Arkadiusz Nowakowski**

a Polish computer scientist and researcher at Institute of Computer Science, [|University of Silesia], [|Sosnowiec]. His research interests in computational intelligence include [|combinatorial game theory] and search algorithms. In 2013, Arkadiusz Nowakowski applied Monte-Carlo Tree Search with UCT (**U**pper **C**onfidence bounds applied to **T**rees) to the [|Partisan game] [|Toads and Frogs].  =Toads and Frogs= Along with Wojciech Wieczorek, Rafał Skinderowicz, Jan Kozak, and Przemysław Juszczuk et al., Arkadiusz Nowakowski participated the Second Silesian University Computer Combinatorial Games Tournament in [|Sosnowiec], on June 17, 2013, playing [|Toads and Frogs], an [|abstract], two-player, [|strategy game] invented by Richard Kenneth Guy. Bots played a Blitz tournament with a board size of 32 squares, two seconds per move,  the games to be played automatically using a specially defined [|IP-based] protocol. Following algorithms were used: Monte-Carlo Tree Search (Wieczorek), iterative deepening alpha-beta (Skinderowicz), building patterns and decision rules (Kozak), and UCT (Nowakowski), as descibed in the December 2013 ICGA Journal with following conclusion :
 * Arkadiusz Nowakowski**,

=Selected Publications=
 * Wojciech Wieczorek, Rafał Skinderowicz, Jan Kozak, Przemysław Juszczuk, Arkadiusz Nowakowski (**2013**). //Selected Algorithms from the 2013 Toads-and-Frogs Blitz Tournament//. ICGA Journal, Vol. 36, No. 4
 * Jan Kozak, Arkadiusz Nowakowski, Rafał Skinderowicz, Wojciech Wieczorek (**2014**). //The 3rd Silesian University Computer Combinatorial Games Tournament//. ICGA Journal, Vol. 37, No. 3

=External Links=
 * [|mgr inż. Arkadiusz Nowakowski | Zakład Algorytmiki i Inteligencji Obliczeniowej] (Polish)

=References= =What links here?= include page="Arkadiusz Nowakowski" component="backlinks" limit="40"
 * Up one level**