Anchal Goyanka's repositories
Reverse_Pacman_Interface
Enables the user to control the ghosts using three mouse clicks
Reverse-Pacman
Four ghosts try to catch a Pacman
NLP-Named-Entity-Recognition
Used a maximum entropy Markov model (MEMM) for identifying person names.
NLP-Spelling-Corrector
Designed a Spelling Corrector using Stupid Backoff, interpolated Kneser-Ney, Good-Turing and Laplace N-gram language modelling
NLP-Sentiment-Analysis
Carried out sentiment analysis on IMDB movie reviews using Naive Bayes.
CS50-pset6-Server
In this project I have implemented my own web server that knows how to serve static content (files ending in .html , .jpg , et al.) and dynamic content (files ending in .php ).
CS50-pset4-Breakout
In this project, I have built the game of Breakout including an API (application programming interface) for GUI programming.
CS50-pset5-Recovery
In this project, I have implemented a code for recovering deleted JPEG files from a CF card and also for cleaning noisy BMP files.
CS50-pset3
In this project, I have implemented the game of Fifteen
CS50-pset2-Cryptography
In this project I have implemented a code for decrypting Vigenère’s and Caesar’s cipher.
CS188-Project3-Reinforcement-learning
In this project I have implemented an autonomous pacman agent using Q-learning and value iteration methods using given mdp (Markov Decision Process). I have also implemented a crawler bot who learns to crawl on two legs using reinforcement learning. A game called grid world is also implemented.
CS188-Pacman-Project2-Multiagent
In this project, I have implemented an autonomous pacman agent to play against one or more adversarial agents. The algorithms used are: Minimax - for adversarial agents acting optimally Alpha beta pruning - to speed up minimax Expectimax - for partially random and partially adversarial agents I also implemented a Reflex agent that extracted features and assigned weights to them manually.
CS188-Pacman-Project1-Search
I have used informed and uninformed searches to find the optimal path in the pacman-food-maze. The search algorithms used are A*(A star) graph search, Greedy search, Depth first search, Breadth first search and Uniform cost search.
CS188-Pacman-Project4-Track
In this profect I have used exact inference and approximate inference methods to track down invisible ghosts that gave noisy sensor readings. In approximate inference, I have used particle filter and joint particle filter methods. In exact inference, I have used dynmaic Bayes net and HMMs (Hidden Markov Models).
CS188-Project5-Classifier
In this project I have used differnt classification techniques like Perceptron, Mira, SVM (Support Vector Machines),and Naive Bayes. I have used Perceptron and Mira to classify digit-images in digits from 0 -9. I turned the pacman action selection problem in a classification problem and solved with perceptron, Mira and Naive bayes.