Matchstick games: On removing a matchstick without disturbing the others

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

It is shown that given any configuration of n ≥ 3 line segments (matchsticks) in the plane, there exist at least three segments that can each be translated to infinity, without colliding with the other n − 1 segments. In addition, if n ≥ 4, and the line segments are restricted to be parallel to the axes, at least four segments can be moved without disturbing the others. Furthermore, both lower bounds are best possible. The proofs are elementary and suitable for teaching in lower-level undergraduate courses on discrete mathematics.

Original languageEnglish (US)
Title of host publicationInformation Systems and Technologies to Support Learning - Proceedings of EMENA-ISTL 2018
EditorsAlvaro Rocha, Mohammed Serrhini
PublisherSpringer Science and Business Media Deutschland GmbH
Pages580-587
Number of pages8
ISBN (Print)9783030035761
DOIs
StatePublished - Jan 1 2019
Event2nd International conference on Europe Middle East and North Africa Information Systems and Technologies to support Learning, EMENA-ISTL 2018 - Fez, Morocco
Duration: Oct 25 2018Oct 27 2018

Publication series

NameSmart Innovation, Systems and Technologies
Volume111
ISSN (Print)2190-3018
ISSN (Electronic)2190-3026

Other

Other2nd International conference on Europe Middle East and North Africa Information Systems and Technologies to support Learning, EMENA-ISTL 2018
CountryMorocco
CityFez
Period10/25/1810/27/18

Fingerprint

Teaching

Keywords

  • Artificial intelligence
  • Collision avoidance
  • Computational geometry
  • Discrete mathematics
  • Line segments
  • Robotics
  • Spatial planning
  • Translation

ASJC Scopus subject areas

  • Decision Sciences(all)
  • Computer Science(all)

Cite this

Toussaint, G. (2019). Matchstick games: On removing a matchstick without disturbing the others. In A. Rocha, & M. Serrhini (Eds.), Information Systems and Technologies to Support Learning - Proceedings of EMENA-ISTL 2018 (pp. 580-587). (Smart Innovation, Systems and Technologies; Vol. 111). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-03577-8_63

Matchstick games : On removing a matchstick without disturbing the others. / Toussaint, Godfried.

Information Systems and Technologies to Support Learning - Proceedings of EMENA-ISTL 2018. ed. / Alvaro Rocha; Mohammed Serrhini. Springer Science and Business Media Deutschland GmbH, 2019. p. 580-587 (Smart Innovation, Systems and Technologies; Vol. 111).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Toussaint, G 2019, Matchstick games: On removing a matchstick without disturbing the others. in A Rocha & M Serrhini (eds), Information Systems and Technologies to Support Learning - Proceedings of EMENA-ISTL 2018. Smart Innovation, Systems and Technologies, vol. 111, Springer Science and Business Media Deutschland GmbH, pp. 580-587, 2nd International conference on Europe Middle East and North Africa Information Systems and Technologies to support Learning, EMENA-ISTL 2018, Fez, Morocco, 10/25/18. https://doi.org/10.1007/978-3-030-03577-8_63
Toussaint G. Matchstick games: On removing a matchstick without disturbing the others. In Rocha A, Serrhini M, editors, Information Systems and Technologies to Support Learning - Proceedings of EMENA-ISTL 2018. Springer Science and Business Media Deutschland GmbH. 2019. p. 580-587. (Smart Innovation, Systems and Technologies). https://doi.org/10.1007/978-3-030-03577-8_63
Toussaint, Godfried. / Matchstick games : On removing a matchstick without disturbing the others. Information Systems and Technologies to Support Learning - Proceedings of EMENA-ISTL 2018. editor / Alvaro Rocha ; Mohammed Serrhini. Springer Science and Business Media Deutschland GmbH, 2019. pp. 580-587 (Smart Innovation, Systems and Technologies).
@inproceedings{5a4aa1a80acf43efb78d1dcbc096af53,
title = "Matchstick games: On removing a matchstick without disturbing the others",
abstract = "It is shown that given any configuration of n ≥ 3 line segments (matchsticks) in the plane, there exist at least three segments that can each be translated to infinity, without colliding with the other n − 1 segments. In addition, if n ≥ 4, and the line segments are restricted to be parallel to the axes, at least four segments can be moved without disturbing the others. Furthermore, both lower bounds are best possible. The proofs are elementary and suitable for teaching in lower-level undergraduate courses on discrete mathematics.",
keywords = "Artificial intelligence, Collision avoidance, Computational geometry, Discrete mathematics, Line segments, Robotics, Spatial planning, Translation",
author = "Godfried Toussaint",
year = "2019",
month = "1",
day = "1",
doi = "10.1007/978-3-030-03577-8_63",
language = "English (US)",
isbn = "9783030035761",
series = "Smart Innovation, Systems and Technologies",
publisher = "Springer Science and Business Media Deutschland GmbH",
pages = "580--587",
editor = "Alvaro Rocha and Mohammed Serrhini",
booktitle = "Information Systems and Technologies to Support Learning - Proceedings of EMENA-ISTL 2018",
address = "Germany",

}

TY - GEN

T1 - Matchstick games

T2 - On removing a matchstick without disturbing the others

AU - Toussaint, Godfried

PY - 2019/1/1

Y1 - 2019/1/1

N2 - It is shown that given any configuration of n ≥ 3 line segments (matchsticks) in the plane, there exist at least three segments that can each be translated to infinity, without colliding with the other n − 1 segments. In addition, if n ≥ 4, and the line segments are restricted to be parallel to the axes, at least four segments can be moved without disturbing the others. Furthermore, both lower bounds are best possible. The proofs are elementary and suitable for teaching in lower-level undergraduate courses on discrete mathematics.

AB - It is shown that given any configuration of n ≥ 3 line segments (matchsticks) in the plane, there exist at least three segments that can each be translated to infinity, without colliding with the other n − 1 segments. In addition, if n ≥ 4, and the line segments are restricted to be parallel to the axes, at least four segments can be moved without disturbing the others. Furthermore, both lower bounds are best possible. The proofs are elementary and suitable for teaching in lower-level undergraduate courses on discrete mathematics.

KW - Artificial intelligence

KW - Collision avoidance

KW - Computational geometry

KW - Discrete mathematics

KW - Line segments

KW - Robotics

KW - Spatial planning

KW - Translation

UR - http://www.scopus.com/inward/record.url?scp=85056475862&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85056475862&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-03577-8_63

DO - 10.1007/978-3-030-03577-8_63

M3 - Conference contribution

AN - SCOPUS:85056475862

SN - 9783030035761

T3 - Smart Innovation, Systems and Technologies

SP - 580

EP - 587

BT - Information Systems and Technologies to Support Learning - Proceedings of EMENA-ISTL 2018

A2 - Rocha, Alvaro

A2 - Serrhini, Mohammed

PB - Springer Science and Business Media Deutschland GmbH

ER -