151
click to vote
ACG
2015
Springer
10 years 1 months ago
2015
Springer
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...
246
click to vote
ACG
2015
Springer
10 years 1 months ago
2015
Springer
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...
156
click to vote
ACG
2015
Springer
10 years 1 months ago
2015
Springer
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...
168
Voted
ACG
2015
Springer
10 years 1 months ago
2015
Springer
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...
147
click to vote
ACG
2015
Springer
10 years 1 months ago
2015
Springer
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...
149
click to vote
ACG
2015
Springer
10 years 1 months ago
2015
Springer
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...
127
Voted
ACE
2015
10 years 1 months ago
2015
The computing education literature shows some recent interest in summative assessment in introductory programming, with papers analysing final examinations and other papers propos...
142
Voted
ACE
2015
10 years 1 months ago
2015
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...