查看文章

Urban Horse Problem is a single player game that can be considered as a combinatorial problem. In this paper we solve the problem using different methods: backtracking, restarted backtracking and genetic algorithm, and compare the results. Several different fitness functions for genetic algorithm are proposed and compared. It seems that the problem is very difficult and perhaps unsuitable for the genetic algorithm using those fitness functions. Keywords: backtracking, cybernetics, games, genetic algorithms, search.