Create An Assistant App Without Any Code

At the moment, there are few options to create apps for the Google Assistant that do not involve any code. We call them “existing templates” as you can see in the image above. When you open the action on google console page you will see all the current options: trivia, personality quiz and flash cards […]

Continue reading


Artificial Intelligence

Course Highlights This course includes interactive demonstrations which are intended to stimulate interest and to help students gain intuition about how artificial intelligence methods work under a variety of circumstances. Course Description This course introduces students to the basic knowledge representation, problem solving, and learning methods of artificial intelligence. Upon completion of 6.034, students should […]

Continue reading


N-Queens

Construct a magic square nxn (using the numbers 1 to n2) and place n queens only on these cells which contain prime numbers, such that no queen can take any other queen. 1. What is the smallest magic square (n) having solution? 2. Get one solution for the next three larger magic squares (n+1, n+2 […]

Continue reading


La escalabilidad del computo

Published on Aug 26, 2014 Hackerdashery #2 Inspired by the Complexity Zoo wiki: https://complexityzoo.uwaterloo.ca/Co… Scott Aaronson’s blog, Shtetl-Optimized:http://www.scottaaronson.com/blog/ —– Retro-fabulous, cabinet-sized computers: System/360: http://en.wikipedia.org/wiki/IBM_Syst… photo: “360-91-panel”. Licensed under Public domain via Wikimedia Commons –http://commons.wikimedia.org/wiki/Fil… PDP-8: http://en.wikipedia.org/wiki/PDP-8 photo: “PDP-8”. Licensed under Public domain via Wikimedia Commons –http://commons.wikimedia.org/wiki/Fil… —– Protein folding illustration: “Protein folding schematic” by Tomixdf […]

Continue reading


The game of chicken

The game of chicken, also known as the hawk-dove game or snowdrift[1] game, is an influential model of conflict for two players in game theory. The principle of the game is that while each player prefers not to yield to the other, the worst possible outcome occurs when both players do not yield. The name […]

Continue reading


Alpha–beta pruning

The Alpha-Beta algorithm (Alpha-Beta Pruning, Alpha-Beta Heuristic [1] ) is a significant enhancement to the minimax search algorithm that eliminates the need to search large portions of the game tree applying a branch-and-bound technique. Remarkably, it does this without any potential of overlooking a better move. If one already has found a quite good move […]

Continue reading


Playing Go probably won’t lead to better AI

The traditional Chinese board game Go. (Wikipedia) Go is a traditional Chinese game that is played by two players and involves placing stones on a board in order to capture the opponent’s stones. Although the rules are quite simple, and there is perfect information, the strategies involved are quite complex. The very best software available today […]

Continue reading


Poker Pros Win Against Carnegie Mellon AI

A few weeks ago in another post, I mentioned that three human professional poker players were going up against an Artificial Intelligence called Claudico. Time to check in at the Rivers Casino in Pittsburgh to see how they got on. Pittsburgh Supercomputing Center’s Blacklight supercomputer which hosted Claudico Over the week, the professionals played 80,000 hands […]

Continue reading


Carnegie Mellon Computer Faces Poker Pros in Epic No-Limit Texas Hold’Em Competition

One of the main areas of Artificial Intelligence research has been into game playing. In many games such as chess and draughts, there is perfect information. Each move a player makes is seen by the other player. Some games have elements of chance, in addition to perfect information. Backgammon is a good example, where each […]

Continue reading