Media Summary: Searching: Linear Search, Binary Search. Sorting: Bubble Sort, Selection Sort, Merge Sort. Asymptotic Notation: O, Ω, ... In this video I show how I did my algorithm to calculate possible moves in the game

Match 3 Cs50 - Detailed Analysis & Overview

Searching: Linear Search, Binary Search. Sorting: Bubble Sort, Selection Sort, Merge Sort. Asymptotic Notation: O, Ω, ... In this video I show how I did my algorithm to calculate possible moves in the game

Photo Gallery

Match 3 - Lecture 3 - CS50's Introduction to Game Development 2018
CS50 2D - Lecture 3 - Match 3
CS50x 2026 - Lecture 3 - Algorithms
Match 3 | Harvard CS50 (Remade)
Match 3 | Harvard CS50
CS50 2D - Lecture 3 - Match 3 (live, unedited)
Match 3 (Lua Tutorial) - CS50's Intro to Game Development
Match 3 - CS50
CS50x 2025 - Lecture 3 - Algorithms
CS50 Games - Match-3 possible moves algorithm
Match 3 (Harvard CS50)
CS50 Games - Match-3
Sponsored
Sponsored
View Detailed Profile
Match 3 - Lecture 3 - CS50's Introduction to Game Development 2018

Match 3 - Lecture 3 - CS50's Introduction to Game Development 2018

00:00:00 - Introduction 00:03:29 -

CS50 2D - Lecture 3 - Match 3

CS50 2D - Lecture 3 - Match 3

This is Lecture 3 of

Sponsored
CS50x 2026 - Lecture 3 - Algorithms

CS50x 2026 - Lecture 3 - Algorithms

This is

Match 3 | Harvard CS50 (Remade)

Match 3 | Harvard CS50 (Remade)

Match 3

Match 3 | Harvard CS50

Match 3 | Harvard CS50

Match 3

Sponsored
CS50 2D - Lecture 3 - Match 3 (live, unedited)

CS50 2D - Lecture 3 - Match 3 (live, unedited)

This is

Match 3 (Lua Tutorial) - CS50's Intro to Game Development

Match 3 (Lua Tutorial) - CS50's Intro to Game Development

Learn game development by creating a

Match 3 - CS50

Match 3 - CS50

Project 3 -

CS50x 2025 - Lecture 3 - Algorithms

CS50x 2025 - Lecture 3 - Algorithms

Searching: Linear Search, Binary Search. Sorting: Bubble Sort, Selection Sort, Merge Sort. Asymptotic Notation: O, Ω, ...

CS50 Games - Match-3 possible moves algorithm

CS50 Games - Match-3 possible moves algorithm

In this video I show how I did my algorithm to calculate possible moves in the game

Match 3 (Harvard CS50)

Match 3 (Harvard CS50)

Fourth Assigment of the

CS50 Games - Match-3

CS50 Games - Match-3

Implement time addition on

CS50: Match 3

CS50: Match 3

Screencast of the