People vs Differential Evolution in Search of The Shortest Path

Abstract

The most common aim of computer game optimisation is to find the shortest path within a game or to solve a problem of a travelling salesman within a small group of cities. This article deals with the possibilities of comparing the ascertained solutions of a given problem of human intelligence and evolutionary algorithms. Human intelligence is represented by mobile game players programmed for the Android operating system, by their conduct during playing the game, and by the achieved the results. Evolutionary algorithms are represented by differential evolution. The best possible parameter estimation will be sought and compared with the player's results. The goal is to nd parameter estimation of an equal or better quality in comparison with results of human players. Another task is to verify whether this setting is suitable for all mazes and whether people or the differential evolution are better at searching.

This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium provided the original work is properly cited.