Problem 492. Find best placement for ordered dominoes (harder)

Created by Doug Hull

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>Given a list of ordered pairs, find the order they should be placed in a line, such that the sum of the absolute values of the differences is</w:t></w:r><w:r><w:t> </w:t></w:r><w:r><w:rPr><w:b/></w:rPr><w:t>minimized</w:t></w:r><w:r><w:t>.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"code\"/></w:pPr><w:r><w:t><![CDATA[list = [1 2\n        5 3\n        2 4\n\norder = [1 3 2]\n\nyields: [1 2][2 4][5 3]\n    or: abs(2-2) + abs(4-5)\n    or:        0 + 1\n    or: 1]]></w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>There is a unique best solution, but the score is NOT always zero.</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

557 Solutions
266 Solvers

Last Solution submitted on Dec 28, 2022

Last 200 Solutions

Problem Comments

Solution Comments

Solution 1025155

1 Comment

1 Comment

Roche de Guzman on 20 Oct 2016

nice!

Problem Recent Solvers266

Problem Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Problem 492. Find best placement for ordered dominoes (harder)

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers266

Suggested Problems

More from this Author51

Problem Tags

Community Treasure Hunt

Problem 492. Find best placement for ordered dominoes (harder)

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers266

Suggested Problems

More from this Author51

Problem Tags

Community Treasure Hunt

Players