2048 Console Version - C++实现

最新推荐文章于 2021-05-13 10:28:45 发布
最新推荐文章于 2021-05-13 10:28:45 发布
阅读量1.2k 收藏
点赞数
分类专栏： C/C++ 文章标签： c++ 2048 控制台
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/chenk2014/article/details/28623187
版权

2048 Console Version


用C++实现的控制台版2048小游戏，实现了GitHub上原始版本2048的大部分功能特性，就是界面丑了些。

写之前阅读了Reason的代码，参考了他的思路，并对一些特性与实现方式做了些修改。感谢Reason！

/*
 *	2048 Console Version by ChenKode
 *
 */
#include <iostream>
#include <iomanip>			/* cout << setw() */
#include <ctime>			/* time() */
#include <cstdlib>			/* srand(), rand() */
#include <conio.h>			/* _getch() */

using namespace std;

const int SIZE = 4;			/* Size of each row and column */
/* Goal-Score of the game*/
const int GOAL = (int)pow((double)2, SIZE * (SIZE - 1));

const int UP = 0, DOWN = 1, LEFT = 2, RIGHT = 3;

int pane[SIZE][SIZE];		/* Pane of the game */
int maxNumber;				/* Max number of the pane */
int score;					/* Score of the game */
int bestScore;				/* Best score of the game */
int zeroCnt;				/* Zero number of the pane */

void newGame();				/* Start a new game */
void showPane();			/* Print the pane */
int process();				/* Move, merge and judge */

int main()
{
	system("color f2");

	int gameIsOn = 1;
	while (gameIsOn)
	{
		/* Start a new game */
		newGame();
		
		while (gameIsOn)
		{	/* In game */
			gameIsOn = process();
			showPane();
		}

		if (maxNumber == GOAL)
		{
			cout << setw(43) << "Congratulations! You Win!" << endl;
		}
		else
		{
			cout << setw(43) << "~Game Over~" << endl;
		}
		cout << setw(46) << "Your Final Score is: " << score << endl;
		cout << endl << setw(54) << "Input \"1\" to Retry, \"0\" to Quit." << endl;
		cin >> gameIsOn;
		while (gameIsOn != 1 && gameIsOn != 0)
		{
			cout << setw(43) << "Input Error. Please Input Again.";
			cin >> gameIsOn;
		}
	}

	system("pause");
	return 0;
}

void newGame()
{	/* Start a new game */
	void addNewNumber();

	memset(pane, 0, SIZE * SIZE * sizeof(int));
	maxNumber = 2;
	score = 0;
	zeroCnt = SIZE * SIZE;
	addNewNumber();
	showPane();
}

void showPane()
{	/* Print the pane */
	system("cls");

	cout << endl;
	cout << setw(46) << "2048 by ChenKode" << endl;
	cout << setw(30) << "Score: " << setw(4) << score << "   " << "Best Score: " << setw(4) << bestScore << endl;
	cout << setw(26) << "|";
	for (int k = 0; k < SIZE - 1; k++)
	{
		cout << "------";
	}
	cout << "-----|" << endl;

	for (int i = 0; i < SIZE; i++)	
	{
		cout << setw(24) << "";
		for (int j = 0; j < SIZE; j++)
		{
			if(pane[i][j] == 0)
			{
				cout << setw(2) << "|" << setw(4) << "";
			}
			else
			{
				cout << setw(2) << "|" << setw(4) << pane[i][j];
			}

			if (j == SIZE - 1)
			{
				cout << setw(2) << "|" << endl;
				cout << setw(26) << "|";
				for (int k = 0; k < SIZE - 1; k++)
				{
					cout << "------";
				}
				cout << "-----|" << endl;
			}
		}//for (int j = 0; j < SIZE; j++)
	}//for (int i = 0; i < SIZE; i++)
}

int process()
{	/* Move, merge and judge */
	int getDirection();			/* Get move direction from keyboard */
	void addNewNumber();		/* Add a "2" or "4" to the pane */
	int moveUp();
	int moveLeft();
	int moveRigh();
	int moveDown();
	int canMoveUp();
	int canMoveLeft();
	int canMoveRigh();
	int canMoveDown();

	if (maxNumber == GOAL || !zeroCnt && !canMoveUp() && !canMoveLeft() && !canMoveRigh() && !canMoveDown())
	{	/* Game is finished */
		return 0;
	}

	while (1)
	{
		int dir = getDirection();
		int flag = 0;
		switch(dir)
		{
		case UP:
			flag = moveUp();
			break;

		case LEFT:
			flag = moveLeft();
			break;

		case RIGHT:
			flag = moveRigh();
			break;

		case DOWN:
			flag = moveDown();
			break;

		default:
			break;
		}

		if (flag == 1)
		{	/* Game goes on */
			addNewNumber();
			return 1;
		}
	}//while (1)
}

void addNewNumber()
{	/* Add a "2" or "4" to the pane */
	srand((unsigned)time(NULL));			/* Get seed */
	int position = rand() % zeroCnt;
	int newNumber = (rand() % 2 + 1) * 2;

	for (int row = 0; row < SIZE; row++)
	{
		for (int column = 0; column < SIZE; column++)
		{
			if (pane[row][column] == 0)
			{
				if (position == 0)
				{
					pane[row][column] = newNumber;
					zeroCnt--;
					return;
				}
				position--;
			}
		}//for (int column = 0; column < SIZE; column++)
	}//for (int row = 0; row < SIZE; row++)
}

int getDirection()
{	/* Get direction from keyboard */
	while (1)
	{
		int key = _getch();
		switch (key)
		{
		case 72:
			return UP;
			break;
		case 75:
			return LEFT;
			break;
		case 77:
			return RIGHT;
			break;
		case 80:
			return DOWN;
			break;
		default:
			break;
		}
	}
}

int moveUp()
{
	int isMoved = 0;
	for (int column = 0; column < SIZE; column++)
	{
		int mergeFlag = 0;
		for (int row = 1; row < SIZE; row++)
		{	/* Begin at row = 1 */
			if (pane[row][column] != 0)
			{
				int tmp = row - 1;
				while (tmp >= 0 && pane[tmp][column] == 0)
				{	/* Find last non-zero number */
					tmp--;
				}
				if (tmp == -1)
				{	/* pane[row][column] is the first non-zero number */
					pane[0][column] = pane[row][column];
					pane[row][column] = 0;
					isMoved = 1;
				}
				else
				{	/* pane[row][column] is not the first non-zero number */
					if (pane[row][column] == pane[tmp][column] && mergeFlag == 0)
					{	/* Need to merge */
						pane[tmp][column] *= 2;
						pane[row][column] = 0;

						mergeFlag = 1;
						isMoved = 1;

						score += pane[tmp][column];
						if (score > bestScore)
						{
							bestScore = score;
						}
						if (pane[tmp][column] > maxNumber)
						{
							maxNumber = pane[tmp][column];
						}

						zeroCnt++;
					}
					else
					{	/* Just move*/
						if (tmp == row - 1)
						{	/* pane[row][column] is adjacent to pane[tmp][column] */
							continue;
						}
						pane[tmp + 1][column] = pane[row][column];
						pane[row][column] = 0;
						isMoved = 1;
					}
				}
			}//if (pane[row][column] != 0)
		}//for (int row = 1; row < SIZE; row++)
	}//for (int column = 0; column < SIZE; column++)

	return isMoved;
}

int moveLeft()
{
	int isMoved = 0;
	for (int row = 0; row < SIZE; row++)
	{
		int mergeFlag = 0;
		for (int column = 1; column < SIZE; column++)
		{	/* Begin at column = 1 */
			if (pane[row][column] != 0)
			{
				int tmp = column - 1;
				while (tmp >= 0 && pane[row][tmp] == 0)
				{	/* Find last non-zero number */
					tmp--;
				}
				if (tmp == -1)
				{	/* pane[row][column] is the first non-zero number */
					pane[row][0] = pane[row][column];
					pane[row][column] = 0;
					isMoved = 1;
				}
				else
				{	/* pane[row][column] is not the first non-zero number */
					if (pane[row][column] == pane[row][tmp] && mergeFlag == 0)
					{	/* Need to merge */
						pane[row][tmp] *= 2;
						pane[row][column] = 0;

						mergeFlag = 1;
						isMoved = 1;

						score += pane[row][tmp];
						if (score > bestScore)
						{
							bestScore = score;
						}
						if (pane[row][tmp] > maxNumber)
						{
							maxNumber = pane[row][tmp];
						}

						zeroCnt++;
					}
					else
					{	/* Just move*/
						if (tmp == column - 1)
						{	/* pane[row][column] is adjacent to pane[row][tmp] */
							continue;
						}
						pane[row][tmp + 1] = pane[row][column];
						pane[row][column] = 0;
						isMoved = 1;
					}
				}
			}//if (panepane[row][column] != 0)
		}//for (int column = 1; column < SIZE; j++)
	}//for (int row = 0; row < SIZE; i++)

	return isMoved;
}

int moveRigh()
{
	int isMoved = 0;
	for (int row = 0; row < SIZE; row++)
	{
		int mergeFlag = 0;
		for (int column = SIZE - 1 - 1; column >= 0; column--)
		{	/* Begin at column = SIZE - 1 - 1 */
			if (pane[row][column] != 0)
			{
				int tmp = column + 1;
				while (tmp < SIZE && pane[row][tmp] == 0)
				{	/* Find last non-zero number */
					tmp++;
				}
				if (tmp == SIZE)
				{	/* pane[row][column] is the first non-zero number */
					pane[row][SIZE - 1] = pane[row][column];
					pane[row][column] = 0;
					isMoved = 1;
				}
				else
				{	/* pane[row][column] is not the first non-zero number */
					if (pane[row][column] == pane[row][tmp] && mergeFlag == 0)
					{	/* Need to merge */
						pane[row][tmp] *= 2;
						pane[row][column] = 0;

						mergeFlag = 1;
						isMoved = 1;

						score += pane[row][tmp];
						if (score > bestScore)
						{
							bestScore = score;
						}
						if (pane[row][tmp] > maxNumber)
						{
							maxNumber = pane[row][tmp];
						}

						zeroCnt++;
					}
					else
					{	/* Just move*/
						if (tmp == column + 1)
						{	/* pane[row][column] is adjacent to pane[row][tmp] */
							continue;
						}
						pane[row][tmp - 1] = pane[row][column];
						pane[row][column] = 0;
						isMoved = 1;
					}
				}
			}//if (panepane[row][column] != 0)
		}//for (int column = SIZE - 1 - 1; column >= 0; column--)
	}//for (int row = 0; row < SIZE; row++)

	return isMoved;
}

int moveDown()
{
	int isMoved = 0;
	for (int column = 0; column < SIZE; column++)
	{
		int mergeFlag = 0;
		for (int row = SIZE - 1 - 1; row >= 0; row--)
		{	/* Begin at row = SIZE - 1 - 1 */
			if (pane[row][column] != 0)
			{
				int tmp = row + 1;
				while (tmp < SIZE && pane[tmp][column] == 0)
				{	/* Find last non-zero number */
					tmp++;
				}
				if (tmp == SIZE)
				{	/* pane[row][column] is the first non-zero number */
					pane[SIZE - 1][column] = pane[row][column];
					pane[row][column] = 0;
					isMoved = 1;
				}
				else
				{	/* pane[row][column] is not the first non-zero number */
					if (pane[row][column] == pane[tmp][column] && mergeFlag == 0)
					{	/* Need to merge */
						pane[tmp][column] *= 2;
						pane[row][column] = 0;

						mergeFlag = 1;
						isMoved = 1;

						score += pane[tmp][column];
						if (score > bestScore)
						{
							bestScore = score;
						}
						if (pane[tmp][column] > maxNumber)
						{
							maxNumber = pane[tmp][column];
						}

						zeroCnt++;
					}
					else
					{	/* Just move*/
						if (tmp == row + 1)
						{	/* pane[row][column] is adjacent to pane[tmp][column] */
							continue;
						}
						pane[tmp - 1][column] = pane[row][column];
						pane[row][column] = 0;
						isMoved = 1;
					}
				}
			}//if (pane[row][column] != 0)
		}//for (int row = SIZE - 1 - 1; row >= 0; row--)
	}//for (int column = 0; column < SIZE; column++)

	return isMoved;
}

int canMoveUp()
{
	for (int column = 0; column < SIZE; column++)
	{
		for (int row = 1; row < SIZE; row++)
		{	/* Begin at row = 1 */
			if (pane[row][column] != 0)
			{
				int tmp = row - 1;
				while (tmp >= 0 && pane[tmp][column] == 0)
				{	/* Find last non-zero number */
					tmp--;
				}
				if (tmp == -1)
				{	/* pane[row][column] is the first non-zero number */
					return 1;
				}
				else
				{	/* pane[row][column] is not the first non-zero number */
					if (pane[row][column] != pane[tmp][column] && tmp == row - 1)
					{	/* Cannot merge */
						/* And pane[row][column] is adjacent to pane[tmp][column] */
						continue;
					}
					else
					{	/* Just move*/
						return 1;
					}
				}
			}//if (pane[row][column] != 0)
		}//for (int row = 1; row < SIZE; row++)
	}//for (int column = 0; column < SIZE; column++)

	return 0;
}

int canMoveLeft()
{
	for (int row = 0; row < SIZE; row++)
	{
		for (int column = 1; column < SIZE; column++)
		{	/* Begin at column = 1 */
			if (pane[row][column] != 0)
			{
				int tmp = column - 1;
				while (tmp >= 0 && pane[row][tmp] == 0)
				{	/* Find last non-zero number */
					tmp--;
				}
				if (tmp == -1)
				{	/* pane[row][column] is the first non-zero number */
					return 1;
				}
				else
				{	/* pane[row][column] is not the first non-zero number */
					if (pane[row][column] != pane[row][tmp] && tmp == column - 1)
					{	/* Cannot merge */
						/* And pane[row][column] is adjacent to pane[row][tmp] */
						continue;
					}
					else
					{	/* Just move*/
						return 1;
					}
				}
			}//if (panepane[row][column] != 0)
		}//for (int column = 1; column < SIZE; j++)
	}//for (int row = 0; row < SIZE; i++)

	return 0;
}

int canMoveRigh()
{
	for (int row = 0; row < SIZE; row++)
	{
		for (int column = SIZE - 1 - 1; column >= 0; column--)
		{	/* Begin at column = SIZE - 1 - 1 */
			if (pane[row][column] != 0)
			{
				int tmp = column + 1;
				while (tmp < SIZE && pane[row][tmp] == 0)
				{	/* Find last non-zero number */
					tmp++;
				}
				if (tmp == SIZE)
				{	/* pane[row][column] is the first non-zero number */
					return 1;
				}
				else
				{	/* pane[row][column] is not the first non-zero number */
					if (pane[row][column] != pane[row][tmp] && tmp == column + 1)
					{	/* Cannot merge */
						/* And pane[row][column] is adjacent to pane[row][tmp] */
						continue;
					}
					else
					{
						return 1;
					}
				}
			}//if (panepane[row][column] != 0)
		}//for (int column = SIZE - 1 - 1; column >= 0; column--)
	}//for (int row = 0; row < SIZE; row++)

	return 0;
}

int canMoveDown()
{
	for (int column = 0; column < SIZE; column++)
	{
		for (int row = SIZE - 1 - 1; row >= 0; row--)
		{	/* Begin at row = SIZE - 1 - 1 */
			if (pane[row][column] != 0)
			{
				int tmp = row + 1;
				while (tmp < SIZE && pane[tmp][column] == 0)
				{	/* Find last non-zero number */
					tmp++;
				}
				if (tmp == SIZE)
				{	/* pane[row][column] is the first non-zero number */
					return 1;
				}
				else
				{	/* pane[row][column] is not the first non-zero number */
					if (pane[row][column] != pane[tmp][column] && tmp == row + 1)
					{	/* Cannot merge */
						/* And pane[row][column] is adjacent to pane[tmp][column] */
						continue;
					}
					else
					{
						return 1;
					}
				}
			}//if (pane[row][column] != 0)
		}//for (int row = SIZE - 1 - 1; row >= 0; row--)
	}//for (int column = 0; column < SIZE; column++)

	return 0;
}



ChenKode
关注
专栏目录
C++ win32 控制台 2048 游戏
06-02
C++ win32 控制台 2048 游戏
c++实现2048小游戏（windows控制台）
最新发布
qq_62604677的博客
07-13 275
编程环境：windows10、c++17、clion但是设置为在外部控制台（其实就是windows的cmd）中输出。说是c++，其实基本上全是c语言的语法。不多说，直接上代码。
7zip linux 64位,7-Zip 21.02 Alpha发布 带来更多面向Linux与macOS方面的改进
weixin_28864167的博客
05-13 638
然而，7-Zip的源码仍然缺乏一个很好的构建系统，所以对于Linux用户来说，要在你的系统上轻松构建这个软件以满足压缩/解压缩需求还并不算是件很简单的事情。不过，7-Zip 21.02在macOS和Linux的ARM64版本中提供了更快的LZMA/LZMA2解压速度，比以前的版本快20~60%。这个新的7-Zip版本还能更好地处理UTF-8文件名，并对其ZIP / TAR / NSIS代码进行了改...
2048小游戏C++控制台实现
10-20
2048小游戏，VS2013下编译通过，控制台程序，顺便想请教UI该怎么做
2048游戏C++实现
01-09
2048 VS2012 实现 ，简单的逻辑实现，UI界面很丑陋，参考了别人的代码重新做的，注释很详细了！
TANXL_CONSOLE_LIST VERSION_1_5+_Final
03-12
具体完整内容请参考如下链接 https://blog.csdn.net/qq_15722993/article/details/122785594
RSA C++ version
08-28
在这个“RSA C++ Version”项目中，开发者使用了Visual Studio 2012作为开发工具，提供了C++实现RSA算法的示例代码。 RSA的核心原理基于大整数因子分解的困难性。算法主要包括两个密钥：公钥和私钥。公钥可以公开给...
srt-to-vtt-cl:命令行工具，可将字幕文件从SubRib（.srt）格式转换为WebVTT（.vtt）格式
05-22
有关更高级的用法，请参见下文： srt-vtt [-q] [-v] [-r] [-o ] [-t ] [--] [--version] [-h] <string> -q, --quiet Prevents details about the conversion from being printed to the console. Overrides --...
HTC touch2 上实现c++编程
04-13
4. **编译器**：Pocket GCC Version 2.21是用于PPC设备的C++编译器，它允许在移动设备上编译C++代码。 5. **前期准备**：在手机上安装必要的组件，包括ppc控制台程序包、cmd命令行程序和PPC CMDTools，以支持命令行...
如何将VS Code配置为C++编译器和调试器
06-28
### 如何将VS Code配置为C++编译器和调试器 #### 一、概述 在本教程中，我们将详细介绍如何将Visual Studio Code (VS Code) 配置为使用Microsoft Visual C++编译器和调试器进行C++编程。通过一系列步骤，您将学会...
console下写2048
08-20
在console学习2048，里面涉及到部分算法，对于入门c++和一定算法的学习是非常有必要的。
2048游戏C++ Console实现（简单版，未优化代码）
zhuqi12580的专栏
03-28 3025
#include #include #include #include #include #include // 2的概率大于4 #define random_2_4 (rand()%5==4 ? 4:2) #define random_x(x) (rand()%x) using namespace std; // 矩阵大小 const int MAX = 4; const int
C++实现2048小游戏（控制台版的）
热门推荐
今夕何夕
03-13 3万+
无聊，在公司写了个2048小游戏的程序，聊以自娱。（事实是我手机坏了，没得玩）。 很简单，直接上代码了。 #include #include #include using namespace std; int const ROW = 4; int const COL = 4; int game[ROW][COL] = {0}; //上下左右 int const UP = 1;
2048 控制台版(c实现)
DoubleCake的专栏
03-02 1481
这是效果图 用c++写的，其实就是用了c++的输入输出，剩下全是C的内容 代码中有详解，很简单，欢迎借鉴和交流   #include&lt;iostream&gt; #include&lt;stdlib.h&gt; #include&lt;string.h&gt; #include&lt;time.h&gt; #include &lt;conio.h&gt; //为了读取方向键 ...
C++控制台游戏2048
zt_xcyk的专栏
03-04 1415
2048这个游戏相信好多人都玩过，想想其实功能挺简单的，无非就是上下左右移动，然后判断数字，接着随机出现2或者4。 原来我是我用好多函数实现的，显得有点乱。然后看到别人用类实现，创建对象，调用成员函数，感觉写的非常好，借鉴了好多地方改了改。1. 我们先来看看主函数：int main() { unsigned int x = 1, y = 1; while (x == y)
c++实现2048游戏（控制台）
evilperson_xiao的博客
08-10 5067
2048游戏的逻辑比较简单：同一行或者同一列的两个数字，如果值相同并且没有其他数字遮挡，则可以合并为一个数，并且不能连续合并。 刚开始写我考虑的主要是2048的逻辑部分，显示就先low low的用控制台好了，之后有时间再补点写图形界面的功课。 鉴于此，采用view-module分层模式将数据和表示层分离开来，这样之后就算修改了表示层代码，也不需要对数据层的代码做多少改动。 {CSDN:COD
C++写的控制台2048，可能写的很傻，但是我很兴奋
qq_43278522的博客
11-20 656
根据一个老哥的想法完整的补全的2048 哈哈哈！ 原文链接：c++写的一个简单的2048小游戏. //main.cpp #include"game_class.h" #include<cctype> int main() { using std::cout; using std::cin; using std::endl; cout << "=========...
控制台小游戏2048-C++实现
m0_55464171的博客
04-11 317
前言：作者刚学了顺序容器和迭代器，想着做个项目练习和巩固，于是就有了这篇文章。本文会有刻意使用顺序容器和迭代器的代码，希望大家多多包涵。 1.头文件包含 #include<iostream> #include<conio.h>//_getch()函数 #include<array>//定义了顺序容器array的头文件 #include<ctime>//time()函数 #include<iomanip>//setw()函数 using namesp
give a c++ version
08-25
" to the console, followed by a newline character. Finally, the program returns 0 to indicate successful completion. ### 回答2： "给出一个 C 版本"是一个有些模糊的请求，可能指的是在程序设计中使用 C ...
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值