169
Voted
ACG
2015
Springer
10 years 1 months ago
2015
Springer
169
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...
148
Voted
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...
152
Voted
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...
128
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...