journal article
oaidoi:10.1016/0304-3975(94)90131-7

The Othello game on an n × n board is PSPACE-complete

Authors
Publication date
31 January 1994
Publisher
Published by Elsevier B.V.
Doi

    Abstract

    AbstractGiven an arbitrary position of the Othello game played on an n × n board, the problem of determining the winner is shown to be PSPACE-complete. It can be reduced from generalized geography played on bipartite graphs with maximum degree 3

    Similar works

    Full text

    thumbnail-image

    Elsevier - Publisher Connector

    redirect
    oaidoi:10.1016/0304-3975(94)90131...
    Last time updated on 06/05/2017

    This paper was published in Elsevier - Publisher Connector .

    Having an issue?

    Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.