Back to Results
First PageMeta Content
Heuristics / Sokoban / Heuristic function / Algorithm / A* search algorithm / Deadlock / Reduction / Admissible heuristic / Local search / Theoretical computer science / Mathematics / Applied mathematics


Sokoban: A Challenging Single-Agent Search Problem Andreas Junghanns, Jonathan Schae er University of Alberta
Add to Reading List

Document Date: 2010-06-10 17:17:06


Open Document

File Size: 320,17 KB

Share Result on Facebook

City

New York / /

Company

L M N O P Q R S a / Ge / /

Country

Japan / Canada / /

/

Facility

Tunnel Macros / square YY / University of Alberta Dept. / square Fg / University of Alberta / /

IndustryTerm

goal-driven search / heuristic search / su cient computing resources / admissible tree search / brute-force search / iterative-deepening search / partition search / unnecessary search / pre-search phase / line search / search tree size / search algorithm / human solution / search problems / search algorithms / agent search / backward search / deep solutions / ordinary single-agent search problem / search literature / search cost / pre-search computations / pre-search analysis / search techniques / search tree / search depth / also be solved using a backward search / /

MarketIndex

set 90 / /

MusicAlbum

Ce / /

Organization

University of Alberta Dept. of Computing Science Edmonton / Northwestern University / University of Alberta / German Academic Exchange Service / Killam Foundation / Natural Sciences and Engineering Research Council of Canada / Pattern Analysis and Machine Intelligence / /

Person

Ian Parsons / Andrew Myers / Jonathan Schae / Joe Culberson / Aske Plaat / Roel van der Goot / Chess Skill / John Buchanan / Yngvi Bjornsson / Andreas Junghanns / /

Position

original author / editor / /

ProvinceOrState

Alberta / New York / /

PublishedMedium

IEEE Transactions on Pattern Analysis and Machine Intelligence / /

Technology

search algorithm / search algorithms / IDA* technology / /

URL

http /

SocialTag