The Vine contest was to slide tiles around and then identify a vine of increasing values that are four point connected with no repeats. See the Vine contest for full details.

This challenge is specifically for the linear [1 n] case.

This did not exist in the competition suite but did in the test suite as brd 78. The 1-D case was not optimized during the contest.

Input b = [1 5 2 3 1 2 8] ..limit 2

Output: v=[3 4 5] and moves =[7 6;6 5] making [1 5 2 3 8 0 0]

Score is 13.

The board may be flipped LR but will always be a row.

..............................................Limit 10000....7250...6681....1000........0

Nieto-Castanon Winning Code:...5705...5705...5705....3114 2564

Optimal Score values...................20244 20244 20167 13048 2564