{"group":{"id":1,"name":"Community","lockable":false,"created_at":"2012-01-18T18:02:15.000Z","updated_at":"2026-05-26T00:16:20.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-05-26T00: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":392,"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-05-04T21:43:12.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":81,"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-04-21T07:39:02.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":{"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":392,"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-05-04T21:43:12.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":81,"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-04-21T07:39:02.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\"}]}"}],"errors":[],"facets":[[{"value":"Board Games I","count":2,"selected":false}],[{"value":"medium","count":2,"selected":false}]],"term":"tag:\"hanoi\"","page":1,"per_page":50,"sort":"map(difficulty_value,0,0,999) asc"}}