In this paper, the problem of optimally locating the numbers around a dart board is investigated. The objective considered is risk maximization. Under different assumptions, the problem can be formulated as a travelling salesman problem, as a quadratic assignment problem, or as a more general assignment problem without subtours. Various dart board designs are proposed and compared with the current one.