Save this video free

COMP 3200 - Intro to Artificial Intelligence - Lecture 14 - Assignment 4

Dave Churchill · 1:43:54 · Watch on YouTube

Part of Memorial University of Newfoundland COMP 3200. See all 19 lectures and search them

These notes were made with YouTube Collector. Paste any YouTube link and get the same: a summary, chapters and a searchable transcript.

Overview

Dave Churchill explains COMP 3200 Assignment 4, which uses a genetic algorithm to evolve Sudoku boards and asks students to implement evolution, roulette-wheel selection, crossover, mutation, and a stronger Sudoku fitness function. The same JavaScript algorithm also drives demonstrations such as cars, trebuchets, pole-cart policies, lunar landers, and image reconstruction, illustrating how representation, fitness, selection pressure, diversity, and local optima affect optimization.

Key takeaways

Chapters

0:00 Sudoku Rules and the Assignment’s Different Goal
5:00 Cell Conflicts, Board Colors, and Local Optima
8:00 Fitness Graphs Show Progress and Plateauing
13:00 Population Size, Mutation, Random Genes, and Elitism
20:00 Building a Generation and Switching Fitness Functions
25:00 Why Sudoku Needs a More Discriminating Fitness Function
30:00 One Genetic Algorithm, Multiple Environments
33:00 Evolving Car Designs for Track Distance
38:30 Trebuchet Genomes Optimize Throw Distance
41:00 Pole-Cart Policies and Discretized State Spaces
49:00 Lunar Lander Policies Balance Landing and Survival
53:00 Reconstructing an Image with Evolved Triangles
56:00 Brushstroke Art, Fitness Separation, and Diversity
1:04:00 Using Fitness Graphs to Diagnose Population Changes
1:05:13 Assignment Code Structure and Student Responsibilities
1:06:00 Sudoku Storage, Indexing, and GA Settings
1:14:00 Fitness Implementation and Population Representation
1:18:00 GA Evolution: Sorting, Elites, and Random Individuals
1:28:00 Roulette-Wheel Parent Selection and Half-and-Half Crossover
1:33:00 Mutation Probability, Fitness Updates, and Population Bounds
1:38:00 Grading Criteria and Practical Submission Advice

Keep these chapters and the full searchable transcript in your own library.

Transcript excerpt

0:00 Let's get into assignment four. But before I show the assignment, I'm going to quickly go over some Sudoku stuff. So, uh, I have, uh, not I guess not a surprise because it would only be a surprise if you were expecting something, but assignment four will still be about Sudoku, but I'll have a little bit of a surprise on the end. Uh, a bit of a cooler part to the assignment as well in addition to Sudoku. But the reason we're using um a genetic algorithm for sudoku solving is because I believe it's a very intuitive easy way to understand what's going on. The genotype to phenom phenotype mapping is very simple and intuitive. You all can get a 2D array and translate in uh that into a 1D array pretty easily. Um and I'll show the actual assignment, but

0:47 just very quickly who here has uh who has ever done a sudoku? Hopefully pretty much everybody. Okay, I'm going to for the one or two people who maybe haven't, I'm going to very quickly go over the rules to Sudoku and explain how our assignment is producing a Sudoku board, but it's not the same as a Sudoku like this where um so Sudoku typically played on a 9 by9 grid. And the way that it works is that your end result that you want is to have the the numbers 1 through nine um each appear in each row, each column, and each 3x3 square um within the board. And the typical way that a sudoku problem is given to you is that you are given a partially filled out sudoku board and then you have to as

1:35 the human figure out where the numbers go um around these numbers that are already put in there. So that's not

This is the start of the transcript. Save this video free for the whole transcript, searchable and time-coded.

In this course

Related notes

Summary, takeaways, and chapters were generated by AI from the video's transcript and may contain errors. The video belongs to its creator, Dave Churchill.

Want the full transcript?

Save this video in YouTube Collector to get its complete searchable transcript, your own AI summaries, and a library that keeps every video you collect in one place.