Enumerative combinatorics is an area in combinatorics that mainly focuses on enumerating the number of ways to form certain configurations. With the help from computers and the internet, researches in enumerative combinatorics has developed dramatically in the past decades. In this talk, we will introduce signed permutations and their structures. Then we will use signed permutations as an example of how one might use a computer to come up with interesting research problems to solve. Then, we will end the talk by presenting some open problems in enumerative combinatorics.