{"group":{"id":1,"name":"Community","lockable":false,"created_at":"2012-01-18T18:02:15.000Z","updated_at":"2025-12-14T01:33:56.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":"2025-12-14T00: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":294,"title":"A stroll on the beach: finding a route round a connected region","description":"You are standing on the beach of an island, which you must explore by walking all the way round its coast. Each step is in one of the four directions north, south, east or west, and you must travel clockwise, keeping the sea on your left.\r\n\r\nThe island is represented by a \"blob\" of non-zero elements in an array, completely surrounded by zeros representing the sea. All the elements in the blob are 1, except for a single 2 giving your starting and finishing point. Each step takes you to one of the positions in the \u003chttp://en.wikipedia.org/wiki/Von_Neumann_neighborhood von Neumann neighbourhood\u003e of your current position. Your function must return your steps as a string of the characters N, E, S and W. (N is towards the top of the array as printed, E to the right, etc.) The route must visit every non-zero element that has a 0 as one of its nearest 8 neighbours, and it must not visit any other elements. An element may need to be visited more than once.\r\n\r\nThe start position will have a 0 as one its nearest 4 neighbours, and the direction of the first step from it will not be ambiguous.\r\n\r\nExamples:\r\n\r\n  Input array = [0 0 0 0 0 0\r\n                 0 2 1 1 0 0\r\n                 0 1 1 1 1 0\r\n                 0 0 0 0 0 0]\r\n\r\n        Route = EESEWWWN\r\n\r\n\r\n  Input array = [0 0 0 0\r\n                 0 1 1 0\r\n                 0 2 0 0\r\n                 0 0 0 0];\r\n\r\n        Route = NEWS\r\n\r\nThis is an example of finding a \u003chttp://en.wikipedia.org/wiki/Chain_code chain code\u003e description of a \u003chttp://en.wikipedia.org/wiki/Pixel_connectivity#4-connected 4-connected\u003e shape.\r\n\r\nThe reference solution has a size of 140.","description_html":"\u003cp\u003eYou are standing on the beach of an island, which you must explore by walking all the way round its coast. Each step is in one of the four directions north, south, east or west, and you must travel clockwise, keeping the sea on your left.\u003c/p\u003e\u003cp\u003eThe island is represented by a \"blob\" of non-zero elements in an array, completely surrounded by zeros representing the sea. All the elements in the blob are 1, except for a single 2 giving your starting and finishing point. Each step takes you to one of the positions in the \u003ca href=\"http://en.wikipedia.org/wiki/Von_Neumann_neighborhood\"\u003evon Neumann neighbourhood\u003c/a\u003e of your current position. Your function must return your steps as a string of the characters N, E, S and W. (N is towards the top of the array as printed, E to the right, etc.) The route must visit every non-zero element that has a 0 as one of its nearest 8 neighbours, and it must not visit any other elements. An element may need to be visited more than once.\u003c/p\u003e\u003cp\u003eThe start position will have a 0 as one its nearest 4 neighbours, and the direction of the first step from it will not be ambiguous.\u003c/p\u003e\u003cp\u003eExamples:\u003c/p\u003e\u003cpre class=\"language-matlab\"\u003eInput array = [0 0 0 0 0 0\r\n               0 2 1 1 0 0\r\n               0 1 1 1 1 0\r\n               0 0 0 0 0 0]\r\n\u003c/pre\u003e\u003cpre\u003e        Route = EESEWWWN\u003c/pre\u003e\u003cpre class=\"language-matlab\"\u003eInput array = [0 0 0 0\r\n               0 1 1 0\r\n               0 2 0 0\r\n               0 0 0 0];\r\n\u003c/pre\u003e\u003cpre\u003e        Route = NEWS\u003c/pre\u003e\u003cp\u003eThis is an example of finding a \u003ca href=\"http://en.wikipedia.org/wiki/Chain_code\"\u003echain code\u003c/a\u003e description of a \u003ca href=\"http://en.wikipedia.org/wiki/Pixel_connectivity#4-connected\"\u003e4-connected\u003c/a\u003e shape.\u003c/p\u003e\u003cp\u003eThe reference solution has a size of 140.\u003c/p\u003e","function_template":"function route = circumNavigate(b)\r\n  route = '';\r\nend","test_suite":"%%\r\nb = [0 0 0 0\r\n     0 1 2 0\r\n     0 0 0 0];\r\nroute_correct = 'WE';\r\nassert(isequal(circumNavigate(b),route_correct))\r\n%%\r\nb = [0 0 0 0 0 0\r\n     0 0 2 0 0 0\r\n     0 1 1 1 1 0\r\n     0 0 1 0 0 0\r\n     0 0 0 0 0 0];\r\nroute_correct = 'SEEWWSNWEN';\r\nassert(isequal(circumNavigate(b),route_correct))\r\n%%\r\nb = [0 0 0 0 0 0 0\r\n     0 1 2 0 1 1 0\r\n     0 1 1 1 1 1 0\r\n     0 0 0 1 0 0 0\r\n     0 0 0 0 0 0 0];\r\nroute_correct = 'SEENESWWSNWWNE';\r\nassert(isequal(circumNavigate(b),route_correct))\r\n%%\r\nb = [0 0 0 0 0 0 0\r\n     0 1 1 1 1 0 0\r\n     0 1 1 1 1 1 0\r\n     0 1 2 1 0 0 0\r\n     0 0 0 0 0 0 0];\r\nroute_correct = 'WNNEEESEWWSW';\r\nassert(isequal(circumNavigate(b),route_correct))\r\n\r\n","published":true,"deleted":false,"likes_count":1,"comments_count":1,"created_by":697,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":12,"test_suite_updated_at":"2012-02-09T10:29:58.000Z","rescore_all_solutions":false,"group_id":1,"created_at":"2012-02-09T10:04:20.000Z","updated_at":"2012-02-09T10:36:22.000Z","published_at":"2012-02-09T10:36:22.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\u003eYou are standing on the beach of an island, which you must explore by walking all the way round its coast. Each step is in one of the four directions north, south, east or west, and you must travel clockwise, keeping the sea on your left.\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\u003eThe island is represented by a \\\"blob\\\" of non-zero elements in an array, completely surrounded by zeros representing the sea. All the elements in the blob are 1, except for a single 2 giving your starting and finishing point. Each step takes you to one of the positions in the\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://en.wikipedia.org/wiki/Von_Neumann_neighborhood\\\"\u003e\u003cw:r\u003e\u003cw:t\u003evon Neumann neighbourhood\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e of your current position. Your function must return your steps as a string of the characters N, E, S and W. (N is towards the top of the array as printed, E to the right, etc.) The route must visit every non-zero element that has a 0 as one of its nearest 8 neighbours, and it must not visit any other elements. An element may need to be visited more than once.\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\u003eThe start position will have a 0 as one its nearest 4 neighbours, and the direction of the first step from it will not be ambiguous.\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\u003eExamples:\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[Input array = [0 0 0 0 0 0\\n               0 2 1 1 0 0\\n               0 1 1 1 1 0\\n               0 0 0 0 0 0]\\n\\n        Route = EESEWWWN\\n\\nInput array = [0 0 0 0\\n               0 1 1 0\\n               0 2 0 0\\n               0 0 0 0];\\n\\n        Route = NEWS]]\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\u003eThis is an example of finding a\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://en.wikipedia.org/wiki/Chain_code\\\"\u003e\u003cw:r\u003e\u003cw:t\u003echain code\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e description of a\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://en.wikipedia.org/wiki/Pixel_connectivity#4-connected\\\"\u003e\u003cw:r\u003e\u003cw:t\u003e4-connected\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e shape.\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\u003eThe reference solution has a size of 140.\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":294,"title":"A stroll on the beach: finding a route round a connected region","description":"You are standing on the beach of an island, which you must explore by walking all the way round its coast. Each step is in one of the four directions north, south, east or west, and you must travel clockwise, keeping the sea on your left.\r\n\r\nThe island is represented by a \"blob\" of non-zero elements in an array, completely surrounded by zeros representing the sea. All the elements in the blob are 1, except for a single 2 giving your starting and finishing point. Each step takes you to one of the positions in the \u003chttp://en.wikipedia.org/wiki/Von_Neumann_neighborhood von Neumann neighbourhood\u003e of your current position. Your function must return your steps as a string of the characters N, E, S and W. (N is towards the top of the array as printed, E to the right, etc.) The route must visit every non-zero element that has a 0 as one of its nearest 8 neighbours, and it must not visit any other elements. An element may need to be visited more than once.\r\n\r\nThe start position will have a 0 as one its nearest 4 neighbours, and the direction of the first step from it will not be ambiguous.\r\n\r\nExamples:\r\n\r\n  Input array = [0 0 0 0 0 0\r\n                 0 2 1 1 0 0\r\n                 0 1 1 1 1 0\r\n                 0 0 0 0 0 0]\r\n\r\n        Route = EESEWWWN\r\n\r\n\r\n  Input array = [0 0 0 0\r\n                 0 1 1 0\r\n                 0 2 0 0\r\n                 0 0 0 0];\r\n\r\n        Route = NEWS\r\n\r\nThis is an example of finding a \u003chttp://en.wikipedia.org/wiki/Chain_code chain code\u003e description of a \u003chttp://en.wikipedia.org/wiki/Pixel_connectivity#4-connected 4-connected\u003e shape.\r\n\r\nThe reference solution has a size of 140.","description_html":"\u003cp\u003eYou are standing on the beach of an island, which you must explore by walking all the way round its coast. Each step is in one of the four directions north, south, east or west, and you must travel clockwise, keeping the sea on your left.\u003c/p\u003e\u003cp\u003eThe island is represented by a \"blob\" of non-zero elements in an array, completely surrounded by zeros representing the sea. All the elements in the blob are 1, except for a single 2 giving your starting and finishing point. Each step takes you to one of the positions in the \u003ca href=\"http://en.wikipedia.org/wiki/Von_Neumann_neighborhood\"\u003evon Neumann neighbourhood\u003c/a\u003e of your current position. Your function must return your steps as a string of the characters N, E, S and W. (N is towards the top of the array as printed, E to the right, etc.) The route must visit every non-zero element that has a 0 as one of its nearest 8 neighbours, and it must not visit any other elements. An element may need to be visited more than once.\u003c/p\u003e\u003cp\u003eThe start position will have a 0 as one its nearest 4 neighbours, and the direction of the first step from it will not be ambiguous.\u003c/p\u003e\u003cp\u003eExamples:\u003c/p\u003e\u003cpre class=\"language-matlab\"\u003eInput array = [0 0 0 0 0 0\r\n               0 2 1 1 0 0\r\n               0 1 1 1 1 0\r\n               0 0 0 0 0 0]\r\n\u003c/pre\u003e\u003cpre\u003e        Route = EESEWWWN\u003c/pre\u003e\u003cpre class=\"language-matlab\"\u003eInput array = [0 0 0 0\r\n               0 1 1 0\r\n               0 2 0 0\r\n               0 0 0 0];\r\n\u003c/pre\u003e\u003cpre\u003e        Route = NEWS\u003c/pre\u003e\u003cp\u003eThis is an example of finding a \u003ca href=\"http://en.wikipedia.org/wiki/Chain_code\"\u003echain code\u003c/a\u003e description of a \u003ca href=\"http://en.wikipedia.org/wiki/Pixel_connectivity#4-connected\"\u003e4-connected\u003c/a\u003e shape.\u003c/p\u003e\u003cp\u003eThe reference solution has a size of 140.\u003c/p\u003e","function_template":"function route = circumNavigate(b)\r\n  route = '';\r\nend","test_suite":"%%\r\nb = [0 0 0 0\r\n     0 1 2 0\r\n     0 0 0 0];\r\nroute_correct = 'WE';\r\nassert(isequal(circumNavigate(b),route_correct))\r\n%%\r\nb = [0 0 0 0 0 0\r\n     0 0 2 0 0 0\r\n     0 1 1 1 1 0\r\n     0 0 1 0 0 0\r\n     0 0 0 0 0 0];\r\nroute_correct = 'SEEWWSNWEN';\r\nassert(isequal(circumNavigate(b),route_correct))\r\n%%\r\nb = [0 0 0 0 0 0 0\r\n     0 1 2 0 1 1 0\r\n     0 1 1 1 1 1 0\r\n     0 0 0 1 0 0 0\r\n     0 0 0 0 0 0 0];\r\nroute_correct = 'SEENESWWSNWWNE';\r\nassert(isequal(circumNavigate(b),route_correct))\r\n%%\r\nb = [0 0 0 0 0 0 0\r\n     0 1 1 1 1 0 0\r\n     0 1 1 1 1 1 0\r\n     0 1 2 1 0 0 0\r\n     0 0 0 0 0 0 0];\r\nroute_correct = 'WNNEEESEWWSW';\r\nassert(isequal(circumNavigate(b),route_correct))\r\n\r\n","published":true,"deleted":false,"likes_count":1,"comments_count":1,"created_by":697,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":12,"test_suite_updated_at":"2012-02-09T10:29:58.000Z","rescore_all_solutions":false,"group_id":1,"created_at":"2012-02-09T10:04:20.000Z","updated_at":"2012-02-09T10:36:22.000Z","published_at":"2012-02-09T10:36:22.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\u003eYou are standing on the beach of an island, which you must explore by walking all the way round its coast. Each step is in one of the four directions north, south, east or west, and you must travel clockwise, keeping the sea on your left.\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\u003eThe island is represented by a \\\"blob\\\" of non-zero elements in an array, completely surrounded by zeros representing the sea. All the elements in the blob are 1, except for a single 2 giving your starting and finishing point. Each step takes you to one of the positions in the\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://en.wikipedia.org/wiki/Von_Neumann_neighborhood\\\"\u003e\u003cw:r\u003e\u003cw:t\u003evon Neumann neighbourhood\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e of your current position. Your function must return your steps as a string of the characters N, E, S and W. (N is towards the top of the array as printed, E to the right, etc.) The route must visit every non-zero element that has a 0 as one of its nearest 8 neighbours, and it must not visit any other elements. An element may need to be visited more than once.\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\u003eThe start position will have a 0 as one its nearest 4 neighbours, and the direction of the first step from it will not be ambiguous.\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\u003eExamples:\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[Input array = [0 0 0 0 0 0\\n               0 2 1 1 0 0\\n               0 1 1 1 1 0\\n               0 0 0 0 0 0]\\n\\n        Route = EESEWWWN\\n\\nInput array = [0 0 0 0\\n               0 1 1 0\\n               0 2 0 0\\n               0 0 0 0];\\n\\n        Route = NEWS]]\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\u003eThis is an example of finding a\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://en.wikipedia.org/wiki/Chain_code\\\"\u003e\u003cw:r\u003e\u003cw:t\u003echain code\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e description of a\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://en.wikipedia.org/wiki/Pixel_connectivity#4-connected\\\"\u003e\u003cw:r\u003e\u003cw:t\u003e4-connected\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e shape.\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\u003eThe reference solution has a size of 140.\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:\"connected region\"","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:\"connected region\"","current_player":null,"sort":"map(difficulty_value,0,0,999) asc"},"parser":"MathWorks::Search::Solr::QueryParser","directives":{"term":{"directives":{"tag":[["tag:\"connected region\"","","\"","connected region","\""]]}}},"facets":{"#\u003cMathWorks::Search::Field:0x00007f102a7c7d10\u003e":null,"#\u003cMathWorks::Search::Field:0x00007f102a7c7c70\u003e":null},"filters":{"#\u003cMathWorks::Search::Field:0x00007f102a7c73b0\u003e":"\"cody:problem\""},"fields":{"#\u003cMathWorks::Search::Field:0x00007f102a7c7f90\u003e":1,"#\u003cMathWorks::Search::Field:0x00007f102a7c7ef0\u003e":50,"#\u003cMathWorks::Search::Field:0x00007f102a7c7e50\u003e":"map(difficulty_value,0,0,999) asc","#\u003cMathWorks::Search::Field:0x00007f102a7c7db0\u003e":"tag:\"connected region\""},"user_query":{"#\u003cMathWorks::Search::Field:0x00007f102a7c7db0\u003e":"tag:\"connected region\""},"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":"search","password":"J3bGPZzQ7asjJcCk","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:\"connected region\"","current_player":null,"sort":"map(difficulty_value,0,0,999) asc"},"parser":"MathWorks::Search::Solr::QueryParser","directives":{"term":{"directives":{"tag":[["tag:\"connected region\"","","\"","connected region","\""]]}}},"facets":{"#\u003cMathWorks::Search::Field:0x00007f102a7c7d10\u003e":null,"#\u003cMathWorks::Search::Field:0x00007f102a7c7c70\u003e":null},"filters":{"#\u003cMathWorks::Search::Field:0x00007f102a7c73b0\u003e":"\"cody:problem\""},"fields":{"#\u003cMathWorks::Search::Field:0x00007f102a7c7f90\u003e":1,"#\u003cMathWorks::Search::Field:0x00007f102a7c7ef0\u003e":50,"#\u003cMathWorks::Search::Field:0x00007f102a7c7e50\u003e":"map(difficulty_value,0,0,999) asc","#\u003cMathWorks::Search::Field:0x00007f102a7c7db0\u003e":"tag:\"connected region\""},"user_query":{"#\u003cMathWorks::Search::Field:0x00007f102a7c7db0\u003e":"tag:\"connected region\""},"queried_facets":{}},"options":{"fields":["id","difficulty_rating"]},"join":" "},"results":[{"id":294,"difficulty_rating":"medium"}]}}