Ramsey theory seeks to quantify the notion that any sufficiently large discrete structure contains a well-organized substructure. Recently, certain notoriously difficult Ramsey-theoretic problems about hypergraphs have been reduced to special cases involving grid graphs, and significant progress has been made by studying the grid perspective. This project aims to compute bounds on Ramsey numbers in grids for their own sake.