Problem #WSP-5285

Problems Discrete Mathematics Graph Theory

Problem

In a distant village, there are 3 houses and 3 wells. Inhabitants of each house want to have access to all 3 wells. Is it possible to build non-intersecting straight paths from each house to each well? All houses and well must be level (that is, none of them are higher up, like on a mountain, nor are any of them on lower ground, like in a valley).