ctdo
/
borgware-2d
16
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

make up

This commit is contained in:
Christian Kroll 2010-12-15 18:44:07 +00:00
parent 02c1038dc6
commit 8e2261eddd
1 changed files with 6 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

12
games/tetris/variant_bastet.c
View File

@ -102,11 +102,11 @@ void tetris_bastet_doPreprocessing(tetris_bastet_variant_t *pBastet)
* @param nStopCol the last column of the range to be predicted * @param nStopCol the last column of the range to be predicted
*/ */
void tetris_bastet_calcPredictedColHeights(tetris_bastet_variant_t *pBastet, void tetris_bastet_calcPredictedColHeights(tetris_bastet_variant_t *pBastet,
tetris_piece_t *pPiece, tetris_piece_t *pPiece,
int8_t nDeepestRow, int8_t nDeepestRow,
int8_t nColumn, int8_t nColumn,
int8_t nStartCol, int8_t nStartCol,
int8_t nStopCol) int8_t nStopCol)
{ {
// go through every row and calculate column heights // go through every row and calculate column heights
tetris_bucket_iterator_t iterator; tetris_bucket_iterator_t iterator;
@ -174,7 +174,7 @@ static int16_t tetris_bastet_evaluateMove(tetris_bastet_variant_t *pBastet,
pPiece, pBastet->pStartingRow[nColumn + 3], nColumn); pPiece, pBastet->pStartingRow[nColumn + 3], nColumn);
// in case the prediction fails we return the lowest possible score // in case the prediction fails we return the lowest possible score
if (nDeepestRow == TETRIS_BUCKET_INVALIDROW) if (nDeepestRow <= TETRIS_BUCKET_INVALIDROW)
{ {
return -32766; return -32766;
} }