![](bg8.png)
7 CONCLUSIONS
, we try to solve the more difficult
r
I
N-playe
PPENDIX
An example of the longest SHIRITORI sequence of
the dataset 1
1:ABEMARIA,ANMONIA,ANPEA,ANPURIFAIA
5:ANFEA,ANPAIA,ANTIOKIA,ANDARUSIA,
9:ANDAWEA,ANTAKIA
….
56511:YOUSUMONO,NOAZAMI,MIATUME,
56514:MEISIIRE,REIIKI,
56516:KIETUKU,KUIRA,RAIHARU,RUMONDO
REFERENCES
Abe, K., Araya, S., 1986. Train Traffic Simulation Using
the Longest Path Method. T.of IPSJ, Vol.27, No.1,
pp.103-111.
Gu, Q-P., Takaoka, T., 1996. A Parallel Algorith for the
Longest Paths Problem on Acyclic Graphs with Integer
Arc Length. T.of IPSJ,Vol.37, No.9,pp.1631-1636.
Fischetti, M., Salazar-Gonzalez, J-J., Toth, P., 2002. The
Genralized Traveling Salesman Problem and
Orienteering Problems in The Generalized Traveling
Salesman Problem and its Variations. Kluwer
Academic Publisher.
Ito, T., Tanaka, T., Hu, H., Takeuchi, M., 2002. An
Analysis of Word Chain Games. J.of IPSJ, Vol.43
No.10
Kanasugi, T., Matsuzawa, K., Kasahara K., 1996.
Applications of ABOUT Reasoning to Solving
Wordplays. TR.of IEICE, NLC96-31, pp.1-8.
Lai, H-J., 2001. Eulerian Subgraphs Containing given
Edges, Discrete Mathematics, 230, pp.63-69.
Li, Dengxin, Li, Deying, Mao, J., 2004. On Maximum
number of Edges in a spanning Eulerian Subgraph,
Discrete Mathematics, 274, pp.299-302.
Nakayama, S., Masuyama, S., 1995. A Parallel Algorithm
for Solving the Longest Path Problem in Outerplannar
Graphs, IEICE Transaction D-I, Vol.J78-D-I, No.6,
pp.563-568.
Niimura, I. (eds), 1992. Koujien Ver.4, Iwanami
Sosic, R., Gu, J., 1990. A Polynomial Time Algorithm to
the N-Queen Problem. SIGART, 1, pp.7-11
Skina, S., 1990. Eulerian Cycles. In Implementing Discrete
Mathematics: Combinatorics and Graph Theory with
Mathematica. Addison-Wesley.
This paper describes the definition of the longest
SHIRITORI problem and the solution using the
integer programming and the LP-based
branch-and-bound method. The length of the longest
SHIRITORI problem becomes over 40 percents for
words in the Japanese dictionary. This result surprises
us very much, because usual human SHIRITORI
sequences end up to several tens of words.
As future works
problem like the longest SIRITORO word problem
described in the previous section shortly and the
applications of the longest SHIRITORI problem. Fo
examples, by applying the longest SHIRITORI
problem, the system makes the game time long. It is
possible to keep up human interest against the game
by this. For another application, our method is useful
for the complete analysis of N-players SHIRITOR
game. As, actually, we can find the longest or the
shortest SHIRITORI word sequences in which n-th
player is defeated by adding the several conditions.
This would be useful for finding the solution of
rs SHIRITORI game.
ACKNOWLEDGEMENT
A part of this research is supported by Japan society
for the promotion of sciences, the grant-in-aid (No.
15300269).
A
SOLVING THE LONGEST WORD-CHAIN PROBLEM
221