gerrymandering is the (currently very relevant) issue in representative democracies of drawing electoral districts to give a political advantage to one party or group. political events within the last few years have sparked a lot of research activity from mathematicians, computer scientists, and statisticians related to detecting and quantifying gerrymandered electoral plans. in this talk i will give an introduction to the problem of gerrymandering, discuss some historical attempted methods of quantifying gerrymanders and their shortcomings, and then talk about a promising new method called ``metagraph markov chain monte carlo'' currently being researched and implemented.