C. F. Gauss gave a necessary condition for a word to be the intersecti
on sequence of a closed normal planar curve and he gave an example whi
ch showed that his condition was not sufficient. Since then several au
thors have given algorithmic solutions to this problem. In a previous
paper, along the lines of Gauss's original condition, we gave a necess
ary and sufficient condition for the planarity of ''signed'' Gauss wor
ds. In this present paper we give a solution to the planarity problem
for unsigned Gauss words.