Back to Results
First PageMeta Content
Artificial intelligence / Game artificial intelligence / Search algorithms / Constraint satisfaction problem / Heuristic function / Alpha-beta pruning / Local consistency / Minimax / Heuristic / Constraint programming / Mathematics / Theoretical computer science


A Value Ordering Heuristic for Solving Ultra-Weak Solutions in Minimax Weighted CSPs∗ Jimmy H.M. Lee & Terrence W.K. Mak Department of Computer Science and Engineering The Chinese University of Hong Kong Shatin, N.T.,
Add to Reading List

Document Date: 2013-10-06 08:30:52


Open Document

File Size: 302,12 KB

Share Result on Facebook

Company

Princeton University Press / Pearson / Cambridge University Press / Brown / /

/

Facility

Engineering The Chinese University of Hong Kong Shatin / University of Limburg / /

IndustryTerm

adversarial search / alpha-beta tree search / ultraweak solutions / ultra-weak solutions / solved solution / minimax game search / alphabeta tree search / solved solutions / computing / ultra-weak solution / larger search space / ultraweak solution / search space / bound search / bound algorithm / /

Organization

Cambridge University / Core2 Duo / MWCSP P / Chinese University of Hong Kong Shatin / Research Grants Council of Hong Kong SAR / CSP P / Minimax Weighted CSPs∗ Jimmy H.M. Lee & Terrence W.K. Mak Department of Computer Science / Princeton University / University of Limburg / /

Person

Lex Time / Terrence W.K. Mak / J. Yip / /

Position

reward player / max player / min player / maximum costs player / player / /

PublishedMedium

Games and Economic Behavior / /

Technology

alpha / artificial intelligence / /

SocialTag