技術標籤：c

基於Ncurses的貪吃蛇小遊戲

巨集定義方向鍵

#define UP    1
#define DOWN  -1
#define LEFT  2
#define RIGHT -2

Ncurses初始化

void initNcurse()
{
	initscr();
	keypad(stdscr, 1);
	noecho();
}

蛇身在移動過程中變化（改變節點座標）

void addNode()
{
	struct Snake *new = (struct Snake*)malloc(sizeof(struct Snake));
	new->next = NULL
 
;
	switch(dir)
	{
		case UP:
			new->hang = tail->hang-1;
			new->lie = tail->lie;
			break;
		case DOWN:
			new->hang = tail->hang+1;
			new->lie = tail->lie;
			break;
		case LEFT:
			new->hang = tail->hang;
			new->lie = tail->lie-1;
			break;
		case RIGHT:
			new->
 
hang = tail->hang;
			new->lie = tail->lie+1;
			break;
	}
	tail->next = new;
	tail = new;
}

初始化蛇的位置和初始運動方向

void initNode()
{
	struct Snake *p;
	dir = RIGHT;
	while(head != NULL)
	{
		p = head;
		head = head->next;
		free(p);
	}
	initFood();
	head = (struct Snake*)malloc(sizeof(struct
 
 Snake));
	head->hang = 2;
	head->lie = 2;
	tail = head;
	addNode();
	addNode();
}

刪除身子

void deleteNode()
{
	struct Snake *p;
	p = head;
	head = head->next;
	free(p);
}

初始化地圖

int hasSnakeNode(int i, int j)
{
	struct Snake *p;
	p = head;
	while(p != NULL)
	{
		if(p->hang == i && p->lie == j)
		{
			return 1;
		}
		p = p->next;
	}
	return 0;
}

int hasFood(int i, int j)
{
	if(food.hang == i && food.lie == j)
	{
		return 1;
	}
	return 0;
}

void gamePic()
{
	int hang;
	int lie;
	move(0, 0);
	for(hang = 0; hang < 20; hang++)
	{
		if(hang == 0)
		{
			for(lie = 0; lie < 20; lie++)
			{
				printw("--");
			}
			printw("\n");
		}	
		if(hang >= 0 && hang <= 19)
		{
			for(lie = 0; lie <= 20; lie ++)
			{
				if(lie == 0 || lie == 20)
				{
					printw("|");
				}else if(hasSnakeNode(hang, lie))
				{
					printw("[]");
				}
				else if(hasFood(hang, lie))
				{
					printw("##");
				}
				else
				{
					printw("  ");
				}
			}
			printw("\n");
		}
		if(hang == 19)
		{
			for(lie = 0; lie < 20; lie++)
			{
				printw("--");
			}
			printw("\n");
			printw("food.hang = %d, food.lie = %d\n", food.hang, food.lie);
		}
	}
}

隨機出現食物

void initFood()
{
	int x = rand() % 20;
	int y = rand() % 20;
	food.hang = x;
	food.lie = y;
}

判斷蛇是否碰到牆

int ifSnakeDie()
{
	struct Snake *p;
	p = head;
	if(tail->hang < 0 || tail->lie == 0 || tail->hang == 20 || tail->lie == 20)
	{
		return 1;
	}
	while(p->next != NULL)
	{
		if(p->hang == tail->hang && p->lie == tail->lie)
		{
			return 1;
		}
		p = p->next;
	}
	return 0;
	
}

移動蛇

void moveSnake()
{
	addNode();
	if(hasFood(tail->hang, tail->lie))
	{
		initFood();
	}
	else
	{
		deleteNode();
	}
	if(ifSnakeDie())
	{
		initNode();
	}
}

移動過程中不斷重新整理介面

void refreshJieMian()
{
	while(1)
	{
		moveSnake();
		gamePic();
		refresh();
		usleep(100000);
	}
}

蛇改變方向

void turn(int direction)
{
	if(abs(dir) != abs(direction))
	{
		dir = direction;
	}
}

void changeDir()
{
	while(1)
	{
		key = getch();
		switch(key)
		{
			case KEY_DOWN:
				turn(DOWN);
				break;
			case KEY_UP:
				turn(UP);
				break;
			case KEY_LEFT:
				turn(LEFT);
				break;
			case KEY_RIGHT:
				turn(RIGHT);
				break;
		}
	}
}

主函式

int main()
{
	pthread_t t1;	
	pthread_t t2;
	initNcurse();
	initNode();
	gamePic();
	pthread_create(&t1, NULL, refreshJieMian, NULL);
	pthread_create(&t2, NULL, changeDir, NULL);

	while(1);
	getch();
	endwin();
	return 0;
}