I agree with you here tbh, either the video is wrong or we're wrong hahaha, you're aiming to make the narrowest path as wide as possible, in essence you are trying to maximise your minimum value. This means that you consider the minimums within the dynamic programming table in order to find the maximum - Maximin.