a comparison of the monte carlo and min-max...

8
A Comparison of the Monte Carlo and Min-Max algorithms EDAN70 Dragan Adzaip & Måns Ansgariusson

Upload: others

Post on 08-Sep-2020

1 views

Category:

Documents


0 download

TRANSCRIPT

Page 1: A Comparison of the Monte Carlo and Min-Max algorithmsfileadmin.cs.lth.se/cs/Education/edan70/AIProjects/... · Min-Max •Depthbound •Alpha-beta pruned. Experiments •Monte Carlo

AComparisonoftheMonteCarloandMin-Maxalgorithms

EDAN70Dragan Adzaip & Måns Ansgariusson

Page 2: A Comparison of the Monte Carlo and Min-Max algorithmsfileadmin.cs.lth.se/cs/Education/edan70/AIProjects/... · Min-Max •Depthbound •Alpha-beta pruned. Experiments •Monte Carlo

1100gamesof chess

Page 3: A Comparison of the Monte Carlo and Min-Max algorithmsfileadmin.cs.lth.se/cs/Education/edan70/AIProjects/... · Min-Max •Depthbound •Alpha-beta pruned. Experiments •Monte Carlo

MonteCarlo• Randomness• Time bound• Depth bound

Page 4: A Comparison of the Monte Carlo and Min-Max algorithmsfileadmin.cs.lth.se/cs/Education/edan70/AIProjects/... · Min-Max •Depthbound •Alpha-beta pruned. Experiments •Monte Carlo

Min-Max• Depth bound• Alpha-beta pruned

Page 5: A Comparison of the Monte Carlo and Min-Max algorithmsfileadmin.cs.lth.se/cs/Education/edan70/AIProjects/... · Min-Max •Depthbound •Alpha-beta pruned. Experiments •Monte Carlo

Experiments• Monte Carlo vs Min-Max time and depth bound• Monte Carlo time bound vs Min-Max without restrictions

Page 6: A Comparison of the Monte Carlo and Min-Max algorithmsfileadmin.cs.lth.se/cs/Education/edan70/AIProjects/... · Min-Max •Depthbound •Alpha-beta pruned. Experiments •Monte Carlo

Results

Page 7: A Comparison of the Monte Carlo and Min-Max algorithmsfileadmin.cs.lth.se/cs/Education/edan70/AIProjects/... · Min-Max •Depthbound •Alpha-beta pruned. Experiments •Monte Carlo

Results

Page 8: A Comparison of the Monte Carlo and Min-Max algorithmsfileadmin.cs.lth.se/cs/Education/edan70/AIProjects/... · Min-Max •Depthbound •Alpha-beta pruned. Experiments •Monte Carlo

Thank you forlistening!• Questions?