Travelling Salesman

Scientific experiment: Compare the behavior of people in a maze with the differential evolution algorithm.

VSB - Technical University of Ostrava


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 results. Evolutionary algorithms are represented by differential evolution, where the best possible parameter
estimation will be sought based on the player’s results. This will provide results of a quality comparable to 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.
Read more
Collapse
Loading...

What's New

First version.
Read more
Collapse

Additional Information

Updated
February 6, 2020
Size
1.6M
Installs
1+
Current Version
1.0
Requires Android
5.0 and up
Content Rating
Everyone
Permissions
Offered By
Michal Bukáček
©2020 GoogleSite Terms of ServicePrivacyDevelopersArtistsAbout Google|Location: United StatesLanguage: English (United States)
By purchasing this item, you are transacting with Google Payments and agreeing to the Google Payments Terms of Service and Privacy Notice.