{"id":1037,"date":"2010-06-01T18:54:28","date_gmt":"2010-06-01T18:54:28","guid":{"rendered":"http:\/\/www.codingfriends.com\/?p=1037"},"modified":"2011-01-14T13:45:30","modified_gmt":"2011-01-14T13:45:30","slug":"life-cycle","status":"publish","type":"post","link":"https:\/\/www.codingfriends.com\/index.php\/2010\/06\/01\/life-cycle\/","title":{"rendered":"Life cycle"},"content":{"rendered":"<p><span id=\"zipfile\"><a href='http:\/\/www.codingfriends.com\/wp-content\/uploads\/2010\/06\/assn-1-life-pc.zip'><\/a><\/span>This course is in C++ each language is great to learn with but c++ is allot more fun at times since you have direct access the memory locations of variables :).<\/p>\n<p>Anyway, here is the assignment 1, life cycles, I have included the full source code in the zip file attached.  Life cycle, is when you have cells within a grid and the rules are (as taken from the assignment 1 PDF file within the zip file) where the neighbours are a 3 x 3 grid around the cell in question<\/p>\n<p>The simulation starts with an initial pattern of cells on the grid and computes successive generations of cells according to the following rules:<\/p>\n<ul>\n<li>1. A location that has one or fewer neighbors will be empty in the next generation. If a cell was in that location, it dies of loneliness. Sad!<\/li>\n<li>2. A location with two neighbors remains &#8220;stable&#8221;<br \/>\n","protected":false},"excerpt":{"rendered":"<p>This course is in C++ each language is great to learn with but c++ is allot more fun at times since you have direct access the memory locations of variables :). Anyway, here is the assignment 1, life cycles, I have included the full source code in the zip file attached. Life cycle, is when &hellip; <a href=\"https:\/\/www.codingfriends.com\/index.php\/2010\/06\/01\/life-cycle\/\" class=\"more-link\">Continue reading <span class=\"screen-reader-text\">Life cycle<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[7],"tags":[219],"class_list":["post-1037","post","type-post","status-publish","format-standard","hentry","category-c_and_cpp","tag-life-cycle"],"_links":{"self":[{"href":"https:\/\/www.codingfriends.com\/index.php\/wp-json\/wp\/v2\/posts\/1037","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.codingfriends.com\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.codingfriends.com\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.codingfriends.com\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.codingfriends.com\/index.php\/wp-json\/wp\/v2\/comments?post=1037"}],"version-history":[{"count":6,"href":"https:\/\/www.codingfriends.com\/index.php\/wp-json\/wp\/v2\/posts\/1037\/revisions"}],"predecessor-version":[{"id":1322,"href":"https:\/\/www.codingfriends.com\/index.php\/wp-json\/wp\/v2\/posts\/1037\/revisions\/1322"}],"wp:attachment":[{"href":"https:\/\/www.codingfriends.com\/index.php\/wp-json\/wp\/v2\/media?parent=1037"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.codingfriends.com\/index.php\/wp-json\/wp\/v2\/categories?post=1037"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.codingfriends.com\/index.php\/wp-json\/wp\/v2\/tags?post=1037"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}