Ah, well, this is of course doing constraint propagation but is doing full backtracking search to find solutions. WFC, as usually presented in the procgen community (that I've seen) is a "one-shot" algorithm without any backtracking.
This is not to say that people don't do this or make compromises like running it multiple times, if it fails, but Norvig's solution is doing proper search.
This is not to say that people don't do this or make compromises like running it multiple times, if it fails, but Norvig's solution is doing proper search.