The Hales-Jewett Theorem works in a context that is more abstract than that of the semi-group 
$\mathbb N$.  This is what makes it more applicable than earlier theorems.
This paper by Sabine Koppelberg points out some easy implications as well as a more general form of the Hales Jewett Theorem:
[The Hales-Jewett theorem via retractions. 
Proceedings of the 18th Summer Conference on Topology and its Applications. 
Topology Proc. 28 (2004), no. 2, 595–601]


I think some of the developments around Hindman's theorem, speaking about semi-groups more abstract (i.e., with fewer relations) than $(\mathbb N,+)$, for example the finite subsets of $\omega$ with union, are motivated by the abstractness of Hales Jewett.  Furstenberg and 
Katznelson used topological dynamics to prove a density version of the Hales Jewett Theorem.
Blass gave a proof of the Hales Jewett Theorem using ultrafilters.   The main result in
Koppelberg's paper mentioned above is also proved using algebra in the Stone-Czech compactification of a semi-group.
Here the Hales Jewett Theorem and variants seem to be interesting test questions for a method of proof.

-----------------

Edit:  It just occurred to me that a combinatorial proof of the density Hales Jewett Theorem 
was the outcome of a massive collaboration called the "Polymath Project" initiated by Timothy Gowers.  The abstract of the corresponding paper, which can be found <a href="http://arxiv.org/abs/0910.3926">here</a>,
says "The Hales-Jewett theorem has a density version as well, proved by Furstenberg and Katznelson in 1991 by means of a significant extension of the ergodic techniques that had been pioneered by Furstenberg in his proof of Szemeredi's theorem". 
The "significant extension of the ergodic techniques" and the fact that no combinatorial proof was known before the 2009 Polymath paper indicates some of the subtleties of Hales Jewett.