Artificial Intelligence (CS6300)
This course was the introduction to the field of artificial intelligence, including heuristic programming, problem-solving, search, theorem proving, question answering, machine learning, pattern recognition, game playing, robotics and computer vision.
Assignment No1:
Download: Report
This assignment involved solving a robot manipulation task. Certain task is given and I had to provide a solution to the problem using certain searches. The senario includes a set of tables and each table has number of blocks piled up on top of it. The blocks are numbered from A to Z. Maximum of 30 blocks can be present on a table and at the maximum 10 tables can be present. The problem includes moving blocks from certain tables to certain particular tables. We are required to use BFS, DFS or ASTAR searches to find the solution. It actually involves changing the given configuration into other required configuration like if the given configuration has three tables with blocks numbered 'A', 'B', 'C' on them respectively, then the required configuration can have all the three on the three table in the order 'A' , 'C' ,'B'. The blocks can be moved only one at a time from the top of the pile on one non-empty table to the top of the pile on other table which might be empty or non-empty. I used C++ for implementing the algorithms.
Assignment No2:
Download: Report
This assignment involved implementation of the teeko game using minimax algorithm. The Teeko game includes five by five square board.. It has eight discs in total to play with the Teeko board. Four are black and four are red. One of the two players choose to go for "Black" plays with the black discs, and the other for "Red" and plays with the red discs.The game starts with an empty board. Black player moves first, and places his disc on any square/space on the board. Red player then places his/her disc on any unoccupied space., black does the same; and so on until all of the eight discs are being placed on the board. Black plays first and then the play alternates between the two players. (Adjacency is horizontal, vertical, or diagonal, but does not wrap around the edges of the board.) . A disc can only be moved to an adjacent place. The goal of the game is for either player to win by having his/her discs situated in a straight line (vertical, horizontal, or diagonal) or square of four adjacent spaces. In each move player tries to maximize his scores. This game is win-lose game where the player can lose or win. I used C++ for implementing the Teeko game.
Assignment No3:
Download: Report
This assignment involves implementing two simple inference methods applicable to propositional logic. They are forward chaining inference method and backward chaining inference method. Both methods involved a database of given assertions and implications. I implemented the algorithms using C++ programming language.