메뉴 건너뛰기




Volumn 2063, Issue , 2001, Pages 250-261

Simple amazons endgames and their connection to Hamilton circuits in cubic subgrid graphs

Author keywords

Amazons endgame; NP complete; Planning; Puzzle

Indexed keywords

PLANNING; RECONFIGURABLE HARDWARE;

EID: 84958748585     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45579-5_17     Document Type: Conference Paper
Times cited : (20)

References (11)
  • 1
    • 0007951596 scopus 로고    scopus 로고
    • How machines have learned to play Othello
    • M. Buro. How machines have learned to play Othello. IEEE Intelligent Systems J., 14(6): 12-14, 1999.
    • (1999) IEEE Intelligent Systems J , vol.14 , Issue.6 , pp. 12-14
    • Buro, M.1
  • 2
    • 0002276962 scopus 로고    scopus 로고
    • Sokoban is PSPACE-complete
    • arleton Scientific, Waterloo, Canada
    • J. Culberson. Sokoban is PSPACE-complete. In Proceedings in Informatics 4, pages 65-76, arleton Scientific, Waterloo, Canada, 1999.
    • (1999) Proceedings in Informatics 4 , pp. 65-76
    • Culberson, J.1
  • 3
    • 24644460016 scopus 로고    scopus 로고
    • The significance of Kasparov versus Deep Blue and the future of computer chess
    • D. DeCoste. The significance of Kasparov versus Deep Blue and the future of computer chess. ICCA J., 21(1): 33-43, 1998.
    • (1998) ICCA J , vol.21 , Issue.1 , pp. 33-43
    • DeCoste, D.1
  • 4
    • 84969368390 scopus 로고    scopus 로고
    • RushHour is PSPACE-complete, or why you should generously tip parking lot attendants
    • G.W. Flake and E.B. Baum. RushHour is PSPACE-complete, or why you should generously tip parking lot attendants. to appear in TCS, 2000.
    • (2000) To appear in TCS
    • Flake, G.W.1    Baum, E.B.2
  • 7
    • 0002648128 scopus 로고    scopus 로고
    • Drawing planar graphs using thefficanonical ordering
    • G. Kant. Drawing planar graphs using thefficanonical ordering. Algorithmica, 16(1): 4-32, 1996.
    • (1996) Algorithmica , vol.16 , Issue.1 , pp. 4-32
    • Kant, G.1
  • 9
    • 0003161393 scopus 로고    scopus 로고
    • Computer Go: A research agenda
    • M. Müller. Computer Go: A research agenda. ICCA Journal, 22(2): 104-112, 1999.
    • (1999) ICCA Journal , vol.22 , Issue.2 , pp. 104-112
    • Müller, M.1
  • 10
    • 0039933545 scopus 로고
    • The NP-completeness of the Hamiltonian cycle problem in planar digraphs with degree bound two
    • J. Plesnik. The NP-completeness of the Hamiltonian cycle problem in planar digraphs with degree bound two. Information Processing Letters, 8(4): 199-201, 1979.
    • (1979) Information Processing Letters , vol.8 , Issue.4 , pp. 199-201
    • Plesnik, J.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.