Skip to content

BTrDung/Solving-Peg-Solitaire-by-using-back-tracking

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

12 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Peg_Solitaire

Description:

This repo is created from improvisation in the process of understanding and learning itself.

No. Method Release
01 Back Tracking
02 Depth First Search
03 Breadth First Search

Introduction

Peg Solitaire is a game that consists of a board with 33 holes arranged in the pattern given in the pictures below.

At the start, every hole except the center is filled with a peg. The player then starts jumping pegs. Any peg that is jumped over is removed, just as in checkers.

Vertical and horizontal jumps are allowed, but diagonal jumps are forbidden. The goal is to reach a position where only one peg remains.

Requirements:

Download : https://www.python.org/downloads/

Downliad : https://code.visualstudio.com/download

Or

Download Pycharm :https://www.jetbrains.com/pycharm/download/#section=windows

Anaconda : https://docs.anaconda.com/anaconda/install/

Installation:

Download my git as a ZIP file: https://github.com/BTrDung/Peg_Solitaire

How to run:

python PegSolitaire.py

References:

I really thank https://github.com/amal4joy/Peg-Solitaire and http://people.cst.cmich.edu/graha1sw/pub/pegsol/englishpegsol.pdf for helping me complete this project.

About

This project is created by the author's improvisation.

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages