Presentation 2015-03-02
Faster Numberlink solution using possibilities of topological routing
Yuichiro TANAKA, Atsushi TAKAHASHI,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Numberlink is a pencil puzzle with strong affinity for planar routing problems. Methods to solve Numberlink are applied to algorithms that connect objects to objects. In this paper, we add constraints to search conditions of the previous method that determines the existence of solutions using SAT. We define Numberlink as a topological routing problem and generate additional constraints with solution of this problem. The proposed method outputs all solutions faster than previous methods in some of the problems.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Numberlink / SAT / constraint satisfaction problem / routability
Paper # VLD2014-155
Date of Issue

Conference Information
Committee VLD
Conference Date 2015/2/23(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To VLSI Design Technologies (VLD)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Faster Numberlink solution using possibilities of topological routing
Sub Title (in English)
Keyword(1) Numberlink
Keyword(2) SAT
Keyword(3) constraint satisfaction problem
Keyword(4) routability
1st Author's Name Yuichiro TANAKA
1st Author's Affiliation Department of Communications and Computer Engineering, Tokyo Institute of Technology()
2nd Author's Name Atsushi TAKAHASHI
2nd Author's Affiliation Department of Communications and Computer Engineering, Tokyo Institute of Technology
Date 2015-03-02
Paper # VLD2014-155
Volume (vol) vol.114
Number (no) 476
Page pp.pp.-
#Pages 6
Date of Issue