Theory of Computer Games: Fall 2024

電腦對局理論

徐讚昇
研究員
台北市南港區 11529
研究院路 二段一二八號
中央研究院資訊科學研究所
A24 號信箱

E-mail: tshsu [AT] iis.sinica.edu.tw
Homepage: http://www.iis.sinica.edu.tw/~tshsu
TEL: +886-2-2788-3799 ext. 1701
FAX: +886-2-2782-4814

• Textbook and a general description of this course is avaliable here.
• Office hour: via apointment
• classroom:
  • Room 111, NTU CSIE building
  • 上課規定
    1. If you feel sick, rest at home.
    2. If you are coughing or sneezing, wear a mark effectively and keep a social distance away from rest of people.
    3. 教室內禁止飲食
  • 加退選規定：
    • 最多加選20名同學，用台大帳號寄 E-mail 到助教信箱，留姓名、學號、Email， 大三或碩一的機率會增加。 9/5 上課抽籤，人必須在現場領取授權碼，並在3天內完成加選。
    • 3天內未完成加選,取消資格,依序遞補。
    • No more adding of students. 學生若有特殊理由要加選，必須和我聯繫後個案處理。
  • 助教: 杜宗顁 and 薛韋霖
    1. • email: ntu.theory.of.computer.games@gmail.com
       • Office hours: via discord here.
  • Syllabus
  • Sample programs: included in the problem descriptions.
  • Requirements:
    1. Homeworks: 遲交每一天扣 10% (*0.9), 不滿一天以一天計，至多 7天，超過以0分紀錄; 抄襲(被抄襲)以校規論處.
       • HWK1
         • Solve one-EWN 3 using pure C programming
         • Due date: 2:20pm, 10/17 (Thursday), 2024
         • Online resource and submission of code here
         • Submission of report here
       • HWK2
         • Using Monte-Carol search algorithms to write a computer program that plays a deterministic version of EWN called Kari 4.
         • Due date: 2:20pm, 12/5 (Thursday), 2024
         • Online resource and submission of code here
         • Submission of report here
    2. End of semester report: for those who are invited to make up scores when they seem to be falling behind the class or when the number of students in the class is no more than 16.
       • Due date: Dec 31th 2024
       • Pick a paper that is a reference in the slides, or a paper that is related to computer games.
    3. Mid exam: 2:20pm~5:20pm 11/7, 2024.
    4. Final exam: N/A this semester
    5. Final project: 不得遲交
       • The 18th NTU CSIE CUP of Computer games competition.
       • Rules
       • Contest Information:
         • Participation of your program and you is mandatory in the final tournament! Abscent will be counted as no show.
         • Practice round: 2:20pm ~ , 12/26 2024.
         • Tournament date: 2:20pm~5:20pm, Jan/2, 2025.
         • Place: room 111
         • Photos for the competition.
         • Game records for the competition.
         • SPEC.
         • Source code due date: 10 minutes before the tournament
       • Online resource and submission of code here
    6. Final project code/report:
       • Due Date: 5:20pm, Jan 3th 2025
       • Finish testing your code with the random one for 1060 rounds, taking the best 1000 rounds for scoring, on the tournament server.
       • Submission of code here
       • Submission of report here
  • Slides: Updated slides for a Thursday lecture will normally be available the following Monday, however there is no guarantee. Some slides and course materials for the years 2007, 2008, 2009, 2010, 2011, 2012, 2013, 2014, 2015, 2016, 2017, 2018, 2019, 2020, 2021 2022 and 2023 are available on-line.
    I will revise the slides this year based on what I have taught the previous years.
    • Syllabus and a brief overview
      
    • Teaching logs
      
    1. Theory of computer games: an AI oriented introduction
       
    2. Basic single-player search algorithms
       
    3. Advanced single-player search algorithms
       
    4. Survey of 2-player perfect information games
       
    5. C.E. Shannon's 1950 computer chess paper
       
    6. Alpha-beta pruning: Algorithms and analysis
       
    7. Scout and NegaScout
       
    8. Hash tables and other enhancements
       
    9. Monte-Carlo game tree search: Basics
       
    10. Monte-Carlo game tree search: Advanced techniques
        
    11. Monte-Carlo game tree search: Deep learning enhancements
    12. Searching chance nodes
        
    13. Parallel game tree search
        
    14. Open and endgame databases
        
    15. Selected advanced topics
        
    16. Concluding remarks
        
  
  

  ---