Survey
* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project
* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project
Crystal Wettingfeld COSC 4172 – Senior Seminar Annotated Bibliography for Peg Solitaire Design Bell, George. "George Bell's Triangular Peg Solitaire Page." Yahoo! GeoCities: Get a free web site with easy-to-use site building tools. 31 Mar. 2009 <http://www.geocities.com/~gibell/pegsolitaire/tindex.html>. This source discusses the board storage, and how it can be implemented in different ways, and how to solve for that type of board. Darby, Gary. "Peg Solitaire Game." DelphiForFun Home. 31 Mar. 2009 <http://www.delphiforfun.org/Programs/PegSolitaire.htm>. This source shows the different variety of Peg Solitaire game boards. It also discusses the Depth First approach to solving the problem, and provides a link to more resources. Do, Chuong. "Satisfiability and Peg Solitaire." Stanford Artificial Intelligence Laboratory. 31 Mar. 2009 <http://ai.stanford.edu/~chuongdo/satpage/index.html>. This source contains a simple graphical representation of the Peg game board. It is extremely simple, but easy to implement on output. This source also shows a boolean expression representation of the game board and pegs to complete moves. It is a simple implementation, but may not be as effective as Depth First Search. This boolean method checks specific conditions to see if moves can be completed, and changes the state of the board after the move. Graham, Sidney. College of Science and Technology :: Central Michigan University. 31 Mar. 2009 <http://www.cst.cmich.edu/users/graha1sw/Pub/PegSol/EnglishPegSol.pdf>. This source uses a different form of Peg Solitaire, but the concepts are still the same. In this source, they suggest to use “block moves”. These blocks are small problems that can be solved easily, and combined to solve the larger problem. Martinoli, Paolo. "CodeProject: Solitaire Puzzle with Backtracking. Free source code and programming help." CodeProject. Free source code and programming help. 31 Mar. 2009 <http://www.codeproject.com/KB/cpp/SolitairePuzzle.aspx?display=Print>. This source uses a different form of Peg Solitaire, but the concepts are still the same. In this source, they describe a recursive “backtracking” class. This class is a simple Depth First Search, and is used to solve the puzzle. Depth First Search is exhaustive, and can be lengthy, but can easily be backtracked when a solution doesn’t work.