https://github.com/danielholmes/genetic-algorithm-circle
Evolving disks to find the largest possible fitting on a table of other disks
https://github.com/danielholmes/genetic-algorithm-circle
Last synced: about 1 year ago
JSON representation
Evolving disks to find the largest possible fitting on a table of other disks
- Host: GitHub
- URL: https://github.com/danielholmes/genetic-algorithm-circle
- Owner: danielholmes
- Created: 2016-09-10T01:08:17.000Z (almost 10 years ago)
- Default Branch: master
- Last Pushed: 2016-09-11T22:29:33.000Z (almost 10 years ago)
- Last Synced: 2025-02-10T01:41:22.605Z (over 1 year ago)
- Language: Scala
- Homepage:
- Size: 18.6 KB
- Stars: 0
- Watchers: 2
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Genetic Algorithm Circle
An implementation of the the problem outlined here: (http://www.ai-junkie.com/ga/intro/gat3.html) under the
*Stuff to Try* section i.e.
Given an area that has a number of non overlapping disks scattered about its surface... Use a genetic algorithm to
find the disk of largest radius which may be placed amongst these disks without overlapping any of them
## Dependencies
- SBT
- JDK 8+
- Scala 2.11
To find available SBT dependency updates run `sbt dependencyUpdates`
## Tests
- All: `sbt test`
- Individual: `sbt "test-only org.danielholmes.gacirc.SurfaceSpec"`
- Individual continuous: `sbt ~"test-only org.danielholmes.gacirc.SurfaceSpec"`
## Running
`sbt run`