@techreport{oai:ipsj.ixsq.nii.ac.jp:00062420,
 author = {小谷, 善行 and Yoshiyuki, Kotani},
 issue = {8},
 month = {Jun},
 note = {古来からある計算パズルの一つである虫食い算について，解記述の候補における制約を用いて虫食い算パズルを非探索的に解く方法を示した．それに最小分岐を行う探索アルゴリズムを付加することにより，普通の問題がみな解ける効率的な虫食い算解法アルゴリズムを作った．さらにそれを用いて虫食い算を作成するシステムを設計し，巨大な虫食い算を作った, A method of solving the traditional arithmetic puzzle “Mushikuizan” is shown, which has non-searching solution mechanism by using constraint restriction in partial solution description. Adding the searching algorithm of minimum branching factor to this method, we design and implement a Mushikuizan solver which can solve problems of standard size effectively. We also implement a Mushikuizan generator which the solver is embedded in and which can generate huge problems.},
 title = {虫食い算の非探索的解決と問題作成への応用},
 year = {2009}
}