It looks like this: definition, theorem, lemma, proof, definition, theorem, proof,…

Our exams are mostly proof-based.

So, I don’t know how it differs from mathematics.

LikeLike

]]>LikeLike

]]>LikeLike

]]>LikeLike

]]>LikeLike

]]>I have one question for this algorithm. For the recurse method, you use the total number of mine as the flag to end the recursion. Why? I mean if just a few cells covered in the grid, we can use the recursion method to give the potential solutions for all the cells unopened. But if we just pass a small border tiles (just a small part of the whole grid), how can we use the total number of mine to be the flag to end the recursion.

LikeLike

]]>LikeLike

]]>” Negative results are simply not very useful, and contribute very little to human knowledge.”

– actually, they do. They tell us what does not work, and reporting them saves time for others in future too.

“If your model fails to produce good results, it could be due to a number of reasons:… ”

-many of these reasons also hold good for positive results. Positive results do not indicate the method is fool proof. There has been a lot of work recently on replicability of results which show that small variations in experimental settings can change results drastically (e.g., http://aclweb.org/anthology/D17-1035)

LikeLike

]]>LikeLike

]]>LikeLike

]]>