Is there a computer program that generates quality chess problems? Is there a chess engine that automatically generates quality chess problems. For example I will input 3 - it produces a mate in 3 problem. But the problem shouldn't be so obvious that one can solve in microseconds.
I don't know if such an engine exists, but there probably might not be one yet and here's why-

It's hard to explain to engines what is "obvious". What might be obvious to you might not even be obvious to me. However, there is some recent research in the area of beauty in chess problems. Even if one takes such factors as "depth appeal", "visual appeal", etc. as outlined in this research, there still remains the fundamental problem of generating chess positions.

Considering the fact that there are at least 10^43 chess positions, it is not yet computationally feasible to generate positions and apply "beauty" analysis to them to see which ones are "quality" problems. 

However, we do have endgame tablebases. It could be possible that one could use the already generated 6 piece tablebases and apply the algorithms of the research on them and generate quality problems. However, I do not know if anyone has done that yet.