Hubworld: Aidalon | Gameplay First Look

About Hubworld: Aidalon, from BoardGameGeek:

Aidalon was once the busiest hubworld in the galaxy. Then the Collective arrived. Their portal technology connected all worlds, making space travel obsolete. Aidalon's shipyards became scrap yards, yet its people persevered. In the myriad districts of Aidalon, exceptional individuals known as Seekers rise above the throng. Trading in the black market currency known as Shards, Seekers enlist the aid of influential Agents who have the power to help those closest to them, heedless of the Collective's will. Hubworld: Aidalon is a non-collectible, competitive card game of daring espionage, deduction, and suspense. Take on the role of a Seeker as you navigate the vertical streets of Aidalon, infiltrating your opponent's districts to expand your network of Agents before they can do the same. Each Seeker is represented by a Seeker card, as well as a 36 card deck you construct. Each deck must contain exactly 6 Agents chosen along with 30 other cards from up to 4 different factions. These cards can be Sources (people and places), Obstacles (traps and barriers), and Moments (one-off abilities and tricks). To win the game, you must secure 3 Agents from your opponent before they do the same. The first player to secure 3 Agents wins. When playing against multiple opponents, each Agent must come from a different player (if able). To secure an Agent, you'll delve into your opponents' three Districts (their hand, deck, and discard). Your opponents will load up their grid with a hidden network of dangerous defenses, taxing distractions, or even Agents themselves to make your life difficult, forging powerful cards to thwart your plans at inopportune moments. You'll need to balance building your Grid against more aggressive tactics, creating a card economy that will supply you with a steady flow of shards (your main resource) while you utilize your arsenal of tricks and surprises to keep your opponents on their toes. -description from the publisher