Skip to content

vedantmathur/Vankins-Mile

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

4 Commits
 
 
 
 

Repository files navigation

Vankins-Mile

Vankins Mile expensive path algorithm Vankin’s Mile is a solitaire game played on an n × n square grid. The player starts by placing a token on any square of the grid. Then on each turn, the player moves the token either one square to the right or one square down. The game ends when player moves the token off the edge of the board. Each square of the grid has a numerical value, which could be positive, negative, or zero. The player starts with a score of zero; whenever the token lands on a square, the player adds its value to his score. The object of the game is to score as many points as possible.

For example, given the grid below, the player can score 8−6+7−3+4 = 10 points by placing the initial token on the 8 in the second row, and then moving down, down, right, down, down. (This is not the best possible score for these values.)

Image of Example

About

Vankins Mile expensive path algorithm

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages