Skip to content

Update pollux.ts #431

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
jpneto merged 1 commit into from
Jun 20, 2026
Merged

Update pollux.ts #431

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
30 changes: 14 additions & 16 deletions src/games/pollux.ts
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -204,26 +204,24 @@ export class PolluxGame extends GameBase {
const empties = (this.graph.listCells() as string[]).filter(c => !this.board.has(c));

///// hack: to work with AP's playground (since flags no-moves and automove are incompatible)
// this is the computational heaviest ply of the game
if (! safe ) {
const ply2moves: string[] = [];
this.shuffle(empties);
for (const cell of empties) {
if ( this.nNeighbors(cell).length === 0 ) {
for (const cell1 of empties) {
if ( cell === cell1 ) { continue; }
if ( this.nNeighbors(cell1).length === 0 &&
!this.graph.neighbours(cell).includes(cell1) ) {
ply2moves.push(`${cell},${cell1}`);
}
// this is the computational heaviest ply of the game, computing all possible moves is unfeasible
this.shuffle(empties);
for (const cell of empties) {
if ( this.nNeighbors(cell).length === 0 ) {
for (const cell1 of empties) {
if ( cell === cell1 ) { continue; }
if ( this.nNeighbors(cell1).length === 0 &&
!this.graph.neighbours(cell).includes(cell1) ) {
moves.push(`${cell},${cell1}`);
}
}
if (ply2moves.length === 2) { return ply2moves; }
}
if (moves.length > 2) { break; }
}
//// end hack

for (const cell of empties) {
/* validateMove does not need this computation, which is too costly: O(n^4)
for (const cell of empties) {
if ( this.nNeighbors(cell).length === 0 ) {
for (const cell1 of empties) {
if ( cell === cell1 ) { continue; }
Expand All @@ -233,7 +231,7 @@ export class PolluxGame extends GameBase {
}
}
}
}
}*/
}

if ( this.stack.length === 4 ) {
Expand Down Expand Up @@ -269,7 +267,7 @@ export class PolluxGame extends GameBase {
}
}
}

if (! safe ) { // shows a sample of moves (just for the frontend, the code will keep `safe` as true)
this.shuffle(moves);
return moves.slice(0, 50); // output a random (smallish) selection of moves
Expand Down
Loading