Your program will be judged on the 32,768 deals found in the original Microsoft FreeCell program. However, your program must be able to solve any solvable game. If a game is unsolvable, your program should indicate as such. Since only one card is moved at a time, moving a sequence of 3 cards requires 5 moves, and a sequence of 5 cards requires 9 moves. Once a card is put into the foundation, it cannot be removed. The output will look something like this: 18 28 3A 8B 8C 85 B5 35 4F etc. Another number or letter representing the destination pile or free cell, or F for the foundation of that suit.
A number representing the pile number ( 1 through 8), or a free cell ( A to D), representing the source pile.Which will be dealt in the initial layout in this order: 01 02 03 04 05 06 07 08Īnd return a list of moves to solve the game. Your program will take as input a sequence of 52 cards, in the following format: 2S 9H 10C 6H 4H 7S 2D QD KD QC 10S AC. Your task is to build a program that will solve these games in the fewest moves possible. The idea is that you weave individual cards in and out of the free cells as required to help you solve the game. However, you can only build one card at a time, so you are given four "free cells" each of which can contain one card to help you move entire sequences. In the game of Freecell, you are tasked with building four foundation piles in suit from ace to king, on a layout where you build downward in alternating colours.
0 kommentar(er)
