Skip to content

Reduce flash size of TetrisAI_V2 by 97% #5317

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
softhack007 merged 1 commit into from
Jan 27, 2026
Merged

Reduce flash size of TetrisAI_V2 by 97% #5317

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
1 change: 0 additions & 1 deletion usermods/TetrisAI_v2/gridbw.h
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -13,7 +13,6 @@
#ifndef __GRIDBW_H__
#define __GRIDBW_H__

#include <iterator>
#include <vector>
#include "pieces.h"

Expand Down
1 change: 0 additions & 1 deletion usermods/TetrisAI_v2/pieces.h
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -19,7 +19,6 @@
#include <bitset>
#include <cstddef>
#include <cassert>
#include <iostream>

#define numPieces 7

Expand Down
12 changes: 3 additions & 9 deletions usermods/TetrisAI_v2/tetrisbag.h
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -15,7 +15,6 @@

#include <stdint.h>
#include <vector>
#include <algorithm>

#include "tetrisbag.h"

Expand Down Expand Up @@ -87,17 +86,12 @@ class TetrisBag
void queuePiece()
{
//move vector to left
std::rotate(piecesQueue.begin(), piecesQueue.begin() + 1, piecesQueue.end());
for (uint8_t i = 1; i < piecesQueue.size(); i++) {
piecesQueue[i - 1] = piecesQueue[i];
}
piecesQueue[piecesQueue.size() - 1] = getNextPiece();
Comment thread
softhack007 marked this conversation as resolved.
}

void queuePiece(uint8_t idx)
{
//move vector to left
std::rotate(piecesQueue.begin(), piecesQueue.begin() + 1, piecesQueue.end());
piecesQueue[piecesQueue.size() - 1] = Piece(idx % nPieces);
}

void reset()
{
bag.clear();
Expand Down