Press B 287: Dispatch Is A Knockout

An episode of the Press B To Cancel podcast, hosted by Press B To Cancel, titled "Press B 287: Dispatch Is A Knockout" was published on February 2, 2026 and runs 81 minutes.

February 2, 2026 ·81m · Press B To Cancel

0:00 / 0:00

Episode Description

Just a note this episode was recorded prior to the censorship kerfuffle with Nintendo & Adhoc. Dispatch is without a doubt one of the best games of last year, and best in class for it's genre, but uh... maybe go buy it on Steam or PS5 instead of Switch eh.

Press B To Cancel also on YouTube! For updates and more episodes please visit our website www.pressbtocancel.com, or find us on Twitter @pressbtocancel

Want to support the show? Donate via our Patreon and gain additional Discord perks and behind the scenes clips.

Press B is a member of the SuperPod Network; a gaming collective of fellow podcasters and shows.

Special thanks to The Last Ancient on SoundCloud for our podcast theme.

Find out more at http://pressbtocancel.com

Share this episode

Similar Episodes

The Verse We’ve All Butchered: Philippians 4:13

Oct 23, 2025 ·26m

The Verse That Launched a Thousand Coffee Mugs

Oct 16, 2025 ·21m

Gabriel Showed Up. Zechariah Panicked. Same.

Oct 8, 2025 ·18m

Meet Your Hosts

Oct 1, 2025 ·33m

Episode 3: Yacht Rock - California Cruising

Apr 24, 2025 ·57m

Episode 1: Club Yacht Rock Megamix 1 - DJ R.O.B.

Apr 18, 2025 ·61m

Similar Podcasts

Talk Bible To Me The Bold Movement Context is our love language.Talk Bible to Me is where two women who actually love the text walk you through the story behind the story. Kayla Wolfe (B.S. in Bible & Theology, Liberty University) and Megan Rawlings (PhD student in Biblical Studies, Amridge University) mix big-sister warmth with scholar-level clarity. Think laughter with footnotes.Each episode zooms in and gives you the who (author & audience), the when/where (historical setting), the how (literary flow & key terms), and the why (gospel connections), so application flows from accurate interpretation. Expect wit without snark, reverence without stuffiness, and the occasional nod to your favorite scholars and theologians. Bring your Bible and your questions; we’ll bring the maps, the timelines, and just enough Hebrew & Greek to be precise without being pretentious. Press play and level up your Bible reading. Poetic Diary by B. Janai B. Janai Poetic Diary features original poems and spoken word written by B. Janai. Make sure to press the "Follow" button and leave a review! Visit my website at bjanai.com. #PoeticDiaries Algorithmen 2, Vorlesung, WS19/20 Karlsruher Institut für Technologie (KIT) Diese Lehrveranstaltung soll Studierenden die grundlegenden theoretischen und praktischen Aspekte der Algorithmentechnik vermitteln. Es werden generelle Methoden zum Entwurf und der Analyse von Algorithmen für grundlegende algorithmische Probleme vermittelt sowie die Grundzüge allgemeiner algorithmischer Methoden wie Approximationsalgorithmen, Lineare Programmierung, Randomisierte Algorithmen, Parallele Algorithmen und parametrisierte Algorithmen behandelt.Literaturhinweise:- K. Mehlhorn, P. Sanders: Algorithms and Data Structures - The Basic Toolbox- K. Mehlhorn, S. Naeher: The LEDA Platform of Combinatorial and Geometric Computing Topic: Algorithm Engineering, Flows, Geometrie- R. K. Ahuja, T. L. Magnanti, J.B. Orlin: Network Flows- M. de Berg, M. van Kreveld, M. Overmars, O. C. Schwarzkopf: Computational Geometry: Algorithms and Applications- G. Navarro: Compact Data Structures "A Practical Approach", Cambridge University Press- R. Niedermeier: Invitation to Fixed-Parameter Algorithmen 2, Vorlesung, WS17/18 Karlsruher Institut für Technologie (KIT) Diese Lehrveranstaltung soll Studierenden die grundlegenden theoretischen und praktischen Aspekte der Algorithmentechnik vermitteln. Es werden generelle Methoden zum Entwurf und der Analyse von Algorithmen für grundlegende algorithmische Probleme vermittelt sowie die Grundzüge allgemeiner algorithmischer Methoden wie Approximationsalgorithmen, Lineare Programmierung, Randomisierte Algorithmen, Parallele Algorithmen und parametrisierte Algorithmen behandelt.Literaturhinweise:- K. Mehlhorn, P. Sanders: Algorithms and Data Structures - The Basic Toolbox- K. Mehlhorn, S. Naeher: The LEDA Platform of Combinatorial and Geometric Computing Topic: Algorithm Engineering, Flows, Geometrie- R. K. Ahuja, T. L. Magnanti, J.B. Orlin: Network Flows- M. de Berg, M. van Kreveld, M. Overmars, O. C. Schwarzkopf: Computational Geometry: Algorithms and Applications- G. Navarro: Compact Data Structures "A Practical Approach", Cambridge University Press- R. Niedermeier: Invitation to Fixed-Parameter

URL copied to clipboard!