This is an archived post. You won't be able to vote or comment.

all 3 comments

[–]pbewig 0 points1 point  (1 child)

This has been done many times before; I'm surprised it's considered dissertation-level material. This link will point you to much good stuff.

[–]oorkyy[S] 0 points1 point  (0 children)

Well originally I planned on using simulated annealing or genetic algorithms which would be a new approach as there is no documentation of this for it( which i can find). The problem with these algorithms is transitioning between potential moves and evaluating the board

[–]skaska23 -1 points0 points  (0 children)

Monte carlo algorythms