{"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":44711,"title":"Toads and Frogs Puzzle 2","description":"On a two-dimensional board with 2n + 1 rows and 2n + 1 columns, all (2n + 1)^2 positions of the board, except the central one, are occupied by toads (T) and frogs (F), as follows. \r\n\r\nIn the first n rows, the first n + 1 positions are occupied by toads followed by n frogs. In row n + 1, the first n positions are occupied by toads followed by one vacant position (X) followed by n toads. In the last n rows, the first n positions are occupied by n toads followed by n + 1 frogs. For n = 3, this is depicted by the board to left below.\r\n\r\n\r\n      T  T  T  T  F  F  F                  F  F  F  F  T  T  T\r\n      T  T  T  T  F  F  F                  F  F  F  F  T  T  T\r\n      T  T  T  T  F  F  F                  F  F  F  F  T  T  T\r\n      T  T  T  X  F  F  F        =\u003e        F  F  F  X  T  T  T\r\n      T  T  T  F  F  F  F                  F  F  F  T  T  T  T\r\n      T  T  T  F  F  F  F                  F  F  F  T  T  T  T\r\n      T  T  T  F  F  F  F                  F  F  F  T  T  T  T\r\n\r\nToads can move horizontally right or vertically down and frogs can move horizontally left or vertically up. A move can be either a slide to the empty neighboring position or a jump over an opposing creature to the empty position right beyond it. Toads cannot jump over themselves and neither can Frogs. \r\n\r\nHow many jumps and slides are required for the toads to switch their positions with the frogs as depicted on the right above.\r\n\r\n*HINT:* The puzzle is a two-dimensional version of the _Problem 44709: Toads and Frogs Puzzle_. It can be solved by applying the algorithm for that puzzle to the middle column. Whenever, a vacant cell is created in the board's row for the first time, switch to exchanging toads and frogs in that row by applying the same algorithm.\r\n\r\n  \r\n   T T F    T T F    T T F    T T F     T X F     X T F     F T X    F X T     F F T\r\n   T X F    X T F    F T X    F X T     F T T     F T T     F T T    F T T     F T T\r\n   T F F    T F F    T F F    T F F     T F F     T F F     T F F    T F F     T X F\r\n           Slide 1  Jump 1   Slide 2   Slide 3   Slide 4   Jump 2   Slide 5   Jump 3\r\n\r\n   F F T    F F T    F F T    F F T\r\n   F T T    F T T    F T T    F X T\r\n   X T F    F T X    F X T    F T T\r\n  Slide 6  Jump 4   Slide 7  Slide 8\r\n\r\nTherefore, to complete the puzzle for n = 1 requires four jumps and eight slides.\r\n\r\n\r\nGoodluck!!!","description_html":"\u003cp\u003eOn a two-dimensional board with 2n + 1 rows and 2n + 1 columns, all (2n + 1)^2 positions of the board, except the central one, are occupied by toads (T) and frogs (F), as follows.\u003c/p\u003e\u003cp\u003eIn the first n rows, the first n + 1 positions are occupied by toads followed by n frogs. In row n + 1, the first n positions are occupied by toads followed by one vacant position (X) followed by n toads. In the last n rows, the first n positions are occupied by n toads followed by n + 1 frogs. For n = 3, this is depicted by the board to left below.\u003c/p\u003e\u003cpre\u003e      T  T  T  T  F  F  F                  F  F  F  F  T  T  T\r\n      T  T  T  T  F  F  F                  F  F  F  F  T  T  T\r\n      T  T  T  T  F  F  F                  F  F  F  F  T  T  T\r\n      T  T  T  X  F  F  F        =\u0026gt;        F  F  F  X  T  T  T\r\n      T  T  T  F  F  F  F                  F  F  F  T  T  T  T\r\n      T  T  T  F  F  F  F                  F  F  F  T  T  T  T\r\n      T  T  T  F  F  F  F                  F  F  F  T  T  T  T\u003c/pre\u003e\u003cp\u003eToads can move horizontally right or vertically down and frogs can move horizontally left or vertically up. A move can be either a slide to the empty neighboring position or a jump over an opposing creature to the empty position right beyond it. Toads cannot jump over themselves and neither can Frogs.\u003c/p\u003e\u003cp\u003eHow many jumps and slides are required for the toads to switch their positions with the frogs as depicted on the right above.\u003c/p\u003e\u003cp\u003e\u003cb\u003eHINT:\u003c/b\u003e The puzzle is a two-dimensional version of the \u003ci\u003eProblem 44709: Toads and Frogs Puzzle\u003c/i\u003e. It can be solved by applying the algorithm for that puzzle to the middle column. Whenever, a vacant cell is created in the board's row for the first time, switch to exchanging toads and frogs in that row by applying the same algorithm.\u003c/p\u003e\u003cpre\u003e   T T F    T T F    T T F    T T F     T X F     X T F     F T X    F X T     F F T\r\n   T X F    X T F    F T X    F X T     F T T     F T T     F T T    F T T     F T T\r\n   T F F    T F F    T F F    T F F     T F F     T F F     T F F    T F F     T X F\r\n           Slide 1  Jump 1   Slide 2   Slide 3   Slide 4   Jump 2   Slide 5   Jump 3\u003c/pre\u003e\u003cpre\u003e   F F T    F F T    F F T    F F T\r\n   F T T    F T T    F T T    F X T\r\n   X T F    F T X    F X T    F T T\r\n  Slide 6  Jump 4   Slide 7  Slide 8\u003c/pre\u003e\u003cp\u003eTherefore, to complete the puzzle for n = 1 requires four jumps and eight slides.\u003c/p\u003e\u003cp\u003eGoodluck!!!\u003c/p\u003e","function_template":"function [jump,slide] = ToadsFrogs2(n)\r\n  \r\nend","test_suite":"%%\r\n[jump,slide] = ToadsFrogs2(0);\r\nassert(isequal(jump,0)\u0026isequal(slide,0))\r\n\r\n%%\r\n[jump,slide] = ToadsFrogs2(1);\r\nassert(isequal(jump,4)\u0026isequal(slide,8))\r\n\r\n%%\r\n[jump,slide] = ToadsFrogs2(3);\r\nassert(isequal(jump,72)\u0026isequal(slide,48))\r\n\r\n%%\r\n[jump,slide] = ToadsFrogs2(7);\r\nassert(isequal(jump,784)\u0026isequal(slide,224))\r\n\r\n%%\r\n[jump,slide] = ToadsFrogs2(11);\r\nassert(isequal(jump,2904)\u0026isequal(slide,528))\r\n\r\n%%\r\n[jump,slide] = ToadsFrogs2(17);\r\nassert(isequal(jump,10404)\u0026isequal(slide,1224))\r\n\r\n%%\r\n[jump,slide] = ToadsFrogs2(23);\r\nassert(isequal(jump,25392)\u0026isequal(slide,2208))\r\n\r\n%%\r\n[jump,slide] = ToadsFrogs2(29);\r\nassert(isequal(jump,50460)\u0026isequal(slide,3480))\r\n\r\n%%\r\n[jump,slide] = ToadsFrogs2(41);\r\nassert(isequal(jump,141204)\u0026isequal(slide,6888))\r\n\r\n%%\r\n[jump,slide] = ToadsFrogs2(50);\r\nassert(isequal(jump,255000)\u0026isequal(slide,10200))\r\n\r\n%%\r\n[jump,slide] = ToadsFrogs2(75);\r\nassert(isequal(jump,855000)\u0026isequal(slide,22800))\r\n\r\n%%\r\n[jump,slide] = ToadsFrogs2(99);\r\nassert(isequal(jump,1960200)\u0026isequal(slide,39600))","published":true,"deleted":false,"likes_count":1,"comments_count":0,"created_by":178544,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":12,"test_suite_updated_at":"2018-09-07T17:33:17.000Z","rescore_all_solutions":false,"group_id":1,"created_at":"2018-08-03T16:49:46.000Z","updated_at":"2026-02-06T13:52:33.000Z","published_at":"2018-08-03T16:50:32.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\u003eOn a two-dimensional board with 2n + 1 rows and 2n + 1 columns, all (2n + 1)^2 positions of the board, except the central one, are occupied by toads (T) and frogs (F), as follows.\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\u003eIn the first n rows, the first n + 1 positions are occupied by toads followed by n frogs. In row n + 1, the first n positions are occupied by toads followed by one vacant position (X) followed by n toads. In the last n rows, the first n positions are occupied by n toads followed by n + 1 frogs. For n = 3, this is depicted by the board to left below.\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[      T  T  T  T  F  F  F                  F  F  F  F  T  T  T\\n      T  T  T  T  F  F  F                  F  F  F  F  T  T  T\\n      T  T  T  T  F  F  F                  F  F  F  F  T  T  T\\n      T  T  T  X  F  F  F        =\u003e        F  F  F  X  T  T  T\\n      T  T  T  F  F  F  F                  F  F  F  T  T  T  T\\n      T  T  T  F  F  F  F                  F  F  F  T  T  T  T\\n      T  T  T  F  F  F  F                  F  F  F  T  T  T  T]]\u003e\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eToads can move horizontally right or vertically down and frogs can move horizontally left or vertically up. A move can be either a slide to the empty neighboring position or a jump over an opposing creature to the empty position right beyond it. Toads cannot jump over themselves and neither can Frogs.\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\u003eHow many jumps and slides are required for the toads to switch their positions with the frogs as depicted on the right above.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:rPr\u003e\u003cw:b/\u003e\u003c/w:rPr\u003e\u003cw:t\u003eHINT:\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e The puzzle is a two-dimensional version of the\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:rPr\u003e\u003cw:i/\u003e\u003c/w:rPr\u003e\u003cw:t\u003eProblem 44709: Toads and Frogs Puzzle\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e. It can be solved by applying the algorithm for that puzzle to the middle column. Whenever, a vacant cell is created in the board's row for the first time, switch to exchanging toads and frogs in that row by applying the same algorithm.\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[   T T F    T T F    T T F    T T F     T X F     X T F     F T X    F X T     F F T\\n   T X F    X T F    F T X    F X T     F T T     F T T     F T T    F T T     F T T\\n   T F F    T F F    T F F    T F F     T F F     T F F     T F F    T F F     T X F\\n           Slide 1  Jump 1   Slide 2   Slide 3   Slide 4   Jump 2   Slide 5   Jump 3\\n\\n   F F T    F F T    F F T    F F T\\n   F T T    F T T    F T T    F X T\\n   X T F    F T X    F X T    F T T\\n  Slide 6  Jump 4   Slide 7  Slide 8]]\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\u003eTherefore, to complete the puzzle for n = 1 requires four jumps and eight slides.\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\u003eGoodluck!!!\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":44711,"title":"Toads and Frogs Puzzle 2","description":"On a two-dimensional board with 2n + 1 rows and 2n + 1 columns, all (2n + 1)^2 positions of the board, except the central one, are occupied by toads (T) and frogs (F), as follows. \r\n\r\nIn the first n rows, the first n + 1 positions are occupied by toads followed by n frogs. In row n + 1, the first n positions are occupied by toads followed by one vacant position (X) followed by n toads. In the last n rows, the first n positions are occupied by n toads followed by n + 1 frogs. For n = 3, this is depicted by the board to left below.\r\n\r\n\r\n      T  T  T  T  F  F  F                  F  F  F  F  T  T  T\r\n      T  T  T  T  F  F  F                  F  F  F  F  T  T  T\r\n      T  T  T  T  F  F  F                  F  F  F  F  T  T  T\r\n      T  T  T  X  F  F  F        =\u003e        F  F  F  X  T  T  T\r\n      T  T  T  F  F  F  F                  F  F  F  T  T  T  T\r\n      T  T  T  F  F  F  F                  F  F  F  T  T  T  T\r\n      T  T  T  F  F  F  F                  F  F  F  T  T  T  T\r\n\r\nToads can move horizontally right or vertically down and frogs can move horizontally left or vertically up. A move can be either a slide to the empty neighboring position or a jump over an opposing creature to the empty position right beyond it. Toads cannot jump over themselves and neither can Frogs. \r\n\r\nHow many jumps and slides are required for the toads to switch their positions with the frogs as depicted on the right above.\r\n\r\n*HINT:* The puzzle is a two-dimensional version of the _Problem 44709: Toads and Frogs Puzzle_. It can be solved by applying the algorithm for that puzzle to the middle column. Whenever, a vacant cell is created in the board's row for the first time, switch to exchanging toads and frogs in that row by applying the same algorithm.\r\n\r\n  \r\n   T T F    T T F    T T F    T T F     T X F     X T F     F T X    F X T     F F T\r\n   T X F    X T F    F T X    F X T     F T T     F T T     F T T    F T T     F T T\r\n   T F F    T F F    T F F    T F F     T F F     T F F     T F F    T F F     T X F\r\n           Slide 1  Jump 1   Slide 2   Slide 3   Slide 4   Jump 2   Slide 5   Jump 3\r\n\r\n   F F T    F F T    F F T    F F T\r\n   F T T    F T T    F T T    F X T\r\n   X T F    F T X    F X T    F T T\r\n  Slide 6  Jump 4   Slide 7  Slide 8\r\n\r\nTherefore, to complete the puzzle for n = 1 requires four jumps and eight slides.\r\n\r\n\r\nGoodluck!!!","description_html":"\u003cp\u003eOn a two-dimensional board with 2n + 1 rows and 2n + 1 columns, all (2n + 1)^2 positions of the board, except the central one, are occupied by toads (T) and frogs (F), as follows.\u003c/p\u003e\u003cp\u003eIn the first n rows, the first n + 1 positions are occupied by toads followed by n frogs. In row n + 1, the first n positions are occupied by toads followed by one vacant position (X) followed by n toads. In the last n rows, the first n positions are occupied by n toads followed by n + 1 frogs. For n = 3, this is depicted by the board to left below.\u003c/p\u003e\u003cpre\u003e      T  T  T  T  F  F  F                  F  F  F  F  T  T  T\r\n      T  T  T  T  F  F  F                  F  F  F  F  T  T  T\r\n      T  T  T  T  F  F  F                  F  F  F  F  T  T  T\r\n      T  T  T  X  F  F  F        =\u0026gt;        F  F  F  X  T  T  T\r\n      T  T  T  F  F  F  F                  F  F  F  T  T  T  T\r\n      T  T  T  F  F  F  F                  F  F  F  T  T  T  T\r\n      T  T  T  F  F  F  F                  F  F  F  T  T  T  T\u003c/pre\u003e\u003cp\u003eToads can move horizontally right or vertically down and frogs can move horizontally left or vertically up. A move can be either a slide to the empty neighboring position or a jump over an opposing creature to the empty position right beyond it. Toads cannot jump over themselves and neither can Frogs.\u003c/p\u003e\u003cp\u003eHow many jumps and slides are required for the toads to switch their positions with the frogs as depicted on the right above.\u003c/p\u003e\u003cp\u003e\u003cb\u003eHINT:\u003c/b\u003e The puzzle is a two-dimensional version of the \u003ci\u003eProblem 44709: Toads and Frogs Puzzle\u003c/i\u003e. It can be solved by applying the algorithm for that puzzle to the middle column. Whenever, a vacant cell is created in the board's row for the first time, switch to exchanging toads and frogs in that row by applying the same algorithm.\u003c/p\u003e\u003cpre\u003e   T T F    T T F    T T F    T T F     T X F     X T F     F T X    F X T     F F T\r\n   T X F    X T F    F T X    F X T     F T T     F T T     F T T    F T T     F T T\r\n   T F F    T F F    T F F    T F F     T F F     T F F     T F F    T F F     T X F\r\n           Slide 1  Jump 1   Slide 2   Slide 3   Slide 4   Jump 2   Slide 5   Jump 3\u003c/pre\u003e\u003cpre\u003e   F F T    F F T    F F T    F F T\r\n   F T T    F T T    F T T    F X T\r\n   X T F    F T X    F X T    F T T\r\n  Slide 6  Jump 4   Slide 7  Slide 8\u003c/pre\u003e\u003cp\u003eTherefore, to complete the puzzle for n = 1 requires four jumps and eight slides.\u003c/p\u003e\u003cp\u003eGoodluck!!!\u003c/p\u003e","function_template":"function [jump,slide] = ToadsFrogs2(n)\r\n  \r\nend","test_suite":"%%\r\n[jump,slide] = ToadsFrogs2(0);\r\nassert(isequal(jump,0)\u0026isequal(slide,0))\r\n\r\n%%\r\n[jump,slide] = ToadsFrogs2(1);\r\nassert(isequal(jump,4)\u0026isequal(slide,8))\r\n\r\n%%\r\n[jump,slide] = ToadsFrogs2(3);\r\nassert(isequal(jump,72)\u0026isequal(slide,48))\r\n\r\n%%\r\n[jump,slide] = ToadsFrogs2(7);\r\nassert(isequal(jump,784)\u0026isequal(slide,224))\r\n\r\n%%\r\n[jump,slide] = ToadsFrogs2(11);\r\nassert(isequal(jump,2904)\u0026isequal(slide,528))\r\n\r\n%%\r\n[jump,slide] = ToadsFrogs2(17);\r\nassert(isequal(jump,10404)\u0026isequal(slide,1224))\r\n\r\n%%\r\n[jump,slide] = ToadsFrogs2(23);\r\nassert(isequal(jump,25392)\u0026isequal(slide,2208))\r\n\r\n%%\r\n[jump,slide] = ToadsFrogs2(29);\r\nassert(isequal(jump,50460)\u0026isequal(slide,3480))\r\n\r\n%%\r\n[jump,slide] = ToadsFrogs2(41);\r\nassert(isequal(jump,141204)\u0026isequal(slide,6888))\r\n\r\n%%\r\n[jump,slide] = ToadsFrogs2(50);\r\nassert(isequal(jump,255000)\u0026isequal(slide,10200))\r\n\r\n%%\r\n[jump,slide] = ToadsFrogs2(75);\r\nassert(isequal(jump,855000)\u0026isequal(slide,22800))\r\n\r\n%%\r\n[jump,slide] = ToadsFrogs2(99);\r\nassert(isequal(jump,1960200)\u0026isequal(slide,39600))","published":true,"deleted":false,"likes_count":1,"comments_count":0,"created_by":178544,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":12,"test_suite_updated_at":"2018-09-07T17:33:17.000Z","rescore_all_solutions":false,"group_id":1,"created_at":"2018-08-03T16:49:46.000Z","updated_at":"2026-02-06T13:52:33.000Z","published_at":"2018-08-03T16:50:32.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\u003eOn a two-dimensional board with 2n + 1 rows and 2n + 1 columns, all (2n + 1)^2 positions of the board, except the central one, are occupied by toads (T) and frogs (F), as follows.\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\u003eIn the first n rows, the first n + 1 positions are occupied by toads followed by n frogs. In row n + 1, the first n positions are occupied by toads followed by one vacant position (X) followed by n toads. In the last n rows, the first n positions are occupied by n toads followed by n + 1 frogs. For n = 3, this is depicted by the board to left below.\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[      T  T  T  T  F  F  F                  F  F  F  F  T  T  T\\n      T  T  T  T  F  F  F                  F  F  F  F  T  T  T\\n      T  T  T  T  F  F  F                  F  F  F  F  T  T  T\\n      T  T  T  X  F  F  F        =\u003e        F  F  F  X  T  T  T\\n      T  T  T  F  F  F  F                  F  F  F  T  T  T  T\\n      T  T  T  F  F  F  F                  F  F  F  T  T  T  T\\n      T  T  T  F  F  F  F                  F  F  F  T  T  T  T]]\u003e\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eToads can move horizontally right or vertically down and frogs can move horizontally left or vertically up. A move can be either a slide to the empty neighboring position or a jump over an opposing creature to the empty position right beyond it. Toads cannot jump over themselves and neither can Frogs.\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\u003eHow many jumps and slides are required for the toads to switch their positions with the frogs as depicted on the right above.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:rPr\u003e\u003cw:b/\u003e\u003c/w:rPr\u003e\u003cw:t\u003eHINT:\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e The puzzle is a two-dimensional version of the\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:rPr\u003e\u003cw:i/\u003e\u003c/w:rPr\u003e\u003cw:t\u003eProblem 44709: Toads and Frogs Puzzle\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e. It can be solved by applying the algorithm for that puzzle to the middle column. Whenever, a vacant cell is created in the board's row for the first time, switch to exchanging toads and frogs in that row by applying the same algorithm.\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[   T T F    T T F    T T F    T T F     T X F     X T F     F T X    F X T     F F T\\n   T X F    X T F    F T X    F X T     F T T     F T T     F T T    F T T     F T T\\n   T F F    T F F    T F F    T F F     T F F     T F F     T F F    T F F     T X F\\n           Slide 1  Jump 1   Slide 2   Slide 3   Slide 4   Jump 2   Slide 5   Jump 3\\n\\n   F F T    F F T    F F T    F F T\\n   F T T    F T T    F T T    F X T\\n   X T F    F T X    F X T    F T T\\n  Slide 6  Jump 4   Slide 7  Slide 8]]\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\u003eTherefore, to complete the puzzle for n = 1 requires four jumps and eight slides.\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\u003eGoodluck!!!\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:\"2d puzzle\"","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:\"2d puzzle\"","current_player":null,"sort":"map(difficulty_value,0,0,999) asc"},"parser":"MathWorks::Search::Solr::QueryParser","directives":{"term":{"directives":{"tag":[["tag:\"2d puzzle\"","","\"","2d puzzle","\""]]}}},"facets":{"#\u003cMathWorks::Search::Field:0x00007f24a35c8400\u003e":null,"#\u003cMathWorks::Search::Field:0x00007f24a35c8360\u003e":null},"filters":{"#\u003cMathWorks::Search::Field:0x00007f24a35c7a00\u003e":"\"cody:problem\""},"fields":{"#\u003cMathWorks::Search::Field:0x00007f24a35c87c0\u003e":1,"#\u003cMathWorks::Search::Field:0x00007f24a35c8720\u003e":50,"#\u003cMathWorks::Search::Field:0x00007f24a35c8680\u003e":"map(difficulty_value,0,0,999) asc","#\u003cMathWorks::Search::Field:0x00007f24a35c85e0\u003e":"tag:\"2d puzzle\""},"user_query":{"#\u003cMathWorks::Search::Field:0x00007f24a35c85e0\u003e":"tag:\"2d puzzle\""},"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:\"2d puzzle\"","current_player":null,"sort":"map(difficulty_value,0,0,999) asc"},"parser":"MathWorks::Search::Solr::QueryParser","directives":{"term":{"directives":{"tag":[["tag:\"2d puzzle\"","","\"","2d puzzle","\""]]}}},"facets":{"#\u003cMathWorks::Search::Field:0x00007f24a35c8400\u003e":null,"#\u003cMathWorks::Search::Field:0x00007f24a35c8360\u003e":null},"filters":{"#\u003cMathWorks::Search::Field:0x00007f24a35c7a00\u003e":"\"cody:problem\""},"fields":{"#\u003cMathWorks::Search::Field:0x00007f24a35c87c0\u003e":1,"#\u003cMathWorks::Search::Field:0x00007f24a35c8720\u003e":50,"#\u003cMathWorks::Search::Field:0x00007f24a35c8680\u003e":"map(difficulty_value,0,0,999) asc","#\u003cMathWorks::Search::Field:0x00007f24a35c85e0\u003e":"tag:\"2d puzzle\""},"user_query":{"#\u003cMathWorks::Search::Field:0x00007f24a35c85e0\u003e":"tag:\"2d puzzle\""},"queried_facets":{}},"options":{"fields":["id","difficulty_rating"]},"join":" "},"results":[{"id":44711,"difficulty_rating":"easy-medium"}]}}