It is shown that, given an arbitrary GO position on an n Ã— n board, the problem of determining the winner is Pspace hard. New techniques are exploited to overcome the difficulties arising from theâ€¦ (More)

I t is proved that a natural general izat ion of chess to an n x n board is complete in exponential time. This implies that there ex is t chess-positions on an n x n chess-board for which the problemâ€¦ (More)

19th Annual Symposium on Foundations of Computerâ€¦

1978

A great deal of effort has been spent in the search for optimal and computationally feasible game strategies. In some cases (e.g. Bridge-it, Nim), such strategies have been found, \vhile in othersâ€¦ (More)

We consider a simple model for a class of discrete control processes, motivated in part by recent work about the behavior of imperfect random sources in computer algorithms. The process produces aâ€¦ (More)

26th Annual Symposium on Foundations of Computerâ€¦

1985

In this paper we propose two new multi-layer grid models for VLSI layout, both of which take into account the number of contact cuts used. For the first model in which nodes "exist" only on oneâ€¦ (More)

We consider a simple abstract model for a class of discrete control processes, motivated in part by recent work about the behavior of imperfect random sources in computer algorithms. The processâ€¦ (More)