the program has a time limitation (run limitation) for each move

送交者: conner 于 2016-03-16, 09:14:40:

回答: 奇怪的事情就在这里由 008 于 2016-03-16, 09:06:51:

When the current branch is small, the search finishes quickly.

For every update, the program only grow the tree limited deeper and wider.

How to allocation time is an even harder problem for the program. So I assume it currently implements a simple approach.

The advantage is that the program can use the time Lee thinks to catch up and grow the tree.

The time limit was 5 seconds per move when against Fan Hui (无内容) - conner (0 bytes) 2016-03-16, 12:47:05 (804048)
当对手下出意料之外的棋 - 008 (442 bytes) 2016-03-16, 11:49:15 (804043)
- time/resource allocation during a game is a deep-deep problem - conner (377 bytes) 2016-03-16, 12:05:27 (804046)
  - It is like to predict how long 'Lee' and itself will take for next N moves (无内容) - conner (0 bytes) 2016-03-16, 12:10:12 (804047)
make no sense again (无内容) - 008 (0 bytes) 2016-03-16, 10:33:37 (804037)
- the time limit for each move or tree operation? (无内容) - conner (0 bytes) 2016-03-16, 11:50:12 (804044)
  - time limit (无内容) - 008 (0 bytes) 2016-03-16, 12:00:06 (804045)