Ever met a geometry problem that doesn't have much to do with geometry ? this is the problem we want to discuss today, Mirror trap from the 15th Polish Olympiad in Informatics.
The problem gives you a Simple rectilinear polygon whose all sides are covered from the inside with mirrors, asks you t... (more)
Boolean satisfiability problem (SAT) is a problem where we are given a boolean expression, asking whether there exists an assignment of variables that makes the expression true.
It's known that SAT is NP-Complete meaning that nobody was able to solve this problem quickly (in polynomial time) and... (more)