Disclaimer: Dieser Thread wurde aus dem alten Forum importiert. Daher werden eventuell nicht alle Formatierungen richtig angezeigt. Der ursprüngliche Thread beginnt im zweiten Post dieses Threads.
Tuesday Morning Tutorieal Thread
Today’s (17.11.) slides can be found here: https://gl.kwarc.info/teaching/AI/-/tree/master/Max/AI%20I/WS2021/Tutorial%20I
The SWISH-notebook we worked on during the turorial can be found here https://swish.swi-prolog.org/p/Precence%20Problem%20I%20Max%20Rapp.swinb
Reminder to send me questions in advance of tomorrow’s tutorial, if you have any.
Last week’s notebook (24/11) is available here: https://swish.swi-prolog.org/p/Treesearch_makeTree_Max.swinb
Somehow, I said something very wrong (or “not even wrong”) about MiniMax in my tutorial yesterday: of course, if there is no winning strategy, the return value should in general not be “false”. In fact, “winning” is not a concept that matters at all in MiniMax. Whatever the best strategy is utilitywise should be chosen. If there are ties they can be broken randomly.
See also: https://fsi.cs.fau.de/forum/post/165554
Please note that my tutorials on 8th, 15th and 22nd of December are cancelled due to vacation. Please visit one of the other tutorials. Have a nice festive season!
Today’s whiteboards, slides and the solution to the last present (sub)problem can be found here: https://gl.kwarc.info/teaching/AI/-/tree/master/Max/AI%20I/WS2021/Tutorial%20IX
Yesterdays’s Tutorial materials can be found here:
https://gl.kwarc.info/teaching/AI/-/tree/master/Max/AI%20I/WS2021/Tutorial%20X
Today’s tutorial materials are here: https://gl.kwarc.info/teaching/AI/-/tree/master/Max/AI%20I/WS2021