Jump to content
  • Advertisement
Sign in to follow this  
zaidgs

Possible refinement to verified null-move

This topic is 5131 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

in verified null-moves, if a null fail-high is detected, we reduce search depth by one for that ply. my idea is reduce depth by two when a null fail-high is found, so that tree size will be even closer to standard null-moving, but still avoiding zugwang stuff. i have not done any testing yet, but i wanted to see if other members agree that its a good refinement, or maybe someppl already do that. lets see what u got to say about this.

Share this post


Link to post
Share on other sites
Advertisement
Unfortunately the answer to this question, like 99% of (non-trivial) questions about computer chess, is probably "try it and see".

You might post this to the Computer Chess Club. The author of the verified null move article posts there, as well as many other PhD types and amateur programmers who might have tried your idea.

Share this post


Link to post
Share on other sites
seems this idea is known and implemented in many engines (as i was told in the CCC), but its shame i nvr read about this idea in any computer chess related site. actually the whole verified null-move thing is rarely mentioned.

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!