Game Informatics on

CGP2026-Ishibashi

Sun, 22 Feb 2026 00:00:00 +0000

Nikoli社のペンシルパズルの1種である「カナオレ」について，その計算複雑性を解析した．元のパズルのNP完全性を示すとともに，様々な制限を加えた際の複雑性の変化を観察した．

CJCDCGGG2025

Sun, 14 Sep 2025 00:00:00 +0000

CGP2025-BusOut

Sat, 08 Mar 2025 00:00:00 +0000

Takehiro Ishibashi, Ryo Yoshinaka, Ayumi Shinohara:BusOut is NP-complete. arXiv:2505.09165

LA2024Winter

Tue, 28 Jan 2025 00:00:00 +0000

Theoretical Computer Science 2023

Thu, 02 Nov 2023 00:00:00 +0000

Various forms of sorting problems have been studied over the years. Recently, two kinds of sorting puzzle apps are popularized. In these puzzles, we are given a set of bins filled with colored units, balls or water, and some empty bins. These puzzles allow us to move colored units from a bin to another when the colors involved match in some way or the target bin is empty. The goal of these puzzles is to sort all the color units in order. We investigate computational complexities of these puzzles. We first show that these two puzzles are essentially the same from the viewpoint of solvability. That is, an instance is sortable by ball-moves if and only if it is sortable by water-moves. We also show that every yes-instance has a solution of polynomial length, which implies that these puzzles belong to in NP. We then show that these puzzles are NP-complete. For some special cases, we give polynomial-time algorithms. We finally consider the number of empty bins sufficient for making all instances solvable and give non-trivial upper and lower bounds in terms of the number of filled bins and the capacity of bins.

2022-11-game-prog

Sun, 13 Nov 2022 00:00:00 +0000

技育展2022 インフラ/セキュリティ部門最優秀賞受賞

Fri, 21 Oct 2022 00:00:00 +0000

2022年8月から9月にかけて開催された「技育展2022」「インフラ/セキュリティ」部門で、博士前期課程2年の浦田智稀君と江上尚志君のチームが開発した「AI撲滅AI」が、最優秀賞を受賞しました。

2018-01-CIAA

Wed, 01 Aug 2018 00:00:00 +0000

A cryptarithm is a mathematical puzzle where given an arithmetic equation written with letters rather than numerals, a player must discover an assignment of numerals on letters that makes the equation hold true. In this paper, we propose a method to construct a DFA…

2017-gpw-nozaki

Sun, 12 Nov 2017 00:00:00 +0000

2017-11-gpw-ishiwaki

Sat, 11 Nov 2017 00:00:00 +0000

2017-11-gpw-mashiko

Sat, 11 Nov 2017 00:00:00 +0000

2017-11-gpw-ohkawa

Sat, 11 Nov 2017 00:00:00 +0000

GPW 2017

Wed, 01 Nov 2017 00:00:00 +0000

箱根で開催されたゲームプログラミングワークショップ2017において研究発表を行ってきました（11月10日～11月12日）

2016-11-ai

Sat, 05 Nov 2016 00:00:00 +0000

2016-01-QBF-SAT

Fri, 01 Jul 2016 00:00:00 +0000

Positional games are a mathematical class of two-player games comprising Tic-tac-toe and its generalizations. We propose a novel encoding of these games into Quantified Boolean Formulas (QBFs) such that a game instance admits a winning strategy for first player if and only if the corresponding formula is true. Our approach improves over previous QBF encodings of games in multiple ways. First, it is generic and lets us encode other positional games, such as Hex. Second, structural properties of positional games together with a careful treatment of illegal moves let us generate more compact instances that can be solved faster by state-of-the-art QBF solvers. We establish the latter fact through extensive experiments. Finally, the compactness of our new encoding makes it feasible to translate realistic game problems. We identify a few such problems of historical significance and put them forward to the QBF community as milestones of increasing difficulty.

2015-11-paper-022

Sun, 08 Nov 2015 00:00:00 +0000

2015-11-paper-023

Sun, 08 Nov 2015 00:00:00 +0000

2015-11-qbf

Sun, 08 Nov 2015 00:00:00 +0000

GPW 2015

Sun, 01 Nov 2015 00:00:00 +0000

軽井沢で開催されたゲームプログラミングワークショップ2015において研究発表を行ってきました（11月6日～11月8日）

2013-11-p

Fri, 08 Nov 2013 00:00:00 +0000

第3回相磯秀夫杯 FPGAデザインコンテスト準優勝

Fri, 20 Sep 2013 00:00:00 +0000

奥田　遼介（システム情報科学専攻篠原研究室 M2）が所属するチームSnowdropが「第3回相磯秀夫杯 FPGAデザインコンテスト」で第2位入賞となりました．

CODE VS 2.1決勝戦第3位

Fri, 26 Jul 2013 00:00:00 +0000

奥田　遼介さん（システム情報科学専攻篠原研究室 M2）が「プログラマ世界一決定戦 - CODE VS 2.1」の決勝トーナメントで第3位

博士課程前期2年奥田遼介，小松智希と，研究室OBの草野一彦が，「プログラマ世界一決定戦

2012-07-paper-045

Fri, 13 Jul 2012 00:00:00 +0000

ゲーム情報学研究会 2012

Sun, 01 Jul 2012 00:00:00 +0000

小松さんが論文を発表しました。（7月13日）

2011-11-paper-046

Sat, 05 Nov 2011 00:00:00 +0000

2009-11-paper-057

Sun, 22 Nov 2009 00:00:00 +0000

2008-03-paper-071

Sat, 01 Mar 2008 00:00:00 +0000

Game Informatics on

CGP2026-Ishibashi

CJCDCGGG2025

CGP2025-BusOut

LA2024Winter

Theoretical Computer Science 2023

2022-11-game-prog

技育展2022 インフラ/セキュリティ部門 最優秀賞受賞

2018-01-CIAA

2017-gpw-nozaki

2017-11-gpw-ishiwaki

2017-11-gpw-mashiko

2017-11-gpw-ohkawa

GPW 2017

2016-11-ai

2016-01-QBF-SAT

2015-11-paper-022

2015-11-paper-023

2015-11-qbf

GPW 2015

2013-11-p

第3回 相磯秀夫杯 FPGAデザインコンテスト 準優勝

CODE VS 2.1決勝戦 第3位

2012-07-paper-045

ゲーム情報学研究会 2012

2011-11-paper-046

2009-11-paper-057

2008-03-paper-071

技育展2022 インフラ/セキュリティ部門最優秀賞受賞

第3回相磯秀夫杯 FPGAデザインコンテスト準優勝

CODE VS 2.1決勝戦第3位