{"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":186,"title":"The Tower of Hanoi ","description":"In the \u003chttp://en.wikipedia.org/wiki/Tower_of_Hanoi Tower of Hanoi problem\u003e with 3 rods (1, 2 \u0026 3), the goal is to move a tower of disks from rod #1 to rod #2.\r\nYou can move disks only one by one, on the rods.\r\nYou can't put a disk on a smaller one.\r\n\r\nAt the beginning, all disks are on rod #1, biggest at the bottom, smallest at the top.\r\n\r\nGive the number of moves necessary to solve the problem.","description_html":"\u003cp\u003eIn the \u003ca href = \"http://en.wikipedia.org/wiki/Tower_of_Hanoi\"\u003eTower of Hanoi problem\u003c/a\u003e with 3 rods (1, 2 \u0026 3), the goal is to move a tower of disks from rod #1 to rod #2.\r\nYou can move disks only one by one, on the rods.\r\nYou can't put a disk on a smaller one.\u003c/p\u003e\u003cp\u003eAt the beginning, all disks are on rod #1, biggest at the bottom, smallest at the top.\u003c/p\u003e\u003cp\u003eGive the number of moves necessary to solve the problem.\u003c/p\u003e","function_template":"function y = your_fcn_name(n)\r\n  y = 4;\r\nend","test_suite":"%%\r\nn = 1;\r\ny_correct = 1;\r\nassert(isequal(your_fcn_name(n),y_correct))\r\n%%\r\nn = 2;\r\ny_correct = 3;\r\nassert(isequal(your_fcn_name(n),y_correct))\r\n%%\r\nn = 3;\r\ny_correct = 7;\r\nassert(isequal(your_fcn_name(n),y_correct))\r\n%%\r\nn = 4;\r\nlol_correct = 15;\r\nassert(isequal(your_fcn_name(n),lol_correct))\r\n%%\r\nn = 5;\r\ny_correct = 31;\r\nassert(isequal(your_fcn_name(n),y_correct))\r\n\r\n%%\r\nn = 6;\r\ny_correct = 63;\r\nassert(isequal(your_fcn_name(n),y_correct))","published":true,"deleted":false,"likes_count":5,"comments_count":0,"created_by":659,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":390,"test_suite_updated_at":"2012-01-31T00:18:45.000Z","rescore_all_solutions":false,"group_id":1,"created_at":"2012-01-30T23:38:24.000Z","updated_at":"2026-03-17T13:03:03.000Z","published_at":"2012-01-31T00:18:45.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\u003eIn 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/Tower_of_Hanoi\\\"\u003e\u003cw:r\u003e\u003cw:t\u003eTower of Hanoi problem\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e with 3 rods (1, 2 \u0026amp; 3), the goal is to move a tower of disks from rod #1 to rod #2. You can move disks only one by one, on the rods. You can't put a disk on a smaller one.\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\u003eAt the beginning, all disks are on rod #1, biggest at the bottom, smallest at the top.\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\u003eGive the number of moves necessary to solve the problem.\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\"}]}"},{"id":199,"title":"hanoi towers II","description":"with 3 rods (1,2 \u0026 3), the goal is to move a tower of n disks from rod #1 to rod #3.\r\nYou can move disks only one by one, on the rods.\r\nYou can't put a disk on a smaller one.\r\n\r\nAt the beginning, all disks are on rod #1, biggest at the bottom, smallest at the top.\r\n\r\nGive the smallest sequence of unused rods for a n disks Hanoi tower problem.","description_html":"\u003cp\u003ewith 3 rods (1,2 \u0026 3), the goal is to move a tower of n disks from rod #1 to rod #3.\r\nYou can move disks only one by one, on the rods.\r\nYou can't put a disk on a smaller one.\u003c/p\u003e\u003cp\u003eAt the beginning, all disks are on rod #1, biggest at the bottom, smallest at the top.\u003c/p\u003e\u003cp\u003eGive the smallest sequence of unused rods for a n disks Hanoi tower problem.\u003c/p\u003e","function_template":"function mytry = unHanoingProblem(n)\r\n  mytry = [2];\r\nend","test_suite":"%%\r\nn = 1;\r\ny_correct = [2];\r\nassert(isequal(unHanoingProblem(n),y_correct))\r\n\r\n%%\r\nn = 3;\r\ny_correct = [1 3 3 7];\r\nassert(isequal(unHanoingProblem(3),[2 3 1 2 3 1 2]))\r\n\r\n%%\r\nn = 6;\r\ny_correct = [2 3 1 2 3 1 2];\r\nassert(isequal(unHanoingProblem(n),[3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1]))\r\n\r\n","published":true,"deleted":false,"likes_count":2,"comments_count":1,"created_by":659,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":80,"test_suite_updated_at":"2012-01-31T16:58:14.000Z","rescore_all_solutions":false,"group_id":1,"created_at":"2012-01-31T16:58:14.000Z","updated_at":"2026-02-15T07:05:56.000Z","published_at":"2012-01-31T16:59:18.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\",\"relationshipId\":\"rId1\",\"target\":\"/matlab/document.xml\"},{\"relationshipType\":\"http://schemas.mathworks.com/matlab/code/2013/relationships/output\",\"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\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\u003ewith 3 rods (1,2 \u0026amp; 3), the goal is to move a tower of n disks from rod #1 to rod #3. You can move disks only one by one, on the rods. You can't put a disk on a smaller one.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eAt the beginning, all disks are on rod #1, biggest at the bottom, smallest at the top.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eGive the smallest sequence of unused rods for a n disks Hanoi tower problem.\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":186,"title":"The Tower of Hanoi ","description":"In the \u003chttp://en.wikipedia.org/wiki/Tower_of_Hanoi Tower of Hanoi problem\u003e with 3 rods (1, 2 \u0026 3), the goal is to move a tower of disks from rod #1 to rod #2.\r\nYou can move disks only one by one, on the rods.\r\nYou can't put a disk on a smaller one.\r\n\r\nAt the beginning, all disks are on rod #1, biggest at the bottom, smallest at the top.\r\n\r\nGive the number of moves necessary to solve the problem.","description_html":"\u003cp\u003eIn the \u003ca href = \"http://en.wikipedia.org/wiki/Tower_of_Hanoi\"\u003eTower of Hanoi problem\u003c/a\u003e with 3 rods (1, 2 \u0026 3), the goal is to move a tower of disks from rod #1 to rod #2.\r\nYou can move disks only one by one, on the rods.\r\nYou can't put a disk on a smaller one.\u003c/p\u003e\u003cp\u003eAt the beginning, all disks are on rod #1, biggest at the bottom, smallest at the top.\u003c/p\u003e\u003cp\u003eGive the number of moves necessary to solve the problem.\u003c/p\u003e","function_template":"function y = your_fcn_name(n)\r\n  y = 4;\r\nend","test_suite":"%%\r\nn = 1;\r\ny_correct = 1;\r\nassert(isequal(your_fcn_name(n),y_correct))\r\n%%\r\nn = 2;\r\ny_correct = 3;\r\nassert(isequal(your_fcn_name(n),y_correct))\r\n%%\r\nn = 3;\r\ny_correct = 7;\r\nassert(isequal(your_fcn_name(n),y_correct))\r\n%%\r\nn = 4;\r\nlol_correct = 15;\r\nassert(isequal(your_fcn_name(n),lol_correct))\r\n%%\r\nn = 5;\r\ny_correct = 31;\r\nassert(isequal(your_fcn_name(n),y_correct))\r\n\r\n%%\r\nn = 6;\r\ny_correct = 63;\r\nassert(isequal(your_fcn_name(n),y_correct))","published":true,"deleted":false,"likes_count":5,"comments_count":0,"created_by":659,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":390,"test_suite_updated_at":"2012-01-31T00:18:45.000Z","rescore_all_solutions":false,"group_id":1,"created_at":"2012-01-30T23:38:24.000Z","updated_at":"2026-03-17T13:03:03.000Z","published_at":"2012-01-31T00:18:45.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\u003eIn 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/Tower_of_Hanoi\\\"\u003e\u003cw:r\u003e\u003cw:t\u003eTower of Hanoi problem\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e with 3 rods (1, 2 \u0026amp; 3), the goal is to move a tower of disks from rod #1 to rod #2. You can move disks only one by one, on the rods. You can't put a disk on a smaller one.\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\u003eAt the beginning, all disks are on rod #1, biggest at the bottom, smallest at the top.\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\u003eGive the number of moves necessary to solve the problem.\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\"}]}"},{"id":199,"title":"hanoi towers II","description":"with 3 rods (1,2 \u0026 3), the goal is to move a tower of n disks from rod #1 to rod #3.\r\nYou can move disks only one by one, on the rods.\r\nYou can't put a disk on a smaller one.\r\n\r\nAt the beginning, all disks are on rod #1, biggest at the bottom, smallest at the top.\r\n\r\nGive the smallest sequence of unused rods for a n disks Hanoi tower problem.","description_html":"\u003cp\u003ewith 3 rods (1,2 \u0026 3), the goal is to move a tower of n disks from rod #1 to rod #3.\r\nYou can move disks only one by one, on the rods.\r\nYou can't put a disk on a smaller one.\u003c/p\u003e\u003cp\u003eAt the beginning, all disks are on rod #1, biggest at the bottom, smallest at the top.\u003c/p\u003e\u003cp\u003eGive the smallest sequence of unused rods for a n disks Hanoi tower problem.\u003c/p\u003e","function_template":"function mytry = unHanoingProblem(n)\r\n  mytry = [2];\r\nend","test_suite":"%%\r\nn = 1;\r\ny_correct = [2];\r\nassert(isequal(unHanoingProblem(n),y_correct))\r\n\r\n%%\r\nn = 3;\r\ny_correct = [1 3 3 7];\r\nassert(isequal(unHanoingProblem(3),[2 3 1 2 3 1 2]))\r\n\r\n%%\r\nn = 6;\r\ny_correct = [2 3 1 2 3 1 2];\r\nassert(isequal(unHanoingProblem(n),[3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1 3 2 1]))\r\n\r\n","published":true,"deleted":false,"likes_count":2,"comments_count":1,"created_by":659,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":80,"test_suite_updated_at":"2012-01-31T16:58:14.000Z","rescore_all_solutions":false,"group_id":1,"created_at":"2012-01-31T16:58:14.000Z","updated_at":"2026-02-15T07:05:56.000Z","published_at":"2012-01-31T16:59:18.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\",\"relationshipId\":\"rId1\",\"target\":\"/matlab/document.xml\"},{\"relationshipType\":\"http://schemas.mathworks.com/matlab/code/2013/relationships/output\",\"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\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\u003ewith 3 rods (1,2 \u0026amp; 3), the goal is to move a tower of n disks from rod #1 to rod #3. You can move disks only one by one, on the rods. You can't put a disk on a smaller one.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eAt the beginning, all disks are on rod #1, biggest at the bottom, smallest at the top.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eGive the smallest sequence of unused rods for a n disks Hanoi tower problem.\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:\"hanoi\"","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:\"hanoi\"","current_player":null,"sort":"map(difficulty_value,0,0,999) asc"},"parser":"MathWorks::Search::Solr::QueryParser","directives":{"term":{"directives":{"tag":[["tag:\"hanoi\"","","\"","hanoi","\""]]}}},"facets":{"#\u003cMathWorks::Search::Field:0x00007f74d9d2f1e0\u003e":null,"#\u003cMathWorks::Search::Field:0x00007f74d9d2f140\u003e":null},"filters":{"#\u003cMathWorks::Search::Field:0x00007f74d9d2e380\u003e":"\"cody:problem\""},"fields":{"#\u003cMathWorks::Search::Field:0x00007f74d9d2f500\u003e":1,"#\u003cMathWorks::Search::Field:0x00007f74d9d2f460\u003e":50,"#\u003cMathWorks::Search::Field:0x00007f74d9d2f3c0\u003e":"map(difficulty_value,0,0,999) asc","#\u003cMathWorks::Search::Field:0x00007f74d9d2f280\u003e":"tag:\"hanoi\""},"user_query":{"#\u003cMathWorks::Search::Field:0x00007f74d9d2f280\u003e":"tag:\"hanoi\""},"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:\"hanoi\"","current_player":null,"sort":"map(difficulty_value,0,0,999) asc"},"parser":"MathWorks::Search::Solr::QueryParser","directives":{"term":{"directives":{"tag":[["tag:\"hanoi\"","","\"","hanoi","\""]]}}},"facets":{"#\u003cMathWorks::Search::Field:0x00007f74d9d2f1e0\u003e":null,"#\u003cMathWorks::Search::Field:0x00007f74d9d2f140\u003e":null},"filters":{"#\u003cMathWorks::Search::Field:0x00007f74d9d2e380\u003e":"\"cody:problem\""},"fields":{"#\u003cMathWorks::Search::Field:0x00007f74d9d2f500\u003e":1,"#\u003cMathWorks::Search::Field:0x00007f74d9d2f460\u003e":50,"#\u003cMathWorks::Search::Field:0x00007f74d9d2f3c0\u003e":"map(difficulty_value,0,0,999) asc","#\u003cMathWorks::Search::Field:0x00007f74d9d2f280\u003e":"tag:\"hanoi\""},"user_query":{"#\u003cMathWorks::Search::Field:0x00007f74d9d2f280\u003e":"tag:\"hanoi\""},"queried_facets":{}},"options":{"fields":["id","difficulty_rating"]},"join":" "},"results":[{"id":186,"difficulty_rating":"easy-medium"},{"id":199,"difficulty_rating":"medium"}]}}