d.thach
/
omnichess
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Moved the base priority calculation to the BestMoveSearcher class

master
Dany Thach 2025-02-16 13:42:30 +01:00
parent da28e94c01
commit 0469760f30
2 changed files with 6 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
lib/classes/best_move_searcher.dart
View File

@ -98,6 +98,11 @@ class BestMoveSearcher {
return value;
}
static int getPositionBasePriority(Position position, int value, Iterable<(String, Position)> legalMoves, int depth) =>
legalMoves.isEmpty
? Numbers.maxInteger
: 0;
Future<String?> search(Position position, int? moveTime) async {
_isRunning = true;
PositionTreeNode positionTree = PositionTreeNode.fromPosition(position);

7
lib/data_structures/position_tree_node.dart
View File

@ -37,7 +37,7 @@ class PositionTreeNode {
final int value = BestMoveSearcher.getPositionBaseValue(position);
final Iterable<(String, Position)> legalMoves = LegalMoves.getLegalMoves(position);
return PositionTreeNode(
priority: getPositionBasePriority(position, value, legalMoves, 0),
priority: BestMoveSearcher.getPositionBasePriority(position, value, legalMoves, 0),
value: value,
move: move,
position: position,
@ -88,9 +88,4 @@ class PositionTreeNode {
value = childrenByValue.first.value;
}
static int getPositionBasePriority(Position position, int value, Iterable<(String, Position)> legalMoves, int depth) =>
legalMoves.isEmpty
? Numbers.maxInteger
: 0;
}