Most times I ran it the monty hall implementation ran with the lowest average tries, but when the purely random method won it would usually win by a larger margin than the monty hall problem.
Good, run it a few more hundred thousand times and then run a chi-square analysis.
I think you will find that they are not significantly different in terms of how often they find the hash.