{"group":{"id":1,"name":"Community","lockable":false,"created_at":"2012-01-18T18:02:15.000Z","updated_at":"2026-04-16T00:12:35.000Z","description":"Problems submitted by members of the MATLAB Central community.","is_default":true,"created_by":161519,"badge_id":null,"featured":false,"trending":false,"solution_count_in_trending_period":0,"trending_last_calculated":"2026-04-16T00:00:00.000Z","image_id":null,"published":true,"community_created":false,"status_id":2,"is_default_group_for_player":false,"deleted_by":null,"deleted_at":null,"restored_by":null,"restored_at":null,"description_opc":null,"description_html":null,"published_at":null},"problems":[{"id":1631,"title":"Criss-Cross: NHL - Optimize Matrix Size","description":"Given the List of NHL Teams, fit all in a minimum area Criss-Cross with no invalid words, no duplications, and all connected.\r\n\r\n*Input:* Dictionary (cell array)\r\n\r\n*Output:* Array of Char  (spaces indicated by char(96))\r\n\r\n*Score:* Numer of Elements in Array (including unused)\r\n\r\nExample: \r\n\r\ndict={'abc' 'cat'}\r\n\r\nOutput: \r\n['abc';'``a';'``t']\r\n\r\n  abc\r\n  ``a\r\n  ``t\r\n\r\nScore: 9\r\n\r\nRelated Challenges:\r\n\r\n1) \u003chttp://www.mathworks.com/matlabcentral/cody/problems/1533-criss-cross-verification-nhl Verify Criss-Cross\u003e\r\n\r\n2) Create Criss-Cross dictionary from a matrix\r\n\r\n3) Games Magazine Contest 8/31/2013","description_html":"\u003cp\u003eGiven the List of NHL Teams, fit all in a minimum area Criss-Cross with no invalid words, no duplications, and all connected.\u003c/p\u003e\u003cp\u003e\u003cb\u003eInput:\u003c/b\u003e Dictionary (cell array)\u003c/p\u003e\u003cp\u003e\u003cb\u003eOutput:\u003c/b\u003e Array of Char  (spaces indicated by char(96))\u003c/p\u003e\u003cp\u003e\u003cb\u003eScore:\u003c/b\u003e Numer of Elements in Array (including unused)\u003c/p\u003e\u003cp\u003eExample:\u003c/p\u003e\u003cp\u003edict={'abc' 'cat'}\u003c/p\u003e\u003cp\u003eOutput: \r\n['abc';'``a';'``t']\u003c/p\u003e\u003cpre class=\"language-matlab\"\u003eabc\r\n``a\r\n``t\r\n\u003c/pre\u003e\u003cp\u003eScore: 9\u003c/p\u003e\u003cp\u003eRelated Challenges:\u003c/p\u003e\u003cp\u003e1) \u003ca href = \"http://www.mathworks.com/matlabcentral/cody/problems/1533-criss-cross-verification-nhl\"\u003eVerify Criss-Cross\u003c/a\u003e\u003c/p\u003e\u003cp\u003e2) Create Criss-Cross dictionary from a matrix\u003c/p\u003e\u003cp\u003e3) Games Magazine Contest 8/31/2013\u003c/p\u003e","function_template":"function H=criss_cross(dict)\r\n H=[''];\r\nend","test_suite":"%%\r\nfeval(@assignin,'caller','score',625);\r\n%%\r\ndict={'avalanche'\r\n'bluejackets'\r\n'blackhawks'\r\n'blues'\r\n'bruins'\r\n'canadiens'\r\n'canucks'\r\n'capitals'\r\n'coyotes'\r\n'devils'\r\n'ducks'\r\n'flames'\r\n'flyers'\r\n'hurricanes'\r\n'islanders'\r\n'jets'\r\n'kings'\r\n'lightning'\r\n'mapleleafs'\r\n'oilers'\r\n'panthers'\r\n'penguins'\r\n'predators'\r\n'rangers'\r\n'redwings'\r\n'sabres'\r\n'senators'\r\n'sharks'\r\n'stars'\r\n'wild'};\r\n\r\nt1 = cputime;\r\nH=criss_cross(dict)\r\nfprintf('Elapsed Time %.2f\\n',cputime-t1)\r\nfprintf('size of H %i %i\\n',size(H));\r\nscore=prod(size(H)); % if valid\r\n\r\n% Perform Validation : words\r\n a=H;\r\n% Ned's\r\n    gridWords = {};\r\n    for i = 1:2\r\n        a = a';\r\n        for j = 1:size(a,1)\r\n            tk = regexp(a(j,:),'(\\w\\w+)','tokens');\r\n            gridWords = [gridWords tk];\r\n        end\r\n    end\r\n    dictFound = cell(length(gridWords),1);\r\n    for i = 1:length(gridWords)\r\n        dictFound{i} = gridWords{i}{1};\r\n    end\r\n    dictFound = sort(dictFound);\r\n    dictGiven = sort(dict);\r\nassert(isequal(dictGiven,dictFound),sprintf('Invalid/Missing words'))\r\n\r\n% Perform Validation: Connected\r\nAchar=H;\r\n m= (Achar-96);\r\n m(m\u003e0)=Inf;\r\n% expand m and encircle with 0\r\n [nr, nc]=size(m);\r\n m=[zeros(nr,1) m zeros(nr,1)];\r\n m=[zeros(1,nc+2); m; zeros(1,nc+2)];\r\n nr=size(m,1);\r\n off_vec=[-1 1 -nr nr];\r\n % Initialize start location\r\n ptr=find(m==Inf,1,'first');\r\n curval=1;\r\n m(ptr)=curval;\r\n \r\n while ~isempty(ptr) % adjacent expansion search sequence\r\n  curval=curval+1;\r\n  Moff_vec=repmat(ptr,1,4)+repmat(off_vec,size(ptr,1),1);\r\n  m(Moff_vec)=min(curval*ones(size(Moff_vec)), m(Moff_vec));\r\n  ptr=find(m==curval);\r\n end\r\n\r\ninvalid=any(m(:)==Inf); % Any unconnected from start point will be Inf\r\n\r\nassert(~invalid,sprintf('Not fully connected'))\r\n\r\nHscore=numel(H);\r\n\r\nfeval(@assignin,'caller','score',Hscore);","published":true,"deleted":false,"likes_count":0,"comments_count":0,"created_by":3097,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":3,"test_suite_updated_at":null,"rescore_all_solutions":false,"group_id":1,"created_at":"2013-06-08T22:55:40.000Z","updated_at":"2013-06-09T01:03:27.000Z","published_at":"2013-06-09T01:03:27.000Z","restored_at":null,"restored_by":null,"spam":false,"simulink":false,"admin_reviewed":false,"description_opc":"{\"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\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\"?\u003e\\n\u003cw:document xmlns:w=\\\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\\\"\u003e\u003cw:body\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eGiven the List of NHL Teams, fit all in a minimum area Criss-Cross with no invalid words, no duplications, and all connected.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:rPr\u003e\u003cw:b/\u003e\u003c/w:rPr\u003e\u003cw:t\u003eInput:\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e Dictionary (cell array)\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:rPr\u003e\u003cw:b/\u003e\u003c/w:rPr\u003e\u003cw:t\u003eOutput:\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e Array of Char (spaces indicated by char(96))\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:rPr\u003e\u003cw:b/\u003e\u003c/w:rPr\u003e\u003cw:t\u003eScore:\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e Numer of Elements in Array (including unused)\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eExample:\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003edict={'abc' 'cat'}\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eOutput: ['abc';'``a';'``t']\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"code\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e\u003c![CDATA[abc\\n``a\\n``t]]\u003e\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eScore: 9\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eRelated Challenges:\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e1)\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:hyperlink w:docLocation=\\\"http://www.mathworks.com/matlabcentral/cody/problems/1533-criss-cross-verification-nhl\\\"\u003e\u003cw:r\u003e\u003cw:t\u003eVerify Criss-Cross\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e2) Create Criss-Cross dictionary from a matrix\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e3) Games Magazine Contest 8/31/2013\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003c/w:body\u003e\u003c/w:document\u003e\"},{\"partUri\":\"/matlab/output.xml\",\"contentType\":\"text/xml\",\"content\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\" standalone=\\\"no\\\" ?\u003e\u003cembeddedOutputs\u003e\u003cmetaData\u003e\u003cevaluationState\u003emanual\u003c/evaluationState\u003e\u003clayoutState\u003ecode\u003c/layoutState\u003e\u003coutputStatus\u003eready\u003c/outputStatus\u003e\u003c/metaData\u003e\u003coutputArray type=\\\"array\\\"/\u003e\u003cregionArray type=\\\"array\\\"/\u003e\u003c/embeddedOutputs\u003e\"}]}"}],"problem_search":{"errors":[],"problems":[{"id":1631,"title":"Criss-Cross: NHL - Optimize Matrix Size","description":"Given the List of NHL Teams, fit all in a minimum area Criss-Cross with no invalid words, no duplications, and all connected.\r\n\r\n*Input:* Dictionary (cell array)\r\n\r\n*Output:* Array of Char  (spaces indicated by char(96))\r\n\r\n*Score:* Numer of Elements in Array (including unused)\r\n\r\nExample: \r\n\r\ndict={'abc' 'cat'}\r\n\r\nOutput: \r\n['abc';'``a';'``t']\r\n\r\n  abc\r\n  ``a\r\n  ``t\r\n\r\nScore: 9\r\n\r\nRelated Challenges:\r\n\r\n1) \u003chttp://www.mathworks.com/matlabcentral/cody/problems/1533-criss-cross-verification-nhl Verify Criss-Cross\u003e\r\n\r\n2) Create Criss-Cross dictionary from a matrix\r\n\r\n3) Games Magazine Contest 8/31/2013","description_html":"\u003cp\u003eGiven the List of NHL Teams, fit all in a minimum area Criss-Cross with no invalid words, no duplications, and all connected.\u003c/p\u003e\u003cp\u003e\u003cb\u003eInput:\u003c/b\u003e Dictionary (cell array)\u003c/p\u003e\u003cp\u003e\u003cb\u003eOutput:\u003c/b\u003e Array of Char  (spaces indicated by char(96))\u003c/p\u003e\u003cp\u003e\u003cb\u003eScore:\u003c/b\u003e Numer of Elements in Array (including unused)\u003c/p\u003e\u003cp\u003eExample:\u003c/p\u003e\u003cp\u003edict={'abc' 'cat'}\u003c/p\u003e\u003cp\u003eOutput: \r\n['abc';'``a';'``t']\u003c/p\u003e\u003cpre class=\"language-matlab\"\u003eabc\r\n``a\r\n``t\r\n\u003c/pre\u003e\u003cp\u003eScore: 9\u003c/p\u003e\u003cp\u003eRelated Challenges:\u003c/p\u003e\u003cp\u003e1) \u003ca href = \"http://www.mathworks.com/matlabcentral/cody/problems/1533-criss-cross-verification-nhl\"\u003eVerify Criss-Cross\u003c/a\u003e\u003c/p\u003e\u003cp\u003e2) Create Criss-Cross dictionary from a matrix\u003c/p\u003e\u003cp\u003e3) Games Magazine Contest 8/31/2013\u003c/p\u003e","function_template":"function H=criss_cross(dict)\r\n H=[''];\r\nend","test_suite":"%%\r\nfeval(@assignin,'caller','score',625);\r\n%%\r\ndict={'avalanche'\r\n'bluejackets'\r\n'blackhawks'\r\n'blues'\r\n'bruins'\r\n'canadiens'\r\n'canucks'\r\n'capitals'\r\n'coyotes'\r\n'devils'\r\n'ducks'\r\n'flames'\r\n'flyers'\r\n'hurricanes'\r\n'islanders'\r\n'jets'\r\n'kings'\r\n'lightning'\r\n'mapleleafs'\r\n'oilers'\r\n'panthers'\r\n'penguins'\r\n'predators'\r\n'rangers'\r\n'redwings'\r\n'sabres'\r\n'senators'\r\n'sharks'\r\n'stars'\r\n'wild'};\r\n\r\nt1 = cputime;\r\nH=criss_cross(dict)\r\nfprintf('Elapsed Time %.2f\\n',cputime-t1)\r\nfprintf('size of H %i %i\\n',size(H));\r\nscore=prod(size(H)); % if valid\r\n\r\n% Perform Validation : words\r\n a=H;\r\n% Ned's\r\n    gridWords = {};\r\n    for i = 1:2\r\n        a = a';\r\n        for j = 1:size(a,1)\r\n            tk = regexp(a(j,:),'(\\w\\w+)','tokens');\r\n            gridWords = [gridWords tk];\r\n        end\r\n    end\r\n    dictFound = cell(length(gridWords),1);\r\n    for i = 1:length(gridWords)\r\n        dictFound{i} = gridWords{i}{1};\r\n    end\r\n    dictFound = sort(dictFound);\r\n    dictGiven = sort(dict);\r\nassert(isequal(dictGiven,dictFound),sprintf('Invalid/Missing words'))\r\n\r\n% Perform Validation: Connected\r\nAchar=H;\r\n m= (Achar-96);\r\n m(m\u003e0)=Inf;\r\n% expand m and encircle with 0\r\n [nr, nc]=size(m);\r\n m=[zeros(nr,1) m zeros(nr,1)];\r\n m=[zeros(1,nc+2); m; zeros(1,nc+2)];\r\n nr=size(m,1);\r\n off_vec=[-1 1 -nr nr];\r\n % Initialize start location\r\n ptr=find(m==Inf,1,'first');\r\n curval=1;\r\n m(ptr)=curval;\r\n \r\n while ~isempty(ptr) % adjacent expansion search sequence\r\n  curval=curval+1;\r\n  Moff_vec=repmat(ptr,1,4)+repmat(off_vec,size(ptr,1),1);\r\n  m(Moff_vec)=min(curval*ones(size(Moff_vec)), m(Moff_vec));\r\n  ptr=find(m==curval);\r\n end\r\n\r\ninvalid=any(m(:)==Inf); % Any unconnected from start point will be Inf\r\n\r\nassert(~invalid,sprintf('Not fully connected'))\r\n\r\nHscore=numel(H);\r\n\r\nfeval(@assignin,'caller','score',Hscore);","published":true,"deleted":false,"likes_count":0,"comments_count":0,"created_by":3097,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":3,"test_suite_updated_at":null,"rescore_all_solutions":false,"group_id":1,"created_at":"2013-06-08T22:55:40.000Z","updated_at":"2013-06-09T01:03:27.000Z","published_at":"2013-06-09T01:03:27.000Z","restored_at":null,"restored_by":null,"spam":false,"simulink":false,"admin_reviewed":false,"description_opc":"{\"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\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\"?\u003e\\n\u003cw:document xmlns:w=\\\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\\\"\u003e\u003cw:body\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eGiven the List of NHL Teams, fit all in a minimum area Criss-Cross with no invalid words, no duplications, and all connected.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:rPr\u003e\u003cw:b/\u003e\u003c/w:rPr\u003e\u003cw:t\u003eInput:\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e Dictionary (cell array)\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:rPr\u003e\u003cw:b/\u003e\u003c/w:rPr\u003e\u003cw:t\u003eOutput:\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e Array of Char (spaces indicated by char(96))\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:rPr\u003e\u003cw:b/\u003e\u003c/w:rPr\u003e\u003cw:t\u003eScore:\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e Numer of Elements in Array (including unused)\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eExample:\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003edict={'abc' 'cat'}\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eOutput: ['abc';'``a';'``t']\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"code\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e\u003c![CDATA[abc\\n``a\\n``t]]\u003e\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eScore: 9\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eRelated Challenges:\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e1)\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:hyperlink w:docLocation=\\\"http://www.mathworks.com/matlabcentral/cody/problems/1533-criss-cross-verification-nhl\\\"\u003e\u003cw:r\u003e\u003cw:t\u003eVerify Criss-Cross\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e2) Create Criss-Cross dictionary from a matrix\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e3) Games Magazine Contest 8/31/2013\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003c/w:body\u003e\u003c/w:document\u003e\"},{\"partUri\":\"/matlab/output.xml\",\"contentType\":\"text/xml\",\"content\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\" standalone=\\\"no\\\" ?\u003e\u003cembeddedOutputs\u003e\u003cmetaData\u003e\u003cevaluationState\u003emanual\u003c/evaluationState\u003e\u003clayoutState\u003ecode\u003c/layoutState\u003e\u003coutputStatus\u003eready\u003c/outputStatus\u003e\u003c/metaData\u003e\u003coutputArray type=\\\"array\\\"/\u003e\u003cregionArray type=\\\"array\\\"/\u003e\u003c/embeddedOutputs\u003e\"}]}"}],"term":"tag:\"word fit\"","current_player_id":null,"fields":[{"name":"page","type":"integer","callback":null,"default":1,"directive":null,"facet":null,"facet_method":"and","operator":null,"param":null,"static":null,"prepend":true},{"name":"per_page","type":"integer","callback":null,"default":50,"directive":null,"facet":null,"facet_method":"and","operator":null,"param":null,"static":null,"prepend":true},{"name":"sort","type":"string","callback":null,"default":null,"directive":null,"facet":null,"facet_method":"and","operator":null,"param":null,"static":null,"prepend":true},{"name":"body","type":"text","callback":null,"default":"*:*","directive":null,"facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":false},{"name":"group","type":"string","callback":null,"default":null,"directive":"group","facet":true,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"difficulty_rating_bin","type":"string","callback":null,"default":null,"directive":"difficulty_rating_bin","facet":true,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"id","type":"integer","callback":null,"default":null,"directive":"id","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"tag","type":"string","callback":null,"default":null,"directive":"tag","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"product","type":"string","callback":null,"default":null,"directive":"product","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"created_at","type":"timeframe","callback":{},"default":null,"directive":"created_at","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"profile_id","type":"integer","callback":null,"default":null,"directive":"author_id","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"created_by","type":"string","callback":null,"default":null,"directive":"author","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"player_id","type":"integer","callback":null,"default":null,"directive":"solver_id","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"player","type":"string","callback":null,"default":null,"directive":"solver","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"solvers_count","type":"integer","callback":null,"default":null,"directive":"solvers_count","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"comments_count","type":"integer","callback":null,"default":null,"directive":"comments_count","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"likes_count","type":"integer","callback":null,"default":null,"directive":"likes_count","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"leader_id","type":"integer","callback":null,"default":null,"directive":"leader_id","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"leading_solution","type":"integer","callback":null,"default":null,"directive":"leading_solution","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true}],"filters":[{"name":"asset_type","type":"string","callback":null,"default":null,"directive":null,"facet":null,"facet_method":"and","operator":null,"param":null,"static":"\"cody:problem\"","prepend":true},{"name":"profile_id","type":"integer","callback":{},"default":null,"directive":null,"facet":null,"facet_method":"and","operator":null,"param":"author_id","static":null,"prepend":true}],"query":{"params":{"per_page":50,"term":"tag:\"word fit\"","current_player":null,"sort":"map(difficulty_value,0,0,999) asc"},"parser":"MathWorks::Search::Solr::QueryParser","directives":{"term":{"directives":{"tag":[["tag:\"word fit\"","","\"","word fit","\""]]}}},"facets":{"#\u003cMathWorks::Search::Field:0x00007ffbbd6502a0\u003e":null,"#\u003cMathWorks::Search::Field:0x00007ffbbd650200\u003e":null},"filters":{"#\u003cMathWorks::Search::Field:0x00007ffbbd66f8d0\u003e":"\"cody:problem\""},"fields":{"#\u003cMathWorks::Search::Field:0x00007ffbbd650520\u003e":1,"#\u003cMathWorks::Search::Field:0x00007ffbbd650480\u003e":50,"#\u003cMathWorks::Search::Field:0x00007ffbbd6503e0\u003e":"map(difficulty_value,0,0,999) asc","#\u003cMathWorks::Search::Field:0x00007ffbbd650340\u003e":"tag:\"word fit\""},"user_query":{"#\u003cMathWorks::Search::Field:0x00007ffbbd650340\u003e":"tag:\"word fit\""},"queried_facets":{}},"query_backend":{"connection":{"configuration":{"index_url":"http://index-op-v2/solr/","query_url":"http://search-op-v2/solr/","direct_access_index_urls":["http://index-op-v2/solr/"],"direct_access_query_urls":["http://search-op-v2/solr/"],"timeout":10,"vhost":"search","exchange":"search.topic","heartbeat":30,"pre_index_mode":false,"host":"rabbitmq-eks","port":5672,"username":"cody-search","password":"78X075ddcV44","virtual_host":"search","indexer":"amqp","http_logging":"true","core":"cody"},"query_connection":{"uri":"http://search-op-v2/solr/cody/","proxy":null,"connection":{"parallel_manager":null,"headers":{"User-Agent":"Faraday v1.0.1"},"params":{},"options":{"params_encoder":"Faraday::FlatParamsEncoder","proxy":null,"bind":null,"timeout":null,"open_timeout":null,"read_timeout":null,"write_timeout":null,"boundary":null,"oauth":null,"context":null,"on_data":null},"ssl":{"verify":true,"ca_file":null,"ca_path":null,"verify_mode":null,"cert_store":null,"client_cert":null,"client_key":null,"certificate":null,"private_key":null,"verify_depth":null,"version":null,"min_version":null,"max_version":null},"default_parallel_manager":null,"builder":{"adapter":{"name":"Faraday::Adapter::NetHttp","args":[],"block":null},"handlers":[{"name":"Faraday::Response::RaiseError","args":[],"block":null}],"app":{"app":{"ssl_cert_store":{"verify_callback":null,"error":null,"error_string":null,"chain":null,"time":null},"app":{},"connection_options":{},"config_block":null}}},"url_prefix":"http://search-op-v2/solr/cody/","manual_proxy":false,"proxy":null},"update_format":"RSolr::JSON::Generator","update_path":"update","options":{"url":"http://search-op-v2/solr/cody"}}},"query":{"params":{"per_page":50,"term":"tag:\"word fit\"","current_player":null,"sort":"map(difficulty_value,0,0,999) asc"},"parser":"MathWorks::Search::Solr::QueryParser","directives":{"term":{"directives":{"tag":[["tag:\"word fit\"","","\"","word fit","\""]]}}},"facets":{"#\u003cMathWorks::Search::Field:0x00007ffbbd6502a0\u003e":null,"#\u003cMathWorks::Search::Field:0x00007ffbbd650200\u003e":null},"filters":{"#\u003cMathWorks::Search::Field:0x00007ffbbd66f8d0\u003e":"\"cody:problem\""},"fields":{"#\u003cMathWorks::Search::Field:0x00007ffbbd650520\u003e":1,"#\u003cMathWorks::Search::Field:0x00007ffbbd650480\u003e":50,"#\u003cMathWorks::Search::Field:0x00007ffbbd6503e0\u003e":"map(difficulty_value,0,0,999) asc","#\u003cMathWorks::Search::Field:0x00007ffbbd650340\u003e":"tag:\"word fit\""},"user_query":{"#\u003cMathWorks::Search::Field:0x00007ffbbd650340\u003e":"tag:\"word fit\""},"queried_facets":{}},"options":{"fields":["id","difficulty_rating"]},"join":" "},"results":[{"id":1631,"difficulty_rating":"unrated"}]}}