search

danzel / PatchworkSim

Simulation of the board game Patchwork for AI exploration
2 stars 0 forks source link

Current placement strength #26

Closed danzel closed 6 years ago

danzel commented 6 years ago

FirstPossible 1093 SimpleClosestToWallAndCorner 1208 ClosestToCornerLeastHolesTieBreaker 1236 NextToPieceEdgeLeastHolesTieBreaker 1157 Tight x2 1291 Tight +1 1279 ExhaustiveMostFuturePlacements(1-1) 1308 ExhaustiveMostFuturePlacements(1-6) 1305 WeightedTreeSearch(1000@4+Tight(True@1)) 1378 WeightedTreeSearch(1000@8+Tight(True@1)) 1349 WeightedTreeSearch(10000@4+Tight(True@1)) 1402 WeightedTreeSearch(10000@8+Tight(True@1)) 1377 WeightedTreeSearch(1000@4+Tight(False@1)) 1368 WeightedTreeSearch(1000@8+Tight(False@1)) 1355 WeightedTreeSearch(10000@4+Tight(False@1)) 1398 WeightedTreeSearch(10000@8+Tight(False@1)) 1374

danzel commented 6 years ago

WeightedTreeSearch(1000@2+Tight(False@1)) 1402 WeightedTreeSearch(1000@2+Tight(True@1)) 1402 WeightedTreeSearch(10000@2+Tight(False@1)) 1424 WeightedTreeSearch(10000@2+Tight(True@1)) 1430 WeightedTreeSearch(1000@3+Tight(True@1)) 1381 WeightedTreeSearch(1000@3+Tight(False@1)) 1383 WeightedTreeSearch(1000@4+Tight(False@1)) 1370 WeightedTreeSearch(1000@4+Tight(True@1)) 1378 WeightedTreeSearch(1000@8+Tight(True@1)) 1353 WeightedTreeSearch(1000@8+Tight(False@1)) 1341 WeightedTreeSearch(10000@3+Tight(True@1)) 1415 WeightedTreeSearch(10000@3+Tight(False@1)) 1411 WeightedTreeSearch(10000@4+Tight(False@1)) 1403 WeightedTreeSearch(10000@4+Tight(True@1)) 1401 WeightedTreeSearch(10000@8+Tight(False@1)) 1377 WeightedTreeSearch(10000@8+Tight(True@1)) 1385

Smaller breadths ran even better. Could possibly do an exhaustive tree search of size 2-3?