You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Monte Carlo Tree Search algorithm applied to a simplified version of Blizzard's Hearthstone. Explores various types of greedy AI agents to learn from and beat down. A part of Reinforcement Learning class at Wrocław University of Science and Technology
In this project we try to create a sophisticated computer agent to play the Contact Bridge card game. Our goal is to develop an agent that is tough to play against, with fast reaction time so it is able to play in real time against humans. We approached this as a search problem, and implemented search-tree heuristics based on Minimax and Monte C…