—Sporting events evoke strong emotions amongst fans and thus act as natural laboratories to explore emotions and how they unfold in the wild. Computational tools, such as sentime...
Abstract. Asynchronous parallel game-tree search methods are effective in improving playing strength by using many computers connected through relatively slow networks. In game po...
UCT is a standard method of Monte Carlo tree search (MCTS) algorithms, which have been applied to various domains and have achieved remarkable success. This study proposes a family...
Two features set slither apart from other connection games. Previously played stones can be relocated and some stone configurations are forbidden. We show that the interplay of th...
The simplicity of the pen-and-paper game Sprouts hides a surprising combinatorial complexity. We describe an optimisation called boundary matching that accommodates this complexity...
We present the design of a computer program for playing Progressive Chess. In this game, rather than just making one move per turn, players play progressively longer series of move...
Abstract. Recently we introduced Sibling Conspiracy Number Search — an algorithm based not on evaluation of leaf states of the search tree but, for each node, on relative evaluat...
The computing education literature shows some recent interest in summative assessment in introductory programming, with papers analysing final examinations and other papers propos...
Simon, Judy Sheard, Daryl J. D'Souza, Mike Lopez, ...
This paper presents an investigation of assessment in firstyear Information and Communications Technology (ICT) courses with a focus on Australian universities. This study was par...
Judy Sheard, Michael Morgan, Matthew Butler, Katri...