The Byzantine Generals Problem(BGP) is a term derived from the computer science description of a situation where involved parties must agree on a single strategy in order to avoid complete failure, but where some of the involved parties are malicious/fake and disseminating false information or are otherwise unreliable.The Byzantine Generals Problem makes for an excellent fundamental example of how Bitcoin’s Proof-of-Work consensus algorithm functions, and understanding it generally elevates your comprehension of other consensus algorithms.This presentation brings out the basics of the BGP in an easy to assimilate manner.