Sumários
Planning in games
10 Maio 2024, 13:00 • Luis Manuel Ferreira Fernandes Moniz
| Introduction to game planning. Basic concepts. Classical planning algorithms, search in state space. Neoclassical algorithms, search in the space of planes, POP and PNP algorithms. Planning Graphs. Hierarchical planning, HTN algorithms. |
Learning
3 Maio 2024, 15:00 • Luis Manuel Ferreira Fernandes Moniz
Run the examples of Q-Learning and MCTS
Exercises
- Run the Q-Learning example.
- Change the reward function in (1) to solve the Cab example in the figure
- Run the example tictactoe in MCTS file package executing this file
- Implement another game example to use MCTS (for instance Ultimate tic tac toe)
Learning in games
3 Maio 2024, 13:00 • Luis Manuel Ferreira Fernandes Moniz
| Learning concepts applied to games. Bayes classifiers. Decision trees. Reinforcement learning. Neural Networks. Monte Carlo Tree Search. Application examples. |
Turn based games
26 Abril 2024, 13:00 • Luis Manuel Ferreira Fernandes Moniz
| Search algorithms in turn-based games. Minimax and Alpha-Beta. Extensions and variants. Algorithms supported by memory and pre-defined plays. Board games and strategy. |