alpha-beta searching with time limitation

Hi. I am currently looking for an example on alpha-beta search with can search based on the time limitation.

Let's say you give it depth 10. While it found out it is near the time limitation (let's say time limi is 10 seconds and it reach 9 seconds, it will reduce other branch depth and return the best result in excatly 10 seconds.

do any one have example of this source code in java since i need to use this features in my board game program.



Sign In or Register to comment.

Howdy, Stranger!

It looks like you're new here. If you want to get involved, click one of these buttons!