{"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":1976,"title":"Kaggle: Reverse Game of Life - Create Isle prior State","description":"\u003chttp://www.kaggle.com/c/conway-s-reverse-game-of-life Kaggle's Conway's Reverse Game of Life\u003e contest inspires this Isle Single Evolution step in Life challenge. The kaggle contest runs from Oct-14-2013 thru Mar-02-2014. References: \u003chttp://mathworld.wolfram.com/GameofLife.html Game of Life at Wolfram\u003e. \u003chttp://en.wikipedia.org/wiki/Conway%27s_Game_of_Life Wiki Life\u003e.\r\n\r\n\r\n  1. Any live cell with fewer than two live neighbors dies, as if caused by under-population.\r\n  2. Any live cell with two or three live neighbors lives on to the next generation.\r\n  3. Any live cell with more than three live neighbors dies, as if by overcrowding.\r\n  4. Any dead cell with exactly three live neighbors becomes a live cell, as if by reproduction.\r\n5. No wrap around. Beyond edge is zero. Eight Neighbors.\r\n\r\n\r\nCreate an Isle that will evolve in one step to the given Isle state. An Isle is a morphing matrix that may contain non-periodic and interacting animals. The Isle is pre-evolved and will have \u003e10 live cells. Multiple solutions are possible. Imperfect solutions are allowed. This is a Performance Challenge.\r\n\r\n*Input:* Isle, 10x10 binary, 100 Isles\r\n\r\n*Output:* Isle_Predict,  a matrix that will evolve to Isle\r\n\r\n*Scoring:* 1000 * ( Errors / Total_points )\r\n\r\n*Example:*  (Errors=0 and 100 Total Points)\r\n\r\n  Isle        Isle_Predict\r\n\r\n  0001000000 0001000000\r\n  0010100000 0010100000\r\n  0100100000 0100100000\r\n  1101100000 0101000000\r\n  0100100000 0111000000\r\n  0000101000 0010100000\r\n  0010111100 0010111100\r\n  0001000010 0001000100\r\n  0000110100 0000111100\r\n  0000110000 0000010000\r\n\r\n*Next:* Isle_Predict vs Actual Specific Isle Predecessor. Study in Probability.","description_html":"\u003cp\u003e\u003ca href = \"http://www.kaggle.com/c/conway-s-reverse-game-of-life\"\u003eKaggle's Conway's Reverse Game of Life\u003c/a\u003e contest inspires this Isle Single Evolution step in Life challenge. The kaggle contest runs from Oct-14-2013 thru Mar-02-2014. References: \u003ca href = \"http://mathworld.wolfram.com/GameofLife.html\"\u003eGame of Life at Wolfram\u003c/a\u003e. \u003ca href = \"http://en.wikipedia.org/wiki/Conway%27s_Game_of_Life\"\u003eWiki Life\u003c/a\u003e.\u003c/p\u003e\u003cpre class=\"language-matlab\"\u003e1. Any live cell with fewer than two live neighbors dies, as if caused by under-population.\r\n2. Any live cell with two or three live neighbors lives on to the next generation.\r\n3. Any live cell with more than three live neighbors dies, as if by overcrowding.\r\n4. Any dead cell with exactly three live neighbors becomes a live cell, as if by reproduction.\r\n5. No wrap around. Beyond edge is zero. Eight Neighbors.\r\n\u003c/pre\u003e\u003cp\u003eCreate an Isle that will evolve in one step to the given Isle state. An Isle is a morphing matrix that may contain non-periodic and interacting animals. The Isle is pre-evolved and will have \u0026gt;10 live cells. Multiple solutions are possible. Imperfect solutions are allowed. This is a Performance Challenge.\u003c/p\u003e\u003cp\u003e\u003cb\u003eInput:\u003c/b\u003e Isle, 10x10 binary, 100 Isles\u003c/p\u003e\u003cp\u003e\u003cb\u003eOutput:\u003c/b\u003e Isle_Predict,  a matrix that will evolve to Isle\u003c/p\u003e\u003cp\u003e\u003cb\u003eScoring:\u003c/b\u003e 1000 * ( Errors / Total_points )\u003c/p\u003e\u003cp\u003e\u003cb\u003eExample:\u003c/b\u003e  (Errors=0 and 100 Total Points)\u003c/p\u003e\u003cpre class=\"language-matlab\"\u003eIsle        Isle_Predict\r\n\u003c/pre\u003e\u003cpre class=\"language-matlab\"\u003e0001000000 0001000000\r\n0010100000 0010100000\r\n0100100000 0100100000\r\n1101100000 0101000000\r\n0100100000 0111000000\r\n0000101000 0010100000\r\n0010111100 0010111100\r\n0001000010 0001000100\r\n0000110100 0000111100\r\n0000110000 0000010000\r\n\u003c/pre\u003e\u003cp\u003e\u003cb\u003eNext:\u003c/b\u003e Isle_Predict vs Actual Specific Isle Predecessor. Study in Probability.\u003c/p\u003e","function_template":"function Isle_Predict=predict_prior_isle(Isle)\r\n% Given Isle find prior Isle state to produce minimal Isle errors\r\n Isle_Predict=zeros(size(Isle));\r\nend","test_suite":"assignin('caller','score',200);\r\n%%\r\ntic\r\nN=10; % size of Isle\r\nQisles=100; % Qty of Isles to process to find error rate\r\n\r\nrng(15,'twister'); % creation fixed set of Isles\r\n\r\nvalid=0; \r\n\r\nwhile valid\u003cQisles\r\n q=floor(N/4)+randi(floor(N*N/4));\r\n idx=randperm(N*N);\r\n \r\n mb=zeros(N);\r\n mb(idx(1:q))=1;\r\n\r\n for i=1:10 % Pre-Evolve\r\n  %mb0=mb;\r\n  mc=conv2(single(mb),[1 1 1;1 0 1;1 1 1],'same');\r\n  mb=~(mc\u003c2 | mc\u003e3) \u0026 ((mb \u0026 mc==2) | (mb \u0026 mc==3) | (~mb \u0026 mc==3)); \r\n end\r\n\r\n if nnz(mb)\u003eN*N/10  % Avoid empty isles\r\n%   figure(1);imagesc(mb0)\r\n%   figure(2);imagesc(mb)\r\n  valid=valid+1;\r\n  Isle{valid}=mb;\r\n  \r\n end\r\n\r\nend % while  to create cases\r\n\r\nerrTot=0;\r\nfor i=1:Qisles\r\n\r\n isle_predict=predict_prior_isle(Isle{i});\r\n  \r\n m1=isle_predict; % Evolve to calculate errors\r\n mc=conv2(single(m1),[1 1 1;1 0 1;1 1 1],'same');\r\n isle_created=~(mc\u003c2 | mc\u003e3) \u0026 ((m1 \u0026 mc==2) | (m1 \u0026 mc==3) | (~m1 \u0026 mc==3));\r\n  \r\n err=N*N-nnz(Isle{i}==isle_created);\r\n errTot=errTot+err;\r\n\r\nend % Qisles\r\ntoc\r\nassignin('caller','score',min(200,floor(1000*errTot/N/N/Qisles)));\r\n","published":true,"deleted":false,"likes_count":2,"comments_count":6,"created_by":3097,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":17,"test_suite_updated_at":"2013-11-10T02:23:31.000Z","rescore_all_solutions":false,"group_id":1,"created_at":"2013-11-09T19:43:29.000Z","updated_at":"2026-02-13T15:23:16.000Z","published_at":"2013-11-09T20:16: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\",\"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:hyperlink w:docLocation=\\\"http://www.kaggle.com/c/conway-s-reverse-game-of-life\\\"\u003e\u003cw:r\u003e\u003cw:t\u003eKaggle's Conway's Reverse Game of Life\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e contest inspires this Isle Single Evolution step in Life challenge. The kaggle contest runs from Oct-14-2013 thru Mar-02-2014. References:\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://mathworld.wolfram.com/GameofLife.html\\\"\u003e\u003cw:r\u003e\u003cw:t\u003eGame of Life at Wolfram\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e.\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/Conway%27s_Game_of_Life\\\"\u003e\u003cw:r\u003e\u003cw:t\u003eWiki Life\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"code\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e\u003c![CDATA[1. Any live cell with fewer than two live neighbors dies, as if caused by under-population.\\n2. Any live cell with two or three live neighbors lives on to the next generation.\\n3. Any live cell with more than three live neighbors dies, as if by overcrowding.\\n4. Any dead cell with exactly three live neighbors becomes a live cell, as if by reproduction.\\n5. No wrap around. Beyond edge is zero. Eight Neighbors.]]\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\u003eCreate an Isle that will evolve in one step to the given Isle state. An Isle is a morphing matrix that may contain non-periodic and interacting animals. The Isle is pre-evolved and will have \u0026gt;10 live cells. Multiple solutions are possible. Imperfect solutions are allowed. This is a Performance Challenge.\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\u003eInput:\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e Isle, 10x10 binary, 100 Isles\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\u003eOutput:\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e Isle_Predict, a matrix that will evolve to Isle\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\u003eScoring:\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e 1000 * ( Errors / Total_points )\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\u003eExample:\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e (Errors=0 and 100 Total Points)\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[Isle        Isle_Predict\\n\\n0001000000 0001000000\\n0010100000 0010100000\\n0100100000 0100100000\\n1101100000 0101000000\\n0100100000 0111000000\\n0000101000 0010100000\\n0010111100 0010111100\\n0001000010 0001000100\\n0000110100 0000111100\\n0000110000 0000010000]]\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:rPr\u003e\u003cw:b/\u003e\u003c/w:rPr\u003e\u003cw:t\u003eNext:\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e Isle_Predict vs Actual Specific Isle Predecessor. Study in Probability.\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":1976,"title":"Kaggle: Reverse Game of Life - Create Isle prior State","description":"\u003chttp://www.kaggle.com/c/conway-s-reverse-game-of-life Kaggle's Conway's Reverse Game of Life\u003e contest inspires this Isle Single Evolution step in Life challenge. The kaggle contest runs from Oct-14-2013 thru Mar-02-2014. References: \u003chttp://mathworld.wolfram.com/GameofLife.html Game of Life at Wolfram\u003e. \u003chttp://en.wikipedia.org/wiki/Conway%27s_Game_of_Life Wiki Life\u003e.\r\n\r\n\r\n  1. Any live cell with fewer than two live neighbors dies, as if caused by under-population.\r\n  2. Any live cell with two or three live neighbors lives on to the next generation.\r\n  3. Any live cell with more than three live neighbors dies, as if by overcrowding.\r\n  4. Any dead cell with exactly three live neighbors becomes a live cell, as if by reproduction.\r\n5. No wrap around. Beyond edge is zero. Eight Neighbors.\r\n\r\n\r\nCreate an Isle that will evolve in one step to the given Isle state. An Isle is a morphing matrix that may contain non-periodic and interacting animals. The Isle is pre-evolved and will have \u003e10 live cells. Multiple solutions are possible. Imperfect solutions are allowed. This is a Performance Challenge.\r\n\r\n*Input:* Isle, 10x10 binary, 100 Isles\r\n\r\n*Output:* Isle_Predict,  a matrix that will evolve to Isle\r\n\r\n*Scoring:* 1000 * ( Errors / Total_points )\r\n\r\n*Example:*  (Errors=0 and 100 Total Points)\r\n\r\n  Isle        Isle_Predict\r\n\r\n  0001000000 0001000000\r\n  0010100000 0010100000\r\n  0100100000 0100100000\r\n  1101100000 0101000000\r\n  0100100000 0111000000\r\n  0000101000 0010100000\r\n  0010111100 0010111100\r\n  0001000010 0001000100\r\n  0000110100 0000111100\r\n  0000110000 0000010000\r\n\r\n*Next:* Isle_Predict vs Actual Specific Isle Predecessor. Study in Probability.","description_html":"\u003cp\u003e\u003ca href = \"http://www.kaggle.com/c/conway-s-reverse-game-of-life\"\u003eKaggle's Conway's Reverse Game of Life\u003c/a\u003e contest inspires this Isle Single Evolution step in Life challenge. The kaggle contest runs from Oct-14-2013 thru Mar-02-2014. References: \u003ca href = \"http://mathworld.wolfram.com/GameofLife.html\"\u003eGame of Life at Wolfram\u003c/a\u003e. \u003ca href = \"http://en.wikipedia.org/wiki/Conway%27s_Game_of_Life\"\u003eWiki Life\u003c/a\u003e.\u003c/p\u003e\u003cpre class=\"language-matlab\"\u003e1. Any live cell with fewer than two live neighbors dies, as if caused by under-population.\r\n2. Any live cell with two or three live neighbors lives on to the next generation.\r\n3. Any live cell with more than three live neighbors dies, as if by overcrowding.\r\n4. Any dead cell with exactly three live neighbors becomes a live cell, as if by reproduction.\r\n5. No wrap around. Beyond edge is zero. Eight Neighbors.\r\n\u003c/pre\u003e\u003cp\u003eCreate an Isle that will evolve in one step to the given Isle state. An Isle is a morphing matrix that may contain non-periodic and interacting animals. The Isle is pre-evolved and will have \u0026gt;10 live cells. Multiple solutions are possible. Imperfect solutions are allowed. This is a Performance Challenge.\u003c/p\u003e\u003cp\u003e\u003cb\u003eInput:\u003c/b\u003e Isle, 10x10 binary, 100 Isles\u003c/p\u003e\u003cp\u003e\u003cb\u003eOutput:\u003c/b\u003e Isle_Predict,  a matrix that will evolve to Isle\u003c/p\u003e\u003cp\u003e\u003cb\u003eScoring:\u003c/b\u003e 1000 * ( Errors / Total_points )\u003c/p\u003e\u003cp\u003e\u003cb\u003eExample:\u003c/b\u003e  (Errors=0 and 100 Total Points)\u003c/p\u003e\u003cpre class=\"language-matlab\"\u003eIsle        Isle_Predict\r\n\u003c/pre\u003e\u003cpre class=\"language-matlab\"\u003e0001000000 0001000000\r\n0010100000 0010100000\r\n0100100000 0100100000\r\n1101100000 0101000000\r\n0100100000 0111000000\r\n0000101000 0010100000\r\n0010111100 0010111100\r\n0001000010 0001000100\r\n0000110100 0000111100\r\n0000110000 0000010000\r\n\u003c/pre\u003e\u003cp\u003e\u003cb\u003eNext:\u003c/b\u003e Isle_Predict vs Actual Specific Isle Predecessor. Study in Probability.\u003c/p\u003e","function_template":"function Isle_Predict=predict_prior_isle(Isle)\r\n% Given Isle find prior Isle state to produce minimal Isle errors\r\n Isle_Predict=zeros(size(Isle));\r\nend","test_suite":"assignin('caller','score',200);\r\n%%\r\ntic\r\nN=10; % size of Isle\r\nQisles=100; % Qty of Isles to process to find error rate\r\n\r\nrng(15,'twister'); % creation fixed set of Isles\r\n\r\nvalid=0; \r\n\r\nwhile valid\u003cQisles\r\n q=floor(N/4)+randi(floor(N*N/4));\r\n idx=randperm(N*N);\r\n \r\n mb=zeros(N);\r\n mb(idx(1:q))=1;\r\n\r\n for i=1:10 % Pre-Evolve\r\n  %mb0=mb;\r\n  mc=conv2(single(mb),[1 1 1;1 0 1;1 1 1],'same');\r\n  mb=~(mc\u003c2 | mc\u003e3) \u0026 ((mb \u0026 mc==2) | (mb \u0026 mc==3) | (~mb \u0026 mc==3)); \r\n end\r\n\r\n if nnz(mb)\u003eN*N/10  % Avoid empty isles\r\n%   figure(1);imagesc(mb0)\r\n%   figure(2);imagesc(mb)\r\n  valid=valid+1;\r\n  Isle{valid}=mb;\r\n  \r\n end\r\n\r\nend % while  to create cases\r\n\r\nerrTot=0;\r\nfor i=1:Qisles\r\n\r\n isle_predict=predict_prior_isle(Isle{i});\r\n  \r\n m1=isle_predict; % Evolve to calculate errors\r\n mc=conv2(single(m1),[1 1 1;1 0 1;1 1 1],'same');\r\n isle_created=~(mc\u003c2 | mc\u003e3) \u0026 ((m1 \u0026 mc==2) | (m1 \u0026 mc==3) | (~m1 \u0026 mc==3));\r\n  \r\n err=N*N-nnz(Isle{i}==isle_created);\r\n errTot=errTot+err;\r\n\r\nend % Qisles\r\ntoc\r\nassignin('caller','score',min(200,floor(1000*errTot/N/N/Qisles)));\r\n","published":true,"deleted":false,"likes_count":2,"comments_count":6,"created_by":3097,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":17,"test_suite_updated_at":"2013-11-10T02:23:31.000Z","rescore_all_solutions":false,"group_id":1,"created_at":"2013-11-09T19:43:29.000Z","updated_at":"2026-02-13T15:23:16.000Z","published_at":"2013-11-09T20:16: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\",\"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:hyperlink w:docLocation=\\\"http://www.kaggle.com/c/conway-s-reverse-game-of-life\\\"\u003e\u003cw:r\u003e\u003cw:t\u003eKaggle's Conway's Reverse Game of Life\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e contest inspires this Isle Single Evolution step in Life challenge. The kaggle contest runs from Oct-14-2013 thru Mar-02-2014. References:\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://mathworld.wolfram.com/GameofLife.html\\\"\u003e\u003cw:r\u003e\u003cw:t\u003eGame of Life at Wolfram\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e.\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/Conway%27s_Game_of_Life\\\"\u003e\u003cw:r\u003e\u003cw:t\u003eWiki Life\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"code\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e\u003c![CDATA[1. Any live cell with fewer than two live neighbors dies, as if caused by under-population.\\n2. Any live cell with two or three live neighbors lives on to the next generation.\\n3. Any live cell with more than three live neighbors dies, as if by overcrowding.\\n4. Any dead cell with exactly three live neighbors becomes a live cell, as if by reproduction.\\n5. No wrap around. Beyond edge is zero. Eight Neighbors.]]\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\u003eCreate an Isle that will evolve in one step to the given Isle state. An Isle is a morphing matrix that may contain non-periodic and interacting animals. The Isle is pre-evolved and will have \u0026gt;10 live cells. Multiple solutions are possible. Imperfect solutions are allowed. This is a Performance Challenge.\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\u003eInput:\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e Isle, 10x10 binary, 100 Isles\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\u003eOutput:\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e Isle_Predict, a matrix that will evolve to Isle\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\u003eScoring:\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e 1000 * ( Errors / Total_points )\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\u003eExample:\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e (Errors=0 and 100 Total Points)\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[Isle        Isle_Predict\\n\\n0001000000 0001000000\\n0010100000 0010100000\\n0100100000 0100100000\\n1101100000 0101000000\\n0100100000 0111000000\\n0000101000 0010100000\\n0010111100 0010111100\\n0001000010 0001000100\\n0000110100 0000111100\\n0000110000 0000010000]]\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:rPr\u003e\u003cw:b/\u003e\u003c/w:rPr\u003e\u003cw:t\u003eNext:\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e Isle_Predict vs Actual Specific Isle Predecessor. Study in Probability.\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:\"prognostication\"","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:\"prognostication\"","current_player":null,"sort":"map(difficulty_value,0,0,999) asc"},"parser":"MathWorks::Search::Solr::QueryParser","directives":{"term":{"directives":{"tag":[["tag:\"prognostication\"","","\"","prognostication","\""]]}}},"facets":{"#\u003cMathWorks::Search::Field:0x00007f4f445210f8\u003e":null,"#\u003cMathWorks::Search::Field:0x00007f4f44521058\u003e":null},"filters":{"#\u003cMathWorks::Search::Field:0x00007f4f44520798\u003e":"\"cody:problem\""},"fields":{"#\u003cMathWorks::Search::Field:0x00007f4f44521378\u003e":1,"#\u003cMathWorks::Search::Field:0x00007f4f445212d8\u003e":50,"#\u003cMathWorks::Search::Field:0x00007f4f44521238\u003e":"map(difficulty_value,0,0,999) asc","#\u003cMathWorks::Search::Field:0x00007f4f44521198\u003e":"tag:\"prognostication\""},"user_query":{"#\u003cMathWorks::Search::Field:0x00007f4f44521198\u003e":"tag:\"prognostication\""},"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:\"prognostication\"","current_player":null,"sort":"map(difficulty_value,0,0,999) asc"},"parser":"MathWorks::Search::Solr::QueryParser","directives":{"term":{"directives":{"tag":[["tag:\"prognostication\"","","\"","prognostication","\""]]}}},"facets":{"#\u003cMathWorks::Search::Field:0x00007f4f445210f8\u003e":null,"#\u003cMathWorks::Search::Field:0x00007f4f44521058\u003e":null},"filters":{"#\u003cMathWorks::Search::Field:0x00007f4f44520798\u003e":"\"cody:problem\""},"fields":{"#\u003cMathWorks::Search::Field:0x00007f4f44521378\u003e":1,"#\u003cMathWorks::Search::Field:0x00007f4f445212d8\u003e":50,"#\u003cMathWorks::Search::Field:0x00007f4f44521238\u003e":"map(difficulty_value,0,0,999) asc","#\u003cMathWorks::Search::Field:0x00007f4f44521198\u003e":"tag:\"prognostication\""},"user_query":{"#\u003cMathWorks::Search::Field:0x00007f4f44521198\u003e":"tag:\"prognostication\""},"queried_facets":{}},"options":{"fields":["id","difficulty_rating"]},"join":" "},"results":[{"id":1976,"difficulty_rating":"easy-medium"}]}}