N-Queen problem is finally solved after 150 years!

How many configurations of N queens on a N x N chessboard is possible such that no two queens will threaten each other? 
This was first asked in the 1840s and finally, this week Michael Simkin, a mathematician from Harvard University, has solved this problem - putting an end to the endless struggle in the mathematics field. The answer he has achieved is (0.143n) ^ n for big enough n.
Here is a link to the media coverage of this phenomenal breakthrough.