C.F. Gauss gave a necessary condition for a word to be the intersection sequence of a closed normal planar curve and he gave an example which showed that his condition was not sufficient. Since then several authors have given algorithmic solutions to this problem. In a previous paper, along the lines of Gauss’s original condition, we gave a necessary and sufficient condition for the planarity of “signed” Gauss words. In this present paper we give a solution to the planarity problem for unsigned Gauss words.