Problem 677. Vine Contest 1-D Case Optimization: Board 78

Created by Richard Zapor

Solve Later

{"relationships":[{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/document","targetMode":"","relationshipId":"rId1","target":"/matlab/document.xml"},{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/output","targetMode":"","relationshipId":"rId2","target":"/matlab/output.xml"}],"parts":[{"partUri":"/matlab/document.xml","relationship":[],"contentType":"application/vnd.mathworks.matlab.code.document+xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<w:document xmlns:w=\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\"><w:body><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>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</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"http://www.mathworks.com/matlabcentral/contest/contests/34\"><w:r><w:t>Vine contest</w:t></w:r></w:hyperlink><w:r><w:t> for full details.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>This challenge is specifically for the linear [1 n] case.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>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.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Input b = [1 5 2 3 1 2 8] ..limit 2</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Output: v=[3 4 5] and moves =[7 6;6 5] making [1 5 2 3 8 0 0]</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Score is 13.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>The board may be flipped LR but will always be a row.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>..............................................Limit 10000....7250...6681....1000........0</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Nieto-Castanon Winning Code:...5705...5705...5705....3114 2564</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Optimal Score values...................20244 20244 20167 13048 2564</w:t></w:r></w:p></w:body></w:document>"},{"partUri":"/matlab/output.xml","contentType":"text/xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\" standalone=\"no\" ?><embeddedOutputs><metaData><evaluationState>manual</evaluationState><layoutState>code</layoutState><outputStatus>ready</outputStatus></metaData><outputArray type=\"array\"/><regionArray type=\"array\"/></embeddedOutputs>"}]}

Solve

Solution Stats

6 Solutions
1 Solvers

Last Solution submitted on Nov 30, 2015

Last 200 Solutions

Problem Comments

1 Comment

1 Comment

Alfonso Nieto-Castanon on 30 Nov 2015

optimal score values (until proven otherwise):...... 20244 20244 20238 14563 2564

Problem Recent Solvers1

Problem Tags

optimization rand vines

Problem 677. Vine Contest 1-D Case Optimization: Board 78

Solution Stats

Last 200 Solutions

Problem Comments

Problem Recent Solvers1

Suggested Problems

More from this Author236

Problem Tags

Problem 677. Vine Contest 1-D Case Optimization: Board 78

Solution Stats

Last 200 Solutions

Problem Comments

Problem Recent Solvers1

Suggested Problems

More from this Author236

Problem Tags

Players