【Abstract】We show that several problems of enumerative combinatorics can be systematically solved using an experimental-mathematics approach combined with modern computer algebra algorithms. We describe the computer-driven discovery and proof of the algebraicity of the generating series of walks confined to the quarter plane and using unit steps going either west, south-west, east, or north-east.