Artificial Intelligence Asked by Nae on February 11, 2021
I am trying to find a good evaluation function for a game with:
A 7×7 tile board
2 players, given an equal number(>=3 currently undetermined) of stones placed randomly on the tiles
A turn is consisted of a player moving a stone owned by that player, vertically or horizontally but not diagonally to a very next tile of itself
A player loses when out of moves: a player is out of moves when every stone that player owns, has its very next tiles, except not for diagonals necessarily, occupied either by the board edge or other stones
Right now, my evaluation function’s return value increases:
if the total moves available to the player is increasing, and/or
average distance to the middle tile of the board is decreasing
Question: Is there a better strategy? How can I improve my evaluation function?
If you have the best combination of distance between the stones, you should choose the best move to win. In this case, you have to be close to where your opponent plays. It is best to do this by surrounding your opponent's stones. You should always put the first stone in middle or corner of the table.
Answered by Azad İrven on February 11, 2021
Get help from others!
Recent Answers
Recent Questions
© 2024 TransWikia.com. All rights reserved. Sites we Love: PCI Database, UKBizDB, Menu Kuliner, Sharing RPP