Game theory | Probability problems
In probability and game theory, the Waldegrave problem refers to a problem first described in the second edition of Pierre Raymond de Montmort`s Essay d'analyse sur les jeux de hazard. This problem is remarkable in that it is the first appearance to a mixed strategy solution in game theory. Montmort originally called Waldegrave's Problem the Problème de la Poulle or the Problem of the Pool. He provides a minimax mixed strategy solution to a two-person version of the card game le Her. It was Isaac Todhunter who called it Waldegrave's Problem. The general description of the problem is as follows: Suppose there are n+1 players with each player putting one unit into the pot or pool. The first two players play each other and the winner plays the third player. The loser of each game puts one unit into the pot. Play continues in like fashion through all the players until one of the players has beaten all the others in succession. The original problem, stated in a letter dated 10 April 1711, from Montmort to Nicholas Bernoulli is for n = 2 and is attributed to M. de Waldegrave. The problem, according to Montmort, is to find the expectation of each player and the probability that the pool will be won within a specified number of games. (Wikipedia).
The Concept of Mass - with Jim Baggott
Everything around us is made of ‘stuff’, or matter. But what is it, exactly? Subscribe for regular science videos: http://bit.ly/RiSubscRibe Buy Jim's book "Mass: The quest to understand matter from Greek atoms to quantum fields" - https://geni.us/BGZ0Pd Jim Baggott will explore our ch
From playlist Ri Talks
In the 1770s, a young woman appeared in the American colonies, claiming to be a sister of Queen Charlotte, the queen consort of Great Britain and Ireland Check out our new community for fans and supporters! https://thehistoryguyguild.locals.com/ This is original content based on research
From playlist Extraordinary people and personalities
Examining the mystery of whether Hitler fathered an illegitimate son while serving in France in WW1. Dr. Mark Felton FRHistS, FRSA is a well-known British historian, the author of 22 non-fiction books, including bestsellers 'Zero Night' and 'Castle of the Eagles', both currently being dev
From playlist Hitler Various Subjects
Concave Quadrilateral Craziness! (GoGeometry Action 80)
Link: https://www.geogebra.org/m/T4axJRwY
From playlist Geometry: Challenge Problems
What is Higgs Boson (extended interview footage with Prof. Ed Copeland ) ?
Extended interview footage with Prof. Ed Copeland, from the Sixty Symbols video about the Higgs Boson
From playlist Ed Copeland - Sixty Symbols
Human Learning, After Machine Learning Panel
From the November 1st, 2017 Human AI Collaboration: A Dynamic Frontier Conference; Keith Devlin, Executive Director of the H-STAR Institute at Stanford University moderates a panel with John Perry, Henry Waldgrave Stuart Professor of Philosophy, Emeritus, Stanford University; Pat Langley,
From playlist Human AI Collaboration: A Dynamic Frontier Conference
Higgs Boson (extended interview footage)
Extended interview footage from the Sixty Symbols video about the Higgs Boson. Main video at http://www.youtube.com/watch?v=zTNQOShuvoQ
From playlist Sixty Symbols - Behind the Scenes
GeoGebra Link: https://www.geogebra.org/m/f5zgupmz
From playlist Geometry: Challenge Problems
GeoGebra Link: https://www.geogebra.org/m/yvqwqk6h
From playlist Geometry: Challenge Problems
Separation of variables and the Schrodinger equation
A brief explanation of separation of variables, application to the time-dependent Schrodinger equation, and the solution to the time part. (This lecture is part of a series for a course based on Griffiths' Introduction to Quantum Mechanics. The Full playlist is at http://www.youtube.com/
From playlist Mathematical Physics II - Youtube
GeoGebra Link: https://www.geogebra.org/m/ketkkfuj
From playlist Geometry: Challenge Problems
Practice Problem: Colligative Properties
What are colligative properties? They're properties of a solution, such as freezing point depression and boiling point elevation, which differ from the pure solvent. Let's do some calculations regarding these concepts! Try all of the general chemistry practice problems: http://bit.ly/Prof
From playlist General Chemistry Practice Problems
Triangle Median: Challenge Problem
Link: https://www.geogebra.org/m/jESRWymr BGM: Andy Hunter
From playlist Geometry: Challenge Problems
Bearings and Trigonometry problem solving
Challenging A - A* bearings questions incorporating problem solving, angle facts and trigonometry.
From playlist bearings
It's time we got to the bottom of this... Media: https://youtu.be/g3W4sMkwQ6k
From playlist Concerning Questions
The Complexity of Gradient Descent: CLS = PPAD ∩ PLS - Alexandros Hollender
Computer Science/Discrete Mathematics Seminar I Topic: The Complexity of Gradient Descent: CLS = PPAD ∩ PLS Speaker: Alexandros Hollender Affiliation: University of Oxford Date: October 11, 2021 We consider the problem of computing a Gradient Descent solution of a continuously different
From playlist Mathematics
Lecture 20 - Introduction to NP-completeness
This is Lecture 20 of the CSE373 (Analysis of Algorithms) taught by Professor Steven Skiena [http://www.cs.sunysb.edu/~skiena/] at Stony Brook University in 1997. The lecture slides are available at: http://www.cs.sunysb.edu/~algorith/video-lectures/1997/lecture22.pdf
From playlist CSE373 - Analysis of Algorithms - 1997 SBU
Galois theory II | Math History | NJ Wildberger
We continue our historical introduction to the ideas of Galois and others on the fundamental problem of how to solve polynomial equations. In this video we focus on Galois' insights into how extending our field of coefficients, typically by introducing some radicals, the symmetries of the
From playlist MathHistory: A course in the History of Mathematics
MIT 6.006 Introduction to Algorithms, Spring 2020 Instructor: Erik Demaine View the complete course: https://ocw.mit.edu/6-006S20 YouTube Playlist: https://www.youtube.com/playlist?list=PLUl4u3cNGP63EdVPNLG3ToM6LaEUuStEY This lecture discusses computational complexity and introduces termi
From playlist MIT 6.006 Introduction to Algorithms, Spring 2020