Let G = (V;E) be a graph with vertex set V and edge set E. The k-coloring problem is to assign a color (a number chosen in {1, ..., k}) to each vertex of V so that no edge has both endpoints with the same color. We describe in this paper a new ant algorithm for the k-coloring problem. Computational experiments give evidence that our algorithm is competitive with the existing ant algorithms for this problem, while giving a minor role to each ant. Our algorithm is however not competitive with the best known coloring algorithms.