著者

伊藤 誠

出版者

大阪産業大学

雑誌

大阪産業大学経済論集 (ISSN:13451448)

巻号頁・発行日

vol.8, no.1, pp.1-27, 2006-10-30

---

Number Place is a puzzle which buries the 9×9 squares by the number of 1-9 according to the rules. The solution of Number Place is explained by various homepages and books. It seems that however, what explained the algorithm of solution concretely is not found. Then, in this paper, the algorithm of Number Place solution devised uniquely is introduced. Furthermore, the program which actually created the algorithm using Fortran which is one of the programming languages is also introduced. The logical type array of 9×9×9 of Fortran (it is called a logical cube in this paper) is used for expressing the 9×9 squares of Number Place. When this 3-dimensional logical type array was used together with the functions for array offered after Fortran9O, it turns out that the processing which had to use many do loops in Fortran77 becomes unnecessary, and we can program algorithm of Number Place solution very simply