{"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":700,"title":"Monty Hall","description":"The classic Monty Hall \"Let's Make a Deal\" final showcase puzzle pits the contestant against three Doors. Behind one Door are dream prizes and behind the other two are Donkeys and Chickens. \r\n\r\nThe contestant picks a Door: 1 2 or 3.\r\n\r\nMonty then reveals a Door that is Not the winner.\r\n\r\nAs the contestant do you stay with your original Door or swap to the other Door?\r\n\r\nYour routine will be called twice. \r\n\r\nThe first time it will see [0 0 0]. You are to select a Door: return an Integer 1,2 or 3.\r\n\r\nThe second time your function will see [1 2 0] or [1 0 2],if you had selected door number 1. The 2 denotes a revealed Losing Door.\r\n\r\nYou may now choose Door 1 (no change) or switch to the available door denoted by the zero. \r\n\r\nReturn an Integer 1, 2, or 3\r\n\r\nExample:\r\n\r\nInput [0 0 0]\r\n\r\nOutput 2\r\n\r\nInput [0 1 2] % Your first selection is denoted by 1. 2 is a losing Door\r\n\r\nOutput 1  % This selects Door 1, swapping from Door 2\r\n\r\nThe Test engine will determine if your final selection is a Winner\r\n\r\nThe routine will run the game 100 times calling your function twice for every game.\r\n\r\nYour Strategy \"Passes\" if it wins \u003e 50% of the time.\r\n\r\nThis is the first in a series of planned interactive Games.\r\n\r\nThis example is also to demonstrate Cody multi-call interactivity capability.\r\n\r\n\r\nLet's Make a Deal","description_html":"\u003cp\u003eThe classic Monty Hall \"Let's Make a Deal\" final showcase puzzle pits the contestant against three Doors. Behind one Door are dream prizes and behind the other two are Donkeys and Chickens.\u003c/p\u003e\u003cp\u003eThe contestant picks a Door: 1 2 or 3.\u003c/p\u003e\u003cp\u003eMonty then reveals a Door that is Not the winner.\u003c/p\u003e\u003cp\u003eAs the contestant do you stay with your original Door or swap to the other Door?\u003c/p\u003e\u003cp\u003eYour routine will be called twice.\u003c/p\u003e\u003cp\u003eThe first time it will see [0 0 0]. You are to select a Door: return an Integer 1,2 or 3.\u003c/p\u003e\u003cp\u003eThe second time your function will see [1 2 0] or [1 0 2],if you had selected door number 1. The 2 denotes a revealed Losing Door.\u003c/p\u003e\u003cp\u003eYou may now choose Door 1 (no change) or switch to the available door denoted by the zero.\u003c/p\u003e\u003cp\u003eReturn an Integer 1, 2, or 3\u003c/p\u003e\u003cp\u003eExample:\u003c/p\u003e\u003cp\u003eInput [0 0 0]\u003c/p\u003e\u003cp\u003eOutput 2\u003c/p\u003e\u003cp\u003eInput [0 1 2] % Your first selection is denoted by 1. 2 is a losing Door\u003c/p\u003e\u003cp\u003eOutput 1  % This selects Door 1, swapping from Door 2\u003c/p\u003e\u003cp\u003eThe Test engine will determine if your final selection is a Winner\u003c/p\u003e\u003cp\u003eThe routine will run the game 100 times calling your function twice for every game.\u003c/p\u003e\u003cp\u003eYour Strategy \"Passes\" if it wins \u003e 50% of the time.\u003c/p\u003e\u003cp\u003eThis is the first in a series of planned interactive Games.\u003c/p\u003e\u003cp\u003eThis example is also to demonstrate Cody multi-call interactivity capability.\u003c/p\u003e\u003cp\u003eLet's Make a Deal\u003c/p\u003e","function_template":"function y = Monty(doors)\r\n% First call will see doors=[0 0 0]\r\n% Second call will see a permutation of [0 1 2], depending on first response\r\n% In the second call the \"2\" denotes a revealed Losing door\r\n  y = 1;\r\nend","test_suite":"%%\r\nwin=0;\r\nPass=0;\r\nfor i=1:100\r\n    \r\n prize=randi(3);\r\n doors=[0 0 0];\r\n \r\n pick=Monty(doors);\r\n \r\n pick=floor(pick);\r\n if pick\u003c1 || pick\u003e3\r\n  win=0;\r\n  break;\r\n else\r\n  doors(pick)=1;\r\n end\r\n \r\n if pick==prize\r\n % Random select from other doors\r\n  if rand\u003e0.5\r\n   doors(find(doors==0,1))=2;\r\n  else\r\n   doors(find(doors==0,1,'last'))=2;\r\n  end\r\n else % \r\n % Pick other and not prize door\r\n  reveal=setxor(prize,setxor(pick,[1 2 3]));\r\n  doors(reveal)=2;\r\n end\r\n \r\n pick=Monty(doors);\r\n\r\n pick=floor(pick);\r\n if pick==prize\r\n  win=win+1;\r\n end\r\n \r\n \r\nend % Monty Loops\r\nwin % Display number of wins\r\nif win\u003e50,Pass=1;end\r\nassert(isequal(Pass,1))\r\n","published":true,"deleted":false,"likes_count":3,"comments_count":0,"created_by":3097,"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-05-19T08:52:15.000Z","updated_at":"2026-03-24T13:29:28.000Z","published_at":"2012-05-19T08:52:15.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\u003eThe classic Monty Hall \\\"Let's Make a Deal\\\" final showcase puzzle pits the contestant against three Doors. Behind one Door are dream prizes and behind the other two are Donkeys and Chickens.\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\u003eThe contestant picks a Door: 1 2 or 3.\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\u003eMonty then reveals a Door that is Not the winner.\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\u003eAs the contestant do you stay with your original Door or swap to the other Door?\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\u003eYour routine will be called twice.\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\u003eThe first time it will see [0 0 0]. You are to select a Door: return an Integer 1,2 or 3.\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\u003eThe second time your function will see [1 2 0] or [1 0 2],if you had selected door number 1. The 2 denotes a revealed Losing Door.\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\u003eYou may now choose Door 1 (no change) or switch to the available door denoted by the zero.\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\u003eReturn an Integer 1, 2, or 3\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\u003eExample:\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\u003eInput [0 0 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\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eOutput 2\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\u003eInput [0 1 2] % Your first selection is denoted by 1. 2 is a losing Door\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\u003eOutput 1 % This selects Door 1, swapping from Door 2\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\u003eThe Test engine will determine if your final selection is a Winner\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\u003eThe routine will run the game 100 times calling your function twice for every game.\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\u003eYour Strategy \\\"Passes\\\" if it wins \u003e 50% of the time.\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\u003eThis is the first in a series of planned interactive Games.\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\u003eThis example is also to demonstrate Cody multi-call interactivity capability.\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\u003eLet's Make a Deal\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":700,"title":"Monty Hall","description":"The classic Monty Hall \"Let's Make a Deal\" final showcase puzzle pits the contestant against three Doors. Behind one Door are dream prizes and behind the other two are Donkeys and Chickens. \r\n\r\nThe contestant picks a Door: 1 2 or 3.\r\n\r\nMonty then reveals a Door that is Not the winner.\r\n\r\nAs the contestant do you stay with your original Door or swap to the other Door?\r\n\r\nYour routine will be called twice. \r\n\r\nThe first time it will see [0 0 0]. You are to select a Door: return an Integer 1,2 or 3.\r\n\r\nThe second time your function will see [1 2 0] or [1 0 2],if you had selected door number 1. The 2 denotes a revealed Losing Door.\r\n\r\nYou may now choose Door 1 (no change) or switch to the available door denoted by the zero. \r\n\r\nReturn an Integer 1, 2, or 3\r\n\r\nExample:\r\n\r\nInput [0 0 0]\r\n\r\nOutput 2\r\n\r\nInput [0 1 2] % Your first selection is denoted by 1. 2 is a losing Door\r\n\r\nOutput 1  % This selects Door 1, swapping from Door 2\r\n\r\nThe Test engine will determine if your final selection is a Winner\r\n\r\nThe routine will run the game 100 times calling your function twice for every game.\r\n\r\nYour Strategy \"Passes\" if it wins \u003e 50% of the time.\r\n\r\nThis is the first in a series of planned interactive Games.\r\n\r\nThis example is also to demonstrate Cody multi-call interactivity capability.\r\n\r\n\r\nLet's Make a Deal","description_html":"\u003cp\u003eThe classic Monty Hall \"Let's Make a Deal\" final showcase puzzle pits the contestant against three Doors. Behind one Door are dream prizes and behind the other two are Donkeys and Chickens.\u003c/p\u003e\u003cp\u003eThe contestant picks a Door: 1 2 or 3.\u003c/p\u003e\u003cp\u003eMonty then reveals a Door that is Not the winner.\u003c/p\u003e\u003cp\u003eAs the contestant do you stay with your original Door or swap to the other Door?\u003c/p\u003e\u003cp\u003eYour routine will be called twice.\u003c/p\u003e\u003cp\u003eThe first time it will see [0 0 0]. You are to select a Door: return an Integer 1,2 or 3.\u003c/p\u003e\u003cp\u003eThe second time your function will see [1 2 0] or [1 0 2],if you had selected door number 1. The 2 denotes a revealed Losing Door.\u003c/p\u003e\u003cp\u003eYou may now choose Door 1 (no change) or switch to the available door denoted by the zero.\u003c/p\u003e\u003cp\u003eReturn an Integer 1, 2, or 3\u003c/p\u003e\u003cp\u003eExample:\u003c/p\u003e\u003cp\u003eInput [0 0 0]\u003c/p\u003e\u003cp\u003eOutput 2\u003c/p\u003e\u003cp\u003eInput [0 1 2] % Your first selection is denoted by 1. 2 is a losing Door\u003c/p\u003e\u003cp\u003eOutput 1  % This selects Door 1, swapping from Door 2\u003c/p\u003e\u003cp\u003eThe Test engine will determine if your final selection is a Winner\u003c/p\u003e\u003cp\u003eThe routine will run the game 100 times calling your function twice for every game.\u003c/p\u003e\u003cp\u003eYour Strategy \"Passes\" if it wins \u003e 50% of the time.\u003c/p\u003e\u003cp\u003eThis is the first in a series of planned interactive Games.\u003c/p\u003e\u003cp\u003eThis example is also to demonstrate Cody multi-call interactivity capability.\u003c/p\u003e\u003cp\u003eLet's Make a Deal\u003c/p\u003e","function_template":"function y = Monty(doors)\r\n% First call will see doors=[0 0 0]\r\n% Second call will see a permutation of [0 1 2], depending on first response\r\n% In the second call the \"2\" denotes a revealed Losing door\r\n  y = 1;\r\nend","test_suite":"%%\r\nwin=0;\r\nPass=0;\r\nfor i=1:100\r\n    \r\n prize=randi(3);\r\n doors=[0 0 0];\r\n \r\n pick=Monty(doors);\r\n \r\n pick=floor(pick);\r\n if pick\u003c1 || pick\u003e3\r\n  win=0;\r\n  break;\r\n else\r\n  doors(pick)=1;\r\n end\r\n \r\n if pick==prize\r\n % Random select from other doors\r\n  if rand\u003e0.5\r\n   doors(find(doors==0,1))=2;\r\n  else\r\n   doors(find(doors==0,1,'last'))=2;\r\n  end\r\n else % \r\n % Pick other and not prize door\r\n  reveal=setxor(prize,setxor(pick,[1 2 3]));\r\n  doors(reveal)=2;\r\n end\r\n \r\n pick=Monty(doors);\r\n\r\n pick=floor(pick);\r\n if pick==prize\r\n  win=win+1;\r\n end\r\n \r\n \r\nend % Monty Loops\r\nwin % Display number of wins\r\nif win\u003e50,Pass=1;end\r\nassert(isequal(Pass,1))\r\n","published":true,"deleted":false,"likes_count":3,"comments_count":0,"created_by":3097,"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-05-19T08:52:15.000Z","updated_at":"2026-03-24T13:29:28.000Z","published_at":"2012-05-19T08:52:15.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\u003eThe classic Monty Hall \\\"Let's Make a Deal\\\" final showcase puzzle pits the contestant against three Doors. Behind one Door are dream prizes and behind the other two are Donkeys and Chickens.\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\u003eThe contestant picks a Door: 1 2 or 3.\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\u003eMonty then reveals a Door that is Not the winner.\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\u003eAs the contestant do you stay with your original Door or swap to the other Door?\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\u003eYour routine will be called twice.\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\u003eThe first time it will see [0 0 0]. You are to select a Door: return an Integer 1,2 or 3.\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\u003eThe second time your function will see [1 2 0] or [1 0 2],if you had selected door number 1. The 2 denotes a revealed Losing Door.\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\u003eYou may now choose Door 1 (no change) or switch to the available door denoted by the zero.\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\u003eReturn an Integer 1, 2, or 3\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\u003eExample:\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\u003eInput [0 0 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\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eOutput 2\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\u003eInput [0 1 2] % Your first selection is denoted by 1. 2 is a losing Door\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\u003eOutput 1 % This selects Door 1, swapping from Door 2\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\u003eThe Test engine will determine if your final selection is a Winner\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\u003eThe routine will run the game 100 times calling your function twice for every game.\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\u003eYour Strategy \\\"Passes\\\" if it wins \u003e 50% of the time.\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\u003eThis is the first in a series of planned interactive Games.\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\u003eThis example is also to demonstrate Cody multi-call interactivity capability.\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\u003eLet's Make a Deal\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:\"interaction\"","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:\"interaction\"","current_player":null,"sort":"map(difficulty_value,0,0,999) asc"},"parser":"MathWorks::Search::Solr::QueryParser","directives":{"term":{"directives":{"tag":[["tag:\"interaction\"","","\"","interaction","\""]]}}},"facets":{"#\u003cMathWorks::Search::Field:0x00007f2f424eac00\u003e":null,"#\u003cMathWorks::Search::Field:0x00007f2f424eab60\u003e":null},"filters":{"#\u003cMathWorks::Search::Field:0x00007f2f424ea2a0\u003e":"\"cody:problem\""},"fields":{"#\u003cMathWorks::Search::Field:0x00007f2f424eae80\u003e":1,"#\u003cMathWorks::Search::Field:0x00007f2f424eade0\u003e":50,"#\u003cMathWorks::Search::Field:0x00007f2f424ead40\u003e":"map(difficulty_value,0,0,999) asc","#\u003cMathWorks::Search::Field:0x00007f2f424eaca0\u003e":"tag:\"interaction\""},"user_query":{"#\u003cMathWorks::Search::Field:0x00007f2f424eaca0\u003e":"tag:\"interaction\""},"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:\"interaction\"","current_player":null,"sort":"map(difficulty_value,0,0,999) asc"},"parser":"MathWorks::Search::Solr::QueryParser","directives":{"term":{"directives":{"tag":[["tag:\"interaction\"","","\"","interaction","\""]]}}},"facets":{"#\u003cMathWorks::Search::Field:0x00007f2f424eac00\u003e":null,"#\u003cMathWorks::Search::Field:0x00007f2f424eab60\u003e":null},"filters":{"#\u003cMathWorks::Search::Field:0x00007f2f424ea2a0\u003e":"\"cody:problem\""},"fields":{"#\u003cMathWorks::Search::Field:0x00007f2f424eae80\u003e":1,"#\u003cMathWorks::Search::Field:0x00007f2f424eade0\u003e":50,"#\u003cMathWorks::Search::Field:0x00007f2f424ead40\u003e":"map(difficulty_value,0,0,999) asc","#\u003cMathWorks::Search::Field:0x00007f2f424eaca0\u003e":"tag:\"interaction\""},"user_query":{"#\u003cMathWorks::Search::Field:0x00007f2f424eaca0\u003e":"tag:\"interaction\""},"queried_facets":{}},"options":{"fields":["id","difficulty_rating"]},"join":" "},"results":[{"id":700,"difficulty_rating":"easy"}]}}