Computing #2-SAT of Grids, Grid-Cylinders and Grid-Tori Boolean Formulas

We present an adaptation of transfer matrix method for signed grids, grid-cylinders and grid-tori. We use this adaptation to count the number of satisfying assignments of Boolean Formulas in 2-CNF whose corresponding associated graph has such grid topologies.