Erik D. Demaine Martin L. Demaine Rudolf Fleischer August 13, 2003 MIT...  Home/Search
Context
Related
| cs.ust.hk/faculty/rudo...clobber_tcs.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cs.ust.hk/faculty/rudolf/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Clobber is a new two-player board game. In this paper, we introduce the one-player variant Solitaire Clobber where the goal is to remove as many stones as possible from the board by alternating white and black moves. We show that a n stone checkerboard configuration on a single row (or single column) can be reduced to about n/4 stones. For boards with at least two rows and two columns, we show that a checkerboard configuration can be reduced to a single stone if and only if the number of stones ... (Update)
Similar documents (at the sentence level):
28.8%: Solitaire Clobber - Demaine, Demaine, Fleischer (Correct)
Active bibliography (related documents): More All
0.1: Improving the efficiency of UNIX file buffer caches - Braunstein, Riley, Wilkes (1989) (Correct)
0.1: An Environment For Importance Sampling Based On Stochastic.. - Obal, II, Sanders (1994) (Correct)
0.1: Approximating UNITY - Dingel (1997) (Correct)
Similar documents based on text: More All
0.6: When Can You Fold a Map? - Arkin, Bender, Demaine, Demaine.. (Correct)
0.6: Balanced k-Colorings - Biedl, Cenek, Chan, Demaine.. (Correct)
0.4: Folding and Cutting Paper - Demaine, Demaine, Lubiw (1998) (Correct)
BibTeX entry: (Update)
@misc{ martin-solitaire,
author = "Erik Demaine Martin",
title = "Solitaire Clobber",
url = "citeseer.ist.psu.edu/635269.html" }
Citations (may not include all citations):116 Winning Ways for Your Mathematical 14 Plays (context) - Berlekamp, Conway et al. - 2001
55 Hamilton paths in grid graphs (context) - Itai, Papadimitriou et al. - 1982
10 Private communication (context) - Grossmann - 2002
8 Private communication (context) - Nowakowski - 2002
3 Dagstuhl Seminar on Algorithmic Combinatorial Game Theory (context) - Demaine, Fleischer et al.
1 A Small Cases Our proof of Theorem 5 requires us to verify r.. (context) - Wolfe, http et al. - 2002
Documents on the same site (http://www.cs.ust.hk/faculty/rudolf/): More
Graph Drawing and its Applications - Fleischer, Hirsch (Correct)
The Complexity of Clickomania - Biedl, Demaine, Demaine, Fleischer.. (Correct)
Optimal Robot Localization in Trees - Fleischer, Romanik (2000) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC