4 papers
A Finite Automaton Approach to Combinatorial Games
Kai Liang
This study applies finite automata to the automatic solving of a variety of combinatorial games. For games whose positions and moves can be represented as regular languages and the…
A Weak Solution of Inverse Treblecross
Kai Liang, Muxi Li
We give a weak solution for an impartial game we called ``Inverse Treblecross''. We have determined which of its starting positions are -position and give a reasonable…
Solving tiling enumeration problems by tensor network contractions
Kai Liang
This paper presents an algorithm for computing the contraction of two-dimensional tensor networks on a square lattice; and we combine it with solving congruence equations to comput…
Independent Set Enumeration in King Graphs by Tensor Network Contractions
Kai Liang
This paper discusses the enumeration of independent sets in king graphs of size , based on the tensor network contractions algorithm given in reference~\cite{tilEnum}.…