N Queen problem, a Scala implementation.

The N Queen is the problem of placing N chess queens on anN×N chessboard so that no two queens attack each other. For example, following is a solution for 4 Queen problem. The expected output is a binary matrix which has 1s for the blocks where queens are placed. http://www.geeksforgeeks.org/backtracking-set-3-n-queen-problem/ Using Sets and for-expressions with Scala we can reach a solution very directly: def queens(n: Int): Set[List[Int]] = { def […]


  First, let me state the problem, then I will tell you the solutions: Yesterday the world echoed a news about how a hack attack had almost checkmated many hospitals and companies around the world. You can see here the news: https://www.nytimes.com/2017/05/12/world/europe/uk-national-health-service-cyberattack.html?_r=0 This is big news, some people blamed US government, some people blamed the NSA, […]

Apache YARN

Surge como una evolución de Hadoop dada la necesidad de ofrecer otro tipo de frameworks aparte de MapReduce. Dado que MapReduce inherentemente es un proceso lento que requiere una fase de map, una fase de distribución de resultados intermendios por red y una fase de reduce se hacía necesario tener datos fuera de HDFS para […]