Netlogo笔记02：生命游戏B3S23的实现

最新推荐文章于 2024-04-27 18:04:52 发布

尼卡尼卡尼

最新推荐文章于 2024-04-27 18:04:52 发布

阅读量1.6k

点赞数

CC 4.0 BY-SA版权

分类专栏： netlogo与元胞自动机

本文链接：https://blog.csdn.net/qq_42418728/article/details/104537431

netlogo与元胞自动机专栏收录该内容

7 篇文章

订阅专栏

本文介绍了一个基于元胞自动机的生命游戏模拟程序。通过设置格子的初始状态和应用简单的生存与诞生规则，观察复杂的生命形态演化。程序使用了互斥事件判断语句来更新每个格子的状态，并通过计数邻居状态来决定格子的生死。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

patches-own [living]
to setup
  __clear-all-and-reset-ticks
  ask patches[;if rannum < 0.2,a cell born,else nothing happend
    ifelse random-float 1 < 0.2[
      set pcolor black
    ]
    [
      set pcolor white
    ]
  ]
end

;B3S23 is the game_charactor
to go
  ;avoid rules breaking,step 1 to calc living neighbors
  ask patches[;set the attr-val is its neighbors with diff color limit
    set living count neighbors with [pcolor = black]
  ]
  ;step 2 to update every patches with the attr living
  ask patches[
    ifelse(pcolor = black)[
      if living > 3 or living < 2[
        set pcolor white
      ]
    ]
    [
      if (living = 3)[
        set pcolor black
      ]
    ]
  ]
end

patches-own [living]：为patches格子新增属性
ifelse[...][...]：互斥事件判断语句
set pcolor white：pcolor是patches的固有属性，set ... xxx是赋值语句
count neighbors with [pcolor = black]：count...with是计数，neighbors是所有邻居patches，with中是筛选条件
B3S23：表示当有三个活着的邻居时，此patches变为活patches；当有2~3个活邻居时，当前patches继续存活。