Online JudgeProblem SetAuthorsOnline ContestsUser
Web Board
Home Page
F.A.Qs
Statistical Charts
Problems
Submit Problem
Online Status
Prob.ID:
Register
Update your info
Authors ranklist
Current Contest
Past Contests
Scheduled Contests
Award Contest
User ID:
Password:
  Register

Re:原来极大极小过程中的alpha-beta剪枝是不能配合记忆化搜索的

Posted by AkemiHomura at 2012-08-01 17:35:37 on Problem 3317
In Reply To:原来极大极小过程中的alpha-beta剪枝是不能配合记忆化搜索的 Posted by:ZaakDov at 2009-10-19 23:36:56
> alpha-beta剪枝使得每一个子状态在它的父亲兄弟们的约束下,得出一个相应得值,所以与其父兄节点有关系,而记忆化搜索则默认子节点只与自己的状态有关系,忽略了父兄的约束条件,实际上一颗博弈树上可能有多颗节点同时指向一个节点,若把alpha-beta与记忆化结合起来,那么该节点将只被一组父兄节点限制一次,也就只考虑了这组父兄所带来的alpha-beta界剪枝下的结果,很有可能把本属于另外组别父兄节点的最优解给误剪掉了……
> 调了8个小时不吃不喝始终也过不了自己出的数据,原来算法错了,唉!

今天被sgu423卡死,原来您在3年前就遇到过这个问题!!!

Followed by:

Post your reply here:
User ID:
Password:
Title:

Content:

Home Page   Go Back  To top


All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator