Skip to content

This code will use evolutionary algorithms to create variable-difficulty peg solitaire games

License

Notifications You must be signed in to change notification settings

jacobchrismarsh/peg_solitaire_csc_570

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

80 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Procedural Generation of Peg Solitaire Games Using ASP

Purpose

Implementation Details

Unity, C#, ASP, Python

Shapes Provided

Square, Square with "ears", Rectangle, Cross, H/I shape, Corner Removal, Random (All of the aforementioned shapes)

Text File Short Explanations

usable_boards_easy.txt is board games on the easiest difficulty, but variability set to hard

usable_boards_easier.txt is board games on the easiest difficulty and variability set to easy

usable_boards.txt is board games on the second lowest difficulty and variability set to hard

easy_medium_hard.txt contains three boards that are solvable in 2.154, 11.152, and 24.191 seconds

User Study Command Line

('record' will write the order of the boards' difficulties to an alternate text file; omit 'record' if recording is not desired)

python3 peg_solitaire_game.py easy_medium_hard.txt record

About

This code will use evolutionary algorithms to create variable-difficulty peg solitaire games

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published