ログイン 新規登録
言語:

WEKO3

  • トップ
  • ランキング
To
lat lon distance
To

Field does not validate



インデックスリンク

インデックスツリー

メールアドレスを入力してください。

WEKO

One fine body…

WEKO

One fine body…

アイテム

  1. 論文誌(ジャーナル)
  2. Vol.56
  3. No.5

Cannibal Animal Games: a new variant of Tic-Tac-Toe

https://ipsj.ixsq.nii.ac.jp/records/142066
https://ipsj.ixsq.nii.ac.jp/records/142066
5ffbe98f-5306-4c09-aed3-8a2a835f90e6
名前 / ファイル ライセンス アクション
IPSJ-JNL5605006.pdf IPSJ-JNL5605006 (350.6 kB)
Copyright (c) 2015 by the Information Processing Society of Japan
オープンアクセス
Item type Journal(1)
公開日 2015-05-15
タイトル
タイトル Cannibal Animal Games: a new variant of Tic-Tac-Toe
タイトル
言語 en
タイトル Cannibal Animal Games: a new variant of Tic-Tac-Toe
言語
言語 eng
キーワード
主題Scheme Other
主題 [特集:娯楽の離散数理 (特選論文)] partial game, polyomino, cannibal animal, Harary's generalized Tic-Tac-Toe, bounding strategy, pairing strategy
資源タイプ
資源タイプ識別子 http://purl.org/coar/resource_type/c_6501
資源タイプ journal article
著者所属
Universite Libre de Bruxelles
著者所属
Universite Libre de Bruxelles
著者所属
University of Electro-Communications
著者所属
National Institute of Informatics/JST, ERATO Kawarabayashi Large Graph Project
著者所属
Universite Libre de Bruxelles
著者所属
SCRAP Co., Ltd.
著者所属
American University of Armenia
著者所属(英)
en
Universite Libre de Bruxelles
著者所属(英)
en
Universite Libre de Bruxelles
著者所属(英)
en
University of Electro-Communications
著者所属(英)
en
National Institute of Informatics / JST, ERATO Kawarabayashi Large Graph Project
著者所属(英)
en
Universite Libre de Bruxelles
著者所属(英)
en
SCRAP Co., Ltd.
著者所属(英)
en
American University of Armenia
著者名 Jean, Cardinal

× Jean, Cardinal

Jean, Cardinal

Search repository
Sebastien, Collette

× Sebastien, Collette

Sebastien, Collette

Search repository
Hiro, Ito

× Hiro, Ito

Hiro, Ito

Search repository
Matias, Korman

× Matias, Korman

Matias, Korman

Search repository
Stefan, Langerman

× Stefan, Langerman

Stefan, Langerman

Search repository
Hikaru, Sakaidani

× Hikaru, Sakaidani

Hikaru, Sakaidani

Search repository
Perouz, Taslakian

× Perouz, Taslakian

Perouz, Taslakian

Search repository
著者名(英) Jean, Cardinal

× Jean, Cardinal

en Jean, Cardinal

Search repository
Sebastien, Collette

× Sebastien, Collette

en Sebastien, Collette

Search repository
Hiro, Ito

× Hiro, Ito

en Hiro, Ito

Search repository
Matias, Korman

× Matias, Korman

en Matias, Korman

Search repository
Stefan, Langerman

× Stefan, Langerman

en Stefan, Langerman

Search repository
Hikaru, Sakaidani

× Hikaru, Sakaidani

en Hikaru, Sakaidani

Search repository
Perouz, Taslakian

× Perouz, Taslakian

en Perouz, Taslakian

Search repository
論文抄録
内容記述タイプ Other
内容記述 This paper presents a new partial two-player game, called the cannibal animal game, which is a variant of Tic-Tac-Toe. The game is played on the infinite grid, where in each round a player chooses and occupies free cells. The first player Alice can occupy a cell in each turn and wins if she occupies a set of cells, the union of a subset of which is a translated, reflected and/or rotated copy of a previously agreed upon polyomino P (called an animal). The objective of the second player Bob is to prevent Alice from creating her animal by occupying in each round a translated, reflected and/or rotated copy of P. An animal is a cannibal if Bob has a winning strategy, and a non-cannibal otherwise. This paper presents some new tools, such as the bounding strategy and the punching lemma, to classify animals into cannibals or non-cannibals. We also show that the pairing strategy works for this problem.

------------------------------
This is a preprint of an article intended for publication Journal of
Information Processing(JIP). This preprint should not be cited. This
article should be cited as: Journal of Information Processing Vol.23(2015) No.3 (online)
DOI http://dx.doi.org/10.2197/ipsjjip.23.265
------------------------------
論文抄録(英)
内容記述タイプ Other
内容記述 This paper presents a new partial two-player game, called the cannibal animal game, which is a variant of Tic-Tac-Toe. The game is played on the infinite grid, where in each round a player chooses and occupies free cells. The first player Alice can occupy a cell in each turn and wins if she occupies a set of cells, the union of a subset of which is a translated, reflected and/or rotated copy of a previously agreed upon polyomino P (called an animal). The objective of the second player Bob is to prevent Alice from creating her animal by occupying in each round a translated, reflected and/or rotated copy of P. An animal is a cannibal if Bob has a winning strategy, and a non-cannibal otherwise. This paper presents some new tools, such as the bounding strategy and the punching lemma, to classify animals into cannibals or non-cannibals. We also show that the pairing strategy works for this problem.

------------------------------
This is a preprint of an article intended for publication Journal of
Information Processing(JIP). This preprint should not be cited. This
article should be cited as: Journal of Information Processing Vol.23(2015) No.3 (online)
DOI http://dx.doi.org/10.2197/ipsjjip.23.265
------------------------------
書誌レコードID
収録物識別子タイプ NCID
収録物識別子 AN00116647
書誌情報 情報処理学会論文誌

巻 56, 号 5, 発行日 2015-05-15
ISSN
収録物識別子タイプ ISSN
収録物識別子 1882-7764
戻る
0
views
See details
Views

Versions

Ver.1 2025-01-20 06:44:11.751604
Show All versions

Share

Mendeley Twitter Facebook Print Addthis

Cite as

エクスポート

OAI-PMH
  • OAI-PMH JPCOAR
  • OAI-PMH DublinCore
  • OAI-PMH DDI
Other Formats
  • JSON
  • BIBTEX

Confirm


Powered by WEKO3


Powered by WEKO3