{"group":{"id":1,"name":"Community","lockable":false,"created_at":"2012-01-18T18:02:15.000Z","updated_at":"2026-04-06T14:01:22.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-06T00: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":1133,"title":"Go-style solver","description":"Consider a variation of the game Go where one player has gone ahead and placed several pieces all at once. Assuming that the second player also gets to place several pieces at once, find the minimum number of pieces that the second player needs to place in order to capture all of the pieces placed by the first player.\r\n\r\nThe first player's pieces will be represented by ones and the empty spaces will be represented by zeros.\r\n\r\nTo capture a piece, it and every piece that touches it need to be surrounded horizontally and vertically. The board won't necessarily be square. If the first player filled the entire board, return 0. \r\n\r\nSo for the board:\r\n\r\n  1 0 0 1\r\n0 0 0 1\r\n0 0 1 0\r\n\r\n\r\nThe resulting board, with the fewest pieces required, would look like\r\n\r\n  1 2 2 1\r\n2 0 2 1\r\n0 2 1 2\r\n\r\nand your program would return 6","description_html":"\u003cp\u003eConsider a variation of the game Go where one player has gone ahead and placed several pieces all at once. Assuming that the second player also gets to place several pieces at once, find the minimum number of pieces that the second player needs to place in order to capture all of the pieces placed by the first player.\u003c/p\u003e\u003cp\u003eThe first player's pieces will be represented by ones and the empty spaces will be represented by zeros.\u003c/p\u003e\u003cp\u003eTo capture a piece, it and every piece that touches it need to be surrounded horizontally and vertically. The board won't necessarily be square. If the first player filled the entire board, return 0.\u003c/p\u003e\u003cp\u003eSo for the board:\u003c/p\u003e\u003cpre class=\"language-matlab\"\u003e1 0 0 1\r\n0 0 0 1\r\n0 0 1 0\r\n\u003c/pre\u003e\u003cp\u003eThe resulting board, with the fewest pieces required, would look like\u003c/p\u003e\u003cpre class=\"language-matlab\"\u003e1 2 2 1\r\n2 0 2 1\r\n0 2 1 2\r\n\u003c/pre\u003e\u003cp\u003eand your program would return 6\u003c/p\u003e","function_template":"function number_of_pieces = taking_liberties(board)\r\n  number_of_pieces=3;\r\nend","test_suite":"%%\r\nboard=[1 0 0 1; 0 0 0 1; 0 0 1 0];\r\ny_correct=6;\r\nassert(isequal(taking_liberties(board),y_correct))\r\n\r\n\r\n%%\r\nboard=eye(7);\r\ny_correct=12;\r\nassert(isequal(taking_liberties(board),y_correct))\r\n\r\n%%\r\nboard=double(magic(4)\u003e12);\r\ny_correct=8;\r\nassert(isequal(taking_liberties(board),y_correct))\r\n\r\n%%\r\nboard=double(hadamard(8)\u003c0);\r\ny_correct=29;\r\nassert(isequal(taking_liberties(board),y_correct))\r\n\r\n%%\r\nboard=ones(4);\r\ny_correct=0;\r\nassert(isequal(taking_liberties(board),y_correct))\r\n\r\n%%\r\nboard=vertcat(eye(5),[1 0 1 0 1]);\r\ny_correct=12;\r\nassert(isequal(taking_liberties(board),y_correct))\r\n","published":true,"deleted":false,"likes_count":1,"comments_count":0,"created_by":5065,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":43,"test_suite_updated_at":null,"rescore_all_solutions":false,"group_id":1,"created_at":"2012-12-21T21:55:47.000Z","updated_at":"2026-03-30T19:01:12.000Z","published_at":"2012-12-21T22:04:25.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\u003eConsider a variation of the game Go where one player has gone ahead and placed several pieces all at once. Assuming that the second player also gets to place several pieces at once, find the minimum number of pieces that the second player needs to place in order to capture all of the pieces placed by the first player.\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 first player's pieces will be represented by ones and the empty spaces will be represented by zeros.\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\u003eTo capture a piece, it and every piece that touches it need to be surrounded horizontally and vertically. The board won't necessarily be square. If the first player filled the entire board, return 0.\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\u003eSo for the board:\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[1 0 0 1\\n0 0 0 1\\n0 0 1 0]]\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\u003eThe resulting board, with the fewest pieces required, would look like\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[1 2 2 1\\n2 0 2 1\\n0 2 1 2]]\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\u003eand your program would return 6\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":1133,"title":"Go-style solver","description":"Consider a variation of the game Go where one player has gone ahead and placed several pieces all at once. Assuming that the second player also gets to place several pieces at once, find the minimum number of pieces that the second player needs to place in order to capture all of the pieces placed by the first player.\r\n\r\nThe first player's pieces will be represented by ones and the empty spaces will be represented by zeros.\r\n\r\nTo capture a piece, it and every piece that touches it need to be surrounded horizontally and vertically. The board won't necessarily be square. If the first player filled the entire board, return 0. \r\n\r\nSo for the board:\r\n\r\n  1 0 0 1\r\n0 0 0 1\r\n0 0 1 0\r\n\r\n\r\nThe resulting board, with the fewest pieces required, would look like\r\n\r\n  1 2 2 1\r\n2 0 2 1\r\n0 2 1 2\r\n\r\nand your program would return 6","description_html":"\u003cp\u003eConsider a variation of the game Go where one player has gone ahead and placed several pieces all at once. Assuming that the second player also gets to place several pieces at once, find the minimum number of pieces that the second player needs to place in order to capture all of the pieces placed by the first player.\u003c/p\u003e\u003cp\u003eThe first player's pieces will be represented by ones and the empty spaces will be represented by zeros.\u003c/p\u003e\u003cp\u003eTo capture a piece, it and every piece that touches it need to be surrounded horizontally and vertically. The board won't necessarily be square. If the first player filled the entire board, return 0.\u003c/p\u003e\u003cp\u003eSo for the board:\u003c/p\u003e\u003cpre class=\"language-matlab\"\u003e1 0 0 1\r\n0 0 0 1\r\n0 0 1 0\r\n\u003c/pre\u003e\u003cp\u003eThe resulting board, with the fewest pieces required, would look like\u003c/p\u003e\u003cpre class=\"language-matlab\"\u003e1 2 2 1\r\n2 0 2 1\r\n0 2 1 2\r\n\u003c/pre\u003e\u003cp\u003eand your program would return 6\u003c/p\u003e","function_template":"function number_of_pieces = taking_liberties(board)\r\n  number_of_pieces=3;\r\nend","test_suite":"%%\r\nboard=[1 0 0 1; 0 0 0 1; 0 0 1 0];\r\ny_correct=6;\r\nassert(isequal(taking_liberties(board),y_correct))\r\n\r\n\r\n%%\r\nboard=eye(7);\r\ny_correct=12;\r\nassert(isequal(taking_liberties(board),y_correct))\r\n\r\n%%\r\nboard=double(magic(4)\u003e12);\r\ny_correct=8;\r\nassert(isequal(taking_liberties(board),y_correct))\r\n\r\n%%\r\nboard=double(hadamard(8)\u003c0);\r\ny_correct=29;\r\nassert(isequal(taking_liberties(board),y_correct))\r\n\r\n%%\r\nboard=ones(4);\r\ny_correct=0;\r\nassert(isequal(taking_liberties(board),y_correct))\r\n\r\n%%\r\nboard=vertcat(eye(5),[1 0 1 0 1]);\r\ny_correct=12;\r\nassert(isequal(taking_liberties(board),y_correct))\r\n","published":true,"deleted":false,"likes_count":1,"comments_count":0,"created_by":5065,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":43,"test_suite_updated_at":null,"rescore_all_solutions":false,"group_id":1,"created_at":"2012-12-21T21:55:47.000Z","updated_at":"2026-03-30T19:01:12.000Z","published_at":"2012-12-21T22:04:25.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\u003eConsider a variation of the game Go where one player has gone ahead and placed several pieces all at once. Assuming that the second player also gets to place several pieces at once, find the minimum number of pieces that the second player needs to place in order to capture all of the pieces placed by the first player.\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 first player's pieces will be represented by ones and the empty spaces will be represented by zeros.\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\u003eTo capture a piece, it and every piece that touches it need to be surrounded horizontally and vertically. The board won't necessarily be square. If the first player filled the entire board, return 0.\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\u003eSo for the board:\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[1 0 0 1\\n0 0 0 1\\n0 0 1 0]]\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\u003eThe resulting board, with the fewest pieces required, would look like\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[1 2 2 1\\n2 0 2 1\\n0 2 1 2]]\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\u003eand your program would return 6\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:\"go\"","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:\"go\"","current_player":null,"sort":"map(difficulty_value,0,0,999) asc"},"parser":"MathWorks::Search::Solr::QueryParser","directives":{"term":{"directives":{"tag":[["tag:\"go\"","","\"","go","\""]]}}},"facets":{"#\u003cMathWorks::Search::Field:0x00007f0f13c43ca8\u003e":null,"#\u003cMathWorks::Search::Field:0x00007f0f13c43c08\u003e":null},"filters":{"#\u003cMathWorks::Search::Field:0x00007f0f13c430c8\u003e":"\"cody:problem\""},"fields":{"#\u003cMathWorks::Search::Field:0x00007f0f13c43f28\u003e":1,"#\u003cMathWorks::Search::Field:0x00007f0f13c43e88\u003e":50,"#\u003cMathWorks::Search::Field:0x00007f0f13c43de8\u003e":"map(difficulty_value,0,0,999) asc","#\u003cMathWorks::Search::Field:0x00007f0f13c43d48\u003e":"tag:\"go\""},"user_query":{"#\u003cMathWorks::Search::Field:0x00007f0f13c43d48\u003e":"tag:\"go\""},"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:\"go\"","current_player":null,"sort":"map(difficulty_value,0,0,999) asc"},"parser":"MathWorks::Search::Solr::QueryParser","directives":{"term":{"directives":{"tag":[["tag:\"go\"","","\"","go","\""]]}}},"facets":{"#\u003cMathWorks::Search::Field:0x00007f0f13c43ca8\u003e":null,"#\u003cMathWorks::Search::Field:0x00007f0f13c43c08\u003e":null},"filters":{"#\u003cMathWorks::Search::Field:0x00007f0f13c430c8\u003e":"\"cody:problem\""},"fields":{"#\u003cMathWorks::Search::Field:0x00007f0f13c43f28\u003e":1,"#\u003cMathWorks::Search::Field:0x00007f0f13c43e88\u003e":50,"#\u003cMathWorks::Search::Field:0x00007f0f13c43de8\u003e":"map(difficulty_value,0,0,999) asc","#\u003cMathWorks::Search::Field:0x00007f0f13c43d48\u003e":"tag:\"go\""},"user_query":{"#\u003cMathWorks::Search::Field:0x00007f0f13c43d48\u003e":"tag:\"go\""},"queried_facets":{}},"options":{"fields":["id","difficulty_rating"]},"join":" "},"results":[{"id":1133,"difficulty_rating":"easy-medium"}]}}