Chapter 1 of 11: Before the lecture
Walks through the Leiserchess engine codebase, detailing move generation, heuristic evaluation, and alpha-beta search.
MIT 6.172 session 19 introduces Project 4 through a walkthrough of the Leiserchess engine in an undergraduate performance engineering course. Xu explains how laser coverage helps score positions and how alpha-beta pruning cuts branches that cannot change the search result.
MIT 6.172 session 19 introduces Project 4 through a walkthrough of the Leiserchess engine in an undergraduate performance engineering course. Xu explains how laser coverage helps score positions and how alpha-beta pruning cuts branches that cannot change the search result.
This lecture
Lecture 19 of 23 of Performance Engineering of Software Systems.
Choose a node to see how it connects to this lecture. What comes before is on the leftat the top. What comes after is on the rightat the bottom. The ring is what it teaches. People and places are above. Other lectures and books are below.
Press a chosen node again to open it.
Your comment is kept while you sign up.Sign in