Peter Ridinger und Time-Efficient - Info zur Person

(1 - 13 von 14

)

An Algorithm Faster than NegaScout and SSS* in PracticeUniversity of Alberta

webdocs.cs.ualberta.ca

von A Plaat · Zitiert von: 14 — [24] Alexander Reinefeld and Peter Ridinger. Time-efficient state space search. Artificial. Intelligence, 71(2):397–408, › ai_publications

+ TT · Contents 1 Introduction 1 2 SSS* 2 3 Reformulating SSS ...

pdfslide.net

[25] Alexander Reinefeld and Peter Ridinger. Time-efficient state space search. Arti-ficial Intelligence, 71(2):397–408, › Documents

New Advances in Alpha-Beta SearchingInternet Archive Scholar

scholar.archive.org

von J Schaeffer · Zitiert von: 65 — [23] Alexander Reinefeld and Peter Ridinger. Time-efficient state space search. Artificial Intelligence, 71(2):397–. 408, [24] Jonathan Schaeffer.

[PDF] Computer Science and Information Systems - Index of /www.cloud.politala.ac.id › politala › Jurnal › JurnalTI

www.cloud.politala.ac.id

Alexander Reinefeld, and Peter Ridinger: Time-Efficient State Space Search. Artificial Intelligence Vol. 71, No. 2, (1994).

Alexander Reinefeld - DBLP - Schloss DagstuhlDagstuhl

dblp.dagstuhl.de

Alexander Reinefeld, Peter Ridinger: Time-Efficient State Space Search. Artif. Intell. 71(2): (1994) text to speech. › Persons

Trends in Game Tree SearchResearchGate

www.researchgate.net

Alexander Reinefeld · Peter Ridinger. We present two time-efficient state space algorithms for searching minimax trees. Because they are based on SSS∗ and ...

Alexander Reinefeld - Chessprogramming wikiChess Programming Wiki

www.chessprogramming.org

ISSN pdf; Alexander Reinefeld, Peter Ridinger (1994). Time-Efficient State Space Search. Artificial Intelligence, Vol. 71, No. 2, CiteSeerX ...

AIJ71

www.ida.liu.se

Geometric reasoning about mechanical assembly. Pages j-aij : Alexander Reinefeld and Peter Ridinger: Time-efficient state space search. › aij › indlis

Figure1:H ow PS*(2) Partitions a Tree.ResearchGate

www.researchgate.net

Alexander Reinefeld · Peter Ridinger. We present two time-efficient state space algorithms for searching minimax trees. Because they are based on SSS∗ and ... › fig...

[18] Alexander Reinefeld and Peter Ridinger. Time-efficient state space search. Artificial Intelligence, 71(2):397?408, [19] Igor Roizen and Judea Pearl. A minimax algorithm better than alpha-beta? Yes and no. Artificial Intelligence, 21: 199?230, [20] Jonathan Schaeffer. Experiments in Search and Knowledge.