beenull/ladybird
1
0
Fork 0
mirror of https://github.com/LadybirdBrowser/ladybird.git synced 2024-11-26 09:30:24 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions 7

2048: Minimize player score when selecting worst tile

Browse source 
Maximizing the board population still takes priority, but if there are
tile generator "moves" that result in equivalent board population after
a player move, the one with the lowest score is selected.
This commit is contained in:
Dmitrii Ubskii 2021-05-16 19:17:01 +03:00 committed by Linus Groh
parent a93d0fe8c2
commit 94569e52f5
Notes: sideshowbarker 2024-07-18 17:52:29 +09:00 
Author: https://github.com/dmitrii-ubskii
Commit: https://github.com/SerenityOS/serenity/commit/94569e52f56
Pull-request: https://github.com/SerenityOS/serenity/pull/7146
Reviewed-by: https://github.com/bugaevc ✅
Reviewed-by: https://github.com/linusg
1 changed files with 18 additions and 7 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

25
Userland/Games/2048/Game.cpp
View file

@ -227,6 +227,7 @@ void Game::add_evil_tile()
u32 worst_value = 2;
size_t most_free_cells = NumericLimits<size_t>::max();
size_t worst_score = NumericLimits<size_t>::max();
for (size_t row = 0; row < m_grid_size; row++) {
for (size_t column = 0; column < m_grid_size; column++) {
@ -246,24 +247,34 @@ void Game::add_evil_tile()
goto found_worst_tile;
}
// This is the best outcome the player can achieve in one move.
// These are the best outcome and score the player can achieve in one move.
// We want this to be as low as possible.
size_t best_outcome = 0;
size_t best_score = 0;
for (auto direction : Array { Direction::Down, Direction::Left, Direction::Right, Direction::Up }) {
Game moved_state = saved_state;
bool moved = moved_state.slide_tiles(direction);
if (!moved) // invalid move
continue;
best_outcome = max(best_outcome, get_number_of_free_cells(moved_state.board()));
best_score = max(best_score, moved_state.score());
}
if (best_outcome < most_free_cells) {
worst_row = row;
worst_column = column;
worst_value = value;
// We already know a worse cell placement; discard.
if (best_outcome > most_free_cells)
continue;
most_free_cells = best_outcome;
}
// This tile is the same as the worst we know in terms of board population,
// but the player can achieve the same or better score; discard.
if (best_outcome == most_free_cells && best_score >= worst_score)
continue;
worst_row = row;
worst_column = column;
worst_value = value;
most_free_cells = best_outcome;
worst_score = best_score;
}
}
}