>Hi
>
>I've been asked to design a database. Im having trouble with it though, it sounded easy at first but i just can't get my head around it.
>
>I need to store all AGENTS details which is the easy bit, but each agent is known as AGENT(A), these agents then recruit 4 people, known as AGENT(B), agent(b) recruit 4 people each known as AGENT(C) ect.... (but each agent is also an agent(a) as I need to monitor all agents progress to layer (D) before agents(a) work is completed. The database must be able to list all connected agents on request.
>
>Hope you understand, any help would be great!

You'll want to research recursion, and self-referential links. This is most easily accomplished in a language other than VFP that contain strong supports for linked lists and digraphs (a specialized type of linked list.) While it can be done in VFP, it's awkward and relatively inefficient compared to languages with strong linked list support like Pascal (Delphi) or C/C++, or in an ideal world, LISP.