ctbturpie (2:54:06 PM): hey, i have a fun idea. vestpocet (2:54:21 PM): i really doubt it. ctbturpie (2:54:35 PM): :/ vestpocet (2:54:43 PM): i think it involves a P2P client and dirty words. ctbturpie (2:56:07 PM): nooo.
vestpocet (11:33:44 AM): considering an N by N chessboard where N is greater than 3, what is the formula with respect to N that represents the maximum number of bishops that you could place on the board such that no bishop would collide with another bishop if moved one square? vestpocet (11:43:39 AM): sigh :/ you're a dumbass, bridget.