C++或者C可以写游戏脚本吗?

Python012

C++或者C可以写游戏脚本吗?,第1张

可以,但C++和C语言是易学难精的语言,编写脚本很容易出现bug和其他问题,但他的灵活性和简易性也不可忽略,而目前比较流行的脚本:Python、Lua、ruby和Erlang,具体可以看看这篇文章http://wenku.baidu.com/link?url=sQUU5_rphUIoAHXLKV2OplLJIhD3okQkg7QMSqO2tSEJFV3F20SFd_H8S6Ql9uuF78YHf4Kj9TKgdJFdDa2AH2gmwLXUAWx9hmAcnQug0sy

生命游戏

/* ------------------------------------------------------ */

/* PROGRAM game of life :*/

/*This is a finite implementation of John H. Conway's */

/* Game of Life. Refere to my book for detail please.*/

/**/

/* Copyright Ching-Kuang Shene July/25/1989 */

/* ------------------------------------------------------ */

#include <stdio.h>

#include <stdlib.h>

#define MAXSIZE 50 /* board size */

#define OCCUPIED 1 /* occupied flag*/

#define UNOCCUPIED0

#define YES 1

#define NO0

char cell[MAXSIZE][MAXSIZE] /* the board */

char workcopy[MAXSIZE][MAXSIZE] /* a working copy */

int row /* No. of rows you want */

int column/* no. of columns you want */

int generations /* maximum no. of generation*/

/* ------------------------------------------------------ */

/* FUNCTION read_in :*/

/*This function reads in the number of generations, */

/* the number of rows, the number of columns and finally */

/* the initial configuration (the generation 0). Then put*/

/* your configuration to the center of the board. */

/* ------------------------------------------------------ */

void read_in(void)

{

int max_row, max_col /* max # of row and col.*/

int col_gap, row_gap /* incremnet of row and col */

int i, j

char line[100]

gets(line) /* read in gens, row and col*/

sscanf(line, "%d%d%d", &generations, &row, &column)

for (i = 0i <rowi++)/* clear the board */

for (j = 0j <columnj++)

cell[i][j] = UNOCCUPIED

max_col = 0/* read in the config. */

for (max_row = 0gets(line) != NULLmax_row++) {

for (i = 0line[i] != '\0'i++)

if (line[i] != ' ')

cell[max_row][i] = OCCUPIED

max_col = (max_col <i) ? i : max_col

}

row_gap = (row - max_row)/2 /* the moving gap*/

col_gap = (column - max_col)/2

for (i = max_row + row_gap - 1i >= row_gapi--) {

for (j = max_col + col_gap - 1j >= col_gapj--)

cell[i][j] = cell[i-row_gap][j-col_gap]

for ( j >= 0j--)

cell[i][j] = UNOCCUPIED

}

for ( i >= 0i--)

for (j = 0j <columnj++)

cell[i][j] = UNOCCUPIED

}

/* ------------------------------------------------------ */

/* FUNCTION display :*/

/*Display the board. */

/* ------------------------------------------------------ */

#define DRAW_BOARDER(n) { int i \

printf("\n+") \

for (i = 0i <ni++) \

printf("-")\

printf("+") \

}

void display(int gen_no)

{

int i, j

if (gen_no == 0)

printf("\n\nInitial Generation :\n")

else

printf("\n\nGeneration %d :\n", gen_no)

DRAW_BOARDER(column)

for (i = 0i <rowi++) {

printf("\n|")

for (j = 0j <columnj++)

printf("%c", (cell[i][j] == OCCUPIED) ? '*' : ' ')

printf("|")

}

DRAW_BOARDER(column)

}

/* ------------------------------------------------------ */

/* FUNCTION game_of_life : */

/*This is the main function of Game of Life. */

/* ------------------------------------------------------ */

void game_of_life(void)

{

int stable/* stable flag */

int iter /* iteration count */

int top, bottom, left, right/* neighborhood bound */

int neighbors /* # of neighbors */

int cell_count/* # of cells count */

int done

int i, j, p, q

display(0) /* display initial config. */

done = NO

for (iter = 1iter <= generations &&!doneiter++) {

memmove(workcopy, cell, MAXSIZE*MAXSIZE)/*copy*/

stable = YES /* assume it is in stable */

cell_count = 0/* # of survived cells = 0 */

for (i = 0i <rowi++) { /* scan each cell...*/

top= (i == 0) ? 0 : i - 1

bottom = (i == row - 1) ? row-1 : i + 1

for (j = 0j <columnj++) {

left = (j == 0) ? 0 : j - 1

right = (j == column - 1) ? column-1 : j + 1

/* compute number of neighbors*/

neighbors = 0

for (p = topp <= bottomp++)

for (q = leftq <= rightq++)

neighbors += workcopy[p][q]

neighbors -= workcopy[i][j]

/* determine life or dead */

if (workcopy[i][j] == OCCUPIED)

if (neighbors == 2 || neighbors == 3) {

cell[i][j] = OCCUPIED

cell_count++

}

else

cell[i][j] = UNOCCUPIED

else if (neighbors == 3) {

cell[i][j] = OCCUPIED

cell_count++

}

else

cell[i][j] = UNOCCUPIED

stable = stable &&(workcopy[i][j] == cell[i][j])

}

}

if (cell_count == 0) {

printf("\n\nAll cells die out.")

done = YES

}

else if (stable) {

printf("\n\nSystem enters a stable state.")

done = YES

}

else

display(iter)

}

}

/* ------------------------------------------------------ */

void main(void)

{

read_in()

game_of_life()

}