Puzzled: Solutions and sources

Author:
Peter Winkler

Dartmouth College, Hanover, NH

Dartmouth College, Hanover, NH
View Profile

Authors Info & Claims

Communications of the ACM Volume 57 Issue 9September 2014pp 102https://doi.org/10.1145/2642744

Published:01 September 2014Publication History

Communications of the ACM

Abstract

Last month (August 2014), we presented three puzzles concerning the Path Game and the Match Game, each of which can be played on any finite graph. To start, Alice marks a vertex; Bob and Alice then alternate marking vertices until one (the loser) is unable to mark any more. In the Path Game, each vertex thus marked, following the first one, must be adjacent to the most recently marked vertex. In the Match Game, only Bob has this constraint, whereas Alice can mark any vertex.

Index Terms

Puzzled: Solutions and sources
1. Mathematics of computing

Recommendations

Puzzled: Solutions and sources

Last month (February 2014) we posted three games in which you were asked to pick a positive integer. The question in each was: What is the highest number you should think about picking? Here, we offer solutions to all three. How did you do?

1. Found ...
Read More
Puzzled: Solutions and sources

Last month (Aug. 2013) you needed to win several chess games in a row, alternately playing white and black, and had to decide with which color you should start.

Read More
Affirmative Solutions on Local Antimagic Chromatic Number
Abstract
An edge labeling of a connected graph $G = (V, E)$ is said to be local antimagic if it is a bijection $f : E \to {1, \dots, | E |}$ such that for any pair of adjacent vertices x and y, $f^{+} (x) \neq f^{+} (y)$ , where the induced vertex label $f^{+} (x) = \sum f (e)$ , with e ranging over all ... $_{}$ $_{}_{}$ $_{}_{}$
Read More

Comments

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

Published in
Communications of the ACM Volume 57, Issue 9
September 2014
94 pages
ISSN:0001-0782
EISSN:1557-7317
DOI:10.1145/2663191
Editor:
Moshe Y. Vardi
Association for Computing Machinery, New York, NY
Issue’s Table of Contents
Copyright © 2014 Copyright is held by the owner/author(s)
Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.
Sponsors
In-Cooperation
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
- Published: 1 September 2014
Check for updates
Qualifiers
- department
- Popular
- Pre-selected
Conference
Funding Sources
Other Metrics
View Article Metrics

Article Metrics
- 1
  Total Citations
  View Citations
- 426
  Total Downloads
- Downloads (Last 12 months)41
- Downloads (Last 6 weeks)15
Other Metrics
View Author Metrics
Cited By
View all

PDF Format

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

HTML Format

View this article in HTML Format .

View HTML Format

Puzzled: Solutions and sources

Communications of the ACM

Abstract

Cited By

Index Terms

Recommendations

Puzzled: Solutions and sources

Puzzled: Solutions and sources

Affirmative Solutions on Local Antimagic Chromatic Number