2021-09-17T09:57:55Zhttps://ipsj.ixsq.nii.ac.jp/ej/?action=repository_oaipmhoai:ipsj.ixsq.nii.ac.jp:000967582017-01-12T15:00:00Z00581:07002:07344
Yosenabe is NP-completeYosenabe is NP-completeeng[一般論文(テクニカルノート)] NP-complete, computational complexity, one-player game, Yosenabehttp://id.nii.ac.jp/1001/00096736/Journal Articlehttps://ipsj.ixsq.nii.ac.jp/ej/?action=repository_action_common_download&item_id=96758&item_no=1&attribute_id=1&file_no=1Copyright (c) 2013 by the Information Processing Society of JapanHiroshima University, Graduate School of EngineeringChuzo, IwamotoYosenabe is one of Nikoli's pencil puzzles, which is played on a rectangular grid of cells. Some of the cells are colored gray, and two gray cells are considered connected if they are adjacent vertically or horizontally. A set of connected gray cells is called a gray area. Some of the gray areas are labeled by numbers, and some of the non-gray cells contain circles with numbers. The object of the puzzle is to draw arrows, vertically or horizontally, from all circles to gray areas so that (i) the arrows do not bend, and do not cross other circles or lines of other arrows, (ii) the number in a gray area is equal to the total of the numbers of the circles which enter the gray area, and (iii) gray areas with no numbers may have any sum total, but at least one circle must enter each gray area. It is shown that deciding whether a Yosenabe puzzle has a solution is NP-complete.------------------------------This is a preprint of an article intended for publication Journal ofInformation Processing(JIP). This preprint should not be cited. Thisarticle should be cited as: Journal of Information Processing Vol.22(2014) No.1 (online)DOI http://dx.doi.org/10.2197/ipsjjip.22.40------------------------------Yosenabe is one of Nikoli's pencil puzzles, which is played on a rectangular grid of cells. Some of the cells are colored gray, and two gray cells are considered connected if they are adjacent vertically or horizontally. A set of connected gray cells is called a gray area. Some of the gray areas are labeled by numbers, and some of the non-gray cells contain circles with numbers. The object of the puzzle is to draw arrows, vertically or horizontally, from all circles to gray areas so that (i) the arrows do not bend, and do not cross other circles or lines of other arrows, (ii) the number in a gray area is equal to the total of the numbers of the circles which enter the gray area, and (iii) gray areas with no numbers may have any sum total, but at least one circle must enter each gray area. It is shown that deciding whether a Yosenabe puzzle has a solution is NP-complete.------------------------------This is a preprint of an article intended for publication Journal ofInformation Processing(JIP). This preprint should not be cited. Thisarticle should be cited as: Journal of Information Processing Vol.22(2014) No.1 (online)DOI http://dx.doi.org/10.2197/ipsjjip.22.40------------------------------AN00116647情報処理学会論文誌54122013-12-151882-77642013-12-10