Jump to content
  • Advertisement
Sign in to follow this  
crypto_rsa

Symmetric moves

This topic is 3799 days old which is more than the 365 day threshold we allow for new replies. Please post a new topic.

If you intended to correct an error in the post then please contact us.

Recommended Posts

Hi, in my game-playing algorithm I am trying to remove symmetric moves. That is, I am not searching those moves that create a game board situation symmetric to another situation already created by another move in my list (there are 20 known symmetries - permutations of the game board - in my game). My question is, whether the evaluations returned from the minimax algorithm are necessarily the same both when checking and not checking the symmetries?

Share this post


Link to post
Share on other sites
Advertisement
If you have a vanilla minimax searcher and all your heuristics are symmetric, then the answer is yes. You can use alphabeta and the answer should still be yes.

If you implement transposition tables, or some heuristic that depends on move ordering (e.g., the so-called "history heuristic"), then you'll probably get slightly different results, because of something known as "search instability".

Share this post


Link to post
Share on other sites
Sign in to follow this  

  • Advertisement
×

Important Information

By using GameDev.net, you agree to our community Guidelines, Terms of Use, and Privacy Policy.

We are the game development community.

Whether you are an indie, hobbyist, AAA developer, or just trying to learn, GameDev.net is the place for you to learn, share, and connect with the games industry. Learn more About Us or sign up!

Sign me up!