I don't know if it has an official name; in that space it would just be a trivial variant of searching the tree (or graph, depending on how you look at it) defined by the constraints by taking random paths through it and backtracking if you get stuck.

Perhaps another angle of frustration with the name is that people apply the Quantum WooWoo to the algorithm and go all "whooaaaa" when it fact it's basically the first thing you might think of when solving a constraint problem.

Which is not to say that is a bad thing. Putting the "simplest solution to this class of problems" into your toolbelt is a good thing. That's why a lot of schools cover things like A* search and linked lists; in the real world you often need some elaborations but there's also plenty of problems you can solve with them as-is and it's a good starting point. It's just the conceptual interference from the name that is a bit annoying.