In the past 20 years, the enumeration of plane lattice walks confined to a convex conenormalized into the first quadrant -has received a lot of attention, stimulated the development of several original approaches, and led to a rich collection of results. Most of them deal with the nature of the associated generating function: for which models is it algebraic, D-finite, D-algebraic? By model, what we mean is a finite collection of allowed steps. More recently, similar questions have been raised for non-convex cones, typically the three-quadrant cone C = {(i, j) : i ≥ 0 or j ≥ 0}. They turn out to be more difficult than their quadrant counterparts. In this paper, we investigate a collection of eight models in C, which can be seen as the first level of difficulty beyond quadrant problems. This collection consists of diagonally symmetric models in {−1, 0, 1} 2 \ {(−1, 1), (1, −1)}. Three of them are known not to be D-algebraic. We show that the remaining five can be solved in a uniform fashion using Tutte's notion of invariants, which has already proved useful for some quadrant models. Three models are found to be algebraic, one is (only) D-finite, and the last one is (only) D-algebraic. We also solve in the same fashion the diagonal model { , , , }, which is D-finite. The three algebraic models are those of the Kreweras trilogy, S = { , ←, ↓}, S * = {→, ↑, }, and S ∪ S * . Our solutions take similar forms for all six models. Roughly speaking, the square of the generating function of three-quadrant walks with steps in S is an explicit rational function in the quadrant generating function with steps in S := {(j − i, j) : (i, j) ∈ S }. We derive various exact or asymptotic corollaries, including an explicit algebraic description of a positive harmonic function in C for the (reverses of the) five models that are at least D-finite.