game of life python












-1














Can someone please do my program, i'm not a pro at this and i'm despertly looking for help. this is the beginning



import numpy as np
import pprint
#0 #1
world = np.array([[0, 1, 1, 0, 0], #0
[0, 0, 0, 0, 0],
[0, 0, 1, 0, 1],
[0, 0, 1, 1, 0],
[1, 1, 0, 0, 0]])
print (world)
for i in world[0,:] :
if i == 1:


if 2 cells are next to each other, one new cell is born, if 4 cells are together, one cells dies. only in a horizental way










share|improve this question







New contributor




ame is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.




















  • We review code, not write the code for you.
    – esote
    1 min ago
















-1














Can someone please do my program, i'm not a pro at this and i'm despertly looking for help. this is the beginning



import numpy as np
import pprint
#0 #1
world = np.array([[0, 1, 1, 0, 0], #0
[0, 0, 0, 0, 0],
[0, 0, 1, 0, 1],
[0, 0, 1, 1, 0],
[1, 1, 0, 0, 0]])
print (world)
for i in world[0,:] :
if i == 1:


if 2 cells are next to each other, one new cell is born, if 4 cells are together, one cells dies. only in a horizental way










share|improve this question







New contributor




ame is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.




















  • We review code, not write the code for you.
    – esote
    1 min ago














-1












-1








-1







Can someone please do my program, i'm not a pro at this and i'm despertly looking for help. this is the beginning



import numpy as np
import pprint
#0 #1
world = np.array([[0, 1, 1, 0, 0], #0
[0, 0, 0, 0, 0],
[0, 0, 1, 0, 1],
[0, 0, 1, 1, 0],
[1, 1, 0, 0, 0]])
print (world)
for i in world[0,:] :
if i == 1:


if 2 cells are next to each other, one new cell is born, if 4 cells are together, one cells dies. only in a horizental way










share|improve this question







New contributor




ame is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.











Can someone please do my program, i'm not a pro at this and i'm despertly looking for help. this is the beginning



import numpy as np
import pprint
#0 #1
world = np.array([[0, 1, 1, 0, 0], #0
[0, 0, 0, 0, 0],
[0, 0, 1, 0, 1],
[0, 0, 1, 1, 0],
[1, 1, 0, 0, 0]])
print (world)
for i in world[0,:] :
if i == 1:


if 2 cells are next to each other, one new cell is born, if 4 cells are together, one cells dies. only in a horizental way







python game game-of-life






share|improve this question







New contributor




ame is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.











share|improve this question







New contributor




ame is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.









share|improve this question




share|improve this question






New contributor




ame is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.









asked 14 mins ago









ame

1




1




New contributor




ame is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.





New contributor





ame is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.






ame is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.












  • We review code, not write the code for you.
    – esote
    1 min ago


















  • We review code, not write the code for you.
    – esote
    1 min ago
















We review code, not write the code for you.
– esote
1 min ago




We review code, not write the code for you.
– esote
1 min ago















active

oldest

votes











Your Answer





StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["\$", "\$"]]);
});
});
}, "mathjax-editing");

StackExchange.ifUsing("editor", function () {
StackExchange.using("externalEditor", function () {
StackExchange.using("snippets", function () {
StackExchange.snippets.init();
});
});
}, "code-snippets");

StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "196"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});

function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});


}
});






ame is a new contributor. Be nice, and check out our Code of Conduct.










draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodereview.stackexchange.com%2fquestions%2f210714%2fgame-of-life-python%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown






























active

oldest

votes













active

oldest

votes









active

oldest

votes






active

oldest

votes








ame is a new contributor. Be nice, and check out our Code of Conduct.










draft saved

draft discarded


















ame is a new contributor. Be nice, and check out our Code of Conduct.













ame is a new contributor. Be nice, and check out our Code of Conduct.












ame is a new contributor. Be nice, and check out our Code of Conduct.
















Thanks for contributing an answer to Code Review Stack Exchange!


  • Please be sure to answer the question. Provide details and share your research!

But avoid



  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.


Use MathJax to format equations. MathJax reference.


To learn more, see our tips on writing great answers.





Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


Please pay close attention to the following guidance:


  • Please be sure to answer the question. Provide details and share your research!

But avoid



  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.


To learn more, see our tips on writing great answers.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodereview.stackexchange.com%2fquestions%2f210714%2fgame-of-life-python%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown





















































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown

































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown







Popular posts from this blog

Morgemoulin

Scott Moir

Souastre