Determining Degree Of Difficulty In Rogo, A TSP-based Paper Puzzle
Nicola Ward Petty, Shane Dye · 2010
Rogo®, a pencil and paper puzzle, is based on a subset-selection travelling salesperson problem with a known optimal score. There is an infinite number of possible Rogo puzzles, with at least twelve aspects which may be varied. In order for puzzles to be appealing, they should be difficult enough to be challenging and interesting, but not intractable or tedious. Through examination, mathematical modelling and experimentation on human subjects, we begin research into what elements affect the degree of difficulty of Rogo puzzles. Comparisons are made with other puzzles. Some preliminary results are given.