奇怪的事情就在这里

送交者: 008 于 2016-03-16, 09:06:51:

回答: if you understand the memorization I mentioned, then you know the answers 由 conner 于 2016-03-16, 08:47:45:

按说如果需要重新建树，在时间还很充分的情况下，电脑应该花很长时间长考。但是在实战中尽管用时远远少于对方（一半），电脑仍然在一分种就落子，走出完全不象样的棋来。很象是电脑被人为调了限时，估意放水。根据目前树的大小调整用时是很自然的事，不可能没被写进代码。

所有跟贴:

真有可能是狗在作弊放水。那我就输得冤了。 (无内容) - pgss (0 bytes) 2016-03-16, 10:24:16 (804033)
- no chance (无内容) - conner (0 bytes) 2016-03-16, 10:27:05 (804036)
唯一解释就是它认为这是败招，不需建树。 (无内容) - pgss (0 bytes) 2016-03-16, 09:38:36 (804026)
- no, only when the tree grow decently deeper from there - conner (161 bytes) 2016-03-16, 09:46:17 (804027)
  - but it wasn't in the tree. hassabis said. (无内容) - pgss (0 bytes) 2016-03-16, 09:59:40 (804030)
    - what is the it? the move 78? (无内容) - conner (0 bytes) 2016-03-16, 10:07:05 (804031)
      - Yes。he said 78 is less than one in 10k chance in its estimate (无内容) - pgss (0 bytes) 2016-03-16, 10:15:49 (804032)
        
        then what is the criteria to build a new scenario? (无内容) - pgss (0 bytes) 2016-03-16, 20:44:19 (804062)
        
        That means it was in the tree with a lower Bayesian value - conner (89 bytes) 2016-03-16, 10:26:11 (804034)
the program has a time limitation (run limitation) for each move - conner (366 bytes) 2016-03-16, 09:14:40 (804025)
- 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)

加跟贴