
Sign up to save your podcasts
Or


Here's an activity based game. Can you solve this classic chess puzzle? What's the maximum number of knights you can place on a board so that none of them can attack each other?
The answer is more simple and beautiful than you might think! In this video, we study the logic behind the knight's move in chess to prove that the maximum number is 32. We'll show you the perfect configuration and explain exactly why it's impossible to place a 33rd knight without starting a war on the board.
We'll cover:
This puzzle is a fantastic introduction to concepts in combinatorics based on the classic game of chess. Whether you're a chess enthusiast, a math lover, or just enjoy a good logic puzzle, this video is for you!
You can read the puzzle and download materials used in this video on https://soln.tech/blog/knight-chess-puzzle
#Chess #Puzzle #Math #BrainTeaser #ChessPuzzle #Knight #ChessKnight #MathPuzzle #LogicPuzzle #Combinatorics #GraphTheory #ChessBoard #HowMany #Riddle #SolveThis #MindBlown #GameTheory #LearnChess #Education #Elearning #EdTech #OnlineLearning #MathEducation #STEM #STEMeducation #Learning #Education #Teacher #Teaching #Physics #ComputerScience #criticalthinkingquestions #ProblemSolving #DIY #Study #Knowledge #Activity #Challenge #Fun #interestingfacts #opensource
Credits:
This document confirms the download of an audio file pursuant to the Content License as defined in the Pixabay Terms of Service available at https://pixabay.com/service/terms/
Licensor's Username:
Licensee:
Audio File Title:
Audio File URL:
Audio File ID:
Date of download:
Pixabay, a Canva Germany GmbH brand
Pixabay is a user-contributed stock content website. The above-named Licensor is responsible for this audio file. Pixabay monitors uploaded audio files only to a reasonable extent. Pixabay cannot be held responsible for the acts or omissions of its users and does not represent or warrant that any required third-party consents or licenses have been obtained.
For any queries related to this document please contact Pixabay via [email protected].
==== THIS IS NOT A TAX RECEIPT OR INVOICE ====
By Here's an activity based game. Can you solve this classic chess puzzle? What's the maximum number of knights you can place on a board so that none of them can attack each other?
The answer is more simple and beautiful than you might think! In this video, we study the logic behind the knight's move in chess to prove that the maximum number is 32. We'll show you the perfect configuration and explain exactly why it's impossible to place a 33rd knight without starting a war on the board.
We'll cover:
This puzzle is a fantastic introduction to concepts in combinatorics based on the classic game of chess. Whether you're a chess enthusiast, a math lover, or just enjoy a good logic puzzle, this video is for you!
You can read the puzzle and download materials used in this video on https://soln.tech/blog/knight-chess-puzzle
#Chess #Puzzle #Math #BrainTeaser #ChessPuzzle #Knight #ChessKnight #MathPuzzle #LogicPuzzle #Combinatorics #GraphTheory #ChessBoard #HowMany #Riddle #SolveThis #MindBlown #GameTheory #LearnChess #Education #Elearning #EdTech #OnlineLearning #MathEducation #STEM #STEMeducation #Learning #Education #Teacher #Teaching #Physics #ComputerScience #criticalthinkingquestions #ProblemSolving #DIY #Study #Knowledge #Activity #Challenge #Fun #interestingfacts #opensource
Credits:
This document confirms the download of an audio file pursuant to the Content License as defined in the Pixabay Terms of Service available at https://pixabay.com/service/terms/
Licensor's Username:
Licensee:
Audio File Title:
Audio File URL:
Audio File ID:
Date of download:
Pixabay, a Canva Germany GmbH brand
Pixabay is a user-contributed stock content website. The above-named Licensor is responsible for this audio file. Pixabay monitors uploaded audio files only to a reasonable extent. Pixabay cannot be held responsible for the acts or omissions of its users and does not represent or warrant that any required third-party consents or licenses have been obtained.
For any queries related to this document please contact Pixabay via [email protected].
==== THIS IS NOT A TAX RECEIPT OR INVOICE ====