TCG 2022 teaching logs 1. 9/08 lectures: slide0.pdf: syllabus introduction to computer games 2. 9/15 slide1.pdf, introduction slide2.pdf: pages 1~13 single player game, introduction slide2.pdf: pages 42~50 DFID self-study: slide2.pdf: pages 14~41,51~57 BFS disk based methods DFS bidirectional search 3. 9/22 slide2.pdf: pages 58~76 heuristic search IDA* admissible heuristic slide3.pdf: pages 1~23 pattern databases part I slide15.pdf: pages 23--32 programming tips 4. 9/29 slide0.pdf: pages 22~27 related research resources slide3.pdf: recap of generalizations in pages 10~11 pages 23~35 pattern databases part II slide15.pdf: pages 23--32 programming tips announcement of HWK#1 slide4.pdf: pages 1~8 survey of 2-player games 5. 10/6 slide2.pdf: page 25: correction and a very brief overview on disk based methods slide4.pdf: pages 9~18;31~51 survey of 2-player games Hex is skipped this year (will not be in the midterm) slide5.pdf: pages 1~20 introduction using chess 6. 10/13 slide5.pdf: pages 25~47 general introduction of various aspect of game programming slide6.pdf: pages 1~26 two person game search and an introduction of alpha-beta pruning 7. 10/20 due of homework I slide6.pdf: 21-26 recap of the two cuts 27~82 alpha-beta pruning continues perfect ordering tree categorize the types of nodes performance analysis 8. 10/27 slide5.pdf: 83~end F1, F2 and F3 slide7.pdf: 1~end Scout and Negascout search review session for midterm exam 9. 11/3 MidTerm exam 10. 11/10 Homework I: discussion Midterm: discussion slide9.pdf: 1~24 Monte Carlo search: basic techniques upto UCB 11. 11/17 slide9.pdf: 25~end Hoeffding inequality till end slide10.pdf: 1~26 Monte Carlo search: advanced techniques Homework #2: announcement, due 12/8 12. 11/24 slide10.pdf: 27~33 comments on other methods slide9.pdf: 50~62 implementation hints slide11.pdf: 1~15 link between MCTS and machine learning 16~end: fast forward with a high level sketch slide7.pdf: a brief review of Negascout slide8.pdf: 1~12 transposition table and various enhancements to alpha-beta search 13. 12/1 slide9.pdf: 54 in-depth hints on parameter fine tuning slide10.pdf: 12~13 in-depth discussion of AMAF implementation slide8.pdf: 13~73 Zobrist's hash function move ordering dynamically adjusting searching depth forward pruning 14. 12/8 due of HWK#2 final project: announcement slide12.pdf: 1~50 chance node searching star0, star0.5, star1 15. 12/15 comments about the final project tree data structure evaluating function: material, mobility, position, structure, ... slide12.pdf: 51~84 star1, star2, star2.5 slide16.pdf: 1~32 system building, timing control and concluding remarks 16. 12/22 --> final lecture day comments about the grading of HWK2 more comments about the final project tournament format ... etc slide16.pdf: 33~43 testing slide15.pdf: 1~29 selected advanced topics GHI, OM, MAXn slide14.pdf: 1~36 open and endgame databases 17. 12/27 (Tue) 2pm: on-line practice round 12/29 (Thu) on-line 1pm preparation of the tournament snapshot submission of the source code used for the tournament 2pm final project tournament: first round 18. 1/5, 2023 (Thu) on-line 1pm preparation of the tournament snapshot submission of the source code used for the tournament 2pm final project tournament: 2nd round 19. 1/6, 2023 (Fri) 11:59pm due of the final project source code and report ... ... ...