Chinaunix首页 | 论坛 | 博客

miraclemiracle.blog.chinaunix.net

首页　| 　博文目录　| 　关于我

laoliulaoliu

  • 博客访问： 4466798
  • 博文数量： 1214
  • 博客积分： 13195
  • 博客等级： 上将
  • 技术积分： 9105
  • 用 户 组： 普通用户
  • 注册时间： 2007-01-19 14:41
个人简介

C++,python,热爱算法和机器学习

文章分类

全部博文（1214）

文章存档

2021年（13）

2020年（49）

2019年（14）

2018年（27）

2017年（69）

2016年（100）

2015年（106）

2014年（240）

2013年（5）

2012年（193）

2011年（155）

2010年（93）

2009年（62）

2008年（51）

2007年（37）

我的朋友
最近访客
推荐博文
相关博文
不同语言开发的简单Game Of Life

分类： Delphi

2011-02-02 19:54:30

  •  C
  1. #include <stdio.h>
  2. #include <stdlib.h>
  3. #include <ctype.h>

  5. #define MAXROW 10
  6. #define MAXCOL 25
  7. #define DEAD 0
  8. #define ALIVE 1

  10. void output();
  11. void copy(int[][MAXCOL], int[][MAXCOL]);
  12. void init(int[][MAXCOL]);
  13. int neighbors(int[][MAXCOL], int, int);

  15. int main() {
  16.    puts("Game of life Program");
  17.    puts("Enter x, y where x, y is living cell");
  18.    printf("0 <= x <= %d, 0 <= y <= %d\n", MAXROW-1, MAXCOL-1);
  19.    puts("Terminate with x, y = -1 -1");
  20.  
  21.    int map[MAXROW][MAXCOL];
  22.    int newmap[MAXROW][MAXCOL];
  23.    
  24.    init(map);

  26.    while(1) {
  27.       output(map);
  28.       
  29.       int row, col;
  30.       for(row = 0; row < MAXROW; row++) {
  31.          for(col = 0; col < MAXCOL; col++) {
  32.             switch (neighbors(map, row, col)) {
  33.                case 0: case 1: case 4: case 5: case 6: case 7: case 8:
  34.                   newmap[row][col] = DEAD; break;
  35.                case 2:
  36.                   newmap[row][col] = map[row][col]; break;
  37.                case 3:
  38.                   newmap[row][col] = ALIVE; break;
  39.             }
  40.          }
  41.       }

  43.       copy(map, newmap);

  45.       printf("\nContinue next Generation ? ");
  46.       getchar();
  47.       char ans = toupper(getchar());
  48.       if(ans != 'Y')
  49.           break;
  50.    }
  51.     
  52.    return 0;
  53. }

  55. void init(int map[][MAXCOL]) {
  56.    int row, col;
  57.    for(row = 0; row < MAXROW; row++)
  58.       for(col = 0; col < MAXCOL; col++)
  59.          map[row][col] = DEAD;

  61.    while(1) {
  62.       scanf("%d %d", &row, &col);
  63.       if(0 <= row && row < MAXROW &&
  64.          0 <= col && col < MAXCOL)
  65.          map[row][col] = ALIVE;
  66.       else if(row == -1 || col == -1)
  67.          break;
  68.       else
  69.          printf("(x, y) exceeds map ranage!");
  70.    }
  71. }

  73. int neighbors(int map[][MAXCOL], int row, int col) {
  74.    int count = 0;
  75.    
  76.    int c, r;
  77.    for(r = row-1; r <= row+1; r++)
  78.       for(c = col-1; c <= col+1; c++) {
  79.          if(r < 0 || r >= MAXROW || c < 0 || c >= MAXCOL)
  80.             continue;
  81.          if(map[r][c] == ALIVE)
  82.             count++;
  83.       }

  85.    if(map[row][col] == ALIVE)
  86.       count--;
  87.     
  88.    return count;
  89. }

  91. void output(int map[][MAXCOL]) {
  92.    printf("\n\nGame of life cell status\n");
  93.    
  94.    int row, col;
  95.    for(row = 0; row < MAXROW; row++) {
  96.       printf("\n%20c", ' ');
  97.       for(col = 0; col < MAXCOL; col++)
  98.          if(map[row][col] == ALIVE)
  99.             putchar('#');
  100.          else
  101.             putchar('-');
  102.    }
  103. }

  105. void copy(int map[][MAXCOL], int newmap[][MAXCOL]) {
  106.    int row, col;
  107.    for(row = 0; row < MAXROW; row++)
  108.       for(col = 0; col < MAXCOL; col++)
  109.          map[row][col] = newmap[row][col];
  110. }
  •  Java
  1. import java.io.BufferedReader;
  2. import java.io.IOException;
  3. import java.io.InputStreamReader;

  5. public class LifeGame {
  6.     private boolean[][] map;
  7.     private boolean[][] newmap;
  8.     
  9.     public LifeGame(int maxRow, int maxColumn) {
  10.         map = new boolean[maxRow][maxColumn];
  11.         newmap = new boolean[maxRow][maxColumn];
  12.     }
  13.     
  14.     public void cell(int x, int y) {
  15.         map[x][y] = true;
  16.     }
  17.     
  18.     public void next() {
  19.         for(int row = 0; row < map.length; row++) {
  20.             for(int col = 0; col < map[0].length; col++) {
  21.                switch (neighbors(row, col)) {
  22.                   case 0:
  23.                   case 1:
  24.                   case 4:
  25.                   case 5:
  26.                   case 6:
  27.                   case 7:
  28.                   case 8:
  29.                      newmap[row][col] = false;
  30.                      break;
  31.                   case 2:
  32.                      newmap[row][col] = map[row][col];
  33.                      break;
  34.                   case 3:
  35.                      newmap[row][col] = true;
  36.                      break;
  37.                }
  38.             }
  39.          }
  40.         
  41.          for(int row = 0; row < map.length; row++)
  42.            for(int col = 0; col < map[0].length; col++)
  43.               map[row][col] = newmap[row][col];
  44.     }

  46.     public void print() throws IOException {
  47.         System.out.println("\n\nGame of life cell status");
  48.         for(int row = 0; row < map.length; row++) {
  49.             System.out.println();
  50.            for(int col = 0; col < map[0].length; col++)
  51.               System.out.printf("%c", map[row][col] ? '#' : '-');
  52.         }
  53.     }
  54.     
  55.     private int neighbors(int row, int col) {
  56.         int count = 0;

  58.         for(int r = row-1; r <= row+1; r++)
  59.            for(int c = col-1; c <= col+1; c++) {
  60.               if(r < 0 || r >= map.length ||
  61.                  c < 0 || c >= map[0].length)
  62.                  continue;
  63.               if(map[r][c])
  64.                  count++;
  65.            }

  67.         if(map[row][col])
  68.            count--;
  69.          
  70.         return count;
  71.     }
  72.     
  73.     public static void main(String[] args)
  74.                  throws NumberFormatException, IOException {
  75.         BufferedReader bufReader =
  76.             new BufferedReader(
  77.                     new InputStreamReader(System.in));
  78.         
  79.         LifeGame game = new LifeGame(10, 25);
  80.         
  81.         System.out.println("Game of life Program");
  82.         System.out.println(
  83.                    "Enter x y where x y is living cell");
  84.         System.out.println("0 <= x < 10, 0 <= y < 25");
  85.         System.out.println("Terminate with x y = -1 -1");
  86.         
  87.         int row = -1;
  88.         int col = -1;
  89.         do {
  90.             String[] strs = bufReader.readLine().split(" ");
  91.             row = Integer.parseInt(strs[0]);
  92.             col = Integer.parseInt(strs[1]);
  93.             if(0 <= row && row < 10 && 0 <= col && col < 25)
  94.                 game.cell(row, col);
  95.         } while(col != -1);
  96.         
  97.         while(true) {
  98.             game.print();
  99.             game.next();

  101.             System.out.print(
  102.                          "\nContinue next Generation ? ");
  103.             
  104.             String ans = bufReader.readLine().toUpperCase();

  106.             if(ans.equals("N"))
  107.                 break;
  108.         }
  109.     }
  110. }

  • Python
  1. class LifeGame:
  2.     def __init__(self, maxRow, maxColumn):
  3.         self.__map = []
  4.         self.__newMap = []
  5.         for i in range(maxRow):
  6.             self.__map.append([False] * maxColumn)
  7.             self.__newMap.append([False] * maxColumn)
  8.     def cell(self, x, y):
  9.         self.__map[x][y] = True
  10.     def next(self):
  11.         for row in range(len(self.__map)):
  12.             for col in range(len(self.__map[0])):
  13.                 n = self.__neighbors(row, col)
  14.                 if n in [0, 1, 4, 5, 6, 7, 8]:
  15.                     self.__newMap[row][col] = False
  16.                 elif n == 2:
  17.                     self.__newMap[row][col] = self.__map[row][col]
  18.                 elif n == 3:
  19.                     self.__newMap[row][col] = True
  20.         for row in range(len(self.__map)):
  21.             for col in range(len(self.__map[0])):
  22.                 self.__map[row][col] = self.__newMap[row][col]
  23.     def print(self):
  24.         print("\nGame of life cell status")
  25.         for row in range(len(self.__map)):
  26.             print()
  27.             for col in range(len(self.__map[0])):
  28.                 if self.__map[row][col]:
  29.                     print("#", end="")
  30.                 else:
  31.                     print("-", end="")
  32.     def __neighbors(self, row, col):
  33.         count = 0
  34.         for r in range(row - 1, row + 2):
  35.             for c in range(col - 1, col + 2):
  36.                 rc = r < 0 or r >= len(self.__map)
  37.                 cc = c < 0 or c >= len(self.__map[0])
  38.                 if rc or cc:
  39.                     continue
  40.                 if self.__map[r][c]:
  41.                     count += 1
  42.         if self.__map[row][col] == True:
  43.             count -= 1
  44.         return count
  45.     
  46. game = LifeGame(10, 25)
  47. print("Game of life Program")
  48. print("Enter x, y where x, y is living cell")
  49. print("0 <= x < 10, 0 <= y < 25")
  50. print("Terminate with x, y = -1, -1")
  51. while(True):
  52.     strs = input().split(",")
  53.     row = int(strs[0])
  54.     col = int(strs[1])
  55.     if row >= 0 and row < 10 and col >= 0 and col < 25:
  56.         game.cell(row, col)
  57.     elif row == -1 or col == -1:
  58.         break

  60. while(True):
  61.     game.print()
  62.     game.next()
  63.     print("\nContinue next Generation ?", end="")
  64.     if input().upper() == "N":
  65.         break
  • Scala
  1. class LifeGame(maxRow: Int, maxColumn: Int) {
  2.     val map = new Array[Array[Boolean]](maxRow, maxColumn)
  3.     val newmap = new Array[Array[Boolean]](maxRow, maxColumn)
  4.     def cell(x: Int, y: Int) { map(x)(y) = true }
  5.     def next() {
  6.         for{
  7.             row <- 0 until map.length;
  8.             col <- 0 until map(0).length
  9.         } neighbors(row, col) match {
  10.             case 0|1|4|5|6|7|8 => newmap(row)(col) = false
  11.             case 2 => newmap(row)(col) = map(row)(col)
  12.             case 3 => newmap(row)(col) = true
  13.         }
  14.         for{
  15.             row <- 0 until map.length;
  16.             col <- 0 until map(0).length
  17.         } map(row)(col) = newmap(row)(col)
  18.     }
  19.     
  20.     private def neighbors(row: Int, col: Int) = {
  21.         var count = 0
  22.         for(r <- (row - 1) to (row + 1);
  23.             c <- (col - 1) until (col + 1)
  24.         ) if(r >= 0 && r < map.length &&
  25.              c >= 0 && c < map(0).length
  26.              && map(r)(c)) {
  27.              count += 1
  28.         }
  29.             
  30.         if(map(row)(col)) count -= 1
  31.         count
  32.     }
  33.     
  34.     def print() {
  35.         println("\n\nGame of life cell status");
  36.         for(row <- 0 until map.length) {
  37.             println()
  38.             for(col <- 0 until map(0).length) {
  39.                 printf(if(map(row)(col)) "#" else "-")
  40.             }
  41.         }
  42.     }
  43. }

  45. println("Game of life Program")
  46. println("Enter x y where x y is living cell")
  47. println("0 <= x < 10, 0 <= y < 25")
  48. println("Terminate with x y = -1 -1")

  50. val game = new LifeGame(10, 25)
  51. var row = -1
  52. var col = -1
  53. do {
  54.     val strs = readLine split(" ")
  55.     row = strs(0).toInt
  56.     col = strs(1).toInt
  57.     if(0 <= row && row < 10 && 0 <= col && row < 25)
  58.         game.cell(row, col)
  59. } while(row != -1)

  61. do {
  62.     game.print()
  63.     game.next()
  64.     print("\nContinue next Generation ? ")
  65. } while(readLine().toUpperCase() != "N")
阅读(829) | 评论(0) | 转发(0) |
0

上一篇：timespec, timeval的“溢出”问题

下一篇：自己实现的Game Of Life

给主人留下些什么吧！~~
关于我们 | 关于IT168 | 联系方式 | 广告合作 | 法律声明 | 免费注册

Copyright 2001-2010 ChinaUnix.net All Rights Reserved 北京皓辰网域网络信息技术有限公司. 版权所有

感谢所有关心和支持过ChinaUnix的朋友们

16024965号-6