Cody

Problem 520. Choose the best fitting dominoes

Solution 439151

Submitted on 6 May 2014 by Axel
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.
Solve This Problem View on Solution Map

Test Suite

Test Status Code Input and Output
1   Pass
list = {[1 3; 2 4; 5 6],[4 6; 2 5;6 7],[3 4; 6 1; 4 6]} selections = [2 1 2]; assert(isequal(ChooseBestFittingDominoes(list),selections))

list = [3x2 double] [3x2 double] [3x2 double]

2   Pass
%% list = {[1 5; 2 3; 2 2; 3 4; 0 3], [0 4; 1 5; 2 2; 4 5; 4 6], [7 7; 3 8; 4 7; 5 9; 0 4]}; selections = [4 4 4]; assert(isequal(ChooseBestFittingDominoes(list),selections))

3   Pass
%% list = {[1 4; 2 2; 1 1; 3 3],[1 2; 2 3],[2 2]}; selections = [3 1 1]; assert(isequal(ChooseBestFittingDominoes(list),selections))

Suggested Problems

More from this Author52