QTetris -- Qt5之QGraphicsItem编写Tetris俄罗斯方块游戏

class CustomGraphBase : public QGraphicsObject
{
    Q_OBJECT
public:
	CustomGraphBase();
public:
	virtual QRectF boundingRect() const = 0;  //占位区域，必须准确，才能很好的显示与清除
	virtual int type() const = 0;             
	virtual void relocate() = 0;              //移动，重定位
	virtual bool isActive() { return false; };//未落地的方块
	virtual int getBlockType() { return 0; }; //方块类型，主要区别边沿方块
};

void CustomGraphTetrisBlock::paint(QPainter* painter, const QStyleOptionGraphicsItem* option, QWidget* widget /*= nullptr*/)
{
	if (blockType) {
		painter->drawRoundedRect(
			0,
			0,
			BLOCKSIDEWIDTH,
			BLOCKSIDEWIDTH,
			2, 2
		);
	}
	//prepareGeometryChange();
}

void CustomGraphTetrisBlock::relocate()
{
	this->setPos(pos * BLOCKSIDEWIDTH);
	prepareGeometryChange();
}

QVector<QVector<int>> SHAPES = {
	{1, 1, 1, 1},
	{0, 1, 1, 1, 0 , 1},
	{1, 1, 1, 0, 0, 0, 1},
	{0, 1, 1, 0, 0, 1, 1},
	{1, 1, 0, 0, 0, 1, 1},
	{0, 1, 1, 0, 1, 1},
	{0, 1, 0, 0, 1, 1, 1} 
};

QVector<int> curShape = SHAPES[shape % SHAPES.size()];
	for (int i = 0; i < curShape.size(); i++) {
		if (curShape[i]) {
			data[1 + i / sideLen][i % sideLen] = true;
			CustomGraphTetrisBlock* block = new CustomGraphTetrisBlock(pos + QPoint(i % sideLen, 1 + i / sideLen), 2, shape);
			blocks.push_back(block);   //存储组成该方块的所有元素，在落到底之前需要由Tetris类控制其运动
			MainWindow::GetApp()->GetScene()->addItem(block);                                   //加入block到scene，显示方块
		}
	}

CustomGraphTetrisBlock* Tetris::hasTetrisBlock(int x, int y)
{
	auto items = MainWindow::GetApp()->GetScene()->items(QPointF((x + 0.5) * BLOCKSIDEWIDTH, (y + 0.5) * BLOCKSIDEWIDTH));
	foreach (auto al , items)
	{
		if (!(((CustomGraphBase*)al)->isActive()) && (((CustomGraphBase*)al)->type()) == TETRISBLOCKTYPE) {      //要区别组合俄罗斯方块本身的block与其它的block
			return (CustomGraphTetrisBlock*)al;  //返回方块，提供给清除行操作用
		}
	}
	return nullptr;
}

bool Tetris::rotate()
{
    int i, j, t, lenHalf = sideLen / 2, lenJ;
    for (i = 0; i < lenHalf; i++)
    {
        lenJ = sideLen - i - 1;
		for (j = i; j < lenJ; j++)
		{        //先行判断是否能旋转，要移动的点不为0时，判断目标点是否已经有block存在
			int lenI = sideLen - j - 1;
			if (data[i][j] && this->hasTetrisBlock(pos.x() + lenJ, pos.y() + j) ||
				data[lenI][i] && this->hasTetrisBlock(pos.x() + j, pos.y() + i) ||
				data[lenJ][lenI] && this->hasTetrisBlock(pos.x() + i, pos.y() + lenI) ||
				data[j][lenJ] && this->hasTetrisBlock(pos.x() + lenI, pos.y() + lenJ)){
                return false;
            }
        }
    }
    for (i = 0; i < lenHalf; i++)
	{       //选择了顺时针90度旋转，使用了螺旋移动算法，网上可以容易搜索到说明。
		lenJ = sideLen - i - 1;
		for (j = i; j < lenJ; j++)
		{
            int lenI = sideLen - j - 1;
			t = data[i][j];
            data[i][j] = data[lenI][i];
            data[lenI][i] = data[lenJ][lenI];
            data[lenJ][lenI] = data[j][lenJ];
            data[j][lenJ] = t;
		}
	}
	this->relocate();
	return true;
}

int Tetris::cleanRow()
{       //该清除算法效率不高，是以一行来处理的，这块以后可以优化。
	int h = 19, levelCount = 0;
	while (h >= 0) {
		int count = 0;
		for (int i = 0; i < 10; i++) {  //判断是否行满
			if (!this->hasTetrisBlock(i, h)) {
				count++;
			}
		}
		if (count == 0) {               //行满，需要清除并整体下移
			int level = h;
			levelCount++;
			bool first = true;
			while (level >= 0) {
				int ct = 0;
				for (int j = 0; j < 10; j++) {
					if(first)      //第一个外循环删除满行上的图元，后面是整体下移
						this->erase(j, level);
					CustomGraphTetrisBlock* block = this->hasTetrisBlock(j, level - 1);
					if (!block) {
						ct++;
					}
					else {
						block->relocate(QPoint(j, level));     //下移一个位置
					}
				}
				first = false;
				if (ct == 10) {           //一行上都没有图元，工作完成，提前结束
					break;
				}
				else {
					level--;
				}
			}
		}
		else if (count == 10) {
			break;
		}
		else {
			h--;
		}
	}
	return levelCount;
}

cmake -Bbuild .
cd build
cmake --build . --config Release

https://gitee.com/zhoutk/qtetris.git

https://gitee.com/zhoutk/qtdemo/tree/master/tetrisGraphicsItem

https://github.com/zhoutk/qtDemo/tree/master/tetrisGraphicsItem