[ { "question": "Glenda knows Kristin. Dominic knows Eva. Alex knows Tamara. Dee knows Gus. Casey knows Carol. Hailey knows Angela. Angela knows Alex. Casey knows Alder. Alex knows Glenda. Alex knows Colleen. Gus knows Casey. Kendra knows Hailey. Gladys knows Kendra. Eva knows Dee. Lennox knows Mary. Eva knows Bernice. Casey knows Lennox. Kendra knows Kai. Which of Angela and Gus can Gladys reach?", "answer": "Angela", "steps": [ "Gladys knows Kendra.", "Kendra knows Hailey.", "Hailey knows Angela." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Gladys", "Kristin", "Colleen", "Glenda", "Kendra", "Tamara", "Kai", "Alex", "Angela", "Hailey", "Dominic", "Mary", "Alder", "Lennox", "Eva", "Carol", "Bernice", "Casey", "Gus", "Dee" ], "edges": [ [ 0, 4 ], [ 3, 1 ], [ 4, 6 ], [ 4, 9 ], [ 7, 2 ], [ 7, 3 ], [ 7, 5 ], [ 8, 7 ], [ 9, 8 ], [ 10, 14 ], [ 13, 11 ], [ 14, 16 ], [ 14, 19 ], [ 17, 12 ], [ 17, 13 ], [ 17, 15 ], [ 18, 17 ], [ 19, 18 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Gemma knows Marie. Cameron knows Paula. Calvin knows Lois. Ashley knows Calvin. Paula knows Kira. Lois knows Roger. Calvin knows Vivian. Roger knows Carrie. Marie knows Karla. Gage knows Hannah. Kira knows Gemma. Carrie knows Martin. Aaron knows Jocelyn. Paula knows Aaron. Aaron knows Zane. Calvin knows Gage. Paula knows Opal. Gage knows Lenora. Which of Kira and Lois can Cameron reach?", "answer": "Kira", "steps": [ "Cameron knows Paula.", "Paula knows Kira." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Cameron", "Kira", "Marie", "Gemma", "Karla", "Paula", "Aaron", "Opal", "Zane", "Jocelyn", "Ashley", "Lois", "Carrie", "Roger", "Martin", "Calvin", "Gage", "Vivian", "Hannah", "Lenora" ], "edges": [ [ 0, 5 ], [ 1, 3 ], [ 2, 4 ], [ 3, 2 ], [ 5, 1 ], [ 5, 7 ], [ 5, 6 ], [ 6, 8 ], [ 6, 9 ], [ 10, 15 ], [ 11, 13 ], [ 12, 14 ], [ 13, 12 ], [ 15, 11 ], [ 15, 17 ], [ 15, 16 ], [ 16, 18 ], [ 16, 19 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Annette knows Tom. Ruby knows Ellis. Theodore knows Bryan. Wendell knows Julian. Annette knows Val. Val knows Cate. Penny knows Pearl. Tom knows Samuel. Theodore knows Ray. Ruby knows Penny. Penny knows Percy. Julian knows Kaleb. Alison knows Wendell. Bryan knows Ruby. Percy knows Carlos. Julian knows Annette. Alison knows Renee. Pearl knows Evelyn. Which of Annette and Penny can Theodore reach?", "answer": "Penny", "steps": [ "Theodore knows Bryan.", "Bryan knows Ruby.", "Ruby knows Penny." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Theodore", "Bryan", "Percy", "Ray", "Pearl", "Ruby", "Ellis", "Evelyn", "Carlos", "Penny", "Alison", "Wendell", "Tom", "Renee", "Val", "Julian", "Kaleb", "Cate", "Samuel", "Annette" ], "edges": [ [ 0, 3 ], [ 0, 1 ], [ 1, 5 ], [ 2, 8 ], [ 4, 7 ], [ 5, 6 ], [ 5, 9 ], [ 9, 4 ], [ 9, 2 ], [ 10, 13 ], [ 10, 11 ], [ 11, 15 ], [ 12, 18 ], [ 14, 17 ], [ 15, 16 ], [ 15, 19 ], [ 19, 14 ], [ 19, 12 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Haven knows Dylan. Arthur knows Declan. Madeline knows Julian. Arthur knows Bill. Tonya knows Erica. Elsa knows Gerald. Haven knows Fred. Erica knows Madeline. Gonzalo knows Rhonda. Gonzalo knows Tanya. Gerald knows Ramon. Dylan knows Elsa. Martha knows Lottie. Lottie knows Edmund. Fred knows Gonzalo. Lottie knows Tonya. Clay knows Haven. Edmund knows Arthur. Which of Tonya and Dylan can Martha reach?", "answer": "Tonya", "steps": [ "Martha knows Lottie.", "Lottie knows Tonya." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Martha", "Erica", "Declan", "Tonya", "Arthur", "Julian", "Lottie", "Edmund", "Madeline", "Bill", "Clay", "Elsa", "Rhonda", "Dylan", "Gonzalo", "Ramon", "Haven", "Fred", "Gerald", "Tanya" ], "edges": [ [ 0, 6 ], [ 1, 8 ], [ 3, 1 ], [ 4, 2 ], [ 4, 9 ], [ 6, 3 ], [ 6, 7 ], [ 7, 4 ], [ 8, 5 ], [ 10, 16 ], [ 11, 18 ], [ 13, 11 ], [ 14, 12 ], [ 14, 19 ], [ 16, 13 ], [ 16, 17 ], [ 17, 14 ], [ 18, 15 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Keegan knows Juan. Jill knows Penny. Keegan knows Jill. Daria knows Brent. Mark knows Hugh. Mark knows Xavier. Hugh knows Cody. Xavier knows Malik. Brandon knows Mark. Cody knows Gene. Mark knows Leslie. Brent knows Elmer. Drake knows Keegan. Hugh knows Alison. Bart knows Larissa. Alison knows Kerry. Daria knows Bart. Keegan knows Daria. Which of Brent and Alison can Drake reach?", "answer": "Brent", "steps": [ "Drake knows Keegan.", "Keegan knows Daria.", "Daria knows Brent." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Drake", "Daria", "Juan", "Brent", "Elmer", "Keegan", "Jill", "Penny", "Larissa", "Bart", "Brandon", "Hugh", "Leslie", "Alison", "Kerry", "Mark", "Xavier", "Malik", "Gene", "Cody" ], "edges": [ [ 0, 5 ], [ 1, 3 ], [ 1, 9 ], [ 3, 4 ], [ 5, 2 ], [ 5, 6 ], [ 5, 1 ], [ 6, 7 ], [ 9, 8 ], [ 10, 15 ], [ 11, 13 ], [ 11, 19 ], [ 13, 14 ], [ 15, 12 ], [ 15, 16 ], [ 15, 11 ], [ 16, 17 ], [ 19, 18 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Harris knows Ainsley. Franklin knows Raquel. Brian knows Daniella. Larissa knows Milo. Landon knows Susan. Willis knows Charlene. Charlene knows Graham. Clayton knows Brian. Harris knows Hector. Clayton knows Larissa. Hector knows Gwen. Graham knows Bennett. Ainsley knows Freya. Charlene knows Franklin. Gwen knows Clayton. Landon knows Lisette. Lisette knows Lorraine. Susan knows Willis. Which of Susan and Hector can Harris reach?", "answer": "Hector", "steps": [ "Harris knows Hector." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Harris", "Brian", "Milo", "Freya", "Daniella", "Hector", "Clayton", "Ainsley", "Larissa", "Gwen", "Landon", "Franklin", "Bennett", "Lorraine", "Raquel", "Susan", "Charlene", "Lisette", "Graham", "Willis" ], "edges": [ [ 0, 7 ], [ 0, 5 ], [ 1, 4 ], [ 5, 9 ], [ 6, 1 ], [ 6, 8 ], [ 7, 3 ], [ 8, 2 ], [ 9, 6 ], [ 10, 17 ], [ 10, 15 ], [ 11, 14 ], [ 15, 19 ], [ 16, 11 ], [ 16, 18 ], [ 17, 13 ], [ 18, 12 ], [ 19, 16 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Demetrius knows Neil. Josie knows Brittany. Eva knows Lucas. Josie knows Nora. Zach knows Daisy. Claire knows Virgil. Zach knows Philip. Sybil knows Enid. Sybil knows Layla. Eva knows Henry. Eva knows Demetrius. Zach knows Claire. Josie knows Jeremiah. Cruz knows Uma. Jeremiah knows Haley. Claire knows Eva. Sybil knows Cruz. Cruz knows Josie. Which of Haley and Neil can Sybil reach?", "answer": "Haley", "steps": [ "Sybil knows Cruz.", "Cruz knows Josie.", "Josie knows Jeremiah.", "Jeremiah knows Haley." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Sybil", "Uma", "Nora", "Layla", "Jeremiah", "Haley", "Enid", "Brittany", "Josie", "Cruz", "Zach", "Virgil", "Lucas", "Philip", "Demetrius", "Neil", "Daisy", "Henry", "Eva", "Claire" ], "edges": [ [ 0, 3 ], [ 0, 6 ], [ 0, 9 ], [ 4, 5 ], [ 8, 2 ], [ 8, 4 ], [ 8, 7 ], [ 9, 1 ], [ 9, 8 ], [ 10, 13 ], [ 10, 16 ], [ 10, 19 ], [ 14, 15 ], [ 18, 12 ], [ 18, 14 ], [ 18, 17 ], [ 19, 11 ], [ 19, 18 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Perry knows Thea. Garland knows Hayley. Cruz knows Cyrus. Lawrence knows Cliff. Stacy knows Garland. Jameson knows Dewey. Thea knows Ava. Vera knows Dallas. Michelle knows Cruz. Corey knows Xander. Michelle knows Vera. Thea knows Merle. Ava knows Michelle. Dewey knows Lawrence. Elijah knows Perry. Asher knows Stacy. Dewey knows Corey. Garland knows Jameson. Which of Garland and Thea can Elijah reach?", "answer": "Thea", "steps": [ "Elijah knows Perry.", "Perry knows Thea." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Elijah", "Dallas", "Michelle", "Ava", "Perry", "Cyrus", "Thea", "Merle", "Vera", "Cruz", "Asher", "Xander", "Dewey", "Jameson", "Stacy", "Cliff", "Garland", "Hayley", "Corey", "Lawrence" ], "edges": [ [ 0, 4 ], [ 2, 8 ], [ 2, 9 ], [ 3, 2 ], [ 4, 6 ], [ 6, 7 ], [ 6, 3 ], [ 8, 1 ], [ 9, 5 ], [ 10, 14 ], [ 12, 18 ], [ 12, 19 ], [ 13, 12 ], [ 14, 16 ], [ 16, 17 ], [ 16, 13 ], [ 18, 11 ], [ 19, 15 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Goldie knows Jasmine. Colby knows Violet. Goldie knows Brynn. Harmony knows Colby. Travis knows Javier. Ada knows Hunter. Destiny knows Brody. Brody knows Ada. Bennett knows Travis. Jasmine knows Fleur. Violet knows Bernard. Pedro knows Cristina. Colby knows Nicholas. Brody knows Pedro. Bennett knows Natalie. Nicholas knows Martha. Bennett knows Harmony. Goldie knows Destiny. Which of Violet and Ada can Goldie reach?", "answer": "Ada", "steps": [ "Goldie knows Destiny.", "Destiny knows Brody.", "Brody knows Ada." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Goldie", "Ada", "Jasmine", "Cristina", "Fleur", "Brynn", "Hunter", "Brody", "Destiny", "Pedro", "Bennett", "Violet", "Travis", "Martha", "Javier", "Natalie", "Bernard", "Colby", "Harmony", "Nicholas" ], "edges": [ [ 0, 2 ], [ 0, 5 ], [ 0, 8 ], [ 1, 6 ], [ 2, 4 ], [ 7, 1 ], [ 7, 9 ], [ 8, 7 ], [ 9, 3 ], [ 10, 12 ], [ 10, 15 ], [ 10, 18 ], [ 11, 16 ], [ 12, 14 ], [ 17, 11 ], [ 17, 19 ], [ 18, 17 ], [ 19, 13 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Marcus knows Gene. Stephanie knows Ernie. Jane knows Brody. Wendell knows Effie. Perry knows Lauren. Lauren knows Marcus. Ernie knows Colette. Wendell knows Milton. Zoe knows Stephanie. Riley knows Jane. Lyric knows Simon. Milton knows Rocco. Colette knows Wendell. Lauren knows Arturo. Arturo knows Hector. Stephanie knows Lyric. Riley knows Jon. Gene knows Riley. Which of Marcus and Ernie can Zoe reach?", "answer": "Ernie", "steps": [ "Zoe knows Stephanie.", "Stephanie knows Ernie." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Zoe", "Stephanie", "Lyric", "Colette", "Effie", "Ernie", "Simon", "Wendell", "Rocco", "Milton", "Perry", "Lauren", "Arturo", "Gene", "Jon", "Marcus", "Hector", "Riley", "Brody", "Jane" ], "edges": [ [ 0, 1 ], [ 1, 2 ], [ 1, 5 ], [ 2, 6 ], [ 3, 7 ], [ 5, 3 ], [ 7, 4 ], [ 7, 9 ], [ 9, 8 ], [ 10, 11 ], [ 11, 12 ], [ 11, 15 ], [ 12, 16 ], [ 13, 17 ], [ 15, 13 ], [ 17, 14 ], [ 17, 19 ], [ 19, 18 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Maureen knows Hattie. Isadora knows Daphne. Daphne knows Jordan. Dalton knows Jennifer. Mara knows Isla. Isla knows Isadora. Maureen knows Dirk. Dirk knows Brooks. Jordan knows Otto. Kane knows Jay. Carla knows Penny. Jennifer knows Ford. Brody knows Lucille. Jay knows Eden. Jay knows Carla. Jordan knows Maureen. Ford knows Kane. Carla knows Brody. Which of Ford and Isadora can Mara reach?", "answer": "Isadora", "steps": [ "Mara knows Isla.", "Isla knows Isadora." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Mara", "Brooks", "Daphne", "Hattie", "Isla", "Maureen", "Dirk", "Otto", "Isadora", "Jordan", "Dalton", "Lucille", "Kane", "Penny", "Jennifer", "Carla", "Brody", "Eden", "Ford", "Jay" ], "edges": [ [ 0, 4 ], [ 2, 9 ], [ 4, 8 ], [ 5, 3 ], [ 5, 6 ], [ 6, 1 ], [ 8, 2 ], [ 9, 5 ], [ 9, 7 ], [ 10, 14 ], [ 12, 19 ], [ 14, 18 ], [ 15, 13 ], [ 15, 16 ], [ 16, 11 ], [ 18, 12 ], [ 19, 15 ], [ 19, 17 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Christian knows Shelby. Camden knows Celeste. Allen knows Verna. Marie knows Claude. Wallace knows Marie. Celeste knows Christian. Vicki knows Maude. Landon knows Abby. Vanessa knows Bennett. Lana knows Morris. Claude knows Allen. Verna knows Brett. Celeste knows Bonnie. Claude knows Landon. Shelby knows Vanessa. Bonnie knows Josie. Marie knows Vicki. Christian knows Lana. Which of Shelby and Allen can Wallace reach?", "answer": "Allen", "steps": [ "Wallace knows Marie.", "Marie knows Claude.", "Claude knows Allen." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Wallace", "Landon", "Verna", "Brett", "Allen", "Vicki", "Marie", "Abby", "Claude", "Maude", "Camden", "Lana", "Vanessa", "Bennett", "Shelby", "Bonnie", "Celeste", "Morris", "Christian", "Josie" ], "edges": [ [ 0, 6 ], [ 1, 7 ], [ 2, 3 ], [ 4, 2 ], [ 5, 9 ], [ 6, 8 ], [ 6, 5 ], [ 8, 4 ], [ 8, 1 ], [ 10, 16 ], [ 11, 17 ], [ 12, 13 ], [ 14, 12 ], [ 15, 19 ], [ 16, 18 ], [ 16, 15 ], [ 18, 14 ], [ 18, 11 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Dorothy knows Colette. Priscilla knows Regina. Fanny knows Lorna. Jakob knows Lee. Lorna knows Zane. Jakob knows Grace. Jaime knows Humphrey. Dorothy knows Parker. Erwin knows Todd. Zane knows Dixie. Jaime knows Erwin. Parker knows Priscilla. Grace knows Fanny. Grace knows Celia. Miles knows Jaime. Sam knows Jakob. Erwin knows Dorothy. Fanny knows Sierra. Which of Grace and Erwin can Miles reach?", "answer": "Erwin", "steps": [ "Miles knows Jaime.", "Jaime knows Erwin." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Miles", "Regina", "Jaime", "Erwin", "Todd", "Dorothy", "Priscilla", "Parker", "Humphrey", "Colette", "Sam", "Dixie", "Jakob", "Grace", "Celia", "Fanny", "Zane", "Lorna", "Lee", "Sierra" ], "edges": [ [ 0, 2 ], [ 2, 8 ], [ 2, 3 ], [ 3, 4 ], [ 3, 5 ], [ 5, 7 ], [ 5, 9 ], [ 6, 1 ], [ 7, 6 ], [ 10, 12 ], [ 12, 18 ], [ 12, 13 ], [ 13, 14 ], [ 13, 15 ], [ 15, 17 ], [ 15, 19 ], [ 16, 11 ], [ 17, 16 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Xavier knows Ben. Lorna knows Sandra. Patricia knows Carlos. Yuki knows Patricia. Maude knows Allan. Tyler knows Xavier. Lamont knows Kai. Hannah knows Laverne. Xavier knows Lamont. Patricia knows Wade. Xavier knows Lorna. Rick knows Tyler. Laverne knows Rick. Sadie knows Maude. Wade knows Hector. Patricia knows Skyler. Skyler knows Arden. Allan knows Yuki. Which of Tyler and Yuki can Sadie reach?", "answer": "Yuki", "steps": [ "Sadie knows Maude.", "Maude knows Allan.", "Allan knows Yuki." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Sadie", "Hector", "Yuki", "Patricia", "Allan", "Carlos", "Maude", "Arden", "Skyler", "Wade", "Hannah", "Kai", "Tyler", "Xavier", "Rick", "Ben", "Laverne", "Sandra", "Lorna", "Lamont" ], "edges": [ [ 0, 6 ], [ 2, 3 ], [ 3, 5 ], [ 3, 8 ], [ 3, 9 ], [ 4, 2 ], [ 6, 4 ], [ 8, 7 ], [ 9, 1 ], [ 10, 16 ], [ 12, 13 ], [ 13, 15 ], [ 13, 18 ], [ 13, 19 ], [ 14, 12 ], [ 16, 14 ], [ 18, 17 ], [ 19, 11 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Gina knows Philip. Cora knows Rhonda. Bart knows Rebecca. Elaine knows Gina. Douglas knows Bart. Tom knows Ted. Randall knows Byron. Philip knows Aspen. Ted knows Elaine. Holden knows Claude. Aspen knows Trevor. Rebecca knows Ivy. Kane knows Tom. Rhonda knows Samantha. Claude knows Kane. Ivy knows Horace. Horace knows Cora. Samantha knows Randall. Which of Ivy and Tom can Douglas reach?", "answer": "Ivy", "steps": [ "Douglas knows Bart.", "Bart knows Rebecca.", "Rebecca knows Ivy." ], "difficulty": 3, "original_distance": 9, "idx_to_symbol": [ "Douglas", "Bart", "Randall", "Cora", "Ivy", "Rhonda", "Byron", "Rebecca", "Samantha", "Horace", "Holden", "Claude", "Aspen", "Elaine", "Tom", "Gina", "Trevor", "Kane", "Philip", "Ted" ], "edges": [ [ 0, 1 ], [ 1, 7 ], [ 2, 6 ], [ 3, 5 ], [ 4, 9 ], [ 5, 8 ], [ 7, 4 ], [ 8, 2 ], [ 9, 3 ], [ 10, 11 ], [ 11, 17 ], [ 12, 16 ], [ 13, 15 ], [ 14, 19 ], [ 15, 18 ], [ 17, 14 ], [ 18, 12 ], [ 19, 13 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Ryan knows Javier. Dustin knows Ava. Ryan knows Wyatt. Carol knows Luke. Abel knows Kristin. Abel knows Preston. Wyatt knows Paige. Griffith knows Eleanor. Preston knows Darrell. Ryan knows Dustin. Kristin knows Carol. Dustin knows Colby. Landon knows Dayton. Don knows Landon. Luke knows Hampton. Javier knows Don. Griffith knows Larry. Abel knows Griffith. Which of Don and Carol can Ryan reach?", "answer": "Don", "steps": [ "Ryan knows Javier.", "Javier knows Don." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Ryan", "Javier", "Dustin", "Paige", "Dayton", "Wyatt", "Ava", "Colby", "Landon", "Don", "Abel", "Kristin", "Griffith", "Darrell", "Hampton", "Preston", "Eleanor", "Larry", "Luke", "Carol" ], "edges": [ [ 0, 5 ], [ 0, 2 ], [ 0, 1 ], [ 1, 9 ], [ 2, 6 ], [ 2, 7 ], [ 5, 3 ], [ 8, 4 ], [ 9, 8 ], [ 10, 15 ], [ 10, 12 ], [ 10, 11 ], [ 11, 19 ], [ 12, 16 ], [ 12, 17 ], [ 15, 13 ], [ 18, 14 ], [ 19, 18 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Lana knows Hayley. Mildred knows Mitchell. Arlene knows Davis. Arden knows Agnes. Angela knows Lana. Hayley knows Hunter. Charlotte knows Adrian. Karl knows Marco. Fanny knows Arden. Effie knows Angela. Mitchell knows Wayne. Angela knows Brody. Effie knows Charlotte. Mildred knows Arlene. Charlotte knows Jakob. Adrian knows April. Arlene knows Fanny. Mitchell knows Karl. Which of Arden and Hayley can Effie reach?", "answer": "Hayley", "steps": [ "Effie knows Angela.", "Angela knows Lana.", "Lana knows Hayley." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Effie", "Angela", "Jakob", "Lana", "Charlotte", "Hayley", "Brody", "Adrian", "Hunter", "April", "Mildred", "Arlene", "Wayne", "Fanny", "Mitchell", "Arden", "Davis", "Karl", "Agnes", "Marco" ], "edges": [ [ 0, 1 ], [ 0, 4 ], [ 1, 6 ], [ 1, 3 ], [ 3, 5 ], [ 4, 2 ], [ 4, 7 ], [ 5, 8 ], [ 7, 9 ], [ 10, 11 ], [ 10, 14 ], [ 11, 16 ], [ 11, 13 ], [ 13, 15 ], [ 14, 12 ], [ 14, 17 ], [ 15, 18 ], [ 17, 19 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Ashley knows Leon. Ibrahim knows Lillian. Lola knows Ann. Alexa knows Beau. Stacy knows Corinne. Stacy knows Cynthia. Leon knows Marshall. Shane knows Ibrahim. Ann knows Dwight. Corinne knows Cesar. Jane knows Shelly. Corinne knows Eduardo. Ibrahim knows Alexa. Alexa knows Ashley. Margaret knows Shane. Shane knows Jeff. Eduardo knows Jane. Ann knows Stacy. Which of Shelly and Marshall can Margaret reach?", "answer": "Marshall", "steps": [ "Margaret knows Shane.", "Shane knows Ibrahim.", "Ibrahim knows Alexa.", "Alexa knows Ashley.", "Ashley knows Leon.", "Leon knows Marshall." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Margaret", "Leon", "Alexa", "Shane", "Jeff", "Ashley", "Beau", "Marshall", "Ibrahim", "Lillian", "Lola", "Jane", "Corinne", "Ann", "Dwight", "Eduardo", "Cesar", "Shelly", "Stacy", "Cynthia" ], "edges": [ [ 0, 3 ], [ 1, 7 ], [ 2, 6 ], [ 2, 5 ], [ 3, 4 ], [ 3, 8 ], [ 5, 1 ], [ 8, 2 ], [ 8, 9 ], [ 10, 13 ], [ 11, 17 ], [ 12, 16 ], [ 12, 15 ], [ 13, 14 ], [ 13, 18 ], [ 15, 11 ], [ 18, 12 ], [ 18, 19 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Emmett knows Darnell. Patrick knows Felicia. Gideon knows Kurt. Emmett knows Tristan. Emmett knows Patrick. Pearl knows Emmett. Davis knows Calvin. Calvin knows Frida. Lorenzo knows Fanny. Calvin knows Sean. Troy knows Davis. Carrie knows Gideon. Carrie knows Samantha. Travis knows Wanda. Lorenzo knows Pearl. Wanda knows Lorenzo. Sean knows Carrie. Carrie knows Benjamin. Which of Felicia and Kurt can Travis reach?", "answer": "Felicia", "steps": [ "Travis knows Wanda.", "Wanda knows Lorenzo.", "Lorenzo knows Pearl.", "Pearl knows Emmett.", "Emmett knows Patrick.", "Patrick knows Felicia." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Travis", "Emmett", "Felicia", "Wanda", "Darnell", "Lorenzo", "Pearl", "Patrick", "Fanny", "Tristan", "Troy", "Carrie", "Kurt", "Davis", "Benjamin", "Calvin", "Sean", "Gideon", "Frida", "Samantha" ], "edges": [ [ 0, 3 ], [ 1, 4 ], [ 1, 7 ], [ 1, 9 ], [ 3, 5 ], [ 5, 8 ], [ 5, 6 ], [ 6, 1 ], [ 7, 2 ], [ 10, 13 ], [ 11, 14 ], [ 11, 17 ], [ 11, 19 ], [ 13, 15 ], [ 15, 18 ], [ 15, 16 ], [ 16, 11 ], [ 17, 12 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Carol knows Leticia. Julia knows Deborah. Gerald knows Lambert. Lambert knows Cain. Uma knows Gerald. Reid knows Edgar. Uma knows Katrina. Carol knows Marcia. Reid knows Rita. Deborah knows Byron. Leticia knows Corinne. Uma knows Julia. Leticia knows Monroe. Julia knows Fred. Alison knows Reid. Monroe knows Jenny. Carol knows Alison. Lambert knows Declan. Which of Lambert and Reid can Carol reach?", "answer": "Reid", "steps": [ "Carol knows Alison.", "Alison knows Reid." ], "difficulty": 2, "original_distance": 3, "idx_to_symbol": [ "Carol", "Monroe", "Rita", "Corinne", "Edgar", "Alison", "Jenny", "Marcia", "Reid", "Leticia", "Uma", "Deborah", "Declan", "Fred", "Cain", "Gerald", "Byron", "Katrina", "Lambert", "Julia" ], "edges": [ [ 0, 7 ], [ 0, 5 ], [ 0, 9 ], [ 1, 6 ], [ 5, 8 ], [ 8, 2 ], [ 8, 4 ], [ 9, 3 ], [ 9, 1 ], [ 10, 17 ], [ 10, 15 ], [ 10, 19 ], [ 11, 16 ], [ 15, 18 ], [ 18, 12 ], [ 18, 14 ], [ 19, 13 ], [ 19, 11 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Brian knows Alvin. Daphna knows Jenny. Alvin knows Morris. Kylie knows Clay. Clay knows Heidi. Joyce knows Tristan. Louise knows William. Heidi knows Brandon. Randall knows Kylie. Noel knows Winston. Jenny knows Randall. Fisher knows Finn. Heidi knows Jonathan. Finn knows Noel. Joyce knows Brian. Winston knows Dolores. Jonathan knows Louise. Dolores knows Joyce. Which of Finn and Jenny can Fisher reach?", "answer": "Finn", "steps": [ "Fisher knows Finn." ], "difficulty": 1, "original_distance": 8, "idx_to_symbol": [ "Fisher", "Winston", "Tristan", "Finn", "Noel", "Morris", "Joyce", "Alvin", "Dolores", "Brian", "Daphna", "Kylie", "Brandon", "Jenny", "Randall", "William", "Heidi", "Louise", "Clay", "Jonathan" ], "edges": [ [ 0, 3 ], [ 1, 8 ], [ 3, 4 ], [ 4, 1 ], [ 6, 2 ], [ 6, 9 ], [ 7, 5 ], [ 8, 6 ], [ 9, 7 ], [ 10, 13 ], [ 11, 18 ], [ 13, 14 ], [ 14, 11 ], [ 16, 12 ], [ 16, 19 ], [ 17, 15 ], [ 18, 16 ], [ 19, 17 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Fiona knows Damian. Henrietta knows Dorian. Jude knows Faye. Vernon knows Callum. Hugo knows Yolanda. Jude knows Ivan. Hugo knows Jason. Jason knows Eugenia. Martha knows Hugo. Hugo knows Hardy. Faye knows Boyd. Rocco knows Alfred. Jude knows Craig. Dorian knows Jude. Vernon knows Martha. Martha knows Fiona. Dorian knows Rocco. Henrietta knows Kobe. Which of Jason and Faye can Henrietta reach?", "answer": "Faye", "steps": [ "Henrietta knows Dorian.", "Dorian knows Jude.", "Jude knows Faye." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Henrietta", "Ivan", "Rocco", "Faye", "Alfred", "Jude", "Boyd", "Craig", "Kobe", "Dorian", "Vernon", "Hardy", "Fiona", "Jason", "Damian", "Hugo", "Eugenia", "Yolanda", "Callum", "Martha" ], "edges": [ [ 0, 8 ], [ 0, 9 ], [ 2, 4 ], [ 3, 6 ], [ 5, 1 ], [ 5, 3 ], [ 5, 7 ], [ 9, 2 ], [ 9, 5 ], [ 10, 18 ], [ 10, 19 ], [ 12, 14 ], [ 13, 16 ], [ 15, 11 ], [ 15, 13 ], [ 15, 17 ], [ 19, 12 ], [ 19, 15 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Demetrius knows Kristin. Vance knows Lillian. Wendy knows Isabel. Roland knows Demetrius. Lillian knows Connor. Roland knows Brody. Pam knows Roland. Maude knows Marie. Wendy knows Roger. Nina knows Miles. Lillian knows Nina. Roland knows Blake. Kristin knows Leopold. Nina knows Jenna. Lillian knows Maude. Marie knows Nicole. Lillian knows Yvette. Roland knows Wendy. Which of Demetrius and Maude can Pam reach?", "answer": "Demetrius", "steps": [ "Pam knows Roland.", "Roland knows Demetrius." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Pam", "Roland", "Leopold", "Kristin", "Roger", "Demetrius", "Brody", "Blake", "Isabel", "Wendy", "Vance", "Lillian", "Nicole", "Marie", "Miles", "Maude", "Yvette", "Connor", "Jenna", "Nina" ], "edges": [ [ 0, 1 ], [ 1, 5 ], [ 1, 6 ], [ 1, 7 ], [ 1, 9 ], [ 3, 2 ], [ 5, 3 ], [ 9, 4 ], [ 9, 8 ], [ 10, 11 ], [ 11, 15 ], [ 11, 16 ], [ 11, 17 ], [ 11, 19 ], [ 13, 12 ], [ 15, 13 ], [ 19, 14 ], [ 19, 18 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Brooke knows Jonah. Todd knows Teresa. Heidi knows Gareth. Gloria knows Philip. Teresa knows Francis. Luke knows Estelle. Todd knows Gloria. Jonah knows Jerry. Gareth knows Betty. Dana knows Lee. Michelle knows Dana. Estelle knows Yuki. Francis knows Bailey. Michelle knows Todd. Heidi knows Brooke. Luke knows Heidi. Jonah knows Kara. Francis knows Elton. Which of Jonah and Francis can Michelle reach?", "answer": "Francis", "steps": [ "Michelle knows Todd.", "Todd knows Teresa.", "Teresa knows Francis." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Michelle", "Gloria", "Teresa", "Todd", "Lee", "Philip", "Bailey", "Elton", "Dana", "Francis", "Luke", "Gareth", "Brooke", "Heidi", "Yuki", "Betty", "Kara", "Jerry", "Estelle", "Jonah" ], "edges": [ [ 0, 8 ], [ 0, 3 ], [ 1, 5 ], [ 2, 9 ], [ 3, 1 ], [ 3, 2 ], [ 8, 4 ], [ 9, 6 ], [ 9, 7 ], [ 10, 18 ], [ 10, 13 ], [ 11, 15 ], [ 12, 19 ], [ 13, 11 ], [ 13, 12 ], [ 18, 14 ], [ 19, 16 ], [ 19, 17 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Ember knows Marc. Marion knows Arturo. Gertrude knows Delia. Arturo knows Sebastian. Harper knows Chantal. Helene knows Hector. Hayden knows Gertrude. Harry knows Kevin. Donald knows Helene. Sue knows Donald. Kennedy knows Stephanie. Stephanie knows Hayden. Ember knows Harper. Marc knows Kennedy. Arturo knows Sue. Hector knows Harry. Sebastian knows Josie. Abby knows Ember. Which of Kevin and Delia can Marion reach?", "answer": "Kevin", "steps": [ "Marion knows Arturo.", "Arturo knows Sue.", "Sue knows Donald.", "Donald knows Helene.", "Helene knows Hector.", "Hector knows Harry.", "Harry knows Kevin." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Marion", "Helene", "Josie", "Harry", "Arturo", "Sue", "Hector", "Sebastian", "Kevin", "Donald", "Abby", "Stephanie", "Chantal", "Gertrude", "Ember", "Marc", "Hayden", "Harper", "Delia", "Kennedy" ], "edges": [ [ 0, 4 ], [ 1, 6 ], [ 3, 8 ], [ 4, 7 ], [ 4, 5 ], [ 5, 9 ], [ 6, 3 ], [ 7, 2 ], [ 9, 1 ], [ 10, 14 ], [ 11, 16 ], [ 13, 18 ], [ 14, 17 ], [ 14, 15 ], [ 15, 19 ], [ 16, 13 ], [ 17, 12 ], [ 19, 11 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Brooks knows Laura. Jon knows Bonnie. James knows Emery. Brad knows Geraldine. Jon knows Brad. Geraldine knows Wyatt. Brad knows Reed. Laura knows Katrina. Reed knows Harlan. Candice knows Aiden. Wyatt knows Brooks. Chad knows Jasmine. Terrence knows Keegan. Keegan knows Chad. Terrence knows Dayton. Keegan knows Candice. Emery knows Helen. Jasmine knows James. Which of Katrina and Helen can Terrence reach?", "answer": "Helen", "steps": [ "Terrence knows Keegan.", "Keegan knows Chad.", "Chad knows Jasmine.", "Jasmine knows James.", "James knows Emery.", "Emery knows Helen." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Terrence", "Keegan", "Chad", "James", "Jasmine", "Dayton", "Aiden", "Candice", "Emery", "Helen", "Jon", "Brad", "Geraldine", "Brooks", "Wyatt", "Bonnie", "Harlan", "Reed", "Laura", "Katrina" ], "edges": [ [ 0, 5 ], [ 0, 1 ], [ 1, 7 ], [ 1, 2 ], [ 2, 4 ], [ 3, 8 ], [ 4, 3 ], [ 7, 6 ], [ 8, 9 ], [ 10, 15 ], [ 10, 11 ], [ 11, 17 ], [ 11, 12 ], [ 12, 14 ], [ 13, 18 ], [ 14, 13 ], [ 17, 16 ], [ 18, 19 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Stacy knows Magdalena. Stanley knows Marcia. Arnold knows Farrah. Ernesto knows Cruz. Amelia knows Grant. Elise knows Stanley. Jared knows Elise. Carter knows Eldon. Stanley knows Lorenzo. Farrah knows India. Craig knows Tina. Craig knows Ernesto. Marcia knows Arnold. Tina knows Harley. Arnold knows Amelia. Stacy knows Uma. Magdalena knows Craig. Eldon knows Stacy. Which of Elise and Eldon can Jared reach?", "answer": "Elise", "steps": [ "Jared knows Elise." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Jared", "India", "Lorenzo", "Marcia", "Arnold", "Farrah", "Grant", "Stanley", "Amelia", "Elise", "Carter", "Cruz", "Uma", "Magdalena", "Craig", "Ernesto", "Harley", "Stacy", "Tina", "Eldon" ], "edges": [ [ 0, 9 ], [ 3, 4 ], [ 4, 5 ], [ 4, 8 ], [ 5, 1 ], [ 7, 2 ], [ 7, 3 ], [ 8, 6 ], [ 9, 7 ], [ 10, 19 ], [ 13, 14 ], [ 14, 15 ], [ 14, 18 ], [ 15, 11 ], [ 17, 12 ], [ 17, 13 ], [ 18, 16 ], [ 19, 17 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Dorothy knows Chad. Joan knows Ken. Alan knows Arlene. Ken knows Cordelia. Aurora knows Dorothy. Elvira knows Kylie. Elvira knows Guillermo. Alan knows Cameron. Brooks knows Elvira. Leah knows Kobe. Cordelia knows Keith. Alan knows Brooks. Guillermo knows Leah. Ken knows Jesse. Kara knows Alan. Dorothy knows Cruz. Dorothy knows Joan. Keith knows Dee. Which of Elvira and Ken can Kara reach?", "answer": "Elvira", "steps": [ "Kara knows Alan.", "Alan knows Brooks.", "Brooks knows Elvira." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Kara", "Arlene", "Guillermo", "Cameron", "Kobe", "Elvira", "Brooks", "Leah", "Alan", "Kylie", "Aurora", "Cruz", "Cordelia", "Chad", "Dee", "Ken", "Joan", "Keith", "Dorothy", "Jesse" ], "edges": [ [ 0, 8 ], [ 2, 7 ], [ 5, 2 ], [ 5, 9 ], [ 6, 5 ], [ 7, 4 ], [ 8, 1 ], [ 8, 3 ], [ 8, 6 ], [ 10, 18 ], [ 12, 17 ], [ 15, 12 ], [ 15, 19 ], [ 16, 15 ], [ 17, 14 ], [ 18, 11 ], [ 18, 13 ], [ 18, 16 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Mary knows Kent. Kevin knows Sybil. Sybil knows Frankie. Eric knows Martha. Atlas knows Devon. Sybil knows Mindy. Eric knows Larry. Eric knows Dick. Frankie knows Bart. Bart knows Conner. Cliff knows Alyson. Alyson knows Colleen. Bart knows Elias. Mary knows Tiffany. Kent knows Eric. Cliff knows Mary. Kevin knows Atlas. Bart knows Clay. Which of Sybil and Mary can Kevin reach?", "answer": "Sybil", "steps": [ "Kevin knows Sybil." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Kevin", "Sybil", "Devon", "Bart", "Clay", "Elias", "Frankie", "Atlas", "Mindy", "Conner", "Cliff", "Mary", "Colleen", "Eric", "Larry", "Martha", "Kent", "Alyson", "Tiffany", "Dick" ], "edges": [ [ 0, 7 ], [ 0, 1 ], [ 1, 8 ], [ 1, 6 ], [ 3, 4 ], [ 3, 5 ], [ 3, 9 ], [ 6, 3 ], [ 7, 2 ], [ 10, 17 ], [ 10, 11 ], [ 11, 18 ], [ 11, 16 ], [ 13, 14 ], [ 13, 15 ], [ 13, 19 ], [ 16, 13 ], [ 17, 12 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Gladys knows Jenna. Cristina knows Peggy. Ursula knows Leigh. Antonio knows Guy. Sally knows Carmela. Gladys knows Lola. Catherine knows Monroe. Leigh knows Sally. Rebecca knows Arturo. Charles knows Jonathan. Rebecca knows Antonio. Sally knows Noel. Justine knows Charles. Guy knows Tom. Catherine knows Justine. Guy knows Cristina. Peggy knows Gladys. Charles knows Ursula. Which of Charles and Guy can Catherine reach?", "answer": "Charles", "steps": [ "Catherine knows Justine.", "Justine knows Charles." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Catherine", "Charles", "Jonathan", "Noel", "Ursula", "Justine", "Sally", "Carmela", "Monroe", "Leigh", "Rebecca", "Guy", "Tom", "Lola", "Cristina", "Antonio", "Gladys", "Jenna", "Arturo", "Peggy" ], "edges": [ [ 0, 8 ], [ 0, 5 ], [ 1, 2 ], [ 1, 4 ], [ 4, 9 ], [ 5, 1 ], [ 6, 3 ], [ 6, 7 ], [ 9, 6 ], [ 10, 18 ], [ 10, 15 ], [ 11, 12 ], [ 11, 14 ], [ 14, 19 ], [ 15, 11 ], [ 16, 13 ], [ 16, 17 ], [ 19, 16 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Henry knows Juan. Isiah knows Henry. Emmett knows Chantal. Daniella knows Theodore. Eamon knows Heath. Glenn knows Zack. Daniella knows Karl. Victor knows Daniella. Chantal knows Whitney. Barbara knows Emmett. Eamon knows Grace. Nelson knows Isabel. Isiah knows Victor. Daniella knows Kennedy. Whitney knows Eamon. Isabel knows Isiah. Eamon knows Joaquin. Chantal knows Glenn. Which of Whitney and Victor can Nelson reach?", "answer": "Victor", "steps": [ "Nelson knows Isabel.", "Isabel knows Isiah.", "Isiah knows Victor." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Nelson", "Juan", "Victor", "Isiah", "Theodore", "Kennedy", "Henry", "Isabel", "Daniella", "Karl", "Barbara", "Zack", "Whitney", "Chantal", "Joaquin", "Heath", "Glenn", "Emmett", "Eamon", "Grace" ], "edges": [ [ 0, 7 ], [ 2, 8 ], [ 3, 6 ], [ 3, 2 ], [ 6, 1 ], [ 7, 3 ], [ 8, 4 ], [ 8, 5 ], [ 8, 9 ], [ 10, 17 ], [ 12, 18 ], [ 13, 16 ], [ 13, 12 ], [ 16, 11 ], [ 17, 13 ], [ 18, 14 ], [ 18, 15 ], [ 18, 19 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Beau knows Fleur. Frances knows Beau. Hazel knows Dee. Alejandro knows Tony. Frances knows Lillian. Frankie knows Gail. Dolores knows Kira. Georgia knows Dirk. Dee knows Anton. Frankie knows Hazel. Lillian knows Virginia. Dirk knows Frances. Frances knows Alejandro. Dirk knows Juan. Federico knows Frankie. Hazel knows Dolores. Hazel knows Jasper. Jasper knows Melissa. Which of Virginia and Melissa can Georgia reach?", "answer": "Virginia", "steps": [ "Georgia knows Dirk.", "Dirk knows Frances.", "Frances knows Lillian.", "Lillian knows Virginia." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Georgia", "Fleur", "Juan", "Virginia", "Frances", "Dirk", "Alejandro", "Lillian", "Tony", "Beau", "Federico", "Kira", "Gail", "Melissa", "Hazel", "Frankie", "Dee", "Jasper", "Anton", "Dolores" ], "edges": [ [ 0, 5 ], [ 4, 7 ], [ 4, 6 ], [ 4, 9 ], [ 5, 2 ], [ 5, 4 ], [ 6, 8 ], [ 7, 3 ], [ 9, 1 ], [ 10, 15 ], [ 14, 17 ], [ 14, 16 ], [ 14, 19 ], [ 15, 12 ], [ 15, 14 ], [ 16, 18 ], [ 17, 13 ], [ 19, 11 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "James knows Daisy. Duke knows Raquel. Griffith knows Hardy. Dakota knows Gordon. Keegan knows Lamont. Lamont knows Griffith. Teresa knows James. Dakota knows Vance. Leah knows Teresa. Alma knows Ramona. Ramona knows Duke. Ariel knows Keegan. Hardy knows Dakota. Adrian knows Ariel. Lamont knows Devin. James knows Alma. Trevor knows Leah. Duke knows Daniella. Which of Ramona and Hardy can Trevor reach?", "answer": "Ramona", "steps": [ "Trevor knows Leah.", "Leah knows Teresa.", "Teresa knows James.", "James knows Alma.", "Alma knows Ramona." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Trevor", "Teresa", "Ramona", "Raquel", "Daisy", "James", "Alma", "Leah", "Duke", "Daniella", "Adrian", "Keegan", "Hardy", "Gordon", "Devin", "Lamont", "Griffith", "Ariel", "Dakota", "Vance" ], "edges": [ [ 0, 7 ], [ 1, 5 ], [ 2, 8 ], [ 5, 4 ], [ 5, 6 ], [ 6, 2 ], [ 7, 1 ], [ 8, 3 ], [ 8, 9 ], [ 10, 17 ], [ 11, 15 ], [ 12, 18 ], [ 15, 14 ], [ 15, 16 ], [ 16, 12 ], [ 17, 11 ], [ 18, 13 ], [ 18, 19 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Ada knows Garrison. Ruth knows Layla. Greg knows Matt. Garrison knows Keith. Keith knows Lyle. Eden knows Cain. Livia knows Michelle. Priscilla knows Ruth. Eli knows Lucia. Eden knows Chris. Eli knows Eden. Greg knows Blanche. Chris knows Stella. Garrison knows Greg. Cain knows Priscilla. Chris knows Jermaine. Ada knows Abigail. Lyle knows Livia. Which of Lyle and Priscilla can Ada reach?", "answer": "Lyle", "steps": [ "Ada knows Garrison.", "Garrison knows Keith.", "Keith knows Lyle." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Ada", "Blanche", "Garrison", "Lyle", "Michelle", "Greg", "Livia", "Abigail", "Matt", "Keith", "Eli", "Jermaine", "Eden", "Priscilla", "Layla", "Chris", "Ruth", "Lucia", "Stella", "Cain" ], "edges": [ [ 0, 7 ], [ 0, 2 ], [ 2, 5 ], [ 2, 9 ], [ 3, 6 ], [ 5, 1 ], [ 5, 8 ], [ 6, 4 ], [ 9, 3 ], [ 10, 17 ], [ 10, 12 ], [ 12, 15 ], [ 12, 19 ], [ 13, 16 ], [ 15, 11 ], [ 15, 18 ], [ 16, 14 ], [ 19, 13 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Glenn knows Desmond. Hayes knows Monica. Levi knows Gerard. Xavier knows Helen. Matt knows Destiny. Marvin knows Glenn. Matthew knows Matt. Kylie knows Fabian. Marvin knows Jason. Jason knows Kylie. Jason knows Levi. Gwen knows Matthew. Xavier knows Earle. Gwen knows Xavier. Glenn knows Cesar. Earle knows Sonia. Matthew knows Hayes. Cesar knows Erma. Which of Matthew and Jason can Gwen reach?", "answer": "Matthew", "steps": [ "Gwen knows Matthew." ], "difficulty": 1, "original_distance": 3, "idx_to_symbol": [ "Gwen", "Helen", "Monica", "Destiny", "Matt", "Hayes", "Xavier", "Matthew", "Earle", "Sonia", "Marvin", "Desmond", "Fabian", "Gerard", "Levi", "Kylie", "Glenn", "Jason", "Cesar", "Erma" ], "edges": [ [ 0, 7 ], [ 0, 6 ], [ 4, 3 ], [ 5, 2 ], [ 6, 1 ], [ 6, 8 ], [ 7, 4 ], [ 7, 5 ], [ 8, 9 ], [ 10, 17 ], [ 10, 16 ], [ 14, 13 ], [ 15, 12 ], [ 16, 11 ], [ 16, 18 ], [ 17, 14 ], [ 17, 15 ], [ 18, 19 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Alan knows Lena. Gerard knows Hunter. Hunter knows Maureen. Dawn knows Marlene. Keith knows Hank. Hank knows Emery. Keith knows Clinton. Gerard knows Ben. Darla knows Nell. Eli knows Marian. Eli knows Gerard. Lilia knows Ashton. Nell knows Dawn. Ben knows Zach. Lilia knows Keith. Lena knows Ariana. Zach knows Alan. Clinton knows Darla. Which of Alan and Nell can Eli reach?", "answer": "Alan", "steps": [ "Eli knows Gerard.", "Gerard knows Ben.", "Ben knows Zach.", "Zach knows Alan." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Eli", "Alan", "Lena", "Ben", "Maureen", "Hunter", "Marian", "Ariana", "Gerard", "Zach", "Lilia", "Nell", "Dawn", "Clinton", "Emery", "Hank", "Ashton", "Marlene", "Keith", "Darla" ], "edges": [ [ 0, 6 ], [ 0, 8 ], [ 1, 2 ], [ 2, 7 ], [ 3, 9 ], [ 5, 4 ], [ 8, 5 ], [ 8, 3 ], [ 9, 1 ], [ 10, 16 ], [ 10, 18 ], [ 11, 12 ], [ 12, 17 ], [ 13, 19 ], [ 15, 14 ], [ 18, 15 ], [ 18, 13 ], [ 19, 11 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Owen knows Sylvia. Shannon knows Adele. Ramona knows Jewel. Ramona knows Jim. Louisa knows Karla. Shannon knows Vanessa. Karla knows Neville. Matt knows Ebony. Ebony knows Imogen. Dana knows Owen. Karla knows Martin. Hudson knows Dewey. Louisa knows Karina. Dana knows Ann. Jim knows Dana. Ebony knows Louisa. Owen knows Shannon. Hudson knows Matt. Which of Ebony and Dana can Ramona reach?", "answer": "Dana", "steps": [ "Ramona knows Jim.", "Jim knows Dana." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Ramona", "Vanessa", "Owen", "Shannon", "Jim", "Dana", "Adele", "Ann", "Sylvia", "Jewel", "Hudson", "Neville", "Louisa", "Karla", "Matt", "Ebony", "Martin", "Imogen", "Karina", "Dewey" ], "edges": [ [ 0, 4 ], [ 0, 9 ], [ 2, 3 ], [ 2, 8 ], [ 3, 1 ], [ 3, 6 ], [ 4, 5 ], [ 5, 7 ], [ 5, 2 ], [ 10, 14 ], [ 10, 19 ], [ 12, 13 ], [ 12, 18 ], [ 13, 11 ], [ 13, 16 ], [ 14, 15 ], [ 15, 17 ], [ 15, 12 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Martin knows Karla. Diego knows Carrie. Conner knows Bella. Judith knows Fletcher. Lennox knows Della. Alyssa knows Juan. Conner knows Michelle. Fletcher knows Hope. Lennox knows Martin. Della knows Kendra. Alyssa knows Conner. Karla knows Gemma. Karla knows Tina. Fletcher knows Diego. Della knows Jeremy. Judith knows Alyssa. Martin knows Dallas. Jeremy knows Flora. Which of Flora and Carrie can Lennox reach?", "answer": "Flora", "steps": [ "Lennox knows Della.", "Della knows Jeremy.", "Jeremy knows Flora." ], "difficulty": 3, "original_distance": 3, "idx_to_symbol": [ "Lennox", "Gemma", "Flora", "Karla", "Jeremy", "Della", "Tina", "Dallas", "Martin", "Kendra", "Judith", "Bella", "Carrie", "Conner", "Diego", "Fletcher", "Michelle", "Juan", "Alyssa", "Hope" ], "edges": [ [ 0, 8 ], [ 0, 5 ], [ 3, 1 ], [ 3, 6 ], [ 4, 2 ], [ 5, 4 ], [ 5, 9 ], [ 8, 3 ], [ 8, 7 ], [ 10, 18 ], [ 10, 15 ], [ 13, 11 ], [ 13, 16 ], [ 14, 12 ], [ 15, 14 ], [ 15, 19 ], [ 18, 13 ], [ 18, 17 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Sierra knows Lucille. Lucille knows Troy. Iris knows Jackson. Jose knows Kit. Sierra knows Clyde. Eli knows Sierra. Iris knows Harriet. Ken knows Xavier. Ken knows Marlene. Jose knows Trevor. Chris knows Iris. Julian knows Jose. Julian knows Cesar. Felicia knows Julian. Lucille knows Amelia. Clay knows Ken. Ken knows Felicia. Iris knows Eli. Which of Ken and Iris can Clay reach?", "answer": "Ken", "steps": [ "Clay knows Ken." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Clay", "Xavier", "Trevor", "Kit", "Marlene", "Jose", "Ken", "Julian", "Felicia", "Cesar", "Chris", "Harriet", "Troy", "Amelia", "Jackson", "Lucille", "Iris", "Sierra", "Eli", "Clyde" ], "edges": [ [ 0, 6 ], [ 5, 2 ], [ 5, 3 ], [ 6, 1 ], [ 6, 4 ], [ 6, 8 ], [ 7, 5 ], [ 7, 9 ], [ 8, 7 ], [ 10, 16 ], [ 15, 12 ], [ 15, 13 ], [ 16, 11 ], [ 16, 14 ], [ 16, 18 ], [ 17, 15 ], [ 17, 19 ], [ 18, 17 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Greg knows Diego. Graham knows Greg. Odette knows Marian. Tony knows Julio. Dave knows Graham. Madeline knows Kevin. Keith knows Dave. Knox knows Yasmin. Joanna knows Jim. Keith knows Daria. Graham knows Joaquin. Knox knows Joanna. Graham knows Odette. Madeline knows Carmela. Carmela knows Knox. Joaquin knows Natalie. Yasmin knows Margaret. Knox knows Tony. Which of Yasmin and Odette can Keith reach?", "answer": "Odette", "steps": [ "Keith knows Dave.", "Dave knows Graham.", "Graham knows Odette." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Keith", "Dave", "Greg", "Daria", "Diego", "Odette", "Graham", "Joaquin", "Marian", "Natalie", "Madeline", "Carmela", "Joanna", "Kevin", "Jim", "Yasmin", "Knox", "Tony", "Margaret", "Julio" ], "edges": [ [ 0, 3 ], [ 0, 1 ], [ 1, 6 ], [ 2, 4 ], [ 5, 8 ], [ 6, 2 ], [ 6, 5 ], [ 6, 7 ], [ 7, 9 ], [ 10, 13 ], [ 10, 11 ], [ 11, 16 ], [ 12, 14 ], [ 15, 18 ], [ 16, 12 ], [ 16, 15 ], [ 16, 17 ], [ 17, 19 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Goldie knows Jasmine. Colby knows Violet. Goldie knows Brynn. Harmony knows Colby. Travis knows Javier. Ada knows Hunter. Destiny knows Brody. Brody knows Ada. Bennett knows Travis. Jasmine knows Fleur. Violet knows Bernard. Pedro knows Cristina. Colby knows Nicholas. Brody knows Pedro. Bennett knows Natalie. Nicholas knows Martha. Bennett knows Harmony. Goldie knows Destiny. Which of Brody and Colby can Goldie reach?", "answer": "Brody", "steps": [ "Goldie knows Destiny.", "Destiny knows Brody." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Goldie", "Ada", "Jasmine", "Cristina", "Fleur", "Brynn", "Hunter", "Brody", "Destiny", "Pedro", "Bennett", "Violet", "Travis", "Martha", "Javier", "Natalie", "Bernard", "Colby", "Harmony", "Nicholas" ], "edges": [ [ 0, 2 ], [ 0, 5 ], [ 0, 8 ], [ 1, 6 ], [ 2, 4 ], [ 7, 1 ], [ 7, 9 ], [ 8, 7 ], [ 9, 3 ], [ 10, 12 ], [ 10, 15 ], [ 10, 18 ], [ 11, 16 ], [ 12, 14 ], [ 17, 11 ], [ 17, 19 ], [ 18, 17 ], [ 19, 13 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Susanne knows Brock. Ebony knows Giselle. Kate knows Bart. Bart knows Ebony. Randall knows Arnold. Trina knows Dana. Arnold knows Camden. Bailey knows Jeff. Dana knows Carmen. Bart knows Cassidy. Ernest knows Shelly. Arnold knows Jordan. Shelly knows Bailey. Jordan knows Kenneth. Shelly knows Daphne. Cassidy knows Randall. Dana knows Susanne. Carmen knows Ernest. Which of Bart and Dana can Kate reach?", "answer": "Bart", "steps": [ "Kate knows Bart." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Kate", "Kenneth", "Arnold", "Cassidy", "Randall", "Ebony", "Giselle", "Bart", "Camden", "Jordan", "Trina", "Jeff", "Shelly", "Carmen", "Ernest", "Susanne", "Brock", "Dana", "Daphne", "Bailey" ], "edges": [ [ 0, 7 ], [ 2, 8 ], [ 2, 9 ], [ 3, 4 ], [ 4, 2 ], [ 5, 6 ], [ 7, 5 ], [ 7, 3 ], [ 9, 1 ], [ 10, 17 ], [ 12, 18 ], [ 12, 19 ], [ 13, 14 ], [ 14, 12 ], [ 15, 16 ], [ 17, 15 ], [ 17, 13 ], [ 19, 11 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Teresa knows Brad. Hal knows Itzel. Roy knows Cain. Roy knows Todd. Teresa knows Beau. Beau knows Veronica. Beau knows Norman. Brad knows Owen. Aurora knows Terrence. Jerry knows Stephen. Brock knows Hal. Brock knows Allan. Chandler knows Elias. Aurora knows Roy. Allan knows Teresa. Terrence knows Lucas. Stephen knows Aurora. Jerry knows Chandler. Which of Beau and Roy can Jerry reach?", "answer": "Roy", "steps": [ "Jerry knows Stephen.", "Stephen knows Aurora.", "Aurora knows Roy." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Jerry", "Cain", "Elias", "Roy", "Todd", "Terrence", "Stephen", "Aurora", "Chandler", "Lucas", "Brock", "Veronica", "Itzel", "Beau", "Norman", "Brad", "Allan", "Teresa", "Hal", "Owen" ], "edges": [ [ 0, 8 ], [ 0, 6 ], [ 3, 1 ], [ 3, 4 ], [ 5, 9 ], [ 6, 7 ], [ 7, 3 ], [ 7, 5 ], [ 8, 2 ], [ 10, 18 ], [ 10, 16 ], [ 13, 11 ], [ 13, 14 ], [ 15, 19 ], [ 16, 17 ], [ 17, 13 ], [ 17, 15 ], [ 18, 12 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Chloe knows Frida. Leander knows Wilson. Frida knows Hope. Imogen knows Yolanda. Katherine knows Leander. Leander knows Imogen. Alison knows Ada. Janet knows Seth. Frida knows Chantal. Dale knows Janet. Frida knows Javier. Lilia knows Ann. Joyce knows Lilia. Chantal knows Alison. Leander knows Keith. Katherine knows Dale. Yolanda knows Preston. Chloe knows Joyce. Which of Ada and Preston can Katherine reach?", "answer": "Preston", "steps": [ "Katherine knows Leander.", "Leander knows Imogen.", "Imogen knows Yolanda.", "Yolanda knows Preston." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Katherine", "Keith", "Imogen", "Preston", "Dale", "Wilson", "Leander", "Janet", "Seth", "Yolanda", "Chloe", "Javier", "Chantal", "Ada", "Joyce", "Hope", "Frida", "Lilia", "Ann", "Alison" ], "edges": [ [ 0, 4 ], [ 0, 6 ], [ 2, 9 ], [ 4, 7 ], [ 6, 1 ], [ 6, 5 ], [ 6, 2 ], [ 7, 8 ], [ 9, 3 ], [ 10, 14 ], [ 10, 16 ], [ 12, 19 ], [ 14, 17 ], [ 16, 11 ], [ 16, 15 ], [ 16, 12 ], [ 17, 18 ], [ 19, 13 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Peggy knows Saul. Grace knows Peggy. Darin knows Arthur. Cooper knows Simon. Simon knows Myra. Hendrix knows Grace. Eldon knows Heidi. Eldon knows Denise. Myra knows Lillian. Saul knows Eldon. Cooper knows Conner. Myra knows Marco. Graeme knows Aisha. Peggy knows Jacqueline. Doug knows Cooper. Lillian knows Darin. Bryan knows Doug. Denise knows Graeme. Which of Arthur and Aisha can Hendrix reach?", "answer": "Aisha", "steps": [ "Hendrix knows Grace.", "Grace knows Peggy.", "Peggy knows Saul.", "Saul knows Eldon.", "Eldon knows Denise.", "Denise knows Graeme.", "Graeme knows Aisha." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Hendrix", "Graeme", "Jacqueline", "Eldon", "Saul", "Grace", "Peggy", "Aisha", "Denise", "Heidi", "Bryan", "Darin", "Conner", "Myra", "Simon", "Doug", "Cooper", "Arthur", "Lillian", "Marco" ], "edges": [ [ 0, 5 ], [ 1, 7 ], [ 3, 8 ], [ 3, 9 ], [ 4, 3 ], [ 5, 6 ], [ 6, 2 ], [ 6, 4 ], [ 8, 1 ], [ 10, 15 ], [ 11, 17 ], [ 13, 18 ], [ 13, 19 ], [ 14, 13 ], [ 15, 16 ], [ 16, 12 ], [ 16, 14 ], [ 18, 11 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Ada knows Garrison. Ruth knows Layla. Greg knows Matt. Garrison knows Keith. Keith knows Lyle. Eden knows Cain. Livia knows Michelle. Priscilla knows Ruth. Eli knows Lucia. Eden knows Chris. Eli knows Eden. Greg knows Blanche. Chris knows Stella. Garrison knows Greg. Cain knows Priscilla. Chris knows Jermaine. Ada knows Abigail. Lyle knows Livia. Which of Michelle and Layla can Ada reach?", "answer": "Michelle", "steps": [ "Ada knows Garrison.", "Garrison knows Keith.", "Keith knows Lyle.", "Lyle knows Livia.", "Livia knows Michelle." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Ada", "Blanche", "Garrison", "Lyle", "Michelle", "Greg", "Livia", "Abigail", "Matt", "Keith", "Eli", "Jermaine", "Eden", "Priscilla", "Layla", "Chris", "Ruth", "Lucia", "Stella", "Cain" ], "edges": [ [ 0, 7 ], [ 0, 2 ], [ 2, 5 ], [ 2, 9 ], [ 3, 6 ], [ 5, 1 ], [ 5, 8 ], [ 6, 4 ], [ 9, 3 ], [ 10, 17 ], [ 10, 12 ], [ 12, 15 ], [ 12, 19 ], [ 13, 16 ], [ 15, 11 ], [ 15, 18 ], [ 16, 14 ], [ 19, 13 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Adam knows Fern. Adam knows Richard. Alejandro knows April. Justin knows Alejandro. Leah knows Justin. Flora knows Griffith. Justin knows Taylor. Kristina knows Adam. April knows Karen. Katrina knows Kristina. Richard knows Flora. Belinda knows Keith. Justin knows Layla. Adam knows Ashton. Dallas knows Chris. Rachel knows Leah. Kristina knows Belinda. Leah knows Dallas. Which of Griffith and Karen can Rachel reach?", "answer": "Karen", "steps": [ "Rachel knows Leah.", "Leah knows Justin.", "Justin knows Alejandro.", "Alejandro knows April.", "April knows Karen." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Rachel", "Karen", "Taylor", "Alejandro", "Layla", "Justin", "Chris", "Leah", "Dallas", "April", "Katrina", "Griffith", "Ashton", "Richard", "Fern", "Adam", "Keith", "Kristina", "Belinda", "Flora" ], "edges": [ [ 0, 7 ], [ 3, 9 ], [ 5, 2 ], [ 5, 4 ], [ 5, 3 ], [ 7, 8 ], [ 7, 5 ], [ 8, 6 ], [ 9, 1 ], [ 10, 17 ], [ 13, 19 ], [ 15, 12 ], [ 15, 14 ], [ 15, 13 ], [ 17, 18 ], [ 17, 15 ], [ 18, 16 ], [ 19, 11 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Federico knows Coral. Jim knows Elvis. Elvis knows Cora. Saul knows Edwin. Grant knows Sandy. Corinne knows Pablo. Gabe knows George. Gabe knows Clifford. Saul knows Grant. Morris knows Cate. Gabe knows Chris. Landon knows Morris. Sandy knows Federico. Clifford knows Landon. Grant knows Corinne. Clifford knows Jim. Pablo knows Jolene. Saul knows Hazel. Which of Jim and Corinne can Saul reach?", "answer": "Corinne", "steps": [ "Saul knows Grant.", "Grant knows Corinne." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Saul", "Pablo", "Grant", "Federico", "Sandy", "Corinne", "Coral", "Edwin", "Hazel", "Jolene", "Gabe", "Elvis", "Clifford", "Morris", "Landon", "Jim", "Cate", "George", "Chris", "Cora" ], "edges": [ [ 0, 7 ], [ 0, 8 ], [ 0, 2 ], [ 1, 9 ], [ 2, 4 ], [ 2, 5 ], [ 3, 6 ], [ 4, 3 ], [ 5, 1 ], [ 10, 17 ], [ 10, 18 ], [ 10, 12 ], [ 11, 19 ], [ 12, 14 ], [ 12, 15 ], [ 13, 16 ], [ 14, 13 ], [ 15, 11 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Brynn knows Reid. Reid knows Chandler. Mindy knows Dell. Alyson knows Gonzalo. Dorian knows Alyson. Tracy knows Virgil. Margaret knows Brynn. Jim knows Dina. Hayes knows Dorian. Elena knows Julio. Dudley knows Diana. Diana knows Mindy. Virgil knows Margaret. Chandler knows Hayes. Simon knows Jim. Sean knows Simon. Julio knows Dudley. Dell knows Sean. Which of Dina and Gonzalo can Elena reach?", "answer": "Dina", "steps": [ "Elena knows Julio.", "Julio knows Dudley.", "Dudley knows Diana.", "Diana knows Mindy.", "Mindy knows Dell.", "Dell knows Sean.", "Sean knows Simon.", "Simon knows Jim.", "Jim knows Dina." ], "difficulty": 9, "original_distance": 9, "idx_to_symbol": [ "Elena", "Jim", "Simon", "Dudley", "Dina", "Dell", "Julio", "Diana", "Sean", "Mindy", "Tracy", "Alyson", "Dorian", "Margaret", "Gonzalo", "Chandler", "Virgil", "Brynn", "Hayes", "Reid" ], "edges": [ [ 0, 6 ], [ 1, 4 ], [ 2, 1 ], [ 3, 7 ], [ 5, 8 ], [ 6, 3 ], [ 7, 9 ], [ 8, 2 ], [ 9, 5 ], [ 10, 16 ], [ 11, 14 ], [ 12, 11 ], [ 13, 17 ], [ 15, 18 ], [ 16, 13 ], [ 17, 19 ], [ 18, 12 ], [ 19, 15 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Elijah knows Pablo. Boris knows Ida. Lois knows Odette. Odette knows Boris. Julia knows Antonio. Diana knows Fernando. Pablo knows Ruth. Foster knows Elijah. Lois knows Jude. Antonio knows Inez. Kirsten knows Lois. Diana knows Ember. Fernando knows Foster. Elizabeth knows Rena. Jude knows Elizabeth. Isaac knows Kirsten. Foster knows Julia. Isaac knows Kenzie. Which of Fernando and Kirsten can Diana reach?", "answer": "Fernando", "steps": [ "Diana knows Fernando." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Diana", "Ember", "Fernando", "Elijah", "Ruth", "Foster", "Pablo", "Inez", "Julia", "Antonio", "Isaac", "Kenzie", "Kirsten", "Odette", "Ida", "Lois", "Boris", "Rena", "Jude", "Elizabeth" ], "edges": [ [ 0, 1 ], [ 0, 2 ], [ 2, 5 ], [ 3, 6 ], [ 5, 3 ], [ 5, 8 ], [ 6, 4 ], [ 8, 9 ], [ 9, 7 ], [ 10, 11 ], [ 10, 12 ], [ 12, 15 ], [ 13, 16 ], [ 15, 13 ], [ 15, 18 ], [ 16, 14 ], [ 18, 19 ], [ 19, 17 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Geraldine knows Isabel. Maria knows Autumn. Cain knows Jared. Floyd knows Willis. Blair knows Cain. Kelsey knows Geraldine. Isabel knows Stefan. Floyd knows Ron. Maria knows Mindy. Geraldine knows Bailey. David knows Floyd. Victor knows Maria. Isabel knows Clyde. Dale knows Forrest. Cain knows Dale. Jared knows Victor. Dale knows Cate. Bailey knows David. Which of Bailey and Jared can Blair reach?", "answer": "Jared", "steps": [ "Blair knows Cain.", "Cain knows Jared." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Blair", "Cate", "Cain", "Dale", "Autumn", "Mindy", "Maria", "Jared", "Forrest", "Victor", "Kelsey", "Clyde", "Geraldine", "Isabel", "Ron", "Willis", "Floyd", "Bailey", "Stefan", "David" ], "edges": [ [ 0, 2 ], [ 2, 3 ], [ 2, 7 ], [ 3, 1 ], [ 3, 8 ], [ 6, 4 ], [ 6, 5 ], [ 7, 9 ], [ 9, 6 ], [ 10, 12 ], [ 12, 13 ], [ 12, 17 ], [ 13, 11 ], [ 13, 18 ], [ 16, 14 ], [ 16, 15 ], [ 17, 19 ], [ 19, 16 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Pauline knows Eunice. Abigail knows Dolly. Carson knows Maya. Keira knows Joshua. Gwen knows Keira. Natalie knows Greer. Sally knows Carson. Eunice knows Natalie. Dolly knows Dorian. Joshua knows Janet. Gwen knows Harlan. Caroline knows Ilene. Brad knows Warren. Janet knows Caroline. Pauline knows Amelia. Ilene knows Sally. Warren knows Abigail. Greer knows Brad. Which of Joshua and Natalie can Gwen reach?", "answer": "Joshua", "steps": [ "Gwen knows Keira.", "Keira knows Joshua." ], "difficulty": 2, "original_distance": 8, "idx_to_symbol": [ "Gwen", "Joshua", "Harlan", "Carson", "Maya", "Keira", "Caroline", "Janet", "Ilene", "Sally", "Pauline", "Natalie", "Amelia", "Dolly", "Dorian", "Eunice", "Brad", "Greer", "Warren", "Abigail" ], "edges": [ [ 0, 2 ], [ 0, 5 ], [ 1, 7 ], [ 3, 4 ], [ 5, 1 ], [ 6, 8 ], [ 7, 6 ], [ 8, 9 ], [ 9, 3 ], [ 10, 12 ], [ 10, 15 ], [ 11, 17 ], [ 13, 14 ], [ 15, 11 ], [ 16, 18 ], [ 17, 16 ], [ 18, 19 ], [ 19, 13 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Leah knows Judith. Ernesto knows Diana. Judith knows Cody. Eamon knows Leah. Don knows Ariana. Diana knows Lacey. Wyatt knows Lisette. Maude knows Brian. Fernando knows Edmund. Eamon knows Jason. Marion knows Don. Leah knows Maude. Lacey knows Eamon. Fernando knows Jenna. Ariana knows Fernando. Edmund knows Wyatt. Bernadette knows Dudley. Edmund knows Bernadette. Which of Eamon and Fernando can Ernesto reach?", "answer": "Eamon", "steps": [ "Ernesto knows Diana.", "Diana knows Lacey.", "Lacey knows Eamon." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Ernesto", "Leah", "Diana", "Cody", "Jason", "Maude", "Lacey", "Brian", "Judith", "Eamon", "Marion", "Edmund", "Don", "Lisette", "Jenna", "Bernadette", "Ariana", "Dudley", "Wyatt", "Fernando" ], "edges": [ [ 0, 2 ], [ 1, 5 ], [ 1, 8 ], [ 2, 6 ], [ 5, 7 ], [ 6, 9 ], [ 8, 3 ], [ 9, 4 ], [ 9, 1 ], [ 10, 12 ], [ 11, 15 ], [ 11, 18 ], [ 12, 16 ], [ 15, 17 ], [ 16, 19 ], [ 18, 13 ], [ 19, 14 ], [ 19, 11 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Hadley knows Wendell. Noel knows Coral. Louisa knows Hadley. Colin knows Edward. Pauline knows Tristan. Noel knows Alder. Coral knows Fisher. Wendell knows Amanda. Wendell knows Colin. Marcia knows Kim. Alder knows Randall. Hadley knows Pauline. Fisher knows Albert. Coral knows Dale. Edward knows Samantha. Marcia knows Noel. Albert knows Atlas. Louisa knows Dakota. Which of Edward and Albert can Marcia reach?", "answer": "Albert", "steps": [ "Marcia knows Noel.", "Noel knows Coral.", "Coral knows Fisher.", "Fisher knows Albert." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Marcia", "Alder", "Atlas", "Coral", "Kim", "Noel", "Fisher", "Randall", "Dale", "Albert", "Louisa", "Pauline", "Samantha", "Wendell", "Dakota", "Hadley", "Colin", "Tristan", "Amanda", "Edward" ], "edges": [ [ 0, 4 ], [ 0, 5 ], [ 1, 7 ], [ 3, 8 ], [ 3, 6 ], [ 5, 1 ], [ 5, 3 ], [ 6, 9 ], [ 9, 2 ], [ 10, 14 ], [ 10, 15 ], [ 11, 17 ], [ 13, 18 ], [ 13, 16 ], [ 15, 11 ], [ 15, 13 ], [ 16, 19 ], [ 19, 12 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Hadley knows Lyric. Evelyn knows Catherine. Hadley knows Oscar. Griffith knows Deanna. Harrison knows Zach. Riley knows Elaine. Rebecca knows Harrison. Deanna knows Riley. Anita knows Zane. Margaret knows Anita. Anita knows Griffith. Riley knows Keith. Riley knows Evelyn. Lyric knows Odette. Zach knows Jeanne. Harrison knows Jorge. Hadley knows Basil. Jeanne knows Hadley. Which of Lyric and Evelyn can Rebecca reach?", "answer": "Lyric", "steps": [ "Rebecca knows Harrison.", "Harrison knows Zach.", "Zach knows Jeanne.", "Jeanne knows Hadley.", "Hadley knows Lyric." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Rebecca", "Harrison", "Basil", "Jeanne", "Oscar", "Odette", "Lyric", "Zach", "Jorge", "Hadley", "Margaret", "Anita", "Elaine", "Deanna", "Keith", "Catherine", "Evelyn", "Griffith", "Zane", "Riley" ], "edges": [ [ 0, 1 ], [ 1, 8 ], [ 1, 7 ], [ 3, 9 ], [ 6, 5 ], [ 7, 3 ], [ 9, 2 ], [ 9, 4 ], [ 9, 6 ], [ 10, 11 ], [ 11, 18 ], [ 11, 17 ], [ 13, 19 ], [ 16, 15 ], [ 17, 13 ], [ 19, 12 ], [ 19, 14 ], [ 19, 16 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Fernando knows Marcia. Fraser knows Doris. Donovan knows Hailey. Hailey knows Marie. Howard knows Gwen. Roy knows Peggy. Hailey knows John. Doris knows Lyle. Marcia knows Howard. John knows Roy. Peggy knows Larissa. Marie knows Atlas. Peggy knows Carmen. Fraser knows Fernando. Howard knows Patricia. Peggy knows Elizabeth. Howard knows Kay. Sam knows Fraser. Which of Roy and Marcia can Sam reach?", "answer": "Marcia", "steps": [ "Sam knows Fraser.", "Fraser knows Fernando.", "Fernando knows Marcia." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Sam", "Fernando", "Lyle", "Fraser", "Doris", "Marcia", "Gwen", "Patricia", "Kay", "Howard", "Donovan", "John", "Atlas", "Hailey", "Marie", "Roy", "Elizabeth", "Larissa", "Carmen", "Peggy" ], "edges": [ [ 0, 3 ], [ 1, 5 ], [ 3, 4 ], [ 3, 1 ], [ 4, 2 ], [ 5, 9 ], [ 9, 6 ], [ 9, 7 ], [ 9, 8 ], [ 10, 13 ], [ 11, 15 ], [ 13, 14 ], [ 13, 11 ], [ 14, 12 ], [ 15, 19 ], [ 19, 16 ], [ 19, 17 ], [ 19, 18 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Kay knows Neal. Calvin knows Olive. Gunnar knows Eunice. Burt knows Hunter. Amelia knows Lana. Gunnar knows Russell. Frank knows Gabriel. Russell knows Drew. Burt knows Wilma. Hunter knows Hailey. Drew knows Calvin. Amelia knows Ingrid. Gabriel knows Melody. Ingrid knows Frank. Hunter knows Gunnar. Cassidy knows Bart. Kay knows Amelia. Cassidy knows Kay. Which of Ingrid and Russell can Cassidy reach?", "answer": "Ingrid", "steps": [ "Cassidy knows Kay.", "Kay knows Amelia.", "Amelia knows Ingrid." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Cassidy", "Gabriel", "Kay", "Frank", "Bart", "Melody", "Ingrid", "Neal", "Amelia", "Lana", "Burt", "Calvin", "Hunter", "Drew", "Wilma", "Olive", "Russell", "Hailey", "Gunnar", "Eunice" ], "edges": [ [ 0, 4 ], [ 0, 2 ], [ 1, 5 ], [ 2, 7 ], [ 2, 8 ], [ 3, 1 ], [ 6, 3 ], [ 8, 6 ], [ 8, 9 ], [ 10, 14 ], [ 10, 12 ], [ 11, 15 ], [ 12, 17 ], [ 12, 18 ], [ 13, 11 ], [ 16, 13 ], [ 18, 16 ], [ 18, 19 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Cordelia knows Ezra. Ezra knows Zoe. Anita knows Jodi. Jane knows Adele. Edwin knows Graeme. Maria knows Lilia. Zoe knows Bruno. Graeme knows Hayley. Adele knows Howard. Maude knows Edwin. Jane knows Maude. Zoe knows Russ. Russ knows Eleanor. Edwin knows Maria. Anita knows Holly. Cordelia knows Anita. Bruno knows Pat. Adele knows Allison. Which of Bruno and Graeme can Jane reach?", "answer": "Graeme", "steps": [ "Jane knows Maude.", "Maude knows Edwin.", "Edwin knows Graeme." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Jane", "Allison", "Graeme", "Lilia", "Maude", "Maria", "Hayley", "Howard", "Edwin", "Adele", "Cordelia", "Holly", "Bruno", "Eleanor", "Ezra", "Russ", "Pat", "Jodi", "Zoe", "Anita" ], "edges": [ [ 0, 4 ], [ 0, 9 ], [ 2, 6 ], [ 4, 8 ], [ 5, 3 ], [ 8, 5 ], [ 8, 2 ], [ 9, 1 ], [ 9, 7 ], [ 10, 14 ], [ 10, 19 ], [ 12, 16 ], [ 14, 18 ], [ 15, 13 ], [ 18, 15 ], [ 18, 12 ], [ 19, 11 ], [ 19, 17 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Roger knows Kit. Jana knows Bruno. Bennett knows Mack. Jana knows Tabitha. Kai knows Dallas. Tamara knows Jana. Jillian knows Harley. Myra knows Luke. Myra knows Herbert. Kendrick knows Lark. Harley knows Myra. John knows Kendrick. John knows Roger. Bruno knows Jonah. Roger knows Jillian. Tamara knows Bennett. Jonah knows Kai. Kai knows Justine. Which of Luke and Dallas can John reach?", "answer": "Luke", "steps": [ "John knows Roger.", "Roger knows Jillian.", "Jillian knows Harley.", "Harley knows Myra.", "Myra knows Luke." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "John", "Harley", "Myra", "Kit", "Herbert", "Roger", "Luke", "Jillian", "Kendrick", "Lark", "Tamara", "Jonah", "Kai", "Tabitha", "Justine", "Jana", "Dallas", "Bruno", "Bennett", "Mack" ], "edges": [ [ 0, 5 ], [ 0, 8 ], [ 1, 2 ], [ 2, 4 ], [ 2, 6 ], [ 5, 3 ], [ 5, 7 ], [ 7, 1 ], [ 8, 9 ], [ 10, 15 ], [ 10, 18 ], [ 11, 12 ], [ 12, 14 ], [ 12, 16 ], [ 15, 13 ], [ 15, 17 ], [ 17, 11 ], [ 18, 19 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Jessica knows Henry. Liam knows Geneva. Lamar knows Liam. Jamie knows Alice. Liam knows Tabitha. Marshall knows Jacques. Alice knows Sybil. Layla knows Estella. Henry knows Floyd. Lamar knows Layla. Sam knows Goldie. Jamie knows Arlene. Clifford knows Zara. Sybil knows Lamar. Marshall knows Milo. Floyd knows Clifford. Sam knows Jessica. Floyd knows Marshall. Which of Liam and Marshall can Jamie reach?", "answer": "Liam", "steps": [ "Jamie knows Alice.", "Alice knows Sybil.", "Sybil knows Lamar.", "Lamar knows Liam." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Jamie", "Geneva", "Estella", "Layla", "Lamar", "Tabitha", "Sybil", "Arlene", "Liam", "Alice", "Sam", "Jacques", "Zara", "Clifford", "Floyd", "Milo", "Henry", "Goldie", "Marshall", "Jessica" ], "edges": [ [ 0, 7 ], [ 0, 9 ], [ 3, 2 ], [ 4, 3 ], [ 4, 8 ], [ 6, 4 ], [ 8, 1 ], [ 8, 5 ], [ 9, 6 ], [ 10, 17 ], [ 10, 19 ], [ 13, 12 ], [ 14, 13 ], [ 14, 18 ], [ 16, 14 ], [ 18, 11 ], [ 18, 15 ], [ 19, 16 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Scott knows Loretta. Eldon knows Clifford. Isaac knows Magdalena. Eldon knows Amelia. Mason knows Kareem. Mason knows Darnell. Amelia knows Pete. Alison knows Tracy. Kareem knows Alison. Isaac knows Elodie. Walter knows Isaac. Drew knows Scott. Pete knows Diego. Sadie knows Mason. Scott knows Norman. Norman knows Eldon. Scott knows Franklin. Isaac knows Sadie. Which of Norman and Sadie can Drew reach?", "answer": "Norman", "steps": [ "Drew knows Scott.", "Scott knows Norman." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Drew", "Clifford", "Norman", "Amelia", "Diego", "Franklin", "Pete", "Loretta", "Eldon", "Scott", "Walter", "Darnell", "Sadie", "Kareem", "Tracy", "Elodie", "Alison", "Magdalena", "Mason", "Isaac" ], "edges": [ [ 0, 9 ], [ 2, 8 ], [ 3, 6 ], [ 6, 4 ], [ 8, 1 ], [ 8, 3 ], [ 9, 5 ], [ 9, 7 ], [ 9, 2 ], [ 10, 19 ], [ 12, 18 ], [ 13, 16 ], [ 16, 14 ], [ 18, 11 ], [ 18, 13 ], [ 19, 15 ], [ 19, 17 ], [ 19, 12 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Dalton knows Lara. Dalton knows Simon. Leland knows Jeremy. Autumn knows Rick. Jeremy knows Esperanza. Lara knows Geneva. Adele knows Isla. Geneva knows Darla. Isla knows Helene. Fletcher knows Ivy. Helene knows Dalton. Dalton knows Daphna. Daphna knows Federico. Jeremy knows Kai. Yuki knows Leland. Jeremy knows Autumn. Sue knows Yuki. Esperanza knows Fletcher. Which of Lara and Esperanza can Sue reach?", "answer": "Esperanza", "steps": [ "Sue knows Yuki.", "Yuki knows Leland.", "Leland knows Jeremy.", "Jeremy knows Esperanza." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Sue", "Leland", "Esperanza", "Kai", "Fletcher", "Yuki", "Rick", "Jeremy", "Ivy", "Autumn", "Adele", "Helene", "Lara", "Simon", "Geneva", "Isla", "Federico", "Dalton", "Darla", "Daphna" ], "edges": [ [ 0, 5 ], [ 1, 7 ], [ 2, 4 ], [ 4, 8 ], [ 5, 1 ], [ 7, 3 ], [ 7, 2 ], [ 7, 9 ], [ 9, 6 ], [ 10, 15 ], [ 11, 17 ], [ 12, 14 ], [ 14, 18 ], [ 15, 11 ], [ 17, 13 ], [ 17, 12 ], [ 17, 19 ], [ 19, 16 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Zane knows Electra. Luella knows Hattie. Gerald knows Elodie. Cristina knows Ramona. Jacob knows Tabitha. Zane knows Houston. Luella knows Walt. Maureen knows Eden. Anton knows Jacob. Camille knows Cristina. Levi knows Luella. Elodie knows Maureen. Carmela knows Felicia. Ramona knows Carmela. Carmela knows Melody. Houston knows Levi. Electra knows Anton. Camille knows Gerald. Which of Houston and Cristina can Camille reach?", "answer": "Cristina", "steps": [ "Camille knows Cristina." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Camille", "Maureen", "Cristina", "Ramona", "Elodie", "Gerald", "Carmela", "Eden", "Melody", "Felicia", "Zane", "Jacob", "Houston", "Levi", "Anton", "Electra", "Luella", "Tabitha", "Walt", "Hattie" ], "edges": [ [ 0, 5 ], [ 0, 2 ], [ 1, 7 ], [ 2, 3 ], [ 3, 6 ], [ 4, 1 ], [ 5, 4 ], [ 6, 8 ], [ 6, 9 ], [ 10, 15 ], [ 10, 12 ], [ 11, 17 ], [ 12, 13 ], [ 13, 16 ], [ 14, 11 ], [ 15, 14 ], [ 16, 18 ], [ 16, 19 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Hadley knows Melanie. Alma knows Ignacio. Tabitha knows Chance. Gwen knows Abigail. Luke knows Chloe. Luz knows Henrietta. Gerard knows Levi. Ignacio knows Horace. Levi knows Alma. Mason knows Bernard. Gerard knows Tracy. Melanie knows Gwen. Levi knows Tabitha. Bernard knows Victor. Luke knows Hadley. Hadley knows Adelaide. Melanie knows Mason. Luz knows Gerard. Which of Horace and Victor can Luke reach?", "answer": "Victor", "steps": [ "Luke knows Hadley.", "Hadley knows Melanie.", "Melanie knows Mason.", "Mason knows Bernard.", "Bernard knows Victor." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Luke", "Mason", "Hadley", "Gwen", "Bernard", "Chloe", "Victor", "Adelaide", "Melanie", "Abigail", "Luz", "Alma", "Gerard", "Tabitha", "Ignacio", "Henrietta", "Horace", "Tracy", "Levi", "Chance" ], "edges": [ [ 0, 5 ], [ 0, 2 ], [ 1, 4 ], [ 2, 7 ], [ 2, 8 ], [ 3, 9 ], [ 4, 6 ], [ 8, 1 ], [ 8, 3 ], [ 10, 15 ], [ 10, 12 ], [ 11, 14 ], [ 12, 17 ], [ 12, 18 ], [ 13, 19 ], [ 14, 16 ], [ 18, 11 ], [ 18, 13 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Tracy knows Chris. Angela knows Joan. Julia knows Rose. Kennedy knows Aldo. Tracy knows Damien. Antonio knows Angela. Joan knows Kennedy. Rose knows Jonathan. Cornelius knows Janice. Kennedy knows Lance. Kennedy knows Cornelius. Tracy knows Donald. Rose knows Gloria. Antonio knows Lenora. Gloria knows Guillermo. Guillermo knows Tracy. Chris knows Langston. Bert knows Antonio. Which of Gloria and Angela can Julia reach?", "answer": "Gloria", "steps": [ "Julia knows Rose.", "Rose knows Gloria." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Julia", "Guillermo", "Jonathan", "Tracy", "Donald", "Langston", "Rose", "Chris", "Damien", "Gloria", "Bert", "Joan", "Lenora", "Kennedy", "Aldo", "Janice", "Antonio", "Cornelius", "Lance", "Angela" ], "edges": [ [ 0, 6 ], [ 1, 3 ], [ 3, 4 ], [ 3, 7 ], [ 3, 8 ], [ 6, 2 ], [ 6, 9 ], [ 7, 5 ], [ 9, 1 ], [ 10, 16 ], [ 11, 13 ], [ 13, 14 ], [ 13, 17 ], [ 13, 18 ], [ 16, 12 ], [ 16, 19 ], [ 17, 15 ], [ 19, 11 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Winifred knows Casey. Linda knows Neil. Enrique knows Trudy. Lacey knows Linda. Casey knows Dustin. Ashton knows Mario. Graham knows Kevin. Trudy knows Kendrick. Kendrick knows Corinne. Kendrick knows Della. Christina knows Ashton. Melanie knows Enrique. Kaleb knows Graham. Enrique knows Henrietta. Casey knows Rowan. Lacey knows Christina. Ashton knows Winifred. Kaleb knows Melanie. Which of Winifred and Trudy can Lacey reach?", "answer": "Winifred", "steps": [ "Lacey knows Christina.", "Christina knows Ashton.", "Ashton knows Winifred." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Lacey", "Christina", "Casey", "Ashton", "Rowan", "Dustin", "Neil", "Mario", "Winifred", "Linda", "Kaleb", "Melanie", "Kendrick", "Enrique", "Corinne", "Della", "Kevin", "Henrietta", "Trudy", "Graham" ], "edges": [ [ 0, 1 ], [ 0, 9 ], [ 1, 3 ], [ 2, 4 ], [ 2, 5 ], [ 3, 7 ], [ 3, 8 ], [ 8, 2 ], [ 9, 6 ], [ 10, 11 ], [ 10, 19 ], [ 11, 13 ], [ 12, 14 ], [ 12, 15 ], [ 13, 17 ], [ 13, 18 ], [ 18, 12 ], [ 19, 16 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Shane knows Molly. Tina knows Shane. Ilene knows Faith. Molly knows Palmer. Cody knows Paul. Ilene knows Eden. Claire knows Mitchell. Roland knows Chantal. Darrell knows Tina. Bert knows Chloe. Cody knows Bert. Eden knows Darrell. Jade knows Claire. Jade knows Martha. Mitchell knows Roland. Molly knows Annie. Chantal knows Cody. Palmer knows Estella. Which of Cody and Molly can Jade reach?", "answer": "Cody", "steps": [ "Jade knows Claire.", "Claire knows Mitchell.", "Mitchell knows Roland.", "Roland knows Chantal.", "Chantal knows Cody." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Jade", "Claire", "Martha", "Mitchell", "Chloe", "Chantal", "Paul", "Bert", "Cody", "Roland", "Ilene", "Eden", "Faith", "Darrell", "Estella", "Shane", "Annie", "Palmer", "Molly", "Tina" ], "edges": [ [ 0, 2 ], [ 0, 1 ], [ 1, 3 ], [ 3, 9 ], [ 5, 8 ], [ 7, 4 ], [ 8, 6 ], [ 8, 7 ], [ 9, 5 ], [ 10, 12 ], [ 10, 11 ], [ 11, 13 ], [ 13, 19 ], [ 15, 18 ], [ 17, 14 ], [ 18, 16 ], [ 18, 17 ], [ 19, 15 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Ariana knows Rhea. Destiny knows Peggy. Keith knows Gideon. Will knows Lyric. Heath knows Virginia. Ember knows Jerome. Viola knows Heath. Heath knows Will. Destiny knows Margaret. Destiny knows Blair. Blaine knows Ariana. Gideon knows Destiny. Rhea knows Viola. Heath knows Abigail. Jerome knows Keith. Peggy knows Erwin. Peggy knows Tony. Will knows Nicole. Which of Viola and Gideon can Ember reach?", "answer": "Gideon", "steps": [ "Ember knows Jerome.", "Jerome knows Keith.", "Keith knows Gideon." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Ember", "Erwin", "Tony", "Blair", "Jerome", "Gideon", "Peggy", "Destiny", "Keith", "Margaret", "Blaine", "Nicole", "Lyric", "Abigail", "Ariana", "Viola", "Will", "Heath", "Rhea", "Virginia" ], "edges": [ [ 0, 4 ], [ 4, 8 ], [ 5, 7 ], [ 6, 1 ], [ 6, 2 ], [ 7, 3 ], [ 7, 6 ], [ 7, 9 ], [ 8, 5 ], [ 10, 14 ], [ 14, 18 ], [ 15, 17 ], [ 16, 11 ], [ 16, 12 ], [ 17, 13 ], [ 17, 16 ], [ 17, 19 ], [ 18, 15 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Ivan knows Gus. Ivan knows Patrick. Celia knows Effie. Celia knows Conrad. Arthur knows Alison. Colin knows Nancy. Colin knows Kamila. Harrison knows Alvin. Ivan knows Colin. Lydia knows Louise. Celia knows Kane. Effie knows Harrison. Kane knows Heidi. Kamila knows Hayley. Effie knows Lydia. Heidi knows Wilson. Gus knows Arthur. Nancy knows Aiden. Which of Lydia and Nancy can Celia reach?", "answer": "Lydia", "steps": [ "Celia knows Effie.", "Effie knows Lydia." ], "difficulty": 2, "original_distance": 3, "idx_to_symbol": [ "Celia", "Conrad", "Wilson", "Lydia", "Effie", "Kane", "Heidi", "Alvin", "Louise", "Harrison", "Ivan", "Patrick", "Alison", "Nancy", "Colin", "Gus", "Arthur", "Hayley", "Aiden", "Kamila" ], "edges": [ [ 0, 1 ], [ 0, 5 ], [ 0, 4 ], [ 3, 8 ], [ 4, 3 ], [ 4, 9 ], [ 5, 6 ], [ 6, 2 ], [ 9, 7 ], [ 10, 11 ], [ 10, 15 ], [ 10, 14 ], [ 13, 18 ], [ 14, 13 ], [ 14, 19 ], [ 15, 16 ], [ 16, 12 ], [ 19, 17 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Abel knows Fiona. Rosemary knows Annette. Trevor knows Archie. Geraldine knows Aubrey. Fiona knows Jamie. Archie knows Abel. Ken knows Trevor. Jamie knows Jorge. Thea knows Stefan. Dell knows Valerie. Archie knows Geraldine. Valerie knows Ford. Rosemary knows Porter. Stefan knows Rosemary. Annette knows Bernadette. Bernadette knows Edith. Porter knows Dell. Aubrey knows Fern. Which of Fiona and Dell can Thea reach?", "answer": "Dell", "steps": [ "Thea knows Stefan.", "Stefan knows Rosemary.", "Rosemary knows Porter.", "Porter knows Dell." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Thea", "Valerie", "Edith", "Porter", "Bernadette", "Rosemary", "Stefan", "Dell", "Annette", "Ford", "Ken", "Jamie", "Fern", "Abel", "Aubrey", "Archie", "Trevor", "Fiona", "Geraldine", "Jorge" ], "edges": [ [ 0, 6 ], [ 1, 9 ], [ 3, 7 ], [ 4, 2 ], [ 5, 8 ], [ 5, 3 ], [ 6, 5 ], [ 7, 1 ], [ 8, 4 ], [ 10, 16 ], [ 11, 19 ], [ 13, 17 ], [ 14, 12 ], [ 15, 18 ], [ 15, 13 ], [ 16, 15 ], [ 17, 11 ], [ 18, 14 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Owen knows Zara. Shawn knows Lyric. Shawn knows Gail. Steve knows Tessa. Pedro knows Shawn. Zara knows Shelby. Emanuel knows Dolly. Zara knows Steve. Jem knows Mia. Helen knows Gina. Selena knows Nadine. Ursula knows Merle. Jem knows Selena. Owen knows Emanuel. Emanuel knows Jaime. Helen knows Owen. Ursula knows Pedro. Pedro knows Jem. Which of Steve and Selena can Ursula reach?", "answer": "Selena", "steps": [ "Ursula knows Pedro.", "Pedro knows Jem.", "Jem knows Selena." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Ursula", "Merle", "Lyric", "Pedro", "Mia", "Nadine", "Shawn", "Jem", "Selena", "Gail", "Helen", "Gina", "Dolly", "Owen", "Shelby", "Tessa", "Emanuel", "Zara", "Steve", "Jaime" ], "edges": [ [ 0, 1 ], [ 0, 3 ], [ 3, 7 ], [ 3, 6 ], [ 6, 2 ], [ 6, 9 ], [ 7, 4 ], [ 7, 8 ], [ 8, 5 ], [ 10, 11 ], [ 10, 13 ], [ 13, 17 ], [ 13, 16 ], [ 16, 12 ], [ 16, 19 ], [ 17, 14 ], [ 17, 18 ], [ 18, 15 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Wallace knows Ted. Humphrey knows Brynn. Cristina knows Harold. Wallace knows Effie. George knows Harry. Delilah knows Stuart. Gwen knows Humphrey. Ashley knows Cristina. Daisy knows Wyatt. Humphrey knows Jose. Wyatt knows Gwen. Ted knows Emma. George knows Daisy. Effie knows Vivian. Gwen knows Delilah. Ashley knows Melissa. Ted knows Garrett. Harold knows Wallace. Which of Wallace and Gwen can Ashley reach?", "answer": "Wallace", "steps": [ "Ashley knows Cristina.", "Cristina knows Harold.", "Harold knows Wallace." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Ashley", "Cristina", "Ted", "Wallace", "Vivian", "Emma", "Harold", "Effie", "Garrett", "Melissa", "George", "Daisy", "Humphrey", "Gwen", "Stuart", "Jose", "Wyatt", "Delilah", "Brynn", "Harry" ], "edges": [ [ 0, 1 ], [ 0, 9 ], [ 1, 6 ], [ 2, 5 ], [ 2, 8 ], [ 3, 7 ], [ 3, 2 ], [ 6, 3 ], [ 7, 4 ], [ 10, 11 ], [ 10, 19 ], [ 11, 16 ], [ 12, 15 ], [ 12, 18 ], [ 13, 17 ], [ 13, 12 ], [ 16, 13 ], [ 17, 14 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Hudson knows Nash. Cruz knows Mara. Dudley knows Douglas. Deirdre knows Kobe. Monroe knows Palmer. Kobe knows Andrew. Farrah knows Hudson. Sandra knows Monroe. Nash knows Dudley. Douglas knows Damian. Hudson knows Rhea. Rhea knows Kendra. Mara knows Burt. Andrew knows Norma. Cruz knows Deirdre. Wendy knows Farrah. Zane knows Wendy. Palmer knows Cruz. Which of Farrah and Palmer can Sandra reach?", "answer": "Palmer", "steps": [ "Sandra knows Monroe.", "Monroe knows Palmer." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Sandra", "Cruz", "Mara", "Burt", "Andrew", "Deirdre", "Norma", "Kobe", "Monroe", "Palmer", "Zane", "Hudson", "Rhea", "Kendra", "Douglas", "Nash", "Damian", "Dudley", "Wendy", "Farrah" ], "edges": [ [ 0, 8 ], [ 1, 2 ], [ 1, 5 ], [ 2, 3 ], [ 4, 6 ], [ 5, 7 ], [ 7, 4 ], [ 8, 9 ], [ 9, 1 ], [ 10, 18 ], [ 11, 12 ], [ 11, 15 ], [ 12, 13 ], [ 14, 16 ], [ 15, 17 ], [ 17, 14 ], [ 18, 19 ], [ 19, 11 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Pedro knows Russ. Russ knows Pam. Judy knows Clark. Sylvia knows Greg. Sylvia knows Pedro. Pedro knows Harmony. Adrian knows Clay. Clark knows Claudia. Clay knows Stacy. Sylvia knows Leonard. Adrian knows Neville. Judy knows Ernest. Ruth knows Geoffrey. Neville knows Kylie. Russ knows Ruth. Adrian knows Parsa. Clay knows Judy. Leonard knows Chandler. Which of Geoffrey and Claudia can Sylvia reach?", "answer": "Geoffrey", "steps": [ "Sylvia knows Pedro.", "Pedro knows Russ.", "Russ knows Ruth.", "Ruth knows Geoffrey." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Sylvia", "Pam", "Geoffrey", "Russ", "Pedro", "Greg", "Harmony", "Chandler", "Leonard", "Ruth", "Adrian", "Ernest", "Claudia", "Judy", "Clay", "Parsa", "Stacy", "Kylie", "Neville", "Clark" ], "edges": [ [ 0, 5 ], [ 0, 8 ], [ 0, 4 ], [ 3, 1 ], [ 3, 9 ], [ 4, 6 ], [ 4, 3 ], [ 8, 7 ], [ 9, 2 ], [ 10, 15 ], [ 10, 18 ], [ 10, 14 ], [ 13, 11 ], [ 13, 19 ], [ 14, 16 ], [ 14, 13 ], [ 18, 17 ], [ 19, 12 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Adelaide knows Robin. Wilson knows Roger. Roger knows Joaquin. Rufus knows Joanna. Oliver knows Xander. Oliver knows Maureen. Isaac knows Wilson. Wilson knows Federico. Emily knows Rufus. Wilson knows Jeremiah. Emily knows Oliver. Wilson knows Katherine. Oliver knows Adelaide. Isaac knows Preston. Oliver knows Amanda. Preston knows Eli. Roger knows Clark. Adelaide knows Shawn. Which of Roger and Adelaide can Isaac reach?", "answer": "Roger", "steps": [ "Isaac knows Wilson.", "Wilson knows Roger." ], "difficulty": 2, "original_distance": 3, "idx_to_symbol": [ "Isaac", "Joaquin", "Eli", "Katherine", "Federico", "Clark", "Jeremiah", "Wilson", "Preston", "Roger", "Emily", "Shawn", "Joanna", "Amanda", "Maureen", "Robin", "Xander", "Oliver", "Rufus", "Adelaide" ], "edges": [ [ 0, 8 ], [ 0, 7 ], [ 7, 3 ], [ 7, 4 ], [ 7, 6 ], [ 7, 9 ], [ 8, 2 ], [ 9, 1 ], [ 9, 5 ], [ 10, 18 ], [ 10, 17 ], [ 17, 13 ], [ 17, 14 ], [ 17, 16 ], [ 17, 19 ], [ 18, 12 ], [ 19, 11 ], [ 19, 15 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Malik knows Mae. India knows Kieran. Randy knows Lyle. India knows Kobe. Kieran knows Ella. Virgil knows Kyle. Lyle knows Malik. Malik knows Kurt. India knows Nancy. Mae knows Annie. Malik knows Hailey. Kurt knows Lionel. Malik knows Virgil. India knows Holly. Eamon knows Maya. Maya knows India. Kobe knows Chester. Nancy knows Samuel. Which of Kieran and Virgil can Eamon reach?", "answer": "Kieran", "steps": [ "Eamon knows Maya.", "Maya knows India.", "India knows Kieran." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Eamon", "Ella", "Holly", "Maya", "Nancy", "Kieran", "Samuel", "Kobe", "Chester", "India", "Randy", "Kyle", "Hailey", "Lyle", "Mae", "Virgil", "Annie", "Kurt", "Lionel", "Malik" ], "edges": [ [ 0, 3 ], [ 3, 9 ], [ 4, 6 ], [ 5, 1 ], [ 7, 8 ], [ 9, 2 ], [ 9, 5 ], [ 9, 4 ], [ 9, 7 ], [ 10, 13 ], [ 13, 19 ], [ 14, 16 ], [ 15, 11 ], [ 17, 18 ], [ 19, 12 ], [ 19, 15 ], [ 19, 14 ], [ 19, 17 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Joshua knows Vicki. Arlene knows Kendrick. Clifford knows Belinda. Elliot knows Brody. Hope knows Faith. Devon knows Farrah. Michelle knows Elliot. Trevor knows Hope. Farrah knows Joshua. Kendrick knows Randall. Dennis knows Gary. Henry knows Trevor. Tabitha knows Arlene. Michelle knows Tabitha. Dennis knows Devon. Belinda knows Michelle. Clifford knows Hal. Farrah knows Henry. Which of Faith and Randall can Clifford reach?", "answer": "Randall", "steps": [ "Clifford knows Belinda.", "Belinda knows Michelle.", "Michelle knows Tabitha.", "Tabitha knows Arlene.", "Arlene knows Kendrick.", "Kendrick knows Randall." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Clifford", "Tabitha", "Kendrick", "Hal", "Belinda", "Elliot", "Michelle", "Randall", "Arlene", "Brody", "Dennis", "Henry", "Hope", "Gary", "Devon", "Joshua", "Farrah", "Faith", "Trevor", "Vicki" ], "edges": [ [ 0, 3 ], [ 0, 4 ], [ 1, 8 ], [ 2, 7 ], [ 4, 6 ], [ 5, 9 ], [ 6, 1 ], [ 6, 5 ], [ 8, 2 ], [ 10, 13 ], [ 10, 14 ], [ 11, 18 ], [ 12, 17 ], [ 14, 16 ], [ 15, 19 ], [ 16, 11 ], [ 16, 15 ], [ 18, 12 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Annette knows Tom. Ruby knows Ellis. Theodore knows Bryan. Wendell knows Julian. Annette knows Val. Val knows Cate. Penny knows Pearl. Tom knows Samuel. Theodore knows Ray. Ruby knows Penny. Penny knows Percy. Julian knows Kaleb. Alison knows Wendell. Bryan knows Ruby. Percy knows Carlos. Julian knows Annette. Alison knows Renee. Pearl knows Evelyn. Which of Julian and Ruby can Theodore reach?", "answer": "Ruby", "steps": [ "Theodore knows Bryan.", "Bryan knows Ruby." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Theodore", "Bryan", "Percy", "Ray", "Pearl", "Ruby", "Ellis", "Evelyn", "Carlos", "Penny", "Alison", "Wendell", "Tom", "Renee", "Val", "Julian", "Kaleb", "Cate", "Samuel", "Annette" ], "edges": [ [ 0, 3 ], [ 0, 1 ], [ 1, 5 ], [ 2, 8 ], [ 4, 7 ], [ 5, 6 ], [ 5, 9 ], [ 9, 4 ], [ 9, 2 ], [ 10, 13 ], [ 10, 11 ], [ 11, 15 ], [ 12, 18 ], [ 14, 17 ], [ 15, 16 ], [ 15, 19 ], [ 19, 14 ], [ 19, 12 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Inez knows Della. Della knows Marc. Inez knows Justin. Judith knows Inez. Kirsten knows Zane. Wanda knows Emmett. Irving knows Lenora. Glen knows Kirsten. Glen knows Alicia. Della knows Melody. Irving knows Sierra. Larry knows Yara. Yara knows Hugh. Emmett knows Edmund. Yara knows Irving. Yara knows Wanda. Wanda knows Jeff. Inez knows Glen. Which of Yara and Inez can Larry reach?", "answer": "Yara", "steps": [ "Larry knows Yara." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Larry", "Emmett", "Hugh", "Sierra", "Irving", "Edmund", "Wanda", "Yara", "Jeff", "Lenora", "Judith", "Kirsten", "Justin", "Marc", "Della", "Zane", "Glen", "Inez", "Alicia", "Melody" ], "edges": [ [ 0, 7 ], [ 1, 5 ], [ 4, 3 ], [ 4, 9 ], [ 6, 1 ], [ 6, 8 ], [ 7, 2 ], [ 7, 6 ], [ 7, 4 ], [ 10, 17 ], [ 11, 15 ], [ 14, 13 ], [ 14, 19 ], [ 16, 11 ], [ 16, 18 ], [ 17, 12 ], [ 17, 16 ], [ 17, 14 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Shelly knows Brett. Justine knows Benjamin. Brett knows Parker. Benjamin knows Aiden. Jeanette knows Justine. Carol knows Helene. Carol knows Georgia. Alyssa knows Lionel. Alejandro knows Edmund. Parker knows Alyssa. Benjamin knows Chester. Dean knows Jeanette. Justine knows Hadley. Edmund knows Dean. Dean knows August. Alyssa knows Carol. Wallace knows Shelly. Brett knows Kendra. Which of Edmund and Shelly can Wallace reach?", "answer": "Shelly", "steps": [ "Wallace knows Shelly." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Wallace", "Alyssa", "Georgia", "Lionel", "Carol", "Parker", "Helene", "Kendra", "Brett", "Shelly", "Alejandro", "Justine", "Aiden", "Hadley", "Benjamin", "Jeanette", "Chester", "August", "Dean", "Edmund" ], "edges": [ [ 0, 9 ], [ 1, 3 ], [ 1, 4 ], [ 4, 2 ], [ 4, 6 ], [ 5, 1 ], [ 8, 5 ], [ 8, 7 ], [ 9, 8 ], [ 10, 19 ], [ 11, 13 ], [ 11, 14 ], [ 14, 12 ], [ 14, 16 ], [ 15, 11 ], [ 18, 15 ], [ 18, 17 ], [ 19, 18 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Joshua knows Vicki. Arlene knows Kendrick. Clifford knows Belinda. Elliot knows Brody. Hope knows Faith. Devon knows Farrah. Michelle knows Elliot. Trevor knows Hope. Farrah knows Joshua. Kendrick knows Randall. Dennis knows Gary. Henry knows Trevor. Tabitha knows Arlene. Michelle knows Tabitha. Dennis knows Devon. Belinda knows Michelle. Clifford knows Hal. Farrah knows Henry. Which of Devon and Belinda can Clifford reach?", "answer": "Belinda", "steps": [ "Clifford knows Belinda." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Clifford", "Tabitha", "Kendrick", "Hal", "Belinda", "Elliot", "Michelle", "Randall", "Arlene", "Brody", "Dennis", "Henry", "Hope", "Gary", "Devon", "Joshua", "Farrah", "Faith", "Trevor", "Vicki" ], "edges": [ [ 0, 3 ], [ 0, 4 ], [ 1, 8 ], [ 2, 7 ], [ 4, 6 ], [ 5, 9 ], [ 6, 1 ], [ 6, 5 ], [ 8, 2 ], [ 10, 13 ], [ 10, 14 ], [ 11, 18 ], [ 12, 17 ], [ 14, 16 ], [ 15, 19 ], [ 16, 11 ], [ 16, 15 ], [ 18, 12 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Shane knows Molly. Tina knows Shane. Ilene knows Faith. Molly knows Palmer. Cody knows Paul. Ilene knows Eden. Claire knows Mitchell. Roland knows Chantal. Darrell knows Tina. Bert knows Chloe. Cody knows Bert. Eden knows Darrell. Jade knows Claire. Jade knows Martha. Mitchell knows Roland. Molly knows Annie. Chantal knows Cody. Palmer knows Estella. Which of Eden and Claire can Jade reach?", "answer": "Claire", "steps": [ "Jade knows Claire." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Jade", "Claire", "Martha", "Mitchell", "Chloe", "Chantal", "Paul", "Bert", "Cody", "Roland", "Ilene", "Eden", "Faith", "Darrell", "Estella", "Shane", "Annie", "Palmer", "Molly", "Tina" ], "edges": [ [ 0, 2 ], [ 0, 1 ], [ 1, 3 ], [ 3, 9 ], [ 5, 8 ], [ 7, 4 ], [ 8, 6 ], [ 8, 7 ], [ 9, 5 ], [ 10, 12 ], [ 10, 11 ], [ 11, 13 ], [ 13, 19 ], [ 15, 18 ], [ 17, 14 ], [ 18, 16 ], [ 18, 17 ], [ 19, 15 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Greer knows Alicia. Clara knows Linda. Bernard knows Conner. Bernard knows Deirdre. Deirdre knows Lauren. Cara knows Bill. Callum knows Clara. Cara knows Gordon. Clara knows Cara. Garland knows Callum. Lauren knows Kelsey. Kelsey knows Vanessa. Langston knows Jeff. Gordon knows Greer. Carrie knows Bernard. Jeff knows Carrie. Carrie knows Marie. Alicia knows Deanna. Which of Kelsey and Alicia can Garland reach?", "answer": "Alicia", "steps": [ "Garland knows Callum.", "Callum knows Clara.", "Clara knows Cara.", "Cara knows Gordon.", "Gordon knows Greer.", "Greer knows Alicia." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Garland", "Bill", "Linda", "Cara", "Clara", "Alicia", "Callum", "Deanna", "Gordon", "Greer", "Langston", "Conner", "Marie", "Bernard", "Carrie", "Kelsey", "Jeff", "Vanessa", "Deirdre", "Lauren" ], "edges": [ [ 0, 6 ], [ 3, 1 ], [ 3, 8 ], [ 4, 2 ], [ 4, 3 ], [ 5, 7 ], [ 6, 4 ], [ 8, 9 ], [ 9, 5 ], [ 10, 16 ], [ 13, 11 ], [ 13, 18 ], [ 14, 12 ], [ 14, 13 ], [ 15, 17 ], [ 16, 14 ], [ 18, 19 ], [ 19, 15 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Pauline knows Eunice. Abigail knows Dolly. Carson knows Maya. Keira knows Joshua. Gwen knows Keira. Natalie knows Greer. Sally knows Carson. Eunice knows Natalie. Dolly knows Dorian. Joshua knows Janet. Gwen knows Harlan. Caroline knows Ilene. Brad knows Warren. Janet knows Caroline. Pauline knows Amelia. Ilene knows Sally. Warren knows Abigail. Greer knows Brad. Which of Ilene and Warren can Gwen reach?", "answer": "Ilene", "steps": [ "Gwen knows Keira.", "Keira knows Joshua.", "Joshua knows Janet.", "Janet knows Caroline.", "Caroline knows Ilene." ], "difficulty": 5, "original_distance": 8, "idx_to_symbol": [ "Gwen", "Joshua", "Harlan", "Carson", "Maya", "Keira", "Caroline", "Janet", "Ilene", "Sally", "Pauline", "Natalie", "Amelia", "Dolly", "Dorian", "Eunice", "Brad", "Greer", "Warren", "Abigail" ], "edges": [ [ 0, 2 ], [ 0, 5 ], [ 1, 7 ], [ 3, 4 ], [ 5, 1 ], [ 6, 8 ], [ 7, 6 ], [ 8, 9 ], [ 9, 3 ], [ 10, 12 ], [ 10, 15 ], [ 11, 17 ], [ 13, 14 ], [ 15, 11 ], [ 16, 18 ], [ 17, 16 ], [ 18, 19 ], [ 19, 13 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Jocelyn knows Gregory. Ron knows Leticia. Luella knows Foster. Irene knows Ron. Yara knows Bernadette. Viola knows Imogen. Jeff knows Norma. Ron knows Yasmin. Ron knows Luella. Gregory knows Yara. Tara knows Irene. Viola knows Jeff. Parsa knows Tara. Ford knows Parsa. Darrell knows Ford. Viola knows Phoebe. Gladys knows Jocelyn. Bernadette knows Viola. Which of Irene and Bernadette can Gladys reach?", "answer": "Bernadette", "steps": [ "Gladys knows Jocelyn.", "Jocelyn knows Gregory.", "Gregory knows Yara.", "Yara knows Bernadette." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Gladys", "Phoebe", "Imogen", "Norma", "Bernadette", "Viola", "Gregory", "Yara", "Jeff", "Jocelyn", "Darrell", "Leticia", "Yasmin", "Foster", "Irene", "Ron", "Parsa", "Tara", "Luella", "Ford" ], "edges": [ [ 0, 9 ], [ 4, 5 ], [ 5, 1 ], [ 5, 2 ], [ 5, 8 ], [ 6, 7 ], [ 7, 4 ], [ 8, 3 ], [ 9, 6 ], [ 10, 19 ], [ 14, 15 ], [ 15, 11 ], [ 15, 12 ], [ 15, 18 ], [ 16, 17 ], [ 17, 14 ], [ 18, 13 ], [ 19, 16 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Zara knows Electra. Pearl knows Todd. Whitney knows Victoria. Pearl knows Morris. Zara knows Kirk. Morris knows Donald. Whitney knows Fabian. Pearl knows Dalton. Julian knows Pearl. Victoria knows Bella. Whitney knows Zara. Harold knows Whitney. Todd knows Beatrice. Todd knows Cody. Whitney knows Nicholas. Pearl knows Darrell. Donald knows Julio. Bella knows Betty. Which of Bella and Donald can Harold reach?", "answer": "Bella", "steps": [ "Harold knows Whitney.", "Whitney knows Victoria.", "Victoria knows Bella." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Harold", "Whitney", "Zara", "Bella", "Betty", "Victoria", "Nicholas", "Fabian", "Electra", "Kirk", "Julian", "Pearl", "Todd", "Donald", "Julio", "Morris", "Dalton", "Darrell", "Cody", "Beatrice" ], "edges": [ [ 0, 1 ], [ 1, 5 ], [ 1, 6 ], [ 1, 7 ], [ 1, 2 ], [ 2, 8 ], [ 2, 9 ], [ 3, 4 ], [ 5, 3 ], [ 10, 11 ], [ 11, 15 ], [ 11, 16 ], [ 11, 17 ], [ 11, 12 ], [ 12, 18 ], [ 12, 19 ], [ 13, 14 ], [ 15, 13 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Zachary knows Ella. Darnell knows Zachary. Ella knows Jasper. Merle knows Melody. Parker knows Matthew. Kathleen knows Fletcher. Kathleen knows Kane. Ella knows Israel. Matthew knows Aspen. Kathleen knows Marilyn. Aspen knows Kathleen. Melody knows Darnell. Lara knows Ryan. Ryan knows Daniella. Dalton knows Merle. Merle knows Lydia. Ryan knows Parker. Ella knows Valerie. Which of Merle and Ryan can Dalton reach?", "answer": "Merle", "steps": [ "Dalton knows Merle." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Dalton", "Jasper", "Ella", "Valerie", "Melody", "Israel", "Darnell", "Lydia", "Zachary", "Merle", "Lara", "Marilyn", "Kathleen", "Kane", "Parker", "Fletcher", "Matthew", "Daniella", "Aspen", "Ryan" ], "edges": [ [ 0, 9 ], [ 2, 1 ], [ 2, 3 ], [ 2, 5 ], [ 4, 6 ], [ 6, 8 ], [ 8, 2 ], [ 9, 7 ], [ 9, 4 ], [ 10, 19 ], [ 12, 11 ], [ 12, 13 ], [ 12, 15 ], [ 14, 16 ], [ 16, 18 ], [ 18, 12 ], [ 19, 17 ], [ 19, 14 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Greer knows Alicia. Clara knows Linda. Bernard knows Conner. Bernard knows Deirdre. Deirdre knows Lauren. Cara knows Bill. Callum knows Clara. Cara knows Gordon. Clara knows Cara. Garland knows Callum. Lauren knows Kelsey. Kelsey knows Vanessa. Langston knows Jeff. Gordon knows Greer. Carrie knows Bernard. Jeff knows Carrie. Carrie knows Marie. Alicia knows Deanna. Which of Cara and Bernard can Garland reach?", "answer": "Cara", "steps": [ "Garland knows Callum.", "Callum knows Clara.", "Clara knows Cara." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Garland", "Bill", "Linda", "Cara", "Clara", "Alicia", "Callum", "Deanna", "Gordon", "Greer", "Langston", "Conner", "Marie", "Bernard", "Carrie", "Kelsey", "Jeff", "Vanessa", "Deirdre", "Lauren" ], "edges": [ [ 0, 6 ], [ 3, 1 ], [ 3, 8 ], [ 4, 2 ], [ 4, 3 ], [ 5, 7 ], [ 6, 4 ], [ 8, 9 ], [ 9, 5 ], [ 10, 16 ], [ 13, 11 ], [ 13, 18 ], [ 14, 12 ], [ 14, 13 ], [ 15, 17 ], [ 16, 14 ], [ 18, 19 ], [ 19, 15 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Justine knows Karen. Justine knows Imogen. Ezra knows Dante. Karen knows Odette. Dave knows Ezra. Justine knows Gemma. Whitney knows Lois. Daniel knows Justine. Karen knows Dave. Ricardo knows Courtney. Courtney knows Gerard. Whitney knows Opal. Opal knows Tanya. Camden knows Ricardo. Whitney knows Camden. Gemma knows Leland. Camden knows Travis. Natalie knows Whitney. Which of Ezra and Courtney can Daniel reach?", "answer": "Ezra", "steps": [ "Daniel knows Justine.", "Justine knows Karen.", "Karen knows Dave.", "Dave knows Ezra." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Daniel", "Dante", "Imogen", "Ezra", "Leland", "Karen", "Justine", "Odette", "Gemma", "Dave", "Natalie", "Gerard", "Lois", "Courtney", "Tanya", "Camden", "Whitney", "Travis", "Opal", "Ricardo" ], "edges": [ [ 0, 6 ], [ 3, 1 ], [ 5, 7 ], [ 5, 9 ], [ 6, 2 ], [ 6, 8 ], [ 6, 5 ], [ 8, 4 ], [ 9, 3 ], [ 10, 16 ], [ 13, 11 ], [ 15, 17 ], [ 15, 19 ], [ 16, 12 ], [ 16, 18 ], [ 16, 15 ], [ 18, 14 ], [ 19, 13 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Virgil knows Chad. Lola knows Lena. Jared knows Ben. Virgil knows Finn. Maria knows Seth. Mildred knows Virgil. Dave knows Dora. Chad knows Chase. Deborah knows Justine. Lola knows Maria. Rocco knows Deborah. Serena knows Mildred. Justine knows Jared. Jared knows Lola. Jocelyn knows Dave. Mildred knows Merle. Dora knows Serena. Ashley knows Rocco. Which of Seth and Chase can Ashley reach?", "answer": "Seth", "steps": [ "Ashley knows Rocco.", "Rocco knows Deborah.", "Deborah knows Justine.", "Justine knows Jared.", "Jared knows Lola.", "Lola knows Maria.", "Maria knows Seth." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Ashley", "Lola", "Ben", "Seth", "Justine", "Deborah", "Rocco", "Lena", "Jared", "Maria", "Jocelyn", "Virgil", "Merle", "Chase", "Serena", "Dora", "Dave", "Finn", "Mildred", "Chad" ], "edges": [ [ 0, 6 ], [ 1, 7 ], [ 1, 9 ], [ 4, 8 ], [ 5, 4 ], [ 6, 5 ], [ 8, 2 ], [ 8, 1 ], [ 9, 3 ], [ 10, 16 ], [ 11, 17 ], [ 11, 19 ], [ 14, 18 ], [ 15, 14 ], [ 16, 15 ], [ 18, 12 ], [ 18, 11 ], [ 19, 13 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Jeremy knows Henry. Jane knows Bernice. Beatrice knows Fanny. Roman knows Emma. Roman knows Luther. Henry knows Alfred. Christina knows Heather. Knox knows Pearl. Bella knows Emmett. Bella knows Beatrice. Jane knows Anastasia. Anastasia knows Estella. Emmett knows Jeremy. Henry knows Stacy. Jared knows Roman. Henry knows Christina. Roman knows Knox. Bernice knows Jared. Which of Roman and Henry can Bella reach?", "answer": "Henry", "steps": [ "Bella knows Emmett.", "Emmett knows Jeremy.", "Jeremy knows Henry." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Bella", "Beatrice", "Christina", "Heather", "Stacy", "Alfred", "Emmett", "Jeremy", "Fanny", "Henry", "Jane", "Anastasia", "Knox", "Pearl", "Emma", "Luther", "Bernice", "Jared", "Estella", "Roman" ], "edges": [ [ 0, 1 ], [ 0, 6 ], [ 1, 8 ], [ 2, 3 ], [ 6, 7 ], [ 7, 9 ], [ 9, 2 ], [ 9, 4 ], [ 9, 5 ], [ 10, 11 ], [ 10, 16 ], [ 11, 18 ], [ 12, 13 ], [ 16, 17 ], [ 17, 19 ], [ 19, 12 ], [ 19, 14 ], [ 19, 15 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Cara knows Bette. Winifred knows Maude. Hendrix knows Wilma. Luella knows Hudson. Donna knows Cara. Milton knows Erik. Tonya knows Hendrix. Destiny knows Hadley. Hudson knows Winifred. Maude knows Milton. Hendrix knows Wanda. Wanda knows Bill. Hadley knows Skyler. Donna knows Nicholas. Milton knows Destiny. Luella knows Essie. Bette knows Tonya. Bill knows Peggy. Which of Tonya and Maude can Donna reach?", "answer": "Tonya", "steps": [ "Donna knows Cara.", "Cara knows Bette.", "Bette knows Tonya." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Donna", "Tonya", "Cara", "Wilma", "Bette", "Peggy", "Wanda", "Bill", "Hendrix", "Nicholas", "Luella", "Maude", "Hudson", "Erik", "Winifred", "Skyler", "Destiny", "Hadley", "Milton", "Essie" ], "edges": [ [ 0, 2 ], [ 0, 9 ], [ 1, 8 ], [ 2, 4 ], [ 4, 1 ], [ 6, 7 ], [ 7, 5 ], [ 8, 3 ], [ 8, 6 ], [ 10, 12 ], [ 10, 19 ], [ 11, 18 ], [ 12, 14 ], [ 14, 11 ], [ 16, 17 ], [ 17, 15 ], [ 18, 13 ], [ 18, 16 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Lena knows Clarence. Wanda knows Hattie. Lucia knows Ella. Javier knows Wanda. Sadie knows Adele. Jim knows Sadie. Adele knows Clara. Norma knows Miriam. Sadie knows Norma. Miriam knows Noah. Lucia knows Daphne. Wanda knows Latoya. Cain knows Lucia. Miriam knows Lena. Adele knows Susan. Ken knows Javier. Javier knows Cain. Daphne knows Fabian. Which of Daphne and Lena can Jim reach?", "answer": "Lena", "steps": [ "Jim knows Sadie.", "Sadie knows Norma.", "Norma knows Miriam.", "Miriam knows Lena." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Jim", "Clara", "Sadie", "Noah", "Susan", "Miriam", "Norma", "Lena", "Adele", "Clarence", "Ken", "Latoya", "Javier", "Ella", "Hattie", "Lucia", "Cain", "Daphne", "Wanda", "Fabian" ], "edges": [ [ 0, 2 ], [ 2, 8 ], [ 2, 6 ], [ 5, 3 ], [ 5, 7 ], [ 6, 5 ], [ 7, 9 ], [ 8, 1 ], [ 8, 4 ], [ 10, 12 ], [ 12, 18 ], [ 12, 16 ], [ 15, 13 ], [ 15, 17 ], [ 16, 15 ], [ 17, 19 ], [ 18, 11 ], [ 18, 14 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Glenda knows Kristin. Dominic knows Eva. Alex knows Tamara. Dee knows Gus. Casey knows Carol. Hailey knows Angela. Angela knows Alex. Casey knows Alder. Alex knows Glenda. Alex knows Colleen. Gus knows Casey. Kendra knows Hailey. Gladys knows Kendra. Eva knows Dee. Lennox knows Mary. Eva knows Bernice. Casey knows Lennox. Kendra knows Kai. Which of Mary and Kristin can Gladys reach?", "answer": "Kristin", "steps": [ "Gladys knows Kendra.", "Kendra knows Hailey.", "Hailey knows Angela.", "Angela knows Alex.", "Alex knows Glenda.", "Glenda knows Kristin." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Gladys", "Kristin", "Colleen", "Glenda", "Kendra", "Tamara", "Kai", "Alex", "Angela", "Hailey", "Dominic", "Mary", "Alder", "Lennox", "Eva", "Carol", "Bernice", "Casey", "Gus", "Dee" ], "edges": [ [ 0, 4 ], [ 3, 1 ], [ 4, 6 ], [ 4, 9 ], [ 7, 2 ], [ 7, 3 ], [ 7, 5 ], [ 8, 7 ], [ 9, 8 ], [ 10, 14 ], [ 13, 11 ], [ 14, 16 ], [ 14, 19 ], [ 17, 12 ], [ 17, 13 ], [ 17, 15 ], [ 18, 17 ], [ 19, 18 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Roger knows Lambert. Trevor knows Louis. Henry knows Virginia. Spencer knows Trevor. Louis knows Henry. Henrietta knows Spencer. Lambert knows Enid. Hope knows Heath. Pearl knows Edwin. Edwin knows Callum. Jakob knows Guy. Carla knows Chester. Lambert knows Carla. Chester knows Hope. Hope knows Pearl. Jakob knows Henrietta. Trevor knows Vera. Cindy knows Jakob. Which of Lambert and Jakob can Roger reach?", "answer": "Lambert", "steps": [ "Roger knows Lambert." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Roger", "Heath", "Hope", "Enid", "Pearl", "Chester", "Lambert", "Callum", "Carla", "Edwin", "Cindy", "Vera", "Trevor", "Guy", "Louis", "Spencer", "Jakob", "Virginia", "Henrietta", "Henry" ], "edges": [ [ 0, 6 ], [ 2, 1 ], [ 2, 4 ], [ 4, 9 ], [ 5, 2 ], [ 6, 3 ], [ 6, 8 ], [ 8, 5 ], [ 9, 7 ], [ 10, 16 ], [ 12, 11 ], [ 12, 14 ], [ 14, 19 ], [ 15, 12 ], [ 16, 13 ], [ 16, 18 ], [ 18, 15 ], [ 19, 17 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Melissa knows Ruby. Darin knows Myrtle. Norman knows Melissa. Darin knows Leopold. Ida knows Joyce. Doris knows Malik. Myrtle knows Kamila. Kamila knows Norman. Joyce knows Louis. Jenny knows Leslie. Yvonne knows Wesley. Leslie knows Ida. Malik knows Darin. Malik knows Cain. Louis knows Yvonne. Clement knows Jenny. Jenny knows Forrest. Leslie knows Jolene. Which of Kamila and Joyce can Doris reach?", "answer": "Kamila", "steps": [ "Doris knows Malik.", "Malik knows Darin.", "Darin knows Myrtle.", "Myrtle knows Kamila." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Doris", "Kamila", "Myrtle", "Malik", "Leopold", "Darin", "Melissa", "Ruby", "Norman", "Cain", "Clement", "Joyce", "Ida", "Jenny", "Jolene", "Leslie", "Yvonne", "Wesley", "Louis", "Forrest" ], "edges": [ [ 0, 3 ], [ 1, 8 ], [ 2, 1 ], [ 3, 5 ], [ 3, 9 ], [ 5, 4 ], [ 5, 2 ], [ 6, 7 ], [ 8, 6 ], [ 10, 13 ], [ 11, 18 ], [ 12, 11 ], [ 13, 15 ], [ 13, 19 ], [ 15, 14 ], [ 15, 12 ], [ 16, 17 ], [ 18, 16 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Harris knows Ainsley. Franklin knows Raquel. Brian knows Daniella. Larissa knows Milo. Landon knows Susan. Willis knows Charlene. Charlene knows Graham. Clayton knows Brian. Harris knows Hector. Clayton knows Larissa. Hector knows Gwen. Graham knows Bennett. Ainsley knows Freya. Charlene knows Franklin. Gwen knows Clayton. Landon knows Lisette. Lisette knows Lorraine. Susan knows Willis. Which of Larissa and Graham can Harris reach?", "answer": "Larissa", "steps": [ "Harris knows Hector.", "Hector knows Gwen.", "Gwen knows Clayton.", "Clayton knows Larissa." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Harris", "Brian", "Milo", "Freya", "Daniella", "Hector", "Clayton", "Ainsley", "Larissa", "Gwen", "Landon", "Franklin", "Bennett", "Lorraine", "Raquel", "Susan", "Charlene", "Lisette", "Graham", "Willis" ], "edges": [ [ 0, 7 ], [ 0, 5 ], [ 1, 4 ], [ 5, 9 ], [ 6, 1 ], [ 6, 8 ], [ 7, 3 ], [ 8, 2 ], [ 9, 6 ], [ 10, 17 ], [ 10, 15 ], [ 11, 14 ], [ 15, 19 ], [ 16, 11 ], [ 16, 18 ], [ 17, 13 ], [ 18, 12 ], [ 19, 16 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Demetrius knows Kristin. Vance knows Lillian. Wendy knows Isabel. Roland knows Demetrius. Lillian knows Connor. Roland knows Brody. Pam knows Roland. Maude knows Marie. Wendy knows Roger. Nina knows Miles. Lillian knows Nina. Roland knows Blake. Kristin knows Leopold. Nina knows Jenna. Lillian knows Maude. Marie knows Nicole. Lillian knows Yvette. Roland knows Wendy. Which of Marie and Kristin can Pam reach?", "answer": "Kristin", "steps": [ "Pam knows Roland.", "Roland knows Demetrius.", "Demetrius knows Kristin." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Pam", "Roland", "Leopold", "Kristin", "Roger", "Demetrius", "Brody", "Blake", "Isabel", "Wendy", "Vance", "Lillian", "Nicole", "Marie", "Miles", "Maude", "Yvette", "Connor", "Jenna", "Nina" ], "edges": [ [ 0, 1 ], [ 1, 5 ], [ 1, 6 ], [ 1, 7 ], [ 1, 9 ], [ 3, 2 ], [ 5, 3 ], [ 9, 4 ], [ 9, 8 ], [ 10, 11 ], [ 11, 15 ], [ 11, 16 ], [ 11, 17 ], [ 11, 19 ], [ 13, 12 ], [ 15, 13 ], [ 19, 14 ], [ 19, 18 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Gilbert knows Kenzie. Carter knows Lee. Tom knows Leigh. Leon knows Jackson. Carter knows Samuel. Georgia knows Carter. Lucas knows Charlotte. Leigh knows Leon. Leon knows Elodie. Gilbert knows Craig. Rick knows Gilbert. Gilbert knows Angela. Samuel knows Aldo. Angela knows Tom. Carter knows Shane. Mark knows Lucas. Lucas knows Howard. Aldo knows Mark. Which of Mark and Leigh can Georgia reach?", "answer": "Mark", "steps": [ "Georgia knows Carter.", "Carter knows Samuel.", "Samuel knows Aldo.", "Aldo knows Mark." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Georgia", "Samuel", "Lucas", "Charlotte", "Aldo", "Howard", "Mark", "Carter", "Shane", "Lee", "Rick", "Angela", "Leon", "Jackson", "Tom", "Elodie", "Leigh", "Gilbert", "Kenzie", "Craig" ], "edges": [ [ 0, 7 ], [ 1, 4 ], [ 2, 3 ], [ 2, 5 ], [ 4, 6 ], [ 6, 2 ], [ 7, 1 ], [ 7, 8 ], [ 7, 9 ], [ 10, 17 ], [ 11, 14 ], [ 12, 13 ], [ 12, 15 ], [ 14, 16 ], [ 16, 12 ], [ 17, 11 ], [ 17, 18 ], [ 17, 19 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Sebastian knows Elvira. Jessica knows Harmony. Whitney knows Riley. Elvira knows Lucia. Sebastian knows Miles. Daphne knows Itzel. Laurel knows Warren. Dakota knows Laurel. Dakota knows Fabian. Laurel knows Whitney. Elvira knows Jessica. Harmony knows Daphne. Riley knows Wayne. Riley knows Antonio. Sebastian knows Logan. Harmony knows Lana. Dakota knows Guy. Antonio knows Barney. Which of Whitney and Jessica can Sebastian reach?", "answer": "Jessica", "steps": [ "Sebastian knows Elvira.", "Elvira knows Jessica." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Sebastian", "Lucia", "Logan", "Daphne", "Jessica", "Lana", "Itzel", "Miles", "Harmony", "Elvira", "Dakota", "Warren", "Fabian", "Antonio", "Whitney", "Wayne", "Barney", "Guy", "Riley", "Laurel" ], "edges": [ [ 0, 2 ], [ 0, 7 ], [ 0, 9 ], [ 3, 6 ], [ 4, 8 ], [ 8, 5 ], [ 8, 3 ], [ 9, 1 ], [ 9, 4 ], [ 10, 12 ], [ 10, 17 ], [ 10, 19 ], [ 13, 16 ], [ 14, 18 ], [ 18, 15 ], [ 18, 13 ], [ 19, 11 ], [ 19, 14 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Blaine knows Rebecca. Rebecca knows Marc. Blaine knows Donovan. Marion knows Ross. Doris knows Bridget. Doris knows Inez. Rebecca knows Saul. Chester knows Haven. Tamara knows Lee. Jane knows Marion. Diego knows Lottie. Inez knows Chester. Keaton knows Blaine. Marc knows Tamara. Diego knows Doris. Lee knows Davis. Marc knows Rosa. Marion knows Diego. Which of Inez and Tamara can Keaton reach?", "answer": "Tamara", "steps": [ "Keaton knows Blaine.", "Blaine knows Rebecca.", "Rebecca knows Marc.", "Marc knows Tamara." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Keaton", "Lee", "Tamara", "Marc", "Saul", "Davis", "Rebecca", "Rosa", "Donovan", "Blaine", "Jane", "Chester", "Inez", "Doris", "Lottie", "Haven", "Diego", "Bridget", "Ross", "Marion" ], "edges": [ [ 0, 9 ], [ 1, 5 ], [ 2, 1 ], [ 3, 2 ], [ 3, 7 ], [ 6, 4 ], [ 6, 3 ], [ 9, 6 ], [ 9, 8 ], [ 10, 19 ], [ 11, 15 ], [ 12, 11 ], [ 13, 12 ], [ 13, 17 ], [ 16, 14 ], [ 16, 13 ], [ 19, 16 ], [ 19, 18 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Cooper knows Shannon. Eva knows Leslie. Chase knows Guy. Chase knows Kylie. Leslie knows Elodie. Khashayar knows Blaine. Myra knows Khashayar. Luis knows Alexa. Guy knows Eva. Alexa knows Sally. Jocelyn knows Dee. Luis knows Susanne. Kylie knows Cooper. Shannon knows Kendrick. Elodie knows Kristin. Susanne knows Alex. Alex knows Myra. Sally knows Jocelyn. Which of Eva and Alex can Chase reach?", "answer": "Eva", "steps": [ "Chase knows Guy.", "Guy knows Eva." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Chase", "Elodie", "Kendrick", "Kylie", "Guy", "Eva", "Shannon", "Kristin", "Cooper", "Leslie", "Luis", "Khashayar", "Dee", "Alexa", "Susanne", "Alex", "Jocelyn", "Blaine", "Sally", "Myra" ], "edges": [ [ 0, 3 ], [ 0, 4 ], [ 1, 7 ], [ 3, 8 ], [ 4, 5 ], [ 5, 9 ], [ 6, 2 ], [ 8, 6 ], [ 9, 1 ], [ 10, 13 ], [ 10, 14 ], [ 11, 17 ], [ 13, 18 ], [ 14, 15 ], [ 15, 19 ], [ 16, 12 ], [ 18, 16 ], [ 19, 11 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Alejandro knows Luna. Inez knows Landon. Gwen knows Carrie. Landon knows Gwen. Cesar knows Frankie. Leroy knows Ethan. Marion knows Tonya. Alejandro knows Morris. Frankie knows Helen. Marion knows Cesar. Arthur knows Aiden. Alejandro knows Lucia. Lucia knows Inez. Marion knows Leroy. Luna knows Joaquin. Helen knows Arthur. Arthur knows Corinne. Gwen knows Ford. Which of Lucia and Cesar can Marion reach?", "answer": "Cesar", "steps": [ "Marion knows Cesar." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Marion", "Leroy", "Frankie", "Ethan", "Helen", "Aiden", "Cesar", "Tonya", "Arthur", "Corinne", "Alejandro", "Luna", "Inez", "Joaquin", "Landon", "Carrie", "Lucia", "Morris", "Gwen", "Ford" ], "edges": [ [ 0, 1 ], [ 0, 7 ], [ 0, 6 ], [ 1, 3 ], [ 2, 4 ], [ 4, 8 ], [ 6, 2 ], [ 8, 5 ], [ 8, 9 ], [ 10, 11 ], [ 10, 17 ], [ 10, 16 ], [ 11, 13 ], [ 12, 14 ], [ 14, 18 ], [ 16, 12 ], [ 18, 15 ], [ 18, 19 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Trevor knows Lewis. Elodie knows Alfonso. Peggy knows Beth. Emery knows Pauline. Beth knows Landon. Alfonso knows Barney. Bert knows Arden. Emery knows Aubrey. Gail knows Peggy. Landon knows Lark. Alfonso knows Magdalena. Barney knows Trevor. Trevor knows Houston. Emery knows Gail. Houston knows Bert. Alfonso knows Mindy. Hannah knows Emery. Peggy knows Graham. Which of Gail and Barney can Elodie reach?", "answer": "Barney", "steps": [ "Elodie knows Alfonso.", "Alfonso knows Barney." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Elodie", "Lewis", "Houston", "Mindy", "Alfonso", "Trevor", "Bert", "Magdalena", "Arden", "Barney", "Hannah", "Graham", "Beth", "Pauline", "Emery", "Peggy", "Landon", "Aubrey", "Lark", "Gail" ], "edges": [ [ 0, 4 ], [ 2, 6 ], [ 4, 3 ], [ 4, 7 ], [ 4, 9 ], [ 5, 1 ], [ 5, 2 ], [ 6, 8 ], [ 9, 5 ], [ 10, 14 ], [ 12, 16 ], [ 14, 13 ], [ 14, 17 ], [ 14, 19 ], [ 15, 11 ], [ 15, 12 ], [ 16, 18 ], [ 19, 15 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Greer knows Alicia. Clara knows Linda. Bernard knows Conner. Bernard knows Deirdre. Deirdre knows Lauren. Cara knows Bill. Callum knows Clara. Cara knows Gordon. Clara knows Cara. Garland knows Callum. Lauren knows Kelsey. Kelsey knows Vanessa. Langston knows Jeff. Gordon knows Greer. Carrie knows Bernard. Jeff knows Carrie. Carrie knows Marie. Alicia knows Deanna. Which of Jeff and Callum can Garland reach?", "answer": "Callum", "steps": [ "Garland knows Callum." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Garland", "Bill", "Linda", "Cara", "Clara", "Alicia", "Callum", "Deanna", "Gordon", "Greer", "Langston", "Conner", "Marie", "Bernard", "Carrie", "Kelsey", "Jeff", "Vanessa", "Deirdre", "Lauren" ], "edges": [ [ 0, 6 ], [ 3, 1 ], [ 3, 8 ], [ 4, 2 ], [ 4, 3 ], [ 5, 7 ], [ 6, 4 ], [ 8, 9 ], [ 9, 5 ], [ 10, 16 ], [ 13, 11 ], [ 13, 18 ], [ 14, 12 ], [ 14, 13 ], [ 15, 17 ], [ 16, 14 ], [ 18, 19 ], [ 19, 15 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Gemma knows Marie. Cameron knows Paula. Calvin knows Lois. Ashley knows Calvin. Paula knows Kira. Lois knows Roger. Calvin knows Vivian. Roger knows Carrie. Marie knows Karla. Gage knows Hannah. Kira knows Gemma. Carrie knows Martin. Aaron knows Jocelyn. Paula knows Aaron. Aaron knows Zane. Calvin knows Gage. Paula knows Opal. Gage knows Lenora. Which of Roger and Gemma can Cameron reach?", "answer": "Gemma", "steps": [ "Cameron knows Paula.", "Paula knows Kira.", "Kira knows Gemma." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Cameron", "Kira", "Marie", "Gemma", "Karla", "Paula", "Aaron", "Opal", "Zane", "Jocelyn", "Ashley", "Lois", "Carrie", "Roger", "Martin", "Calvin", "Gage", "Vivian", "Hannah", "Lenora" ], "edges": [ [ 0, 5 ], [ 1, 3 ], [ 2, 4 ], [ 3, 2 ], [ 5, 1 ], [ 5, 7 ], [ 5, 6 ], [ 6, 8 ], [ 6, 9 ], [ 10, 15 ], [ 11, 13 ], [ 12, 14 ], [ 13, 12 ], [ 15, 11 ], [ 15, 17 ], [ 15, 16 ], [ 16, 18 ], [ 16, 19 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Brian knows Alvin. Daphna knows Jenny. Alvin knows Morris. Kylie knows Clay. Clay knows Heidi. Joyce knows Tristan. Louise knows William. Heidi knows Brandon. Randall knows Kylie. Noel knows Winston. Jenny knows Randall. Fisher knows Finn. Heidi knows Jonathan. Finn knows Noel. Joyce knows Brian. Winston knows Dolores. Jonathan knows Louise. Dolores knows Joyce. Which of Joyce and Heidi can Fisher reach?", "answer": "Joyce", "steps": [ "Fisher knows Finn.", "Finn knows Noel.", "Noel knows Winston.", "Winston knows Dolores.", "Dolores knows Joyce." ], "difficulty": 5, "original_distance": 8, "idx_to_symbol": [ "Fisher", "Winston", "Tristan", "Finn", "Noel", "Morris", "Joyce", "Alvin", "Dolores", "Brian", "Daphna", "Kylie", "Brandon", "Jenny", "Randall", "William", "Heidi", "Louise", "Clay", "Jonathan" ], "edges": [ [ 0, 3 ], [ 1, 8 ], [ 3, 4 ], [ 4, 1 ], [ 6, 2 ], [ 6, 9 ], [ 7, 5 ], [ 8, 6 ], [ 9, 7 ], [ 10, 13 ], [ 11, 18 ], [ 13, 14 ], [ 14, 11 ], [ 16, 12 ], [ 16, 19 ], [ 17, 15 ], [ 18, 16 ], [ 19, 17 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Alicia knows Blanche. Alexa knows Jolene. Kay knows Alexa. Jolene knows Dorian. Arturo knows Eunice. Diana knows Angela. Dorian knows Christopher. Alicia knows Christian. Alana knows Diana. Ignacio knows Alana. Ross knows Erma. Alicia knows Lucas. Christian knows Clement. Arturo knows Kay. Alana knows Saul. Dorian knows Ross. Clement knows Ignacio. Arturo knows Oliver. Which of Ross and Diana can Arturo reach?", "answer": "Ross", "steps": [ "Arturo knows Kay.", "Kay knows Alexa.", "Alexa knows Jolene.", "Jolene knows Dorian.", "Dorian knows Ross." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Arturo", "Ross", "Jolene", "Erma", "Oliver", "Kay", "Alexa", "Christopher", "Eunice", "Dorian", "Alicia", "Diana", "Ignacio", "Angela", "Lucas", "Christian", "Clement", "Saul", "Blanche", "Alana" ], "edges": [ [ 0, 4 ], [ 0, 8 ], [ 0, 5 ], [ 1, 3 ], [ 2, 9 ], [ 5, 6 ], [ 6, 2 ], [ 9, 1 ], [ 9, 7 ], [ 10, 14 ], [ 10, 18 ], [ 10, 15 ], [ 11, 13 ], [ 12, 19 ], [ 15, 16 ], [ 16, 12 ], [ 19, 11 ], [ 19, 17 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Hayden knows Henry. Otto knows Milo. Brett knows Shaun. Otto knows Gloria. Gloria knows Erwin. Hayden knows Grace. Milo knows Bruce. Otto knows Clay. Shaun knows Clinton. Valerie knows Louise. Fred knows Basil. Grace knows Hal. Shaun knows Hayden. Hal knows Brenda. Basil knows Otto. Basil knows Flora. Bruce knows Conner. Hayden knows Valerie. Which of Otto and Hayden can Fred reach?", "answer": "Otto", "steps": [ "Fred knows Basil.", "Basil knows Otto." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Fred", "Milo", "Clay", "Gloria", "Bruce", "Flora", "Otto", "Erwin", "Conner", "Basil", "Brett", "Grace", "Henry", "Valerie", "Hal", "Clinton", "Hayden", "Louise", "Brenda", "Shaun" ], "edges": [ [ 0, 9 ], [ 1, 4 ], [ 3, 7 ], [ 4, 8 ], [ 6, 2 ], [ 6, 3 ], [ 6, 1 ], [ 9, 5 ], [ 9, 6 ], [ 10, 19 ], [ 11, 14 ], [ 13, 17 ], [ 14, 18 ], [ 16, 12 ], [ 16, 13 ], [ 16, 11 ], [ 19, 15 ], [ 19, 16 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Erin knows Brock. Isabel knows Terry. Trudy knows Gwen. Jameson knows Trudy. Terry knows Mabel. Yolanda knows Hadley. Jacqueline knows Zach. Jacqueline knows Yolanda. Hadley knows Isabel. Russ knows Cody. Hadley knows Erin. Jacqueline knows Rex. Gwen knows Judith. Victor knows Lee. Victor knows Fabian. Jameson knows Russ. Victor knows Brandon. Lee knows Jameson. Which of Trudy and Isabel can Jacqueline reach?", "answer": "Isabel", "steps": [ "Jacqueline knows Yolanda.", "Yolanda knows Hadley.", "Hadley knows Isabel." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Jacqueline", "Mabel", "Terry", "Hadley", "Yolanda", "Rex", "Erin", "Brock", "Zach", "Isabel", "Victor", "Judith", "Gwen", "Jameson", "Lee", "Brandon", "Russ", "Cody", "Fabian", "Trudy" ], "edges": [ [ 0, 5 ], [ 0, 8 ], [ 0, 4 ], [ 2, 1 ], [ 3, 6 ], [ 3, 9 ], [ 4, 3 ], [ 6, 7 ], [ 9, 2 ], [ 10, 15 ], [ 10, 18 ], [ 10, 14 ], [ 12, 11 ], [ 13, 16 ], [ 13, 19 ], [ 14, 13 ], [ 16, 17 ], [ 19, 12 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Vera knows Cassidy. Florence knows Tina. Dean knows Blanche. Celeste knows Magdalena. Kai knows Leo. Brandon knows Faith. Celeste knows Vera. Faith knows Samantha. Dean knows Drake. Virgil knows Brandon. Florence knows Dean. Greg knows Kai. Greg knows Jamie. Kirsten knows Celeste. Brandon knows Sheryl. Blanche knows Greg. Vera knows Virgil. Leigh knows Florence. Which of Virgil and Blanche can Leigh reach?", "answer": "Blanche", "steps": [ "Leigh knows Florence.", "Florence knows Dean.", "Dean knows Blanche." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Leigh", "Blanche", "Kai", "Greg", "Jamie", "Dean", "Leo", "Drake", "Florence", "Tina", "Kirsten", "Virgil", "Faith", "Brandon", "Sheryl", "Vera", "Samantha", "Cassidy", "Celeste", "Magdalena" ], "edges": [ [ 0, 8 ], [ 1, 3 ], [ 2, 6 ], [ 3, 4 ], [ 3, 2 ], [ 5, 1 ], [ 5, 7 ], [ 8, 5 ], [ 8, 9 ], [ 10, 18 ], [ 11, 13 ], [ 12, 16 ], [ 13, 14 ], [ 13, 12 ], [ 15, 11 ], [ 15, 17 ], [ 18, 15 ], [ 18, 19 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Emanuel knows Carol. Andrew knows Ruby. Kennedy knows Fiona. Leroy knows Willis. Carol knows Kirsten. Martin knows Amelia. Saul knows Khashayar. Ruby knows Jamie. Willis knows Earle. Kirsten knows Leroy. Kirsten knows Kennedy. Willis knows Corey. Corey knows Uma. Jamie knows Keith. Khashayar knows Vivian. Amelia knows Saul. Ruby knows Liam. Saul knows Andrew. Which of Uma and Keith can Martin reach?", "answer": "Keith", "steps": [ "Martin knows Amelia.", "Amelia knows Saul.", "Saul knows Andrew.", "Andrew knows Ruby.", "Ruby knows Jamie.", "Jamie knows Keith." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Martin", "Jamie", "Khashayar", "Amelia", "Saul", "Ruby", "Liam", "Andrew", "Keith", "Vivian", "Emanuel", "Corey", "Kennedy", "Carol", "Kirsten", "Willis", "Earle", "Leroy", "Uma", "Fiona" ], "edges": [ [ 0, 3 ], [ 1, 8 ], [ 2, 9 ], [ 3, 4 ], [ 4, 7 ], [ 4, 2 ], [ 5, 6 ], [ 5, 1 ], [ 7, 5 ], [ 10, 13 ], [ 11, 18 ], [ 12, 19 ], [ 13, 14 ], [ 14, 17 ], [ 14, 12 ], [ 15, 16 ], [ 15, 11 ], [ 17, 15 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Riley knows Edith. Lawson knows Edison. Alvin knows Andre. Trina knows Riley. Riley knows Lionel. Iris knows Wendell. Jeanne knows Lawson. Lionel knows Elliot. Lawson knows Leroy. Rick knows Gary. Alvin knows Clara. Wendell knows Peter. Peter knows Gareth. Gary knows Jeanne. Peter knows Rick. Benjamin knows Trina. Janet knows Alvin. Elliot knows Janet. Which of Lionel and Rick can Benjamin reach?", "answer": "Lionel", "steps": [ "Benjamin knows Trina.", "Trina knows Riley.", "Riley knows Lionel." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Benjamin", "Edith", "Janet", "Trina", "Riley", "Andre", "Lionel", "Clara", "Elliot", "Alvin", "Iris", "Gareth", "Jeanne", "Wendell", "Peter", "Edison", "Rick", "Leroy", "Gary", "Lawson" ], "edges": [ [ 0, 3 ], [ 2, 9 ], [ 3, 4 ], [ 4, 1 ], [ 4, 6 ], [ 6, 8 ], [ 8, 2 ], [ 9, 5 ], [ 9, 7 ], [ 10, 13 ], [ 12, 19 ], [ 13, 14 ], [ 14, 11 ], [ 14, 16 ], [ 16, 18 ], [ 18, 12 ], [ 19, 15 ], [ 19, 17 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Rhonda knows Ruth. Daria knows Christian. Christian knows Renee. Morgan knows Dahlia. Marcia knows Ben. Morgan knows Forrest. Oliver knows Morgan. Graeme knows Louise. August knows Emery. Renee knows Graeme. Morgan knows Marcia. Daria knows Brock. Marcia knows Gustavo. Ruth knows Will. Bette knows August. Gustavo knows Bette. Ruth knows Daria. Ruth knows June. Which of Renee and Bette can Rhonda reach?", "answer": "Renee", "steps": [ "Rhonda knows Ruth.", "Ruth knows Daria.", "Daria knows Christian.", "Christian knows Renee." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Rhonda", "Graeme", "Brock", "Christian", "June", "Ruth", "Daria", "Renee", "Will", "Louise", "Oliver", "August", "Ben", "Gustavo", "Dahlia", "Morgan", "Marcia", "Bette", "Forrest", "Emery" ], "edges": [ [ 0, 5 ], [ 1, 9 ], [ 3, 7 ], [ 5, 4 ], [ 5, 8 ], [ 5, 6 ], [ 6, 2 ], [ 6, 3 ], [ 7, 1 ], [ 10, 15 ], [ 11, 19 ], [ 13, 17 ], [ 15, 14 ], [ 15, 18 ], [ 15, 16 ], [ 16, 12 ], [ 16, 13 ], [ 17, 11 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Sierra knows Lucille. Lucille knows Troy. Iris knows Jackson. Jose knows Kit. Sierra knows Clyde. Eli knows Sierra. Iris knows Harriet. Ken knows Xavier. Ken knows Marlene. Jose knows Trevor. Chris knows Iris. Julian knows Jose. Julian knows Cesar. Felicia knows Julian. Lucille knows Amelia. Clay knows Ken. Ken knows Felicia. Iris knows Eli. Which of Felicia and Eli can Clay reach?", "answer": "Felicia", "steps": [ "Clay knows Ken.", "Ken knows Felicia." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Clay", "Xavier", "Trevor", "Kit", "Marlene", "Jose", "Ken", "Julian", "Felicia", "Cesar", "Chris", "Harriet", "Troy", "Amelia", "Jackson", "Lucille", "Iris", "Sierra", "Eli", "Clyde" ], "edges": [ [ 0, 6 ], [ 5, 2 ], [ 5, 3 ], [ 6, 1 ], [ 6, 4 ], [ 6, 8 ], [ 7, 5 ], [ 7, 9 ], [ 8, 7 ], [ 10, 16 ], [ 15, 12 ], [ 15, 13 ], [ 16, 11 ], [ 16, 14 ], [ 16, 18 ], [ 17, 15 ], [ 17, 19 ], [ 18, 17 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Denver knows Cornelius. Damian knows Dewey. Destiny knows Lorraine. Pablo knows Molly. Denver knows Jack. Jordan knows Karina. Reed knows Owen. Destiny knows Jordan. Jordan knows Pablo. Denver knows Haley. Jordan knows Reed. Denver knows Damian. Jack knows Clyde. Keaton knows Shane. Keaton knows Denver. Luella knows Destiny. Paul knows Keaton. Jordan knows Flora. Which of Molly and Dewey can Luella reach?", "answer": "Molly", "steps": [ "Luella knows Destiny.", "Destiny knows Jordan.", "Jordan knows Pablo.", "Pablo knows Molly." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Luella", "Lorraine", "Destiny", "Molly", "Karina", "Jordan", "Reed", "Pablo", "Owen", "Flora", "Paul", "Shane", "Keaton", "Dewey", "Haley", "Denver", "Jack", "Damian", "Clyde", "Cornelius" ], "edges": [ [ 0, 2 ], [ 2, 1 ], [ 2, 5 ], [ 5, 4 ], [ 5, 7 ], [ 5, 6 ], [ 5, 9 ], [ 6, 8 ], [ 7, 3 ], [ 10, 12 ], [ 12, 11 ], [ 12, 15 ], [ 15, 14 ], [ 15, 17 ], [ 15, 16 ], [ 15, 19 ], [ 16, 18 ], [ 17, 13 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Felix knows Mike. Alma knows Harry. Grace knows Enrique. Emily knows Grace. Harry knows Howard. Mike knows Ray. Jerome knows Jakob. Ray knows Todd. Jakob knows Ellis. Kara knows Brody. Mike knows Yasmin. Todd knows Jerome. Lorenzo knows Kara. Brody knows Cruz. Ellis knows Jessica. Enrique knows Lorenzo. Harry knows Emily. Jessica knows Blanche. Which of Jessica and Brody can Felix reach?", "answer": "Jessica", "steps": [ "Felix knows Mike.", "Mike knows Ray.", "Ray knows Todd.", "Todd knows Jerome.", "Jerome knows Jakob.", "Jakob knows Ellis.", "Ellis knows Jessica." ], "difficulty": 7, "original_distance": 8, "idx_to_symbol": [ "Felix", "Blanche", "Mike", "Ray", "Jakob", "Yasmin", "Todd", "Jessica", "Ellis", "Jerome", "Alma", "Cruz", "Harry", "Emily", "Lorenzo", "Howard", "Grace", "Brody", "Kara", "Enrique" ], "edges": [ [ 0, 2 ], [ 2, 5 ], [ 2, 3 ], [ 3, 6 ], [ 4, 8 ], [ 6, 9 ], [ 7, 1 ], [ 8, 7 ], [ 9, 4 ], [ 10, 12 ], [ 12, 15 ], [ 12, 13 ], [ 13, 16 ], [ 14, 18 ], [ 16, 19 ], [ 17, 11 ], [ 18, 17 ], [ 19, 14 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Keegan knows Archer. Magdalena knows Mike. Lisette knows Lily. Derrick knows Foster. Jasmine knows Adele. Gabriel knows Kimberly. Gabriel knows Darrell. Naomi knows Khashayar. Gabriel knows Hal. Lily knows Naomi. Lily knows Keegan. Derrick knows Hendrix. Lily knows Matthew. Kimberly knows Gage. Jasmine knows Lisette. Hendrix knows Gabriel. Archer knows Teresa. Darrell knows Magdalena. Which of Gabriel and Lily can Jasmine reach?", "answer": "Lily", "steps": [ "Jasmine knows Lisette.", "Lisette knows Lily." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Jasmine", "Matthew", "Keegan", "Khashayar", "Lisette", "Teresa", "Naomi", "Archer", "Adele", "Lily", "Derrick", "Hal", "Darrell", "Gage", "Hendrix", "Mike", "Kimberly", "Magdalena", "Foster", "Gabriel" ], "edges": [ [ 0, 8 ], [ 0, 4 ], [ 2, 7 ], [ 4, 9 ], [ 6, 3 ], [ 7, 5 ], [ 9, 1 ], [ 9, 6 ], [ 9, 2 ], [ 10, 18 ], [ 10, 14 ], [ 12, 17 ], [ 14, 19 ], [ 16, 13 ], [ 17, 15 ], [ 19, 11 ], [ 19, 16 ], [ 19, 12 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Gina knows Philip. Cora knows Rhonda. Bart knows Rebecca. Elaine knows Gina. Douglas knows Bart. Tom knows Ted. Randall knows Byron. Philip knows Aspen. Ted knows Elaine. Holden knows Claude. Aspen knows Trevor. Rebecca knows Ivy. Kane knows Tom. Rhonda knows Samantha. Claude knows Kane. Ivy knows Horace. Horace knows Cora. Samantha knows Randall. Which of Rebecca and Kane can Douglas reach?", "answer": "Rebecca", "steps": [ "Douglas knows Bart.", "Bart knows Rebecca." ], "difficulty": 2, "original_distance": 9, "idx_to_symbol": [ "Douglas", "Bart", "Randall", "Cora", "Ivy", "Rhonda", "Byron", "Rebecca", "Samantha", "Horace", "Holden", "Claude", "Aspen", "Elaine", "Tom", "Gina", "Trevor", "Kane", "Philip", "Ted" ], "edges": [ [ 0, 1 ], [ 1, 7 ], [ 2, 6 ], [ 3, 5 ], [ 4, 9 ], [ 5, 8 ], [ 7, 4 ], [ 8, 2 ], [ 9, 3 ], [ 10, 11 ], [ 11, 17 ], [ 12, 16 ], [ 13, 15 ], [ 14, 19 ], [ 15, 18 ], [ 17, 14 ], [ 18, 12 ], [ 19, 13 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Tessa knows Patricia. Tessa knows Camille. Cody knows Declan. Frida knows Joseph. Grant knows Samuel. Itzel knows Grant. Frida knows Travis. Declan knows Lamont. Clifford knows Kara. Joseph knows Ernesto. Samuel knows Cody. Frida knows Lyle. Travis knows Matt. Kara knows Frida. Yvette knows Clifford. Cody knows Demetrius. Cody knows Tessa. Joseph knows Dawn. Which of Lamont and Matt can Yvette reach?", "answer": "Matt", "steps": [ "Yvette knows Clifford.", "Clifford knows Kara.", "Kara knows Frida.", "Frida knows Travis.", "Travis knows Matt." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Yvette", "Clifford", "Joseph", "Matt", "Dawn", "Ernesto", "Frida", "Kara", "Lyle", "Travis", "Itzel", "Grant", "Tessa", "Lamont", "Patricia", "Camille", "Cody", "Samuel", "Demetrius", "Declan" ], "edges": [ [ 0, 1 ], [ 1, 7 ], [ 2, 4 ], [ 2, 5 ], [ 6, 2 ], [ 6, 8 ], [ 6, 9 ], [ 7, 6 ], [ 9, 3 ], [ 10, 11 ], [ 11, 17 ], [ 12, 14 ], [ 12, 15 ], [ 16, 12 ], [ 16, 18 ], [ 16, 19 ], [ 17, 16 ], [ 19, 13 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Carrie knows June. Alfonso knows Bailey. Claude knows Gloria. Gertrude knows Jenna. Carrie knows Gertrude. Rebecca knows Heath. Kane knows Gabriel. Kane knows Rebecca. June knows Alfonso. Kane knows Forrest. Veronica knows Felix. Gabriel knows Claude. Forrest knows Jacob. Gloria knows Ellis. Carrie knows Veronica. Gertrude knows Greg. Bailey knows Dayton. Rebecca knows Jack. Which of Gabriel and June can Kane reach?", "answer": "Gabriel", "steps": [ "Kane knows Gabriel." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Kane", "Jack", "Claude", "Forrest", "Ellis", "Gabriel", "Jacob", "Gloria", "Rebecca", "Heath", "Carrie", "Greg", "Alfonso", "Veronica", "Dayton", "June", "Felix", "Bailey", "Gertrude", "Jenna" ], "edges": [ [ 0, 3 ], [ 0, 5 ], [ 0, 8 ], [ 2, 7 ], [ 3, 6 ], [ 5, 2 ], [ 7, 4 ], [ 8, 1 ], [ 8, 9 ], [ 10, 13 ], [ 10, 15 ], [ 10, 18 ], [ 12, 17 ], [ 13, 16 ], [ 15, 12 ], [ 17, 14 ], [ 18, 11 ], [ 18, 19 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Chase knows Wilson. Langston knows Alan. Langston knows Victor. Percy knows Marcia. Sadie knows Langston. Agnes knows Percy. Veronica knows Chance. Alan knows Chase. Hayley knows Deanna. Ember knows Freya. Hayley knows Veronica. Rufus knows Ember. Victor knows Agnes. Marcia knows Walt. Deanna knows Rufus. Chance knows Wallace. Henry knows Hayley. Freya knows Ethan. Which of Ethan and Walt can Henry reach?", "answer": "Ethan", "steps": [ "Henry knows Hayley.", "Hayley knows Deanna.", "Deanna knows Rufus.", "Rufus knows Ember.", "Ember knows Freya.", "Freya knows Ethan." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Henry", "Rufus", "Freya", "Wallace", "Ethan", "Chance", "Hayley", "Deanna", "Ember", "Veronica", "Sadie", "Agnes", "Marcia", "Wilson", "Walt", "Chase", "Langston", "Victor", "Percy", "Alan" ], "edges": [ [ 0, 6 ], [ 1, 8 ], [ 2, 4 ], [ 5, 3 ], [ 6, 7 ], [ 6, 9 ], [ 7, 1 ], [ 8, 2 ], [ 9, 5 ], [ 10, 16 ], [ 11, 18 ], [ 12, 14 ], [ 15, 13 ], [ 16, 17 ], [ 16, 19 ], [ 17, 11 ], [ 18, 12 ], [ 19, 15 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Dorothy knows Chad. Joan knows Ken. Alan knows Arlene. Ken knows Cordelia. Aurora knows Dorothy. Elvira knows Kylie. Elvira knows Guillermo. Alan knows Cameron. Brooks knows Elvira. Leah knows Kobe. Cordelia knows Keith. Alan knows Brooks. Guillermo knows Leah. Ken knows Jesse. Kara knows Alan. Dorothy knows Cruz. Dorothy knows Joan. Keith knows Dee. Which of Cordelia and Guillermo can Kara reach?", "answer": "Guillermo", "steps": [ "Kara knows Alan.", "Alan knows Brooks.", "Brooks knows Elvira.", "Elvira knows Guillermo." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Kara", "Arlene", "Guillermo", "Cameron", "Kobe", "Elvira", "Brooks", "Leah", "Alan", "Kylie", "Aurora", "Cruz", "Cordelia", "Chad", "Dee", "Ken", "Joan", "Keith", "Dorothy", "Jesse" ], "edges": [ [ 0, 8 ], [ 2, 7 ], [ 5, 2 ], [ 5, 9 ], [ 6, 5 ], [ 7, 4 ], [ 8, 1 ], [ 8, 3 ], [ 8, 6 ], [ 10, 18 ], [ 12, 17 ], [ 15, 12 ], [ 15, 19 ], [ 16, 15 ], [ 17, 14 ], [ 18, 11 ], [ 18, 13 ], [ 18, 16 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Chantal knows Curtis. Vivian knows James. Sydney knows Don. Don knows Benjamin. Lars knows Sydney. Calvin knows Heidi. Wanda knows Enid. Clinton knows Bruno. Clarissa knows Violet. Kenzie knows Calvin. Violet knows Wanda. Benjamin knows Kenzie. Marcia knows Clarissa. James knows Marcia. Benjamin knows Kent. Bruno knows Vivian. Curtis knows Lars. Clarissa knows Destiny. Which of Vivian and Lars can Chantal reach?", "answer": "Lars", "steps": [ "Chantal knows Curtis.", "Curtis knows Lars." ], "difficulty": 2, "original_distance": 8, "idx_to_symbol": [ "Chantal", "Curtis", "Don", "Kent", "Lars", "Benjamin", "Kenzie", "Sydney", "Calvin", "Heidi", "Clinton", "Bruno", "Marcia", "Destiny", "Vivian", "Clarissa", "Violet", "James", "Wanda", "Enid" ], "edges": [ [ 0, 1 ], [ 1, 4 ], [ 2, 5 ], [ 4, 7 ], [ 5, 3 ], [ 5, 6 ], [ 6, 8 ], [ 7, 2 ], [ 8, 9 ], [ 10, 11 ], [ 11, 14 ], [ 12, 15 ], [ 14, 17 ], [ 15, 13 ], [ 15, 16 ], [ 16, 18 ], [ 17, 12 ], [ 18, 19 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Irene knows Damien. Irene knows Lisa. Damien knows Layla. James knows Cyrus. Blanche knows Irene. Randy knows Frida. Lisa knows Adelaide. Cyrus knows Robin. Frida knows Lucy. Virginia knows Randy. Randy knows James. April knows Blanche. Nadine knows Chantal. Seth knows Lamont. Adelaide knows Grant. Frida knows Nadine. Willis knows Virginia. Damien knows Seth. Which of Randy and Irene can April reach?", "answer": "Irene", "steps": [ "April knows Blanche.", "Blanche knows Irene." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "April", "Irene", "Lisa", "Layla", "Adelaide", "Blanche", "Lamont", "Seth", "Damien", "Grant", "Willis", "Randy", "James", "Lucy", "Cyrus", "Virginia", "Chantal", "Nadine", "Frida", "Robin" ], "edges": [ [ 0, 5 ], [ 1, 8 ], [ 1, 2 ], [ 2, 4 ], [ 4, 9 ], [ 5, 1 ], [ 7, 6 ], [ 8, 3 ], [ 8, 7 ], [ 10, 15 ], [ 11, 18 ], [ 11, 12 ], [ 12, 14 ], [ 14, 19 ], [ 15, 11 ], [ 17, 16 ], [ 18, 13 ], [ 18, 17 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Hattie knows Edgar. Naomi knows Darcy. Haley knows Zara. Hattie knows Denver. Hattie knows Haley. Humphrey knows Jake. Hank knows Joel. Edison knows Pedro. Pedro knows Clayton. Pedro knows Naomi. Naomi knows Hank. Zara knows Arlene. Edgar knows Wesley. Gregory knows Kurt. Edgar knows Gregory. Jake knows Leroy. Pedro knows Humphrey. Marlene knows Hattie. Which of Gregory and Hank can Edison reach?", "answer": "Hank", "steps": [ "Edison knows Pedro.", "Pedro knows Naomi.", "Naomi knows Hank." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Edison", "Clayton", "Naomi", "Hank", "Leroy", "Joel", "Darcy", "Pedro", "Jake", "Humphrey", "Marlene", "Denver", "Edgar", "Gregory", "Arlene", "Kurt", "Wesley", "Hattie", "Zara", "Haley" ], "edges": [ [ 0, 7 ], [ 2, 3 ], [ 2, 6 ], [ 3, 5 ], [ 7, 1 ], [ 7, 2 ], [ 7, 9 ], [ 8, 4 ], [ 9, 8 ], [ 10, 17 ], [ 12, 13 ], [ 12, 16 ], [ 13, 15 ], [ 17, 11 ], [ 17, 12 ], [ 17, 19 ], [ 18, 14 ], [ 19, 18 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "April knows Lynn. Lynn knows Darrell. Elmer knows Darwin. Virginia knows Khashayar. Nancy knows Charity. Virginia knows Jake. April knows Hendrix. Lynn knows Lillian. Arlene knows Deborah. Charity knows Ray. Charity knows Ember. Enrique knows Nancy. Deborah knows April. Ray knows Lois. Jake knows Enrique. Ray knows Autumn. Elmer knows Eldon. Darwin knows Arlene. Which of Enrique and Arlene can Elmer reach?", "answer": "Arlene", "steps": [ "Elmer knows Darwin.", "Darwin knows Arlene." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Elmer", "Deborah", "Lynn", "Arlene", "Darrell", "Lillian", "April", "Hendrix", "Eldon", "Darwin", "Virginia", "Nancy", "Ray", "Enrique", "Autumn", "Lois", "Charity", "Ember", "Khashayar", "Jake" ], "edges": [ [ 0, 8 ], [ 0, 9 ], [ 1, 6 ], [ 2, 4 ], [ 2, 5 ], [ 3, 1 ], [ 6, 2 ], [ 6, 7 ], [ 9, 3 ], [ 10, 18 ], [ 10, 19 ], [ 11, 16 ], [ 12, 14 ], [ 12, 15 ], [ 13, 11 ], [ 16, 12 ], [ 16, 17 ], [ 19, 13 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Dolores knows Lois. Dolores knows Finn. Stella knows Leon. Leon knows Holden. Nash knows Stella. Chantal knows Glen. Ramona knows Fraser. Iris knows Angela. Sydney knows Horace. Horace knows Cora. Finn knows Mara. Finn knows Charlene. Angela knows Fergus. Chantal knows Denver. Denver knows Iris. Lois knows Ramona. Nash knows Chantal. Charlene knows Sydney. Which of Angela and Horace can Dolores reach?", "answer": "Horace", "steps": [ "Dolores knows Finn.", "Finn knows Charlene.", "Charlene knows Sydney.", "Sydney knows Horace." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Dolores", "Fraser", "Finn", "Charlene", "Mara", "Cora", "Sydney", "Lois", "Ramona", "Horace", "Nash", "Holden", "Chantal", "Denver", "Glen", "Fergus", "Iris", "Stella", "Leon", "Angela" ], "edges": [ [ 0, 7 ], [ 0, 2 ], [ 2, 4 ], [ 2, 3 ], [ 3, 6 ], [ 6, 9 ], [ 7, 8 ], [ 8, 1 ], [ 9, 5 ], [ 10, 17 ], [ 10, 12 ], [ 12, 14 ], [ 12, 13 ], [ 13, 16 ], [ 16, 19 ], [ 17, 18 ], [ 18, 11 ], [ 19, 15 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Lena knows Clarence. Wanda knows Hattie. Lucia knows Ella. Javier knows Wanda. Sadie knows Adele. Jim knows Sadie. Adele knows Clara. Norma knows Miriam. Sadie knows Norma. Miriam knows Noah. Lucia knows Daphne. Wanda knows Latoya. Cain knows Lucia. Miriam knows Lena. Adele knows Susan. Ken knows Javier. Javier knows Cain. Daphne knows Fabian. Which of Lucia and Miriam can Jim reach?", "answer": "Miriam", "steps": [ "Jim knows Sadie.", "Sadie knows Norma.", "Norma knows Miriam." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Jim", "Clara", "Sadie", "Noah", "Susan", "Miriam", "Norma", "Lena", "Adele", "Clarence", "Ken", "Latoya", "Javier", "Ella", "Hattie", "Lucia", "Cain", "Daphne", "Wanda", "Fabian" ], "edges": [ [ 0, 2 ], [ 2, 8 ], [ 2, 6 ], [ 5, 3 ], [ 5, 7 ], [ 6, 5 ], [ 7, 9 ], [ 8, 1 ], [ 8, 4 ], [ 10, 12 ], [ 12, 18 ], [ 12, 16 ], [ 15, 13 ], [ 15, 17 ], [ 16, 15 ], [ 17, 19 ], [ 18, 11 ], [ 18, 14 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Axel knows Clayton. Clayton knows Max. Clayton knows Wanda. Glenda knows Jackson. Faith knows Dorothy. Faith knows Colleen. Jackson knows Faith. Ivy knows Priscilla. Priscilla knows Elaine. Dana knows Amanda. Ivy knows Eleanor. Dana knows Geoffrey. Geoffrey knows Jennifer. Jennifer knows Madeline. Wanda knows Dana. Elaine knows Crystal. Benjamin knows Axel. Dorothy knows Ivy. Which of Priscilla and Geoffrey can Glenda reach?", "answer": "Priscilla", "steps": [ "Glenda knows Jackson.", "Jackson knows Faith.", "Faith knows Dorothy.", "Dorothy knows Ivy.", "Ivy knows Priscilla." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Glenda", "Colleen", "Eleanor", "Ivy", "Elaine", "Dorothy", "Jackson", "Priscilla", "Faith", "Crystal", "Benjamin", "Max", "Amanda", "Dana", "Jennifer", "Wanda", "Axel", "Geoffrey", "Clayton", "Madeline" ], "edges": [ [ 0, 6 ], [ 3, 2 ], [ 3, 7 ], [ 4, 9 ], [ 5, 3 ], [ 6, 8 ], [ 7, 4 ], [ 8, 1 ], [ 8, 5 ], [ 10, 16 ], [ 13, 12 ], [ 13, 17 ], [ 14, 19 ], [ 15, 13 ], [ 16, 18 ], [ 17, 14 ], [ 18, 11 ], [ 18, 15 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Gunnar knows Sebastian. Alyson knows Gunnar. Alyson knows Clarissa. Zack knows Alyson. Arthur knows Latoya. Finn knows Zack. Lillian knows Wendy. Keegan knows Destiny. Lenora knows Susanne. Keegan knows Sean. Arthur knows Felix. Julia knows Finn. Lillian knows Tracy. Wendy knows Seth. Susanne knows Graham. Graham knows Lillian. Alyson knows Arthur. Lillian knows Keegan. Which of Arthur and Keegan can Julia reach?", "answer": "Arthur", "steps": [ "Julia knows Finn.", "Finn knows Zack.", "Zack knows Alyson.", "Alyson knows Arthur." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Julia", "Gunnar", "Sebastian", "Zack", "Latoya", "Clarissa", "Arthur", "Finn", "Alyson", "Felix", "Lenora", "Wendy", "Seth", "Graham", "Destiny", "Tracy", "Keegan", "Susanne", "Lillian", "Sean" ], "edges": [ [ 0, 7 ], [ 1, 2 ], [ 3, 8 ], [ 6, 4 ], [ 6, 9 ], [ 7, 3 ], [ 8, 1 ], [ 8, 5 ], [ 8, 6 ], [ 10, 17 ], [ 11, 12 ], [ 13, 18 ], [ 16, 14 ], [ 16, 19 ], [ 17, 13 ], [ 18, 11 ], [ 18, 15 ], [ 18, 16 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "April knows Diane. Damian knows Xavier. Fergus knows April. Clyde knows Pauline. Andrea knows Desmond. Coral knows Damian. Desmond knows Fergus. Andrea knows Graham. Diane knows Tracy. Damian knows Miriam. Diane knows Blair. Elodie knows Sally. Xavier knows Elodie. Justine knows Andrea. Fergus knows Faith. Pauline knows Coral. Elodie knows Monica. Pauline knows Declan. Which of Tracy and Sally can Justine reach?", "answer": "Tracy", "steps": [ "Justine knows Andrea.", "Andrea knows Desmond.", "Desmond knows Fergus.", "Fergus knows April.", "April knows Diane.", "Diane knows Tracy." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Justine", "Blair", "Andrea", "April", "Desmond", "Faith", "Tracy", "Graham", "Diane", "Fergus", "Clyde", "Monica", "Pauline", "Xavier", "Coral", "Miriam", "Sally", "Declan", "Elodie", "Damian" ], "edges": [ [ 0, 2 ], [ 2, 7 ], [ 2, 4 ], [ 3, 8 ], [ 4, 9 ], [ 8, 1 ], [ 8, 6 ], [ 9, 5 ], [ 9, 3 ], [ 10, 12 ], [ 12, 17 ], [ 12, 14 ], [ 13, 18 ], [ 14, 19 ], [ 18, 11 ], [ 18, 16 ], [ 19, 15 ], [ 19, 13 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Carter knows Byron. Elise knows Sidney. Karina knows Jasmine. Byron knows Peggy. Uma knows Bruno. Carter knows Carl. Austin knows Elise. Angela knows Harvey. Jasmine knows Amelia. Harvey knows Amy. Amy knows Austin. Angela knows Arlene. Amelia knows Viola. Derrick knows Justin. Sidney knows Hal. Sidney knows Uma. Amelia knows Derrick. Peggy knows Karina. Which of Derrick and Uma can Carter reach?", "answer": "Derrick", "steps": [ "Carter knows Byron.", "Byron knows Peggy.", "Peggy knows Karina.", "Karina knows Jasmine.", "Jasmine knows Amelia.", "Amelia knows Derrick." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Carter", "Jasmine", "Byron", "Derrick", "Amelia", "Viola", "Karina", "Justin", "Peggy", "Carl", "Angela", "Elise", "Harvey", "Uma", "Sidney", "Hal", "Austin", "Bruno", "Amy", "Arlene" ], "edges": [ [ 0, 2 ], [ 0, 9 ], [ 1, 4 ], [ 2, 8 ], [ 3, 7 ], [ 4, 5 ], [ 4, 3 ], [ 6, 1 ], [ 8, 6 ], [ 10, 12 ], [ 10, 19 ], [ 11, 14 ], [ 12, 18 ], [ 13, 17 ], [ 14, 15 ], [ 14, 13 ], [ 16, 11 ], [ 18, 16 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Adrian knows Sharon. Sharon knows Julie. August knows Neil. Eric knows Sebastian. Verna knows Simon. Warren knows Stephen. Khashayar knows Kate. Graham knows Clement. Simon knows Ann. Kate knows Bert. Julie knows Khashayar. Kate knows Eric. Simon knows Graham. Warren knows Harvey. Clement knows Warren. Warren knows August. Sharon knows Dee. Kate knows Mara. Which of Sharon and Simon can Adrian reach?", "answer": "Sharon", "steps": [ "Adrian knows Sharon." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Adrian", "Bert", "Dee", "Julie", "Khashayar", "Kate", "Sebastian", "Mara", "Eric", "Sharon", "Verna", "Stephen", "Ann", "Graham", "Clement", "Warren", "Neil", "Harvey", "August", "Simon" ], "edges": [ [ 0, 9 ], [ 3, 4 ], [ 4, 5 ], [ 5, 1 ], [ 5, 7 ], [ 5, 8 ], [ 8, 6 ], [ 9, 2 ], [ 9, 3 ], [ 10, 19 ], [ 13, 14 ], [ 14, 15 ], [ 15, 11 ], [ 15, 17 ], [ 15, 18 ], [ 18, 16 ], [ 19, 12 ], [ 19, 13 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Lucia knows Melody. Celia knows Willard. Melody knows Kareem. Eunice knows Edmund. Jeff knows Winston. Eunice knows Marilyn. Eunice knows Conrad. Cordelia knows Celia. Conrad knows Lucia. Kareem knows Alex. Malcolm knows Chance. Winston knows Charlotte. Edmund knows Malcolm. Leah knows Jeff. Judy knows Cordelia. Willard knows Arden. Leah knows Marcus. Leah knows Judy. Which of Conrad and Judy can Leah reach?", "answer": "Judy", "steps": [ "Leah knows Judy." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Leah", "Jeff", "Winston", "Charlotte", "Marcus", "Judy", "Willard", "Cordelia", "Arden", "Celia", "Eunice", "Edmund", "Malcolm", "Chance", "Marilyn", "Conrad", "Kareem", "Lucia", "Alex", "Melody" ], "edges": [ [ 0, 1 ], [ 0, 4 ], [ 0, 5 ], [ 1, 2 ], [ 2, 3 ], [ 5, 7 ], [ 6, 8 ], [ 7, 9 ], [ 9, 6 ], [ 10, 11 ], [ 10, 14 ], [ 10, 15 ], [ 11, 12 ], [ 12, 13 ], [ 15, 17 ], [ 16, 18 ], [ 17, 19 ], [ 19, 16 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Eileen knows Perry. Eileen knows Julio. Randall knows Cate. Jeff knows Karina. Emmett knows Billy. Eileen knows Griffith. Wyatt knows Lilia. Elijah knows Randall. Griffith knows Jakob. Perry knows Eugene. Itzel knows Hubert. Perry knows Elijah. Emmett knows Wyatt. Jeff knows Emmett. Lilia knows Gwen. Perry knows Luis. Emmett knows Estelle. Jeff knows Itzel. Which of Emmett and Perry can Eileen reach?", "answer": "Perry", "steps": [ "Eileen knows Perry." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Eileen", "Julio", "Luis", "Perry", "Cate", "Eugene", "Elijah", "Randall", "Jakob", "Griffith", "Jeff", "Karina", "Billy", "Emmett", "Gwen", "Estelle", "Wyatt", "Lilia", "Hubert", "Itzel" ], "edges": [ [ 0, 1 ], [ 0, 3 ], [ 0, 9 ], [ 3, 2 ], [ 3, 5 ], [ 3, 6 ], [ 6, 7 ], [ 7, 4 ], [ 9, 8 ], [ 10, 11 ], [ 10, 13 ], [ 10, 19 ], [ 13, 12 ], [ 13, 15 ], [ 13, 16 ], [ 16, 17 ], [ 17, 14 ], [ 19, 18 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Joan knows Donald. Emery knows Neil. Will knows Norman. Will knows Sierra. Donald knows Paige. Milo knows Etta. Jasper knows Leland. Donald knows Emery. Jasper knows Martha. Jude knows Gina. Martha knows Milo. Emery knows Elliot. Elliot knows Sonia. Martha knows Pam. Sierra knows Jasper. Kristin knows Jude. Jude knows Joan. Ignacio knows Will. Which of Will and Jude can Kristin reach?", "answer": "Jude", "steps": [ "Kristin knows Jude." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Kristin", "Gina", "Sonia", "Emery", "Elliot", "Joan", "Jude", "Donald", "Neil", "Paige", "Ignacio", "Norman", "Etta", "Martha", "Milo", "Sierra", "Will", "Jasper", "Pam", "Leland" ], "edges": [ [ 0, 6 ], [ 3, 4 ], [ 3, 8 ], [ 4, 2 ], [ 5, 7 ], [ 6, 1 ], [ 6, 5 ], [ 7, 3 ], [ 7, 9 ], [ 10, 16 ], [ 13, 14 ], [ 13, 18 ], [ 14, 12 ], [ 15, 17 ], [ 16, 11 ], [ 16, 15 ], [ 17, 13 ], [ 17, 19 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Eamon knows Nancy. Keaton knows Mason. Floyd knows Laurel. Eamon knows Carlos. Carlos knows Eve. Frankie knows Dale. Arthur knows Keaton. Floyd knows Joan. Joan knows Edgar. Nancy knows Bart. Keaton knows Floyd. Lilia knows Kendrick. Rocco knows Lilia. Laurel knows Kurt. Carlos knows Rocco. Rocco knows Jessie. Jessie knows Hannah. Arthur knows Frankie. Which of Keaton and Carlos can Eamon reach?", "answer": "Carlos", "steps": [ "Eamon knows Carlos." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Eamon", "Carlos", "Hannah", "Eve", "Rocco", "Nancy", "Jessie", "Lilia", "Bart", "Kendrick", "Arthur", "Keaton", "Kurt", "Mason", "Floyd", "Frankie", "Laurel", "Joan", "Dale", "Edgar" ], "edges": [ [ 0, 5 ], [ 0, 1 ], [ 1, 3 ], [ 1, 4 ], [ 4, 6 ], [ 4, 7 ], [ 5, 8 ], [ 6, 2 ], [ 7, 9 ], [ 10, 15 ], [ 10, 11 ], [ 11, 13 ], [ 11, 14 ], [ 14, 16 ], [ 14, 17 ], [ 15, 18 ], [ 16, 12 ], [ 17, 19 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "April knows Diane. Damian knows Xavier. Fergus knows April. Clyde knows Pauline. Andrea knows Desmond. Coral knows Damian. Desmond knows Fergus. Andrea knows Graham. Diane knows Tracy. Damian knows Miriam. Diane knows Blair. Elodie knows Sally. Xavier knows Elodie. Justine knows Andrea. Fergus knows Faith. Pauline knows Coral. Elodie knows Monica. Pauline knows Declan. Which of Xavier and April can Justine reach?", "answer": "April", "steps": [ "Justine knows Andrea.", "Andrea knows Desmond.", "Desmond knows Fergus.", "Fergus knows April." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Justine", "Blair", "Andrea", "April", "Desmond", "Faith", "Tracy", "Graham", "Diane", "Fergus", "Clyde", "Monica", "Pauline", "Xavier", "Coral", "Miriam", "Sally", "Declan", "Elodie", "Damian" ], "edges": [ [ 0, 2 ], [ 2, 7 ], [ 2, 4 ], [ 3, 8 ], [ 4, 9 ], [ 8, 1 ], [ 8, 6 ], [ 9, 5 ], [ 9, 3 ], [ 10, 12 ], [ 12, 17 ], [ 12, 14 ], [ 13, 18 ], [ 14, 19 ], [ 18, 11 ], [ 18, 16 ], [ 19, 15 ], [ 19, 13 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Matt knows Christopher. Porter knows Clarence. Selena knows Conrad. Porter knows Amanda. Alyssa knows Julian. Earle knows Delilah. Daisy knows Linda. Delilah knows Hope. Isabel knows Nash. Alyssa knows Matt. Matt knows Selena. Julian knows Merle. Amanda knows Lawrence. Clarence knows Daisy. Christopher knows Earle. Isabel knows Porter. Nash knows Yolanda. Linda knows Mack. Which of Clarence and Christopher can Isabel reach?", "answer": "Clarence", "steps": [ "Isabel knows Porter.", "Porter knows Clarence." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Isabel", "Lawrence", "Yolanda", "Porter", "Clarence", "Daisy", "Nash", "Linda", "Mack", "Amanda", "Alyssa", "Conrad", "Merle", "Matt", "Christopher", "Earle", "Julian", "Delilah", "Hope", "Selena" ], "edges": [ [ 0, 6 ], [ 0, 3 ], [ 3, 4 ], [ 3, 9 ], [ 4, 5 ], [ 5, 7 ], [ 6, 2 ], [ 7, 8 ], [ 9, 1 ], [ 10, 16 ], [ 10, 13 ], [ 13, 14 ], [ 13, 19 ], [ 14, 15 ], [ 15, 17 ], [ 16, 12 ], [ 17, 18 ], [ 19, 11 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Erwin knows Cole. Trudy knows Pauline. Kristina knows Dean. Warren knows Trudy. Benjamin knows Karina. Karina knows Lucia. Warren knows Lola. Kristina knows Estella. Estella knows Evan. Warren knows Jacob. Jacob knows Doug. Lola knows Douglas. Erwin knows Kristina. Kristina knows Neville. Neville knows Jane. Ann knows Erwin. Karina knows Warren. Dean knows Olive. Which of Erwin and Karina can Benjamin reach?", "answer": "Karina", "steps": [ "Benjamin knows Karina." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Benjamin", "Karina", "Jacob", "Pauline", "Doug", "Trudy", "Warren", "Douglas", "Lola", "Lucia", "Ann", "Erwin", "Neville", "Olive", "Jane", "Dean", "Kristina", "Evan", "Estella", "Cole" ], "edges": [ [ 0, 1 ], [ 1, 6 ], [ 1, 9 ], [ 2, 4 ], [ 5, 3 ], [ 6, 2 ], [ 6, 5 ], [ 6, 8 ], [ 8, 7 ], [ 10, 11 ], [ 11, 16 ], [ 11, 19 ], [ 12, 14 ], [ 15, 13 ], [ 16, 12 ], [ 16, 15 ], [ 16, 18 ], [ 18, 17 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Cody knows Alyssa. Veronica knows Marie. Julio knows Eugene. Randall knows Julio. Calvin knows Jennifer. Eugene knows Cody. Julio knows Chloe. Shane knows Daniella. Shane knows Herman. Jennifer knows Lionel. Jeffery knows Giselle. Herman knows Dwight. Marie knows Calvin. Estelle knows Veronica. Calvin knows Verna. Ross knows Jeffery. Chloe knows Shane. Veronica knows Ross. Which of Chloe and Marie can Randall reach?", "answer": "Chloe", "steps": [ "Randall knows Julio.", "Julio knows Chloe." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Randall", "Daniella", "Dwight", "Herman", "Chloe", "Alyssa", "Julio", "Cody", "Eugene", "Shane", "Estelle", "Verna", "Lionel", "Jennifer", "Marie", "Giselle", "Veronica", "Jeffery", "Ross", "Calvin" ], "edges": [ [ 0, 6 ], [ 3, 2 ], [ 4, 9 ], [ 6, 8 ], [ 6, 4 ], [ 7, 5 ], [ 8, 7 ], [ 9, 1 ], [ 9, 3 ], [ 10, 16 ], [ 13, 12 ], [ 14, 19 ], [ 16, 18 ], [ 16, 14 ], [ 17, 15 ], [ 18, 17 ], [ 19, 11 ], [ 19, 13 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Hadley knows Sandy. Brooks knows Brody. Nancy knows Gladys. Brooks knows Frankie. Celia knows Brooks. Sandy knows Hendrix. Bert knows Beatrice. Brody knows Geneva. Nancy knows Gus. Nancy knows Sebastian. Beatrice knows Nancy. Frankie knows Hadley. Eunice knows Martha. Martha knows Finn. Brody knows Logan. Brody knows Colby. Beatrice knows Amanda. Amanda knows Eunice. Which of Amanda and Frankie can Celia reach?", "answer": "Frankie", "steps": [ "Celia knows Brooks.", "Brooks knows Frankie." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Celia", "Frankie", "Logan", "Geneva", "Hadley", "Brody", "Sandy", "Hendrix", "Brooks", "Colby", "Bert", "Amanda", "Gus", "Gladys", "Eunice", "Nancy", "Martha", "Finn", "Beatrice", "Sebastian" ], "edges": [ [ 0, 8 ], [ 1, 4 ], [ 4, 6 ], [ 5, 2 ], [ 5, 3 ], [ 5, 9 ], [ 6, 7 ], [ 8, 1 ], [ 8, 5 ], [ 10, 18 ], [ 11, 14 ], [ 14, 16 ], [ 15, 12 ], [ 15, 13 ], [ 15, 19 ], [ 16, 17 ], [ 18, 11 ], [ 18, 15 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Earl knows Clement. Joan knows Belinda. Roger knows Isiah. Jessica knows Deborah. Simon knows Landon. Russ knows Jessica. Gage knows Joan. Dewey knows Teresa. Belinda knows Tanya. Isiah knows Jules. Landon knows Russ. Abel knows Gus. Joan knows Abel. Gus knows Jenny. Gus knows Roger. Landon knows Andre. Teresa knows Earl. Teresa knows Simon. Which of Isiah and Jessica can Gage reach?", "answer": "Isiah", "steps": [ "Gage knows Joan.", "Joan knows Abel.", "Abel knows Gus.", "Gus knows Roger.", "Roger knows Isiah." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Gage", "Joan", "Abel", "Jenny", "Roger", "Jules", "Isiah", "Gus", "Tanya", "Belinda", "Dewey", "Teresa", "Simon", "Andre", "Russ", "Deborah", "Jessica", "Landon", "Clement", "Earl" ], "edges": [ [ 0, 1 ], [ 1, 2 ], [ 1, 9 ], [ 2, 7 ], [ 4, 6 ], [ 6, 5 ], [ 7, 3 ], [ 7, 4 ], [ 9, 8 ], [ 10, 11 ], [ 11, 12 ], [ 11, 19 ], [ 12, 17 ], [ 14, 16 ], [ 16, 15 ], [ 17, 13 ], [ 17, 14 ], [ 19, 18 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Priscilla knows Katherine. Gemma knows Linda. Jay knows Willard. Annette knows Fergus. Myrtle knows Cesar. Eleanor knows Finn. Katherine knows Annette. Annette knows Myrtle. Veronica knows Tim. Tim knows Gemma. Veronica knows Kenneth. Luis knows Priscilla. Linda knows Eleanor. Kenneth knows Dolores. Luis knows Jay. India knows Angelica. Linda knows India. Fergus knows Charles. Which of Myrtle and Eleanor can Veronica reach?", "answer": "Eleanor", "steps": [ "Veronica knows Tim.", "Tim knows Gemma.", "Gemma knows Linda.", "Linda knows Eleanor." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Veronica", "Tim", "Gemma", "India", "Linda", "Eleanor", "Angelica", "Kenneth", "Finn", "Dolores", "Luis", "Priscilla", "Katherine", "Fergus", "Annette", "Myrtle", "Charles", "Jay", "Cesar", "Willard" ], "edges": [ [ 0, 1 ], [ 0, 7 ], [ 1, 2 ], [ 2, 4 ], [ 3, 6 ], [ 4, 3 ], [ 4, 5 ], [ 5, 8 ], [ 7, 9 ], [ 10, 11 ], [ 10, 17 ], [ 11, 12 ], [ 12, 14 ], [ 13, 16 ], [ 14, 13 ], [ 14, 15 ], [ 15, 18 ], [ 17, 19 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Judith knows Pearl. Tessa knows Ernesto. Diane knows Anastasia. Helen knows Heath. Jared knows Tessa. Elodie knows Chance. Jared knows Doris. Jared knows Gunnar. Gunnar knows Celeste. Denver knows James. Chance knows Judith. Pearl knows Diane. Heath knows Dina. Chance knows Charity. Heath knows Levi. Levi knows Jared. Pearl knows Jessie. Pearl knows Denver. Which of Heath and Chance can Helen reach?", "answer": "Heath", "steps": [ "Helen knows Heath." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Helen", "Gunnar", "Levi", "Doris", "Heath", "Jared", "Ernesto", "Celeste", "Tessa", "Dina", "Elodie", "Diane", "Judith", "Jessie", "Chance", "Pearl", "James", "Anastasia", "Denver", "Charity" ], "edges": [ [ 0, 4 ], [ 1, 7 ], [ 2, 5 ], [ 4, 2 ], [ 4, 9 ], [ 5, 3 ], [ 5, 1 ], [ 5, 8 ], [ 8, 6 ], [ 10, 14 ], [ 11, 17 ], [ 12, 15 ], [ 14, 12 ], [ 14, 19 ], [ 15, 13 ], [ 15, 11 ], [ 15, 18 ], [ 18, 16 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Marie knows Patrick. Mabel knows Donald. Clyde knows Marie. Carmen knows Mabel. Allison knows Carmen. Harmony knows Allison. Harriet knows Giselle. Kara knows Harriet. Yvette knows Kara. Kara knows Dawn. Carmen knows Keaton. Evan knows Yvette. Sierra knows Harmony. Harriet knows Clyde. Carmen knows Kamila. Allison knows Jill. Donald knows Jillian. Harriet knows Derrick. Which of Harmony and Yvette can Sierra reach?", "answer": "Harmony", "steps": [ "Sierra knows Harmony." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Sierra", "Keaton", "Donald", "Jill", "Mabel", "Carmen", "Kamila", "Allison", "Jillian", "Harmony", "Evan", "Giselle", "Marie", "Dawn", "Clyde", "Harriet", "Derrick", "Kara", "Patrick", "Yvette" ], "edges": [ [ 0, 9 ], [ 2, 8 ], [ 4, 2 ], [ 5, 1 ], [ 5, 6 ], [ 5, 4 ], [ 7, 3 ], [ 7, 5 ], [ 9, 7 ], [ 10, 19 ], [ 12, 18 ], [ 14, 12 ], [ 15, 11 ], [ 15, 16 ], [ 15, 14 ], [ 17, 13 ], [ 17, 15 ], [ 19, 17 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Alfonso knows Eric. Shane knows Elton. Katherine knows Hal. Joanna knows David. Carter knows Gustavo. Alfonso knows Shane. Hudson knows Leon. Jordan knows Virginia. Leon knows Dane. Hal knows Alfonso. Alfonso knows Hayes. Hayes knows Lark. Virginia knows Laura. Virginia knows Carter. Laura knows Raquel. Eric knows Joanna. Virginia knows Hudson. Anastasia knows Jordan. Which of Hal and Jordan can Katherine reach?", "answer": "Hal", "steps": [ "Katherine knows Hal." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Katherine", "Eric", "Hayes", "Shane", "David", "Hal", "Alfonso", "Joanna", "Elton", "Lark", "Anastasia", "Hudson", "Carter", "Laura", "Dane", "Jordan", "Virginia", "Leon", "Raquel", "Gustavo" ], "edges": [ [ 0, 5 ], [ 1, 7 ], [ 2, 9 ], [ 3, 8 ], [ 5, 6 ], [ 6, 1 ], [ 6, 3 ], [ 6, 2 ], [ 7, 4 ], [ 10, 15 ], [ 11, 17 ], [ 12, 19 ], [ 13, 18 ], [ 15, 16 ], [ 16, 11 ], [ 16, 13 ], [ 16, 12 ], [ 17, 14 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Irma knows Declan. Elena knows Dirk. Jim knows Vivian. Rufus knows Erik. Erik knows Jillian. Percy knows Lillian. Martin knows Michael. Simon knows Anita. Declan knows Carla. Lillian knows Elena. Carla knows Rufus. Rufus knows Jamie. Anita knows Cora. Percy knows Simon. Vivian knows Esperanza. Irma knows Jim. Dirk knows Cameron. Dirk knows Martin. Which of Declan and Lillian can Irma reach?", "answer": "Declan", "steps": [ "Irma knows Declan." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Irma", "Esperanza", "Carla", "Jamie", "Erik", "Jim", "Jillian", "Rufus", "Vivian", "Declan", "Percy", "Cora", "Elena", "Cameron", "Martin", "Simon", "Michael", "Dirk", "Anita", "Lillian" ], "edges": [ [ 0, 5 ], [ 0, 9 ], [ 2, 7 ], [ 4, 6 ], [ 5, 8 ], [ 7, 3 ], [ 7, 4 ], [ 8, 1 ], [ 9, 2 ], [ 10, 15 ], [ 10, 19 ], [ 12, 17 ], [ 14, 16 ], [ 15, 18 ], [ 17, 13 ], [ 17, 14 ], [ 18, 11 ], [ 19, 12 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Dolores knows Walter. Theodore knows Crystal. Yvette knows Verna. Dolores knows Daisy. Hope knows Theodore. Tessa knows Carson. Theodore knows Dolores. Helene knows Willis. Carson knows Gary. Yvette knows Jesse. Tessa knows Cassidy. Randall knows Deborah. Carson knows Jill. Jem knows Tessa. Dolores knows Randall. Carson knows Yvette. Jesse knows Hannah. Randall knows Helene. Which of Carson and Dolores can Jem reach?", "answer": "Carson", "steps": [ "Jem knows Tessa.", "Tessa knows Carson." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Jem", "Jesse", "Jill", "Hannah", "Tessa", "Carson", "Verna", "Gary", "Cassidy", "Yvette", "Hope", "Helene", "Walter", "Willis", "Theodore", "Dolores", "Deborah", "Daisy", "Crystal", "Randall" ], "edges": [ [ 0, 4 ], [ 1, 3 ], [ 4, 8 ], [ 4, 5 ], [ 5, 2 ], [ 5, 7 ], [ 5, 9 ], [ 9, 1 ], [ 9, 6 ], [ 10, 14 ], [ 11, 13 ], [ 14, 18 ], [ 14, 15 ], [ 15, 12 ], [ 15, 17 ], [ 15, 19 ], [ 19, 11 ], [ 19, 16 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Keaton knows Elizabeth. Morris knows Maude. Constance knows Michelle. Morris knows Leopold. Michelle knows Keaton. Wade knows Celeste. Constance knows Carey. Celeste knows Isadora. Celeste knows Daniel. Celeste knows Lucille. Keaton knows Morris. Daniel knows Katrina. Katrina knows Victor. Katrina knows Farrah. Constance knows Patrick. Victor knows Elena. Bernadette knows Constance. Victor knows Seth. Which of Victor and Morris can Bernadette reach?", "answer": "Morris", "steps": [ "Bernadette knows Constance.", "Constance knows Michelle.", "Michelle knows Keaton.", "Keaton knows Morris." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Bernadette", "Morris", "Keaton", "Constance", "Leopold", "Michelle", "Patrick", "Maude", "Carey", "Elizabeth", "Wade", "Victor", "Katrina", "Celeste", "Elena", "Daniel", "Isadora", "Seth", "Lucille", "Farrah" ], "edges": [ [ 0, 3 ], [ 1, 4 ], [ 1, 7 ], [ 2, 1 ], [ 2, 9 ], [ 3, 6 ], [ 3, 8 ], [ 3, 5 ], [ 5, 2 ], [ 10, 13 ], [ 11, 14 ], [ 11, 17 ], [ 12, 11 ], [ 12, 19 ], [ 13, 16 ], [ 13, 18 ], [ 13, 15 ], [ 15, 12 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Elijah knows Pablo. Boris knows Ida. Lois knows Odette. Odette knows Boris. Julia knows Antonio. Diana knows Fernando. Pablo knows Ruth. Foster knows Elijah. Lois knows Jude. Antonio knows Inez. Kirsten knows Lois. Diana knows Ember. Fernando knows Foster. Elizabeth knows Rena. Jude knows Elizabeth. Isaac knows Kirsten. Foster knows Julia. Isaac knows Kenzie. Which of Rena and Inez can Diana reach?", "answer": "Inez", "steps": [ "Diana knows Fernando.", "Fernando knows Foster.", "Foster knows Julia.", "Julia knows Antonio.", "Antonio knows Inez." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Diana", "Ember", "Fernando", "Elijah", "Ruth", "Foster", "Pablo", "Inez", "Julia", "Antonio", "Isaac", "Kenzie", "Kirsten", "Odette", "Ida", "Lois", "Boris", "Rena", "Jude", "Elizabeth" ], "edges": [ [ 0, 1 ], [ 0, 2 ], [ 2, 5 ], [ 3, 6 ], [ 5, 3 ], [ 5, 8 ], [ 6, 4 ], [ 8, 9 ], [ 9, 7 ], [ 10, 11 ], [ 10, 12 ], [ 12, 15 ], [ 13, 16 ], [ 15, 13 ], [ 15, 18 ], [ 16, 14 ], [ 18, 19 ], [ 19, 17 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Deborah knows Pierce. Brett knows Ivan. Walter knows Selena. Darcy knows Deborah. Brett knows Walter. Darrell knows Jolene. Jermaine knows Colin. Brett knows Jermaine. Kay knows Ralph. Ralph knows Andrew. Ralph knows Clay. Ralph knows Camden. Laverne knows Brett. Andrew knows Sheryl. Selena knows Liam. Clay knows Darcy. Pierce knows Ignacio. Liam knows Darrell. Which of Ralph and Brett can Kay reach?", "answer": "Ralph", "steps": [ "Kay knows Ralph." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Kay", "Darcy", "Sheryl", "Camden", "Andrew", "Clay", "Deborah", "Ralph", "Pierce", "Ignacio", "Laverne", "Selena", "Colin", "Ivan", "Jermaine", "Walter", "Liam", "Brett", "Darrell", "Jolene" ], "edges": [ [ 0, 7 ], [ 1, 6 ], [ 4, 2 ], [ 5, 1 ], [ 6, 8 ], [ 7, 3 ], [ 7, 4 ], [ 7, 5 ], [ 8, 9 ], [ 10, 17 ], [ 11, 16 ], [ 14, 12 ], [ 15, 11 ], [ 16, 18 ], [ 17, 13 ], [ 17, 14 ], [ 17, 15 ], [ 18, 19 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Zach knows Jeffery. Magdalena knows Hattie. Myrtle knows Gregory. Myrtle knows Elmer. Goldie knows Electra. Matt knows James. James knows Myrtle. Matt knows Tamara. Clarence knows Deborah. Clarence knows Henrietta. Ernesto knows Clarence. Dave knows Magdalena. Myrtle knows Goldie. Zach knows Ernesto. Ebony knows Leticia. Goldie knows Ebony. Clarence knows Dave. Dave knows Fred. Which of Ernesto and James can Matt reach?", "answer": "James", "steps": [ "Matt knows James." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Matt", "Goldie", "James", "Tamara", "Gregory", "Elmer", "Myrtle", "Ebony", "Electra", "Leticia", "Zach", "Dave", "Ernesto", "Jeffery", "Henrietta", "Deborah", "Clarence", "Magdalena", "Fred", "Hattie" ], "edges": [ [ 0, 3 ], [ 0, 2 ], [ 1, 8 ], [ 1, 7 ], [ 2, 6 ], [ 6, 4 ], [ 6, 5 ], [ 6, 1 ], [ 7, 9 ], [ 10, 13 ], [ 10, 12 ], [ 11, 18 ], [ 11, 17 ], [ 12, 16 ], [ 16, 14 ], [ 16, 15 ], [ 16, 11 ], [ 17, 19 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Hugh knows Archer. Archer knows Yuki. Harriet knows Dexter. Harriet knows Don. Blake knows Bennett. Troy knows Stella. Bennett knows Harriet. Brock knows Hazel. Khashayar knows Blake. Bennett knows Troy. Vernon knows Beverly. Yuki knows Brock. Delilah knows Samuel. Patrick knows Kate. Dexter knows Patrick. Vernon knows Charles. Yuki knows Vernon. Beverly knows Delilah. Which of Delilah and Patrick can Khashayar reach?", "answer": "Patrick", "steps": [ "Khashayar knows Blake.", "Blake knows Bennett.", "Bennett knows Harriet.", "Harriet knows Dexter.", "Dexter knows Patrick." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Khashayar", "Blake", "Harriet", "Bennett", "Patrick", "Kate", "Don", "Troy", "Dexter", "Stella", "Hugh", "Archer", "Vernon", "Yuki", "Delilah", "Samuel", "Charles", "Brock", "Beverly", "Hazel" ], "edges": [ [ 0, 1 ], [ 1, 3 ], [ 2, 6 ], [ 2, 8 ], [ 3, 2 ], [ 3, 7 ], [ 4, 5 ], [ 7, 9 ], [ 8, 4 ], [ 10, 11 ], [ 11, 13 ], [ 12, 16 ], [ 12, 18 ], [ 13, 12 ], [ 13, 17 ], [ 14, 15 ], [ 17, 19 ], [ 18, 14 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Ariana knows Rhea. Destiny knows Peggy. Keith knows Gideon. Will knows Lyric. Heath knows Virginia. Ember knows Jerome. Viola knows Heath. Heath knows Will. Destiny knows Margaret. Destiny knows Blair. Blaine knows Ariana. Gideon knows Destiny. Rhea knows Viola. Heath knows Abigail. Jerome knows Keith. Peggy knows Erwin. Peggy knows Tony. Will knows Nicole. Which of Lyric and Tony can Ember reach?", "answer": "Tony", "steps": [ "Ember knows Jerome.", "Jerome knows Keith.", "Keith knows Gideon.", "Gideon knows Destiny.", "Destiny knows Peggy.", "Peggy knows Tony." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Ember", "Erwin", "Tony", "Blair", "Jerome", "Gideon", "Peggy", "Destiny", "Keith", "Margaret", "Blaine", "Nicole", "Lyric", "Abigail", "Ariana", "Viola", "Will", "Heath", "Rhea", "Virginia" ], "edges": [ [ 0, 4 ], [ 4, 8 ], [ 5, 7 ], [ 6, 1 ], [ 6, 2 ], [ 7, 3 ], [ 7, 6 ], [ 7, 9 ], [ 8, 5 ], [ 10, 14 ], [ 14, 18 ], [ 15, 17 ], [ 16, 11 ], [ 16, 12 ], [ 17, 13 ], [ 17, 16 ], [ 17, 19 ], [ 18, 15 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Jeffery knows Keegan. John knows Dexter. Adrian knows Max. Eugenia knows John. Sarah knows Shelly. Milton knows Crystal. Crystal knows Paula. Max knows Darren. Holly knows Shaun. Keegan knows Gail. Dexter knows Milton. Gail knows Eugenia. Shaun knows Curtis. Darren knows Sarah. Shelly knows Carl. Curtis knows Adrian. Jeffery knows Chelsea. Holly knows Neal. Which of Gail and Curtis can Holly reach?", "answer": "Curtis", "steps": [ "Holly knows Shaun.", "Shaun knows Curtis." ], "difficulty": 2, "original_distance": 8, "idx_to_symbol": [ "Holly", "Adrian", "Shaun", "Carl", "Max", "Shelly", "Curtis", "Darren", "Neal", "Sarah", "Jeffery", "Eugenia", "Keegan", "Paula", "John", "Crystal", "Gail", "Dexter", "Chelsea", "Milton" ], "edges": [ [ 0, 8 ], [ 0, 2 ], [ 1, 4 ], [ 2, 6 ], [ 4, 7 ], [ 5, 3 ], [ 6, 1 ], [ 7, 9 ], [ 9, 5 ], [ 10, 18 ], [ 10, 12 ], [ 11, 14 ], [ 12, 16 ], [ 14, 17 ], [ 15, 13 ], [ 16, 11 ], [ 17, 19 ], [ 19, 15 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Anastasia knows Amanda. Hailey knows Pauline. Jaime knows Dorian. Brooke knows Hailey. Pauline knows Dave. Dave knows Adele. Carrie knows Geneva. Brooke knows Ernest. Carrie knows Ibrahim. Anastasia knows Hudson. Hudson knows Carrie. Pauline knows Pablo. Lauren knows Anastasia. Dorian knows Lionel. Dorian knows Brooke. Jamie knows Lauren. Ibrahim knows Kirsten. Lauren knows Owen. Which of Ibrahim and Dave can Jamie reach?", "answer": "Ibrahim", "steps": [ "Jamie knows Lauren.", "Lauren knows Anastasia.", "Anastasia knows Hudson.", "Hudson knows Carrie.", "Carrie knows Ibrahim." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Jamie", "Amanda", "Lauren", "Geneva", "Carrie", "Anastasia", "Hudson", "Owen", "Kirsten", "Ibrahim", "Jaime", "Ernest", "Dorian", "Pablo", "Pauline", "Brooke", "Hailey", "Lionel", "Adele", "Dave" ], "edges": [ [ 0, 2 ], [ 2, 7 ], [ 2, 5 ], [ 4, 3 ], [ 4, 9 ], [ 5, 1 ], [ 5, 6 ], [ 6, 4 ], [ 9, 8 ], [ 10, 12 ], [ 12, 17 ], [ 12, 15 ], [ 14, 13 ], [ 14, 19 ], [ 15, 11 ], [ 15, 16 ], [ 16, 14 ], [ 19, 18 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Louise knows Melissa. June knows Kira. Lambert knows Ashton. Rachel knows Kingsley. Kira knows Morgan. Roman knows Rachel. Melissa knows Ian. Ian knows William. Cora knows Robin. Kingsley knows Stefan. Madeline knows Heather. Darwin knows June. Leo knows Ida. Louise knows Lambert. Ida knows Madeline. Melissa knows Roman. Leo knows Cora. Ida knows Darwin. Which of June and Rachel can Leo reach?", "answer": "June", "steps": [ "Leo knows Ida.", "Ida knows Darwin.", "Darwin knows June." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Leo", "Kira", "Madeline", "June", "Darwin", "Morgan", "Robin", "Cora", "Heather", "Ida", "Louise", "Kingsley", "Ian", "Rachel", "Roman", "Stefan", "Ashton", "Lambert", "William", "Melissa" ], "edges": [ [ 0, 7 ], [ 0, 9 ], [ 1, 5 ], [ 2, 8 ], [ 3, 1 ], [ 4, 3 ], [ 7, 6 ], [ 9, 4 ], [ 9, 2 ], [ 10, 17 ], [ 10, 19 ], [ 11, 15 ], [ 12, 18 ], [ 13, 11 ], [ 14, 13 ], [ 17, 16 ], [ 19, 14 ], [ 19, 12 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Yara knows Andre. Irene knows Shelly. Ilene knows Barry. Kent knows Ivy. Brenda knows Sean. Andre knows Heidi. Shelly knows June. Felicia knows Tanya. Heidi knows Ilene. Jameson knows Angelica. Sean knows Jameson. Tanya knows Irene. Felicia knows Hamilton. June knows Brad. Ilene knows Ezra. June knows Jude. Jameson knows Yara. Ivy knows Felicia. Which of Ezra and Brad can Kent reach?", "answer": "Brad", "steps": [ "Kent knows Ivy.", "Ivy knows Felicia.", "Felicia knows Tanya.", "Tanya knows Irene.", "Irene knows Shelly.", "Shelly knows June.", "June knows Brad." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Kent", "Shelly", "Irene", "Ivy", "Brad", "Tanya", "June", "Jude", "Felicia", "Hamilton", "Brenda", "Heidi", "Andre", "Sean", "Ezra", "Yara", "Ilene", "Barry", "Jameson", "Angelica" ], "edges": [ [ 0, 3 ], [ 1, 6 ], [ 2, 1 ], [ 3, 8 ], [ 5, 2 ], [ 6, 4 ], [ 6, 7 ], [ 8, 5 ], [ 8, 9 ], [ 10, 13 ], [ 11, 16 ], [ 12, 11 ], [ 13, 18 ], [ 15, 12 ], [ 16, 14 ], [ 16, 17 ], [ 18, 15 ], [ 18, 19 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Jolena knows Hailey. Cyrus knows George. Jennifer knows Kamila. Grady knows Keaton. Regina knows Cyrus. Hardy knows Regina. Virginia knows Marian. Grady knows Jolena. Brian knows Hardy. Brandon knows Virginia. Hailey knows Jennifer. Brandon knows Brian. Cyrus knows Lance. Keaton knows Lena. Kamila knows Clayton. Marian knows Paul. Lena knows Sheryl. Kamila knows Dominic. Which of Cyrus and Kamila can Grady reach?", "answer": "Kamila", "steps": [ "Grady knows Jolena.", "Jolena knows Hailey.", "Hailey knows Jennifer.", "Jennifer knows Kamila." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Grady", "Jolena", "Jennifer", "Lena", "Sheryl", "Dominic", "Keaton", "Clayton", "Hailey", "Kamila", "Brandon", "Brian", "Regina", "Marian", "Paul", "Lance", "Virginia", "George", "Hardy", "Cyrus" ], "edges": [ [ 0, 6 ], [ 0, 1 ], [ 1, 8 ], [ 2, 9 ], [ 3, 4 ], [ 6, 3 ], [ 8, 2 ], [ 9, 5 ], [ 9, 7 ], [ 10, 16 ], [ 10, 11 ], [ 11, 18 ], [ 12, 19 ], [ 13, 14 ], [ 16, 13 ], [ 18, 12 ], [ 19, 15 ], [ 19, 17 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Duncan knows Clarence. Hector knows Kenneth. Clarence knows Holly. Elton knows Essie. Holly knows Florence. Conner knows Rufus. Chase knows Heather. Peggy knows Layla. Jermaine knows Chase. Dudley knows Duncan. Essie knows Megan. Duncan knows Tamara. Rufus knows Peggy. Florence knows Jermaine. Kenneth knows Elton. Randy knows Hector. Rufus knows Randy. Tamara knows Alyssa. Which of Elton and Jermaine can Dudley reach?", "answer": "Jermaine", "steps": [ "Dudley knows Duncan.", "Duncan knows Clarence.", "Clarence knows Holly.", "Holly knows Florence.", "Florence knows Jermaine." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Dudley", "Chase", "Alyssa", "Tamara", "Florence", "Holly", "Clarence", "Heather", "Duncan", "Jermaine", "Conner", "Essie", "Layla", "Peggy", "Kenneth", "Hector", "Randy", "Megan", "Rufus", "Elton" ], "edges": [ [ 0, 8 ], [ 1, 7 ], [ 3, 2 ], [ 4, 9 ], [ 5, 4 ], [ 6, 5 ], [ 8, 3 ], [ 8, 6 ], [ 9, 1 ], [ 10, 18 ], [ 11, 17 ], [ 13, 12 ], [ 14, 19 ], [ 15, 14 ], [ 16, 15 ], [ 18, 13 ], [ 18, 16 ], [ 19, 11 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Lena knows Clarence. Wanda knows Hattie. Lucia knows Ella. Javier knows Wanda. Sadie knows Adele. Jim knows Sadie. Adele knows Clara. Norma knows Miriam. Sadie knows Norma. Miriam knows Noah. Lucia knows Daphne. Wanda knows Latoya. Cain knows Lucia. Miriam knows Lena. Adele knows Susan. Ken knows Javier. Javier knows Cain. Daphne knows Fabian. Which of Clarence and Fabian can Jim reach?", "answer": "Clarence", "steps": [ "Jim knows Sadie.", "Sadie knows Norma.", "Norma knows Miriam.", "Miriam knows Lena.", "Lena knows Clarence." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Jim", "Clara", "Sadie", "Noah", "Susan", "Miriam", "Norma", "Lena", "Adele", "Clarence", "Ken", "Latoya", "Javier", "Ella", "Hattie", "Lucia", "Cain", "Daphne", "Wanda", "Fabian" ], "edges": [ [ 0, 2 ], [ 2, 8 ], [ 2, 6 ], [ 5, 3 ], [ 5, 7 ], [ 6, 5 ], [ 7, 9 ], [ 8, 1 ], [ 8, 4 ], [ 10, 12 ], [ 12, 18 ], [ 12, 16 ], [ 15, 13 ], [ 15, 17 ], [ 16, 15 ], [ 17, 19 ], [ 18, 11 ], [ 18, 14 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Marshall knows Hardy. Francesca knows Blair. Fred knows Goldie. Marshall knows Francesca. Julio knows Kaleb. Eugenia knows Claudia. Pedro knows Julio. Fred knows Noah. Claudia knows Marilyn. Eugenia knows Marshall. Blair knows Tony. Noah knows Geneva. Pedro knows Fred. Tony knows Vanessa. Goldie knows Parker. Parker knows Valerie. Hardy knows Beverly. Valerie knows Jessie. Which of Fred and Marshall can Pedro reach?", "answer": "Fred", "steps": [ "Pedro knows Fred." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Pedro", "Kaleb", "Noah", "Julio", "Valerie", "Goldie", "Geneva", "Parker", "Jessie", "Fred", "Eugenia", "Marilyn", "Hardy", "Claudia", "Tony", "Francesca", "Beverly", "Blair", "Vanessa", "Marshall" ], "edges": [ [ 0, 3 ], [ 0, 9 ], [ 2, 6 ], [ 3, 1 ], [ 4, 8 ], [ 5, 7 ], [ 7, 4 ], [ 9, 2 ], [ 9, 5 ], [ 10, 13 ], [ 10, 19 ], [ 12, 16 ], [ 13, 11 ], [ 14, 18 ], [ 15, 17 ], [ 17, 14 ], [ 19, 12 ], [ 19, 15 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Daria knows Adelaide. Philip knows Anita. Griffith knows Iris. Russell knows Max. Katrina knows Melody. Katrina knows Xander. Avery knows Daria. Melody knows Griffith. Basil knows Autumn. Ken knows Harrison. Max knows Basil. Iris knows Philip. Hal knows Aisha. Daria knows Russell. Aisha knows Katrina. Hal knows Josie. Ken knows Avery. Autumn knows Elliot. Which of Philip and Autumn can Ken reach?", "answer": "Autumn", "steps": [ "Ken knows Avery.", "Avery knows Daria.", "Daria knows Russell.", "Russell knows Max.", "Max knows Basil.", "Basil knows Autumn." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Ken", "Russell", "Elliot", "Harrison", "Basil", "Adelaide", "Max", "Avery", "Daria", "Autumn", "Hal", "Melody", "Anita", "Josie", "Iris", "Xander", "Griffith", "Aisha", "Katrina", "Philip" ], "edges": [ [ 0, 3 ], [ 0, 7 ], [ 1, 6 ], [ 4, 9 ], [ 6, 4 ], [ 7, 8 ], [ 8, 5 ], [ 8, 1 ], [ 9, 2 ], [ 10, 13 ], [ 10, 17 ], [ 11, 16 ], [ 14, 19 ], [ 16, 14 ], [ 17, 18 ], [ 18, 15 ], [ 18, 11 ], [ 19, 12 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Geraldine knows Clyde. Mario knows Gideon. Mario knows Jules. Gail knows Foster. Jules knows Chad. Lynn knows Grant. Lynn knows Kirsten. Bill knows Mario. Foster knows Jessica. Geraldine knows Bill. Rhea knows Sidney. Foster knows Lynn. Jessica knows Kira. Rhea knows Gail. Isla knows Logan. Gideon knows Cole. Jules knows Isla. Kirsten knows Justine. Which of Justine and Logan can Geraldine reach?", "answer": "Logan", "steps": [ "Geraldine knows Bill.", "Bill knows Mario.", "Mario knows Jules.", "Jules knows Isla.", "Isla knows Logan." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Geraldine", "Jules", "Chad", "Gideon", "Clyde", "Cole", "Bill", "Logan", "Mario", "Isla", "Rhea", "Lynn", "Grant", "Jessica", "Sidney", "Kira", "Gail", "Justine", "Foster", "Kirsten" ], "edges": [ [ 0, 4 ], [ 0, 6 ], [ 1, 2 ], [ 1, 9 ], [ 3, 5 ], [ 6, 8 ], [ 8, 3 ], [ 8, 1 ], [ 9, 7 ], [ 10, 14 ], [ 10, 16 ], [ 11, 12 ], [ 11, 19 ], [ 13, 15 ], [ 16, 18 ], [ 18, 13 ], [ 18, 11 ], [ 19, 17 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Xavier knows Gus. Teresa knows Abel. Bruce knows Louisa. Darla knows Atlas. Lily knows William. Dell knows Emma. Eugenia knows Teresa. Luz knows Rod. Atlas knows Lily. Nolan knows Howard. Donovan knows Nolan. Nolan knows Darla. Bruce knows Hattie. Dante knows Eugenia. Hattie knows Donovan. Rod knows Xavier. Xavier knows Dante. Dell knows Luz. Which of Xavier and Nolan can Dell reach?", "answer": "Xavier", "steps": [ "Dell knows Luz.", "Luz knows Rod.", "Rod knows Xavier." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Dell", "Teresa", "Abel", "Emma", "Rod", "Luz", "Dante", "Eugenia", "Xavier", "Gus", "Bruce", "Lily", "William", "Louisa", "Donovan", "Hattie", "Darla", "Atlas", "Nolan", "Howard" ], "edges": [ [ 0, 3 ], [ 0, 5 ], [ 1, 2 ], [ 4, 8 ], [ 5, 4 ], [ 6, 7 ], [ 7, 1 ], [ 8, 6 ], [ 8, 9 ], [ 10, 13 ], [ 10, 15 ], [ 11, 12 ], [ 14, 18 ], [ 15, 14 ], [ 16, 17 ], [ 17, 11 ], [ 18, 16 ], [ 18, 19 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Jeremy knows Henry. Jane knows Bernice. Beatrice knows Fanny. Roman knows Emma. Roman knows Luther. Henry knows Alfred. Christina knows Heather. Knox knows Pearl. Bella knows Emmett. Bella knows Beatrice. Jane knows Anastasia. Anastasia knows Estella. Emmett knows Jeremy. Henry knows Stacy. Jared knows Roman. Henry knows Christina. Roman knows Knox. Bernice knows Jared. Which of Christina and Knox can Bella reach?", "answer": "Christina", "steps": [ "Bella knows Emmett.", "Emmett knows Jeremy.", "Jeremy knows Henry.", "Henry knows Christina." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Bella", "Beatrice", "Christina", "Heather", "Stacy", "Alfred", "Emmett", "Jeremy", "Fanny", "Henry", "Jane", "Anastasia", "Knox", "Pearl", "Emma", "Luther", "Bernice", "Jared", "Estella", "Roman" ], "edges": [ [ 0, 1 ], [ 0, 6 ], [ 1, 8 ], [ 2, 3 ], [ 6, 7 ], [ 7, 9 ], [ 9, 2 ], [ 9, 4 ], [ 9, 5 ], [ 10, 11 ], [ 10, 16 ], [ 11, 18 ], [ 12, 13 ], [ 16, 17 ], [ 17, 19 ], [ 19, 12 ], [ 19, 14 ], [ 19, 15 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Lola knows Mark. Val knows Nathan. Aaron knows Ada. Ada knows Val. Hayden knows Ashley. Judith knows Hayden. Joel knows Lola. Brooke knows Julian. Greg knows Becky. Becky knows Cesar. Iris knows Jolena. Iris knows Gerald. Hayden knows Boyd. Mark knows Iris. Lola knows Kathleen. Kathleen knows Greg. Julian knows Judith. Julian knows Aaron. Which of Aaron and Kathleen can Brooke reach?", "answer": "Aaron", "steps": [ "Brooke knows Julian.", "Julian knows Aaron." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Brooke", "Ada", "Boyd", "Aaron", "Nathan", "Julian", "Judith", "Hayden", "Ashley", "Val", "Joel", "Greg", "Gerald", "Kathleen", "Cesar", "Lola", "Mark", "Iris", "Jolena", "Becky" ], "edges": [ [ 0, 5 ], [ 1, 9 ], [ 3, 1 ], [ 5, 6 ], [ 5, 3 ], [ 6, 7 ], [ 7, 2 ], [ 7, 8 ], [ 9, 4 ], [ 10, 15 ], [ 11, 19 ], [ 13, 11 ], [ 15, 16 ], [ 15, 13 ], [ 16, 17 ], [ 17, 12 ], [ 17, 18 ], [ 19, 14 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Rose knows Martha. Dirk knows Ursula. Arnold knows Camden. Hendrix knows Della. Leigh knows Curtis. Arnold knows Leigh. Della knows Wilson. Fanny knows Rose. Kerry knows Justin. Arnold knows Myrtle. Della knows Dirk. Carey knows Arnold. Dirk knows Troy. Justin knows Heath. Della knows Roy. Leigh knows Irene. Camden knows Kerry. Wilson knows Fanny. Which of Rose and Justin can Carey reach?", "answer": "Justin", "steps": [ "Carey knows Arnold.", "Arnold knows Camden.", "Camden knows Kerry.", "Kerry knows Justin." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Carey", "Leigh", "Justin", "Curtis", "Myrtle", "Irene", "Camden", "Kerry", "Heath", "Arnold", "Hendrix", "Dirk", "Rose", "Ursula", "Roy", "Troy", "Wilson", "Fanny", "Martha", "Della" ], "edges": [ [ 0, 9 ], [ 1, 3 ], [ 1, 5 ], [ 2, 8 ], [ 6, 7 ], [ 7, 2 ], [ 9, 4 ], [ 9, 1 ], [ 9, 6 ], [ 10, 19 ], [ 11, 13 ], [ 11, 15 ], [ 12, 18 ], [ 16, 17 ], [ 17, 12 ], [ 19, 14 ], [ 19, 11 ], [ 19, 16 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Lena knows Claire. Houston knows Sean. Forrest knows Houston. Houston knows Janet. Chase knows Naomi. Nolan knows Livia. Sean knows Eric. Livia knows Selena. Livia knows Judith. Judith knows Doug. Houston knows Chase. Judith knows Olive. Sean knows Tabitha. Chase knows Lena. Livia knows Kelly. Selena knows Imogen. Olive knows Liam. Selena knows Stephanie. Which of Judith and Chase can Nolan reach?", "answer": "Judith", "steps": [ "Nolan knows Livia.", "Livia knows Judith." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Nolan", "Stephanie", "Kelly", "Selena", "Liam", "Livia", "Doug", "Imogen", "Olive", "Judith", "Forrest", "Tabitha", "Janet", "Sean", "Claire", "Houston", "Naomi", "Eric", "Lena", "Chase" ], "edges": [ [ 0, 5 ], [ 3, 1 ], [ 3, 7 ], [ 5, 2 ], [ 5, 3 ], [ 5, 9 ], [ 8, 4 ], [ 9, 6 ], [ 9, 8 ], [ 10, 15 ], [ 13, 11 ], [ 13, 17 ], [ 15, 12 ], [ 15, 13 ], [ 15, 19 ], [ 18, 14 ], [ 19, 16 ], [ 19, 18 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Rena knows Lola. Federico knows Flora. Sheryl knows Bart. Flora knows Eldon. Flora knows Keaton. April knows Ralph. Beau knows Jacob. April knows Beau. Elvis knows April. Flora knows Carlos. Keaton knows Rena. April knows Sheryl. Julius knows Gerald. Eldon knows Erma. Carlos knows Burt. Ralph knows Rose. Lola knows Kingsley. Bart knows Julius. Which of Rena and Bart can Federico reach?", "answer": "Rena", "steps": [ "Federico knows Flora.", "Flora knows Keaton.", "Keaton knows Rena." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Federico", "Erma", "Rena", "Keaton", "Carlos", "Burt", "Eldon", "Lola", "Kingsley", "Flora", "Elvis", "Rose", "Bart", "Sheryl", "Beau", "Jacob", "Ralph", "Julius", "Gerald", "April" ], "edges": [ [ 0, 9 ], [ 2, 7 ], [ 3, 2 ], [ 4, 5 ], [ 6, 1 ], [ 7, 8 ], [ 9, 4 ], [ 9, 6 ], [ 9, 3 ], [ 10, 19 ], [ 12, 17 ], [ 13, 12 ], [ 14, 15 ], [ 16, 11 ], [ 17, 18 ], [ 19, 14 ], [ 19, 16 ], [ 19, 13 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Hayden knows Henry. Otto knows Milo. Brett knows Shaun. Otto knows Gloria. Gloria knows Erwin. Hayden knows Grace. Milo knows Bruce. Otto knows Clay. Shaun knows Clinton. Valerie knows Louise. Fred knows Basil. Grace knows Hal. Shaun knows Hayden. Hal knows Brenda. Basil knows Otto. Basil knows Flora. Bruce knows Conner. Hayden knows Valerie. Which of Basil and Shaun can Fred reach?", "answer": "Basil", "steps": [ "Fred knows Basil." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Fred", "Milo", "Clay", "Gloria", "Bruce", "Flora", "Otto", "Erwin", "Conner", "Basil", "Brett", "Grace", "Henry", "Valerie", "Hal", "Clinton", "Hayden", "Louise", "Brenda", "Shaun" ], "edges": [ [ 0, 9 ], [ 1, 4 ], [ 3, 7 ], [ 4, 8 ], [ 6, 2 ], [ 6, 3 ], [ 6, 1 ], [ 9, 5 ], [ 9, 6 ], [ 10, 19 ], [ 11, 14 ], [ 13, 17 ], [ 14, 18 ], [ 16, 12 ], [ 16, 13 ], [ 16, 11 ], [ 19, 15 ], [ 19, 16 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Christian knows Sandra. Glenda knows Joseph. Uma knows Christopher. Nancy knows Joaquin. Bennett knows Glenda. Joseph knows Gary. Joaquin knows Ariana. Susan knows Emmett. Uma knows Boyd. Susan knows Clifford. Harmony knows Herbert. Emmett knows Garrett. Emmett knows Bennett. Karen knows Nancy. Karen knows Harmony. Boyd knows Olive. Boyd knows Karen. Bennett knows Christian. Which of Joseph and Joaquin can Uma reach?", "answer": "Joaquin", "steps": [ "Uma knows Boyd.", "Boyd knows Karen.", "Karen knows Nancy.", "Nancy knows Joaquin." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Uma", "Harmony", "Olive", "Nancy", "Christopher", "Boyd", "Karen", "Joaquin", "Ariana", "Herbert", "Susan", "Christian", "Garrett", "Glenda", "Clifford", "Emmett", "Bennett", "Joseph", "Gary", "Sandra" ], "edges": [ [ 0, 4 ], [ 0, 5 ], [ 1, 9 ], [ 3, 7 ], [ 5, 2 ], [ 5, 6 ], [ 6, 3 ], [ 6, 1 ], [ 7, 8 ], [ 10, 14 ], [ 10, 15 ], [ 11, 19 ], [ 13, 17 ], [ 15, 12 ], [ 15, 16 ], [ 16, 13 ], [ 16, 11 ], [ 17, 18 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Sidney knows Willis. Fanny knows Lloyd. Chester knows Sidney. Harold knows Harry. Lloyd knows Chester. Willis knows Yolanda. Harold knows Luella. Laverne knows Anton. Wendell knows Harold. Willis knows Betty. Sidney knows Callum. Wendell knows Alison. Chester knows Sandra. Lloyd knows Etta. Anton knows Griffith. Anton knows Curtis. Griffith knows Wendell. Griffith knows Finn. Which of Sidney and Wendell can Fanny reach?", "answer": "Sidney", "steps": [ "Fanny knows Lloyd.", "Lloyd knows Chester.", "Chester knows Sidney." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Fanny", "Callum", "Willis", "Etta", "Yolanda", "Chester", "Betty", "Lloyd", "Sandra", "Sidney", "Laverne", "Alison", "Harold", "Curtis", "Luella", "Griffith", "Harry", "Anton", "Finn", "Wendell" ], "edges": [ [ 0, 7 ], [ 2, 4 ], [ 2, 6 ], [ 5, 8 ], [ 5, 9 ], [ 7, 3 ], [ 7, 5 ], [ 9, 1 ], [ 9, 2 ], [ 10, 17 ], [ 12, 14 ], [ 12, 16 ], [ 15, 18 ], [ 15, 19 ], [ 17, 13 ], [ 17, 15 ], [ 19, 11 ], [ 19, 12 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Fern knows Darla. Greta knows Virgil. Ann knows Leroy. Keaton knows Barry. Greta knows Ann. Ann knows Eamon. Leroy knows Jose. Eli knows Kate. Edison knows Harper. Lars knows Fern. Harper knows Roland. Kate knows Edison. Ann knows Justin. Keaton knows Eli. Eli knows Daphne. Justin knows Lars. Daphne knows Taylor. Eli knows Reed. Which of Kate and Justin can Greta reach?", "answer": "Justin", "steps": [ "Greta knows Ann.", "Ann knows Justin." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Greta", "Lars", "Ann", "Virgil", "Jose", "Eamon", "Leroy", "Justin", "Fern", "Darla", "Keaton", "Edison", "Eli", "Barry", "Taylor", "Reed", "Daphne", "Kate", "Harper", "Roland" ], "edges": [ [ 0, 3 ], [ 0, 2 ], [ 1, 8 ], [ 2, 5 ], [ 2, 6 ], [ 2, 7 ], [ 6, 4 ], [ 7, 1 ], [ 8, 9 ], [ 10, 13 ], [ 10, 12 ], [ 11, 18 ], [ 12, 15 ], [ 12, 16 ], [ 12, 17 ], [ 16, 14 ], [ 17, 11 ], [ 18, 19 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Trevor knows Lewis. Elodie knows Alfonso. Peggy knows Beth. Emery knows Pauline. Beth knows Landon. Alfonso knows Barney. Bert knows Arden. Emery knows Aubrey. Gail knows Peggy. Landon knows Lark. Alfonso knows Magdalena. Barney knows Trevor. Trevor knows Houston. Emery knows Gail. Houston knows Bert. Alfonso knows Mindy. Hannah knows Emery. Peggy knows Graham. Which of Houston and Beth can Elodie reach?", "answer": "Houston", "steps": [ "Elodie knows Alfonso.", "Alfonso knows Barney.", "Barney knows Trevor.", "Trevor knows Houston." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Elodie", "Lewis", "Houston", "Mindy", "Alfonso", "Trevor", "Bert", "Magdalena", "Arden", "Barney", "Hannah", "Graham", "Beth", "Pauline", "Emery", "Peggy", "Landon", "Aubrey", "Lark", "Gail" ], "edges": [ [ 0, 4 ], [ 2, 6 ], [ 4, 3 ], [ 4, 7 ], [ 4, 9 ], [ 5, 1 ], [ 5, 2 ], [ 6, 8 ], [ 9, 5 ], [ 10, 14 ], [ 12, 16 ], [ 14, 13 ], [ 14, 17 ], [ 14, 19 ], [ 15, 11 ], [ 15, 12 ], [ 16, 18 ], [ 19, 15 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Sierra knows Lana. Judith knows Ezra. Landon knows Sara. Lana knows Fred. Emanuel knows Giselle. Judith knows Chase. Bette knows Judith. Ezra knows Cate. Vivian knows Wesley. Cruz knows Landon. Hunter knows Vivian. Landon knows Jeanne. Cate knows Wanda. Wanda knows Hunter. Fred knows Emanuel. Landon knows Jordan. Jeanne knows Sierra. Judith knows Chloe. Which of Landon and Judith can Bette reach?", "answer": "Judith", "steps": [ "Bette knows Judith." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Bette", "Wesley", "Judith", "Ezra", "Chase", "Hunter", "Cate", "Chloe", "Vivian", "Wanda", "Cruz", "Giselle", "Landon", "Jeanne", "Sara", "Fred", "Sierra", "Jordan", "Emanuel", "Lana" ], "edges": [ [ 0, 2 ], [ 2, 4 ], [ 2, 7 ], [ 2, 3 ], [ 3, 6 ], [ 5, 8 ], [ 6, 9 ], [ 8, 1 ], [ 9, 5 ], [ 10, 12 ], [ 12, 14 ], [ 12, 17 ], [ 12, 13 ], [ 13, 16 ], [ 15, 18 ], [ 16, 19 ], [ 18, 11 ], [ 19, 15 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Chad knows Tristan. Tristan knows Carlos. Tristan knows Ellis. Damian knows Oliver. Oliver knows Valerie. Flora knows Camille. Leander knows Damian. Ellis knows Ira. Ellis knows Tonya. Quinn knows Jacob. Christopher knows Dwight. Oliver knows Christopher. Alyssa knows Chad. Marlene knows Alyssa. Quinn knows Leander. Christopher knows Flora. Marlene knows Marco. Ira knows Willis. Which of Chad and Damian can Marlene reach?", "answer": "Chad", "steps": [ "Marlene knows Alyssa.", "Alyssa knows Chad." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Marlene", "Chad", "Ellis", "Willis", "Carlos", "Tristan", "Alyssa", "Marco", "Ira", "Tonya", "Quinn", "Damian", "Christopher", "Camille", "Valerie", "Oliver", "Leander", "Jacob", "Flora", "Dwight" ], "edges": [ [ 0, 7 ], [ 0, 6 ], [ 1, 5 ], [ 2, 8 ], [ 2, 9 ], [ 5, 4 ], [ 5, 2 ], [ 6, 1 ], [ 8, 3 ], [ 10, 17 ], [ 10, 16 ], [ 11, 15 ], [ 12, 18 ], [ 12, 19 ], [ 15, 14 ], [ 15, 12 ], [ 16, 11 ], [ 18, 13 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Jenna knows Lauren. Regina knows Mae. Hamilton knows Lance. Tessa knows Katherine. Joshua knows Inez. India knows Wilma. Joshua knows Jenna. Mildred knows Elena. Regina knows Mildred. Haven knows Claire. Joy knows Jake. Jenna knows India. Cristina knows Hamilton. Wilma knows Tessa. Mildred knows Callum. Wilma knows Haven. Callum knows Cristina. Cristina knows Joy. Which of Claire and Jake can Joshua reach?", "answer": "Claire", "steps": [ "Joshua knows Jenna.", "Jenna knows India.", "India knows Wilma.", "Wilma knows Haven.", "Haven knows Claire." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Joshua", "Haven", "Lauren", "Inez", "Jenna", "India", "Claire", "Katherine", "Tessa", "Wilma", "Regina", "Joy", "Elena", "Mae", "Mildred", "Callum", "Jake", "Lance", "Hamilton", "Cristina" ], "edges": [ [ 0, 3 ], [ 0, 4 ], [ 1, 6 ], [ 4, 2 ], [ 4, 5 ], [ 5, 9 ], [ 8, 7 ], [ 9, 1 ], [ 9, 8 ], [ 10, 13 ], [ 10, 14 ], [ 11, 16 ], [ 14, 12 ], [ 14, 15 ], [ 15, 19 ], [ 18, 17 ], [ 19, 11 ], [ 19, 18 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Pete knows Kirk. Jackson knows Ricardo. Louise knows Janet. Louise knows Dee. Abigail knows Oscar. Sean knows Sandra. Louise knows Bella. Billy knows Abigail. Bella knows Kareem. Sean knows Jackson. Sean knows Will. Abigail knows Rocco. Sandra knows Louise. Rocco knows Kimberly. Katrina knows Donald. Abigail knows Blake. Pete knows Katrina. Pete knows Billy. Which of Rocco and Bella can Pete reach?", "answer": "Rocco", "steps": [ "Pete knows Billy.", "Billy knows Abigail.", "Abigail knows Rocco." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Pete", "Kimberly", "Billy", "Rocco", "Kirk", "Abigail", "Oscar", "Donald", "Blake", "Katrina", "Sean", "Kareem", "Sandra", "Bella", "Will", "Louise", "Janet", "Ricardo", "Dee", "Jackson" ], "edges": [ [ 0, 4 ], [ 0, 2 ], [ 0, 9 ], [ 2, 5 ], [ 3, 1 ], [ 5, 3 ], [ 5, 6 ], [ 5, 8 ], [ 9, 7 ], [ 10, 14 ], [ 10, 12 ], [ 10, 19 ], [ 12, 15 ], [ 13, 11 ], [ 15, 13 ], [ 15, 16 ], [ 15, 18 ], [ 19, 17 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "James knows Boyd. Adelaide knows Clinton. Drew knows Dorothy. Jakob knows James. Adelaide knows Kurt. Brody knows Kai. Russ knows Renee. Aaron knows Adelaide. Drew knows Pete. Cynthia knows Jakob. Renee knows Lisette. Nora knows Brody. Rex knows Chelsea. Kai knows Cynthia. Chelsea knows Aaron. Lisette knows Rhonda. Rhonda knows Rex. Boyd knows Drew. Which of Brody and Renee can Nora reach?", "answer": "Brody", "steps": [ "Nora knows Brody." ], "difficulty": 1, "original_distance": 8, "idx_to_symbol": [ "Nora", "James", "Drew", "Dorothy", "Jakob", "Kai", "Brody", "Boyd", "Pete", "Cynthia", "Russ", "Chelsea", "Adelaide", "Kurt", "Rex", "Lisette", "Renee", "Aaron", "Clinton", "Rhonda" ], "edges": [ [ 0, 6 ], [ 1, 7 ], [ 2, 3 ], [ 2, 8 ], [ 4, 1 ], [ 5, 9 ], [ 6, 5 ], [ 7, 2 ], [ 9, 4 ], [ 10, 16 ], [ 11, 17 ], [ 12, 13 ], [ 12, 18 ], [ 14, 11 ], [ 15, 19 ], [ 16, 15 ], [ 17, 12 ], [ 19, 14 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Laurel knows Zach. Zelda knows Clifford. Celia knows Atlas. Guy knows Celia. Russell knows Grady. Laurel knows Guy. Casey knows Keaton. Laurel knows Franklin. Dwight knows Tom. Keaton knows Daphna. Tom knows Russell. Imogen knows Jenny. Aaron knows Laurel. Daphna knows Aaron. Luna knows Imogen. Grady knows Zelda. Zelda knows Luna. Zelda knows Cornelius. Which of Luna and Guy can Dwight reach?", "answer": "Luna", "steps": [ "Dwight knows Tom.", "Tom knows Russell.", "Russell knows Grady.", "Grady knows Zelda.", "Zelda knows Luna." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Dwight", "Grady", "Jenny", "Zelda", "Clifford", "Luna", "Russell", "Imogen", "Tom", "Cornelius", "Casey", "Aaron", "Atlas", "Laurel", "Zach", "Guy", "Daphna", "Celia", "Keaton", "Franklin" ], "edges": [ [ 0, 8 ], [ 1, 3 ], [ 3, 4 ], [ 3, 5 ], [ 3, 9 ], [ 5, 7 ], [ 6, 1 ], [ 7, 2 ], [ 8, 6 ], [ 10, 18 ], [ 11, 13 ], [ 13, 14 ], [ 13, 15 ], [ 13, 19 ], [ 15, 17 ], [ 16, 11 ], [ 17, 12 ], [ 18, 16 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Luz knows Lorraine. Lorraine knows Ezra. Virginia knows Hunter. Neil knows Kurt. Corey knows Neil. Hunter knows Douglas. Sonia knows Chelsea. Lorraine knows Aurora. Neil knows Brock. Aurora knows Alyssa. Brock knows Sonia. Daisy knows Eduardo. Caroline knows Emma. Eduardo knows Ainsley. Aurora knows Caroline. Corey knows Daisy. Luz knows Virginia. Brock knows Isla. Which of Aurora and Brock can Corey reach?", "answer": "Brock", "steps": [ "Corey knows Neil.", "Neil knows Brock." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Corey", "Brock", "Neil", "Sonia", "Kurt", "Daisy", "Eduardo", "Chelsea", "Isla", "Ainsley", "Luz", "Aurora", "Lorraine", "Caroline", "Ezra", "Virginia", "Hunter", "Emma", "Alyssa", "Douglas" ], "edges": [ [ 0, 2 ], [ 0, 5 ], [ 1, 3 ], [ 1, 8 ], [ 2, 4 ], [ 2, 1 ], [ 3, 7 ], [ 5, 6 ], [ 6, 9 ], [ 10, 12 ], [ 10, 15 ], [ 11, 13 ], [ 11, 18 ], [ 12, 14 ], [ 12, 11 ], [ 13, 17 ], [ 15, 16 ], [ 16, 19 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Alder knows Robin. Alder knows Leander. Derrick knows Clay. Jerome knows Kathleen. Mae knows Peggy. Derrick knows Jose. Robin knows Latoya. Jose knows Hamilton. Jose knows Craig. Peggy knows Delilah. Nolan knows Yolanda. Clay knows Jodi. Peggy knows Nolan. Mae knows Jerome. Nolan knows Lena. Jose knows Alder. Peggy knows Maya. Yolanda knows Lewis. Which of Lewis and Latoya can Derrick reach?", "answer": "Latoya", "steps": [ "Derrick knows Jose.", "Jose knows Alder.", "Alder knows Robin.", "Robin knows Latoya." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Derrick", "Alder", "Robin", "Clay", "Jodi", "Jose", "Craig", "Hamilton", "Leander", "Latoya", "Mae", "Nolan", "Yolanda", "Jerome", "Kathleen", "Peggy", "Maya", "Delilah", "Lena", "Lewis" ], "edges": [ [ 0, 3 ], [ 0, 5 ], [ 1, 8 ], [ 1, 2 ], [ 2, 9 ], [ 3, 4 ], [ 5, 6 ], [ 5, 7 ], [ 5, 1 ], [ 10, 13 ], [ 10, 15 ], [ 11, 18 ], [ 11, 12 ], [ 12, 19 ], [ 13, 14 ], [ 15, 16 ], [ 15, 17 ], [ 15, 11 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Carrie knows June. Alfonso knows Bailey. Claude knows Gloria. Gertrude knows Jenna. Carrie knows Gertrude. Rebecca knows Heath. Kane knows Gabriel. Kane knows Rebecca. June knows Alfonso. Kane knows Forrest. Veronica knows Felix. Gabriel knows Claude. Forrest knows Jacob. Gloria knows Ellis. Carrie knows Veronica. Gertrude knows Greg. Bailey knows Dayton. Rebecca knows Jack. Which of Bailey and Gloria can Kane reach?", "answer": "Gloria", "steps": [ "Kane knows Gabriel.", "Gabriel knows Claude.", "Claude knows Gloria." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Kane", "Jack", "Claude", "Forrest", "Ellis", "Gabriel", "Jacob", "Gloria", "Rebecca", "Heath", "Carrie", "Greg", "Alfonso", "Veronica", "Dayton", "June", "Felix", "Bailey", "Gertrude", "Jenna" ], "edges": [ [ 0, 3 ], [ 0, 5 ], [ 0, 8 ], [ 2, 7 ], [ 3, 6 ], [ 5, 2 ], [ 7, 4 ], [ 8, 1 ], [ 8, 9 ], [ 10, 13 ], [ 10, 15 ], [ 10, 18 ], [ 12, 17 ], [ 13, 16 ], [ 15, 12 ], [ 17, 14 ], [ 18, 11 ], [ 18, 19 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Laura knows Sybil. Esperanza knows Deanna. Tonya knows Irving. Esperanza knows Keith. Jana knows Roland. Hayden knows Esperanza. Hampton knows Lily. Hampton knows Laura. Keith knows Tonya. Dante knows Hampton. Dante knows Jaime. Winifred knows Dante. Deanna knows Anton. Keith knows Jana. Laura knows Darius. Jaime knows Brent. Lily knows Eldon. Jana knows Zachary. Which of Zachary and Darius can Winifred reach?", "answer": "Darius", "steps": [ "Winifred knows Dante.", "Dante knows Hampton.", "Hampton knows Laura.", "Laura knows Darius." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Winifred", "Laura", "Lily", "Hampton", "Darius", "Brent", "Sybil", "Jaime", "Dante", "Eldon", "Hayden", "Jana", "Tonya", "Keith", "Zachary", "Anton", "Roland", "Deanna", "Esperanza", "Irving" ], "edges": [ [ 0, 8 ], [ 1, 4 ], [ 1, 6 ], [ 2, 9 ], [ 3, 1 ], [ 3, 2 ], [ 7, 5 ], [ 8, 7 ], [ 8, 3 ], [ 10, 18 ], [ 11, 14 ], [ 11, 16 ], [ 12, 19 ], [ 13, 11 ], [ 13, 12 ], [ 17, 15 ], [ 18, 17 ], [ 18, 13 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Sarah knows Kobe. Ivy knows Earl. Hannah knows Bill. Joaquin knows Harold. Kobe knows Kathleen. Bill knows Curtis. Brent knows Vicki. Earl knows Theodore. Matt knows Wilbur. Tonya knows Erin. Callum knows Ivy. Theodore knows Joaquin. Hannah knows Doug. Erin knows Sarah. Brent knows Matt. Molly knows Tonya. Callum knows Brent. Molly knows Hannah. Which of Sarah and Theodore can Molly reach?", "answer": "Sarah", "steps": [ "Molly knows Tonya.", "Tonya knows Erin.", "Erin knows Sarah." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Molly", "Sarah", "Curtis", "Doug", "Kathleen", "Kobe", "Bill", "Tonya", "Hannah", "Erin", "Callum", "Theodore", "Wilbur", "Vicki", "Harold", "Joaquin", "Matt", "Ivy", "Brent", "Earl" ], "edges": [ [ 0, 8 ], [ 0, 7 ], [ 1, 5 ], [ 5, 4 ], [ 6, 2 ], [ 7, 9 ], [ 8, 3 ], [ 8, 6 ], [ 9, 1 ], [ 10, 18 ], [ 10, 17 ], [ 11, 15 ], [ 15, 14 ], [ 16, 12 ], [ 17, 19 ], [ 18, 13 ], [ 18, 16 ], [ 19, 11 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Eamon knows Nancy. Keaton knows Mason. Floyd knows Laurel. Eamon knows Carlos. Carlos knows Eve. Frankie knows Dale. Arthur knows Keaton. Floyd knows Joan. Joan knows Edgar. Nancy knows Bart. Keaton knows Floyd. Lilia knows Kendrick. Rocco knows Lilia. Laurel knows Kurt. Carlos knows Rocco. Rocco knows Jessie. Jessie knows Hannah. Arthur knows Frankie. Which of Laurel and Jessie can Eamon reach?", "answer": "Jessie", "steps": [ "Eamon knows Carlos.", "Carlos knows Rocco.", "Rocco knows Jessie." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Eamon", "Carlos", "Hannah", "Eve", "Rocco", "Nancy", "Jessie", "Lilia", "Bart", "Kendrick", "Arthur", "Keaton", "Kurt", "Mason", "Floyd", "Frankie", "Laurel", "Joan", "Dale", "Edgar" ], "edges": [ [ 0, 5 ], [ 0, 1 ], [ 1, 3 ], [ 1, 4 ], [ 4, 6 ], [ 4, 7 ], [ 5, 8 ], [ 6, 2 ], [ 7, 9 ], [ 10, 15 ], [ 10, 11 ], [ 11, 13 ], [ 11, 14 ], [ 14, 16 ], [ 14, 17 ], [ 15, 18 ], [ 16, 12 ], [ 17, 19 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Teresa knows Brad. Hal knows Itzel. Roy knows Cain. Roy knows Todd. Teresa knows Beau. Beau knows Veronica. Beau knows Norman. Brad knows Owen. Aurora knows Terrence. Jerry knows Stephen. Brock knows Hal. Brock knows Allan. Chandler knows Elias. Aurora knows Roy. Allan knows Teresa. Terrence knows Lucas. Stephen knows Aurora. Jerry knows Chandler. Which of Allan and Stephen can Jerry reach?", "answer": "Stephen", "steps": [ "Jerry knows Stephen." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Jerry", "Cain", "Elias", "Roy", "Todd", "Terrence", "Stephen", "Aurora", "Chandler", "Lucas", "Brock", "Veronica", "Itzel", "Beau", "Norman", "Brad", "Allan", "Teresa", "Hal", "Owen" ], "edges": [ [ 0, 8 ], [ 0, 6 ], [ 3, 1 ], [ 3, 4 ], [ 5, 9 ], [ 6, 7 ], [ 7, 3 ], [ 7, 5 ], [ 8, 2 ], [ 10, 18 ], [ 10, 16 ], [ 13, 11 ], [ 13, 14 ], [ 15, 19 ], [ 16, 17 ], [ 17, 13 ], [ 17, 15 ], [ 18, 12 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Gunnar knows Winston. Deborah knows Victor. Laura knows Pam. Celia knows Joel. Victor knows Jack. Dominic knows Susan. Laura knows Julio. Andre knows Corinne. Darren knows Celia. Henrietta knows Deborah. Henrietta knows Candice. Susan knows Terrence. Laura knows Gunnar. Corinne knows Dominic. Winston knows Andre. Joel knows Jaime. Jack knows Darren. Henrietta knows Luis. Which of Winston and Victor can Henrietta reach?", "answer": "Victor", "steps": [ "Henrietta knows Deborah.", "Deborah knows Victor." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Henrietta", "Candice", "Deborah", "Jack", "Joel", "Darren", "Jaime", "Luis", "Victor", "Celia", "Laura", "Julio", "Gunnar", "Andre", "Susan", "Corinne", "Terrence", "Pam", "Winston", "Dominic" ], "edges": [ [ 0, 1 ], [ 0, 7 ], [ 0, 2 ], [ 2, 8 ], [ 3, 5 ], [ 4, 6 ], [ 5, 9 ], [ 8, 3 ], [ 9, 4 ], [ 10, 11 ], [ 10, 17 ], [ 10, 12 ], [ 12, 18 ], [ 13, 15 ], [ 14, 16 ], [ 15, 19 ], [ 18, 13 ], [ 19, 14 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Guy knows Hilda. Joanna knows Arthur. Hilda knows Zach. Roland knows Will. Chance knows Joanna. Will knows Ramona. Erwin knows Brittany. Erwin knows Derrick. Connor knows Melody. Elise knows Kendra. Connor knows Kurt. Kendra knows Chance. Guy knows Roland. Elise knows Irving. Zach knows Connor. Irving knows Arnold. Arnold knows Erwin. Ramona knows Deanna. Which of Hilda and Irving can Elise reach?", "answer": "Irving", "steps": [ "Elise knows Irving." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Elise", "Erwin", "Kendra", "Arnold", "Chance", "Brittany", "Irving", "Joanna", "Arthur", "Derrick", "Guy", "Connor", "Roland", "Zach", "Will", "Kurt", "Hilda", "Ramona", "Deanna", "Melody" ], "edges": [ [ 0, 2 ], [ 0, 6 ], [ 1, 5 ], [ 1, 9 ], [ 2, 4 ], [ 3, 1 ], [ 4, 7 ], [ 6, 3 ], [ 7, 8 ], [ 10, 12 ], [ 10, 16 ], [ 11, 15 ], [ 11, 19 ], [ 12, 14 ], [ 13, 11 ], [ 14, 17 ], [ 16, 13 ], [ 17, 18 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Amber knows Valerie. Dirk knows Jonas. Herman knows Chloe. Chloe knows Amber. Lucille knows Eugenia. Bart knows Dirk. Chloe knows Lucille. Penny knows Bert. Amber knows Janice. Bert knows Fletcher. Fletcher knows Jeff. Gabe knows Josie. Frida knows Julio. Sean knows Penny. Janice knows Bart. Penny knows Frida. Jeff knows Gabe. Bert knows Lisa. Which of Janice and Fletcher can Sean reach?", "answer": "Fletcher", "steps": [ "Sean knows Penny.", "Penny knows Bert.", "Bert knows Fletcher." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Sean", "Lisa", "Frida", "Penny", "Gabe", "Jeff", "Fletcher", "Josie", "Bert", "Julio", "Herman", "Valerie", "Lucille", "Chloe", "Dirk", "Bart", "Janice", "Jonas", "Amber", "Eugenia" ], "edges": [ [ 0, 3 ], [ 2, 9 ], [ 3, 8 ], [ 3, 2 ], [ 4, 7 ], [ 5, 4 ], [ 6, 5 ], [ 8, 1 ], [ 8, 6 ], [ 10, 13 ], [ 12, 19 ], [ 13, 18 ], [ 13, 12 ], [ 14, 17 ], [ 15, 14 ], [ 16, 15 ], [ 18, 11 ], [ 18, 16 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Owen knows Sylvia. Shannon knows Adele. Ramona knows Jewel. Ramona knows Jim. Louisa knows Karla. Shannon knows Vanessa. Karla knows Neville. Matt knows Ebony. Ebony knows Imogen. Dana knows Owen. Karla knows Martin. Hudson knows Dewey. Louisa knows Karina. Dana knows Ann. Jim knows Dana. Ebony knows Louisa. Owen knows Shannon. Hudson knows Matt. Which of Karla and Shannon can Ramona reach?", "answer": "Shannon", "steps": [ "Ramona knows Jim.", "Jim knows Dana.", "Dana knows Owen.", "Owen knows Shannon." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Ramona", "Vanessa", "Owen", "Shannon", "Jim", "Dana", "Adele", "Ann", "Sylvia", "Jewel", "Hudson", "Neville", "Louisa", "Karla", "Matt", "Ebony", "Martin", "Imogen", "Karina", "Dewey" ], "edges": [ [ 0, 4 ], [ 0, 9 ], [ 2, 3 ], [ 2, 8 ], [ 3, 1 ], [ 3, 6 ], [ 4, 5 ], [ 5, 7 ], [ 5, 2 ], [ 10, 14 ], [ 10, 19 ], [ 12, 13 ], [ 12, 18 ], [ 13, 11 ], [ 13, 16 ], [ 14, 15 ], [ 15, 17 ], [ 15, 12 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Karla knows Leticia. Homer knows Jenna. Keith knows Brett. Harley knows Edwin. Loretta knows Leopold. Harley knows Anastasia. Louise knows Karla. Louise knows Loretta. Troy knows Keaton. Louise knows Jasmine. Josie knows Louise. Anastasia knows Asher. Josie knows Jordan. Brett knows Homer. Brittany knows Dakota. Jordan knows Brittany. Harley knows Troy. Keith knows Harley. Which of Louise and Harley can Keith reach?", "answer": "Harley", "steps": [ "Keith knows Harley." ], "difficulty": 1, "original_distance": 3, "idx_to_symbol": [ "Keith", "Anastasia", "Harley", "Homer", "Jenna", "Brett", "Asher", "Troy", "Keaton", "Edwin", "Josie", "Karla", "Louise", "Brittany", "Dakota", "Jordan", "Leticia", "Loretta", "Leopold", "Jasmine" ], "edges": [ [ 0, 5 ], [ 0, 2 ], [ 1, 6 ], [ 2, 1 ], [ 2, 7 ], [ 2, 9 ], [ 3, 4 ], [ 5, 3 ], [ 7, 8 ], [ 10, 15 ], [ 10, 12 ], [ 11, 16 ], [ 12, 11 ], [ 12, 17 ], [ 12, 19 ], [ 13, 14 ], [ 15, 13 ], [ 17, 18 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Hattie knows Archie. Freya knows Larry. Freya knows Nell. Georgia knows Keegan. Hattie knows June. Edward knows Barbara. Wallace knows Dallas. Jamie knows Kurt. Fanny knows Edward. Wallace knows Fanny. Larry knows Jamie. Wallace knows Olivia. Hattie knows Beau. Sonia knows Georgia. Georgia knows Rod. Jamie knows Theodore. Archie knows Freya. Edward knows Sonia. Which of Jamie and Georgia can Hattie reach?", "answer": "Jamie", "steps": [ "Hattie knows Archie.", "Archie knows Freya.", "Freya knows Larry.", "Larry knows Jamie." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Hattie", "Nell", "Archie", "Theodore", "June", "Larry", "Jamie", "Kurt", "Beau", "Freya", "Wallace", "Barbara", "Fanny", "Keegan", "Olivia", "Sonia", "Georgia", "Rod", "Dallas", "Edward" ], "edges": [ [ 0, 4 ], [ 0, 8 ], [ 0, 2 ], [ 2, 9 ], [ 5, 6 ], [ 6, 3 ], [ 6, 7 ], [ 9, 1 ], [ 9, 5 ], [ 10, 14 ], [ 10, 18 ], [ 10, 12 ], [ 12, 19 ], [ 15, 16 ], [ 16, 13 ], [ 16, 17 ], [ 19, 11 ], [ 19, 15 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Goldie knows Jasmine. Colby knows Violet. Goldie knows Brynn. Harmony knows Colby. Travis knows Javier. Ada knows Hunter. Destiny knows Brody. Brody knows Ada. Bennett knows Travis. Jasmine knows Fleur. Violet knows Bernard. Pedro knows Cristina. Colby knows Nicholas. Brody knows Pedro. Bennett knows Natalie. Nicholas knows Martha. Bennett knows Harmony. Goldie knows Destiny. Which of Destiny and Harmony can Goldie reach?", "answer": "Destiny", "steps": [ "Goldie knows Destiny." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Goldie", "Ada", "Jasmine", "Cristina", "Fleur", "Brynn", "Hunter", "Brody", "Destiny", "Pedro", "Bennett", "Violet", "Travis", "Martha", "Javier", "Natalie", "Bernard", "Colby", "Harmony", "Nicholas" ], "edges": [ [ 0, 2 ], [ 0, 5 ], [ 0, 8 ], [ 1, 6 ], [ 2, 4 ], [ 7, 1 ], [ 7, 9 ], [ 8, 7 ], [ 9, 3 ], [ 10, 12 ], [ 10, 15 ], [ 10, 18 ], [ 11, 16 ], [ 12, 14 ], [ 17, 11 ], [ 17, 19 ], [ 18, 17 ], [ 19, 13 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Jennifer knows Gerald. Amber knows Leah. Amber knows Jennifer. Fleur knows Lee. Anita knows Amanda. Laurel knows Tonya. Sydney knows Erwin. Max knows Amber. Bonnie knows Wilson. Anita knows Sydney. Leah knows Fleur. Arden knows Laurel. Lee knows Joaquin. Gerald knows Cody. Max knows Kristin. Sydney knows Dominic. Erwin knows Bonnie. Dominic knows Arden. Which of Joaquin and Tonya can Max reach?", "answer": "Joaquin", "steps": [ "Max knows Amber.", "Amber knows Leah.", "Leah knows Fleur.", "Fleur knows Lee.", "Lee knows Joaquin." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Max", "Cody", "Jennifer", "Joaquin", "Lee", "Kristin", "Fleur", "Gerald", "Amber", "Leah", "Anita", "Wilson", "Erwin", "Tonya", "Laurel", "Amanda", "Arden", "Bonnie", "Sydney", "Dominic" ], "edges": [ [ 0, 5 ], [ 0, 8 ], [ 2, 7 ], [ 4, 3 ], [ 6, 4 ], [ 7, 1 ], [ 8, 2 ], [ 8, 9 ], [ 9, 6 ], [ 10, 15 ], [ 10, 18 ], [ 12, 17 ], [ 14, 13 ], [ 16, 14 ], [ 17, 11 ], [ 18, 12 ], [ 18, 19 ], [ 19, 16 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Hugh knows Archer. Archer knows Yuki. Harriet knows Dexter. Harriet knows Don. Blake knows Bennett. Troy knows Stella. Bennett knows Harriet. Brock knows Hazel. Khashayar knows Blake. Bennett knows Troy. Vernon knows Beverly. Yuki knows Brock. Delilah knows Samuel. Patrick knows Kate. Dexter knows Patrick. Vernon knows Charles. Yuki knows Vernon. Beverly knows Delilah. Which of Blake and Archer can Khashayar reach?", "answer": "Blake", "steps": [ "Khashayar knows Blake." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Khashayar", "Blake", "Harriet", "Bennett", "Patrick", "Kate", "Don", "Troy", "Dexter", "Stella", "Hugh", "Archer", "Vernon", "Yuki", "Delilah", "Samuel", "Charles", "Brock", "Beverly", "Hazel" ], "edges": [ [ 0, 1 ], [ 1, 3 ], [ 2, 6 ], [ 2, 8 ], [ 3, 2 ], [ 3, 7 ], [ 4, 5 ], [ 7, 9 ], [ 8, 4 ], [ 10, 11 ], [ 11, 13 ], [ 12, 16 ], [ 12, 18 ], [ 13, 12 ], [ 13, 17 ], [ 14, 15 ], [ 17, 19 ], [ 18, 14 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Beau knows Fleur. Frances knows Beau. Hazel knows Dee. Alejandro knows Tony. Frances knows Lillian. Frankie knows Gail. Dolores knows Kira. Georgia knows Dirk. Dee knows Anton. Frankie knows Hazel. Lillian knows Virginia. Dirk knows Frances. Frances knows Alejandro. Dirk knows Juan. Federico knows Frankie. Hazel knows Dolores. Hazel knows Jasper. Jasper knows Melissa. Which of Frances and Hazel can Georgia reach?", "answer": "Frances", "steps": [ "Georgia knows Dirk.", "Dirk knows Frances." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Georgia", "Fleur", "Juan", "Virginia", "Frances", "Dirk", "Alejandro", "Lillian", "Tony", "Beau", "Federico", "Kira", "Gail", "Melissa", "Hazel", "Frankie", "Dee", "Jasper", "Anton", "Dolores" ], "edges": [ [ 0, 5 ], [ 4, 7 ], [ 4, 6 ], [ 4, 9 ], [ 5, 2 ], [ 5, 4 ], [ 6, 8 ], [ 7, 3 ], [ 9, 1 ], [ 10, 15 ], [ 14, 17 ], [ 14, 16 ], [ 14, 19 ], [ 15, 12 ], [ 15, 14 ], [ 16, 18 ], [ 17, 13 ], [ 19, 11 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Richard knows Erin. Darrell knows Hank. Ainsley knows Darla. Hamilton knows Elliot. Elliot knows Maude. Elliot knows Mack. Darla knows Reed. Richard knows Dean. Elliot knows Shawn. Aurora knows Jason. Dean knows Aurora. Dominic knows Jorge. Aurora knows Ainsley. Aurora knows Enrique. Dominic knows Hamilton. Maude knows Darrell. Darrell knows Connor. Darla knows Joyce. Which of Hank and Joyce can Richard reach?", "answer": "Joyce", "steps": [ "Richard knows Dean.", "Dean knows Aurora.", "Aurora knows Ainsley.", "Ainsley knows Darla.", "Darla knows Joyce." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Richard", "Enrique", "Dean", "Ainsley", "Reed", "Darla", "Jason", "Joyce", "Aurora", "Erin", "Dominic", "Shawn", "Hamilton", "Maude", "Connor", "Darrell", "Mack", "Hank", "Elliot", "Jorge" ], "edges": [ [ 0, 2 ], [ 0, 9 ], [ 2, 8 ], [ 3, 5 ], [ 5, 4 ], [ 5, 7 ], [ 8, 1 ], [ 8, 6 ], [ 8, 3 ], [ 10, 12 ], [ 10, 19 ], [ 12, 18 ], [ 13, 15 ], [ 15, 14 ], [ 15, 17 ], [ 18, 11 ], [ 18, 16 ], [ 18, 13 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Alfonso knows Eric. Shane knows Elton. Katherine knows Hal. Joanna knows David. Carter knows Gustavo. Alfonso knows Shane. Hudson knows Leon. Jordan knows Virginia. Leon knows Dane. Hal knows Alfonso. Alfonso knows Hayes. Hayes knows Lark. Virginia knows Laura. Virginia knows Carter. Laura knows Raquel. Eric knows Joanna. Virginia knows Hudson. Anastasia knows Jordan. Which of Joanna and Leon can Katherine reach?", "answer": "Joanna", "steps": [ "Katherine knows Hal.", "Hal knows Alfonso.", "Alfonso knows Eric.", "Eric knows Joanna." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Katherine", "Eric", "Hayes", "Shane", "David", "Hal", "Alfonso", "Joanna", "Elton", "Lark", "Anastasia", "Hudson", "Carter", "Laura", "Dane", "Jordan", "Virginia", "Leon", "Raquel", "Gustavo" ], "edges": [ [ 0, 5 ], [ 1, 7 ], [ 2, 9 ], [ 3, 8 ], [ 5, 6 ], [ 6, 1 ], [ 6, 3 ], [ 6, 2 ], [ 7, 4 ], [ 10, 15 ], [ 11, 17 ], [ 12, 19 ], [ 13, 18 ], [ 15, 16 ], [ 16, 11 ], [ 16, 13 ], [ 16, 12 ], [ 17, 14 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Helen knows Palmer. Clifford knows Helen. Lacey knows Adelaide. Yasmin knows Louis. Kristin knows Yasmin. Yasmin knows Coral. Dante knows Eli. Yasmin knows Dante. Clifford knows Jaime. Vicki knows Jill. Louis knows Vicki. Clifford knows Etta. Louis knows Camille. Jaime knows Reed. Vicki knows Edgar. Jaime knows Lacey. Josie knows Clifford. Lacey knows Colin. Which of Yasmin and Clifford can Josie reach?", "answer": "Clifford", "steps": [ "Josie knows Clifford." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Josie", "Clifford", "Etta", "Helen", "Palmer", "Jaime", "Adelaide", "Colin", "Reed", "Lacey", "Kristin", "Yasmin", "Coral", "Dante", "Eli", "Louis", "Jill", "Edgar", "Camille", "Vicki" ], "edges": [ [ 0, 1 ], [ 1, 2 ], [ 1, 3 ], [ 1, 5 ], [ 3, 4 ], [ 5, 8 ], [ 5, 9 ], [ 9, 6 ], [ 9, 7 ], [ 10, 11 ], [ 11, 12 ], [ 11, 13 ], [ 11, 15 ], [ 13, 14 ], [ 15, 18 ], [ 15, 19 ], [ 19, 16 ], [ 19, 17 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Louis knows Calvin. Jaime knows Boyd. Chris knows Boris. Chris knows Esme. Esme knows Arnold. Louis knows Cynthia. Louisa knows Frances. Frances knows Megan. Chris knows Curtis. Boyd knows Ava. Curtis knows Louisa. Arnold knows Doug. Boyd knows Helene. Burt knows Carlton. Calvin knows Burt. Louis knows Evelyn. Cynthia knows Jaime. Frances knows Kobe. Which of Ava and Kobe can Chris reach?", "answer": "Kobe", "steps": [ "Chris knows Curtis.", "Curtis knows Louisa.", "Louisa knows Frances.", "Frances knows Kobe." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Chris", "Kobe", "Esme", "Doug", "Frances", "Boris", "Louisa", "Megan", "Arnold", "Curtis", "Louis", "Ava", "Calvin", "Carlton", "Boyd", "Evelyn", "Jaime", "Helene", "Burt", "Cynthia" ], "edges": [ [ 0, 5 ], [ 0, 2 ], [ 0, 9 ], [ 2, 8 ], [ 4, 1 ], [ 4, 7 ], [ 6, 4 ], [ 8, 3 ], [ 9, 6 ], [ 10, 15 ], [ 10, 12 ], [ 10, 19 ], [ 12, 18 ], [ 14, 11 ], [ 14, 17 ], [ 16, 14 ], [ 18, 13 ], [ 19, 16 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Willard knows Arturo. Marcus knows Ariana. Conrad knows Isadora. Dee knows Conrad. Dee knows Edna. Miranda knows Raymond. Darwin knows Marcus. Kobe knows Jeremiah. Mildred knows Angela. Raymond knows Willard. Ruth knows Spencer. Lacey knows Mildred. Jeremiah knows Dee. Esther knows Darwin. Angela knows Geneva. Marcus knows Ruth. Esther knows Miranda. Kobe knows Lacey. Which of Dee and Marcus can Esther reach?", "answer": "Marcus", "steps": [ "Esther knows Darwin.", "Darwin knows Marcus." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Esther", "Raymond", "Ariana", "Miranda", "Arturo", "Willard", "Spencer", "Ruth", "Darwin", "Marcus", "Kobe", "Mildred", "Edna", "Lacey", "Geneva", "Angela", "Isadora", "Conrad", "Jeremiah", "Dee" ], "edges": [ [ 0, 3 ], [ 0, 8 ], [ 1, 5 ], [ 3, 1 ], [ 5, 4 ], [ 7, 6 ], [ 8, 9 ], [ 9, 2 ], [ 9, 7 ], [ 10, 13 ], [ 10, 18 ], [ 11, 15 ], [ 13, 11 ], [ 15, 14 ], [ 17, 16 ], [ 18, 19 ], [ 19, 12 ], [ 19, 17 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Hank knows William. Lenora knows Davis. Hank knows Doug. Boyd knows Gwen. Eleanor knows Boyd. Gerald knows Dennis. Davis knows Christian. Gerald knows Eleanor. Reid knows Bernadette. Doug knows Isadora. Hank knows Jonah. William knows Thomas. Hugo knows Katherine. Reid knows Hugo. William knows Rod. William knows Lenora. Gerald knows Jem. Reid knows Gerald. Which of Boyd and Davis can Hank reach?", "answer": "Davis", "steps": [ "Hank knows William.", "William knows Lenora.", "Lenora knows Davis." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Hank", "Jonah", "Doug", "William", "Christian", "Rod", "Isadora", "Thomas", "Davis", "Lenora", "Reid", "Bernadette", "Hugo", "Gerald", "Gwen", "Dennis", "Katherine", "Jem", "Boyd", "Eleanor" ], "edges": [ [ 0, 1 ], [ 0, 2 ], [ 0, 3 ], [ 2, 6 ], [ 3, 5 ], [ 3, 7 ], [ 3, 9 ], [ 8, 4 ], [ 9, 8 ], [ 10, 11 ], [ 10, 12 ], [ 10, 13 ], [ 12, 16 ], [ 13, 15 ], [ 13, 17 ], [ 13, 19 ], [ 18, 14 ], [ 19, 18 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Kira knows Tina. Curtis knows Hugo. Sybil knows Patricia. Denise knows Fleur. Rita knows Keith. Keith knows Dawn. Rita knows Erma. Joyce knows Marion. Sybil knows Rita. Joyce knows Billy. Fleur knows Kira. Spencer knows Demetrius. Billy knows Yolanda. Alex knows Carter. Curtis knows Sybil. Hugo knows Alex. Denise knows Spencer. Spencer knows Joyce. Which of Rita and Joyce can Denise reach?", "answer": "Joyce", "steps": [ "Denise knows Spencer.", "Spencer knows Joyce." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Denise", "Fleur", "Marion", "Billy", "Tina", "Joyce", "Kira", "Yolanda", "Demetrius", "Spencer", "Curtis", "Hugo", "Erma", "Keith", "Carter", "Rita", "Alex", "Dawn", "Patricia", "Sybil" ], "edges": [ [ 0, 1 ], [ 0, 9 ], [ 1, 6 ], [ 3, 7 ], [ 5, 2 ], [ 5, 3 ], [ 6, 4 ], [ 9, 5 ], [ 9, 8 ], [ 10, 11 ], [ 10, 19 ], [ 11, 16 ], [ 13, 17 ], [ 15, 12 ], [ 15, 13 ], [ 16, 14 ], [ 19, 15 ], [ 19, 18 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Gilbert knows Kenzie. Carter knows Lee. Tom knows Leigh. Leon knows Jackson. Carter knows Samuel. Georgia knows Carter. Lucas knows Charlotte. Leigh knows Leon. Leon knows Elodie. Gilbert knows Craig. Rick knows Gilbert. Gilbert knows Angela. Samuel knows Aldo. Angela knows Tom. Carter knows Shane. Mark knows Lucas. Lucas knows Howard. Aldo knows Mark. Which of Howard and Elodie can Georgia reach?", "answer": "Howard", "steps": [ "Georgia knows Carter.", "Carter knows Samuel.", "Samuel knows Aldo.", "Aldo knows Mark.", "Mark knows Lucas.", "Lucas knows Howard." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Georgia", "Samuel", "Lucas", "Charlotte", "Aldo", "Howard", "Mark", "Carter", "Shane", "Lee", "Rick", "Angela", "Leon", "Jackson", "Tom", "Elodie", "Leigh", "Gilbert", "Kenzie", "Craig" ], "edges": [ [ 0, 7 ], [ 1, 4 ], [ 2, 3 ], [ 2, 5 ], [ 4, 6 ], [ 6, 2 ], [ 7, 1 ], [ 7, 8 ], [ 7, 9 ], [ 10, 17 ], [ 11, 14 ], [ 12, 13 ], [ 12, 15 ], [ 14, 16 ], [ 16, 12 ], [ 17, 11 ], [ 17, 18 ], [ 17, 19 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Ford knows Sidney. Yvonne knows Winifred. Jeffery knows Alice. Diane knows Ford. Ainsley knows Rocco. Harry knows Ashley. Rocco knows Yvonne. Cordelia knows Vance. Effie knows Harry. Cordelia knows Latoya. Ainsley knows Jeffery. Vance knows Effie. Harry knows Janice. Wendy knows Roy. Latoya knows Bryan. Janice knows Wendy. Winifred knows Heath. Winifred knows Diane. Which of Effie and Yvonne can Cordelia reach?", "answer": "Effie", "steps": [ "Cordelia knows Vance.", "Vance knows Effie." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Cordelia", "Bryan", "Ashley", "Latoya", "Effie", "Roy", "Harry", "Vance", "Wendy", "Janice", "Ainsley", "Alice", "Heath", "Jeffery", "Yvonne", "Sidney", "Winifred", "Rocco", "Ford", "Diane" ], "edges": [ [ 0, 3 ], [ 0, 7 ], [ 3, 1 ], [ 4, 6 ], [ 6, 2 ], [ 6, 9 ], [ 7, 4 ], [ 8, 5 ], [ 9, 8 ], [ 10, 13 ], [ 10, 17 ], [ 13, 11 ], [ 14, 16 ], [ 16, 12 ], [ 16, 19 ], [ 17, 14 ], [ 18, 15 ], [ 19, 18 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Heath knows Aaron. Kristin knows Arden. Pablo knows Beau. Sierra knows Gonzalo. Bailey knows Gilbert. Gilbert knows Judy. Gonzalo knows Heath. Beau knows Bailey. Jessie knows Kristin. Melody knows Peggy. Peggy knows Lois. Beau knows Ernesto. Kristin knows Cornelius. Aaron knows Declan. Sierra knows Stella. Gilbert knows Cara. Cara knows Melody. Arden knows Sierra. Which of Beau and Kristin can Jessie reach?", "answer": "Kristin", "steps": [ "Jessie knows Kristin." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Jessie", "Cornelius", "Aaron", "Heath", "Gonzalo", "Stella", "Arden", "Kristin", "Sierra", "Declan", "Pablo", "Ernesto", "Peggy", "Melody", "Cara", "Judy", "Bailey", "Beau", "Gilbert", "Lois" ], "edges": [ [ 0, 7 ], [ 2, 9 ], [ 3, 2 ], [ 4, 3 ], [ 6, 8 ], [ 7, 1 ], [ 7, 6 ], [ 8, 5 ], [ 8, 4 ], [ 10, 17 ], [ 12, 19 ], [ 13, 12 ], [ 14, 13 ], [ 16, 18 ], [ 17, 11 ], [ 17, 16 ], [ 18, 15 ], [ 18, 14 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Mary knows Kent. Kevin knows Sybil. Sybil knows Frankie. Eric knows Martha. Atlas knows Devon. Sybil knows Mindy. Eric knows Larry. Eric knows Dick. Frankie knows Bart. Bart knows Conner. Cliff knows Alyson. Alyson knows Colleen. Bart knows Elias. Mary knows Tiffany. Kent knows Eric. Cliff knows Mary. Kevin knows Atlas. Bart knows Clay. Which of Eric and Bart can Kevin reach?", "answer": "Bart", "steps": [ "Kevin knows Sybil.", "Sybil knows Frankie.", "Frankie knows Bart." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Kevin", "Sybil", "Devon", "Bart", "Clay", "Elias", "Frankie", "Atlas", "Mindy", "Conner", "Cliff", "Mary", "Colleen", "Eric", "Larry", "Martha", "Kent", "Alyson", "Tiffany", "Dick" ], "edges": [ [ 0, 7 ], [ 0, 1 ], [ 1, 8 ], [ 1, 6 ], [ 3, 4 ], [ 3, 5 ], [ 3, 9 ], [ 6, 3 ], [ 7, 2 ], [ 10, 17 ], [ 10, 11 ], [ 11, 18 ], [ 11, 16 ], [ 13, 14 ], [ 13, 15 ], [ 13, 19 ], [ 16, 13 ], [ 17, 12 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Sierra knows Lana. Judith knows Ezra. Landon knows Sara. Lana knows Fred. Emanuel knows Giselle. Judith knows Chase. Bette knows Judith. Ezra knows Cate. Vivian knows Wesley. Cruz knows Landon. Hunter knows Vivian. Landon knows Jeanne. Cate knows Wanda. Wanda knows Hunter. Fred knows Emanuel. Landon knows Jordan. Jeanne knows Sierra. Judith knows Chloe. Which of Wanda and Lana can Bette reach?", "answer": "Wanda", "steps": [ "Bette knows Judith.", "Judith knows Ezra.", "Ezra knows Cate.", "Cate knows Wanda." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Bette", "Wesley", "Judith", "Ezra", "Chase", "Hunter", "Cate", "Chloe", "Vivian", "Wanda", "Cruz", "Giselle", "Landon", "Jeanne", "Sara", "Fred", "Sierra", "Jordan", "Emanuel", "Lana" ], "edges": [ [ 0, 2 ], [ 2, 4 ], [ 2, 7 ], [ 2, 3 ], [ 3, 6 ], [ 5, 8 ], [ 6, 9 ], [ 8, 1 ], [ 9, 5 ], [ 10, 12 ], [ 12, 14 ], [ 12, 17 ], [ 12, 13 ], [ 13, 16 ], [ 15, 18 ], [ 16, 19 ], [ 18, 11 ], [ 19, 15 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Geraldine knows Isabel. Maria knows Autumn. Cain knows Jared. Floyd knows Willis. Blair knows Cain. Kelsey knows Geraldine. Isabel knows Stefan. Floyd knows Ron. Maria knows Mindy. Geraldine knows Bailey. David knows Floyd. Victor knows Maria. Isabel knows Clyde. Dale knows Forrest. Cain knows Dale. Jared knows Victor. Dale knows Cate. Bailey knows David. Which of David and Victor can Blair reach?", "answer": "Victor", "steps": [ "Blair knows Cain.", "Cain knows Jared.", "Jared knows Victor." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Blair", "Cate", "Cain", "Dale", "Autumn", "Mindy", "Maria", "Jared", "Forrest", "Victor", "Kelsey", "Clyde", "Geraldine", "Isabel", "Ron", "Willis", "Floyd", "Bailey", "Stefan", "David" ], "edges": [ [ 0, 2 ], [ 2, 3 ], [ 2, 7 ], [ 3, 1 ], [ 3, 8 ], [ 6, 4 ], [ 6, 5 ], [ 7, 9 ], [ 9, 6 ], [ 10, 12 ], [ 12, 13 ], [ 12, 17 ], [ 13, 11 ], [ 13, 18 ], [ 16, 14 ], [ 16, 15 ], [ 17, 19 ], [ 19, 16 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Emanuel knows Joshua. Zach knows Agnes. Axel knows Aaron. Lars knows Constance. Emanuel knows Oscar. Zach knows Don. Leonard knows Dixie. Zach knows Daphna. Philip knows Zach. Agnes knows Axel. Emanuel knows Whitney. Oscar knows Karen. Karen knows Tiffany. Lennox knows Leonard. Whitney knows Lennox. Roger knows Lars. Daphna knows Roger. Iris knows Emanuel. Which of Roger and Lennox can Philip reach?", "answer": "Roger", "steps": [ "Philip knows Zach.", "Zach knows Daphna.", "Daphna knows Roger." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Philip", "Roger", "Aaron", "Don", "Daphna", "Zach", "Axel", "Lars", "Constance", "Agnes", "Iris", "Lennox", "Tiffany", "Joshua", "Whitney", "Emanuel", "Karen", "Leonard", "Dixie", "Oscar" ], "edges": [ [ 0, 5 ], [ 1, 7 ], [ 4, 1 ], [ 5, 3 ], [ 5, 4 ], [ 5, 9 ], [ 6, 2 ], [ 7, 8 ], [ 9, 6 ], [ 10, 15 ], [ 11, 17 ], [ 14, 11 ], [ 15, 13 ], [ 15, 14 ], [ 15, 19 ], [ 16, 12 ], [ 17, 18 ], [ 19, 16 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Miriam knows Nancy. Miriam knows Dawn. Miriam knows Chad. Dane knows Brad. Lamont knows Angelica. Darin knows Adelaide. Brad knows Lamont. Dell knows Paige. Adelaide knows Gilbert. Jane knows Gail. Corinne knows Arturo. Ernie knows Miriam. Chad knows Lennox. Dell knows Dane. Brad knows Darin. Brad knows Melissa. Nancy knows Corinne. Jane knows Ernie. Which of Arturo and Gilbert can Jane reach?", "answer": "Arturo", "steps": [ "Jane knows Ernie.", "Ernie knows Miriam.", "Miriam knows Nancy.", "Nancy knows Corinne.", "Corinne knows Arturo." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Jane", "Miriam", "Arturo", "Dawn", "Lennox", "Gail", "Corinne", "Chad", "Ernie", "Nancy", "Dell", "Brad", "Gilbert", "Melissa", "Angelica", "Paige", "Adelaide", "Lamont", "Dane", "Darin" ], "edges": [ [ 0, 5 ], [ 0, 8 ], [ 1, 3 ], [ 1, 7 ], [ 1, 9 ], [ 6, 2 ], [ 7, 4 ], [ 8, 1 ], [ 9, 6 ], [ 10, 15 ], [ 10, 18 ], [ 11, 13 ], [ 11, 17 ], [ 11, 19 ], [ 16, 12 ], [ 17, 14 ], [ 18, 11 ], [ 19, 16 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Marcus knows Gene. Stephanie knows Ernie. Jane knows Brody. Wendell knows Effie. Perry knows Lauren. Lauren knows Marcus. Ernie knows Colette. Wendell knows Milton. Zoe knows Stephanie. Riley knows Jane. Lyric knows Simon. Milton knows Rocco. Colette knows Wendell. Lauren knows Arturo. Arturo knows Hector. Stephanie knows Lyric. Riley knows Jon. Gene knows Riley. Which of Gene and Colette can Zoe reach?", "answer": "Colette", "steps": [ "Zoe knows Stephanie.", "Stephanie knows Ernie.", "Ernie knows Colette." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Zoe", "Stephanie", "Lyric", "Colette", "Effie", "Ernie", "Simon", "Wendell", "Rocco", "Milton", "Perry", "Lauren", "Arturo", "Gene", "Jon", "Marcus", "Hector", "Riley", "Brody", "Jane" ], "edges": [ [ 0, 1 ], [ 1, 2 ], [ 1, 5 ], [ 2, 6 ], [ 3, 7 ], [ 5, 3 ], [ 7, 4 ], [ 7, 9 ], [ 9, 8 ], [ 10, 11 ], [ 11, 12 ], [ 11, 15 ], [ 12, 16 ], [ 13, 17 ], [ 15, 13 ], [ 17, 14 ], [ 17, 19 ], [ 19, 18 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Julian knows Giselle. Della knows Brooke. Julian knows Sybil. Fanny knows Myrtle. Jared knows Pete. Della knows Malik. Brooke knows Jay. Elise knows Stephen. Julian knows Ruth. Fanny knows Della. Layla knows Lambert. Myrtle knows Jared. Della knows Clayton. Jared knows Farrah. Elise knows Julian. Stephen knows Layla. Ruth knows Drake. Layla knows Madeline. Which of Della and Julian can Elise reach?", "answer": "Julian", "steps": [ "Elise knows Julian." ], "difficulty": 1, "original_distance": 3, "idx_to_symbol": [ "Elise", "Layla", "Sybil", "Julian", "Madeline", "Lambert", "Ruth", "Drake", "Stephen", "Giselle", "Fanny", "Jared", "Clayton", "Della", "Farrah", "Pete", "Brooke", "Jay", "Myrtle", "Malik" ], "edges": [ [ 0, 8 ], [ 0, 3 ], [ 1, 4 ], [ 1, 5 ], [ 3, 2 ], [ 3, 6 ], [ 3, 9 ], [ 6, 7 ], [ 8, 1 ], [ 10, 18 ], [ 10, 13 ], [ 11, 14 ], [ 11, 15 ], [ 13, 12 ], [ 13, 16 ], [ 13, 19 ], [ 16, 17 ], [ 18, 11 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Stacy knows Blair. Leland knows Homer. Blair knows Maggie. Arnold knows Eugene. Abigail knows Russ. Jon knows Grace. Stacy knows Gwen. Gwen knows Dee. Gwen knows Zoe. Leland knows India. Gwen knows Ariana. Dee knows Arnold. Russ knows Leland. Perry knows Barry. Lorna knows Stacy. Russ knows Perry. Gage knows Jon. Leland knows Gage. Which of Grace and Eugene can Abigail reach?", "answer": "Grace", "steps": [ "Abigail knows Russ.", "Russ knows Leland.", "Leland knows Gage.", "Gage knows Jon.", "Jon knows Grace." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Abigail", "India", "Barry", "Homer", "Perry", "Leland", "Grace", "Gage", "Jon", "Russ", "Lorna", "Zoe", "Maggie", "Ariana", "Blair", "Gwen", "Eugene", "Dee", "Arnold", "Stacy" ], "edges": [ [ 0, 9 ], [ 4, 2 ], [ 5, 1 ], [ 5, 3 ], [ 5, 7 ], [ 7, 8 ], [ 8, 6 ], [ 9, 4 ], [ 9, 5 ], [ 10, 19 ], [ 14, 12 ], [ 15, 11 ], [ 15, 13 ], [ 15, 17 ], [ 17, 18 ], [ 18, 16 ], [ 19, 14 ], [ 19, 15 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Henry knows Juan. Isiah knows Henry. Emmett knows Chantal. Daniella knows Theodore. Eamon knows Heath. Glenn knows Zack. Daniella knows Karl. Victor knows Daniella. Chantal knows Whitney. Barbara knows Emmett. Eamon knows Grace. Nelson knows Isabel. Isiah knows Victor. Daniella knows Kennedy. Whitney knows Eamon. Isabel knows Isiah. Eamon knows Joaquin. Chantal knows Glenn. Which of Grace and Karl can Nelson reach?", "answer": "Karl", "steps": [ "Nelson knows Isabel.", "Isabel knows Isiah.", "Isiah knows Victor.", "Victor knows Daniella.", "Daniella knows Karl." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Nelson", "Juan", "Victor", "Isiah", "Theodore", "Kennedy", "Henry", "Isabel", "Daniella", "Karl", "Barbara", "Zack", "Whitney", "Chantal", "Joaquin", "Heath", "Glenn", "Emmett", "Eamon", "Grace" ], "edges": [ [ 0, 7 ], [ 2, 8 ], [ 3, 6 ], [ 3, 2 ], [ 6, 1 ], [ 7, 3 ], [ 8, 4 ], [ 8, 5 ], [ 8, 9 ], [ 10, 17 ], [ 12, 18 ], [ 13, 16 ], [ 13, 12 ], [ 16, 11 ], [ 17, 13 ], [ 18, 14 ], [ 18, 15 ], [ 18, 19 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Edna knows Kendrick. Edna knows Fabian. Austin knows Alice. Austin knows Daphne. Wallace knows Austin. Bert knows Edna. Jose knows Olive. Mack knows Bert. Delilah knows Martha. Alison knows Adam. Martha knows Kirk. Martha knows Dallas. Vicki knows Arden. Wallace knows Delilah. Dallas knows Jose. Kendrick knows Alison. Vicki knows Garrison. Mack knows Vicki. Which of Dallas and Kendrick can Wallace reach?", "answer": "Dallas", "steps": [ "Wallace knows Delilah.", "Delilah knows Martha.", "Martha knows Dallas." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Wallace", "Jose", "Olive", "Dallas", "Alice", "Austin", "Martha", "Delilah", "Kirk", "Daphne", "Mack", "Alison", "Adam", "Kendrick", "Garrison", "Vicki", "Edna", "Bert", "Fabian", "Arden" ], "edges": [ [ 0, 7 ], [ 0, 5 ], [ 1, 2 ], [ 3, 1 ], [ 5, 4 ], [ 5, 9 ], [ 6, 3 ], [ 6, 8 ], [ 7, 6 ], [ 10, 17 ], [ 10, 15 ], [ 11, 12 ], [ 13, 11 ], [ 15, 14 ], [ 15, 19 ], [ 16, 13 ], [ 16, 18 ], [ 17, 16 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Lorraine knows Jules. Renee knows Mary. Lois knows Hubert. Lorraine knows Foster. Hubert knows Ashton. Lorraine knows Noah. Ibrahim knows Bruce. Lois knows Pedro. Pedro knows Emery. Renee knows Lorraine. Mary knows Ibrahim. Pedro knows Tabitha. Lilia knows Renee. Lois knows Calvin. Renee knows Jorge. Ashton knows Brooke. Pedro knows Lennox. Peggy knows Lois. Which of Brooke and Bruce can Lilia reach?", "answer": "Bruce", "steps": [ "Lilia knows Renee.", "Renee knows Mary.", "Mary knows Ibrahim.", "Ibrahim knows Bruce." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Lilia", "Jorge", "Ibrahim", "Mary", "Noah", "Bruce", "Renee", "Lorraine", "Foster", "Jules", "Peggy", "Calvin", "Ashton", "Hubert", "Tabitha", "Brooke", "Lois", "Pedro", "Lennox", "Emery" ], "edges": [ [ 0, 6 ], [ 2, 5 ], [ 3, 2 ], [ 6, 1 ], [ 6, 3 ], [ 6, 7 ], [ 7, 4 ], [ 7, 8 ], [ 7, 9 ], [ 10, 16 ], [ 12, 15 ], [ 13, 12 ], [ 16, 11 ], [ 16, 13 ], [ 16, 17 ], [ 17, 14 ], [ 17, 18 ], [ 17, 19 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Sheila knows August. Lars knows Henrietta. Allan knows Gladys. Jared knows Jasmine. Tim knows Ernie. Ernie knows Sheila. Jared knows Troy. Glenda knows Harper. Ian knows Glenda. Lars knows Samantha. Henrietta knows Ian. August knows Celia. Eloise knows Erica. Erica knows Aubrey. Jasmine knows Allan. Ian knows Bert. Allan knows Tim. Harper knows Eloise. Which of Tim and Glenda can Lars reach?", "answer": "Glenda", "steps": [ "Lars knows Henrietta.", "Henrietta knows Ian.", "Ian knows Glenda." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Lars", "Harper", "Glenda", "Ian", "Erica", "Samantha", "Henrietta", "Aubrey", "Eloise", "Bert", "Jared", "Ernie", "Tim", "Allan", "August", "Troy", "Jasmine", "Celia", "Sheila", "Gladys" ], "edges": [ [ 0, 5 ], [ 0, 6 ], [ 1, 8 ], [ 2, 1 ], [ 3, 2 ], [ 3, 9 ], [ 4, 7 ], [ 6, 3 ], [ 8, 4 ], [ 10, 15 ], [ 10, 16 ], [ 11, 18 ], [ 12, 11 ], [ 13, 12 ], [ 13, 19 ], [ 14, 17 ], [ 16, 13 ], [ 18, 14 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Gunnar knows Winston. Deborah knows Victor. Laura knows Pam. Celia knows Joel. Victor knows Jack. Dominic knows Susan. Laura knows Julio. Andre knows Corinne. Darren knows Celia. Henrietta knows Deborah. Henrietta knows Candice. Susan knows Terrence. Laura knows Gunnar. Corinne knows Dominic. Winston knows Andre. Joel knows Jaime. Jack knows Darren. Henrietta knows Luis. Which of Terrence and Jaime can Henrietta reach?", "answer": "Jaime", "steps": [ "Henrietta knows Deborah.", "Deborah knows Victor.", "Victor knows Jack.", "Jack knows Darren.", "Darren knows Celia.", "Celia knows Joel.", "Joel knows Jaime." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Henrietta", "Candice", "Deborah", "Jack", "Joel", "Darren", "Jaime", "Luis", "Victor", "Celia", "Laura", "Julio", "Gunnar", "Andre", "Susan", "Corinne", "Terrence", "Pam", "Winston", "Dominic" ], "edges": [ [ 0, 1 ], [ 0, 7 ], [ 0, 2 ], [ 2, 8 ], [ 3, 5 ], [ 4, 6 ], [ 5, 9 ], [ 8, 3 ], [ 9, 4 ], [ 10, 11 ], [ 10, 17 ], [ 10, 12 ], [ 12, 18 ], [ 13, 15 ], [ 14, 16 ], [ 15, 19 ], [ 18, 13 ], [ 19, 14 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Kay knows Neal. Calvin knows Olive. Gunnar knows Eunice. Burt knows Hunter. Amelia knows Lana. Gunnar knows Russell. Frank knows Gabriel. Russell knows Drew. Burt knows Wilma. Hunter knows Hailey. Drew knows Calvin. Amelia knows Ingrid. Gabriel knows Melody. Ingrid knows Frank. Hunter knows Gunnar. Cassidy knows Bart. Kay knows Amelia. Cassidy knows Kay. Which of Drew and Frank can Cassidy reach?", "answer": "Frank", "steps": [ "Cassidy knows Kay.", "Kay knows Amelia.", "Amelia knows Ingrid.", "Ingrid knows Frank." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Cassidy", "Gabriel", "Kay", "Frank", "Bart", "Melody", "Ingrid", "Neal", "Amelia", "Lana", "Burt", "Calvin", "Hunter", "Drew", "Wilma", "Olive", "Russell", "Hailey", "Gunnar", "Eunice" ], "edges": [ [ 0, 4 ], [ 0, 2 ], [ 1, 5 ], [ 2, 7 ], [ 2, 8 ], [ 3, 1 ], [ 6, 3 ], [ 8, 6 ], [ 8, 9 ], [ 10, 14 ], [ 10, 12 ], [ 11, 15 ], [ 12, 17 ], [ 12, 18 ], [ 13, 11 ], [ 16, 13 ], [ 18, 16 ], [ 18, 19 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Darin knows Asher. Stefan knows Geneva. Sandy knows Blanche. Asher knows Flora. Cliff knows Owen. Cliff knows Stefan. Brent knows Malik. Patrick knows Pauline. Flora knows Sandy. Cliff knows Autumn. Flora knows Vanessa. Stella knows Luz. Flora knows Jillian. Pauline knows Cliff. Stefan knows Destiny. Sandy knows Brent. Malik knows Anthony. Destiny knows Stella. Which of Luz and Anthony can Patrick reach?", "answer": "Luz", "steps": [ "Patrick knows Pauline.", "Pauline knows Cliff.", "Cliff knows Stefan.", "Stefan knows Destiny.", "Destiny knows Stella.", "Stella knows Luz." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Patrick", "Luz", "Stefan", "Owen", "Cliff", "Pauline", "Stella", "Destiny", "Geneva", "Autumn", "Darin", "Anthony", "Sandy", "Vanessa", "Flora", "Asher", "Malik", "Brent", "Blanche", "Jillian" ], "edges": [ [ 0, 5 ], [ 2, 7 ], [ 2, 8 ], [ 4, 3 ], [ 4, 2 ], [ 4, 9 ], [ 5, 4 ], [ 6, 1 ], [ 7, 6 ], [ 10, 15 ], [ 12, 17 ], [ 12, 18 ], [ 14, 13 ], [ 14, 12 ], [ 14, 19 ], [ 15, 14 ], [ 16, 11 ], [ 17, 16 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Boris knows Hendrix. Ann knows Khashayar. Hendrix knows Jessie. Boris knows Myrtle. Boris knows Stefan. Pedro knows Peter. Stefan knows Eric. Carlos knows Louise. Eric knows Denise. Greta knows Robin. Khashayar knows Carlos. Blake knows Greta. Blake knows Marvin. Marvin knows Ann. Blake knows Dean. Dean knows Jane. Myrtle knows Faye. Denise knows Pedro. Which of Louise and Peter can Blake reach?", "answer": "Louise", "steps": [ "Blake knows Marvin.", "Marvin knows Ann.", "Ann knows Khashayar.", "Khashayar knows Carlos.", "Carlos knows Louise." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Blake", "Dean", "Jane", "Louise", "Carlos", "Robin", "Greta", "Marvin", "Ann", "Khashayar", "Boris", "Myrtle", "Faye", "Peter", "Pedro", "Jessie", "Hendrix", "Stefan", "Eric", "Denise" ], "edges": [ [ 0, 1 ], [ 0, 6 ], [ 0, 7 ], [ 1, 2 ], [ 4, 3 ], [ 6, 5 ], [ 7, 8 ], [ 8, 9 ], [ 9, 4 ], [ 10, 11 ], [ 10, 16 ], [ 10, 17 ], [ 11, 12 ], [ 14, 13 ], [ 16, 15 ], [ 17, 18 ], [ 18, 19 ], [ 19, 14 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Marie knows Patrick. Mabel knows Donald. Clyde knows Marie. Carmen knows Mabel. Allison knows Carmen. Harmony knows Allison. Harriet knows Giselle. Kara knows Harriet. Yvette knows Kara. Kara knows Dawn. Carmen knows Keaton. Evan knows Yvette. Sierra knows Harmony. Harriet knows Clyde. Carmen knows Kamila. Allison knows Jill. Donald knows Jillian. Harriet knows Derrick. Which of Kara and Allison can Sierra reach?", "answer": "Allison", "steps": [ "Sierra knows Harmony.", "Harmony knows Allison." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Sierra", "Keaton", "Donald", "Jill", "Mabel", "Carmen", "Kamila", "Allison", "Jillian", "Harmony", "Evan", "Giselle", "Marie", "Dawn", "Clyde", "Harriet", "Derrick", "Kara", "Patrick", "Yvette" ], "edges": [ [ 0, 9 ], [ 2, 8 ], [ 4, 2 ], [ 5, 1 ], [ 5, 6 ], [ 5, 4 ], [ 7, 3 ], [ 7, 5 ], [ 9, 7 ], [ 10, 19 ], [ 12, 18 ], [ 14, 12 ], [ 15, 11 ], [ 15, 16 ], [ 15, 14 ], [ 17, 13 ], [ 17, 15 ], [ 19, 17 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Leland knows Janice. Langston knows Damian. Langston knows Edmund. Edmund knows Lauren. Andrea knows Todd. Janice knows Lars. Patrick knows Sydney. Cornelius knows Doris. Janice knows Andrea. Cornelius knows Wilbur. Patrick knows Horace. Graeme knows Dana. Doris knows Enid. Sydney knows Leland. Lars knows Marie. Wilbur knows Graeme. Lauren knows Cornelius. Todd knows Hank. Which of Dana and Hank can Langston reach?", "answer": "Dana", "steps": [ "Langston knows Edmund.", "Edmund knows Lauren.", "Lauren knows Cornelius.", "Cornelius knows Wilbur.", "Wilbur knows Graeme.", "Graeme knows Dana." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Langston", "Enid", "Dana", "Damian", "Doris", "Wilbur", "Cornelius", "Graeme", "Lauren", "Edmund", "Patrick", "Marie", "Hank", "Horace", "Lars", "Andrea", "Janice", "Todd", "Leland", "Sydney" ], "edges": [ [ 0, 3 ], [ 0, 9 ], [ 4, 1 ], [ 5, 7 ], [ 6, 4 ], [ 6, 5 ], [ 7, 2 ], [ 8, 6 ], [ 9, 8 ], [ 10, 13 ], [ 10, 19 ], [ 14, 11 ], [ 15, 17 ], [ 16, 14 ], [ 16, 15 ], [ 17, 12 ], [ 18, 16 ], [ 19, 18 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Carla knows Jem. Guillermo knows Devon. Guillermo knows Darla. Esme knows Milo. Jeanne knows Matthew. Carla knows Amanda. Lark knows Darius. Darius knows Duncan. Guillermo knows Diego. Rocco knows Cain. Guillermo knows Troy. Duncan knows Guillermo. Katrina knows Carla. Carla knows Rocco. Troy knows Jeanne. Milo knows Katrina. Carla knows Rosa. Cain knows Travis. Which of Milo and Darius can Esme reach?", "answer": "Milo", "steps": [ "Esme knows Milo." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Esme", "Rosa", "Katrina", "Amanda", "Carla", "Travis", "Milo", "Jem", "Rocco", "Cain", "Lark", "Darla", "Duncan", "Diego", "Guillermo", "Matthew", "Darius", "Devon", "Troy", "Jeanne" ], "edges": [ [ 0, 6 ], [ 2, 4 ], [ 4, 1 ], [ 4, 3 ], [ 4, 7 ], [ 4, 8 ], [ 6, 2 ], [ 8, 9 ], [ 9, 5 ], [ 10, 16 ], [ 12, 14 ], [ 14, 11 ], [ 14, 13 ], [ 14, 17 ], [ 14, 18 ], [ 16, 12 ], [ 18, 19 ], [ 19, 15 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Federico knows Coral. Jim knows Elvis. Elvis knows Cora. Saul knows Edwin. Grant knows Sandy. Corinne knows Pablo. Gabe knows George. Gabe knows Clifford. Saul knows Grant. Morris knows Cate. Gabe knows Chris. Landon knows Morris. Sandy knows Federico. Clifford knows Landon. Grant knows Corinne. Clifford knows Jim. Pablo knows Jolene. Saul knows Hazel. Which of Pablo and Elvis can Saul reach?", "answer": "Pablo", "steps": [ "Saul knows Grant.", "Grant knows Corinne.", "Corinne knows Pablo." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Saul", "Pablo", "Grant", "Federico", "Sandy", "Corinne", "Coral", "Edwin", "Hazel", "Jolene", "Gabe", "Elvis", "Clifford", "Morris", "Landon", "Jim", "Cate", "George", "Chris", "Cora" ], "edges": [ [ 0, 7 ], [ 0, 8 ], [ 0, 2 ], [ 1, 9 ], [ 2, 4 ], [ 2, 5 ], [ 3, 6 ], [ 4, 3 ], [ 5, 1 ], [ 10, 17 ], [ 10, 18 ], [ 10, 12 ], [ 11, 19 ], [ 12, 14 ], [ 12, 15 ], [ 13, 16 ], [ 14, 13 ], [ 15, 11 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Brooks knows Laura. Jon knows Bonnie. James knows Emery. Brad knows Geraldine. Jon knows Brad. Geraldine knows Wyatt. Brad knows Reed. Laura knows Katrina. Reed knows Harlan. Candice knows Aiden. Wyatt knows Brooks. Chad knows Jasmine. Terrence knows Keegan. Keegan knows Chad. Terrence knows Dayton. Keegan knows Candice. Emery knows Helen. Jasmine knows James. Which of Wyatt and Jasmine can Terrence reach?", "answer": "Jasmine", "steps": [ "Terrence knows Keegan.", "Keegan knows Chad.", "Chad knows Jasmine." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Terrence", "Keegan", "Chad", "James", "Jasmine", "Dayton", "Aiden", "Candice", "Emery", "Helen", "Jon", "Brad", "Geraldine", "Brooks", "Wyatt", "Bonnie", "Harlan", "Reed", "Laura", "Katrina" ], "edges": [ [ 0, 5 ], [ 0, 1 ], [ 1, 7 ], [ 1, 2 ], [ 2, 4 ], [ 3, 8 ], [ 4, 3 ], [ 7, 6 ], [ 8, 9 ], [ 10, 15 ], [ 10, 11 ], [ 11, 17 ], [ 11, 12 ], [ 12, 14 ], [ 13, 18 ], [ 14, 13 ], [ 17, 16 ], [ 18, 19 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Fleur knows Hailey. Samantha knows Archer. Loretta knows Charlotte. Hadley knows Burt. Harriet knows Asher. Burt knows Samantha. Fritz knows Hunter. Teresa knows Norman. Harriet knows Allan. Harriet knows Loretta. Hailey knows Lottie. Burt knows Teresa. Amanda knows Hayes. Burt knows Ross. Hayes knows Fritz. Hunter knows Harriet. Lottie knows Hadley. Asher knows Hank. Which of Hadley and Hunter can Amanda reach?", "answer": "Hunter", "steps": [ "Amanda knows Hayes.", "Hayes knows Fritz.", "Fritz knows Hunter." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Amanda", "Allan", "Hank", "Hunter", "Harriet", "Loretta", "Asher", "Fritz", "Hayes", "Charlotte", "Fleur", "Ross", "Archer", "Hadley", "Burt", "Teresa", "Samantha", "Lottie", "Hailey", "Norman" ], "edges": [ [ 0, 8 ], [ 3, 4 ], [ 4, 1 ], [ 4, 6 ], [ 4, 5 ], [ 5, 9 ], [ 6, 2 ], [ 7, 3 ], [ 8, 7 ], [ 10, 18 ], [ 13, 14 ], [ 14, 11 ], [ 14, 16 ], [ 14, 15 ], [ 15, 19 ], [ 16, 12 ], [ 17, 13 ], [ 18, 17 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Wilbur knows Xavier. Landon knows Wilbur. Holly knows Vanessa. Abigail knows Arden. Arden knows Edison. Vanessa knows Leonard. Lyle knows Devin. Abigail knows Holly. Beatrice knows Theodore. Lennox knows Conrad. Rowan knows Abigail. Theodore knows Landon. Theodore knows Lennox. Colin knows Ryan. Edison knows Luz. Conrad knows Louis. Devin knows Rowan. Ryan knows Beatrice. Which of Xavier and Leonard can Colin reach?", "answer": "Xavier", "steps": [ "Colin knows Ryan.", "Ryan knows Beatrice.", "Beatrice knows Theodore.", "Theodore knows Landon.", "Landon knows Wilbur.", "Wilbur knows Xavier." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Colin", "Landon", "Conrad", "Louis", "Theodore", "Beatrice", "Wilbur", "Xavier", "Lennox", "Ryan", "Lyle", "Holly", "Edison", "Luz", "Abigail", "Rowan", "Vanessa", "Leonard", "Arden", "Devin" ], "edges": [ [ 0, 9 ], [ 1, 6 ], [ 2, 3 ], [ 4, 1 ], [ 4, 8 ], [ 5, 4 ], [ 6, 7 ], [ 8, 2 ], [ 9, 5 ], [ 10, 19 ], [ 11, 16 ], [ 12, 13 ], [ 14, 11 ], [ 14, 18 ], [ 15, 14 ], [ 16, 17 ], [ 18, 12 ], [ 19, 15 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Ford knows Sidney. Yvonne knows Winifred. Jeffery knows Alice. Diane knows Ford. Ainsley knows Rocco. Harry knows Ashley. Rocco knows Yvonne. Cordelia knows Vance. Effie knows Harry. Cordelia knows Latoya. Ainsley knows Jeffery. Vance knows Effie. Harry knows Janice. Wendy knows Roy. Latoya knows Bryan. Janice knows Wendy. Winifred knows Heath. Winifred knows Diane. Which of Sidney and Roy can Cordelia reach?", "answer": "Roy", "steps": [ "Cordelia knows Vance.", "Vance knows Effie.", "Effie knows Harry.", "Harry knows Janice.", "Janice knows Wendy.", "Wendy knows Roy." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Cordelia", "Bryan", "Ashley", "Latoya", "Effie", "Roy", "Harry", "Vance", "Wendy", "Janice", "Ainsley", "Alice", "Heath", "Jeffery", "Yvonne", "Sidney", "Winifred", "Rocco", "Ford", "Diane" ], "edges": [ [ 0, 3 ], [ 0, 7 ], [ 3, 1 ], [ 4, 6 ], [ 6, 2 ], [ 6, 9 ], [ 7, 4 ], [ 8, 5 ], [ 9, 8 ], [ 10, 13 ], [ 10, 17 ], [ 13, 11 ], [ 14, 16 ], [ 16, 12 ], [ 16, 19 ], [ 17, 14 ], [ 18, 15 ], [ 19, 18 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Gemma knows Marie. Cameron knows Paula. Calvin knows Lois. Ashley knows Calvin. Paula knows Kira. Lois knows Roger. Calvin knows Vivian. Roger knows Carrie. Marie knows Karla. Gage knows Hannah. Kira knows Gemma. Carrie knows Martin. Aaron knows Jocelyn. Paula knows Aaron. Aaron knows Zane. Calvin knows Gage. Paula knows Opal. Gage knows Lenora. Which of Paula and Calvin can Cameron reach?", "answer": "Paula", "steps": [ "Cameron knows Paula." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Cameron", "Kira", "Marie", "Gemma", "Karla", "Paula", "Aaron", "Opal", "Zane", "Jocelyn", "Ashley", "Lois", "Carrie", "Roger", "Martin", "Calvin", "Gage", "Vivian", "Hannah", "Lenora" ], "edges": [ [ 0, 5 ], [ 1, 3 ], [ 2, 4 ], [ 3, 2 ], [ 5, 1 ], [ 5, 7 ], [ 5, 6 ], [ 6, 8 ], [ 6, 9 ], [ 10, 15 ], [ 11, 13 ], [ 12, 14 ], [ 13, 12 ], [ 15, 11 ], [ 15, 17 ], [ 15, 16 ], [ 16, 18 ], [ 16, 19 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Scott knows Loretta. Eldon knows Clifford. Isaac knows Magdalena. Eldon knows Amelia. Mason knows Kareem. Mason knows Darnell. Amelia knows Pete. Alison knows Tracy. Kareem knows Alison. Isaac knows Elodie. Walter knows Isaac. Drew knows Scott. Pete knows Diego. Sadie knows Mason. Scott knows Norman. Norman knows Eldon. Scott knows Franklin. Isaac knows Sadie. Which of Diego and Tracy can Drew reach?", "answer": "Diego", "steps": [ "Drew knows Scott.", "Scott knows Norman.", "Norman knows Eldon.", "Eldon knows Amelia.", "Amelia knows Pete.", "Pete knows Diego." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Drew", "Clifford", "Norman", "Amelia", "Diego", "Franklin", "Pete", "Loretta", "Eldon", "Scott", "Walter", "Darnell", "Sadie", "Kareem", "Tracy", "Elodie", "Alison", "Magdalena", "Mason", "Isaac" ], "edges": [ [ 0, 9 ], [ 2, 8 ], [ 3, 6 ], [ 6, 4 ], [ 8, 1 ], [ 8, 3 ], [ 9, 5 ], [ 9, 7 ], [ 9, 2 ], [ 10, 19 ], [ 12, 18 ], [ 13, 16 ], [ 16, 14 ], [ 18, 11 ], [ 18, 13 ], [ 19, 15 ], [ 19, 17 ], [ 19, 12 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Quinn knows Kristina. Ava knows Rufus. Bette knows Raymond. Ava knows Anita. Fanny knows Nicole. Janice knows Vivian. Janice knows Enid. Janice knows Quinn. Rufus knows Fanny. Nicole knows Enrique. Madeline knows Griffith. Kristina knows Edith. Ava knows Bette. Enid knows Anton. Glenda knows Madeline. Edith knows Glenda. Enrique knows Jonathan. Jonathan knows Dahlia. Which of Nicole and Edith can Ava reach?", "answer": "Nicole", "steps": [ "Ava knows Rufus.", "Rufus knows Fanny.", "Fanny knows Nicole." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Ava", "Raymond", "Dahlia", "Jonathan", "Enrique", "Rufus", "Bette", "Nicole", "Anita", "Fanny", "Janice", "Anton", "Griffith", "Madeline", "Glenda", "Quinn", "Enid", "Edith", "Vivian", "Kristina" ], "edges": [ [ 0, 6 ], [ 0, 8 ], [ 0, 5 ], [ 3, 2 ], [ 4, 3 ], [ 5, 9 ], [ 6, 1 ], [ 7, 4 ], [ 9, 7 ], [ 10, 16 ], [ 10, 18 ], [ 10, 15 ], [ 13, 12 ], [ 14, 13 ], [ 15, 19 ], [ 16, 11 ], [ 17, 14 ], [ 19, 17 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Stacy knows Blair. Leland knows Homer. Blair knows Maggie. Arnold knows Eugene. Abigail knows Russ. Jon knows Grace. Stacy knows Gwen. Gwen knows Dee. Gwen knows Zoe. Leland knows India. Gwen knows Ariana. Dee knows Arnold. Russ knows Leland. Perry knows Barry. Lorna knows Stacy. Russ knows Perry. Gage knows Jon. Leland knows Gage. Which of Gwen and Leland can Abigail reach?", "answer": "Leland", "steps": [ "Abigail knows Russ.", "Russ knows Leland." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Abigail", "India", "Barry", "Homer", "Perry", "Leland", "Grace", "Gage", "Jon", "Russ", "Lorna", "Zoe", "Maggie", "Ariana", "Blair", "Gwen", "Eugene", "Dee", "Arnold", "Stacy" ], "edges": [ [ 0, 9 ], [ 4, 2 ], [ 5, 1 ], [ 5, 3 ], [ 5, 7 ], [ 7, 8 ], [ 8, 6 ], [ 9, 4 ], [ 9, 5 ], [ 10, 19 ], [ 14, 12 ], [ 15, 11 ], [ 15, 13 ], [ 15, 17 ], [ 17, 18 ], [ 18, 16 ], [ 19, 14 ], [ 19, 15 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Maude knows Casey. Jamie knows Fraser. Uma knows Clay. Yasmin knows Cruz. Clay knows Kristin. Naomi knows Agnes. Fraser knows Denise. Rowan knows Jaime. Devin knows Yasmin. Marcia knows Tina. Terrence knows Jamie. Devin knows Uma. Jamie knows Naomi. Rowan knows Marcia. Brynn knows Terrence. Jaime knows Devin. Brynn knows Maude. Denise knows Erma. Which of Fraser and Uma can Rowan reach?", "answer": "Uma", "steps": [ "Rowan knows Jaime.", "Jaime knows Devin.", "Devin knows Uma." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Rowan", "Tina", "Cruz", "Uma", "Marcia", "Yasmin", "Clay", "Jaime", "Kristin", "Devin", "Brynn", "Casey", "Agnes", "Fraser", "Maude", "Naomi", "Denise", "Terrence", "Erma", "Jamie" ], "edges": [ [ 0, 4 ], [ 0, 7 ], [ 3, 6 ], [ 4, 1 ], [ 5, 2 ], [ 6, 8 ], [ 7, 9 ], [ 9, 5 ], [ 9, 3 ], [ 10, 14 ], [ 10, 17 ], [ 13, 16 ], [ 14, 11 ], [ 15, 12 ], [ 16, 18 ], [ 17, 19 ], [ 19, 15 ], [ 19, 13 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Ernest knows Anna. Ida knows Ernest. Vincent knows Ted. Anna knows Emma. Etta knows Uma. Ida knows Ronald. Ted knows Leroy. Vincent knows Pedro. Brad knows Candice. Ted knows Ann. Todd knows Madeline. Vincent knows Brad. Pedro knows Erma. Ernest knows Humphrey. Anna knows Malik. Ernest knows Todd. Humphrey knows Ernesto. Etta knows Vincent. Which of Ted and Anna can Etta reach?", "answer": "Ted", "steps": [ "Etta knows Vincent.", "Vincent knows Ted." ], "difficulty": 2, "original_distance": 3, "idx_to_symbol": [ "Etta", "Ted", "Ann", "Brad", "Uma", "Erma", "Vincent", "Pedro", "Candice", "Leroy", "Ida", "Anna", "Malik", "Todd", "Ronald", "Ernesto", "Ernest", "Humphrey", "Madeline", "Emma" ], "edges": [ [ 0, 4 ], [ 0, 6 ], [ 1, 2 ], [ 1, 9 ], [ 3, 8 ], [ 6, 7 ], [ 6, 3 ], [ 6, 1 ], [ 7, 5 ], [ 10, 14 ], [ 10, 16 ], [ 11, 12 ], [ 11, 19 ], [ 13, 18 ], [ 16, 17 ], [ 16, 13 ], [ 16, 11 ], [ 17, 15 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Dean knows Drake. Chandler knows Fernando. Jarvis knows Skyler. Keegan knows Jarvis. Cody knows Walter. Walter knows Opal. Ernesto knows Seth. Fisher knows Ibrahim. Mia knows Heath. Cody knows Bart. Bart knows Chandler. Keegan knows Alice. Odette knows Cody. Seth knows Mia. Skyler knows Ernesto. Fernando knows Fisher. Jarvis knows Dean. Odette knows Curtis. Which of Fisher and Mia can Odette reach?", "answer": "Fisher", "steps": [ "Odette knows Cody.", "Cody knows Bart.", "Bart knows Chandler.", "Chandler knows Fernando.", "Fernando knows Fisher." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Odette", "Chandler", "Ibrahim", "Fisher", "Bart", "Opal", "Cody", "Curtis", "Fernando", "Walter", "Keegan", "Ernesto", "Heath", "Mia", "Skyler", "Drake", "Jarvis", "Alice", "Seth", "Dean" ], "edges": [ [ 0, 7 ], [ 0, 6 ], [ 1, 8 ], [ 3, 2 ], [ 4, 1 ], [ 6, 4 ], [ 6, 9 ], [ 8, 3 ], [ 9, 5 ], [ 10, 17 ], [ 10, 16 ], [ 11, 18 ], [ 13, 12 ], [ 14, 11 ], [ 16, 14 ], [ 16, 19 ], [ 18, 13 ], [ 19, 15 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Jade knows Mara. Garrett knows Logan. Larry knows Desmond. Mara knows Roy. Marie knows Kira. Keegan knows Gail. Keegan knows Hunter. Laverne knows Keegan. Gail knows Neal. Jeffery knows Annie. Hattie knows Marie. Jeffery knows Larry. Drew knows Laverne. Logan knows Susanne. Drew knows Garrett. Marie knows Jade. Kira knows Jeffery. Sharon knows Drew. Which of Jeffery and Keegan can Sharon reach?", "answer": "Keegan", "steps": [ "Sharon knows Drew.", "Drew knows Laverne.", "Laverne knows Keegan." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Sharon", "Drew", "Laverne", "Hunter", "Gail", "Neal", "Garrett", "Keegan", "Susanne", "Logan", "Hattie", "Marie", "Kira", "Annie", "Larry", "Desmond", "Jade", "Jeffery", "Roy", "Mara" ], "edges": [ [ 0, 1 ], [ 1, 2 ], [ 1, 6 ], [ 2, 7 ], [ 4, 5 ], [ 6, 9 ], [ 7, 3 ], [ 7, 4 ], [ 9, 8 ], [ 10, 11 ], [ 11, 12 ], [ 11, 16 ], [ 12, 17 ], [ 14, 15 ], [ 16, 19 ], [ 17, 13 ], [ 17, 14 ], [ 19, 18 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Estella knows Israel. Percy knows Cornelius. Rocco knows Ralph. Sam knows Cooper. Estella knows Percy. Graham knows Basil. Cooper knows Graham. Herman knows Clark. Dalton knows Herman. Cornelius knows Ursula. Basil knows Camille. Sam knows Rocco. Herman knows Don. Dalton knows Estella. Cooper knows Monica. Darin knows Sam. Rocco knows Adelaide. Bonnie knows Dalton. Which of Percy and Graham can Bonnie reach?", "answer": "Percy", "steps": [ "Bonnie knows Dalton.", "Dalton knows Estella.", "Estella knows Percy." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Bonnie", "Don", "Cornelius", "Ursula", "Dalton", "Herman", "Percy", "Estella", "Clark", "Israel", "Darin", "Ralph", "Basil", "Camille", "Sam", "Rocco", "Graham", "Cooper", "Adelaide", "Monica" ], "edges": [ [ 0, 4 ], [ 2, 3 ], [ 4, 5 ], [ 4, 7 ], [ 5, 1 ], [ 5, 8 ], [ 6, 2 ], [ 7, 6 ], [ 7, 9 ], [ 10, 14 ], [ 12, 13 ], [ 14, 15 ], [ 14, 17 ], [ 15, 11 ], [ 15, 18 ], [ 16, 12 ], [ 17, 16 ], [ 17, 19 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Daniel knows Cora. Kaleb knows Cindy. Cindy knows Jocelyn. Floyd knows Rex. Carmen knows Daniel. Beverly knows Grady. Frankie knows Belinda. Carmen knows Zane. Frankie knows Kaleb. Wanda knows Mack. Belinda knows Wanda. Eunice knows Itzel. Itzel knows Floyd. Kaleb knows Vivian. Itzel knows Dexter. Belinda knows Beverly. Eunice knows Carmen. Dexter knows Sonia. Which of Carmen and Kaleb can Eunice reach?", "answer": "Carmen", "steps": [ "Eunice knows Carmen." ], "difficulty": 1, "original_distance": 3, "idx_to_symbol": [ "Eunice", "Carmen", "Itzel", "Dexter", "Cora", "Floyd", "Sonia", "Zane", "Rex", "Daniel", "Frankie", "Kaleb", "Belinda", "Beverly", "Jocelyn", "Wanda", "Grady", "Vivian", "Mack", "Cindy" ], "edges": [ [ 0, 2 ], [ 0, 1 ], [ 1, 7 ], [ 1, 9 ], [ 2, 3 ], [ 2, 5 ], [ 3, 6 ], [ 5, 8 ], [ 9, 4 ], [ 10, 12 ], [ 10, 11 ], [ 11, 17 ], [ 11, 19 ], [ 12, 13 ], [ 12, 15 ], [ 13, 16 ], [ 15, 18 ], [ 19, 14 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Jeffery knows Keegan. John knows Dexter. Adrian knows Max. Eugenia knows John. Sarah knows Shelly. Milton knows Crystal. Crystal knows Paula. Max knows Darren. Holly knows Shaun. Keegan knows Gail. Dexter knows Milton. Gail knows Eugenia. Shaun knows Curtis. Darren knows Sarah. Shelly knows Carl. Curtis knows Adrian. Jeffery knows Chelsea. Holly knows Neal. Which of Sarah and Milton can Holly reach?", "answer": "Sarah", "steps": [ "Holly knows Shaun.", "Shaun knows Curtis.", "Curtis knows Adrian.", "Adrian knows Max.", "Max knows Darren.", "Darren knows Sarah." ], "difficulty": 6, "original_distance": 8, "idx_to_symbol": [ "Holly", "Adrian", "Shaun", "Carl", "Max", "Shelly", "Curtis", "Darren", "Neal", "Sarah", "Jeffery", "Eugenia", "Keegan", "Paula", "John", "Crystal", "Gail", "Dexter", "Chelsea", "Milton" ], "edges": [ [ 0, 8 ], [ 0, 2 ], [ 1, 4 ], [ 2, 6 ], [ 4, 7 ], [ 5, 3 ], [ 6, 1 ], [ 7, 9 ], [ 9, 5 ], [ 10, 18 ], [ 10, 12 ], [ 11, 14 ], [ 12, 16 ], [ 14, 17 ], [ 15, 13 ], [ 16, 11 ], [ 17, 19 ], [ 19, 15 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Aiden knows Larissa. Calvin knows Mabel. Aiden knows Declan. Anastasia knows Jermaine. Anastasia knows Leticia. Aiden knows Willard. Mabel knows Preston. Eamon knows Sandra. Jocelyn knows Trevor. Donna knows Anastasia. Jocelyn knows Larry. Larissa knows Jocelyn. Aiden knows Frida. Anastasia knows Eamon. Mabel knows Beth. Anastasia knows Calvin. Sean knows Aiden. Willard knows Gerard. Which of Calvin and Larissa can Donna reach?", "answer": "Calvin", "steps": [ "Donna knows Anastasia.", "Anastasia knows Calvin." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Donna", "Leticia", "Calvin", "Preston", "Anastasia", "Sandra", "Jermaine", "Beth", "Mabel", "Eamon", "Sean", "Declan", "Larissa", "Trevor", "Aiden", "Gerard", "Frida", "Larry", "Jocelyn", "Willard" ], "edges": [ [ 0, 4 ], [ 2, 8 ], [ 4, 1 ], [ 4, 6 ], [ 4, 2 ], [ 4, 9 ], [ 8, 3 ], [ 8, 7 ], [ 9, 5 ], [ 10, 14 ], [ 12, 18 ], [ 14, 11 ], [ 14, 16 ], [ 14, 12 ], [ 14, 19 ], [ 18, 13 ], [ 18, 17 ], [ 19, 15 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Ross knows Sybil. David knows Darnell. Fergus knows Roland. Stacy knows Lyle. Kelsey knows Giselle. Roland knows Richard. Hugh knows Terrence. Terrence knows Grady. Sybil knows Parsa. Sybil knows Michelle. Hugh knows Ross. Richard knows Kelsey. Parsa knows Ernest. Roland knows Derrick. Fergus knows Yara. Kelsey knows Stacy. Derrick knows Livia. David knows Hugh. Which of Richard and Ross can David reach?", "answer": "Ross", "steps": [ "David knows Hugh.", "Hugh knows Ross." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "David", "Ross", "Sybil", "Ernest", "Darnell", "Michelle", "Hugh", "Terrence", "Grady", "Parsa", "Fergus", "Richard", "Kelsey", "Lyle", "Yara", "Giselle", "Roland", "Derrick", "Livia", "Stacy" ], "edges": [ [ 0, 4 ], [ 0, 6 ], [ 1, 2 ], [ 2, 5 ], [ 2, 9 ], [ 6, 7 ], [ 6, 1 ], [ 7, 8 ], [ 9, 3 ], [ 10, 14 ], [ 10, 16 ], [ 11, 12 ], [ 12, 15 ], [ 12, 19 ], [ 16, 17 ], [ 16, 11 ], [ 17, 18 ], [ 19, 13 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Candice knows Levi. Ariel knows Candice. Devon knows Todd. Devon knows Marshall. Alexa knows Jasmine. Albert knows Kingsley. Erin knows Faye. Sadie knows Kyle. Sadie knows Kira. Sadie knows Alexa. Alexa knows April. Lorenzo knows Reed. Faye knows Chance. Ariel knows Devon. Devon knows Lorenzo. Lorenzo knows Albert. Erin knows Sadie. Jasmine knows Clarissa. Which of Clarissa and Kingsley can Ariel reach?", "answer": "Kingsley", "steps": [ "Ariel knows Devon.", "Devon knows Lorenzo.", "Lorenzo knows Albert.", "Albert knows Kingsley." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Ariel", "Kingsley", "Lorenzo", "Candice", "Levi", "Albert", "Todd", "Reed", "Marshall", "Devon", "Erin", "Clarissa", "Alexa", "Faye", "Chance", "Jasmine", "Kyle", "April", "Kira", "Sadie" ], "edges": [ [ 0, 3 ], [ 0, 9 ], [ 2, 5 ], [ 2, 7 ], [ 3, 4 ], [ 5, 1 ], [ 9, 6 ], [ 9, 2 ], [ 9, 8 ], [ 10, 13 ], [ 10, 19 ], [ 12, 15 ], [ 12, 17 ], [ 13, 14 ], [ 15, 11 ], [ 19, 16 ], [ 19, 12 ], [ 19, 18 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Janet knows Gideon. Gustavo knows Guy. Gideon knows Alejandro. Bridget knows Anastasia. Alejandro knows Ernest. June knows Leo. Alejandro knows Brandon. Becky knows Paul. Russell knows Lambert. Wilson knows Alma. Paul knows Bridget. Lambert knows Becky. Gideon knows Wilson. Lambert knows June. June knows Lamar. Wilson knows Gustavo. Becky knows Susanne. Guy knows Stanley. Which of Wilson and Becky can Russell reach?", "answer": "Becky", "steps": [ "Russell knows Lambert.", "Lambert knows Becky." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Russell", "Lambert", "Susanne", "Anastasia", "Bridget", "Leo", "June", "Paul", "Lamar", "Becky", "Janet", "Gideon", "Alma", "Stanley", "Guy", "Brandon", "Alejandro", "Gustavo", "Ernest", "Wilson" ], "edges": [ [ 0, 1 ], [ 1, 6 ], [ 1, 9 ], [ 4, 3 ], [ 6, 5 ], [ 6, 8 ], [ 7, 4 ], [ 9, 2 ], [ 9, 7 ], [ 10, 11 ], [ 11, 16 ], [ 11, 19 ], [ 14, 13 ], [ 16, 15 ], [ 16, 18 ], [ 17, 14 ], [ 19, 12 ], [ 19, 17 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Harold knows Jules. Houston knows Roland. Kristin knows Fisher. Dick knows Ariel. Valerie knows Jane. Derrick knows Yvonne. Elena knows Harold. Valerie knows Houston. Yvonne knows Elena. Dee knows Maureen. Tyler knows Aurora. Noah knows Fritz. Derrick knows Wesley. Yvonne knows Noah. Maureen knows Valerie. Tyler knows Dee. Harold knows Dick. Dee knows Kristin. Which of Elena and Maureen can Tyler reach?", "answer": "Maureen", "steps": [ "Tyler knows Dee.", "Dee knows Maureen." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Tyler", "Maureen", "Valerie", "Jane", "Dee", "Houston", "Fisher", "Aurora", "Kristin", "Roland", "Derrick", "Elena", "Harold", "Jules", "Yvonne", "Dick", "Fritz", "Wesley", "Noah", "Ariel" ], "edges": [ [ 0, 7 ], [ 0, 4 ], [ 1, 2 ], [ 2, 3 ], [ 2, 5 ], [ 4, 8 ], [ 4, 1 ], [ 5, 9 ], [ 8, 6 ], [ 10, 17 ], [ 10, 14 ], [ 11, 12 ], [ 12, 13 ], [ 12, 15 ], [ 14, 18 ], [ 14, 11 ], [ 15, 19 ], [ 18, 16 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Ariel knows Hope. Tyler knows Fritz. Marcia knows Celia. Henry knows Jeffery. Tyler knows Mary. Tyler knows Cruz. Brandon knows Constance. Brandon knows Ariel. Mary knows Leslie. Brandon knows Alvin. Celia knows Frank. Marcia knows Ebony. Chance knows Sonia. Henry knows Pearl. Leslie knows Brandon. Frank knows Henry. Marcia knows Allison. Henry knows Chance. Which of Sonia and Hope can Tyler reach?", "answer": "Hope", "steps": [ "Tyler knows Mary.", "Mary knows Leslie.", "Leslie knows Brandon.", "Brandon knows Ariel.", "Ariel knows Hope." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Tyler", "Mary", "Constance", "Hope", "Leslie", "Cruz", "Ariel", "Fritz", "Brandon", "Alvin", "Marcia", "Celia", "Jeffery", "Sonia", "Frank", "Ebony", "Chance", "Allison", "Henry", "Pearl" ], "edges": [ [ 0, 5 ], [ 0, 7 ], [ 0, 1 ], [ 1, 4 ], [ 4, 8 ], [ 6, 3 ], [ 8, 2 ], [ 8, 6 ], [ 8, 9 ], [ 10, 15 ], [ 10, 17 ], [ 10, 11 ], [ 11, 14 ], [ 14, 18 ], [ 16, 13 ], [ 18, 12 ], [ 18, 16 ], [ 18, 19 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Patrick knows Brent. Lena knows Edgar. Leon knows Dustin. Shelby knows Xander. Dominic knows Lena. Monica knows Griffith. Edgar knows Pete. Patrick knows Monica. Everett knows Shelby. Monica knows Erin. Rocco knows Eloise. Xander knows Rocco. Shelby knows Kit. Griffith knows Dominic. Everett knows Brooks. Neville knows Patrick. Hazel knows Everett. Eloise knows Leon. Which of Dominic and Rocco can Neville reach?", "answer": "Dominic", "steps": [ "Neville knows Patrick.", "Patrick knows Monica.", "Monica knows Griffith.", "Griffith knows Dominic." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Neville", "Pete", "Dominic", "Brent", "Lena", "Griffith", "Monica", "Erin", "Patrick", "Edgar", "Hazel", "Dustin", "Rocco", "Brooks", "Eloise", "Xander", "Shelby", "Kit", "Everett", "Leon" ], "edges": [ [ 0, 8 ], [ 2, 4 ], [ 4, 9 ], [ 5, 2 ], [ 6, 7 ], [ 6, 5 ], [ 8, 3 ], [ 8, 6 ], [ 9, 1 ], [ 10, 18 ], [ 12, 14 ], [ 14, 19 ], [ 15, 12 ], [ 16, 17 ], [ 16, 15 ], [ 18, 13 ], [ 18, 16 ], [ 19, 11 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Geraldine knows Claudia. Michelle knows Carlos. Geraldine knows Cecilia. Arnold knows Grace. Michelle knows Marlene. Arnold knows Marco. Marco knows Trudy. Michelle knows Roy. Trudy knows Mabel. Houston knows Caroline. Arnold knows Houston. Trudy knows Elliot. Marco knows Edison. Marlene knows Jeremy. Marlene knows Geraldine. Roy knows Greta. Arnold knows Jerome. Michelle knows Denver. Which of Trudy and Geraldine can Arnold reach?", "answer": "Trudy", "steps": [ "Arnold knows Marco.", "Marco knows Trudy." ], "difficulty": 2, "original_distance": 3, "idx_to_symbol": [ "Arnold", "Houston", "Caroline", "Trudy", "Jerome", "Grace", "Marco", "Edison", "Mabel", "Elliot", "Michelle", "Roy", "Greta", "Geraldine", "Carlos", "Denver", "Marlene", "Jeremy", "Claudia", "Cecilia" ], "edges": [ [ 0, 1 ], [ 0, 4 ], [ 0, 5 ], [ 0, 6 ], [ 1, 2 ], [ 3, 8 ], [ 3, 9 ], [ 6, 7 ], [ 6, 3 ], [ 10, 11 ], [ 10, 14 ], [ 10, 15 ], [ 10, 16 ], [ 11, 12 ], [ 13, 18 ], [ 13, 19 ], [ 16, 17 ], [ 16, 13 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Leon knows Taylor. Ainsley knows Leon. Eamon knows Michelle. Leon knows Saul. Helene knows Aspen. Taylor knows Kelsey. Ainsley knows Alana. Kelsey knows Douglas. Lillian knows Maya. Celia knows Graham. Helene knows Martha. Taylor knows Larissa. Martha knows Susan. Maya knows Helene. Maya knows Jakob. Douglas knows Celia. Lillian knows Yvonne. Susan knows Eamon. Which of Douglas and Susan can Lillian reach?", "answer": "Susan", "steps": [ "Lillian knows Maya.", "Maya knows Helene.", "Helene knows Martha.", "Martha knows Susan." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Lillian", "Michelle", "Yvonne", "Aspen", "Jakob", "Helene", "Susan", "Martha", "Maya", "Eamon", "Ainsley", "Graham", "Alana", "Larissa", "Saul", "Taylor", "Douglas", "Kelsey", "Leon", "Celia" ], "edges": [ [ 0, 2 ], [ 0, 8 ], [ 5, 3 ], [ 5, 7 ], [ 6, 9 ], [ 7, 6 ], [ 8, 4 ], [ 8, 5 ], [ 9, 1 ], [ 10, 12 ], [ 10, 18 ], [ 15, 13 ], [ 15, 17 ], [ 16, 19 ], [ 17, 16 ], [ 18, 14 ], [ 18, 15 ], [ 19, 11 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Lorraine knows Hampton. Eve knows Electra. Charles knows Winston. Elaine knows Ember. Julio knows Lorraine. Ember knows Judy. Everett knows Isadora. Francis knows Karina. Ross knows Eve. Clayton knows Charles. India knows Jared. Francis knows Emily. Karina knows Darnell. India knows Clayton. Winston knows Everett. Electra knows Julio. Isadora knows Elaine. Darnell knows Ross. Which of Electra and Isadora can India reach?", "answer": "Isadora", "steps": [ "India knows Clayton.", "Clayton knows Charles.", "Charles knows Winston.", "Winston knows Everett.", "Everett knows Isadora." ], "difficulty": 5, "original_distance": 8, "idx_to_symbol": [ "India", "Ember", "Everett", "Winston", "Judy", "Jared", "Elaine", "Charles", "Isadora", "Clayton", "Francis", "Lorraine", "Eve", "Ross", "Hampton", "Emily", "Julio", "Darnell", "Electra", "Karina" ], "edges": [ [ 0, 5 ], [ 0, 9 ], [ 1, 4 ], [ 2, 8 ], [ 3, 2 ], [ 6, 1 ], [ 7, 3 ], [ 8, 6 ], [ 9, 7 ], [ 10, 15 ], [ 10, 19 ], [ 11, 14 ], [ 12, 18 ], [ 13, 12 ], [ 16, 11 ], [ 17, 13 ], [ 18, 16 ], [ 19, 17 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Joanna knows Earle. Rhonda knows Katherine. Greta knows Rhonda. Jean knows Judy. Katherine knows Daniel. Francesca knows Greta. Daniel knows Scott. Daniel knows Yvonne. Kay knows Joanna. Jack knows Cesar. Yvonne knows Janice. Judy knows Emanuel. Earle knows Cain. Judy knows Axel. Cain knows Tonya. Cesar knows Francesca. Tonya knows Jean. Emanuel knows Ariana. Which of Greta and Cain can Jack reach?", "answer": "Greta", "steps": [ "Jack knows Cesar.", "Cesar knows Francesca.", "Francesca knows Greta." ], "difficulty": 3, "original_distance": 8, "idx_to_symbol": [ "Jack", "Greta", "Cesar", "Scott", "Katherine", "Yvonne", "Janice", "Daniel", "Francesca", "Rhonda", "Kay", "Cain", "Joanna", "Axel", "Jean", "Emanuel", "Ariana", "Judy", "Earle", "Tonya" ], "edges": [ [ 0, 2 ], [ 1, 9 ], [ 2, 8 ], [ 4, 7 ], [ 5, 6 ], [ 7, 3 ], [ 7, 5 ], [ 8, 1 ], [ 9, 4 ], [ 10, 12 ], [ 11, 19 ], [ 12, 18 ], [ 14, 17 ], [ 15, 16 ], [ 17, 13 ], [ 17, 15 ], [ 18, 11 ], [ 19, 14 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Denise knows Guillermo. Effie knows Dina. Dina knows Mara. Haven knows Aspen. Cesar knows Haven. Mara knows Marc. Haven knows Rena. Haven knows Samuel. Dina knows Stella. Rena knows Brian. Haven knows Denise. Ralph knows Helene. Helene knows Caroline. Aspen knows Daphne. Dina knows Leigh. Guillermo knows Marcus. Dina knows Ralph. Stella knows Ramon. Which of Helene and Guillermo can Cesar reach?", "answer": "Guillermo", "steps": [ "Cesar knows Haven.", "Haven knows Denise.", "Denise knows Guillermo." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Cesar", "Samuel", "Brian", "Guillermo", "Aspen", "Rena", "Marcus", "Haven", "Daphne", "Denise", "Effie", "Leigh", "Ramon", "Helene", "Mara", "Stella", "Caroline", "Dina", "Marc", "Ralph" ], "edges": [ [ 0, 7 ], [ 3, 6 ], [ 4, 8 ], [ 5, 2 ], [ 7, 1 ], [ 7, 5 ], [ 7, 4 ], [ 7, 9 ], [ 9, 3 ], [ 10, 17 ], [ 13, 16 ], [ 14, 18 ], [ 15, 12 ], [ 17, 11 ], [ 17, 15 ], [ 17, 14 ], [ 17, 19 ], [ 19, 13 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Cara knows Bette. Winifred knows Maude. Hendrix knows Wilma. Luella knows Hudson. Donna knows Cara. Milton knows Erik. Tonya knows Hendrix. Destiny knows Hadley. Hudson knows Winifred. Maude knows Milton. Hendrix knows Wanda. Wanda knows Bill. Hadley knows Skyler. Donna knows Nicholas. Milton knows Destiny. Luella knows Essie. Bette knows Tonya. Bill knows Peggy. Which of Cara and Hudson can Donna reach?", "answer": "Cara", "steps": [ "Donna knows Cara." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Donna", "Tonya", "Cara", "Wilma", "Bette", "Peggy", "Wanda", "Bill", "Hendrix", "Nicholas", "Luella", "Maude", "Hudson", "Erik", "Winifred", "Skyler", "Destiny", "Hadley", "Milton", "Essie" ], "edges": [ [ 0, 2 ], [ 0, 9 ], [ 1, 8 ], [ 2, 4 ], [ 4, 1 ], [ 6, 7 ], [ 7, 5 ], [ 8, 3 ], [ 8, 6 ], [ 10, 12 ], [ 10, 19 ], [ 11, 18 ], [ 12, 14 ], [ 14, 11 ], [ 16, 17 ], [ 17, 15 ], [ 18, 13 ], [ 18, 16 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Jeffery knows Keegan. John knows Dexter. Adrian knows Max. Eugenia knows John. Sarah knows Shelly. Milton knows Crystal. Crystal knows Paula. Max knows Darren. Holly knows Shaun. Keegan knows Gail. Dexter knows Milton. Gail knows Eugenia. Shaun knows Curtis. Darren knows Sarah. Shelly knows Carl. Curtis knows Adrian. Jeffery knows Chelsea. Holly knows Neal. Which of Shelly and Crystal can Holly reach?", "answer": "Shelly", "steps": [ "Holly knows Shaun.", "Shaun knows Curtis.", "Curtis knows Adrian.", "Adrian knows Max.", "Max knows Darren.", "Darren knows Sarah.", "Sarah knows Shelly." ], "difficulty": 7, "original_distance": 8, "idx_to_symbol": [ "Holly", "Adrian", "Shaun", "Carl", "Max", "Shelly", "Curtis", "Darren", "Neal", "Sarah", "Jeffery", "Eugenia", "Keegan", "Paula", "John", "Crystal", "Gail", "Dexter", "Chelsea", "Milton" ], "edges": [ [ 0, 8 ], [ 0, 2 ], [ 1, 4 ], [ 2, 6 ], [ 4, 7 ], [ 5, 3 ], [ 6, 1 ], [ 7, 9 ], [ 9, 5 ], [ 10, 18 ], [ 10, 12 ], [ 11, 14 ], [ 12, 16 ], [ 14, 17 ], [ 15, 13 ], [ 16, 11 ], [ 17, 19 ], [ 19, 15 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Louise knows Melissa. June knows Kira. Lambert knows Ashton. Rachel knows Kingsley. Kira knows Morgan. Roman knows Rachel. Melissa knows Ian. Ian knows William. Cora knows Robin. Kingsley knows Stefan. Madeline knows Heather. Darwin knows June. Leo knows Ida. Louise knows Lambert. Ida knows Madeline. Melissa knows Roman. Leo knows Cora. Ida knows Darwin. Which of Stefan and Morgan can Leo reach?", "answer": "Morgan", "steps": [ "Leo knows Ida.", "Ida knows Darwin.", "Darwin knows June.", "June knows Kira.", "Kira knows Morgan." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Leo", "Kira", "Madeline", "June", "Darwin", "Morgan", "Robin", "Cora", "Heather", "Ida", "Louise", "Kingsley", "Ian", "Rachel", "Roman", "Stefan", "Ashton", "Lambert", "William", "Melissa" ], "edges": [ [ 0, 7 ], [ 0, 9 ], [ 1, 5 ], [ 2, 8 ], [ 3, 1 ], [ 4, 3 ], [ 7, 6 ], [ 9, 4 ], [ 9, 2 ], [ 10, 17 ], [ 10, 19 ], [ 11, 15 ], [ 12, 18 ], [ 13, 11 ], [ 14, 13 ], [ 17, 16 ], [ 19, 14 ], [ 19, 12 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Carter knows Byron. Elise knows Sidney. Karina knows Jasmine. Byron knows Peggy. Uma knows Bruno. Carter knows Carl. Austin knows Elise. Angela knows Harvey. Jasmine knows Amelia. Harvey knows Amy. Amy knows Austin. Angela knows Arlene. Amelia knows Viola. Derrick knows Justin. Sidney knows Hal. Sidney knows Uma. Amelia knows Derrick. Peggy knows Karina. Which of Bruno and Justin can Carter reach?", "answer": "Justin", "steps": [ "Carter knows Byron.", "Byron knows Peggy.", "Peggy knows Karina.", "Karina knows Jasmine.", "Jasmine knows Amelia.", "Amelia knows Derrick.", "Derrick knows Justin." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Carter", "Jasmine", "Byron", "Derrick", "Amelia", "Viola", "Karina", "Justin", "Peggy", "Carl", "Angela", "Elise", "Harvey", "Uma", "Sidney", "Hal", "Austin", "Bruno", "Amy", "Arlene" ], "edges": [ [ 0, 2 ], [ 0, 9 ], [ 1, 4 ], [ 2, 8 ], [ 3, 7 ], [ 4, 5 ], [ 4, 3 ], [ 6, 1 ], [ 8, 6 ], [ 10, 12 ], [ 10, 19 ], [ 11, 14 ], [ 12, 18 ], [ 13, 17 ], [ 14, 15 ], [ 14, 13 ], [ 16, 11 ], [ 18, 16 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Leland knows Janice. Langston knows Damian. Langston knows Edmund. Edmund knows Lauren. Andrea knows Todd. Janice knows Lars. Patrick knows Sydney. Cornelius knows Doris. Janice knows Andrea. Cornelius knows Wilbur. Patrick knows Horace. Graeme knows Dana. Doris knows Enid. Sydney knows Leland. Lars knows Marie. Wilbur knows Graeme. Lauren knows Cornelius. Todd knows Hank. Which of Edmund and Sydney can Langston reach?", "answer": "Edmund", "steps": [ "Langston knows Edmund." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Langston", "Enid", "Dana", "Damian", "Doris", "Wilbur", "Cornelius", "Graeme", "Lauren", "Edmund", "Patrick", "Marie", "Hank", "Horace", "Lars", "Andrea", "Janice", "Todd", "Leland", "Sydney" ], "edges": [ [ 0, 3 ], [ 0, 9 ], [ 4, 1 ], [ 5, 7 ], [ 6, 4 ], [ 6, 5 ], [ 7, 2 ], [ 8, 6 ], [ 9, 8 ], [ 10, 13 ], [ 10, 19 ], [ 14, 11 ], [ 15, 17 ], [ 16, 14 ], [ 16, 15 ], [ 17, 12 ], [ 18, 16 ], [ 19, 18 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Emmett knows Darnell. Patrick knows Felicia. Gideon knows Kurt. Emmett knows Tristan. Emmett knows Patrick. Pearl knows Emmett. Davis knows Calvin. Calvin knows Frida. Lorenzo knows Fanny. Calvin knows Sean. Troy knows Davis. Carrie knows Gideon. Carrie knows Samantha. Travis knows Wanda. Lorenzo knows Pearl. Wanda knows Lorenzo. Sean knows Carrie. Carrie knows Benjamin. Which of Sean and Pearl can Travis reach?", "answer": "Pearl", "steps": [ "Travis knows Wanda.", "Wanda knows Lorenzo.", "Lorenzo knows Pearl." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Travis", "Emmett", "Felicia", "Wanda", "Darnell", "Lorenzo", "Pearl", "Patrick", "Fanny", "Tristan", "Troy", "Carrie", "Kurt", "Davis", "Benjamin", "Calvin", "Sean", "Gideon", "Frida", "Samantha" ], "edges": [ [ 0, 3 ], [ 1, 4 ], [ 1, 7 ], [ 1, 9 ], [ 3, 5 ], [ 5, 8 ], [ 5, 6 ], [ 6, 1 ], [ 7, 2 ], [ 10, 13 ], [ 11, 14 ], [ 11, 17 ], [ 11, 19 ], [ 13, 15 ], [ 15, 18 ], [ 15, 16 ], [ 16, 11 ], [ 17, 12 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Brittany knows Louis. Kim knows Raymond. Noel knows Douglas. Goldie knows Atlas. Raymond knows Austin. Mary knows Tara. Yuki knows Mary. Donovan knows Yuki. Louis knows Lyle. Damian knows Autumn. Douglas knows Goldie. Gregory knows Kim. Autumn knows Gregory. Tamara knows Brittany. Mary knows Tamara. Gregory knows Noel. Nadine knows Nicole. Tara knows Nadine. Which of Atlas and Lyle can Damian reach?", "answer": "Atlas", "steps": [ "Damian knows Autumn.", "Autumn knows Gregory.", "Gregory knows Noel.", "Noel knows Douglas.", "Douglas knows Goldie.", "Goldie knows Atlas." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Damian", "Kim", "Douglas", "Autumn", "Austin", "Gregory", "Atlas", "Raymond", "Goldie", "Noel", "Donovan", "Tara", "Brittany", "Yuki", "Nicole", "Mary", "Lyle", "Nadine", "Louis", "Tamara" ], "edges": [ [ 0, 3 ], [ 1, 7 ], [ 2, 8 ], [ 3, 5 ], [ 5, 1 ], [ 5, 9 ], [ 7, 4 ], [ 8, 6 ], [ 9, 2 ], [ 10, 13 ], [ 11, 17 ], [ 12, 18 ], [ 13, 15 ], [ 15, 11 ], [ 15, 19 ], [ 17, 14 ], [ 18, 16 ], [ 19, 12 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "India knows Aldo. Latoya knows Lance. Randy knows Isla. Dick knows Omar. Cruz knows Dick. Latoya knows Myrtle. Isabel knows Jill. Myrtle knows Isabel. Dick knows Willis. Basil knows Cruz. Randy knows Byron. Terrence knows Gerard. Hattie knows Vicki. Jill knows Terrence. Cruz knows India. Hattie knows Aurora. Jill knows Hattie. Isla knows Basil. Which of Dick and Hattie can Latoya reach?", "answer": "Hattie", "steps": [ "Latoya knows Myrtle.", "Myrtle knows Isabel.", "Isabel knows Jill.", "Jill knows Hattie." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Latoya", "Vicki", "Gerard", "Lance", "Isabel", "Jill", "Terrence", "Myrtle", "Aurora", "Hattie", "Randy", "Willis", "Aldo", "Byron", "Basil", "Cruz", "India", "Isla", "Omar", "Dick" ], "edges": [ [ 0, 3 ], [ 0, 7 ], [ 4, 5 ], [ 5, 6 ], [ 5, 9 ], [ 6, 2 ], [ 7, 4 ], [ 9, 1 ], [ 9, 8 ], [ 10, 13 ], [ 10, 17 ], [ 14, 15 ], [ 15, 16 ], [ 15, 19 ], [ 16, 12 ], [ 17, 14 ], [ 19, 11 ], [ 19, 18 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Alexa knows Knox. Randall knows Nolan. Blaine knows Barbara. Allen knows Terry. Felicia knows Blaine. Randall knows Alana. Felicia knows Jarvis. Lily knows Elliot. Lily knows Teresa. Elliot knows Margaret. Edna knows Lily. Lamar knows Felicia. Nolan knows Palmer. Allen knows Lawson. Lawson knows Alexa. Elliot knows Randall. Palmer knows Paul. Blaine knows Allen. Which of Paul and Knox can Lamar reach?", "answer": "Knox", "steps": [ "Lamar knows Felicia.", "Felicia knows Blaine.", "Blaine knows Allen.", "Allen knows Lawson.", "Lawson knows Alexa.", "Alexa knows Knox." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Lamar", "Knox", "Alexa", "Blaine", "Felicia", "Terry", "Allen", "Lawson", "Jarvis", "Barbara", "Edna", "Paul", "Palmer", "Elliot", "Lily", "Alana", "Randall", "Nolan", "Teresa", "Margaret" ], "edges": [ [ 0, 4 ], [ 2, 1 ], [ 3, 6 ], [ 3, 9 ], [ 4, 8 ], [ 4, 3 ], [ 6, 5 ], [ 6, 7 ], [ 7, 2 ], [ 10, 14 ], [ 12, 11 ], [ 13, 16 ], [ 13, 19 ], [ 14, 18 ], [ 14, 13 ], [ 16, 15 ], [ 16, 17 ], [ 17, 12 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Perry knows Thea. Garland knows Hayley. Cruz knows Cyrus. Lawrence knows Cliff. Stacy knows Garland. Jameson knows Dewey. Thea knows Ava. Vera knows Dallas. Michelle knows Cruz. Corey knows Xander. Michelle knows Vera. Thea knows Merle. Ava knows Michelle. Dewey knows Lawrence. Elijah knows Perry. Asher knows Stacy. Dewey knows Corey. Garland knows Jameson. Which of Lawrence and Cruz can Elijah reach?", "answer": "Cruz", "steps": [ "Elijah knows Perry.", "Perry knows Thea.", "Thea knows Ava.", "Ava knows Michelle.", "Michelle knows Cruz." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Elijah", "Dallas", "Michelle", "Ava", "Perry", "Cyrus", "Thea", "Merle", "Vera", "Cruz", "Asher", "Xander", "Dewey", "Jameson", "Stacy", "Cliff", "Garland", "Hayley", "Corey", "Lawrence" ], "edges": [ [ 0, 4 ], [ 2, 8 ], [ 2, 9 ], [ 3, 2 ], [ 4, 6 ], [ 6, 7 ], [ 6, 3 ], [ 8, 1 ], [ 9, 5 ], [ 10, 14 ], [ 12, 18 ], [ 12, 19 ], [ 13, 12 ], [ 14, 16 ], [ 16, 17 ], [ 16, 13 ], [ 18, 11 ], [ 19, 15 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Alison knows Caleb. Dean knows Atlas. Dean knows Lenora. Zachary knows Joanna. Ibrahim knows Alison. Zachary knows Kerry. Martha knows Ibrahim. Rick knows Malik. Atlas knows Byron. Darius knows Edith. Atlas knows Rick. Darius knows Dean. Joanna knows Carl. Carl knows Sharon. Serena knows Haley. Alison knows Zachary. Joanna knows Victoria. Haley knows Darius. Which of Sharon and Malik can Serena reach?", "answer": "Malik", "steps": [ "Serena knows Haley.", "Haley knows Darius.", "Darius knows Dean.", "Dean knows Atlas.", "Atlas knows Rick.", "Rick knows Malik." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Serena", "Edith", "Rick", "Dean", "Lenora", "Darius", "Byron", "Malik", "Atlas", "Haley", "Martha", "Caleb", "Carl", "Zachary", "Kerry", "Alison", "Victoria", "Sharon", "Joanna", "Ibrahim" ], "edges": [ [ 0, 9 ], [ 2, 7 ], [ 3, 4 ], [ 3, 8 ], [ 5, 1 ], [ 5, 3 ], [ 8, 6 ], [ 8, 2 ], [ 9, 5 ], [ 10, 19 ], [ 12, 17 ], [ 13, 14 ], [ 13, 18 ], [ 15, 11 ], [ 15, 13 ], [ 18, 16 ], [ 18, 12 ], [ 19, 15 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Louis knows Calvin. Jaime knows Boyd. Chris knows Boris. Chris knows Esme. Esme knows Arnold. Louis knows Cynthia. Louisa knows Frances. Frances knows Megan. Chris knows Curtis. Boyd knows Ava. Curtis knows Louisa. Arnold knows Doug. Boyd knows Helene. Burt knows Carlton. Calvin knows Burt. Louis knows Evelyn. Cynthia knows Jaime. Frances knows Kobe. Which of Louisa and Jaime can Chris reach?", "answer": "Louisa", "steps": [ "Chris knows Curtis.", "Curtis knows Louisa." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Chris", "Kobe", "Esme", "Doug", "Frances", "Boris", "Louisa", "Megan", "Arnold", "Curtis", "Louis", "Ava", "Calvin", "Carlton", "Boyd", "Evelyn", "Jaime", "Helene", "Burt", "Cynthia" ], "edges": [ [ 0, 5 ], [ 0, 2 ], [ 0, 9 ], [ 2, 8 ], [ 4, 1 ], [ 4, 7 ], [ 6, 4 ], [ 8, 3 ], [ 9, 6 ], [ 10, 15 ], [ 10, 12 ], [ 10, 19 ], [ 12, 18 ], [ 14, 11 ], [ 14, 17 ], [ 16, 14 ], [ 18, 13 ], [ 19, 16 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Lena knows Claire. Houston knows Sean. Forrest knows Houston. Houston knows Janet. Chase knows Naomi. Nolan knows Livia. Sean knows Eric. Livia knows Selena. Livia knows Judith. Judith knows Doug. Houston knows Chase. Judith knows Olive. Sean knows Tabitha. Chase knows Lena. Livia knows Kelly. Selena knows Imogen. Olive knows Liam. Selena knows Stephanie. Which of Lena and Olive can Nolan reach?", "answer": "Olive", "steps": [ "Nolan knows Livia.", "Livia knows Judith.", "Judith knows Olive." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Nolan", "Stephanie", "Kelly", "Selena", "Liam", "Livia", "Doug", "Imogen", "Olive", "Judith", "Forrest", "Tabitha", "Janet", "Sean", "Claire", "Houston", "Naomi", "Eric", "Lena", "Chase" ], "edges": [ [ 0, 5 ], [ 3, 1 ], [ 3, 7 ], [ 5, 2 ], [ 5, 3 ], [ 5, 9 ], [ 8, 4 ], [ 9, 6 ], [ 9, 8 ], [ 10, 15 ], [ 13, 11 ], [ 13, 17 ], [ 15, 12 ], [ 15, 13 ], [ 15, 19 ], [ 18, 14 ], [ 19, 16 ], [ 19, 18 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Kendrick knows Knox. Iris knows Clark. Clark knows Perry. Dewey knows Monica. Jeff knows Brenda. Clark knows Jeff. Anthony knows Francesca. Heidi knows Anthony. Sybil knows Jon. Heidi knows Clayton. Josie knows Kendrick. Dewey knows Chantal. Clark knows Heidi. Alicia knows Iris. Andre knows Josie. Kendrick knows Dewey. Kendrick knows Sybil. Monica knows Blair. Which of Josie and Iris can Andre reach?", "answer": "Josie", "steps": [ "Andre knows Josie." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Andre", "Chantal", "Knox", "Sybil", "Monica", "Josie", "Blair", "Jon", "Dewey", "Kendrick", "Alicia", "Clayton", "Perry", "Jeff", "Anthony", "Iris", "Francesca", "Brenda", "Heidi", "Clark" ], "edges": [ [ 0, 5 ], [ 3, 7 ], [ 4, 6 ], [ 5, 9 ], [ 8, 1 ], [ 8, 4 ], [ 9, 2 ], [ 9, 3 ], [ 9, 8 ], [ 10, 15 ], [ 13, 17 ], [ 14, 16 ], [ 15, 19 ], [ 18, 11 ], [ 18, 14 ], [ 19, 12 ], [ 19, 13 ], [ 19, 18 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Ray knows Cornelius. Brian knows Rick. Ashley knows Joaquin. Alyson knows Willard. Fred knows Brooks. Aubrey knows Ashley. Ray knows Marion. Brooks knows Aria. Ray knows Hayden. Aubrey knows Alyson. Aubrey knows Brian. Brian knows Darius. Bruce knows Virgil. Bruce knows Ray. Virgil knows June. Willard knows Brynn. Brian knows Dick. Bruce knows Fred. Which of Fred and Alyson can Bruce reach?", "answer": "Fred", "steps": [ "Bruce knows Fred." ], "difficulty": 1, "original_distance": 3, "idx_to_symbol": [ "Bruce", "Brooks", "Hayden", "Marion", "Aria", "Cornelius", "Virgil", "Ray", "June", "Fred", "Aubrey", "Willard", "Darius", "Dick", "Brynn", "Rick", "Ashley", "Brian", "Joaquin", "Alyson" ], "edges": [ [ 0, 7 ], [ 0, 6 ], [ 0, 9 ], [ 1, 4 ], [ 6, 8 ], [ 7, 2 ], [ 7, 3 ], [ 7, 5 ], [ 9, 1 ], [ 10, 17 ], [ 10, 16 ], [ 10, 19 ], [ 11, 14 ], [ 16, 18 ], [ 17, 12 ], [ 17, 13 ], [ 17, 15 ], [ 19, 11 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "August knows Nora. Beau knows Jennifer. Jennifer knows Sandra. Ariel knows Aria. Tracy knows Beau. Tracy knows Wilma. Mae knows Priscilla. Sandra knows Gina. Evelyn knows Cruz. Evelyn knows Beth. Mae knows Ariel. Wilma knows August. Delia knows Penny. Chester knows Leon. Cruz knows Mae. August knows Delia. Beth knows Vanessa. Vanessa knows Chester. Which of Ariel and Delia can Tracy reach?", "answer": "Delia", "steps": [ "Tracy knows Wilma.", "Wilma knows August.", "August knows Delia." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Tracy", "Gina", "Jennifer", "Wilma", "Delia", "Penny", "Sandra", "August", "Beau", "Nora", "Evelyn", "Leon", "Vanessa", "Cruz", "Ariel", "Aria", "Chester", "Mae", "Beth", "Priscilla" ], "edges": [ [ 0, 8 ], [ 0, 3 ], [ 2, 6 ], [ 3, 7 ], [ 4, 5 ], [ 6, 1 ], [ 7, 4 ], [ 7, 9 ], [ 8, 2 ], [ 10, 18 ], [ 10, 13 ], [ 12, 16 ], [ 13, 17 ], [ 14, 15 ], [ 16, 11 ], [ 17, 14 ], [ 17, 19 ], [ 18, 12 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Vicki knows Miranda. Rowan knows Kay. Rowan knows Percy. Jameson knows Lamont. Rachel knows Lennox. Miranda knows Rowan. Lennox knows Fanny. Lennox knows Garrett. Lennox knows Peggy. Rowan knows Ford. Garrett knows Kenneth. Ford knows Margaret. Merle knows Hayley. Autumn knows Rachel. Kenneth knows Jameson. Jameson knows Griffith. Margaret knows Merle. Merle knows Marvin. Which of Lamont and Hayley can Vicki reach?", "answer": "Hayley", "steps": [ "Vicki knows Miranda.", "Miranda knows Rowan.", "Rowan knows Ford.", "Ford knows Margaret.", "Margaret knows Merle.", "Merle knows Hayley." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Vicki", "Miranda", "Ford", "Hayley", "Marvin", "Percy", "Rowan", "Kay", "Margaret", "Merle", "Autumn", "Rachel", "Garrett", "Lamont", "Griffith", "Fanny", "Lennox", "Peggy", "Kenneth", "Jameson" ], "edges": [ [ 0, 1 ], [ 1, 6 ], [ 2, 8 ], [ 6, 5 ], [ 6, 7 ], [ 6, 2 ], [ 8, 9 ], [ 9, 3 ], [ 9, 4 ], [ 10, 11 ], [ 11, 16 ], [ 12, 18 ], [ 16, 15 ], [ 16, 17 ], [ 16, 12 ], [ 18, 19 ], [ 19, 13 ], [ 19, 14 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Irma knows Declan. Elena knows Dirk. Jim knows Vivian. Rufus knows Erik. Erik knows Jillian. Percy knows Lillian. Martin knows Michael. Simon knows Anita. Declan knows Carla. Lillian knows Elena. Carla knows Rufus. Rufus knows Jamie. Anita knows Cora. Percy knows Simon. Vivian knows Esperanza. Irma knows Jim. Dirk knows Cameron. Dirk knows Martin. Which of Erik and Martin can Irma reach?", "answer": "Erik", "steps": [ "Irma knows Declan.", "Declan knows Carla.", "Carla knows Rufus.", "Rufus knows Erik." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Irma", "Esperanza", "Carla", "Jamie", "Erik", "Jim", "Jillian", "Rufus", "Vivian", "Declan", "Percy", "Cora", "Elena", "Cameron", "Martin", "Simon", "Michael", "Dirk", "Anita", "Lillian" ], "edges": [ [ 0, 5 ], [ 0, 9 ], [ 2, 7 ], [ 4, 6 ], [ 5, 8 ], [ 7, 3 ], [ 7, 4 ], [ 8, 1 ], [ 9, 2 ], [ 10, 15 ], [ 10, 19 ], [ 12, 17 ], [ 14, 16 ], [ 15, 18 ], [ 17, 13 ], [ 17, 14 ], [ 18, 11 ], [ 19, 12 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Vera knows Henrietta. Federico knows Haven. Mark knows Hannah. Fiona knows Mabel. Annie knows Mark. Fiona knows Bob. Bob knows Federico. Jolene knows Roger. Henrietta knows Fiona. Ivan knows Robin. Robin knows Annie. Mabel knows Avery. Annie knows Jolene. Hannah knows Yvette. Ivan knows Celeste. Fiona knows Marcus. Vera knows Ramona. Annie knows India. Which of Hannah and Federico can Vera reach?", "answer": "Federico", "steps": [ "Vera knows Henrietta.", "Henrietta knows Fiona.", "Fiona knows Bob.", "Bob knows Federico." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Vera", "Federico", "Marcus", "Avery", "Haven", "Mabel", "Henrietta", "Fiona", "Ramona", "Bob", "Ivan", "Hannah", "India", "Roger", "Yvette", "Jolene", "Robin", "Annie", "Celeste", "Mark" ], "edges": [ [ 0, 8 ], [ 0, 6 ], [ 1, 4 ], [ 5, 3 ], [ 6, 7 ], [ 7, 2 ], [ 7, 5 ], [ 7, 9 ], [ 9, 1 ], [ 10, 18 ], [ 10, 16 ], [ 11, 14 ], [ 15, 13 ], [ 16, 17 ], [ 17, 12 ], [ 17, 15 ], [ 17, 19 ], [ 19, 11 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Leon knows Taylor. Ainsley knows Leon. Eamon knows Michelle. Leon knows Saul. Helene knows Aspen. Taylor knows Kelsey. Ainsley knows Alana. Kelsey knows Douglas. Lillian knows Maya. Celia knows Graham. Helene knows Martha. Taylor knows Larissa. Martha knows Susan. Maya knows Helene. Maya knows Jakob. Douglas knows Celia. Lillian knows Yvonne. Susan knows Eamon. Which of Eamon and Celia can Lillian reach?", "answer": "Eamon", "steps": [ "Lillian knows Maya.", "Maya knows Helene.", "Helene knows Martha.", "Martha knows Susan.", "Susan knows Eamon." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Lillian", "Michelle", "Yvonne", "Aspen", "Jakob", "Helene", "Susan", "Martha", "Maya", "Eamon", "Ainsley", "Graham", "Alana", "Larissa", "Saul", "Taylor", "Douglas", "Kelsey", "Leon", "Celia" ], "edges": [ [ 0, 2 ], [ 0, 8 ], [ 5, 3 ], [ 5, 7 ], [ 6, 9 ], [ 7, 6 ], [ 8, 4 ], [ 8, 5 ], [ 9, 1 ], [ 10, 12 ], [ 10, 18 ], [ 15, 13 ], [ 15, 17 ], [ 16, 19 ], [ 17, 16 ], [ 18, 14 ], [ 18, 15 ], [ 19, 11 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Peggy knows Saul. Grace knows Peggy. Darin knows Arthur. Cooper knows Simon. Simon knows Myra. Hendrix knows Grace. Eldon knows Heidi. Eldon knows Denise. Myra knows Lillian. Saul knows Eldon. Cooper knows Conner. Myra knows Marco. Graeme knows Aisha. Peggy knows Jacqueline. Doug knows Cooper. Lillian knows Darin. Bryan knows Doug. Denise knows Graeme. Which of Peggy and Cooper can Hendrix reach?", "answer": "Peggy", "steps": [ "Hendrix knows Grace.", "Grace knows Peggy." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Hendrix", "Graeme", "Jacqueline", "Eldon", "Saul", "Grace", "Peggy", "Aisha", "Denise", "Heidi", "Bryan", "Darin", "Conner", "Myra", "Simon", "Doug", "Cooper", "Arthur", "Lillian", "Marco" ], "edges": [ [ 0, 5 ], [ 1, 7 ], [ 3, 8 ], [ 3, 9 ], [ 4, 3 ], [ 5, 6 ], [ 6, 2 ], [ 6, 4 ], [ 8, 1 ], [ 10, 15 ], [ 11, 17 ], [ 13, 18 ], [ 13, 19 ], [ 14, 13 ], [ 15, 16 ], [ 16, 12 ], [ 16, 14 ], [ 18, 11 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Jade knows Mara. Garrett knows Logan. Larry knows Desmond. Mara knows Roy. Marie knows Kira. Keegan knows Gail. Keegan knows Hunter. Laverne knows Keegan. Gail knows Neal. Jeffery knows Annie. Hattie knows Marie. Jeffery knows Larry. Drew knows Laverne. Logan knows Susanne. Drew knows Garrett. Marie knows Jade. Kira knows Jeffery. Sharon knows Drew. Which of Gail and Larry can Sharon reach?", "answer": "Gail", "steps": [ "Sharon knows Drew.", "Drew knows Laverne.", "Laverne knows Keegan.", "Keegan knows Gail." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Sharon", "Drew", "Laverne", "Hunter", "Gail", "Neal", "Garrett", "Keegan", "Susanne", "Logan", "Hattie", "Marie", "Kira", "Annie", "Larry", "Desmond", "Jade", "Jeffery", "Roy", "Mara" ], "edges": [ [ 0, 1 ], [ 1, 2 ], [ 1, 6 ], [ 2, 7 ], [ 4, 5 ], [ 6, 9 ], [ 7, 3 ], [ 7, 4 ], [ 9, 8 ], [ 10, 11 ], [ 11, 12 ], [ 11, 16 ], [ 12, 17 ], [ 14, 15 ], [ 16, 19 ], [ 17, 13 ], [ 17, 14 ], [ 19, 18 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Hugo knows Samuel. Kurt knows Brenda. Brenda knows Kamila. Brenda knows Freya. Merle knows Valerie. Julia knows Abby. Kurt knows Gabe. Brent knows Hugo. Freya knows Merle. Julia knows Colby. Hugo knows Kendra. Brenda knows Eugenia. Julia knows Lamont. Hugo knows Jack. Samuel knows Julia. Merle knows Dina. Merle knows Tabitha. Brent knows Stefan. Which of Julia and Merle can Kurt reach?", "answer": "Merle", "steps": [ "Kurt knows Brenda.", "Brenda knows Freya.", "Freya knows Merle." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Kurt", "Gabe", "Dina", "Merle", "Eugenia", "Valerie", "Kamila", "Tabitha", "Freya", "Brenda", "Brent", "Stefan", "Lamont", "Julia", "Kendra", "Colby", "Jack", "Abby", "Samuel", "Hugo" ], "edges": [ [ 0, 1 ], [ 0, 9 ], [ 3, 2 ], [ 3, 5 ], [ 3, 7 ], [ 8, 3 ], [ 9, 4 ], [ 9, 6 ], [ 9, 8 ], [ 10, 11 ], [ 10, 19 ], [ 13, 12 ], [ 13, 15 ], [ 13, 17 ], [ 18, 13 ], [ 19, 14 ], [ 19, 16 ], [ 19, 18 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Dora knows Erma. Aria knows Lane. Eden knows Fraser. Anthony knows Ron. Byron knows Eden. Davis knows Aria. Eden knows Kerry. Ron knows Molly. Kerry knows Clifford. Lane knows Jenna. Erma knows Taylor. Rod knows Ava. Molly knows Byron. Gunnar knows Dora. Ron knows Harley. Archie knows Anthony. Lane knows Gunnar. Erma knows Rod. Which of Gunnar and Molly can Archie reach?", "answer": "Molly", "steps": [ "Archie knows Anthony.", "Anthony knows Ron.", "Ron knows Molly." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Archie", "Kerry", "Harley", "Byron", "Anthony", "Ron", "Molly", "Fraser", "Clifford", "Eden", "Davis", "Rod", "Jenna", "Dora", "Aria", "Lane", "Gunnar", "Taylor", "Ava", "Erma" ], "edges": [ [ 0, 4 ], [ 1, 8 ], [ 3, 9 ], [ 4, 5 ], [ 5, 2 ], [ 5, 6 ], [ 6, 3 ], [ 9, 7 ], [ 9, 1 ], [ 10, 14 ], [ 11, 18 ], [ 13, 19 ], [ 14, 15 ], [ 15, 12 ], [ 15, 16 ], [ 16, 13 ], [ 19, 17 ], [ 19, 11 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Yvette knows Glen. Glen knows Jacques. Elena knows Gladys. Jacques knows Edgar. Brittany knows Heather. Ruth knows Yvette. Elena knows Zoe. Helen knows Kennedy. Helen knows Joshua. Alice knows Merle. Wilma knows Cate. Victoria knows Elena. Ruth knows Darius. Elena knows Brittany. Zoe knows Leo. Jacques knows Alice. Jacques knows Wilma. Joshua knows Victoria. Which of Leo and Merle can Helen reach?", "answer": "Leo", "steps": [ "Helen knows Joshua.", "Joshua knows Victoria.", "Victoria knows Elena.", "Elena knows Zoe.", "Zoe knows Leo." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Helen", "Elena", "Gladys", "Victoria", "Kennedy", "Leo", "Heather", "Joshua", "Zoe", "Brittany", "Ruth", "Jacques", "Edgar", "Glen", "Darius", "Merle", "Cate", "Yvette", "Alice", "Wilma" ], "edges": [ [ 0, 4 ], [ 0, 7 ], [ 1, 2 ], [ 1, 8 ], [ 1, 9 ], [ 3, 1 ], [ 7, 3 ], [ 8, 5 ], [ 9, 6 ], [ 10, 14 ], [ 10, 17 ], [ 11, 12 ], [ 11, 18 ], [ 11, 19 ], [ 13, 11 ], [ 17, 13 ], [ 18, 15 ], [ 19, 16 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Inez knows Della. Della knows Marc. Inez knows Justin. Judith knows Inez. Kirsten knows Zane. Wanda knows Emmett. Irving knows Lenora. Glen knows Kirsten. Glen knows Alicia. Della knows Melody. Irving knows Sierra. Larry knows Yara. Yara knows Hugh. Emmett knows Edmund. Yara knows Irving. Yara knows Wanda. Wanda knows Jeff. Inez knows Glen. Which of Wanda and Glen can Larry reach?", "answer": "Wanda", "steps": [ "Larry knows Yara.", "Yara knows Wanda." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Larry", "Emmett", "Hugh", "Sierra", "Irving", "Edmund", "Wanda", "Yara", "Jeff", "Lenora", "Judith", "Kirsten", "Justin", "Marc", "Della", "Zane", "Glen", "Inez", "Alicia", "Melody" ], "edges": [ [ 0, 7 ], [ 1, 5 ], [ 4, 3 ], [ 4, 9 ], [ 6, 1 ], [ 6, 8 ], [ 7, 2 ], [ 7, 6 ], [ 7, 4 ], [ 10, 17 ], [ 11, 15 ], [ 14, 13 ], [ 14, 19 ], [ 16, 11 ], [ 16, 18 ], [ 17, 12 ], [ 17, 16 ], [ 17, 14 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Helene knows Glenn. Trina knows Noah. Stuart knows Trina. Kit knows Jake. Martin knows Carlos. Stuart knows Pete. Trina knows Kit. Jake knows Chloe. Doug knows Brooke. Dayton knows William. Chloe knows Jose. Martin knows Iris. Martin knows Kay. Kay knows Taylor. Kendrick knows Helene. Trina knows Dayton. Carlos knows Kendrick. Doug knows Martin. Which of Carlos and Kit can Doug reach?", "answer": "Carlos", "steps": [ "Doug knows Martin.", "Martin knows Carlos." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Doug", "Kay", "Martin", "Glenn", "Carlos", "Helene", "Brooke", "Iris", "Kendrick", "Taylor", "Stuart", "Dayton", "Trina", "Jose", "Kit", "Chloe", "Pete", "Noah", "Jake", "William" ], "edges": [ [ 0, 6 ], [ 0, 2 ], [ 1, 9 ], [ 2, 7 ], [ 2, 4 ], [ 2, 1 ], [ 4, 8 ], [ 5, 3 ], [ 8, 5 ], [ 10, 16 ], [ 10, 12 ], [ 11, 19 ], [ 12, 17 ], [ 12, 14 ], [ 12, 11 ], [ 14, 18 ], [ 15, 13 ], [ 18, 15 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Crystal knows Harrison. Hugh knows Felicia. Bennett knows Emanuel. Robin knows Marc. Bennett knows Tim. Hugh knows Irving. Harrison knows Yasmin. Xavier knows Mildred. Crystal knows Robin. Xavier knows Beau. Felicia knows Irene. James knows Bennett. Jesse knows Catherine. Crystal knows James. Beau knows Jonathan. Irving knows Xavier. Tim knows Clyde. Hugh knows Jesse. Which of Jonathan and Clyde can Hugh reach?", "answer": "Jonathan", "steps": [ "Hugh knows Irving.", "Irving knows Xavier.", "Xavier knows Beau.", "Beau knows Jonathan." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Hugh", "Felicia", "Xavier", "Jesse", "Mildred", "Catherine", "Beau", "Jonathan", "Irving", "Irene", "Crystal", "Robin", "Bennett", "Harrison", "Emanuel", "Yasmin", "Tim", "Clyde", "James", "Marc" ], "edges": [ [ 0, 3 ], [ 0, 8 ], [ 0, 1 ], [ 1, 9 ], [ 2, 4 ], [ 2, 6 ], [ 3, 5 ], [ 6, 7 ], [ 8, 2 ], [ 10, 13 ], [ 10, 18 ], [ 10, 11 ], [ 11, 19 ], [ 12, 14 ], [ 12, 16 ], [ 13, 15 ], [ 16, 17 ], [ 18, 12 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Arden knows Eunice. Austin knows Laura. Constance knows Wayne. Arden knows Simon. Lauren knows Dolly. Alejandro knows Ricardo. Austin knows Kristin. Peter knows Donovan. Alejandro knows Lamont. Lamont knows Austin. Donovan knows Kerry. Wayne knows Lauren. Austin knows Peter. Constance knows Hardy. Constance knows Sean. Ramona knows Arden. Eunice knows Constance. Emery knows Alejandro. Which of Kerry and Dolly can Emery reach?", "answer": "Kerry", "steps": [ "Emery knows Alejandro.", "Alejandro knows Lamont.", "Lamont knows Austin.", "Austin knows Peter.", "Peter knows Donovan.", "Donovan knows Kerry." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Emery", "Austin", "Alejandro", "Ricardo", "Peter", "Kristin", "Donovan", "Lamont", "Kerry", "Laura", "Ramona", "Constance", "Arden", "Simon", "Wayne", "Hardy", "Lauren", "Eunice", "Dolly", "Sean" ], "edges": [ [ 0, 2 ], [ 1, 5 ], [ 1, 4 ], [ 1, 9 ], [ 2, 3 ], [ 2, 7 ], [ 4, 6 ], [ 6, 8 ], [ 7, 1 ], [ 10, 12 ], [ 11, 15 ], [ 11, 14 ], [ 11, 19 ], [ 12, 13 ], [ 12, 17 ], [ 14, 16 ], [ 16, 18 ], [ 17, 11 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Irma knows Elmer. Verna knows Clyde. Clyde knows Serena. Ariana knows Irma. Dell knows Xander. Rosemary knows Archie. Cyrus knows Blanche. Serena knows Pierce. Jennifer knows Uma. Elmer knows Jennifer. Archie knows Verna. Irma knows Cyrus. Kai knows Devin. Archie knows Kai. Verna knows Doris. Devin knows Sheila. Cyrus knows Wesley. Wesley knows Dell. Which of Verna and Cyrus can Rosemary reach?", "answer": "Verna", "steps": [ "Rosemary knows Archie.", "Archie knows Verna." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Rosemary", "Sheila", "Kai", "Devin", "Serena", "Doris", "Verna", "Clyde", "Pierce", "Archie", "Ariana", "Uma", "Elmer", "Jennifer", "Dell", "Blanche", "Cyrus", "Wesley", "Xander", "Irma" ], "edges": [ [ 0, 9 ], [ 2, 3 ], [ 3, 1 ], [ 4, 8 ], [ 6, 5 ], [ 6, 7 ], [ 7, 4 ], [ 9, 2 ], [ 9, 6 ], [ 10, 19 ], [ 12, 13 ], [ 13, 11 ], [ 14, 18 ], [ 16, 15 ], [ 16, 17 ], [ 17, 14 ], [ 19, 12 ], [ 19, 16 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Justine knows Diego. Justine knows Elise. Opal knows Cole. Opal knows Jon. Justine knows Gerard. Dustin knows Kelly. Lena knows Heath. Lena knows Deirdre. Jon knows Leticia. Dustin knows Becky. Opal knows Marion. Heath knows Opal. Elise knows Dustin. Dustin knows Carmen. Kelly knows Nash. Dustin knows Liam. Lena knows Cate. Opal knows Rick. Which of Leticia and Nash can Lena reach?", "answer": "Leticia", "steps": [ "Lena knows Heath.", "Heath knows Opal.", "Opal knows Jon.", "Jon knows Leticia." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Lena", "Deirdre", "Leticia", "Cole", "Cate", "Heath", "Jon", "Marion", "Opal", "Rick", "Justine", "Gerard", "Nash", "Becky", "Diego", "Elise", "Kelly", "Liam", "Dustin", "Carmen" ], "edges": [ [ 0, 1 ], [ 0, 4 ], [ 0, 5 ], [ 5, 8 ], [ 6, 2 ], [ 8, 3 ], [ 8, 6 ], [ 8, 7 ], [ 8, 9 ], [ 10, 11 ], [ 10, 14 ], [ 10, 15 ], [ 15, 18 ], [ 16, 12 ], [ 18, 13 ], [ 18, 16 ], [ 18, 17 ], [ 18, 19 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Daria knows Adelaide. Philip knows Anita. Griffith knows Iris. Russell knows Max. Katrina knows Melody. Katrina knows Xander. Avery knows Daria. Melody knows Griffith. Basil knows Autumn. Ken knows Harrison. Max knows Basil. Iris knows Philip. Hal knows Aisha. Daria knows Russell. Aisha knows Katrina. Hal knows Josie. Ken knows Avery. Autumn knows Elliot. Which of Anita and Elliot can Ken reach?", "answer": "Elliot", "steps": [ "Ken knows Avery.", "Avery knows Daria.", "Daria knows Russell.", "Russell knows Max.", "Max knows Basil.", "Basil knows Autumn.", "Autumn knows Elliot." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Ken", "Russell", "Elliot", "Harrison", "Basil", "Adelaide", "Max", "Avery", "Daria", "Autumn", "Hal", "Melody", "Anita", "Josie", "Iris", "Xander", "Griffith", "Aisha", "Katrina", "Philip" ], "edges": [ [ 0, 3 ], [ 0, 7 ], [ 1, 6 ], [ 4, 9 ], [ 6, 4 ], [ 7, 8 ], [ 8, 5 ], [ 8, 1 ], [ 9, 2 ], [ 10, 13 ], [ 10, 17 ], [ 11, 16 ], [ 14, 19 ], [ 16, 14 ], [ 17, 18 ], [ 18, 15 ], [ 18, 11 ], [ 19, 12 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Sadie knows Darla. Frances knows Sadie. Hayes knows Ruby. Mike knows Hayes. Gina knows Mike. Valerie knows Kylie. Colin knows Valerie. Frances knows Iris. Valerie knows Donald. Charlotte knows Callum. Hayes knows Frances. Phoebe knows Gina. Donald knows Olive. Iris knows Isiah. Riley knows Colin. Walt knows Riley. Donald knows Charlotte. Olive knows Ramon. Which of Valerie and Hayes can Phoebe reach?", "answer": "Hayes", "steps": [ "Phoebe knows Gina.", "Gina knows Mike.", "Mike knows Hayes." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Phoebe", "Ruby", "Isiah", "Darla", "Mike", "Gina", "Sadie", "Iris", "Hayes", "Frances", "Walt", "Kylie", "Callum", "Ramon", "Colin", "Riley", "Olive", "Charlotte", "Valerie", "Donald" ], "edges": [ [ 0, 5 ], [ 4, 8 ], [ 5, 4 ], [ 6, 3 ], [ 7, 2 ], [ 8, 1 ], [ 8, 9 ], [ 9, 6 ], [ 9, 7 ], [ 10, 15 ], [ 14, 18 ], [ 15, 14 ], [ 16, 13 ], [ 17, 12 ], [ 18, 11 ], [ 18, 19 ], [ 19, 16 ], [ 19, 17 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Glenda knows Kristin. Dominic knows Eva. Alex knows Tamara. Dee knows Gus. Casey knows Carol. Hailey knows Angela. Angela knows Alex. Casey knows Alder. Alex knows Glenda. Alex knows Colleen. Gus knows Casey. Kendra knows Hailey. Gladys knows Kendra. Eva knows Dee. Lennox knows Mary. Eva knows Bernice. Casey knows Lennox. Kendra knows Kai. Which of Lennox and Glenda can Gladys reach?", "answer": "Glenda", "steps": [ "Gladys knows Kendra.", "Kendra knows Hailey.", "Hailey knows Angela.", "Angela knows Alex.", "Alex knows Glenda." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Gladys", "Kristin", "Colleen", "Glenda", "Kendra", "Tamara", "Kai", "Alex", "Angela", "Hailey", "Dominic", "Mary", "Alder", "Lennox", "Eva", "Carol", "Bernice", "Casey", "Gus", "Dee" ], "edges": [ [ 0, 4 ], [ 3, 1 ], [ 4, 6 ], [ 4, 9 ], [ 7, 2 ], [ 7, 3 ], [ 7, 5 ], [ 8, 7 ], [ 9, 8 ], [ 10, 14 ], [ 13, 11 ], [ 14, 16 ], [ 14, 19 ], [ 17, 12 ], [ 17, 13 ], [ 17, 15 ], [ 18, 17 ], [ 19, 18 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Gunnar knows Sebastian. Alyson knows Gunnar. Alyson knows Clarissa. Zack knows Alyson. Arthur knows Latoya. Finn knows Zack. Lillian knows Wendy. Keegan knows Destiny. Lenora knows Susanne. Keegan knows Sean. Arthur knows Felix. Julia knows Finn. Lillian knows Tracy. Wendy knows Seth. Susanne knows Graham. Graham knows Lillian. Alyson knows Arthur. Lillian knows Keegan. Which of Graham and Zack can Julia reach?", "answer": "Zack", "steps": [ "Julia knows Finn.", "Finn knows Zack." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Julia", "Gunnar", "Sebastian", "Zack", "Latoya", "Clarissa", "Arthur", "Finn", "Alyson", "Felix", "Lenora", "Wendy", "Seth", "Graham", "Destiny", "Tracy", "Keegan", "Susanne", "Lillian", "Sean" ], "edges": [ [ 0, 7 ], [ 1, 2 ], [ 3, 8 ], [ 6, 4 ], [ 6, 9 ], [ 7, 3 ], [ 8, 1 ], [ 8, 5 ], [ 8, 6 ], [ 10, 17 ], [ 11, 12 ], [ 13, 18 ], [ 16, 14 ], [ 16, 19 ], [ 17, 13 ], [ 18, 11 ], [ 18, 15 ], [ 18, 16 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Ford knows Sidney. Yvonne knows Winifred. Jeffery knows Alice. Diane knows Ford. Ainsley knows Rocco. Harry knows Ashley. Rocco knows Yvonne. Cordelia knows Vance. Effie knows Harry. Cordelia knows Latoya. Ainsley knows Jeffery. Vance knows Effie. Harry knows Janice. Wendy knows Roy. Latoya knows Bryan. Janice knows Wendy. Winifred knows Heath. Winifred knows Diane. Which of Rocco and Vance can Cordelia reach?", "answer": "Vance", "steps": [ "Cordelia knows Vance." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Cordelia", "Bryan", "Ashley", "Latoya", "Effie", "Roy", "Harry", "Vance", "Wendy", "Janice", "Ainsley", "Alice", "Heath", "Jeffery", "Yvonne", "Sidney", "Winifred", "Rocco", "Ford", "Diane" ], "edges": [ [ 0, 3 ], [ 0, 7 ], [ 3, 1 ], [ 4, 6 ], [ 6, 2 ], [ 6, 9 ], [ 7, 4 ], [ 8, 5 ], [ 9, 8 ], [ 10, 13 ], [ 10, 17 ], [ 13, 11 ], [ 14, 16 ], [ 16, 12 ], [ 16, 19 ], [ 17, 14 ], [ 18, 15 ], [ 19, 18 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Wesley knows Esperanza. Vincent knows Lennox. Clarissa knows Samuel. Jeremy knows Gerald. Gideon knows Nora. Virgil knows Val. Wesley knows Ellis. Samuel knows Arden. Vincent knows Garrett. Esperanza knows Virgil. Gideon knows Lorna. Vincent knows Wesley. Gideon knows Clarissa. Samuel knows Jeremy. Esperanza knows Della. Omar knows Vincent. Zoe knows Gideon. Clarissa knows Selena. Which of Gerald and Val can Omar reach?", "answer": "Val", "steps": [ "Omar knows Vincent.", "Vincent knows Wesley.", "Wesley knows Esperanza.", "Esperanza knows Virgil.", "Virgil knows Val." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Omar", "Wesley", "Vincent", "Lennox", "Val", "Garrett", "Ellis", "Della", "Esperanza", "Virgil", "Zoe", "Clarissa", "Gideon", "Lorna", "Gerald", "Nora", "Selena", "Arden", "Samuel", "Jeremy" ], "edges": [ [ 0, 2 ], [ 1, 6 ], [ 1, 8 ], [ 2, 3 ], [ 2, 5 ], [ 2, 1 ], [ 8, 7 ], [ 8, 9 ], [ 9, 4 ], [ 10, 12 ], [ 11, 16 ], [ 11, 18 ], [ 12, 13 ], [ 12, 15 ], [ 12, 11 ], [ 18, 17 ], [ 18, 19 ], [ 19, 14 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Hadley knows Melanie. Alma knows Ignacio. Tabitha knows Chance. Gwen knows Abigail. Luke knows Chloe. Luz knows Henrietta. Gerard knows Levi. Ignacio knows Horace. Levi knows Alma. Mason knows Bernard. Gerard knows Tracy. Melanie knows Gwen. Levi knows Tabitha. Bernard knows Victor. Luke knows Hadley. Hadley knows Adelaide. Melanie knows Mason. Luz knows Gerard. Which of Hadley and Gerard can Luke reach?", "answer": "Hadley", "steps": [ "Luke knows Hadley." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Luke", "Mason", "Hadley", "Gwen", "Bernard", "Chloe", "Victor", "Adelaide", "Melanie", "Abigail", "Luz", "Alma", "Gerard", "Tabitha", "Ignacio", "Henrietta", "Horace", "Tracy", "Levi", "Chance" ], "edges": [ [ 0, 5 ], [ 0, 2 ], [ 1, 4 ], [ 2, 7 ], [ 2, 8 ], [ 3, 9 ], [ 4, 6 ], [ 8, 1 ], [ 8, 3 ], [ 10, 15 ], [ 10, 12 ], [ 11, 14 ], [ 12, 17 ], [ 12, 18 ], [ 13, 19 ], [ 14, 16 ], [ 18, 11 ], [ 18, 13 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Catherine knows Clinton. Jessie knows Mindy. Jonathan knows Catherine. Heather knows Leo. Eric knows Dolores. Diane knows Desmond. Rhea knows Stacy. Gloria knows Laverne. Jonathan knows Griffith. Clyde knows Porter. Rhea knows Clyde. Jenna knows Heather. Gloria knows Diane. Gloria knows Jonathan. Stacy knows Eric. Stacy knows Jenna. Griffith knows Jessie. Rhea knows Perry. Which of Leo and Mindy can Gloria reach?", "answer": "Mindy", "steps": [ "Gloria knows Jonathan.", "Jonathan knows Griffith.", "Griffith knows Jessie.", "Jessie knows Mindy." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Gloria", "Laverne", "Griffith", "Desmond", "Catherine", "Mindy", "Clinton", "Jessie", "Diane", "Jonathan", "Rhea", "Perry", "Jenna", "Porter", "Eric", "Leo", "Dolores", "Heather", "Clyde", "Stacy" ], "edges": [ [ 0, 1 ], [ 0, 8 ], [ 0, 9 ], [ 2, 7 ], [ 4, 6 ], [ 7, 5 ], [ 8, 3 ], [ 9, 4 ], [ 9, 2 ], [ 10, 11 ], [ 10, 18 ], [ 10, 19 ], [ 12, 17 ], [ 14, 16 ], [ 17, 15 ], [ 18, 13 ], [ 19, 14 ], [ 19, 12 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Marilyn knows Jewel. Aisha knows Martha. Kirsten knows Federico. Lois knows Everett. Winifred knows Sandra. Everett knows Ruby. Miranda knows Winifred. Alvin knows Patrick. Winifred knows Dave. Gwen knows Brett. Martha knows Gwen. Carrie knows Alvin. Julius knows Lois. Brett knows Marilyn. Dave knows Aisha. Lois knows Frances. Ruby knows Carrie. Patrick knows Kirsten. Which of Patrick and Brett can Julius reach?", "answer": "Patrick", "steps": [ "Julius knows Lois.", "Lois knows Everett.", "Everett knows Ruby.", "Ruby knows Carrie.", "Carrie knows Alvin.", "Alvin knows Patrick." ], "difficulty": 6, "original_distance": 8, "idx_to_symbol": [ "Julius", "Carrie", "Kirsten", "Federico", "Ruby", "Everett", "Patrick", "Alvin", "Frances", "Lois", "Miranda", "Martha", "Marilyn", "Jewel", "Aisha", "Dave", "Brett", "Gwen", "Sandra", "Winifred" ], "edges": [ [ 0, 9 ], [ 1, 7 ], [ 2, 3 ], [ 4, 1 ], [ 5, 4 ], [ 6, 2 ], [ 7, 6 ], [ 9, 5 ], [ 9, 8 ], [ 10, 19 ], [ 11, 17 ], [ 12, 13 ], [ 14, 11 ], [ 15, 14 ], [ 16, 12 ], [ 17, 16 ], [ 19, 15 ], [ 19, 18 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Mike knows Laura. Ursula knows Jeremy. Laura knows Stefan. Greta knows Faye. Blanche knows Leon. Ann knows Bernadette. Dalton knows Derek. August knows Heather. Lorraine knows Tyler. Ursula knows Lorraine. Faye knows Dalton. Parker knows Ann. Faye knows Parker. Leon knows Greta. Tyler knows Mike. Miles knows August. Blanche knows Basil. Mike knows Miles. Which of Lorraine and Leon can Blanche reach?", "answer": "Leon", "steps": [ "Blanche knows Leon." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Blanche", "Greta", "Bernadette", "Dalton", "Basil", "Parker", "Leon", "Faye", "Ann", "Derek", "Ursula", "Tyler", "Heather", "Laura", "Jeremy", "Miles", "Lorraine", "Mike", "August", "Stefan" ], "edges": [ [ 0, 4 ], [ 0, 6 ], [ 1, 7 ], [ 3, 9 ], [ 5, 8 ], [ 6, 1 ], [ 7, 5 ], [ 7, 3 ], [ 8, 2 ], [ 10, 14 ], [ 10, 16 ], [ 11, 17 ], [ 13, 19 ], [ 15, 18 ], [ 16, 11 ], [ 17, 15 ], [ 17, 13 ], [ 18, 12 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Liam knows Cassidy. Jill knows Clarence. Chester knows Elsa. George knows Guillermo. Israel knows Cornelius. Guillermo knows Enrique. Cassidy knows George. Whitney knows Marlene. George knows Dawn. Chester knows Kent. Chester knows Jana. Marlene knows Elvis. Elvis knows Chester. Clarence knows Kerry. Kent knows Crystal. Jill knows Liam. George knows Becky. Whitney knows Israel. Which of Enrique and Crystal can Whitney reach?", "answer": "Crystal", "steps": [ "Whitney knows Marlene.", "Marlene knows Elvis.", "Elvis knows Chester.", "Chester knows Kent.", "Kent knows Crystal." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Whitney", "Kent", "Crystal", "Israel", "Jana", "Chester", "Cornelius", "Elsa", "Elvis", "Marlene", "Jill", "Guillermo", "Enrique", "Clarence", "Dawn", "George", "Kerry", "Becky", "Cassidy", "Liam" ], "edges": [ [ 0, 3 ], [ 0, 9 ], [ 1, 2 ], [ 3, 6 ], [ 5, 1 ], [ 5, 4 ], [ 5, 7 ], [ 8, 5 ], [ 9, 8 ], [ 10, 13 ], [ 10, 19 ], [ 11, 12 ], [ 13, 16 ], [ 15, 11 ], [ 15, 14 ], [ 15, 17 ], [ 18, 15 ], [ 19, 18 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Fern knows Alma. Constance knows Sarah. Alma knows Ryan. Mack knows Fern. Alex knows Lisa. Steve knows Estelle. Estelle knows Alex. Jules knows Mack. Alex knows Constance. Steve knows Lisette. Ryan knows Sheila. Ryan knows Jolene. Haley knows Steve. Mack knows Chantal. Mack knows Wilbur. Constance knows Jewel. Steve knows Enid. Alma knows Bernard. Which of Steve and Mack can Haley reach?", "answer": "Steve", "steps": [ "Haley knows Steve." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Haley", "Sarah", "Constance", "Jewel", "Steve", "Alex", "Enid", "Lisa", "Lisette", "Estelle", "Jules", "Jolene", "Ryan", "Sheila", "Mack", "Alma", "Wilbur", "Bernard", "Chantal", "Fern" ], "edges": [ [ 0, 4 ], [ 2, 1 ], [ 2, 3 ], [ 4, 6 ], [ 4, 8 ], [ 4, 9 ], [ 5, 2 ], [ 5, 7 ], [ 9, 5 ], [ 10, 14 ], [ 12, 11 ], [ 12, 13 ], [ 14, 16 ], [ 14, 18 ], [ 14, 19 ], [ 15, 12 ], [ 15, 17 ], [ 19, 15 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Kendrick knows Glenda. Aspen knows Adam. Hattie knows Kendrick. Bernard knows Hattie. Adam knows Karen. David knows Stella. Frida knows Latoya. Hattie knows Bernice. Daphna knows Jorge. Frida knows Aspen. Aspen knows Chantal. Bernard knows Quinn. Frida knows Peggy. Jorge knows Bernard. Stella knows Frida. Karen knows Keira. Bernard knows Teresa. Glenda knows Abby. Which of Aspen and Hattie can Daphna reach?", "answer": "Hattie", "steps": [ "Daphna knows Jorge.", "Jorge knows Bernard.", "Bernard knows Hattie." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Daphna", "Abby", "Kendrick", "Glenda", "Jorge", "Hattie", "Quinn", "Bernard", "Teresa", "Bernice", "David", "Keira", "Adam", "Karen", "Stella", "Aspen", "Latoya", "Frida", "Peggy", "Chantal" ], "edges": [ [ 0, 4 ], [ 2, 3 ], [ 3, 1 ], [ 4, 7 ], [ 5, 2 ], [ 5, 9 ], [ 7, 6 ], [ 7, 8 ], [ 7, 5 ], [ 10, 14 ], [ 12, 13 ], [ 13, 11 ], [ 14, 17 ], [ 15, 12 ], [ 15, 19 ], [ 17, 16 ], [ 17, 18 ], [ 17, 15 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Tonya knows Austin. Geneva knows Caroline. Haley knows Jeanne. Henry knows Geneva. Geneva knows Langston. Byron knows Cruz. Levi knows Sandra. Edna knows Tonya. Levi knows Byron. Jeanne knows Glenda. Langston knows Lorraine. Cruz knows Henry. Byron knows Denver. Tonya knows Malcolm. Malcolm knows Judy. Jeanne knows Gina. Haley knows Kingsley. Glenda knows Edna. Which of Geneva and Tonya can Haley reach?", "answer": "Tonya", "steps": [ "Haley knows Jeanne.", "Jeanne knows Glenda.", "Glenda knows Edna.", "Edna knows Tonya." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Haley", "Austin", "Tonya", "Kingsley", "Judy", "Glenda", "Gina", "Edna", "Jeanne", "Malcolm", "Levi", "Caroline", "Geneva", "Sandra", "Lorraine", "Cruz", "Denver", "Henry", "Byron", "Langston" ], "edges": [ [ 0, 3 ], [ 0, 8 ], [ 2, 1 ], [ 2, 9 ], [ 5, 7 ], [ 7, 2 ], [ 8, 6 ], [ 8, 5 ], [ 9, 4 ], [ 10, 13 ], [ 10, 18 ], [ 12, 11 ], [ 12, 19 ], [ 15, 17 ], [ 17, 12 ], [ 18, 16 ], [ 18, 15 ], [ 19, 14 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Dorothy knows Chad. Joan knows Ken. Alan knows Arlene. Ken knows Cordelia. Aurora knows Dorothy. Elvira knows Kylie. Elvira knows Guillermo. Alan knows Cameron. Brooks knows Elvira. Leah knows Kobe. Cordelia knows Keith. Alan knows Brooks. Guillermo knows Leah. Ken knows Jesse. Kara knows Alan. Dorothy knows Cruz. Dorothy knows Joan. Keith knows Dee. Which of Brooks and Joan can Kara reach?", "answer": "Brooks", "steps": [ "Kara knows Alan.", "Alan knows Brooks." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Kara", "Arlene", "Guillermo", "Cameron", "Kobe", "Elvira", "Brooks", "Leah", "Alan", "Kylie", "Aurora", "Cruz", "Cordelia", "Chad", "Dee", "Ken", "Joan", "Keith", "Dorothy", "Jesse" ], "edges": [ [ 0, 8 ], [ 2, 7 ], [ 5, 2 ], [ 5, 9 ], [ 6, 5 ], [ 7, 4 ], [ 8, 1 ], [ 8, 3 ], [ 8, 6 ], [ 10, 18 ], [ 12, 17 ], [ 15, 12 ], [ 15, 19 ], [ 16, 15 ], [ 17, 14 ], [ 18, 11 ], [ 18, 13 ], [ 18, 16 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Justine knows Autumn. Dewey knows Joshua. Rita knows Theodore. Rita knows Jason. Ann knows Alicia. Dewey knows Tony. Evelyn knows Gail. Ann knows Adam. Adam knows Hilda. Lorna knows Tristan. Logan knows Fanny. Justine knows Evelyn. Rita knows Lorna. Lorna knows Dewey. Tony knows Kelly. Jason knows Zara. Ann knows Logan. Logan knows Justine. Which of Kelly and Gail can Rita reach?", "answer": "Kelly", "steps": [ "Rita knows Lorna.", "Lorna knows Dewey.", "Dewey knows Tony.", "Tony knows Kelly." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Rita", "Dewey", "Lorna", "Tony", "Jason", "Theodore", "Joshua", "Tristan", "Zara", "Kelly", "Ann", "Justine", "Logan", "Evelyn", "Adam", "Alicia", "Autumn", "Fanny", "Hilda", "Gail" ], "edges": [ [ 0, 5 ], [ 0, 4 ], [ 0, 2 ], [ 1, 6 ], [ 1, 3 ], [ 2, 7 ], [ 2, 1 ], [ 3, 9 ], [ 4, 8 ], [ 10, 15 ], [ 10, 14 ], [ 10, 12 ], [ 11, 16 ], [ 11, 13 ], [ 12, 17 ], [ 12, 11 ], [ 13, 19 ], [ 14, 18 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Lloyd knows Jason. Bart knows Lorna. Elaine knows Rex. Jolena knows Elliot. Elaine knows Molly. Pat knows Lark. Lorna knows Felix. Jason knows Elaine. Pat knows Lloyd. Kathleen knows Tracy. Jackson knows Kamila. Lloyd knows Kathleen. Bart knows Mario. Elliot knows Bart. Elliot knows Jackson. Jolena knows Leslie. Lorna knows Lilia. Jason knows Palmer. Which of Lorna and Elaine can Pat reach?", "answer": "Elaine", "steps": [ "Pat knows Lloyd.", "Lloyd knows Jason.", "Jason knows Elaine." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Pat", "Elaine", "Kathleen", "Palmer", "Lloyd", "Rex", "Jason", "Tracy", "Molly", "Lark", "Jolena", "Lorna", "Jackson", "Mario", "Elliot", "Felix", "Bart", "Kamila", "Lilia", "Leslie" ], "edges": [ [ 0, 4 ], [ 0, 9 ], [ 1, 5 ], [ 1, 8 ], [ 2, 7 ], [ 4, 2 ], [ 4, 6 ], [ 6, 3 ], [ 6, 1 ], [ 10, 14 ], [ 10, 19 ], [ 11, 15 ], [ 11, 18 ], [ 12, 17 ], [ 14, 12 ], [ 14, 16 ], [ 16, 13 ], [ 16, 11 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Hannah knows Sheila. Chandler knows Enrique. Penny knows Chandler. Chandler knows Eloise. Dina knows Sonia. Wilma knows Jessie. Jessie knows Dina. Dina knows Dominic. Raquel knows Hannah. Penny knows Eduardo. Jessie knows Joseph. Yolanda knows William. Wilma knows Virgil. Thomas knows Raquel. Eduardo knows Merle. William knows Wilma. Hannah knows Penny. Joseph knows Ariana. Which of Ariana and Merle can Thomas reach?", "answer": "Merle", "steps": [ "Thomas knows Raquel.", "Raquel knows Hannah.", "Hannah knows Penny.", "Penny knows Eduardo.", "Eduardo knows Merle." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Thomas", "Sheila", "Hannah", "Chandler", "Penny", "Merle", "Enrique", "Raquel", "Eloise", "Eduardo", "Yolanda", "Virgil", "Wilma", "Dina", "Jessie", "Ariana", "Dominic", "William", "Sonia", "Joseph" ], "edges": [ [ 0, 7 ], [ 2, 1 ], [ 2, 4 ], [ 3, 6 ], [ 3, 8 ], [ 4, 3 ], [ 4, 9 ], [ 7, 2 ], [ 9, 5 ], [ 10, 17 ], [ 12, 11 ], [ 12, 14 ], [ 13, 16 ], [ 13, 18 ], [ 14, 13 ], [ 14, 19 ], [ 17, 12 ], [ 19, 15 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Susanne knows Brock. Ebony knows Giselle. Kate knows Bart. Bart knows Ebony. Randall knows Arnold. Trina knows Dana. Arnold knows Camden. Bailey knows Jeff. Dana knows Carmen. Bart knows Cassidy. Ernest knows Shelly. Arnold knows Jordan. Shelly knows Bailey. Jordan knows Kenneth. Shelly knows Daphne. Cassidy knows Randall. Dana knows Susanne. Carmen knows Ernest. Which of Cassidy and Carmen can Kate reach?", "answer": "Cassidy", "steps": [ "Kate knows Bart.", "Bart knows Cassidy." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Kate", "Kenneth", "Arnold", "Cassidy", "Randall", "Ebony", "Giselle", "Bart", "Camden", "Jordan", "Trina", "Jeff", "Shelly", "Carmen", "Ernest", "Susanne", "Brock", "Dana", "Daphne", "Bailey" ], "edges": [ [ 0, 7 ], [ 2, 8 ], [ 2, 9 ], [ 3, 4 ], [ 4, 2 ], [ 5, 6 ], [ 7, 5 ], [ 7, 3 ], [ 9, 1 ], [ 10, 17 ], [ 12, 18 ], [ 12, 19 ], [ 13, 14 ], [ 14, 12 ], [ 15, 16 ], [ 17, 15 ], [ 17, 13 ], [ 19, 11 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Arturo knows Antonio. Tom knows Garrison. Daria knows Etta. Etta knows Ted. Antonio knows Tom. Antonio knows Darren. Ryan knows Eamon. Ryan knows Cara. Alyson knows Arturo. Dexter knows Tanya. Frances knows Ryan. Cara knows Dick. Dexter knows Alyson. Lloyd knows Dexter. Daria knows Celia. Daria knows Dean. Dick knows Daria. Antonio knows Willard. Which of Ted and Garrison can Lloyd reach?", "answer": "Garrison", "steps": [ "Lloyd knows Dexter.", "Dexter knows Alyson.", "Alyson knows Arturo.", "Arturo knows Antonio.", "Antonio knows Tom.", "Tom knows Garrison." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Lloyd", "Darren", "Dexter", "Tom", "Willard", "Antonio", "Garrison", "Tanya", "Arturo", "Alyson", "Frances", "Celia", "Ryan", "Etta", "Dean", "Daria", "Ted", "Eamon", "Dick", "Cara" ], "edges": [ [ 0, 2 ], [ 2, 7 ], [ 2, 9 ], [ 3, 6 ], [ 5, 1 ], [ 5, 4 ], [ 5, 3 ], [ 8, 5 ], [ 9, 8 ], [ 10, 12 ], [ 12, 17 ], [ 12, 19 ], [ 13, 16 ], [ 15, 11 ], [ 15, 14 ], [ 15, 13 ], [ 18, 15 ], [ 19, 18 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Donovan knows Neil. Lennox knows Hayley. Dylan knows Guy. Barney knows Nora. Tonya knows Kai. Kai knows Ray. Hank knows Lennox. Dylan knows Donovan. Kai knows Emily. Dylan knows Milo. Lennox knows Carter. Nora knows Tonya. Jocelyn knows Barney. Jocelyn knows Sydney. Jocelyn knows Louis. Curtis knows Hank. Guy knows Curtis. Louis knows Barry. Which of Ray and Hayley can Jocelyn reach?", "answer": "Ray", "steps": [ "Jocelyn knows Barney.", "Barney knows Nora.", "Nora knows Tonya.", "Tonya knows Kai.", "Kai knows Ray." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Jocelyn", "Emily", "Kai", "Barry", "Barney", "Tonya", "Sydney", "Nora", "Ray", "Louis", "Dylan", "Carter", "Lennox", "Neil", "Guy", "Hank", "Milo", "Curtis", "Hayley", "Donovan" ], "edges": [ [ 0, 6 ], [ 0, 4 ], [ 0, 9 ], [ 2, 1 ], [ 2, 8 ], [ 4, 7 ], [ 5, 2 ], [ 7, 5 ], [ 9, 3 ], [ 10, 16 ], [ 10, 14 ], [ 10, 19 ], [ 12, 11 ], [ 12, 18 ], [ 14, 17 ], [ 15, 12 ], [ 17, 15 ], [ 19, 13 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Earl knows Eamon. Aaron knows Cassidy. Aaron knows Ignacio. Earl knows Alexa. Lyric knows Jolene. Lyric knows Carla. Aaron knows Lyric. Ignacio knows Clyde. Marlene knows Seth. Ignacio knows Gonzalo. Marlene knows Earl. Marlene knows Hugh. Boris knows Marlene. Hugh knows Beth. Hugh knows Julie. Amber knows Aaron. Hugh knows Wanda. Ignacio knows Ezra. Which of Aaron and Marlene can Boris reach?", "answer": "Marlene", "steps": [ "Boris knows Marlene." ], "difficulty": 1, "original_distance": 3, "idx_to_symbol": [ "Boris", "Eamon", "Earl", "Hugh", "Marlene", "Beth", "Wanda", "Julie", "Alexa", "Seth", "Amber", "Carla", "Lyric", "Ignacio", "Aaron", "Clyde", "Ezra", "Gonzalo", "Jolene", "Cassidy" ], "edges": [ [ 0, 4 ], [ 2, 1 ], [ 2, 8 ], [ 3, 5 ], [ 3, 6 ], [ 3, 7 ], [ 4, 3 ], [ 4, 2 ], [ 4, 9 ], [ 10, 14 ], [ 12, 11 ], [ 12, 18 ], [ 13, 15 ], [ 13, 16 ], [ 13, 17 ], [ 14, 13 ], [ 14, 12 ], [ 14, 19 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Felix knows Mike. Alma knows Harry. Grace knows Enrique. Emily knows Grace. Harry knows Howard. Mike knows Ray. Jerome knows Jakob. Ray knows Todd. Jakob knows Ellis. Kara knows Brody. Mike knows Yasmin. Todd knows Jerome. Lorenzo knows Kara. Brody knows Cruz. Ellis knows Jessica. Enrique knows Lorenzo. Harry knows Emily. Jessica knows Blanche. Which of Enrique and Jerome can Felix reach?", "answer": "Jerome", "steps": [ "Felix knows Mike.", "Mike knows Ray.", "Ray knows Todd.", "Todd knows Jerome." ], "difficulty": 4, "original_distance": 8, "idx_to_symbol": [ "Felix", "Blanche", "Mike", "Ray", "Jakob", "Yasmin", "Todd", "Jessica", "Ellis", "Jerome", "Alma", "Cruz", "Harry", "Emily", "Lorenzo", "Howard", "Grace", "Brody", "Kara", "Enrique" ], "edges": [ [ 0, 2 ], [ 2, 5 ], [ 2, 3 ], [ 3, 6 ], [ 4, 8 ], [ 6, 9 ], [ 7, 1 ], [ 8, 7 ], [ 9, 4 ], [ 10, 12 ], [ 12, 15 ], [ 12, 13 ], [ 13, 16 ], [ 14, 18 ], [ 16, 19 ], [ 17, 11 ], [ 18, 17 ], [ 19, 14 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Langston knows Kara. Aspen knows Grover. Eunice knows Langston. Edwin knows Eunice. Grover knows Norman. Adam knows Dolores. Langston knows Nora. Eunice knows Caleb. Sierra knows Parker. Adam knows Gary. Eunice knows Courtney. Dolores knows Emery. Edwin knows Sierra. Freya knows Edwin. Adam knows Miriam. Grover knows Adam. Dolores knows Dawn. Norman knows Jordan. Which of Emery and Nora can Freya reach?", "answer": "Nora", "steps": [ "Freya knows Edwin.", "Edwin knows Eunice.", "Eunice knows Langston.", "Langston knows Nora." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Freya", "Sierra", "Langston", "Caleb", "Courtney", "Nora", "Parker", "Kara", "Edwin", "Eunice", "Aspen", "Norman", "Dolores", "Gary", "Miriam", "Emery", "Jordan", "Dawn", "Grover", "Adam" ], "edges": [ [ 0, 8 ], [ 1, 6 ], [ 2, 5 ], [ 2, 7 ], [ 8, 1 ], [ 8, 9 ], [ 9, 3 ], [ 9, 4 ], [ 9, 2 ], [ 10, 18 ], [ 11, 16 ], [ 12, 15 ], [ 12, 17 ], [ 18, 11 ], [ 18, 19 ], [ 19, 13 ], [ 19, 14 ], [ 19, 12 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Clay knows Yara. Quinn knows Alan. Margaret knows Opal. Kennedy knows Hailey. Hailey knows Cornelius. Nicole knows Margaret. Clara knows Clay. Zack knows Helene. Brody knows Kennedy. Clay knows Zack. Clay knows Allison. Clara knows Nicole. Alan knows Lionel. Kennedy knows Dennis. Kennedy knows Cody. Cody knows Carlton. Allison knows Thea. Brody knows Quinn. Which of Clay and Kennedy can Clara reach?", "answer": "Clay", "steps": [ "Clara knows Clay." ], "difficulty": 1, "original_distance": 3, "idx_to_symbol": [ "Clara", "Opal", "Thea", "Clay", "Yara", "Zack", "Helene", "Margaret", "Allison", "Nicole", "Brody", "Lionel", "Carlton", "Kennedy", "Dennis", "Hailey", "Cornelius", "Alan", "Cody", "Quinn" ], "edges": [ [ 0, 3 ], [ 0, 9 ], [ 3, 4 ], [ 3, 5 ], [ 3, 8 ], [ 5, 6 ], [ 7, 1 ], [ 8, 2 ], [ 9, 7 ], [ 10, 13 ], [ 10, 19 ], [ 13, 14 ], [ 13, 15 ], [ 13, 18 ], [ 15, 16 ], [ 17, 11 ], [ 18, 12 ], [ 19, 17 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Jocelyn knows George. Lawrence knows Hal. Hal knows Dee. Richard knows Mark. Ian knows Jonah. Richard knows Harry. Hal knows Eldon. Lawrence knows Jason. Lawrence knows Jocelyn. Richard knows Ian. Jacques knows Logan. Dennis knows Yara. Jocelyn knows Boyd. Jacques knows Tara. Ian knows Dennis. Richard knows Jacques. Boyd knows Janice. Lawrence knows Dexter. Which of Janice and Yara can Lawrence reach?", "answer": "Janice", "steps": [ "Lawrence knows Jocelyn.", "Jocelyn knows Boyd.", "Boyd knows Janice." ], "difficulty": 3, "original_distance": 3, "idx_to_symbol": [ "Lawrence", "George", "Jocelyn", "Jason", "Hal", "Dee", "Janice", "Eldon", "Dexter", "Boyd", "Richard", "Jonah", "Ian", "Mark", "Jacques", "Tara", "Yara", "Logan", "Harry", "Dennis" ], "edges": [ [ 0, 3 ], [ 0, 4 ], [ 0, 8 ], [ 0, 2 ], [ 2, 1 ], [ 2, 9 ], [ 4, 5 ], [ 4, 7 ], [ 9, 6 ], [ 10, 13 ], [ 10, 14 ], [ 10, 18 ], [ 10, 12 ], [ 12, 11 ], [ 12, 19 ], [ 14, 15 ], [ 14, 17 ], [ 19, 16 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Carla knows Cassidy. Colette knows Wade. Leroy knows Delilah. Barbara knows Leroy. Carla knows Teresa. Ernesto knows Barbara. Emanuel knows Edward. Teresa knows Dakota. Greg knows Carla. Ernesto knows Harlan. Denise knows Martin. Terry knows Denise. Martin knows Colette. Edward knows Greg. Dakota knows Andre. Greg knows Jules. Jules knows Dora. Martin knows Ernesto. Which of Andre and Delilah can Emanuel reach?", "answer": "Andre", "steps": [ "Emanuel knows Edward.", "Edward knows Greg.", "Greg knows Carla.", "Carla knows Teresa.", "Teresa knows Dakota.", "Dakota knows Andre." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Emanuel", "Andre", "Dora", "Greg", "Dakota", "Jules", "Carla", "Teresa", "Cassidy", "Edward", "Terry", "Delilah", "Wade", "Martin", "Leroy", "Colette", "Ernesto", "Barbara", "Harlan", "Denise" ], "edges": [ [ 0, 9 ], [ 3, 5 ], [ 3, 6 ], [ 4, 1 ], [ 5, 2 ], [ 6, 7 ], [ 6, 8 ], [ 7, 4 ], [ 9, 3 ], [ 10, 19 ], [ 13, 15 ], [ 13, 16 ], [ 14, 11 ], [ 15, 12 ], [ 16, 17 ], [ 16, 18 ], [ 17, 14 ], [ 19, 13 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Marilyn knows Jewel. Aisha knows Martha. Kirsten knows Federico. Lois knows Everett. Winifred knows Sandra. Everett knows Ruby. Miranda knows Winifred. Alvin knows Patrick. Winifred knows Dave. Gwen knows Brett. Martha knows Gwen. Carrie knows Alvin. Julius knows Lois. Brett knows Marilyn. Dave knows Aisha. Lois knows Frances. Ruby knows Carrie. Patrick knows Kirsten. Which of Federico and Jewel can Julius reach?", "answer": "Federico", "steps": [ "Julius knows Lois.", "Lois knows Everett.", "Everett knows Ruby.", "Ruby knows Carrie.", "Carrie knows Alvin.", "Alvin knows Patrick.", "Patrick knows Kirsten.", "Kirsten knows Federico." ], "difficulty": 8, "original_distance": 8, "idx_to_symbol": [ "Julius", "Carrie", "Kirsten", "Federico", "Ruby", "Everett", "Patrick", "Alvin", "Frances", "Lois", "Miranda", "Martha", "Marilyn", "Jewel", "Aisha", "Dave", "Brett", "Gwen", "Sandra", "Winifred" ], "edges": [ [ 0, 9 ], [ 1, 7 ], [ 2, 3 ], [ 4, 1 ], [ 5, 4 ], [ 6, 2 ], [ 7, 6 ], [ 9, 5 ], [ 9, 8 ], [ 10, 19 ], [ 11, 17 ], [ 12, 13 ], [ 14, 11 ], [ 15, 14 ], [ 16, 12 ], [ 17, 16 ], [ 19, 15 ], [ 19, 18 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Duncan knows Jeffery. Jacques knows Gideon. Aldo knows Zach. Keira knows Colin. Neil knows Wesley. Jacques knows Aldo. Kit knows Jacques. Zach knows Warren. Madeline knows Paul. Gideon knows Brooks. Matt knows Dakota. Madeline knows Matt. Kit knows Neil. Paul knows Sebastian. Sebastian knows Ellis. Aldo knows Shelly. Sebastian knows Keira. Paul knows Duncan. Which of Zach and Keira can Madeline reach?", "answer": "Keira", "steps": [ "Madeline knows Paul.", "Paul knows Sebastian.", "Sebastian knows Keira." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Madeline", "Colin", "Paul", "Matt", "Ellis", "Sebastian", "Keira", "Duncan", "Jeffery", "Dakota", "Kit", "Warren", "Jacques", "Neil", "Shelly", "Aldo", "Zach", "Gideon", "Brooks", "Wesley" ], "edges": [ [ 0, 2 ], [ 0, 3 ], [ 2, 5 ], [ 2, 7 ], [ 3, 9 ], [ 5, 4 ], [ 5, 6 ], [ 6, 1 ], [ 7, 8 ], [ 10, 12 ], [ 10, 13 ], [ 12, 15 ], [ 12, 17 ], [ 13, 19 ], [ 15, 14 ], [ 15, 16 ], [ 16, 11 ], [ 17, 18 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Malik knows Mae. India knows Kieran. Randy knows Lyle. India knows Kobe. Kieran knows Ella. Virgil knows Kyle. Lyle knows Malik. Malik knows Kurt. India knows Nancy. Mae knows Annie. Malik knows Hailey. Kurt knows Lionel. Malik knows Virgil. India knows Holly. Eamon knows Maya. Maya knows India. Kobe knows Chester. Nancy knows Samuel. Which of Lyle and Maya can Eamon reach?", "answer": "Maya", "steps": [ "Eamon knows Maya." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Eamon", "Ella", "Holly", "Maya", "Nancy", "Kieran", "Samuel", "Kobe", "Chester", "India", "Randy", "Kyle", "Hailey", "Lyle", "Mae", "Virgil", "Annie", "Kurt", "Lionel", "Malik" ], "edges": [ [ 0, 3 ], [ 3, 9 ], [ 4, 6 ], [ 5, 1 ], [ 7, 8 ], [ 9, 2 ], [ 9, 5 ], [ 9, 4 ], [ 9, 7 ], [ 10, 13 ], [ 13, 19 ], [ 14, 16 ], [ 15, 11 ], [ 17, 18 ], [ 19, 12 ], [ 19, 15 ], [ 19, 14 ], [ 19, 17 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Justine knows Autumn. Dewey knows Joshua. Rita knows Theodore. Rita knows Jason. Ann knows Alicia. Dewey knows Tony. Evelyn knows Gail. Ann knows Adam. Adam knows Hilda. Lorna knows Tristan. Logan knows Fanny. Justine knows Evelyn. Rita knows Lorna. Lorna knows Dewey. Tony knows Kelly. Jason knows Zara. Ann knows Logan. Logan knows Justine. Which of Dewey and Justine can Rita reach?", "answer": "Dewey", "steps": [ "Rita knows Lorna.", "Lorna knows Dewey." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Rita", "Dewey", "Lorna", "Tony", "Jason", "Theodore", "Joshua", "Tristan", "Zara", "Kelly", "Ann", "Justine", "Logan", "Evelyn", "Adam", "Alicia", "Autumn", "Fanny", "Hilda", "Gail" ], "edges": [ [ 0, 5 ], [ 0, 4 ], [ 0, 2 ], [ 1, 6 ], [ 1, 3 ], [ 2, 7 ], [ 2, 1 ], [ 3, 9 ], [ 4, 8 ], [ 10, 15 ], [ 10, 14 ], [ 10, 12 ], [ 11, 16 ], [ 11, 13 ], [ 12, 17 ], [ 12, 11 ], [ 13, 19 ], [ 14, 18 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Jules knows Estelle. Edmund knows Opal. Hazel knows Layla. Malik knows Hazel. Hazel knows Floyd. Dwight knows Joanna. Penny knows Darla. Opal knows Dwight. Carol knows Hope. Carol knows Penny. Dwight knows Robert. Katrina knows Edmund. Joanna knows Jules. Edmund knows Marilyn. Michael knows Carol. Michael knows Gerald. Joanna knows Preston. Layla knows Michael. Which of Estelle and Darla can Katrina reach?", "answer": "Estelle", "steps": [ "Katrina knows Edmund.", "Edmund knows Opal.", "Opal knows Dwight.", "Dwight knows Joanna.", "Joanna knows Jules.", "Jules knows Estelle." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Katrina", "Marilyn", "Estelle", "Opal", "Joanna", "Robert", "Jules", "Dwight", "Preston", "Edmund", "Malik", "Floyd", "Darla", "Layla", "Carol", "Gerald", "Penny", "Michael", "Hope", "Hazel" ], "edges": [ [ 0, 9 ], [ 3, 7 ], [ 4, 6 ], [ 4, 8 ], [ 6, 2 ], [ 7, 5 ], [ 7, 4 ], [ 9, 1 ], [ 9, 3 ], [ 10, 19 ], [ 13, 17 ], [ 14, 16 ], [ 14, 18 ], [ 16, 12 ], [ 17, 15 ], [ 17, 14 ], [ 19, 11 ], [ 19, 13 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Freya knows Kennedy. Gerald knows Freya. Sheila knows Lola. Viola knows Callum. Tonya knows Kaleb. Jocelyn knows Gerald. Leon knows Ted. Leon knows Adelaide. Kennedy knows Georgia. Gavin knows Travis. Viola knows Tonya. Tonya knows Jocelyn. Jake knows Sheila. Lola knows Leon. Gavin knows Jake. Adelaide knows Eileen. Freya knows Iris. Jake knows Ruth. Which of Tonya and Jake can Viola reach?", "answer": "Tonya", "steps": [ "Viola knows Tonya." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Viola", "Georgia", "Gerald", "Callum", "Freya", "Kaleb", "Kennedy", "Jocelyn", "Iris", "Tonya", "Gavin", "Eileen", "Lola", "Travis", "Leon", "Ruth", "Adelaide", "Sheila", "Ted", "Jake" ], "edges": [ [ 0, 3 ], [ 0, 9 ], [ 2, 4 ], [ 4, 6 ], [ 4, 8 ], [ 6, 1 ], [ 7, 2 ], [ 9, 5 ], [ 9, 7 ], [ 10, 13 ], [ 10, 19 ], [ 12, 14 ], [ 14, 16 ], [ 14, 18 ], [ 16, 11 ], [ 17, 12 ], [ 19, 15 ], [ 19, 17 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Crystal knows Harrison. Hugh knows Felicia. Bennett knows Emanuel. Robin knows Marc. Bennett knows Tim. Hugh knows Irving. Harrison knows Yasmin. Xavier knows Mildred. Crystal knows Robin. Xavier knows Beau. Felicia knows Irene. James knows Bennett. Jesse knows Catherine. Crystal knows James. Beau knows Jonathan. Irving knows Xavier. Tim knows Clyde. Hugh knows Jesse. Which of Beau and Tim can Hugh reach?", "answer": "Beau", "steps": [ "Hugh knows Irving.", "Irving knows Xavier.", "Xavier knows Beau." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Hugh", "Felicia", "Xavier", "Jesse", "Mildred", "Catherine", "Beau", "Jonathan", "Irving", "Irene", "Crystal", "Robin", "Bennett", "Harrison", "Emanuel", "Yasmin", "Tim", "Clyde", "James", "Marc" ], "edges": [ [ 0, 3 ], [ 0, 8 ], [ 0, 1 ], [ 1, 9 ], [ 2, 4 ], [ 2, 6 ], [ 3, 5 ], [ 6, 7 ], [ 8, 2 ], [ 10, 13 ], [ 10, 18 ], [ 10, 11 ], [ 11, 19 ], [ 12, 14 ], [ 12, 16 ], [ 13, 15 ], [ 16, 17 ], [ 18, 12 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Carla knows Cassidy. Colette knows Wade. Leroy knows Delilah. Barbara knows Leroy. Carla knows Teresa. Ernesto knows Barbara. Emanuel knows Edward. Teresa knows Dakota. Greg knows Carla. Ernesto knows Harlan. Denise knows Martin. Terry knows Denise. Martin knows Colette. Edward knows Greg. Dakota knows Andre. Greg knows Jules. Jules knows Dora. Martin knows Ernesto. Which of Carla and Ernesto can Emanuel reach?", "answer": "Carla", "steps": [ "Emanuel knows Edward.", "Edward knows Greg.", "Greg knows Carla." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Emanuel", "Andre", "Dora", "Greg", "Dakota", "Jules", "Carla", "Teresa", "Cassidy", "Edward", "Terry", "Delilah", "Wade", "Martin", "Leroy", "Colette", "Ernesto", "Barbara", "Harlan", "Denise" ], "edges": [ [ 0, 9 ], [ 3, 5 ], [ 3, 6 ], [ 4, 1 ], [ 5, 2 ], [ 6, 7 ], [ 6, 8 ], [ 7, 4 ], [ 9, 3 ], [ 10, 19 ], [ 13, 15 ], [ 13, 16 ], [ 14, 11 ], [ 15, 12 ], [ 16, 17 ], [ 16, 18 ], [ 17, 14 ], [ 19, 13 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Kevin knows Harrison. Fabian knows Kira. Finn knows Colin. Lorna knows Jacqueline. Hudson knows Elijah. Fabian knows Renee. Ida knows Hudson. Philip knows Fabian. Fabian knows Lucy. Jasmine knows Catherine. Lucy knows Ida. Colin knows Colleen. Jacqueline knows Kevin. Lucy knows Jasmine. Harrison knows Rachel. Jacqueline knows Joyce. Kevin knows Finn. Jacqueline knows Carson. Which of Fabian and Jacqueline can Lorna reach?", "answer": "Jacqueline", "steps": [ "Lorna knows Jacqueline." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Lorna", "Rachel", "Colin", "Colleen", "Joyce", "Jacqueline", "Kevin", "Harrison", "Carson", "Finn", "Philip", "Catherine", "Hudson", "Elijah", "Kira", "Fabian", "Lucy", "Jasmine", "Renee", "Ida" ], "edges": [ [ 0, 5 ], [ 2, 3 ], [ 5, 4 ], [ 5, 8 ], [ 5, 6 ], [ 6, 7 ], [ 6, 9 ], [ 7, 1 ], [ 9, 2 ], [ 10, 15 ], [ 12, 13 ], [ 15, 14 ], [ 15, 18 ], [ 15, 16 ], [ 16, 17 ], [ 16, 19 ], [ 17, 11 ], [ 19, 12 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Miriam knows Sally. Fisher knows Paige. Wilma knows Mildred. Miriam knows Barbara. Federico knows Alicia. Rosemary knows Willis. Earl knows Jennifer. Jennifer knows Avery. Lorna knows Rosemary. Wilma knows Patrick. Miriam knows Drake. Mildred knows Louis. Barbara knows Natalie. Conner knows Federico. Alicia knows Lorna. Paige knows Earl. Sally knows Fisher. Wilma knows Conner. Which of Earl and Lorna can Wilma reach?", "answer": "Lorna", "steps": [ "Wilma knows Conner.", "Conner knows Federico.", "Federico knows Alicia.", "Alicia knows Lorna." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Wilma", "Rosemary", "Willis", "Mildred", "Lorna", "Patrick", "Louis", "Federico", "Alicia", "Conner", "Miriam", "Jennifer", "Avery", "Barbara", "Earl", "Drake", "Natalie", "Fisher", "Paige", "Sally" ], "edges": [ [ 0, 5 ], [ 0, 3 ], [ 0, 9 ], [ 1, 2 ], [ 3, 6 ], [ 4, 1 ], [ 7, 8 ], [ 8, 4 ], [ 9, 7 ], [ 10, 15 ], [ 10, 13 ], [ 10, 19 ], [ 11, 12 ], [ 13, 16 ], [ 14, 11 ], [ 17, 18 ], [ 18, 14 ], [ 19, 17 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Brooke knows Leonard. Mae knows Aurora. Alex knows Dick. Gavin knows Gus. Geoffrey knows John. Dick knows Desmond. Aurora knows Electra. Barry knows Gavin. Elvira knows Geoffrey. Lark knows Doug. Gus knows Brooke. Louise knows Janet. Brooke knows Elvira. Pauline knows Alex. Pauline knows Lark. Doug knows Fernando. Leonard knows Louise. Electra knows Pauline. Which of Elvira and Alex can Barry reach?", "answer": "Elvira", "steps": [ "Barry knows Gavin.", "Gavin knows Gus.", "Gus knows Brooke.", "Brooke knows Elvira." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Barry", "Gus", "Gavin", "Leonard", "Elvira", "Janet", "Louise", "John", "Geoffrey", "Brooke", "Mae", "Electra", "Aurora", "Lark", "Alex", "Fernando", "Doug", "Desmond", "Dick", "Pauline" ], "edges": [ [ 0, 2 ], [ 1, 9 ], [ 2, 1 ], [ 3, 6 ], [ 4, 8 ], [ 6, 5 ], [ 8, 7 ], [ 9, 3 ], [ 9, 4 ], [ 10, 12 ], [ 11, 19 ], [ 12, 11 ], [ 13, 16 ], [ 14, 18 ], [ 16, 15 ], [ 18, 17 ], [ 19, 13 ], [ 19, 14 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Leah knows Darius. Pam knows Ethan. Ethan knows Russell. Brock knows Maria. Frances knows Brock. Paula knows Garland. Darius knows Frances. Darius knows Anthony. Anthony knows Abby. Ethan knows Miranda. Ethan knows Sandy. Brock knows Riley. Garland knows Ray. Brock knows Chad. Garland knows Pam. Ray knows Dolores. Darius knows Miles. Garland knows Jude. Which of Brock and Ethan can Leah reach?", "answer": "Brock", "steps": [ "Leah knows Darius.", "Darius knows Frances.", "Frances knows Brock." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Leah", "Darius", "Chad", "Riley", "Anthony", "Frances", "Abby", "Maria", "Miles", "Brock", "Paula", "Garland", "Sandy", "Miranda", "Ray", "Pam", "Dolores", "Russell", "Jude", "Ethan" ], "edges": [ [ 0, 1 ], [ 1, 4 ], [ 1, 8 ], [ 1, 5 ], [ 4, 6 ], [ 5, 9 ], [ 9, 2 ], [ 9, 3 ], [ 9, 7 ], [ 10, 11 ], [ 11, 14 ], [ 11, 18 ], [ 11, 15 ], [ 14, 16 ], [ 15, 19 ], [ 19, 12 ], [ 19, 13 ], [ 19, 17 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Beau knows Amber. Rosemary knows Jordan. Camille knows Kimberly. Camille knows Sharon. Faith knows Samantha. Rick knows Faith. Vera knows Jolene. Vera knows Etta. Gemma knows Effie. Etta knows Beau. Jordan knows Michelle. Rick knows Hilda. Rick knows Vera. Gemma knows Cameron. Cameron knows Tina. Cameron knows Rosemary. Faith knows Louis. Gemma knows Camille. Which of Vera and Cameron can Rick reach?", "answer": "Vera", "steps": [ "Rick knows Vera." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Rick", "Beau", "Vera", "Amber", "Louis", "Hilda", "Jolene", "Faith", "Etta", "Samantha", "Gemma", "Jordan", "Cameron", "Michelle", "Kimberly", "Effie", "Tina", "Camille", "Rosemary", "Sharon" ], "edges": [ [ 0, 5 ], [ 0, 2 ], [ 0, 7 ], [ 1, 3 ], [ 2, 6 ], [ 2, 8 ], [ 7, 4 ], [ 7, 9 ], [ 8, 1 ], [ 10, 15 ], [ 10, 12 ], [ 10, 17 ], [ 11, 13 ], [ 12, 16 ], [ 12, 18 ], [ 17, 14 ], [ 17, 19 ], [ 18, 11 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Edna knows Kendrick. Edna knows Fabian. Austin knows Alice. Austin knows Daphne. Wallace knows Austin. Bert knows Edna. Jose knows Olive. Mack knows Bert. Delilah knows Martha. Alison knows Adam. Martha knows Kirk. Martha knows Dallas. Vicki knows Arden. Wallace knows Delilah. Dallas knows Jose. Kendrick knows Alison. Vicki knows Garrison. Mack knows Vicki. Which of Olive and Adam can Wallace reach?", "answer": "Olive", "steps": [ "Wallace knows Delilah.", "Delilah knows Martha.", "Martha knows Dallas.", "Dallas knows Jose.", "Jose knows Olive." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Wallace", "Jose", "Olive", "Dallas", "Alice", "Austin", "Martha", "Delilah", "Kirk", "Daphne", "Mack", "Alison", "Adam", "Kendrick", "Garrison", "Vicki", "Edna", "Bert", "Fabian", "Arden" ], "edges": [ [ 0, 7 ], [ 0, 5 ], [ 1, 2 ], [ 3, 1 ], [ 5, 4 ], [ 5, 9 ], [ 6, 3 ], [ 6, 8 ], [ 7, 6 ], [ 10, 17 ], [ 10, 15 ], [ 11, 12 ], [ 13, 11 ], [ 15, 14 ], [ 15, 19 ], [ 16, 13 ], [ 16, 18 ], [ 17, 16 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Denise knows Guillermo. Effie knows Dina. Dina knows Mara. Haven knows Aspen. Cesar knows Haven. Mara knows Marc. Haven knows Rena. Haven knows Samuel. Dina knows Stella. Rena knows Brian. Haven knows Denise. Ralph knows Helene. Helene knows Caroline. Aspen knows Daphne. Dina knows Leigh. Guillermo knows Marcus. Dina knows Ralph. Stella knows Ramon. Which of Denise and Ralph can Cesar reach?", "answer": "Denise", "steps": [ "Cesar knows Haven.", "Haven knows Denise." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Cesar", "Samuel", "Brian", "Guillermo", "Aspen", "Rena", "Marcus", "Haven", "Daphne", "Denise", "Effie", "Leigh", "Ramon", "Helene", "Mara", "Stella", "Caroline", "Dina", "Marc", "Ralph" ], "edges": [ [ 0, 7 ], [ 3, 6 ], [ 4, 8 ], [ 5, 2 ], [ 7, 1 ], [ 7, 5 ], [ 7, 4 ], [ 7, 9 ], [ 9, 3 ], [ 10, 17 ], [ 13, 16 ], [ 14, 18 ], [ 15, 12 ], [ 17, 11 ], [ 17, 15 ], [ 17, 14 ], [ 17, 19 ], [ 19, 13 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Imogen knows Brett. Bella knows Brandon. Imogen knows Chris. Lee knows Frankie. Lee knows Quinn. Lars knows Kate. Darin knows Bonnie. Brandon knows Dorian. Dell knows Naomi. Chris knows Lars. Bella knows Janice. Darin knows Mason. Guy knows Dell. Dell knows Bella. Serena knows Imogen. Guy knows Lee. Chris knows Hazel. Serena knows Darin. Which of Kate and Dorian can Guy reach?", "answer": "Dorian", "steps": [ "Guy knows Dell.", "Dell knows Bella.", "Bella knows Brandon.", "Brandon knows Dorian." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Guy", "Janice", "Lee", "Frankie", "Bella", "Dorian", "Naomi", "Brandon", "Quinn", "Dell", "Serena", "Hazel", "Darin", "Mason", "Chris", "Kate", "Brett", "Lars", "Bonnie", "Imogen" ], "edges": [ [ 0, 2 ], [ 0, 9 ], [ 2, 3 ], [ 2, 8 ], [ 4, 1 ], [ 4, 7 ], [ 7, 5 ], [ 9, 6 ], [ 9, 4 ], [ 10, 12 ], [ 10, 19 ], [ 12, 13 ], [ 12, 18 ], [ 14, 11 ], [ 14, 17 ], [ 17, 15 ], [ 19, 16 ], [ 19, 14 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Alma knows Bruno. Marshall knows Ethan. Jillian knows Wesley. Alma knows Roland. Hugh knows Selena. Marshall knows Freya. Lily knows Tiffany. Selena knows Camille. Alma knows Nell. Shane knows Kara. Camille knows Devin. Freya knows Jerome. Camille knows Lily. Marshall knows Hugh. Bruno knows Jillian. Wesley knows Shane. Wesley knows Arnold. Nell knows Cyrus. Which of Selena and Jillian can Alma reach?", "answer": "Jillian", "steps": [ "Alma knows Bruno.", "Bruno knows Jillian." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Alma", "Cyrus", "Wesley", "Roland", "Nell", "Kara", "Arnold", "Shane", "Bruno", "Jillian", "Marshall", "Jerome", "Camille", "Ethan", "Freya", "Tiffany", "Devin", "Lily", "Hugh", "Selena" ], "edges": [ [ 0, 3 ], [ 0, 4 ], [ 0, 8 ], [ 2, 6 ], [ 2, 7 ], [ 4, 1 ], [ 7, 5 ], [ 8, 9 ], [ 9, 2 ], [ 10, 13 ], [ 10, 14 ], [ 10, 18 ], [ 12, 16 ], [ 12, 17 ], [ 14, 11 ], [ 17, 15 ], [ 18, 19 ], [ 19, 12 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "August knows Josie. Zara knows Arthur. Carson knows Saul. Cristina knows August. Karl knows Lorna. Annie knows Troy. Hubert knows Sadie. Ebony knows Aspen. Todd knows Hubert. Arthur knows Malik. Malik knows Ebony. Aspen knows Karl. Chandler knows Todd. Courtney knows Annie. Aspen knows Cristina. Todd knows Carson. Saul knows George. Troy knows Chandler. Which of Malik and Troy can Zara reach?", "answer": "Malik", "steps": [ "Zara knows Arthur.", "Arthur knows Malik." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Zara", "Malik", "Josie", "Arthur", "Cristina", "Karl", "Ebony", "Lorna", "August", "Aspen", "Courtney", "Troy", "George", "Annie", "Carson", "Hubert", "Chandler", "Sadie", "Saul", "Todd" ], "edges": [ [ 0, 3 ], [ 1, 6 ], [ 3, 1 ], [ 4, 8 ], [ 5, 7 ], [ 6, 9 ], [ 8, 2 ], [ 9, 5 ], [ 9, 4 ], [ 10, 13 ], [ 11, 16 ], [ 13, 11 ], [ 14, 18 ], [ 15, 17 ], [ 16, 19 ], [ 18, 12 ], [ 19, 15 ], [ 19, 14 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Leroy knows Lorenzo. Alice knows Ainsley. Judy knows Ida. Leroy knows Kit. Ainsley knows Janice. Wilma knows Isla. Kit knows Alice. Arthur knows Tina. Gus knows Judy. Ida knows Uma. Laverne knows Luther. Lorenzo knows Paige. Tina knows Laverne. Luther knows Pearl. Luther knows Myra. Ainsley knows Donald. Arthur knows Gus. Paige knows Wilma. Which of Isla and Uma can Arthur reach?", "answer": "Uma", "steps": [ "Arthur knows Gus.", "Gus knows Judy.", "Judy knows Ida.", "Ida knows Uma." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Arthur", "Luther", "Tina", "Pearl", "Ida", "Uma", "Laverne", "Gus", "Myra", "Judy", "Leroy", "Ainsley", "Kit", "Janice", "Wilma", "Isla", "Alice", "Lorenzo", "Donald", "Paige" ], "edges": [ [ 0, 2 ], [ 0, 7 ], [ 1, 3 ], [ 1, 8 ], [ 2, 6 ], [ 4, 5 ], [ 6, 1 ], [ 7, 9 ], [ 9, 4 ], [ 10, 12 ], [ 10, 17 ], [ 11, 13 ], [ 11, 18 ], [ 12, 16 ], [ 14, 15 ], [ 16, 11 ], [ 17, 19 ], [ 19, 14 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Joanna knows Earle. Rhonda knows Katherine. Greta knows Rhonda. Jean knows Judy. Katherine knows Daniel. Francesca knows Greta. Daniel knows Scott. Daniel knows Yvonne. Kay knows Joanna. Jack knows Cesar. Yvonne knows Janice. Judy knows Emanuel. Earle knows Cain. Judy knows Axel. Cain knows Tonya. Cesar knows Francesca. Tonya knows Jean. Emanuel knows Ariana. Which of Rhonda and Tonya can Jack reach?", "answer": "Rhonda", "steps": [ "Jack knows Cesar.", "Cesar knows Francesca.", "Francesca knows Greta.", "Greta knows Rhonda." ], "difficulty": 4, "original_distance": 8, "idx_to_symbol": [ "Jack", "Greta", "Cesar", "Scott", "Katherine", "Yvonne", "Janice", "Daniel", "Francesca", "Rhonda", "Kay", "Cain", "Joanna", "Axel", "Jean", "Emanuel", "Ariana", "Judy", "Earle", "Tonya" ], "edges": [ [ 0, 2 ], [ 1, 9 ], [ 2, 8 ], [ 4, 7 ], [ 5, 6 ], [ 7, 3 ], [ 7, 5 ], [ 8, 1 ], [ 9, 4 ], [ 10, 12 ], [ 11, 19 ], [ 12, 18 ], [ 14, 17 ], [ 15, 16 ], [ 17, 13 ], [ 17, 15 ], [ 18, 11 ], [ 19, 14 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Abel knows Alyson. Calvin knows Dell. Dave knows Abel. Alyson knows Naomi. Abel knows Axel. Alyson knows Austin. Jill knows Francesca. Edison knows Clifford. Abel knows Gary. Francesca knows Charlene. Roger knows Haven. Roger knows Edison. Roger knows Kelsey. Abel knows Chloe. Dell knows Dave. Edison knows Paige. Charlene knows Roger. Roger knows Elvis. Which of Francesca and Dell can Jill reach?", "answer": "Francesca", "steps": [ "Jill knows Francesca." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Jill", "Kelsey", "Edison", "Francesca", "Paige", "Haven", "Clifford", "Roger", "Elvis", "Charlene", "Calvin", "Axel", "Alyson", "Dell", "Naomi", "Gary", "Austin", "Abel", "Chloe", "Dave" ], "edges": [ [ 0, 3 ], [ 2, 4 ], [ 2, 6 ], [ 3, 9 ], [ 7, 1 ], [ 7, 5 ], [ 7, 2 ], [ 7, 8 ], [ 9, 7 ], [ 10, 13 ], [ 12, 14 ], [ 12, 16 ], [ 13, 19 ], [ 17, 11 ], [ 17, 15 ], [ 17, 12 ], [ 17, 18 ], [ 19, 17 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Ernest knows Anna. Ida knows Ernest. Vincent knows Ted. Anna knows Emma. Etta knows Uma. Ida knows Ronald. Ted knows Leroy. Vincent knows Pedro. Brad knows Candice. Ted knows Ann. Todd knows Madeline. Vincent knows Brad. Pedro knows Erma. Ernest knows Humphrey. Anna knows Malik. Ernest knows Todd. Humphrey knows Ernesto. Etta knows Vincent. Which of Ernest and Vincent can Etta reach?", "answer": "Vincent", "steps": [ "Etta knows Vincent." ], "difficulty": 1, "original_distance": 3, "idx_to_symbol": [ "Etta", "Ted", "Ann", "Brad", "Uma", "Erma", "Vincent", "Pedro", "Candice", "Leroy", "Ida", "Anna", "Malik", "Todd", "Ronald", "Ernesto", "Ernest", "Humphrey", "Madeline", "Emma" ], "edges": [ [ 0, 4 ], [ 0, 6 ], [ 1, 2 ], [ 1, 9 ], [ 3, 8 ], [ 6, 7 ], [ 6, 3 ], [ 6, 1 ], [ 7, 5 ], [ 10, 14 ], [ 10, 16 ], [ 11, 12 ], [ 11, 19 ], [ 13, 18 ], [ 16, 17 ], [ 16, 13 ], [ 16, 11 ], [ 17, 15 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Wesley knows Esperanza. Vincent knows Lennox. Clarissa knows Samuel. Jeremy knows Gerald. Gideon knows Nora. Virgil knows Val. Wesley knows Ellis. Samuel knows Arden. Vincent knows Garrett. Esperanza knows Virgil. Gideon knows Lorna. Vincent knows Wesley. Gideon knows Clarissa. Samuel knows Jeremy. Esperanza knows Della. Omar knows Vincent. Zoe knows Gideon. Clarissa knows Selena. Which of Virgil and Jeremy can Omar reach?", "answer": "Virgil", "steps": [ "Omar knows Vincent.", "Vincent knows Wesley.", "Wesley knows Esperanza.", "Esperanza knows Virgil." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Omar", "Wesley", "Vincent", "Lennox", "Val", "Garrett", "Ellis", "Della", "Esperanza", "Virgil", "Zoe", "Clarissa", "Gideon", "Lorna", "Gerald", "Nora", "Selena", "Arden", "Samuel", "Jeremy" ], "edges": [ [ 0, 2 ], [ 1, 6 ], [ 1, 8 ], [ 2, 3 ], [ 2, 5 ], [ 2, 1 ], [ 8, 7 ], [ 8, 9 ], [ 9, 4 ], [ 10, 12 ], [ 11, 16 ], [ 11, 18 ], [ 12, 13 ], [ 12, 15 ], [ 12, 11 ], [ 18, 17 ], [ 18, 19 ], [ 19, 14 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Frida knows Kristina. Virginia knows Frida. Fergus knows Hudson. Lena knows Brock. Kristin knows Ralph. Jocelyn knows Kai. Jeremy knows Jocelyn. Kristina knows Alfonso. Harper knows Jillian. Jackson knows Kristin. Hudson knows Harper. Bryan knows Jeremy. Jeremy knows Sue. Kai knows Fergus. Kristin knows Lena. Ralph knows Virginia. Alfonso knows Brian. Sue knows Frank. Which of Kristina and Hudson can Bryan reach?", "answer": "Hudson", "steps": [ "Bryan knows Jeremy.", "Jeremy knows Jocelyn.", "Jocelyn knows Kai.", "Kai knows Fergus.", "Fergus knows Hudson." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Bryan", "Sue", "Jillian", "Harper", "Jocelyn", "Fergus", "Frank", "Hudson", "Jeremy", "Kai", "Jackson", "Lena", "Brian", "Alfonso", "Ralph", "Frida", "Brock", "Kristina", "Kristin", "Virginia" ], "edges": [ [ 0, 8 ], [ 1, 6 ], [ 3, 2 ], [ 4, 9 ], [ 5, 7 ], [ 7, 3 ], [ 8, 1 ], [ 8, 4 ], [ 9, 5 ], [ 10, 18 ], [ 11, 16 ], [ 13, 12 ], [ 14, 19 ], [ 15, 17 ], [ 17, 13 ], [ 18, 11 ], [ 18, 14 ], [ 19, 15 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Joshua knows Lamont. Harry knows Camden. Joshua knows Harris. Casey knows Lee. Darnell knows Virginia. Darnell knows Nolan. Joshua knows Willard. Joshua knows Corey. Virginia knows Ada. Willard knows Ava. Blake knows Cesar. Casey knows Harry. Ada knows Blake. Blake knows Kristin. Ava knows Casey. Darnell knows Cordelia. Kristin knows Steve. Darnell knows Patricia. Which of Virginia and Willard can Darnell reach?", "answer": "Virginia", "steps": [ "Darnell knows Virginia." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Darnell", "Kristin", "Cordelia", "Blake", "Steve", "Cesar", "Nolan", "Ada", "Virginia", "Patricia", "Joshua", "Harry", "Harris", "Casey", "Camden", "Lee", "Lamont", "Ava", "Willard", "Corey" ], "edges": [ [ 0, 2 ], [ 0, 6 ], [ 0, 8 ], [ 0, 9 ], [ 1, 4 ], [ 3, 1 ], [ 3, 5 ], [ 7, 3 ], [ 8, 7 ], [ 10, 12 ], [ 10, 16 ], [ 10, 18 ], [ 10, 19 ], [ 11, 14 ], [ 13, 11 ], [ 13, 15 ], [ 17, 13 ], [ 18, 17 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Langston knows Robert. Frida knows Clark. Belinda knows Dora. Bella knows Frida. Kelsey knows Ebony. Devon knows Trudy. Gail knows Ira. Dora knows Langston. Rachel knows Alyssa. Robert knows Autumn. Hampton knows Rachel. Rachel knows Janet. Alyssa knows Erwin. Kelsey knows Devon. Langston knows Hampton. Layla knows Bella. Frida knows Gail. Clark knows Kelsey. Which of Clark and Hampton can Belinda reach?", "answer": "Hampton", "steps": [ "Belinda knows Dora.", "Dora knows Langston.", "Langston knows Hampton." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Belinda", "Hampton", "Autumn", "Rachel", "Alyssa", "Janet", "Langston", "Dora", "Robert", "Erwin", "Layla", "Clark", "Ira", "Kelsey", "Devon", "Ebony", "Frida", "Bella", "Gail", "Trudy" ], "edges": [ [ 0, 7 ], [ 1, 3 ], [ 3, 5 ], [ 3, 4 ], [ 4, 9 ], [ 6, 8 ], [ 6, 1 ], [ 7, 6 ], [ 8, 2 ], [ 10, 17 ], [ 11, 13 ], [ 13, 15 ], [ 13, 14 ], [ 14, 19 ], [ 16, 18 ], [ 16, 11 ], [ 17, 16 ], [ 18, 12 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Nicholas knows Elsa. Joaquin knows Allen. Fiona knows Joyce. Fiona knows Pablo. Kathleen knows Claudia. Claudia knows Hilda. Peter knows Ashley. Lana knows Alfonso. Yvonne knows Nicholas. Dwight knows Greg. Kathleen knows Lana. Joyce knows Dwight. Yvonne knows Kathleen. Hilda knows Marshall. Claudia knows Jerry. Pablo knows Vicki. Joyce knows Peter. Dwight knows Joaquin. Which of Joyce and Kathleen can Fiona reach?", "answer": "Joyce", "steps": [ "Fiona knows Joyce." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Fiona", "Ashley", "Dwight", "Pablo", "Vicki", "Joyce", "Joaquin", "Greg", "Peter", "Allen", "Yvonne", "Alfonso", "Claudia", "Nicholas", "Elsa", "Kathleen", "Hilda", "Jerry", "Lana", "Marshall" ], "edges": [ [ 0, 3 ], [ 0, 5 ], [ 2, 7 ], [ 2, 6 ], [ 3, 4 ], [ 5, 8 ], [ 5, 2 ], [ 6, 9 ], [ 8, 1 ], [ 10, 13 ], [ 10, 15 ], [ 12, 17 ], [ 12, 16 ], [ 13, 14 ], [ 15, 18 ], [ 15, 12 ], [ 16, 19 ], [ 18, 11 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Lawson knows Rhea. Lucas knows Lawson. Chandler knows Herbert. Cornelius knows Sonia. Rhea knows Jenny. Cornelius knows Kenneth. Tessa knows Chandler. Dalton knows Dean. Dave knows Cornelius. Lawson knows Amber. Chandler knows Leland. Leland knows Marcus. Amber knows Cruz. Jenny knows Dave. Herbert knows Leigh. Dalton knows Larry. Joseph knows Dalton. Leigh knows Joseph. Which of Dave and Joseph can Tessa reach?", "answer": "Joseph", "steps": [ "Tessa knows Chandler.", "Chandler knows Herbert.", "Herbert knows Leigh.", "Leigh knows Joseph." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Tessa", "Larry", "Marcus", "Leigh", "Dean", "Herbert", "Joseph", "Dalton", "Leland", "Chandler", "Lucas", "Sonia", "Cruz", "Jenny", "Kenneth", "Rhea", "Dave", "Cornelius", "Amber", "Lawson" ], "edges": [ [ 0, 9 ], [ 3, 6 ], [ 5, 3 ], [ 6, 7 ], [ 7, 1 ], [ 7, 4 ], [ 8, 2 ], [ 9, 5 ], [ 9, 8 ], [ 10, 19 ], [ 13, 16 ], [ 15, 13 ], [ 16, 17 ], [ 17, 11 ], [ 17, 14 ], [ 18, 12 ], [ 19, 15 ], [ 19, 18 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Hudson knows Nash. Cruz knows Mara. Dudley knows Douglas. Deirdre knows Kobe. Monroe knows Palmer. Kobe knows Andrew. Farrah knows Hudson. Sandra knows Monroe. Nash knows Dudley. Douglas knows Damian. Hudson knows Rhea. Rhea knows Kendra. Mara knows Burt. Andrew knows Norma. Cruz knows Deirdre. Wendy knows Farrah. Zane knows Wendy. Palmer knows Cruz. Which of Cruz and Hudson can Sandra reach?", "answer": "Cruz", "steps": [ "Sandra knows Monroe.", "Monroe knows Palmer.", "Palmer knows Cruz." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Sandra", "Cruz", "Mara", "Burt", "Andrew", "Deirdre", "Norma", "Kobe", "Monroe", "Palmer", "Zane", "Hudson", "Rhea", "Kendra", "Douglas", "Nash", "Damian", "Dudley", "Wendy", "Farrah" ], "edges": [ [ 0, 8 ], [ 1, 2 ], [ 1, 5 ], [ 2, 3 ], [ 4, 6 ], [ 5, 7 ], [ 7, 4 ], [ 8, 9 ], [ 9, 1 ], [ 10, 18 ], [ 11, 12 ], [ 11, 15 ], [ 12, 13 ], [ 14, 16 ], [ 15, 17 ], [ 17, 14 ], [ 18, 19 ], [ 19, 11 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Jeremy knows Henry. Jane knows Bernice. Beatrice knows Fanny. Roman knows Emma. Roman knows Luther. Henry knows Alfred. Christina knows Heather. Knox knows Pearl. Bella knows Emmett. Bella knows Beatrice. Jane knows Anastasia. Anastasia knows Estella. Emmett knows Jeremy. Henry knows Stacy. Jared knows Roman. Henry knows Christina. Roman knows Knox. Bernice knows Jared. Which of Jared and Jeremy can Bella reach?", "answer": "Jeremy", "steps": [ "Bella knows Emmett.", "Emmett knows Jeremy." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Bella", "Beatrice", "Christina", "Heather", "Stacy", "Alfred", "Emmett", "Jeremy", "Fanny", "Henry", "Jane", "Anastasia", "Knox", "Pearl", "Emma", "Luther", "Bernice", "Jared", "Estella", "Roman" ], "edges": [ [ 0, 1 ], [ 0, 6 ], [ 1, 8 ], [ 2, 3 ], [ 6, 7 ], [ 7, 9 ], [ 9, 2 ], [ 9, 4 ], [ 9, 5 ], [ 10, 11 ], [ 10, 16 ], [ 11, 18 ], [ 12, 13 ], [ 16, 17 ], [ 17, 19 ], [ 19, 12 ], [ 19, 14 ], [ 19, 15 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Anastasia knows Amanda. Hailey knows Pauline. Jaime knows Dorian. Brooke knows Hailey. Pauline knows Dave. Dave knows Adele. Carrie knows Geneva. Brooke knows Ernest. Carrie knows Ibrahim. Anastasia knows Hudson. Hudson knows Carrie. Pauline knows Pablo. Lauren knows Anastasia. Dorian knows Lionel. Dorian knows Brooke. Jamie knows Lauren. Ibrahim knows Kirsten. Lauren knows Owen. Which of Adele and Kirsten can Jamie reach?", "answer": "Kirsten", "steps": [ "Jamie knows Lauren.", "Lauren knows Anastasia.", "Anastasia knows Hudson.", "Hudson knows Carrie.", "Carrie knows Ibrahim.", "Ibrahim knows Kirsten." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Jamie", "Amanda", "Lauren", "Geneva", "Carrie", "Anastasia", "Hudson", "Owen", "Kirsten", "Ibrahim", "Jaime", "Ernest", "Dorian", "Pablo", "Pauline", "Brooke", "Hailey", "Lionel", "Adele", "Dave" ], "edges": [ [ 0, 2 ], [ 2, 7 ], [ 2, 5 ], [ 4, 3 ], [ 4, 9 ], [ 5, 1 ], [ 5, 6 ], [ 6, 4 ], [ 9, 8 ], [ 10, 12 ], [ 12, 17 ], [ 12, 15 ], [ 14, 13 ], [ 14, 19 ], [ 15, 11 ], [ 15, 16 ], [ 16, 14 ], [ 19, 18 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Lawson knows Rhea. Lucas knows Lawson. Chandler knows Herbert. Cornelius knows Sonia. Rhea knows Jenny. Cornelius knows Kenneth. Tessa knows Chandler. Dalton knows Dean. Dave knows Cornelius. Lawson knows Amber. Chandler knows Leland. Leland knows Marcus. Amber knows Cruz. Jenny knows Dave. Herbert knows Leigh. Dalton knows Larry. Joseph knows Dalton. Leigh knows Joseph. Which of Lawson and Chandler can Tessa reach?", "answer": "Chandler", "steps": [ "Tessa knows Chandler." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Tessa", "Larry", "Marcus", "Leigh", "Dean", "Herbert", "Joseph", "Dalton", "Leland", "Chandler", "Lucas", "Sonia", "Cruz", "Jenny", "Kenneth", "Rhea", "Dave", "Cornelius", "Amber", "Lawson" ], "edges": [ [ 0, 9 ], [ 3, 6 ], [ 5, 3 ], [ 6, 7 ], [ 7, 1 ], [ 7, 4 ], [ 8, 2 ], [ 9, 5 ], [ 9, 8 ], [ 10, 19 ], [ 13, 16 ], [ 15, 13 ], [ 16, 17 ], [ 17, 11 ], [ 17, 14 ], [ 18, 12 ], [ 19, 15 ], [ 19, 18 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Iris knows Gene. Harriet knows Kevin. Eric knows Larissa. Byron knows Rocco. Emmett knows Jarvis. Lambert knows Lewis. Harriet knows Geoffrey. Lewis knows Byron. Iris knows Rosa. Desmond knows Lambert. Emmett knows Harriet. Byron knows Bella. Desmond knows Isadora. Florence knows Desmond. Lambert knows Lorenzo. Kevin knows Iris. Eric knows Emmett. Florence knows Chance. Which of Harriet and Lambert can Florence reach?", "answer": "Lambert", "steps": [ "Florence knows Desmond.", "Desmond knows Lambert." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Florence", "Lewis", "Chance", "Lorenzo", "Rocco", "Lambert", "Bella", "Byron", "Desmond", "Isadora", "Eric", "Kevin", "Larissa", "Geoffrey", "Gene", "Harriet", "Rosa", "Iris", "Emmett", "Jarvis" ], "edges": [ [ 0, 2 ], [ 0, 8 ], [ 1, 7 ], [ 5, 3 ], [ 5, 1 ], [ 7, 4 ], [ 7, 6 ], [ 8, 5 ], [ 8, 9 ], [ 10, 12 ], [ 10, 18 ], [ 11, 17 ], [ 15, 13 ], [ 15, 11 ], [ 17, 14 ], [ 17, 16 ], [ 18, 15 ], [ 18, 19 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Roger knows Lambert. Trevor knows Louis. Henry knows Virginia. Spencer knows Trevor. Louis knows Henry. Henrietta knows Spencer. Lambert knows Enid. Hope knows Heath. Pearl knows Edwin. Edwin knows Callum. Jakob knows Guy. Carla knows Chester. Lambert knows Carla. Chester knows Hope. Hope knows Pearl. Jakob knows Henrietta. Trevor knows Vera. Cindy knows Jakob. Which of Trevor and Hope can Roger reach?", "answer": "Hope", "steps": [ "Roger knows Lambert.", "Lambert knows Carla.", "Carla knows Chester.", "Chester knows Hope." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Roger", "Heath", "Hope", "Enid", "Pearl", "Chester", "Lambert", "Callum", "Carla", "Edwin", "Cindy", "Vera", "Trevor", "Guy", "Louis", "Spencer", "Jakob", "Virginia", "Henrietta", "Henry" ], "edges": [ [ 0, 6 ], [ 2, 1 ], [ 2, 4 ], [ 4, 9 ], [ 5, 2 ], [ 6, 3 ], [ 6, 8 ], [ 8, 5 ], [ 9, 7 ], [ 10, 16 ], [ 12, 11 ], [ 12, 14 ], [ 14, 19 ], [ 15, 12 ], [ 16, 13 ], [ 16, 18 ], [ 18, 15 ], [ 19, 17 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Eugene knows Inez. Porter knows Philip. Carlton knows Chester. Chester knows Edna. Tristan knows Beverly. Dwight knows Tristan. Inez knows Carlton. Inez knows Elodie. Jackson knows Eugene. Philip knows Quinn. Beverly knows Colby. Chester knows Calvin. Beverly knows Porter. Joan knows Rosa. Lucia knows Aspen. Philip knows Dominic. Carlton knows Joan. Porter knows Lucia. Which of Beverly and Inez can Jackson reach?", "answer": "Inez", "steps": [ "Jackson knows Eugene.", "Eugene knows Inez." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Jackson", "Calvin", "Elodie", "Edna", "Joan", "Eugene", "Rosa", "Inez", "Carlton", "Chester", "Dwight", "Dominic", "Colby", "Quinn", "Lucia", "Tristan", "Aspen", "Beverly", "Porter", "Philip" ], "edges": [ [ 0, 5 ], [ 4, 6 ], [ 5, 7 ], [ 7, 2 ], [ 7, 8 ], [ 8, 4 ], [ 8, 9 ], [ 9, 1 ], [ 9, 3 ], [ 10, 15 ], [ 14, 16 ], [ 15, 17 ], [ 17, 12 ], [ 17, 18 ], [ 18, 14 ], [ 18, 19 ], [ 19, 11 ], [ 19, 13 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Hugh knows Daria. Jane knows Mara. Arden knows Opal. Paige knows Sean. Yuki knows Victor. Colin knows Rhonda. Lars knows Leopold. Victor knows Arden. Archer knows Paige. Fanny knows Ramona. Fanny knows Hugh. Sean knows Carl. Leopold knows Maggie. Maggie knows Jane. Opal knows Fanny. Daria knows Colin. Jane knows Archer. Hayes knows Lars. Which of Daria and Paige can Yuki reach?", "answer": "Daria", "steps": [ "Yuki knows Victor.", "Victor knows Arden.", "Arden knows Opal.", "Opal knows Fanny.", "Fanny knows Hugh.", "Hugh knows Daria." ], "difficulty": 6, "original_distance": 8, "idx_to_symbol": [ "Yuki", "Victor", "Daria", "Colin", "Fanny", "Opal", "Rhonda", "Arden", "Hugh", "Ramona", "Hayes", "Lars", "Paige", "Sean", "Jane", "Maggie", "Carl", "Leopold", "Archer", "Mara" ], "edges": [ [ 0, 1 ], [ 1, 7 ], [ 2, 3 ], [ 3, 6 ], [ 4, 8 ], [ 4, 9 ], [ 5, 4 ], [ 7, 5 ], [ 8, 2 ], [ 10, 11 ], [ 11, 17 ], [ 12, 13 ], [ 13, 16 ], [ 14, 18 ], [ 14, 19 ], [ 15, 14 ], [ 17, 15 ], [ 18, 12 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Jermaine knows Aurora. Ann knows Gina. Monica knows Ruby. Ann knows Maude. Saul knows Monica. Ruby knows Yolanda. Amelia knows Jules. Eleanor knows Ann. Levi knows Veronica. Eleanor knows Archie. Jules knows Cesar. Jermaine knows Amelia. Yolanda knows Lars. Yolanda knows Kenzie. Lars knows Levi. Monica knows Eugenia. Maude knows Jermaine. Saul knows Lewis. Which of Amelia and Lars can Saul reach?", "answer": "Lars", "steps": [ "Saul knows Monica.", "Monica knows Ruby.", "Ruby knows Yolanda.", "Yolanda knows Lars." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Saul", "Veronica", "Monica", "Kenzie", "Eugenia", "Lewis", "Levi", "Lars", "Ruby", "Yolanda", "Eleanor", "Cesar", "Ann", "Aurora", "Gina", "Archie", "Jules", "Amelia", "Maude", "Jermaine" ], "edges": [ [ 0, 5 ], [ 0, 2 ], [ 2, 4 ], [ 2, 8 ], [ 6, 1 ], [ 7, 6 ], [ 8, 9 ], [ 9, 3 ], [ 9, 7 ], [ 10, 15 ], [ 10, 12 ], [ 12, 14 ], [ 12, 18 ], [ 16, 11 ], [ 17, 16 ], [ 18, 19 ], [ 19, 13 ], [ 19, 17 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Jerry knows Greg. Marie knows Erwin. Jennifer knows Byron. Daria knows Jerry. Julius knows Leland. Helen knows Enrique. Luella knows Helen. Lucy knows Beth. Jennifer knows Julius. Lucy knows Darla. Greg knows Elizabeth. Elizabeth knows Lamar. Darla knows Luella. Daria knows Bernice. Reed knows Knox. Erwin knows Reed. Helen knows Marie. Leland knows Daria. Which of Daria and Helen can Lucy reach?", "answer": "Helen", "steps": [ "Lucy knows Darla.", "Darla knows Luella.", "Luella knows Helen." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Lucy", "Reed", "Marie", "Luella", "Enrique", "Helen", "Knox", "Darla", "Erwin", "Beth", "Jennifer", "Elizabeth", "Jerry", "Leland", "Bernice", "Daria", "Lamar", "Julius", "Greg", "Byron" ], "edges": [ [ 0, 7 ], [ 0, 9 ], [ 1, 6 ], [ 2, 8 ], [ 3, 5 ], [ 5, 4 ], [ 5, 2 ], [ 7, 3 ], [ 8, 1 ], [ 10, 17 ], [ 10, 19 ], [ 11, 16 ], [ 12, 18 ], [ 13, 15 ], [ 15, 14 ], [ 15, 12 ], [ 17, 13 ], [ 18, 11 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Gage knows Bart. Boyd knows Bernice. Simon knows Pedro. Jordan knows Beau. Leopold knows Darrell. Erwin knows Nathan. Bernice knows Gonzalo. Bernice knows Bonnie. Frankie knows Boyd. Francesca knows Jermaine. Bart knows Erwin. Leopold knows Gage. Bart knows Damien. Bernice knows Hattie. Beau knows Leopold. Leopold knows Kay. Francesca knows Simon. Hattie knows Francesca. Which of Hattie and Gage can Frankie reach?", "answer": "Hattie", "steps": [ "Frankie knows Boyd.", "Boyd knows Bernice.", "Bernice knows Hattie." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Frankie", "Jermaine", "Pedro", "Hattie", "Boyd", "Simon", "Francesca", "Bernice", "Bonnie", "Gonzalo", "Jordan", "Damien", "Nathan", "Gage", "Beau", "Erwin", "Bart", "Leopold", "Kay", "Darrell" ], "edges": [ [ 0, 4 ], [ 3, 6 ], [ 4, 7 ], [ 5, 2 ], [ 6, 1 ], [ 6, 5 ], [ 7, 3 ], [ 7, 8 ], [ 7, 9 ], [ 10, 14 ], [ 13, 16 ], [ 14, 17 ], [ 15, 12 ], [ 16, 11 ], [ 16, 15 ], [ 17, 13 ], [ 17, 18 ], [ 17, 19 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Maureen knows Hattie. Isadora knows Daphne. Daphne knows Jordan. Dalton knows Jennifer. Mara knows Isla. Isla knows Isadora. Maureen knows Dirk. Dirk knows Brooks. Jordan knows Otto. Kane knows Jay. Carla knows Penny. Jennifer knows Ford. Brody knows Lucille. Jay knows Eden. Jay knows Carla. Jordan knows Maureen. Ford knows Kane. Carla knows Brody. Which of Maureen and Carla can Mara reach?", "answer": "Maureen", "steps": [ "Mara knows Isla.", "Isla knows Isadora.", "Isadora knows Daphne.", "Daphne knows Jordan.", "Jordan knows Maureen." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Mara", "Brooks", "Daphne", "Hattie", "Isla", "Maureen", "Dirk", "Otto", "Isadora", "Jordan", "Dalton", "Lucille", "Kane", "Penny", "Jennifer", "Carla", "Brody", "Eden", "Ford", "Jay" ], "edges": [ [ 0, 4 ], [ 2, 9 ], [ 4, 8 ], [ 5, 3 ], [ 5, 6 ], [ 6, 1 ], [ 8, 2 ], [ 9, 5 ], [ 9, 7 ], [ 10, 14 ], [ 12, 19 ], [ 14, 18 ], [ 15, 13 ], [ 15, 16 ], [ 16, 11 ], [ 18, 12 ], [ 19, 15 ], [ 19, 17 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Harry knows Joaquin. Boris knows Eric. Lois knows Dina. Eric knows Winifred. Hattie knows Milo. Roger knows Lark. Luna knows Boris. Lark knows Keaton. Keaton knows Zelda. Joaquin knows Vance. Milo knows Julian. Luna knows Fleur. Lois knows Roger. Luna knows Ruth. Zelda knows Hattie. Lois knows Dallas. Elaine knows Harry. Winifred knows Elaine. Which of Milo and Joaquin can Luna reach?", "answer": "Joaquin", "steps": [ "Luna knows Boris.", "Boris knows Eric.", "Eric knows Winifred.", "Winifred knows Elaine.", "Elaine knows Harry.", "Harry knows Joaquin." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Luna", "Vance", "Winifred", "Fleur", "Boris", "Joaquin", "Eric", "Elaine", "Ruth", "Harry", "Lois", "Julian", "Keaton", "Dallas", "Roger", "Milo", "Lark", "Zelda", "Dina", "Hattie" ], "edges": [ [ 0, 3 ], [ 0, 8 ], [ 0, 4 ], [ 2, 7 ], [ 4, 6 ], [ 5, 1 ], [ 6, 2 ], [ 7, 9 ], [ 9, 5 ], [ 10, 13 ], [ 10, 18 ], [ 10, 14 ], [ 12, 17 ], [ 14, 16 ], [ 15, 11 ], [ 16, 12 ], [ 17, 19 ], [ 19, 15 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Fern knows Darla. Greta knows Virgil. Ann knows Leroy. Keaton knows Barry. Greta knows Ann. Ann knows Eamon. Leroy knows Jose. Eli knows Kate. Edison knows Harper. Lars knows Fern. Harper knows Roland. Kate knows Edison. Ann knows Justin. Keaton knows Eli. Eli knows Daphne. Justin knows Lars. Daphne knows Taylor. Eli knows Reed. Which of Edison and Lars can Greta reach?", "answer": "Lars", "steps": [ "Greta knows Ann.", "Ann knows Justin.", "Justin knows Lars." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Greta", "Lars", "Ann", "Virgil", "Jose", "Eamon", "Leroy", "Justin", "Fern", "Darla", "Keaton", "Edison", "Eli", "Barry", "Taylor", "Reed", "Daphne", "Kate", "Harper", "Roland" ], "edges": [ [ 0, 3 ], [ 0, 2 ], [ 1, 8 ], [ 2, 5 ], [ 2, 6 ], [ 2, 7 ], [ 6, 4 ], [ 7, 1 ], [ 8, 9 ], [ 10, 13 ], [ 10, 12 ], [ 11, 18 ], [ 12, 15 ], [ 12, 16 ], [ 12, 17 ], [ 16, 14 ], [ 17, 11 ], [ 18, 19 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Clarissa knows Carol. Roger knows Tyler. Anita knows Demetrius. Aspen knows Vera. Roger knows Ira. Ron knows Destiny. Cooper knows Camden. Vera knows Carla. Tyler knows Aspen. Clarissa knows Khashayar. Carla knows Gail. Zara knows Anita. Zara knows Ron. Demetrius knows Devon. Khashayar knows Zara. Devon knows Lyric. Aspen knows Cooper. Gail knows Patrick. Which of Devon and Gail can Roger reach?", "answer": "Gail", "steps": [ "Roger knows Tyler.", "Tyler knows Aspen.", "Aspen knows Vera.", "Vera knows Carla.", "Carla knows Gail." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Roger", "Gail", "Camden", "Ira", "Aspen", "Patrick", "Cooper", "Carla", "Tyler", "Vera", "Clarissa", "Devon", "Destiny", "Carol", "Zara", "Lyric", "Ron", "Demetrius", "Khashayar", "Anita" ], "edges": [ [ 0, 3 ], [ 0, 8 ], [ 1, 5 ], [ 4, 6 ], [ 4, 9 ], [ 6, 2 ], [ 7, 1 ], [ 8, 4 ], [ 9, 7 ], [ 10, 13 ], [ 10, 18 ], [ 11, 15 ], [ 14, 16 ], [ 14, 19 ], [ 16, 12 ], [ 17, 11 ], [ 18, 14 ], [ 19, 17 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Jenny knows Boris. Kenneth knows Garrison. Candice knows Kenneth. Sheryl knows Philip. Gerald knows Sheryl. Hayes knows Lawson. Candice knows Aiden. Sheryl knows Joy. Maria knows Nathan. Boris knows Maria. Logan knows Hayes. Philip knows Candice. Jenny knows Xander. Maria knows Logan. Alana knows Justine. Alana knows Jenny. Garrison knows Craig. Gerald knows Sean. Which of Logan and Kenneth can Gerald reach?", "answer": "Kenneth", "steps": [ "Gerald knows Sheryl.", "Sheryl knows Philip.", "Philip knows Candice.", "Candice knows Kenneth." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Gerald", "Kenneth", "Sean", "Craig", "Aiden", "Garrison", "Philip", "Sheryl", "Candice", "Joy", "Alana", "Logan", "Justine", "Lawson", "Nathan", "Hayes", "Boris", "Jenny", "Maria", "Xander" ], "edges": [ [ 0, 2 ], [ 0, 7 ], [ 1, 5 ], [ 5, 3 ], [ 6, 8 ], [ 7, 6 ], [ 7, 9 ], [ 8, 4 ], [ 8, 1 ], [ 10, 12 ], [ 10, 17 ], [ 11, 15 ], [ 15, 13 ], [ 16, 18 ], [ 17, 16 ], [ 17, 19 ], [ 18, 14 ], [ 18, 11 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Luis knows Michael. Jim knows Lynn. Winston knows Alana. Stella knows Winston. George knows Eve. Michael knows Nell. Andrea knows Carey. Lenora knows Paul. Eve knows Carol. Luis knows Harlan. Michael knows Stella. Alan knows Fraser. Eden knows Jim. Alan knows George. Alana knows Eden. Andrea knows Alan. Magdalena knows Lenora. Carol knows Magdalena. Which of George and Stella can Luis reach?", "answer": "Stella", "steps": [ "Luis knows Michael.", "Michael knows Stella." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Luis", "Winston", "Stella", "Eden", "Harlan", "Lynn", "Jim", "Alana", "Michael", "Nell", "Andrea", "Eve", "George", "Magdalena", "Carey", "Paul", "Lenora", "Carol", "Alan", "Fraser" ], "edges": [ [ 0, 4 ], [ 0, 8 ], [ 1, 7 ], [ 2, 1 ], [ 3, 6 ], [ 6, 5 ], [ 7, 3 ], [ 8, 2 ], [ 8, 9 ], [ 10, 14 ], [ 10, 18 ], [ 11, 17 ], [ 12, 11 ], [ 13, 16 ], [ 16, 15 ], [ 17, 13 ], [ 18, 12 ], [ 18, 19 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Vivian knows Natalie. Veronica knows Mitchell. Katrina knows Zack. Dalton knows Miranda. Zoe knows Inez. Mitchell knows Jewel. Fred knows Patrick. Vivian knows Katrina. Zack knows Harmony. Shelly knows Vivian. Jessica knows Zoe. Mitchell knows Robin. Jessica knows Bernard. Inez knows Fred. Miranda knows Shelly. Fred knows Veronica. Zack knows Clarence. Dalton knows Dora. Which of Fred and Vivian can Dalton reach?", "answer": "Vivian", "steps": [ "Dalton knows Miranda.", "Miranda knows Shelly.", "Shelly knows Vivian." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Dalton", "Katrina", "Miranda", "Clarence", "Dora", "Zack", "Harmony", "Vivian", "Shelly", "Natalie", "Jessica", "Veronica", "Zoe", "Jewel", "Bernard", "Mitchell", "Robin", "Fred", "Inez", "Patrick" ], "edges": [ [ 0, 4 ], [ 0, 2 ], [ 1, 5 ], [ 2, 8 ], [ 5, 3 ], [ 5, 6 ], [ 7, 1 ], [ 7, 9 ], [ 8, 7 ], [ 10, 14 ], [ 10, 12 ], [ 11, 15 ], [ 12, 18 ], [ 15, 13 ], [ 15, 16 ], [ 17, 11 ], [ 17, 19 ], [ 18, 17 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Emmett knows Esperanza. Nadine knows Chase. Cameron knows Sidney. Isiah knows Gene. Emmett knows Nicole. Nadine knows Brad. Declan knows Nadine. Albert knows Isiah. Albert knows Darius. Brad knows Zane. Emmett knows Eileen. Declan knows Cameron. Brad knows Colette. Brad knows Karl. Nicole knows Pablo. Darius knows Emmett. Colette knows Derrick. Darius knows Grant. Which of Darius and Nadine can Declan reach?", "answer": "Nadine", "steps": [ "Declan knows Nadine." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Declan", "Brad", "Karl", "Cameron", "Derrick", "Zane", "Colette", "Nadine", "Chase", "Sidney", "Albert", "Emmett", "Esperanza", "Isiah", "Pablo", "Eileen", "Nicole", "Darius", "Grant", "Gene" ], "edges": [ [ 0, 7 ], [ 0, 3 ], [ 1, 2 ], [ 1, 5 ], [ 1, 6 ], [ 3, 9 ], [ 6, 4 ], [ 7, 1 ], [ 7, 8 ], [ 10, 17 ], [ 10, 13 ], [ 11, 12 ], [ 11, 15 ], [ 11, 16 ], [ 13, 19 ], [ 16, 14 ], [ 17, 11 ], [ 17, 18 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Yvette knows Glen. Glen knows Jacques. Elena knows Gladys. Jacques knows Edgar. Brittany knows Heather. Ruth knows Yvette. Elena knows Zoe. Helen knows Kennedy. Helen knows Joshua. Alice knows Merle. Wilma knows Cate. Victoria knows Elena. Ruth knows Darius. Elena knows Brittany. Zoe knows Leo. Jacques knows Alice. Jacques knows Wilma. Joshua knows Victoria. Which of Yvette and Joshua can Helen reach?", "answer": "Joshua", "steps": [ "Helen knows Joshua." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Helen", "Elena", "Gladys", "Victoria", "Kennedy", "Leo", "Heather", "Joshua", "Zoe", "Brittany", "Ruth", "Jacques", "Edgar", "Glen", "Darius", "Merle", "Cate", "Yvette", "Alice", "Wilma" ], "edges": [ [ 0, 4 ], [ 0, 7 ], [ 1, 2 ], [ 1, 8 ], [ 1, 9 ], [ 3, 1 ], [ 7, 3 ], [ 8, 5 ], [ 9, 6 ], [ 10, 14 ], [ 10, 17 ], [ 11, 12 ], [ 11, 18 ], [ 11, 19 ], [ 13, 11 ], [ 17, 13 ], [ 18, 15 ], [ 19, 16 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Fisher knows Val. Bernice knows Yasmin. Jared knows Keith. Terry knows Ford. Kaleb knows Fisher. Rebecca knows Elvira. Maya knows Natalie. Maya knows Javier. Elvira knows Celeste. Javier knows Kaleb. Celeste knows Bernice. Ford knows Jared. Val knows Latoya. Celeste knows Allan. Julia knows Blaine. Javier knows Everett. Blaine knows Maya. Bernice knows Terry. Which of Val and Jared can Julia reach?", "answer": "Val", "steps": [ "Julia knows Blaine.", "Blaine knows Maya.", "Maya knows Javier.", "Javier knows Kaleb.", "Kaleb knows Fisher.", "Fisher knows Val." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Julia", "Latoya", "Fisher", "Javier", "Natalie", "Everett", "Blaine", "Val", "Maya", "Kaleb", "Rebecca", "Keith", "Ford", "Bernice", "Allan", "Yasmin", "Elvira", "Jared", "Celeste", "Terry" ], "edges": [ [ 0, 6 ], [ 2, 7 ], [ 3, 5 ], [ 3, 9 ], [ 6, 8 ], [ 7, 1 ], [ 8, 4 ], [ 8, 3 ], [ 9, 2 ], [ 10, 16 ], [ 12, 17 ], [ 13, 15 ], [ 13, 19 ], [ 16, 18 ], [ 17, 11 ], [ 18, 14 ], [ 18, 13 ], [ 19, 12 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Owen knows Sylvia. Shannon knows Adele. Ramona knows Jewel. Ramona knows Jim. Louisa knows Karla. Shannon knows Vanessa. Karla knows Neville. Matt knows Ebony. Ebony knows Imogen. Dana knows Owen. Karla knows Martin. Hudson knows Dewey. Louisa knows Karina. Dana knows Ann. Jim knows Dana. Ebony knows Louisa. Owen knows Shannon. Hudson knows Matt. Which of Neville and Vanessa can Ramona reach?", "answer": "Vanessa", "steps": [ "Ramona knows Jim.", "Jim knows Dana.", "Dana knows Owen.", "Owen knows Shannon.", "Shannon knows Vanessa." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Ramona", "Vanessa", "Owen", "Shannon", "Jim", "Dana", "Adele", "Ann", "Sylvia", "Jewel", "Hudson", "Neville", "Louisa", "Karla", "Matt", "Ebony", "Martin", "Imogen", "Karina", "Dewey" ], "edges": [ [ 0, 4 ], [ 0, 9 ], [ 2, 3 ], [ 2, 8 ], [ 3, 1 ], [ 3, 6 ], [ 4, 5 ], [ 5, 7 ], [ 5, 2 ], [ 10, 14 ], [ 10, 19 ], [ 12, 13 ], [ 12, 18 ], [ 13, 11 ], [ 13, 16 ], [ 14, 15 ], [ 15, 17 ], [ 15, 12 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Justine knows Karen. Justine knows Imogen. Ezra knows Dante. Karen knows Odette. Dave knows Ezra. Justine knows Gemma. Whitney knows Lois. Daniel knows Justine. Karen knows Dave. Ricardo knows Courtney. Courtney knows Gerard. Whitney knows Opal. Opal knows Tanya. Camden knows Ricardo. Whitney knows Camden. Gemma knows Leland. Camden knows Travis. Natalie knows Whitney. Which of Dave and Ricardo can Daniel reach?", "answer": "Dave", "steps": [ "Daniel knows Justine.", "Justine knows Karen.", "Karen knows Dave." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Daniel", "Dante", "Imogen", "Ezra", "Leland", "Karen", "Justine", "Odette", "Gemma", "Dave", "Natalie", "Gerard", "Lois", "Courtney", "Tanya", "Camden", "Whitney", "Travis", "Opal", "Ricardo" ], "edges": [ [ 0, 6 ], [ 3, 1 ], [ 5, 7 ], [ 5, 9 ], [ 6, 2 ], [ 6, 8 ], [ 6, 5 ], [ 8, 4 ], [ 9, 3 ], [ 10, 16 ], [ 13, 11 ], [ 15, 17 ], [ 15, 19 ], [ 16, 12 ], [ 16, 18 ], [ 16, 15 ], [ 18, 14 ], [ 19, 13 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Gertrude knows Jem. Ada knows David. Devon knows Horace. Luz knows Harris. Horace knows Ainsley. Lawrence knows Lambert. Dolores knows Elvira. Ainsley knows Mason. Jem knows Luz. David knows Audrey. Colleen knows Ken. Audrey knows Lawrence. Elvira knows Colleen. David knows Devon. Gertrude knows Dolores. Harris knows Dee. Dwight knows Gertrude. Lambert knows Ernie. Which of Mason and Ken can Dwight reach?", "answer": "Ken", "steps": [ "Dwight knows Gertrude.", "Gertrude knows Dolores.", "Dolores knows Elvira.", "Elvira knows Colleen.", "Colleen knows Ken." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Dwight", "Jem", "Dolores", "Luz", "Harris", "Dee", "Gertrude", "Ken", "Elvira", "Colleen", "Ada", "Audrey", "Devon", "Lawrence", "Lambert", "Ernie", "David", "Mason", "Horace", "Ainsley" ], "edges": [ [ 0, 6 ], [ 1, 3 ], [ 2, 8 ], [ 3, 4 ], [ 4, 5 ], [ 6, 1 ], [ 6, 2 ], [ 8, 9 ], [ 9, 7 ], [ 10, 16 ], [ 11, 13 ], [ 12, 18 ], [ 13, 14 ], [ 14, 15 ], [ 16, 11 ], [ 16, 12 ], [ 18, 19 ], [ 19, 17 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Yvette knows Glen. Glen knows Jacques. Elena knows Gladys. Jacques knows Edgar. Brittany knows Heather. Ruth knows Yvette. Elena knows Zoe. Helen knows Kennedy. Helen knows Joshua. Alice knows Merle. Wilma knows Cate. Victoria knows Elena. Ruth knows Darius. Elena knows Brittany. Zoe knows Leo. Jacques knows Alice. Jacques knows Wilma. Joshua knows Victoria. Which of Elena and Jacques can Helen reach?", "answer": "Elena", "steps": [ "Helen knows Joshua.", "Joshua knows Victoria.", "Victoria knows Elena." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Helen", "Elena", "Gladys", "Victoria", "Kennedy", "Leo", "Heather", "Joshua", "Zoe", "Brittany", "Ruth", "Jacques", "Edgar", "Glen", "Darius", "Merle", "Cate", "Yvette", "Alice", "Wilma" ], "edges": [ [ 0, 4 ], [ 0, 7 ], [ 1, 2 ], [ 1, 8 ], [ 1, 9 ], [ 3, 1 ], [ 7, 3 ], [ 8, 5 ], [ 9, 6 ], [ 10, 14 ], [ 10, 17 ], [ 11, 12 ], [ 11, 18 ], [ 11, 19 ], [ 13, 11 ], [ 17, 13 ], [ 18, 15 ], [ 19, 16 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Keegan knows Archer. Magdalena knows Mike. Lisette knows Lily. Derrick knows Foster. Jasmine knows Adele. Gabriel knows Kimberly. Gabriel knows Darrell. Naomi knows Khashayar. Gabriel knows Hal. Lily knows Naomi. Lily knows Keegan. Derrick knows Hendrix. Lily knows Matthew. Kimberly knows Gage. Jasmine knows Lisette. Hendrix knows Gabriel. Archer knows Teresa. Darrell knows Magdalena. Which of Hendrix and Lisette can Jasmine reach?", "answer": "Lisette", "steps": [ "Jasmine knows Lisette." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Jasmine", "Matthew", "Keegan", "Khashayar", "Lisette", "Teresa", "Naomi", "Archer", "Adele", "Lily", "Derrick", "Hal", "Darrell", "Gage", "Hendrix", "Mike", "Kimberly", "Magdalena", "Foster", "Gabriel" ], "edges": [ [ 0, 8 ], [ 0, 4 ], [ 2, 7 ], [ 4, 9 ], [ 6, 3 ], [ 7, 5 ], [ 9, 1 ], [ 9, 6 ], [ 9, 2 ], [ 10, 18 ], [ 10, 14 ], [ 12, 17 ], [ 14, 19 ], [ 16, 13 ], [ 17, 15 ], [ 19, 11 ], [ 19, 16 ], [ 19, 12 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Belinda knows Langston. Isla knows Megan. Gemma knows Kingsley. Kate knows Graeme. Eugene knows Griffith. Kate knows Max. Graham knows Kate. Laura knows Devon. Griffith knows Belinda. Belinda knows Tina. Kate knows Celeste. Belinda knows Frank. Megan knows Dick. Gemma knows Isla. Julian knows Parker. Kingsley knows Graham. Parker knows Laura. Julian knows Eugene. Which of Graham and Griffith can Julian reach?", "answer": "Griffith", "steps": [ "Julian knows Eugene.", "Eugene knows Griffith." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Julian", "Parker", "Laura", "Langston", "Devon", "Frank", "Belinda", "Griffith", "Tina", "Eugene", "Gemma", "Isla", "Megan", "Celeste", "Dick", "Graeme", "Kate", "Graham", "Max", "Kingsley" ], "edges": [ [ 0, 1 ], [ 0, 9 ], [ 1, 2 ], [ 2, 4 ], [ 6, 3 ], [ 6, 5 ], [ 6, 8 ], [ 7, 6 ], [ 9, 7 ], [ 10, 11 ], [ 10, 19 ], [ 11, 12 ], [ 12, 14 ], [ 16, 13 ], [ 16, 15 ], [ 16, 18 ], [ 17, 16 ], [ 19, 17 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Zachary knows Ella. Darnell knows Zachary. Ella knows Jasper. Merle knows Melody. Parker knows Matthew. Kathleen knows Fletcher. Kathleen knows Kane. Ella knows Israel. Matthew knows Aspen. Kathleen knows Marilyn. Aspen knows Kathleen. Melody knows Darnell. Lara knows Ryan. Ryan knows Daniella. Dalton knows Merle. Merle knows Lydia. Ryan knows Parker. Ella knows Valerie. Which of Marilyn and Jasper can Dalton reach?", "answer": "Jasper", "steps": [ "Dalton knows Merle.", "Merle knows Melody.", "Melody knows Darnell.", "Darnell knows Zachary.", "Zachary knows Ella.", "Ella knows Jasper." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Dalton", "Jasper", "Ella", "Valerie", "Melody", "Israel", "Darnell", "Lydia", "Zachary", "Merle", "Lara", "Marilyn", "Kathleen", "Kane", "Parker", "Fletcher", "Matthew", "Daniella", "Aspen", "Ryan" ], "edges": [ [ 0, 9 ], [ 2, 1 ], [ 2, 3 ], [ 2, 5 ], [ 4, 6 ], [ 6, 8 ], [ 8, 2 ], [ 9, 7 ], [ 9, 4 ], [ 10, 19 ], [ 12, 11 ], [ 12, 13 ], [ 12, 15 ], [ 14, 16 ], [ 16, 18 ], [ 18, 12 ], [ 19, 17 ], [ 19, 14 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Luz knows Lorraine. Lorraine knows Ezra. Virginia knows Hunter. Neil knows Kurt. Corey knows Neil. Hunter knows Douglas. Sonia knows Chelsea. Lorraine knows Aurora. Neil knows Brock. Aurora knows Alyssa. Brock knows Sonia. Daisy knows Eduardo. Caroline knows Emma. Eduardo knows Ainsley. Aurora knows Caroline. Corey knows Daisy. Luz knows Virginia. Brock knows Isla. Which of Chelsea and Emma can Corey reach?", "answer": "Chelsea", "steps": [ "Corey knows Neil.", "Neil knows Brock.", "Brock knows Sonia.", "Sonia knows Chelsea." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Corey", "Brock", "Neil", "Sonia", "Kurt", "Daisy", "Eduardo", "Chelsea", "Isla", "Ainsley", "Luz", "Aurora", "Lorraine", "Caroline", "Ezra", "Virginia", "Hunter", "Emma", "Alyssa", "Douglas" ], "edges": [ [ 0, 2 ], [ 0, 5 ], [ 1, 3 ], [ 1, 8 ], [ 2, 4 ], [ 2, 1 ], [ 3, 7 ], [ 5, 6 ], [ 6, 9 ], [ 10, 12 ], [ 10, 15 ], [ 11, 13 ], [ 11, 18 ], [ 12, 14 ], [ 12, 11 ], [ 13, 17 ], [ 15, 16 ], [ 16, 19 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Mark knows Etta. Hannah knows Garland. Jacqueline knows Kenzie. Myrtle knows Alex. Alex knows Aria. Julian knows Marcus. Nicholas knows Ramon. Garland knows Mark. Erik knows Hannah. Ramon knows Wanda. Alex knows Jacqueline. Jana knows Floyd. Marcus knows Myrtle. Mark knows Jana. Mike knows Giselle. Giselle knows Roman. Wanda knows Julian. Roman knows Erik. Which of Kenzie and Floyd can Mike reach?", "answer": "Floyd", "steps": [ "Mike knows Giselle.", "Giselle knows Roman.", "Roman knows Erik.", "Erik knows Hannah.", "Hannah knows Garland.", "Garland knows Mark.", "Mark knows Jana.", "Jana knows Floyd." ], "difficulty": 8, "original_distance": 8, "idx_to_symbol": [ "Mike", "Etta", "Jana", "Mark", "Floyd", "Hannah", "Erik", "Giselle", "Garland", "Roman", "Nicholas", "Aria", "Jacqueline", "Alex", "Kenzie", "Marcus", "Julian", "Ramon", "Myrtle", "Wanda" ], "edges": [ [ 0, 7 ], [ 2, 4 ], [ 3, 1 ], [ 3, 2 ], [ 5, 8 ], [ 6, 5 ], [ 7, 9 ], [ 8, 3 ], [ 9, 6 ], [ 10, 17 ], [ 12, 14 ], [ 13, 11 ], [ 13, 12 ], [ 15, 18 ], [ 16, 15 ], [ 17, 19 ], [ 18, 13 ], [ 19, 16 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Fred knows Erwin. Irma knows Avery. Verna knows Thomas. Fred knows Verna. Steve knows Bruce. Jonathan knows Steve. Leticia knows Declan. Violet knows Inez. Steve knows Ella. Bruce knows Lloyd. Viola knows Wendy. Fanny knows Jonathan. Verna knows Viola. Preston knows Don. Steve knows Leticia. Bruce knows Violet. Fred knows Irma. Don knows Fred. Which of Inez and Wendy can Preston reach?", "answer": "Wendy", "steps": [ "Preston knows Don.", "Don knows Fred.", "Fred knows Verna.", "Verna knows Viola.", "Viola knows Wendy." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Preston", "Erwin", "Avery", "Don", "Verna", "Fred", "Viola", "Wendy", "Irma", "Thomas", "Fanny", "Ella", "Declan", "Jonathan", "Bruce", "Steve", "Violet", "Inez", "Leticia", "Lloyd" ], "edges": [ [ 0, 3 ], [ 3, 5 ], [ 4, 6 ], [ 4, 9 ], [ 5, 1 ], [ 5, 8 ], [ 5, 4 ], [ 6, 7 ], [ 8, 2 ], [ 10, 13 ], [ 13, 15 ], [ 14, 16 ], [ 14, 19 ], [ 15, 11 ], [ 15, 18 ], [ 15, 14 ], [ 16, 17 ], [ 18, 12 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Heath knows Aaron. Kristin knows Arden. Pablo knows Beau. Sierra knows Gonzalo. Bailey knows Gilbert. Gilbert knows Judy. Gonzalo knows Heath. Beau knows Bailey. Jessie knows Kristin. Melody knows Peggy. Peggy knows Lois. Beau knows Ernesto. Kristin knows Cornelius. Aaron knows Declan. Sierra knows Stella. Gilbert knows Cara. Cara knows Melody. Arden knows Sierra. Which of Lois and Declan can Jessie reach?", "answer": "Declan", "steps": [ "Jessie knows Kristin.", "Kristin knows Arden.", "Arden knows Sierra.", "Sierra knows Gonzalo.", "Gonzalo knows Heath.", "Heath knows Aaron.", "Aaron knows Declan." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Jessie", "Cornelius", "Aaron", "Heath", "Gonzalo", "Stella", "Arden", "Kristin", "Sierra", "Declan", "Pablo", "Ernesto", "Peggy", "Melody", "Cara", "Judy", "Bailey", "Beau", "Gilbert", "Lois" ], "edges": [ [ 0, 7 ], [ 2, 9 ], [ 3, 2 ], [ 4, 3 ], [ 6, 8 ], [ 7, 1 ], [ 7, 6 ], [ 8, 5 ], [ 8, 4 ], [ 10, 17 ], [ 12, 19 ], [ 13, 12 ], [ 14, 13 ], [ 16, 18 ], [ 17, 11 ], [ 17, 16 ], [ 18, 15 ], [ 18, 14 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "August knows Josie. Zara knows Arthur. Carson knows Saul. Cristina knows August. Karl knows Lorna. Annie knows Troy. Hubert knows Sadie. Ebony knows Aspen. Todd knows Hubert. Arthur knows Malik. Malik knows Ebony. Aspen knows Karl. Chandler knows Todd. Courtney knows Annie. Aspen knows Cristina. Todd knows Carson. Saul knows George. Troy knows Chandler. Which of Aspen and Todd can Zara reach?", "answer": "Aspen", "steps": [ "Zara knows Arthur.", "Arthur knows Malik.", "Malik knows Ebony.", "Ebony knows Aspen." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Zara", "Malik", "Josie", "Arthur", "Cristina", "Karl", "Ebony", "Lorna", "August", "Aspen", "Courtney", "Troy", "George", "Annie", "Carson", "Hubert", "Chandler", "Sadie", "Saul", "Todd" ], "edges": [ [ 0, 3 ], [ 1, 6 ], [ 3, 1 ], [ 4, 8 ], [ 5, 7 ], [ 6, 9 ], [ 8, 2 ], [ 9, 5 ], [ 9, 4 ], [ 10, 13 ], [ 11, 16 ], [ 13, 11 ], [ 14, 18 ], [ 15, 17 ], [ 16, 19 ], [ 18, 12 ], [ 19, 15 ], [ 19, 14 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Leland knows Janice. Langston knows Damian. Langston knows Edmund. Edmund knows Lauren. Andrea knows Todd. Janice knows Lars. Patrick knows Sydney. Cornelius knows Doris. Janice knows Andrea. Cornelius knows Wilbur. Patrick knows Horace. Graeme knows Dana. Doris knows Enid. Sydney knows Leland. Lars knows Marie. Wilbur knows Graeme. Lauren knows Cornelius. Todd knows Hank. Which of Graeme and Todd can Langston reach?", "answer": "Graeme", "steps": [ "Langston knows Edmund.", "Edmund knows Lauren.", "Lauren knows Cornelius.", "Cornelius knows Wilbur.", "Wilbur knows Graeme." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Langston", "Enid", "Dana", "Damian", "Doris", "Wilbur", "Cornelius", "Graeme", "Lauren", "Edmund", "Patrick", "Marie", "Hank", "Horace", "Lars", "Andrea", "Janice", "Todd", "Leland", "Sydney" ], "edges": [ [ 0, 3 ], [ 0, 9 ], [ 4, 1 ], [ 5, 7 ], [ 6, 4 ], [ 6, 5 ], [ 7, 2 ], [ 8, 6 ], [ 9, 8 ], [ 10, 13 ], [ 10, 19 ], [ 14, 11 ], [ 15, 17 ], [ 16, 14 ], [ 16, 15 ], [ 17, 12 ], [ 18, 16 ], [ 19, 18 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Estella knows Israel. Percy knows Cornelius. Rocco knows Ralph. Sam knows Cooper. Estella knows Percy. Graham knows Basil. Cooper knows Graham. Herman knows Clark. Dalton knows Herman. Cornelius knows Ursula. Basil knows Camille. Sam knows Rocco. Herman knows Don. Dalton knows Estella. Cooper knows Monica. Darin knows Sam. Rocco knows Adelaide. Bonnie knows Dalton. Which of Ursula and Camille can Bonnie reach?", "answer": "Ursula", "steps": [ "Bonnie knows Dalton.", "Dalton knows Estella.", "Estella knows Percy.", "Percy knows Cornelius.", "Cornelius knows Ursula." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Bonnie", "Don", "Cornelius", "Ursula", "Dalton", "Herman", "Percy", "Estella", "Clark", "Israel", "Darin", "Ralph", "Basil", "Camille", "Sam", "Rocco", "Graham", "Cooper", "Adelaide", "Monica" ], "edges": [ [ 0, 4 ], [ 2, 3 ], [ 4, 5 ], [ 4, 7 ], [ 5, 1 ], [ 5, 8 ], [ 6, 2 ], [ 7, 6 ], [ 7, 9 ], [ 10, 14 ], [ 12, 13 ], [ 14, 15 ], [ 14, 17 ], [ 15, 11 ], [ 15, 18 ], [ 16, 12 ], [ 17, 16 ], [ 17, 19 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Xavier knows Ben. Lorna knows Sandra. Patricia knows Carlos. Yuki knows Patricia. Maude knows Allan. Tyler knows Xavier. Lamont knows Kai. Hannah knows Laverne. Xavier knows Lamont. Patricia knows Wade. Xavier knows Lorna. Rick knows Tyler. Laverne knows Rick. Sadie knows Maude. Wade knows Hector. Patricia knows Skyler. Skyler knows Arden. Allan knows Yuki. Which of Maude and Laverne can Sadie reach?", "answer": "Maude", "steps": [ "Sadie knows Maude." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Sadie", "Hector", "Yuki", "Patricia", "Allan", "Carlos", "Maude", "Arden", "Skyler", "Wade", "Hannah", "Kai", "Tyler", "Xavier", "Rick", "Ben", "Laverne", "Sandra", "Lorna", "Lamont" ], "edges": [ [ 0, 6 ], [ 2, 3 ], [ 3, 5 ], [ 3, 8 ], [ 3, 9 ], [ 4, 2 ], [ 6, 4 ], [ 8, 7 ], [ 9, 1 ], [ 10, 16 ], [ 12, 13 ], [ 13, 15 ], [ 13, 18 ], [ 13, 19 ], [ 14, 12 ], [ 16, 14 ], [ 18, 17 ], [ 19, 11 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Hayden knows Henry. Otto knows Milo. Brett knows Shaun. Otto knows Gloria. Gloria knows Erwin. Hayden knows Grace. Milo knows Bruce. Otto knows Clay. Shaun knows Clinton. Valerie knows Louise. Fred knows Basil. Grace knows Hal. Shaun knows Hayden. Hal knows Brenda. Basil knows Otto. Basil knows Flora. Bruce knows Conner. Hayden knows Valerie. Which of Milo and Grace can Fred reach?", "answer": "Milo", "steps": [ "Fred knows Basil.", "Basil knows Otto.", "Otto knows Milo." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Fred", "Milo", "Clay", "Gloria", "Bruce", "Flora", "Otto", "Erwin", "Conner", "Basil", "Brett", "Grace", "Henry", "Valerie", "Hal", "Clinton", "Hayden", "Louise", "Brenda", "Shaun" ], "edges": [ [ 0, 9 ], [ 1, 4 ], [ 3, 7 ], [ 4, 8 ], [ 6, 2 ], [ 6, 3 ], [ 6, 1 ], [ 9, 5 ], [ 9, 6 ], [ 10, 19 ], [ 11, 14 ], [ 13, 17 ], [ 14, 18 ], [ 16, 12 ], [ 16, 13 ], [ 16, 11 ], [ 19, 15 ], [ 19, 16 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Freya knows Kennedy. Gerald knows Freya. Sheila knows Lola. Viola knows Callum. Tonya knows Kaleb. Jocelyn knows Gerald. Leon knows Ted. Leon knows Adelaide. Kennedy knows Georgia. Gavin knows Travis. Viola knows Tonya. Tonya knows Jocelyn. Jake knows Sheila. Lola knows Leon. Gavin knows Jake. Adelaide knows Eileen. Freya knows Iris. Jake knows Ruth. Which of Adelaide and Kennedy can Viola reach?", "answer": "Kennedy", "steps": [ "Viola knows Tonya.", "Tonya knows Jocelyn.", "Jocelyn knows Gerald.", "Gerald knows Freya.", "Freya knows Kennedy." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Viola", "Georgia", "Gerald", "Callum", "Freya", "Kaleb", "Kennedy", "Jocelyn", "Iris", "Tonya", "Gavin", "Eileen", "Lola", "Travis", "Leon", "Ruth", "Adelaide", "Sheila", "Ted", "Jake" ], "edges": [ [ 0, 3 ], [ 0, 9 ], [ 2, 4 ], [ 4, 6 ], [ 4, 8 ], [ 6, 1 ], [ 7, 2 ], [ 9, 5 ], [ 9, 7 ], [ 10, 13 ], [ 10, 19 ], [ 12, 14 ], [ 14, 16 ], [ 14, 18 ], [ 16, 11 ], [ 17, 12 ], [ 19, 15 ], [ 19, 17 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Jermaine knows Aurora. Ann knows Gina. Monica knows Ruby. Ann knows Maude. Saul knows Monica. Ruby knows Yolanda. Amelia knows Jules. Eleanor knows Ann. Levi knows Veronica. Eleanor knows Archie. Jules knows Cesar. Jermaine knows Amelia. Yolanda knows Lars. Yolanda knows Kenzie. Lars knows Levi. Monica knows Eugenia. Maude knows Jermaine. Saul knows Lewis. Which of Jermaine and Yolanda can Saul reach?", "answer": "Yolanda", "steps": [ "Saul knows Monica.", "Monica knows Ruby.", "Ruby knows Yolanda." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Saul", "Veronica", "Monica", "Kenzie", "Eugenia", "Lewis", "Levi", "Lars", "Ruby", "Yolanda", "Eleanor", "Cesar", "Ann", "Aurora", "Gina", "Archie", "Jules", "Amelia", "Maude", "Jermaine" ], "edges": [ [ 0, 5 ], [ 0, 2 ], [ 2, 4 ], [ 2, 8 ], [ 6, 1 ], [ 7, 6 ], [ 8, 9 ], [ 9, 3 ], [ 9, 7 ], [ 10, 15 ], [ 10, 12 ], [ 12, 14 ], [ 12, 18 ], [ 16, 11 ], [ 17, 16 ], [ 18, 19 ], [ 19, 13 ], [ 19, 17 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Abel knows Fiona. Rosemary knows Annette. Trevor knows Archie. Geraldine knows Aubrey. Fiona knows Jamie. Archie knows Abel. Ken knows Trevor. Jamie knows Jorge. Thea knows Stefan. Dell knows Valerie. Archie knows Geraldine. Valerie knows Ford. Rosemary knows Porter. Stefan knows Rosemary. Annette knows Bernadette. Bernadette knows Edith. Porter knows Dell. Aubrey knows Fern. Which of Valerie and Jamie can Thea reach?", "answer": "Valerie", "steps": [ "Thea knows Stefan.", "Stefan knows Rosemary.", "Rosemary knows Porter.", "Porter knows Dell.", "Dell knows Valerie." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Thea", "Valerie", "Edith", "Porter", "Bernadette", "Rosemary", "Stefan", "Dell", "Annette", "Ford", "Ken", "Jamie", "Fern", "Abel", "Aubrey", "Archie", "Trevor", "Fiona", "Geraldine", "Jorge" ], "edges": [ [ 0, 6 ], [ 1, 9 ], [ 3, 7 ], [ 4, 2 ], [ 5, 8 ], [ 5, 3 ], [ 6, 5 ], [ 7, 1 ], [ 8, 4 ], [ 10, 16 ], [ 11, 19 ], [ 13, 17 ], [ 14, 12 ], [ 15, 18 ], [ 15, 13 ], [ 16, 15 ], [ 17, 11 ], [ 18, 14 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Hugh knows Daria. Jane knows Mara. Arden knows Opal. Paige knows Sean. Yuki knows Victor. Colin knows Rhonda. Lars knows Leopold. Victor knows Arden. Archer knows Paige. Fanny knows Ramona. Fanny knows Hugh. Sean knows Carl. Leopold knows Maggie. Maggie knows Jane. Opal knows Fanny. Daria knows Colin. Jane knows Archer. Hayes knows Lars. Which of Leopold and Arden can Yuki reach?", "answer": "Arden", "steps": [ "Yuki knows Victor.", "Victor knows Arden." ], "difficulty": 2, "original_distance": 8, "idx_to_symbol": [ "Yuki", "Victor", "Daria", "Colin", "Fanny", "Opal", "Rhonda", "Arden", "Hugh", "Ramona", "Hayes", "Lars", "Paige", "Sean", "Jane", "Maggie", "Carl", "Leopold", "Archer", "Mara" ], "edges": [ [ 0, 1 ], [ 1, 7 ], [ 2, 3 ], [ 3, 6 ], [ 4, 8 ], [ 4, 9 ], [ 5, 4 ], [ 7, 5 ], [ 8, 2 ], [ 10, 11 ], [ 11, 17 ], [ 12, 13 ], [ 13, 16 ], [ 14, 18 ], [ 14, 19 ], [ 15, 14 ], [ 17, 15 ], [ 18, 12 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Chase knows Wilson. Langston knows Alan. Langston knows Victor. Percy knows Marcia. Sadie knows Langston. Agnes knows Percy. Veronica knows Chance. Alan knows Chase. Hayley knows Deanna. Ember knows Freya. Hayley knows Veronica. Rufus knows Ember. Victor knows Agnes. Marcia knows Walt. Deanna knows Rufus. Chance knows Wallace. Henry knows Hayley. Freya knows Ethan. Which of Rufus and Agnes can Henry reach?", "answer": "Rufus", "steps": [ "Henry knows Hayley.", "Hayley knows Deanna.", "Deanna knows Rufus." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Henry", "Rufus", "Freya", "Wallace", "Ethan", "Chance", "Hayley", "Deanna", "Ember", "Veronica", "Sadie", "Agnes", "Marcia", "Wilson", "Walt", "Chase", "Langston", "Victor", "Percy", "Alan" ], "edges": [ [ 0, 6 ], [ 1, 8 ], [ 2, 4 ], [ 5, 3 ], [ 6, 7 ], [ 6, 9 ], [ 7, 1 ], [ 8, 2 ], [ 9, 5 ], [ 10, 16 ], [ 11, 18 ], [ 12, 14 ], [ 15, 13 ], [ 16, 17 ], [ 16, 19 ], [ 17, 11 ], [ 18, 12 ], [ 19, 15 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Miles knows Dee. Jules knows Joshua. Miles knows Ethan. Joshua knows Becky. Erik knows Jules. Ernesto knows Cecilia. Whitney knows Fritz. Nash knows Dewey. Ethan knows Beau. Erik knows Katrina. Beau knows Blair. Nash knows Whitney. Joshua knows Ernesto. Karen knows Elaine. Dee knows Nash. Katrina knows Karen. Beau knows Eduardo. Karen knows Franklin. Which of Whitney and Ernesto can Erik reach?", "answer": "Ernesto", "steps": [ "Erik knows Jules.", "Jules knows Joshua.", "Joshua knows Ernesto." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Erik", "Ernesto", "Katrina", "Elaine", "Joshua", "Karen", "Jules", "Becky", "Franklin", "Cecilia", "Miles", "Whitney", "Ethan", "Blair", "Nash", "Beau", "Dee", "Dewey", "Eduardo", "Fritz" ], "edges": [ [ 0, 2 ], [ 0, 6 ], [ 1, 9 ], [ 2, 5 ], [ 4, 7 ], [ 4, 1 ], [ 5, 3 ], [ 5, 8 ], [ 6, 4 ], [ 10, 12 ], [ 10, 16 ], [ 11, 19 ], [ 12, 15 ], [ 14, 17 ], [ 14, 11 ], [ 15, 13 ], [ 15, 18 ], [ 16, 14 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Emmett knows Darnell. Patrick knows Felicia. Gideon knows Kurt. Emmett knows Tristan. Emmett knows Patrick. Pearl knows Emmett. Davis knows Calvin. Calvin knows Frida. Lorenzo knows Fanny. Calvin knows Sean. Troy knows Davis. Carrie knows Gideon. Carrie knows Samantha. Travis knows Wanda. Lorenzo knows Pearl. Wanda knows Lorenzo. Sean knows Carrie. Carrie knows Benjamin. Which of Davis and Wanda can Travis reach?", "answer": "Wanda", "steps": [ "Travis knows Wanda." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Travis", "Emmett", "Felicia", "Wanda", "Darnell", "Lorenzo", "Pearl", "Patrick", "Fanny", "Tristan", "Troy", "Carrie", "Kurt", "Davis", "Benjamin", "Calvin", "Sean", "Gideon", "Frida", "Samantha" ], "edges": [ [ 0, 3 ], [ 1, 4 ], [ 1, 7 ], [ 1, 9 ], [ 3, 5 ], [ 5, 8 ], [ 5, 6 ], [ 6, 1 ], [ 7, 2 ], [ 10, 13 ], [ 11, 14 ], [ 11, 17 ], [ 11, 19 ], [ 13, 15 ], [ 15, 18 ], [ 15, 16 ], [ 16, 11 ], [ 17, 12 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Ariana knows Rhea. Destiny knows Peggy. Keith knows Gideon. Will knows Lyric. Heath knows Virginia. Ember knows Jerome. Viola knows Heath. Heath knows Will. Destiny knows Margaret. Destiny knows Blair. Blaine knows Ariana. Gideon knows Destiny. Rhea knows Viola. Heath knows Abigail. Jerome knows Keith. Peggy knows Erwin. Peggy knows Tony. Will knows Nicole. Which of Peggy and Will can Ember reach?", "answer": "Peggy", "steps": [ "Ember knows Jerome.", "Jerome knows Keith.", "Keith knows Gideon.", "Gideon knows Destiny.", "Destiny knows Peggy." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Ember", "Erwin", "Tony", "Blair", "Jerome", "Gideon", "Peggy", "Destiny", "Keith", "Margaret", "Blaine", "Nicole", "Lyric", "Abigail", "Ariana", "Viola", "Will", "Heath", "Rhea", "Virginia" ], "edges": [ [ 0, 4 ], [ 4, 8 ], [ 5, 7 ], [ 6, 1 ], [ 6, 2 ], [ 7, 3 ], [ 7, 6 ], [ 7, 9 ], [ 8, 5 ], [ 10, 14 ], [ 14, 18 ], [ 15, 17 ], [ 16, 11 ], [ 16, 12 ], [ 17, 13 ], [ 17, 16 ], [ 17, 19 ], [ 18, 15 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Harold knows Joyce. Miles knows Joaquin. Saul knows Harold. Sonia knows Gregory. Dane knows Coral. Clara knows Eugene. Joaquin knows George. Saul knows Clayton. Joyce knows Howard. Joaquin knows Clara. Eugene knows Serena. Howard knows Arden. Howard knows Charles. Howard knows Federico. Federico knows Dane. Sonia knows Harper. Gregory knows Miles. Joaquin knows Natalie. Which of Joyce and Miles can Saul reach?", "answer": "Joyce", "steps": [ "Saul knows Harold.", "Harold knows Joyce." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Saul", "Howard", "Federico", "Arden", "Coral", "Dane", "Clayton", "Joyce", "Charles", "Harold", "Sonia", "Joaquin", "Clara", "George", "Serena", "Eugene", "Harper", "Miles", "Natalie", "Gregory" ], "edges": [ [ 0, 6 ], [ 0, 9 ], [ 1, 3 ], [ 1, 2 ], [ 1, 8 ], [ 2, 5 ], [ 5, 4 ], [ 7, 1 ], [ 9, 7 ], [ 10, 16 ], [ 10, 19 ], [ 11, 13 ], [ 11, 12 ], [ 11, 18 ], [ 12, 15 ], [ 15, 14 ], [ 17, 11 ], [ 19, 17 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Anastasia knows Amanda. Hailey knows Pauline. Jaime knows Dorian. Brooke knows Hailey. Pauline knows Dave. Dave knows Adele. Carrie knows Geneva. Brooke knows Ernest. Carrie knows Ibrahim. Anastasia knows Hudson. Hudson knows Carrie. Pauline knows Pablo. Lauren knows Anastasia. Dorian knows Lionel. Dorian knows Brooke. Jamie knows Lauren. Ibrahim knows Kirsten. Lauren knows Owen. Which of Hudson and Hailey can Jamie reach?", "answer": "Hudson", "steps": [ "Jamie knows Lauren.", "Lauren knows Anastasia.", "Anastasia knows Hudson." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Jamie", "Amanda", "Lauren", "Geneva", "Carrie", "Anastasia", "Hudson", "Owen", "Kirsten", "Ibrahim", "Jaime", "Ernest", "Dorian", "Pablo", "Pauline", "Brooke", "Hailey", "Lionel", "Adele", "Dave" ], "edges": [ [ 0, 2 ], [ 2, 7 ], [ 2, 5 ], [ 4, 3 ], [ 4, 9 ], [ 5, 1 ], [ 5, 6 ], [ 6, 4 ], [ 9, 8 ], [ 10, 12 ], [ 12, 17 ], [ 12, 15 ], [ 14, 13 ], [ 14, 19 ], [ 15, 11 ], [ 15, 16 ], [ 16, 14 ], [ 19, 18 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Hannah knows Sheila. Chandler knows Enrique. Penny knows Chandler. Chandler knows Eloise. Dina knows Sonia. Wilma knows Jessie. Jessie knows Dina. Dina knows Dominic. Raquel knows Hannah. Penny knows Eduardo. Jessie knows Joseph. Yolanda knows William. Wilma knows Virgil. Thomas knows Raquel. Eduardo knows Merle. William knows Wilma. Hannah knows Penny. Joseph knows Ariana. Which of Raquel and William can Thomas reach?", "answer": "Raquel", "steps": [ "Thomas knows Raquel." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Thomas", "Sheila", "Hannah", "Chandler", "Penny", "Merle", "Enrique", "Raquel", "Eloise", "Eduardo", "Yolanda", "Virgil", "Wilma", "Dina", "Jessie", "Ariana", "Dominic", "William", "Sonia", "Joseph" ], "edges": [ [ 0, 7 ], [ 2, 1 ], [ 2, 4 ], [ 3, 6 ], [ 3, 8 ], [ 4, 3 ], [ 4, 9 ], [ 7, 2 ], [ 9, 5 ], [ 10, 17 ], [ 12, 11 ], [ 12, 14 ], [ 13, 16 ], [ 13, 18 ], [ 14, 13 ], [ 14, 19 ], [ 17, 12 ], [ 19, 15 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Kevin knows Harrison. Fabian knows Kira. Finn knows Colin. Lorna knows Jacqueline. Hudson knows Elijah. Fabian knows Renee. Ida knows Hudson. Philip knows Fabian. Fabian knows Lucy. Jasmine knows Catherine. Lucy knows Ida. Colin knows Colleen. Jacqueline knows Kevin. Lucy knows Jasmine. Harrison knows Rachel. Jacqueline knows Joyce. Kevin knows Finn. Jacqueline knows Carson. Which of Colin and Hudson can Lorna reach?", "answer": "Colin", "steps": [ "Lorna knows Jacqueline.", "Jacqueline knows Kevin.", "Kevin knows Finn.", "Finn knows Colin." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Lorna", "Rachel", "Colin", "Colleen", "Joyce", "Jacqueline", "Kevin", "Harrison", "Carson", "Finn", "Philip", "Catherine", "Hudson", "Elijah", "Kira", "Fabian", "Lucy", "Jasmine", "Renee", "Ida" ], "edges": [ [ 0, 5 ], [ 2, 3 ], [ 5, 4 ], [ 5, 8 ], [ 5, 6 ], [ 6, 7 ], [ 6, 9 ], [ 7, 1 ], [ 9, 2 ], [ 10, 15 ], [ 12, 13 ], [ 15, 14 ], [ 15, 18 ], [ 15, 16 ], [ 16, 17 ], [ 16, 19 ], [ 17, 11 ], [ 19, 12 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Riley knows Edith. Lawson knows Edison. Alvin knows Andre. Trina knows Riley. Riley knows Lionel. Iris knows Wendell. Jeanne knows Lawson. Lionel knows Elliot. Lawson knows Leroy. Rick knows Gary. Alvin knows Clara. Wendell knows Peter. Peter knows Gareth. Gary knows Jeanne. Peter knows Rick. Benjamin knows Trina. Janet knows Alvin. Elliot knows Janet. Which of Edison and Andre can Benjamin reach?", "answer": "Andre", "steps": [ "Benjamin knows Trina.", "Trina knows Riley.", "Riley knows Lionel.", "Lionel knows Elliot.", "Elliot knows Janet.", "Janet knows Alvin.", "Alvin knows Andre." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Benjamin", "Edith", "Janet", "Trina", "Riley", "Andre", "Lionel", "Clara", "Elliot", "Alvin", "Iris", "Gareth", "Jeanne", "Wendell", "Peter", "Edison", "Rick", "Leroy", "Gary", "Lawson" ], "edges": [ [ 0, 3 ], [ 2, 9 ], [ 3, 4 ], [ 4, 1 ], [ 4, 6 ], [ 6, 8 ], [ 8, 2 ], [ 9, 5 ], [ 9, 7 ], [ 10, 13 ], [ 12, 19 ], [ 13, 14 ], [ 14, 11 ], [ 14, 16 ], [ 16, 18 ], [ 18, 12 ], [ 19, 15 ], [ 19, 17 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Opal knows Harris. Opal knows Lee. Jon knows Austin. April knows Ralph. Aurora knows Jenny. Jon knows Kamila. Della knows Jon. Kendrick knows Aurora. Kendrick knows Dylan. Harris knows Shannon. Jon knows Cornelius. Gwen knows Damian. Damian knows April. Damian knows Giselle. Opal knows Gwen. Cornelius knows Isadora. Austin knows Kendrick. Dorian knows Opal. Which of Kendrick and Damian can Della reach?", "answer": "Kendrick", "steps": [ "Della knows Jon.", "Jon knows Austin.", "Austin knows Kendrick." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Della", "Dylan", "Isadora", "Kamila", "Kendrick", "Jenny", "Aurora", "Cornelius", "Austin", "Jon", "Dorian", "Giselle", "Shannon", "Lee", "Damian", "Ralph", "April", "Harris", "Gwen", "Opal" ], "edges": [ [ 0, 9 ], [ 4, 1 ], [ 4, 6 ], [ 6, 5 ], [ 7, 2 ], [ 8, 4 ], [ 9, 3 ], [ 9, 7 ], [ 9, 8 ], [ 10, 19 ], [ 14, 11 ], [ 14, 16 ], [ 16, 15 ], [ 17, 12 ], [ 18, 14 ], [ 19, 13 ], [ 19, 17 ], [ 19, 18 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "June knows Hattie. Rita knows Daria. Jeanette knows Perry. Beverly knows Jeanette. Rita knows Langston. Alejandro knows Lyle. Susan knows June. Hattie knows Saul. Milo knows Hilda. Verna knows Luz. Alejandro knows Shelly. Lars knows Alejandro. Perry knows Rita. Hilda knows Beverly. Alejandro knows Verna. Emily knows Owen. Saul knows Lars. Rita knows Emily. Which of Luz and Owen can Susan reach?", "answer": "Luz", "steps": [ "Susan knows June.", "June knows Hattie.", "Hattie knows Saul.", "Saul knows Lars.", "Lars knows Alejandro.", "Alejandro knows Verna.", "Verna knows Luz." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Susan", "Hattie", "Luz", "Alejandro", "Lars", "Shelly", "Lyle", "Verna", "Saul", "June", "Milo", "Beverly", "Owen", "Rita", "Perry", "Daria", "Langston", "Emily", "Jeanette", "Hilda" ], "edges": [ [ 0, 9 ], [ 1, 8 ], [ 3, 5 ], [ 3, 6 ], [ 3, 7 ], [ 4, 3 ], [ 7, 2 ], [ 8, 4 ], [ 9, 1 ], [ 10, 19 ], [ 11, 18 ], [ 13, 15 ], [ 13, 16 ], [ 13, 17 ], [ 14, 13 ], [ 17, 12 ], [ 18, 14 ], [ 19, 11 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Omar knows Eli. Abel knows Odette. Judith knows Milton. Andre knows Ingrid. Kenzie knows Raymond. Abel knows Christina. Andre knows Trevor. Bernice knows Lillian. Vance knows Alan. Holden knows Kenzie. Judith knows Camille. Ingrid knows Nell. Alan knows Celia. Bernice knows Omar. Nell knows Holden. Eli knows Vance. Bernice knows Judith. Andre knows Abel. Which of Alan and Kenzie can Bernice reach?", "answer": "Alan", "steps": [ "Bernice knows Omar.", "Omar knows Eli.", "Eli knows Vance.", "Vance knows Alan." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Bernice", "Judith", "Vance", "Alan", "Eli", "Lillian", "Camille", "Omar", "Milton", "Celia", "Andre", "Abel", "Holden", "Kenzie", "Nell", "Trevor", "Christina", "Ingrid", "Odette", "Raymond" ], "edges": [ [ 0, 5 ], [ 0, 1 ], [ 0, 7 ], [ 1, 6 ], [ 1, 8 ], [ 2, 3 ], [ 3, 9 ], [ 4, 2 ], [ 7, 4 ], [ 10, 15 ], [ 10, 11 ], [ 10, 17 ], [ 11, 16 ], [ 11, 18 ], [ 12, 13 ], [ 13, 19 ], [ 14, 12 ], [ 17, 14 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Kurt knows Lynn. Jorge knows Michael. Kelly knows Erma. Nolan knows Elizabeth. Kelly knows Shawn. Yvette knows Nolan. Kristina knows Yvette. Michael knows Paula. Lynn knows Kelly. Shawn knows Rick. Kristina knows Dominic. Brody knows Camille. Rick knows April. Lynn knows Dana. Yvette knows Jorge. Viola knows Kristina. Erma knows Brody. Elizabeth knows Ben. Which of Paula and Camille can Viola reach?", "answer": "Paula", "steps": [ "Viola knows Kristina.", "Kristina knows Yvette.", "Yvette knows Jorge.", "Jorge knows Michael.", "Michael knows Paula." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Viola", "Kristina", "Elizabeth", "Nolan", "Paula", "Yvette", "Jorge", "Ben", "Dominic", "Michael", "Kurt", "Lynn", "Rick", "Shawn", "Camille", "Kelly", "Erma", "April", "Dana", "Brody" ], "edges": [ [ 0, 1 ], [ 1, 8 ], [ 1, 5 ], [ 2, 7 ], [ 3, 2 ], [ 5, 3 ], [ 5, 6 ], [ 6, 9 ], [ 9, 4 ], [ 10, 11 ], [ 11, 18 ], [ 11, 15 ], [ 12, 17 ], [ 13, 12 ], [ 15, 13 ], [ 15, 16 ], [ 16, 19 ], [ 19, 14 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Stacy knows Eden. Jasmine knows Morris. Christopher knows Lisette. Heather knows Louisa. Dylan knows Heather. Evan knows Sheila. Stacy knows Joaquin. Leopold knows Jasmine. Joaquin knows Stephen. Dylan knows Ella. Christopher knows Stacy. Heather knows Duke. Marian knows Evan. Louisa knows Marvin. Louisa knows Colin. Joaquin knows Edison. Edison knows Marian. Colin knows Leopold. Which of Leopold and Marian can Christopher reach?", "answer": "Marian", "steps": [ "Christopher knows Stacy.", "Stacy knows Joaquin.", "Joaquin knows Edison.", "Edison knows Marian." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Christopher", "Stacy", "Sheila", "Joaquin", "Edison", "Marian", "Lisette", "Eden", "Evan", "Stephen", "Dylan", "Heather", "Morris", "Louisa", "Colin", "Leopold", "Ella", "Duke", "Jasmine", "Marvin" ], "edges": [ [ 0, 6 ], [ 0, 1 ], [ 1, 7 ], [ 1, 3 ], [ 3, 4 ], [ 3, 9 ], [ 4, 5 ], [ 5, 8 ], [ 8, 2 ], [ 10, 16 ], [ 10, 11 ], [ 11, 17 ], [ 11, 13 ], [ 13, 14 ], [ 13, 19 ], [ 14, 15 ], [ 15, 18 ], [ 18, 12 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Charlene knows Pearl. Maude knows Colby. Karl knows Leon. Maggie knows Ibrahim. Marco knows Walt. Colby knows Marco. June knows Isadora. Isadora knows Ignacio. Walt knows Alan. Ibrahim knows Fernando. Kathleen knows Gage. Anita knows Charlene. Marco knows June. Colby knows Karl. Charlene knows Maggie. Gage knows Ruby. Pearl knows Ivan. Maggie knows Kathleen. Which of Marco and Maggie can Maude reach?", "answer": "Marco", "steps": [ "Maude knows Colby.", "Colby knows Marco." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Maude", "Ignacio", "Karl", "Marco", "Walt", "Isadora", "Leon", "June", "Colby", "Alan", "Anita", "Ruby", "Pearl", "Maggie", "Ibrahim", "Gage", "Ivan", "Kathleen", "Charlene", "Fernando" ], "edges": [ [ 0, 8 ], [ 2, 6 ], [ 3, 7 ], [ 3, 4 ], [ 4, 9 ], [ 5, 1 ], [ 7, 5 ], [ 8, 2 ], [ 8, 3 ], [ 10, 18 ], [ 12, 16 ], [ 13, 17 ], [ 13, 14 ], [ 14, 19 ], [ 15, 11 ], [ 17, 15 ], [ 18, 12 ], [ 18, 13 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Harold knows Joyce. Miles knows Joaquin. Saul knows Harold. Sonia knows Gregory. Dane knows Coral. Clara knows Eugene. Joaquin knows George. Saul knows Clayton. Joyce knows Howard. Joaquin knows Clara. Eugene knows Serena. Howard knows Arden. Howard knows Charles. Howard knows Federico. Federico knows Dane. Sonia knows Harper. Gregory knows Miles. Joaquin knows Natalie. Which of Federico and Clara can Saul reach?", "answer": "Federico", "steps": [ "Saul knows Harold.", "Harold knows Joyce.", "Joyce knows Howard.", "Howard knows Federico." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Saul", "Howard", "Federico", "Arden", "Coral", "Dane", "Clayton", "Joyce", "Charles", "Harold", "Sonia", "Joaquin", "Clara", "George", "Serena", "Eugene", "Harper", "Miles", "Natalie", "Gregory" ], "edges": [ [ 0, 6 ], [ 0, 9 ], [ 1, 3 ], [ 1, 2 ], [ 1, 8 ], [ 2, 5 ], [ 5, 4 ], [ 7, 1 ], [ 9, 7 ], [ 10, 16 ], [ 10, 19 ], [ 11, 13 ], [ 11, 12 ], [ 11, 18 ], [ 12, 15 ], [ 15, 14 ], [ 17, 11 ], [ 19, 17 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Brooke knows Leonard. Mae knows Aurora. Alex knows Dick. Gavin knows Gus. Geoffrey knows John. Dick knows Desmond. Aurora knows Electra. Barry knows Gavin. Elvira knows Geoffrey. Lark knows Doug. Gus knows Brooke. Louise knows Janet. Brooke knows Elvira. Pauline knows Alex. Pauline knows Lark. Doug knows Fernando. Leonard knows Louise. Electra knows Pauline. Which of Aurora and Gavin can Barry reach?", "answer": "Gavin", "steps": [ "Barry knows Gavin." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Barry", "Gus", "Gavin", "Leonard", "Elvira", "Janet", "Louise", "John", "Geoffrey", "Brooke", "Mae", "Electra", "Aurora", "Lark", "Alex", "Fernando", "Doug", "Desmond", "Dick", "Pauline" ], "edges": [ [ 0, 2 ], [ 1, 9 ], [ 2, 1 ], [ 3, 6 ], [ 4, 8 ], [ 6, 5 ], [ 8, 7 ], [ 9, 3 ], [ 9, 4 ], [ 10, 12 ], [ 11, 19 ], [ 12, 11 ], [ 13, 16 ], [ 14, 18 ], [ 16, 15 ], [ 18, 17 ], [ 19, 13 ], [ 19, 14 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Perry knows Javier. Cornelius knows Dick. Leopold knows Gordon. Marie knows Alex. Perry knows Leopold. Jonas knows Marie. Kylie knows Enid. Cornelius knows Jordan. Enid knows Gina. Earle knows Cornelius. Leopold knows Neville. Dick knows Travis. Kylie knows Deanna. Enid knows Earle. Marie knows Darius. Dick knows Alexa. Jonas knows Gregory. Gordon knows Jonas. Which of Alexa and Alex can Perry reach?", "answer": "Alex", "steps": [ "Perry knows Leopold.", "Leopold knows Gordon.", "Gordon knows Jonas.", "Jonas knows Marie.", "Marie knows Alex." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Perry", "Neville", "Alex", "Jonas", "Leopold", "Marie", "Javier", "Gregory", "Darius", "Gordon", "Kylie", "Gina", "Alexa", "Cornelius", "Enid", "Dick", "Deanna", "Jordan", "Travis", "Earle" ], "edges": [ [ 0, 6 ], [ 0, 4 ], [ 3, 7 ], [ 3, 5 ], [ 4, 1 ], [ 4, 9 ], [ 5, 2 ], [ 5, 8 ], [ 9, 3 ], [ 10, 16 ], [ 10, 14 ], [ 13, 17 ], [ 13, 15 ], [ 14, 11 ], [ 14, 19 ], [ 15, 12 ], [ 15, 18 ], [ 19, 13 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Winifred knows Kara. Yara knows Jeanne. Miriam knows Coral. Wilson knows Cynthia. Dana knows Declan. Jeanne knows Dennis. Hank knows Elijah. Elijah knows Winifred. Louise knows Dana. Roger knows Miriam. Winifred knows Louise. Kara knows Joseph. Cynthia knows Freya. Joseph knows Philip. Dennis knows Regina. Freya knows Roger. Freya knows Yara. Declan knows Sierra. Which of Louise and Yara can Wilson reach?", "answer": "Yara", "steps": [ "Wilson knows Cynthia.", "Cynthia knows Freya.", "Freya knows Yara." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Wilson", "Regina", "Roger", "Jeanne", "Coral", "Yara", "Dennis", "Cynthia", "Miriam", "Freya", "Hank", "Sierra", "Kara", "Dana", "Philip", "Louise", "Declan", "Elijah", "Joseph", "Winifred" ], "edges": [ [ 0, 7 ], [ 2, 8 ], [ 3, 6 ], [ 5, 3 ], [ 6, 1 ], [ 7, 9 ], [ 8, 4 ], [ 9, 5 ], [ 9, 2 ], [ 10, 17 ], [ 12, 18 ], [ 13, 16 ], [ 15, 13 ], [ 16, 11 ], [ 17, 19 ], [ 18, 14 ], [ 19, 15 ], [ 19, 12 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Joshua knows Erin. Erin knows Ezra. Damian knows Trevor. Carl knows Diego. Carl knows Julio. Erin knows Sheila. Samantha knows Damian. Jackson knows Dominic. Lambert knows Jorge. Patricia knows Lilia. Dolores knows Kate. Jorge knows Carl. Samantha knows Joshua. Lambert knows Jackson. Carl knows Kara. Erin knows Alma. Erin knows Dolores. Carl knows Patricia. Which of Lilia and Kate can Samantha reach?", "answer": "Kate", "steps": [ "Samantha knows Joshua.", "Joshua knows Erin.", "Erin knows Dolores.", "Dolores knows Kate." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Samantha", "Ezra", "Kate", "Damian", "Erin", "Trevor", "Joshua", "Alma", "Sheila", "Dolores", "Lambert", "Julio", "Lilia", "Jackson", "Carl", "Dominic", "Jorge", "Diego", "Kara", "Patricia" ], "edges": [ [ 0, 3 ], [ 0, 6 ], [ 3, 5 ], [ 4, 1 ], [ 4, 7 ], [ 4, 8 ], [ 4, 9 ], [ 6, 4 ], [ 9, 2 ], [ 10, 13 ], [ 10, 16 ], [ 13, 15 ], [ 14, 11 ], [ 14, 17 ], [ 14, 18 ], [ 14, 19 ], [ 16, 14 ], [ 19, 12 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Emmett knows Gwen. Abel knows Arlene. Glen knows Essie. Emmett knows Abel. Carla knows Dewey. Reid knows Hardy. April knows Kirsten. Essie knows Frank. Helene knows Carla. Essie knows Mae. Guy knows Reid. Hardy knows Finn. Harry knows Helene. Helene knows James. Reid knows Emanuel. Reid knows Harry. Essie knows April. Frank knows Emmett. Which of Reid and Essie can Glen reach?", "answer": "Essie", "steps": [ "Glen knows Essie." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Glen", "Mae", "Essie", "Arlene", "April", "Frank", "Gwen", "Emmett", "Abel", "Kirsten", "Guy", "Emanuel", "Reid", "Dewey", "Hardy", "Harry", "James", "Helene", "Carla", "Finn" ], "edges": [ [ 0, 2 ], [ 2, 1 ], [ 2, 5 ], [ 2, 4 ], [ 4, 9 ], [ 5, 7 ], [ 7, 6 ], [ 7, 8 ], [ 8, 3 ], [ 10, 12 ], [ 12, 11 ], [ 12, 15 ], [ 12, 14 ], [ 14, 19 ], [ 15, 17 ], [ 17, 16 ], [ 17, 18 ], [ 18, 13 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Gertrude knows Jem. Ada knows David. Devon knows Horace. Luz knows Harris. Horace knows Ainsley. Lawrence knows Lambert. Dolores knows Elvira. Ainsley knows Mason. Jem knows Luz. David knows Audrey. Colleen knows Ken. Audrey knows Lawrence. Elvira knows Colleen. David knows Devon. Gertrude knows Dolores. Harris knows Dee. Dwight knows Gertrude. Lambert knows Ernie. Which of Elvira and Horace can Dwight reach?", "answer": "Elvira", "steps": [ "Dwight knows Gertrude.", "Gertrude knows Dolores.", "Dolores knows Elvira." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Dwight", "Jem", "Dolores", "Luz", "Harris", "Dee", "Gertrude", "Ken", "Elvira", "Colleen", "Ada", "Audrey", "Devon", "Lawrence", "Lambert", "Ernie", "David", "Mason", "Horace", "Ainsley" ], "edges": [ [ 0, 6 ], [ 1, 3 ], [ 2, 8 ], [ 3, 4 ], [ 4, 5 ], [ 6, 1 ], [ 6, 2 ], [ 8, 9 ], [ 9, 7 ], [ 10, 16 ], [ 11, 13 ], [ 12, 18 ], [ 13, 14 ], [ 14, 15 ], [ 16, 11 ], [ 16, 12 ], [ 18, 19 ], [ 19, 17 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Inez knows Della. Della knows Marc. Inez knows Justin. Judith knows Inez. Kirsten knows Zane. Wanda knows Emmett. Irving knows Lenora. Glen knows Kirsten. Glen knows Alicia. Della knows Melody. Irving knows Sierra. Larry knows Yara. Yara knows Hugh. Emmett knows Edmund. Yara knows Irving. Yara knows Wanda. Wanda knows Jeff. Inez knows Glen. Which of Emmett and Kirsten can Larry reach?", "answer": "Emmett", "steps": [ "Larry knows Yara.", "Yara knows Wanda.", "Wanda knows Emmett." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Larry", "Emmett", "Hugh", "Sierra", "Irving", "Edmund", "Wanda", "Yara", "Jeff", "Lenora", "Judith", "Kirsten", "Justin", "Marc", "Della", "Zane", "Glen", "Inez", "Alicia", "Melody" ], "edges": [ [ 0, 7 ], [ 1, 5 ], [ 4, 3 ], [ 4, 9 ], [ 6, 1 ], [ 6, 8 ], [ 7, 2 ], [ 7, 6 ], [ 7, 4 ], [ 10, 17 ], [ 11, 15 ], [ 14, 13 ], [ 14, 19 ], [ 16, 11 ], [ 16, 18 ], [ 17, 12 ], [ 17, 16 ], [ 17, 14 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Javier knows Inez. Abigail knows Javier. Kent knows Jenny. Javier knows Lawson. Dewey knows Charlotte. Charlotte knows Barbara. Logan knows Magdalena. Inez knows Camden. Eli knows Ellen. Jenny knows Dewey. Logan knows Jenna. Dewey knows Logan. Dewey knows Hope. Jenna knows Stacy. Jameson knows Abigail. Inez knows Serena. Camden knows Jewel. Javier knows Eli. Which of Javier and Dewey can Jameson reach?", "answer": "Javier", "steps": [ "Jameson knows Abigail.", "Abigail knows Javier." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Jameson", "Serena", "Abigail", "Eli", "Camden", "Inez", "Javier", "Lawson", "Ellen", "Jewel", "Kent", "Magdalena", "Jenny", "Charlotte", "Jenna", "Logan", "Dewey", "Hope", "Barbara", "Stacy" ], "edges": [ [ 0, 2 ], [ 2, 6 ], [ 3, 8 ], [ 4, 9 ], [ 5, 1 ], [ 5, 4 ], [ 6, 7 ], [ 6, 3 ], [ 6, 5 ], [ 10, 12 ], [ 12, 16 ], [ 13, 18 ], [ 14, 19 ], [ 15, 11 ], [ 15, 14 ], [ 16, 17 ], [ 16, 13 ], [ 16, 15 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Wilbur knows Xavier. Landon knows Wilbur. Holly knows Vanessa. Abigail knows Arden. Arden knows Edison. Vanessa knows Leonard. Lyle knows Devin. Abigail knows Holly. Beatrice knows Theodore. Lennox knows Conrad. Rowan knows Abigail. Theodore knows Landon. Theodore knows Lennox. Colin knows Ryan. Edison knows Luz. Conrad knows Louis. Devin knows Rowan. Ryan knows Beatrice. Which of Beatrice and Rowan can Colin reach?", "answer": "Beatrice", "steps": [ "Colin knows Ryan.", "Ryan knows Beatrice." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Colin", "Landon", "Conrad", "Louis", "Theodore", "Beatrice", "Wilbur", "Xavier", "Lennox", "Ryan", "Lyle", "Holly", "Edison", "Luz", "Abigail", "Rowan", "Vanessa", "Leonard", "Arden", "Devin" ], "edges": [ [ 0, 9 ], [ 1, 6 ], [ 2, 3 ], [ 4, 1 ], [ 4, 8 ], [ 5, 4 ], [ 6, 7 ], [ 8, 2 ], [ 9, 5 ], [ 10, 19 ], [ 11, 16 ], [ 12, 13 ], [ 14, 11 ], [ 14, 18 ], [ 15, 14 ], [ 16, 17 ], [ 18, 12 ], [ 19, 15 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Dalton knows Joel. Joanna knows Livia. Clay knows Myra. Yuki knows Penny. Joanna knows Yuki. Yuki knows Harvey. Celia knows Isadora. Lorenzo knows Dalton. Dalton knows Ava. Ava knows Celia. Harvey knows Eldon. Myra knows Lorenzo. Judy knows Abel. Ava knows Sandra. Celia knows Khashayar. Louis knows Joanna. Harvey knows Edison. Abel knows Louis. Which of Harvey and Celia can Judy reach?", "answer": "Harvey", "steps": [ "Judy knows Abel.", "Abel knows Louis.", "Louis knows Joanna.", "Joanna knows Yuki.", "Yuki knows Harvey." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Judy", "Harvey", "Joanna", "Louis", "Edison", "Livia", "Eldon", "Yuki", "Abel", "Penny", "Clay", "Celia", "Dalton", "Lorenzo", "Isadora", "Joel", "Khashayar", "Ava", "Myra", "Sandra" ], "edges": [ [ 0, 8 ], [ 1, 4 ], [ 1, 6 ], [ 2, 5 ], [ 2, 7 ], [ 3, 2 ], [ 7, 1 ], [ 7, 9 ], [ 8, 3 ], [ 10, 18 ], [ 11, 14 ], [ 11, 16 ], [ 12, 15 ], [ 12, 17 ], [ 13, 12 ], [ 17, 11 ], [ 17, 19 ], [ 18, 13 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Maureen knows Hattie. Isadora knows Daphne. Daphne knows Jordan. Dalton knows Jennifer. Mara knows Isla. Isla knows Isadora. Maureen knows Dirk. Dirk knows Brooks. Jordan knows Otto. Kane knows Jay. Carla knows Penny. Jennifer knows Ford. Brody knows Lucille. Jay knows Eden. Jay knows Carla. Jordan knows Maureen. Ford knows Kane. Carla knows Brody. Which of Jennifer and Isla can Mara reach?", "answer": "Isla", "steps": [ "Mara knows Isla." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Mara", "Brooks", "Daphne", "Hattie", "Isla", "Maureen", "Dirk", "Otto", "Isadora", "Jordan", "Dalton", "Lucille", "Kane", "Penny", "Jennifer", "Carla", "Brody", "Eden", "Ford", "Jay" ], "edges": [ [ 0, 4 ], [ 2, 9 ], [ 4, 8 ], [ 5, 3 ], [ 5, 6 ], [ 6, 1 ], [ 8, 2 ], [ 9, 5 ], [ 9, 7 ], [ 10, 14 ], [ 12, 19 ], [ 14, 18 ], [ 15, 13 ], [ 15, 16 ], [ 16, 11 ], [ 18, 12 ], [ 19, 15 ], [ 19, 17 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Bruce knows Merle. Glenda knows Ricardo. Kimberly knows Chester. Everett knows Esme. Bruce knows Geraldine. Glenda knows Claire. Ricardo knows Nolan. Lucas knows Kimberly. Nolan knows Ken. Everett knows Riley. Louis knows Trevor. Esme knows Louis. Geraldine knows Lucas. Joaquin knows Dorian. Joaquin knows Gideon. Geraldine knows Beth. Nolan knows Everett. Gideon knows Bruce. Which of Everett and Geraldine can Joaquin reach?", "answer": "Geraldine", "steps": [ "Joaquin knows Gideon.", "Gideon knows Bruce.", "Bruce knows Geraldine." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Joaquin", "Chester", "Dorian", "Lucas", "Gideon", "Bruce", "Kimberly", "Beth", "Merle", "Geraldine", "Glenda", "Trevor", "Claire", "Esme", "Ricardo", "Nolan", "Louis", "Riley", "Ken", "Everett" ], "edges": [ [ 0, 2 ], [ 0, 4 ], [ 3, 6 ], [ 4, 5 ], [ 5, 8 ], [ 5, 9 ], [ 6, 1 ], [ 9, 3 ], [ 9, 7 ], [ 10, 12 ], [ 10, 14 ], [ 13, 16 ], [ 14, 15 ], [ 15, 18 ], [ 15, 19 ], [ 16, 11 ], [ 19, 13 ], [ 19, 17 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Helene knows Dennis. Nina knows Lyle. Mia knows Jermaine. Jay knows Blair. Rhonda knows Eva. Adele knows Billy. Helene knows Adele. Sean knows Sam. Helene knows Rhonda. Hayden knows Helene. Blair knows Fern. Jermaine knows Dominic. Helene knows Joyce. Blair knows Mia. Samantha knows Javier. Dennis knows Samantha. Blair knows Sean. Blair knows Nina. Which of Blair and Helene can Hayden reach?", "answer": "Helene", "steps": [ "Hayden knows Helene." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Hayden", "Samantha", "Joyce", "Billy", "Dennis", "Helene", "Adele", "Rhonda", "Eva", "Javier", "Jay", "Jermaine", "Fern", "Sam", "Mia", "Blair", "Sean", "Nina", "Lyle", "Dominic" ], "edges": [ [ 0, 5 ], [ 1, 9 ], [ 4, 1 ], [ 5, 2 ], [ 5, 6 ], [ 5, 7 ], [ 5, 4 ], [ 6, 3 ], [ 7, 8 ], [ 10, 15 ], [ 11, 19 ], [ 14, 11 ], [ 15, 12 ], [ 15, 16 ], [ 15, 17 ], [ 15, 14 ], [ 16, 13 ], [ 17, 18 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Fern knows Jacques. Dalton knows Larry. Jacques knows Adrian. Elliot knows Harris. Belinda knows Frances. Belinda knows Noah. Ivan knows Fern. Larry knows Yolanda. Imogen knows Dalton. Frances knows Keira. Fiona knows Kerry. Damian knows Belinda. Zelda knows Imogen. Kerry knows Zelda. Yolanda knows Don. Adrian knows Damian. Larry knows Elliot. Noah knows Joseph. Which of Larry and Belinda can Fiona reach?", "answer": "Larry", "steps": [ "Fiona knows Kerry.", "Kerry knows Zelda.", "Zelda knows Imogen.", "Imogen knows Dalton.", "Dalton knows Larry." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Fiona", "Larry", "Kerry", "Harris", "Don", "Elliot", "Dalton", "Imogen", "Zelda", "Yolanda", "Ivan", "Belinda", "Fern", "Keira", "Joseph", "Frances", "Damian", "Adrian", "Jacques", "Noah" ], "edges": [ [ 0, 2 ], [ 1, 5 ], [ 1, 9 ], [ 2, 8 ], [ 5, 3 ], [ 6, 1 ], [ 7, 6 ], [ 8, 7 ], [ 9, 4 ], [ 10, 12 ], [ 11, 15 ], [ 11, 19 ], [ 12, 18 ], [ 15, 13 ], [ 16, 11 ], [ 17, 16 ], [ 18, 17 ], [ 19, 14 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Dahlia knows Erin. Gabriel knows Ebony. Erin knows Hudson. Dahlia knows Lucas. Lambert knows Gabriel. Keith knows Bernard. Bernard knows Pete. Gabriel knows Greta. Pete knows Rocco. Sean knows Darren. Lucas knows Keith. Deirdre knows Becky. Charity knows Deirdre. Madeline knows Dahlia. Greta knows Grady. Darren knows Charity. Rocco knows Harper. Ebony knows Sean. Which of Sean and Keith can Lambert reach?", "answer": "Sean", "steps": [ "Lambert knows Gabriel.", "Gabriel knows Ebony.", "Ebony knows Sean." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Lambert", "Deirdre", "Darren", "Gabriel", "Charity", "Becky", "Grady", "Sean", "Ebony", "Greta", "Madeline", "Rocco", "Bernard", "Dahlia", "Pete", "Harper", "Hudson", "Keith", "Lucas", "Erin" ], "edges": [ [ 0, 3 ], [ 1, 5 ], [ 2, 4 ], [ 3, 8 ], [ 3, 9 ], [ 4, 1 ], [ 7, 2 ], [ 8, 7 ], [ 9, 6 ], [ 10, 13 ], [ 11, 15 ], [ 12, 14 ], [ 13, 18 ], [ 13, 19 ], [ 14, 11 ], [ 17, 12 ], [ 18, 17 ], [ 19, 16 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Sonia knows Lance. Sonia knows Byron. Daphna knows Ariana. Sonia knows Yara. Eugenia knows Clifford. Sonia knows Eugenia. Florence knows Kristin. Florence knows Walt. Dana knows Sonia. Clifford knows Melody. Byron knows Kenneth. Florence knows Lorraine. Miriam knows Florence. Katherine knows Fabian. Lorraine knows Katherine. Florence knows Kennedy. Kenneth knows Constance. Kennedy knows Daphna. Which of Fabian and Constance can Dana reach?", "answer": "Constance", "steps": [ "Dana knows Sonia.", "Sonia knows Byron.", "Byron knows Kenneth.", "Kenneth knows Constance." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Dana", "Sonia", "Eugenia", "Melody", "Kenneth", "Yara", "Byron", "Constance", "Lance", "Clifford", "Miriam", "Florence", "Kennedy", "Ariana", "Katherine", "Walt", "Lorraine", "Fabian", "Kristin", "Daphna" ], "edges": [ [ 0, 1 ], [ 1, 5 ], [ 1, 6 ], [ 1, 8 ], [ 1, 2 ], [ 2, 9 ], [ 4, 7 ], [ 6, 4 ], [ 9, 3 ], [ 10, 11 ], [ 11, 15 ], [ 11, 16 ], [ 11, 18 ], [ 11, 12 ], [ 12, 19 ], [ 14, 17 ], [ 16, 14 ], [ 19, 13 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Catherine knows Clinton. Jessie knows Mindy. Jonathan knows Catherine. Heather knows Leo. Eric knows Dolores. Diane knows Desmond. Rhea knows Stacy. Gloria knows Laverne. Jonathan knows Griffith. Clyde knows Porter. Rhea knows Clyde. Jenna knows Heather. Gloria knows Diane. Gloria knows Jonathan. Stacy knows Eric. Stacy knows Jenna. Griffith knows Jessie. Rhea knows Perry. Which of Heather and Jessie can Gloria reach?", "answer": "Jessie", "steps": [ "Gloria knows Jonathan.", "Jonathan knows Griffith.", "Griffith knows Jessie." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Gloria", "Laverne", "Griffith", "Desmond", "Catherine", "Mindy", "Clinton", "Jessie", "Diane", "Jonathan", "Rhea", "Perry", "Jenna", "Porter", "Eric", "Leo", "Dolores", "Heather", "Clyde", "Stacy" ], "edges": [ [ 0, 1 ], [ 0, 8 ], [ 0, 9 ], [ 2, 7 ], [ 4, 6 ], [ 7, 5 ], [ 8, 3 ], [ 9, 4 ], [ 9, 2 ], [ 10, 11 ], [ 10, 18 ], [ 10, 19 ], [ 12, 17 ], [ 14, 16 ], [ 17, 15 ], [ 18, 13 ], [ 19, 14 ], [ 19, 12 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Lena knows Clarence. Wanda knows Hattie. Lucia knows Ella. Javier knows Wanda. Sadie knows Adele. Jim knows Sadie. Adele knows Clara. Norma knows Miriam. Sadie knows Norma. Miriam knows Noah. Lucia knows Daphne. Wanda knows Latoya. Cain knows Lucia. Miriam knows Lena. Adele knows Susan. Ken knows Javier. Javier knows Cain. Daphne knows Fabian. Which of Sadie and Javier can Jim reach?", "answer": "Sadie", "steps": [ "Jim knows Sadie." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Jim", "Clara", "Sadie", "Noah", "Susan", "Miriam", "Norma", "Lena", "Adele", "Clarence", "Ken", "Latoya", "Javier", "Ella", "Hattie", "Lucia", "Cain", "Daphne", "Wanda", "Fabian" ], "edges": [ [ 0, 2 ], [ 2, 8 ], [ 2, 6 ], [ 5, 3 ], [ 5, 7 ], [ 6, 5 ], [ 7, 9 ], [ 8, 1 ], [ 8, 4 ], [ 10, 12 ], [ 12, 18 ], [ 12, 16 ], [ 15, 13 ], [ 15, 17 ], [ 16, 15 ], [ 17, 19 ], [ 18, 11 ], [ 18, 14 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Demetrius knows Neil. Josie knows Brittany. Eva knows Lucas. Josie knows Nora. Zach knows Daisy. Claire knows Virgil. Zach knows Philip. Sybil knows Enid. Sybil knows Layla. Eva knows Henry. Eva knows Demetrius. Zach knows Claire. Josie knows Jeremiah. Cruz knows Uma. Jeremiah knows Haley. Claire knows Eva. Sybil knows Cruz. Cruz knows Josie. Which of Claire and Cruz can Sybil reach?", "answer": "Cruz", "steps": [ "Sybil knows Cruz." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Sybil", "Uma", "Nora", "Layla", "Jeremiah", "Haley", "Enid", "Brittany", "Josie", "Cruz", "Zach", "Virgil", "Lucas", "Philip", "Demetrius", "Neil", "Daisy", "Henry", "Eva", "Claire" ], "edges": [ [ 0, 3 ], [ 0, 6 ], [ 0, 9 ], [ 4, 5 ], [ 8, 2 ], [ 8, 4 ], [ 8, 7 ], [ 9, 1 ], [ 9, 8 ], [ 10, 13 ], [ 10, 16 ], [ 10, 19 ], [ 14, 15 ], [ 18, 12 ], [ 18, 14 ], [ 18, 17 ], [ 19, 11 ], [ 19, 18 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Arturo knows Antonio. Tom knows Garrison. Daria knows Etta. Etta knows Ted. Antonio knows Tom. Antonio knows Darren. Ryan knows Eamon. Ryan knows Cara. Alyson knows Arturo. Dexter knows Tanya. Frances knows Ryan. Cara knows Dick. Dexter knows Alyson. Lloyd knows Dexter. Daria knows Celia. Daria knows Dean. Dick knows Daria. Antonio knows Willard. Which of Dexter and Ryan can Lloyd reach?", "answer": "Dexter", "steps": [ "Lloyd knows Dexter." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Lloyd", "Darren", "Dexter", "Tom", "Willard", "Antonio", "Garrison", "Tanya", "Arturo", "Alyson", "Frances", "Celia", "Ryan", "Etta", "Dean", "Daria", "Ted", "Eamon", "Dick", "Cara" ], "edges": [ [ 0, 2 ], [ 2, 7 ], [ 2, 9 ], [ 3, 6 ], [ 5, 1 ], [ 5, 4 ], [ 5, 3 ], [ 8, 5 ], [ 9, 8 ], [ 10, 12 ], [ 12, 17 ], [ 12, 19 ], [ 13, 16 ], [ 15, 11 ], [ 15, 14 ], [ 15, 13 ], [ 18, 15 ], [ 19, 18 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Jackson knows Ivy. Mike knows Sarah. Jolena knows Erica. Fleur knows Reed. Ivy knows Jolena. Priscilla knows Doug. Dixie knows Jose. Jackson knows Sandra. Kylie knows Ron. Jose knows Priscilla. Dixie knows Kylie. Doug knows Rosemary. Mike knows Jackson. Mike knows Fleur. Dixie knows Eunice. Jose knows Noah. Jackson knows Hugh. Jose knows Catherine. Which of Erica and Rosemary can Dixie reach?", "answer": "Rosemary", "steps": [ "Dixie knows Jose.", "Jose knows Priscilla.", "Priscilla knows Doug.", "Doug knows Rosemary." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Dixie", "Jose", "Catherine", "Doug", "Rosemary", "Noah", "Eunice", "Ron", "Priscilla", "Kylie", "Mike", "Jackson", "Sandra", "Jolena", "Erica", "Hugh", "Sarah", "Reed", "Ivy", "Fleur" ], "edges": [ [ 0, 6 ], [ 0, 1 ], [ 0, 9 ], [ 1, 2 ], [ 1, 5 ], [ 1, 8 ], [ 3, 4 ], [ 8, 3 ], [ 9, 7 ], [ 10, 16 ], [ 10, 11 ], [ 10, 19 ], [ 11, 12 ], [ 11, 15 ], [ 11, 18 ], [ 13, 14 ], [ 18, 13 ], [ 19, 17 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Gonzalo knows Luella. Linda knows Tyler. Ted knows Kimberly. Joshua knows Ian. Rena knows Kate. Autumn knows Kenneth. Ted knows Zelda. Kimberly knows Esme. Tyler knows Rena. Gonzalo knows Joshua. Tyler knows Hayden. Esme knows Winifred. Allison knows Cecilia. Alma knows Sally. Kenneth knows Alma. Winifred knows Linda. Sally knows Gonzalo. Allison knows Autumn. Which of Autumn and Kimberly can Ted reach?", "answer": "Kimberly", "steps": [ "Ted knows Kimberly." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Ted", "Hayden", "Tyler", "Kimberly", "Kate", "Esme", "Linda", "Rena", "Zelda", "Winifred", "Allison", "Luella", "Gonzalo", "Autumn", "Ian", "Kenneth", "Sally", "Joshua", "Cecilia", "Alma" ], "edges": [ [ 0, 8 ], [ 0, 3 ], [ 2, 1 ], [ 2, 7 ], [ 3, 5 ], [ 5, 9 ], [ 6, 2 ], [ 7, 4 ], [ 9, 6 ], [ 10, 18 ], [ 10, 13 ], [ 12, 11 ], [ 12, 17 ], [ 13, 15 ], [ 15, 19 ], [ 16, 12 ], [ 17, 14 ], [ 19, 16 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "August knows Nora. Beau knows Jennifer. Jennifer knows Sandra. Ariel knows Aria. Tracy knows Beau. Tracy knows Wilma. Mae knows Priscilla. Sandra knows Gina. Evelyn knows Cruz. Evelyn knows Beth. Mae knows Ariel. Wilma knows August. Delia knows Penny. Chester knows Leon. Cruz knows Mae. August knows Delia. Beth knows Vanessa. Vanessa knows Chester. Which of Wilma and Cruz can Tracy reach?", "answer": "Wilma", "steps": [ "Tracy knows Wilma." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Tracy", "Gina", "Jennifer", "Wilma", "Delia", "Penny", "Sandra", "August", "Beau", "Nora", "Evelyn", "Leon", "Vanessa", "Cruz", "Ariel", "Aria", "Chester", "Mae", "Beth", "Priscilla" ], "edges": [ [ 0, 8 ], [ 0, 3 ], [ 2, 6 ], [ 3, 7 ], [ 4, 5 ], [ 6, 1 ], [ 7, 4 ], [ 7, 9 ], [ 8, 2 ], [ 10, 18 ], [ 10, 13 ], [ 12, 16 ], [ 13, 17 ], [ 14, 15 ], [ 16, 11 ], [ 17, 14 ], [ 17, 19 ], [ 18, 12 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Ross knows Sybil. David knows Darnell. Fergus knows Roland. Stacy knows Lyle. Kelsey knows Giselle. Roland knows Richard. Hugh knows Terrence. Terrence knows Grady. Sybil knows Parsa. Sybil knows Michelle. Hugh knows Ross. Richard knows Kelsey. Parsa knows Ernest. Roland knows Derrick. Fergus knows Yara. Kelsey knows Stacy. Derrick knows Livia. David knows Hugh. Which of Lyle and Ernest can David reach?", "answer": "Ernest", "steps": [ "David knows Hugh.", "Hugh knows Ross.", "Ross knows Sybil.", "Sybil knows Parsa.", "Parsa knows Ernest." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "David", "Ross", "Sybil", "Ernest", "Darnell", "Michelle", "Hugh", "Terrence", "Grady", "Parsa", "Fergus", "Richard", "Kelsey", "Lyle", "Yara", "Giselle", "Roland", "Derrick", "Livia", "Stacy" ], "edges": [ [ 0, 4 ], [ 0, 6 ], [ 1, 2 ], [ 2, 5 ], [ 2, 9 ], [ 6, 7 ], [ 6, 1 ], [ 7, 8 ], [ 9, 3 ], [ 10, 14 ], [ 10, 16 ], [ 11, 12 ], [ 12, 15 ], [ 12, 19 ], [ 16, 17 ], [ 16, 11 ], [ 17, 18 ], [ 19, 13 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Mike knows Laura. Ursula knows Jeremy. Laura knows Stefan. Greta knows Faye. Blanche knows Leon. Ann knows Bernadette. Dalton knows Derek. August knows Heather. Lorraine knows Tyler. Ursula knows Lorraine. Faye knows Dalton. Parker knows Ann. Faye knows Parker. Leon knows Greta. Tyler knows Mike. Miles knows August. Blanche knows Basil. Mike knows Miles. Which of Mike and Faye can Blanche reach?", "answer": "Faye", "steps": [ "Blanche knows Leon.", "Leon knows Greta.", "Greta knows Faye." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Blanche", "Greta", "Bernadette", "Dalton", "Basil", "Parker", "Leon", "Faye", "Ann", "Derek", "Ursula", "Tyler", "Heather", "Laura", "Jeremy", "Miles", "Lorraine", "Mike", "August", "Stefan" ], "edges": [ [ 0, 4 ], [ 0, 6 ], [ 1, 7 ], [ 3, 9 ], [ 5, 8 ], [ 6, 1 ], [ 7, 5 ], [ 7, 3 ], [ 8, 2 ], [ 10, 14 ], [ 10, 16 ], [ 11, 17 ], [ 13, 19 ], [ 15, 18 ], [ 16, 11 ], [ 17, 15 ], [ 17, 13 ], [ 18, 12 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Kieran knows Walter. Hugh knows Skyler. Damien knows Julio. Edith knows Crystal. Jocelyn knows Jolena. Luz knows Brooke. Jocelyn knows Hugh. Kieran knows Fergus. Damien knows Ursula. Ursula knows Jocelyn. Sydney knows Damien. Jolena knows Kaleb. Tony knows Vance. Vance knows Luz. Kingsley knows Edith. Edith knows Tony. Hugh knows Dustin. Vance knows Kieran. Which of Edith and Damien can Sydney reach?", "answer": "Damien", "steps": [ "Sydney knows Damien." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Sydney", "Jolena", "Damien", "Ursula", "Hugh", "Skyler", "Kaleb", "Julio", "Dustin", "Jocelyn", "Kingsley", "Luz", "Edith", "Tony", "Kieran", "Fergus", "Brooke", "Crystal", "Walter", "Vance" ], "edges": [ [ 0, 2 ], [ 1, 6 ], [ 2, 7 ], [ 2, 3 ], [ 3, 9 ], [ 4, 5 ], [ 4, 8 ], [ 9, 1 ], [ 9, 4 ], [ 10, 12 ], [ 11, 16 ], [ 12, 17 ], [ 12, 13 ], [ 13, 19 ], [ 14, 15 ], [ 14, 18 ], [ 19, 11 ], [ 19, 14 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Abel knows Alyson. Calvin knows Dell. Dave knows Abel. Alyson knows Naomi. Abel knows Axel. Alyson knows Austin. Jill knows Francesca. Edison knows Clifford. Abel knows Gary. Francesca knows Charlene. Roger knows Haven. Roger knows Edison. Roger knows Kelsey. Abel knows Chloe. Dell knows Dave. Edison knows Paige. Charlene knows Roger. Roger knows Elvis. Which of Naomi and Paige can Jill reach?", "answer": "Paige", "steps": [ "Jill knows Francesca.", "Francesca knows Charlene.", "Charlene knows Roger.", "Roger knows Edison.", "Edison knows Paige." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Jill", "Kelsey", "Edison", "Francesca", "Paige", "Haven", "Clifford", "Roger", "Elvis", "Charlene", "Calvin", "Axel", "Alyson", "Dell", "Naomi", "Gary", "Austin", "Abel", "Chloe", "Dave" ], "edges": [ [ 0, 3 ], [ 2, 4 ], [ 2, 6 ], [ 3, 9 ], [ 7, 1 ], [ 7, 5 ], [ 7, 2 ], [ 7, 8 ], [ 9, 7 ], [ 10, 13 ], [ 12, 14 ], [ 12, 16 ], [ 13, 19 ], [ 17, 11 ], [ 17, 15 ], [ 17, 12 ], [ 17, 18 ], [ 19, 17 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Carter knows Byron. Elise knows Sidney. Karina knows Jasmine. Byron knows Peggy. Uma knows Bruno. Carter knows Carl. Austin knows Elise. Angela knows Harvey. Jasmine knows Amelia. Harvey knows Amy. Amy knows Austin. Angela knows Arlene. Amelia knows Viola. Derrick knows Justin. Sidney knows Hal. Sidney knows Uma. Amelia knows Derrick. Peggy knows Karina. Which of Amy and Peggy can Carter reach?", "answer": "Peggy", "steps": [ "Carter knows Byron.", "Byron knows Peggy." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Carter", "Jasmine", "Byron", "Derrick", "Amelia", "Viola", "Karina", "Justin", "Peggy", "Carl", "Angela", "Elise", "Harvey", "Uma", "Sidney", "Hal", "Austin", "Bruno", "Amy", "Arlene" ], "edges": [ [ 0, 2 ], [ 0, 9 ], [ 1, 4 ], [ 2, 8 ], [ 3, 7 ], [ 4, 5 ], [ 4, 3 ], [ 6, 1 ], [ 8, 6 ], [ 10, 12 ], [ 10, 19 ], [ 11, 14 ], [ 12, 18 ], [ 13, 17 ], [ 14, 15 ], [ 14, 13 ], [ 16, 11 ], [ 18, 16 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Rose knows Martha. Dirk knows Ursula. Arnold knows Camden. Hendrix knows Della. Leigh knows Curtis. Arnold knows Leigh. Della knows Wilson. Fanny knows Rose. Kerry knows Justin. Arnold knows Myrtle. Della knows Dirk. Carey knows Arnold. Dirk knows Troy. Justin knows Heath. Della knows Roy. Leigh knows Irene. Camden knows Kerry. Wilson knows Fanny. Which of Fanny and Kerry can Carey reach?", "answer": "Kerry", "steps": [ "Carey knows Arnold.", "Arnold knows Camden.", "Camden knows Kerry." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Carey", "Leigh", "Justin", "Curtis", "Myrtle", "Irene", "Camden", "Kerry", "Heath", "Arnold", "Hendrix", "Dirk", "Rose", "Ursula", "Roy", "Troy", "Wilson", "Fanny", "Martha", "Della" ], "edges": [ [ 0, 9 ], [ 1, 3 ], [ 1, 5 ], [ 2, 8 ], [ 6, 7 ], [ 7, 2 ], [ 9, 4 ], [ 9, 1 ], [ 9, 6 ], [ 10, 19 ], [ 11, 13 ], [ 11, 15 ], [ 12, 18 ], [ 16, 17 ], [ 17, 12 ], [ 19, 14 ], [ 19, 11 ], [ 19, 16 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Russell knows Ibrahim. Heath knows Joel. Richard knows Oliver. Virginia knows Simon. Joel knows Jaime. Oliver knows Rocco. Taylor knows Zack. Kelsey knows Fleur. Simon knows Kelsey. Devon knows Russell. Rocco knows Heath. Russell knows Charity. Virginia knows Devon. Alan knows Brooks. Fleur knows Taylor. Norman knows Alan. Richard knows Norman. Alan knows Cora. Which of Fleur and Heath can Richard reach?", "answer": "Heath", "steps": [ "Richard knows Oliver.", "Oliver knows Rocco.", "Rocco knows Heath." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Richard", "Norman", "Joel", "Cora", "Heath", "Jaime", "Alan", "Oliver", "Rocco", "Brooks", "Virginia", "Devon", "Taylor", "Ibrahim", "Fleur", "Zack", "Russell", "Simon", "Kelsey", "Charity" ], "edges": [ [ 0, 7 ], [ 0, 1 ], [ 1, 6 ], [ 2, 5 ], [ 4, 2 ], [ 6, 3 ], [ 6, 9 ], [ 7, 8 ], [ 8, 4 ], [ 10, 17 ], [ 10, 11 ], [ 11, 16 ], [ 12, 15 ], [ 14, 12 ], [ 16, 13 ], [ 16, 19 ], [ 17, 18 ], [ 18, 14 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Denver knows Cornelius. Damian knows Dewey. Destiny knows Lorraine. Pablo knows Molly. Denver knows Jack. Jordan knows Karina. Reed knows Owen. Destiny knows Jordan. Jordan knows Pablo. Denver knows Haley. Jordan knows Reed. Denver knows Damian. Jack knows Clyde. Keaton knows Shane. Keaton knows Denver. Luella knows Destiny. Paul knows Keaton. Jordan knows Flora. Which of Pablo and Damian can Luella reach?", "answer": "Pablo", "steps": [ "Luella knows Destiny.", "Destiny knows Jordan.", "Jordan knows Pablo." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Luella", "Lorraine", "Destiny", "Molly", "Karina", "Jordan", "Reed", "Pablo", "Owen", "Flora", "Paul", "Shane", "Keaton", "Dewey", "Haley", "Denver", "Jack", "Damian", "Clyde", "Cornelius" ], "edges": [ [ 0, 2 ], [ 2, 1 ], [ 2, 5 ], [ 5, 4 ], [ 5, 7 ], [ 5, 6 ], [ 5, 9 ], [ 6, 8 ], [ 7, 3 ], [ 10, 12 ], [ 12, 11 ], [ 12, 15 ], [ 15, 14 ], [ 15, 17 ], [ 15, 16 ], [ 15, 19 ], [ 16, 18 ], [ 17, 13 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Avery knows Charlotte. Gail knows Hayley. Gail knows Lucia. Avery knows Gail. Charlotte knows Nina. Hayley knows Hunter. Hunter knows Glen. Luke knows Jameson. Darius knows Dennis. Marcia knows Samuel. Marcia knows Darius. Marcia knows Brooks. Keaton knows Luke. Avery knows Ron. Brooks knows Keaton. Brooks knows Riley. Nina knows Dustin. Dennis knows Isadora. Which of Jameson and Glen can Marcia reach?", "answer": "Jameson", "steps": [ "Marcia knows Brooks.", "Brooks knows Keaton.", "Keaton knows Luke.", "Luke knows Jameson." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Marcia", "Isadora", "Dennis", "Keaton", "Luke", "Darius", "Samuel", "Jameson", "Brooks", "Riley", "Avery", "Dustin", "Nina", "Hayley", "Hunter", "Charlotte", "Ron", "Glen", "Gail", "Lucia" ], "edges": [ [ 0, 5 ], [ 0, 6 ], [ 0, 8 ], [ 2, 1 ], [ 3, 4 ], [ 4, 7 ], [ 5, 2 ], [ 8, 3 ], [ 8, 9 ], [ 10, 15 ], [ 10, 16 ], [ 10, 18 ], [ 12, 11 ], [ 13, 14 ], [ 14, 17 ], [ 15, 12 ], [ 18, 13 ], [ 18, 19 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Lorraine knows Hampton. Eve knows Electra. Charles knows Winston. Elaine knows Ember. Julio knows Lorraine. Ember knows Judy. Everett knows Isadora. Francis knows Karina. Ross knows Eve. Clayton knows Charles. India knows Jared. Francis knows Emily. Karina knows Darnell. India knows Clayton. Winston knows Everett. Electra knows Julio. Isadora knows Elaine. Darnell knows Ross. Which of Clayton and Karina can India reach?", "answer": "Clayton", "steps": [ "India knows Clayton." ], "difficulty": 1, "original_distance": 8, "idx_to_symbol": [ "India", "Ember", "Everett", "Winston", "Judy", "Jared", "Elaine", "Charles", "Isadora", "Clayton", "Francis", "Lorraine", "Eve", "Ross", "Hampton", "Emily", "Julio", "Darnell", "Electra", "Karina" ], "edges": [ [ 0, 5 ], [ 0, 9 ], [ 1, 4 ], [ 2, 8 ], [ 3, 2 ], [ 6, 1 ], [ 7, 3 ], [ 8, 6 ], [ 9, 7 ], [ 10, 15 ], [ 10, 19 ], [ 11, 14 ], [ 12, 18 ], [ 13, 12 ], [ 16, 11 ], [ 17, 13 ], [ 18, 16 ], [ 19, 17 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Lucy knows Vincent. Colby knows Jakob. Charity knows Colby. Leopold knows Lydia. Charity knows Houston. Lydia knows Byron. Randy knows Irving. August knows Annie. Vincent knows August. Annie knows Zoe. Zoe knows Eric. Kieran knows Charity. Houston knows Leopold. Tabitha knows Lucy. Eric knows Sharon. August knows Randy. Edward knows Tom. Tom knows Kieran. Which of Tom and Lucy can Tabitha reach?", "answer": "Lucy", "steps": [ "Tabitha knows Lucy." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Tabitha", "August", "Irving", "Lucy", "Randy", "Vincent", "Annie", "Sharon", "Zoe", "Eric", "Edward", "Charity", "Jakob", "Tom", "Colby", "Kieran", "Houston", "Byron", "Leopold", "Lydia" ], "edges": [ [ 0, 3 ], [ 1, 4 ], [ 1, 6 ], [ 3, 5 ], [ 4, 2 ], [ 5, 1 ], [ 6, 8 ], [ 8, 9 ], [ 9, 7 ], [ 10, 13 ], [ 11, 14 ], [ 11, 16 ], [ 13, 15 ], [ 14, 12 ], [ 15, 11 ], [ 16, 18 ], [ 18, 19 ], [ 19, 17 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Joan knows Donald. Emery knows Neil. Will knows Norman. Will knows Sierra. Donald knows Paige. Milo knows Etta. Jasper knows Leland. Donald knows Emery. Jasper knows Martha. Jude knows Gina. Martha knows Milo. Emery knows Elliot. Elliot knows Sonia. Martha knows Pam. Sierra knows Jasper. Kristin knows Jude. Jude knows Joan. Ignacio knows Will. Which of Sonia and Etta can Kristin reach?", "answer": "Sonia", "steps": [ "Kristin knows Jude.", "Jude knows Joan.", "Joan knows Donald.", "Donald knows Emery.", "Emery knows Elliot.", "Elliot knows Sonia." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Kristin", "Gina", "Sonia", "Emery", "Elliot", "Joan", "Jude", "Donald", "Neil", "Paige", "Ignacio", "Norman", "Etta", "Martha", "Milo", "Sierra", "Will", "Jasper", "Pam", "Leland" ], "edges": [ [ 0, 6 ], [ 3, 4 ], [ 3, 8 ], [ 4, 2 ], [ 5, 7 ], [ 6, 1 ], [ 6, 5 ], [ 7, 3 ], [ 7, 9 ], [ 10, 16 ], [ 13, 14 ], [ 13, 18 ], [ 14, 12 ], [ 15, 17 ], [ 16, 11 ], [ 16, 15 ], [ 17, 13 ], [ 17, 19 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Lamont knows Dakota. Arturo knows Lamont. Herman knows Deanna. Herman knows Kieran. Hattie knows Selena. Seth knows Kelsey. Alfonso knows Hattie. Virginia knows Keith. Arturo knows Seth. Virginia knows Edison. Hattie knows Jacqueline. Jacqueline knows Violet. Lamont knows Virginia. Selena knows Gertrude. Lena knows Hamilton. Jacqueline knows Herman. Hamilton knows Arturo. Stacy knows Alfonso. Which of Hattie and Arturo can Stacy reach?", "answer": "Hattie", "steps": [ "Stacy knows Alfonso.", "Alfonso knows Hattie." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Stacy", "Herman", "Selena", "Jacqueline", "Violet", "Deanna", "Alfonso", "Kieran", "Hattie", "Gertrude", "Lena", "Virginia", "Seth", "Lamont", "Dakota", "Edison", "Hamilton", "Keith", "Arturo", "Kelsey" ], "edges": [ [ 0, 6 ], [ 1, 5 ], [ 1, 7 ], [ 2, 9 ], [ 3, 4 ], [ 3, 1 ], [ 6, 8 ], [ 8, 3 ], [ 8, 2 ], [ 10, 16 ], [ 11, 15 ], [ 11, 17 ], [ 12, 19 ], [ 13, 14 ], [ 13, 11 ], [ 16, 18 ], [ 18, 13 ], [ 18, 12 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Peggy knows Saul. Grace knows Peggy. Darin knows Arthur. Cooper knows Simon. Simon knows Myra. Hendrix knows Grace. Eldon knows Heidi. Eldon knows Denise. Myra knows Lillian. Saul knows Eldon. Cooper knows Conner. Myra knows Marco. Graeme knows Aisha. Peggy knows Jacqueline. Doug knows Cooper. Lillian knows Darin. Bryan knows Doug. Denise knows Graeme. Which of Denise and Lillian can Hendrix reach?", "answer": "Denise", "steps": [ "Hendrix knows Grace.", "Grace knows Peggy.", "Peggy knows Saul.", "Saul knows Eldon.", "Eldon knows Denise." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Hendrix", "Graeme", "Jacqueline", "Eldon", "Saul", "Grace", "Peggy", "Aisha", "Denise", "Heidi", "Bryan", "Darin", "Conner", "Myra", "Simon", "Doug", "Cooper", "Arthur", "Lillian", "Marco" ], "edges": [ [ 0, 5 ], [ 1, 7 ], [ 3, 8 ], [ 3, 9 ], [ 4, 3 ], [ 5, 6 ], [ 6, 2 ], [ 6, 4 ], [ 8, 1 ], [ 10, 15 ], [ 11, 17 ], [ 13, 18 ], [ 13, 19 ], [ 14, 13 ], [ 15, 16 ], [ 16, 12 ], [ 16, 14 ], [ 18, 11 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Ada knows Greta. Bert knows Jean. Claude knows Mildred. Vivian knows Sydney. Sydney knows Oliver. Greta knows Eden. Sheryl knows Gabriel. Brett knows Elias. Brett knows Atlas. Eden knows Lucille. Nancy knows Brett. Justin knows Nancy. Justin knows Claude. Elias knows Joshua. Greta knows Cate. Vivian knows Ada. Vivian knows Bert. Justin knows Sheryl. Which of Ada and Nancy can Vivian reach?", "answer": "Ada", "steps": [ "Vivian knows Ada." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Vivian", "Bert", "Eden", "Lucille", "Ada", "Greta", "Oliver", "Cate", "Sydney", "Jean", "Justin", "Claude", "Elias", "Joshua", "Nancy", "Brett", "Gabriel", "Atlas", "Sheryl", "Mildred" ], "edges": [ [ 0, 4 ], [ 0, 8 ], [ 0, 1 ], [ 1, 9 ], [ 2, 3 ], [ 4, 5 ], [ 5, 2 ], [ 5, 7 ], [ 8, 6 ], [ 10, 14 ], [ 10, 18 ], [ 10, 11 ], [ 11, 19 ], [ 12, 13 ], [ 14, 15 ], [ 15, 12 ], [ 15, 17 ], [ 18, 16 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Asher knows Ramon. Aspen knows Ted. Raquel knows Kirk. Theodore knows Dudley. Dudley knows Raquel. Dexter knows Madeline. Dexter knows Camden. Asher knows Dexter. Ainsley knows Tara. Ted knows Adele. Gina knows Cordelia. Cordelia knows Ainsley. Wallace knows Aspen. Raquel knows Alyssa. Ramon knows Gina. August knows Wallace. Dudley knows August. Hubert knows Asher. Which of Ted and Ainsley can Theodore reach?", "answer": "Ted", "steps": [ "Theodore knows Dudley.", "Dudley knows August.", "August knows Wallace.", "Wallace knows Aspen.", "Aspen knows Ted." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Theodore", "Wallace", "Aspen", "Ted", "Dudley", "Adele", "Raquel", "Kirk", "August", "Alyssa", "Hubert", "Gina", "Cordelia", "Ainsley", "Asher", "Tara", "Dexter", "Madeline", "Ramon", "Camden" ], "edges": [ [ 0, 4 ], [ 1, 2 ], [ 2, 3 ], [ 3, 5 ], [ 4, 8 ], [ 4, 6 ], [ 6, 7 ], [ 6, 9 ], [ 8, 1 ], [ 10, 14 ], [ 11, 12 ], [ 12, 13 ], [ 13, 15 ], [ 14, 18 ], [ 14, 16 ], [ 16, 17 ], [ 16, 19 ], [ 18, 11 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Joanna knows Earle. Rhonda knows Katherine. Greta knows Rhonda. Jean knows Judy. Katherine knows Daniel. Francesca knows Greta. Daniel knows Scott. Daniel knows Yvonne. Kay knows Joanna. Jack knows Cesar. Yvonne knows Janice. Judy knows Emanuel. Earle knows Cain. Judy knows Axel. Cain knows Tonya. Cesar knows Francesca. Tonya knows Jean. Emanuel knows Ariana. Which of Earle and Francesca can Jack reach?", "answer": "Francesca", "steps": [ "Jack knows Cesar.", "Cesar knows Francesca." ], "difficulty": 2, "original_distance": 8, "idx_to_symbol": [ "Jack", "Greta", "Cesar", "Scott", "Katherine", "Yvonne", "Janice", "Daniel", "Francesca", "Rhonda", "Kay", "Cain", "Joanna", "Axel", "Jean", "Emanuel", "Ariana", "Judy", "Earle", "Tonya" ], "edges": [ [ 0, 2 ], [ 1, 9 ], [ 2, 8 ], [ 4, 7 ], [ 5, 6 ], [ 7, 3 ], [ 7, 5 ], [ 8, 1 ], [ 9, 4 ], [ 10, 12 ], [ 11, 19 ], [ 12, 18 ], [ 14, 17 ], [ 15, 16 ], [ 17, 13 ], [ 17, 15 ], [ 18, 11 ], [ 19, 14 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Frida knows Kristina. Virginia knows Frida. Fergus knows Hudson. Lena knows Brock. Kristin knows Ralph. Jocelyn knows Kai. Jeremy knows Jocelyn. Kristina knows Alfonso. Harper knows Jillian. Jackson knows Kristin. Hudson knows Harper. Bryan knows Jeremy. Jeremy knows Sue. Kai knows Fergus. Kristin knows Lena. Ralph knows Virginia. Alfonso knows Brian. Sue knows Frank. Which of Jillian and Brian can Bryan reach?", "answer": "Jillian", "steps": [ "Bryan knows Jeremy.", "Jeremy knows Jocelyn.", "Jocelyn knows Kai.", "Kai knows Fergus.", "Fergus knows Hudson.", "Hudson knows Harper.", "Harper knows Jillian." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Bryan", "Sue", "Jillian", "Harper", "Jocelyn", "Fergus", "Frank", "Hudson", "Jeremy", "Kai", "Jackson", "Lena", "Brian", "Alfonso", "Ralph", "Frida", "Brock", "Kristina", "Kristin", "Virginia" ], "edges": [ [ 0, 8 ], [ 1, 6 ], [ 3, 2 ], [ 4, 9 ], [ 5, 7 ], [ 7, 3 ], [ 8, 1 ], [ 8, 4 ], [ 9, 5 ], [ 10, 18 ], [ 11, 16 ], [ 13, 12 ], [ 14, 19 ], [ 15, 17 ], [ 17, 13 ], [ 18, 11 ], [ 18, 14 ], [ 19, 15 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Lyric knows Cate. Josie knows Greer. Lillian knows Lyric. Lillian knows Josie. Erica knows Herman. Dustin knows Kendra. Jamie knows Laura. Hazel knows Estella. Dustin knows Lewis. Lewis knows Erica. Hazel knows Penny. Erica knows Hazel. Josie knows Mary. Greer knows Cliff. Estella knows Jana. Herman knows Lorraine. Jamie knows Melody. Melody knows Lillian. Which of Lillian and Erica can Dustin reach?", "answer": "Erica", "steps": [ "Dustin knows Lewis.", "Lewis knows Erica." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Dustin", "Lewis", "Hazel", "Penny", "Kendra", "Herman", "Erica", "Jana", "Lorraine", "Estella", "Jamie", "Melody", "Josie", "Mary", "Laura", "Lyric", "Lillian", "Cliff", "Cate", "Greer" ], "edges": [ [ 0, 4 ], [ 0, 1 ], [ 1, 6 ], [ 2, 3 ], [ 2, 9 ], [ 5, 8 ], [ 6, 5 ], [ 6, 2 ], [ 9, 7 ], [ 10, 14 ], [ 10, 11 ], [ 11, 16 ], [ 12, 13 ], [ 12, 19 ], [ 15, 18 ], [ 16, 15 ], [ 16, 12 ], [ 19, 17 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Darin knows Elton. Jean knows George. Adam knows Ilene. Diego knows Dixie. Felix knows Fred. Jean knows Jacques. Jean knows Diego. Paige knows Austin. Colby knows Felix. Colby knows Griffith. Fred knows Wade. Felix knows Adam. Dave knows Carter. Colby knows Clement. Colby knows Darin. Jacques knows Dave. Jean knows Hayley. Jacques knows Paige. Which of Austin and Wade can Jean reach?", "answer": "Austin", "steps": [ "Jean knows Jacques.", "Jacques knows Paige.", "Paige knows Austin." ], "difficulty": 3, "original_distance": 3, "idx_to_symbol": [ "Jean", "Paige", "Jacques", "Carter", "Diego", "George", "Dave", "Dixie", "Austin", "Hayley", "Colby", "Fred", "Felix", "Ilene", "Darin", "Clement", "Adam", "Elton", "Wade", "Griffith" ], "edges": [ [ 0, 5 ], [ 0, 4 ], [ 0, 2 ], [ 0, 9 ], [ 1, 8 ], [ 2, 6 ], [ 2, 1 ], [ 4, 7 ], [ 6, 3 ], [ 10, 15 ], [ 10, 14 ], [ 10, 12 ], [ 10, 19 ], [ 11, 18 ], [ 12, 16 ], [ 12, 11 ], [ 14, 17 ], [ 16, 13 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Shelly knows Brett. Justine knows Benjamin. Brett knows Parker. Benjamin knows Aiden. Jeanette knows Justine. Carol knows Helene. Carol knows Georgia. Alyssa knows Lionel. Alejandro knows Edmund. Parker knows Alyssa. Benjamin knows Chester. Dean knows Jeanette. Justine knows Hadley. Edmund knows Dean. Dean knows August. Alyssa knows Carol. Wallace knows Shelly. Brett knows Kendra. Which of Alyssa and Justine can Wallace reach?", "answer": "Alyssa", "steps": [ "Wallace knows Shelly.", "Shelly knows Brett.", "Brett knows Parker.", "Parker knows Alyssa." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Wallace", "Alyssa", "Georgia", "Lionel", "Carol", "Parker", "Helene", "Kendra", "Brett", "Shelly", "Alejandro", "Justine", "Aiden", "Hadley", "Benjamin", "Jeanette", "Chester", "August", "Dean", "Edmund" ], "edges": [ [ 0, 9 ], [ 1, 3 ], [ 1, 4 ], [ 4, 2 ], [ 4, 6 ], [ 5, 1 ], [ 8, 5 ], [ 8, 7 ], [ 9, 8 ], [ 10, 19 ], [ 11, 13 ], [ 11, 14 ], [ 14, 12 ], [ 14, 16 ], [ 15, 11 ], [ 18, 15 ], [ 18, 17 ], [ 19, 18 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Greer knows Alicia. Clara knows Linda. Bernard knows Conner. Bernard knows Deirdre. Deirdre knows Lauren. Cara knows Bill. Callum knows Clara. Cara knows Gordon. Clara knows Cara. Garland knows Callum. Lauren knows Kelsey. Kelsey knows Vanessa. Langston knows Jeff. Gordon knows Greer. Carrie knows Bernard. Jeff knows Carrie. Carrie knows Marie. Alicia knows Deanna. Which of Deirdre and Gordon can Garland reach?", "answer": "Gordon", "steps": [ "Garland knows Callum.", "Callum knows Clara.", "Clara knows Cara.", "Cara knows Gordon." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Garland", "Bill", "Linda", "Cara", "Clara", "Alicia", "Callum", "Deanna", "Gordon", "Greer", "Langston", "Conner", "Marie", "Bernard", "Carrie", "Kelsey", "Jeff", "Vanessa", "Deirdre", "Lauren" ], "edges": [ [ 0, 6 ], [ 3, 1 ], [ 3, 8 ], [ 4, 2 ], [ 4, 3 ], [ 5, 7 ], [ 6, 4 ], [ 8, 9 ], [ 9, 5 ], [ 10, 16 ], [ 13, 11 ], [ 13, 18 ], [ 14, 12 ], [ 14, 13 ], [ 15, 17 ], [ 16, 14 ], [ 18, 19 ], [ 19, 15 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Imogen knows Brett. Bella knows Brandon. Imogen knows Chris. Lee knows Frankie. Lee knows Quinn. Lars knows Kate. Darin knows Bonnie. Brandon knows Dorian. Dell knows Naomi. Chris knows Lars. Bella knows Janice. Darin knows Mason. Guy knows Dell. Dell knows Bella. Serena knows Imogen. Guy knows Lee. Chris knows Hazel. Serena knows Darin. Which of Imogen and Dell can Guy reach?", "answer": "Dell", "steps": [ "Guy knows Dell." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Guy", "Janice", "Lee", "Frankie", "Bella", "Dorian", "Naomi", "Brandon", "Quinn", "Dell", "Serena", "Hazel", "Darin", "Mason", "Chris", "Kate", "Brett", "Lars", "Bonnie", "Imogen" ], "edges": [ [ 0, 2 ], [ 0, 9 ], [ 2, 3 ], [ 2, 8 ], [ 4, 1 ], [ 4, 7 ], [ 7, 5 ], [ 9, 6 ], [ 9, 4 ], [ 10, 12 ], [ 10, 19 ], [ 12, 13 ], [ 12, 18 ], [ 14, 11 ], [ 14, 17 ], [ 17, 15 ], [ 19, 16 ], [ 19, 14 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Pauline knows Eunice. Abigail knows Dolly. Carson knows Maya. Keira knows Joshua. Gwen knows Keira. Natalie knows Greer. Sally knows Carson. Eunice knows Natalie. Dolly knows Dorian. Joshua knows Janet. Gwen knows Harlan. Caroline knows Ilene. Brad knows Warren. Janet knows Caroline. Pauline knows Amelia. Ilene knows Sally. Warren knows Abigail. Greer knows Brad. Which of Caroline and Brad can Gwen reach?", "answer": "Caroline", "steps": [ "Gwen knows Keira.", "Keira knows Joshua.", "Joshua knows Janet.", "Janet knows Caroline." ], "difficulty": 4, "original_distance": 8, "idx_to_symbol": [ "Gwen", "Joshua", "Harlan", "Carson", "Maya", "Keira", "Caroline", "Janet", "Ilene", "Sally", "Pauline", "Natalie", "Amelia", "Dolly", "Dorian", "Eunice", "Brad", "Greer", "Warren", "Abigail" ], "edges": [ [ 0, 2 ], [ 0, 5 ], [ 1, 7 ], [ 3, 4 ], [ 5, 1 ], [ 6, 8 ], [ 7, 6 ], [ 8, 9 ], [ 9, 3 ], [ 10, 12 ], [ 10, 15 ], [ 11, 17 ], [ 13, 14 ], [ 15, 11 ], [ 16, 18 ], [ 17, 16 ], [ 18, 19 ], [ 19, 13 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Darin knows Elton. Jean knows George. Adam knows Ilene. Diego knows Dixie. Felix knows Fred. Jean knows Jacques. Jean knows Diego. Paige knows Austin. Colby knows Felix. Colby knows Griffith. Fred knows Wade. Felix knows Adam. Dave knows Carter. Colby knows Clement. Colby knows Darin. Jacques knows Dave. Jean knows Hayley. Jacques knows Paige. Which of Felix and Jacques can Jean reach?", "answer": "Jacques", "steps": [ "Jean knows Jacques." ], "difficulty": 1, "original_distance": 3, "idx_to_symbol": [ "Jean", "Paige", "Jacques", "Carter", "Diego", "George", "Dave", "Dixie", "Austin", "Hayley", "Colby", "Fred", "Felix", "Ilene", "Darin", "Clement", "Adam", "Elton", "Wade", "Griffith" ], "edges": [ [ 0, 5 ], [ 0, 4 ], [ 0, 2 ], [ 0, 9 ], [ 1, 8 ], [ 2, 6 ], [ 2, 1 ], [ 4, 7 ], [ 6, 3 ], [ 10, 15 ], [ 10, 14 ], [ 10, 12 ], [ 10, 19 ], [ 11, 18 ], [ 12, 16 ], [ 12, 11 ], [ 14, 17 ], [ 16, 13 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Aspen knows Ian. Marvin knows Walt. Dayton knows Vivian. Winifred knows Lola. Sheryl knows Beth. Vivian knows Sara. Sonia knows Arnold. Sara knows Molly. Molly knows Roman. Roman knows Aiden. Dayton knows Aspen. Stephen knows Sonia. Vivian knows Edmund. Sonia knows Winifred. Ian knows Joanna. Beth knows Wayne. Stephen knows Sheryl. Lola knows Marvin. Which of Roman and Marvin can Dayton reach?", "answer": "Roman", "steps": [ "Dayton knows Vivian.", "Vivian knows Sara.", "Sara knows Molly.", "Molly knows Roman." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Dayton", "Ian", "Aiden", "Sara", "Joanna", "Aspen", "Vivian", "Roman", "Edmund", "Molly", "Stephen", "Beth", "Walt", "Winifred", "Wayne", "Sheryl", "Sonia", "Marvin", "Arnold", "Lola" ], "edges": [ [ 0, 5 ], [ 0, 6 ], [ 1, 4 ], [ 3, 9 ], [ 5, 1 ], [ 6, 8 ], [ 6, 3 ], [ 7, 2 ], [ 9, 7 ], [ 10, 15 ], [ 10, 16 ], [ 11, 14 ], [ 13, 19 ], [ 15, 11 ], [ 16, 18 ], [ 16, 13 ], [ 17, 12 ], [ 19, 17 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Bruce knows Merle. Glenda knows Ricardo. Kimberly knows Chester. Everett knows Esme. Bruce knows Geraldine. Glenda knows Claire. Ricardo knows Nolan. Lucas knows Kimberly. Nolan knows Ken. Everett knows Riley. Louis knows Trevor. Esme knows Louis. Geraldine knows Lucas. Joaquin knows Dorian. Joaquin knows Gideon. Geraldine knows Beth. Nolan knows Everett. Gideon knows Bruce. Which of Gideon and Ricardo can Joaquin reach?", "answer": "Gideon", "steps": [ "Joaquin knows Gideon." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Joaquin", "Chester", "Dorian", "Lucas", "Gideon", "Bruce", "Kimberly", "Beth", "Merle", "Geraldine", "Glenda", "Trevor", "Claire", "Esme", "Ricardo", "Nolan", "Louis", "Riley", "Ken", "Everett" ], "edges": [ [ 0, 2 ], [ 0, 4 ], [ 3, 6 ], [ 4, 5 ], [ 5, 8 ], [ 5, 9 ], [ 6, 1 ], [ 9, 3 ], [ 9, 7 ], [ 10, 12 ], [ 10, 14 ], [ 13, 16 ], [ 14, 15 ], [ 15, 18 ], [ 15, 19 ], [ 16, 11 ], [ 19, 13 ], [ 19, 17 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Annie knows Eunice. Eunice knows Deborah. Bruno knows Glenn. Graeme knows Bruno. Deborah knows Cody. Patricia knows Jason. Chandler knows Abel. Lisette knows Ezra. Charlotte knows Graeme. Noah knows Garrett. Bruno knows Sue. Patricia knows June. Lisette knows Geoffrey. Jason knows Chandler. Annie knows Charlotte. Patricia knows Noah. Annie knows Elias. Garrett knows Lisette. Which of Graeme and Garrett can Annie reach?", "answer": "Graeme", "steps": [ "Annie knows Charlotte.", "Charlotte knows Graeme." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Annie", "Cody", "Charlotte", "Sue", "Deborah", "Bruno", "Glenn", "Eunice", "Elias", "Graeme", "Patricia", "Abel", "Noah", "Geoffrey", "Chandler", "Lisette", "Ezra", "Jason", "June", "Garrett" ], "edges": [ [ 0, 7 ], [ 0, 8 ], [ 0, 2 ], [ 2, 9 ], [ 4, 1 ], [ 5, 3 ], [ 5, 6 ], [ 7, 4 ], [ 9, 5 ], [ 10, 17 ], [ 10, 18 ], [ 10, 12 ], [ 12, 19 ], [ 14, 11 ], [ 15, 13 ], [ 15, 16 ], [ 17, 14 ], [ 19, 15 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Marshall knows Leopold. Marshall knows Latoya. Oscar knows Marshall. Clayton knows Harry. Henry knows Estelle. Oscar knows Pam. Marshall knows Otto. Graeme knows Devin. Graeme knows Paul. Paul knows Kobe. Harry knows Elliot. Elliot knows Roger. Paul knows Henry. Brock knows Porter. Estelle knows Finn. Finn knows Brock. Latoya knows Clayton. Paul knows Jolene. Which of Brock and Elliot can Graeme reach?", "answer": "Brock", "steps": [ "Graeme knows Paul.", "Paul knows Henry.", "Henry knows Estelle.", "Estelle knows Finn.", "Finn knows Brock." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Graeme", "Brock", "Jolene", "Paul", "Devin", "Finn", "Henry", "Porter", "Kobe", "Estelle", "Oscar", "Elliot", "Otto", "Marshall", "Pam", "Harry", "Latoya", "Roger", "Leopold", "Clayton" ], "edges": [ [ 0, 4 ], [ 0, 3 ], [ 1, 7 ], [ 3, 2 ], [ 3, 8 ], [ 3, 6 ], [ 5, 1 ], [ 6, 9 ], [ 9, 5 ], [ 10, 14 ], [ 10, 13 ], [ 11, 17 ], [ 13, 12 ], [ 13, 18 ], [ 13, 16 ], [ 15, 11 ], [ 16, 19 ], [ 19, 15 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Sierra knows Lucille. Lucille knows Troy. Iris knows Jackson. Jose knows Kit. Sierra knows Clyde. Eli knows Sierra. Iris knows Harriet. Ken knows Xavier. Ken knows Marlene. Jose knows Trevor. Chris knows Iris. Julian knows Jose. Julian knows Cesar. Felicia knows Julian. Lucille knows Amelia. Clay knows Ken. Ken knows Felicia. Iris knows Eli. Which of Lucille and Jose can Clay reach?", "answer": "Jose", "steps": [ "Clay knows Ken.", "Ken knows Felicia.", "Felicia knows Julian.", "Julian knows Jose." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Clay", "Xavier", "Trevor", "Kit", "Marlene", "Jose", "Ken", "Julian", "Felicia", "Cesar", "Chris", "Harriet", "Troy", "Amelia", "Jackson", "Lucille", "Iris", "Sierra", "Eli", "Clyde" ], "edges": [ [ 0, 6 ], [ 5, 2 ], [ 5, 3 ], [ 6, 1 ], [ 6, 4 ], [ 6, 8 ], [ 7, 5 ], [ 7, 9 ], [ 8, 7 ], [ 10, 16 ], [ 15, 12 ], [ 15, 13 ], [ 16, 11 ], [ 16, 14 ], [ 16, 18 ], [ 17, 15 ], [ 17, 19 ], [ 18, 17 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Perry knows Thea. Garland knows Hayley. Cruz knows Cyrus. Lawrence knows Cliff. Stacy knows Garland. Jameson knows Dewey. Thea knows Ava. Vera knows Dallas. Michelle knows Cruz. Corey knows Xander. Michelle knows Vera. Thea knows Merle. Ava knows Michelle. Dewey knows Lawrence. Elijah knows Perry. Asher knows Stacy. Dewey knows Corey. Garland knows Jameson. Which of Stacy and Perry can Elijah reach?", "answer": "Perry", "steps": [ "Elijah knows Perry." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Elijah", "Dallas", "Michelle", "Ava", "Perry", "Cyrus", "Thea", "Merle", "Vera", "Cruz", "Asher", "Xander", "Dewey", "Jameson", "Stacy", "Cliff", "Garland", "Hayley", "Corey", "Lawrence" ], "edges": [ [ 0, 4 ], [ 2, 8 ], [ 2, 9 ], [ 3, 2 ], [ 4, 6 ], [ 6, 7 ], [ 6, 3 ], [ 8, 1 ], [ 9, 5 ], [ 10, 14 ], [ 12, 18 ], [ 12, 19 ], [ 13, 12 ], [ 14, 16 ], [ 16, 17 ], [ 16, 13 ], [ 18, 11 ], [ 19, 15 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Crystal knows Victor. Guillermo knows Luella. Bette knows Jewel. Renee knows Darcy. Val knows Guillermo. Darcy knows Perry. Martha knows Val. Rhonda knows Catherine. Luella knows Leah. Catherine knows Lucy. Catherine knows Autumn. Victor knows Alfonso. Lucy knows Martin. Martha knows Cruz. Martin knows Bette. Graeme knows Martha. Renee knows Graeme. Crystal knows Rhonda. Which of Martha and Catherine can Crystal reach?", "answer": "Catherine", "steps": [ "Crystal knows Rhonda.", "Rhonda knows Catherine." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Crystal", "Rhonda", "Martin", "Bette", "Victor", "Lucy", "Jewel", "Catherine", "Autumn", "Alfonso", "Renee", "Graeme", "Guillermo", "Luella", "Darcy", "Val", "Leah", "Martha", "Cruz", "Perry" ], "edges": [ [ 0, 1 ], [ 0, 4 ], [ 1, 7 ], [ 2, 3 ], [ 3, 6 ], [ 4, 9 ], [ 5, 2 ], [ 7, 5 ], [ 7, 8 ], [ 10, 11 ], [ 10, 14 ], [ 11, 17 ], [ 12, 13 ], [ 13, 16 ], [ 14, 19 ], [ 15, 12 ], [ 17, 15 ], [ 17, 18 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Linda knows Fisher. Linda knows Tiffany. Benjamin knows Harrison. Tom knows Parker. Tiffany knows Gina. Linda knows Benjamin. Ian knows Naomi. Naomi knows Pauline. Harrison knows Geoffrey. Pedro knows Jake. Ian knows Pedro. Alan knows Tom. Gina knows Fergus. Jake knows Nolan. Linda knows Cara. Ian knows Charles. Fisher knows Vera. Ian knows Alan. Which of Pedro and Tiffany can Ian reach?", "answer": "Pedro", "steps": [ "Ian knows Pedro." ], "difficulty": 1, "original_distance": 3, "idx_to_symbol": [ "Ian", "Jake", "Pedro", "Parker", "Nolan", "Alan", "Tom", "Charles", "Naomi", "Pauline", "Linda", "Gina", "Tiffany", "Geoffrey", "Fergus", "Benjamin", "Harrison", "Cara", "Fisher", "Vera" ], "edges": [ [ 0, 2 ], [ 0, 5 ], [ 0, 7 ], [ 0, 8 ], [ 1, 4 ], [ 2, 1 ], [ 5, 6 ], [ 6, 3 ], [ 8, 9 ], [ 10, 12 ], [ 10, 15 ], [ 10, 17 ], [ 10, 18 ], [ 11, 14 ], [ 12, 11 ], [ 15, 16 ], [ 16, 13 ], [ 18, 19 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Amelia knows Pearl. Amelia knows Chloe. Chloe knows Aisha. Dustin knows Olivia. Lacey knows Dustin. Walt knows Paul. Theodore knows Esme. Walt knows Inez. Aisha knows Clifford. Aisha knows Dakota. Aisha knows Fleur. Ken knows Clayton. Olivia knows Walt. Dakota knows Theodore. Trudy knows Amelia. Grady knows Ken. Dustin knows Val. Walt knows Grady. Which of Esme and Clayton can Lacey reach?", "answer": "Clayton", "steps": [ "Lacey knows Dustin.", "Dustin knows Olivia.", "Olivia knows Walt.", "Walt knows Grady.", "Grady knows Ken.", "Ken knows Clayton." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Lacey", "Inez", "Olivia", "Walt", "Val", "Ken", "Clayton", "Grady", "Dustin", "Paul", "Trudy", "Fleur", "Chloe", "Aisha", "Pearl", "Theodore", "Esme", "Dakota", "Amelia", "Clifford" ], "edges": [ [ 0, 8 ], [ 2, 3 ], [ 3, 1 ], [ 3, 7 ], [ 3, 9 ], [ 5, 6 ], [ 7, 5 ], [ 8, 4 ], [ 8, 2 ], [ 10, 18 ], [ 12, 13 ], [ 13, 11 ], [ 13, 17 ], [ 13, 19 ], [ 15, 16 ], [ 17, 15 ], [ 18, 14 ], [ 18, 12 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Wendy knows Wade. Jamie knows Wendy. Justine knows Jamie. Lamont knows Nell. Wendy knows Owen. Gail knows Helene. Gail knows Anna. Vera knows Jewel. Arthur knows Lamont. Ivy knows Vera. Owen knows Bernadette. Federico knows Gail. Cecilia knows Jacob. Owen knows Arthur. Helene knows Ivy. Jacob knows Federico. Dahlia knows Justine. Helene knows Kristina. Which of Gail and Wendy can Dahlia reach?", "answer": "Wendy", "steps": [ "Dahlia knows Justine.", "Justine knows Jamie.", "Jamie knows Wendy." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Dahlia", "Justine", "Lamont", "Bernadette", "Owen", "Wade", "Nell", "Wendy", "Jamie", "Arthur", "Cecilia", "Jacob", "Vera", "Kristina", "Helene", "Anna", "Jewel", "Gail", "Federico", "Ivy" ], "edges": [ [ 0, 1 ], [ 1, 8 ], [ 2, 6 ], [ 4, 3 ], [ 4, 9 ], [ 7, 5 ], [ 7, 4 ], [ 8, 7 ], [ 9, 2 ], [ 10, 11 ], [ 11, 18 ], [ 12, 16 ], [ 14, 13 ], [ 14, 19 ], [ 17, 15 ], [ 17, 14 ], [ 18, 17 ], [ 19, 12 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Jeremy knows Henry. Jane knows Bernice. Beatrice knows Fanny. Roman knows Emma. Roman knows Luther. Henry knows Alfred. Christina knows Heather. Knox knows Pearl. Bella knows Emmett. Bella knows Beatrice. Jane knows Anastasia. Anastasia knows Estella. Emmett knows Jeremy. Henry knows Stacy. Jared knows Roman. Henry knows Christina. Roman knows Knox. Bernice knows Jared. Which of Bernice and Emmett can Bella reach?", "answer": "Emmett", "steps": [ "Bella knows Emmett." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Bella", "Beatrice", "Christina", "Heather", "Stacy", "Alfred", "Emmett", "Jeremy", "Fanny", "Henry", "Jane", "Anastasia", "Knox", "Pearl", "Emma", "Luther", "Bernice", "Jared", "Estella", "Roman" ], "edges": [ [ 0, 1 ], [ 0, 6 ], [ 1, 8 ], [ 2, 3 ], [ 6, 7 ], [ 7, 9 ], [ 9, 2 ], [ 9, 4 ], [ 9, 5 ], [ 10, 11 ], [ 10, 16 ], [ 11, 18 ], [ 12, 13 ], [ 16, 17 ], [ 17, 19 ], [ 19, 12 ], [ 19, 14 ], [ 19, 15 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Colin knows Susanne. Marian knows Beau. Charles knows Ashton. Charles knows Emery. Darnell knows Emanuel. Susanne knows Ira. Kyle knows Diana. Marian knows Trudy. Darnell knows Charles. Kyle knows Wendell. Susanne knows Lillian. Kyle knows Jude. Lillian knows Ken. Lillian knows Harrison. Charles knows Jon. Lillian knows Tony. Jude knows Darnell. Marian knows Colin. Which of Charles and Lillian can Marian reach?", "answer": "Lillian", "steps": [ "Marian knows Colin.", "Colin knows Susanne.", "Susanne knows Lillian." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Marian", "Lillian", "Ira", "Susanne", "Colin", "Ken", "Beau", "Trudy", "Harrison", "Tony", "Kyle", "Charles", "Emanuel", "Darnell", "Jude", "Jon", "Wendell", "Diana", "Ashton", "Emery" ], "edges": [ [ 0, 6 ], [ 0, 7 ], [ 0, 4 ], [ 1, 5 ], [ 1, 8 ], [ 1, 9 ], [ 3, 2 ], [ 3, 1 ], [ 4, 3 ], [ 10, 16 ], [ 10, 17 ], [ 10, 14 ], [ 11, 15 ], [ 11, 18 ], [ 11, 19 ], [ 13, 12 ], [ 13, 11 ], [ 14, 13 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Guy knows Hilda. Joanna knows Arthur. Hilda knows Zach. Roland knows Will. Chance knows Joanna. Will knows Ramona. Erwin knows Brittany. Erwin knows Derrick. Connor knows Melody. Elise knows Kendra. Connor knows Kurt. Kendra knows Chance. Guy knows Roland. Elise knows Irving. Zach knows Connor. Irving knows Arnold. Arnold knows Erwin. Ramona knows Deanna. Which of Kurt and Brittany can Elise reach?", "answer": "Brittany", "steps": [ "Elise knows Irving.", "Irving knows Arnold.", "Arnold knows Erwin.", "Erwin knows Brittany." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Elise", "Erwin", "Kendra", "Arnold", "Chance", "Brittany", "Irving", "Joanna", "Arthur", "Derrick", "Guy", "Connor", "Roland", "Zach", "Will", "Kurt", "Hilda", "Ramona", "Deanna", "Melody" ], "edges": [ [ 0, 2 ], [ 0, 6 ], [ 1, 5 ], [ 1, 9 ], [ 2, 4 ], [ 3, 1 ], [ 4, 7 ], [ 6, 3 ], [ 7, 8 ], [ 10, 12 ], [ 10, 16 ], [ 11, 15 ], [ 11, 19 ], [ 12, 14 ], [ 13, 11 ], [ 14, 17 ], [ 16, 13 ], [ 17, 18 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Fleur knows Hailey. Samantha knows Archer. Loretta knows Charlotte. Hadley knows Burt. Harriet knows Asher. Burt knows Samantha. Fritz knows Hunter. Teresa knows Norman. Harriet knows Allan. Harriet knows Loretta. Hailey knows Lottie. Burt knows Teresa. Amanda knows Hayes. Burt knows Ross. Hayes knows Fritz. Hunter knows Harriet. Lottie knows Hadley. Asher knows Hank. Which of Loretta and Teresa can Amanda reach?", "answer": "Loretta", "steps": [ "Amanda knows Hayes.", "Hayes knows Fritz.", "Fritz knows Hunter.", "Hunter knows Harriet.", "Harriet knows Loretta." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Amanda", "Allan", "Hank", "Hunter", "Harriet", "Loretta", "Asher", "Fritz", "Hayes", "Charlotte", "Fleur", "Ross", "Archer", "Hadley", "Burt", "Teresa", "Samantha", "Lottie", "Hailey", "Norman" ], "edges": [ [ 0, 8 ], [ 3, 4 ], [ 4, 1 ], [ 4, 6 ], [ 4, 5 ], [ 5, 9 ], [ 6, 2 ], [ 7, 3 ], [ 8, 7 ], [ 10, 18 ], [ 13, 14 ], [ 14, 11 ], [ 14, 16 ], [ 14, 15 ], [ 15, 19 ], [ 16, 12 ], [ 17, 13 ], [ 18, 17 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Pauline knows Darius. Mindy knows Chandler. Levi knows Malcolm. Robert knows Pauline. Barry knows Samuel. Rick knows Levi. Leland knows Clinton. Mindy knows Margaret. Robert knows Mindy. Malcolm knows Eldon. Rocco knows Chad. Adele knows Lawrence. Samuel knows Vernon. Leland knows Joseph. Adele knows Barry. Rick knows Robert. Lawrence knows Rocco. Barry knows Leland. Which of Levi and Lawrence can Adele reach?", "answer": "Lawrence", "steps": [ "Adele knows Lawrence." ], "difficulty": 1, "original_distance": 3, "idx_to_symbol": [ "Adele", "Samuel", "Chad", "Leland", "Rocco", "Vernon", "Barry", "Lawrence", "Joseph", "Clinton", "Rick", "Pauline", "Eldon", "Mindy", "Malcolm", "Darius", "Robert", "Levi", "Margaret", "Chandler" ], "edges": [ [ 0, 7 ], [ 0, 6 ], [ 1, 5 ], [ 3, 8 ], [ 3, 9 ], [ 4, 2 ], [ 6, 1 ], [ 6, 3 ], [ 7, 4 ], [ 10, 17 ], [ 10, 16 ], [ 11, 15 ], [ 13, 18 ], [ 13, 19 ], [ 14, 12 ], [ 16, 11 ], [ 16, 13 ], [ 17, 14 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Kay knows Neal. Calvin knows Olive. Gunnar knows Eunice. Burt knows Hunter. Amelia knows Lana. Gunnar knows Russell. Frank knows Gabriel. Russell knows Drew. Burt knows Wilma. Hunter knows Hailey. Drew knows Calvin. Amelia knows Ingrid. Gabriel knows Melody. Ingrid knows Frank. Hunter knows Gunnar. Cassidy knows Bart. Kay knows Amelia. Cassidy knows Kay. Which of Gabriel and Calvin can Cassidy reach?", "answer": "Gabriel", "steps": [ "Cassidy knows Kay.", "Kay knows Amelia.", "Amelia knows Ingrid.", "Ingrid knows Frank.", "Frank knows Gabriel." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Cassidy", "Gabriel", "Kay", "Frank", "Bart", "Melody", "Ingrid", "Neal", "Amelia", "Lana", "Burt", "Calvin", "Hunter", "Drew", "Wilma", "Olive", "Russell", "Hailey", "Gunnar", "Eunice" ], "edges": [ [ 0, 4 ], [ 0, 2 ], [ 1, 5 ], [ 2, 7 ], [ 2, 8 ], [ 3, 1 ], [ 6, 3 ], [ 8, 6 ], [ 8, 9 ], [ 10, 14 ], [ 10, 12 ], [ 11, 15 ], [ 12, 17 ], [ 12, 18 ], [ 13, 11 ], [ 16, 13 ], [ 18, 16 ], [ 18, 19 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Miriam knows Sally. Fisher knows Paige. Wilma knows Mildred. Miriam knows Barbara. Federico knows Alicia. Rosemary knows Willis. Earl knows Jennifer. Jennifer knows Avery. Lorna knows Rosemary. Wilma knows Patrick. Miriam knows Drake. Mildred knows Louis. Barbara knows Natalie. Conner knows Federico. Alicia knows Lorna. Paige knows Earl. Sally knows Fisher. Wilma knows Conner. Which of Paige and Alicia can Wilma reach?", "answer": "Alicia", "steps": [ "Wilma knows Conner.", "Conner knows Federico.", "Federico knows Alicia." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Wilma", "Rosemary", "Willis", "Mildred", "Lorna", "Patrick", "Louis", "Federico", "Alicia", "Conner", "Miriam", "Jennifer", "Avery", "Barbara", "Earl", "Drake", "Natalie", "Fisher", "Paige", "Sally" ], "edges": [ [ 0, 5 ], [ 0, 3 ], [ 0, 9 ], [ 1, 2 ], [ 3, 6 ], [ 4, 1 ], [ 7, 8 ], [ 8, 4 ], [ 9, 7 ], [ 10, 15 ], [ 10, 13 ], [ 10, 19 ], [ 11, 12 ], [ 13, 16 ], [ 14, 11 ], [ 17, 18 ], [ 18, 14 ], [ 19, 17 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Yara knows Andre. Irene knows Shelly. Ilene knows Barry. Kent knows Ivy. Brenda knows Sean. Andre knows Heidi. Shelly knows June. Felicia knows Tanya. Heidi knows Ilene. Jameson knows Angelica. Sean knows Jameson. Tanya knows Irene. Felicia knows Hamilton. June knows Brad. Ilene knows Ezra. June knows Jude. Jameson knows Yara. Ivy knows Felicia. Which of Sean and Ivy can Kent reach?", "answer": "Ivy", "steps": [ "Kent knows Ivy." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Kent", "Shelly", "Irene", "Ivy", "Brad", "Tanya", "June", "Jude", "Felicia", "Hamilton", "Brenda", "Heidi", "Andre", "Sean", "Ezra", "Yara", "Ilene", "Barry", "Jameson", "Angelica" ], "edges": [ [ 0, 3 ], [ 1, 6 ], [ 2, 1 ], [ 3, 8 ], [ 5, 2 ], [ 6, 4 ], [ 6, 7 ], [ 8, 5 ], [ 8, 9 ], [ 10, 13 ], [ 11, 16 ], [ 12, 11 ], [ 13, 18 ], [ 15, 12 ], [ 16, 14 ], [ 16, 17 ], [ 18, 15 ], [ 18, 19 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Kobe knows Hugo. Ellis knows Joshua. Angelica knows Kobe. Ariel knows Luke. Helene knows Earle. Earle knows Jack. Donald knows Clinton. Lyle knows Irving. Lyle knows Holly. Demetrius knows Helene. Lyle knows Ellis. Lyle knows Angelica. Demetrius knows Jesse. Donald knows Ariel. Demetrius knows Donald. Ellis knows Yasmin. Demetrius knows Milo. Yasmin knows Edwin. Which of Yasmin and Ariel can Lyle reach?", "answer": "Yasmin", "steps": [ "Lyle knows Ellis.", "Ellis knows Yasmin." ], "difficulty": 2, "original_distance": 3, "idx_to_symbol": [ "Lyle", "Angelica", "Kobe", "Yasmin", "Hugo", "Ellis", "Holly", "Irving", "Joshua", "Edwin", "Demetrius", "Helene", "Earle", "Ariel", "Jack", "Donald", "Milo", "Jesse", "Clinton", "Luke" ], "edges": [ [ 0, 1 ], [ 0, 6 ], [ 0, 7 ], [ 0, 5 ], [ 1, 2 ], [ 2, 4 ], [ 3, 9 ], [ 5, 8 ], [ 5, 3 ], [ 10, 11 ], [ 10, 16 ], [ 10, 17 ], [ 10, 15 ], [ 11, 12 ], [ 12, 14 ], [ 13, 19 ], [ 15, 18 ], [ 15, 13 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Rowan knows Becky. Electra knows Mindy. Becky knows Ethan. Laura knows Ronald. Caroline knows Deanna. Caroline knows Ricardo. Max knows Henrietta. Becky knows Jane. Mindy knows Caroline. Ronald knows Chandler. Mindy knows Cameron. Rocco knows Max. Ethan knows Anita. Ethan knows Laura. Darren knows Tara. Deanna knows Bailey. Caroline knows Rocco. Ethan knows Darren. Which of Chandler and Henrietta can Rowan reach?", "answer": "Chandler", "steps": [ "Rowan knows Becky.", "Becky knows Ethan.", "Ethan knows Laura.", "Laura knows Ronald.", "Ronald knows Chandler." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Rowan", "Anita", "Darren", "Jane", "Becky", "Tara", "Laura", "Ethan", "Chandler", "Ronald", "Electra", "Ricardo", "Deanna", "Cameron", "Mindy", "Bailey", "Rocco", "Caroline", "Henrietta", "Max" ], "edges": [ [ 0, 4 ], [ 2, 5 ], [ 4, 3 ], [ 4, 7 ], [ 6, 9 ], [ 7, 1 ], [ 7, 2 ], [ 7, 6 ], [ 9, 8 ], [ 10, 14 ], [ 12, 15 ], [ 14, 13 ], [ 14, 17 ], [ 16, 19 ], [ 17, 11 ], [ 17, 12 ], [ 17, 16 ], [ 19, 18 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Leah knows Luz. Clara knows Michelle. Norma knows Corey. Maude knows Estelle. Norma knows Elijah. Nicole knows Leah. Darren knows Rose. Ariel knows Sebastian. Theodore knows Cameron. Ariel knows Clara. Maude knows Norma. Clark knows Adam. Michelle knows Nicole. Clara knows Theodore. Clara knows Trina. Rose knows Clark. Elijah knows Alexa. Norma knows Darren. Which of Clara and Norma can Ariel reach?", "answer": "Clara", "steps": [ "Ariel knows Clara." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Ariel", "Michelle", "Trina", "Cameron", "Sebastian", "Luz", "Clara", "Theodore", "Nicole", "Leah", "Maude", "Darren", "Corey", "Alexa", "Estelle", "Adam", "Norma", "Elijah", "Rose", "Clark" ], "edges": [ [ 0, 4 ], [ 0, 6 ], [ 1, 8 ], [ 6, 2 ], [ 6, 7 ], [ 6, 1 ], [ 7, 3 ], [ 8, 9 ], [ 9, 5 ], [ 10, 14 ], [ 10, 16 ], [ 11, 18 ], [ 16, 12 ], [ 16, 17 ], [ 16, 11 ], [ 17, 13 ], [ 18, 19 ], [ 19, 15 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Sadie knows Darla. Frances knows Sadie. Hayes knows Ruby. Mike knows Hayes. Gina knows Mike. Valerie knows Kylie. Colin knows Valerie. Frances knows Iris. Valerie knows Donald. Charlotte knows Callum. Hayes knows Frances. Phoebe knows Gina. Donald knows Olive. Iris knows Isiah. Riley knows Colin. Walt knows Riley. Donald knows Charlotte. Olive knows Ramon. Which of Mike and Colin can Phoebe reach?", "answer": "Mike", "steps": [ "Phoebe knows Gina.", "Gina knows Mike." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Phoebe", "Ruby", "Isiah", "Darla", "Mike", "Gina", "Sadie", "Iris", "Hayes", "Frances", "Walt", "Kylie", "Callum", "Ramon", "Colin", "Riley", "Olive", "Charlotte", "Valerie", "Donald" ], "edges": [ [ 0, 5 ], [ 4, 8 ], [ 5, 4 ], [ 6, 3 ], [ 7, 2 ], [ 8, 1 ], [ 8, 9 ], [ 9, 6 ], [ 9, 7 ], [ 10, 15 ], [ 14, 18 ], [ 15, 14 ], [ 16, 13 ], [ 17, 12 ], [ 18, 11 ], [ 18, 19 ], [ 19, 16 ], [ 19, 17 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Lorraine knows Hampton. Eve knows Electra. Charles knows Winston. Elaine knows Ember. Julio knows Lorraine. Ember knows Judy. Everett knows Isadora. Francis knows Karina. Ross knows Eve. Clayton knows Charles. India knows Jared. Francis knows Emily. Karina knows Darnell. India knows Clayton. Winston knows Everett. Electra knows Julio. Isadora knows Elaine. Darnell knows Ross. Which of Everett and Eve can India reach?", "answer": "Everett", "steps": [ "India knows Clayton.", "Clayton knows Charles.", "Charles knows Winston.", "Winston knows Everett." ], "difficulty": 4, "original_distance": 8, "idx_to_symbol": [ "India", "Ember", "Everett", "Winston", "Judy", "Jared", "Elaine", "Charles", "Isadora", "Clayton", "Francis", "Lorraine", "Eve", "Ross", "Hampton", "Emily", "Julio", "Darnell", "Electra", "Karina" ], "edges": [ [ 0, 5 ], [ 0, 9 ], [ 1, 4 ], [ 2, 8 ], [ 3, 2 ], [ 6, 1 ], [ 7, 3 ], [ 8, 6 ], [ 9, 7 ], [ 10, 15 ], [ 10, 19 ], [ 11, 14 ], [ 12, 18 ], [ 13, 12 ], [ 16, 11 ], [ 17, 13 ], [ 18, 16 ], [ 19, 17 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Inez knows Della. Della knows Marc. Inez knows Justin. Judith knows Inez. Kirsten knows Zane. Wanda knows Emmett. Irving knows Lenora. Glen knows Kirsten. Glen knows Alicia. Della knows Melody. Irving knows Sierra. Larry knows Yara. Yara knows Hugh. Emmett knows Edmund. Yara knows Irving. Yara knows Wanda. Wanda knows Jeff. Inez knows Glen. Which of Edmund and Zane can Larry reach?", "answer": "Edmund", "steps": [ "Larry knows Yara.", "Yara knows Wanda.", "Wanda knows Emmett.", "Emmett knows Edmund." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Larry", "Emmett", "Hugh", "Sierra", "Irving", "Edmund", "Wanda", "Yara", "Jeff", "Lenora", "Judith", "Kirsten", "Justin", "Marc", "Della", "Zane", "Glen", "Inez", "Alicia", "Melody" ], "edges": [ [ 0, 7 ], [ 1, 5 ], [ 4, 3 ], [ 4, 9 ], [ 6, 1 ], [ 6, 8 ], [ 7, 2 ], [ 7, 6 ], [ 7, 4 ], [ 10, 17 ], [ 11, 15 ], [ 14, 13 ], [ 14, 19 ], [ 16, 11 ], [ 16, 18 ], [ 17, 12 ], [ 17, 16 ], [ 17, 14 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Mike knows Laura. Ursula knows Jeremy. Laura knows Stefan. Greta knows Faye. Blanche knows Leon. Ann knows Bernadette. Dalton knows Derek. August knows Heather. Lorraine knows Tyler. Ursula knows Lorraine. Faye knows Dalton. Parker knows Ann. Faye knows Parker. Leon knows Greta. Tyler knows Mike. Miles knows August. Blanche knows Basil. Mike knows Miles. Which of Tyler and Greta can Blanche reach?", "answer": "Greta", "steps": [ "Blanche knows Leon.", "Leon knows Greta." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Blanche", "Greta", "Bernadette", "Dalton", "Basil", "Parker", "Leon", "Faye", "Ann", "Derek", "Ursula", "Tyler", "Heather", "Laura", "Jeremy", "Miles", "Lorraine", "Mike", "August", "Stefan" ], "edges": [ [ 0, 4 ], [ 0, 6 ], [ 1, 7 ], [ 3, 9 ], [ 5, 8 ], [ 6, 1 ], [ 7, 5 ], [ 7, 3 ], [ 8, 2 ], [ 10, 14 ], [ 10, 16 ], [ 11, 17 ], [ 13, 19 ], [ 15, 18 ], [ 16, 11 ], [ 17, 15 ], [ 17, 13 ], [ 18, 12 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Isla knows Caroline. Hattie knows Bruce. Deirdre knows Chance. Bruce knows Chase. Ford knows Xavier. Andrew knows Laura. Chance knows Nicholas. Chris knows Gunnar. Mara knows Chris. Chris knows Hattie. Bruce knows Andrew. Nicholas knows Greg. Deirdre knows Jem. Hattie knows Knox. Ford knows Deirdre. Isla knows Ford. Chance knows Ronald. Mara knows Brody. Which of Nicholas and Andrew can Isla reach?", "answer": "Nicholas", "steps": [ "Isla knows Ford.", "Ford knows Deirdre.", "Deirdre knows Chance.", "Chance knows Nicholas." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Isla", "Deirdre", "Ronald", "Jem", "Greg", "Chance", "Caroline", "Nicholas", "Ford", "Xavier", "Mara", "Hattie", "Chase", "Knox", "Laura", "Bruce", "Brody", "Andrew", "Chris", "Gunnar" ], "edges": [ [ 0, 6 ], [ 0, 8 ], [ 1, 3 ], [ 1, 5 ], [ 5, 2 ], [ 5, 7 ], [ 7, 4 ], [ 8, 1 ], [ 8, 9 ], [ 10, 16 ], [ 10, 18 ], [ 11, 13 ], [ 11, 15 ], [ 15, 12 ], [ 15, 17 ], [ 17, 14 ], [ 18, 11 ], [ 18, 19 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Magdalena knows Alice. Logan knows Dale. Willis knows Fletcher. Emery knows Farrah. Logan knows Emery. Karina knows Tonya. Estella knows Frida. Nell knows Magdalena. Magdalena knows Eileen. Willis knows Anastasia. Dale knows Constance. Karina knows Estella. Avery knows Willis. Eileen knows Hope. Tonya knows Yuki. Karina knows Avery. Logan knows Nell. Anastasia knows Neville. Which of Willis and Magdalena can Logan reach?", "answer": "Magdalena", "steps": [ "Logan knows Nell.", "Nell knows Magdalena." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Logan", "Nell", "Constance", "Emery", "Hope", "Magdalena", "Alice", "Farrah", "Dale", "Eileen", "Karina", "Avery", "Yuki", "Estella", "Neville", "Willis", "Fletcher", "Frida", "Tonya", "Anastasia" ], "edges": [ [ 0, 3 ], [ 0, 8 ], [ 0, 1 ], [ 1, 5 ], [ 3, 7 ], [ 5, 6 ], [ 5, 9 ], [ 8, 2 ], [ 9, 4 ], [ 10, 13 ], [ 10, 18 ], [ 10, 11 ], [ 11, 15 ], [ 13, 17 ], [ 15, 16 ], [ 15, 19 ], [ 18, 12 ], [ 19, 14 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Demetrius knows Chandler. Corinne knows Omar. Bella knows Kimberly. Javier knows Demetrius. Bryan knows Jude. Herbert knows Claire. Demetrius knows Herbert. Karen knows Eileen. Candice knows Jessica. Leroy knows Candice. Kevin knows Eric. Jude knows Leroy. Eileen knows Javier. Leroy knows Corinne. Corinne knows Drew. Kevin knows Tessa. Javier knows Kevin. Candice knows Bella. Which of Claire and Kimberly can Bryan reach?", "answer": "Kimberly", "steps": [ "Bryan knows Jude.", "Jude knows Leroy.", "Leroy knows Candice.", "Candice knows Bella.", "Bella knows Kimberly." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Bryan", "Bella", "Candice", "Leroy", "Kimberly", "Drew", "Jessica", "Jude", "Corinne", "Omar", "Karen", "Herbert", "Demetrius", "Javier", "Claire", "Tessa", "Chandler", "Eileen", "Kevin", "Eric" ], "edges": [ [ 0, 7 ], [ 1, 4 ], [ 2, 1 ], [ 2, 6 ], [ 3, 2 ], [ 3, 8 ], [ 7, 3 ], [ 8, 5 ], [ 8, 9 ], [ 10, 17 ], [ 11, 14 ], [ 12, 11 ], [ 12, 16 ], [ 13, 12 ], [ 13, 18 ], [ 17, 13 ], [ 18, 15 ], [ 18, 19 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Lisa knows Ruby. Marshall knows Iris. Barney knows Marshall. Ruby knows Aisha. Connor knows Shane. Eamon knows Denise. Marshall knows Justine. Shane knows Andre. Eugene knows Barney. Emily knows Kelsey. Justine knows Eamon. Ruby knows Emily. Holly knows Leland. Andre knows Camden. Willis knows Eugene. Aisha knows Connor. Eugene knows Holly. Connor knows Marcia. Which of Eugene and Ruby can Willis reach?", "answer": "Eugene", "steps": [ "Willis knows Eugene." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Willis", "Denise", "Justine", "Barney", "Eamon", "Holly", "Iris", "Marshall", "Eugene", "Leland", "Lisa", "Camden", "Shane", "Aisha", "Andre", "Emily", "Marcia", "Connor", "Ruby", "Kelsey" ], "edges": [ [ 0, 8 ], [ 2, 4 ], [ 3, 7 ], [ 4, 1 ], [ 5, 9 ], [ 7, 2 ], [ 7, 6 ], [ 8, 3 ], [ 8, 5 ], [ 10, 18 ], [ 12, 14 ], [ 13, 17 ], [ 14, 11 ], [ 15, 19 ], [ 17, 12 ], [ 17, 16 ], [ 18, 13 ], [ 18, 15 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Asher knows Ramon. Aspen knows Ted. Raquel knows Kirk. Theodore knows Dudley. Dudley knows Raquel. Dexter knows Madeline. Dexter knows Camden. Asher knows Dexter. Ainsley knows Tara. Ted knows Adele. Gina knows Cordelia. Cordelia knows Ainsley. Wallace knows Aspen. Raquel knows Alyssa. Ramon knows Gina. August knows Wallace. Dudley knows August. Hubert knows Asher. Which of Tara and Adele can Theodore reach?", "answer": "Adele", "steps": [ "Theodore knows Dudley.", "Dudley knows August.", "August knows Wallace.", "Wallace knows Aspen.", "Aspen knows Ted.", "Ted knows Adele." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Theodore", "Wallace", "Aspen", "Ted", "Dudley", "Adele", "Raquel", "Kirk", "August", "Alyssa", "Hubert", "Gina", "Cordelia", "Ainsley", "Asher", "Tara", "Dexter", "Madeline", "Ramon", "Camden" ], "edges": [ [ 0, 4 ], [ 1, 2 ], [ 2, 3 ], [ 3, 5 ], [ 4, 8 ], [ 4, 6 ], [ 6, 7 ], [ 6, 9 ], [ 8, 1 ], [ 10, 14 ], [ 11, 12 ], [ 12, 13 ], [ 13, 15 ], [ 14, 18 ], [ 14, 16 ], [ 16, 17 ], [ 16, 19 ], [ 18, 11 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Kaleb knows Clark. Louise knows Joyce. Mindy knows Julius. Malcolm knows Rose. Victor knows Kylie. Renee knows Julio. Lucia knows Lana. Victor knows Cynthia. Brock knows Jane. Joyce knows Mindy. Julio knows Malcolm. Victor knows Brock. Lana knows Gary. Joyce knows Ashton. Joyce knows Kaleb. Louise knows Lucia. Kylie knows Annette. Renee knows Victor. Which of Kylie and Kaleb can Renee reach?", "answer": "Kylie", "steps": [ "Renee knows Victor.", "Victor knows Kylie." ], "difficulty": 2, "original_distance": 3, "idx_to_symbol": [ "Renee", "Cynthia", "Rose", "Jane", "Annette", "Malcolm", "Kylie", "Brock", "Julio", "Victor", "Louise", "Ashton", "Gary", "Julius", "Clark", "Lana", "Kaleb", "Mindy", "Lucia", "Joyce" ], "edges": [ [ 0, 8 ], [ 0, 9 ], [ 5, 2 ], [ 6, 4 ], [ 7, 3 ], [ 8, 5 ], [ 9, 1 ], [ 9, 6 ], [ 9, 7 ], [ 10, 18 ], [ 10, 19 ], [ 15, 12 ], [ 16, 14 ], [ 17, 13 ], [ 18, 15 ], [ 19, 11 ], [ 19, 16 ], [ 19, 17 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Rhonda knows Ruth. Daria knows Christian. Christian knows Renee. Morgan knows Dahlia. Marcia knows Ben. Morgan knows Forrest. Oliver knows Morgan. Graeme knows Louise. August knows Emery. Renee knows Graeme. Morgan knows Marcia. Daria knows Brock. Marcia knows Gustavo. Ruth knows Will. Bette knows August. Gustavo knows Bette. Ruth knows Daria. Ruth knows June. Which of Graeme and August can Rhonda reach?", "answer": "Graeme", "steps": [ "Rhonda knows Ruth.", "Ruth knows Daria.", "Daria knows Christian.", "Christian knows Renee.", "Renee knows Graeme." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Rhonda", "Graeme", "Brock", "Christian", "June", "Ruth", "Daria", "Renee", "Will", "Louise", "Oliver", "August", "Ben", "Gustavo", "Dahlia", "Morgan", "Marcia", "Bette", "Forrest", "Emery" ], "edges": [ [ 0, 5 ], [ 1, 9 ], [ 3, 7 ], [ 5, 4 ], [ 5, 8 ], [ 5, 6 ], [ 6, 2 ], [ 6, 3 ], [ 7, 1 ], [ 10, 15 ], [ 11, 19 ], [ 13, 17 ], [ 15, 14 ], [ 15, 18 ], [ 15, 16 ], [ 16, 12 ], [ 16, 13 ], [ 17, 11 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Mia knows Cara. Wesley knows Elvis. Vera knows Byron. Bailey knows Kay. Elvis knows Drew. Deborah knows Brian. Vera knows Andrea. Elena knows Vera. Byron knows Jason. Elvis knows Jerry. Kay knows Wesley. Leonard knows Axel. Deborah knows Elena. Byron knows Bernadette. Wesley knows Celeste. Bailey knows Vance. Byron knows Leonard. Elvis knows Mia. Which of Wesley and Vera can Deborah reach?", "answer": "Vera", "steps": [ "Deborah knows Elena.", "Elena knows Vera." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Deborah", "Vera", "Axel", "Andrea", "Leonard", "Bernadette", "Byron", "Elena", "Jason", "Brian", "Bailey", "Wesley", "Cara", "Celeste", "Mia", "Drew", "Elvis", "Kay", "Jerry", "Vance" ], "edges": [ [ 0, 7 ], [ 0, 9 ], [ 1, 3 ], [ 1, 6 ], [ 4, 2 ], [ 6, 4 ], [ 6, 5 ], [ 6, 8 ], [ 7, 1 ], [ 10, 17 ], [ 10, 19 ], [ 11, 13 ], [ 11, 16 ], [ 14, 12 ], [ 16, 14 ], [ 16, 15 ], [ 16, 18 ], [ 17, 11 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Leah knows Judith. Ernesto knows Diana. Judith knows Cody. Eamon knows Leah. Don knows Ariana. Diana knows Lacey. Wyatt knows Lisette. Maude knows Brian. Fernando knows Edmund. Eamon knows Jason. Marion knows Don. Leah knows Maude. Lacey knows Eamon. Fernando knows Jenna. Ariana knows Fernando. Edmund knows Wyatt. Bernadette knows Dudley. Edmund knows Bernadette. Which of Judith and Wyatt can Ernesto reach?", "answer": "Judith", "steps": [ "Ernesto knows Diana.", "Diana knows Lacey.", "Lacey knows Eamon.", "Eamon knows Leah.", "Leah knows Judith." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Ernesto", "Leah", "Diana", "Cody", "Jason", "Maude", "Lacey", "Brian", "Judith", "Eamon", "Marion", "Edmund", "Don", "Lisette", "Jenna", "Bernadette", "Ariana", "Dudley", "Wyatt", "Fernando" ], "edges": [ [ 0, 2 ], [ 1, 5 ], [ 1, 8 ], [ 2, 6 ], [ 5, 7 ], [ 6, 9 ], [ 8, 3 ], [ 9, 4 ], [ 9, 1 ], [ 10, 12 ], [ 11, 15 ], [ 11, 18 ], [ 12, 16 ], [ 15, 17 ], [ 16, 19 ], [ 18, 13 ], [ 19, 14 ], [ 19, 11 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Keira knows Humphrey. Lillian knows Federico. Walter knows Zach. Harold knows Eileen. Zach knows Griffith. Lacey knows Leroy. Eileen knows Carla. Eugene knows Harold. Lorraine knows Eugene. Humphrey knows Russ. Forrest knows Demetrius. Griffith knows Lillian. Leroy knows Forrest. Demetrius knows Jameson. Keith knows Elias. Elias knows Keira. Humphrey knows Lacey. Eileen knows Walter. Which of Zach and Leroy can Lorraine reach?", "answer": "Zach", "steps": [ "Lorraine knows Eugene.", "Eugene knows Harold.", "Harold knows Eileen.", "Eileen knows Walter.", "Walter knows Zach." ], "difficulty": 5, "original_distance": 8, "idx_to_symbol": [ "Lorraine", "Harold", "Zach", "Federico", "Eugene", "Griffith", "Eileen", "Lillian", "Walter", "Carla", "Keith", "Keira", "Leroy", "Jameson", "Elias", "Forrest", "Humphrey", "Demetrius", "Lacey", "Russ" ], "edges": [ [ 0, 4 ], [ 1, 6 ], [ 2, 5 ], [ 4, 1 ], [ 5, 7 ], [ 6, 8 ], [ 6, 9 ], [ 7, 3 ], [ 8, 2 ], [ 10, 14 ], [ 11, 16 ], [ 12, 15 ], [ 14, 11 ], [ 15, 17 ], [ 16, 18 ], [ 16, 19 ], [ 17, 13 ], [ 18, 12 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Sadie knows Brynn. Marco knows Eve. Haley knows Sadie. Stefan knows Dee. Valerie knows Bonnie. Morris knows Susanne. Bonnie knows Elvira. Amy knows Jodi. Cameron knows Amy. Cordelia knows Haley. Dee knows Eli. Sadie knows Deborah. Fergus knows Zachary. Amy knows Stefan. Marco knows Cameron. Deborah knows Morris. Zachary knows Marco. Morris knows Valerie. Which of Eli and Elvira can Cordelia reach?", "answer": "Elvira", "steps": [ "Cordelia knows Haley.", "Haley knows Sadie.", "Sadie knows Deborah.", "Deborah knows Morris.", "Morris knows Valerie.", "Valerie knows Bonnie.", "Bonnie knows Elvira." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Cordelia", "Elvira", "Brynn", "Susanne", "Sadie", "Valerie", "Morris", "Bonnie", "Haley", "Deborah", "Fergus", "Eli", "Eve", "Jodi", "Marco", "Stefan", "Amy", "Dee", "Zachary", "Cameron" ], "edges": [ [ 0, 8 ], [ 4, 2 ], [ 4, 9 ], [ 5, 7 ], [ 6, 3 ], [ 6, 5 ], [ 7, 1 ], [ 8, 4 ], [ 9, 6 ], [ 10, 18 ], [ 14, 12 ], [ 14, 19 ], [ 15, 17 ], [ 16, 13 ], [ 16, 15 ], [ 17, 11 ], [ 18, 14 ], [ 19, 16 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Bennett knows Carla. Violet knows Albert. Violet knows Nicole. Henry knows Kareem. Adele knows Walter. Beatrice knows Hayley. Kareem knows Bernard. Albert knows Terrence. Bruno knows Hubert. Ronald knows Jeremy. Henry knows Tamara. Bruno knows Ronald. Doris knows Erma. Nicole knows Bennett. Hayley knows Adele. Bernard knows Beatrice. Beatrice knows Doris. Jeremy knows Violet. Which of Adele and Bennett can Bruno reach?", "answer": "Bennett", "steps": [ "Bruno knows Ronald.", "Ronald knows Jeremy.", "Jeremy knows Violet.", "Violet knows Nicole.", "Nicole knows Bennett." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Bruno", "Ronald", "Jeremy", "Violet", "Bennett", "Terrence", "Carla", "Hubert", "Nicole", "Albert", "Henry", "Kareem", "Bernard", "Beatrice", "Adele", "Erma", "Walter", "Tamara", "Hayley", "Doris" ], "edges": [ [ 0, 7 ], [ 0, 1 ], [ 1, 2 ], [ 2, 3 ], [ 3, 8 ], [ 3, 9 ], [ 4, 6 ], [ 8, 4 ], [ 9, 5 ], [ 10, 17 ], [ 10, 11 ], [ 11, 12 ], [ 12, 13 ], [ 13, 18 ], [ 13, 19 ], [ 14, 16 ], [ 18, 14 ], [ 19, 15 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Ellen knows Warren. Joaquin knows Gina. Emanuel knows Gustavo. Ken knows Martha. Carter knows Jem. Dennis knows Alma. Gina knows Isaac. Jules knows Ken. Ken knows Ellen. Erma knows Jules. Calvin knows Theodore. Jules knows Emanuel. Warren knows Lily. Lily knows Jack. Joaquin knows Dennis. Julius knows Joaquin. Gina knows Carter. Jem knows Calvin. Which of Carter and Ellen can Erma reach?", "answer": "Ellen", "steps": [ "Erma knows Jules.", "Jules knows Ken.", "Ken knows Ellen." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Erma", "Warren", "Gustavo", "Ken", "Jules", "Ellen", "Martha", "Jack", "Lily", "Emanuel", "Julius", "Jem", "Alma", "Gina", "Joaquin", "Carter", "Isaac", "Theodore", "Calvin", "Dennis" ], "edges": [ [ 0, 4 ], [ 1, 8 ], [ 3, 6 ], [ 3, 5 ], [ 4, 3 ], [ 4, 9 ], [ 5, 1 ], [ 8, 7 ], [ 9, 2 ], [ 10, 14 ], [ 11, 18 ], [ 13, 16 ], [ 13, 15 ], [ 14, 13 ], [ 14, 19 ], [ 15, 11 ], [ 18, 17 ], [ 19, 12 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Nicholas knows Elsa. Joaquin knows Allen. Fiona knows Joyce. Fiona knows Pablo. Kathleen knows Claudia. Claudia knows Hilda. Peter knows Ashley. Lana knows Alfonso. Yvonne knows Nicholas. Dwight knows Greg. Kathleen knows Lana. Joyce knows Dwight. Yvonne knows Kathleen. Hilda knows Marshall. Claudia knows Jerry. Pablo knows Vicki. Joyce knows Peter. Dwight knows Joaquin. Which of Allen and Marshall can Fiona reach?", "answer": "Allen", "steps": [ "Fiona knows Joyce.", "Joyce knows Dwight.", "Dwight knows Joaquin.", "Joaquin knows Allen." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Fiona", "Ashley", "Dwight", "Pablo", "Vicki", "Joyce", "Joaquin", "Greg", "Peter", "Allen", "Yvonne", "Alfonso", "Claudia", "Nicholas", "Elsa", "Kathleen", "Hilda", "Jerry", "Lana", "Marshall" ], "edges": [ [ 0, 3 ], [ 0, 5 ], [ 2, 7 ], [ 2, 6 ], [ 3, 4 ], [ 5, 8 ], [ 5, 2 ], [ 6, 9 ], [ 8, 1 ], [ 10, 13 ], [ 10, 15 ], [ 12, 17 ], [ 12, 16 ], [ 13, 14 ], [ 15, 18 ], [ 15, 12 ], [ 16, 19 ], [ 18, 11 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Coral knows Axel. Roman knows Houston. Carey knows Gertrude. Dick knows Roy. Carey knows Imogen. Axel knows Effie. Julio knows Roman. Julio knows Hugh. Imogen knows Sandra. Houston knows Coral. Jeanne knows Laurel. Julio knows Mike. Melanie knows Mark. Roy knows Leah. Sandra knows Teresa. Mike knows Jeanne. Carey knows Melanie. Mark knows Dick. Which of Houston and Mark can Carey reach?", "answer": "Mark", "steps": [ "Carey knows Melanie.", "Melanie knows Mark." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Carey", "Mark", "Roy", "Teresa", "Melanie", "Dick", "Sandra", "Leah", "Gertrude", "Imogen", "Julio", "Houston", "Axel", "Laurel", "Roman", "Coral", "Jeanne", "Effie", "Hugh", "Mike" ], "edges": [ [ 0, 4 ], [ 0, 8 ], [ 0, 9 ], [ 1, 5 ], [ 2, 7 ], [ 4, 1 ], [ 5, 2 ], [ 6, 3 ], [ 9, 6 ], [ 10, 14 ], [ 10, 18 ], [ 10, 19 ], [ 11, 15 ], [ 12, 17 ], [ 14, 11 ], [ 15, 12 ], [ 16, 13 ], [ 19, 16 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Leah knows Luz. Clara knows Michelle. Norma knows Corey. Maude knows Estelle. Norma knows Elijah. Nicole knows Leah. Darren knows Rose. Ariel knows Sebastian. Theodore knows Cameron. Ariel knows Clara. Maude knows Norma. Clark knows Adam. Michelle knows Nicole. Clara knows Theodore. Clara knows Trina. Rose knows Clark. Elijah knows Alexa. Norma knows Darren. Which of Rose and Nicole can Ariel reach?", "answer": "Nicole", "steps": [ "Ariel knows Clara.", "Clara knows Michelle.", "Michelle knows Nicole." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Ariel", "Michelle", "Trina", "Cameron", "Sebastian", "Luz", "Clara", "Theodore", "Nicole", "Leah", "Maude", "Darren", "Corey", "Alexa", "Estelle", "Adam", "Norma", "Elijah", "Rose", "Clark" ], "edges": [ [ 0, 4 ], [ 0, 6 ], [ 1, 8 ], [ 6, 2 ], [ 6, 7 ], [ 6, 1 ], [ 7, 3 ], [ 8, 9 ], [ 9, 5 ], [ 10, 14 ], [ 10, 16 ], [ 11, 18 ], [ 16, 12 ], [ 16, 17 ], [ 16, 11 ], [ 17, 13 ], [ 18, 19 ], [ 19, 15 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Geraldine knows Claudia. Michelle knows Carlos. Geraldine knows Cecilia. Arnold knows Grace. Michelle knows Marlene. Arnold knows Marco. Marco knows Trudy. Michelle knows Roy. Trudy knows Mabel. Houston knows Caroline. Arnold knows Houston. Trudy knows Elliot. Marco knows Edison. Marlene knows Jeremy. Marlene knows Geraldine. Roy knows Greta. Arnold knows Jerome. Michelle knows Denver. Which of Marco and Marlene can Arnold reach?", "answer": "Marco", "steps": [ "Arnold knows Marco." ], "difficulty": 1, "original_distance": 3, "idx_to_symbol": [ "Arnold", "Houston", "Caroline", "Trudy", "Jerome", "Grace", "Marco", "Edison", "Mabel", "Elliot", "Michelle", "Roy", "Greta", "Geraldine", "Carlos", "Denver", "Marlene", "Jeremy", "Claudia", "Cecilia" ], "edges": [ [ 0, 1 ], [ 0, 4 ], [ 0, 5 ], [ 0, 6 ], [ 1, 2 ], [ 3, 8 ], [ 3, 9 ], [ 6, 7 ], [ 6, 3 ], [ 10, 11 ], [ 10, 14 ], [ 10, 15 ], [ 10, 16 ], [ 11, 12 ], [ 13, 18 ], [ 13, 19 ], [ 16, 17 ], [ 16, 13 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Verna knows August. Ben knows Cristina. Warren knows Celia. Jacqueline knows Keira. Sara knows Byron. Jacqueline knows Daphne. Byron knows Verna. Ben knows Dewey. Byron knows Jacqueline. Emery knows Warren. Emery knows Ben. Aisha knows Tara. Lucille knows Aisha. Jacqueline knows Marie. Marie knows Itzel. Itzel knows Rebecca. Ben knows Lucille. Calvin knows Emery. Which of Byron and Emery can Calvin reach?", "answer": "Emery", "steps": [ "Calvin knows Emery." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Calvin", "Dewey", "Celia", "Cristina", "Aisha", "Warren", "Emery", "Tara", "Lucille", "Ben", "Sara", "Keira", "August", "Daphne", "Itzel", "Verna", "Byron", "Rebecca", "Marie", "Jacqueline" ], "edges": [ [ 0, 6 ], [ 4, 7 ], [ 5, 2 ], [ 6, 5 ], [ 6, 9 ], [ 8, 4 ], [ 9, 1 ], [ 9, 3 ], [ 9, 8 ], [ 10, 16 ], [ 14, 17 ], [ 15, 12 ], [ 16, 15 ], [ 16, 19 ], [ 18, 14 ], [ 19, 11 ], [ 19, 13 ], [ 19, 18 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Emmett knows Darnell. Patrick knows Felicia. Gideon knows Kurt. Emmett knows Tristan. Emmett knows Patrick. Pearl knows Emmett. Davis knows Calvin. Calvin knows Frida. Lorenzo knows Fanny. Calvin knows Sean. Troy knows Davis. Carrie knows Gideon. Carrie knows Samantha. Travis knows Wanda. Lorenzo knows Pearl. Wanda knows Lorenzo. Sean knows Carrie. Carrie knows Benjamin. Which of Carrie and Emmett can Travis reach?", "answer": "Emmett", "steps": [ "Travis knows Wanda.", "Wanda knows Lorenzo.", "Lorenzo knows Pearl.", "Pearl knows Emmett." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Travis", "Emmett", "Felicia", "Wanda", "Darnell", "Lorenzo", "Pearl", "Patrick", "Fanny", "Tristan", "Troy", "Carrie", "Kurt", "Davis", "Benjamin", "Calvin", "Sean", "Gideon", "Frida", "Samantha" ], "edges": [ [ 0, 3 ], [ 1, 4 ], [ 1, 7 ], [ 1, 9 ], [ 3, 5 ], [ 5, 8 ], [ 5, 6 ], [ 6, 1 ], [ 7, 2 ], [ 10, 13 ], [ 11, 14 ], [ 11, 17 ], [ 11, 19 ], [ 13, 15 ], [ 15, 18 ], [ 15, 16 ], [ 16, 11 ], [ 17, 12 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Tracy knows Chris. Angela knows Joan. Julia knows Rose. Kennedy knows Aldo. Tracy knows Damien. Antonio knows Angela. Joan knows Kennedy. Rose knows Jonathan. Cornelius knows Janice. Kennedy knows Lance. Kennedy knows Cornelius. Tracy knows Donald. Rose knows Gloria. Antonio knows Lenora. Gloria knows Guillermo. Guillermo knows Tracy. Chris knows Langston. Bert knows Antonio. Which of Langston and Janice can Julia reach?", "answer": "Langston", "steps": [ "Julia knows Rose.", "Rose knows Gloria.", "Gloria knows Guillermo.", "Guillermo knows Tracy.", "Tracy knows Chris.", "Chris knows Langston." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Julia", "Guillermo", "Jonathan", "Tracy", "Donald", "Langston", "Rose", "Chris", "Damien", "Gloria", "Bert", "Joan", "Lenora", "Kennedy", "Aldo", "Janice", "Antonio", "Cornelius", "Lance", "Angela" ], "edges": [ [ 0, 6 ], [ 1, 3 ], [ 3, 4 ], [ 3, 7 ], [ 3, 8 ], [ 6, 2 ], [ 6, 9 ], [ 7, 5 ], [ 9, 1 ], [ 10, 16 ], [ 11, 13 ], [ 13, 14 ], [ 13, 17 ], [ 13, 18 ], [ 16, 12 ], [ 16, 19 ], [ 17, 15 ], [ 19, 11 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Henry knows Juan. Isiah knows Henry. Emmett knows Chantal. Daniella knows Theodore. Eamon knows Heath. Glenn knows Zack. Daniella knows Karl. Victor knows Daniella. Chantal knows Whitney. Barbara knows Emmett. Eamon knows Grace. Nelson knows Isabel. Isiah knows Victor. Daniella knows Kennedy. Whitney knows Eamon. Isabel knows Isiah. Eamon knows Joaquin. Chantal knows Glenn. Which of Chantal and Isiah can Nelson reach?", "answer": "Isiah", "steps": [ "Nelson knows Isabel.", "Isabel knows Isiah." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Nelson", "Juan", "Victor", "Isiah", "Theodore", "Kennedy", "Henry", "Isabel", "Daniella", "Karl", "Barbara", "Zack", "Whitney", "Chantal", "Joaquin", "Heath", "Glenn", "Emmett", "Eamon", "Grace" ], "edges": [ [ 0, 7 ], [ 2, 8 ], [ 3, 6 ], [ 3, 2 ], [ 6, 1 ], [ 7, 3 ], [ 8, 4 ], [ 8, 5 ], [ 8, 9 ], [ 10, 17 ], [ 12, 18 ], [ 13, 16 ], [ 13, 12 ], [ 16, 11 ], [ 17, 13 ], [ 18, 14 ], [ 18, 15 ], [ 18, 19 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Dalton knows Lara. Dalton knows Simon. Leland knows Jeremy. Autumn knows Rick. Jeremy knows Esperanza. Lara knows Geneva. Adele knows Isla. Geneva knows Darla. Isla knows Helene. Fletcher knows Ivy. Helene knows Dalton. Dalton knows Daphna. Daphna knows Federico. Jeremy knows Kai. Yuki knows Leland. Jeremy knows Autumn. Sue knows Yuki. Esperanza knows Fletcher. Which of Isla and Yuki can Sue reach?", "answer": "Yuki", "steps": [ "Sue knows Yuki." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Sue", "Leland", "Esperanza", "Kai", "Fletcher", "Yuki", "Rick", "Jeremy", "Ivy", "Autumn", "Adele", "Helene", "Lara", "Simon", "Geneva", "Isla", "Federico", "Dalton", "Darla", "Daphna" ], "edges": [ [ 0, 5 ], [ 1, 7 ], [ 2, 4 ], [ 4, 8 ], [ 5, 1 ], [ 7, 3 ], [ 7, 2 ], [ 7, 9 ], [ 9, 6 ], [ 10, 15 ], [ 11, 17 ], [ 12, 14 ], [ 14, 18 ], [ 15, 11 ], [ 17, 13 ], [ 17, 12 ], [ 17, 19 ], [ 19, 16 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Hadley knows Melanie. Alma knows Ignacio. Tabitha knows Chance. Gwen knows Abigail. Luke knows Chloe. Luz knows Henrietta. Gerard knows Levi. Ignacio knows Horace. Levi knows Alma. Mason knows Bernard. Gerard knows Tracy. Melanie knows Gwen. Levi knows Tabitha. Bernard knows Victor. Luke knows Hadley. Hadley knows Adelaide. Melanie knows Mason. Luz knows Gerard. Which of Melanie and Levi can Luke reach?", "answer": "Melanie", "steps": [ "Luke knows Hadley.", "Hadley knows Melanie." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Luke", "Mason", "Hadley", "Gwen", "Bernard", "Chloe", "Victor", "Adelaide", "Melanie", "Abigail", "Luz", "Alma", "Gerard", "Tabitha", "Ignacio", "Henrietta", "Horace", "Tracy", "Levi", "Chance" ], "edges": [ [ 0, 5 ], [ 0, 2 ], [ 1, 4 ], [ 2, 7 ], [ 2, 8 ], [ 3, 9 ], [ 4, 6 ], [ 8, 1 ], [ 8, 3 ], [ 10, 15 ], [ 10, 12 ], [ 11, 14 ], [ 12, 17 ], [ 12, 18 ], [ 13, 19 ], [ 14, 16 ], [ 18, 11 ], [ 18, 13 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Hadley knows Sandy. Brooks knows Brody. Nancy knows Gladys. Brooks knows Frankie. Celia knows Brooks. Sandy knows Hendrix. Bert knows Beatrice. Brody knows Geneva. Nancy knows Gus. Nancy knows Sebastian. Beatrice knows Nancy. Frankie knows Hadley. Eunice knows Martha. Martha knows Finn. Brody knows Logan. Brody knows Colby. Beatrice knows Amanda. Amanda knows Eunice. Which of Martha and Sandy can Celia reach?", "answer": "Sandy", "steps": [ "Celia knows Brooks.", "Brooks knows Frankie.", "Frankie knows Hadley.", "Hadley knows Sandy." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Celia", "Frankie", "Logan", "Geneva", "Hadley", "Brody", "Sandy", "Hendrix", "Brooks", "Colby", "Bert", "Amanda", "Gus", "Gladys", "Eunice", "Nancy", "Martha", "Finn", "Beatrice", "Sebastian" ], "edges": [ [ 0, 8 ], [ 1, 4 ], [ 4, 6 ], [ 5, 2 ], [ 5, 3 ], [ 5, 9 ], [ 6, 7 ], [ 8, 1 ], [ 8, 5 ], [ 10, 18 ], [ 11, 14 ], [ 14, 16 ], [ 15, 12 ], [ 15, 13 ], [ 15, 19 ], [ 16, 17 ], [ 18, 11 ], [ 18, 15 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Billy knows Crystal. Alyson knows Erwin. Alyson knows Billy. Billy knows Gail. Claire knows Fiona. Justine knows Demetrius. Sharon knows Edith. Alyson knows Justine. Crystal knows Magdalena. Sharon knows Jules. Edith knows Carey. Claire knows Greta. Claire knows Wade. Sharon knows Claire. Justine knows Josie. Fiona knows Levi. Edith knows Myra. Billy knows Matthew. Which of Crystal and Fiona can Alyson reach?", "answer": "Crystal", "steps": [ "Alyson knows Billy.", "Billy knows Crystal." ], "difficulty": 2, "original_distance": 3, "idx_to_symbol": [ "Alyson", "Matthew", "Erwin", "Magdalena", "Billy", "Josie", "Justine", "Crystal", "Demetrius", "Gail", "Sharon", "Wade", "Jules", "Levi", "Claire", "Myra", "Edith", "Fiona", "Carey", "Greta" ], "edges": [ [ 0, 2 ], [ 0, 6 ], [ 0, 4 ], [ 4, 1 ], [ 4, 7 ], [ 4, 9 ], [ 6, 5 ], [ 6, 8 ], [ 7, 3 ], [ 10, 12 ], [ 10, 16 ], [ 10, 14 ], [ 14, 11 ], [ 14, 17 ], [ 14, 19 ], [ 16, 15 ], [ 16, 18 ], [ 17, 13 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Cecilia knows Angelica. Ainsley knows Monroe. Angelica knows Aisha. Ainsley knows Simon. Aisha knows India. Tamara knows Edwin. Darcy knows Verna. Angelica knows Vivian. Vivian knows Emmett. Simon knows Darcy. Aisha knows Clayton. Clayton knows Belinda. Jeremy knows Ainsley. Darcy knows Horace. Colleen knows Cecilia. Verna knows Nadine. Simon knows Tamara. Cecilia knows Elsa. Which of Nadine and Belinda can Jeremy reach?", "answer": "Nadine", "steps": [ "Jeremy knows Ainsley.", "Ainsley knows Simon.", "Simon knows Darcy.", "Darcy knows Verna.", "Verna knows Nadine." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Jeremy", "Verna", "Nadine", "Horace", "Darcy", "Monroe", "Ainsley", "Tamara", "Simon", "Edwin", "Colleen", "Clayton", "Belinda", "India", "Aisha", "Elsa", "Cecilia", "Vivian", "Angelica", "Emmett" ], "edges": [ [ 0, 6 ], [ 1, 2 ], [ 4, 1 ], [ 4, 3 ], [ 6, 5 ], [ 6, 8 ], [ 7, 9 ], [ 8, 4 ], [ 8, 7 ], [ 10, 16 ], [ 11, 12 ], [ 14, 11 ], [ 14, 13 ], [ 16, 15 ], [ 16, 18 ], [ 17, 19 ], [ 18, 14 ], [ 18, 17 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Joshua knows Vicki. Arlene knows Kendrick. Clifford knows Belinda. Elliot knows Brody. Hope knows Faith. Devon knows Farrah. Michelle knows Elliot. Trevor knows Hope. Farrah knows Joshua. Kendrick knows Randall. Dennis knows Gary. Henry knows Trevor. Tabitha knows Arlene. Michelle knows Tabitha. Dennis knows Devon. Belinda knows Michelle. Clifford knows Hal. Farrah knows Henry. Which of Henry and Tabitha can Clifford reach?", "answer": "Tabitha", "steps": [ "Clifford knows Belinda.", "Belinda knows Michelle.", "Michelle knows Tabitha." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Clifford", "Tabitha", "Kendrick", "Hal", "Belinda", "Elliot", "Michelle", "Randall", "Arlene", "Brody", "Dennis", "Henry", "Hope", "Gary", "Devon", "Joshua", "Farrah", "Faith", "Trevor", "Vicki" ], "edges": [ [ 0, 3 ], [ 0, 4 ], [ 1, 8 ], [ 2, 7 ], [ 4, 6 ], [ 5, 9 ], [ 6, 1 ], [ 6, 5 ], [ 8, 2 ], [ 10, 13 ], [ 10, 14 ], [ 11, 18 ], [ 12, 17 ], [ 14, 16 ], [ 15, 19 ], [ 16, 11 ], [ 16, 15 ], [ 18, 12 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Melissa knows Ruby. Darin knows Myrtle. Norman knows Melissa. Darin knows Leopold. Ida knows Joyce. Doris knows Malik. Myrtle knows Kamila. Kamila knows Norman. Joyce knows Louis. Jenny knows Leslie. Yvonne knows Wesley. Leslie knows Ida. Malik knows Darin. Malik knows Cain. Louis knows Yvonne. Clement knows Jenny. Jenny knows Forrest. Leslie knows Jolene. Which of Yvonne and Melissa can Doris reach?", "answer": "Melissa", "steps": [ "Doris knows Malik.", "Malik knows Darin.", "Darin knows Myrtle.", "Myrtle knows Kamila.", "Kamila knows Norman.", "Norman knows Melissa." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Doris", "Kamila", "Myrtle", "Malik", "Leopold", "Darin", "Melissa", "Ruby", "Norman", "Cain", "Clement", "Joyce", "Ida", "Jenny", "Jolene", "Leslie", "Yvonne", "Wesley", "Louis", "Forrest" ], "edges": [ [ 0, 3 ], [ 1, 8 ], [ 2, 1 ], [ 3, 5 ], [ 3, 9 ], [ 5, 4 ], [ 5, 2 ], [ 6, 7 ], [ 8, 6 ], [ 10, 13 ], [ 11, 18 ], [ 12, 11 ], [ 13, 15 ], [ 13, 19 ], [ 15, 14 ], [ 15, 12 ], [ 16, 17 ], [ 18, 16 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Jack knows Gavin. Davis knows Allan. Darrell knows Anthony. Jack knows Whitney. Dora knows Lynn. Federico knows Ignacio. Federico knows Demetrius. Anthony knows Martha. Jack knows Jaime. Dora knows Renee. Virginia knows Jack. Anthony knows Jonah. Whitney knows Dora. Faye knows Jean. Allan knows Virginia. Anthony knows Clement. Jean knows Darrell. Martha knows Federico. Which of Jean and Allan can Faye reach?", "answer": "Jean", "steps": [ "Faye knows Jean." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Faye", "Jonah", "Jean", "Martha", "Darrell", "Clement", "Federico", "Ignacio", "Anthony", "Demetrius", "Davis", "Gavin", "Allan", "Whitney", "Virginia", "Jaime", "Dora", "Lynn", "Jack", "Renee" ], "edges": [ [ 0, 2 ], [ 2, 4 ], [ 3, 6 ], [ 4, 8 ], [ 6, 7 ], [ 6, 9 ], [ 8, 1 ], [ 8, 5 ], [ 8, 3 ], [ 10, 12 ], [ 12, 14 ], [ 13, 16 ], [ 14, 18 ], [ 16, 17 ], [ 16, 19 ], [ 18, 11 ], [ 18, 15 ], [ 18, 13 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Gonzalo knows Luella. Linda knows Tyler. Ted knows Kimberly. Joshua knows Ian. Rena knows Kate. Autumn knows Kenneth. Ted knows Zelda. Kimberly knows Esme. Tyler knows Rena. Gonzalo knows Joshua. Tyler knows Hayden. Esme knows Winifred. Allison knows Cecilia. Alma knows Sally. Kenneth knows Alma. Winifred knows Linda. Sally knows Gonzalo. Allison knows Autumn. Which of Rena and Joshua can Ted reach?", "answer": "Rena", "steps": [ "Ted knows Kimberly.", "Kimberly knows Esme.", "Esme knows Winifred.", "Winifred knows Linda.", "Linda knows Tyler.", "Tyler knows Rena." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Ted", "Hayden", "Tyler", "Kimberly", "Kate", "Esme", "Linda", "Rena", "Zelda", "Winifred", "Allison", "Luella", "Gonzalo", "Autumn", "Ian", "Kenneth", "Sally", "Joshua", "Cecilia", "Alma" ], "edges": [ [ 0, 8 ], [ 0, 3 ], [ 2, 1 ], [ 2, 7 ], [ 3, 5 ], [ 5, 9 ], [ 6, 2 ], [ 7, 4 ], [ 9, 6 ], [ 10, 18 ], [ 10, 13 ], [ 12, 11 ], [ 12, 17 ], [ 13, 15 ], [ 15, 19 ], [ 16, 12 ], [ 17, 14 ], [ 19, 16 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Matt knows Christopher. Porter knows Clarence. Selena knows Conrad. Porter knows Amanda. Alyssa knows Julian. Earle knows Delilah. Daisy knows Linda. Delilah knows Hope. Isabel knows Nash. Alyssa knows Matt. Matt knows Selena. Julian knows Merle. Amanda knows Lawrence. Clarence knows Daisy. Christopher knows Earle. Isabel knows Porter. Nash knows Yolanda. Linda knows Mack. Which of Hope and Mack can Isabel reach?", "answer": "Mack", "steps": [ "Isabel knows Porter.", "Porter knows Clarence.", "Clarence knows Daisy.", "Daisy knows Linda.", "Linda knows Mack." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Isabel", "Lawrence", "Yolanda", "Porter", "Clarence", "Daisy", "Nash", "Linda", "Mack", "Amanda", "Alyssa", "Conrad", "Merle", "Matt", "Christopher", "Earle", "Julian", "Delilah", "Hope", "Selena" ], "edges": [ [ 0, 6 ], [ 0, 3 ], [ 3, 4 ], [ 3, 9 ], [ 4, 5 ], [ 5, 7 ], [ 6, 2 ], [ 7, 8 ], [ 9, 1 ], [ 10, 16 ], [ 10, 13 ], [ 13, 14 ], [ 13, 19 ], [ 14, 15 ], [ 15, 17 ], [ 16, 12 ], [ 17, 18 ], [ 19, 11 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Daria knows Adelaide. Philip knows Anita. Griffith knows Iris. Russell knows Max. Katrina knows Melody. Katrina knows Xander. Avery knows Daria. Melody knows Griffith. Basil knows Autumn. Ken knows Harrison. Max knows Basil. Iris knows Philip. Hal knows Aisha. Daria knows Russell. Aisha knows Katrina. Hal knows Josie. Ken knows Avery. Autumn knows Elliot. Which of Max and Griffith can Ken reach?", "answer": "Max", "steps": [ "Ken knows Avery.", "Avery knows Daria.", "Daria knows Russell.", "Russell knows Max." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Ken", "Russell", "Elliot", "Harrison", "Basil", "Adelaide", "Max", "Avery", "Daria", "Autumn", "Hal", "Melody", "Anita", "Josie", "Iris", "Xander", "Griffith", "Aisha", "Katrina", "Philip" ], "edges": [ [ 0, 3 ], [ 0, 7 ], [ 1, 6 ], [ 4, 9 ], [ 6, 4 ], [ 7, 8 ], [ 8, 5 ], [ 8, 1 ], [ 9, 2 ], [ 10, 13 ], [ 10, 17 ], [ 11, 16 ], [ 14, 19 ], [ 16, 14 ], [ 17, 18 ], [ 18, 15 ], [ 18, 11 ], [ 19, 12 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Cassidy knows Jack. Ida knows Kay. Sybil knows Cassidy. Humphrey knows Ida. Ida knows Paige. Hubert knows Jeffery. Ernie knows Francesca. Chad knows Ilene. Kay knows Gideon. Kay knows Knox. Humphrey knows Destiny. Cassidy knows Chad. Humphrey knows Hubert. Sybil knows Kingsley. Gideon knows Arden. Phoebe knows Kenneth. Ernie knows Phoebe. Ernie knows Sybil. Which of Sybil and Ida can Humphrey reach?", "answer": "Ida", "steps": [ "Humphrey knows Ida." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Humphrey", "Arden", "Ida", "Hubert", "Gideon", "Destiny", "Kay", "Jeffery", "Knox", "Paige", "Ernie", "Ilene", "Sybil", "Phoebe", "Chad", "Francesca", "Cassidy", "Kenneth", "Jack", "Kingsley" ], "edges": [ [ 0, 5 ], [ 0, 3 ], [ 0, 2 ], [ 2, 6 ], [ 2, 9 ], [ 3, 7 ], [ 4, 1 ], [ 6, 4 ], [ 6, 8 ], [ 10, 15 ], [ 10, 13 ], [ 10, 12 ], [ 12, 16 ], [ 12, 19 ], [ 13, 17 ], [ 14, 11 ], [ 16, 14 ], [ 16, 18 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Gina knows Philip. Cora knows Rhonda. Bart knows Rebecca. Elaine knows Gina. Douglas knows Bart. Tom knows Ted. Randall knows Byron. Philip knows Aspen. Ted knows Elaine. Holden knows Claude. Aspen knows Trevor. Rebecca knows Ivy. Kane knows Tom. Rhonda knows Samantha. Claude knows Kane. Ivy knows Horace. Horace knows Cora. Samantha knows Randall. Which of Trevor and Byron can Douglas reach?", "answer": "Byron", "steps": [ "Douglas knows Bart.", "Bart knows Rebecca.", "Rebecca knows Ivy.", "Ivy knows Horace.", "Horace knows Cora.", "Cora knows Rhonda.", "Rhonda knows Samantha.", "Samantha knows Randall.", "Randall knows Byron." ], "difficulty": 9, "original_distance": 9, "idx_to_symbol": [ "Douglas", "Bart", "Randall", "Cora", "Ivy", "Rhonda", "Byron", "Rebecca", "Samantha", "Horace", "Holden", "Claude", "Aspen", "Elaine", "Tom", "Gina", "Trevor", "Kane", "Philip", "Ted" ], "edges": [ [ 0, 1 ], [ 1, 7 ], [ 2, 6 ], [ 3, 5 ], [ 4, 9 ], [ 5, 8 ], [ 7, 4 ], [ 8, 2 ], [ 9, 3 ], [ 10, 11 ], [ 11, 17 ], [ 12, 16 ], [ 13, 15 ], [ 14, 19 ], [ 15, 18 ], [ 17, 14 ], [ 18, 12 ], [ 19, 13 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Lana knows Hayley. Mildred knows Mitchell. Arlene knows Davis. Arden knows Agnes. Angela knows Lana. Hayley knows Hunter. Charlotte knows Adrian. Karl knows Marco. Fanny knows Arden. Effie knows Angela. Mitchell knows Wayne. Angela knows Brody. Effie knows Charlotte. Mildred knows Arlene. Charlotte knows Jakob. Adrian knows April. Arlene knows Fanny. Mitchell knows Karl. Which of Angela and Arlene can Effie reach?", "answer": "Angela", "steps": [ "Effie knows Angela." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Effie", "Angela", "Jakob", "Lana", "Charlotte", "Hayley", "Brody", "Adrian", "Hunter", "April", "Mildred", "Arlene", "Wayne", "Fanny", "Mitchell", "Arden", "Davis", "Karl", "Agnes", "Marco" ], "edges": [ [ 0, 1 ], [ 0, 4 ], [ 1, 6 ], [ 1, 3 ], [ 3, 5 ], [ 4, 2 ], [ 4, 7 ], [ 5, 8 ], [ 7, 9 ], [ 10, 11 ], [ 10, 14 ], [ 11, 16 ], [ 11, 13 ], [ 13, 15 ], [ 14, 12 ], [ 14, 17 ], [ 15, 18 ], [ 17, 19 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Opal knows Harris. Opal knows Lee. Jon knows Austin. April knows Ralph. Aurora knows Jenny. Jon knows Kamila. Della knows Jon. Kendrick knows Aurora. Kendrick knows Dylan. Harris knows Shannon. Jon knows Cornelius. Gwen knows Damian. Damian knows April. Damian knows Giselle. Opal knows Gwen. Cornelius knows Isadora. Austin knows Kendrick. Dorian knows Opal. Which of Austin and Gwen can Della reach?", "answer": "Austin", "steps": [ "Della knows Jon.", "Jon knows Austin." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Della", "Dylan", "Isadora", "Kamila", "Kendrick", "Jenny", "Aurora", "Cornelius", "Austin", "Jon", "Dorian", "Giselle", "Shannon", "Lee", "Damian", "Ralph", "April", "Harris", "Gwen", "Opal" ], "edges": [ [ 0, 9 ], [ 4, 1 ], [ 4, 6 ], [ 6, 5 ], [ 7, 2 ], [ 8, 4 ], [ 9, 3 ], [ 9, 7 ], [ 9, 8 ], [ 10, 19 ], [ 14, 11 ], [ 14, 16 ], [ 16, 15 ], [ 17, 12 ], [ 18, 14 ], [ 19, 13 ], [ 19, 17 ], [ 19, 18 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Xavier knows Ben. Lorna knows Sandra. Patricia knows Carlos. Yuki knows Patricia. Maude knows Allan. Tyler knows Xavier. Lamont knows Kai. Hannah knows Laverne. Xavier knows Lamont. Patricia knows Wade. Xavier knows Lorna. Rick knows Tyler. Laverne knows Rick. Sadie knows Maude. Wade knows Hector. Patricia knows Skyler. Skyler knows Arden. Allan knows Yuki. Which of Arden and Sandra can Sadie reach?", "answer": "Arden", "steps": [ "Sadie knows Maude.", "Maude knows Allan.", "Allan knows Yuki.", "Yuki knows Patricia.", "Patricia knows Skyler.", "Skyler knows Arden." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Sadie", "Hector", "Yuki", "Patricia", "Allan", "Carlos", "Maude", "Arden", "Skyler", "Wade", "Hannah", "Kai", "Tyler", "Xavier", "Rick", "Ben", "Laverne", "Sandra", "Lorna", "Lamont" ], "edges": [ [ 0, 6 ], [ 2, 3 ], [ 3, 5 ], [ 3, 8 ], [ 3, 9 ], [ 4, 2 ], [ 6, 4 ], [ 8, 7 ], [ 9, 1 ], [ 10, 16 ], [ 12, 13 ], [ 13, 15 ], [ 13, 18 ], [ 13, 19 ], [ 14, 12 ], [ 16, 14 ], [ 18, 17 ], [ 19, 11 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Diana knows Brenda. Joan knows Harmony. Holly knows Lorna. Kurt knows Olivia. Yasmin knows Joan. Harmony knows Kurt. Kurt knows Iris. Diana knows Dylan. Holly knows Frances. Alejandro knows Carrie. Yuki knows Sally. Alejandro knows Alma. Dayton knows Yuki. Olivia knows Alejandro. Alma knows Kieran. Frances knows Gordon. Sally knows Diana. Dylan knows Holly. Which of Alma and Frances can Dayton reach?", "answer": "Frances", "steps": [ "Dayton knows Yuki.", "Yuki knows Sally.", "Sally knows Diana.", "Diana knows Dylan.", "Dylan knows Holly.", "Holly knows Frances." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Dayton", "Holly", "Yuki", "Brenda", "Diana", "Frances", "Sally", "Lorna", "Gordon", "Dylan", "Yasmin", "Alejandro", "Joan", "Iris", "Kurt", "Alma", "Harmony", "Carrie", "Kieran", "Olivia" ], "edges": [ [ 0, 2 ], [ 1, 7 ], [ 1, 5 ], [ 2, 6 ], [ 4, 3 ], [ 4, 9 ], [ 5, 8 ], [ 6, 4 ], [ 9, 1 ], [ 10, 12 ], [ 11, 17 ], [ 11, 15 ], [ 12, 16 ], [ 14, 13 ], [ 14, 19 ], [ 15, 18 ], [ 16, 14 ], [ 19, 11 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Fanny knows Damian. Stacy knows Natalie. Becky knows Parker. Ashton knows Stacy. Parker knows Frances. Edwin knows Gonzalo. Gus knows Fanny. Parker knows Tanya. Edwin knows Ashton. Harper knows Celeste. Marco knows Marc. Gonzalo knows Milo. Frances knows India. Gus knows Becky. Agnes knows Whitney. Stacy knows Harper. Parker knows Agnes. Stacy knows Marco. Which of Ashton and Becky can Edwin reach?", "answer": "Ashton", "steps": [ "Edwin knows Ashton." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Edwin", "Milo", "Ashton", "Natalie", "Stacy", "Gonzalo", "Marco", "Harper", "Marc", "Celeste", "Gus", "Damian", "Becky", "Tanya", "Parker", "Fanny", "Agnes", "Frances", "Whitney", "India" ], "edges": [ [ 0, 5 ], [ 0, 2 ], [ 2, 4 ], [ 4, 3 ], [ 4, 6 ], [ 4, 7 ], [ 5, 1 ], [ 6, 8 ], [ 7, 9 ], [ 10, 15 ], [ 10, 12 ], [ 12, 14 ], [ 14, 13 ], [ 14, 16 ], [ 14, 17 ], [ 15, 11 ], [ 16, 18 ], [ 17, 19 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Kirk knows Lacey. Yvonne knows Cassidy. Fanny knows Alyssa. Belinda knows Jason. Rhea knows Belinda. Jason knows Isaac. Kirk knows Brody. Jason knows Kirk. Benjamin knows Ashton. Isaac knows Yvonne. Belinda knows Blake. Stella knows Fanny. Adelaide knows Scott. Alyssa knows Benjamin. Adelaide knows Diane. Fanny knows Mark. Ashton knows Dolly. Alyssa knows Adelaide. Which of Belinda and Fanny can Rhea reach?", "answer": "Belinda", "steps": [ "Rhea knows Belinda." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Rhea", "Brody", "Lacey", "Belinda", "Jason", "Yvonne", "Blake", "Isaac", "Kirk", "Cassidy", "Stella", "Scott", "Diane", "Fanny", "Alyssa", "Ashton", "Mark", "Benjamin", "Adelaide", "Dolly" ], "edges": [ [ 0, 3 ], [ 3, 6 ], [ 3, 4 ], [ 4, 8 ], [ 4, 7 ], [ 5, 9 ], [ 7, 5 ], [ 8, 1 ], [ 8, 2 ], [ 10, 13 ], [ 13, 16 ], [ 13, 14 ], [ 14, 18 ], [ 14, 17 ], [ 15, 19 ], [ 17, 15 ], [ 18, 11 ], [ 18, 12 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Jeremiah knows Glen. Jenny knows Jose. Arlene knows Vincent. Marie knows Allison. Bert knows Caroline. Jean knows Rufus. Jose knows Merle. Sylvia knows Jeremiah. Corinne knows Morgan. Jose knows Walter. Jenny knows Jean. Rufus knows Simon. Marie knows Esther. Arlene knows Marie. Corinne knows Jenny. Simon knows Eunice. Vincent knows Sylvia. Bert knows Arlene. Which of Vincent and Jean can Corinne reach?", "answer": "Jean", "steps": [ "Corinne knows Jenny.", "Jenny knows Jean." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Corinne", "Jose", "Simon", "Morgan", "Eunice", "Jenny", "Rufus", "Jean", "Walter", "Merle", "Bert", "Marie", "Jeremiah", "Caroline", "Glen", "Arlene", "Sylvia", "Vincent", "Allison", "Esther" ], "edges": [ [ 0, 3 ], [ 0, 5 ], [ 1, 8 ], [ 1, 9 ], [ 2, 4 ], [ 5, 7 ], [ 5, 1 ], [ 6, 2 ], [ 7, 6 ], [ 10, 13 ], [ 10, 15 ], [ 11, 18 ], [ 11, 19 ], [ 12, 14 ], [ 15, 17 ], [ 15, 11 ], [ 16, 12 ], [ 17, 16 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Gareth knows Dee. Scott knows Magdalena. Gareth knows Forrest. Judith knows Diego. Teresa knows Monica. Monica knows Scott. Aaron knows Pierce. Aaron knows Allison. Diego knows Evelyn. Magdalena knows Darnell. Dee knows Ivy. Aaron knows Alison. Alison knows Christian. Evelyn knows Gonzalo. Gonzalo knows Fern. Gareth knows Jon. Fern knows Aaron. Darnell knows Gareth. Which of Scott and Evelyn can Teresa reach?", "answer": "Scott", "steps": [ "Teresa knows Monica.", "Monica knows Scott." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Teresa", "Dee", "Jon", "Gareth", "Forrest", "Scott", "Ivy", "Darnell", "Magdalena", "Monica", "Judith", "Alison", "Allison", "Aaron", "Pierce", "Evelyn", "Christian", "Fern", "Gonzalo", "Diego" ], "edges": [ [ 0, 9 ], [ 1, 6 ], [ 3, 2 ], [ 3, 4 ], [ 3, 1 ], [ 5, 8 ], [ 7, 3 ], [ 8, 7 ], [ 9, 5 ], [ 10, 19 ], [ 11, 16 ], [ 13, 12 ], [ 13, 14 ], [ 13, 11 ], [ 15, 18 ], [ 17, 13 ], [ 18, 17 ], [ 19, 15 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Leah knows Luz. Clara knows Michelle. Norma knows Corey. Maude knows Estelle. Norma knows Elijah. Nicole knows Leah. Darren knows Rose. Ariel knows Sebastian. Theodore knows Cameron. Ariel knows Clara. Maude knows Norma. Clark knows Adam. Michelle knows Nicole. Clara knows Theodore. Clara knows Trina. Rose knows Clark. Elijah knows Alexa. Norma knows Darren. Which of Darren and Michelle can Ariel reach?", "answer": "Michelle", "steps": [ "Ariel knows Clara.", "Clara knows Michelle." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Ariel", "Michelle", "Trina", "Cameron", "Sebastian", "Luz", "Clara", "Theodore", "Nicole", "Leah", "Maude", "Darren", "Corey", "Alexa", "Estelle", "Adam", "Norma", "Elijah", "Rose", "Clark" ], "edges": [ [ 0, 4 ], [ 0, 6 ], [ 1, 8 ], [ 6, 2 ], [ 6, 7 ], [ 6, 1 ], [ 7, 3 ], [ 8, 9 ], [ 9, 5 ], [ 10, 14 ], [ 10, 16 ], [ 11, 18 ], [ 16, 12 ], [ 16, 17 ], [ 16, 11 ], [ 17, 13 ], [ 18, 19 ], [ 19, 15 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Alder knows Robin. Alder knows Leander. Derrick knows Clay. Jerome knows Kathleen. Mae knows Peggy. Derrick knows Jose. Robin knows Latoya. Jose knows Hamilton. Jose knows Craig. Peggy knows Delilah. Nolan knows Yolanda. Clay knows Jodi. Peggy knows Nolan. Mae knows Jerome. Nolan knows Lena. Jose knows Alder. Peggy knows Maya. Yolanda knows Lewis. Which of Nolan and Alder can Derrick reach?", "answer": "Alder", "steps": [ "Derrick knows Jose.", "Jose knows Alder." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Derrick", "Alder", "Robin", "Clay", "Jodi", "Jose", "Craig", "Hamilton", "Leander", "Latoya", "Mae", "Nolan", "Yolanda", "Jerome", "Kathleen", "Peggy", "Maya", "Delilah", "Lena", "Lewis" ], "edges": [ [ 0, 3 ], [ 0, 5 ], [ 1, 8 ], [ 1, 2 ], [ 2, 9 ], [ 3, 4 ], [ 5, 6 ], [ 5, 7 ], [ 5, 1 ], [ 10, 13 ], [ 10, 15 ], [ 11, 18 ], [ 11, 12 ], [ 12, 19 ], [ 13, 14 ], [ 15, 16 ], [ 15, 17 ], [ 15, 11 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Louis knows Calvin. Jaime knows Boyd. Chris knows Boris. Chris knows Esme. Esme knows Arnold. Louis knows Cynthia. Louisa knows Frances. Frances knows Megan. Chris knows Curtis. Boyd knows Ava. Curtis knows Louisa. Arnold knows Doug. Boyd knows Helene. Burt knows Carlton. Calvin knows Burt. Louis knows Evelyn. Cynthia knows Jaime. Frances knows Kobe. Which of Curtis and Cynthia can Chris reach?", "answer": "Curtis", "steps": [ "Chris knows Curtis." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Chris", "Kobe", "Esme", "Doug", "Frances", "Boris", "Louisa", "Megan", "Arnold", "Curtis", "Louis", "Ava", "Calvin", "Carlton", "Boyd", "Evelyn", "Jaime", "Helene", "Burt", "Cynthia" ], "edges": [ [ 0, 5 ], [ 0, 2 ], [ 0, 9 ], [ 2, 8 ], [ 4, 1 ], [ 4, 7 ], [ 6, 4 ], [ 8, 3 ], [ 9, 6 ], [ 10, 15 ], [ 10, 12 ], [ 10, 19 ], [ 12, 18 ], [ 14, 11 ], [ 14, 17 ], [ 16, 14 ], [ 18, 13 ], [ 19, 16 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Lily knows Effie. Kylie knows Geoffrey. Denver knows Kelsey. Ariana knows Nolan. Jane knows Max. Alicia knows Erma. Max knows Kylie. Effie knows Liam. Lauren knows Devin. Ivy knows Alicia. Denver knows Jane. Shane knows Lauren. Nolan knows Ivy. Clark knows Carson. Effie knows Ariana. Devin knows Denver. Geoffrey knows Marian. Carson knows Lily. Which of Erma and Marian can Clark reach?", "answer": "Erma", "steps": [ "Clark knows Carson.", "Carson knows Lily.", "Lily knows Effie.", "Effie knows Ariana.", "Ariana knows Nolan.", "Nolan knows Ivy.", "Ivy knows Alicia.", "Alicia knows Erma." ], "difficulty": 8, "original_distance": 8, "idx_to_symbol": [ "Clark", "Lily", "Erma", "Alicia", "Ivy", "Ariana", "Effie", "Nolan", "Carson", "Liam", "Shane", "Devin", "Marian", "Geoffrey", "Kylie", "Jane", "Denver", "Max", "Lauren", "Kelsey" ], "edges": [ [ 0, 8 ], [ 1, 6 ], [ 3, 2 ], [ 4, 3 ], [ 5, 7 ], [ 6, 5 ], [ 6, 9 ], [ 7, 4 ], [ 8, 1 ], [ 10, 18 ], [ 11, 16 ], [ 13, 12 ], [ 14, 13 ], [ 15, 17 ], [ 16, 15 ], [ 16, 19 ], [ 17, 14 ], [ 18, 11 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Winifred knows Kara. Yara knows Jeanne. Miriam knows Coral. Wilson knows Cynthia. Dana knows Declan. Jeanne knows Dennis. Hank knows Elijah. Elijah knows Winifred. Louise knows Dana. Roger knows Miriam. Winifred knows Louise. Kara knows Joseph. Cynthia knows Freya. Joseph knows Philip. Dennis knows Regina. Freya knows Roger. Freya knows Yara. Declan knows Sierra. Which of Elijah and Cynthia can Wilson reach?", "answer": "Cynthia", "steps": [ "Wilson knows Cynthia." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Wilson", "Regina", "Roger", "Jeanne", "Coral", "Yara", "Dennis", "Cynthia", "Miriam", "Freya", "Hank", "Sierra", "Kara", "Dana", "Philip", "Louise", "Declan", "Elijah", "Joseph", "Winifred" ], "edges": [ [ 0, 7 ], [ 2, 8 ], [ 3, 6 ], [ 5, 3 ], [ 6, 1 ], [ 7, 9 ], [ 8, 4 ], [ 9, 5 ], [ 9, 2 ], [ 10, 17 ], [ 12, 18 ], [ 13, 16 ], [ 15, 13 ], [ 16, 11 ], [ 17, 19 ], [ 18, 14 ], [ 19, 15 ], [ 19, 12 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Ava knows Geneva. Henry knows Christian. Percy knows Faye. Gavin knows Amanda. Earl knows Ava. Earl knows Kieran. Chad knows Gavin. Henry knows Edith. Chad knows Percy. Faye knows Selena. Edith knows Jolene. Christian knows Earl. Selena knows Sydney. Edith knows Ann. Faye knows Jameson. Ann knows Jermaine. Grover knows Jeff. Gavin knows Grover. Which of Selena and Ava can Henry reach?", "answer": "Ava", "steps": [ "Henry knows Christian.", "Christian knows Earl.", "Earl knows Ava." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Henry", "Jolene", "Ann", "Jermaine", "Christian", "Geneva", "Ava", "Kieran", "Earl", "Edith", "Chad", "Amanda", "Grover", "Jeff", "Percy", "Sydney", "Selena", "Jameson", "Faye", "Gavin" ], "edges": [ [ 0, 4 ], [ 0, 9 ], [ 2, 3 ], [ 4, 8 ], [ 6, 5 ], [ 8, 6 ], [ 8, 7 ], [ 9, 1 ], [ 9, 2 ], [ 10, 14 ], [ 10, 19 ], [ 12, 13 ], [ 14, 18 ], [ 16, 15 ], [ 18, 16 ], [ 18, 17 ], [ 19, 11 ], [ 19, 12 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Sue knows Leticia. Russell knows Xavier. Sue knows Yolanda. Xavier knows Hazel. Mae knows Brent. Yolanda knows Zoe. Brent knows Neville. Sue knows Jerry. Fleur knows Jocelyn. Sue knows Daphna. Brent knows Tara. Tara knows Anita. Nathan knows Sue. Yolanda knows Fleur. Daphna knows Chandler. Brent knows Russell. Russell knows Virginia. Brent knows Janet. Which of Xavier and Fleur can Mae reach?", "answer": "Xavier", "steps": [ "Mae knows Brent.", "Brent knows Russell.", "Russell knows Xavier." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Mae", "Neville", "Janet", "Anita", "Russell", "Hazel", "Xavier", "Brent", "Tara", "Virginia", "Nathan", "Leticia", "Jerry", "Chandler", "Yolanda", "Jocelyn", "Fleur", "Sue", "Daphna", "Zoe" ], "edges": [ [ 0, 7 ], [ 4, 6 ], [ 4, 9 ], [ 6, 5 ], [ 7, 1 ], [ 7, 2 ], [ 7, 8 ], [ 7, 4 ], [ 8, 3 ], [ 10, 17 ], [ 14, 16 ], [ 14, 19 ], [ 16, 15 ], [ 17, 11 ], [ 17, 12 ], [ 17, 18 ], [ 17, 14 ], [ 18, 13 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Jesse knows Marcia. Victor knows Lucas. Lucas knows Tabitha. Jarvis knows Jeff. Wallace knows Jarvis. Vicki knows Jesse. Anthony knows Todd. Anthony knows Verna. Verna knows Maya. Albert knows Gemma. Todd knows Wallace. Cornelius knows Anthony. Nancy knows Vicki. Gemma knows Victor. Blanche knows Iris. Tabitha knows Drew. Vicki knows Albert. Jeff knows Blanche. Which of Jeff and Lucas can Cornelius reach?", "answer": "Jeff", "steps": [ "Cornelius knows Anthony.", "Anthony knows Todd.", "Todd knows Wallace.", "Wallace knows Jarvis.", "Jarvis knows Jeff." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Cornelius", "Jeff", "Blanche", "Anthony", "Todd", "Wallace", "Iris", "Jarvis", "Maya", "Verna", "Nancy", "Lucas", "Tabitha", "Vicki", "Albert", "Gemma", "Drew", "Victor", "Marcia", "Jesse" ], "edges": [ [ 0, 3 ], [ 1, 2 ], [ 2, 6 ], [ 3, 4 ], [ 3, 9 ], [ 4, 5 ], [ 5, 7 ], [ 7, 1 ], [ 9, 8 ], [ 10, 13 ], [ 11, 12 ], [ 12, 16 ], [ 13, 14 ], [ 13, 19 ], [ 14, 15 ], [ 15, 17 ], [ 17, 11 ], [ 19, 18 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Francis knows Kenneth. Frank knows Emanuel. Brian knows Erik. Mara knows Leah. Seth knows Beatrice. Frank knows Leigh. Allan knows Mabel. Adele knows Frank. Allan knows Tyler. Emanuel knows Francis. Mabel knows Seth. Leigh knows Amy. Tyler knows Brian. Jackson knows Jodi. Sierra knows Jackson. Amy knows Heather. Jodi knows Allan. Leah knows Adele. Which of Emanuel and Tyler can Mara reach?", "answer": "Emanuel", "steps": [ "Mara knows Leah.", "Leah knows Adele.", "Adele knows Frank.", "Frank knows Emanuel." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Mara", "Leigh", "Francis", "Heather", "Emanuel", "Amy", "Leah", "Frank", "Kenneth", "Adele", "Sierra", "Mabel", "Brian", "Beatrice", "Tyler", "Seth", "Jackson", "Allan", "Erik", "Jodi" ], "edges": [ [ 0, 6 ], [ 1, 5 ], [ 2, 8 ], [ 4, 2 ], [ 5, 3 ], [ 6, 9 ], [ 7, 1 ], [ 7, 4 ], [ 9, 7 ], [ 10, 16 ], [ 11, 15 ], [ 12, 18 ], [ 14, 12 ], [ 15, 13 ], [ 16, 19 ], [ 17, 11 ], [ 17, 14 ], [ 19, 17 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Carmen knows Wilson. Myrtle knows Carlos. Leonard knows Norma. Pauline knows Leonard. Chad knows Pauline. Chad knows Myrtle. Sean knows Marilyn. Pablo knows Hannah. Norma knows Kai. Wilson knows Celia. Marilyn knows Bill. Leonard knows Daphna. Pablo knows Chad. Audrey knows Geraldine. Marilyn knows Dave. Bill knows Winifred. Carmen knows Sean. Audrey knows Carmen. Which of Winifred and Kai can Audrey reach?", "answer": "Winifred", "steps": [ "Audrey knows Carmen.", "Carmen knows Sean.", "Sean knows Marilyn.", "Marilyn knows Bill.", "Bill knows Winifred." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Audrey", "Sean", "Geraldine", "Marilyn", "Celia", "Carmen", "Wilson", "Dave", "Winifred", "Bill", "Pablo", "Pauline", "Hannah", "Leonard", "Carlos", "Chad", "Myrtle", "Daphna", "Kai", "Norma" ], "edges": [ [ 0, 2 ], [ 0, 5 ], [ 1, 3 ], [ 3, 7 ], [ 3, 9 ], [ 5, 6 ], [ 5, 1 ], [ 6, 4 ], [ 9, 8 ], [ 10, 12 ], [ 10, 15 ], [ 11, 13 ], [ 13, 17 ], [ 13, 19 ], [ 15, 16 ], [ 15, 11 ], [ 16, 14 ], [ 19, 18 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Leroy knows Lorenzo. Alice knows Ainsley. Judy knows Ida. Leroy knows Kit. Ainsley knows Janice. Wilma knows Isla. Kit knows Alice. Arthur knows Tina. Gus knows Judy. Ida knows Uma. Laverne knows Luther. Lorenzo knows Paige. Tina knows Laverne. Luther knows Pearl. Luther knows Myra. Ainsley knows Donald. Arthur knows Gus. Paige knows Wilma. Which of Wilma and Ida can Arthur reach?", "answer": "Ida", "steps": [ "Arthur knows Gus.", "Gus knows Judy.", "Judy knows Ida." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Arthur", "Luther", "Tina", "Pearl", "Ida", "Uma", "Laverne", "Gus", "Myra", "Judy", "Leroy", "Ainsley", "Kit", "Janice", "Wilma", "Isla", "Alice", "Lorenzo", "Donald", "Paige" ], "edges": [ [ 0, 2 ], [ 0, 7 ], [ 1, 3 ], [ 1, 8 ], [ 2, 6 ], [ 4, 5 ], [ 6, 1 ], [ 7, 9 ], [ 9, 4 ], [ 10, 12 ], [ 10, 17 ], [ 11, 13 ], [ 11, 18 ], [ 12, 16 ], [ 14, 15 ], [ 16, 11 ], [ 17, 19 ], [ 19, 14 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Magdalena knows Duncan. Paul knows Claire. Anton knows Frankie. Darla knows Chantal. Conrad knows Dana. Tony knows Leo. Drake knows Anton. Magdalena knows Logan. Chantal knows Jacques. Joshua knows Kara. Nicholas knows Paul. Duncan knows Joshua. Dana knows Darla. Leo knows Drake. Nicholas knows Charlene. Kara knows Conrad. Shelly knows Tony. Claire knows Shelly. Which of Leo and Dana can Nicholas reach?", "answer": "Leo", "steps": [ "Nicholas knows Paul.", "Paul knows Claire.", "Claire knows Shelly.", "Shelly knows Tony.", "Tony knows Leo." ], "difficulty": 5, "original_distance": 8, "idx_to_symbol": [ "Nicholas", "Leo", "Charlene", "Frankie", "Paul", "Shelly", "Tony", "Claire", "Drake", "Anton", "Magdalena", "Dana", "Logan", "Jacques", "Duncan", "Kara", "Conrad", "Joshua", "Darla", "Chantal" ], "edges": [ [ 0, 2 ], [ 0, 4 ], [ 1, 8 ], [ 4, 7 ], [ 5, 6 ], [ 6, 1 ], [ 7, 5 ], [ 8, 9 ], [ 9, 3 ], [ 10, 12 ], [ 10, 14 ], [ 11, 18 ], [ 14, 17 ], [ 15, 16 ], [ 16, 11 ], [ 17, 15 ], [ 18, 19 ], [ 19, 13 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Priscilla knows Katherine. Gemma knows Linda. Jay knows Willard. Annette knows Fergus. Myrtle knows Cesar. Eleanor knows Finn. Katherine knows Annette. Annette knows Myrtle. Veronica knows Tim. Tim knows Gemma. Veronica knows Kenneth. Luis knows Priscilla. Linda knows Eleanor. Kenneth knows Dolores. Luis knows Jay. India knows Angelica. Linda knows India. Fergus knows Charles. Which of Priscilla and Tim can Veronica reach?", "answer": "Tim", "steps": [ "Veronica knows Tim." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Veronica", "Tim", "Gemma", "India", "Linda", "Eleanor", "Angelica", "Kenneth", "Finn", "Dolores", "Luis", "Priscilla", "Katherine", "Fergus", "Annette", "Myrtle", "Charles", "Jay", "Cesar", "Willard" ], "edges": [ [ 0, 1 ], [ 0, 7 ], [ 1, 2 ], [ 2, 4 ], [ 3, 6 ], [ 4, 3 ], [ 4, 5 ], [ 5, 8 ], [ 7, 9 ], [ 10, 11 ], [ 10, 17 ], [ 11, 12 ], [ 12, 14 ], [ 13, 16 ], [ 14, 13 ], [ 14, 15 ], [ 15, 18 ], [ 17, 19 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Ada knows Garrison. Ruth knows Layla. Greg knows Matt. Garrison knows Keith. Keith knows Lyle. Eden knows Cain. Livia knows Michelle. Priscilla knows Ruth. Eli knows Lucia. Eden knows Chris. Eli knows Eden. Greg knows Blanche. Chris knows Stella. Garrison knows Greg. Cain knows Priscilla. Chris knows Jermaine. Ada knows Abigail. Lyle knows Livia. Which of Garrison and Eden can Ada reach?", "answer": "Garrison", "steps": [ "Ada knows Garrison." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Ada", "Blanche", "Garrison", "Lyle", "Michelle", "Greg", "Livia", "Abigail", "Matt", "Keith", "Eli", "Jermaine", "Eden", "Priscilla", "Layla", "Chris", "Ruth", "Lucia", "Stella", "Cain" ], "edges": [ [ 0, 7 ], [ 0, 2 ], [ 2, 5 ], [ 2, 9 ], [ 3, 6 ], [ 5, 1 ], [ 5, 8 ], [ 6, 4 ], [ 9, 3 ], [ 10, 17 ], [ 10, 12 ], [ 12, 15 ], [ 12, 19 ], [ 13, 16 ], [ 15, 11 ], [ 15, 18 ], [ 16, 14 ], [ 19, 13 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Delia knows Ainsley. Cora knows Lucy. Tony knows Delia. Georgia knows Alyson. Sandy knows Joyce. Elise knows Fritz. Casey knows Terry. Cecilia knows Kendra. Alyson knows Sandy. Cora knows Cecilia. Sandy knows Cora. Tony knows Elliot. Fritz knows Tony. Ainsley knows Dolores. Tony knows Felicia. Sandy knows Casey. Delia knows Ingrid. Felicia knows Chloe. Which of Ainsley and Cecilia can Georgia reach?", "answer": "Cecilia", "steps": [ "Georgia knows Alyson.", "Alyson knows Sandy.", "Sandy knows Cora.", "Cora knows Cecilia." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Georgia", "Cecilia", "Joyce", "Cora", "Kendra", "Sandy", "Alyson", "Lucy", "Casey", "Terry", "Elise", "Ainsley", "Elliot", "Delia", "Dolores", "Tony", "Fritz", "Ingrid", "Felicia", "Chloe" ], "edges": [ [ 0, 6 ], [ 1, 4 ], [ 3, 1 ], [ 3, 7 ], [ 5, 2 ], [ 5, 3 ], [ 5, 8 ], [ 6, 5 ], [ 8, 9 ], [ 10, 16 ], [ 11, 14 ], [ 13, 11 ], [ 13, 17 ], [ 15, 12 ], [ 15, 13 ], [ 15, 18 ], [ 16, 15 ], [ 18, 19 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Langston knows Robert. Frida knows Clark. Belinda knows Dora. Bella knows Frida. Kelsey knows Ebony. Devon knows Trudy. Gail knows Ira. Dora knows Langston. Rachel knows Alyssa. Robert knows Autumn. Hampton knows Rachel. Rachel knows Janet. Alyssa knows Erwin. Kelsey knows Devon. Langston knows Hampton. Layla knows Bella. Frida knows Gail. Clark knows Kelsey. Which of Frida and Langston can Belinda reach?", "answer": "Langston", "steps": [ "Belinda knows Dora.", "Dora knows Langston." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Belinda", "Hampton", "Autumn", "Rachel", "Alyssa", "Janet", "Langston", "Dora", "Robert", "Erwin", "Layla", "Clark", "Ira", "Kelsey", "Devon", "Ebony", "Frida", "Bella", "Gail", "Trudy" ], "edges": [ [ 0, 7 ], [ 1, 3 ], [ 3, 5 ], [ 3, 4 ], [ 4, 9 ], [ 6, 8 ], [ 6, 1 ], [ 7, 6 ], [ 8, 2 ], [ 10, 17 ], [ 11, 13 ], [ 13, 15 ], [ 13, 14 ], [ 14, 19 ], [ 16, 18 ], [ 16, 11 ], [ 17, 16 ], [ 18, 12 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Virgil knows Chad. Lola knows Lena. Jared knows Ben. Virgil knows Finn. Maria knows Seth. Mildred knows Virgil. Dave knows Dora. Chad knows Chase. Deborah knows Justine. Lola knows Maria. Rocco knows Deborah. Serena knows Mildred. Justine knows Jared. Jared knows Lola. Jocelyn knows Dave. Mildred knows Merle. Dora knows Serena. Ashley knows Rocco. Which of Dave and Rocco can Ashley reach?", "answer": "Rocco", "steps": [ "Ashley knows Rocco." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Ashley", "Lola", "Ben", "Seth", "Justine", "Deborah", "Rocco", "Lena", "Jared", "Maria", "Jocelyn", "Virgil", "Merle", "Chase", "Serena", "Dora", "Dave", "Finn", "Mildred", "Chad" ], "edges": [ [ 0, 6 ], [ 1, 7 ], [ 1, 9 ], [ 4, 8 ], [ 5, 4 ], [ 6, 5 ], [ 8, 2 ], [ 8, 1 ], [ 9, 3 ], [ 10, 16 ], [ 11, 17 ], [ 11, 19 ], [ 14, 18 ], [ 15, 14 ], [ 16, 15 ], [ 18, 12 ], [ 18, 11 ], [ 19, 13 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Sidney knows Willis. Fanny knows Lloyd. Chester knows Sidney. Harold knows Harry. Lloyd knows Chester. Willis knows Yolanda. Harold knows Luella. Laverne knows Anton. Wendell knows Harold. Willis knows Betty. Sidney knows Callum. Wendell knows Alison. Chester knows Sandra. Lloyd knows Etta. Anton knows Griffith. Anton knows Curtis. Griffith knows Wendell. Griffith knows Finn. Which of Luella and Yolanda can Fanny reach?", "answer": "Yolanda", "steps": [ "Fanny knows Lloyd.", "Lloyd knows Chester.", "Chester knows Sidney.", "Sidney knows Willis.", "Willis knows Yolanda." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Fanny", "Callum", "Willis", "Etta", "Yolanda", "Chester", "Betty", "Lloyd", "Sandra", "Sidney", "Laverne", "Alison", "Harold", "Curtis", "Luella", "Griffith", "Harry", "Anton", "Finn", "Wendell" ], "edges": [ [ 0, 7 ], [ 2, 4 ], [ 2, 6 ], [ 5, 8 ], [ 5, 9 ], [ 7, 3 ], [ 7, 5 ], [ 9, 1 ], [ 9, 2 ], [ 10, 17 ], [ 12, 14 ], [ 12, 16 ], [ 15, 18 ], [ 15, 19 ], [ 17, 13 ], [ 17, 15 ], [ 19, 11 ], [ 19, 12 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Troy knows Cassidy. Susanne knows Ebony. Harmony knows Jaime. Franklin knows Lacey. Matthew knows Amy. Dina knows Susanne. Franklin knows Clark. Sadie knows Matthew. Cassidy knows Dina. Troy knows Sadie. Frank knows Franklin. Justin knows Rocco. Troy knows Gustavo. Franklin knows Michelle. Jaime knows Tyler. Darcy knows Troy. Clark knows Justin. Michelle knows Harmony. Which of Franklin and Troy can Darcy reach?", "answer": "Troy", "steps": [ "Darcy knows Troy." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Darcy", "Matthew", "Troy", "Amy", "Ebony", "Dina", "Cassidy", "Sadie", "Gustavo", "Susanne", "Frank", "Justin", "Franklin", "Rocco", "Tyler", "Harmony", "Michelle", "Clark", "Lacey", "Jaime" ], "edges": [ [ 0, 2 ], [ 1, 3 ], [ 2, 7 ], [ 2, 8 ], [ 2, 6 ], [ 5, 9 ], [ 6, 5 ], [ 7, 1 ], [ 9, 4 ], [ 10, 12 ], [ 11, 13 ], [ 12, 17 ], [ 12, 18 ], [ 12, 16 ], [ 15, 19 ], [ 16, 15 ], [ 17, 11 ], [ 19, 14 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Eli knows Mia. Etta knows Bridget. Etta knows Howard. Theodore knows Etta. Melissa knows Hank. Melissa knows Eli. Melissa knows Lydia. Lydia knows Erik. Gus knows Ivan. Luz knows Herbert. Eli knows Luz. Demetrius knows Fletcher. Demetrius knows Gus. Luz knows Imogen. Theodore knows Seth. Demetrius knows Theodore. Theodore knows Camden. Eli knows Frances. Which of Theodore and Eli can Melissa reach?", "answer": "Eli", "steps": [ "Melissa knows Eli." ], "difficulty": 1, "original_distance": 3, "idx_to_symbol": [ "Melissa", "Hank", "Imogen", "Herbert", "Mia", "Frances", "Luz", "Lydia", "Erik", "Eli", "Demetrius", "Fletcher", "Howard", "Bridget", "Seth", "Camden", "Etta", "Gus", "Ivan", "Theodore" ], "edges": [ [ 0, 1 ], [ 0, 7 ], [ 0, 9 ], [ 6, 2 ], [ 6, 3 ], [ 7, 8 ], [ 9, 4 ], [ 9, 5 ], [ 9, 6 ], [ 10, 11 ], [ 10, 17 ], [ 10, 19 ], [ 16, 12 ], [ 16, 13 ], [ 17, 18 ], [ 19, 14 ], [ 19, 15 ], [ 19, 16 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Carla knows Cassidy. Colette knows Wade. Leroy knows Delilah. Barbara knows Leroy. Carla knows Teresa. Ernesto knows Barbara. Emanuel knows Edward. Teresa knows Dakota. Greg knows Carla. Ernesto knows Harlan. Denise knows Martin. Terry knows Denise. Martin knows Colette. Edward knows Greg. Dakota knows Andre. Greg knows Jules. Jules knows Dora. Martin knows Ernesto. Which of Denise and Edward can Emanuel reach?", "answer": "Edward", "steps": [ "Emanuel knows Edward." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Emanuel", "Andre", "Dora", "Greg", "Dakota", "Jules", "Carla", "Teresa", "Cassidy", "Edward", "Terry", "Delilah", "Wade", "Martin", "Leroy", "Colette", "Ernesto", "Barbara", "Harlan", "Denise" ], "edges": [ [ 0, 9 ], [ 3, 5 ], [ 3, 6 ], [ 4, 1 ], [ 5, 2 ], [ 6, 7 ], [ 6, 8 ], [ 7, 4 ], [ 9, 3 ], [ 10, 19 ], [ 13, 15 ], [ 13, 16 ], [ 14, 11 ], [ 15, 12 ], [ 16, 17 ], [ 16, 18 ], [ 17, 14 ], [ 19, 13 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Chloe knows Chester. Benjamin knows Claude. Otto knows Kieran. Sue knows Dayton. Lily knows Otto. Benjamin knows Charles. Otto knows Wendy. Chloe knows Laura. Noel knows Chloe. Chloe knows Devin. Otto knows Boyd. Lily knows Jacqueline. Kieran knows Benjamin. Noel knows Isabel. Sue knows Gareth. Noel knows Grady. Laura knows Sue. Lily knows Margaret. Which of Kieran and Laura can Noel reach?", "answer": "Laura", "steps": [ "Noel knows Chloe.", "Chloe knows Laura." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Noel", "Chester", "Chloe", "Gareth", "Dayton", "Devin", "Grady", "Sue", "Isabel", "Laura", "Lily", "Boyd", "Otto", "Charles", "Claude", "Wendy", "Margaret", "Benjamin", "Jacqueline", "Kieran" ], "edges": [ [ 0, 6 ], [ 0, 8 ], [ 0, 2 ], [ 2, 1 ], [ 2, 5 ], [ 2, 9 ], [ 7, 3 ], [ 7, 4 ], [ 9, 7 ], [ 10, 16 ], [ 10, 18 ], [ 10, 12 ], [ 12, 11 ], [ 12, 15 ], [ 12, 19 ], [ 17, 13 ], [ 17, 14 ], [ 19, 17 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Lisa knows Ruby. Marshall knows Iris. Barney knows Marshall. Ruby knows Aisha. Connor knows Shane. Eamon knows Denise. Marshall knows Justine. Shane knows Andre. Eugene knows Barney. Emily knows Kelsey. Justine knows Eamon. Ruby knows Emily. Holly knows Leland. Andre knows Camden. Willis knows Eugene. Aisha knows Connor. Eugene knows Holly. Connor knows Marcia. Which of Andre and Eamon can Willis reach?", "answer": "Eamon", "steps": [ "Willis knows Eugene.", "Eugene knows Barney.", "Barney knows Marshall.", "Marshall knows Justine.", "Justine knows Eamon." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Willis", "Denise", "Justine", "Barney", "Eamon", "Holly", "Iris", "Marshall", "Eugene", "Leland", "Lisa", "Camden", "Shane", "Aisha", "Andre", "Emily", "Marcia", "Connor", "Ruby", "Kelsey" ], "edges": [ [ 0, 8 ], [ 2, 4 ], [ 3, 7 ], [ 4, 1 ], [ 5, 9 ], [ 7, 2 ], [ 7, 6 ], [ 8, 3 ], [ 8, 5 ], [ 10, 18 ], [ 12, 14 ], [ 13, 17 ], [ 14, 11 ], [ 15, 19 ], [ 17, 12 ], [ 17, 16 ], [ 18, 13 ], [ 18, 15 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Mark knows Etta. Hannah knows Garland. Jacqueline knows Kenzie. Myrtle knows Alex. Alex knows Aria. Julian knows Marcus. Nicholas knows Ramon. Garland knows Mark. Erik knows Hannah. Ramon knows Wanda. Alex knows Jacqueline. Jana knows Floyd. Marcus knows Myrtle. Mark knows Jana. Mike knows Giselle. Giselle knows Roman. Wanda knows Julian. Roman knows Erik. Which of Marcus and Hannah can Mike reach?", "answer": "Hannah", "steps": [ "Mike knows Giselle.", "Giselle knows Roman.", "Roman knows Erik.", "Erik knows Hannah." ], "difficulty": 4, "original_distance": 8, "idx_to_symbol": [ "Mike", "Etta", "Jana", "Mark", "Floyd", "Hannah", "Erik", "Giselle", "Garland", "Roman", "Nicholas", "Aria", "Jacqueline", "Alex", "Kenzie", "Marcus", "Julian", "Ramon", "Myrtle", "Wanda" ], "edges": [ [ 0, 7 ], [ 2, 4 ], [ 3, 1 ], [ 3, 2 ], [ 5, 8 ], [ 6, 5 ], [ 7, 9 ], [ 8, 3 ], [ 9, 6 ], [ 10, 17 ], [ 12, 14 ], [ 13, 11 ], [ 13, 12 ], [ 15, 18 ], [ 16, 15 ], [ 17, 19 ], [ 18, 13 ], [ 19, 16 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Jesse knows Marcia. Victor knows Lucas. Lucas knows Tabitha. Jarvis knows Jeff. Wallace knows Jarvis. Vicki knows Jesse. Anthony knows Todd. Anthony knows Verna. Verna knows Maya. Albert knows Gemma. Todd knows Wallace. Cornelius knows Anthony. Nancy knows Vicki. Gemma knows Victor. Blanche knows Iris. Tabitha knows Drew. Vicki knows Albert. Jeff knows Blanche. Which of Wallace and Gemma can Cornelius reach?", "answer": "Wallace", "steps": [ "Cornelius knows Anthony.", "Anthony knows Todd.", "Todd knows Wallace." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Cornelius", "Jeff", "Blanche", "Anthony", "Todd", "Wallace", "Iris", "Jarvis", "Maya", "Verna", "Nancy", "Lucas", "Tabitha", "Vicki", "Albert", "Gemma", "Drew", "Victor", "Marcia", "Jesse" ], "edges": [ [ 0, 3 ], [ 1, 2 ], [ 2, 6 ], [ 3, 4 ], [ 3, 9 ], [ 4, 5 ], [ 5, 7 ], [ 7, 1 ], [ 9, 8 ], [ 10, 13 ], [ 11, 12 ], [ 12, 16 ], [ 13, 14 ], [ 13, 19 ], [ 14, 15 ], [ 15, 17 ], [ 17, 11 ], [ 19, 18 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Keegan knows Frances. Bennett knows Derrick. Bruno knows Bart. Dolores knows Merle. Chance knows Max. Derrick knows Jeremy. Bennett knows Warren. Keegan knows Jasper. Fergus knows Ashton. Warren knows Finn. Maude knows Dolores. Bruno knows Arden. Jeremy knows Chance. Frances knows Maude. Maude knows Yvette. Bart knows Bennett. Yvette knows Jonas. Jonas knows Fergus. Which of Maude and Bennett can Keegan reach?", "answer": "Maude", "steps": [ "Keegan knows Frances.", "Frances knows Maude." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Keegan", "Dolores", "Fergus", "Yvette", "Ashton", "Maude", "Frances", "Merle", "Jasper", "Jonas", "Bruno", "Warren", "Chance", "Derrick", "Max", "Bennett", "Bart", "Finn", "Arden", "Jeremy" ], "edges": [ [ 0, 8 ], [ 0, 6 ], [ 1, 7 ], [ 2, 4 ], [ 3, 9 ], [ 5, 1 ], [ 5, 3 ], [ 6, 5 ], [ 9, 2 ], [ 10, 18 ], [ 10, 16 ], [ 11, 17 ], [ 12, 14 ], [ 13, 19 ], [ 15, 11 ], [ 15, 13 ], [ 16, 15 ], [ 19, 12 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Lloyd knows Jason. Bart knows Lorna. Elaine knows Rex. Jolena knows Elliot. Elaine knows Molly. Pat knows Lark. Lorna knows Felix. Jason knows Elaine. Pat knows Lloyd. Kathleen knows Tracy. Jackson knows Kamila. Lloyd knows Kathleen. Bart knows Mario. Elliot knows Bart. Elliot knows Jackson. Jolena knows Leslie. Lorna knows Lilia. Jason knows Palmer. Which of Molly and Lilia can Pat reach?", "answer": "Molly", "steps": [ "Pat knows Lloyd.", "Lloyd knows Jason.", "Jason knows Elaine.", "Elaine knows Molly." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Pat", "Elaine", "Kathleen", "Palmer", "Lloyd", "Rex", "Jason", "Tracy", "Molly", "Lark", "Jolena", "Lorna", "Jackson", "Mario", "Elliot", "Felix", "Bart", "Kamila", "Lilia", "Leslie" ], "edges": [ [ 0, 4 ], [ 0, 9 ], [ 1, 5 ], [ 1, 8 ], [ 2, 7 ], [ 4, 2 ], [ 4, 6 ], [ 6, 3 ], [ 6, 1 ], [ 10, 14 ], [ 10, 19 ], [ 11, 15 ], [ 11, 18 ], [ 12, 17 ], [ 14, 12 ], [ 14, 16 ], [ 16, 13 ], [ 16, 11 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Eli knows Mia. Etta knows Bridget. Etta knows Howard. Theodore knows Etta. Melissa knows Hank. Melissa knows Eli. Melissa knows Lydia. Lydia knows Erik. Gus knows Ivan. Luz knows Herbert. Eli knows Luz. Demetrius knows Fletcher. Demetrius knows Gus. Luz knows Imogen. Theodore knows Seth. Demetrius knows Theodore. Theodore knows Camden. Eli knows Frances. Which of Imogen and Howard can Melissa reach?", "answer": "Imogen", "steps": [ "Melissa knows Eli.", "Eli knows Luz.", "Luz knows Imogen." ], "difficulty": 3, "original_distance": 3, "idx_to_symbol": [ "Melissa", "Hank", "Imogen", "Herbert", "Mia", "Frances", "Luz", "Lydia", "Erik", "Eli", "Demetrius", "Fletcher", "Howard", "Bridget", "Seth", "Camden", "Etta", "Gus", "Ivan", "Theodore" ], "edges": [ [ 0, 1 ], [ 0, 7 ], [ 0, 9 ], [ 6, 2 ], [ 6, 3 ], [ 7, 8 ], [ 9, 4 ], [ 9, 5 ], [ 9, 6 ], [ 10, 11 ], [ 10, 17 ], [ 10, 19 ], [ 16, 12 ], [ 16, 13 ], [ 17, 18 ], [ 19, 14 ], [ 19, 15 ], [ 19, 16 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Dalton knows Joel. Joanna knows Livia. Clay knows Myra. Yuki knows Penny. Joanna knows Yuki. Yuki knows Harvey. Celia knows Isadora. Lorenzo knows Dalton. Dalton knows Ava. Ava knows Celia. Harvey knows Eldon. Myra knows Lorenzo. Judy knows Abel. Ava knows Sandra. Celia knows Khashayar. Louis knows Joanna. Harvey knows Edison. Abel knows Louis. Which of Dalton and Joanna can Judy reach?", "answer": "Joanna", "steps": [ "Judy knows Abel.", "Abel knows Louis.", "Louis knows Joanna." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Judy", "Harvey", "Joanna", "Louis", "Edison", "Livia", "Eldon", "Yuki", "Abel", "Penny", "Clay", "Celia", "Dalton", "Lorenzo", "Isadora", "Joel", "Khashayar", "Ava", "Myra", "Sandra" ], "edges": [ [ 0, 8 ], [ 1, 4 ], [ 1, 6 ], [ 2, 5 ], [ 2, 7 ], [ 3, 2 ], [ 7, 1 ], [ 7, 9 ], [ 8, 3 ], [ 10, 18 ], [ 11, 14 ], [ 11, 16 ], [ 12, 15 ], [ 12, 17 ], [ 13, 12 ], [ 17, 11 ], [ 17, 19 ], [ 18, 13 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Donovan knows Neil. Lennox knows Hayley. Dylan knows Guy. Barney knows Nora. Tonya knows Kai. Kai knows Ray. Hank knows Lennox. Dylan knows Donovan. Kai knows Emily. Dylan knows Milo. Lennox knows Carter. Nora knows Tonya. Jocelyn knows Barney. Jocelyn knows Sydney. Jocelyn knows Louis. Curtis knows Hank. Guy knows Curtis. Louis knows Barry. Which of Lennox and Kai can Jocelyn reach?", "answer": "Kai", "steps": [ "Jocelyn knows Barney.", "Barney knows Nora.", "Nora knows Tonya.", "Tonya knows Kai." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Jocelyn", "Emily", "Kai", "Barry", "Barney", "Tonya", "Sydney", "Nora", "Ray", "Louis", "Dylan", "Carter", "Lennox", "Neil", "Guy", "Hank", "Milo", "Curtis", "Hayley", "Donovan" ], "edges": [ [ 0, 6 ], [ 0, 4 ], [ 0, 9 ], [ 2, 1 ], [ 2, 8 ], [ 4, 7 ], [ 5, 2 ], [ 7, 5 ], [ 9, 3 ], [ 10, 16 ], [ 10, 14 ], [ 10, 19 ], [ 12, 11 ], [ 12, 18 ], [ 14, 17 ], [ 15, 12 ], [ 17, 15 ], [ 19, 13 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Clifford knows Jared. Sally knows Effie. Adam knows Shannon. Jane knows Wilson. Clayton knows Ignacio. Adam knows Jane. Clifford knows Jillian. Jake knows Adam. Wilson knows Pam. Ignacio knows Miles. Sally knows Juan. Clayton knows Edward. Kate knows Ray. Wilson knows Ada. Juan knows Clifford. Miles knows Sally. Simon knows Jake. Kate knows Simon. Which of Jane and Juan can Clayton reach?", "answer": "Juan", "steps": [ "Clayton knows Ignacio.", "Ignacio knows Miles.", "Miles knows Sally.", "Sally knows Juan." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Clayton", "Sally", "Edward", "Clifford", "Jared", "Effie", "Jillian", "Juan", "Ignacio", "Miles", "Kate", "Adam", "Ray", "Wilson", "Pam", "Shannon", "Ada", "Jane", "Simon", "Jake" ], "edges": [ [ 0, 2 ], [ 0, 8 ], [ 1, 5 ], [ 1, 7 ], [ 3, 4 ], [ 3, 6 ], [ 7, 3 ], [ 8, 9 ], [ 9, 1 ], [ 10, 12 ], [ 10, 18 ], [ 11, 15 ], [ 11, 17 ], [ 13, 14 ], [ 13, 16 ], [ 17, 13 ], [ 18, 19 ], [ 19, 11 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Maude knows Casey. Jamie knows Fraser. Uma knows Clay. Yasmin knows Cruz. Clay knows Kristin. Naomi knows Agnes. Fraser knows Denise. Rowan knows Jaime. Devin knows Yasmin. Marcia knows Tina. Terrence knows Jamie. Devin knows Uma. Jamie knows Naomi. Rowan knows Marcia. Brynn knows Terrence. Jaime knows Devin. Brynn knows Maude. Denise knows Erma. Which of Clay and Denise can Rowan reach?", "answer": "Clay", "steps": [ "Rowan knows Jaime.", "Jaime knows Devin.", "Devin knows Uma.", "Uma knows Clay." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Rowan", "Tina", "Cruz", "Uma", "Marcia", "Yasmin", "Clay", "Jaime", "Kristin", "Devin", "Brynn", "Casey", "Agnes", "Fraser", "Maude", "Naomi", "Denise", "Terrence", "Erma", "Jamie" ], "edges": [ [ 0, 4 ], [ 0, 7 ], [ 3, 6 ], [ 4, 1 ], [ 5, 2 ], [ 6, 8 ], [ 7, 9 ], [ 9, 5 ], [ 9, 3 ], [ 10, 14 ], [ 10, 17 ], [ 13, 16 ], [ 14, 11 ], [ 15, 12 ], [ 16, 18 ], [ 17, 19 ], [ 19, 15 ], [ 19, 13 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Sadie knows Darla. Frances knows Sadie. Hayes knows Ruby. Mike knows Hayes. Gina knows Mike. Valerie knows Kylie. Colin knows Valerie. Frances knows Iris. Valerie knows Donald. Charlotte knows Callum. Hayes knows Frances. Phoebe knows Gina. Donald knows Olive. Iris knows Isiah. Riley knows Colin. Walt knows Riley. Donald knows Charlotte. Olive knows Ramon. Which of Iris and Charlotte can Phoebe reach?", "answer": "Iris", "steps": [ "Phoebe knows Gina.", "Gina knows Mike.", "Mike knows Hayes.", "Hayes knows Frances.", "Frances knows Iris." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Phoebe", "Ruby", "Isiah", "Darla", "Mike", "Gina", "Sadie", "Iris", "Hayes", "Frances", "Walt", "Kylie", "Callum", "Ramon", "Colin", "Riley", "Olive", "Charlotte", "Valerie", "Donald" ], "edges": [ [ 0, 5 ], [ 4, 8 ], [ 5, 4 ], [ 6, 3 ], [ 7, 2 ], [ 8, 1 ], [ 8, 9 ], [ 9, 6 ], [ 9, 7 ], [ 10, 15 ], [ 14, 18 ], [ 15, 14 ], [ 16, 13 ], [ 17, 12 ], [ 18, 11 ], [ 18, 19 ], [ 19, 16 ], [ 19, 17 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Dean knows Drake. Chandler knows Fernando. Jarvis knows Skyler. Keegan knows Jarvis. Cody knows Walter. Walter knows Opal. Ernesto knows Seth. Fisher knows Ibrahim. Mia knows Heath. Cody knows Bart. Bart knows Chandler. Keegan knows Alice. Odette knows Cody. Seth knows Mia. Skyler knows Ernesto. Fernando knows Fisher. Jarvis knows Dean. Odette knows Curtis. Which of Ernesto and Chandler can Odette reach?", "answer": "Chandler", "steps": [ "Odette knows Cody.", "Cody knows Bart.", "Bart knows Chandler." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Odette", "Chandler", "Ibrahim", "Fisher", "Bart", "Opal", "Cody", "Curtis", "Fernando", "Walter", "Keegan", "Ernesto", "Heath", "Mia", "Skyler", "Drake", "Jarvis", "Alice", "Seth", "Dean" ], "edges": [ [ 0, 7 ], [ 0, 6 ], [ 1, 8 ], [ 3, 2 ], [ 4, 1 ], [ 6, 4 ], [ 6, 9 ], [ 8, 3 ], [ 9, 5 ], [ 10, 17 ], [ 10, 16 ], [ 11, 18 ], [ 13, 12 ], [ 14, 11 ], [ 16, 14 ], [ 16, 19 ], [ 18, 13 ], [ 19, 15 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Kirk knows Lacey. Yvonne knows Cassidy. Fanny knows Alyssa. Belinda knows Jason. Rhea knows Belinda. Jason knows Isaac. Kirk knows Brody. Jason knows Kirk. Benjamin knows Ashton. Isaac knows Yvonne. Belinda knows Blake. Stella knows Fanny. Adelaide knows Scott. Alyssa knows Benjamin. Adelaide knows Diane. Fanny knows Mark. Ashton knows Dolly. Alyssa knows Adelaide. Which of Benjamin and Isaac can Rhea reach?", "answer": "Isaac", "steps": [ "Rhea knows Belinda.", "Belinda knows Jason.", "Jason knows Isaac." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Rhea", "Brody", "Lacey", "Belinda", "Jason", "Yvonne", "Blake", "Isaac", "Kirk", "Cassidy", "Stella", "Scott", "Diane", "Fanny", "Alyssa", "Ashton", "Mark", "Benjamin", "Adelaide", "Dolly" ], "edges": [ [ 0, 3 ], [ 3, 6 ], [ 3, 4 ], [ 4, 8 ], [ 4, 7 ], [ 5, 9 ], [ 7, 5 ], [ 8, 1 ], [ 8, 2 ], [ 10, 13 ], [ 13, 16 ], [ 13, 14 ], [ 14, 18 ], [ 14, 17 ], [ 15, 19 ], [ 17, 15 ], [ 18, 11 ], [ 18, 12 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Ellen knows Jenna. Essie knows Sybil. Lynn knows Todd. Leopold knows Hugh. Todd knows Dina. Emery knows Ellen. Emery knows Luke. Milton knows Essie. Joan knows Milton. Shelby knows Joan. Milton knows Leopold. Joan knows Travis. Todd knows Fern. Shelby knows Lois. Ellen knows Lynn. Essie knows Pearl. Rufus knows Garrison. Lynn knows Rufus. Which of Fern and Sybil can Shelby reach?", "answer": "Sybil", "steps": [ "Shelby knows Joan.", "Joan knows Milton.", "Milton knows Essie.", "Essie knows Sybil." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Shelby", "Hugh", "Milton", "Joan", "Travis", "Sybil", "Pearl", "Lois", "Essie", "Leopold", "Emery", "Garrison", "Lynn", "Ellen", "Jenna", "Fern", "Dina", "Luke", "Todd", "Rufus" ], "edges": [ [ 0, 7 ], [ 0, 3 ], [ 2, 8 ], [ 2, 9 ], [ 3, 4 ], [ 3, 2 ], [ 8, 5 ], [ 8, 6 ], [ 9, 1 ], [ 10, 17 ], [ 10, 13 ], [ 12, 18 ], [ 12, 19 ], [ 13, 14 ], [ 13, 12 ], [ 18, 15 ], [ 18, 16 ], [ 19, 11 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Carmen knows Alyssa. Miriam knows Austin. Kieran knows Gordon. Kieran knows Miriam. Dominic knows Mark. Austin knows Cassidy. Hilda knows Faith. Essie knows Elmer. Andre knows Daniel. Essie knows Delia. Mark knows Essie. Faith knows Carmen. Andre knows Belinda. Carmen knows Jillian. Merle knows Latoya. Hilda knows Andre. Daniel knows Merle. Dominic knows Kieran. Which of Latoya and Cassidy can Dominic reach?", "answer": "Cassidy", "steps": [ "Dominic knows Kieran.", "Kieran knows Miriam.", "Miriam knows Austin.", "Austin knows Cassidy." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Dominic", "Elmer", "Austin", "Gordon", "Delia", "Kieran", "Mark", "Cassidy", "Miriam", "Essie", "Hilda", "Alyssa", "Merle", "Belinda", "Jillian", "Andre", "Faith", "Latoya", "Daniel", "Carmen" ], "edges": [ [ 0, 5 ], [ 0, 6 ], [ 2, 7 ], [ 5, 3 ], [ 5, 8 ], [ 6, 9 ], [ 8, 2 ], [ 9, 1 ], [ 9, 4 ], [ 10, 15 ], [ 10, 16 ], [ 12, 17 ], [ 15, 13 ], [ 15, 18 ], [ 16, 19 ], [ 18, 12 ], [ 19, 11 ], [ 19, 14 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Austin knows Molly. Laurel knows Anton. Ellis knows Austin. Karen knows Henrietta. Henrietta knows Kingsley. Austin knows Yara. Grady knows Duke. Dahlia knows Laurel. Ivy knows Yvonne. Nadine knows Shane. Kingsley knows Ivy. Yvonne knows Dahlia. Melanie knows Eamon. Kingsley knows Melanie. Molly knows Lola. Kylie knows Ellis. Yara knows Nadine. Shane knows Grady. Which of Ellis and Henrietta can Kylie reach?", "answer": "Ellis", "steps": [ "Kylie knows Ellis." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Kylie", "Molly", "Austin", "Yara", "Grady", "Shane", "Ellis", "Lola", "Duke", "Nadine", "Karen", "Melanie", "Kingsley", "Ivy", "Laurel", "Dahlia", "Henrietta", "Eamon", "Anton", "Yvonne" ], "edges": [ [ 0, 6 ], [ 1, 7 ], [ 2, 1 ], [ 2, 3 ], [ 3, 9 ], [ 4, 8 ], [ 5, 4 ], [ 6, 2 ], [ 9, 5 ], [ 10, 16 ], [ 11, 17 ], [ 12, 11 ], [ 12, 13 ], [ 13, 19 ], [ 14, 18 ], [ 15, 14 ], [ 16, 12 ], [ 19, 15 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Ember knows Marc. Marion knows Arturo. Gertrude knows Delia. Arturo knows Sebastian. Harper knows Chantal. Helene knows Hector. Hayden knows Gertrude. Harry knows Kevin. Donald knows Helene. Sue knows Donald. Kennedy knows Stephanie. Stephanie knows Hayden. Ember knows Harper. Marc knows Kennedy. Arturo knows Sue. Hector knows Harry. Sebastian knows Josie. Abby knows Ember. Which of Hayden and Hector can Marion reach?", "answer": "Hector", "steps": [ "Marion knows Arturo.", "Arturo knows Sue.", "Sue knows Donald.", "Donald knows Helene.", "Helene knows Hector." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Marion", "Helene", "Josie", "Harry", "Arturo", "Sue", "Hector", "Sebastian", "Kevin", "Donald", "Abby", "Stephanie", "Chantal", "Gertrude", "Ember", "Marc", "Hayden", "Harper", "Delia", "Kennedy" ], "edges": [ [ 0, 4 ], [ 1, 6 ], [ 3, 8 ], [ 4, 7 ], [ 4, 5 ], [ 5, 9 ], [ 6, 3 ], [ 7, 2 ], [ 9, 1 ], [ 10, 14 ], [ 11, 16 ], [ 13, 18 ], [ 14, 17 ], [ 14, 15 ], [ 15, 19 ], [ 16, 13 ], [ 17, 12 ], [ 19, 11 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Omar knows Floyd. Karl knows Lucia. Floyd knows Arden. Troy knows Kurt. Natalie knows Jana. Natalie knows Jared. Zack knows Louisa. Adelaide knows Casey. Victoria knows Earl. Floyd knows Julian. Lucia knows Dawn. Kevin knows Karl. Adelaide knows Zack. Omar knows Adelaide. Earl knows Logan. Casey knows Troy. Kevin knows Natalie. Karl knows Victoria. Which of Earl and Troy can Kevin reach?", "answer": "Earl", "steps": [ "Kevin knows Karl.", "Karl knows Victoria.", "Victoria knows Earl." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Kevin", "Jared", "Natalie", "Lucia", "Logan", "Victoria", "Jana", "Dawn", "Karl", "Earl", "Omar", "Julian", "Floyd", "Zack", "Kurt", "Casey", "Arden", "Louisa", "Adelaide", "Troy" ], "edges": [ [ 0, 2 ], [ 0, 8 ], [ 2, 1 ], [ 2, 6 ], [ 3, 7 ], [ 5, 9 ], [ 8, 3 ], [ 8, 5 ], [ 9, 4 ], [ 10, 12 ], [ 10, 18 ], [ 12, 11 ], [ 12, 16 ], [ 13, 17 ], [ 15, 19 ], [ 18, 13 ], [ 18, 15 ], [ 19, 14 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Fern knows Jacques. Dalton knows Larry. Jacques knows Adrian. Elliot knows Harris. Belinda knows Frances. Belinda knows Noah. Ivan knows Fern. Larry knows Yolanda. Imogen knows Dalton. Frances knows Keira. Fiona knows Kerry. Damian knows Belinda. Zelda knows Imogen. Kerry knows Zelda. Yolanda knows Don. Adrian knows Damian. Larry knows Elliot. Noah knows Joseph. Which of Don and Joseph can Fiona reach?", "answer": "Don", "steps": [ "Fiona knows Kerry.", "Kerry knows Zelda.", "Zelda knows Imogen.", "Imogen knows Dalton.", "Dalton knows Larry.", "Larry knows Yolanda.", "Yolanda knows Don." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Fiona", "Larry", "Kerry", "Harris", "Don", "Elliot", "Dalton", "Imogen", "Zelda", "Yolanda", "Ivan", "Belinda", "Fern", "Keira", "Joseph", "Frances", "Damian", "Adrian", "Jacques", "Noah" ], "edges": [ [ 0, 2 ], [ 1, 5 ], [ 1, 9 ], [ 2, 8 ], [ 5, 3 ], [ 6, 1 ], [ 7, 6 ], [ 8, 7 ], [ 9, 4 ], [ 10, 12 ], [ 11, 15 ], [ 11, 19 ], [ 12, 18 ], [ 15, 13 ], [ 16, 11 ], [ 17, 16 ], [ 18, 17 ], [ 19, 14 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Chloe knows Chester. Benjamin knows Claude. Otto knows Kieran. Sue knows Dayton. Lily knows Otto. Benjamin knows Charles. Otto knows Wendy. Chloe knows Laura. Noel knows Chloe. Chloe knows Devin. Otto knows Boyd. Lily knows Jacqueline. Kieran knows Benjamin. Noel knows Isabel. Sue knows Gareth. Noel knows Grady. Laura knows Sue. Lily knows Margaret. Which of Chloe and Otto can Noel reach?", "answer": "Chloe", "steps": [ "Noel knows Chloe." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Noel", "Chester", "Chloe", "Gareth", "Dayton", "Devin", "Grady", "Sue", "Isabel", "Laura", "Lily", "Boyd", "Otto", "Charles", "Claude", "Wendy", "Margaret", "Benjamin", "Jacqueline", "Kieran" ], "edges": [ [ 0, 6 ], [ 0, 8 ], [ 0, 2 ], [ 2, 1 ], [ 2, 5 ], [ 2, 9 ], [ 7, 3 ], [ 7, 4 ], [ 9, 7 ], [ 10, 16 ], [ 10, 18 ], [ 10, 12 ], [ 12, 11 ], [ 12, 15 ], [ 12, 19 ], [ 17, 13 ], [ 17, 14 ], [ 19, 17 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Felix knows Mike. Alma knows Harry. Grace knows Enrique. Emily knows Grace. Harry knows Howard. Mike knows Ray. Jerome knows Jakob. Ray knows Todd. Jakob knows Ellis. Kara knows Brody. Mike knows Yasmin. Todd knows Jerome. Lorenzo knows Kara. Brody knows Cruz. Ellis knows Jessica. Enrique knows Lorenzo. Harry knows Emily. Jessica knows Blanche. Which of Jakob and Lorenzo can Felix reach?", "answer": "Jakob", "steps": [ "Felix knows Mike.", "Mike knows Ray.", "Ray knows Todd.", "Todd knows Jerome.", "Jerome knows Jakob." ], "difficulty": 5, "original_distance": 8, "idx_to_symbol": [ "Felix", "Blanche", "Mike", "Ray", "Jakob", "Yasmin", "Todd", "Jessica", "Ellis", "Jerome", "Alma", "Cruz", "Harry", "Emily", "Lorenzo", "Howard", "Grace", "Brody", "Kara", "Enrique" ], "edges": [ [ 0, 2 ], [ 2, 5 ], [ 2, 3 ], [ 3, 6 ], [ 4, 8 ], [ 6, 9 ], [ 7, 1 ], [ 8, 7 ], [ 9, 4 ], [ 10, 12 ], [ 12, 15 ], [ 12, 13 ], [ 13, 16 ], [ 14, 18 ], [ 16, 19 ], [ 17, 11 ], [ 18, 17 ], [ 19, 14 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Ariel knows Hope. Tyler knows Fritz. Marcia knows Celia. Henry knows Jeffery. Tyler knows Mary. Tyler knows Cruz. Brandon knows Constance. Brandon knows Ariel. Mary knows Leslie. Brandon knows Alvin. Celia knows Frank. Marcia knows Ebony. Chance knows Sonia. Henry knows Pearl. Leslie knows Brandon. Frank knows Henry. Marcia knows Allison. Henry knows Chance. Which of Chance and Ariel can Tyler reach?", "answer": "Ariel", "steps": [ "Tyler knows Mary.", "Mary knows Leslie.", "Leslie knows Brandon.", "Brandon knows Ariel." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Tyler", "Mary", "Constance", "Hope", "Leslie", "Cruz", "Ariel", "Fritz", "Brandon", "Alvin", "Marcia", "Celia", "Jeffery", "Sonia", "Frank", "Ebony", "Chance", "Allison", "Henry", "Pearl" ], "edges": [ [ 0, 5 ], [ 0, 7 ], [ 0, 1 ], [ 1, 4 ], [ 4, 8 ], [ 6, 3 ], [ 8, 2 ], [ 8, 6 ], [ 8, 9 ], [ 10, 15 ], [ 10, 17 ], [ 10, 11 ], [ 11, 14 ], [ 14, 18 ], [ 16, 13 ], [ 18, 12 ], [ 18, 16 ], [ 18, 19 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Richard knows Erin. Darrell knows Hank. Ainsley knows Darla. Hamilton knows Elliot. Elliot knows Maude. Elliot knows Mack. Darla knows Reed. Richard knows Dean. Elliot knows Shawn. Aurora knows Jason. Dean knows Aurora. Dominic knows Jorge. Aurora knows Ainsley. Aurora knows Enrique. Dominic knows Hamilton. Maude knows Darrell. Darrell knows Connor. Darla knows Joyce. Which of Ainsley and Maude can Richard reach?", "answer": "Ainsley", "steps": [ "Richard knows Dean.", "Dean knows Aurora.", "Aurora knows Ainsley." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Richard", "Enrique", "Dean", "Ainsley", "Reed", "Darla", "Jason", "Joyce", "Aurora", "Erin", "Dominic", "Shawn", "Hamilton", "Maude", "Connor", "Darrell", "Mack", "Hank", "Elliot", "Jorge" ], "edges": [ [ 0, 2 ], [ 0, 9 ], [ 2, 8 ], [ 3, 5 ], [ 5, 4 ], [ 5, 7 ], [ 8, 1 ], [ 8, 6 ], [ 8, 3 ], [ 10, 12 ], [ 10, 19 ], [ 12, 18 ], [ 13, 15 ], [ 15, 14 ], [ 15, 17 ], [ 18, 11 ], [ 18, 16 ], [ 18, 13 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Judith knows Pearl. Tessa knows Ernesto. Diane knows Anastasia. Helen knows Heath. Jared knows Tessa. Elodie knows Chance. Jared knows Doris. Jared knows Gunnar. Gunnar knows Celeste. Denver knows James. Chance knows Judith. Pearl knows Diane. Heath knows Dina. Chance knows Charity. Heath knows Levi. Levi knows Jared. Pearl knows Jessie. Pearl knows Denver. Which of Levi and Judith can Helen reach?", "answer": "Levi", "steps": [ "Helen knows Heath.", "Heath knows Levi." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Helen", "Gunnar", "Levi", "Doris", "Heath", "Jared", "Ernesto", "Celeste", "Tessa", "Dina", "Elodie", "Diane", "Judith", "Jessie", "Chance", "Pearl", "James", "Anastasia", "Denver", "Charity" ], "edges": [ [ 0, 4 ], [ 1, 7 ], [ 2, 5 ], [ 4, 2 ], [ 4, 9 ], [ 5, 3 ], [ 5, 1 ], [ 5, 8 ], [ 8, 6 ], [ 10, 14 ], [ 11, 17 ], [ 12, 15 ], [ 14, 12 ], [ 14, 19 ], [ 15, 13 ], [ 15, 11 ], [ 15, 18 ], [ 18, 16 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Chantal knows Curtis. Vivian knows James. Sydney knows Don. Don knows Benjamin. Lars knows Sydney. Calvin knows Heidi. Wanda knows Enid. Clinton knows Bruno. Clarissa knows Violet. Kenzie knows Calvin. Violet knows Wanda. Benjamin knows Kenzie. Marcia knows Clarissa. James knows Marcia. Benjamin knows Kent. Bruno knows Vivian. Curtis knows Lars. Clarissa knows Destiny. Which of Benjamin and Clarissa can Chantal reach?", "answer": "Benjamin", "steps": [ "Chantal knows Curtis.", "Curtis knows Lars.", "Lars knows Sydney.", "Sydney knows Don.", "Don knows Benjamin." ], "difficulty": 5, "original_distance": 8, "idx_to_symbol": [ "Chantal", "Curtis", "Don", "Kent", "Lars", "Benjamin", "Kenzie", "Sydney", "Calvin", "Heidi", "Clinton", "Bruno", "Marcia", "Destiny", "Vivian", "Clarissa", "Violet", "James", "Wanda", "Enid" ], "edges": [ [ 0, 1 ], [ 1, 4 ], [ 2, 5 ], [ 4, 7 ], [ 5, 3 ], [ 5, 6 ], [ 6, 8 ], [ 7, 2 ], [ 8, 9 ], [ 10, 11 ], [ 11, 14 ], [ 12, 15 ], [ 14, 17 ], [ 15, 13 ], [ 15, 16 ], [ 16, 18 ], [ 17, 12 ], [ 18, 19 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Perry knows Javier. Cornelius knows Dick. Leopold knows Gordon. Marie knows Alex. Perry knows Leopold. Jonas knows Marie. Kylie knows Enid. Cornelius knows Jordan. Enid knows Gina. Earle knows Cornelius. Leopold knows Neville. Dick knows Travis. Kylie knows Deanna. Enid knows Earle. Marie knows Darius. Dick knows Alexa. Jonas knows Gregory. Gordon knows Jonas. Which of Jonas and Cornelius can Perry reach?", "answer": "Jonas", "steps": [ "Perry knows Leopold.", "Leopold knows Gordon.", "Gordon knows Jonas." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Perry", "Neville", "Alex", "Jonas", "Leopold", "Marie", "Javier", "Gregory", "Darius", "Gordon", "Kylie", "Gina", "Alexa", "Cornelius", "Enid", "Dick", "Deanna", "Jordan", "Travis", "Earle" ], "edges": [ [ 0, 6 ], [ 0, 4 ], [ 3, 7 ], [ 3, 5 ], [ 4, 1 ], [ 4, 9 ], [ 5, 2 ], [ 5, 8 ], [ 9, 3 ], [ 10, 16 ], [ 10, 14 ], [ 13, 17 ], [ 13, 15 ], [ 14, 11 ], [ 14, 19 ], [ 15, 12 ], [ 15, 18 ], [ 19, 13 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Yvette knows Regina. Christina knows Celeste. Joanna knows Sue. Patrick knows Electra. Sue knows Yvette. Patrick knows Georgia. Joanna knows Christina. Alison knows Stephanie. Georgia knows Glen. Patrick knows Declan. Sue knows Isla. Georgia knows Alison. Joanna knows Frank. Joanna knows Barbara. Yvette knows Kennedy. Declan knows Gustavo. Alison knows Chance. Patrick knows India. Which of Chance and Regina can Joanna reach?", "answer": "Regina", "steps": [ "Joanna knows Sue.", "Sue knows Yvette.", "Yvette knows Regina." ], "difficulty": 3, "original_distance": 3, "idx_to_symbol": [ "Joanna", "Yvette", "Christina", "Isla", "Sue", "Frank", "Kennedy", "Barbara", "Celeste", "Regina", "Patrick", "Alison", "Declan", "Glen", "Georgia", "India", "Stephanie", "Electra", "Gustavo", "Chance" ], "edges": [ [ 0, 5 ], [ 0, 7 ], [ 0, 2 ], [ 0, 4 ], [ 1, 6 ], [ 1, 9 ], [ 2, 8 ], [ 4, 3 ], [ 4, 1 ], [ 10, 15 ], [ 10, 17 ], [ 10, 12 ], [ 10, 14 ], [ 11, 16 ], [ 11, 19 ], [ 12, 18 ], [ 14, 13 ], [ 14, 11 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Adam knows Jenna. Lucy knows Colby. Emanuel knows Dirk. Helene knows Emanuel. Jenna knows Lucy. Arturo knows Chloe. Beverly knows Alana. Simon knows Constance. Simon knows Aubrey. Rowan knows Lydia. Alana knows Kendra. Franklin knows Helene. Franklin knows Alejandro. Lucy knows Simon. Constance knows Beverly. Dirk knows Robert. Arturo knows Franklin. Lydia knows Arturo. Which of Franklin and Simon can Rowan reach?", "answer": "Franklin", "steps": [ "Rowan knows Lydia.", "Lydia knows Arturo.", "Arturo knows Franklin." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Rowan", "Chloe", "Franklin", "Arturo", "Dirk", "Emanuel", "Helene", "Lydia", "Alejandro", "Robert", "Adam", "Colby", "Simon", "Lucy", "Alana", "Beverly", "Constance", "Jenna", "Aubrey", "Kendra" ], "edges": [ [ 0, 7 ], [ 2, 8 ], [ 2, 6 ], [ 3, 1 ], [ 3, 2 ], [ 4, 9 ], [ 5, 4 ], [ 6, 5 ], [ 7, 3 ], [ 10, 17 ], [ 12, 18 ], [ 12, 16 ], [ 13, 11 ], [ 13, 12 ], [ 14, 19 ], [ 15, 14 ], [ 16, 15 ], [ 17, 13 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Amelia knows Pearl. Amelia knows Chloe. Chloe knows Aisha. Dustin knows Olivia. Lacey knows Dustin. Walt knows Paul. Theodore knows Esme. Walt knows Inez. Aisha knows Clifford. Aisha knows Dakota. Aisha knows Fleur. Ken knows Clayton. Olivia knows Walt. Dakota knows Theodore. Trudy knows Amelia. Grady knows Ken. Dustin knows Val. Walt knows Grady. Which of Dakota and Grady can Lacey reach?", "answer": "Grady", "steps": [ "Lacey knows Dustin.", "Dustin knows Olivia.", "Olivia knows Walt.", "Walt knows Grady." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Lacey", "Inez", "Olivia", "Walt", "Val", "Ken", "Clayton", "Grady", "Dustin", "Paul", "Trudy", "Fleur", "Chloe", "Aisha", "Pearl", "Theodore", "Esme", "Dakota", "Amelia", "Clifford" ], "edges": [ [ 0, 8 ], [ 2, 3 ], [ 3, 1 ], [ 3, 7 ], [ 3, 9 ], [ 5, 6 ], [ 7, 5 ], [ 8, 4 ], [ 8, 2 ], [ 10, 18 ], [ 12, 13 ], [ 13, 11 ], [ 13, 17 ], [ 13, 19 ], [ 15, 16 ], [ 17, 15 ], [ 18, 14 ], [ 18, 12 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Lena knows Atlas. Lena knows Reed. Taylor knows Erwin. Lena knows Alana. Alexa knows Arnold. Drake knows Keaton. Geoffrey knows Stephanie. Keaton knows Wade. Ezra knows Drake. Lena knows Ezra. Atlas knows Rosemary. Arnold knows Tiffany. Stacy knows Taylor. Reed knows Corey. Stacy knows Geoffrey. Stacy knows Calvin. Jerome knows Alexa. Stacy knows Jerome. Which of Jerome and Ezra can Lena reach?", "answer": "Ezra", "steps": [ "Lena knows Ezra." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Lena", "Alana", "Corey", "Atlas", "Keaton", "Wade", "Drake", "Rosemary", "Reed", "Ezra", "Stacy", "Calvin", "Stephanie", "Taylor", "Arnold", "Tiffany", "Alexa", "Erwin", "Geoffrey", "Jerome" ], "edges": [ [ 0, 1 ], [ 0, 3 ], [ 0, 8 ], [ 0, 9 ], [ 3, 7 ], [ 4, 5 ], [ 6, 4 ], [ 8, 2 ], [ 9, 6 ], [ 10, 11 ], [ 10, 13 ], [ 10, 18 ], [ 10, 19 ], [ 13, 17 ], [ 14, 15 ], [ 16, 14 ], [ 18, 12 ], [ 19, 16 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Pearl knows Dante. Ellen knows Carey. Adele knows Conner. Tabitha knows Emily. Tiffany knows Oscar. Carey knows Julie. Franklin knows Edgar. Tiffany knows Conrad. Heather knows Tabitha. Adele knows Ron. Edgar knows Jasmine. Franklin knows Ellen. Emily knows Adele. Tiffany knows Naomi. Jasmine knows Tiffany. Adele knows Shannon. Heather knows Larry. Larry knows Pearl. Which of Shannon and Oscar can Heather reach?", "answer": "Shannon", "steps": [ "Heather knows Tabitha.", "Tabitha knows Emily.", "Emily knows Adele.", "Adele knows Shannon." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Heather", "Larry", "Tabitha", "Shannon", "Conner", "Pearl", "Emily", "Dante", "Adele", "Ron", "Franklin", "Ellen", "Edgar", "Oscar", "Naomi", "Carey", "Jasmine", "Julie", "Tiffany", "Conrad" ], "edges": [ [ 0, 1 ], [ 0, 2 ], [ 1, 5 ], [ 2, 6 ], [ 5, 7 ], [ 6, 8 ], [ 8, 3 ], [ 8, 4 ], [ 8, 9 ], [ 10, 11 ], [ 10, 12 ], [ 11, 15 ], [ 12, 16 ], [ 15, 17 ], [ 16, 18 ], [ 18, 13 ], [ 18, 14 ], [ 18, 19 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Opal knows Harris. Opal knows Lee. Jon knows Austin. April knows Ralph. Aurora knows Jenny. Jon knows Kamila. Della knows Jon. Kendrick knows Aurora. Kendrick knows Dylan. Harris knows Shannon. Jon knows Cornelius. Gwen knows Damian. Damian knows April. Damian knows Giselle. Opal knows Gwen. Cornelius knows Isadora. Austin knows Kendrick. Dorian knows Opal. Which of April and Aurora can Della reach?", "answer": "Aurora", "steps": [ "Della knows Jon.", "Jon knows Austin.", "Austin knows Kendrick.", "Kendrick knows Aurora." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Della", "Dylan", "Isadora", "Kamila", "Kendrick", "Jenny", "Aurora", "Cornelius", "Austin", "Jon", "Dorian", "Giselle", "Shannon", "Lee", "Damian", "Ralph", "April", "Harris", "Gwen", "Opal" ], "edges": [ [ 0, 9 ], [ 4, 1 ], [ 4, 6 ], [ 6, 5 ], [ 7, 2 ], [ 8, 4 ], [ 9, 3 ], [ 9, 7 ], [ 9, 8 ], [ 10, 19 ], [ 14, 11 ], [ 14, 16 ], [ 16, 15 ], [ 17, 12 ], [ 18, 14 ], [ 19, 13 ], [ 19, 17 ], [ 19, 18 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Antonio knows Margaret. Dirk knows Mitchell. Margaret knows Sonia. Lucia knows Constance. Isaac knows Emmett. Magdalena knows Isaac. Glenn knows Essie. Serena knows Glenn. Khashayar knows Riley. Sonia knows Khashayar. Constance knows Jasmine. Lucia knows Dirk. Emmett knows Bailey. Tyler knows Javier. Mitchell knows Brent. Tyler knows Serena. Jasmine knows Magdalena. Javier knows Antonio. Which of Antonio and Jasmine can Lucia reach?", "answer": "Jasmine", "steps": [ "Lucia knows Constance.", "Constance knows Jasmine." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Lucia", "Dirk", "Brent", "Bailey", "Magdalena", "Mitchell", "Jasmine", "Isaac", "Constance", "Emmett", "Tyler", "Serena", "Essie", "Riley", "Margaret", "Glenn", "Antonio", "Sonia", "Javier", "Khashayar" ], "edges": [ [ 0, 1 ], [ 0, 8 ], [ 1, 5 ], [ 4, 7 ], [ 5, 2 ], [ 6, 4 ], [ 7, 9 ], [ 8, 6 ], [ 9, 3 ], [ 10, 11 ], [ 10, 18 ], [ 11, 15 ], [ 14, 17 ], [ 15, 12 ], [ 16, 14 ], [ 17, 19 ], [ 18, 16 ], [ 19, 13 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Charlene knows Pearl. Maude knows Colby. Karl knows Leon. Maggie knows Ibrahim. Marco knows Walt. Colby knows Marco. June knows Isadora. Isadora knows Ignacio. Walt knows Alan. Ibrahim knows Fernando. Kathleen knows Gage. Anita knows Charlene. Marco knows June. Colby knows Karl. Charlene knows Maggie. Gage knows Ruby. Pearl knows Ivan. Maggie knows Kathleen. Which of Ignacio and Ruby can Maude reach?", "answer": "Ignacio", "steps": [ "Maude knows Colby.", "Colby knows Marco.", "Marco knows June.", "June knows Isadora.", "Isadora knows Ignacio." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Maude", "Ignacio", "Karl", "Marco", "Walt", "Isadora", "Leon", "June", "Colby", "Alan", "Anita", "Ruby", "Pearl", "Maggie", "Ibrahim", "Gage", "Ivan", "Kathleen", "Charlene", "Fernando" ], "edges": [ [ 0, 8 ], [ 2, 6 ], [ 3, 7 ], [ 3, 4 ], [ 4, 9 ], [ 5, 1 ], [ 7, 5 ], [ 8, 2 ], [ 8, 3 ], [ 10, 18 ], [ 12, 16 ], [ 13, 17 ], [ 13, 14 ], [ 14, 19 ], [ 15, 11 ], [ 17, 15 ], [ 18, 12 ], [ 18, 13 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Jackson knows Ivy. Mike knows Sarah. Jolena knows Erica. Fleur knows Reed. Ivy knows Jolena. Priscilla knows Doug. Dixie knows Jose. Jackson knows Sandra. Kylie knows Ron. Jose knows Priscilla. Dixie knows Kylie. Doug knows Rosemary. Mike knows Jackson. Mike knows Fleur. Dixie knows Eunice. Jose knows Noah. Jackson knows Hugh. Jose knows Catherine. Which of Doug and Jolena can Dixie reach?", "answer": "Doug", "steps": [ "Dixie knows Jose.", "Jose knows Priscilla.", "Priscilla knows Doug." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Dixie", "Jose", "Catherine", "Doug", "Rosemary", "Noah", "Eunice", "Ron", "Priscilla", "Kylie", "Mike", "Jackson", "Sandra", "Jolena", "Erica", "Hugh", "Sarah", "Reed", "Ivy", "Fleur" ], "edges": [ [ 0, 6 ], [ 0, 1 ], [ 0, 9 ], [ 1, 2 ], [ 1, 5 ], [ 1, 8 ], [ 3, 4 ], [ 8, 3 ], [ 9, 7 ], [ 10, 16 ], [ 10, 11 ], [ 10, 19 ], [ 11, 12 ], [ 11, 15 ], [ 11, 18 ], [ 13, 14 ], [ 18, 13 ], [ 19, 17 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Lucy knows Vincent. Colby knows Jakob. Charity knows Colby. Leopold knows Lydia. Charity knows Houston. Lydia knows Byron. Randy knows Irving. August knows Annie. Vincent knows August. Annie knows Zoe. Zoe knows Eric. Kieran knows Charity. Houston knows Leopold. Tabitha knows Lucy. Eric knows Sharon. August knows Randy. Edward knows Tom. Tom knows Kieran. Which of Leopold and Zoe can Tabitha reach?", "answer": "Zoe", "steps": [ "Tabitha knows Lucy.", "Lucy knows Vincent.", "Vincent knows August.", "August knows Annie.", "Annie knows Zoe." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Tabitha", "August", "Irving", "Lucy", "Randy", "Vincent", "Annie", "Sharon", "Zoe", "Eric", "Edward", "Charity", "Jakob", "Tom", "Colby", "Kieran", "Houston", "Byron", "Leopold", "Lydia" ], "edges": [ [ 0, 3 ], [ 1, 4 ], [ 1, 6 ], [ 3, 5 ], [ 4, 2 ], [ 5, 1 ], [ 6, 8 ], [ 8, 9 ], [ 9, 7 ], [ 10, 13 ], [ 11, 14 ], [ 11, 16 ], [ 13, 15 ], [ 14, 12 ], [ 15, 11 ], [ 16, 18 ], [ 18, 19 ], [ 19, 17 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Ava knows Geneva. Henry knows Christian. Percy knows Faye. Gavin knows Amanda. Earl knows Ava. Earl knows Kieran. Chad knows Gavin. Henry knows Edith. Chad knows Percy. Faye knows Selena. Edith knows Jolene. Christian knows Earl. Selena knows Sydney. Edith knows Ann. Faye knows Jameson. Ann knows Jermaine. Grover knows Jeff. Gavin knows Grover. Which of Percy and Christian can Henry reach?", "answer": "Christian", "steps": [ "Henry knows Christian." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Henry", "Jolene", "Ann", "Jermaine", "Christian", "Geneva", "Ava", "Kieran", "Earl", "Edith", "Chad", "Amanda", "Grover", "Jeff", "Percy", "Sydney", "Selena", "Jameson", "Faye", "Gavin" ], "edges": [ [ 0, 4 ], [ 0, 9 ], [ 2, 3 ], [ 4, 8 ], [ 6, 5 ], [ 8, 6 ], [ 8, 7 ], [ 9, 1 ], [ 9, 2 ], [ 10, 14 ], [ 10, 19 ], [ 12, 13 ], [ 14, 18 ], [ 16, 15 ], [ 18, 16 ], [ 18, 17 ], [ 19, 11 ], [ 19, 12 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Ava knows Rebecca. Rebecca knows Ross. Ian knows Cole. Florence knows Antonio. Livia knows Lloyd. Gemma knows Esther. Gemma knows Ian. Florence knows Ava. Harlan knows Max. Rebecca knows Tristan. Rosemary knows Florence. Cole knows Alyson. Tristan knows Greg. Harlan knows Rosemary. Cole knows Nicole. Louise knows Samantha. Nicole knows Louise. Louise knows Livia. Which of Tristan and Livia can Gemma reach?", "answer": "Livia", "steps": [ "Gemma knows Ian.", "Ian knows Cole.", "Cole knows Nicole.", "Nicole knows Louise.", "Louise knows Livia." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Gemma", "Samantha", "Ian", "Livia", "Cole", "Louise", "Esther", "Nicole", "Lloyd", "Alyson", "Harlan", "Ross", "Rosemary", "Tristan", "Florence", "Rebecca", "Max", "Ava", "Greg", "Antonio" ], "edges": [ [ 0, 6 ], [ 0, 2 ], [ 2, 4 ], [ 3, 8 ], [ 4, 7 ], [ 4, 9 ], [ 5, 1 ], [ 5, 3 ], [ 7, 5 ], [ 10, 16 ], [ 10, 12 ], [ 12, 14 ], [ 13, 18 ], [ 14, 17 ], [ 14, 19 ], [ 15, 11 ], [ 15, 13 ], [ 17, 15 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Zelda knows Diego. Ira knows Gunnar. Mack knows Essie. Landon knows Elsa. Landon knows Walt. Landon knows Randy. Mack knows Conrad. Emma knows Isiah. Howard knows Roland. Emma knows Lawson. Ashton knows Esme. Diego knows Ira. Howard knows Becky. Walt knows Emma. Zelda knows Mack. Walt knows Ashton. Esme knows Geoffrey. Howard knows Zelda. Which of Ashton and Diego can Howard reach?", "answer": "Diego", "steps": [ "Howard knows Zelda.", "Zelda knows Diego." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Howard", "Mack", "Roland", "Becky", "Ira", "Diego", "Zelda", "Gunnar", "Essie", "Conrad", "Landon", "Emma", "Randy", "Elsa", "Esme", "Ashton", "Walt", "Geoffrey", "Lawson", "Isiah" ], "edges": [ [ 0, 2 ], [ 0, 3 ], [ 0, 6 ], [ 1, 8 ], [ 1, 9 ], [ 4, 7 ], [ 5, 4 ], [ 6, 5 ], [ 6, 1 ], [ 10, 12 ], [ 10, 13 ], [ 10, 16 ], [ 11, 18 ], [ 11, 19 ], [ 14, 17 ], [ 15, 14 ], [ 16, 15 ], [ 16, 11 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Hadley knows Wendell. Noel knows Coral. Louisa knows Hadley. Colin knows Edward. Pauline knows Tristan. Noel knows Alder. Coral knows Fisher. Wendell knows Amanda. Wendell knows Colin. Marcia knows Kim. Alder knows Randall. Hadley knows Pauline. Fisher knows Albert. Coral knows Dale. Edward knows Samantha. Marcia knows Noel. Albert knows Atlas. Louisa knows Dakota. Which of Noel and Hadley can Marcia reach?", "answer": "Noel", "steps": [ "Marcia knows Noel." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Marcia", "Alder", "Atlas", "Coral", "Kim", "Noel", "Fisher", "Randall", "Dale", "Albert", "Louisa", "Pauline", "Samantha", "Wendell", "Dakota", "Hadley", "Colin", "Tristan", "Amanda", "Edward" ], "edges": [ [ 0, 4 ], [ 0, 5 ], [ 1, 7 ], [ 3, 8 ], [ 3, 6 ], [ 5, 1 ], [ 5, 3 ], [ 6, 9 ], [ 9, 2 ], [ 10, 14 ], [ 10, 15 ], [ 11, 17 ], [ 13, 18 ], [ 13, 16 ], [ 15, 11 ], [ 15, 13 ], [ 16, 19 ], [ 19, 12 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Sidney knows Willis. Fanny knows Lloyd. Chester knows Sidney. Harold knows Harry. Lloyd knows Chester. Willis knows Yolanda. Harold knows Luella. Laverne knows Anton. Wendell knows Harold. Willis knows Betty. Sidney knows Callum. Wendell knows Alison. Chester knows Sandra. Lloyd knows Etta. Anton knows Griffith. Anton knows Curtis. Griffith knows Wendell. Griffith knows Finn. Which of Chester and Griffith can Fanny reach?", "answer": "Chester", "steps": [ "Fanny knows Lloyd.", "Lloyd knows Chester." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Fanny", "Callum", "Willis", "Etta", "Yolanda", "Chester", "Betty", "Lloyd", "Sandra", "Sidney", "Laverne", "Alison", "Harold", "Curtis", "Luella", "Griffith", "Harry", "Anton", "Finn", "Wendell" ], "edges": [ [ 0, 7 ], [ 2, 4 ], [ 2, 6 ], [ 5, 8 ], [ 5, 9 ], [ 7, 3 ], [ 7, 5 ], [ 9, 1 ], [ 9, 2 ], [ 10, 17 ], [ 12, 14 ], [ 12, 16 ], [ 15, 18 ], [ 15, 19 ], [ 17, 13 ], [ 17, 15 ], [ 19, 11 ], [ 19, 12 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Jack knows Gavin. Davis knows Allan. Darrell knows Anthony. Jack knows Whitney. Dora knows Lynn. Federico knows Ignacio. Federico knows Demetrius. Anthony knows Martha. Jack knows Jaime. Dora knows Renee. Virginia knows Jack. Anthony knows Jonah. Whitney knows Dora. Faye knows Jean. Allan knows Virginia. Anthony knows Clement. Jean knows Darrell. Martha knows Federico. Which of Jack and Anthony can Faye reach?", "answer": "Anthony", "steps": [ "Faye knows Jean.", "Jean knows Darrell.", "Darrell knows Anthony." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Faye", "Jonah", "Jean", "Martha", "Darrell", "Clement", "Federico", "Ignacio", "Anthony", "Demetrius", "Davis", "Gavin", "Allan", "Whitney", "Virginia", "Jaime", "Dora", "Lynn", "Jack", "Renee" ], "edges": [ [ 0, 2 ], [ 2, 4 ], [ 3, 6 ], [ 4, 8 ], [ 6, 7 ], [ 6, 9 ], [ 8, 1 ], [ 8, 5 ], [ 8, 3 ], [ 10, 12 ], [ 12, 14 ], [ 13, 16 ], [ 14, 18 ], [ 16, 17 ], [ 16, 19 ], [ 18, 11 ], [ 18, 15 ], [ 18, 13 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Jules knows Estelle. Edmund knows Opal. Hazel knows Layla. Malik knows Hazel. Hazel knows Floyd. Dwight knows Joanna. Penny knows Darla. Opal knows Dwight. Carol knows Hope. Carol knows Penny. Dwight knows Robert. Katrina knows Edmund. Joanna knows Jules. Edmund knows Marilyn. Michael knows Carol. Michael knows Gerald. Joanna knows Preston. Layla knows Michael. Which of Layla and Opal can Katrina reach?", "answer": "Opal", "steps": [ "Katrina knows Edmund.", "Edmund knows Opal." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Katrina", "Marilyn", "Estelle", "Opal", "Joanna", "Robert", "Jules", "Dwight", "Preston", "Edmund", "Malik", "Floyd", "Darla", "Layla", "Carol", "Gerald", "Penny", "Michael", "Hope", "Hazel" ], "edges": [ [ 0, 9 ], [ 3, 7 ], [ 4, 6 ], [ 4, 8 ], [ 6, 2 ], [ 7, 5 ], [ 7, 4 ], [ 9, 1 ], [ 9, 3 ], [ 10, 19 ], [ 13, 17 ], [ 14, 16 ], [ 14, 18 ], [ 16, 12 ], [ 17, 15 ], [ 17, 14 ], [ 19, 11 ], [ 19, 13 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Lisa knows Ruby. Marshall knows Iris. Barney knows Marshall. Ruby knows Aisha. Connor knows Shane. Eamon knows Denise. Marshall knows Justine. Shane knows Andre. Eugene knows Barney. Emily knows Kelsey. Justine knows Eamon. Ruby knows Emily. Holly knows Leland. Andre knows Camden. Willis knows Eugene. Aisha knows Connor. Eugene knows Holly. Connor knows Marcia. Which of Camden and Denise can Willis reach?", "answer": "Denise", "steps": [ "Willis knows Eugene.", "Eugene knows Barney.", "Barney knows Marshall.", "Marshall knows Justine.", "Justine knows Eamon.", "Eamon knows Denise." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Willis", "Denise", "Justine", "Barney", "Eamon", "Holly", "Iris", "Marshall", "Eugene", "Leland", "Lisa", "Camden", "Shane", "Aisha", "Andre", "Emily", "Marcia", "Connor", "Ruby", "Kelsey" ], "edges": [ [ 0, 8 ], [ 2, 4 ], [ 3, 7 ], [ 4, 1 ], [ 5, 9 ], [ 7, 2 ], [ 7, 6 ], [ 8, 3 ], [ 8, 5 ], [ 10, 18 ], [ 12, 14 ], [ 13, 17 ], [ 14, 11 ], [ 15, 19 ], [ 17, 12 ], [ 17, 16 ], [ 18, 13 ], [ 18, 15 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Teresa knows Brad. Hal knows Itzel. Roy knows Cain. Roy knows Todd. Teresa knows Beau. Beau knows Veronica. Beau knows Norman. Brad knows Owen. Aurora knows Terrence. Jerry knows Stephen. Brock knows Hal. Brock knows Allan. Chandler knows Elias. Aurora knows Roy. Allan knows Teresa. Terrence knows Lucas. Stephen knows Aurora. Jerry knows Chandler. Which of Aurora and Teresa can Jerry reach?", "answer": "Aurora", "steps": [ "Jerry knows Stephen.", "Stephen knows Aurora." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Jerry", "Cain", "Elias", "Roy", "Todd", "Terrence", "Stephen", "Aurora", "Chandler", "Lucas", "Brock", "Veronica", "Itzel", "Beau", "Norman", "Brad", "Allan", "Teresa", "Hal", "Owen" ], "edges": [ [ 0, 8 ], [ 0, 6 ], [ 3, 1 ], [ 3, 4 ], [ 5, 9 ], [ 6, 7 ], [ 7, 3 ], [ 7, 5 ], [ 8, 2 ], [ 10, 18 ], [ 10, 16 ], [ 13, 11 ], [ 13, 14 ], [ 15, 19 ], [ 16, 17 ], [ 17, 13 ], [ 17, 15 ], [ 18, 12 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Archer knows Duncan. Eduardo knows Ramon. Rex knows Conrad. Rex knows Archer. Jessie knows Lydia. Lydia knows Wilbur. Lydia knows Tara. Gareth knows Forrest. Sean knows Janice. Ross knows Jessie. Forrest knows Eduardo. Rena knows Sean. Tara knows Rena. Grace knows Rex. Archer knows Gareth. Jessie knows Ramona. Ramon knows Amelia. Janice knows Sam. Which of Gareth and Tara can Grace reach?", "answer": "Gareth", "steps": [ "Grace knows Rex.", "Rex knows Archer.", "Archer knows Gareth." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Grace", "Ramon", "Duncan", "Gareth", "Amelia", "Archer", "Eduardo", "Rex", "Forrest", "Conrad", "Ross", "Janice", "Wilbur", "Tara", "Sam", "Lydia", "Sean", "Jessie", "Rena", "Ramona" ], "edges": [ [ 0, 7 ], [ 1, 4 ], [ 3, 8 ], [ 5, 2 ], [ 5, 3 ], [ 6, 1 ], [ 7, 5 ], [ 7, 9 ], [ 8, 6 ], [ 10, 17 ], [ 11, 14 ], [ 13, 18 ], [ 15, 12 ], [ 15, 13 ], [ 16, 11 ], [ 17, 15 ], [ 17, 19 ], [ 18, 16 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Cassidy knows Jack. Ida knows Kay. Sybil knows Cassidy. Humphrey knows Ida. Ida knows Paige. Hubert knows Jeffery. Ernie knows Francesca. Chad knows Ilene. Kay knows Gideon. Kay knows Knox. Humphrey knows Destiny. Cassidy knows Chad. Humphrey knows Hubert. Sybil knows Kingsley. Gideon knows Arden. Phoebe knows Kenneth. Ernie knows Phoebe. Ernie knows Sybil. Which of Kay and Cassidy can Humphrey reach?", "answer": "Kay", "steps": [ "Humphrey knows Ida.", "Ida knows Kay." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Humphrey", "Arden", "Ida", "Hubert", "Gideon", "Destiny", "Kay", "Jeffery", "Knox", "Paige", "Ernie", "Ilene", "Sybil", "Phoebe", "Chad", "Francesca", "Cassidy", "Kenneth", "Jack", "Kingsley" ], "edges": [ [ 0, 5 ], [ 0, 3 ], [ 0, 2 ], [ 2, 6 ], [ 2, 9 ], [ 3, 7 ], [ 4, 1 ], [ 6, 4 ], [ 6, 8 ], [ 10, 15 ], [ 10, 13 ], [ 10, 12 ], [ 12, 16 ], [ 12, 19 ], [ 13, 17 ], [ 14, 11 ], [ 16, 14 ], [ 16, 18 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Gage knows Bart. Boyd knows Bernice. Simon knows Pedro. Jordan knows Beau. Leopold knows Darrell. Erwin knows Nathan. Bernice knows Gonzalo. Bernice knows Bonnie. Frankie knows Boyd. Francesca knows Jermaine. Bart knows Erwin. Leopold knows Gage. Bart knows Damien. Bernice knows Hattie. Beau knows Leopold. Leopold knows Kay. Francesca knows Simon. Hattie knows Francesca. Which of Bernice and Leopold can Frankie reach?", "answer": "Bernice", "steps": [ "Frankie knows Boyd.", "Boyd knows Bernice." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Frankie", "Jermaine", "Pedro", "Hattie", "Boyd", "Simon", "Francesca", "Bernice", "Bonnie", "Gonzalo", "Jordan", "Damien", "Nathan", "Gage", "Beau", "Erwin", "Bart", "Leopold", "Kay", "Darrell" ], "edges": [ [ 0, 4 ], [ 3, 6 ], [ 4, 7 ], [ 5, 2 ], [ 6, 1 ], [ 6, 5 ], [ 7, 3 ], [ 7, 8 ], [ 7, 9 ], [ 10, 14 ], [ 13, 16 ], [ 14, 17 ], [ 15, 12 ], [ 16, 11 ], [ 16, 15 ], [ 17, 13 ], [ 17, 18 ], [ 17, 19 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Will knows Colin. Vance knows Will. Colin knows Kristina. Casey knows Jewel. Sara knows Casey. Hubert knows Douglas. Will knows Ashton. Will knows Parker. Fanny knows Bennett. Fanny knows Elizabeth. Lennox knows Leon. Sara knows Laverne. Parker knows Fanny. Patricia knows Vance. Laverne knows Hubert. Hubert knows Porter. Sara knows Jerome. Leon knows Sara. Which of Sara and Will can Patricia reach?", "answer": "Will", "steps": [ "Patricia knows Vance.", "Vance knows Will." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Patricia", "Vance", "Colin", "Ashton", "Fanny", "Parker", "Kristina", "Elizabeth", "Bennett", "Will", "Lennox", "Leon", "Casey", "Jerome", "Hubert", "Laverne", "Jewel", "Porter", "Douglas", "Sara" ], "edges": [ [ 0, 1 ], [ 1, 9 ], [ 2, 6 ], [ 4, 7 ], [ 4, 8 ], [ 5, 4 ], [ 9, 3 ], [ 9, 2 ], [ 9, 5 ], [ 10, 11 ], [ 11, 19 ], [ 12, 16 ], [ 14, 17 ], [ 14, 18 ], [ 15, 14 ], [ 19, 13 ], [ 19, 12 ], [ 19, 15 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Grady knows Dora. Clement knows Darcy. Daphna knows Kendra. Donovan knows Luz. Patrick knows Susan. Jude knows Patrick. Kristin knows Julius. Darcy knows Kane. Kendra knows Luther. Susan knows Sandra. Luz knows Rhonda. Sandra knows Clement. Eldon knows Kirsten. Rhonda knows Kristin. Luther knows Donovan. Rhonda knows Grady. Darcy knows Eldon. Kane knows Riley. Which of Patrick and Kendra can Daphna reach?", "answer": "Kendra", "steps": [ "Daphna knows Kendra." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Daphna", "Julius", "Kristin", "Dora", "Grady", "Donovan", "Rhonda", "Luther", "Luz", "Kendra", "Jude", "Kirsten", "Eldon", "Riley", "Kane", "Sandra", "Darcy", "Susan", "Clement", "Patrick" ], "edges": [ [ 0, 9 ], [ 2, 1 ], [ 4, 3 ], [ 5, 8 ], [ 6, 2 ], [ 6, 4 ], [ 7, 5 ], [ 8, 6 ], [ 9, 7 ], [ 10, 19 ], [ 12, 11 ], [ 14, 13 ], [ 15, 18 ], [ 16, 12 ], [ 16, 14 ], [ 17, 15 ], [ 18, 16 ], [ 19, 17 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Dolores knows Walter. Theodore knows Crystal. Yvette knows Verna. Dolores knows Daisy. Hope knows Theodore. Tessa knows Carson. Theodore knows Dolores. Helene knows Willis. Carson knows Gary. Yvette knows Jesse. Tessa knows Cassidy. Randall knows Deborah. Carson knows Jill. Jem knows Tessa. Dolores knows Randall. Carson knows Yvette. Jesse knows Hannah. Randall knows Helene. Which of Theodore and Tessa can Jem reach?", "answer": "Tessa", "steps": [ "Jem knows Tessa." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Jem", "Jesse", "Jill", "Hannah", "Tessa", "Carson", "Verna", "Gary", "Cassidy", "Yvette", "Hope", "Helene", "Walter", "Willis", "Theodore", "Dolores", "Deborah", "Daisy", "Crystal", "Randall" ], "edges": [ [ 0, 4 ], [ 1, 3 ], [ 4, 8 ], [ 4, 5 ], [ 5, 2 ], [ 5, 7 ], [ 5, 9 ], [ 9, 1 ], [ 9, 6 ], [ 10, 14 ], [ 11, 13 ], [ 14, 18 ], [ 14, 15 ], [ 15, 12 ], [ 15, 17 ], [ 15, 19 ], [ 19, 11 ], [ 19, 16 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Verna knows August. Ben knows Cristina. Warren knows Celia. Jacqueline knows Keira. Sara knows Byron. Jacqueline knows Daphne. Byron knows Verna. Ben knows Dewey. Byron knows Jacqueline. Emery knows Warren. Emery knows Ben. Aisha knows Tara. Lucille knows Aisha. Jacqueline knows Marie. Marie knows Itzel. Itzel knows Rebecca. Ben knows Lucille. Calvin knows Emery. Which of Tara and Rebecca can Calvin reach?", "answer": "Tara", "steps": [ "Calvin knows Emery.", "Emery knows Ben.", "Ben knows Lucille.", "Lucille knows Aisha.", "Aisha knows Tara." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Calvin", "Dewey", "Celia", "Cristina", "Aisha", "Warren", "Emery", "Tara", "Lucille", "Ben", "Sara", "Keira", "August", "Daphne", "Itzel", "Verna", "Byron", "Rebecca", "Marie", "Jacqueline" ], "edges": [ [ 0, 6 ], [ 4, 7 ], [ 5, 2 ], [ 6, 5 ], [ 6, 9 ], [ 8, 4 ], [ 9, 1 ], [ 9, 3 ], [ 9, 8 ], [ 10, 16 ], [ 14, 17 ], [ 15, 12 ], [ 16, 15 ], [ 16, 19 ], [ 18, 14 ], [ 19, 11 ], [ 19, 13 ], [ 19, 18 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Christian knows Sandra. Glenda knows Joseph. Uma knows Christopher. Nancy knows Joaquin. Bennett knows Glenda. Joseph knows Gary. Joaquin knows Ariana. Susan knows Emmett. Uma knows Boyd. Susan knows Clifford. Harmony knows Herbert. Emmett knows Garrett. Emmett knows Bennett. Karen knows Nancy. Karen knows Harmony. Boyd knows Olive. Boyd knows Karen. Bennett knows Christian. Which of Nancy and Glenda can Uma reach?", "answer": "Nancy", "steps": [ "Uma knows Boyd.", "Boyd knows Karen.", "Karen knows Nancy." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Uma", "Harmony", "Olive", "Nancy", "Christopher", "Boyd", "Karen", "Joaquin", "Ariana", "Herbert", "Susan", "Christian", "Garrett", "Glenda", "Clifford", "Emmett", "Bennett", "Joseph", "Gary", "Sandra" ], "edges": [ [ 0, 4 ], [ 0, 5 ], [ 1, 9 ], [ 3, 7 ], [ 5, 2 ], [ 5, 6 ], [ 6, 3 ], [ 6, 1 ], [ 7, 8 ], [ 10, 14 ], [ 10, 15 ], [ 11, 19 ], [ 13, 17 ], [ 15, 12 ], [ 15, 16 ], [ 16, 13 ], [ 16, 11 ], [ 17, 18 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Sheila knows Irma. Trina knows Erica. Richard knows Isla. Trina knows Diane. Jacqueline knows Nash. Jacqueline knows Will. Erica knows Fergus. Fergus knows Preston. Emma knows Bonnie. Fergus knows Clarissa. Jacqueline knows Wanda. Erica knows Sheila. Wanda knows Kaleb. Richard knows Emma. Wanda knows Richard. Trina knows Marian. Kaleb knows Terry. Clarissa knows Hugo. Which of Hugo and Bonnie can Trina reach?", "answer": "Hugo", "steps": [ "Trina knows Erica.", "Erica knows Fergus.", "Fergus knows Clarissa.", "Clarissa knows Hugo." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Trina", "Preston", "Sheila", "Marian", "Clarissa", "Diane", "Irma", "Hugo", "Erica", "Fergus", "Jacqueline", "Isla", "Kaleb", "Will", "Emma", "Nash", "Terry", "Bonnie", "Wanda", "Richard" ], "edges": [ [ 0, 3 ], [ 0, 5 ], [ 0, 8 ], [ 2, 6 ], [ 4, 7 ], [ 8, 2 ], [ 8, 9 ], [ 9, 1 ], [ 9, 4 ], [ 10, 13 ], [ 10, 15 ], [ 10, 18 ], [ 12, 16 ], [ 14, 17 ], [ 18, 12 ], [ 18, 19 ], [ 19, 11 ], [ 19, 14 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Abby knows Cole. Cole knows Clifford. Jon knows Joan. Yara knows Merle. Calvin knows Marie. Florence knows Calvin. Cole knows Harriet. Merle knows Emery. Levi knows Laura. Cole knows Shaun. Jon knows Levi. Jon knows Edison. Clifford knows Ruth. Marie knows Abby. Archer knows Joseph. Emery knows Archer. Abby knows Fleur. Archer knows Jon. Which of Cole and Jon can Yara reach?", "answer": "Jon", "steps": [ "Yara knows Merle.", "Merle knows Emery.", "Emery knows Archer.", "Archer knows Jon." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Yara", "Laura", "Emery", "Joan", "Edison", "Merle", "Joseph", "Levi", "Jon", "Archer", "Florence", "Ruth", "Marie", "Harriet", "Shaun", "Calvin", "Fleur", "Clifford", "Cole", "Abby" ], "edges": [ [ 0, 5 ], [ 2, 9 ], [ 5, 2 ], [ 7, 1 ], [ 8, 3 ], [ 8, 4 ], [ 8, 7 ], [ 9, 6 ], [ 9, 8 ], [ 10, 15 ], [ 12, 19 ], [ 15, 12 ], [ 17, 11 ], [ 18, 13 ], [ 18, 14 ], [ 18, 17 ], [ 19, 16 ], [ 19, 18 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Blaine knows Rebecca. Rebecca knows Marc. Blaine knows Donovan. Marion knows Ross. Doris knows Bridget. Doris knows Inez. Rebecca knows Saul. Chester knows Haven. Tamara knows Lee. Jane knows Marion. Diego knows Lottie. Inez knows Chester. Keaton knows Blaine. Marc knows Tamara. Diego knows Doris. Lee knows Davis. Marc knows Rosa. Marion knows Diego. Which of Doris and Marc can Keaton reach?", "answer": "Marc", "steps": [ "Keaton knows Blaine.", "Blaine knows Rebecca.", "Rebecca knows Marc." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Keaton", "Lee", "Tamara", "Marc", "Saul", "Davis", "Rebecca", "Rosa", "Donovan", "Blaine", "Jane", "Chester", "Inez", "Doris", "Lottie", "Haven", "Diego", "Bridget", "Ross", "Marion" ], "edges": [ [ 0, 9 ], [ 1, 5 ], [ 2, 1 ], [ 3, 2 ], [ 3, 7 ], [ 6, 4 ], [ 6, 3 ], [ 9, 6 ], [ 9, 8 ], [ 10, 19 ], [ 11, 15 ], [ 12, 11 ], [ 13, 12 ], [ 13, 17 ], [ 16, 14 ], [ 16, 13 ], [ 19, 16 ], [ 19, 18 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Eugene knows Raquel. Alyssa knows Anton. Jewel knows Aurora. Anton knows Geoffrey. Rebecca knows Alyssa. Geoffrey knows Saul. Aurora knows Vernon. Stuart knows Jewel. Caroline knows Charles. Brody knows Sally. Sally knows Stuart. Raquel knows Daniel. Sally knows Emanuel. Raquel knows Belinda. Vernon knows Caroline. Aurora knows Lisa. Alyssa knows Clay. Daniel knows Rebecca. Which of Rebecca and Jewel can Eugene reach?", "answer": "Rebecca", "steps": [ "Eugene knows Raquel.", "Raquel knows Daniel.", "Daniel knows Rebecca." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Eugene", "Belinda", "Geoffrey", "Alyssa", "Daniel", "Saul", "Anton", "Raquel", "Rebecca", "Clay", "Brody", "Emanuel", "Caroline", "Aurora", "Stuart", "Charles", "Vernon", "Sally", "Jewel", "Lisa" ], "edges": [ [ 0, 7 ], [ 2, 5 ], [ 3, 6 ], [ 3, 9 ], [ 4, 8 ], [ 6, 2 ], [ 7, 1 ], [ 7, 4 ], [ 8, 3 ], [ 10, 17 ], [ 12, 15 ], [ 13, 16 ], [ 13, 19 ], [ 14, 18 ], [ 16, 12 ], [ 17, 11 ], [ 17, 14 ], [ 18, 13 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Edna knows Kendrick. Edna knows Fabian. Austin knows Alice. Austin knows Daphne. Wallace knows Austin. Bert knows Edna. Jose knows Olive. Mack knows Bert. Delilah knows Martha. Alison knows Adam. Martha knows Kirk. Martha knows Dallas. Vicki knows Arden. Wallace knows Delilah. Dallas knows Jose. Kendrick knows Alison. Vicki knows Garrison. Mack knows Vicki. Which of Jose and Alison can Wallace reach?", "answer": "Jose", "steps": [ "Wallace knows Delilah.", "Delilah knows Martha.", "Martha knows Dallas.", "Dallas knows Jose." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Wallace", "Jose", "Olive", "Dallas", "Alice", "Austin", "Martha", "Delilah", "Kirk", "Daphne", "Mack", "Alison", "Adam", "Kendrick", "Garrison", "Vicki", "Edna", "Bert", "Fabian", "Arden" ], "edges": [ [ 0, 7 ], [ 0, 5 ], [ 1, 2 ], [ 3, 1 ], [ 5, 4 ], [ 5, 9 ], [ 6, 3 ], [ 6, 8 ], [ 7, 6 ], [ 10, 17 ], [ 10, 15 ], [ 11, 12 ], [ 13, 11 ], [ 15, 14 ], [ 15, 19 ], [ 16, 13 ], [ 16, 18 ], [ 17, 16 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Pauline knows Eunice. Abigail knows Dolly. Carson knows Maya. Keira knows Joshua. Gwen knows Keira. Natalie knows Greer. Sally knows Carson. Eunice knows Natalie. Dolly knows Dorian. Joshua knows Janet. Gwen knows Harlan. Caroline knows Ilene. Brad knows Warren. Janet knows Caroline. Pauline knows Amelia. Ilene knows Sally. Warren knows Abigail. Greer knows Brad. Which of Dolly and Carson can Gwen reach?", "answer": "Carson", "steps": [ "Gwen knows Keira.", "Keira knows Joshua.", "Joshua knows Janet.", "Janet knows Caroline.", "Caroline knows Ilene.", "Ilene knows Sally.", "Sally knows Carson." ], "difficulty": 7, "original_distance": 8, "idx_to_symbol": [ "Gwen", "Joshua", "Harlan", "Carson", "Maya", "Keira", "Caroline", "Janet", "Ilene", "Sally", "Pauline", "Natalie", "Amelia", "Dolly", "Dorian", "Eunice", "Brad", "Greer", "Warren", "Abigail" ], "edges": [ [ 0, 2 ], [ 0, 5 ], [ 1, 7 ], [ 3, 4 ], [ 5, 1 ], [ 6, 8 ], [ 7, 6 ], [ 8, 9 ], [ 9, 3 ], [ 10, 12 ], [ 10, 15 ], [ 11, 17 ], [ 13, 14 ], [ 15, 11 ], [ 16, 18 ], [ 17, 16 ], [ 18, 19 ], [ 19, 13 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Hugh knows Daria. Jane knows Mara. Arden knows Opal. Paige knows Sean. Yuki knows Victor. Colin knows Rhonda. Lars knows Leopold. Victor knows Arden. Archer knows Paige. Fanny knows Ramona. Fanny knows Hugh. Sean knows Carl. Leopold knows Maggie. Maggie knows Jane. Opal knows Fanny. Daria knows Colin. Jane knows Archer. Hayes knows Lars. Which of Colin and Sean can Yuki reach?", "answer": "Colin", "steps": [ "Yuki knows Victor.", "Victor knows Arden.", "Arden knows Opal.", "Opal knows Fanny.", "Fanny knows Hugh.", "Hugh knows Daria.", "Daria knows Colin." ], "difficulty": 7, "original_distance": 8, "idx_to_symbol": [ "Yuki", "Victor", "Daria", "Colin", "Fanny", "Opal", "Rhonda", "Arden", "Hugh", "Ramona", "Hayes", "Lars", "Paige", "Sean", "Jane", "Maggie", "Carl", "Leopold", "Archer", "Mara" ], "edges": [ [ 0, 1 ], [ 1, 7 ], [ 2, 3 ], [ 3, 6 ], [ 4, 8 ], [ 4, 9 ], [ 5, 4 ], [ 7, 5 ], [ 8, 2 ], [ 10, 11 ], [ 11, 17 ], [ 12, 13 ], [ 13, 16 ], [ 14, 18 ], [ 14, 19 ], [ 15, 14 ], [ 17, 15 ], [ 18, 12 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Alex knows Elvis. Leigh knows Jeff. Wayne knows Erma. Sidney knows Connor. Earl knows Ira. Alfred knows Catherine. Lorna knows Earl. Leigh knows Alfred. Boris knows Jenna. Wayne knows Martha. Catherine knows Boris. Erma knows Lorna. Jenna knows Vance. Catherine knows Mia. Lorna knows Anton. Lorna knows Carey. Carey knows Sidney. Catherine knows Alex. Which of Carey and Boris can Leigh reach?", "answer": "Boris", "steps": [ "Leigh knows Alfred.", "Alfred knows Catherine.", "Catherine knows Boris." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Leigh", "Jenna", "Jeff", "Boris", "Vance", "Elvis", "Catherine", "Alex", "Alfred", "Mia", "Wayne", "Sidney", "Martha", "Carey", "Connor", "Ira", "Lorna", "Earl", "Erma", "Anton" ], "edges": [ [ 0, 2 ], [ 0, 8 ], [ 1, 4 ], [ 3, 1 ], [ 6, 3 ], [ 6, 7 ], [ 6, 9 ], [ 7, 5 ], [ 8, 6 ], [ 10, 12 ], [ 10, 18 ], [ 11, 14 ], [ 13, 11 ], [ 16, 13 ], [ 16, 17 ], [ 16, 19 ], [ 17, 15 ], [ 18, 16 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Duncan knows Clarence. Hector knows Kenneth. Clarence knows Holly. Elton knows Essie. Holly knows Florence. Conner knows Rufus. Chase knows Heather. Peggy knows Layla. Jermaine knows Chase. Dudley knows Duncan. Essie knows Megan. Duncan knows Tamara. Rufus knows Peggy. Florence knows Jermaine. Kenneth knows Elton. Randy knows Hector. Rufus knows Randy. Tamara knows Alyssa. Which of Essie and Chase can Dudley reach?", "answer": "Chase", "steps": [ "Dudley knows Duncan.", "Duncan knows Clarence.", "Clarence knows Holly.", "Holly knows Florence.", "Florence knows Jermaine.", "Jermaine knows Chase." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Dudley", "Chase", "Alyssa", "Tamara", "Florence", "Holly", "Clarence", "Heather", "Duncan", "Jermaine", "Conner", "Essie", "Layla", "Peggy", "Kenneth", "Hector", "Randy", "Megan", "Rufus", "Elton" ], "edges": [ [ 0, 8 ], [ 1, 7 ], [ 3, 2 ], [ 4, 9 ], [ 5, 4 ], [ 6, 5 ], [ 8, 3 ], [ 8, 6 ], [ 9, 1 ], [ 10, 18 ], [ 11, 17 ], [ 13, 12 ], [ 14, 19 ], [ 15, 14 ], [ 16, 15 ], [ 18, 13 ], [ 18, 16 ], [ 19, 11 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Irene knows Damien. Irene knows Lisa. Damien knows Layla. James knows Cyrus. Blanche knows Irene. Randy knows Frida. Lisa knows Adelaide. Cyrus knows Robin. Frida knows Lucy. Virginia knows Randy. Randy knows James. April knows Blanche. Nadine knows Chantal. Seth knows Lamont. Adelaide knows Grant. Frida knows Nadine. Willis knows Virginia. Damien knows Seth. Which of Nadine and Seth can April reach?", "answer": "Seth", "steps": [ "April knows Blanche.", "Blanche knows Irene.", "Irene knows Damien.", "Damien knows Seth." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "April", "Irene", "Lisa", "Layla", "Adelaide", "Blanche", "Lamont", "Seth", "Damien", "Grant", "Willis", "Randy", "James", "Lucy", "Cyrus", "Virginia", "Chantal", "Nadine", "Frida", "Robin" ], "edges": [ [ 0, 5 ], [ 1, 8 ], [ 1, 2 ], [ 2, 4 ], [ 4, 9 ], [ 5, 1 ], [ 7, 6 ], [ 8, 3 ], [ 8, 7 ], [ 10, 15 ], [ 11, 18 ], [ 11, 12 ], [ 12, 14 ], [ 14, 19 ], [ 15, 11 ], [ 17, 16 ], [ 18, 13 ], [ 18, 17 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Earl knows Jose. Kirsten knows Justin. Harper knows Francesca. Israel knows Layla. Luella knows Diego. Jude knows Chandler. Logan knows Emmett. Earl knows Harper. Logan knows Jude. Logan knows Ross. Logan knows Kirsten. Harper knows Mary. Israel knows Earl. Israel knows Luella. Angelica knows Sonia. Jude knows Angelica. Angelica knows Oliver. Israel knows Hannah. Which of Harper and Angelica can Israel reach?", "answer": "Harper", "steps": [ "Israel knows Earl.", "Earl knows Harper." ], "difficulty": 2, "original_distance": 3, "idx_to_symbol": [ "Israel", "Harper", "Francesca", "Hannah", "Layla", "Earl", "Diego", "Luella", "Jose", "Mary", "Logan", "Angelica", "Oliver", "Emmett", "Ross", "Jude", "Justin", "Kirsten", "Chandler", "Sonia" ], "edges": [ [ 0, 3 ], [ 0, 4 ], [ 0, 7 ], [ 0, 5 ], [ 1, 2 ], [ 1, 9 ], [ 5, 8 ], [ 5, 1 ], [ 7, 6 ], [ 10, 13 ], [ 10, 14 ], [ 10, 17 ], [ 10, 15 ], [ 11, 12 ], [ 11, 19 ], [ 15, 18 ], [ 15, 11 ], [ 17, 16 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Boris knows Hendrix. Ann knows Khashayar. Hendrix knows Jessie. Boris knows Myrtle. Boris knows Stefan. Pedro knows Peter. Stefan knows Eric. Carlos knows Louise. Eric knows Denise. Greta knows Robin. Khashayar knows Carlos. Blake knows Greta. Blake knows Marvin. Marvin knows Ann. Blake knows Dean. Dean knows Jane. Myrtle knows Faye. Denise knows Pedro. Which of Denise and Khashayar can Blake reach?", "answer": "Khashayar", "steps": [ "Blake knows Marvin.", "Marvin knows Ann.", "Ann knows Khashayar." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Blake", "Dean", "Jane", "Louise", "Carlos", "Robin", "Greta", "Marvin", "Ann", "Khashayar", "Boris", "Myrtle", "Faye", "Peter", "Pedro", "Jessie", "Hendrix", "Stefan", "Eric", "Denise" ], "edges": [ [ 0, 1 ], [ 0, 6 ], [ 0, 7 ], [ 1, 2 ], [ 4, 3 ], [ 6, 5 ], [ 7, 8 ], [ 8, 9 ], [ 9, 4 ], [ 10, 11 ], [ 10, 16 ], [ 10, 17 ], [ 11, 12 ], [ 14, 13 ], [ 16, 15 ], [ 17, 18 ], [ 18, 19 ], [ 19, 14 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Valerie knows Malcolm. Virgil knows Ava. Vincent knows Nora. Valerie knows Alicia. Nora knows Jacques. Alicia knows Vincent. Alicia knows Eugenia. Ava knows Lauren. Malcolm knows Tyler. Virgil knows Ember. Cameron knows Ivan. Warren knows Cameron. Malcolm knows Caleb. Cameron knows Peggy. Lauren knows Forrest. Warren knows Virgil. Jacques knows Leah. Forrest knows Gerard. Which of Ava and Vincent can Warren reach?", "answer": "Ava", "steps": [ "Warren knows Virgil.", "Virgil knows Ava." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Warren", "Ember", "Ava", "Peggy", "Gerard", "Lauren", "Cameron", "Forrest", "Ivan", "Virgil", "Valerie", "Eugenia", "Vincent", "Caleb", "Leah", "Nora", "Malcolm", "Jacques", "Tyler", "Alicia" ], "edges": [ [ 0, 6 ], [ 0, 9 ], [ 2, 5 ], [ 5, 7 ], [ 6, 3 ], [ 6, 8 ], [ 7, 4 ], [ 9, 1 ], [ 9, 2 ], [ 10, 16 ], [ 10, 19 ], [ 12, 15 ], [ 15, 17 ], [ 16, 13 ], [ 16, 18 ], [ 17, 14 ], [ 19, 11 ], [ 19, 12 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Lena knows Claire. Houston knows Sean. Forrest knows Houston. Houston knows Janet. Chase knows Naomi. Nolan knows Livia. Sean knows Eric. Livia knows Selena. Livia knows Judith. Judith knows Doug. Houston knows Chase. Judith knows Olive. Sean knows Tabitha. Chase knows Lena. Livia knows Kelly. Selena knows Imogen. Olive knows Liam. Selena knows Stephanie. Which of Liam and Claire can Nolan reach?", "answer": "Liam", "steps": [ "Nolan knows Livia.", "Livia knows Judith.", "Judith knows Olive.", "Olive knows Liam." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Nolan", "Stephanie", "Kelly", "Selena", "Liam", "Livia", "Doug", "Imogen", "Olive", "Judith", "Forrest", "Tabitha", "Janet", "Sean", "Claire", "Houston", "Naomi", "Eric", "Lena", "Chase" ], "edges": [ [ 0, 5 ], [ 3, 1 ], [ 3, 7 ], [ 5, 2 ], [ 5, 3 ], [ 5, 9 ], [ 8, 4 ], [ 9, 6 ], [ 9, 8 ], [ 10, 15 ], [ 13, 11 ], [ 13, 17 ], [ 15, 12 ], [ 15, 13 ], [ 15, 19 ], [ 18, 14 ], [ 19, 16 ], [ 19, 18 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Paula knows Barney. Scott knows Derek. Grover knows Thomas. Saul knows Ruby. Paula knows Wallace. Paula knows Griffith. Saul knows Grover. Clyde knows Scott. Chad knows Harlan. Thomas knows Deirdre. Barney knows Walter. Saul knows Frances. Saul knows Emery. Emery knows Chad. Paula knows Clyde. Walter knows Shelly. Emery knows Faye. Barney knows Hampton. Which of Walter and Chad can Saul reach?", "answer": "Chad", "steps": [ "Saul knows Emery.", "Emery knows Chad." ], "difficulty": 2, "original_distance": 3, "idx_to_symbol": [ "Saul", "Grover", "Deirdre", "Chad", "Ruby", "Faye", "Thomas", "Harlan", "Frances", "Emery", "Paula", "Clyde", "Derek", "Walter", "Griffith", "Hampton", "Scott", "Shelly", "Wallace", "Barney" ], "edges": [ [ 0, 4 ], [ 0, 1 ], [ 0, 8 ], [ 0, 9 ], [ 1, 6 ], [ 3, 7 ], [ 6, 2 ], [ 9, 5 ], [ 9, 3 ], [ 10, 14 ], [ 10, 11 ], [ 10, 18 ], [ 10, 19 ], [ 11, 16 ], [ 13, 17 ], [ 16, 12 ], [ 19, 15 ], [ 19, 13 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Francis knows Kenneth. Frank knows Emanuel. Brian knows Erik. Mara knows Leah. Seth knows Beatrice. Frank knows Leigh. Allan knows Mabel. Adele knows Frank. Allan knows Tyler. Emanuel knows Francis. Mabel knows Seth. Leigh knows Amy. Tyler knows Brian. Jackson knows Jodi. Sierra knows Jackson. Amy knows Heather. Jodi knows Allan. Leah knows Adele. Which of Jackson and Leah can Mara reach?", "answer": "Leah", "steps": [ "Mara knows Leah." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Mara", "Leigh", "Francis", "Heather", "Emanuel", "Amy", "Leah", "Frank", "Kenneth", "Adele", "Sierra", "Mabel", "Brian", "Beatrice", "Tyler", "Seth", "Jackson", "Allan", "Erik", "Jodi" ], "edges": [ [ 0, 6 ], [ 1, 5 ], [ 2, 8 ], [ 4, 2 ], [ 5, 3 ], [ 6, 9 ], [ 7, 1 ], [ 7, 4 ], [ 9, 7 ], [ 10, 16 ], [ 11, 15 ], [ 12, 18 ], [ 14, 12 ], [ 15, 13 ], [ 16, 19 ], [ 17, 11 ], [ 17, 14 ], [ 19, 17 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Gustavo knows Bart. Marvin knows Shelby. Hendrix knows Lambert. Peter knows Marvin. Emmett knows Bernard. Peter knows Gustavo. Clay knows Alyson. Katherine knows Wendy. Aisha knows Clay. Shelby knows Katherine. Peter knows Hendrix. Nathan knows Levi. Casey knows Gus. Bernard knows Nathan. Alyson knows Ruth. Chester knows Peter. Clay knows Emmett. Clay knows Casey. Which of Wendy and Levi can Aisha reach?", "answer": "Levi", "steps": [ "Aisha knows Clay.", "Clay knows Emmett.", "Emmett knows Bernard.", "Bernard knows Nathan.", "Nathan knows Levi." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Aisha", "Levi", "Bernard", "Alyson", "Emmett", "Nathan", "Ruth", "Clay", "Casey", "Gus", "Chester", "Wendy", "Shelby", "Hendrix", "Marvin", "Katherine", "Lambert", "Peter", "Gustavo", "Bart" ], "edges": [ [ 0, 7 ], [ 2, 5 ], [ 3, 6 ], [ 4, 2 ], [ 5, 1 ], [ 7, 4 ], [ 7, 3 ], [ 7, 8 ], [ 8, 9 ], [ 10, 17 ], [ 12, 15 ], [ 13, 16 ], [ 14, 12 ], [ 15, 11 ], [ 17, 14 ], [ 17, 13 ], [ 17, 18 ], [ 18, 19 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Christian knows Shelby. Camden knows Celeste. Allen knows Verna. Marie knows Claude. Wallace knows Marie. Celeste knows Christian. Vicki knows Maude. Landon knows Abby. Vanessa knows Bennett. Lana knows Morris. Claude knows Allen. Verna knows Brett. Celeste knows Bonnie. Claude knows Landon. Shelby knows Vanessa. Bonnie knows Josie. Marie knows Vicki. Christian knows Lana. Which of Celeste and Marie can Wallace reach?", "answer": "Marie", "steps": [ "Wallace knows Marie." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Wallace", "Landon", "Verna", "Brett", "Allen", "Vicki", "Marie", "Abby", "Claude", "Maude", "Camden", "Lana", "Vanessa", "Bennett", "Shelby", "Bonnie", "Celeste", "Morris", "Christian", "Josie" ], "edges": [ [ 0, 6 ], [ 1, 7 ], [ 2, 3 ], [ 4, 2 ], [ 5, 9 ], [ 6, 8 ], [ 6, 5 ], [ 8, 4 ], [ 8, 1 ], [ 10, 16 ], [ 11, 17 ], [ 12, 13 ], [ 14, 12 ], [ 15, 19 ], [ 16, 18 ], [ 16, 15 ], [ 18, 14 ], [ 18, 11 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Eugene knows Inez. Porter knows Philip. Carlton knows Chester. Chester knows Edna. Tristan knows Beverly. Dwight knows Tristan. Inez knows Carlton. Inez knows Elodie. Jackson knows Eugene. Philip knows Quinn. Beverly knows Colby. Chester knows Calvin. Beverly knows Porter. Joan knows Rosa. Lucia knows Aspen. Philip knows Dominic. Carlton knows Joan. Porter knows Lucia. Which of Tristan and Eugene can Jackson reach?", "answer": "Eugene", "steps": [ "Jackson knows Eugene." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Jackson", "Calvin", "Elodie", "Edna", "Joan", "Eugene", "Rosa", "Inez", "Carlton", "Chester", "Dwight", "Dominic", "Colby", "Quinn", "Lucia", "Tristan", "Aspen", "Beverly", "Porter", "Philip" ], "edges": [ [ 0, 5 ], [ 4, 6 ], [ 5, 7 ], [ 7, 2 ], [ 7, 8 ], [ 8, 4 ], [ 8, 9 ], [ 9, 1 ], [ 9, 3 ], [ 10, 15 ], [ 14, 16 ], [ 15, 17 ], [ 17, 12 ], [ 17, 18 ], [ 18, 14 ], [ 18, 19 ], [ 19, 11 ], [ 19, 13 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Jerry knows Greg. Marie knows Erwin. Jennifer knows Byron. Daria knows Jerry. Julius knows Leland. Helen knows Enrique. Luella knows Helen. Lucy knows Beth. Jennifer knows Julius. Lucy knows Darla. Greg knows Elizabeth. Elizabeth knows Lamar. Darla knows Luella. Daria knows Bernice. Reed knows Knox. Erwin knows Reed. Helen knows Marie. Leland knows Daria. Which of Jerry and Marie can Lucy reach?", "answer": "Marie", "steps": [ "Lucy knows Darla.", "Darla knows Luella.", "Luella knows Helen.", "Helen knows Marie." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Lucy", "Reed", "Marie", "Luella", "Enrique", "Helen", "Knox", "Darla", "Erwin", "Beth", "Jennifer", "Elizabeth", "Jerry", "Leland", "Bernice", "Daria", "Lamar", "Julius", "Greg", "Byron" ], "edges": [ [ 0, 7 ], [ 0, 9 ], [ 1, 6 ], [ 2, 8 ], [ 3, 5 ], [ 5, 4 ], [ 5, 2 ], [ 7, 3 ], [ 8, 1 ], [ 10, 17 ], [ 10, 19 ], [ 11, 16 ], [ 12, 18 ], [ 13, 15 ], [ 15, 14 ], [ 15, 12 ], [ 17, 13 ], [ 18, 11 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Mary knows Owen. Owen knows Allen. Allen knows Ernest. Janice knows Alison. Alison knows Jill. Daisy knows Chance. Justin knows Enid. Tina knows Daisy. Ernest knows Josie. Tina knows Joshua. Javier knows Janice. Ernest knows Brittany. Carrie knows Mary. Joshua knows Javier. Harper knows Justin. Carrie knows Harper. Alison knows Nadine. Chance knows Burt. Which of Javier and Owen can Tina reach?", "answer": "Javier", "steps": [ "Tina knows Joshua.", "Joshua knows Javier." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Tina", "Nadine", "Joshua", "Daisy", "Jill", "Chance", "Javier", "Alison", "Burt", "Janice", "Carrie", "Josie", "Mary", "Harper", "Brittany", "Justin", "Owen", "Ernest", "Enid", "Allen" ], "edges": [ [ 0, 3 ], [ 0, 2 ], [ 2, 6 ], [ 3, 5 ], [ 5, 8 ], [ 6, 9 ], [ 7, 1 ], [ 7, 4 ], [ 9, 7 ], [ 10, 13 ], [ 10, 12 ], [ 12, 16 ], [ 13, 15 ], [ 15, 18 ], [ 16, 19 ], [ 17, 11 ], [ 17, 14 ], [ 19, 17 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Gage knows Bart. Boyd knows Bernice. Simon knows Pedro. Jordan knows Beau. Leopold knows Darrell. Erwin knows Nathan. Bernice knows Gonzalo. Bernice knows Bonnie. Frankie knows Boyd. Francesca knows Jermaine. Bart knows Erwin. Leopold knows Gage. Bart knows Damien. Bernice knows Hattie. Beau knows Leopold. Leopold knows Kay. Francesca knows Simon. Hattie knows Francesca. Which of Nathan and Pedro can Frankie reach?", "answer": "Pedro", "steps": [ "Frankie knows Boyd.", "Boyd knows Bernice.", "Bernice knows Hattie.", "Hattie knows Francesca.", "Francesca knows Simon.", "Simon knows Pedro." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Frankie", "Jermaine", "Pedro", "Hattie", "Boyd", "Simon", "Francesca", "Bernice", "Bonnie", "Gonzalo", "Jordan", "Damien", "Nathan", "Gage", "Beau", "Erwin", "Bart", "Leopold", "Kay", "Darrell" ], "edges": [ [ 0, 4 ], [ 3, 6 ], [ 4, 7 ], [ 5, 2 ], [ 6, 1 ], [ 6, 5 ], [ 7, 3 ], [ 7, 8 ], [ 7, 9 ], [ 10, 14 ], [ 13, 16 ], [ 14, 17 ], [ 15, 12 ], [ 16, 11 ], [ 16, 15 ], [ 17, 13 ], [ 17, 18 ], [ 17, 19 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Abby knows Cole. Cole knows Clifford. Jon knows Joan. Yara knows Merle. Calvin knows Marie. Florence knows Calvin. Cole knows Harriet. Merle knows Emery. Levi knows Laura. Cole knows Shaun. Jon knows Levi. Jon knows Edison. Clifford knows Ruth. Marie knows Abby. Archer knows Joseph. Emery knows Archer. Abby knows Fleur. Archer knows Jon. Which of Emery and Marie can Yara reach?", "answer": "Emery", "steps": [ "Yara knows Merle.", "Merle knows Emery." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Yara", "Laura", "Emery", "Joan", "Edison", "Merle", "Joseph", "Levi", "Jon", "Archer", "Florence", "Ruth", "Marie", "Harriet", "Shaun", "Calvin", "Fleur", "Clifford", "Cole", "Abby" ], "edges": [ [ 0, 5 ], [ 2, 9 ], [ 5, 2 ], [ 7, 1 ], [ 8, 3 ], [ 8, 4 ], [ 8, 7 ], [ 9, 6 ], [ 9, 8 ], [ 10, 15 ], [ 12, 19 ], [ 15, 12 ], [ 17, 11 ], [ 18, 13 ], [ 18, 14 ], [ 18, 17 ], [ 19, 16 ], [ 19, 18 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Sarah knows Kobe. Ivy knows Earl. Hannah knows Bill. Joaquin knows Harold. Kobe knows Kathleen. Bill knows Curtis. Brent knows Vicki. Earl knows Theodore. Matt knows Wilbur. Tonya knows Erin. Callum knows Ivy. Theodore knows Joaquin. Hannah knows Doug. Erin knows Sarah. Brent knows Matt. Molly knows Tonya. Callum knows Brent. Molly knows Hannah. Which of Erin and Earl can Molly reach?", "answer": "Erin", "steps": [ "Molly knows Tonya.", "Tonya knows Erin." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Molly", "Sarah", "Curtis", "Doug", "Kathleen", "Kobe", "Bill", "Tonya", "Hannah", "Erin", "Callum", "Theodore", "Wilbur", "Vicki", "Harold", "Joaquin", "Matt", "Ivy", "Brent", "Earl" ], "edges": [ [ 0, 8 ], [ 0, 7 ], [ 1, 5 ], [ 5, 4 ], [ 6, 2 ], [ 7, 9 ], [ 8, 3 ], [ 8, 6 ], [ 9, 1 ], [ 10, 18 ], [ 10, 17 ], [ 11, 15 ], [ 15, 14 ], [ 16, 12 ], [ 17, 19 ], [ 18, 13 ], [ 18, 16 ], [ 19, 11 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Melody knows Adam. Gerald knows Landon. Darwin knows Evan. Gwen knows Gavin. Ariana knows Wanda. Jameson knows Tabitha. Fraser knows Ariana. Gavin knows Melody. Gavin knows Jameson. Darwin knows Omar. Darwin knows Fraser. Wendy knows Julia. Mario knows Darwin. Gavin knows Nadine. Melody knows Wendy. Adam knows Olive. Omar knows Greg. Fraser knows Gerald. Which of Ariana and Wendy can Mario reach?", "answer": "Ariana", "steps": [ "Mario knows Darwin.", "Darwin knows Fraser.", "Fraser knows Ariana." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Mario", "Ariana", "Darwin", "Landon", "Greg", "Omar", "Gerald", "Wanda", "Fraser", "Evan", "Gwen", "Wendy", "Gavin", "Olive", "Tabitha", "Jameson", "Adam", "Julia", "Melody", "Nadine" ], "edges": [ [ 0, 2 ], [ 1, 7 ], [ 2, 5 ], [ 2, 8 ], [ 2, 9 ], [ 5, 4 ], [ 6, 3 ], [ 8, 6 ], [ 8, 1 ], [ 10, 12 ], [ 11, 17 ], [ 12, 15 ], [ 12, 18 ], [ 12, 19 ], [ 15, 14 ], [ 16, 13 ], [ 18, 16 ], [ 18, 11 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Dudley knows Milo. Bill knows Fritz. Dudley knows Lara. Fritz knows Leland. Blair knows Mabel. Ross knows Dudley. Elijah knows Seth. Adam knows Blair. Bill knows Anita. Dudley knows Marcia. Quinn knows Hazel. Marcia knows Daniella. Bill knows Boyd. Leland knows Adam. Fraser knows Quinn. Elijah knows Bill. Ross knows Trina. Daniella knows Fraser. Which of Bill and Dudley can Ross reach?", "answer": "Dudley", "steps": [ "Ross knows Dudley." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Ross", "Quinn", "Lara", "Fraser", "Daniella", "Marcia", "Hazel", "Trina", "Milo", "Dudley", "Elijah", "Blair", "Anita", "Adam", "Leland", "Fritz", "Mabel", "Seth", "Boyd", "Bill" ], "edges": [ [ 0, 7 ], [ 0, 9 ], [ 1, 6 ], [ 3, 1 ], [ 4, 3 ], [ 5, 4 ], [ 9, 2 ], [ 9, 5 ], [ 9, 8 ], [ 10, 17 ], [ 10, 19 ], [ 11, 16 ], [ 13, 11 ], [ 14, 13 ], [ 15, 14 ], [ 19, 12 ], [ 19, 15 ], [ 19, 18 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Mia knows Cara. Wesley knows Elvis. Vera knows Byron. Bailey knows Kay. Elvis knows Drew. Deborah knows Brian. Vera knows Andrea. Elena knows Vera. Byron knows Jason. Elvis knows Jerry. Kay knows Wesley. Leonard knows Axel. Deborah knows Elena. Byron knows Bernadette. Wesley knows Celeste. Bailey knows Vance. Byron knows Leonard. Elvis knows Mia. Which of Mia and Leonard can Deborah reach?", "answer": "Leonard", "steps": [ "Deborah knows Elena.", "Elena knows Vera.", "Vera knows Byron.", "Byron knows Leonard." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Deborah", "Vera", "Axel", "Andrea", "Leonard", "Bernadette", "Byron", "Elena", "Jason", "Brian", "Bailey", "Wesley", "Cara", "Celeste", "Mia", "Drew", "Elvis", "Kay", "Jerry", "Vance" ], "edges": [ [ 0, 7 ], [ 0, 9 ], [ 1, 3 ], [ 1, 6 ], [ 4, 2 ], [ 6, 4 ], [ 6, 5 ], [ 6, 8 ], [ 7, 1 ], [ 10, 17 ], [ 10, 19 ], [ 11, 13 ], [ 11, 16 ], [ 14, 12 ], [ 16, 14 ], [ 16, 15 ], [ 16, 18 ], [ 17, 11 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Clay knows Yara. Quinn knows Alan. Margaret knows Opal. Kennedy knows Hailey. Hailey knows Cornelius. Nicole knows Margaret. Clara knows Clay. Zack knows Helene. Brody knows Kennedy. Clay knows Zack. Clay knows Allison. Clara knows Nicole. Alan knows Lionel. Kennedy knows Dennis. Kennedy knows Cody. Cody knows Carlton. Allison knows Thea. Brody knows Quinn. Which of Cornelius and Helene can Clara reach?", "answer": "Helene", "steps": [ "Clara knows Clay.", "Clay knows Zack.", "Zack knows Helene." ], "difficulty": 3, "original_distance": 3, "idx_to_symbol": [ "Clara", "Opal", "Thea", "Clay", "Yara", "Zack", "Helene", "Margaret", "Allison", "Nicole", "Brody", "Lionel", "Carlton", "Kennedy", "Dennis", "Hailey", "Cornelius", "Alan", "Cody", "Quinn" ], "edges": [ [ 0, 3 ], [ 0, 9 ], [ 3, 4 ], [ 3, 5 ], [ 3, 8 ], [ 5, 6 ], [ 7, 1 ], [ 8, 2 ], [ 9, 7 ], [ 10, 13 ], [ 10, 19 ], [ 13, 14 ], [ 13, 15 ], [ 13, 18 ], [ 15, 16 ], [ 17, 11 ], [ 18, 12 ], [ 19, 17 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Freya knows Kennedy. Gerald knows Freya. Sheila knows Lola. Viola knows Callum. Tonya knows Kaleb. Jocelyn knows Gerald. Leon knows Ted. Leon knows Adelaide. Kennedy knows Georgia. Gavin knows Travis. Viola knows Tonya. Tonya knows Jocelyn. Jake knows Sheila. Lola knows Leon. Gavin knows Jake. Adelaide knows Eileen. Freya knows Iris. Jake knows Ruth. Which of Leon and Freya can Viola reach?", "answer": "Freya", "steps": [ "Viola knows Tonya.", "Tonya knows Jocelyn.", "Jocelyn knows Gerald.", "Gerald knows Freya." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Viola", "Georgia", "Gerald", "Callum", "Freya", "Kaleb", "Kennedy", "Jocelyn", "Iris", "Tonya", "Gavin", "Eileen", "Lola", "Travis", "Leon", "Ruth", "Adelaide", "Sheila", "Ted", "Jake" ], "edges": [ [ 0, 3 ], [ 0, 9 ], [ 2, 4 ], [ 4, 6 ], [ 4, 8 ], [ 6, 1 ], [ 7, 2 ], [ 9, 5 ], [ 9, 7 ], [ 10, 13 ], [ 10, 19 ], [ 12, 14 ], [ 14, 16 ], [ 14, 18 ], [ 16, 11 ], [ 17, 12 ], [ 19, 15 ], [ 19, 17 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Lisette knows Holly. Erma knows Ernesto. Andre knows Ursula. Ernesto knows Harmony. Shannon knows Amber. Eunice knows Andre. Randy knows Eunice. Duke knows Randy. Luis knows Martin. Amber knows Erma. Shannon knows Esperanza. Randy knows Luis. Hardy knows Duke. Norma knows Lisette. Martin knows Troy. Amber knows Norma. Rena knows Shannon. Duke knows Kyle. Which of Shannon and Duke can Rena reach?", "answer": "Shannon", "steps": [ "Rena knows Shannon." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Rena", "Holly", "Lisette", "Erma", "Shannon", "Esperanza", "Amber", "Norma", "Ernesto", "Harmony", "Hardy", "Troy", "Martin", "Eunice", "Duke", "Kyle", "Randy", "Luis", "Andre", "Ursula" ], "edges": [ [ 0, 4 ], [ 2, 1 ], [ 3, 8 ], [ 4, 5 ], [ 4, 6 ], [ 6, 7 ], [ 6, 3 ], [ 7, 2 ], [ 8, 9 ], [ 10, 14 ], [ 12, 11 ], [ 13, 18 ], [ 14, 15 ], [ 14, 16 ], [ 16, 17 ], [ 16, 13 ], [ 17, 12 ], [ 18, 19 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Owen knows Zara. Shawn knows Lyric. Shawn knows Gail. Steve knows Tessa. Pedro knows Shawn. Zara knows Shelby. Emanuel knows Dolly. Zara knows Steve. Jem knows Mia. Helen knows Gina. Selena knows Nadine. Ursula knows Merle. Jem knows Selena. Owen knows Emanuel. Emanuel knows Jaime. Helen knows Owen. Ursula knows Pedro. Pedro knows Jem. Which of Pedro and Owen can Ursula reach?", "answer": "Pedro", "steps": [ "Ursula knows Pedro." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Ursula", "Merle", "Lyric", "Pedro", "Mia", "Nadine", "Shawn", "Jem", "Selena", "Gail", "Helen", "Gina", "Dolly", "Owen", "Shelby", "Tessa", "Emanuel", "Zara", "Steve", "Jaime" ], "edges": [ [ 0, 1 ], [ 0, 3 ], [ 3, 7 ], [ 3, 6 ], [ 6, 2 ], [ 6, 9 ], [ 7, 4 ], [ 7, 8 ], [ 8, 5 ], [ 10, 11 ], [ 10, 13 ], [ 13, 17 ], [ 13, 16 ], [ 16, 12 ], [ 16, 19 ], [ 17, 14 ], [ 17, 18 ], [ 18, 15 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Lorraine knows Jules. Renee knows Mary. Lois knows Hubert. Lorraine knows Foster. Hubert knows Ashton. Lorraine knows Noah. Ibrahim knows Bruce. Lois knows Pedro. Pedro knows Emery. Renee knows Lorraine. Mary knows Ibrahim. Pedro knows Tabitha. Lilia knows Renee. Lois knows Calvin. Renee knows Jorge. Ashton knows Brooke. Pedro knows Lennox. Peggy knows Lois. Which of Lois and Renee can Lilia reach?", "answer": "Renee", "steps": [ "Lilia knows Renee." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Lilia", "Jorge", "Ibrahim", "Mary", "Noah", "Bruce", "Renee", "Lorraine", "Foster", "Jules", "Peggy", "Calvin", "Ashton", "Hubert", "Tabitha", "Brooke", "Lois", "Pedro", "Lennox", "Emery" ], "edges": [ [ 0, 6 ], [ 2, 5 ], [ 3, 2 ], [ 6, 1 ], [ 6, 3 ], [ 6, 7 ], [ 7, 4 ], [ 7, 8 ], [ 7, 9 ], [ 10, 16 ], [ 12, 15 ], [ 13, 12 ], [ 16, 11 ], [ 16, 13 ], [ 16, 17 ], [ 17, 14 ], [ 17, 18 ], [ 17, 19 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Joshua knows Vicki. Arlene knows Kendrick. Clifford knows Belinda. Elliot knows Brody. Hope knows Faith. Devon knows Farrah. Michelle knows Elliot. Trevor knows Hope. Farrah knows Joshua. Kendrick knows Randall. Dennis knows Gary. Henry knows Trevor. Tabitha knows Arlene. Michelle knows Tabitha. Dennis knows Devon. Belinda knows Michelle. Clifford knows Hal. Farrah knows Henry. Which of Farrah and Michelle can Clifford reach?", "answer": "Michelle", "steps": [ "Clifford knows Belinda.", "Belinda knows Michelle." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Clifford", "Tabitha", "Kendrick", "Hal", "Belinda", "Elliot", "Michelle", "Randall", "Arlene", "Brody", "Dennis", "Henry", "Hope", "Gary", "Devon", "Joshua", "Farrah", "Faith", "Trevor", "Vicki" ], "edges": [ [ 0, 3 ], [ 0, 4 ], [ 1, 8 ], [ 2, 7 ], [ 4, 6 ], [ 5, 9 ], [ 6, 1 ], [ 6, 5 ], [ 8, 2 ], [ 10, 13 ], [ 10, 14 ], [ 11, 18 ], [ 12, 17 ], [ 14, 16 ], [ 15, 19 ], [ 16, 11 ], [ 16, 15 ], [ 18, 12 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Earl knows Clement. Joan knows Belinda. Roger knows Isiah. Jessica knows Deborah. Simon knows Landon. Russ knows Jessica. Gage knows Joan. Dewey knows Teresa. Belinda knows Tanya. Isiah knows Jules. Landon knows Russ. Abel knows Gus. Joan knows Abel. Gus knows Jenny. Gus knows Roger. Landon knows Andre. Teresa knows Earl. Teresa knows Simon. Which of Landon and Gus can Gage reach?", "answer": "Gus", "steps": [ "Gage knows Joan.", "Joan knows Abel.", "Abel knows Gus." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Gage", "Joan", "Abel", "Jenny", "Roger", "Jules", "Isiah", "Gus", "Tanya", "Belinda", "Dewey", "Teresa", "Simon", "Andre", "Russ", "Deborah", "Jessica", "Landon", "Clement", "Earl" ], "edges": [ [ 0, 1 ], [ 1, 2 ], [ 1, 9 ], [ 2, 7 ], [ 4, 6 ], [ 6, 5 ], [ 7, 3 ], [ 7, 4 ], [ 9, 8 ], [ 10, 11 ], [ 11, 12 ], [ 11, 19 ], [ 12, 17 ], [ 14, 16 ], [ 16, 15 ], [ 17, 13 ], [ 17, 14 ], [ 19, 18 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Ross knows Sybil. David knows Darnell. Fergus knows Roland. Stacy knows Lyle. Kelsey knows Giselle. Roland knows Richard. Hugh knows Terrence. Terrence knows Grady. Sybil knows Parsa. Sybil knows Michelle. Hugh knows Ross. Richard knows Kelsey. Parsa knows Ernest. Roland knows Derrick. Fergus knows Yara. Kelsey knows Stacy. Derrick knows Livia. David knows Hugh. Which of Stacy and Parsa can David reach?", "answer": "Parsa", "steps": [ "David knows Hugh.", "Hugh knows Ross.", "Ross knows Sybil.", "Sybil knows Parsa." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "David", "Ross", "Sybil", "Ernest", "Darnell", "Michelle", "Hugh", "Terrence", "Grady", "Parsa", "Fergus", "Richard", "Kelsey", "Lyle", "Yara", "Giselle", "Roland", "Derrick", "Livia", "Stacy" ], "edges": [ [ 0, 4 ], [ 0, 6 ], [ 1, 2 ], [ 2, 5 ], [ 2, 9 ], [ 6, 7 ], [ 6, 1 ], [ 7, 8 ], [ 9, 3 ], [ 10, 14 ], [ 10, 16 ], [ 11, 12 ], [ 12, 15 ], [ 12, 19 ], [ 16, 17 ], [ 16, 11 ], [ 17, 18 ], [ 19, 13 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Rena knows Lola. Federico knows Flora. Sheryl knows Bart. Flora knows Eldon. Flora knows Keaton. April knows Ralph. Beau knows Jacob. April knows Beau. Elvis knows April. Flora knows Carlos. Keaton knows Rena. April knows Sheryl. Julius knows Gerald. Eldon knows Erma. Carlos knows Burt. Ralph knows Rose. Lola knows Kingsley. Bart knows Julius. Which of Kingsley and Gerald can Federico reach?", "answer": "Kingsley", "steps": [ "Federico knows Flora.", "Flora knows Keaton.", "Keaton knows Rena.", "Rena knows Lola.", "Lola knows Kingsley." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Federico", "Erma", "Rena", "Keaton", "Carlos", "Burt", "Eldon", "Lola", "Kingsley", "Flora", "Elvis", "Rose", "Bart", "Sheryl", "Beau", "Jacob", "Ralph", "Julius", "Gerald", "April" ], "edges": [ [ 0, 9 ], [ 2, 7 ], [ 3, 2 ], [ 4, 5 ], [ 6, 1 ], [ 7, 8 ], [ 9, 4 ], [ 9, 6 ], [ 9, 3 ], [ 10, 19 ], [ 12, 17 ], [ 13, 12 ], [ 14, 15 ], [ 16, 11 ], [ 17, 18 ], [ 19, 14 ], [ 19, 16 ], [ 19, 13 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Xavier knows Gus. Teresa knows Abel. Bruce knows Louisa. Darla knows Atlas. Lily knows William. Dell knows Emma. Eugenia knows Teresa. Luz knows Rod. Atlas knows Lily. Nolan knows Howard. Donovan knows Nolan. Nolan knows Darla. Bruce knows Hattie. Dante knows Eugenia. Hattie knows Donovan. Rod knows Xavier. Xavier knows Dante. Dell knows Luz. Which of Dante and Darla can Dell reach?", "answer": "Dante", "steps": [ "Dell knows Luz.", "Luz knows Rod.", "Rod knows Xavier.", "Xavier knows Dante." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Dell", "Teresa", "Abel", "Emma", "Rod", "Luz", "Dante", "Eugenia", "Xavier", "Gus", "Bruce", "Lily", "William", "Louisa", "Donovan", "Hattie", "Darla", "Atlas", "Nolan", "Howard" ], "edges": [ [ 0, 3 ], [ 0, 5 ], [ 1, 2 ], [ 4, 8 ], [ 5, 4 ], [ 6, 7 ], [ 7, 1 ], [ 8, 6 ], [ 8, 9 ], [ 10, 13 ], [ 10, 15 ], [ 11, 12 ], [ 14, 18 ], [ 15, 14 ], [ 16, 17 ], [ 17, 11 ], [ 18, 16 ], [ 18, 19 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Fred knows Erwin. Irma knows Avery. Verna knows Thomas. Fred knows Verna. Steve knows Bruce. Jonathan knows Steve. Leticia knows Declan. Violet knows Inez. Steve knows Ella. Bruce knows Lloyd. Viola knows Wendy. Fanny knows Jonathan. Verna knows Viola. Preston knows Don. Steve knows Leticia. Bruce knows Violet. Fred knows Irma. Don knows Fred. Which of Steve and Fred can Preston reach?", "answer": "Fred", "steps": [ "Preston knows Don.", "Don knows Fred." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Preston", "Erwin", "Avery", "Don", "Verna", "Fred", "Viola", "Wendy", "Irma", "Thomas", "Fanny", "Ella", "Declan", "Jonathan", "Bruce", "Steve", "Violet", "Inez", "Leticia", "Lloyd" ], "edges": [ [ 0, 3 ], [ 3, 5 ], [ 4, 6 ], [ 4, 9 ], [ 5, 1 ], [ 5, 8 ], [ 5, 4 ], [ 6, 7 ], [ 8, 2 ], [ 10, 13 ], [ 13, 15 ], [ 14, 16 ], [ 14, 19 ], [ 15, 11 ], [ 15, 18 ], [ 15, 14 ], [ 16, 17 ], [ 18, 12 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Leroy knows Lorenzo. Alice knows Ainsley. Judy knows Ida. Leroy knows Kit. Ainsley knows Janice. Wilma knows Isla. Kit knows Alice. Arthur knows Tina. Gus knows Judy. Ida knows Uma. Laverne knows Luther. Lorenzo knows Paige. Tina knows Laverne. Luther knows Pearl. Luther knows Myra. Ainsley knows Donald. Arthur knows Gus. Paige knows Wilma. Which of Paige and Judy can Arthur reach?", "answer": "Judy", "steps": [ "Arthur knows Gus.", "Gus knows Judy." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Arthur", "Luther", "Tina", "Pearl", "Ida", "Uma", "Laverne", "Gus", "Myra", "Judy", "Leroy", "Ainsley", "Kit", "Janice", "Wilma", "Isla", "Alice", "Lorenzo", "Donald", "Paige" ], "edges": [ [ 0, 2 ], [ 0, 7 ], [ 1, 3 ], [ 1, 8 ], [ 2, 6 ], [ 4, 5 ], [ 6, 1 ], [ 7, 9 ], [ 9, 4 ], [ 10, 12 ], [ 10, 17 ], [ 11, 13 ], [ 11, 18 ], [ 12, 16 ], [ 14, 15 ], [ 16, 11 ], [ 17, 19 ], [ 19, 14 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Gareth knows Dee. Scott knows Magdalena. Gareth knows Forrest. Judith knows Diego. Teresa knows Monica. Monica knows Scott. Aaron knows Pierce. Aaron knows Allison. Diego knows Evelyn. Magdalena knows Darnell. Dee knows Ivy. Aaron knows Alison. Alison knows Christian. Evelyn knows Gonzalo. Gonzalo knows Fern. Gareth knows Jon. Fern knows Aaron. Darnell knows Gareth. Which of Magdalena and Gonzalo can Teresa reach?", "answer": "Magdalena", "steps": [ "Teresa knows Monica.", "Monica knows Scott.", "Scott knows Magdalena." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Teresa", "Dee", "Jon", "Gareth", "Forrest", "Scott", "Ivy", "Darnell", "Magdalena", "Monica", "Judith", "Alison", "Allison", "Aaron", "Pierce", "Evelyn", "Christian", "Fern", "Gonzalo", "Diego" ], "edges": [ [ 0, 9 ], [ 1, 6 ], [ 3, 2 ], [ 3, 4 ], [ 3, 1 ], [ 5, 8 ], [ 7, 3 ], [ 8, 7 ], [ 9, 5 ], [ 10, 19 ], [ 11, 16 ], [ 13, 12 ], [ 13, 14 ], [ 13, 11 ], [ 15, 18 ], [ 17, 13 ], [ 18, 17 ], [ 19, 15 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Arden knows Frida. Tina knows Clark. Jeff knows Paige. Tina knows Derek. Lenora knows Jillian. Arden knows Kira. Arden knows Lenora. Lenora knows Brenda. Jillian knows Darin. Darin knows Fred. Darin knows Marian. Hubert knows Robert. Jeff knows Claudia. Jeff knows Hubert. Hank knows Tina. Claudia knows Noel. Frida knows Darcy. Hubert knows Hank. Which of Darin and Tina can Jeff reach?", "answer": "Tina", "steps": [ "Jeff knows Hubert.", "Hubert knows Hank.", "Hank knows Tina." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Jeff", "Hank", "Tina", "Clark", "Robert", "Paige", "Noel", "Hubert", "Derek", "Claudia", "Arden", "Jillian", "Darin", "Marian", "Brenda", "Kira", "Darcy", "Lenora", "Fred", "Frida" ], "edges": [ [ 0, 5 ], [ 0, 7 ], [ 0, 9 ], [ 1, 2 ], [ 2, 3 ], [ 2, 8 ], [ 7, 4 ], [ 7, 1 ], [ 9, 6 ], [ 10, 15 ], [ 10, 17 ], [ 10, 19 ], [ 11, 12 ], [ 12, 13 ], [ 12, 18 ], [ 17, 14 ], [ 17, 11 ], [ 19, 16 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Miles knows Dee. Jules knows Joshua. Miles knows Ethan. Joshua knows Becky. Erik knows Jules. Ernesto knows Cecilia. Whitney knows Fritz. Nash knows Dewey. Ethan knows Beau. Erik knows Katrina. Beau knows Blair. Nash knows Whitney. Joshua knows Ernesto. Karen knows Elaine. Dee knows Nash. Katrina knows Karen. Beau knows Eduardo. Karen knows Franklin. Which of Joshua and Nash can Erik reach?", "answer": "Joshua", "steps": [ "Erik knows Jules.", "Jules knows Joshua." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Erik", "Ernesto", "Katrina", "Elaine", "Joshua", "Karen", "Jules", "Becky", "Franklin", "Cecilia", "Miles", "Whitney", "Ethan", "Blair", "Nash", "Beau", "Dee", "Dewey", "Eduardo", "Fritz" ], "edges": [ [ 0, 2 ], [ 0, 6 ], [ 1, 9 ], [ 2, 5 ], [ 4, 7 ], [ 4, 1 ], [ 5, 3 ], [ 5, 8 ], [ 6, 4 ], [ 10, 12 ], [ 10, 16 ], [ 11, 19 ], [ 12, 15 ], [ 14, 17 ], [ 14, 11 ], [ 15, 13 ], [ 15, 18 ], [ 16, 14 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Fern knows Jacques. Dalton knows Larry. Jacques knows Adrian. Elliot knows Harris. Belinda knows Frances. Belinda knows Noah. Ivan knows Fern. Larry knows Yolanda. Imogen knows Dalton. Frances knows Keira. Fiona knows Kerry. Damian knows Belinda. Zelda knows Imogen. Kerry knows Zelda. Yolanda knows Don. Adrian knows Damian. Larry knows Elliot. Noah knows Joseph. Which of Jacques and Zelda can Fiona reach?", "answer": "Zelda", "steps": [ "Fiona knows Kerry.", "Kerry knows Zelda." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Fiona", "Larry", "Kerry", "Harris", "Don", "Elliot", "Dalton", "Imogen", "Zelda", "Yolanda", "Ivan", "Belinda", "Fern", "Keira", "Joseph", "Frances", "Damian", "Adrian", "Jacques", "Noah" ], "edges": [ [ 0, 2 ], [ 1, 5 ], [ 1, 9 ], [ 2, 8 ], [ 5, 3 ], [ 6, 1 ], [ 7, 6 ], [ 8, 7 ], [ 9, 4 ], [ 10, 12 ], [ 11, 15 ], [ 11, 19 ], [ 12, 18 ], [ 15, 13 ], [ 16, 11 ], [ 17, 16 ], [ 18, 17 ], [ 19, 14 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Richard knows Erin. Darrell knows Hank. Ainsley knows Darla. Hamilton knows Elliot. Elliot knows Maude. Elliot knows Mack. Darla knows Reed. Richard knows Dean. Elliot knows Shawn. Aurora knows Jason. Dean knows Aurora. Dominic knows Jorge. Aurora knows Ainsley. Aurora knows Enrique. Dominic knows Hamilton. Maude knows Darrell. Darrell knows Connor. Darla knows Joyce. Which of Darla and Darrell can Richard reach?", "answer": "Darla", "steps": [ "Richard knows Dean.", "Dean knows Aurora.", "Aurora knows Ainsley.", "Ainsley knows Darla." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Richard", "Enrique", "Dean", "Ainsley", "Reed", "Darla", "Jason", "Joyce", "Aurora", "Erin", "Dominic", "Shawn", "Hamilton", "Maude", "Connor", "Darrell", "Mack", "Hank", "Elliot", "Jorge" ], "edges": [ [ 0, 2 ], [ 0, 9 ], [ 2, 8 ], [ 3, 5 ], [ 5, 4 ], [ 5, 7 ], [ 8, 1 ], [ 8, 6 ], [ 8, 3 ], [ 10, 12 ], [ 10, 19 ], [ 12, 18 ], [ 13, 15 ], [ 15, 14 ], [ 15, 17 ], [ 18, 11 ], [ 18, 16 ], [ 18, 13 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Virgil knows Chad. Lola knows Lena. Jared knows Ben. Virgil knows Finn. Maria knows Seth. Mildred knows Virgil. Dave knows Dora. Chad knows Chase. Deborah knows Justine. Lola knows Maria. Rocco knows Deborah. Serena knows Mildred. Justine knows Jared. Jared knows Lola. Jocelyn knows Dave. Mildred knows Merle. Dora knows Serena. Ashley knows Rocco. Which of Serena and Justine can Ashley reach?", "answer": "Justine", "steps": [ "Ashley knows Rocco.", "Rocco knows Deborah.", "Deborah knows Justine." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Ashley", "Lola", "Ben", "Seth", "Justine", "Deborah", "Rocco", "Lena", "Jared", "Maria", "Jocelyn", "Virgil", "Merle", "Chase", "Serena", "Dora", "Dave", "Finn", "Mildred", "Chad" ], "edges": [ [ 0, 6 ], [ 1, 7 ], [ 1, 9 ], [ 4, 8 ], [ 5, 4 ], [ 6, 5 ], [ 8, 2 ], [ 8, 1 ], [ 9, 3 ], [ 10, 16 ], [ 11, 17 ], [ 11, 19 ], [ 14, 18 ], [ 15, 14 ], [ 16, 15 ], [ 18, 12 ], [ 18, 11 ], [ 19, 13 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Verna knows August. Ben knows Cristina. Warren knows Celia. Jacqueline knows Keira. Sara knows Byron. Jacqueline knows Daphne. Byron knows Verna. Ben knows Dewey. Byron knows Jacqueline. Emery knows Warren. Emery knows Ben. Aisha knows Tara. Lucille knows Aisha. Jacqueline knows Marie. Marie knows Itzel. Itzel knows Rebecca. Ben knows Lucille. Calvin knows Emery. Which of Jacqueline and Ben can Calvin reach?", "answer": "Ben", "steps": [ "Calvin knows Emery.", "Emery knows Ben." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Calvin", "Dewey", "Celia", "Cristina", "Aisha", "Warren", "Emery", "Tara", "Lucille", "Ben", "Sara", "Keira", "August", "Daphne", "Itzel", "Verna", "Byron", "Rebecca", "Marie", "Jacqueline" ], "edges": [ [ 0, 6 ], [ 4, 7 ], [ 5, 2 ], [ 6, 5 ], [ 6, 9 ], [ 8, 4 ], [ 9, 1 ], [ 9, 3 ], [ 9, 8 ], [ 10, 16 ], [ 14, 17 ], [ 15, 12 ], [ 16, 15 ], [ 16, 19 ], [ 18, 14 ], [ 19, 11 ], [ 19, 13 ], [ 19, 18 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Emanuel knows Joshua. Zach knows Agnes. Axel knows Aaron. Lars knows Constance. Emanuel knows Oscar. Zach knows Don. Leonard knows Dixie. Zach knows Daphna. Philip knows Zach. Agnes knows Axel. Emanuel knows Whitney. Oscar knows Karen. Karen knows Tiffany. Lennox knows Leonard. Whitney knows Lennox. Roger knows Lars. Daphna knows Roger. Iris knows Emanuel. Which of Lars and Leonard can Philip reach?", "answer": "Lars", "steps": [ "Philip knows Zach.", "Zach knows Daphna.", "Daphna knows Roger.", "Roger knows Lars." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Philip", "Roger", "Aaron", "Don", "Daphna", "Zach", "Axel", "Lars", "Constance", "Agnes", "Iris", "Lennox", "Tiffany", "Joshua", "Whitney", "Emanuel", "Karen", "Leonard", "Dixie", "Oscar" ], "edges": [ [ 0, 5 ], [ 1, 7 ], [ 4, 1 ], [ 5, 3 ], [ 5, 4 ], [ 5, 9 ], [ 6, 2 ], [ 7, 8 ], [ 9, 6 ], [ 10, 15 ], [ 11, 17 ], [ 14, 11 ], [ 15, 13 ], [ 15, 14 ], [ 15, 19 ], [ 16, 12 ], [ 17, 18 ], [ 19, 16 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Lily knows Effie. Kylie knows Geoffrey. Denver knows Kelsey. Ariana knows Nolan. Jane knows Max. Alicia knows Erma. Max knows Kylie. Effie knows Liam. Lauren knows Devin. Ivy knows Alicia. Denver knows Jane. Shane knows Lauren. Nolan knows Ivy. Clark knows Carson. Effie knows Ariana. Devin knows Denver. Geoffrey knows Marian. Carson knows Lily. Which of Max and Nolan can Clark reach?", "answer": "Nolan", "steps": [ "Clark knows Carson.", "Carson knows Lily.", "Lily knows Effie.", "Effie knows Ariana.", "Ariana knows Nolan." ], "difficulty": 5, "original_distance": 8, "idx_to_symbol": [ "Clark", "Lily", "Erma", "Alicia", "Ivy", "Ariana", "Effie", "Nolan", "Carson", "Liam", "Shane", "Devin", "Marian", "Geoffrey", "Kylie", "Jane", "Denver", "Max", "Lauren", "Kelsey" ], "edges": [ [ 0, 8 ], [ 1, 6 ], [ 3, 2 ], [ 4, 3 ], [ 5, 7 ], [ 6, 5 ], [ 6, 9 ], [ 7, 4 ], [ 8, 1 ], [ 10, 18 ], [ 11, 16 ], [ 13, 12 ], [ 14, 13 ], [ 15, 17 ], [ 16, 15 ], [ 16, 19 ], [ 17, 14 ], [ 18, 11 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Diana knows Brenda. Joan knows Harmony. Holly knows Lorna. Kurt knows Olivia. Yasmin knows Joan. Harmony knows Kurt. Kurt knows Iris. Diana knows Dylan. Holly knows Frances. Alejandro knows Carrie. Yuki knows Sally. Alejandro knows Alma. Dayton knows Yuki. Olivia knows Alejandro. Alma knows Kieran. Frances knows Gordon. Sally knows Diana. Dylan knows Holly. Which of Kurt and Diana can Dayton reach?", "answer": "Diana", "steps": [ "Dayton knows Yuki.", "Yuki knows Sally.", "Sally knows Diana." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Dayton", "Holly", "Yuki", "Brenda", "Diana", "Frances", "Sally", "Lorna", "Gordon", "Dylan", "Yasmin", "Alejandro", "Joan", "Iris", "Kurt", "Alma", "Harmony", "Carrie", "Kieran", "Olivia" ], "edges": [ [ 0, 2 ], [ 1, 7 ], [ 1, 5 ], [ 2, 6 ], [ 4, 3 ], [ 4, 9 ], [ 5, 8 ], [ 6, 4 ], [ 9, 1 ], [ 10, 12 ], [ 11, 17 ], [ 11, 15 ], [ 12, 16 ], [ 14, 13 ], [ 14, 19 ], [ 15, 18 ], [ 16, 14 ], [ 19, 11 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Beth knows Derek. Kirsten knows Archer. Gerald knows Fanny. Bill knows Jorge. April knows Kirsten. Fanny knows Harlan. Archer knows Kira. Chance knows Giselle. Derek knows Brynn. Derek knows Jolene. Kira knows Claire. Giselle knows Maria. Jolene knows Gerald. Kira knows Marvin. Giselle knows Beth. Marvin knows Bill. Kirsten knows Vincent. Jorge knows Dennis. Which of Kira and Derek can April reach?", "answer": "Kira", "steps": [ "April knows Kirsten.", "Kirsten knows Archer.", "Archer knows Kira." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "April", "Dennis", "Kira", "Marvin", "Claire", "Bill", "Vincent", "Kirsten", "Jorge", "Archer", "Chance", "Harlan", "Derek", "Jolene", "Brynn", "Gerald", "Maria", "Giselle", "Fanny", "Beth" ], "edges": [ [ 0, 7 ], [ 2, 4 ], [ 2, 3 ], [ 3, 5 ], [ 5, 8 ], [ 7, 6 ], [ 7, 9 ], [ 8, 1 ], [ 9, 2 ], [ 10, 17 ], [ 12, 14 ], [ 12, 13 ], [ 13, 15 ], [ 15, 18 ], [ 17, 16 ], [ 17, 19 ], [ 18, 11 ], [ 19, 12 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Felicia knows Nell. Yara knows Gilbert. Luella knows Edwin. Dora knows Ellis. Luella knows Catherine. Felicia knows Rachel. Gilbert knows Sadie. Hannah knows Dora. Crystal knows Luella. Catherine knows Marcus. Catherine knows Hannah. Cordelia knows Joel. Marcus knows Edmund. Nell knows Miriam. Crystal knows Kristina. Cordelia knows Felicia. Nell knows Yara. Miriam knows Eleanor. Which of Sadie and Ellis can Cordelia reach?", "answer": "Sadie", "steps": [ "Cordelia knows Felicia.", "Felicia knows Nell.", "Nell knows Yara.", "Yara knows Gilbert.", "Gilbert knows Sadie." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Cordelia", "Eleanor", "Gilbert", "Joel", "Sadie", "Felicia", "Yara", "Nell", "Rachel", "Miriam", "Crystal", "Edmund", "Dora", "Kristina", "Ellis", "Luella", "Hannah", "Catherine", "Edwin", "Marcus" ], "edges": [ [ 0, 3 ], [ 0, 5 ], [ 2, 4 ], [ 5, 8 ], [ 5, 7 ], [ 6, 2 ], [ 7, 6 ], [ 7, 9 ], [ 9, 1 ], [ 10, 13 ], [ 10, 15 ], [ 12, 14 ], [ 15, 18 ], [ 15, 17 ], [ 16, 12 ], [ 17, 16 ], [ 17, 19 ], [ 19, 11 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Quinn knows Kristina. Ava knows Rufus. Bette knows Raymond. Ava knows Anita. Fanny knows Nicole. Janice knows Vivian. Janice knows Enid. Janice knows Quinn. Rufus knows Fanny. Nicole knows Enrique. Madeline knows Griffith. Kristina knows Edith. Ava knows Bette. Enid knows Anton. Glenda knows Madeline. Edith knows Glenda. Enrique knows Jonathan. Jonathan knows Dahlia. Which of Fanny and Kristina can Ava reach?", "answer": "Fanny", "steps": [ "Ava knows Rufus.", "Rufus knows Fanny." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Ava", "Raymond", "Dahlia", "Jonathan", "Enrique", "Rufus", "Bette", "Nicole", "Anita", "Fanny", "Janice", "Anton", "Griffith", "Madeline", "Glenda", "Quinn", "Enid", "Edith", "Vivian", "Kristina" ], "edges": [ [ 0, 6 ], [ 0, 8 ], [ 0, 5 ], [ 3, 2 ], [ 4, 3 ], [ 5, 9 ], [ 6, 1 ], [ 7, 4 ], [ 9, 7 ], [ 10, 16 ], [ 10, 18 ], [ 10, 15 ], [ 13, 12 ], [ 14, 13 ], [ 15, 19 ], [ 16, 11 ], [ 17, 14 ], [ 19, 17 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Lawson knows Isabel. Pam knows Maureen. Lawson knows Jared. Maureen knows Jasmine. Sylvia knows Deborah. Dahlia knows Jeremiah. Dahlia knows Colby. Jacques knows Dahlia. Kennedy knows Sebastian. Pam knows Jacques. Sylvia knows Dexter. Dahlia knows Harris. Lawson knows Fritz. Lawson knows Herbert. Deborah knows Kennedy. Dexter knows Lawson. Jasmine knows Candice. Dahlia knows Ernie. Which of Maureen and Deborah can Sylvia reach?", "answer": "Deborah", "steps": [ "Sylvia knows Deborah." ], "difficulty": 1, "original_distance": 3, "idx_to_symbol": [ "Sylvia", "Deborah", "Herbert", "Kennedy", "Fritz", "Sebastian", "Isabel", "Dexter", "Lawson", "Jared", "Pam", "Maureen", "Colby", "Jasmine", "Harris", "Candice", "Jeremiah", "Jacques", "Dahlia", "Ernie" ], "edges": [ [ 0, 1 ], [ 0, 7 ], [ 1, 3 ], [ 3, 5 ], [ 7, 8 ], [ 8, 2 ], [ 8, 4 ], [ 8, 6 ], [ 8, 9 ], [ 10, 11 ], [ 10, 17 ], [ 11, 13 ], [ 13, 15 ], [ 17, 18 ], [ 18, 12 ], [ 18, 14 ], [ 18, 16 ], [ 18, 19 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Sarah knows Kobe. Ivy knows Earl. Hannah knows Bill. Joaquin knows Harold. Kobe knows Kathleen. Bill knows Curtis. Brent knows Vicki. Earl knows Theodore. Matt knows Wilbur. Tonya knows Erin. Callum knows Ivy. Theodore knows Joaquin. Hannah knows Doug. Erin knows Sarah. Brent knows Matt. Molly knows Tonya. Callum knows Brent. Molly knows Hannah. Which of Tonya and Ivy can Molly reach?", "answer": "Tonya", "steps": [ "Molly knows Tonya." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Molly", "Sarah", "Curtis", "Doug", "Kathleen", "Kobe", "Bill", "Tonya", "Hannah", "Erin", "Callum", "Theodore", "Wilbur", "Vicki", "Harold", "Joaquin", "Matt", "Ivy", "Brent", "Earl" ], "edges": [ [ 0, 8 ], [ 0, 7 ], [ 1, 5 ], [ 5, 4 ], [ 6, 2 ], [ 7, 9 ], [ 8, 3 ], [ 8, 6 ], [ 9, 1 ], [ 10, 18 ], [ 10, 17 ], [ 11, 15 ], [ 15, 14 ], [ 16, 12 ], [ 17, 19 ], [ 18, 13 ], [ 18, 16 ], [ 19, 11 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Anthony knows Dawn. Marco knows Clay. Chad knows Wendell. Wendell knows Samantha. Kaleb knows Sarah. Damian knows Herman. Keith knows Susanne. Susanne knows Marco. Sarah knows Anthony. Brittany knows Knox. Keith knows Chad. Knox knows Keith. Dawn knows Shelby. Helene knows Luna. Pat knows Brittany. Herman knows Arden. Dawn knows Damian. Shelby knows Helene. Which of Brittany and Sarah can Kaleb reach?", "answer": "Sarah", "steps": [ "Kaleb knows Sarah." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Kaleb", "Herman", "Dawn", "Sarah", "Luna", "Shelby", "Damian", "Arden", "Anthony", "Helene", "Pat", "Marco", "Keith", "Brittany", "Samantha", "Chad", "Susanne", "Clay", "Knox", "Wendell" ], "edges": [ [ 0, 3 ], [ 1, 7 ], [ 2, 6 ], [ 2, 5 ], [ 3, 8 ], [ 5, 9 ], [ 6, 1 ], [ 8, 2 ], [ 9, 4 ], [ 10, 13 ], [ 11, 17 ], [ 12, 16 ], [ 12, 15 ], [ 13, 18 ], [ 15, 19 ], [ 16, 11 ], [ 18, 12 ], [ 19, 14 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Estella knows Israel. Percy knows Cornelius. Rocco knows Ralph. Sam knows Cooper. Estella knows Percy. Graham knows Basil. Cooper knows Graham. Herman knows Clark. Dalton knows Herman. Cornelius knows Ursula. Basil knows Camille. Sam knows Rocco. Herman knows Don. Dalton knows Estella. Cooper knows Monica. Darin knows Sam. Rocco knows Adelaide. Bonnie knows Dalton. Which of Dalton and Sam can Bonnie reach?", "answer": "Dalton", "steps": [ "Bonnie knows Dalton." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Bonnie", "Don", "Cornelius", "Ursula", "Dalton", "Herman", "Percy", "Estella", "Clark", "Israel", "Darin", "Ralph", "Basil", "Camille", "Sam", "Rocco", "Graham", "Cooper", "Adelaide", "Monica" ], "edges": [ [ 0, 4 ], [ 2, 3 ], [ 4, 5 ], [ 4, 7 ], [ 5, 1 ], [ 5, 8 ], [ 6, 2 ], [ 7, 6 ], [ 7, 9 ], [ 10, 14 ], [ 12, 13 ], [ 14, 15 ], [ 14, 17 ], [ 15, 11 ], [ 15, 18 ], [ 16, 12 ], [ 17, 16 ], [ 17, 19 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Hugo knows Samuel. Kurt knows Brenda. Brenda knows Kamila. Brenda knows Freya. Merle knows Valerie. Julia knows Abby. Kurt knows Gabe. Brent knows Hugo. Freya knows Merle. Julia knows Colby. Hugo knows Kendra. Brenda knows Eugenia. Julia knows Lamont. Hugo knows Jack. Samuel knows Julia. Merle knows Dina. Merle knows Tabitha. Brent knows Stefan. Which of Abby and Tabitha can Kurt reach?", "answer": "Tabitha", "steps": [ "Kurt knows Brenda.", "Brenda knows Freya.", "Freya knows Merle.", "Merle knows Tabitha." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Kurt", "Gabe", "Dina", "Merle", "Eugenia", "Valerie", "Kamila", "Tabitha", "Freya", "Brenda", "Brent", "Stefan", "Lamont", "Julia", "Kendra", "Colby", "Jack", "Abby", "Samuel", "Hugo" ], "edges": [ [ 0, 1 ], [ 0, 9 ], [ 3, 2 ], [ 3, 5 ], [ 3, 7 ], [ 8, 3 ], [ 9, 4 ], [ 9, 6 ], [ 9, 8 ], [ 10, 11 ], [ 10, 19 ], [ 13, 12 ], [ 13, 15 ], [ 13, 17 ], [ 18, 13 ], [ 19, 14 ], [ 19, 16 ], [ 19, 18 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Fern knows Alma. Constance knows Sarah. Alma knows Ryan. Mack knows Fern. Alex knows Lisa. Steve knows Estelle. Estelle knows Alex. Jules knows Mack. Alex knows Constance. Steve knows Lisette. Ryan knows Sheila. Ryan knows Jolene. Haley knows Steve. Mack knows Chantal. Mack knows Wilbur. Constance knows Jewel. Steve knows Enid. Alma knows Bernard. Which of Jolene and Sarah can Haley reach?", "answer": "Sarah", "steps": [ "Haley knows Steve.", "Steve knows Estelle.", "Estelle knows Alex.", "Alex knows Constance.", "Constance knows Sarah." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Haley", "Sarah", "Constance", "Jewel", "Steve", "Alex", "Enid", "Lisa", "Lisette", "Estelle", "Jules", "Jolene", "Ryan", "Sheila", "Mack", "Alma", "Wilbur", "Bernard", "Chantal", "Fern" ], "edges": [ [ 0, 4 ], [ 2, 1 ], [ 2, 3 ], [ 4, 6 ], [ 4, 8 ], [ 4, 9 ], [ 5, 2 ], [ 5, 7 ], [ 9, 5 ], [ 10, 14 ], [ 12, 11 ], [ 12, 13 ], [ 14, 16 ], [ 14, 18 ], [ 14, 19 ], [ 15, 12 ], [ 15, 17 ], [ 19, 15 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Constance knows Lisette. Drake knows Eldon. Aiden knows Robin. Eldon knows Brock. Cole knows Adele. Cole knows Jacob. Constance knows Lawrence. Constance knows Eileen. Robin knows Diane. Drake knows Craig. Jana knows Etta. Lisette knows Jana. Beth knows Constance. Cole knows Neville. Asher knows Cole. Jacob knows Drake. Jana knows Aiden. Brock knows Emmett. Which of Cole and Constance can Beth reach?", "answer": "Constance", "steps": [ "Beth knows Constance." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Beth", "Lawrence", "Etta", "Aiden", "Robin", "Eileen", "Diane", "Jana", "Constance", "Lisette", "Asher", "Neville", "Craig", "Eldon", "Brock", "Adele", "Emmett", "Drake", "Cole", "Jacob" ], "edges": [ [ 0, 8 ], [ 3, 4 ], [ 4, 6 ], [ 7, 2 ], [ 7, 3 ], [ 8, 1 ], [ 8, 5 ], [ 8, 9 ], [ 9, 7 ], [ 10, 18 ], [ 13, 14 ], [ 14, 16 ], [ 17, 12 ], [ 17, 13 ], [ 18, 11 ], [ 18, 15 ], [ 18, 19 ], [ 19, 17 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Grady knows Dora. Clement knows Darcy. Daphna knows Kendra. Donovan knows Luz. Patrick knows Susan. Jude knows Patrick. Kristin knows Julius. Darcy knows Kane. Kendra knows Luther. Susan knows Sandra. Luz knows Rhonda. Sandra knows Clement. Eldon knows Kirsten. Rhonda knows Kristin. Luther knows Donovan. Rhonda knows Grady. Darcy knows Eldon. Kane knows Riley. Which of Riley and Dora can Daphna reach?", "answer": "Dora", "steps": [ "Daphna knows Kendra.", "Kendra knows Luther.", "Luther knows Donovan.", "Donovan knows Luz.", "Luz knows Rhonda.", "Rhonda knows Grady.", "Grady knows Dora." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Daphna", "Julius", "Kristin", "Dora", "Grady", "Donovan", "Rhonda", "Luther", "Luz", "Kendra", "Jude", "Kirsten", "Eldon", "Riley", "Kane", "Sandra", "Darcy", "Susan", "Clement", "Patrick" ], "edges": [ [ 0, 9 ], [ 2, 1 ], [ 4, 3 ], [ 5, 8 ], [ 6, 2 ], [ 6, 4 ], [ 7, 5 ], [ 8, 6 ], [ 9, 7 ], [ 10, 19 ], [ 12, 11 ], [ 14, 13 ], [ 15, 18 ], [ 16, 12 ], [ 16, 14 ], [ 17, 15 ], [ 18, 16 ], [ 19, 17 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Antonio knows Margaret. Dirk knows Mitchell. Margaret knows Sonia. Lucia knows Constance. Isaac knows Emmett. Magdalena knows Isaac. Glenn knows Essie. Serena knows Glenn. Khashayar knows Riley. Sonia knows Khashayar. Constance knows Jasmine. Lucia knows Dirk. Emmett knows Bailey. Tyler knows Javier. Mitchell knows Brent. Tyler knows Serena. Jasmine knows Magdalena. Javier knows Antonio. Which of Javier and Constance can Lucia reach?", "answer": "Constance", "steps": [ "Lucia knows Constance." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Lucia", "Dirk", "Brent", "Bailey", "Magdalena", "Mitchell", "Jasmine", "Isaac", "Constance", "Emmett", "Tyler", "Serena", "Essie", "Riley", "Margaret", "Glenn", "Antonio", "Sonia", "Javier", "Khashayar" ], "edges": [ [ 0, 1 ], [ 0, 8 ], [ 1, 5 ], [ 4, 7 ], [ 5, 2 ], [ 6, 4 ], [ 7, 9 ], [ 8, 6 ], [ 9, 3 ], [ 10, 11 ], [ 10, 18 ], [ 11, 15 ], [ 14, 17 ], [ 15, 12 ], [ 16, 14 ], [ 17, 19 ], [ 18, 16 ], [ 19, 13 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Diana knows Brenda. Joan knows Harmony. Holly knows Lorna. Kurt knows Olivia. Yasmin knows Joan. Harmony knows Kurt. Kurt knows Iris. Diana knows Dylan. Holly knows Frances. Alejandro knows Carrie. Yuki knows Sally. Alejandro knows Alma. Dayton knows Yuki. Olivia knows Alejandro. Alma knows Kieran. Frances knows Gordon. Sally knows Diana. Dylan knows Holly. Which of Gordon and Kieran can Dayton reach?", "answer": "Gordon", "steps": [ "Dayton knows Yuki.", "Yuki knows Sally.", "Sally knows Diana.", "Diana knows Dylan.", "Dylan knows Holly.", "Holly knows Frances.", "Frances knows Gordon." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Dayton", "Holly", "Yuki", "Brenda", "Diana", "Frances", "Sally", "Lorna", "Gordon", "Dylan", "Yasmin", "Alejandro", "Joan", "Iris", "Kurt", "Alma", "Harmony", "Carrie", "Kieran", "Olivia" ], "edges": [ [ 0, 2 ], [ 1, 7 ], [ 1, 5 ], [ 2, 6 ], [ 4, 3 ], [ 4, 9 ], [ 5, 8 ], [ 6, 4 ], [ 9, 1 ], [ 10, 12 ], [ 11, 17 ], [ 11, 15 ], [ 12, 16 ], [ 14, 13 ], [ 14, 19 ], [ 15, 18 ], [ 16, 14 ], [ 19, 11 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Dorothy knows Colette. Priscilla knows Regina. Fanny knows Lorna. Jakob knows Lee. Lorna knows Zane. Jakob knows Grace. Jaime knows Humphrey. Dorothy knows Parker. Erwin knows Todd. Zane knows Dixie. Jaime knows Erwin. Parker knows Priscilla. Grace knows Fanny. Grace knows Celia. Miles knows Jaime. Sam knows Jakob. Erwin knows Dorothy. Fanny knows Sierra. Which of Jaime and Jakob can Miles reach?", "answer": "Jaime", "steps": [ "Miles knows Jaime." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Miles", "Regina", "Jaime", "Erwin", "Todd", "Dorothy", "Priscilla", "Parker", "Humphrey", "Colette", "Sam", "Dixie", "Jakob", "Grace", "Celia", "Fanny", "Zane", "Lorna", "Lee", "Sierra" ], "edges": [ [ 0, 2 ], [ 2, 8 ], [ 2, 3 ], [ 3, 4 ], [ 3, 5 ], [ 5, 7 ], [ 5, 9 ], [ 6, 1 ], [ 7, 6 ], [ 10, 12 ], [ 12, 18 ], [ 12, 13 ], [ 13, 14 ], [ 13, 15 ], [ 15, 17 ], [ 15, 19 ], [ 16, 11 ], [ 17, 16 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Lee knows Beau. Tabitha knows Verna. Randall knows Lawrence. Randall knows Vance. Beau knows Hannah. Noel knows Randall. Aspen knows Tabitha. Tabitha knows Noel. Lawrence knows Lisa. Essie knows Hugo. Hilda knows Lee. Hilda knows Warren. Lee knows Essie. Essie knows Arthur. Noel knows Allen. Arthur knows Stephen. Ronald knows Hilda. Allen knows Troy. Which of Lee and Noel can Aspen reach?", "answer": "Noel", "steps": [ "Aspen knows Tabitha.", "Tabitha knows Noel." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Aspen", "Randall", "Tabitha", "Lawrence", "Verna", "Lisa", "Noel", "Troy", "Allen", "Vance", "Ronald", "Essie", "Hilda", "Arthur", "Warren", "Stephen", "Lee", "Hannah", "Beau", "Hugo" ], "edges": [ [ 0, 2 ], [ 1, 3 ], [ 1, 9 ], [ 2, 4 ], [ 2, 6 ], [ 3, 5 ], [ 6, 8 ], [ 6, 1 ], [ 8, 7 ], [ 10, 12 ], [ 11, 13 ], [ 11, 19 ], [ 12, 14 ], [ 12, 16 ], [ 13, 15 ], [ 16, 18 ], [ 16, 11 ], [ 18, 17 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Gina knows Philip. Cora knows Rhonda. Bart knows Rebecca. Elaine knows Gina. Douglas knows Bart. Tom knows Ted. Randall knows Byron. Philip knows Aspen. Ted knows Elaine. Holden knows Claude. Aspen knows Trevor. Rebecca knows Ivy. Kane knows Tom. Rhonda knows Samantha. Claude knows Kane. Ivy knows Horace. Horace knows Cora. Samantha knows Randall. Which of Aspen and Randall can Douglas reach?", "answer": "Randall", "steps": [ "Douglas knows Bart.", "Bart knows Rebecca.", "Rebecca knows Ivy.", "Ivy knows Horace.", "Horace knows Cora.", "Cora knows Rhonda.", "Rhonda knows Samantha.", "Samantha knows Randall." ], "difficulty": 8, "original_distance": 9, "idx_to_symbol": [ "Douglas", "Bart", "Randall", "Cora", "Ivy", "Rhonda", "Byron", "Rebecca", "Samantha", "Horace", "Holden", "Claude", "Aspen", "Elaine", "Tom", "Gina", "Trevor", "Kane", "Philip", "Ted" ], "edges": [ [ 0, 1 ], [ 1, 7 ], [ 2, 6 ], [ 3, 5 ], [ 4, 9 ], [ 5, 8 ], [ 7, 4 ], [ 8, 2 ], [ 9, 3 ], [ 10, 11 ], [ 11, 17 ], [ 12, 16 ], [ 13, 15 ], [ 14, 19 ], [ 15, 18 ], [ 17, 14 ], [ 18, 12 ], [ 19, 13 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Chantal knows Curtis. Vivian knows James. Sydney knows Don. Don knows Benjamin. Lars knows Sydney. Calvin knows Heidi. Wanda knows Enid. Clinton knows Bruno. Clarissa knows Violet. Kenzie knows Calvin. Violet knows Wanda. Benjamin knows Kenzie. Marcia knows Clarissa. James knows Marcia. Benjamin knows Kent. Bruno knows Vivian. Curtis knows Lars. Clarissa knows Destiny. Which of Kenzie and Violet can Chantal reach?", "answer": "Kenzie", "steps": [ "Chantal knows Curtis.", "Curtis knows Lars.", "Lars knows Sydney.", "Sydney knows Don.", "Don knows Benjamin.", "Benjamin knows Kenzie." ], "difficulty": 6, "original_distance": 8, "idx_to_symbol": [ "Chantal", "Curtis", "Don", "Kent", "Lars", "Benjamin", "Kenzie", "Sydney", "Calvin", "Heidi", "Clinton", "Bruno", "Marcia", "Destiny", "Vivian", "Clarissa", "Violet", "James", "Wanda", "Enid" ], "edges": [ [ 0, 1 ], [ 1, 4 ], [ 2, 5 ], [ 4, 7 ], [ 5, 3 ], [ 5, 6 ], [ 6, 8 ], [ 7, 2 ], [ 8, 9 ], [ 10, 11 ], [ 11, 14 ], [ 12, 15 ], [ 14, 17 ], [ 15, 13 ], [ 15, 16 ], [ 16, 18 ], [ 17, 12 ], [ 18, 19 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Zara knows Donna. Preston knows Albert. Erica knows Claudia. Preston knows Leon. Darla knows Randall. Glenn knows Erica. Barbara knows Zara. Emma knows Jared. Earle knows Emma. Leon knows Glenn. Jared knows Rena. Randall knows Earle. Claudia knows Blaine. Randall knows Lana. Kieran knows Kirsten. Rena knows Kieran. Earle knows Adam. Zara knows Preston. Which of Blaine and Kirsten can Barbara reach?", "answer": "Blaine", "steps": [ "Barbara knows Zara.", "Zara knows Preston.", "Preston knows Leon.", "Leon knows Glenn.", "Glenn knows Erica.", "Erica knows Claudia.", "Claudia knows Blaine." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Barbara", "Blaine", "Albert", "Claudia", "Erica", "Donna", "Leon", "Glenn", "Preston", "Zara", "Darla", "Kirsten", "Adam", "Kieran", "Rena", "Lana", "Emma", "Jared", "Earle", "Randall" ], "edges": [ [ 0, 9 ], [ 3, 1 ], [ 4, 3 ], [ 6, 7 ], [ 7, 4 ], [ 8, 2 ], [ 8, 6 ], [ 9, 5 ], [ 9, 8 ], [ 10, 19 ], [ 13, 11 ], [ 14, 13 ], [ 16, 17 ], [ 17, 14 ], [ 18, 12 ], [ 18, 16 ], [ 19, 15 ], [ 19, 18 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Pauline knows Eunice. Abigail knows Dolly. Carson knows Maya. Keira knows Joshua. Gwen knows Keira. Natalie knows Greer. Sally knows Carson. Eunice knows Natalie. Dolly knows Dorian. Joshua knows Janet. Gwen knows Harlan. Caroline knows Ilene. Brad knows Warren. Janet knows Caroline. Pauline knows Amelia. Ilene knows Sally. Warren knows Abigail. Greer knows Brad. Which of Keira and Eunice can Gwen reach?", "answer": "Keira", "steps": [ "Gwen knows Keira." ], "difficulty": 1, "original_distance": 8, "idx_to_symbol": [ "Gwen", "Joshua", "Harlan", "Carson", "Maya", "Keira", "Caroline", "Janet", "Ilene", "Sally", "Pauline", "Natalie", "Amelia", "Dolly", "Dorian", "Eunice", "Brad", "Greer", "Warren", "Abigail" ], "edges": [ [ 0, 2 ], [ 0, 5 ], [ 1, 7 ], [ 3, 4 ], [ 5, 1 ], [ 6, 8 ], [ 7, 6 ], [ 8, 9 ], [ 9, 3 ], [ 10, 12 ], [ 10, 15 ], [ 11, 17 ], [ 13, 14 ], [ 15, 11 ], [ 16, 18 ], [ 17, 16 ], [ 18, 19 ], [ 19, 13 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Ember knows Marc. Marion knows Arturo. Gertrude knows Delia. Arturo knows Sebastian. Harper knows Chantal. Helene knows Hector. Hayden knows Gertrude. Harry knows Kevin. Donald knows Helene. Sue knows Donald. Kennedy knows Stephanie. Stephanie knows Hayden. Ember knows Harper. Marc knows Kennedy. Arturo knows Sue. Hector knows Harry. Sebastian knows Josie. Abby knows Ember. Which of Ember and Arturo can Marion reach?", "answer": "Arturo", "steps": [ "Marion knows Arturo." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Marion", "Helene", "Josie", "Harry", "Arturo", "Sue", "Hector", "Sebastian", "Kevin", "Donald", "Abby", "Stephanie", "Chantal", "Gertrude", "Ember", "Marc", "Hayden", "Harper", "Delia", "Kennedy" ], "edges": [ [ 0, 4 ], [ 1, 6 ], [ 3, 8 ], [ 4, 7 ], [ 4, 5 ], [ 5, 9 ], [ 6, 3 ], [ 7, 2 ], [ 9, 1 ], [ 10, 14 ], [ 11, 16 ], [ 13, 18 ], [ 14, 17 ], [ 14, 15 ], [ 15, 19 ], [ 16, 13 ], [ 17, 12 ], [ 19, 11 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Keegan knows Juan. Jill knows Penny. Keegan knows Jill. Daria knows Brent. Mark knows Hugh. Mark knows Xavier. Hugh knows Cody. Xavier knows Malik. Brandon knows Mark. Cody knows Gene. Mark knows Leslie. Brent knows Elmer. Drake knows Keegan. Hugh knows Alison. Bart knows Larissa. Alison knows Kerry. Daria knows Bart. Keegan knows Daria. Which of Kerry and Elmer can Drake reach?", "answer": "Elmer", "steps": [ "Drake knows Keegan.", "Keegan knows Daria.", "Daria knows Brent.", "Brent knows Elmer." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Drake", "Daria", "Juan", "Brent", "Elmer", "Keegan", "Jill", "Penny", "Larissa", "Bart", "Brandon", "Hugh", "Leslie", "Alison", "Kerry", "Mark", "Xavier", "Malik", "Gene", "Cody" ], "edges": [ [ 0, 5 ], [ 1, 3 ], [ 1, 9 ], [ 3, 4 ], [ 5, 2 ], [ 5, 6 ], [ 5, 1 ], [ 6, 7 ], [ 9, 8 ], [ 10, 15 ], [ 11, 13 ], [ 11, 19 ], [ 13, 14 ], [ 15, 12 ], [ 15, 16 ], [ 15, 11 ], [ 16, 17 ], [ 19, 18 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Ariana knows Fletcher. Harley knows Federico. Ariana knows Lisa. Ariana knows Henrietta. Erica knows Fisher. Erica knows Gage. Joyce knows Leon. Javier knows Sandy. Dexter knows Joyce. Javier knows Herbert. Henrietta knows Dexter. Dexter knows Garrison. Dexter knows Natalie. Erica knows Jeanne. Gage knows Javier. Javier knows Harley. Harley knows Bella. Joyce knows Enid. Which of Henrietta and Gage can Ariana reach?", "answer": "Henrietta", "steps": [ "Ariana knows Henrietta." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Ariana", "Enid", "Fletcher", "Lisa", "Henrietta", "Garrison", "Leon", "Natalie", "Joyce", "Dexter", "Erica", "Bella", "Jeanne", "Fisher", "Gage", "Sandy", "Federico", "Herbert", "Harley", "Javier" ], "edges": [ [ 0, 2 ], [ 0, 3 ], [ 0, 4 ], [ 4, 9 ], [ 8, 1 ], [ 8, 6 ], [ 9, 5 ], [ 9, 7 ], [ 9, 8 ], [ 10, 12 ], [ 10, 13 ], [ 10, 14 ], [ 14, 19 ], [ 18, 11 ], [ 18, 16 ], [ 19, 15 ], [ 19, 17 ], [ 19, 18 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Wallace knows Ted. Humphrey knows Brynn. Cristina knows Harold. Wallace knows Effie. George knows Harry. Delilah knows Stuart. Gwen knows Humphrey. Ashley knows Cristina. Daisy knows Wyatt. Humphrey knows Jose. Wyatt knows Gwen. Ted knows Emma. George knows Daisy. Effie knows Vivian. Gwen knows Delilah. Ashley knows Melissa. Ted knows Garrett. Harold knows Wallace. Which of Harold and Wyatt can Ashley reach?", "answer": "Harold", "steps": [ "Ashley knows Cristina.", "Cristina knows Harold." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Ashley", "Cristina", "Ted", "Wallace", "Vivian", "Emma", "Harold", "Effie", "Garrett", "Melissa", "George", "Daisy", "Humphrey", "Gwen", "Stuart", "Jose", "Wyatt", "Delilah", "Brynn", "Harry" ], "edges": [ [ 0, 1 ], [ 0, 9 ], [ 1, 6 ], [ 2, 5 ], [ 2, 8 ], [ 3, 7 ], [ 3, 2 ], [ 6, 3 ], [ 7, 4 ], [ 10, 11 ], [ 10, 19 ], [ 11, 16 ], [ 12, 15 ], [ 12, 18 ], [ 13, 17 ], [ 13, 12 ], [ 16, 13 ], [ 17, 14 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Miriam knows Nancy. Miriam knows Dawn. Miriam knows Chad. Dane knows Brad. Lamont knows Angelica. Darin knows Adelaide. Brad knows Lamont. Dell knows Paige. Adelaide knows Gilbert. Jane knows Gail. Corinne knows Arturo. Ernie knows Miriam. Chad knows Lennox. Dell knows Dane. Brad knows Darin. Brad knows Melissa. Nancy knows Corinne. Jane knows Ernie. Which of Adelaide and Corinne can Jane reach?", "answer": "Corinne", "steps": [ "Jane knows Ernie.", "Ernie knows Miriam.", "Miriam knows Nancy.", "Nancy knows Corinne." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Jane", "Miriam", "Arturo", "Dawn", "Lennox", "Gail", "Corinne", "Chad", "Ernie", "Nancy", "Dell", "Brad", "Gilbert", "Melissa", "Angelica", "Paige", "Adelaide", "Lamont", "Dane", "Darin" ], "edges": [ [ 0, 5 ], [ 0, 8 ], [ 1, 3 ], [ 1, 7 ], [ 1, 9 ], [ 6, 2 ], [ 7, 4 ], [ 8, 1 ], [ 9, 6 ], [ 10, 15 ], [ 10, 18 ], [ 11, 13 ], [ 11, 17 ], [ 11, 19 ], [ 16, 12 ], [ 17, 14 ], [ 18, 11 ], [ 19, 16 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Ivan knows Gus. Ivan knows Patrick. Celia knows Effie. Celia knows Conrad. Arthur knows Alison. Colin knows Nancy. Colin knows Kamila. Harrison knows Alvin. Ivan knows Colin. Lydia knows Louise. Celia knows Kane. Effie knows Harrison. Kane knows Heidi. Kamila knows Hayley. Effie knows Lydia. Heidi knows Wilson. Gus knows Arthur. Nancy knows Aiden. Which of Aiden and Louise can Celia reach?", "answer": "Louise", "steps": [ "Celia knows Effie.", "Effie knows Lydia.", "Lydia knows Louise." ], "difficulty": 3, "original_distance": 3, "idx_to_symbol": [ "Celia", "Conrad", "Wilson", "Lydia", "Effie", "Kane", "Heidi", "Alvin", "Louise", "Harrison", "Ivan", "Patrick", "Alison", "Nancy", "Colin", "Gus", "Arthur", "Hayley", "Aiden", "Kamila" ], "edges": [ [ 0, 1 ], [ 0, 5 ], [ 0, 4 ], [ 3, 8 ], [ 4, 3 ], [ 4, 9 ], [ 5, 6 ], [ 6, 2 ], [ 9, 7 ], [ 10, 11 ], [ 10, 15 ], [ 10, 14 ], [ 13, 18 ], [ 14, 13 ], [ 14, 19 ], [ 15, 16 ], [ 16, 12 ], [ 19, 17 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Marco knows Javier. Hugo knows Milo. Noah knows Chelsea. Carmela knows Glenn. Milo knows Knox. Marco knows Noah. Hugo knows Jade. Ray knows Carmela. Chelsea knows Aubrey. Milo knows Elias. Ray knows Gemma. Ray knows Marco. Milo knows Wallace. Marco knows Melody. Wallace knows Kelly. Hugo knows Terrence. Terrence knows Ava. Kelly knows Freya. Which of Chelsea and Kelly can Hugo reach?", "answer": "Kelly", "steps": [ "Hugo knows Milo.", "Milo knows Wallace.", "Wallace knows Kelly." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Hugo", "Terrence", "Knox", "Kelly", "Jade", "Elias", "Ava", "Milo", "Freya", "Wallace", "Ray", "Carmela", "Javier", "Chelsea", "Gemma", "Melody", "Glenn", "Marco", "Aubrey", "Noah" ], "edges": [ [ 0, 4 ], [ 0, 1 ], [ 0, 7 ], [ 1, 6 ], [ 3, 8 ], [ 7, 2 ], [ 7, 5 ], [ 7, 9 ], [ 9, 3 ], [ 10, 14 ], [ 10, 11 ], [ 10, 17 ], [ 11, 16 ], [ 13, 18 ], [ 17, 12 ], [ 17, 15 ], [ 17, 19 ], [ 19, 13 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Lena knows Atlas. Lena knows Reed. Taylor knows Erwin. Lena knows Alana. Alexa knows Arnold. Drake knows Keaton. Geoffrey knows Stephanie. Keaton knows Wade. Ezra knows Drake. Lena knows Ezra. Atlas knows Rosemary. Arnold knows Tiffany. Stacy knows Taylor. Reed knows Corey. Stacy knows Geoffrey. Stacy knows Calvin. Jerome knows Alexa. Stacy knows Jerome. Which of Tiffany and Wade can Lena reach?", "answer": "Wade", "steps": [ "Lena knows Ezra.", "Ezra knows Drake.", "Drake knows Keaton.", "Keaton knows Wade." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Lena", "Alana", "Corey", "Atlas", "Keaton", "Wade", "Drake", "Rosemary", "Reed", "Ezra", "Stacy", "Calvin", "Stephanie", "Taylor", "Arnold", "Tiffany", "Alexa", "Erwin", "Geoffrey", "Jerome" ], "edges": [ [ 0, 1 ], [ 0, 3 ], [ 0, 8 ], [ 0, 9 ], [ 3, 7 ], [ 4, 5 ], [ 6, 4 ], [ 8, 2 ], [ 9, 6 ], [ 10, 11 ], [ 10, 13 ], [ 10, 18 ], [ 10, 19 ], [ 13, 17 ], [ 14, 15 ], [ 16, 14 ], [ 18, 12 ], [ 19, 16 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Pauline knows Darius. Mindy knows Chandler. Levi knows Malcolm. Robert knows Pauline. Barry knows Samuel. Rick knows Levi. Leland knows Clinton. Mindy knows Margaret. Robert knows Mindy. Malcolm knows Eldon. Rocco knows Chad. Adele knows Lawrence. Samuel knows Vernon. Leland knows Joseph. Adele knows Barry. Rick knows Robert. Lawrence knows Rocco. Barry knows Leland. Which of Rocco and Malcolm can Adele reach?", "answer": "Rocco", "steps": [ "Adele knows Lawrence.", "Lawrence knows Rocco." ], "difficulty": 2, "original_distance": 3, "idx_to_symbol": [ "Adele", "Samuel", "Chad", "Leland", "Rocco", "Vernon", "Barry", "Lawrence", "Joseph", "Clinton", "Rick", "Pauline", "Eldon", "Mindy", "Malcolm", "Darius", "Robert", "Levi", "Margaret", "Chandler" ], "edges": [ [ 0, 7 ], [ 0, 6 ], [ 1, 5 ], [ 3, 8 ], [ 3, 9 ], [ 4, 2 ], [ 6, 1 ], [ 6, 3 ], [ 7, 4 ], [ 10, 17 ], [ 10, 16 ], [ 11, 15 ], [ 13, 18 ], [ 13, 19 ], [ 14, 12 ], [ 16, 11 ], [ 16, 13 ], [ 17, 14 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Christian knows Sandra. Glenda knows Joseph. Uma knows Christopher. Nancy knows Joaquin. Bennett knows Glenda. Joseph knows Gary. Joaquin knows Ariana. Susan knows Emmett. Uma knows Boyd. Susan knows Clifford. Harmony knows Herbert. Emmett knows Garrett. Emmett knows Bennett. Karen knows Nancy. Karen knows Harmony. Boyd knows Olive. Boyd knows Karen. Bennett knows Christian. Which of Emmett and Boyd can Uma reach?", "answer": "Boyd", "steps": [ "Uma knows Boyd." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Uma", "Harmony", "Olive", "Nancy", "Christopher", "Boyd", "Karen", "Joaquin", "Ariana", "Herbert", "Susan", "Christian", "Garrett", "Glenda", "Clifford", "Emmett", "Bennett", "Joseph", "Gary", "Sandra" ], "edges": [ [ 0, 4 ], [ 0, 5 ], [ 1, 9 ], [ 3, 7 ], [ 5, 2 ], [ 5, 6 ], [ 6, 3 ], [ 6, 1 ], [ 7, 8 ], [ 10, 14 ], [ 10, 15 ], [ 11, 19 ], [ 13, 17 ], [ 15, 12 ], [ 15, 16 ], [ 16, 13 ], [ 16, 11 ], [ 17, 18 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Marshall knows Hardy. Francesca knows Blair. Fred knows Goldie. Marshall knows Francesca. Julio knows Kaleb. Eugenia knows Claudia. Pedro knows Julio. Fred knows Noah. Claudia knows Marilyn. Eugenia knows Marshall. Blair knows Tony. Noah knows Geneva. Pedro knows Fred. Tony knows Vanessa. Goldie knows Parker. Parker knows Valerie. Hardy knows Beverly. Valerie knows Jessie. Which of Francesca and Goldie can Pedro reach?", "answer": "Goldie", "steps": [ "Pedro knows Fred.", "Fred knows Goldie." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Pedro", "Kaleb", "Noah", "Julio", "Valerie", "Goldie", "Geneva", "Parker", "Jessie", "Fred", "Eugenia", "Marilyn", "Hardy", "Claudia", "Tony", "Francesca", "Beverly", "Blair", "Vanessa", "Marshall" ], "edges": [ [ 0, 3 ], [ 0, 9 ], [ 2, 6 ], [ 3, 1 ], [ 4, 8 ], [ 5, 7 ], [ 7, 4 ], [ 9, 2 ], [ 9, 5 ], [ 10, 13 ], [ 10, 19 ], [ 12, 16 ], [ 13, 11 ], [ 14, 18 ], [ 15, 17 ], [ 17, 14 ], [ 19, 12 ], [ 19, 15 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Emmett knows Esperanza. Nadine knows Chase. Cameron knows Sidney. Isiah knows Gene. Emmett knows Nicole. Nadine knows Brad. Declan knows Nadine. Albert knows Isiah. Albert knows Darius. Brad knows Zane. Emmett knows Eileen. Declan knows Cameron. Brad knows Colette. Brad knows Karl. Nicole knows Pablo. Darius knows Emmett. Colette knows Derrick. Darius knows Grant. Which of Colette and Nicole can Declan reach?", "answer": "Colette", "steps": [ "Declan knows Nadine.", "Nadine knows Brad.", "Brad knows Colette." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Declan", "Brad", "Karl", "Cameron", "Derrick", "Zane", "Colette", "Nadine", "Chase", "Sidney", "Albert", "Emmett", "Esperanza", "Isiah", "Pablo", "Eileen", "Nicole", "Darius", "Grant", "Gene" ], "edges": [ [ 0, 7 ], [ 0, 3 ], [ 1, 2 ], [ 1, 5 ], [ 1, 6 ], [ 3, 9 ], [ 6, 4 ], [ 7, 1 ], [ 7, 8 ], [ 10, 17 ], [ 10, 13 ], [ 11, 12 ], [ 11, 15 ], [ 11, 16 ], [ 13, 19 ], [ 16, 14 ], [ 17, 11 ], [ 17, 18 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Patrick knows Brent. Lena knows Edgar. Leon knows Dustin. Shelby knows Xander. Dominic knows Lena. Monica knows Griffith. Edgar knows Pete. Patrick knows Monica. Everett knows Shelby. Monica knows Erin. Rocco knows Eloise. Xander knows Rocco. Shelby knows Kit. Griffith knows Dominic. Everett knows Brooks. Neville knows Patrick. Hazel knows Everett. Eloise knows Leon. Which of Everett and Patrick can Neville reach?", "answer": "Patrick", "steps": [ "Neville knows Patrick." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Neville", "Pete", "Dominic", "Brent", "Lena", "Griffith", "Monica", "Erin", "Patrick", "Edgar", "Hazel", "Dustin", "Rocco", "Brooks", "Eloise", "Xander", "Shelby", "Kit", "Everett", "Leon" ], "edges": [ [ 0, 8 ], [ 2, 4 ], [ 4, 9 ], [ 5, 2 ], [ 6, 7 ], [ 6, 5 ], [ 8, 3 ], [ 8, 6 ], [ 9, 1 ], [ 10, 18 ], [ 12, 14 ], [ 14, 19 ], [ 15, 12 ], [ 16, 17 ], [ 16, 15 ], [ 18, 13 ], [ 18, 16 ], [ 19, 11 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Alex knows Elvis. Leigh knows Jeff. Wayne knows Erma. Sidney knows Connor. Earl knows Ira. Alfred knows Catherine. Lorna knows Earl. Leigh knows Alfred. Boris knows Jenna. Wayne knows Martha. Catherine knows Boris. Erma knows Lorna. Jenna knows Vance. Catherine knows Mia. Lorna knows Anton. Lorna knows Carey. Carey knows Sidney. Catherine knows Alex. Which of Vance and Connor can Leigh reach?", "answer": "Vance", "steps": [ "Leigh knows Alfred.", "Alfred knows Catherine.", "Catherine knows Boris.", "Boris knows Jenna.", "Jenna knows Vance." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Leigh", "Jenna", "Jeff", "Boris", "Vance", "Elvis", "Catherine", "Alex", "Alfred", "Mia", "Wayne", "Sidney", "Martha", "Carey", "Connor", "Ira", "Lorna", "Earl", "Erma", "Anton" ], "edges": [ [ 0, 2 ], [ 0, 8 ], [ 1, 4 ], [ 3, 1 ], [ 6, 3 ], [ 6, 7 ], [ 6, 9 ], [ 7, 5 ], [ 8, 6 ], [ 10, 12 ], [ 10, 18 ], [ 11, 14 ], [ 13, 11 ], [ 16, 13 ], [ 16, 17 ], [ 16, 19 ], [ 17, 15 ], [ 18, 16 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "George knows Dolores. Carl knows Cecilia. Mitchell knows Parsa. Cecilia knows Blanche. Leigh knows Elliot. Todd knows Randy. Selena knows Marcia. Todd knows Charity. Norman knows Lily. Selena knows Gabe. Selena knows Eugenia. Blanche knows Leigh. Todd knows George. Dolores knows Mitchell. Lily knows Donna. Dewey knows Carl. Eugenia knows Dewey. Parsa knows Norman. Which of Mitchell and Carl can Todd reach?", "answer": "Mitchell", "steps": [ "Todd knows George.", "George knows Dolores.", "Dolores knows Mitchell." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Todd", "Charity", "Parsa", "Mitchell", "Lily", "Randy", "George", "Norman", "Dolores", "Donna", "Selena", "Gabe", "Cecilia", "Carl", "Leigh", "Marcia", "Eugenia", "Blanche", "Dewey", "Elliot" ], "edges": [ [ 0, 1 ], [ 0, 5 ], [ 0, 6 ], [ 2, 7 ], [ 3, 2 ], [ 4, 9 ], [ 6, 8 ], [ 7, 4 ], [ 8, 3 ], [ 10, 11 ], [ 10, 15 ], [ 10, 16 ], [ 12, 17 ], [ 13, 12 ], [ 14, 19 ], [ 16, 18 ], [ 17, 14 ], [ 18, 13 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Ember knows Marc. Marion knows Arturo. Gertrude knows Delia. Arturo knows Sebastian. Harper knows Chantal. Helene knows Hector. Hayden knows Gertrude. Harry knows Kevin. Donald knows Helene. Sue knows Donald. Kennedy knows Stephanie. Stephanie knows Hayden. Ember knows Harper. Marc knows Kennedy. Arturo knows Sue. Hector knows Harry. Sebastian knows Josie. Abby knows Ember. Which of Helene and Stephanie can Marion reach?", "answer": "Helene", "steps": [ "Marion knows Arturo.", "Arturo knows Sue.", "Sue knows Donald.", "Donald knows Helene." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Marion", "Helene", "Josie", "Harry", "Arturo", "Sue", "Hector", "Sebastian", "Kevin", "Donald", "Abby", "Stephanie", "Chantal", "Gertrude", "Ember", "Marc", "Hayden", "Harper", "Delia", "Kennedy" ], "edges": [ [ 0, 4 ], [ 1, 6 ], [ 3, 8 ], [ 4, 7 ], [ 4, 5 ], [ 5, 9 ], [ 6, 3 ], [ 7, 2 ], [ 9, 1 ], [ 10, 14 ], [ 11, 16 ], [ 13, 18 ], [ 14, 17 ], [ 14, 15 ], [ 15, 19 ], [ 16, 13 ], [ 17, 12 ], [ 19, 11 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Hugh knows Archer. Archer knows Yuki. Harriet knows Dexter. Harriet knows Don. Blake knows Bennett. Troy knows Stella. Bennett knows Harriet. Brock knows Hazel. Khashayar knows Blake. Bennett knows Troy. Vernon knows Beverly. Yuki knows Brock. Delilah knows Samuel. Patrick knows Kate. Dexter knows Patrick. Vernon knows Charles. Yuki knows Vernon. Beverly knows Delilah. Which of Bennett and Yuki can Khashayar reach?", "answer": "Bennett", "steps": [ "Khashayar knows Blake.", "Blake knows Bennett." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Khashayar", "Blake", "Harriet", "Bennett", "Patrick", "Kate", "Don", "Troy", "Dexter", "Stella", "Hugh", "Archer", "Vernon", "Yuki", "Delilah", "Samuel", "Charles", "Brock", "Beverly", "Hazel" ], "edges": [ [ 0, 1 ], [ 1, 3 ], [ 2, 6 ], [ 2, 8 ], [ 3, 2 ], [ 3, 7 ], [ 4, 5 ], [ 7, 9 ], [ 8, 4 ], [ 10, 11 ], [ 11, 13 ], [ 12, 16 ], [ 12, 18 ], [ 13, 12 ], [ 13, 17 ], [ 14, 15 ], [ 17, 19 ], [ 18, 14 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Courtney knows Jean. Eileen knows Rosa. Fred knows Courtney. Fraser knows Nelson. Courtney knows Julio. Iris knows Eve. Anita knows Erin. Iris knows Anita. Courtney knows Fraser. Iris knows Lambert. Iris knows Francis. Iris knows Eileen. Fred knows Trudy. Courtney knows Essie. Lyric knows Iris. Courtney knows Corey. Lyric knows Hope. Jean knows Nancy. Which of Jean and Eileen can Lyric reach?", "answer": "Eileen", "steps": [ "Lyric knows Iris.", "Iris knows Eileen." ], "difficulty": 2, "original_distance": 3, "idx_to_symbol": [ "Lyric", "Francis", "Rosa", "Anita", "Eve", "Eileen", "Erin", "Iris", "Hope", "Lambert", "Fred", "Essie", "Nancy", "Fraser", "Julio", "Jean", "Nelson", "Courtney", "Trudy", "Corey" ], "edges": [ [ 0, 8 ], [ 0, 7 ], [ 3, 6 ], [ 5, 2 ], [ 7, 1 ], [ 7, 4 ], [ 7, 5 ], [ 7, 3 ], [ 7, 9 ], [ 10, 18 ], [ 10, 17 ], [ 13, 16 ], [ 15, 12 ], [ 17, 11 ], [ 17, 14 ], [ 17, 15 ], [ 17, 13 ], [ 17, 19 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Jay knows Eve. Xander knows Jay. Verna knows Holly. Vicki knows Ellis. Emmett knows Steve. Reed knows Vicki. Jay knows Ilene. Vivian knows Jenny. Jay knows Heidi. Jenny knows Emmett. Archer knows Reed. Verna knows Diego. Verna knows Yasmin. Jenny knows Claudia. Reed knows Kenzie. Xander knows Vivian. Abigail knows Verna. Abigail knows Archer. Which of Steve and Ellis can Abigail reach?", "answer": "Ellis", "steps": [ "Abigail knows Archer.", "Archer knows Reed.", "Reed knows Vicki.", "Vicki knows Ellis." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Abigail", "Archer", "Ellis", "Kenzie", "Verna", "Vicki", "Yasmin", "Diego", "Holly", "Reed", "Xander", "Vivian", "Steve", "Claudia", "Jay", "Emmett", "Eve", "Ilene", "Heidi", "Jenny" ], "edges": [ [ 0, 4 ], [ 0, 1 ], [ 1, 9 ], [ 4, 6 ], [ 4, 7 ], [ 4, 8 ], [ 5, 2 ], [ 9, 3 ], [ 9, 5 ], [ 10, 14 ], [ 10, 11 ], [ 11, 19 ], [ 14, 16 ], [ 14, 17 ], [ 14, 18 ], [ 15, 12 ], [ 19, 13 ], [ 19, 15 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Javier knows Inez. Abigail knows Javier. Kent knows Jenny. Javier knows Lawson. Dewey knows Charlotte. Charlotte knows Barbara. Logan knows Magdalena. Inez knows Camden. Eli knows Ellen. Jenny knows Dewey. Logan knows Jenna. Dewey knows Logan. Dewey knows Hope. Jenna knows Stacy. Jameson knows Abigail. Inez knows Serena. Camden knows Jewel. Javier knows Eli. Which of Jenny and Abigail can Jameson reach?", "answer": "Abigail", "steps": [ "Jameson knows Abigail." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Jameson", "Serena", "Abigail", "Eli", "Camden", "Inez", "Javier", "Lawson", "Ellen", "Jewel", "Kent", "Magdalena", "Jenny", "Charlotte", "Jenna", "Logan", "Dewey", "Hope", "Barbara", "Stacy" ], "edges": [ [ 0, 2 ], [ 2, 6 ], [ 3, 8 ], [ 4, 9 ], [ 5, 1 ], [ 5, 4 ], [ 6, 7 ], [ 6, 3 ], [ 6, 5 ], [ 10, 12 ], [ 12, 16 ], [ 13, 18 ], [ 14, 19 ], [ 15, 11 ], [ 15, 14 ], [ 16, 17 ], [ 16, 13 ], [ 16, 15 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Marco knows Javier. Hugo knows Milo. Noah knows Chelsea. Carmela knows Glenn. Milo knows Knox. Marco knows Noah. Hugo knows Jade. Ray knows Carmela. Chelsea knows Aubrey. Milo knows Elias. Ray knows Gemma. Ray knows Marco. Milo knows Wallace. Marco knows Melody. Wallace knows Kelly. Hugo knows Terrence. Terrence knows Ava. Kelly knows Freya. Which of Aubrey and Freya can Hugo reach?", "answer": "Freya", "steps": [ "Hugo knows Milo.", "Milo knows Wallace.", "Wallace knows Kelly.", "Kelly knows Freya." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Hugo", "Terrence", "Knox", "Kelly", "Jade", "Elias", "Ava", "Milo", "Freya", "Wallace", "Ray", "Carmela", "Javier", "Chelsea", "Gemma", "Melody", "Glenn", "Marco", "Aubrey", "Noah" ], "edges": [ [ 0, 4 ], [ 0, 1 ], [ 0, 7 ], [ 1, 6 ], [ 3, 8 ], [ 7, 2 ], [ 7, 5 ], [ 7, 9 ], [ 9, 3 ], [ 10, 14 ], [ 10, 11 ], [ 10, 17 ], [ 11, 16 ], [ 13, 18 ], [ 17, 12 ], [ 17, 15 ], [ 17, 19 ], [ 19, 13 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Clarissa knows Carol. Roger knows Tyler. Anita knows Demetrius. Aspen knows Vera. Roger knows Ira. Ron knows Destiny. Cooper knows Camden. Vera knows Carla. Tyler knows Aspen. Clarissa knows Khashayar. Carla knows Gail. Zara knows Anita. Zara knows Ron. Demetrius knows Devon. Khashayar knows Zara. Devon knows Lyric. Aspen knows Cooper. Gail knows Patrick. Which of Patrick and Lyric can Roger reach?", "answer": "Patrick", "steps": [ "Roger knows Tyler.", "Tyler knows Aspen.", "Aspen knows Vera.", "Vera knows Carla.", "Carla knows Gail.", "Gail knows Patrick." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Roger", "Gail", "Camden", "Ira", "Aspen", "Patrick", "Cooper", "Carla", "Tyler", "Vera", "Clarissa", "Devon", "Destiny", "Carol", "Zara", "Lyric", "Ron", "Demetrius", "Khashayar", "Anita" ], "edges": [ [ 0, 3 ], [ 0, 8 ], [ 1, 5 ], [ 4, 6 ], [ 4, 9 ], [ 6, 2 ], [ 7, 1 ], [ 8, 4 ], [ 9, 7 ], [ 10, 13 ], [ 10, 18 ], [ 11, 15 ], [ 14, 16 ], [ 14, 19 ], [ 16, 12 ], [ 17, 11 ], [ 18, 14 ], [ 19, 17 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Xavier knows Gus. Teresa knows Abel. Bruce knows Louisa. Darla knows Atlas. Lily knows William. Dell knows Emma. Eugenia knows Teresa. Luz knows Rod. Atlas knows Lily. Nolan knows Howard. Donovan knows Nolan. Nolan knows Darla. Bruce knows Hattie. Dante knows Eugenia. Hattie knows Donovan. Rod knows Xavier. Xavier knows Dante. Dell knows Luz. Which of William and Abel can Dell reach?", "answer": "Abel", "steps": [ "Dell knows Luz.", "Luz knows Rod.", "Rod knows Xavier.", "Xavier knows Dante.", "Dante knows Eugenia.", "Eugenia knows Teresa.", "Teresa knows Abel." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Dell", "Teresa", "Abel", "Emma", "Rod", "Luz", "Dante", "Eugenia", "Xavier", "Gus", "Bruce", "Lily", "William", "Louisa", "Donovan", "Hattie", "Darla", "Atlas", "Nolan", "Howard" ], "edges": [ [ 0, 3 ], [ 0, 5 ], [ 1, 2 ], [ 4, 8 ], [ 5, 4 ], [ 6, 7 ], [ 7, 1 ], [ 8, 6 ], [ 8, 9 ], [ 10, 13 ], [ 10, 15 ], [ 11, 12 ], [ 14, 18 ], [ 15, 14 ], [ 16, 17 ], [ 17, 11 ], [ 18, 16 ], [ 18, 19 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Bryan knows Dennis. Peter knows Morgan. Bryan knows Susan. Fred knows Lawson. Peter knows Fred. Morgan knows Cecilia. Percy knows Thea. Nolan knows Willard. Estelle knows Peter. Willard knows Kurt. Percy knows Lamar. Lamar knows Bryan. Raquel knows Percy. Willard knows Estelle. Kurt knows Lennox. Thea knows Malik. Susan knows Claudia. Dennis knows Albert. Which of Lamar and Estelle can Nolan reach?", "answer": "Estelle", "steps": [ "Nolan knows Willard.", "Willard knows Estelle." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Nolan", "Peter", "Lennox", "Kurt", "Cecilia", "Estelle", "Fred", "Morgan", "Lawson", "Willard", "Raquel", "Bryan", "Malik", "Thea", "Albert", "Lamar", "Susan", "Dennis", "Claudia", "Percy" ], "edges": [ [ 0, 9 ], [ 1, 7 ], [ 1, 6 ], [ 3, 2 ], [ 5, 1 ], [ 6, 8 ], [ 7, 4 ], [ 9, 3 ], [ 9, 5 ], [ 10, 19 ], [ 11, 17 ], [ 11, 16 ], [ 13, 12 ], [ 15, 11 ], [ 16, 18 ], [ 17, 14 ], [ 19, 13 ], [ 19, 15 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Sheila knows August. Lars knows Henrietta. Allan knows Gladys. Jared knows Jasmine. Tim knows Ernie. Ernie knows Sheila. Jared knows Troy. Glenda knows Harper. Ian knows Glenda. Lars knows Samantha. Henrietta knows Ian. August knows Celia. Eloise knows Erica. Erica knows Aubrey. Jasmine knows Allan. Ian knows Bert. Allan knows Tim. Harper knows Eloise. Which of Ernie and Harper can Lars reach?", "answer": "Harper", "steps": [ "Lars knows Henrietta.", "Henrietta knows Ian.", "Ian knows Glenda.", "Glenda knows Harper." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Lars", "Harper", "Glenda", "Ian", "Erica", "Samantha", "Henrietta", "Aubrey", "Eloise", "Bert", "Jared", "Ernie", "Tim", "Allan", "August", "Troy", "Jasmine", "Celia", "Sheila", "Gladys" ], "edges": [ [ 0, 5 ], [ 0, 6 ], [ 1, 8 ], [ 2, 1 ], [ 3, 2 ], [ 3, 9 ], [ 4, 7 ], [ 6, 3 ], [ 8, 4 ], [ 10, 15 ], [ 10, 16 ], [ 11, 18 ], [ 12, 11 ], [ 13, 12 ], [ 13, 19 ], [ 14, 17 ], [ 16, 13 ], [ 18, 14 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Daria knows Adelaide. Philip knows Anita. Griffith knows Iris. Russell knows Max. Katrina knows Melody. Katrina knows Xander. Avery knows Daria. Melody knows Griffith. Basil knows Autumn. Ken knows Harrison. Max knows Basil. Iris knows Philip. Hal knows Aisha. Daria knows Russell. Aisha knows Katrina. Hal knows Josie. Ken knows Avery. Autumn knows Elliot. Which of Daria and Katrina can Ken reach?", "answer": "Daria", "steps": [ "Ken knows Avery.", "Avery knows Daria." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Ken", "Russell", "Elliot", "Harrison", "Basil", "Adelaide", "Max", "Avery", "Daria", "Autumn", "Hal", "Melody", "Anita", "Josie", "Iris", "Xander", "Griffith", "Aisha", "Katrina", "Philip" ], "edges": [ [ 0, 3 ], [ 0, 7 ], [ 1, 6 ], [ 4, 9 ], [ 6, 4 ], [ 7, 8 ], [ 8, 5 ], [ 8, 1 ], [ 9, 2 ], [ 10, 13 ], [ 10, 17 ], [ 11, 16 ], [ 14, 19 ], [ 16, 14 ], [ 17, 18 ], [ 18, 15 ], [ 18, 11 ], [ 19, 12 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Latoya knows Mildred. Margaret knows Nicholas. Veronica knows Saul. Mildred knows Lisa. Kristin knows Eldon. Veronica knows Beverly. Lisa knows Ellis. Barbara knows Cody. Cameron knows Veronica. Aubrey knows Cameron. Ellis knows Cesar. Cesar knows Alison. Nicholas knows Barbara. Cesar knows Betty. Barbara knows Clay. Eldon knows Latoya. Latoya knows Julio. Beverly knows Margaret. Which of Veronica and Latoya can Aubrey reach?", "answer": "Veronica", "steps": [ "Aubrey knows Cameron.", "Cameron knows Veronica." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Aubrey", "Veronica", "Nicholas", "Barbara", "Margaret", "Cameron", "Saul", "Clay", "Beverly", "Cody", "Kristin", "Latoya", "Ellis", "Cesar", "Lisa", "Eldon", "Julio", "Alison", "Mildred", "Betty" ], "edges": [ [ 0, 5 ], [ 1, 6 ], [ 1, 8 ], [ 2, 3 ], [ 3, 7 ], [ 3, 9 ], [ 4, 2 ], [ 5, 1 ], [ 8, 4 ], [ 10, 15 ], [ 11, 16 ], [ 11, 18 ], [ 12, 13 ], [ 13, 17 ], [ 13, 19 ], [ 14, 12 ], [ 15, 11 ], [ 18, 14 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Veronica knows Hayley. Hayley knows Rose. Holly knows Terry. Glenn knows Wilson. Nolan knows Kennedy. Glenn knows Blair. Alice knows Nolan. Janice knows Edith. Hayley knows Dolores. Tim knows Glenn. Sandra knows Winston. Glenn knows Veronica. Winston knows Tim. Nolan knows Gene. Holly knows Alice. Edith knows Lenora. Holly knows Sheryl. Lenora knows Holly. Which of Glenn and Holly can Sandra reach?", "answer": "Glenn", "steps": [ "Sandra knows Winston.", "Winston knows Tim.", "Tim knows Glenn." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Sandra", "Blair", "Veronica", "Winston", "Wilson", "Hayley", "Dolores", "Rose", "Glenn", "Tim", "Janice", "Sheryl", "Alice", "Edith", "Terry", "Nolan", "Kennedy", "Gene", "Holly", "Lenora" ], "edges": [ [ 0, 3 ], [ 2, 5 ], [ 3, 9 ], [ 5, 6 ], [ 5, 7 ], [ 8, 1 ], [ 8, 4 ], [ 8, 2 ], [ 9, 8 ], [ 10, 13 ], [ 12, 15 ], [ 13, 19 ], [ 15, 16 ], [ 15, 17 ], [ 18, 11 ], [ 18, 14 ], [ 18, 12 ], [ 19, 18 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Mia knows Cara. Wesley knows Elvis. Vera knows Byron. Bailey knows Kay. Elvis knows Drew. Deborah knows Brian. Vera knows Andrea. Elena knows Vera. Byron knows Jason. Elvis knows Jerry. Kay knows Wesley. Leonard knows Axel. Deborah knows Elena. Byron knows Bernadette. Wesley knows Celeste. Bailey knows Vance. Byron knows Leonard. Elvis knows Mia. Which of Elena and Kay can Deborah reach?", "answer": "Elena", "steps": [ "Deborah knows Elena." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Deborah", "Vera", "Axel", "Andrea", "Leonard", "Bernadette", "Byron", "Elena", "Jason", "Brian", "Bailey", "Wesley", "Cara", "Celeste", "Mia", "Drew", "Elvis", "Kay", "Jerry", "Vance" ], "edges": [ [ 0, 7 ], [ 0, 9 ], [ 1, 3 ], [ 1, 6 ], [ 4, 2 ], [ 6, 4 ], [ 6, 5 ], [ 6, 8 ], [ 7, 1 ], [ 10, 17 ], [ 10, 19 ], [ 11, 13 ], [ 11, 16 ], [ 14, 12 ], [ 16, 14 ], [ 16, 15 ], [ 16, 18 ], [ 17, 11 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Gonzalo knows Luella. Linda knows Tyler. Ted knows Kimberly. Joshua knows Ian. Rena knows Kate. Autumn knows Kenneth. Ted knows Zelda. Kimberly knows Esme. Tyler knows Rena. Gonzalo knows Joshua. Tyler knows Hayden. Esme knows Winifred. Allison knows Cecilia. Alma knows Sally. Kenneth knows Alma. Winifred knows Linda. Sally knows Gonzalo. Allison knows Autumn. Which of Esme and Kenneth can Ted reach?", "answer": "Esme", "steps": [ "Ted knows Kimberly.", "Kimberly knows Esme." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Ted", "Hayden", "Tyler", "Kimberly", "Kate", "Esme", "Linda", "Rena", "Zelda", "Winifred", "Allison", "Luella", "Gonzalo", "Autumn", "Ian", "Kenneth", "Sally", "Joshua", "Cecilia", "Alma" ], "edges": [ [ 0, 8 ], [ 0, 3 ], [ 2, 1 ], [ 2, 7 ], [ 3, 5 ], [ 5, 9 ], [ 6, 2 ], [ 7, 4 ], [ 9, 6 ], [ 10, 18 ], [ 10, 13 ], [ 12, 11 ], [ 12, 17 ], [ 13, 15 ], [ 15, 19 ], [ 16, 12 ], [ 17, 14 ], [ 19, 16 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Garrison knows Fleur. Uma knows Bryan. Jerry knows Caroline. Clyde knows Cody. Otto knows Florence. Clyde knows Darcy. Francesca knows Lauren. Florence knows Jillian. Otto knows Jerry. Douglas knows Francesca. Douglas knows Corey. Clyde knows Sara. Sara knows Elena. Cody knows Garrison. Darcy knows Barry. Otto knows Douglas. Darcy knows Uma. Caroline knows Inez. Which of Garrison and Caroline can Otto reach?", "answer": "Caroline", "steps": [ "Otto knows Jerry.", "Jerry knows Caroline." ], "difficulty": 2, "original_distance": 3, "idx_to_symbol": [ "Otto", "Corey", "Jerry", "Jillian", "Lauren", "Inez", "Douglas", "Florence", "Francesca", "Caroline", "Clyde", "Barry", "Cody", "Elena", "Bryan", "Fleur", "Darcy", "Sara", "Uma", "Garrison" ], "edges": [ [ 0, 7 ], [ 0, 6 ], [ 0, 2 ], [ 2, 9 ], [ 6, 1 ], [ 6, 8 ], [ 7, 3 ], [ 8, 4 ], [ 9, 5 ], [ 10, 17 ], [ 10, 16 ], [ 10, 12 ], [ 12, 19 ], [ 16, 11 ], [ 16, 18 ], [ 17, 13 ], [ 18, 14 ], [ 19, 15 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Beth knows Derek. Kirsten knows Archer. Gerald knows Fanny. Bill knows Jorge. April knows Kirsten. Fanny knows Harlan. Archer knows Kira. Chance knows Giselle. Derek knows Brynn. Derek knows Jolene. Kira knows Claire. Giselle knows Maria. Jolene knows Gerald. Kira knows Marvin. Giselle knows Beth. Marvin knows Bill. Kirsten knows Vincent. Jorge knows Dennis. Which of Fanny and Jorge can April reach?", "answer": "Jorge", "steps": [ "April knows Kirsten.", "Kirsten knows Archer.", "Archer knows Kira.", "Kira knows Marvin.", "Marvin knows Bill.", "Bill knows Jorge." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "April", "Dennis", "Kira", "Marvin", "Claire", "Bill", "Vincent", "Kirsten", "Jorge", "Archer", "Chance", "Harlan", "Derek", "Jolene", "Brynn", "Gerald", "Maria", "Giselle", "Fanny", "Beth" ], "edges": [ [ 0, 7 ], [ 2, 4 ], [ 2, 3 ], [ 3, 5 ], [ 5, 8 ], [ 7, 6 ], [ 7, 9 ], [ 8, 1 ], [ 9, 2 ], [ 10, 17 ], [ 12, 14 ], [ 12, 13 ], [ 13, 15 ], [ 15, 18 ], [ 17, 16 ], [ 17, 19 ], [ 18, 11 ], [ 19, 12 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Ashley knows Leon. Ibrahim knows Lillian. Lola knows Ann. Alexa knows Beau. Stacy knows Corinne. Stacy knows Cynthia. Leon knows Marshall. Shane knows Ibrahim. Ann knows Dwight. Corinne knows Cesar. Jane knows Shelly. Corinne knows Eduardo. Ibrahim knows Alexa. Alexa knows Ashley. Margaret knows Shane. Shane knows Jeff. Eduardo knows Jane. Ann knows Stacy. Which of Alexa and Corinne can Margaret reach?", "answer": "Alexa", "steps": [ "Margaret knows Shane.", "Shane knows Ibrahim.", "Ibrahim knows Alexa." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Margaret", "Leon", "Alexa", "Shane", "Jeff", "Ashley", "Beau", "Marshall", "Ibrahim", "Lillian", "Lola", "Jane", "Corinne", "Ann", "Dwight", "Eduardo", "Cesar", "Shelly", "Stacy", "Cynthia" ], "edges": [ [ 0, 3 ], [ 1, 7 ], [ 2, 6 ], [ 2, 5 ], [ 3, 4 ], [ 3, 8 ], [ 5, 1 ], [ 8, 2 ], [ 8, 9 ], [ 10, 13 ], [ 11, 17 ], [ 12, 16 ], [ 12, 15 ], [ 13, 14 ], [ 13, 18 ], [ 15, 11 ], [ 18, 12 ], [ 18, 19 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Eugene knows Raquel. Alyssa knows Anton. Jewel knows Aurora. Anton knows Geoffrey. Rebecca knows Alyssa. Geoffrey knows Saul. Aurora knows Vernon. Stuart knows Jewel. Caroline knows Charles. Brody knows Sally. Sally knows Stuart. Raquel knows Daniel. Sally knows Emanuel. Raquel knows Belinda. Vernon knows Caroline. Aurora knows Lisa. Alyssa knows Clay. Daniel knows Rebecca. Which of Caroline and Geoffrey can Eugene reach?", "answer": "Geoffrey", "steps": [ "Eugene knows Raquel.", "Raquel knows Daniel.", "Daniel knows Rebecca.", "Rebecca knows Alyssa.", "Alyssa knows Anton.", "Anton knows Geoffrey." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Eugene", "Belinda", "Geoffrey", "Alyssa", "Daniel", "Saul", "Anton", "Raquel", "Rebecca", "Clay", "Brody", "Emanuel", "Caroline", "Aurora", "Stuart", "Charles", "Vernon", "Sally", "Jewel", "Lisa" ], "edges": [ [ 0, 7 ], [ 2, 5 ], [ 3, 6 ], [ 3, 9 ], [ 4, 8 ], [ 6, 2 ], [ 7, 1 ], [ 7, 4 ], [ 8, 3 ], [ 10, 17 ], [ 12, 15 ], [ 13, 16 ], [ 13, 19 ], [ 14, 18 ], [ 16, 12 ], [ 17, 11 ], [ 17, 14 ], [ 18, 13 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Leon knows Taylor. Ainsley knows Leon. Eamon knows Michelle. Leon knows Saul. Helene knows Aspen. Taylor knows Kelsey. Ainsley knows Alana. Kelsey knows Douglas. Lillian knows Maya. Celia knows Graham. Helene knows Martha. Taylor knows Larissa. Martha knows Susan. Maya knows Helene. Maya knows Jakob. Douglas knows Celia. Lillian knows Yvonne. Susan knows Eamon. Which of Kelsey and Martha can Lillian reach?", "answer": "Martha", "steps": [ "Lillian knows Maya.", "Maya knows Helene.", "Helene knows Martha." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Lillian", "Michelle", "Yvonne", "Aspen", "Jakob", "Helene", "Susan", "Martha", "Maya", "Eamon", "Ainsley", "Graham", "Alana", "Larissa", "Saul", "Taylor", "Douglas", "Kelsey", "Leon", "Celia" ], "edges": [ [ 0, 2 ], [ 0, 8 ], [ 5, 3 ], [ 5, 7 ], [ 6, 9 ], [ 7, 6 ], [ 8, 4 ], [ 8, 5 ], [ 9, 1 ], [ 10, 12 ], [ 10, 18 ], [ 15, 13 ], [ 15, 17 ], [ 16, 19 ], [ 17, 16 ], [ 18, 14 ], [ 18, 15 ], [ 19, 11 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Crystal knows Victor. Guillermo knows Luella. Bette knows Jewel. Renee knows Darcy. Val knows Guillermo. Darcy knows Perry. Martha knows Val. Rhonda knows Catherine. Luella knows Leah. Catherine knows Lucy. Catherine knows Autumn. Victor knows Alfonso. Lucy knows Martin. Martha knows Cruz. Martin knows Bette. Graeme knows Martha. Renee knows Graeme. Crystal knows Rhonda. Which of Guillermo and Martin can Crystal reach?", "answer": "Martin", "steps": [ "Crystal knows Rhonda.", "Rhonda knows Catherine.", "Catherine knows Lucy.", "Lucy knows Martin." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Crystal", "Rhonda", "Martin", "Bette", "Victor", "Lucy", "Jewel", "Catherine", "Autumn", "Alfonso", "Renee", "Graeme", "Guillermo", "Luella", "Darcy", "Val", "Leah", "Martha", "Cruz", "Perry" ], "edges": [ [ 0, 1 ], [ 0, 4 ], [ 1, 7 ], [ 2, 3 ], [ 3, 6 ], [ 4, 9 ], [ 5, 2 ], [ 7, 5 ], [ 7, 8 ], [ 10, 11 ], [ 10, 14 ], [ 11, 17 ], [ 12, 13 ], [ 13, 16 ], [ 14, 19 ], [ 15, 12 ], [ 17, 15 ], [ 17, 18 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Pearl knows Dante. Ellen knows Carey. Adele knows Conner. Tabitha knows Emily. Tiffany knows Oscar. Carey knows Julie. Franklin knows Edgar. Tiffany knows Conrad. Heather knows Tabitha. Adele knows Ron. Edgar knows Jasmine. Franklin knows Ellen. Emily knows Adele. Tiffany knows Naomi. Jasmine knows Tiffany. Adele knows Shannon. Heather knows Larry. Larry knows Pearl. Which of Adele and Tiffany can Heather reach?", "answer": "Adele", "steps": [ "Heather knows Tabitha.", "Tabitha knows Emily.", "Emily knows Adele." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Heather", "Larry", "Tabitha", "Shannon", "Conner", "Pearl", "Emily", "Dante", "Adele", "Ron", "Franklin", "Ellen", "Edgar", "Oscar", "Naomi", "Carey", "Jasmine", "Julie", "Tiffany", "Conrad" ], "edges": [ [ 0, 1 ], [ 0, 2 ], [ 1, 5 ], [ 2, 6 ], [ 5, 7 ], [ 6, 8 ], [ 8, 3 ], [ 8, 4 ], [ 8, 9 ], [ 10, 11 ], [ 10, 12 ], [ 11, 15 ], [ 12, 16 ], [ 15, 17 ], [ 16, 18 ], [ 18, 13 ], [ 18, 14 ], [ 18, 19 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Enrique knows Earle. Houston knows Nina. Winston knows Mae. Enrique knows Carter. Earle knows Jessie. Earle knows Houston. Maya knows Cesar. Earle knows Janice. Alfred knows Winston. Zach knows Alfred. Alfred knows Carlos. Max knows Arturo. Carlos knows Max. Jessie knows Jeffery. Janice knows Archer. Nina knows Olivia. Alfred knows Maya. Zach knows Rose. Which of Arturo and Olivia can Enrique reach?", "answer": "Olivia", "steps": [ "Enrique knows Earle.", "Earle knows Houston.", "Houston knows Nina.", "Nina knows Olivia." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Enrique", "Carter", "Houston", "Olivia", "Archer", "Earle", "Jeffery", "Nina", "Jessie", "Janice", "Zach", "Rose", "Carlos", "Arturo", "Mae", "Alfred", "Cesar", "Max", "Maya", "Winston" ], "edges": [ [ 0, 1 ], [ 0, 5 ], [ 2, 7 ], [ 5, 2 ], [ 5, 8 ], [ 5, 9 ], [ 7, 3 ], [ 8, 6 ], [ 9, 4 ], [ 10, 11 ], [ 10, 15 ], [ 12, 17 ], [ 15, 12 ], [ 15, 18 ], [ 15, 19 ], [ 17, 13 ], [ 18, 16 ], [ 19, 14 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Ramon knows Harmony. Jessie knows Ramon. Sierra knows Dell. Jessie knows Sierra. Grace knows Gladys. Jessie knows Alyson. Lamont knows Grace. Roland knows Phoebe. Craig knows Kay. Adelaide knows Michelle. Bert knows Lamont. Sierra knows Roland. Adelaide knows Greer. Dell knows Zach. Greer knows Shane. Phoebe knows Luna. Bert knows Craig. Adelaide knows Bert. Which of Gladys and Luna can Jessie reach?", "answer": "Luna", "steps": [ "Jessie knows Sierra.", "Sierra knows Roland.", "Roland knows Phoebe.", "Phoebe knows Luna." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Jessie", "Ramon", "Phoebe", "Zach", "Harmony", "Sierra", "Dell", "Luna", "Roland", "Alyson", "Adelaide", "Greer", "Grace", "Kay", "Shane", "Bert", "Craig", "Gladys", "Lamont", "Michelle" ], "edges": [ [ 0, 1 ], [ 0, 5 ], [ 0, 9 ], [ 1, 4 ], [ 2, 7 ], [ 5, 6 ], [ 5, 8 ], [ 6, 3 ], [ 8, 2 ], [ 10, 11 ], [ 10, 15 ], [ 10, 19 ], [ 11, 14 ], [ 12, 17 ], [ 15, 16 ], [ 15, 18 ], [ 16, 13 ], [ 18, 12 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Sierra knows Lucille. Lucille knows Troy. Iris knows Jackson. Jose knows Kit. Sierra knows Clyde. Eli knows Sierra. Iris knows Harriet. Ken knows Xavier. Ken knows Marlene. Jose knows Trevor. Chris knows Iris. Julian knows Jose. Julian knows Cesar. Felicia knows Julian. Lucille knows Amelia. Clay knows Ken. Ken knows Felicia. Iris knows Eli. Which of Sierra and Julian can Clay reach?", "answer": "Julian", "steps": [ "Clay knows Ken.", "Ken knows Felicia.", "Felicia knows Julian." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Clay", "Xavier", "Trevor", "Kit", "Marlene", "Jose", "Ken", "Julian", "Felicia", "Cesar", "Chris", "Harriet", "Troy", "Amelia", "Jackson", "Lucille", "Iris", "Sierra", "Eli", "Clyde" ], "edges": [ [ 0, 6 ], [ 5, 2 ], [ 5, 3 ], [ 6, 1 ], [ 6, 4 ], [ 6, 8 ], [ 7, 5 ], [ 7, 9 ], [ 8, 7 ], [ 10, 16 ], [ 15, 12 ], [ 15, 13 ], [ 16, 11 ], [ 16, 14 ], [ 16, 18 ], [ 17, 15 ], [ 17, 19 ], [ 18, 17 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Cecilia knows Angelica. Ainsley knows Monroe. Angelica knows Aisha. Ainsley knows Simon. Aisha knows India. Tamara knows Edwin. Darcy knows Verna. Angelica knows Vivian. Vivian knows Emmett. Simon knows Darcy. Aisha knows Clayton. Clayton knows Belinda. Jeremy knows Ainsley. Darcy knows Horace. Colleen knows Cecilia. Verna knows Nadine. Simon knows Tamara. Cecilia knows Elsa. Which of Ainsley and Cecilia can Jeremy reach?", "answer": "Ainsley", "steps": [ "Jeremy knows Ainsley." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Jeremy", "Verna", "Nadine", "Horace", "Darcy", "Monroe", "Ainsley", "Tamara", "Simon", "Edwin", "Colleen", "Clayton", "Belinda", "India", "Aisha", "Elsa", "Cecilia", "Vivian", "Angelica", "Emmett" ], "edges": [ [ 0, 6 ], [ 1, 2 ], [ 4, 1 ], [ 4, 3 ], [ 6, 5 ], [ 6, 8 ], [ 7, 9 ], [ 8, 4 ], [ 8, 7 ], [ 10, 16 ], [ 11, 12 ], [ 14, 11 ], [ 14, 13 ], [ 16, 15 ], [ 16, 18 ], [ 17, 19 ], [ 18, 14 ], [ 18, 17 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Virgil knows Chad. Lola knows Lena. Jared knows Ben. Virgil knows Finn. Maria knows Seth. Mildred knows Virgil. Dave knows Dora. Chad knows Chase. Deborah knows Justine. Lola knows Maria. Rocco knows Deborah. Serena knows Mildred. Justine knows Jared. Jared knows Lola. Jocelyn knows Dave. Mildred knows Merle. Dora knows Serena. Ashley knows Rocco. Which of Jared and Mildred can Ashley reach?", "answer": "Jared", "steps": [ "Ashley knows Rocco.", "Rocco knows Deborah.", "Deborah knows Justine.", "Justine knows Jared." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Ashley", "Lola", "Ben", "Seth", "Justine", "Deborah", "Rocco", "Lena", "Jared", "Maria", "Jocelyn", "Virgil", "Merle", "Chase", "Serena", "Dora", "Dave", "Finn", "Mildred", "Chad" ], "edges": [ [ 0, 6 ], [ 1, 7 ], [ 1, 9 ], [ 4, 8 ], [ 5, 4 ], [ 6, 5 ], [ 8, 2 ], [ 8, 1 ], [ 9, 3 ], [ 10, 16 ], [ 11, 17 ], [ 11, 19 ], [ 14, 18 ], [ 15, 14 ], [ 16, 15 ], [ 18, 12 ], [ 18, 11 ], [ 19, 13 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "June knows Hattie. Rita knows Daria. Jeanette knows Perry. Beverly knows Jeanette. Rita knows Langston. Alejandro knows Lyle. Susan knows June. Hattie knows Saul. Milo knows Hilda. Verna knows Luz. Alejandro knows Shelly. Lars knows Alejandro. Perry knows Rita. Hilda knows Beverly. Alejandro knows Verna. Emily knows Owen. Saul knows Lars. Rita knows Emily. Which of Saul and Jeanette can Susan reach?", "answer": "Saul", "steps": [ "Susan knows June.", "June knows Hattie.", "Hattie knows Saul." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Susan", "Hattie", "Luz", "Alejandro", "Lars", "Shelly", "Lyle", "Verna", "Saul", "June", "Milo", "Beverly", "Owen", "Rita", "Perry", "Daria", "Langston", "Emily", "Jeanette", "Hilda" ], "edges": [ [ 0, 9 ], [ 1, 8 ], [ 3, 5 ], [ 3, 6 ], [ 3, 7 ], [ 4, 3 ], [ 7, 2 ], [ 8, 4 ], [ 9, 1 ], [ 10, 19 ], [ 11, 18 ], [ 13, 15 ], [ 13, 16 ], [ 13, 17 ], [ 14, 13 ], [ 17, 12 ], [ 18, 14 ], [ 19, 11 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Virgil knows Chad. Lola knows Lena. Jared knows Ben. Virgil knows Finn. Maria knows Seth. Mildred knows Virgil. Dave knows Dora. Chad knows Chase. Deborah knows Justine. Lola knows Maria. Rocco knows Deborah. Serena knows Mildred. Justine knows Jared. Jared knows Lola. Jocelyn knows Dave. Mildred knows Merle. Dora knows Serena. Ashley knows Rocco. Which of Chad and Maria can Ashley reach?", "answer": "Maria", "steps": [ "Ashley knows Rocco.", "Rocco knows Deborah.", "Deborah knows Justine.", "Justine knows Jared.", "Jared knows Lola.", "Lola knows Maria." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Ashley", "Lola", "Ben", "Seth", "Justine", "Deborah", "Rocco", "Lena", "Jared", "Maria", "Jocelyn", "Virgil", "Merle", "Chase", "Serena", "Dora", "Dave", "Finn", "Mildred", "Chad" ], "edges": [ [ 0, 6 ], [ 1, 7 ], [ 1, 9 ], [ 4, 8 ], [ 5, 4 ], [ 6, 5 ], [ 8, 2 ], [ 8, 1 ], [ 9, 3 ], [ 10, 16 ], [ 11, 17 ], [ 11, 19 ], [ 14, 18 ], [ 15, 14 ], [ 16, 15 ], [ 18, 12 ], [ 18, 11 ], [ 19, 13 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Edna knows Kendrick. Edna knows Fabian. Austin knows Alice. Austin knows Daphne. Wallace knows Austin. Bert knows Edna. Jose knows Olive. Mack knows Bert. Delilah knows Martha. Alison knows Adam. Martha knows Kirk. Martha knows Dallas. Vicki knows Arden. Wallace knows Delilah. Dallas knows Jose. Kendrick knows Alison. Vicki knows Garrison. Mack knows Vicki. Which of Bert and Delilah can Wallace reach?", "answer": "Delilah", "steps": [ "Wallace knows Delilah." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Wallace", "Jose", "Olive", "Dallas", "Alice", "Austin", "Martha", "Delilah", "Kirk", "Daphne", "Mack", "Alison", "Adam", "Kendrick", "Garrison", "Vicki", "Edna", "Bert", "Fabian", "Arden" ], "edges": [ [ 0, 7 ], [ 0, 5 ], [ 1, 2 ], [ 3, 1 ], [ 5, 4 ], [ 5, 9 ], [ 6, 3 ], [ 6, 8 ], [ 7, 6 ], [ 10, 17 ], [ 10, 15 ], [ 11, 12 ], [ 13, 11 ], [ 15, 14 ], [ 15, 19 ], [ 16, 13 ], [ 16, 18 ], [ 17, 16 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Leander knows Harlan. Wilson knows Hal. Sally knows Flora. Flora knows Barbara. Chloe knows Janet. Atlas knows Vernon. Chloe knows Nina. Nina knows Dexter. Eva knows Leander. Wilson knows Sally. Wilson knows Vicki. Barbara knows Courtney. Dexter knows Clark. Clark knows Eva. Sally knows Giselle. Courtney knows Atlas. Nina knows Paige. Chloe knows Irving. Which of Courtney and Eva can Wilson reach?", "answer": "Courtney", "steps": [ "Wilson knows Sally.", "Sally knows Flora.", "Flora knows Barbara.", "Barbara knows Courtney." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Wilson", "Hal", "Sally", "Giselle", "Vernon", "Barbara", "Atlas", "Vicki", "Courtney", "Flora", "Chloe", "Irving", "Nina", "Paige", "Harlan", "Clark", "Leander", "Janet", "Eva", "Dexter" ], "edges": [ [ 0, 1 ], [ 0, 7 ], [ 0, 2 ], [ 2, 3 ], [ 2, 9 ], [ 5, 8 ], [ 6, 4 ], [ 8, 6 ], [ 9, 5 ], [ 10, 11 ], [ 10, 17 ], [ 10, 12 ], [ 12, 13 ], [ 12, 19 ], [ 15, 18 ], [ 16, 14 ], [ 18, 16 ], [ 19, 15 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Gerald knows Susan. Jolene knows Omar. Angela knows Cate. Jake knows Lloyd. Dorothy knows Angela. Drew knows Jake. Marc knows Harold. Zachary knows Jolene. Susan knows Peggy. Zachary knows Ramona. Francesca knows Heather. Jeanette knows Ernie. Cate knows Marc. Rachel knows Zachary. Rachel knows Gerald. Marc knows Jeanette. Heather knows Rachel. Cate knows Drew. Which of Angela and Heather can Francesca reach?", "answer": "Heather", "steps": [ "Francesca knows Heather." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Francesca", "Ramona", "Rachel", "Omar", "Gerald", "Peggy", "Susan", "Heather", "Jolene", "Zachary", "Dorothy", "Harold", "Cate", "Ernie", "Drew", "Lloyd", "Jake", "Angela", "Jeanette", "Marc" ], "edges": [ [ 0, 7 ], [ 2, 4 ], [ 2, 9 ], [ 4, 6 ], [ 6, 5 ], [ 7, 2 ], [ 8, 3 ], [ 9, 1 ], [ 9, 8 ], [ 10, 17 ], [ 12, 14 ], [ 12, 19 ], [ 14, 16 ], [ 16, 15 ], [ 17, 12 ], [ 18, 13 ], [ 19, 11 ], [ 19, 18 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Stacy knows Magdalena. Stanley knows Marcia. Arnold knows Farrah. Ernesto knows Cruz. Amelia knows Grant. Elise knows Stanley. Jared knows Elise. Carter knows Eldon. Stanley knows Lorenzo. Farrah knows India. Craig knows Tina. Craig knows Ernesto. Marcia knows Arnold. Tina knows Harley. Arnold knows Amelia. Stacy knows Uma. Magdalena knows Craig. Eldon knows Stacy. Which of Marcia and Magdalena can Jared reach?", "answer": "Marcia", "steps": [ "Jared knows Elise.", "Elise knows Stanley.", "Stanley knows Marcia." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Jared", "India", "Lorenzo", "Marcia", "Arnold", "Farrah", "Grant", "Stanley", "Amelia", "Elise", "Carter", "Cruz", "Uma", "Magdalena", "Craig", "Ernesto", "Harley", "Stacy", "Tina", "Eldon" ], "edges": [ [ 0, 9 ], [ 3, 4 ], [ 4, 5 ], [ 4, 8 ], [ 5, 1 ], [ 7, 2 ], [ 7, 3 ], [ 8, 6 ], [ 9, 7 ], [ 10, 19 ], [ 13, 14 ], [ 14, 15 ], [ 14, 18 ], [ 15, 11 ], [ 17, 12 ], [ 17, 13 ], [ 18, 16 ], [ 19, 17 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Laurel knows Zach. Zelda knows Clifford. Celia knows Atlas. Guy knows Celia. Russell knows Grady. Laurel knows Guy. Casey knows Keaton. Laurel knows Franklin. Dwight knows Tom. Keaton knows Daphna. Tom knows Russell. Imogen knows Jenny. Aaron knows Laurel. Daphna knows Aaron. Luna knows Imogen. Grady knows Zelda. Zelda knows Luna. Zelda knows Cornelius. Which of Zelda and Laurel can Dwight reach?", "answer": "Zelda", "steps": [ "Dwight knows Tom.", "Tom knows Russell.", "Russell knows Grady.", "Grady knows Zelda." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Dwight", "Grady", "Jenny", "Zelda", "Clifford", "Luna", "Russell", "Imogen", "Tom", "Cornelius", "Casey", "Aaron", "Atlas", "Laurel", "Zach", "Guy", "Daphna", "Celia", "Keaton", "Franklin" ], "edges": [ [ 0, 8 ], [ 1, 3 ], [ 3, 4 ], [ 3, 5 ], [ 3, 9 ], [ 5, 7 ], [ 6, 1 ], [ 7, 2 ], [ 8, 6 ], [ 10, 18 ], [ 11, 13 ], [ 13, 14 ], [ 13, 15 ], [ 13, 19 ], [ 15, 17 ], [ 16, 11 ], [ 17, 12 ], [ 18, 16 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Zara knows Donna. Preston knows Albert. Erica knows Claudia. Preston knows Leon. Darla knows Randall. Glenn knows Erica. Barbara knows Zara. Emma knows Jared. Earle knows Emma. Leon knows Glenn. Jared knows Rena. Randall knows Earle. Claudia knows Blaine. Randall knows Lana. Kieran knows Kirsten. Rena knows Kieran. Earle knows Adam. Zara knows Preston. Which of Zara and Randall can Barbara reach?", "answer": "Zara", "steps": [ "Barbara knows Zara." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Barbara", "Blaine", "Albert", "Claudia", "Erica", "Donna", "Leon", "Glenn", "Preston", "Zara", "Darla", "Kirsten", "Adam", "Kieran", "Rena", "Lana", "Emma", "Jared", "Earle", "Randall" ], "edges": [ [ 0, 9 ], [ 3, 1 ], [ 4, 3 ], [ 6, 7 ], [ 7, 4 ], [ 8, 2 ], [ 8, 6 ], [ 9, 5 ], [ 9, 8 ], [ 10, 19 ], [ 13, 11 ], [ 14, 13 ], [ 16, 17 ], [ 17, 14 ], [ 18, 12 ], [ 18, 16 ], [ 19, 15 ], [ 19, 18 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Jocelyn knows Gregory. Ron knows Leticia. Luella knows Foster. Irene knows Ron. Yara knows Bernadette. Viola knows Imogen. Jeff knows Norma. Ron knows Yasmin. Ron knows Luella. Gregory knows Yara. Tara knows Irene. Viola knows Jeff. Parsa knows Tara. Ford knows Parsa. Darrell knows Ford. Viola knows Phoebe. Gladys knows Jocelyn. Bernadette knows Viola. Which of Jocelyn and Ford can Gladys reach?", "answer": "Jocelyn", "steps": [ "Gladys knows Jocelyn." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Gladys", "Phoebe", "Imogen", "Norma", "Bernadette", "Viola", "Gregory", "Yara", "Jeff", "Jocelyn", "Darrell", "Leticia", "Yasmin", "Foster", "Irene", "Ron", "Parsa", "Tara", "Luella", "Ford" ], "edges": [ [ 0, 9 ], [ 4, 5 ], [ 5, 1 ], [ 5, 2 ], [ 5, 8 ], [ 6, 7 ], [ 7, 4 ], [ 8, 3 ], [ 9, 6 ], [ 10, 19 ], [ 14, 15 ], [ 15, 11 ], [ 15, 12 ], [ 15, 18 ], [ 16, 17 ], [ 17, 14 ], [ 18, 13 ], [ 19, 16 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Stacy knows Blair. Leland knows Homer. Blair knows Maggie. Arnold knows Eugene. Abigail knows Russ. Jon knows Grace. Stacy knows Gwen. Gwen knows Dee. Gwen knows Zoe. Leland knows India. Gwen knows Ariana. Dee knows Arnold. Russ knows Leland. Perry knows Barry. Lorna knows Stacy. Russ knows Perry. Gage knows Jon. Leland knows Gage. Which of Arnold and Jon can Abigail reach?", "answer": "Jon", "steps": [ "Abigail knows Russ.", "Russ knows Leland.", "Leland knows Gage.", "Gage knows Jon." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Abigail", "India", "Barry", "Homer", "Perry", "Leland", "Grace", "Gage", "Jon", "Russ", "Lorna", "Zoe", "Maggie", "Ariana", "Blair", "Gwen", "Eugene", "Dee", "Arnold", "Stacy" ], "edges": [ [ 0, 9 ], [ 4, 2 ], [ 5, 1 ], [ 5, 3 ], [ 5, 7 ], [ 7, 8 ], [ 8, 6 ], [ 9, 4 ], [ 9, 5 ], [ 10, 19 ], [ 14, 12 ], [ 15, 11 ], [ 15, 13 ], [ 15, 17 ], [ 17, 18 ], [ 18, 16 ], [ 19, 14 ], [ 19, 15 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Adam knows Jenna. Lucy knows Colby. Emanuel knows Dirk. Helene knows Emanuel. Jenna knows Lucy. Arturo knows Chloe. Beverly knows Alana. Simon knows Constance. Simon knows Aubrey. Rowan knows Lydia. Alana knows Kendra. Franklin knows Helene. Franklin knows Alejandro. Lucy knows Simon. Constance knows Beverly. Dirk knows Robert. Arturo knows Franklin. Lydia knows Arturo. Which of Jenna and Lydia can Rowan reach?", "answer": "Lydia", "steps": [ "Rowan knows Lydia." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Rowan", "Chloe", "Franklin", "Arturo", "Dirk", "Emanuel", "Helene", "Lydia", "Alejandro", "Robert", "Adam", "Colby", "Simon", "Lucy", "Alana", "Beverly", "Constance", "Jenna", "Aubrey", "Kendra" ], "edges": [ [ 0, 7 ], [ 2, 8 ], [ 2, 6 ], [ 3, 1 ], [ 3, 2 ], [ 4, 9 ], [ 5, 4 ], [ 6, 5 ], [ 7, 3 ], [ 10, 17 ], [ 12, 18 ], [ 12, 16 ], [ 13, 11 ], [ 13, 12 ], [ 14, 19 ], [ 15, 14 ], [ 16, 15 ], [ 17, 13 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Roger knows Lambert. Trevor knows Louis. Henry knows Virginia. Spencer knows Trevor. Louis knows Henry. Henrietta knows Spencer. Lambert knows Enid. Hope knows Heath. Pearl knows Edwin. Edwin knows Callum. Jakob knows Guy. Carla knows Chester. Lambert knows Carla. Chester knows Hope. Hope knows Pearl. Jakob knows Henrietta. Trevor knows Vera. Cindy knows Jakob. Which of Louis and Pearl can Roger reach?", "answer": "Pearl", "steps": [ "Roger knows Lambert.", "Lambert knows Carla.", "Carla knows Chester.", "Chester knows Hope.", "Hope knows Pearl." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Roger", "Heath", "Hope", "Enid", "Pearl", "Chester", "Lambert", "Callum", "Carla", "Edwin", "Cindy", "Vera", "Trevor", "Guy", "Louis", "Spencer", "Jakob", "Virginia", "Henrietta", "Henry" ], "edges": [ [ 0, 6 ], [ 2, 1 ], [ 2, 4 ], [ 4, 9 ], [ 5, 2 ], [ 6, 3 ], [ 6, 8 ], [ 8, 5 ], [ 9, 7 ], [ 10, 16 ], [ 12, 11 ], [ 12, 14 ], [ 14, 19 ], [ 15, 12 ], [ 16, 13 ], [ 16, 18 ], [ 18, 15 ], [ 19, 17 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Vicki knows Miranda. Rowan knows Kay. Rowan knows Percy. Jameson knows Lamont. Rachel knows Lennox. Miranda knows Rowan. Lennox knows Fanny. Lennox knows Garrett. Lennox knows Peggy. Rowan knows Ford. Garrett knows Kenneth. Ford knows Margaret. Merle knows Hayley. Autumn knows Rachel. Kenneth knows Jameson. Jameson knows Griffith. Margaret knows Merle. Merle knows Marvin. Which of Lennox and Rowan can Vicki reach?", "answer": "Rowan", "steps": [ "Vicki knows Miranda.", "Miranda knows Rowan." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Vicki", "Miranda", "Ford", "Hayley", "Marvin", "Percy", "Rowan", "Kay", "Margaret", "Merle", "Autumn", "Rachel", "Garrett", "Lamont", "Griffith", "Fanny", "Lennox", "Peggy", "Kenneth", "Jameson" ], "edges": [ [ 0, 1 ], [ 1, 6 ], [ 2, 8 ], [ 6, 5 ], [ 6, 7 ], [ 6, 2 ], [ 8, 9 ], [ 9, 3 ], [ 9, 4 ], [ 10, 11 ], [ 11, 16 ], [ 12, 18 ], [ 16, 15 ], [ 16, 17 ], [ 16, 12 ], [ 18, 19 ], [ 19, 13 ], [ 19, 14 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Sadie knows Brynn. Marco knows Eve. Haley knows Sadie. Stefan knows Dee. Valerie knows Bonnie. Morris knows Susanne. Bonnie knows Elvira. Amy knows Jodi. Cameron knows Amy. Cordelia knows Haley. Dee knows Eli. Sadie knows Deborah. Fergus knows Zachary. Amy knows Stefan. Marco knows Cameron. Deborah knows Morris. Zachary knows Marco. Morris knows Valerie. Which of Zachary and Haley can Cordelia reach?", "answer": "Haley", "steps": [ "Cordelia knows Haley." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Cordelia", "Elvira", "Brynn", "Susanne", "Sadie", "Valerie", "Morris", "Bonnie", "Haley", "Deborah", "Fergus", "Eli", "Eve", "Jodi", "Marco", "Stefan", "Amy", "Dee", "Zachary", "Cameron" ], "edges": [ [ 0, 8 ], [ 4, 2 ], [ 4, 9 ], [ 5, 7 ], [ 6, 3 ], [ 6, 5 ], [ 7, 1 ], [ 8, 4 ], [ 9, 6 ], [ 10, 18 ], [ 14, 12 ], [ 14, 19 ], [ 15, 17 ], [ 16, 13 ], [ 16, 15 ], [ 17, 11 ], [ 18, 14 ], [ 19, 16 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Magdalena knows Alice. Logan knows Dale. Willis knows Fletcher. Emery knows Farrah. Logan knows Emery. Karina knows Tonya. Estella knows Frida. Nell knows Magdalena. Magdalena knows Eileen. Willis knows Anastasia. Dale knows Constance. Karina knows Estella. Avery knows Willis. Eileen knows Hope. Tonya knows Yuki. Karina knows Avery. Logan knows Nell. Anastasia knows Neville. Which of Hope and Neville can Logan reach?", "answer": "Hope", "steps": [ "Logan knows Nell.", "Nell knows Magdalena.", "Magdalena knows Eileen.", "Eileen knows Hope." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Logan", "Nell", "Constance", "Emery", "Hope", "Magdalena", "Alice", "Farrah", "Dale", "Eileen", "Karina", "Avery", "Yuki", "Estella", "Neville", "Willis", "Fletcher", "Frida", "Tonya", "Anastasia" ], "edges": [ [ 0, 3 ], [ 0, 8 ], [ 0, 1 ], [ 1, 5 ], [ 3, 7 ], [ 5, 6 ], [ 5, 9 ], [ 8, 2 ], [ 9, 4 ], [ 10, 13 ], [ 10, 18 ], [ 10, 11 ], [ 11, 15 ], [ 13, 17 ], [ 15, 16 ], [ 15, 19 ], [ 18, 12 ], [ 19, 14 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Matthew knows Irene. Eamon knows Emily. Matthew knows Blake. Emily knows Matthew. Blake knows Elliot. Emily knows Phoebe. Joseph knows Melody. Jim knows Cole. Boris knows Jim. Joseph knows Geoffrey. Joseph knows Lisa. Lisa knows Frida. Melody knows Hamilton. Frances knows Dolores. Matthew knows Frances. Jim knows Joseph. Emily knows Laurel. Jim knows Harriet. Which of Joseph and Matthew can Eamon reach?", "answer": "Matthew", "steps": [ "Eamon knows Emily.", "Emily knows Matthew." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Eamon", "Blake", "Phoebe", "Laurel", "Dolores", "Emily", "Frances", "Elliot", "Matthew", "Irene", "Boris", "Lisa", "Cole", "Harriet", "Hamilton", "Jim", "Melody", "Frida", "Joseph", "Geoffrey" ], "edges": [ [ 0, 5 ], [ 1, 7 ], [ 5, 2 ], [ 5, 3 ], [ 5, 8 ], [ 6, 4 ], [ 8, 6 ], [ 8, 1 ], [ 8, 9 ], [ 10, 15 ], [ 11, 17 ], [ 15, 12 ], [ 15, 13 ], [ 15, 18 ], [ 16, 14 ], [ 18, 16 ], [ 18, 11 ], [ 18, 19 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Helene knows Glenn. Trina knows Noah. Stuart knows Trina. Kit knows Jake. Martin knows Carlos. Stuart knows Pete. Trina knows Kit. Jake knows Chloe. Doug knows Brooke. Dayton knows William. Chloe knows Jose. Martin knows Iris. Martin knows Kay. Kay knows Taylor. Kendrick knows Helene. Trina knows Dayton. Carlos knows Kendrick. Doug knows Martin. Which of Jose and Glenn can Doug reach?", "answer": "Glenn", "steps": [ "Doug knows Martin.", "Martin knows Carlos.", "Carlos knows Kendrick.", "Kendrick knows Helene.", "Helene knows Glenn." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Doug", "Kay", "Martin", "Glenn", "Carlos", "Helene", "Brooke", "Iris", "Kendrick", "Taylor", "Stuart", "Dayton", "Trina", "Jose", "Kit", "Chloe", "Pete", "Noah", "Jake", "William" ], "edges": [ [ 0, 6 ], [ 0, 2 ], [ 1, 9 ], [ 2, 7 ], [ 2, 4 ], [ 2, 1 ], [ 4, 8 ], [ 5, 3 ], [ 8, 5 ], [ 10, 16 ], [ 10, 12 ], [ 11, 19 ], [ 12, 17 ], [ 12, 14 ], [ 12, 11 ], [ 14, 18 ], [ 15, 13 ], [ 18, 15 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Sheila knows Irma. Trina knows Erica. Richard knows Isla. Trina knows Diane. Jacqueline knows Nash. Jacqueline knows Will. Erica knows Fergus. Fergus knows Preston. Emma knows Bonnie. Fergus knows Clarissa. Jacqueline knows Wanda. Erica knows Sheila. Wanda knows Kaleb. Richard knows Emma. Wanda knows Richard. Trina knows Marian. Kaleb knows Terry. Clarissa knows Hugo. Which of Richard and Fergus can Trina reach?", "answer": "Fergus", "steps": [ "Trina knows Erica.", "Erica knows Fergus." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Trina", "Preston", "Sheila", "Marian", "Clarissa", "Diane", "Irma", "Hugo", "Erica", "Fergus", "Jacqueline", "Isla", "Kaleb", "Will", "Emma", "Nash", "Terry", "Bonnie", "Wanda", "Richard" ], "edges": [ [ 0, 3 ], [ 0, 5 ], [ 0, 8 ], [ 2, 6 ], [ 4, 7 ], [ 8, 2 ], [ 8, 9 ], [ 9, 1 ], [ 9, 4 ], [ 10, 13 ], [ 10, 15 ], [ 10, 18 ], [ 12, 16 ], [ 14, 17 ], [ 18, 12 ], [ 18, 19 ], [ 19, 11 ], [ 19, 14 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Stacy knows Magdalena. Stanley knows Marcia. Arnold knows Farrah. Ernesto knows Cruz. Amelia knows Grant. Elise knows Stanley. Jared knows Elise. Carter knows Eldon. Stanley knows Lorenzo. Farrah knows India. Craig knows Tina. Craig knows Ernesto. Marcia knows Arnold. Tina knows Harley. Arnold knows Amelia. Stacy knows Uma. Magdalena knows Craig. Eldon knows Stacy. Which of Harley and Grant can Jared reach?", "answer": "Grant", "steps": [ "Jared knows Elise.", "Elise knows Stanley.", "Stanley knows Marcia.", "Marcia knows Arnold.", "Arnold knows Amelia.", "Amelia knows Grant." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Jared", "India", "Lorenzo", "Marcia", "Arnold", "Farrah", "Grant", "Stanley", "Amelia", "Elise", "Carter", "Cruz", "Uma", "Magdalena", "Craig", "Ernesto", "Harley", "Stacy", "Tina", "Eldon" ], "edges": [ [ 0, 9 ], [ 3, 4 ], [ 4, 5 ], [ 4, 8 ], [ 5, 1 ], [ 7, 2 ], [ 7, 3 ], [ 8, 6 ], [ 9, 7 ], [ 10, 19 ], [ 13, 14 ], [ 14, 15 ], [ 14, 18 ], [ 15, 11 ], [ 17, 12 ], [ 17, 13 ], [ 18, 16 ], [ 19, 17 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Eamon knows Nancy. Keaton knows Mason. Floyd knows Laurel. Eamon knows Carlos. Carlos knows Eve. Frankie knows Dale. Arthur knows Keaton. Floyd knows Joan. Joan knows Edgar. Nancy knows Bart. Keaton knows Floyd. Lilia knows Kendrick. Rocco knows Lilia. Laurel knows Kurt. Carlos knows Rocco. Rocco knows Jessie. Jessie knows Hannah. Arthur knows Frankie. Which of Rocco and Floyd can Eamon reach?", "answer": "Rocco", "steps": [ "Eamon knows Carlos.", "Carlos knows Rocco." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Eamon", "Carlos", "Hannah", "Eve", "Rocco", "Nancy", "Jessie", "Lilia", "Bart", "Kendrick", "Arthur", "Keaton", "Kurt", "Mason", "Floyd", "Frankie", "Laurel", "Joan", "Dale", "Edgar" ], "edges": [ [ 0, 5 ], [ 0, 1 ], [ 1, 3 ], [ 1, 4 ], [ 4, 6 ], [ 4, 7 ], [ 5, 8 ], [ 6, 2 ], [ 7, 9 ], [ 10, 15 ], [ 10, 11 ], [ 11, 13 ], [ 11, 14 ], [ 14, 16 ], [ 14, 17 ], [ 15, 18 ], [ 16, 12 ], [ 17, 19 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Brynn knows Reid. Reid knows Chandler. Mindy knows Dell. Alyson knows Gonzalo. Dorian knows Alyson. Tracy knows Virgil. Margaret knows Brynn. Jim knows Dina. Hayes knows Dorian. Elena knows Julio. Dudley knows Diana. Diana knows Mindy. Virgil knows Margaret. Chandler knows Hayes. Simon knows Jim. Sean knows Simon. Julio knows Dudley. Dell knows Sean. Which of Dorian and Simon can Elena reach?", "answer": "Simon", "steps": [ "Elena knows Julio.", "Julio knows Dudley.", "Dudley knows Diana.", "Diana knows Mindy.", "Mindy knows Dell.", "Dell knows Sean.", "Sean knows Simon." ], "difficulty": 7, "original_distance": 9, "idx_to_symbol": [ "Elena", "Jim", "Simon", "Dudley", "Dina", "Dell", "Julio", "Diana", "Sean", "Mindy", "Tracy", "Alyson", "Dorian", "Margaret", "Gonzalo", "Chandler", "Virgil", "Brynn", "Hayes", "Reid" ], "edges": [ [ 0, 6 ], [ 1, 4 ], [ 2, 1 ], [ 3, 7 ], [ 5, 8 ], [ 6, 3 ], [ 7, 9 ], [ 8, 2 ], [ 9, 5 ], [ 10, 16 ], [ 11, 14 ], [ 12, 11 ], [ 13, 17 ], [ 15, 18 ], [ 16, 13 ], [ 17, 19 ], [ 18, 12 ], [ 19, 15 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Eugene knows Inez. Porter knows Philip. Carlton knows Chester. Chester knows Edna. Tristan knows Beverly. Dwight knows Tristan. Inez knows Carlton. Inez knows Elodie. Jackson knows Eugene. Philip knows Quinn. Beverly knows Colby. Chester knows Calvin. Beverly knows Porter. Joan knows Rosa. Lucia knows Aspen. Philip knows Dominic. Carlton knows Joan. Porter knows Lucia. Which of Carlton and Porter can Jackson reach?", "answer": "Carlton", "steps": [ "Jackson knows Eugene.", "Eugene knows Inez.", "Inez knows Carlton." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Jackson", "Calvin", "Elodie", "Edna", "Joan", "Eugene", "Rosa", "Inez", "Carlton", "Chester", "Dwight", "Dominic", "Colby", "Quinn", "Lucia", "Tristan", "Aspen", "Beverly", "Porter", "Philip" ], "edges": [ [ 0, 5 ], [ 4, 6 ], [ 5, 7 ], [ 7, 2 ], [ 7, 8 ], [ 8, 4 ], [ 8, 9 ], [ 9, 1 ], [ 9, 3 ], [ 10, 15 ], [ 14, 16 ], [ 15, 17 ], [ 17, 12 ], [ 17, 18 ], [ 18, 14 ], [ 18, 19 ], [ 19, 11 ], [ 19, 13 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Gerald knows Susan. Jolene knows Omar. Angela knows Cate. Jake knows Lloyd. Dorothy knows Angela. Drew knows Jake. Marc knows Harold. Zachary knows Jolene. Susan knows Peggy. Zachary knows Ramona. Francesca knows Heather. Jeanette knows Ernie. Cate knows Marc. Rachel knows Zachary. Rachel knows Gerald. Marc knows Jeanette. Heather knows Rachel. Cate knows Drew. Which of Peggy and Lloyd can Francesca reach?", "answer": "Peggy", "steps": [ "Francesca knows Heather.", "Heather knows Rachel.", "Rachel knows Gerald.", "Gerald knows Susan.", "Susan knows Peggy." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Francesca", "Ramona", "Rachel", "Omar", "Gerald", "Peggy", "Susan", "Heather", "Jolene", "Zachary", "Dorothy", "Harold", "Cate", "Ernie", "Drew", "Lloyd", "Jake", "Angela", "Jeanette", "Marc" ], "edges": [ [ 0, 7 ], [ 2, 4 ], [ 2, 9 ], [ 4, 6 ], [ 6, 5 ], [ 7, 2 ], [ 8, 3 ], [ 9, 1 ], [ 9, 8 ], [ 10, 17 ], [ 12, 14 ], [ 12, 19 ], [ 14, 16 ], [ 16, 15 ], [ 17, 12 ], [ 18, 13 ], [ 19, 11 ], [ 19, 18 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Alexa knows Knox. Randall knows Nolan. Blaine knows Barbara. Allen knows Terry. Felicia knows Blaine. Randall knows Alana. Felicia knows Jarvis. Lily knows Elliot. Lily knows Teresa. Elliot knows Margaret. Edna knows Lily. Lamar knows Felicia. Nolan knows Palmer. Allen knows Lawson. Lawson knows Alexa. Elliot knows Randall. Palmer knows Paul. Blaine knows Allen. Which of Randall and Allen can Lamar reach?", "answer": "Allen", "steps": [ "Lamar knows Felicia.", "Felicia knows Blaine.", "Blaine knows Allen." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Lamar", "Knox", "Alexa", "Blaine", "Felicia", "Terry", "Allen", "Lawson", "Jarvis", "Barbara", "Edna", "Paul", "Palmer", "Elliot", "Lily", "Alana", "Randall", "Nolan", "Teresa", "Margaret" ], "edges": [ [ 0, 4 ], [ 2, 1 ], [ 3, 6 ], [ 3, 9 ], [ 4, 8 ], [ 4, 3 ], [ 6, 5 ], [ 6, 7 ], [ 7, 2 ], [ 10, 14 ], [ 12, 11 ], [ 13, 16 ], [ 13, 19 ], [ 14, 18 ], [ 14, 13 ], [ 16, 15 ], [ 16, 17 ], [ 17, 12 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Magdalena knows Duncan. Paul knows Claire. Anton knows Frankie. Darla knows Chantal. Conrad knows Dana. Tony knows Leo. Drake knows Anton. Magdalena knows Logan. Chantal knows Jacques. Joshua knows Kara. Nicholas knows Paul. Duncan knows Joshua. Dana knows Darla. Leo knows Drake. Nicholas knows Charlene. Kara knows Conrad. Shelly knows Tony. Claire knows Shelly. Which of Shelly and Kara can Nicholas reach?", "answer": "Shelly", "steps": [ "Nicholas knows Paul.", "Paul knows Claire.", "Claire knows Shelly." ], "difficulty": 3, "original_distance": 8, "idx_to_symbol": [ "Nicholas", "Leo", "Charlene", "Frankie", "Paul", "Shelly", "Tony", "Claire", "Drake", "Anton", "Magdalena", "Dana", "Logan", "Jacques", "Duncan", "Kara", "Conrad", "Joshua", "Darla", "Chantal" ], "edges": [ [ 0, 2 ], [ 0, 4 ], [ 1, 8 ], [ 4, 7 ], [ 5, 6 ], [ 6, 1 ], [ 7, 5 ], [ 8, 9 ], [ 9, 3 ], [ 10, 12 ], [ 10, 14 ], [ 11, 18 ], [ 14, 17 ], [ 15, 16 ], [ 16, 11 ], [ 17, 15 ], [ 18, 19 ], [ 19, 13 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Khashayar knows Luis. Anton knows Bob. Darwin knows Anton. Luis knows Valerie. Elsa knows Lacey. Warren knows Desmond. Claudia knows Khashayar. Judith knows Claudia. Luis knows Ruby. Jack knows Elsa. Desmond knows Darwin. Lacey knows Dahlia. Ibrahim knows Asher. Darwin knows Jack. Lacey knows Gertrude. Asher knows Judith. Judith knows Aubrey. Aubrey knows Kate. Which of Desmond and Asher can Warren reach?", "answer": "Desmond", "steps": [ "Warren knows Desmond." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Warren", "Desmond", "Gertrude", "Elsa", "Anton", "Lacey", "Darwin", "Dahlia", "Bob", "Jack", "Ibrahim", "Asher", "Valerie", "Khashayar", "Aubrey", "Luis", "Judith", "Ruby", "Kate", "Claudia" ], "edges": [ [ 0, 1 ], [ 1, 6 ], [ 3, 5 ], [ 4, 8 ], [ 5, 2 ], [ 5, 7 ], [ 6, 4 ], [ 6, 9 ], [ 9, 3 ], [ 10, 11 ], [ 11, 16 ], [ 13, 15 ], [ 14, 18 ], [ 15, 12 ], [ 15, 17 ], [ 16, 14 ], [ 16, 19 ], [ 19, 13 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Antonio knows Margaret. Dirk knows Mitchell. Margaret knows Sonia. Lucia knows Constance. Isaac knows Emmett. Magdalena knows Isaac. Glenn knows Essie. Serena knows Glenn. Khashayar knows Riley. Sonia knows Khashayar. Constance knows Jasmine. Lucia knows Dirk. Emmett knows Bailey. Tyler knows Javier. Mitchell knows Brent. Tyler knows Serena. Jasmine knows Magdalena. Javier knows Antonio. Which of Sonia and Isaac can Lucia reach?", "answer": "Isaac", "steps": [ "Lucia knows Constance.", "Constance knows Jasmine.", "Jasmine knows Magdalena.", "Magdalena knows Isaac." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Lucia", "Dirk", "Brent", "Bailey", "Magdalena", "Mitchell", "Jasmine", "Isaac", "Constance", "Emmett", "Tyler", "Serena", "Essie", "Riley", "Margaret", "Glenn", "Antonio", "Sonia", "Javier", "Khashayar" ], "edges": [ [ 0, 1 ], [ 0, 8 ], [ 1, 5 ], [ 4, 7 ], [ 5, 2 ], [ 6, 4 ], [ 7, 9 ], [ 8, 6 ], [ 9, 3 ], [ 10, 11 ], [ 10, 18 ], [ 11, 15 ], [ 14, 17 ], [ 15, 12 ], [ 16, 14 ], [ 17, 19 ], [ 18, 16 ], [ 19, 13 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Dolores knows Lois. Dolores knows Finn. Stella knows Leon. Leon knows Holden. Nash knows Stella. Chantal knows Glen. Ramona knows Fraser. Iris knows Angela. Sydney knows Horace. Horace knows Cora. Finn knows Mara. Finn knows Charlene. Angela knows Fergus. Chantal knows Denver. Denver knows Iris. Lois knows Ramona. Nash knows Chantal. Charlene knows Sydney. Which of Chantal and Finn can Dolores reach?", "answer": "Finn", "steps": [ "Dolores knows Finn." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Dolores", "Fraser", "Finn", "Charlene", "Mara", "Cora", "Sydney", "Lois", "Ramona", "Horace", "Nash", "Holden", "Chantal", "Denver", "Glen", "Fergus", "Iris", "Stella", "Leon", "Angela" ], "edges": [ [ 0, 7 ], [ 0, 2 ], [ 2, 4 ], [ 2, 3 ], [ 3, 6 ], [ 6, 9 ], [ 7, 8 ], [ 8, 1 ], [ 9, 5 ], [ 10, 17 ], [ 10, 12 ], [ 12, 14 ], [ 12, 13 ], [ 13, 16 ], [ 16, 19 ], [ 17, 18 ], [ 18, 11 ], [ 19, 15 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Lyric knows Cate. Josie knows Greer. Lillian knows Lyric. Lillian knows Josie. Erica knows Herman. Dustin knows Kendra. Jamie knows Laura. Hazel knows Estella. Dustin knows Lewis. Lewis knows Erica. Hazel knows Penny. Erica knows Hazel. Josie knows Mary. Greer knows Cliff. Estella knows Jana. Herman knows Lorraine. Jamie knows Melody. Melody knows Lillian. Which of Jana and Cliff can Dustin reach?", "answer": "Jana", "steps": [ "Dustin knows Lewis.", "Lewis knows Erica.", "Erica knows Hazel.", "Hazel knows Estella.", "Estella knows Jana." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Dustin", "Lewis", "Hazel", "Penny", "Kendra", "Herman", "Erica", "Jana", "Lorraine", "Estella", "Jamie", "Melody", "Josie", "Mary", "Laura", "Lyric", "Lillian", "Cliff", "Cate", "Greer" ], "edges": [ [ 0, 4 ], [ 0, 1 ], [ 1, 6 ], [ 2, 3 ], [ 2, 9 ], [ 5, 8 ], [ 6, 5 ], [ 6, 2 ], [ 9, 7 ], [ 10, 14 ], [ 10, 11 ], [ 11, 16 ], [ 12, 13 ], [ 12, 19 ], [ 15, 18 ], [ 16, 15 ], [ 16, 12 ], [ 19, 17 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "John knows Clyde. Julian knows Luella. Lawrence knows Julian. Mara knows Alana. Daphna knows Dudley. John knows Dustin. Leonard knows Walt. Clyde knows Dave. Luella knows Elise. Walt knows Kerry. John knows Gustavo. Fleur knows Erma. Leonard knows Mara. Luella knows Daphna. Fleur knows Lawrence. Fleur knows Nash. Dave knows Leonard. Elise knows Aldo. Which of Mara and Daphna can John reach?", "answer": "Mara", "steps": [ "John knows Clyde.", "Clyde knows Dave.", "Dave knows Leonard.", "Leonard knows Mara." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "John", "Alana", "Gustavo", "Leonard", "Walt", "Mara", "Clyde", "Dustin", "Kerry", "Dave", "Fleur", "Dudley", "Erma", "Luella", "Elise", "Daphna", "Lawrence", "Nash", "Aldo", "Julian" ], "edges": [ [ 0, 2 ], [ 0, 7 ], [ 0, 6 ], [ 3, 5 ], [ 3, 4 ], [ 4, 8 ], [ 5, 1 ], [ 6, 9 ], [ 9, 3 ], [ 10, 12 ], [ 10, 17 ], [ 10, 16 ], [ 13, 15 ], [ 13, 14 ], [ 14, 18 ], [ 15, 11 ], [ 16, 19 ], [ 19, 13 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Bennett knows Carla. Violet knows Albert. Violet knows Nicole. Henry knows Kareem. Adele knows Walter. Beatrice knows Hayley. Kareem knows Bernard. Albert knows Terrence. Bruno knows Hubert. Ronald knows Jeremy. Henry knows Tamara. Bruno knows Ronald. Doris knows Erma. Nicole knows Bennett. Hayley knows Adele. Bernard knows Beatrice. Beatrice knows Doris. Jeremy knows Violet. Which of Jeremy and Bernard can Bruno reach?", "answer": "Jeremy", "steps": [ "Bruno knows Ronald.", "Ronald knows Jeremy." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Bruno", "Ronald", "Jeremy", "Violet", "Bennett", "Terrence", "Carla", "Hubert", "Nicole", "Albert", "Henry", "Kareem", "Bernard", "Beatrice", "Adele", "Erma", "Walter", "Tamara", "Hayley", "Doris" ], "edges": [ [ 0, 7 ], [ 0, 1 ], [ 1, 2 ], [ 2, 3 ], [ 3, 8 ], [ 3, 9 ], [ 4, 6 ], [ 8, 4 ], [ 9, 5 ], [ 10, 17 ], [ 10, 11 ], [ 11, 12 ], [ 12, 13 ], [ 13, 18 ], [ 13, 19 ], [ 14, 16 ], [ 18, 14 ], [ 19, 15 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Avery knows Charlotte. Gail knows Hayley. Gail knows Lucia. Avery knows Gail. Charlotte knows Nina. Hayley knows Hunter. Hunter knows Glen. Luke knows Jameson. Darius knows Dennis. Marcia knows Samuel. Marcia knows Darius. Marcia knows Brooks. Keaton knows Luke. Avery knows Ron. Brooks knows Keaton. Brooks knows Riley. Nina knows Dustin. Dennis knows Isadora. Which of Hunter and Luke can Marcia reach?", "answer": "Luke", "steps": [ "Marcia knows Brooks.", "Brooks knows Keaton.", "Keaton knows Luke." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Marcia", "Isadora", "Dennis", "Keaton", "Luke", "Darius", "Samuel", "Jameson", "Brooks", "Riley", "Avery", "Dustin", "Nina", "Hayley", "Hunter", "Charlotte", "Ron", "Glen", "Gail", "Lucia" ], "edges": [ [ 0, 5 ], [ 0, 6 ], [ 0, 8 ], [ 2, 1 ], [ 3, 4 ], [ 4, 7 ], [ 5, 2 ], [ 8, 3 ], [ 8, 9 ], [ 10, 15 ], [ 10, 16 ], [ 10, 18 ], [ 12, 11 ], [ 13, 14 ], [ 14, 17 ], [ 15, 12 ], [ 18, 13 ], [ 18, 19 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "April knows Diane. Damian knows Xavier. Fergus knows April. Clyde knows Pauline. Andrea knows Desmond. Coral knows Damian. Desmond knows Fergus. Andrea knows Graham. Diane knows Tracy. Damian knows Miriam. Diane knows Blair. Elodie knows Sally. Xavier knows Elodie. Justine knows Andrea. Fergus knows Faith. Pauline knows Coral. Elodie knows Monica. Pauline knows Declan. Which of Fergus and Damian can Justine reach?", "answer": "Fergus", "steps": [ "Justine knows Andrea.", "Andrea knows Desmond.", "Desmond knows Fergus." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Justine", "Blair", "Andrea", "April", "Desmond", "Faith", "Tracy", "Graham", "Diane", "Fergus", "Clyde", "Monica", "Pauline", "Xavier", "Coral", "Miriam", "Sally", "Declan", "Elodie", "Damian" ], "edges": [ [ 0, 2 ], [ 2, 7 ], [ 2, 4 ], [ 3, 8 ], [ 4, 9 ], [ 8, 1 ], [ 8, 6 ], [ 9, 5 ], [ 9, 3 ], [ 10, 12 ], [ 12, 17 ], [ 12, 14 ], [ 13, 18 ], [ 14, 19 ], [ 18, 11 ], [ 18, 16 ], [ 19, 15 ], [ 19, 13 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Willard knows Arturo. Marcus knows Ariana. Conrad knows Isadora. Dee knows Conrad. Dee knows Edna. Miranda knows Raymond. Darwin knows Marcus. Kobe knows Jeremiah. Mildred knows Angela. Raymond knows Willard. Ruth knows Spencer. Lacey knows Mildred. Jeremiah knows Dee. Esther knows Darwin. Angela knows Geneva. Marcus knows Ruth. Esther knows Miranda. Kobe knows Lacey. Which of Ruth and Conrad can Esther reach?", "answer": "Ruth", "steps": [ "Esther knows Darwin.", "Darwin knows Marcus.", "Marcus knows Ruth." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Esther", "Raymond", "Ariana", "Miranda", "Arturo", "Willard", "Spencer", "Ruth", "Darwin", "Marcus", "Kobe", "Mildred", "Edna", "Lacey", "Geneva", "Angela", "Isadora", "Conrad", "Jeremiah", "Dee" ], "edges": [ [ 0, 3 ], [ 0, 8 ], [ 1, 5 ], [ 3, 1 ], [ 5, 4 ], [ 7, 6 ], [ 8, 9 ], [ 9, 2 ], [ 9, 7 ], [ 10, 13 ], [ 10, 18 ], [ 11, 15 ], [ 13, 11 ], [ 15, 14 ], [ 17, 16 ], [ 18, 19 ], [ 19, 12 ], [ 19, 17 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Dalton knows Joel. Joanna knows Livia. Clay knows Myra. Yuki knows Penny. Joanna knows Yuki. Yuki knows Harvey. Celia knows Isadora. Lorenzo knows Dalton. Dalton knows Ava. Ava knows Celia. Harvey knows Eldon. Myra knows Lorenzo. Judy knows Abel. Ava knows Sandra. Celia knows Khashayar. Louis knows Joanna. Harvey knows Edison. Abel knows Louis. Which of Louis and Lorenzo can Judy reach?", "answer": "Louis", "steps": [ "Judy knows Abel.", "Abel knows Louis." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Judy", "Harvey", "Joanna", "Louis", "Edison", "Livia", "Eldon", "Yuki", "Abel", "Penny", "Clay", "Celia", "Dalton", "Lorenzo", "Isadora", "Joel", "Khashayar", "Ava", "Myra", "Sandra" ], "edges": [ [ 0, 8 ], [ 1, 4 ], [ 1, 6 ], [ 2, 5 ], [ 2, 7 ], [ 3, 2 ], [ 7, 1 ], [ 7, 9 ], [ 8, 3 ], [ 10, 18 ], [ 11, 14 ], [ 11, 16 ], [ 12, 15 ], [ 12, 17 ], [ 13, 12 ], [ 17, 11 ], [ 17, 19 ], [ 18, 13 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Gage knows Zara. Virgil knows Billy. Trudy knows Rebecca. Shannon knows Kimberly. Zara knows Lois. Chandler knows Kirk. Jessie knows Lydia. Jessie knows Doris. Shannon knows Chandler. Doris knows Tristan. Ruth knows Arthur. Ruth knows Ingrid. Shannon knows Trudy. Jessie knows Ruth. Billy knows Atlas. Trudy knows Virgil. Ingrid knows Gage. Atlas knows Judith. Which of Ruth and Trudy can Jessie reach?", "answer": "Ruth", "steps": [ "Jessie knows Ruth." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Jessie", "Lydia", "Zara", "Doris", "Gage", "Arthur", "Ingrid", "Ruth", "Tristan", "Lois", "Shannon", "Kimberly", "Atlas", "Chandler", "Billy", "Rebecca", "Virgil", "Trudy", "Kirk", "Judith" ], "edges": [ [ 0, 1 ], [ 0, 3 ], [ 0, 7 ], [ 2, 9 ], [ 3, 8 ], [ 4, 2 ], [ 6, 4 ], [ 7, 5 ], [ 7, 6 ], [ 10, 11 ], [ 10, 13 ], [ 10, 17 ], [ 12, 19 ], [ 13, 18 ], [ 14, 12 ], [ 16, 14 ], [ 17, 15 ], [ 17, 16 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Chase knows Wilson. Langston knows Alan. Langston knows Victor. Percy knows Marcia. Sadie knows Langston. Agnes knows Percy. Veronica knows Chance. Alan knows Chase. Hayley knows Deanna. Ember knows Freya. Hayley knows Veronica. Rufus knows Ember. Victor knows Agnes. Marcia knows Walt. Deanna knows Rufus. Chance knows Wallace. Henry knows Hayley. Freya knows Ethan. Which of Ember and Percy can Henry reach?", "answer": "Ember", "steps": [ "Henry knows Hayley.", "Hayley knows Deanna.", "Deanna knows Rufus.", "Rufus knows Ember." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Henry", "Rufus", "Freya", "Wallace", "Ethan", "Chance", "Hayley", "Deanna", "Ember", "Veronica", "Sadie", "Agnes", "Marcia", "Wilson", "Walt", "Chase", "Langston", "Victor", "Percy", "Alan" ], "edges": [ [ 0, 6 ], [ 1, 8 ], [ 2, 4 ], [ 5, 3 ], [ 6, 7 ], [ 6, 9 ], [ 7, 1 ], [ 8, 2 ], [ 9, 5 ], [ 10, 16 ], [ 11, 18 ], [ 12, 14 ], [ 15, 13 ], [ 16, 17 ], [ 16, 19 ], [ 17, 11 ], [ 18, 12 ], [ 19, 15 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Bryan knows Dennis. Peter knows Morgan. Bryan knows Susan. Fred knows Lawson. Peter knows Fred. Morgan knows Cecilia. Percy knows Thea. Nolan knows Willard. Estelle knows Peter. Willard knows Kurt. Percy knows Lamar. Lamar knows Bryan. Raquel knows Percy. Willard knows Estelle. Kurt knows Lennox. Thea knows Malik. Susan knows Claudia. Dennis knows Albert. Which of Peter and Bryan can Nolan reach?", "answer": "Peter", "steps": [ "Nolan knows Willard.", "Willard knows Estelle.", "Estelle knows Peter." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Nolan", "Peter", "Lennox", "Kurt", "Cecilia", "Estelle", "Fred", "Morgan", "Lawson", "Willard", "Raquel", "Bryan", "Malik", "Thea", "Albert", "Lamar", "Susan", "Dennis", "Claudia", "Percy" ], "edges": [ [ 0, 9 ], [ 1, 7 ], [ 1, 6 ], [ 3, 2 ], [ 5, 1 ], [ 6, 8 ], [ 7, 4 ], [ 9, 3 ], [ 9, 5 ], [ 10, 19 ], [ 11, 17 ], [ 11, 16 ], [ 13, 12 ], [ 15, 11 ], [ 16, 18 ], [ 17, 14 ], [ 19, 13 ], [ 19, 15 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Tanya knows Neal. Jessie knows Vance. Jackson knows Louisa. Kit knows Marian. Janet knows Jessie. Marian knows Harmony. Harvey knows Otto. Teresa knows Jackson. Jolena knows Tanya. Kit knows Janet. Kit knows Hal. Harmony knows Dustin. Hilda knows Kit. Otto knows Gail. Tanya knows Vera. Tanya knows Harvey. Dustin knows Mara. Vera knows Teresa. Which of Harmony and Teresa can Hilda reach?", "answer": "Harmony", "steps": [ "Hilda knows Kit.", "Kit knows Marian.", "Marian knows Harmony." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Hilda", "Kit", "Harmony", "Vance", "Dustin", "Marian", "Hal", "Janet", "Jessie", "Mara", "Jolena", "Tanya", "Teresa", "Gail", "Jackson", "Vera", "Neal", "Harvey", "Otto", "Louisa" ], "edges": [ [ 0, 1 ], [ 1, 6 ], [ 1, 7 ], [ 1, 5 ], [ 2, 4 ], [ 4, 9 ], [ 5, 2 ], [ 7, 8 ], [ 8, 3 ], [ 10, 11 ], [ 11, 16 ], [ 11, 17 ], [ 11, 15 ], [ 12, 14 ], [ 14, 19 ], [ 15, 12 ], [ 17, 18 ], [ 18, 13 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Hazel knows Robert. Ellen knows Martin. Lars knows Charles. Robert knows Hope. Esme knows Bernice. Charles knows Cesar. Heidi knows Ellen. Charles knows Tina. Douglas knows Alfred. Alfred knows Nell. Heidi knows Darcy. Alfred knows Lars. Tina knows Esme. Martin knows Barney. Ellen knows Ricardo. Barney knows Brett. Douglas knows Flora. Barney knows Hazel. Which of Martin and Lars can Douglas reach?", "answer": "Lars", "steps": [ "Douglas knows Alfred.", "Alfred knows Lars." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Douglas", "Tina", "Flora", "Lars", "Charles", "Alfred", "Cesar", "Nell", "Bernice", "Esme", "Heidi", "Hazel", "Darcy", "Martin", "Barney", "Ellen", "Brett", "Ricardo", "Hope", "Robert" ], "edges": [ [ 0, 2 ], [ 0, 5 ], [ 1, 9 ], [ 3, 4 ], [ 4, 6 ], [ 4, 1 ], [ 5, 7 ], [ 5, 3 ], [ 9, 8 ], [ 10, 12 ], [ 10, 15 ], [ 11, 19 ], [ 13, 14 ], [ 14, 16 ], [ 14, 11 ], [ 15, 17 ], [ 15, 13 ], [ 19, 18 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Belinda knows Langston. Isla knows Megan. Gemma knows Kingsley. Kate knows Graeme. Eugene knows Griffith. Kate knows Max. Graham knows Kate. Laura knows Devon. Griffith knows Belinda. Belinda knows Tina. Kate knows Celeste. Belinda knows Frank. Megan knows Dick. Gemma knows Isla. Julian knows Parker. Kingsley knows Graham. Parker knows Laura. Julian knows Eugene. Which of Belinda and Kate can Julian reach?", "answer": "Belinda", "steps": [ "Julian knows Eugene.", "Eugene knows Griffith.", "Griffith knows Belinda." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Julian", "Parker", "Laura", "Langston", "Devon", "Frank", "Belinda", "Griffith", "Tina", "Eugene", "Gemma", "Isla", "Megan", "Celeste", "Dick", "Graeme", "Kate", "Graham", "Max", "Kingsley" ], "edges": [ [ 0, 1 ], [ 0, 9 ], [ 1, 2 ], [ 2, 4 ], [ 6, 3 ], [ 6, 5 ], [ 6, 8 ], [ 7, 6 ], [ 9, 7 ], [ 10, 11 ], [ 10, 19 ], [ 11, 12 ], [ 12, 14 ], [ 16, 13 ], [ 16, 15 ], [ 16, 18 ], [ 17, 16 ], [ 19, 17 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Annie knows Eunice. Eunice knows Deborah. Bruno knows Glenn. Graeme knows Bruno. Deborah knows Cody. Patricia knows Jason. Chandler knows Abel. Lisette knows Ezra. Charlotte knows Graeme. Noah knows Garrett. Bruno knows Sue. Patricia knows June. Lisette knows Geoffrey. Jason knows Chandler. Annie knows Charlotte. Patricia knows Noah. Annie knows Elias. Garrett knows Lisette. Which of Glenn and Ezra can Annie reach?", "answer": "Glenn", "steps": [ "Annie knows Charlotte.", "Charlotte knows Graeme.", "Graeme knows Bruno.", "Bruno knows Glenn." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Annie", "Cody", "Charlotte", "Sue", "Deborah", "Bruno", "Glenn", "Eunice", "Elias", "Graeme", "Patricia", "Abel", "Noah", "Geoffrey", "Chandler", "Lisette", "Ezra", "Jason", "June", "Garrett" ], "edges": [ [ 0, 7 ], [ 0, 8 ], [ 0, 2 ], [ 2, 9 ], [ 4, 1 ], [ 5, 3 ], [ 5, 6 ], [ 7, 4 ], [ 9, 5 ], [ 10, 17 ], [ 10, 18 ], [ 10, 12 ], [ 12, 19 ], [ 14, 11 ], [ 15, 13 ], [ 15, 16 ], [ 17, 14 ], [ 19, 15 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Matt knows Christopher. Porter knows Clarence. Selena knows Conrad. Porter knows Amanda. Alyssa knows Julian. Earle knows Delilah. Daisy knows Linda. Delilah knows Hope. Isabel knows Nash. Alyssa knows Matt. Matt knows Selena. Julian knows Merle. Amanda knows Lawrence. Clarence knows Daisy. Christopher knows Earle. Isabel knows Porter. Nash knows Yolanda. Linda knows Mack. Which of Delilah and Linda can Isabel reach?", "answer": "Linda", "steps": [ "Isabel knows Porter.", "Porter knows Clarence.", "Clarence knows Daisy.", "Daisy knows Linda." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Isabel", "Lawrence", "Yolanda", "Porter", "Clarence", "Daisy", "Nash", "Linda", "Mack", "Amanda", "Alyssa", "Conrad", "Merle", "Matt", "Christopher", "Earle", "Julian", "Delilah", "Hope", "Selena" ], "edges": [ [ 0, 6 ], [ 0, 3 ], [ 3, 4 ], [ 3, 9 ], [ 4, 5 ], [ 5, 7 ], [ 6, 2 ], [ 7, 8 ], [ 9, 1 ], [ 10, 16 ], [ 10, 13 ], [ 13, 14 ], [ 13, 19 ], [ 14, 15 ], [ 15, 17 ], [ 16, 12 ], [ 17, 18 ], [ 19, 11 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Brooke knows Leonard. Mae knows Aurora. Alex knows Dick. Gavin knows Gus. Geoffrey knows John. Dick knows Desmond. Aurora knows Electra. Barry knows Gavin. Elvira knows Geoffrey. Lark knows Doug. Gus knows Brooke. Louise knows Janet. Brooke knows Elvira. Pauline knows Alex. Pauline knows Lark. Doug knows Fernando. Leonard knows Louise. Electra knows Pauline. Which of Geoffrey and Dick can Barry reach?", "answer": "Geoffrey", "steps": [ "Barry knows Gavin.", "Gavin knows Gus.", "Gus knows Brooke.", "Brooke knows Elvira.", "Elvira knows Geoffrey." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Barry", "Gus", "Gavin", "Leonard", "Elvira", "Janet", "Louise", "John", "Geoffrey", "Brooke", "Mae", "Electra", "Aurora", "Lark", "Alex", "Fernando", "Doug", "Desmond", "Dick", "Pauline" ], "edges": [ [ 0, 2 ], [ 1, 9 ], [ 2, 1 ], [ 3, 6 ], [ 4, 8 ], [ 6, 5 ], [ 8, 7 ], [ 9, 3 ], [ 9, 4 ], [ 10, 12 ], [ 11, 19 ], [ 12, 11 ], [ 13, 16 ], [ 14, 18 ], [ 16, 15 ], [ 18, 17 ], [ 19, 13 ], [ 19, 14 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Jeremy knows Samuel. Charles knows Dorian. Charles knows Fergus. Charles knows Jose. Jeremy knows Bernard. Charles knows Delilah. Deanna knows Charles. Jose knows Quinn. Charles knows Frida. Kirsten knows Isla. Justin knows Chester. Jeremy knows Adam. Delilah knows Kirsten. August knows Jeremy. Samuel knows Harvey. Jeremy knows Nolan. Nolan knows Justin. Jeremy knows William. Which of Isla and Chester can Deanna reach?", "answer": "Isla", "steps": [ "Deanna knows Charles.", "Charles knows Delilah.", "Delilah knows Kirsten.", "Kirsten knows Isla." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Deanna", "Charles", "Delilah", "Jose", "Frida", "Dorian", "Fergus", "Kirsten", "Quinn", "Isla", "August", "Jeremy", "Nolan", "Samuel", "Adam", "Bernard", "William", "Justin", "Harvey", "Chester" ], "edges": [ [ 0, 1 ], [ 1, 4 ], [ 1, 5 ], [ 1, 6 ], [ 1, 3 ], [ 1, 2 ], [ 2, 7 ], [ 3, 8 ], [ 7, 9 ], [ 10, 11 ], [ 11, 14 ], [ 11, 15 ], [ 11, 16 ], [ 11, 13 ], [ 11, 12 ], [ 12, 17 ], [ 13, 18 ], [ 17, 19 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Keith knows Russ. Vera knows Zelda. Malik knows Marc. Isadora knows Vera. Horace knows Kathleen. Jolene knows Tessa. Keith knows Leo. Leo knows Kieran. Zelda knows Jolene. Horace knows Brett. Keith knows Billy. Vera knows Emanuel. Vera knows Geoffrey. Brett knows Keith. Russ knows Malik. Finn knows Adrian. Geoffrey knows Palmer. Finn knows Isadora. Which of Tessa and Marc can Horace reach?", "answer": "Marc", "steps": [ "Horace knows Brett.", "Brett knows Keith.", "Keith knows Russ.", "Russ knows Malik.", "Malik knows Marc." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Horace", "Keith", "Marc", "Kieran", "Malik", "Kathleen", "Billy", "Leo", "Russ", "Brett", "Finn", "Vera", "Tessa", "Palmer", "Jolene", "Adrian", "Emanuel", "Geoffrey", "Zelda", "Isadora" ], "edges": [ [ 0, 5 ], [ 0, 9 ], [ 1, 6 ], [ 1, 7 ], [ 1, 8 ], [ 4, 2 ], [ 7, 3 ], [ 8, 4 ], [ 9, 1 ], [ 10, 15 ], [ 10, 19 ], [ 11, 16 ], [ 11, 17 ], [ 11, 18 ], [ 14, 12 ], [ 17, 13 ], [ 18, 14 ], [ 19, 11 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Maureen knows Hattie. Isadora knows Daphne. Daphne knows Jordan. Dalton knows Jennifer. Mara knows Isla. Isla knows Isadora. Maureen knows Dirk. Dirk knows Brooks. Jordan knows Otto. Kane knows Jay. Carla knows Penny. Jennifer knows Ford. Brody knows Lucille. Jay knows Eden. Jay knows Carla. Jordan knows Maureen. Ford knows Kane. Carla knows Brody. Which of Kane and Daphne can Mara reach?", "answer": "Daphne", "steps": [ "Mara knows Isla.", "Isla knows Isadora.", "Isadora knows Daphne." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Mara", "Brooks", "Daphne", "Hattie", "Isla", "Maureen", "Dirk", "Otto", "Isadora", "Jordan", "Dalton", "Lucille", "Kane", "Penny", "Jennifer", "Carla", "Brody", "Eden", "Ford", "Jay" ], "edges": [ [ 0, 4 ], [ 2, 9 ], [ 4, 8 ], [ 5, 3 ], [ 5, 6 ], [ 6, 1 ], [ 8, 2 ], [ 9, 5 ], [ 9, 7 ], [ 10, 14 ], [ 12, 19 ], [ 14, 18 ], [ 15, 13 ], [ 15, 16 ], [ 16, 11 ], [ 18, 12 ], [ 19, 15 ], [ 19, 17 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Brian knows Alvin. Daphna knows Jenny. Alvin knows Morris. Kylie knows Clay. Clay knows Heidi. Joyce knows Tristan. Louise knows William. Heidi knows Brandon. Randall knows Kylie. Noel knows Winston. Jenny knows Randall. Fisher knows Finn. Heidi knows Jonathan. Finn knows Noel. Joyce knows Brian. Winston knows Dolores. Jonathan knows Louise. Dolores knows Joyce. Which of Dolores and Clay can Fisher reach?", "answer": "Dolores", "steps": [ "Fisher knows Finn.", "Finn knows Noel.", "Noel knows Winston.", "Winston knows Dolores." ], "difficulty": 4, "original_distance": 8, "idx_to_symbol": [ "Fisher", "Winston", "Tristan", "Finn", "Noel", "Morris", "Joyce", "Alvin", "Dolores", "Brian", "Daphna", "Kylie", "Brandon", "Jenny", "Randall", "William", "Heidi", "Louise", "Clay", "Jonathan" ], "edges": [ [ 0, 3 ], [ 1, 8 ], [ 3, 4 ], [ 4, 1 ], [ 6, 2 ], [ 6, 9 ], [ 7, 5 ], [ 8, 6 ], [ 9, 7 ], [ 10, 13 ], [ 11, 18 ], [ 13, 14 ], [ 14, 11 ], [ 16, 12 ], [ 16, 19 ], [ 17, 15 ], [ 18, 16 ], [ 19, 17 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Lorraine knows Jules. Renee knows Mary. Lois knows Hubert. Lorraine knows Foster. Hubert knows Ashton. Lorraine knows Noah. Ibrahim knows Bruce. Lois knows Pedro. Pedro knows Emery. Renee knows Lorraine. Mary knows Ibrahim. Pedro knows Tabitha. Lilia knows Renee. Lois knows Calvin. Renee knows Jorge. Ashton knows Brooke. Pedro knows Lennox. Peggy knows Lois. Which of Ibrahim and Ashton can Lilia reach?", "answer": "Ibrahim", "steps": [ "Lilia knows Renee.", "Renee knows Mary.", "Mary knows Ibrahim." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Lilia", "Jorge", "Ibrahim", "Mary", "Noah", "Bruce", "Renee", "Lorraine", "Foster", "Jules", "Peggy", "Calvin", "Ashton", "Hubert", "Tabitha", "Brooke", "Lois", "Pedro", "Lennox", "Emery" ], "edges": [ [ 0, 6 ], [ 2, 5 ], [ 3, 2 ], [ 6, 1 ], [ 6, 3 ], [ 6, 7 ], [ 7, 4 ], [ 7, 8 ], [ 7, 9 ], [ 10, 16 ], [ 12, 15 ], [ 13, 12 ], [ 16, 11 ], [ 16, 13 ], [ 16, 17 ], [ 17, 14 ], [ 17, 18 ], [ 17, 19 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Darin knows Asher. Stefan knows Geneva. Sandy knows Blanche. Asher knows Flora. Cliff knows Owen. Cliff knows Stefan. Brent knows Malik. Patrick knows Pauline. Flora knows Sandy. Cliff knows Autumn. Flora knows Vanessa. Stella knows Luz. Flora knows Jillian. Pauline knows Cliff. Stefan knows Destiny. Sandy knows Brent. Malik knows Anthony. Destiny knows Stella. Which of Sandy and Stefan can Patrick reach?", "answer": "Stefan", "steps": [ "Patrick knows Pauline.", "Pauline knows Cliff.", "Cliff knows Stefan." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Patrick", "Luz", "Stefan", "Owen", "Cliff", "Pauline", "Stella", "Destiny", "Geneva", "Autumn", "Darin", "Anthony", "Sandy", "Vanessa", "Flora", "Asher", "Malik", "Brent", "Blanche", "Jillian" ], "edges": [ [ 0, 5 ], [ 2, 7 ], [ 2, 8 ], [ 4, 3 ], [ 4, 2 ], [ 4, 9 ], [ 5, 4 ], [ 6, 1 ], [ 7, 6 ], [ 10, 15 ], [ 12, 17 ], [ 12, 18 ], [ 14, 13 ], [ 14, 12 ], [ 14, 19 ], [ 15, 14 ], [ 16, 11 ], [ 17, 16 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Brian knows Aldo. Lorraine knows Troy. Winston knows Derek. Jerry knows Harley. Jerry knows Diego. Harry knows Brian. Grant knows Lorraine. Autumn knows Frida. Troy knows Jerry. Aldo knows Jeff. Harley knows Autumn. Jeff knows Doris. Louisa knows Harry. Doris knows Willard. Diego knows Darrell. Aldo knows Winston. Winston knows Cora. Diego knows Dawn. Which of Willard and Frida can Louisa reach?", "answer": "Willard", "steps": [ "Louisa knows Harry.", "Harry knows Brian.", "Brian knows Aldo.", "Aldo knows Jeff.", "Jeff knows Doris.", "Doris knows Willard." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Louisa", "Willard", "Brian", "Derek", "Aldo", "Doris", "Jeff", "Harry", "Cora", "Winston", "Grant", "Frida", "Troy", "Darrell", "Jerry", "Autumn", "Harley", "Lorraine", "Dawn", "Diego" ], "edges": [ [ 0, 7 ], [ 2, 4 ], [ 4, 6 ], [ 4, 9 ], [ 5, 1 ], [ 6, 5 ], [ 7, 2 ], [ 9, 3 ], [ 9, 8 ], [ 10, 17 ], [ 12, 14 ], [ 14, 16 ], [ 14, 19 ], [ 15, 11 ], [ 16, 15 ], [ 17, 12 ], [ 19, 13 ], [ 19, 18 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Gladys knows Jenna. Cristina knows Peggy. Ursula knows Leigh. Antonio knows Guy. Sally knows Carmela. Gladys knows Lola. Catherine knows Monroe. Leigh knows Sally. Rebecca knows Arturo. Charles knows Jonathan. Rebecca knows Antonio. Sally knows Noel. Justine knows Charles. Guy knows Tom. Catherine knows Justine. Guy knows Cristina. Peggy knows Gladys. Charles knows Ursula. Which of Lola and Noel can Catherine reach?", "answer": "Noel", "steps": [ "Catherine knows Justine.", "Justine knows Charles.", "Charles knows Ursula.", "Ursula knows Leigh.", "Leigh knows Sally.", "Sally knows Noel." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Catherine", "Charles", "Jonathan", "Noel", "Ursula", "Justine", "Sally", "Carmela", "Monroe", "Leigh", "Rebecca", "Guy", "Tom", "Lola", "Cristina", "Antonio", "Gladys", "Jenna", "Arturo", "Peggy" ], "edges": [ [ 0, 8 ], [ 0, 5 ], [ 1, 2 ], [ 1, 4 ], [ 4, 9 ], [ 5, 1 ], [ 6, 3 ], [ 6, 7 ], [ 9, 6 ], [ 10, 18 ], [ 10, 15 ], [ 11, 12 ], [ 11, 14 ], [ 14, 19 ], [ 15, 11 ], [ 16, 13 ], [ 16, 17 ], [ 19, 16 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Arden knows Eunice. Austin knows Laura. Constance knows Wayne. Arden knows Simon. Lauren knows Dolly. Alejandro knows Ricardo. Austin knows Kristin. Peter knows Donovan. Alejandro knows Lamont. Lamont knows Austin. Donovan knows Kerry. Wayne knows Lauren. Austin knows Peter. Constance knows Hardy. Constance knows Sean. Ramona knows Arden. Eunice knows Constance. Emery knows Alejandro. Which of Austin and Constance can Emery reach?", "answer": "Austin", "steps": [ "Emery knows Alejandro.", "Alejandro knows Lamont.", "Lamont knows Austin." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Emery", "Austin", "Alejandro", "Ricardo", "Peter", "Kristin", "Donovan", "Lamont", "Kerry", "Laura", "Ramona", "Constance", "Arden", "Simon", "Wayne", "Hardy", "Lauren", "Eunice", "Dolly", "Sean" ], "edges": [ [ 0, 2 ], [ 1, 5 ], [ 1, 4 ], [ 1, 9 ], [ 2, 3 ], [ 2, 7 ], [ 4, 6 ], [ 6, 8 ], [ 7, 1 ], [ 10, 12 ], [ 11, 15 ], [ 11, 14 ], [ 11, 19 ], [ 12, 13 ], [ 12, 17 ], [ 14, 16 ], [ 16, 18 ], [ 17, 11 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Dudley knows Milo. Bill knows Fritz. Dudley knows Lara. Fritz knows Leland. Blair knows Mabel. Ross knows Dudley. Elijah knows Seth. Adam knows Blair. Bill knows Anita. Dudley knows Marcia. Quinn knows Hazel. Marcia knows Daniella. Bill knows Boyd. Leland knows Adam. Fraser knows Quinn. Elijah knows Bill. Ross knows Trina. Daniella knows Fraser. Which of Fraser and Adam can Ross reach?", "answer": "Fraser", "steps": [ "Ross knows Dudley.", "Dudley knows Marcia.", "Marcia knows Daniella.", "Daniella knows Fraser." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Ross", "Quinn", "Lara", "Fraser", "Daniella", "Marcia", "Hazel", "Trina", "Milo", "Dudley", "Elijah", "Blair", "Anita", "Adam", "Leland", "Fritz", "Mabel", "Seth", "Boyd", "Bill" ], "edges": [ [ 0, 7 ], [ 0, 9 ], [ 1, 6 ], [ 3, 1 ], [ 4, 3 ], [ 5, 4 ], [ 9, 2 ], [ 9, 5 ], [ 9, 8 ], [ 10, 17 ], [ 10, 19 ], [ 11, 16 ], [ 13, 11 ], [ 14, 13 ], [ 15, 14 ], [ 19, 12 ], [ 19, 15 ], [ 19, 18 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Dalton knows Lara. Dalton knows Simon. Leland knows Jeremy. Autumn knows Rick. Jeremy knows Esperanza. Lara knows Geneva. Adele knows Isla. Geneva knows Darla. Isla knows Helene. Fletcher knows Ivy. Helene knows Dalton. Dalton knows Daphna. Daphna knows Federico. Jeremy knows Kai. Yuki knows Leland. Jeremy knows Autumn. Sue knows Yuki. Esperanza knows Fletcher. Which of Geneva and Fletcher can Sue reach?", "answer": "Fletcher", "steps": [ "Sue knows Yuki.", "Yuki knows Leland.", "Leland knows Jeremy.", "Jeremy knows Esperanza.", "Esperanza knows Fletcher." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Sue", "Leland", "Esperanza", "Kai", "Fletcher", "Yuki", "Rick", "Jeremy", "Ivy", "Autumn", "Adele", "Helene", "Lara", "Simon", "Geneva", "Isla", "Federico", "Dalton", "Darla", "Daphna" ], "edges": [ [ 0, 5 ], [ 1, 7 ], [ 2, 4 ], [ 4, 8 ], [ 5, 1 ], [ 7, 3 ], [ 7, 2 ], [ 7, 9 ], [ 9, 6 ], [ 10, 15 ], [ 11, 17 ], [ 12, 14 ], [ 14, 18 ], [ 15, 11 ], [ 17, 13 ], [ 17, 12 ], [ 17, 19 ], [ 19, 16 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Asher knows Ramon. Aspen knows Ted. Raquel knows Kirk. Theodore knows Dudley. Dudley knows Raquel. Dexter knows Madeline. Dexter knows Camden. Asher knows Dexter. Ainsley knows Tara. Ted knows Adele. Gina knows Cordelia. Cordelia knows Ainsley. Wallace knows Aspen. Raquel knows Alyssa. Ramon knows Gina. August knows Wallace. Dudley knows August. Hubert knows Asher. Which of Gina and Wallace can Theodore reach?", "answer": "Wallace", "steps": [ "Theodore knows Dudley.", "Dudley knows August.", "August knows Wallace." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Theodore", "Wallace", "Aspen", "Ted", "Dudley", "Adele", "Raquel", "Kirk", "August", "Alyssa", "Hubert", "Gina", "Cordelia", "Ainsley", "Asher", "Tara", "Dexter", "Madeline", "Ramon", "Camden" ], "edges": [ [ 0, 4 ], [ 1, 2 ], [ 2, 3 ], [ 3, 5 ], [ 4, 8 ], [ 4, 6 ], [ 6, 7 ], [ 6, 9 ], [ 8, 1 ], [ 10, 14 ], [ 11, 12 ], [ 12, 13 ], [ 13, 15 ], [ 14, 18 ], [ 14, 16 ], [ 16, 17 ], [ 16, 19 ], [ 18, 11 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Jules knows Estelle. Edmund knows Opal. Hazel knows Layla. Malik knows Hazel. Hazel knows Floyd. Dwight knows Joanna. Penny knows Darla. Opal knows Dwight. Carol knows Hope. Carol knows Penny. Dwight knows Robert. Katrina knows Edmund. Joanna knows Jules. Edmund knows Marilyn. Michael knows Carol. Michael knows Gerald. Joanna knows Preston. Layla knows Michael. Which of Joanna and Carol can Katrina reach?", "answer": "Joanna", "steps": [ "Katrina knows Edmund.", "Edmund knows Opal.", "Opal knows Dwight.", "Dwight knows Joanna." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Katrina", "Marilyn", "Estelle", "Opal", "Joanna", "Robert", "Jules", "Dwight", "Preston", "Edmund", "Malik", "Floyd", "Darla", "Layla", "Carol", "Gerald", "Penny", "Michael", "Hope", "Hazel" ], "edges": [ [ 0, 9 ], [ 3, 7 ], [ 4, 6 ], [ 4, 8 ], [ 6, 2 ], [ 7, 5 ], [ 7, 4 ], [ 9, 1 ], [ 9, 3 ], [ 10, 19 ], [ 13, 17 ], [ 14, 16 ], [ 14, 18 ], [ 16, 12 ], [ 17, 15 ], [ 17, 14 ], [ 19, 11 ], [ 19, 13 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Kendrick knows Glenda. Aspen knows Adam. Hattie knows Kendrick. Bernard knows Hattie. Adam knows Karen. David knows Stella. Frida knows Latoya. Hattie knows Bernice. Daphna knows Jorge. Frida knows Aspen. Aspen knows Chantal. Bernard knows Quinn. Frida knows Peggy. Jorge knows Bernard. Stella knows Frida. Karen knows Keira. Bernard knows Teresa. Glenda knows Abby. Which of Abby and Keira can Daphna reach?", "answer": "Abby", "steps": [ "Daphna knows Jorge.", "Jorge knows Bernard.", "Bernard knows Hattie.", "Hattie knows Kendrick.", "Kendrick knows Glenda.", "Glenda knows Abby." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Daphna", "Abby", "Kendrick", "Glenda", "Jorge", "Hattie", "Quinn", "Bernard", "Teresa", "Bernice", "David", "Keira", "Adam", "Karen", "Stella", "Aspen", "Latoya", "Frida", "Peggy", "Chantal" ], "edges": [ [ 0, 4 ], [ 2, 3 ], [ 3, 1 ], [ 4, 7 ], [ 5, 2 ], [ 5, 9 ], [ 7, 6 ], [ 7, 8 ], [ 7, 5 ], [ 10, 14 ], [ 12, 13 ], [ 13, 11 ], [ 14, 17 ], [ 15, 12 ], [ 15, 19 ], [ 17, 16 ], [ 17, 18 ], [ 17, 15 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Alejandro knows Luna. Inez knows Landon. Gwen knows Carrie. Landon knows Gwen. Cesar knows Frankie. Leroy knows Ethan. Marion knows Tonya. Alejandro knows Morris. Frankie knows Helen. Marion knows Cesar. Arthur knows Aiden. Alejandro knows Lucia. Lucia knows Inez. Marion knows Leroy. Luna knows Joaquin. Helen knows Arthur. Arthur knows Corinne. Gwen knows Ford. Which of Aiden and Carrie can Marion reach?", "answer": "Aiden", "steps": [ "Marion knows Cesar.", "Cesar knows Frankie.", "Frankie knows Helen.", "Helen knows Arthur.", "Arthur knows Aiden." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Marion", "Leroy", "Frankie", "Ethan", "Helen", "Aiden", "Cesar", "Tonya", "Arthur", "Corinne", "Alejandro", "Luna", "Inez", "Joaquin", "Landon", "Carrie", "Lucia", "Morris", "Gwen", "Ford" ], "edges": [ [ 0, 1 ], [ 0, 7 ], [ 0, 6 ], [ 1, 3 ], [ 2, 4 ], [ 4, 8 ], [ 6, 2 ], [ 8, 5 ], [ 8, 9 ], [ 10, 11 ], [ 10, 17 ], [ 10, 16 ], [ 11, 13 ], [ 12, 14 ], [ 14, 18 ], [ 16, 12 ], [ 18, 15 ], [ 18, 19 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Latoya knows Mildred. Margaret knows Nicholas. Veronica knows Saul. Mildred knows Lisa. Kristin knows Eldon. Veronica knows Beverly. Lisa knows Ellis. Barbara knows Cody. Cameron knows Veronica. Aubrey knows Cameron. Ellis knows Cesar. Cesar knows Alison. Nicholas knows Barbara. Cesar knows Betty. Barbara knows Clay. Eldon knows Latoya. Latoya knows Julio. Beverly knows Margaret. Which of Margaret and Lisa can Aubrey reach?", "answer": "Margaret", "steps": [ "Aubrey knows Cameron.", "Cameron knows Veronica.", "Veronica knows Beverly.", "Beverly knows Margaret." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Aubrey", "Veronica", "Nicholas", "Barbara", "Margaret", "Cameron", "Saul", "Clay", "Beverly", "Cody", "Kristin", "Latoya", "Ellis", "Cesar", "Lisa", "Eldon", "Julio", "Alison", "Mildred", "Betty" ], "edges": [ [ 0, 5 ], [ 1, 6 ], [ 1, 8 ], [ 2, 3 ], [ 3, 7 ], [ 3, 9 ], [ 4, 2 ], [ 5, 1 ], [ 8, 4 ], [ 10, 15 ], [ 11, 16 ], [ 11, 18 ], [ 12, 13 ], [ 13, 17 ], [ 13, 19 ], [ 14, 12 ], [ 15, 11 ], [ 18, 14 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Luis knows Michael. Jim knows Lynn. Winston knows Alana. Stella knows Winston. George knows Eve. Michael knows Nell. Andrea knows Carey. Lenora knows Paul. Eve knows Carol. Luis knows Harlan. Michael knows Stella. Alan knows Fraser. Eden knows Jim. Alan knows George. Alana knows Eden. Andrea knows Alan. Magdalena knows Lenora. Carol knows Magdalena. Which of Michael and Alan can Luis reach?", "answer": "Michael", "steps": [ "Luis knows Michael." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Luis", "Winston", "Stella", "Eden", "Harlan", "Lynn", "Jim", "Alana", "Michael", "Nell", "Andrea", "Eve", "George", "Magdalena", "Carey", "Paul", "Lenora", "Carol", "Alan", "Fraser" ], "edges": [ [ 0, 4 ], [ 0, 8 ], [ 1, 7 ], [ 2, 1 ], [ 3, 6 ], [ 6, 5 ], [ 7, 3 ], [ 8, 2 ], [ 8, 9 ], [ 10, 14 ], [ 10, 18 ], [ 11, 17 ], [ 12, 11 ], [ 13, 16 ], [ 16, 15 ], [ 17, 13 ], [ 18, 12 ], [ 18, 19 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Zach knows Jeffery. Magdalena knows Hattie. Myrtle knows Gregory. Myrtle knows Elmer. Goldie knows Electra. Matt knows James. James knows Myrtle. Matt knows Tamara. Clarence knows Deborah. Clarence knows Henrietta. Ernesto knows Clarence. Dave knows Magdalena. Myrtle knows Goldie. Zach knows Ernesto. Ebony knows Leticia. Goldie knows Ebony. Clarence knows Dave. Dave knows Fred. Which of Goldie and Dave can Matt reach?", "answer": "Goldie", "steps": [ "Matt knows James.", "James knows Myrtle.", "Myrtle knows Goldie." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Matt", "Goldie", "James", "Tamara", "Gregory", "Elmer", "Myrtle", "Ebony", "Electra", "Leticia", "Zach", "Dave", "Ernesto", "Jeffery", "Henrietta", "Deborah", "Clarence", "Magdalena", "Fred", "Hattie" ], "edges": [ [ 0, 3 ], [ 0, 2 ], [ 1, 8 ], [ 1, 7 ], [ 2, 6 ], [ 6, 4 ], [ 6, 5 ], [ 6, 1 ], [ 7, 9 ], [ 10, 13 ], [ 10, 12 ], [ 11, 18 ], [ 11, 17 ], [ 12, 16 ], [ 16, 14 ], [ 16, 15 ], [ 16, 11 ], [ 17, 19 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Harold knows Jules. Houston knows Roland. Kristin knows Fisher. Dick knows Ariel. Valerie knows Jane. Derrick knows Yvonne. Elena knows Harold. Valerie knows Houston. Yvonne knows Elena. Dee knows Maureen. Tyler knows Aurora. Noah knows Fritz. Derrick knows Wesley. Yvonne knows Noah. Maureen knows Valerie. Tyler knows Dee. Harold knows Dick. Dee knows Kristin. Which of Dee and Yvonne can Tyler reach?", "answer": "Dee", "steps": [ "Tyler knows Dee." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Tyler", "Maureen", "Valerie", "Jane", "Dee", "Houston", "Fisher", "Aurora", "Kristin", "Roland", "Derrick", "Elena", "Harold", "Jules", "Yvonne", "Dick", "Fritz", "Wesley", "Noah", "Ariel" ], "edges": [ [ 0, 7 ], [ 0, 4 ], [ 1, 2 ], [ 2, 3 ], [ 2, 5 ], [ 4, 8 ], [ 4, 1 ], [ 5, 9 ], [ 8, 6 ], [ 10, 17 ], [ 10, 14 ], [ 11, 12 ], [ 12, 13 ], [ 12, 15 ], [ 14, 18 ], [ 14, 11 ], [ 15, 19 ], [ 18, 16 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Mark knows Etta. Hannah knows Garland. Jacqueline knows Kenzie. Myrtle knows Alex. Alex knows Aria. Julian knows Marcus. Nicholas knows Ramon. Garland knows Mark. Erik knows Hannah. Ramon knows Wanda. Alex knows Jacqueline. Jana knows Floyd. Marcus knows Myrtle. Mark knows Jana. Mike knows Giselle. Giselle knows Roman. Wanda knows Julian. Roman knows Erik. Which of Erik and Julian can Mike reach?", "answer": "Erik", "steps": [ "Mike knows Giselle.", "Giselle knows Roman.", "Roman knows Erik." ], "difficulty": 3, "original_distance": 8, "idx_to_symbol": [ "Mike", "Etta", "Jana", "Mark", "Floyd", "Hannah", "Erik", "Giselle", "Garland", "Roman", "Nicholas", "Aria", "Jacqueline", "Alex", "Kenzie", "Marcus", "Julian", "Ramon", "Myrtle", "Wanda" ], "edges": [ [ 0, 7 ], [ 2, 4 ], [ 3, 1 ], [ 3, 2 ], [ 5, 8 ], [ 6, 5 ], [ 7, 9 ], [ 8, 3 ], [ 9, 6 ], [ 10, 17 ], [ 12, 14 ], [ 13, 11 ], [ 13, 12 ], [ 15, 18 ], [ 16, 15 ], [ 17, 19 ], [ 18, 13 ], [ 19, 16 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Adam knows Jenna. Lucy knows Colby. Emanuel knows Dirk. Helene knows Emanuel. Jenna knows Lucy. Arturo knows Chloe. Beverly knows Alana. Simon knows Constance. Simon knows Aubrey. Rowan knows Lydia. Alana knows Kendra. Franklin knows Helene. Franklin knows Alejandro. Lucy knows Simon. Constance knows Beverly. Dirk knows Robert. Arturo knows Franklin. Lydia knows Arturo. Which of Lucy and Arturo can Rowan reach?", "answer": "Arturo", "steps": [ "Rowan knows Lydia.", "Lydia knows Arturo." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Rowan", "Chloe", "Franklin", "Arturo", "Dirk", "Emanuel", "Helene", "Lydia", "Alejandro", "Robert", "Adam", "Colby", "Simon", "Lucy", "Alana", "Beverly", "Constance", "Jenna", "Aubrey", "Kendra" ], "edges": [ [ 0, 7 ], [ 2, 8 ], [ 2, 6 ], [ 3, 1 ], [ 3, 2 ], [ 4, 9 ], [ 5, 4 ], [ 6, 5 ], [ 7, 3 ], [ 10, 17 ], [ 12, 18 ], [ 12, 16 ], [ 13, 11 ], [ 13, 12 ], [ 14, 19 ], [ 15, 14 ], [ 16, 15 ], [ 17, 13 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Jeremy knows Samuel. Charles knows Dorian. Charles knows Fergus. Charles knows Jose. Jeremy knows Bernard. Charles knows Delilah. Deanna knows Charles. Jose knows Quinn. Charles knows Frida. Kirsten knows Isla. Justin knows Chester. Jeremy knows Adam. Delilah knows Kirsten. August knows Jeremy. Samuel knows Harvey. Jeremy knows Nolan. Nolan knows Justin. Jeremy knows William. Which of Jeremy and Charles can Deanna reach?", "answer": "Charles", "steps": [ "Deanna knows Charles." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Deanna", "Charles", "Delilah", "Jose", "Frida", "Dorian", "Fergus", "Kirsten", "Quinn", "Isla", "August", "Jeremy", "Nolan", "Samuel", "Adam", "Bernard", "William", "Justin", "Harvey", "Chester" ], "edges": [ [ 0, 1 ], [ 1, 4 ], [ 1, 5 ], [ 1, 6 ], [ 1, 3 ], [ 1, 2 ], [ 2, 7 ], [ 3, 8 ], [ 7, 9 ], [ 10, 11 ], [ 11, 14 ], [ 11, 15 ], [ 11, 16 ], [ 11, 13 ], [ 11, 12 ], [ 12, 17 ], [ 13, 18 ], [ 17, 19 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Hampton knows Amy. Chester knows Andre. Marcia knows Melody. Lane knows Troy. Thomas knows Hampton. Gus knows Ember. Darin knows Trudy. Jasmine knows Beth. Thomas knows Fabian. John knows Thomas. Beth knows Elodie. Andre knows Sue. Darin knows Jasmine. Trudy knows Gus. Beth knows Lane. Sue knows Marcia. Chester knows John. Ember knows Dexter. Which of Jasmine and John can Darin reach?", "answer": "Jasmine", "steps": [ "Darin knows Jasmine." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Darin", "Jasmine", "Gus", "Ember", "Beth", "Troy", "Trudy", "Elodie", "Lane", "Dexter", "Chester", "John", "Sue", "Marcia", "Thomas", "Amy", "Andre", "Fabian", "Hampton", "Melody" ], "edges": [ [ 0, 1 ], [ 0, 6 ], [ 1, 4 ], [ 2, 3 ], [ 3, 9 ], [ 4, 7 ], [ 4, 8 ], [ 6, 2 ], [ 8, 5 ], [ 10, 11 ], [ 10, 16 ], [ 11, 14 ], [ 12, 13 ], [ 13, 19 ], [ 14, 17 ], [ 14, 18 ], [ 16, 12 ], [ 18, 15 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Bennett knows Miranda. Stephen knows Marian. Bennett knows Ruby. Miranda knows Claude. Celia knows Dana. Stephen knows Alejandro. Fergus knows Celia. Bernadette knows Blanche. Celia knows Morgan. Dana knows Pam. Dana knows Lambert. Bennett knows Stephen. Bennett knows Sierra. Jude knows Devin. Celia knows Logan. Devin knows Bennett. Celia knows Bernadette. Heidi knows Fergus. Which of Fergus and Devin can Heidi reach?", "answer": "Fergus", "steps": [ "Heidi knows Fergus." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Heidi", "Fergus", "Blanche", "Logan", "Bernadette", "Celia", "Morgan", "Dana", "Pam", "Lambert", "Jude", "Devin", "Claude", "Sierra", "Miranda", "Bennett", "Ruby", "Stephen", "Alejandro", "Marian" ], "edges": [ [ 0, 1 ], [ 1, 5 ], [ 4, 2 ], [ 5, 3 ], [ 5, 4 ], [ 5, 6 ], [ 5, 7 ], [ 7, 8 ], [ 7, 9 ], [ 10, 11 ], [ 11, 15 ], [ 14, 12 ], [ 15, 13 ], [ 15, 14 ], [ 15, 16 ], [ 15, 17 ], [ 17, 18 ], [ 17, 19 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Alicia knows Blanche. Alexa knows Jolene. Kay knows Alexa. Jolene knows Dorian. Arturo knows Eunice. Diana knows Angela. Dorian knows Christopher. Alicia knows Christian. Alana knows Diana. Ignacio knows Alana. Ross knows Erma. Alicia knows Lucas. Christian knows Clement. Arturo knows Kay. Alana knows Saul. Dorian knows Ross. Clement knows Ignacio. Arturo knows Oliver. Which of Dorian and Alana can Arturo reach?", "answer": "Dorian", "steps": [ "Arturo knows Kay.", "Kay knows Alexa.", "Alexa knows Jolene.", "Jolene knows Dorian." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Arturo", "Ross", "Jolene", "Erma", "Oliver", "Kay", "Alexa", "Christopher", "Eunice", "Dorian", "Alicia", "Diana", "Ignacio", "Angela", "Lucas", "Christian", "Clement", "Saul", "Blanche", "Alana" ], "edges": [ [ 0, 4 ], [ 0, 8 ], [ 0, 5 ], [ 1, 3 ], [ 2, 9 ], [ 5, 6 ], [ 6, 2 ], [ 9, 1 ], [ 9, 7 ], [ 10, 14 ], [ 10, 18 ], [ 10, 15 ], [ 11, 13 ], [ 12, 19 ], [ 15, 16 ], [ 16, 12 ], [ 19, 11 ], [ 19, 17 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Constance knows Lisette. Drake knows Eldon. Aiden knows Robin. Eldon knows Brock. Cole knows Adele. Cole knows Jacob. Constance knows Lawrence. Constance knows Eileen. Robin knows Diane. Drake knows Craig. Jana knows Etta. Lisette knows Jana. Beth knows Constance. Cole knows Neville. Asher knows Cole. Jacob knows Drake. Jana knows Aiden. Brock knows Emmett. Which of Emmett and Diane can Beth reach?", "answer": "Diane", "steps": [ "Beth knows Constance.", "Constance knows Lisette.", "Lisette knows Jana.", "Jana knows Aiden.", "Aiden knows Robin.", "Robin knows Diane." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Beth", "Lawrence", "Etta", "Aiden", "Robin", "Eileen", "Diane", "Jana", "Constance", "Lisette", "Asher", "Neville", "Craig", "Eldon", "Brock", "Adele", "Emmett", "Drake", "Cole", "Jacob" ], "edges": [ [ 0, 8 ], [ 3, 4 ], [ 4, 6 ], [ 7, 2 ], [ 7, 3 ], [ 8, 1 ], [ 8, 5 ], [ 8, 9 ], [ 9, 7 ], [ 10, 18 ], [ 13, 14 ], [ 14, 16 ], [ 17, 12 ], [ 17, 13 ], [ 18, 11 ], [ 18, 15 ], [ 18, 19 ], [ 19, 17 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Delia knows Ainsley. Cora knows Lucy. Tony knows Delia. Georgia knows Alyson. Sandy knows Joyce. Elise knows Fritz. Casey knows Terry. Cecilia knows Kendra. Alyson knows Sandy. Cora knows Cecilia. Sandy knows Cora. Tony knows Elliot. Fritz knows Tony. Ainsley knows Dolores. Tony knows Felicia. Sandy knows Casey. Delia knows Ingrid. Felicia knows Chloe. Which of Kendra and Dolores can Georgia reach?", "answer": "Kendra", "steps": [ "Georgia knows Alyson.", "Alyson knows Sandy.", "Sandy knows Cora.", "Cora knows Cecilia.", "Cecilia knows Kendra." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Georgia", "Cecilia", "Joyce", "Cora", "Kendra", "Sandy", "Alyson", "Lucy", "Casey", "Terry", "Elise", "Ainsley", "Elliot", "Delia", "Dolores", "Tony", "Fritz", "Ingrid", "Felicia", "Chloe" ], "edges": [ [ 0, 6 ], [ 1, 4 ], [ 3, 1 ], [ 3, 7 ], [ 5, 2 ], [ 5, 3 ], [ 5, 8 ], [ 6, 5 ], [ 8, 9 ], [ 10, 16 ], [ 11, 14 ], [ 13, 11 ], [ 13, 17 ], [ 15, 12 ], [ 15, 13 ], [ 15, 18 ], [ 16, 15 ], [ 18, 19 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Deborah knows Pierce. Brett knows Ivan. Walter knows Selena. Darcy knows Deborah. Brett knows Walter. Darrell knows Jolene. Jermaine knows Colin. Brett knows Jermaine. Kay knows Ralph. Ralph knows Andrew. Ralph knows Clay. Ralph knows Camden. Laverne knows Brett. Andrew knows Sheryl. Selena knows Liam. Clay knows Darcy. Pierce knows Ignacio. Liam knows Darrell. Which of Deborah and Liam can Kay reach?", "answer": "Deborah", "steps": [ "Kay knows Ralph.", "Ralph knows Clay.", "Clay knows Darcy.", "Darcy knows Deborah." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Kay", "Darcy", "Sheryl", "Camden", "Andrew", "Clay", "Deborah", "Ralph", "Pierce", "Ignacio", "Laverne", "Selena", "Colin", "Ivan", "Jermaine", "Walter", "Liam", "Brett", "Darrell", "Jolene" ], "edges": [ [ 0, 7 ], [ 1, 6 ], [ 4, 2 ], [ 5, 1 ], [ 6, 8 ], [ 7, 3 ], [ 7, 4 ], [ 7, 5 ], [ 8, 9 ], [ 10, 17 ], [ 11, 16 ], [ 14, 12 ], [ 15, 11 ], [ 16, 18 ], [ 17, 13 ], [ 17, 14 ], [ 17, 15 ], [ 18, 19 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Keira knows Humphrey. Lillian knows Federico. Walter knows Zach. Harold knows Eileen. Zach knows Griffith. Lacey knows Leroy. Eileen knows Carla. Eugene knows Harold. Lorraine knows Eugene. Humphrey knows Russ. Forrest knows Demetrius. Griffith knows Lillian. Leroy knows Forrest. Demetrius knows Jameson. Keith knows Elias. Elias knows Keira. Humphrey knows Lacey. Eileen knows Walter. Which of Elias and Eugene can Lorraine reach?", "answer": "Eugene", "steps": [ "Lorraine knows Eugene." ], "difficulty": 1, "original_distance": 8, "idx_to_symbol": [ "Lorraine", "Harold", "Zach", "Federico", "Eugene", "Griffith", "Eileen", "Lillian", "Walter", "Carla", "Keith", "Keira", "Leroy", "Jameson", "Elias", "Forrest", "Humphrey", "Demetrius", "Lacey", "Russ" ], "edges": [ [ 0, 4 ], [ 1, 6 ], [ 2, 5 ], [ 4, 1 ], [ 5, 7 ], [ 6, 8 ], [ 6, 9 ], [ 7, 3 ], [ 8, 2 ], [ 10, 14 ], [ 11, 16 ], [ 12, 15 ], [ 14, 11 ], [ 15, 17 ], [ 16, 18 ], [ 16, 19 ], [ 17, 13 ], [ 18, 12 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Fred knows Erwin. Irma knows Avery. Verna knows Thomas. Fred knows Verna. Steve knows Bruce. Jonathan knows Steve. Leticia knows Declan. Violet knows Inez. Steve knows Ella. Bruce knows Lloyd. Viola knows Wendy. Fanny knows Jonathan. Verna knows Viola. Preston knows Don. Steve knows Leticia. Bruce knows Violet. Fred knows Irma. Don knows Fred. Which of Verna and Bruce can Preston reach?", "answer": "Verna", "steps": [ "Preston knows Don.", "Don knows Fred.", "Fred knows Verna." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Preston", "Erwin", "Avery", "Don", "Verna", "Fred", "Viola", "Wendy", "Irma", "Thomas", "Fanny", "Ella", "Declan", "Jonathan", "Bruce", "Steve", "Violet", "Inez", "Leticia", "Lloyd" ], "edges": [ [ 0, 3 ], [ 3, 5 ], [ 4, 6 ], [ 4, 9 ], [ 5, 1 ], [ 5, 8 ], [ 5, 4 ], [ 6, 7 ], [ 8, 2 ], [ 10, 13 ], [ 13, 15 ], [ 14, 16 ], [ 14, 19 ], [ 15, 11 ], [ 15, 18 ], [ 15, 14 ], [ 16, 17 ], [ 18, 12 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Jocelyn knows George. Lawrence knows Hal. Hal knows Dee. Richard knows Mark. Ian knows Jonah. Richard knows Harry. Hal knows Eldon. Lawrence knows Jason. Lawrence knows Jocelyn. Richard knows Ian. Jacques knows Logan. Dennis knows Yara. Jocelyn knows Boyd. Jacques knows Tara. Ian knows Dennis. Richard knows Jacques. Boyd knows Janice. Lawrence knows Dexter. Which of Dennis and Boyd can Lawrence reach?", "answer": "Boyd", "steps": [ "Lawrence knows Jocelyn.", "Jocelyn knows Boyd." ], "difficulty": 2, "original_distance": 3, "idx_to_symbol": [ "Lawrence", "George", "Jocelyn", "Jason", "Hal", "Dee", "Janice", "Eldon", "Dexter", "Boyd", "Richard", "Jonah", "Ian", "Mark", "Jacques", "Tara", "Yara", "Logan", "Harry", "Dennis" ], "edges": [ [ 0, 3 ], [ 0, 4 ], [ 0, 8 ], [ 0, 2 ], [ 2, 1 ], [ 2, 9 ], [ 4, 5 ], [ 4, 7 ], [ 9, 6 ], [ 10, 13 ], [ 10, 14 ], [ 10, 18 ], [ 10, 12 ], [ 12, 11 ], [ 12, 19 ], [ 14, 15 ], [ 14, 17 ], [ 19, 16 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Ivy knows Seth. Denver knows Regina. Saul knows Kelly. Eamon knows Sam. Regina knows Ivy. Nina knows Otto. Alan knows Mara. Jeanette knows Ezra. Regina knows Eamon. Nina knows Jesse. Mara knows Jeanette. Jodi knows Billy. Mara knows Nina. Ivy knows Gabe. Jodi knows Alan. Jeanette knows Ruby. Saul knows Denver. Eamon knows Tyler. Which of Mara and Regina can Saul reach?", "answer": "Regina", "steps": [ "Saul knows Denver.", "Denver knows Regina." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Saul", "Regina", "Seth", "Gabe", "Eamon", "Tyler", "Denver", "Sam", "Kelly", "Ivy", "Jodi", "Mara", "Ruby", "Ezra", "Nina", "Jesse", "Alan", "Otto", "Billy", "Jeanette" ], "edges": [ [ 0, 8 ], [ 0, 6 ], [ 1, 4 ], [ 1, 9 ], [ 4, 5 ], [ 4, 7 ], [ 6, 1 ], [ 9, 2 ], [ 9, 3 ], [ 10, 18 ], [ 10, 16 ], [ 11, 14 ], [ 11, 19 ], [ 14, 15 ], [ 14, 17 ], [ 16, 11 ], [ 19, 12 ], [ 19, 13 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Anthony knows Dawn. Marco knows Clay. Chad knows Wendell. Wendell knows Samantha. Kaleb knows Sarah. Damian knows Herman. Keith knows Susanne. Susanne knows Marco. Sarah knows Anthony. Brittany knows Knox. Keith knows Chad. Knox knows Keith. Dawn knows Shelby. Helene knows Luna. Pat knows Brittany. Herman knows Arden. Dawn knows Damian. Shelby knows Helene. Which of Anthony and Knox can Kaleb reach?", "answer": "Anthony", "steps": [ "Kaleb knows Sarah.", "Sarah knows Anthony." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Kaleb", "Herman", "Dawn", "Sarah", "Luna", "Shelby", "Damian", "Arden", "Anthony", "Helene", "Pat", "Marco", "Keith", "Brittany", "Samantha", "Chad", "Susanne", "Clay", "Knox", "Wendell" ], "edges": [ [ 0, 3 ], [ 1, 7 ], [ 2, 6 ], [ 2, 5 ], [ 3, 8 ], [ 5, 9 ], [ 6, 1 ], [ 8, 2 ], [ 9, 4 ], [ 10, 13 ], [ 11, 17 ], [ 12, 16 ], [ 12, 15 ], [ 13, 18 ], [ 15, 19 ], [ 16, 11 ], [ 18, 12 ], [ 19, 14 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Gina knows Philip. Cora knows Rhonda. Bart knows Rebecca. Elaine knows Gina. Douglas knows Bart. Tom knows Ted. Randall knows Byron. Philip knows Aspen. Ted knows Elaine. Holden knows Claude. Aspen knows Trevor. Rebecca knows Ivy. Kane knows Tom. Rhonda knows Samantha. Claude knows Kane. Ivy knows Horace. Horace knows Cora. Samantha knows Randall. Which of Ted and Horace can Douglas reach?", "answer": "Horace", "steps": [ "Douglas knows Bart.", "Bart knows Rebecca.", "Rebecca knows Ivy.", "Ivy knows Horace." ], "difficulty": 4, "original_distance": 9, "idx_to_symbol": [ "Douglas", "Bart", "Randall", "Cora", "Ivy", "Rhonda", "Byron", "Rebecca", "Samantha", "Horace", "Holden", "Claude", "Aspen", "Elaine", "Tom", "Gina", "Trevor", "Kane", "Philip", "Ted" ], "edges": [ [ 0, 1 ], [ 1, 7 ], [ 2, 6 ], [ 3, 5 ], [ 4, 9 ], [ 5, 8 ], [ 7, 4 ], [ 8, 2 ], [ 9, 3 ], [ 10, 11 ], [ 11, 17 ], [ 12, 16 ], [ 13, 15 ], [ 14, 19 ], [ 15, 18 ], [ 17, 14 ], [ 18, 12 ], [ 19, 13 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Shelly knows Brett. Justine knows Benjamin. Brett knows Parker. Benjamin knows Aiden. Jeanette knows Justine. Carol knows Helene. Carol knows Georgia. Alyssa knows Lionel. Alejandro knows Edmund. Parker knows Alyssa. Benjamin knows Chester. Dean knows Jeanette. Justine knows Hadley. Edmund knows Dean. Dean knows August. Alyssa knows Carol. Wallace knows Shelly. Brett knows Kendra. Which of Helene and Chester can Wallace reach?", "answer": "Helene", "steps": [ "Wallace knows Shelly.", "Shelly knows Brett.", "Brett knows Parker.", "Parker knows Alyssa.", "Alyssa knows Carol.", "Carol knows Helene." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Wallace", "Alyssa", "Georgia", "Lionel", "Carol", "Parker", "Helene", "Kendra", "Brett", "Shelly", "Alejandro", "Justine", "Aiden", "Hadley", "Benjamin", "Jeanette", "Chester", "August", "Dean", "Edmund" ], "edges": [ [ 0, 9 ], [ 1, 3 ], [ 1, 4 ], [ 4, 2 ], [ 4, 6 ], [ 5, 1 ], [ 8, 5 ], [ 8, 7 ], [ 9, 8 ], [ 10, 19 ], [ 11, 13 ], [ 11, 14 ], [ 14, 12 ], [ 14, 16 ], [ 15, 11 ], [ 18, 15 ], [ 18, 17 ], [ 19, 18 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Earle knows Laura. Roland knows Darcy. Lucy knows Betty. Kevin knows Dixie. Yolanda knows Mae. Betty knows Kevin. Greer knows Earle. George knows Thea. Joy knows Lucy. Kevin knows Yolanda. Edna knows Wallace. Laura knows George. Dirk knows Agnes. Thea knows Roland. Ivan knows Joy. Darcy knows Dirk. Darcy knows Cecilia. Wallace knows Ivan. Which of Thea and Lucy can Edna reach?", "answer": "Lucy", "steps": [ "Edna knows Wallace.", "Wallace knows Ivan.", "Ivan knows Joy.", "Joy knows Lucy." ], "difficulty": 4, "original_distance": 8, "idx_to_symbol": [ "Edna", "Mae", "Kevin", "Wallace", "Joy", "Lucy", "Betty", "Yolanda", "Dixie", "Ivan", "Greer", "Agnes", "Darcy", "Earle", "George", "Thea", "Roland", "Dirk", "Cecilia", "Laura" ], "edges": [ [ 0, 3 ], [ 2, 7 ], [ 2, 8 ], [ 3, 9 ], [ 4, 5 ], [ 5, 6 ], [ 6, 2 ], [ 7, 1 ], [ 9, 4 ], [ 10, 13 ], [ 12, 17 ], [ 12, 18 ], [ 13, 19 ], [ 14, 15 ], [ 15, 16 ], [ 16, 12 ], [ 17, 11 ], [ 19, 14 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Duncan knows Clarence. Hector knows Kenneth. Clarence knows Holly. Elton knows Essie. Holly knows Florence. Conner knows Rufus. Chase knows Heather. Peggy knows Layla. Jermaine knows Chase. Dudley knows Duncan. Essie knows Megan. Duncan knows Tamara. Rufus knows Peggy. Florence knows Jermaine. Kenneth knows Elton. Randy knows Hector. Rufus knows Randy. Tamara knows Alyssa. Which of Heather and Megan can Dudley reach?", "answer": "Heather", "steps": [ "Dudley knows Duncan.", "Duncan knows Clarence.", "Clarence knows Holly.", "Holly knows Florence.", "Florence knows Jermaine.", "Jermaine knows Chase.", "Chase knows Heather." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Dudley", "Chase", "Alyssa", "Tamara", "Florence", "Holly", "Clarence", "Heather", "Duncan", "Jermaine", "Conner", "Essie", "Layla", "Peggy", "Kenneth", "Hector", "Randy", "Megan", "Rufus", "Elton" ], "edges": [ [ 0, 8 ], [ 1, 7 ], [ 3, 2 ], [ 4, 9 ], [ 5, 4 ], [ 6, 5 ], [ 8, 3 ], [ 8, 6 ], [ 9, 1 ], [ 10, 18 ], [ 11, 17 ], [ 13, 12 ], [ 14, 19 ], [ 15, 14 ], [ 16, 15 ], [ 18, 13 ], [ 18, 16 ], [ 19, 11 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Geraldine knows Clyde. Mario knows Gideon. Mario knows Jules. Gail knows Foster. Jules knows Chad. Lynn knows Grant. Lynn knows Kirsten. Bill knows Mario. Foster knows Jessica. Geraldine knows Bill. Rhea knows Sidney. Foster knows Lynn. Jessica knows Kira. Rhea knows Gail. Isla knows Logan. Gideon knows Cole. Jules knows Isla. Kirsten knows Justine. Which of Foster and Mario can Geraldine reach?", "answer": "Mario", "steps": [ "Geraldine knows Bill.", "Bill knows Mario." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Geraldine", "Jules", "Chad", "Gideon", "Clyde", "Cole", "Bill", "Logan", "Mario", "Isla", "Rhea", "Lynn", "Grant", "Jessica", "Sidney", "Kira", "Gail", "Justine", "Foster", "Kirsten" ], "edges": [ [ 0, 4 ], [ 0, 6 ], [ 1, 2 ], [ 1, 9 ], [ 3, 5 ], [ 6, 8 ], [ 8, 3 ], [ 8, 1 ], [ 9, 7 ], [ 10, 14 ], [ 10, 16 ], [ 11, 12 ], [ 11, 19 ], [ 13, 15 ], [ 16, 18 ], [ 18, 13 ], [ 18, 11 ], [ 19, 17 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Dorothy knows Colette. Priscilla knows Regina. Fanny knows Lorna. Jakob knows Lee. Lorna knows Zane. Jakob knows Grace. Jaime knows Humphrey. Dorothy knows Parker. Erwin knows Todd. Zane knows Dixie. Jaime knows Erwin. Parker knows Priscilla. Grace knows Fanny. Grace knows Celia. Miles knows Jaime. Sam knows Jakob. Erwin knows Dorothy. Fanny knows Sierra. Which of Parker and Lorna can Miles reach?", "answer": "Parker", "steps": [ "Miles knows Jaime.", "Jaime knows Erwin.", "Erwin knows Dorothy.", "Dorothy knows Parker." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Miles", "Regina", "Jaime", "Erwin", "Todd", "Dorothy", "Priscilla", "Parker", "Humphrey", "Colette", "Sam", "Dixie", "Jakob", "Grace", "Celia", "Fanny", "Zane", "Lorna", "Lee", "Sierra" ], "edges": [ [ 0, 2 ], [ 2, 8 ], [ 2, 3 ], [ 3, 4 ], [ 3, 5 ], [ 5, 7 ], [ 5, 9 ], [ 6, 1 ], [ 7, 6 ], [ 10, 12 ], [ 12, 18 ], [ 12, 13 ], [ 13, 14 ], [ 13, 15 ], [ 15, 17 ], [ 15, 19 ], [ 16, 11 ], [ 17, 16 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Zara knows Donna. Preston knows Albert. Erica knows Claudia. Preston knows Leon. Darla knows Randall. Glenn knows Erica. Barbara knows Zara. Emma knows Jared. Earle knows Emma. Leon knows Glenn. Jared knows Rena. Randall knows Earle. Claudia knows Blaine. Randall knows Lana. Kieran knows Kirsten. Rena knows Kieran. Earle knows Adam. Zara knows Preston. Which of Earle and Preston can Barbara reach?", "answer": "Preston", "steps": [ "Barbara knows Zara.", "Zara knows Preston." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Barbara", "Blaine", "Albert", "Claudia", "Erica", "Donna", "Leon", "Glenn", "Preston", "Zara", "Darla", "Kirsten", "Adam", "Kieran", "Rena", "Lana", "Emma", "Jared", "Earle", "Randall" ], "edges": [ [ 0, 9 ], [ 3, 1 ], [ 4, 3 ], [ 6, 7 ], [ 7, 4 ], [ 8, 2 ], [ 8, 6 ], [ 9, 5 ], [ 9, 8 ], [ 10, 19 ], [ 13, 11 ], [ 14, 13 ], [ 16, 17 ], [ 17, 14 ], [ 18, 12 ], [ 18, 16 ], [ 19, 15 ], [ 19, 18 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Harold knows Joyce. Miles knows Joaquin. Saul knows Harold. Sonia knows Gregory. Dane knows Coral. Clara knows Eugene. Joaquin knows George. Saul knows Clayton. Joyce knows Howard. Joaquin knows Clara. Eugene knows Serena. Howard knows Arden. Howard knows Charles. Howard knows Federico. Federico knows Dane. Sonia knows Harper. Gregory knows Miles. Joaquin knows Natalie. Which of Gregory and Harold can Saul reach?", "answer": "Harold", "steps": [ "Saul knows Harold." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Saul", "Howard", "Federico", "Arden", "Coral", "Dane", "Clayton", "Joyce", "Charles", "Harold", "Sonia", "Joaquin", "Clara", "George", "Serena", "Eugene", "Harper", "Miles", "Natalie", "Gregory" ], "edges": [ [ 0, 6 ], [ 0, 9 ], [ 1, 3 ], [ 1, 2 ], [ 1, 8 ], [ 2, 5 ], [ 5, 4 ], [ 7, 1 ], [ 9, 7 ], [ 10, 16 ], [ 10, 19 ], [ 11, 13 ], [ 11, 12 ], [ 11, 18 ], [ 12, 15 ], [ 15, 14 ], [ 17, 11 ], [ 19, 17 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Priscilla knows Katherine. Gemma knows Linda. Jay knows Willard. Annette knows Fergus. Myrtle knows Cesar. Eleanor knows Finn. Katherine knows Annette. Annette knows Myrtle. Veronica knows Tim. Tim knows Gemma. Veronica knows Kenneth. Luis knows Priscilla. Linda knows Eleanor. Kenneth knows Dolores. Luis knows Jay. India knows Angelica. Linda knows India. Fergus knows Charles. Which of Annette and Linda can Veronica reach?", "answer": "Linda", "steps": [ "Veronica knows Tim.", "Tim knows Gemma.", "Gemma knows Linda." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Veronica", "Tim", "Gemma", "India", "Linda", "Eleanor", "Angelica", "Kenneth", "Finn", "Dolores", "Luis", "Priscilla", "Katherine", "Fergus", "Annette", "Myrtle", "Charles", "Jay", "Cesar", "Willard" ], "edges": [ [ 0, 1 ], [ 0, 7 ], [ 1, 2 ], [ 2, 4 ], [ 3, 6 ], [ 4, 3 ], [ 4, 5 ], [ 5, 8 ], [ 7, 9 ], [ 10, 11 ], [ 10, 17 ], [ 11, 12 ], [ 12, 14 ], [ 13, 16 ], [ 14, 13 ], [ 14, 15 ], [ 15, 18 ], [ 17, 19 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Jeffery knows Keegan. John knows Dexter. Adrian knows Max. Eugenia knows John. Sarah knows Shelly. Milton knows Crystal. Crystal knows Paula. Max knows Darren. Holly knows Shaun. Keegan knows Gail. Dexter knows Milton. Gail knows Eugenia. Shaun knows Curtis. Darren knows Sarah. Shelly knows Carl. Curtis knows Adrian. Jeffery knows Chelsea. Holly knows Neal. Which of Eugenia and Adrian can Holly reach?", "answer": "Adrian", "steps": [ "Holly knows Shaun.", "Shaun knows Curtis.", "Curtis knows Adrian." ], "difficulty": 3, "original_distance": 8, "idx_to_symbol": [ "Holly", "Adrian", "Shaun", "Carl", "Max", "Shelly", "Curtis", "Darren", "Neal", "Sarah", "Jeffery", "Eugenia", "Keegan", "Paula", "John", "Crystal", "Gail", "Dexter", "Chelsea", "Milton" ], "edges": [ [ 0, 8 ], [ 0, 2 ], [ 1, 4 ], [ 2, 6 ], [ 4, 7 ], [ 5, 3 ], [ 6, 1 ], [ 7, 9 ], [ 9, 5 ], [ 10, 18 ], [ 10, 12 ], [ 11, 14 ], [ 12, 16 ], [ 14, 17 ], [ 15, 13 ], [ 16, 11 ], [ 17, 19 ], [ 19, 15 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Becky knows Cole. Jermaine knows Gwen. Cole knows Jamie. Gwen knows Jeanne. Jeanne knows Whitney. Isadora knows Alex. Irma knows Isadora. Jared knows Levi. Hector knows Darius. Becky knows Selena. Jermaine knows Irma. Alex knows Cynthia. Selena knows Hector. Jared knows Eamon. Jamie knows Jared. Whitney knows Grover. Darius knows Ellen. Whitney knows Leah. Which of Whitney and Jared can Jermaine reach?", "answer": "Whitney", "steps": [ "Jermaine knows Gwen.", "Gwen knows Jeanne.", "Jeanne knows Whitney." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Jermaine", "Gwen", "Cynthia", "Grover", "Jeanne", "Isadora", "Alex", "Whitney", "Leah", "Irma", "Becky", "Cole", "Ellen", "Eamon", "Jamie", "Hector", "Darius", "Jared", "Levi", "Selena" ], "edges": [ [ 0, 1 ], [ 0, 9 ], [ 1, 4 ], [ 4, 7 ], [ 5, 6 ], [ 6, 2 ], [ 7, 3 ], [ 7, 8 ], [ 9, 5 ], [ 10, 11 ], [ 10, 19 ], [ 11, 14 ], [ 14, 17 ], [ 15, 16 ], [ 16, 12 ], [ 17, 13 ], [ 17, 18 ], [ 19, 15 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "April knows Lynn. Lynn knows Darrell. Elmer knows Darwin. Virginia knows Khashayar. Nancy knows Charity. Virginia knows Jake. April knows Hendrix. Lynn knows Lillian. Arlene knows Deborah. Charity knows Ray. Charity knows Ember. Enrique knows Nancy. Deborah knows April. Ray knows Lois. Jake knows Enrique. Ray knows Autumn. Elmer knows Eldon. Darwin knows Arlene. Which of Darwin and Jake can Elmer reach?", "answer": "Darwin", "steps": [ "Elmer knows Darwin." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Elmer", "Deborah", "Lynn", "Arlene", "Darrell", "Lillian", "April", "Hendrix", "Eldon", "Darwin", "Virginia", "Nancy", "Ray", "Enrique", "Autumn", "Lois", "Charity", "Ember", "Khashayar", "Jake" ], "edges": [ [ 0, 8 ], [ 0, 9 ], [ 1, 6 ], [ 2, 4 ], [ 2, 5 ], [ 3, 1 ], [ 6, 2 ], [ 6, 7 ], [ 9, 3 ], [ 10, 18 ], [ 10, 19 ], [ 11, 16 ], [ 12, 14 ], [ 12, 15 ], [ 13, 11 ], [ 16, 12 ], [ 16, 17 ], [ 19, 13 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Adrian knows Sharon. Sharon knows Julie. August knows Neil. Eric knows Sebastian. Verna knows Simon. Warren knows Stephen. Khashayar knows Kate. Graham knows Clement. Simon knows Ann. Kate knows Bert. Julie knows Khashayar. Kate knows Eric. Simon knows Graham. Warren knows Harvey. Clement knows Warren. Warren knows August. Sharon knows Dee. Kate knows Mara. Which of Eric and August can Adrian reach?", "answer": "Eric", "steps": [ "Adrian knows Sharon.", "Sharon knows Julie.", "Julie knows Khashayar.", "Khashayar knows Kate.", "Kate knows Eric." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Adrian", "Bert", "Dee", "Julie", "Khashayar", "Kate", "Sebastian", "Mara", "Eric", "Sharon", "Verna", "Stephen", "Ann", "Graham", "Clement", "Warren", "Neil", "Harvey", "August", "Simon" ], "edges": [ [ 0, 9 ], [ 3, 4 ], [ 4, 5 ], [ 5, 1 ], [ 5, 7 ], [ 5, 8 ], [ 8, 6 ], [ 9, 2 ], [ 9, 3 ], [ 10, 19 ], [ 13, 14 ], [ 14, 15 ], [ 15, 11 ], [ 15, 17 ], [ 15, 18 ], [ 18, 16 ], [ 19, 12 ], [ 19, 13 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Beau knows Amber. Rosemary knows Jordan. Camille knows Kimberly. Camille knows Sharon. Faith knows Samantha. Rick knows Faith. Vera knows Jolene. Vera knows Etta. Gemma knows Effie. Etta knows Beau. Jordan knows Michelle. Rick knows Hilda. Rick knows Vera. Gemma knows Cameron. Cameron knows Tina. Cameron knows Rosemary. Faith knows Louis. Gemma knows Camille. Which of Etta and Rosemary can Rick reach?", "answer": "Etta", "steps": [ "Rick knows Vera.", "Vera knows Etta." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Rick", "Beau", "Vera", "Amber", "Louis", "Hilda", "Jolene", "Faith", "Etta", "Samantha", "Gemma", "Jordan", "Cameron", "Michelle", "Kimberly", "Effie", "Tina", "Camille", "Rosemary", "Sharon" ], "edges": [ [ 0, 5 ], [ 0, 2 ], [ 0, 7 ], [ 1, 3 ], [ 2, 6 ], [ 2, 8 ], [ 7, 4 ], [ 7, 9 ], [ 8, 1 ], [ 10, 15 ], [ 10, 12 ], [ 10, 17 ], [ 11, 13 ], [ 12, 16 ], [ 12, 18 ], [ 17, 14 ], [ 17, 19 ], [ 18, 11 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Kurt knows Lynn. Jorge knows Michael. Kelly knows Erma. Nolan knows Elizabeth. Kelly knows Shawn. Yvette knows Nolan. Kristina knows Yvette. Michael knows Paula. Lynn knows Kelly. Shawn knows Rick. Kristina knows Dominic. Brody knows Camille. Rick knows April. Lynn knows Dana. Yvette knows Jorge. Viola knows Kristina. Erma knows Brody. Elizabeth knows Ben. Which of Erma and Jorge can Viola reach?", "answer": "Jorge", "steps": [ "Viola knows Kristina.", "Kristina knows Yvette.", "Yvette knows Jorge." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Viola", "Kristina", "Elizabeth", "Nolan", "Paula", "Yvette", "Jorge", "Ben", "Dominic", "Michael", "Kurt", "Lynn", "Rick", "Shawn", "Camille", "Kelly", "Erma", "April", "Dana", "Brody" ], "edges": [ [ 0, 1 ], [ 1, 8 ], [ 1, 5 ], [ 2, 7 ], [ 3, 2 ], [ 5, 3 ], [ 5, 6 ], [ 6, 9 ], [ 9, 4 ], [ 10, 11 ], [ 11, 18 ], [ 11, 15 ], [ 12, 17 ], [ 13, 12 ], [ 15, 13 ], [ 15, 16 ], [ 16, 19 ], [ 19, 14 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Harry knows Joaquin. Boris knows Eric. Lois knows Dina. Eric knows Winifred. Hattie knows Milo. Roger knows Lark. Luna knows Boris. Lark knows Keaton. Keaton knows Zelda. Joaquin knows Vance. Milo knows Julian. Luna knows Fleur. Lois knows Roger. Luna knows Ruth. Zelda knows Hattie. Lois knows Dallas. Elaine knows Harry. Winifred knows Elaine. Which of Roger and Boris can Luna reach?", "answer": "Boris", "steps": [ "Luna knows Boris." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Luna", "Vance", "Winifred", "Fleur", "Boris", "Joaquin", "Eric", "Elaine", "Ruth", "Harry", "Lois", "Julian", "Keaton", "Dallas", "Roger", "Milo", "Lark", "Zelda", "Dina", "Hattie" ], "edges": [ [ 0, 3 ], [ 0, 8 ], [ 0, 4 ], [ 2, 7 ], [ 4, 6 ], [ 5, 1 ], [ 6, 2 ], [ 7, 9 ], [ 9, 5 ], [ 10, 13 ], [ 10, 18 ], [ 10, 14 ], [ 12, 17 ], [ 14, 16 ], [ 15, 11 ], [ 16, 12 ], [ 17, 19 ], [ 19, 15 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Ainsley knows Brody. Dean knows Anna. Fergus knows Cliff. Kelly knows Fergus. Stefan knows Dean. Archer knows Dirk. Clinton knows Kathleen. Kirk knows Ainsley. Percy knows Clinton. Brody knows Archer. Brody knows Dawn. Ramon knows Marilyn. Dirk knows Cara. Clinton knows Stefan. Miranda knows Percy. Kathleen knows Beth. Dawn knows Kelly. Beth knows Ramon. Which of Percy and Ainsley can Kirk reach?", "answer": "Ainsley", "steps": [ "Kirk knows Ainsley." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Kirk", "Archer", "Cara", "Brody", "Fergus", "Dirk", "Cliff", "Ainsley", "Kelly", "Dawn", "Miranda", "Stefan", "Anna", "Clinton", "Ramon", "Dean", "Marilyn", "Percy", "Beth", "Kathleen" ], "edges": [ [ 0, 7 ], [ 1, 5 ], [ 3, 1 ], [ 3, 9 ], [ 4, 6 ], [ 5, 2 ], [ 7, 3 ], [ 8, 4 ], [ 9, 8 ], [ 10, 17 ], [ 11, 15 ], [ 13, 11 ], [ 13, 19 ], [ 14, 16 ], [ 15, 12 ], [ 17, 13 ], [ 18, 14 ], [ 19, 18 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Clarissa knows Carol. Roger knows Tyler. Anita knows Demetrius. Aspen knows Vera. Roger knows Ira. Ron knows Destiny. Cooper knows Camden. Vera knows Carla. Tyler knows Aspen. Clarissa knows Khashayar. Carla knows Gail. Zara knows Anita. Zara knows Ron. Demetrius knows Devon. Khashayar knows Zara. Devon knows Lyric. Aspen knows Cooper. Gail knows Patrick. Which of Khashayar and Tyler can Roger reach?", "answer": "Tyler", "steps": [ "Roger knows Tyler." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Roger", "Gail", "Camden", "Ira", "Aspen", "Patrick", "Cooper", "Carla", "Tyler", "Vera", "Clarissa", "Devon", "Destiny", "Carol", "Zara", "Lyric", "Ron", "Demetrius", "Khashayar", "Anita" ], "edges": [ [ 0, 3 ], [ 0, 8 ], [ 1, 5 ], [ 4, 6 ], [ 4, 9 ], [ 6, 2 ], [ 7, 1 ], [ 8, 4 ], [ 9, 7 ], [ 10, 13 ], [ 10, 18 ], [ 11, 15 ], [ 14, 16 ], [ 14, 19 ], [ 16, 12 ], [ 17, 11 ], [ 18, 14 ], [ 19, 17 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Morris knows Brynn. Morris knows Hugh. Darin knows Kristin. Erin knows Pam. Jolena knows Cristina. Nathan knows Jolena. James knows Nathan. Brynn knows Reed. Tina knows Vincent. Nathan knows Darin. Hugh knows Ellen. Morris knows August. Natalie knows Desmond. August knows Gene. Reed knows Natalie. Kristin knows Tina. Peter knows Morris. Nathan knows Erin. Which of Morris and Nathan can James reach?", "answer": "Nathan", "steps": [ "James knows Nathan." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "James", "Cristina", "Vincent", "Jolena", "Erin", "Darin", "Tina", "Pam", "Kristin", "Nathan", "Peter", "Gene", "Desmond", "August", "Hugh", "Brynn", "Natalie", "Ellen", "Reed", "Morris" ], "edges": [ [ 0, 9 ], [ 3, 1 ], [ 4, 7 ], [ 5, 8 ], [ 6, 2 ], [ 8, 6 ], [ 9, 3 ], [ 9, 4 ], [ 9, 5 ], [ 10, 19 ], [ 13, 11 ], [ 14, 17 ], [ 15, 18 ], [ 16, 12 ], [ 18, 16 ], [ 19, 13 ], [ 19, 14 ], [ 19, 15 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Dora knows Erma. Aria knows Lane. Eden knows Fraser. Anthony knows Ron. Byron knows Eden. Davis knows Aria. Eden knows Kerry. Ron knows Molly. Kerry knows Clifford. Lane knows Jenna. Erma knows Taylor. Rod knows Ava. Molly knows Byron. Gunnar knows Dora. Ron knows Harley. Archie knows Anthony. Lane knows Gunnar. Erma knows Rod. Which of Erma and Eden can Archie reach?", "answer": "Eden", "steps": [ "Archie knows Anthony.", "Anthony knows Ron.", "Ron knows Molly.", "Molly knows Byron.", "Byron knows Eden." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Archie", "Kerry", "Harley", "Byron", "Anthony", "Ron", "Molly", "Fraser", "Clifford", "Eden", "Davis", "Rod", "Jenna", "Dora", "Aria", "Lane", "Gunnar", "Taylor", "Ava", "Erma" ], "edges": [ [ 0, 4 ], [ 1, 8 ], [ 3, 9 ], [ 4, 5 ], [ 5, 2 ], [ 5, 6 ], [ 6, 3 ], [ 9, 7 ], [ 9, 1 ], [ 10, 14 ], [ 11, 18 ], [ 13, 19 ], [ 14, 15 ], [ 15, 12 ], [ 15, 16 ], [ 16, 13 ], [ 19, 17 ], [ 19, 11 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Fern knows Darla. Greta knows Virgil. Ann knows Leroy. Keaton knows Barry. Greta knows Ann. Ann knows Eamon. Leroy knows Jose. Eli knows Kate. Edison knows Harper. Lars knows Fern. Harper knows Roland. Kate knows Edison. Ann knows Justin. Keaton knows Eli. Eli knows Daphne. Justin knows Lars. Daphne knows Taylor. Eli knows Reed. Which of Roland and Darla can Greta reach?", "answer": "Darla", "steps": [ "Greta knows Ann.", "Ann knows Justin.", "Justin knows Lars.", "Lars knows Fern.", "Fern knows Darla." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Greta", "Lars", "Ann", "Virgil", "Jose", "Eamon", "Leroy", "Justin", "Fern", "Darla", "Keaton", "Edison", "Eli", "Barry", "Taylor", "Reed", "Daphne", "Kate", "Harper", "Roland" ], "edges": [ [ 0, 3 ], [ 0, 2 ], [ 1, 8 ], [ 2, 5 ], [ 2, 6 ], [ 2, 7 ], [ 6, 4 ], [ 7, 1 ], [ 8, 9 ], [ 10, 13 ], [ 10, 12 ], [ 11, 18 ], [ 12, 15 ], [ 12, 16 ], [ 12, 17 ], [ 16, 14 ], [ 17, 11 ], [ 18, 19 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Brittany knows Louis. Kim knows Raymond. Noel knows Douglas. Goldie knows Atlas. Raymond knows Austin. Mary knows Tara. Yuki knows Mary. Donovan knows Yuki. Louis knows Lyle. Damian knows Autumn. Douglas knows Goldie. Gregory knows Kim. Autumn knows Gregory. Tamara knows Brittany. Mary knows Tamara. Gregory knows Noel. Nadine knows Nicole. Tara knows Nadine. Which of Gregory and Mary can Damian reach?", "answer": "Gregory", "steps": [ "Damian knows Autumn.", "Autumn knows Gregory." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Damian", "Kim", "Douglas", "Autumn", "Austin", "Gregory", "Atlas", "Raymond", "Goldie", "Noel", "Donovan", "Tara", "Brittany", "Yuki", "Nicole", "Mary", "Lyle", "Nadine", "Louis", "Tamara" ], "edges": [ [ 0, 3 ], [ 1, 7 ], [ 2, 8 ], [ 3, 5 ], [ 5, 1 ], [ 5, 9 ], [ 7, 4 ], [ 8, 6 ], [ 9, 2 ], [ 10, 13 ], [ 11, 17 ], [ 12, 18 ], [ 13, 15 ], [ 15, 11 ], [ 15, 19 ], [ 17, 14 ], [ 18, 16 ], [ 19, 12 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Fisher knows Val. Bernice knows Yasmin. Jared knows Keith. Terry knows Ford. Kaleb knows Fisher. Rebecca knows Elvira. Maya knows Natalie. Maya knows Javier. Elvira knows Celeste. Javier knows Kaleb. Celeste knows Bernice. Ford knows Jared. Val knows Latoya. Celeste knows Allan. Julia knows Blaine. Javier knows Everett. Blaine knows Maya. Bernice knows Terry. Which of Maya and Celeste can Julia reach?", "answer": "Maya", "steps": [ "Julia knows Blaine.", "Blaine knows Maya." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Julia", "Latoya", "Fisher", "Javier", "Natalie", "Everett", "Blaine", "Val", "Maya", "Kaleb", "Rebecca", "Keith", "Ford", "Bernice", "Allan", "Yasmin", "Elvira", "Jared", "Celeste", "Terry" ], "edges": [ [ 0, 6 ], [ 2, 7 ], [ 3, 5 ], [ 3, 9 ], [ 6, 8 ], [ 7, 1 ], [ 8, 4 ], [ 8, 3 ], [ 9, 2 ], [ 10, 16 ], [ 12, 17 ], [ 13, 15 ], [ 13, 19 ], [ 16, 18 ], [ 17, 11 ], [ 18, 14 ], [ 18, 13 ], [ 19, 12 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Carla knows Cassidy. Colette knows Wade. Leroy knows Delilah. Barbara knows Leroy. Carla knows Teresa. Ernesto knows Barbara. Emanuel knows Edward. Teresa knows Dakota. Greg knows Carla. Ernesto knows Harlan. Denise knows Martin. Terry knows Denise. Martin knows Colette. Edward knows Greg. Dakota knows Andre. Greg knows Jules. Jules knows Dora. Martin knows Ernesto. Which of Leroy and Dakota can Emanuel reach?", "answer": "Dakota", "steps": [ "Emanuel knows Edward.", "Edward knows Greg.", "Greg knows Carla.", "Carla knows Teresa.", "Teresa knows Dakota." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Emanuel", "Andre", "Dora", "Greg", "Dakota", "Jules", "Carla", "Teresa", "Cassidy", "Edward", "Terry", "Delilah", "Wade", "Martin", "Leroy", "Colette", "Ernesto", "Barbara", "Harlan", "Denise" ], "edges": [ [ 0, 9 ], [ 3, 5 ], [ 3, 6 ], [ 4, 1 ], [ 5, 2 ], [ 6, 7 ], [ 6, 8 ], [ 7, 4 ], [ 9, 3 ], [ 10, 19 ], [ 13, 15 ], [ 13, 16 ], [ 14, 11 ], [ 15, 12 ], [ 16, 17 ], [ 16, 18 ], [ 17, 14 ], [ 19, 13 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Joan knows Donald. Emery knows Neil. Will knows Norman. Will knows Sierra. Donald knows Paige. Milo knows Etta. Jasper knows Leland. Donald knows Emery. Jasper knows Martha. Jude knows Gina. Martha knows Milo. Emery knows Elliot. Elliot knows Sonia. Martha knows Pam. Sierra knows Jasper. Kristin knows Jude. Jude knows Joan. Ignacio knows Will. Which of Jasper and Donald can Kristin reach?", "answer": "Donald", "steps": [ "Kristin knows Jude.", "Jude knows Joan.", "Joan knows Donald." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Kristin", "Gina", "Sonia", "Emery", "Elliot", "Joan", "Jude", "Donald", "Neil", "Paige", "Ignacio", "Norman", "Etta", "Martha", "Milo", "Sierra", "Will", "Jasper", "Pam", "Leland" ], "edges": [ [ 0, 6 ], [ 3, 4 ], [ 3, 8 ], [ 4, 2 ], [ 5, 7 ], [ 6, 1 ], [ 6, 5 ], [ 7, 3 ], [ 7, 9 ], [ 10, 16 ], [ 13, 14 ], [ 13, 18 ], [ 14, 12 ], [ 15, 17 ], [ 16, 11 ], [ 16, 15 ], [ 17, 13 ], [ 17, 19 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Heath knows Aaron. Kristin knows Arden. Pablo knows Beau. Sierra knows Gonzalo. Bailey knows Gilbert. Gilbert knows Judy. Gonzalo knows Heath. Beau knows Bailey. Jessie knows Kristin. Melody knows Peggy. Peggy knows Lois. Beau knows Ernesto. Kristin knows Cornelius. Aaron knows Declan. Sierra knows Stella. Gilbert knows Cara. Cara knows Melody. Arden knows Sierra. Which of Melody and Heath can Jessie reach?", "answer": "Heath", "steps": [ "Jessie knows Kristin.", "Kristin knows Arden.", "Arden knows Sierra.", "Sierra knows Gonzalo.", "Gonzalo knows Heath." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Jessie", "Cornelius", "Aaron", "Heath", "Gonzalo", "Stella", "Arden", "Kristin", "Sierra", "Declan", "Pablo", "Ernesto", "Peggy", "Melody", "Cara", "Judy", "Bailey", "Beau", "Gilbert", "Lois" ], "edges": [ [ 0, 7 ], [ 2, 9 ], [ 3, 2 ], [ 4, 3 ], [ 6, 8 ], [ 7, 1 ], [ 7, 6 ], [ 8, 5 ], [ 8, 4 ], [ 10, 17 ], [ 12, 19 ], [ 13, 12 ], [ 14, 13 ], [ 16, 18 ], [ 17, 11 ], [ 17, 16 ], [ 18, 15 ], [ 18, 14 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Jade knows Mara. Garrett knows Logan. Larry knows Desmond. Mara knows Roy. Marie knows Kira. Keegan knows Gail. Keegan knows Hunter. Laverne knows Keegan. Gail knows Neal. Jeffery knows Annie. Hattie knows Marie. Jeffery knows Larry. Drew knows Laverne. Logan knows Susanne. Drew knows Garrett. Marie knows Jade. Kira knows Jeffery. Sharon knows Drew. Which of Desmond and Neal can Sharon reach?", "answer": "Neal", "steps": [ "Sharon knows Drew.", "Drew knows Laverne.", "Laverne knows Keegan.", "Keegan knows Gail.", "Gail knows Neal." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Sharon", "Drew", "Laverne", "Hunter", "Gail", "Neal", "Garrett", "Keegan", "Susanne", "Logan", "Hattie", "Marie", "Kira", "Annie", "Larry", "Desmond", "Jade", "Jeffery", "Roy", "Mara" ], "edges": [ [ 0, 1 ], [ 1, 2 ], [ 1, 6 ], [ 2, 7 ], [ 4, 5 ], [ 6, 9 ], [ 7, 3 ], [ 7, 4 ], [ 9, 8 ], [ 10, 11 ], [ 11, 12 ], [ 11, 16 ], [ 12, 17 ], [ 14, 15 ], [ 16, 19 ], [ 17, 13 ], [ 17, 14 ], [ 19, 18 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "June knows Hattie. Rita knows Daria. Jeanette knows Perry. Beverly knows Jeanette. Rita knows Langston. Alejandro knows Lyle. Susan knows June. Hattie knows Saul. Milo knows Hilda. Verna knows Luz. Alejandro knows Shelly. Lars knows Alejandro. Perry knows Rita. Hilda knows Beverly. Alejandro knows Verna. Emily knows Owen. Saul knows Lars. Rita knows Emily. Which of Perry and Lars can Susan reach?", "answer": "Lars", "steps": [ "Susan knows June.", "June knows Hattie.", "Hattie knows Saul.", "Saul knows Lars." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Susan", "Hattie", "Luz", "Alejandro", "Lars", "Shelly", "Lyle", "Verna", "Saul", "June", "Milo", "Beverly", "Owen", "Rita", "Perry", "Daria", "Langston", "Emily", "Jeanette", "Hilda" ], "edges": [ [ 0, 9 ], [ 1, 8 ], [ 3, 5 ], [ 3, 6 ], [ 3, 7 ], [ 4, 3 ], [ 7, 2 ], [ 8, 4 ], [ 9, 1 ], [ 10, 19 ], [ 11, 18 ], [ 13, 15 ], [ 13, 16 ], [ 13, 17 ], [ 14, 13 ], [ 17, 12 ], [ 18, 14 ], [ 19, 11 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Hannah knows Kendrick. Melody knows Pat. Hannah knows Malcolm. Gavin knows Lionel. Lionel knows Lyle. Gavin knows Yuki. Enid knows Jack. Gavin knows Hayes. Hannah knows Adele. Stephanie knows Ivan. Kendrick knows Tanya. Enid knows Hannah. Ashton knows Edward. Melody knows Magdalena. Stephanie knows Ashton. Ashton knows Christopher. Stephanie knows Gavin. Enid knows Melody. Which of Lionel and Kendrick can Stephanie reach?", "answer": "Lionel", "steps": [ "Stephanie knows Gavin.", "Gavin knows Lionel." ], "difficulty": 2, "original_distance": 3, "idx_to_symbol": [ "Stephanie", "Ashton", "Lionel", "Gavin", "Lyle", "Yuki", "Christopher", "Ivan", "Hayes", "Edward", "Enid", "Melody", "Kendrick", "Hannah", "Tanya", "Malcolm", "Pat", "Jack", "Adele", "Magdalena" ], "edges": [ [ 0, 7 ], [ 0, 3 ], [ 0, 1 ], [ 1, 6 ], [ 1, 9 ], [ 2, 4 ], [ 3, 2 ], [ 3, 5 ], [ 3, 8 ], [ 10, 17 ], [ 10, 13 ], [ 10, 11 ], [ 11, 16 ], [ 11, 19 ], [ 12, 14 ], [ 13, 12 ], [ 13, 15 ], [ 13, 18 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Jack knows Gavin. Davis knows Allan. Darrell knows Anthony. Jack knows Whitney. Dora knows Lynn. Federico knows Ignacio. Federico knows Demetrius. Anthony knows Martha. Jack knows Jaime. Dora knows Renee. Virginia knows Jack. Anthony knows Jonah. Whitney knows Dora. Faye knows Jean. Allan knows Virginia. Anthony knows Clement. Jean knows Darrell. Martha knows Federico. Which of Dora and Federico can Faye reach?", "answer": "Federico", "steps": [ "Faye knows Jean.", "Jean knows Darrell.", "Darrell knows Anthony.", "Anthony knows Martha.", "Martha knows Federico." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Faye", "Jonah", "Jean", "Martha", "Darrell", "Clement", "Federico", "Ignacio", "Anthony", "Demetrius", "Davis", "Gavin", "Allan", "Whitney", "Virginia", "Jaime", "Dora", "Lynn", "Jack", "Renee" ], "edges": [ [ 0, 2 ], [ 2, 4 ], [ 3, 6 ], [ 4, 8 ], [ 6, 7 ], [ 6, 9 ], [ 8, 1 ], [ 8, 5 ], [ 8, 3 ], [ 10, 12 ], [ 12, 14 ], [ 13, 16 ], [ 14, 18 ], [ 16, 17 ], [ 16, 19 ], [ 18, 11 ], [ 18, 15 ], [ 18, 13 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Wilson knows Neal. Renee knows Matthew. Morgan knows Isabel. Isabel knows Bonnie. Neal knows Camille. Diane knows Renee. Isabel knows Hugo. Renee knows Chad. Gabriel knows Diane. Neal knows Owen. Isabel knows Tara. Morgan knows Zara. Desmond knows Louise. Tara knows Wilson. Desmond knows Keegan. John knows Desmond. Desmond knows Gabriel. John knows Brynn. Which of Gabriel and Tara can Morgan reach?", "answer": "Tara", "steps": [ "Morgan knows Isabel.", "Isabel knows Tara." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Morgan", "Hugo", "Camille", "Bonnie", "Wilson", "Owen", "Isabel", "Neal", "Zara", "Tara", "John", "Louise", "Matthew", "Keegan", "Diane", "Chad", "Desmond", "Renee", "Brynn", "Gabriel" ], "edges": [ [ 0, 8 ], [ 0, 6 ], [ 4, 7 ], [ 6, 1 ], [ 6, 3 ], [ 6, 9 ], [ 7, 2 ], [ 7, 5 ], [ 9, 4 ], [ 10, 18 ], [ 10, 16 ], [ 14, 17 ], [ 16, 11 ], [ 16, 13 ], [ 16, 19 ], [ 17, 12 ], [ 17, 15 ], [ 19, 14 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Miriam knows Sally. Fisher knows Paige. Wilma knows Mildred. Miriam knows Barbara. Federico knows Alicia. Rosemary knows Willis. Earl knows Jennifer. Jennifer knows Avery. Lorna knows Rosemary. Wilma knows Patrick. Miriam knows Drake. Mildred knows Louis. Barbara knows Natalie. Conner knows Federico. Alicia knows Lorna. Paige knows Earl. Sally knows Fisher. Wilma knows Conner. Which of Conner and Sally can Wilma reach?", "answer": "Conner", "steps": [ "Wilma knows Conner." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Wilma", "Rosemary", "Willis", "Mildred", "Lorna", "Patrick", "Louis", "Federico", "Alicia", "Conner", "Miriam", "Jennifer", "Avery", "Barbara", "Earl", "Drake", "Natalie", "Fisher", "Paige", "Sally" ], "edges": [ [ 0, 5 ], [ 0, 3 ], [ 0, 9 ], [ 1, 2 ], [ 3, 6 ], [ 4, 1 ], [ 7, 8 ], [ 8, 4 ], [ 9, 7 ], [ 10, 15 ], [ 10, 13 ], [ 10, 19 ], [ 11, 12 ], [ 13, 16 ], [ 14, 11 ], [ 17, 18 ], [ 18, 14 ], [ 19, 17 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Cody knows Alyssa. Veronica knows Marie. Julio knows Eugene. Randall knows Julio. Calvin knows Jennifer. Eugene knows Cody. Julio knows Chloe. Shane knows Daniella. Shane knows Herman. Jennifer knows Lionel. Jeffery knows Giselle. Herman knows Dwight. Marie knows Calvin. Estelle knows Veronica. Calvin knows Verna. Ross knows Jeffery. Chloe knows Shane. Veronica knows Ross. Which of Calvin and Shane can Randall reach?", "answer": "Shane", "steps": [ "Randall knows Julio.", "Julio knows Chloe.", "Chloe knows Shane." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Randall", "Daniella", "Dwight", "Herman", "Chloe", "Alyssa", "Julio", "Cody", "Eugene", "Shane", "Estelle", "Verna", "Lionel", "Jennifer", "Marie", "Giselle", "Veronica", "Jeffery", "Ross", "Calvin" ], "edges": [ [ 0, 6 ], [ 3, 2 ], [ 4, 9 ], [ 6, 8 ], [ 6, 4 ], [ 7, 5 ], [ 8, 7 ], [ 9, 1 ], [ 9, 3 ], [ 10, 16 ], [ 13, 12 ], [ 14, 19 ], [ 16, 18 ], [ 16, 14 ], [ 17, 15 ], [ 18, 17 ], [ 19, 11 ], [ 19, 13 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Asher knows Ramon. Aspen knows Ted. Raquel knows Kirk. Theodore knows Dudley. Dudley knows Raquel. Dexter knows Madeline. Dexter knows Camden. Asher knows Dexter. Ainsley knows Tara. Ted knows Adele. Gina knows Cordelia. Cordelia knows Ainsley. Wallace knows Aspen. Raquel knows Alyssa. Ramon knows Gina. August knows Wallace. Dudley knows August. Hubert knows Asher. Which of Dudley and Asher can Theodore reach?", "answer": "Dudley", "steps": [ "Theodore knows Dudley." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Theodore", "Wallace", "Aspen", "Ted", "Dudley", "Adele", "Raquel", "Kirk", "August", "Alyssa", "Hubert", "Gina", "Cordelia", "Ainsley", "Asher", "Tara", "Dexter", "Madeline", "Ramon", "Camden" ], "edges": [ [ 0, 4 ], [ 1, 2 ], [ 2, 3 ], [ 3, 5 ], [ 4, 8 ], [ 4, 6 ], [ 6, 7 ], [ 6, 9 ], [ 8, 1 ], [ 10, 14 ], [ 11, 12 ], [ 12, 13 ], [ 13, 15 ], [ 14, 18 ], [ 14, 16 ], [ 16, 17 ], [ 16, 19 ], [ 18, 11 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Duncan knows Jeffery. Jacques knows Gideon. Aldo knows Zach. Keira knows Colin. Neil knows Wesley. Jacques knows Aldo. Kit knows Jacques. Zach knows Warren. Madeline knows Paul. Gideon knows Brooks. Matt knows Dakota. Madeline knows Matt. Kit knows Neil. Paul knows Sebastian. Sebastian knows Ellis. Aldo knows Shelly. Sebastian knows Keira. Paul knows Duncan. Which of Jacques and Paul can Madeline reach?", "answer": "Paul", "steps": [ "Madeline knows Paul." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Madeline", "Colin", "Paul", "Matt", "Ellis", "Sebastian", "Keira", "Duncan", "Jeffery", "Dakota", "Kit", "Warren", "Jacques", "Neil", "Shelly", "Aldo", "Zach", "Gideon", "Brooks", "Wesley" ], "edges": [ [ 0, 2 ], [ 0, 3 ], [ 2, 5 ], [ 2, 7 ], [ 3, 9 ], [ 5, 4 ], [ 5, 6 ], [ 6, 1 ], [ 7, 8 ], [ 10, 12 ], [ 10, 13 ], [ 12, 15 ], [ 12, 17 ], [ 13, 19 ], [ 15, 14 ], [ 15, 16 ], [ 16, 11 ], [ 17, 18 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Sheila knows Irma. Trina knows Erica. Richard knows Isla. Trina knows Diane. Jacqueline knows Nash. Jacqueline knows Will. Erica knows Fergus. Fergus knows Preston. Emma knows Bonnie. Fergus knows Clarissa. Jacqueline knows Wanda. Erica knows Sheila. Wanda knows Kaleb. Richard knows Emma. Wanda knows Richard. Trina knows Marian. Kaleb knows Terry. Clarissa knows Hugo. Which of Clarissa and Emma can Trina reach?", "answer": "Clarissa", "steps": [ "Trina knows Erica.", "Erica knows Fergus.", "Fergus knows Clarissa." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Trina", "Preston", "Sheila", "Marian", "Clarissa", "Diane", "Irma", "Hugo", "Erica", "Fergus", "Jacqueline", "Isla", "Kaleb", "Will", "Emma", "Nash", "Terry", "Bonnie", "Wanda", "Richard" ], "edges": [ [ 0, 3 ], [ 0, 5 ], [ 0, 8 ], [ 2, 6 ], [ 4, 7 ], [ 8, 2 ], [ 8, 9 ], [ 9, 1 ], [ 9, 4 ], [ 10, 13 ], [ 10, 15 ], [ 10, 18 ], [ 12, 16 ], [ 14, 17 ], [ 18, 12 ], [ 18, 19 ], [ 19, 11 ], [ 19, 14 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Wilbur knows Xavier. Landon knows Wilbur. Holly knows Vanessa. Abigail knows Arden. Arden knows Edison. Vanessa knows Leonard. Lyle knows Devin. Abigail knows Holly. Beatrice knows Theodore. Lennox knows Conrad. Rowan knows Abigail. Theodore knows Landon. Theodore knows Lennox. Colin knows Ryan. Edison knows Luz. Conrad knows Louis. Devin knows Rowan. Ryan knows Beatrice. Which of Holly and Landon can Colin reach?", "answer": "Landon", "steps": [ "Colin knows Ryan.", "Ryan knows Beatrice.", "Beatrice knows Theodore.", "Theodore knows Landon." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Colin", "Landon", "Conrad", "Louis", "Theodore", "Beatrice", "Wilbur", "Xavier", "Lennox", "Ryan", "Lyle", "Holly", "Edison", "Luz", "Abigail", "Rowan", "Vanessa", "Leonard", "Arden", "Devin" ], "edges": [ [ 0, 9 ], [ 1, 6 ], [ 2, 3 ], [ 4, 1 ], [ 4, 8 ], [ 5, 4 ], [ 6, 7 ], [ 8, 2 ], [ 9, 5 ], [ 10, 19 ], [ 11, 16 ], [ 12, 13 ], [ 14, 11 ], [ 14, 18 ], [ 15, 14 ], [ 16, 17 ], [ 18, 12 ], [ 19, 15 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Kendrick knows Knox. Iris knows Clark. Clark knows Perry. Dewey knows Monica. Jeff knows Brenda. Clark knows Jeff. Anthony knows Francesca. Heidi knows Anthony. Sybil knows Jon. Heidi knows Clayton. Josie knows Kendrick. Dewey knows Chantal. Clark knows Heidi. Alicia knows Iris. Andre knows Josie. Kendrick knows Dewey. Kendrick knows Sybil. Monica knows Blair. Which of Anthony and Monica can Andre reach?", "answer": "Monica", "steps": [ "Andre knows Josie.", "Josie knows Kendrick.", "Kendrick knows Dewey.", "Dewey knows Monica." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Andre", "Chantal", "Knox", "Sybil", "Monica", "Josie", "Blair", "Jon", "Dewey", "Kendrick", "Alicia", "Clayton", "Perry", "Jeff", "Anthony", "Iris", "Francesca", "Brenda", "Heidi", "Clark" ], "edges": [ [ 0, 5 ], [ 3, 7 ], [ 4, 6 ], [ 5, 9 ], [ 8, 1 ], [ 8, 4 ], [ 9, 2 ], [ 9, 3 ], [ 9, 8 ], [ 10, 15 ], [ 13, 17 ], [ 14, 16 ], [ 15, 19 ], [ 18, 11 ], [ 18, 14 ], [ 19, 12 ], [ 19, 13 ], [ 19, 18 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Chantal knows Curtis. Vivian knows James. Sydney knows Don. Don knows Benjamin. Lars knows Sydney. Calvin knows Heidi. Wanda knows Enid. Clinton knows Bruno. Clarissa knows Violet. Kenzie knows Calvin. Violet knows Wanda. Benjamin knows Kenzie. Marcia knows Clarissa. James knows Marcia. Benjamin knows Kent. Bruno knows Vivian. Curtis knows Lars. Clarissa knows Destiny. Which of Curtis and Bruno can Chantal reach?", "answer": "Curtis", "steps": [ "Chantal knows Curtis." ], "difficulty": 1, "original_distance": 8, "idx_to_symbol": [ "Chantal", "Curtis", "Don", "Kent", "Lars", "Benjamin", "Kenzie", "Sydney", "Calvin", "Heidi", "Clinton", "Bruno", "Marcia", "Destiny", "Vivian", "Clarissa", "Violet", "James", "Wanda", "Enid" ], "edges": [ [ 0, 1 ], [ 1, 4 ], [ 2, 5 ], [ 4, 7 ], [ 5, 3 ], [ 5, 6 ], [ 6, 8 ], [ 7, 2 ], [ 8, 9 ], [ 10, 11 ], [ 11, 14 ], [ 12, 15 ], [ 14, 17 ], [ 15, 13 ], [ 15, 16 ], [ 16, 18 ], [ 17, 12 ], [ 18, 19 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Paul knows Delia. Edith knows Abigail. Oscar knows Rena. Edith knows Blake. Crystal knows Chandler. Blake knows Bernard. Janice knows Daria. Norman knows Esperanza. Langston knows Edith. Rena knows Greg. Oscar knows Lynn. Paul knows Oscar. Delia knows Crystal. Daria knows Langston. Sue knows Veronica. Jonah knows Norman. Veronica knows Paul. Langston knows Jonah. Which of Daria and Veronica can Sue reach?", "answer": "Veronica", "steps": [ "Sue knows Veronica." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Sue", "Paul", "Veronica", "Chandler", "Lynn", "Oscar", "Rena", "Greg", "Delia", "Crystal", "Janice", "Langston", "Daria", "Esperanza", "Abigail", "Edith", "Blake", "Bernard", "Jonah", "Norman" ], "edges": [ [ 0, 2 ], [ 1, 5 ], [ 1, 8 ], [ 2, 1 ], [ 5, 4 ], [ 5, 6 ], [ 6, 7 ], [ 8, 9 ], [ 9, 3 ], [ 10, 12 ], [ 11, 15 ], [ 11, 18 ], [ 12, 11 ], [ 15, 14 ], [ 15, 16 ], [ 16, 17 ], [ 18, 19 ], [ 19, 13 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Christian knows Sandra. Glenda knows Joseph. Uma knows Christopher. Nancy knows Joaquin. Bennett knows Glenda. Joseph knows Gary. Joaquin knows Ariana. Susan knows Emmett. Uma knows Boyd. Susan knows Clifford. Harmony knows Herbert. Emmett knows Garrett. Emmett knows Bennett. Karen knows Nancy. Karen knows Harmony. Boyd knows Olive. Boyd knows Karen. Bennett knows Christian. Which of Gary and Ariana can Uma reach?", "answer": "Ariana", "steps": [ "Uma knows Boyd.", "Boyd knows Karen.", "Karen knows Nancy.", "Nancy knows Joaquin.", "Joaquin knows Ariana." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Uma", "Harmony", "Olive", "Nancy", "Christopher", "Boyd", "Karen", "Joaquin", "Ariana", "Herbert", "Susan", "Christian", "Garrett", "Glenda", "Clifford", "Emmett", "Bennett", "Joseph", "Gary", "Sandra" ], "edges": [ [ 0, 4 ], [ 0, 5 ], [ 1, 9 ], [ 3, 7 ], [ 5, 2 ], [ 5, 6 ], [ 6, 3 ], [ 6, 1 ], [ 7, 8 ], [ 10, 14 ], [ 10, 15 ], [ 11, 19 ], [ 13, 17 ], [ 15, 12 ], [ 15, 16 ], [ 16, 13 ], [ 16, 11 ], [ 17, 18 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Yvette knows Glen. Glen knows Jacques. Elena knows Gladys. Jacques knows Edgar. Brittany knows Heather. Ruth knows Yvette. Elena knows Zoe. Helen knows Kennedy. Helen knows Joshua. Alice knows Merle. Wilma knows Cate. Victoria knows Elena. Ruth knows Darius. Elena knows Brittany. Zoe knows Leo. Jacques knows Alice. Jacques knows Wilma. Joshua knows Victoria. Which of Alice and Zoe can Helen reach?", "answer": "Zoe", "steps": [ "Helen knows Joshua.", "Joshua knows Victoria.", "Victoria knows Elena.", "Elena knows Zoe." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Helen", "Elena", "Gladys", "Victoria", "Kennedy", "Leo", "Heather", "Joshua", "Zoe", "Brittany", "Ruth", "Jacques", "Edgar", "Glen", "Darius", "Merle", "Cate", "Yvette", "Alice", "Wilma" ], "edges": [ [ 0, 4 ], [ 0, 7 ], [ 1, 2 ], [ 1, 8 ], [ 1, 9 ], [ 3, 1 ], [ 7, 3 ], [ 8, 5 ], [ 9, 6 ], [ 10, 14 ], [ 10, 17 ], [ 11, 12 ], [ 11, 18 ], [ 11, 19 ], [ 13, 11 ], [ 17, 13 ], [ 18, 15 ], [ 19, 16 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Lee knows Beau. Tabitha knows Verna. Randall knows Lawrence. Randall knows Vance. Beau knows Hannah. Noel knows Randall. Aspen knows Tabitha. Tabitha knows Noel. Lawrence knows Lisa. Essie knows Hugo. Hilda knows Lee. Hilda knows Warren. Lee knows Essie. Essie knows Arthur. Noel knows Allen. Arthur knows Stephen. Ronald knows Hilda. Allen knows Troy. Which of Hilda and Tabitha can Aspen reach?", "answer": "Tabitha", "steps": [ "Aspen knows Tabitha." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Aspen", "Randall", "Tabitha", "Lawrence", "Verna", "Lisa", "Noel", "Troy", "Allen", "Vance", "Ronald", "Essie", "Hilda", "Arthur", "Warren", "Stephen", "Lee", "Hannah", "Beau", "Hugo" ], "edges": [ [ 0, 2 ], [ 1, 3 ], [ 1, 9 ], [ 2, 4 ], [ 2, 6 ], [ 3, 5 ], [ 6, 8 ], [ 6, 1 ], [ 8, 7 ], [ 10, 12 ], [ 11, 13 ], [ 11, 19 ], [ 12, 14 ], [ 12, 16 ], [ 13, 15 ], [ 16, 18 ], [ 16, 11 ], [ 18, 17 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Edward knows Edmund. Kane knows Cameron. Kelsey knows Rose. Rena knows Leigh. Luther knows Jake. Luther knows Ron. Leigh knows Maya. Jared knows Linda. Maya knows Axel. Rena knows Tara. Leigh knows Dakota. Jake knows Kelsey. Edmund knows Luther. Ingrid knows Rena. Jake knows Greg. Jake knows Kane. Leigh knows Jared. Jerome knows Ingrid. Which of Kelsey and Jared can Edward reach?", "answer": "Kelsey", "steps": [ "Edward knows Edmund.", "Edmund knows Luther.", "Luther knows Jake.", "Jake knows Kelsey." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Edward", "Edmund", "Cameron", "Kelsey", "Rose", "Jake", "Kane", "Greg", "Ron", "Luther", "Jerome", "Ingrid", "Axel", "Jared", "Linda", "Leigh", "Maya", "Dakota", "Tara", "Rena" ], "edges": [ [ 0, 1 ], [ 1, 9 ], [ 3, 4 ], [ 5, 3 ], [ 5, 6 ], [ 5, 7 ], [ 6, 2 ], [ 9, 5 ], [ 9, 8 ], [ 10, 11 ], [ 11, 19 ], [ 13, 14 ], [ 15, 13 ], [ 15, 16 ], [ 15, 17 ], [ 16, 12 ], [ 19, 15 ], [ 19, 18 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Cora knows Alder. James knows Noel. Carol knows Gonzalo. Donovan knows Cora. Gonzalo knows Tristan. Ian knows Asher. Donovan knows Phoebe. Fritz knows Dakota. Philip knows Ian. Philip knows Ernesto. Philip knows Angela. Noel knows Glenda. Asher knows Xavier. Ian knows Demetrius. Carol knows Donovan. Cora knows Fritz. James knows Philip. Donovan knows Adam. Which of Dakota and Xavier can James reach?", "answer": "Xavier", "steps": [ "James knows Philip.", "Philip knows Ian.", "Ian knows Asher.", "Asher knows Xavier." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "James", "Ian", "Noel", "Asher", "Ernesto", "Demetrius", "Philip", "Angela", "Glenda", "Xavier", "Carol", "Cora", "Gonzalo", "Fritz", "Phoebe", "Alder", "Donovan", "Adam", "Tristan", "Dakota" ], "edges": [ [ 0, 2 ], [ 0, 6 ], [ 1, 5 ], [ 1, 3 ], [ 2, 8 ], [ 3, 9 ], [ 6, 4 ], [ 6, 7 ], [ 6, 1 ], [ 10, 12 ], [ 10, 16 ], [ 11, 15 ], [ 11, 13 ], [ 12, 18 ], [ 13, 19 ], [ 16, 14 ], [ 16, 17 ], [ 16, 11 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Kay knows Neal. Calvin knows Olive. Gunnar knows Eunice. Burt knows Hunter. Amelia knows Lana. Gunnar knows Russell. Frank knows Gabriel. Russell knows Drew. Burt knows Wilma. Hunter knows Hailey. Drew knows Calvin. Amelia knows Ingrid. Gabriel knows Melody. Ingrid knows Frank. Hunter knows Gunnar. Cassidy knows Bart. Kay knows Amelia. Cassidy knows Kay. Which of Hunter and Kay can Cassidy reach?", "answer": "Kay", "steps": [ "Cassidy knows Kay." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Cassidy", "Gabriel", "Kay", "Frank", "Bart", "Melody", "Ingrid", "Neal", "Amelia", "Lana", "Burt", "Calvin", "Hunter", "Drew", "Wilma", "Olive", "Russell", "Hailey", "Gunnar", "Eunice" ], "edges": [ [ 0, 4 ], [ 0, 2 ], [ 1, 5 ], [ 2, 7 ], [ 2, 8 ], [ 3, 1 ], [ 6, 3 ], [ 8, 6 ], [ 8, 9 ], [ 10, 14 ], [ 10, 12 ], [ 11, 15 ], [ 12, 17 ], [ 12, 18 ], [ 13, 11 ], [ 16, 13 ], [ 18, 16 ], [ 18, 19 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Pierce knows Graham. Louisa knows Victor. Kim knows Sheila. Victor knows Lewis. Tina knows Ford. Lennox knows Jenna. Gabriel knows Carla. Jem knows Marco. Carla knows Merle. Ford knows Edmund. Hudson knows Kim. Pierce knows Tina. Carla knows Judith. Victor knows Hudson. Marco knows Lennox. Kim knows Jem. Merle knows Pierce. Edmund knows Leigh. Which of Ford and Marco can Gabriel reach?", "answer": "Ford", "steps": [ "Gabriel knows Carla.", "Carla knows Merle.", "Merle knows Pierce.", "Pierce knows Tina.", "Tina knows Ford." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Gabriel", "Graham", "Edmund", "Tina", "Pierce", "Carla", "Ford", "Merle", "Leigh", "Judith", "Louisa", "Sheila", "Lennox", "Jem", "Kim", "Victor", "Marco", "Hudson", "Jenna", "Lewis" ], "edges": [ [ 0, 5 ], [ 2, 8 ], [ 3, 6 ], [ 4, 1 ], [ 4, 3 ], [ 5, 7 ], [ 5, 9 ], [ 6, 2 ], [ 7, 4 ], [ 10, 15 ], [ 12, 18 ], [ 13, 16 ], [ 14, 11 ], [ 14, 13 ], [ 15, 17 ], [ 15, 19 ], [ 16, 12 ], [ 17, 14 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Hugh knows Archer. Archer knows Yuki. Harriet knows Dexter. Harriet knows Don. Blake knows Bennett. Troy knows Stella. Bennett knows Harriet. Brock knows Hazel. Khashayar knows Blake. Bennett knows Troy. Vernon knows Beverly. Yuki knows Brock. Delilah knows Samuel. Patrick knows Kate. Dexter knows Patrick. Vernon knows Charles. Yuki knows Vernon. Beverly knows Delilah. Which of Kate and Samuel can Khashayar reach?", "answer": "Kate", "steps": [ "Khashayar knows Blake.", "Blake knows Bennett.", "Bennett knows Harriet.", "Harriet knows Dexter.", "Dexter knows Patrick.", "Patrick knows Kate." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Khashayar", "Blake", "Harriet", "Bennett", "Patrick", "Kate", "Don", "Troy", "Dexter", "Stella", "Hugh", "Archer", "Vernon", "Yuki", "Delilah", "Samuel", "Charles", "Brock", "Beverly", "Hazel" ], "edges": [ [ 0, 1 ], [ 1, 3 ], [ 2, 6 ], [ 2, 8 ], [ 3, 2 ], [ 3, 7 ], [ 4, 5 ], [ 7, 9 ], [ 8, 4 ], [ 10, 11 ], [ 11, 13 ], [ 12, 16 ], [ 12, 18 ], [ 13, 12 ], [ 13, 17 ], [ 14, 15 ], [ 17, 19 ], [ 18, 14 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Julius knows Nell. Seth knows Kelly. Coral knows Peggy. Leigh knows Saul. Luna knows Calvin. Coral knows Boyd. Martha knows Coral. Kelly knows Carrie. Levi knows Seth. Seth knows Luna. Levi knows Tanya. Martha knows Allen. Martha knows Jude. Levi knows Connor. Boyd knows Julius. Boyd knows Carter. Kelly knows Leigh. Peggy knows Renee. Which of Saul and Nell can Levi reach?", "answer": "Saul", "steps": [ "Levi knows Seth.", "Seth knows Kelly.", "Kelly knows Leigh.", "Leigh knows Saul." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Levi", "Calvin", "Saul", "Luna", "Kelly", "Carrie", "Tanya", "Leigh", "Seth", "Connor", "Martha", "Renee", "Nell", "Peggy", "Boyd", "Carter", "Allen", "Julius", "Coral", "Jude" ], "edges": [ [ 0, 6 ], [ 0, 8 ], [ 0, 9 ], [ 3, 1 ], [ 4, 5 ], [ 4, 7 ], [ 7, 2 ], [ 8, 3 ], [ 8, 4 ], [ 10, 16 ], [ 10, 18 ], [ 10, 19 ], [ 13, 11 ], [ 14, 15 ], [ 14, 17 ], [ 17, 12 ], [ 18, 13 ], [ 18, 14 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Irene knows Damien. Irene knows Lisa. Damien knows Layla. James knows Cyrus. Blanche knows Irene. Randy knows Frida. Lisa knows Adelaide. Cyrus knows Robin. Frida knows Lucy. Virginia knows Randy. Randy knows James. April knows Blanche. Nadine knows Chantal. Seth knows Lamont. Adelaide knows Grant. Frida knows Nadine. Willis knows Virginia. Damien knows Seth. Which of Frida and Damien can April reach?", "answer": "Damien", "steps": [ "April knows Blanche.", "Blanche knows Irene.", "Irene knows Damien." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "April", "Irene", "Lisa", "Layla", "Adelaide", "Blanche", "Lamont", "Seth", "Damien", "Grant", "Willis", "Randy", "James", "Lucy", "Cyrus", "Virginia", "Chantal", "Nadine", "Frida", "Robin" ], "edges": [ [ 0, 5 ], [ 1, 8 ], [ 1, 2 ], [ 2, 4 ], [ 4, 9 ], [ 5, 1 ], [ 7, 6 ], [ 8, 3 ], [ 8, 7 ], [ 10, 15 ], [ 11, 18 ], [ 11, 12 ], [ 12, 14 ], [ 14, 19 ], [ 15, 11 ], [ 17, 16 ], [ 18, 13 ], [ 18, 17 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Gunnar knows Winston. Deborah knows Victor. Laura knows Pam. Celia knows Joel. Victor knows Jack. Dominic knows Susan. Laura knows Julio. Andre knows Corinne. Darren knows Celia. Henrietta knows Deborah. Henrietta knows Candice. Susan knows Terrence. Laura knows Gunnar. Corinne knows Dominic. Winston knows Andre. Joel knows Jaime. Jack knows Darren. Henrietta knows Luis. Which of Dominic and Celia can Henrietta reach?", "answer": "Celia", "steps": [ "Henrietta knows Deborah.", "Deborah knows Victor.", "Victor knows Jack.", "Jack knows Darren.", "Darren knows Celia." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Henrietta", "Candice", "Deborah", "Jack", "Joel", "Darren", "Jaime", "Luis", "Victor", "Celia", "Laura", "Julio", "Gunnar", "Andre", "Susan", "Corinne", "Terrence", "Pam", "Winston", "Dominic" ], "edges": [ [ 0, 1 ], [ 0, 7 ], [ 0, 2 ], [ 2, 8 ], [ 3, 5 ], [ 4, 6 ], [ 5, 9 ], [ 8, 3 ], [ 9, 4 ], [ 10, 11 ], [ 10, 17 ], [ 10, 12 ], [ 12, 18 ], [ 13, 15 ], [ 14, 16 ], [ 15, 19 ], [ 18, 13 ], [ 19, 14 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Luz knows Lorraine. Lorraine knows Ezra. Virginia knows Hunter. Neil knows Kurt. Corey knows Neil. Hunter knows Douglas. Sonia knows Chelsea. Lorraine knows Aurora. Neil knows Brock. Aurora knows Alyssa. Brock knows Sonia. Daisy knows Eduardo. Caroline knows Emma. Eduardo knows Ainsley. Aurora knows Caroline. Corey knows Daisy. Luz knows Virginia. Brock knows Isla. Which of Lorraine and Neil can Corey reach?", "answer": "Neil", "steps": [ "Corey knows Neil." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Corey", "Brock", "Neil", "Sonia", "Kurt", "Daisy", "Eduardo", "Chelsea", "Isla", "Ainsley", "Luz", "Aurora", "Lorraine", "Caroline", "Ezra", "Virginia", "Hunter", "Emma", "Alyssa", "Douglas" ], "edges": [ [ 0, 2 ], [ 0, 5 ], [ 1, 3 ], [ 1, 8 ], [ 2, 4 ], [ 2, 1 ], [ 3, 7 ], [ 5, 6 ], [ 6, 9 ], [ 10, 12 ], [ 10, 15 ], [ 11, 13 ], [ 11, 18 ], [ 12, 14 ], [ 12, 11 ], [ 13, 17 ], [ 15, 16 ], [ 16, 19 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Vera knows Henrietta. Federico knows Haven. Mark knows Hannah. Fiona knows Mabel. Annie knows Mark. Fiona knows Bob. Bob knows Federico. Jolene knows Roger. Henrietta knows Fiona. Ivan knows Robin. Robin knows Annie. Mabel knows Avery. Annie knows Jolene. Hannah knows Yvette. Ivan knows Celeste. Fiona knows Marcus. Vera knows Ramona. Annie knows India. Which of Annie and Fiona can Vera reach?", "answer": "Fiona", "steps": [ "Vera knows Henrietta.", "Henrietta knows Fiona." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Vera", "Federico", "Marcus", "Avery", "Haven", "Mabel", "Henrietta", "Fiona", "Ramona", "Bob", "Ivan", "Hannah", "India", "Roger", "Yvette", "Jolene", "Robin", "Annie", "Celeste", "Mark" ], "edges": [ [ 0, 8 ], [ 0, 6 ], [ 1, 4 ], [ 5, 3 ], [ 6, 7 ], [ 7, 2 ], [ 7, 5 ], [ 7, 9 ], [ 9, 1 ], [ 10, 18 ], [ 10, 16 ], [ 11, 14 ], [ 15, 13 ], [ 16, 17 ], [ 17, 12 ], [ 17, 15 ], [ 17, 19 ], [ 19, 11 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Jeremy knows Henry. Jane knows Bernice. Beatrice knows Fanny. Roman knows Emma. Roman knows Luther. Henry knows Alfred. Christina knows Heather. Knox knows Pearl. Bella knows Emmett. Bella knows Beatrice. Jane knows Anastasia. Anastasia knows Estella. Emmett knows Jeremy. Henry knows Stacy. Jared knows Roman. Henry knows Christina. Roman knows Knox. Bernice knows Jared. Which of Heather and Pearl can Bella reach?", "answer": "Heather", "steps": [ "Bella knows Emmett.", "Emmett knows Jeremy.", "Jeremy knows Henry.", "Henry knows Christina.", "Christina knows Heather." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Bella", "Beatrice", "Christina", "Heather", "Stacy", "Alfred", "Emmett", "Jeremy", "Fanny", "Henry", "Jane", "Anastasia", "Knox", "Pearl", "Emma", "Luther", "Bernice", "Jared", "Estella", "Roman" ], "edges": [ [ 0, 1 ], [ 0, 6 ], [ 1, 8 ], [ 2, 3 ], [ 6, 7 ], [ 7, 9 ], [ 9, 2 ], [ 9, 4 ], [ 9, 5 ], [ 10, 11 ], [ 10, 16 ], [ 11, 18 ], [ 12, 13 ], [ 16, 17 ], [ 17, 19 ], [ 19, 12 ], [ 19, 14 ], [ 19, 15 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Archer knows Duncan. Eduardo knows Ramon. Rex knows Conrad. Rex knows Archer. Jessie knows Lydia. Lydia knows Wilbur. Lydia knows Tara. Gareth knows Forrest. Sean knows Janice. Ross knows Jessie. Forrest knows Eduardo. Rena knows Sean. Tara knows Rena. Grace knows Rex. Archer knows Gareth. Jessie knows Ramona. Ramon knows Amelia. Janice knows Sam. Which of Sean and Eduardo can Grace reach?", "answer": "Eduardo", "steps": [ "Grace knows Rex.", "Rex knows Archer.", "Archer knows Gareth.", "Gareth knows Forrest.", "Forrest knows Eduardo." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Grace", "Ramon", "Duncan", "Gareth", "Amelia", "Archer", "Eduardo", "Rex", "Forrest", "Conrad", "Ross", "Janice", "Wilbur", "Tara", "Sam", "Lydia", "Sean", "Jessie", "Rena", "Ramona" ], "edges": [ [ 0, 7 ], [ 1, 4 ], [ 3, 8 ], [ 5, 2 ], [ 5, 3 ], [ 6, 1 ], [ 7, 5 ], [ 7, 9 ], [ 8, 6 ], [ 10, 17 ], [ 11, 14 ], [ 13, 18 ], [ 15, 12 ], [ 15, 13 ], [ 16, 11 ], [ 17, 15 ], [ 17, 19 ], [ 18, 16 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Ibrahim knows Byron. Frank knows Walter. Edward knows Ibrahim. Larry knows Norman. Edward knows Louisa. Kristina knows Tabitha. Fraser knows Frank. Dylan knows Kristina. Frank knows Chad. Chad knows Dylan. Fernando knows Gail. Louisa knows Irma. Larry knows Jeanette. Ross knows Larry. Kristina knows Janelle. Hayley knows Ross. Ibrahim knows Hayley. Fraser knows Fernando. Which of Norman and Tabitha can Fraser reach?", "answer": "Tabitha", "steps": [ "Fraser knows Frank.", "Frank knows Chad.", "Chad knows Dylan.", "Dylan knows Kristina.", "Kristina knows Tabitha." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Fraser", "Kristina", "Janelle", "Chad", "Gail", "Frank", "Tabitha", "Walter", "Dylan", "Fernando", "Edward", "Larry", "Jeanette", "Hayley", "Irma", "Ibrahim", "Norman", "Byron", "Ross", "Louisa" ], "edges": [ [ 0, 5 ], [ 0, 9 ], [ 1, 2 ], [ 1, 6 ], [ 3, 8 ], [ 5, 7 ], [ 5, 3 ], [ 8, 1 ], [ 9, 4 ], [ 10, 15 ], [ 10, 19 ], [ 11, 12 ], [ 11, 16 ], [ 13, 18 ], [ 15, 17 ], [ 15, 13 ], [ 18, 11 ], [ 19, 14 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Matthew knows Irene. Eamon knows Emily. Matthew knows Blake. Emily knows Matthew. Blake knows Elliot. Emily knows Phoebe. Joseph knows Melody. Jim knows Cole. Boris knows Jim. Joseph knows Geoffrey. Joseph knows Lisa. Lisa knows Frida. Melody knows Hamilton. Frances knows Dolores. Matthew knows Frances. Jim knows Joseph. Emily knows Laurel. Jim knows Harriet. Which of Frida and Elliot can Eamon reach?", "answer": "Elliot", "steps": [ "Eamon knows Emily.", "Emily knows Matthew.", "Matthew knows Blake.", "Blake knows Elliot." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Eamon", "Blake", "Phoebe", "Laurel", "Dolores", "Emily", "Frances", "Elliot", "Matthew", "Irene", "Boris", "Lisa", "Cole", "Harriet", "Hamilton", "Jim", "Melody", "Frida", "Joseph", "Geoffrey" ], "edges": [ [ 0, 5 ], [ 1, 7 ], [ 5, 2 ], [ 5, 3 ], [ 5, 8 ], [ 6, 4 ], [ 8, 6 ], [ 8, 1 ], [ 8, 9 ], [ 10, 15 ], [ 11, 17 ], [ 15, 12 ], [ 15, 13 ], [ 15, 18 ], [ 16, 14 ], [ 18, 16 ], [ 18, 11 ], [ 18, 19 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Magdalena knows Duncan. Paul knows Claire. Anton knows Frankie. Darla knows Chantal. Conrad knows Dana. Tony knows Leo. Drake knows Anton. Magdalena knows Logan. Chantal knows Jacques. Joshua knows Kara. Nicholas knows Paul. Duncan knows Joshua. Dana knows Darla. Leo knows Drake. Nicholas knows Charlene. Kara knows Conrad. Shelly knows Tony. Claire knows Shelly. Which of Joshua and Claire can Nicholas reach?", "answer": "Claire", "steps": [ "Nicholas knows Paul.", "Paul knows Claire." ], "difficulty": 2, "original_distance": 8, "idx_to_symbol": [ "Nicholas", "Leo", "Charlene", "Frankie", "Paul", "Shelly", "Tony", "Claire", "Drake", "Anton", "Magdalena", "Dana", "Logan", "Jacques", "Duncan", "Kara", "Conrad", "Joshua", "Darla", "Chantal" ], "edges": [ [ 0, 2 ], [ 0, 4 ], [ 1, 8 ], [ 4, 7 ], [ 5, 6 ], [ 6, 1 ], [ 7, 5 ], [ 8, 9 ], [ 9, 3 ], [ 10, 12 ], [ 10, 14 ], [ 11, 18 ], [ 14, 17 ], [ 15, 16 ], [ 16, 11 ], [ 17, 15 ], [ 18, 19 ], [ 19, 13 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Marilyn knows Jewel. Aisha knows Martha. Kirsten knows Federico. Lois knows Everett. Winifred knows Sandra. Everett knows Ruby. Miranda knows Winifred. Alvin knows Patrick. Winifred knows Dave. Gwen knows Brett. Martha knows Gwen. Carrie knows Alvin. Julius knows Lois. Brett knows Marilyn. Dave knows Aisha. Lois knows Frances. Ruby knows Carrie. Patrick knows Kirsten. Which of Alvin and Gwen can Julius reach?", "answer": "Alvin", "steps": [ "Julius knows Lois.", "Lois knows Everett.", "Everett knows Ruby.", "Ruby knows Carrie.", "Carrie knows Alvin." ], "difficulty": 5, "original_distance": 8, "idx_to_symbol": [ "Julius", "Carrie", "Kirsten", "Federico", "Ruby", "Everett", "Patrick", "Alvin", "Frances", "Lois", "Miranda", "Martha", "Marilyn", "Jewel", "Aisha", "Dave", "Brett", "Gwen", "Sandra", "Winifred" ], "edges": [ [ 0, 9 ], [ 1, 7 ], [ 2, 3 ], [ 4, 1 ], [ 5, 4 ], [ 6, 2 ], [ 7, 6 ], [ 9, 5 ], [ 9, 8 ], [ 10, 19 ], [ 11, 17 ], [ 12, 13 ], [ 14, 11 ], [ 15, 14 ], [ 16, 12 ], [ 17, 16 ], [ 19, 15 ], [ 19, 18 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Kira knows Samuel. Natalie knows Julia. Earl knows Hubert. Hilda knows Carla. Cruz knows Billy. Cruz knows Shaun. Harper knows Jean. Harper knows Hilda. Julia knows Kira. Gordon knows Harper. Levi knows Donald. Levi knows Earl. Billy knows Alder. Hubert knows Merle. Ashton knows Levi. Jean knows Cruz. Julia knows Ashton. Alder knows Homer. Which of Billy and Earl can Natalie reach?", "answer": "Earl", "steps": [ "Natalie knows Julia.", "Julia knows Ashton.", "Ashton knows Levi.", "Levi knows Earl." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Natalie", "Merle", "Levi", "Donald", "Earl", "Ashton", "Hubert", "Samuel", "Julia", "Kira", "Gordon", "Homer", "Cruz", "Shaun", "Billy", "Jean", "Alder", "Carla", "Harper", "Hilda" ], "edges": [ [ 0, 8 ], [ 2, 3 ], [ 2, 4 ], [ 4, 6 ], [ 5, 2 ], [ 6, 1 ], [ 8, 5 ], [ 8, 9 ], [ 9, 7 ], [ 10, 18 ], [ 12, 13 ], [ 12, 14 ], [ 14, 16 ], [ 15, 12 ], [ 16, 11 ], [ 18, 15 ], [ 18, 19 ], [ 19, 17 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Bennett knows Miranda. Stephen knows Marian. Bennett knows Ruby. Miranda knows Claude. Celia knows Dana. Stephen knows Alejandro. Fergus knows Celia. Bernadette knows Blanche. Celia knows Morgan. Dana knows Pam. Dana knows Lambert. Bennett knows Stephen. Bennett knows Sierra. Jude knows Devin. Celia knows Logan. Devin knows Bennett. Celia knows Bernadette. Heidi knows Fergus. Which of Alejandro and Pam can Heidi reach?", "answer": "Pam", "steps": [ "Heidi knows Fergus.", "Fergus knows Celia.", "Celia knows Dana.", "Dana knows Pam." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Heidi", "Fergus", "Blanche", "Logan", "Bernadette", "Celia", "Morgan", "Dana", "Pam", "Lambert", "Jude", "Devin", "Claude", "Sierra", "Miranda", "Bennett", "Ruby", "Stephen", "Alejandro", "Marian" ], "edges": [ [ 0, 1 ], [ 1, 5 ], [ 4, 2 ], [ 5, 3 ], [ 5, 4 ], [ 5, 6 ], [ 5, 7 ], [ 7, 8 ], [ 7, 9 ], [ 10, 11 ], [ 11, 15 ], [ 14, 12 ], [ 15, 13 ], [ 15, 14 ], [ 15, 16 ], [ 15, 17 ], [ 17, 18 ], [ 17, 19 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Beau knows Fleur. Frances knows Beau. Hazel knows Dee. Alejandro knows Tony. Frances knows Lillian. Frankie knows Gail. Dolores knows Kira. Georgia knows Dirk. Dee knows Anton. Frankie knows Hazel. Lillian knows Virginia. Dirk knows Frances. Frances knows Alejandro. Dirk knows Juan. Federico knows Frankie. Hazel knows Dolores. Hazel knows Jasper. Jasper knows Melissa. Which of Jasper and Lillian can Georgia reach?", "answer": "Lillian", "steps": [ "Georgia knows Dirk.", "Dirk knows Frances.", "Frances knows Lillian." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Georgia", "Fleur", "Juan", "Virginia", "Frances", "Dirk", "Alejandro", "Lillian", "Tony", "Beau", "Federico", "Kira", "Gail", "Melissa", "Hazel", "Frankie", "Dee", "Jasper", "Anton", "Dolores" ], "edges": [ [ 0, 5 ], [ 4, 7 ], [ 4, 6 ], [ 4, 9 ], [ 5, 2 ], [ 5, 4 ], [ 6, 8 ], [ 7, 3 ], [ 9, 1 ], [ 10, 15 ], [ 14, 17 ], [ 14, 16 ], [ 14, 19 ], [ 15, 12 ], [ 15, 14 ], [ 16, 18 ], [ 17, 13 ], [ 19, 11 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Brooke knows Jonah. Todd knows Teresa. Heidi knows Gareth. Gloria knows Philip. Teresa knows Francis. Luke knows Estelle. Todd knows Gloria. Jonah knows Jerry. Gareth knows Betty. Dana knows Lee. Michelle knows Dana. Estelle knows Yuki. Francis knows Bailey. Michelle knows Todd. Heidi knows Brooke. Luke knows Heidi. Jonah knows Kara. Francis knows Elton. Which of Teresa and Brooke can Michelle reach?", "answer": "Teresa", "steps": [ "Michelle knows Todd.", "Todd knows Teresa." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Michelle", "Gloria", "Teresa", "Todd", "Lee", "Philip", "Bailey", "Elton", "Dana", "Francis", "Luke", "Gareth", "Brooke", "Heidi", "Yuki", "Betty", "Kara", "Jerry", "Estelle", "Jonah" ], "edges": [ [ 0, 8 ], [ 0, 3 ], [ 1, 5 ], [ 2, 9 ], [ 3, 1 ], [ 3, 2 ], [ 8, 4 ], [ 9, 6 ], [ 9, 7 ], [ 10, 18 ], [ 10, 13 ], [ 11, 15 ], [ 12, 19 ], [ 13, 11 ], [ 13, 12 ], [ 18, 14 ], [ 19, 16 ], [ 19, 17 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Jeffery knows Israel. Terry knows Levi. Jeffery knows Russell. Becky knows Daphne. Jay knows Adelaide. Russell knows Marie. Jill knows Ignacio. Ignacio knows Terry. Becky knows Belinda. Daphne knows Dudley. Levi knows Francesca. Marie knows Dee. Jeffery knows Leigh. Daphne knows Jill. Bennett knows Jeffery. Bennett knows Eric. Daphne knows Camille. Dee knows Jay. Which of Jeffery and Daphne can Becky reach?", "answer": "Daphne", "steps": [ "Becky knows Daphne." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Becky", "Levi", "Belinda", "Daphne", "Dudley", "Terry", "Ignacio", "Francesca", "Jill", "Camille", "Bennett", "Jay", "Eric", "Jeffery", "Leigh", "Dee", "Marie", "Adelaide", "Russell", "Israel" ], "edges": [ [ 0, 2 ], [ 0, 3 ], [ 1, 7 ], [ 3, 4 ], [ 3, 8 ], [ 3, 9 ], [ 5, 1 ], [ 6, 5 ], [ 8, 6 ], [ 10, 12 ], [ 10, 13 ], [ 11, 17 ], [ 13, 14 ], [ 13, 18 ], [ 13, 19 ], [ 15, 11 ], [ 16, 15 ], [ 18, 16 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Cara knows Bette. Winifred knows Maude. Hendrix knows Wilma. Luella knows Hudson. Donna knows Cara. Milton knows Erik. Tonya knows Hendrix. Destiny knows Hadley. Hudson knows Winifred. Maude knows Milton. Hendrix knows Wanda. Wanda knows Bill. Hadley knows Skyler. Donna knows Nicholas. Milton knows Destiny. Luella knows Essie. Bette knows Tonya. Bill knows Peggy. Which of Wanda and Destiny can Donna reach?", "answer": "Wanda", "steps": [ "Donna knows Cara.", "Cara knows Bette.", "Bette knows Tonya.", "Tonya knows Hendrix.", "Hendrix knows Wanda." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Donna", "Tonya", "Cara", "Wilma", "Bette", "Peggy", "Wanda", "Bill", "Hendrix", "Nicholas", "Luella", "Maude", "Hudson", "Erik", "Winifred", "Skyler", "Destiny", "Hadley", "Milton", "Essie" ], "edges": [ [ 0, 2 ], [ 0, 9 ], [ 1, 8 ], [ 2, 4 ], [ 4, 1 ], [ 6, 7 ], [ 7, 5 ], [ 8, 3 ], [ 8, 6 ], [ 10, 12 ], [ 10, 19 ], [ 11, 18 ], [ 12, 14 ], [ 14, 11 ], [ 16, 17 ], [ 17, 15 ], [ 18, 13 ], [ 18, 16 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Doug knows Frank. Geraldine knows Alvin. Elmer knows Reid. Elmer knows Harry. Eugene knows Dell. Alfred knows Elmer. Mindy knows Walter. Adrian knows Aldo. Virgil knows Doug. Geraldine knows Mindy. Eugene knows Goldie. Virgil knows Alfred. Helen knows Eugene. Reid knows Estella. Aldo knows Virgil. Dell knows Geraldine. Goldie knows Garrett. Katherine knows Helen. Which of Virgil and Eugene can Katherine reach?", "answer": "Eugene", "steps": [ "Katherine knows Helen.", "Helen knows Eugene." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Katherine", "Eugene", "Garrett", "Walter", "Dell", "Geraldine", "Mindy", "Alvin", "Helen", "Goldie", "Adrian", "Virgil", "Frank", "Estella", "Alfred", "Elmer", "Reid", "Harry", "Aldo", "Doug" ], "edges": [ [ 0, 8 ], [ 1, 4 ], [ 1, 9 ], [ 4, 5 ], [ 5, 6 ], [ 5, 7 ], [ 6, 3 ], [ 8, 1 ], [ 9, 2 ], [ 10, 18 ], [ 11, 14 ], [ 11, 19 ], [ 14, 15 ], [ 15, 16 ], [ 15, 17 ], [ 16, 13 ], [ 18, 11 ], [ 19, 12 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Sybil knows Bernadette. Finn knows India. India knows Faith. Sybil knows Hardy. Jose knows Sue. Finn knows Jose. Larry knows Arturo. Alyssa knows Logan. Pierce knows Larry. Arturo knows Sybil. Geraldine knows Lara. Sue knows Camille. Bernadette knows Elvira. Hardy knows Alyssa. Fern knows Geraldine. Bernadette knows Bella. Lara knows Finn. India knows Forrest. Which of Lara and Arturo can Pierce reach?", "answer": "Arturo", "steps": [ "Pierce knows Larry.", "Larry knows Arturo." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Pierce", "Alyssa", "Hardy", "Logan", "Arturo", "Elvira", "Bella", "Sybil", "Bernadette", "Larry", "Fern", "Sue", "Jose", "Camille", "Lara", "Faith", "Forrest", "Finn", "India", "Geraldine" ], "edges": [ [ 0, 9 ], [ 1, 3 ], [ 2, 1 ], [ 4, 7 ], [ 7, 2 ], [ 7, 8 ], [ 8, 5 ], [ 8, 6 ], [ 9, 4 ], [ 10, 19 ], [ 11, 13 ], [ 12, 11 ], [ 14, 17 ], [ 17, 12 ], [ 17, 18 ], [ 18, 15 ], [ 18, 16 ], [ 19, 14 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Alexa knows Knox. Randall knows Nolan. Blaine knows Barbara. Allen knows Terry. Felicia knows Blaine. Randall knows Alana. Felicia knows Jarvis. Lily knows Elliot. Lily knows Teresa. Elliot knows Margaret. Edna knows Lily. Lamar knows Felicia. Nolan knows Palmer. Allen knows Lawson. Lawson knows Alexa. Elliot knows Randall. Palmer knows Paul. Blaine knows Allen. Which of Felicia and Lily can Lamar reach?", "answer": "Felicia", "steps": [ "Lamar knows Felicia." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Lamar", "Knox", "Alexa", "Blaine", "Felicia", "Terry", "Allen", "Lawson", "Jarvis", "Barbara", "Edna", "Paul", "Palmer", "Elliot", "Lily", "Alana", "Randall", "Nolan", "Teresa", "Margaret" ], "edges": [ [ 0, 4 ], [ 2, 1 ], [ 3, 6 ], [ 3, 9 ], [ 4, 8 ], [ 4, 3 ], [ 6, 5 ], [ 6, 7 ], [ 7, 2 ], [ 10, 14 ], [ 12, 11 ], [ 13, 16 ], [ 13, 19 ], [ 14, 18 ], [ 14, 13 ], [ 16, 15 ], [ 16, 17 ], [ 17, 12 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Alma knows Bruno. Marshall knows Ethan. Jillian knows Wesley. Alma knows Roland. Hugh knows Selena. Marshall knows Freya. Lily knows Tiffany. Selena knows Camille. Alma knows Nell. Shane knows Kara. Camille knows Devin. Freya knows Jerome. Camille knows Lily. Marshall knows Hugh. Bruno knows Jillian. Wesley knows Shane. Wesley knows Arnold. Nell knows Cyrus. Which of Lily and Shane can Alma reach?", "answer": "Shane", "steps": [ "Alma knows Bruno.", "Bruno knows Jillian.", "Jillian knows Wesley.", "Wesley knows Shane." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Alma", "Cyrus", "Wesley", "Roland", "Nell", "Kara", "Arnold", "Shane", "Bruno", "Jillian", "Marshall", "Jerome", "Camille", "Ethan", "Freya", "Tiffany", "Devin", "Lily", "Hugh", "Selena" ], "edges": [ [ 0, 3 ], [ 0, 4 ], [ 0, 8 ], [ 2, 6 ], [ 2, 7 ], [ 4, 1 ], [ 7, 5 ], [ 8, 9 ], [ 9, 2 ], [ 10, 13 ], [ 10, 14 ], [ 10, 18 ], [ 12, 16 ], [ 12, 17 ], [ 14, 11 ], [ 17, 15 ], [ 18, 19 ], [ 19, 12 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Hudson knows Nash. Cruz knows Mara. Dudley knows Douglas. Deirdre knows Kobe. Monroe knows Palmer. Kobe knows Andrew. Farrah knows Hudson. Sandra knows Monroe. Nash knows Dudley. Douglas knows Damian. Hudson knows Rhea. Rhea knows Kendra. Mara knows Burt. Andrew knows Norma. Cruz knows Deirdre. Wendy knows Farrah. Zane knows Wendy. Palmer knows Cruz. Which of Nash and Deirdre can Sandra reach?", "answer": "Deirdre", "steps": [ "Sandra knows Monroe.", "Monroe knows Palmer.", "Palmer knows Cruz.", "Cruz knows Deirdre." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Sandra", "Cruz", "Mara", "Burt", "Andrew", "Deirdre", "Norma", "Kobe", "Monroe", "Palmer", "Zane", "Hudson", "Rhea", "Kendra", "Douglas", "Nash", "Damian", "Dudley", "Wendy", "Farrah" ], "edges": [ [ 0, 8 ], [ 1, 2 ], [ 1, 5 ], [ 2, 3 ], [ 4, 6 ], [ 5, 7 ], [ 7, 4 ], [ 8, 9 ], [ 9, 1 ], [ 10, 18 ], [ 11, 12 ], [ 11, 15 ], [ 12, 13 ], [ 14, 16 ], [ 15, 17 ], [ 17, 14 ], [ 18, 19 ], [ 19, 11 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Spencer knows Archer. Victor knows Gemma. Victor knows Margaret. Luna knows Dawn. Dawn knows Preston. Camille knows Pablo. Patrick knows Luna. Kerry knows Kent. Kobe knows Kay. Archer knows Kerry. Jacqueline knows Spencer. Gemma knows Farrah. Margaret knows Zane. Archer knows Kobe. Spencer knows Camille. Jacqueline knows Jeanette. Patrick knows Patricia. Luna knows Victor. Which of Farrah and Kent can Jacqueline reach?", "answer": "Kent", "steps": [ "Jacqueline knows Spencer.", "Spencer knows Archer.", "Archer knows Kerry.", "Kerry knows Kent." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Jacqueline", "Pablo", "Camille", "Archer", "Kay", "Kobe", "Jeanette", "Spencer", "Kerry", "Kent", "Patrick", "Preston", "Dawn", "Victor", "Zane", "Margaret", "Patricia", "Luna", "Gemma", "Farrah" ], "edges": [ [ 0, 6 ], [ 0, 7 ], [ 2, 1 ], [ 3, 5 ], [ 3, 8 ], [ 5, 4 ], [ 7, 2 ], [ 7, 3 ], [ 8, 9 ], [ 10, 16 ], [ 10, 17 ], [ 12, 11 ], [ 13, 15 ], [ 13, 18 ], [ 15, 14 ], [ 17, 12 ], [ 17, 13 ], [ 18, 19 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Hank knows William. Lenora knows Davis. Hank knows Doug. Boyd knows Gwen. Eleanor knows Boyd. Gerald knows Dennis. Davis knows Christian. Gerald knows Eleanor. Reid knows Bernadette. Doug knows Isadora. Hank knows Jonah. William knows Thomas. Hugo knows Katherine. Reid knows Hugo. William knows Rod. William knows Lenora. Gerald knows Jem. Reid knows Gerald. Which of Gerald and William can Hank reach?", "answer": "William", "steps": [ "Hank knows William." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Hank", "Jonah", "Doug", "William", "Christian", "Rod", "Isadora", "Thomas", "Davis", "Lenora", "Reid", "Bernadette", "Hugo", "Gerald", "Gwen", "Dennis", "Katherine", "Jem", "Boyd", "Eleanor" ], "edges": [ [ 0, 1 ], [ 0, 2 ], [ 0, 3 ], [ 2, 6 ], [ 3, 5 ], [ 3, 7 ], [ 3, 9 ], [ 8, 4 ], [ 9, 8 ], [ 10, 11 ], [ 10, 12 ], [ 10, 13 ], [ 12, 16 ], [ 13, 15 ], [ 13, 17 ], [ 13, 19 ], [ 18, 14 ], [ 19, 18 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Ibrahim knows Byron. Frank knows Walter. Edward knows Ibrahim. Larry knows Norman. Edward knows Louisa. Kristina knows Tabitha. Fraser knows Frank. Dylan knows Kristina. Frank knows Chad. Chad knows Dylan. Fernando knows Gail. Louisa knows Irma. Larry knows Jeanette. Ross knows Larry. Kristina knows Janelle. Hayley knows Ross. Ibrahim knows Hayley. Fraser knows Fernando. Which of Larry and Kristina can Fraser reach?", "answer": "Kristina", "steps": [ "Fraser knows Frank.", "Frank knows Chad.", "Chad knows Dylan.", "Dylan knows Kristina." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Fraser", "Kristina", "Janelle", "Chad", "Gail", "Frank", "Tabitha", "Walter", "Dylan", "Fernando", "Edward", "Larry", "Jeanette", "Hayley", "Irma", "Ibrahim", "Norman", "Byron", "Ross", "Louisa" ], "edges": [ [ 0, 5 ], [ 0, 9 ], [ 1, 2 ], [ 1, 6 ], [ 3, 8 ], [ 5, 7 ], [ 5, 3 ], [ 8, 1 ], [ 9, 4 ], [ 10, 15 ], [ 10, 19 ], [ 11, 12 ], [ 11, 16 ], [ 13, 18 ], [ 15, 17 ], [ 15, 13 ], [ 18, 11 ], [ 19, 14 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Hector knows Nash. Edmund knows Darin. Carrie knows Edmund. Asher knows Lyric. Fred knows Fern. Nash knows Asher. Nadine knows Alison. Zoe knows Hector. Zoe knows Corinne. Carrie knows Elsa. Zoe knows Boris. Darin knows Haven. Asher knows Eugene. Alison knows Dane. Lyric knows Fred. Carrie knows Parker. Haven knows Nadine. Haven knows Jules. Which of Fred and Alison can Carrie reach?", "answer": "Alison", "steps": [ "Carrie knows Edmund.", "Edmund knows Darin.", "Darin knows Haven.", "Haven knows Nadine.", "Nadine knows Alison." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Carrie", "Haven", "Dane", "Alison", "Edmund", "Nadine", "Jules", "Elsa", "Parker", "Darin", "Zoe", "Asher", "Fern", "Fred", "Hector", "Lyric", "Eugene", "Corinne", "Boris", "Nash" ], "edges": [ [ 0, 7 ], [ 0, 8 ], [ 0, 4 ], [ 1, 5 ], [ 1, 6 ], [ 3, 2 ], [ 4, 9 ], [ 5, 3 ], [ 9, 1 ], [ 10, 17 ], [ 10, 18 ], [ 10, 14 ], [ 11, 15 ], [ 11, 16 ], [ 13, 12 ], [ 14, 19 ], [ 15, 13 ], [ 19, 11 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Robin knows Charlene. Isla knows Deborah. Ember knows Lyric. Ashton knows Robin. Isla knows Fergus. Ember knows Patricia. Ella knows Verna. Charlene knows Frank. Lyric knows Isla. Fergus knows Sheila. Ella knows Gerard. Frank knows Dayton. Frank knows Archer. Gerard knows Ember. Melody knows Pierce. Robin knows Keaton. Melody knows Ashton. Archer knows Caleb. Which of Ashton and Gerard can Ella reach?", "answer": "Gerard", "steps": [ "Ella knows Gerard." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Ella", "Gerard", "Sheila", "Lyric", "Verna", "Fergus", "Deborah", "Patricia", "Isla", "Ember", "Melody", "Ashton", "Caleb", "Charlene", "Pierce", "Archer", "Dayton", "Keaton", "Frank", "Robin" ], "edges": [ [ 0, 4 ], [ 0, 1 ], [ 1, 9 ], [ 3, 8 ], [ 5, 2 ], [ 8, 5 ], [ 8, 6 ], [ 9, 7 ], [ 9, 3 ], [ 10, 14 ], [ 10, 11 ], [ 11, 19 ], [ 13, 18 ], [ 15, 12 ], [ 18, 15 ], [ 18, 16 ], [ 19, 17 ], [ 19, 13 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Gage knows Bart. Boyd knows Bernice. Simon knows Pedro. Jordan knows Beau. Leopold knows Darrell. Erwin knows Nathan. Bernice knows Gonzalo. Bernice knows Bonnie. Frankie knows Boyd. Francesca knows Jermaine. Bart knows Erwin. Leopold knows Gage. Bart knows Damien. Bernice knows Hattie. Beau knows Leopold. Leopold knows Kay. Francesca knows Simon. Hattie knows Francesca. Which of Bart and Francesca can Frankie reach?", "answer": "Francesca", "steps": [ "Frankie knows Boyd.", "Boyd knows Bernice.", "Bernice knows Hattie.", "Hattie knows Francesca." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Frankie", "Jermaine", "Pedro", "Hattie", "Boyd", "Simon", "Francesca", "Bernice", "Bonnie", "Gonzalo", "Jordan", "Damien", "Nathan", "Gage", "Beau", "Erwin", "Bart", "Leopold", "Kay", "Darrell" ], "edges": [ [ 0, 4 ], [ 3, 6 ], [ 4, 7 ], [ 5, 2 ], [ 6, 1 ], [ 6, 5 ], [ 7, 3 ], [ 7, 8 ], [ 7, 9 ], [ 10, 14 ], [ 13, 16 ], [ 14, 17 ], [ 15, 12 ], [ 16, 11 ], [ 16, 15 ], [ 17, 13 ], [ 17, 18 ], [ 17, 19 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Lara knows Hardy. Kathleen knows Oliver. Margaret knows Khashayar. Reid knows Ignacio. Hardy knows Reid. Mitchell knows Ava. Ignacio knows Damien. Margaret knows Pedro. Donna knows Arthur. Oliver knows Ruth. Arthur knows Fritz. Ignacio knows Kieran. Reid knows Valerie. Ruth knows Donna. Ruth knows Margaret. Pedro knows Dean. Damien knows Tabitha. Valerie knows Mitchell. Which of Fritz and Ava can Lara reach?", "answer": "Ava", "steps": [ "Lara knows Hardy.", "Hardy knows Reid.", "Reid knows Valerie.", "Valerie knows Mitchell.", "Mitchell knows Ava." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Lara", "Valerie", "Mitchell", "Hardy", "Kieran", "Ignacio", "Reid", "Damien", "Ava", "Tabitha", "Kathleen", "Donna", "Arthur", "Oliver", "Khashayar", "Margaret", "Ruth", "Pedro", "Fritz", "Dean" ], "edges": [ [ 0, 3 ], [ 1, 2 ], [ 2, 8 ], [ 3, 6 ], [ 5, 4 ], [ 5, 7 ], [ 6, 1 ], [ 6, 5 ], [ 7, 9 ], [ 10, 13 ], [ 11, 12 ], [ 12, 18 ], [ 13, 16 ], [ 15, 14 ], [ 15, 17 ], [ 16, 11 ], [ 16, 15 ], [ 17, 19 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Bennett knows Carla. Violet knows Albert. Violet knows Nicole. Henry knows Kareem. Adele knows Walter. Beatrice knows Hayley. Kareem knows Bernard. Albert knows Terrence. Bruno knows Hubert. Ronald knows Jeremy. Henry knows Tamara. Bruno knows Ronald. Doris knows Erma. Nicole knows Bennett. Hayley knows Adele. Bernard knows Beatrice. Beatrice knows Doris. Jeremy knows Violet. Which of Ronald and Kareem can Bruno reach?", "answer": "Ronald", "steps": [ "Bruno knows Ronald." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Bruno", "Ronald", "Jeremy", "Violet", "Bennett", "Terrence", "Carla", "Hubert", "Nicole", "Albert", "Henry", "Kareem", "Bernard", "Beatrice", "Adele", "Erma", "Walter", "Tamara", "Hayley", "Doris" ], "edges": [ [ 0, 7 ], [ 0, 1 ], [ 1, 2 ], [ 2, 3 ], [ 3, 8 ], [ 3, 9 ], [ 4, 6 ], [ 8, 4 ], [ 9, 5 ], [ 10, 17 ], [ 10, 11 ], [ 11, 12 ], [ 12, 13 ], [ 13, 18 ], [ 13, 19 ], [ 14, 16 ], [ 18, 14 ], [ 19, 15 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Sheila knows August. Lars knows Henrietta. Allan knows Gladys. Jared knows Jasmine. Tim knows Ernie. Ernie knows Sheila. Jared knows Troy. Glenda knows Harper. Ian knows Glenda. Lars knows Samantha. Henrietta knows Ian. August knows Celia. Eloise knows Erica. Erica knows Aubrey. Jasmine knows Allan. Ian knows Bert. Allan knows Tim. Harper knows Eloise. Which of Henrietta and Jasmine can Lars reach?", "answer": "Henrietta", "steps": [ "Lars knows Henrietta." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Lars", "Harper", "Glenda", "Ian", "Erica", "Samantha", "Henrietta", "Aubrey", "Eloise", "Bert", "Jared", "Ernie", "Tim", "Allan", "August", "Troy", "Jasmine", "Celia", "Sheila", "Gladys" ], "edges": [ [ 0, 5 ], [ 0, 6 ], [ 1, 8 ], [ 2, 1 ], [ 3, 2 ], [ 3, 9 ], [ 4, 7 ], [ 6, 3 ], [ 8, 4 ], [ 10, 15 ], [ 10, 16 ], [ 11, 18 ], [ 12, 11 ], [ 13, 12 ], [ 13, 19 ], [ 14, 17 ], [ 16, 13 ], [ 18, 14 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Cooper knows Shannon. Eva knows Leslie. Chase knows Guy. Chase knows Kylie. Leslie knows Elodie. Khashayar knows Blaine. Myra knows Khashayar. Luis knows Alexa. Guy knows Eva. Alexa knows Sally. Jocelyn knows Dee. Luis knows Susanne. Kylie knows Cooper. Shannon knows Kendrick. Elodie knows Kristin. Susanne knows Alex. Alex knows Myra. Sally knows Jocelyn. Which of Myra and Leslie can Chase reach?", "answer": "Leslie", "steps": [ "Chase knows Guy.", "Guy knows Eva.", "Eva knows Leslie." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Chase", "Elodie", "Kendrick", "Kylie", "Guy", "Eva", "Shannon", "Kristin", "Cooper", "Leslie", "Luis", "Khashayar", "Dee", "Alexa", "Susanne", "Alex", "Jocelyn", "Blaine", "Sally", "Myra" ], "edges": [ [ 0, 3 ], [ 0, 4 ], [ 1, 7 ], [ 3, 8 ], [ 4, 5 ], [ 5, 9 ], [ 6, 2 ], [ 8, 6 ], [ 9, 1 ], [ 10, 13 ], [ 10, 14 ], [ 11, 17 ], [ 13, 18 ], [ 14, 15 ], [ 15, 19 ], [ 16, 12 ], [ 18, 16 ], [ 19, 11 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "George knows Dolores. Carl knows Cecilia. Mitchell knows Parsa. Cecilia knows Blanche. Leigh knows Elliot. Todd knows Randy. Selena knows Marcia. Todd knows Charity. Norman knows Lily. Selena knows Gabe. Selena knows Eugenia. Blanche knows Leigh. Todd knows George. Dolores knows Mitchell. Lily knows Donna. Dewey knows Carl. Eugenia knows Dewey. Parsa knows Norman. Which of Lily and Leigh can Todd reach?", "answer": "Lily", "steps": [ "Todd knows George.", "George knows Dolores.", "Dolores knows Mitchell.", "Mitchell knows Parsa.", "Parsa knows Norman.", "Norman knows Lily." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Todd", "Charity", "Parsa", "Mitchell", "Lily", "Randy", "George", "Norman", "Dolores", "Donna", "Selena", "Gabe", "Cecilia", "Carl", "Leigh", "Marcia", "Eugenia", "Blanche", "Dewey", "Elliot" ], "edges": [ [ 0, 1 ], [ 0, 5 ], [ 0, 6 ], [ 2, 7 ], [ 3, 2 ], [ 4, 9 ], [ 6, 8 ], [ 7, 4 ], [ 8, 3 ], [ 10, 11 ], [ 10, 15 ], [ 10, 16 ], [ 12, 17 ], [ 13, 12 ], [ 14, 19 ], [ 16, 18 ], [ 17, 14 ], [ 18, 13 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Chantal knows Curtis. Vivian knows James. Sydney knows Don. Don knows Benjamin. Lars knows Sydney. Calvin knows Heidi. Wanda knows Enid. Clinton knows Bruno. Clarissa knows Violet. Kenzie knows Calvin. Violet knows Wanda. Benjamin knows Kenzie. Marcia knows Clarissa. James knows Marcia. Benjamin knows Kent. Bruno knows Vivian. Curtis knows Lars. Clarissa knows Destiny. Which of Calvin and Wanda can Chantal reach?", "answer": "Calvin", "steps": [ "Chantal knows Curtis.", "Curtis knows Lars.", "Lars knows Sydney.", "Sydney knows Don.", "Don knows Benjamin.", "Benjamin knows Kenzie.", "Kenzie knows Calvin." ], "difficulty": 7, "original_distance": 8, "idx_to_symbol": [ "Chantal", "Curtis", "Don", "Kent", "Lars", "Benjamin", "Kenzie", "Sydney", "Calvin", "Heidi", "Clinton", "Bruno", "Marcia", "Destiny", "Vivian", "Clarissa", "Violet", "James", "Wanda", "Enid" ], "edges": [ [ 0, 1 ], [ 1, 4 ], [ 2, 5 ], [ 4, 7 ], [ 5, 3 ], [ 5, 6 ], [ 6, 8 ], [ 7, 2 ], [ 8, 9 ], [ 10, 11 ], [ 11, 14 ], [ 12, 15 ], [ 14, 17 ], [ 15, 13 ], [ 15, 16 ], [ 16, 18 ], [ 17, 12 ], [ 18, 19 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Opal knows Harris. Opal knows Lee. Jon knows Austin. April knows Ralph. Aurora knows Jenny. Jon knows Kamila. Della knows Jon. Kendrick knows Aurora. Kendrick knows Dylan. Harris knows Shannon. Jon knows Cornelius. Gwen knows Damian. Damian knows April. Damian knows Giselle. Opal knows Gwen. Cornelius knows Isadora. Austin knows Kendrick. Dorian knows Opal. Which of Jon and Opal can Della reach?", "answer": "Jon", "steps": [ "Della knows Jon." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Della", "Dylan", "Isadora", "Kamila", "Kendrick", "Jenny", "Aurora", "Cornelius", "Austin", "Jon", "Dorian", "Giselle", "Shannon", "Lee", "Damian", "Ralph", "April", "Harris", "Gwen", "Opal" ], "edges": [ [ 0, 9 ], [ 4, 1 ], [ 4, 6 ], [ 6, 5 ], [ 7, 2 ], [ 8, 4 ], [ 9, 3 ], [ 9, 7 ], [ 9, 8 ], [ 10, 19 ], [ 14, 11 ], [ 14, 16 ], [ 16, 15 ], [ 17, 12 ], [ 18, 14 ], [ 19, 13 ], [ 19, 17 ], [ 19, 18 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Sadie knows Darla. Frances knows Sadie. Hayes knows Ruby. Mike knows Hayes. Gina knows Mike. Valerie knows Kylie. Colin knows Valerie. Frances knows Iris. Valerie knows Donald. Charlotte knows Callum. Hayes knows Frances. Phoebe knows Gina. Donald knows Olive. Iris knows Isiah. Riley knows Colin. Walt knows Riley. Donald knows Charlotte. Olive knows Ramon. Which of Donald and Frances can Phoebe reach?", "answer": "Frances", "steps": [ "Phoebe knows Gina.", "Gina knows Mike.", "Mike knows Hayes.", "Hayes knows Frances." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Phoebe", "Ruby", "Isiah", "Darla", "Mike", "Gina", "Sadie", "Iris", "Hayes", "Frances", "Walt", "Kylie", "Callum", "Ramon", "Colin", "Riley", "Olive", "Charlotte", "Valerie", "Donald" ], "edges": [ [ 0, 5 ], [ 4, 8 ], [ 5, 4 ], [ 6, 3 ], [ 7, 2 ], [ 8, 1 ], [ 8, 9 ], [ 9, 6 ], [ 9, 7 ], [ 10, 15 ], [ 14, 18 ], [ 15, 14 ], [ 16, 13 ], [ 17, 12 ], [ 18, 11 ], [ 18, 19 ], [ 19, 16 ], [ 19, 17 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Chase knows Electra. Susanne knows Roger. Felicia knows Chase. Miriam knows Gareth. Roman knows Hannah. Yolanda knows Susanne. Kay knows Bob. Roger knows Carl. Felicia knows Lacey. Laverne knows Felicia. Kay knows Blanche. Roger knows Kay. Hannah knows Yolanda. Roger knows Jeff. Heather knows Laverne. Felicia knows Ruby. Gareth knows Heather. Chase knows Ada. Which of Laverne and Susanne can Roman reach?", "answer": "Susanne", "steps": [ "Roman knows Hannah.", "Hannah knows Yolanda.", "Yolanda knows Susanne." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Roman", "Bob", "Kay", "Carl", "Blanche", "Yolanda", "Roger", "Jeff", "Susanne", "Hannah", "Miriam", "Electra", "Chase", "Lacey", "Ada", "Heather", "Felicia", "Ruby", "Laverne", "Gareth" ], "edges": [ [ 0, 9 ], [ 2, 1 ], [ 2, 4 ], [ 5, 8 ], [ 6, 3 ], [ 6, 2 ], [ 6, 7 ], [ 8, 6 ], [ 9, 5 ], [ 10, 19 ], [ 12, 11 ], [ 12, 14 ], [ 15, 18 ], [ 16, 13 ], [ 16, 12 ], [ 16, 17 ], [ 18, 16 ], [ 19, 15 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Hannah knows Kendrick. Melody knows Pat. Hannah knows Malcolm. Gavin knows Lionel. Lionel knows Lyle. Gavin knows Yuki. Enid knows Jack. Gavin knows Hayes. Hannah knows Adele. Stephanie knows Ivan. Kendrick knows Tanya. Enid knows Hannah. Ashton knows Edward. Melody knows Magdalena. Stephanie knows Ashton. Ashton knows Christopher. Stephanie knows Gavin. Enid knows Melody. Which of Lyle and Tanya can Stephanie reach?", "answer": "Lyle", "steps": [ "Stephanie knows Gavin.", "Gavin knows Lionel.", "Lionel knows Lyle." ], "difficulty": 3, "original_distance": 3, "idx_to_symbol": [ "Stephanie", "Ashton", "Lionel", "Gavin", "Lyle", "Yuki", "Christopher", "Ivan", "Hayes", "Edward", "Enid", "Melody", "Kendrick", "Hannah", "Tanya", "Malcolm", "Pat", "Jack", "Adele", "Magdalena" ], "edges": [ [ 0, 7 ], [ 0, 3 ], [ 0, 1 ], [ 1, 6 ], [ 1, 9 ], [ 2, 4 ], [ 3, 2 ], [ 3, 5 ], [ 3, 8 ], [ 10, 17 ], [ 10, 13 ], [ 10, 11 ], [ 11, 16 ], [ 11, 19 ], [ 12, 14 ], [ 13, 12 ], [ 13, 15 ], [ 13, 18 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Gertrude knows Jem. Ada knows David. Devon knows Horace. Luz knows Harris. Horace knows Ainsley. Lawrence knows Lambert. Dolores knows Elvira. Ainsley knows Mason. Jem knows Luz. David knows Audrey. Colleen knows Ken. Audrey knows Lawrence. Elvira knows Colleen. David knows Devon. Gertrude knows Dolores. Harris knows Dee. Dwight knows Gertrude. Lambert knows Ernie. Which of David and Gertrude can Dwight reach?", "answer": "Gertrude", "steps": [ "Dwight knows Gertrude." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Dwight", "Jem", "Dolores", "Luz", "Harris", "Dee", "Gertrude", "Ken", "Elvira", "Colleen", "Ada", "Audrey", "Devon", "Lawrence", "Lambert", "Ernie", "David", "Mason", "Horace", "Ainsley" ], "edges": [ [ 0, 6 ], [ 1, 3 ], [ 2, 8 ], [ 3, 4 ], [ 4, 5 ], [ 6, 1 ], [ 6, 2 ], [ 8, 9 ], [ 9, 7 ], [ 10, 16 ], [ 11, 13 ], [ 12, 18 ], [ 13, 14 ], [ 14, 15 ], [ 16, 11 ], [ 16, 12 ], [ 18, 19 ], [ 19, 17 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Bruce knows Merle. Glenda knows Ricardo. Kimberly knows Chester. Everett knows Esme. Bruce knows Geraldine. Glenda knows Claire. Ricardo knows Nolan. Lucas knows Kimberly. Nolan knows Ken. Everett knows Riley. Louis knows Trevor. Esme knows Louis. Geraldine knows Lucas. Joaquin knows Dorian. Joaquin knows Gideon. Geraldine knows Beth. Nolan knows Everett. Gideon knows Bruce. Which of Trevor and Chester can Joaquin reach?", "answer": "Chester", "steps": [ "Joaquin knows Gideon.", "Gideon knows Bruce.", "Bruce knows Geraldine.", "Geraldine knows Lucas.", "Lucas knows Kimberly.", "Kimberly knows Chester." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Joaquin", "Chester", "Dorian", "Lucas", "Gideon", "Bruce", "Kimberly", "Beth", "Merle", "Geraldine", "Glenda", "Trevor", "Claire", "Esme", "Ricardo", "Nolan", "Louis", "Riley", "Ken", "Everett" ], "edges": [ [ 0, 2 ], [ 0, 4 ], [ 3, 6 ], [ 4, 5 ], [ 5, 8 ], [ 5, 9 ], [ 6, 1 ], [ 9, 3 ], [ 9, 7 ], [ 10, 12 ], [ 10, 14 ], [ 13, 16 ], [ 14, 15 ], [ 15, 18 ], [ 15, 19 ], [ 16, 11 ], [ 19, 13 ], [ 19, 17 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Emmett knows Gwen. Abel knows Arlene. Glen knows Essie. Emmett knows Abel. Carla knows Dewey. Reid knows Hardy. April knows Kirsten. Essie knows Frank. Helene knows Carla. Essie knows Mae. Guy knows Reid. Hardy knows Finn. Harry knows Helene. Helene knows James. Reid knows Emanuel. Reid knows Harry. Essie knows April. Frank knows Emmett. Which of Harry and Frank can Glen reach?", "answer": "Frank", "steps": [ "Glen knows Essie.", "Essie knows Frank." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Glen", "Mae", "Essie", "Arlene", "April", "Frank", "Gwen", "Emmett", "Abel", "Kirsten", "Guy", "Emanuel", "Reid", "Dewey", "Hardy", "Harry", "James", "Helene", "Carla", "Finn" ], "edges": [ [ 0, 2 ], [ 2, 1 ], [ 2, 5 ], [ 2, 4 ], [ 4, 9 ], [ 5, 7 ], [ 7, 6 ], [ 7, 8 ], [ 8, 3 ], [ 10, 12 ], [ 12, 11 ], [ 12, 15 ], [ 12, 14 ], [ 14, 19 ], [ 15, 17 ], [ 17, 16 ], [ 17, 18 ], [ 18, 13 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Emanuel knows Carol. Andrew knows Ruby. Kennedy knows Fiona. Leroy knows Willis. Carol knows Kirsten. Martin knows Amelia. Saul knows Khashayar. Ruby knows Jamie. Willis knows Earle. Kirsten knows Leroy. Kirsten knows Kennedy. Willis knows Corey. Corey knows Uma. Jamie knows Keith. Khashayar knows Vivian. Amelia knows Saul. Ruby knows Liam. Saul knows Andrew. Which of Willis and Ruby can Martin reach?", "answer": "Ruby", "steps": [ "Martin knows Amelia.", "Amelia knows Saul.", "Saul knows Andrew.", "Andrew knows Ruby." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Martin", "Jamie", "Khashayar", "Amelia", "Saul", "Ruby", "Liam", "Andrew", "Keith", "Vivian", "Emanuel", "Corey", "Kennedy", "Carol", "Kirsten", "Willis", "Earle", "Leroy", "Uma", "Fiona" ], "edges": [ [ 0, 3 ], [ 1, 8 ], [ 2, 9 ], [ 3, 4 ], [ 4, 7 ], [ 4, 2 ], [ 5, 6 ], [ 5, 1 ], [ 7, 5 ], [ 10, 13 ], [ 11, 18 ], [ 12, 19 ], [ 13, 14 ], [ 14, 17 ], [ 14, 12 ], [ 15, 16 ], [ 15, 11 ], [ 17, 15 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Eamon knows Nancy. Keaton knows Mason. Floyd knows Laurel. Eamon knows Carlos. Carlos knows Eve. Frankie knows Dale. Arthur knows Keaton. Floyd knows Joan. Joan knows Edgar. Nancy knows Bart. Keaton knows Floyd. Lilia knows Kendrick. Rocco knows Lilia. Laurel knows Kurt. Carlos knows Rocco. Rocco knows Jessie. Jessie knows Hannah. Arthur knows Frankie. Which of Kurt and Hannah can Eamon reach?", "answer": "Hannah", "steps": [ "Eamon knows Carlos.", "Carlos knows Rocco.", "Rocco knows Jessie.", "Jessie knows Hannah." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Eamon", "Carlos", "Hannah", "Eve", "Rocco", "Nancy", "Jessie", "Lilia", "Bart", "Kendrick", "Arthur", "Keaton", "Kurt", "Mason", "Floyd", "Frankie", "Laurel", "Joan", "Dale", "Edgar" ], "edges": [ [ 0, 5 ], [ 0, 1 ], [ 1, 3 ], [ 1, 4 ], [ 4, 6 ], [ 4, 7 ], [ 5, 8 ], [ 6, 2 ], [ 7, 9 ], [ 10, 15 ], [ 10, 11 ], [ 11, 13 ], [ 11, 14 ], [ 14, 16 ], [ 14, 17 ], [ 15, 18 ], [ 16, 12 ], [ 17, 19 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Susanne knows Brock. Ebony knows Giselle. Kate knows Bart. Bart knows Ebony. Randall knows Arnold. Trina knows Dana. Arnold knows Camden. Bailey knows Jeff. Dana knows Carmen. Bart knows Cassidy. Ernest knows Shelly. Arnold knows Jordan. Shelly knows Bailey. Jordan knows Kenneth. Shelly knows Daphne. Cassidy knows Randall. Dana knows Susanne. Carmen knows Ernest. Which of Ernest and Randall can Kate reach?", "answer": "Randall", "steps": [ "Kate knows Bart.", "Bart knows Cassidy.", "Cassidy knows Randall." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Kate", "Kenneth", "Arnold", "Cassidy", "Randall", "Ebony", "Giselle", "Bart", "Camden", "Jordan", "Trina", "Jeff", "Shelly", "Carmen", "Ernest", "Susanne", "Brock", "Dana", "Daphne", "Bailey" ], "edges": [ [ 0, 7 ], [ 2, 8 ], [ 2, 9 ], [ 3, 4 ], [ 4, 2 ], [ 5, 6 ], [ 7, 5 ], [ 7, 3 ], [ 9, 1 ], [ 10, 17 ], [ 12, 18 ], [ 12, 19 ], [ 13, 14 ], [ 14, 12 ], [ 15, 16 ], [ 17, 15 ], [ 17, 13 ], [ 19, 11 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Paul knows Delia. Edith knows Abigail. Oscar knows Rena. Edith knows Blake. Crystal knows Chandler. Blake knows Bernard. Janice knows Daria. Norman knows Esperanza. Langston knows Edith. Rena knows Greg. Oscar knows Lynn. Paul knows Oscar. Delia knows Crystal. Daria knows Langston. Sue knows Veronica. Jonah knows Norman. Veronica knows Paul. Langston knows Jonah. Which of Rena and Blake can Sue reach?", "answer": "Rena", "steps": [ "Sue knows Veronica.", "Veronica knows Paul.", "Paul knows Oscar.", "Oscar knows Rena." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Sue", "Paul", "Veronica", "Chandler", "Lynn", "Oscar", "Rena", "Greg", "Delia", "Crystal", "Janice", "Langston", "Daria", "Esperanza", "Abigail", "Edith", "Blake", "Bernard", "Jonah", "Norman" ], "edges": [ [ 0, 2 ], [ 1, 5 ], [ 1, 8 ], [ 2, 1 ], [ 5, 4 ], [ 5, 6 ], [ 6, 7 ], [ 8, 9 ], [ 9, 3 ], [ 10, 12 ], [ 11, 15 ], [ 11, 18 ], [ 12, 11 ], [ 15, 14 ], [ 15, 16 ], [ 16, 17 ], [ 18, 19 ], [ 19, 13 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "John knows Clyde. Julian knows Luella. Lawrence knows Julian. Mara knows Alana. Daphna knows Dudley. John knows Dustin. Leonard knows Walt. Clyde knows Dave. Luella knows Elise. Walt knows Kerry. John knows Gustavo. Fleur knows Erma. Leonard knows Mara. Luella knows Daphna. Fleur knows Lawrence. Fleur knows Nash. Dave knows Leonard. Elise knows Aldo. Which of Leonard and Luella can John reach?", "answer": "Leonard", "steps": [ "John knows Clyde.", "Clyde knows Dave.", "Dave knows Leonard." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "John", "Alana", "Gustavo", "Leonard", "Walt", "Mara", "Clyde", "Dustin", "Kerry", "Dave", "Fleur", "Dudley", "Erma", "Luella", "Elise", "Daphna", "Lawrence", "Nash", "Aldo", "Julian" ], "edges": [ [ 0, 2 ], [ 0, 7 ], [ 0, 6 ], [ 3, 5 ], [ 3, 4 ], [ 4, 8 ], [ 5, 1 ], [ 6, 9 ], [ 9, 3 ], [ 10, 12 ], [ 10, 17 ], [ 10, 16 ], [ 13, 15 ], [ 13, 14 ], [ 14, 18 ], [ 15, 11 ], [ 16, 19 ], [ 19, 13 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Carter knows Byron. Elise knows Sidney. Karina knows Jasmine. Byron knows Peggy. Uma knows Bruno. Carter knows Carl. Austin knows Elise. Angela knows Harvey. Jasmine knows Amelia. Harvey knows Amy. Amy knows Austin. Angela knows Arlene. Amelia knows Viola. Derrick knows Justin. Sidney knows Hal. Sidney knows Uma. Amelia knows Derrick. Peggy knows Karina. Which of Jasmine and Elise can Carter reach?", "answer": "Jasmine", "steps": [ "Carter knows Byron.", "Byron knows Peggy.", "Peggy knows Karina.", "Karina knows Jasmine." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Carter", "Jasmine", "Byron", "Derrick", "Amelia", "Viola", "Karina", "Justin", "Peggy", "Carl", "Angela", "Elise", "Harvey", "Uma", "Sidney", "Hal", "Austin", "Bruno", "Amy", "Arlene" ], "edges": [ [ 0, 2 ], [ 0, 9 ], [ 1, 4 ], [ 2, 8 ], [ 3, 7 ], [ 4, 5 ], [ 4, 3 ], [ 6, 1 ], [ 8, 6 ], [ 10, 12 ], [ 10, 19 ], [ 11, 14 ], [ 12, 18 ], [ 13, 17 ], [ 14, 15 ], [ 14, 13 ], [ 16, 11 ], [ 18, 16 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Fiona knows Damian. Henrietta knows Dorian. Jude knows Faye. Vernon knows Callum. Hugo knows Yolanda. Jude knows Ivan. Hugo knows Jason. Jason knows Eugenia. Martha knows Hugo. Hugo knows Hardy. Faye knows Boyd. Rocco knows Alfred. Jude knows Craig. Dorian knows Jude. Vernon knows Martha. Martha knows Fiona. Dorian knows Rocco. Henrietta knows Kobe. Which of Jude and Hugo can Henrietta reach?", "answer": "Jude", "steps": [ "Henrietta knows Dorian.", "Dorian knows Jude." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Henrietta", "Ivan", "Rocco", "Faye", "Alfred", "Jude", "Boyd", "Craig", "Kobe", "Dorian", "Vernon", "Hardy", "Fiona", "Jason", "Damian", "Hugo", "Eugenia", "Yolanda", "Callum", "Martha" ], "edges": [ [ 0, 8 ], [ 0, 9 ], [ 2, 4 ], [ 3, 6 ], [ 5, 1 ], [ 5, 3 ], [ 5, 7 ], [ 9, 2 ], [ 9, 5 ], [ 10, 18 ], [ 10, 19 ], [ 12, 14 ], [ 13, 16 ], [ 15, 11 ], [ 15, 13 ], [ 15, 17 ], [ 19, 12 ], [ 19, 15 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Harrison knows Yvonne. Yvonne knows Fraser. Lauren knows Maggie. Lorna knows Randall. Laura knows Lauren. Yvonne knows Ainsley. Blake knows Sam. Burt knows Laura. Lola knows Burt. Lauren knows Lewis. Blake knows Aubrey. Lauren knows Darrell. Blake knows Daphna. Fraser knows Dayton. Burt knows Jolena. Burt knows Lorna. Yvonne knows Anton. Ainsley knows Blake. Which of Ainsley and Laura can Harrison reach?", "answer": "Ainsley", "steps": [ "Harrison knows Yvonne.", "Yvonne knows Ainsley." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Harrison", "Ainsley", "Dayton", "Daphna", "Blake", "Aubrey", "Fraser", "Anton", "Yvonne", "Sam", "Lola", "Laura", "Randall", "Maggie", "Lauren", "Lewis", "Lorna", "Jolena", "Burt", "Darrell" ], "edges": [ [ 0, 8 ], [ 1, 4 ], [ 4, 3 ], [ 4, 5 ], [ 4, 9 ], [ 6, 2 ], [ 8, 6 ], [ 8, 7 ], [ 8, 1 ], [ 10, 18 ], [ 11, 14 ], [ 14, 13 ], [ 14, 15 ], [ 14, 19 ], [ 16, 12 ], [ 18, 16 ], [ 18, 17 ], [ 18, 11 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Arturo knows Antonio. Tom knows Garrison. Daria knows Etta. Etta knows Ted. Antonio knows Tom. Antonio knows Darren. Ryan knows Eamon. Ryan knows Cara. Alyson knows Arturo. Dexter knows Tanya. Frances knows Ryan. Cara knows Dick. Dexter knows Alyson. Lloyd knows Dexter. Daria knows Celia. Daria knows Dean. Dick knows Daria. Antonio knows Willard. Which of Cara and Alyson can Lloyd reach?", "answer": "Alyson", "steps": [ "Lloyd knows Dexter.", "Dexter knows Alyson." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Lloyd", "Darren", "Dexter", "Tom", "Willard", "Antonio", "Garrison", "Tanya", "Arturo", "Alyson", "Frances", "Celia", "Ryan", "Etta", "Dean", "Daria", "Ted", "Eamon", "Dick", "Cara" ], "edges": [ [ 0, 2 ], [ 2, 7 ], [ 2, 9 ], [ 3, 6 ], [ 5, 1 ], [ 5, 4 ], [ 5, 3 ], [ 8, 5 ], [ 9, 8 ], [ 10, 12 ], [ 12, 17 ], [ 12, 19 ], [ 13, 16 ], [ 15, 11 ], [ 15, 14 ], [ 15, 13 ], [ 18, 15 ], [ 19, 18 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Heath knows Aaron. Kristin knows Arden. Pablo knows Beau. Sierra knows Gonzalo. Bailey knows Gilbert. Gilbert knows Judy. Gonzalo knows Heath. Beau knows Bailey. Jessie knows Kristin. Melody knows Peggy. Peggy knows Lois. Beau knows Ernesto. Kristin knows Cornelius. Aaron knows Declan. Sierra knows Stella. Gilbert knows Cara. Cara knows Melody. Arden knows Sierra. Which of Gonzalo and Cara can Jessie reach?", "answer": "Gonzalo", "steps": [ "Jessie knows Kristin.", "Kristin knows Arden.", "Arden knows Sierra.", "Sierra knows Gonzalo." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Jessie", "Cornelius", "Aaron", "Heath", "Gonzalo", "Stella", "Arden", "Kristin", "Sierra", "Declan", "Pablo", "Ernesto", "Peggy", "Melody", "Cara", "Judy", "Bailey", "Beau", "Gilbert", "Lois" ], "edges": [ [ 0, 7 ], [ 2, 9 ], [ 3, 2 ], [ 4, 3 ], [ 6, 8 ], [ 7, 1 ], [ 7, 6 ], [ 8, 5 ], [ 8, 4 ], [ 10, 17 ], [ 12, 19 ], [ 13, 12 ], [ 14, 13 ], [ 16, 18 ], [ 17, 11 ], [ 17, 16 ], [ 18, 15 ], [ 18, 14 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Earle knows Laura. Roland knows Darcy. Lucy knows Betty. Kevin knows Dixie. Yolanda knows Mae. Betty knows Kevin. Greer knows Earle. George knows Thea. Joy knows Lucy. Kevin knows Yolanda. Edna knows Wallace. Laura knows George. Dirk knows Agnes. Thea knows Roland. Ivan knows Joy. Darcy knows Dirk. Darcy knows Cecilia. Wallace knows Ivan. Which of George and Joy can Edna reach?", "answer": "Joy", "steps": [ "Edna knows Wallace.", "Wallace knows Ivan.", "Ivan knows Joy." ], "difficulty": 3, "original_distance": 8, "idx_to_symbol": [ "Edna", "Mae", "Kevin", "Wallace", "Joy", "Lucy", "Betty", "Yolanda", "Dixie", "Ivan", "Greer", "Agnes", "Darcy", "Earle", "George", "Thea", "Roland", "Dirk", "Cecilia", "Laura" ], "edges": [ [ 0, 3 ], [ 2, 7 ], [ 2, 8 ], [ 3, 9 ], [ 4, 5 ], [ 5, 6 ], [ 6, 2 ], [ 7, 1 ], [ 9, 4 ], [ 10, 13 ], [ 12, 17 ], [ 12, 18 ], [ 13, 19 ], [ 14, 15 ], [ 15, 16 ], [ 16, 12 ], [ 17, 11 ], [ 19, 14 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Adam knows Jenna. Lucy knows Colby. Emanuel knows Dirk. Helene knows Emanuel. Jenna knows Lucy. Arturo knows Chloe. Beverly knows Alana. Simon knows Constance. Simon knows Aubrey. Rowan knows Lydia. Alana knows Kendra. Franklin knows Helene. Franklin knows Alejandro. Lucy knows Simon. Constance knows Beverly. Dirk knows Robert. Arturo knows Franklin. Lydia knows Arturo. Which of Kendra and Robert can Rowan reach?", "answer": "Robert", "steps": [ "Rowan knows Lydia.", "Lydia knows Arturo.", "Arturo knows Franklin.", "Franklin knows Helene.", "Helene knows Emanuel.", "Emanuel knows Dirk.", "Dirk knows Robert." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Rowan", "Chloe", "Franklin", "Arturo", "Dirk", "Emanuel", "Helene", "Lydia", "Alejandro", "Robert", "Adam", "Colby", "Simon", "Lucy", "Alana", "Beverly", "Constance", "Jenna", "Aubrey", "Kendra" ], "edges": [ [ 0, 7 ], [ 2, 8 ], [ 2, 6 ], [ 3, 1 ], [ 3, 2 ], [ 4, 9 ], [ 5, 4 ], [ 6, 5 ], [ 7, 3 ], [ 10, 17 ], [ 12, 18 ], [ 12, 16 ], [ 13, 11 ], [ 13, 12 ], [ 14, 19 ], [ 15, 14 ], [ 16, 15 ], [ 17, 13 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Fisher knows Val. Bernice knows Yasmin. Jared knows Keith. Terry knows Ford. Kaleb knows Fisher. Rebecca knows Elvira. Maya knows Natalie. Maya knows Javier. Elvira knows Celeste. Javier knows Kaleb. Celeste knows Bernice. Ford knows Jared. Val knows Latoya. Celeste knows Allan. Julia knows Blaine. Javier knows Everett. Blaine knows Maya. Bernice knows Terry. Which of Kaleb and Terry can Julia reach?", "answer": "Kaleb", "steps": [ "Julia knows Blaine.", "Blaine knows Maya.", "Maya knows Javier.", "Javier knows Kaleb." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Julia", "Latoya", "Fisher", "Javier", "Natalie", "Everett", "Blaine", "Val", "Maya", "Kaleb", "Rebecca", "Keith", "Ford", "Bernice", "Allan", "Yasmin", "Elvira", "Jared", "Celeste", "Terry" ], "edges": [ [ 0, 6 ], [ 2, 7 ], [ 3, 5 ], [ 3, 9 ], [ 6, 8 ], [ 7, 1 ], [ 8, 4 ], [ 8, 3 ], [ 9, 2 ], [ 10, 16 ], [ 12, 17 ], [ 13, 15 ], [ 13, 19 ], [ 16, 18 ], [ 17, 11 ], [ 18, 14 ], [ 18, 13 ], [ 19, 12 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Elijah knows Pablo. Boris knows Ida. Lois knows Odette. Odette knows Boris. Julia knows Antonio. Diana knows Fernando. Pablo knows Ruth. Foster knows Elijah. Lois knows Jude. Antonio knows Inez. Kirsten knows Lois. Diana knows Ember. Fernando knows Foster. Elizabeth knows Rena. Jude knows Elizabeth. Isaac knows Kirsten. Foster knows Julia. Isaac knows Kenzie. Which of Elizabeth and Antonio can Diana reach?", "answer": "Antonio", "steps": [ "Diana knows Fernando.", "Fernando knows Foster.", "Foster knows Julia.", "Julia knows Antonio." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Diana", "Ember", "Fernando", "Elijah", "Ruth", "Foster", "Pablo", "Inez", "Julia", "Antonio", "Isaac", "Kenzie", "Kirsten", "Odette", "Ida", "Lois", "Boris", "Rena", "Jude", "Elizabeth" ], "edges": [ [ 0, 1 ], [ 0, 2 ], [ 2, 5 ], [ 3, 6 ], [ 5, 3 ], [ 5, 8 ], [ 6, 4 ], [ 8, 9 ], [ 9, 7 ], [ 10, 11 ], [ 10, 12 ], [ 12, 15 ], [ 13, 16 ], [ 15, 13 ], [ 15, 18 ], [ 16, 14 ], [ 18, 19 ], [ 19, 17 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Dora knows Erma. Aria knows Lane. Eden knows Fraser. Anthony knows Ron. Byron knows Eden. Davis knows Aria. Eden knows Kerry. Ron knows Molly. Kerry knows Clifford. Lane knows Jenna. Erma knows Taylor. Rod knows Ava. Molly knows Byron. Gunnar knows Dora. Ron knows Harley. Archie knows Anthony. Lane knows Gunnar. Erma knows Rod. Which of Kerry and Rod can Archie reach?", "answer": "Kerry", "steps": [ "Archie knows Anthony.", "Anthony knows Ron.", "Ron knows Molly.", "Molly knows Byron.", "Byron knows Eden.", "Eden knows Kerry." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Archie", "Kerry", "Harley", "Byron", "Anthony", "Ron", "Molly", "Fraser", "Clifford", "Eden", "Davis", "Rod", "Jenna", "Dora", "Aria", "Lane", "Gunnar", "Taylor", "Ava", "Erma" ], "edges": [ [ 0, 4 ], [ 1, 8 ], [ 3, 9 ], [ 4, 5 ], [ 5, 2 ], [ 5, 6 ], [ 6, 3 ], [ 9, 7 ], [ 9, 1 ], [ 10, 14 ], [ 11, 18 ], [ 13, 19 ], [ 14, 15 ], [ 15, 12 ], [ 15, 16 ], [ 16, 13 ], [ 19, 17 ], [ 19, 11 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Leroy knows Nadine. Carlos knows Julio. Keegan knows Trevor. Lennox knows Felix. Rosa knows Allison. Nadine knows Kareem. Trevor knows Adelaide. Leo knows Carlos. Garland knows Barbara. Adelaide knows Lennox. Nadine knows Lucy. Allison knows Leo. Keegan knows Giselle. Rosa knows Darla. Houston knows Garland. Trevor knows Houston. Garland knows Monica. Allison knows Leroy. Which of Allison and Trevor can Rosa reach?", "answer": "Allison", "steps": [ "Rosa knows Allison." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Rosa", "Kareem", "Leo", "Carlos", "Leroy", "Julio", "Nadine", "Allison", "Lucy", "Darla", "Keegan", "Barbara", "Adelaide", "Lennox", "Houston", "Felix", "Garland", "Trevor", "Monica", "Giselle" ], "edges": [ [ 0, 7 ], [ 0, 9 ], [ 2, 3 ], [ 3, 5 ], [ 4, 6 ], [ 6, 1 ], [ 6, 8 ], [ 7, 2 ], [ 7, 4 ], [ 10, 17 ], [ 10, 19 ], [ 12, 13 ], [ 13, 15 ], [ 14, 16 ], [ 16, 11 ], [ 16, 18 ], [ 17, 12 ], [ 17, 14 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Lewis knows Destiny. Harmony knows Audrey. Sebastian knows Effie. Destiny knows Leo. Devon knows Janice. Sarah knows Shannon. Shannon knows Hailey. Vicki knows Harmony. Leo knows Rita. Effie knows Jean. Michelle knows Sebastian. Effie knows Alma. Audrey knows Maria. Harmony knows Arturo. Destiny knows Vicki. Leo knows Wendy. Shannon knows Devon. Sebastian knows Sarah. Which of Maria and Janice can Michelle reach?", "answer": "Janice", "steps": [ "Michelle knows Sebastian.", "Sebastian knows Sarah.", "Sarah knows Shannon.", "Shannon knows Devon.", "Devon knows Janice." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Michelle", "Sebastian", "Shannon", "Sarah", "Effie", "Jean", "Alma", "Hailey", "Janice", "Devon", "Lewis", "Destiny", "Harmony", "Vicki", "Leo", "Wendy", "Rita", "Arturo", "Maria", "Audrey" ], "edges": [ [ 0, 1 ], [ 1, 4 ], [ 1, 3 ], [ 2, 7 ], [ 2, 9 ], [ 3, 2 ], [ 4, 5 ], [ 4, 6 ], [ 9, 8 ], [ 10, 11 ], [ 11, 14 ], [ 11, 13 ], [ 12, 17 ], [ 12, 19 ], [ 13, 12 ], [ 14, 15 ], [ 14, 16 ], [ 19, 18 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Dahlia knows Erin. Gabriel knows Ebony. Erin knows Hudson. Dahlia knows Lucas. Lambert knows Gabriel. Keith knows Bernard. Bernard knows Pete. Gabriel knows Greta. Pete knows Rocco. Sean knows Darren. Lucas knows Keith. Deirdre knows Becky. Charity knows Deirdre. Madeline knows Dahlia. Greta knows Grady. Darren knows Charity. Rocco knows Harper. Ebony knows Sean. Which of Darren and Bernard can Lambert reach?", "answer": "Darren", "steps": [ "Lambert knows Gabriel.", "Gabriel knows Ebony.", "Ebony knows Sean.", "Sean knows Darren." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Lambert", "Deirdre", "Darren", "Gabriel", "Charity", "Becky", "Grady", "Sean", "Ebony", "Greta", "Madeline", "Rocco", "Bernard", "Dahlia", "Pete", "Harper", "Hudson", "Keith", "Lucas", "Erin" ], "edges": [ [ 0, 3 ], [ 1, 5 ], [ 2, 4 ], [ 3, 8 ], [ 3, 9 ], [ 4, 1 ], [ 7, 2 ], [ 8, 7 ], [ 9, 6 ], [ 10, 13 ], [ 11, 15 ], [ 12, 14 ], [ 13, 18 ], [ 13, 19 ], [ 14, 11 ], [ 17, 12 ], [ 18, 17 ], [ 19, 16 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Abel knows Alyson. Calvin knows Dell. Dave knows Abel. Alyson knows Naomi. Abel knows Axel. Alyson knows Austin. Jill knows Francesca. Edison knows Clifford. Abel knows Gary. Francesca knows Charlene. Roger knows Haven. Roger knows Edison. Roger knows Kelsey. Abel knows Chloe. Dell knows Dave. Edison knows Paige. Charlene knows Roger. Roger knows Elvis. Which of Roger and Abel can Jill reach?", "answer": "Roger", "steps": [ "Jill knows Francesca.", "Francesca knows Charlene.", "Charlene knows Roger." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Jill", "Kelsey", "Edison", "Francesca", "Paige", "Haven", "Clifford", "Roger", "Elvis", "Charlene", "Calvin", "Axel", "Alyson", "Dell", "Naomi", "Gary", "Austin", "Abel", "Chloe", "Dave" ], "edges": [ [ 0, 3 ], [ 2, 4 ], [ 2, 6 ], [ 3, 9 ], [ 7, 1 ], [ 7, 5 ], [ 7, 2 ], [ 7, 8 ], [ 9, 7 ], [ 10, 13 ], [ 12, 14 ], [ 12, 16 ], [ 13, 19 ], [ 17, 11 ], [ 17, 15 ], [ 17, 12 ], [ 17, 18 ], [ 19, 17 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Gladys knows Jenna. Cristina knows Peggy. Ursula knows Leigh. Antonio knows Guy. Sally knows Carmela. Gladys knows Lola. Catherine knows Monroe. Leigh knows Sally. Rebecca knows Arturo. Charles knows Jonathan. Rebecca knows Antonio. Sally knows Noel. Justine knows Charles. Guy knows Tom. Catherine knows Justine. Guy knows Cristina. Peggy knows Gladys. Charles knows Ursula. Which of Peggy and Leigh can Catherine reach?", "answer": "Leigh", "steps": [ "Catherine knows Justine.", "Justine knows Charles.", "Charles knows Ursula.", "Ursula knows Leigh." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Catherine", "Charles", "Jonathan", "Noel", "Ursula", "Justine", "Sally", "Carmela", "Monroe", "Leigh", "Rebecca", "Guy", "Tom", "Lola", "Cristina", "Antonio", "Gladys", "Jenna", "Arturo", "Peggy" ], "edges": [ [ 0, 8 ], [ 0, 5 ], [ 1, 2 ], [ 1, 4 ], [ 4, 9 ], [ 5, 1 ], [ 6, 3 ], [ 6, 7 ], [ 9, 6 ], [ 10, 18 ], [ 10, 15 ], [ 11, 12 ], [ 11, 14 ], [ 14, 19 ], [ 15, 11 ], [ 16, 13 ], [ 16, 17 ], [ 19, 16 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Avery knows Charlotte. Gail knows Hayley. Gail knows Lucia. Avery knows Gail. Charlotte knows Nina. Hayley knows Hunter. Hunter knows Glen. Luke knows Jameson. Darius knows Dennis. Marcia knows Samuel. Marcia knows Darius. Marcia knows Brooks. Keaton knows Luke. Avery knows Ron. Brooks knows Keaton. Brooks knows Riley. Nina knows Dustin. Dennis knows Isadora. Which of Gail and Brooks can Marcia reach?", "answer": "Brooks", "steps": [ "Marcia knows Brooks." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Marcia", "Isadora", "Dennis", "Keaton", "Luke", "Darius", "Samuel", "Jameson", "Brooks", "Riley", "Avery", "Dustin", "Nina", "Hayley", "Hunter", "Charlotte", "Ron", "Glen", "Gail", "Lucia" ], "edges": [ [ 0, 5 ], [ 0, 6 ], [ 0, 8 ], [ 2, 1 ], [ 3, 4 ], [ 4, 7 ], [ 5, 2 ], [ 8, 3 ], [ 8, 9 ], [ 10, 15 ], [ 10, 16 ], [ 10, 18 ], [ 12, 11 ], [ 13, 14 ], [ 14, 17 ], [ 15, 12 ], [ 18, 13 ], [ 18, 19 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Robin knows Charlene. Isla knows Deborah. Ember knows Lyric. Ashton knows Robin. Isla knows Fergus. Ember knows Patricia. Ella knows Verna. Charlene knows Frank. Lyric knows Isla. Fergus knows Sheila. Ella knows Gerard. Frank knows Dayton. Frank knows Archer. Gerard knows Ember. Melody knows Pierce. Robin knows Keaton. Melody knows Ashton. Archer knows Caleb. Which of Archer and Fergus can Ella reach?", "answer": "Fergus", "steps": [ "Ella knows Gerard.", "Gerard knows Ember.", "Ember knows Lyric.", "Lyric knows Isla.", "Isla knows Fergus." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Ella", "Gerard", "Sheila", "Lyric", "Verna", "Fergus", "Deborah", "Patricia", "Isla", "Ember", "Melody", "Ashton", "Caleb", "Charlene", "Pierce", "Archer", "Dayton", "Keaton", "Frank", "Robin" ], "edges": [ [ 0, 4 ], [ 0, 1 ], [ 1, 9 ], [ 3, 8 ], [ 5, 2 ], [ 8, 5 ], [ 8, 6 ], [ 9, 7 ], [ 9, 3 ], [ 10, 14 ], [ 10, 11 ], [ 11, 19 ], [ 13, 18 ], [ 15, 12 ], [ 18, 15 ], [ 18, 16 ], [ 19, 17 ], [ 19, 13 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Scott knows Loretta. Eldon knows Clifford. Isaac knows Magdalena. Eldon knows Amelia. Mason knows Kareem. Mason knows Darnell. Amelia knows Pete. Alison knows Tracy. Kareem knows Alison. Isaac knows Elodie. Walter knows Isaac. Drew knows Scott. Pete knows Diego. Sadie knows Mason. Scott knows Norman. Norman knows Eldon. Scott knows Franklin. Isaac knows Sadie. Which of Amelia and Kareem can Drew reach?", "answer": "Amelia", "steps": [ "Drew knows Scott.", "Scott knows Norman.", "Norman knows Eldon.", "Eldon knows Amelia." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Drew", "Clifford", "Norman", "Amelia", "Diego", "Franklin", "Pete", "Loretta", "Eldon", "Scott", "Walter", "Darnell", "Sadie", "Kareem", "Tracy", "Elodie", "Alison", "Magdalena", "Mason", "Isaac" ], "edges": [ [ 0, 9 ], [ 2, 8 ], [ 3, 6 ], [ 6, 4 ], [ 8, 1 ], [ 8, 3 ], [ 9, 5 ], [ 9, 7 ], [ 9, 2 ], [ 10, 19 ], [ 12, 18 ], [ 13, 16 ], [ 16, 14 ], [ 18, 11 ], [ 18, 13 ], [ 19, 15 ], [ 19, 17 ], [ 19, 12 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Haven knows Dylan. Arthur knows Declan. Madeline knows Julian. Arthur knows Bill. Tonya knows Erica. Elsa knows Gerald. Haven knows Fred. Erica knows Madeline. Gonzalo knows Rhonda. Gonzalo knows Tanya. Gerald knows Ramon. Dylan knows Elsa. Martha knows Lottie. Lottie knows Edmund. Fred knows Gonzalo. Lottie knows Tonya. Clay knows Haven. Edmund knows Arthur. Which of Haven and Lottie can Martha reach?", "answer": "Lottie", "steps": [ "Martha knows Lottie." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Martha", "Erica", "Declan", "Tonya", "Arthur", "Julian", "Lottie", "Edmund", "Madeline", "Bill", "Clay", "Elsa", "Rhonda", "Dylan", "Gonzalo", "Ramon", "Haven", "Fred", "Gerald", "Tanya" ], "edges": [ [ 0, 6 ], [ 1, 8 ], [ 3, 1 ], [ 4, 2 ], [ 4, 9 ], [ 6, 3 ], [ 6, 7 ], [ 7, 4 ], [ 8, 5 ], [ 10, 16 ], [ 11, 18 ], [ 13, 11 ], [ 14, 12 ], [ 14, 19 ], [ 16, 13 ], [ 16, 17 ], [ 17, 14 ], [ 18, 15 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Pedro knows Russ. Russ knows Pam. Judy knows Clark. Sylvia knows Greg. Sylvia knows Pedro. Pedro knows Harmony. Adrian knows Clay. Clark knows Claudia. Clay knows Stacy. Sylvia knows Leonard. Adrian knows Neville. Judy knows Ernest. Ruth knows Geoffrey. Neville knows Kylie. Russ knows Ruth. Adrian knows Parsa. Clay knows Judy. Leonard knows Chandler. Which of Pedro and Clay can Sylvia reach?", "answer": "Pedro", "steps": [ "Sylvia knows Pedro." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Sylvia", "Pam", "Geoffrey", "Russ", "Pedro", "Greg", "Harmony", "Chandler", "Leonard", "Ruth", "Adrian", "Ernest", "Claudia", "Judy", "Clay", "Parsa", "Stacy", "Kylie", "Neville", "Clark" ], "edges": [ [ 0, 5 ], [ 0, 8 ], [ 0, 4 ], [ 3, 1 ], [ 3, 9 ], [ 4, 6 ], [ 4, 3 ], [ 8, 7 ], [ 9, 2 ], [ 10, 15 ], [ 10, 18 ], [ 10, 14 ], [ 13, 11 ], [ 13, 19 ], [ 14, 16 ], [ 14, 13 ], [ 18, 17 ], [ 19, 12 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Fern knows Jacques. Dalton knows Larry. Jacques knows Adrian. Elliot knows Harris. Belinda knows Frances. Belinda knows Noah. Ivan knows Fern. Larry knows Yolanda. Imogen knows Dalton. Frances knows Keira. Fiona knows Kerry. Damian knows Belinda. Zelda knows Imogen. Kerry knows Zelda. Yolanda knows Don. Adrian knows Damian. Larry knows Elliot. Noah knows Joseph. Which of Dalton and Damian can Fiona reach?", "answer": "Dalton", "steps": [ "Fiona knows Kerry.", "Kerry knows Zelda.", "Zelda knows Imogen.", "Imogen knows Dalton." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Fiona", "Larry", "Kerry", "Harris", "Don", "Elliot", "Dalton", "Imogen", "Zelda", "Yolanda", "Ivan", "Belinda", "Fern", "Keira", "Joseph", "Frances", "Damian", "Adrian", "Jacques", "Noah" ], "edges": [ [ 0, 2 ], [ 1, 5 ], [ 1, 9 ], [ 2, 8 ], [ 5, 3 ], [ 6, 1 ], [ 7, 6 ], [ 8, 7 ], [ 9, 4 ], [ 10, 12 ], [ 11, 15 ], [ 11, 19 ], [ 12, 18 ], [ 15, 13 ], [ 16, 11 ], [ 17, 16 ], [ 18, 17 ], [ 19, 14 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "India knows Aldo. Latoya knows Lance. Randy knows Isla. Dick knows Omar. Cruz knows Dick. Latoya knows Myrtle. Isabel knows Jill. Myrtle knows Isabel. Dick knows Willis. Basil knows Cruz. Randy knows Byron. Terrence knows Gerard. Hattie knows Vicki. Jill knows Terrence. Cruz knows India. Hattie knows Aurora. Jill knows Hattie. Isla knows Basil. Which of Willis and Vicki can Latoya reach?", "answer": "Vicki", "steps": [ "Latoya knows Myrtle.", "Myrtle knows Isabel.", "Isabel knows Jill.", "Jill knows Hattie.", "Hattie knows Vicki." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Latoya", "Vicki", "Gerard", "Lance", "Isabel", "Jill", "Terrence", "Myrtle", "Aurora", "Hattie", "Randy", "Willis", "Aldo", "Byron", "Basil", "Cruz", "India", "Isla", "Omar", "Dick" ], "edges": [ [ 0, 3 ], [ 0, 7 ], [ 4, 5 ], [ 5, 6 ], [ 5, 9 ], [ 6, 2 ], [ 7, 4 ], [ 9, 1 ], [ 9, 8 ], [ 10, 13 ], [ 10, 17 ], [ 14, 15 ], [ 15, 16 ], [ 15, 19 ], [ 16, 12 ], [ 17, 14 ], [ 19, 11 ], [ 19, 18 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Annette knows Tom. Ruby knows Ellis. Theodore knows Bryan. Wendell knows Julian. Annette knows Val. Val knows Cate. Penny knows Pearl. Tom knows Samuel. Theodore knows Ray. Ruby knows Penny. Penny knows Percy. Julian knows Kaleb. Alison knows Wendell. Bryan knows Ruby. Percy knows Carlos. Julian knows Annette. Alison knows Renee. Pearl knows Evelyn. Which of Wendell and Bryan can Theodore reach?", "answer": "Bryan", "steps": [ "Theodore knows Bryan." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Theodore", "Bryan", "Percy", "Ray", "Pearl", "Ruby", "Ellis", "Evelyn", "Carlos", "Penny", "Alison", "Wendell", "Tom", "Renee", "Val", "Julian", "Kaleb", "Cate", "Samuel", "Annette" ], "edges": [ [ 0, 3 ], [ 0, 1 ], [ 1, 5 ], [ 2, 8 ], [ 4, 7 ], [ 5, 6 ], [ 5, 9 ], [ 9, 4 ], [ 9, 2 ], [ 10, 13 ], [ 10, 11 ], [ 11, 15 ], [ 12, 18 ], [ 14, 17 ], [ 15, 16 ], [ 15, 19 ], [ 19, 14 ], [ 19, 12 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Joshua knows Vicki. Arlene knows Kendrick. Clifford knows Belinda. Elliot knows Brody. Hope knows Faith. Devon knows Farrah. Michelle knows Elliot. Trevor knows Hope. Farrah knows Joshua. Kendrick knows Randall. Dennis knows Gary. Henry knows Trevor. Tabitha knows Arlene. Michelle knows Tabitha. Dennis knows Devon. Belinda knows Michelle. Clifford knows Hal. Farrah knows Henry. Which of Kendrick and Hope can Clifford reach?", "answer": "Kendrick", "steps": [ "Clifford knows Belinda.", "Belinda knows Michelle.", "Michelle knows Tabitha.", "Tabitha knows Arlene.", "Arlene knows Kendrick." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Clifford", "Tabitha", "Kendrick", "Hal", "Belinda", "Elliot", "Michelle", "Randall", "Arlene", "Brody", "Dennis", "Henry", "Hope", "Gary", "Devon", "Joshua", "Farrah", "Faith", "Trevor", "Vicki" ], "edges": [ [ 0, 3 ], [ 0, 4 ], [ 1, 8 ], [ 2, 7 ], [ 4, 6 ], [ 5, 9 ], [ 6, 1 ], [ 6, 5 ], [ 8, 2 ], [ 10, 13 ], [ 10, 14 ], [ 11, 18 ], [ 12, 17 ], [ 14, 16 ], [ 15, 19 ], [ 16, 11 ], [ 16, 15 ], [ 18, 12 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Daria knows Adelaide. Philip knows Anita. Griffith knows Iris. Russell knows Max. Katrina knows Melody. Katrina knows Xander. Avery knows Daria. Melody knows Griffith. Basil knows Autumn. Ken knows Harrison. Max knows Basil. Iris knows Philip. Hal knows Aisha. Daria knows Russell. Aisha knows Katrina. Hal knows Josie. Ken knows Avery. Autumn knows Elliot. Which of Melody and Russell can Ken reach?", "answer": "Russell", "steps": [ "Ken knows Avery.", "Avery knows Daria.", "Daria knows Russell." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Ken", "Russell", "Elliot", "Harrison", "Basil", "Adelaide", "Max", "Avery", "Daria", "Autumn", "Hal", "Melody", "Anita", "Josie", "Iris", "Xander", "Griffith", "Aisha", "Katrina", "Philip" ], "edges": [ [ 0, 3 ], [ 0, 7 ], [ 1, 6 ], [ 4, 9 ], [ 6, 4 ], [ 7, 8 ], [ 8, 5 ], [ 8, 1 ], [ 9, 2 ], [ 10, 13 ], [ 10, 17 ], [ 11, 16 ], [ 14, 19 ], [ 16, 14 ], [ 17, 18 ], [ 18, 15 ], [ 18, 11 ], [ 19, 12 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Brittany knows Louis. Kim knows Raymond. Noel knows Douglas. Goldie knows Atlas. Raymond knows Austin. Mary knows Tara. Yuki knows Mary. Donovan knows Yuki. Louis knows Lyle. Damian knows Autumn. Douglas knows Goldie. Gregory knows Kim. Autumn knows Gregory. Tamara knows Brittany. Mary knows Tamara. Gregory knows Noel. Nadine knows Nicole. Tara knows Nadine. Which of Autumn and Yuki can Damian reach?", "answer": "Autumn", "steps": [ "Damian knows Autumn." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Damian", "Kim", "Douglas", "Autumn", "Austin", "Gregory", "Atlas", "Raymond", "Goldie", "Noel", "Donovan", "Tara", "Brittany", "Yuki", "Nicole", "Mary", "Lyle", "Nadine", "Louis", "Tamara" ], "edges": [ [ 0, 3 ], [ 1, 7 ], [ 2, 8 ], [ 3, 5 ], [ 5, 1 ], [ 5, 9 ], [ 7, 4 ], [ 8, 6 ], [ 9, 2 ], [ 10, 13 ], [ 11, 17 ], [ 12, 18 ], [ 13, 15 ], [ 15, 11 ], [ 15, 19 ], [ 17, 14 ], [ 18, 16 ], [ 19, 12 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Hadley knows Lyric. Evelyn knows Catherine. Hadley knows Oscar. Griffith knows Deanna. Harrison knows Zach. Riley knows Elaine. Rebecca knows Harrison. Deanna knows Riley. Anita knows Zane. Margaret knows Anita. Anita knows Griffith. Riley knows Keith. Riley knows Evelyn. Lyric knows Odette. Zach knows Jeanne. Harrison knows Jorge. Hadley knows Basil. Jeanne knows Hadley. Which of Odette and Catherine can Rebecca reach?", "answer": "Odette", "steps": [ "Rebecca knows Harrison.", "Harrison knows Zach.", "Zach knows Jeanne.", "Jeanne knows Hadley.", "Hadley knows Lyric.", "Lyric knows Odette." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Rebecca", "Harrison", "Basil", "Jeanne", "Oscar", "Odette", "Lyric", "Zach", "Jorge", "Hadley", "Margaret", "Anita", "Elaine", "Deanna", "Keith", "Catherine", "Evelyn", "Griffith", "Zane", "Riley" ], "edges": [ [ 0, 1 ], [ 1, 8 ], [ 1, 7 ], [ 3, 9 ], [ 6, 5 ], [ 7, 3 ], [ 9, 2 ], [ 9, 4 ], [ 9, 6 ], [ 10, 11 ], [ 11, 18 ], [ 11, 17 ], [ 13, 19 ], [ 16, 15 ], [ 17, 13 ], [ 19, 12 ], [ 19, 14 ], [ 19, 16 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Harry knows Joaquin. Boris knows Eric. Lois knows Dina. Eric knows Winifred. Hattie knows Milo. Roger knows Lark. Luna knows Boris. Lark knows Keaton. Keaton knows Zelda. Joaquin knows Vance. Milo knows Julian. Luna knows Fleur. Lois knows Roger. Luna knows Ruth. Zelda knows Hattie. Lois knows Dallas. Elaine knows Harry. Winifred knows Elaine. Which of Lark and Eric can Luna reach?", "answer": "Eric", "steps": [ "Luna knows Boris.", "Boris knows Eric." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Luna", "Vance", "Winifred", "Fleur", "Boris", "Joaquin", "Eric", "Elaine", "Ruth", "Harry", "Lois", "Julian", "Keaton", "Dallas", "Roger", "Milo", "Lark", "Zelda", "Dina", "Hattie" ], "edges": [ [ 0, 3 ], [ 0, 8 ], [ 0, 4 ], [ 2, 7 ], [ 4, 6 ], [ 5, 1 ], [ 6, 2 ], [ 7, 9 ], [ 9, 5 ], [ 10, 13 ], [ 10, 18 ], [ 10, 14 ], [ 12, 17 ], [ 14, 16 ], [ 15, 11 ], [ 16, 12 ], [ 17, 19 ], [ 19, 15 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Fanny knows Damian. Stacy knows Natalie. Becky knows Parker. Ashton knows Stacy. Parker knows Frances. Edwin knows Gonzalo. Gus knows Fanny. Parker knows Tanya. Edwin knows Ashton. Harper knows Celeste. Marco knows Marc. Gonzalo knows Milo. Frances knows India. Gus knows Becky. Agnes knows Whitney. Stacy knows Harper. Parker knows Agnes. Stacy knows Marco. Which of Parker and Stacy can Edwin reach?", "answer": "Stacy", "steps": [ "Edwin knows Ashton.", "Ashton knows Stacy." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Edwin", "Milo", "Ashton", "Natalie", "Stacy", "Gonzalo", "Marco", "Harper", "Marc", "Celeste", "Gus", "Damian", "Becky", "Tanya", "Parker", "Fanny", "Agnes", "Frances", "Whitney", "India" ], "edges": [ [ 0, 5 ], [ 0, 2 ], [ 2, 4 ], [ 4, 3 ], [ 4, 6 ], [ 4, 7 ], [ 5, 1 ], [ 6, 8 ], [ 7, 9 ], [ 10, 15 ], [ 10, 12 ], [ 12, 14 ], [ 14, 13 ], [ 14, 16 ], [ 14, 17 ], [ 15, 11 ], [ 16, 18 ], [ 17, 19 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Dalton knows Joel. Joanna knows Livia. Clay knows Myra. Yuki knows Penny. Joanna knows Yuki. Yuki knows Harvey. Celia knows Isadora. Lorenzo knows Dalton. Dalton knows Ava. Ava knows Celia. Harvey knows Eldon. Myra knows Lorenzo. Judy knows Abel. Ava knows Sandra. Celia knows Khashayar. Louis knows Joanna. Harvey knows Edison. Abel knows Louis. Which of Isadora and Edison can Judy reach?", "answer": "Edison", "steps": [ "Judy knows Abel.", "Abel knows Louis.", "Louis knows Joanna.", "Joanna knows Yuki.", "Yuki knows Harvey.", "Harvey knows Edison." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Judy", "Harvey", "Joanna", "Louis", "Edison", "Livia", "Eldon", "Yuki", "Abel", "Penny", "Clay", "Celia", "Dalton", "Lorenzo", "Isadora", "Joel", "Khashayar", "Ava", "Myra", "Sandra" ], "edges": [ [ 0, 8 ], [ 1, 4 ], [ 1, 6 ], [ 2, 5 ], [ 2, 7 ], [ 3, 2 ], [ 7, 1 ], [ 7, 9 ], [ 8, 3 ], [ 10, 18 ], [ 11, 14 ], [ 11, 16 ], [ 12, 15 ], [ 12, 17 ], [ 13, 12 ], [ 17, 11 ], [ 17, 19 ], [ 18, 13 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Cooper knows Shannon. Eva knows Leslie. Chase knows Guy. Chase knows Kylie. Leslie knows Elodie. Khashayar knows Blaine. Myra knows Khashayar. Luis knows Alexa. Guy knows Eva. Alexa knows Sally. Jocelyn knows Dee. Luis knows Susanne. Kylie knows Cooper. Shannon knows Kendrick. Elodie knows Kristin. Susanne knows Alex. Alex knows Myra. Sally knows Jocelyn. Which of Blaine and Kristin can Chase reach?", "answer": "Kristin", "steps": [ "Chase knows Guy.", "Guy knows Eva.", "Eva knows Leslie.", "Leslie knows Elodie.", "Elodie knows Kristin." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Chase", "Elodie", "Kendrick", "Kylie", "Guy", "Eva", "Shannon", "Kristin", "Cooper", "Leslie", "Luis", "Khashayar", "Dee", "Alexa", "Susanne", "Alex", "Jocelyn", "Blaine", "Sally", "Myra" ], "edges": [ [ 0, 3 ], [ 0, 4 ], [ 1, 7 ], [ 3, 8 ], [ 4, 5 ], [ 5, 9 ], [ 6, 2 ], [ 8, 6 ], [ 9, 1 ], [ 10, 13 ], [ 10, 14 ], [ 11, 17 ], [ 13, 18 ], [ 14, 15 ], [ 15, 19 ], [ 16, 12 ], [ 18, 16 ], [ 19, 11 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Stacy knows Eden. Jasmine knows Morris. Christopher knows Lisette. Heather knows Louisa. Dylan knows Heather. Evan knows Sheila. Stacy knows Joaquin. Leopold knows Jasmine. Joaquin knows Stephen. Dylan knows Ella. Christopher knows Stacy. Heather knows Duke. Marian knows Evan. Louisa knows Marvin. Louisa knows Colin. Joaquin knows Edison. Edison knows Marian. Colin knows Leopold. Which of Stacy and Heather can Christopher reach?", "answer": "Stacy", "steps": [ "Christopher knows Stacy." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Christopher", "Stacy", "Sheila", "Joaquin", "Edison", "Marian", "Lisette", "Eden", "Evan", "Stephen", "Dylan", "Heather", "Morris", "Louisa", "Colin", "Leopold", "Ella", "Duke", "Jasmine", "Marvin" ], "edges": [ [ 0, 6 ], [ 0, 1 ], [ 1, 7 ], [ 1, 3 ], [ 3, 4 ], [ 3, 9 ], [ 4, 5 ], [ 5, 8 ], [ 8, 2 ], [ 10, 16 ], [ 10, 11 ], [ 11, 17 ], [ 11, 13 ], [ 13, 14 ], [ 13, 19 ], [ 14, 15 ], [ 15, 18 ], [ 18, 12 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Hector knows Nash. Edmund knows Darin. Carrie knows Edmund. Asher knows Lyric. Fred knows Fern. Nash knows Asher. Nadine knows Alison. Zoe knows Hector. Zoe knows Corinne. Carrie knows Elsa. Zoe knows Boris. Darin knows Haven. Asher knows Eugene. Alison knows Dane. Lyric knows Fred. Carrie knows Parker. Haven knows Nadine. Haven knows Jules. Which of Fern and Dane can Carrie reach?", "answer": "Dane", "steps": [ "Carrie knows Edmund.", "Edmund knows Darin.", "Darin knows Haven.", "Haven knows Nadine.", "Nadine knows Alison.", "Alison knows Dane." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Carrie", "Haven", "Dane", "Alison", "Edmund", "Nadine", "Jules", "Elsa", "Parker", "Darin", "Zoe", "Asher", "Fern", "Fred", "Hector", "Lyric", "Eugene", "Corinne", "Boris", "Nash" ], "edges": [ [ 0, 7 ], [ 0, 8 ], [ 0, 4 ], [ 1, 5 ], [ 1, 6 ], [ 3, 2 ], [ 4, 9 ], [ 5, 3 ], [ 9, 1 ], [ 10, 17 ], [ 10, 18 ], [ 10, 14 ], [ 11, 15 ], [ 11, 16 ], [ 13, 12 ], [ 14, 19 ], [ 15, 13 ], [ 19, 11 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Hadley knows Sandy. Brooks knows Brody. Nancy knows Gladys. Brooks knows Frankie. Celia knows Brooks. Sandy knows Hendrix. Bert knows Beatrice. Brody knows Geneva. Nancy knows Gus. Nancy knows Sebastian. Beatrice knows Nancy. Frankie knows Hadley. Eunice knows Martha. Martha knows Finn. Brody knows Logan. Brody knows Colby. Beatrice knows Amanda. Amanda knows Eunice. Which of Beatrice and Brooks can Celia reach?", "answer": "Brooks", "steps": [ "Celia knows Brooks." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Celia", "Frankie", "Logan", "Geneva", "Hadley", "Brody", "Sandy", "Hendrix", "Brooks", "Colby", "Bert", "Amanda", "Gus", "Gladys", "Eunice", "Nancy", "Martha", "Finn", "Beatrice", "Sebastian" ], "edges": [ [ 0, 8 ], [ 1, 4 ], [ 4, 6 ], [ 5, 2 ], [ 5, 3 ], [ 5, 9 ], [ 6, 7 ], [ 8, 1 ], [ 8, 5 ], [ 10, 18 ], [ 11, 14 ], [ 14, 16 ], [ 15, 12 ], [ 15, 13 ], [ 15, 19 ], [ 16, 17 ], [ 18, 11 ], [ 18, 15 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Clement knows Greta. Clement knows Dylan. Ashton knows Simon. Robin knows Gareth. Ashton knows Reid. Gareth knows Lorna. Simon knows Jack. Lyric knows Nelson. Jack knows Lyric. Reid knows Clement. Yvette knows Raymond. Raymond knows Robin. Dylan knows Clayton. Kit knows Bert. Carmen knows Kit. Yvette knows Carmen. Lyle knows Teresa. Kit knows Lyle. Which of Lyle and Dylan can Yvette reach?", "answer": "Lyle", "steps": [ "Yvette knows Carmen.", "Carmen knows Kit.", "Kit knows Lyle." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Yvette", "Robin", "Raymond", "Kit", "Bert", "Gareth", "Teresa", "Lorna", "Carmen", "Lyle", "Ashton", "Jack", "Simon", "Clement", "Greta", "Lyric", "Clayton", "Nelson", "Reid", "Dylan" ], "edges": [ [ 0, 2 ], [ 0, 8 ], [ 1, 5 ], [ 2, 1 ], [ 3, 4 ], [ 3, 9 ], [ 5, 7 ], [ 8, 3 ], [ 9, 6 ], [ 10, 12 ], [ 10, 18 ], [ 11, 15 ], [ 12, 11 ], [ 13, 14 ], [ 13, 19 ], [ 15, 17 ], [ 18, 13 ], [ 19, 16 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Gareth knows Dee. Scott knows Magdalena. Gareth knows Forrest. Judith knows Diego. Teresa knows Monica. Monica knows Scott. Aaron knows Pierce. Aaron knows Allison. Diego knows Evelyn. Magdalena knows Darnell. Dee knows Ivy. Aaron knows Alison. Alison knows Christian. Evelyn knows Gonzalo. Gonzalo knows Fern. Gareth knows Jon. Fern knows Aaron. Darnell knows Gareth. Which of Ivy and Christian can Teresa reach?", "answer": "Ivy", "steps": [ "Teresa knows Monica.", "Monica knows Scott.", "Scott knows Magdalena.", "Magdalena knows Darnell.", "Darnell knows Gareth.", "Gareth knows Dee.", "Dee knows Ivy." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Teresa", "Dee", "Jon", "Gareth", "Forrest", "Scott", "Ivy", "Darnell", "Magdalena", "Monica", "Judith", "Alison", "Allison", "Aaron", "Pierce", "Evelyn", "Christian", "Fern", "Gonzalo", "Diego" ], "edges": [ [ 0, 9 ], [ 1, 6 ], [ 3, 2 ], [ 3, 4 ], [ 3, 1 ], [ 5, 8 ], [ 7, 3 ], [ 8, 7 ], [ 9, 5 ], [ 10, 19 ], [ 11, 16 ], [ 13, 12 ], [ 13, 14 ], [ 13, 11 ], [ 15, 18 ], [ 17, 13 ], [ 18, 17 ], [ 19, 15 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Gene knows Peggy. Sidney knows Zach. Dina knows Herbert. Ava knows Iris. Bernice knows Morris. Alfred knows Christian. Todd knows Julia. Sidney knows Ava. Adrian knows Todd. Julia knows Wendell. Peggy knows Deborah. Peggy knows Bernice. Todd knows Dina. Herbert knows Sidney. Evan knows Alfred. Elliot knows Gene. Alfred knows Elliot. Christian knows Inez. Which of Ava and Bernice can Evan reach?", "answer": "Bernice", "steps": [ "Evan knows Alfred.", "Alfred knows Elliot.", "Elliot knows Gene.", "Gene knows Peggy.", "Peggy knows Bernice." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Evan", "Christian", "Bernice", "Elliot", "Morris", "Deborah", "Inez", "Alfred", "Gene", "Peggy", "Adrian", "Julia", "Ava", "Dina", "Iris", "Zach", "Wendell", "Todd", "Herbert", "Sidney" ], "edges": [ [ 0, 7 ], [ 1, 6 ], [ 2, 4 ], [ 3, 8 ], [ 7, 1 ], [ 7, 3 ], [ 8, 9 ], [ 9, 2 ], [ 9, 5 ], [ 10, 17 ], [ 11, 16 ], [ 12, 14 ], [ 13, 18 ], [ 17, 11 ], [ 17, 13 ], [ 18, 19 ], [ 19, 12 ], [ 19, 15 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Alder knows Robin. Alder knows Leander. Derrick knows Clay. Jerome knows Kathleen. Mae knows Peggy. Derrick knows Jose. Robin knows Latoya. Jose knows Hamilton. Jose knows Craig. Peggy knows Delilah. Nolan knows Yolanda. Clay knows Jodi. Peggy knows Nolan. Mae knows Jerome. Nolan knows Lena. Jose knows Alder. Peggy knows Maya. Yolanda knows Lewis. Which of Yolanda and Robin can Derrick reach?", "answer": "Robin", "steps": [ "Derrick knows Jose.", "Jose knows Alder.", "Alder knows Robin." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Derrick", "Alder", "Robin", "Clay", "Jodi", "Jose", "Craig", "Hamilton", "Leander", "Latoya", "Mae", "Nolan", "Yolanda", "Jerome", "Kathleen", "Peggy", "Maya", "Delilah", "Lena", "Lewis" ], "edges": [ [ 0, 3 ], [ 0, 5 ], [ 1, 8 ], [ 1, 2 ], [ 2, 9 ], [ 3, 4 ], [ 5, 6 ], [ 5, 7 ], [ 5, 1 ], [ 10, 13 ], [ 10, 15 ], [ 11, 18 ], [ 11, 12 ], [ 12, 19 ], [ 13, 14 ], [ 15, 16 ], [ 15, 17 ], [ 15, 11 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Miriam knows Sally. Fisher knows Paige. Wilma knows Mildred. Miriam knows Barbara. Federico knows Alicia. Rosemary knows Willis. Earl knows Jennifer. Jennifer knows Avery. Lorna knows Rosemary. Wilma knows Patrick. Miriam knows Drake. Mildred knows Louis. Barbara knows Natalie. Conner knows Federico. Alicia knows Lorna. Paige knows Earl. Sally knows Fisher. Wilma knows Conner. Which of Avery and Willis can Wilma reach?", "answer": "Willis", "steps": [ "Wilma knows Conner.", "Conner knows Federico.", "Federico knows Alicia.", "Alicia knows Lorna.", "Lorna knows Rosemary.", "Rosemary knows Willis." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Wilma", "Rosemary", "Willis", "Mildred", "Lorna", "Patrick", "Louis", "Federico", "Alicia", "Conner", "Miriam", "Jennifer", "Avery", "Barbara", "Earl", "Drake", "Natalie", "Fisher", "Paige", "Sally" ], "edges": [ [ 0, 5 ], [ 0, 3 ], [ 0, 9 ], [ 1, 2 ], [ 3, 6 ], [ 4, 1 ], [ 7, 8 ], [ 8, 4 ], [ 9, 7 ], [ 10, 15 ], [ 10, 13 ], [ 10, 19 ], [ 11, 12 ], [ 13, 16 ], [ 14, 11 ], [ 17, 18 ], [ 18, 14 ], [ 19, 17 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Earl knows Clement. Joan knows Belinda. Roger knows Isiah. Jessica knows Deborah. Simon knows Landon. Russ knows Jessica. Gage knows Joan. Dewey knows Teresa. Belinda knows Tanya. Isiah knows Jules. Landon knows Russ. Abel knows Gus. Joan knows Abel. Gus knows Jenny. Gus knows Roger. Landon knows Andre. Teresa knows Earl. Teresa knows Simon. Which of Deborah and Jules can Gage reach?", "answer": "Jules", "steps": [ "Gage knows Joan.", "Joan knows Abel.", "Abel knows Gus.", "Gus knows Roger.", "Roger knows Isiah.", "Isiah knows Jules." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Gage", "Joan", "Abel", "Jenny", "Roger", "Jules", "Isiah", "Gus", "Tanya", "Belinda", "Dewey", "Teresa", "Simon", "Andre", "Russ", "Deborah", "Jessica", "Landon", "Clement", "Earl" ], "edges": [ [ 0, 1 ], [ 1, 2 ], [ 1, 9 ], [ 2, 7 ], [ 4, 6 ], [ 6, 5 ], [ 7, 3 ], [ 7, 4 ], [ 9, 8 ], [ 10, 11 ], [ 11, 12 ], [ 11, 19 ], [ 12, 17 ], [ 14, 16 ], [ 16, 15 ], [ 17, 13 ], [ 17, 14 ], [ 19, 18 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Bennett knows Jeff. Aspen knows Israel. Aspen knows Gerald. Israel knows Everett. Jeff knows Della. Leland knows Saul. Leland knows Geoffrey. Grace knows Zane. Dora knows Bennett. Saul knows Lara. Geoffrey knows Gordon. Reid knows Dora. Yvette knows Fabian. Saul knows Malik. Malik knows Yvette. Everett knows Cesar. Zane knows Leland. Bennett knows Aspen. Which of Israel and Malik can Reid reach?", "answer": "Israel", "steps": [ "Reid knows Dora.", "Dora knows Bennett.", "Bennett knows Aspen.", "Aspen knows Israel." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Reid", "Jeff", "Gerald", "Aspen", "Israel", "Della", "Bennett", "Cesar", "Dora", "Everett", "Grace", "Geoffrey", "Lara", "Saul", "Malik", "Gordon", "Leland", "Fabian", "Zane", "Yvette" ], "edges": [ [ 0, 8 ], [ 1, 5 ], [ 3, 2 ], [ 3, 4 ], [ 4, 9 ], [ 6, 1 ], [ 6, 3 ], [ 8, 6 ], [ 9, 7 ], [ 10, 18 ], [ 11, 15 ], [ 13, 12 ], [ 13, 14 ], [ 14, 19 ], [ 16, 11 ], [ 16, 13 ], [ 18, 16 ], [ 19, 17 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Lucy knows Diego. Joaquin knows Hope. Lee knows Coral. Arden knows Lee. Grace knows Jose. Chase knows Dante. Joaquin knows Kennedy. Lucy knows Maria. Dante knows Kerry. Lars knows Bart. Hope knows Lucy. Coral knows Grace. Jerome knows Lars. Lars knows Burt. Grace knows Ibrahim. Dante knows Arden. Burt knows Joaquin. Lee knows Oliver. Which of Grace and Lucy can Jerome reach?", "answer": "Lucy", "steps": [ "Jerome knows Lars.", "Lars knows Burt.", "Burt knows Joaquin.", "Joaquin knows Hope.", "Hope knows Lucy." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Jerome", "Bart", "Joaquin", "Kennedy", "Diego", "Hope", "Burt", "Lars", "Maria", "Lucy", "Chase", "Kerry", "Lee", "Oliver", "Ibrahim", "Coral", "Arden", "Dante", "Jose", "Grace" ], "edges": [ [ 0, 7 ], [ 2, 3 ], [ 2, 5 ], [ 5, 9 ], [ 6, 2 ], [ 7, 1 ], [ 7, 6 ], [ 9, 4 ], [ 9, 8 ], [ 10, 17 ], [ 12, 13 ], [ 12, 15 ], [ 15, 19 ], [ 16, 12 ], [ 17, 11 ], [ 17, 16 ], [ 19, 14 ], [ 19, 18 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Marshall knows Leopold. Marshall knows Latoya. Oscar knows Marshall. Clayton knows Harry. Henry knows Estelle. Oscar knows Pam. Marshall knows Otto. Graeme knows Devin. Graeme knows Paul. Paul knows Kobe. Harry knows Elliot. Elliot knows Roger. Paul knows Henry. Brock knows Porter. Estelle knows Finn. Finn knows Brock. Latoya knows Clayton. Paul knows Jolene. Which of Porter and Roger can Graeme reach?", "answer": "Porter", "steps": [ "Graeme knows Paul.", "Paul knows Henry.", "Henry knows Estelle.", "Estelle knows Finn.", "Finn knows Brock.", "Brock knows Porter." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Graeme", "Brock", "Jolene", "Paul", "Devin", "Finn", "Henry", "Porter", "Kobe", "Estelle", "Oscar", "Elliot", "Otto", "Marshall", "Pam", "Harry", "Latoya", "Roger", "Leopold", "Clayton" ], "edges": [ [ 0, 4 ], [ 0, 3 ], [ 1, 7 ], [ 3, 2 ], [ 3, 8 ], [ 3, 6 ], [ 5, 1 ], [ 6, 9 ], [ 9, 5 ], [ 10, 14 ], [ 10, 13 ], [ 11, 17 ], [ 13, 12 ], [ 13, 18 ], [ 13, 16 ], [ 15, 11 ], [ 16, 19 ], [ 19, 15 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Winifred knows Casey. Linda knows Neil. Enrique knows Trudy. Lacey knows Linda. Casey knows Dustin. Ashton knows Mario. Graham knows Kevin. Trudy knows Kendrick. Kendrick knows Corinne. Kendrick knows Della. Christina knows Ashton. Melanie knows Enrique. Kaleb knows Graham. Enrique knows Henrietta. Casey knows Rowan. Lacey knows Christina. Ashton knows Winifred. Kaleb knows Melanie. Which of Kendrick and Casey can Lacey reach?", "answer": "Casey", "steps": [ "Lacey knows Christina.", "Christina knows Ashton.", "Ashton knows Winifred.", "Winifred knows Casey." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Lacey", "Christina", "Casey", "Ashton", "Rowan", "Dustin", "Neil", "Mario", "Winifred", "Linda", "Kaleb", "Melanie", "Kendrick", "Enrique", "Corinne", "Della", "Kevin", "Henrietta", "Trudy", "Graham" ], "edges": [ [ 0, 1 ], [ 0, 9 ], [ 1, 3 ], [ 2, 4 ], [ 2, 5 ], [ 3, 7 ], [ 3, 8 ], [ 8, 2 ], [ 9, 6 ], [ 10, 11 ], [ 10, 19 ], [ 11, 13 ], [ 12, 14 ], [ 12, 15 ], [ 13, 17 ], [ 13, 18 ], [ 18, 12 ], [ 19, 16 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Hayden knows Henry. Otto knows Milo. Brett knows Shaun. Otto knows Gloria. Gloria knows Erwin. Hayden knows Grace. Milo knows Bruce. Otto knows Clay. Shaun knows Clinton. Valerie knows Louise. Fred knows Basil. Grace knows Hal. Shaun knows Hayden. Hal knows Brenda. Basil knows Otto. Basil knows Flora. Bruce knows Conner. Hayden knows Valerie. Which of Brenda and Conner can Fred reach?", "answer": "Conner", "steps": [ "Fred knows Basil.", "Basil knows Otto.", "Otto knows Milo.", "Milo knows Bruce.", "Bruce knows Conner." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Fred", "Milo", "Clay", "Gloria", "Bruce", "Flora", "Otto", "Erwin", "Conner", "Basil", "Brett", "Grace", "Henry", "Valerie", "Hal", "Clinton", "Hayden", "Louise", "Brenda", "Shaun" ], "edges": [ [ 0, 9 ], [ 1, 4 ], [ 3, 7 ], [ 4, 8 ], [ 6, 2 ], [ 6, 3 ], [ 6, 1 ], [ 9, 5 ], [ 9, 6 ], [ 10, 19 ], [ 11, 14 ], [ 13, 17 ], [ 14, 18 ], [ 16, 12 ], [ 16, 13 ], [ 16, 11 ], [ 19, 15 ], [ 19, 16 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Amber knows Valerie. Dirk knows Jonas. Herman knows Chloe. Chloe knows Amber. Lucille knows Eugenia. Bart knows Dirk. Chloe knows Lucille. Penny knows Bert. Amber knows Janice. Bert knows Fletcher. Fletcher knows Jeff. Gabe knows Josie. Frida knows Julio. Sean knows Penny. Janice knows Bart. Penny knows Frida. Jeff knows Gabe. Bert knows Lisa. Which of Josie and Jonas can Sean reach?", "answer": "Josie", "steps": [ "Sean knows Penny.", "Penny knows Bert.", "Bert knows Fletcher.", "Fletcher knows Jeff.", "Jeff knows Gabe.", "Gabe knows Josie." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Sean", "Lisa", "Frida", "Penny", "Gabe", "Jeff", "Fletcher", "Josie", "Bert", "Julio", "Herman", "Valerie", "Lucille", "Chloe", "Dirk", "Bart", "Janice", "Jonas", "Amber", "Eugenia" ], "edges": [ [ 0, 3 ], [ 2, 9 ], [ 3, 8 ], [ 3, 2 ], [ 4, 7 ], [ 5, 4 ], [ 6, 5 ], [ 8, 1 ], [ 8, 6 ], [ 10, 13 ], [ 12, 19 ], [ 13, 18 ], [ 13, 12 ], [ 14, 17 ], [ 15, 14 ], [ 16, 15 ], [ 18, 11 ], [ 18, 16 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Peggy knows Saul. Grace knows Peggy. Darin knows Arthur. Cooper knows Simon. Simon knows Myra. Hendrix knows Grace. Eldon knows Heidi. Eldon knows Denise. Myra knows Lillian. Saul knows Eldon. Cooper knows Conner. Myra knows Marco. Graeme knows Aisha. Peggy knows Jacqueline. Doug knows Cooper. Lillian knows Darin. Bryan knows Doug. Denise knows Graeme. Which of Doug and Grace can Hendrix reach?", "answer": "Grace", "steps": [ "Hendrix knows Grace." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Hendrix", "Graeme", "Jacqueline", "Eldon", "Saul", "Grace", "Peggy", "Aisha", "Denise", "Heidi", "Bryan", "Darin", "Conner", "Myra", "Simon", "Doug", "Cooper", "Arthur", "Lillian", "Marco" ], "edges": [ [ 0, 5 ], [ 1, 7 ], [ 3, 8 ], [ 3, 9 ], [ 4, 3 ], [ 5, 6 ], [ 6, 2 ], [ 6, 4 ], [ 8, 1 ], [ 10, 15 ], [ 11, 17 ], [ 13, 18 ], [ 13, 19 ], [ 14, 13 ], [ 15, 16 ], [ 16, 12 ], [ 16, 14 ], [ 18, 11 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Brian knows Aldo. Lorraine knows Troy. Winston knows Derek. Jerry knows Harley. Jerry knows Diego. Harry knows Brian. Grant knows Lorraine. Autumn knows Frida. Troy knows Jerry. Aldo knows Jeff. Harley knows Autumn. Jeff knows Doris. Louisa knows Harry. Doris knows Willard. Diego knows Darrell. Aldo knows Winston. Winston knows Cora. Diego knows Dawn. Which of Jerry and Aldo can Louisa reach?", "answer": "Aldo", "steps": [ "Louisa knows Harry.", "Harry knows Brian.", "Brian knows Aldo." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Louisa", "Willard", "Brian", "Derek", "Aldo", "Doris", "Jeff", "Harry", "Cora", "Winston", "Grant", "Frida", "Troy", "Darrell", "Jerry", "Autumn", "Harley", "Lorraine", "Dawn", "Diego" ], "edges": [ [ 0, 7 ], [ 2, 4 ], [ 4, 6 ], [ 4, 9 ], [ 5, 1 ], [ 6, 5 ], [ 7, 2 ], [ 9, 3 ], [ 9, 8 ], [ 10, 17 ], [ 12, 14 ], [ 14, 16 ], [ 14, 19 ], [ 15, 11 ], [ 16, 15 ], [ 17, 12 ], [ 19, 13 ], [ 19, 18 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Aspen knows Ian. Marvin knows Walt. Dayton knows Vivian. Winifred knows Lola. Sheryl knows Beth. Vivian knows Sara. Sonia knows Arnold. Sara knows Molly. Molly knows Roman. Roman knows Aiden. Dayton knows Aspen. Stephen knows Sonia. Vivian knows Edmund. Sonia knows Winifred. Ian knows Joanna. Beth knows Wayne. Stephen knows Sheryl. Lola knows Marvin. Which of Vivian and Sonia can Dayton reach?", "answer": "Vivian", "steps": [ "Dayton knows Vivian." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Dayton", "Ian", "Aiden", "Sara", "Joanna", "Aspen", "Vivian", "Roman", "Edmund", "Molly", "Stephen", "Beth", "Walt", "Winifred", "Wayne", "Sheryl", "Sonia", "Marvin", "Arnold", "Lola" ], "edges": [ [ 0, 5 ], [ 0, 6 ], [ 1, 4 ], [ 3, 9 ], [ 5, 1 ], [ 6, 8 ], [ 6, 3 ], [ 7, 2 ], [ 9, 7 ], [ 10, 15 ], [ 10, 16 ], [ 11, 14 ], [ 13, 19 ], [ 15, 11 ], [ 16, 18 ], [ 16, 13 ], [ 17, 12 ], [ 19, 17 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Colin knows Susanne. Marian knows Beau. Charles knows Ashton. Charles knows Emery. Darnell knows Emanuel. Susanne knows Ira. Kyle knows Diana. Marian knows Trudy. Darnell knows Charles. Kyle knows Wendell. Susanne knows Lillian. Kyle knows Jude. Lillian knows Ken. Lillian knows Harrison. Charles knows Jon. Lillian knows Tony. Jude knows Darnell. Marian knows Colin. Which of Ashton and Harrison can Marian reach?", "answer": "Harrison", "steps": [ "Marian knows Colin.", "Colin knows Susanne.", "Susanne knows Lillian.", "Lillian knows Harrison." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Marian", "Lillian", "Ira", "Susanne", "Colin", "Ken", "Beau", "Trudy", "Harrison", "Tony", "Kyle", "Charles", "Emanuel", "Darnell", "Jude", "Jon", "Wendell", "Diana", "Ashton", "Emery" ], "edges": [ [ 0, 6 ], [ 0, 7 ], [ 0, 4 ], [ 1, 5 ], [ 1, 8 ], [ 1, 9 ], [ 3, 2 ], [ 3, 1 ], [ 4, 3 ], [ 10, 16 ], [ 10, 17 ], [ 10, 14 ], [ 11, 15 ], [ 11, 18 ], [ 11, 19 ], [ 13, 12 ], [ 13, 11 ], [ 14, 13 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Cecilia knows Angelica. Ainsley knows Monroe. Angelica knows Aisha. Ainsley knows Simon. Aisha knows India. Tamara knows Edwin. Darcy knows Verna. Angelica knows Vivian. Vivian knows Emmett. Simon knows Darcy. Aisha knows Clayton. Clayton knows Belinda. Jeremy knows Ainsley. Darcy knows Horace. Colleen knows Cecilia. Verna knows Nadine. Simon knows Tamara. Cecilia knows Elsa. Which of Aisha and Darcy can Jeremy reach?", "answer": "Darcy", "steps": [ "Jeremy knows Ainsley.", "Ainsley knows Simon.", "Simon knows Darcy." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Jeremy", "Verna", "Nadine", "Horace", "Darcy", "Monroe", "Ainsley", "Tamara", "Simon", "Edwin", "Colleen", "Clayton", "Belinda", "India", "Aisha", "Elsa", "Cecilia", "Vivian", "Angelica", "Emmett" ], "edges": [ [ 0, 6 ], [ 1, 2 ], [ 4, 1 ], [ 4, 3 ], [ 6, 5 ], [ 6, 8 ], [ 7, 9 ], [ 8, 4 ], [ 8, 7 ], [ 10, 16 ], [ 11, 12 ], [ 14, 11 ], [ 14, 13 ], [ 16, 15 ], [ 16, 18 ], [ 17, 19 ], [ 18, 14 ], [ 18, 17 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Leo knows Clinton. Fletcher knows Cornelius. Fletcher knows Karla. Roy knows Fletcher. Fletcher knows Zara. Neal knows Colin. Zara knows Michelle. Selena knows Leo. Daniella knows Omar. Neal knows Luella. Luella knows Ralph. Gustavo knows Evan. Leo knows Daniella. Fletcher knows Inez. Leo knows Neal. Karla knows Marcus. Karla knows Gustavo. Leo knows Jacqueline. Which of Neal and Karla can Selena reach?", "answer": "Neal", "steps": [ "Selena knows Leo.", "Leo knows Neal." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Selena", "Luella", "Neal", "Daniella", "Jacqueline", "Ralph", "Omar", "Colin", "Leo", "Clinton", "Roy", "Gustavo", "Karla", "Zara", "Inez", "Evan", "Michelle", "Marcus", "Fletcher", "Cornelius" ], "edges": [ [ 0, 8 ], [ 1, 5 ], [ 2, 1 ], [ 2, 7 ], [ 3, 6 ], [ 8, 4 ], [ 8, 3 ], [ 8, 2 ], [ 8, 9 ], [ 10, 18 ], [ 11, 15 ], [ 12, 11 ], [ 12, 17 ], [ 13, 16 ], [ 18, 14 ], [ 18, 13 ], [ 18, 12 ], [ 18, 19 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Cruz knows Shelby. Shelby knows Kit. Jake knows Jerome. Jake knows Nina. Wade knows Sue. Shelby knows Nancy. Sue knows Jake. Sue knows Jermaine. Lyric knows Gladys. Percy knows Eamon. Jermaine knows Lyric. Rex knows Eunice. Rex knows Kane. Eamon knows Gloria. Gloria knows Cruz. Juan knows Wade. Gloria knows Rex. Lyric knows Antonio. Which of Shelby and Lyric can Juan reach?", "answer": "Lyric", "steps": [ "Juan knows Wade.", "Wade knows Sue.", "Sue knows Jermaine.", "Jermaine knows Lyric." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Juan", "Jake", "Jermaine", "Lyric", "Wade", "Nina", "Jerome", "Sue", "Gladys", "Antonio", "Percy", "Rex", "Cruz", "Shelby", "Eamon", "Kane", "Eunice", "Gloria", "Kit", "Nancy" ], "edges": [ [ 0, 4 ], [ 1, 5 ], [ 1, 6 ], [ 2, 3 ], [ 3, 8 ], [ 3, 9 ], [ 4, 7 ], [ 7, 1 ], [ 7, 2 ], [ 10, 14 ], [ 11, 15 ], [ 11, 16 ], [ 12, 13 ], [ 13, 18 ], [ 13, 19 ], [ 14, 17 ], [ 17, 11 ], [ 17, 12 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Keith knows Russ. Vera knows Zelda. Malik knows Marc. Isadora knows Vera. Horace knows Kathleen. Jolene knows Tessa. Keith knows Leo. Leo knows Kieran. Zelda knows Jolene. Horace knows Brett. Keith knows Billy. Vera knows Emanuel. Vera knows Geoffrey. Brett knows Keith. Russ knows Malik. Finn knows Adrian. Geoffrey knows Palmer. Finn knows Isadora. Which of Zelda and Russ can Horace reach?", "answer": "Russ", "steps": [ "Horace knows Brett.", "Brett knows Keith.", "Keith knows Russ." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Horace", "Keith", "Marc", "Kieran", "Malik", "Kathleen", "Billy", "Leo", "Russ", "Brett", "Finn", "Vera", "Tessa", "Palmer", "Jolene", "Adrian", "Emanuel", "Geoffrey", "Zelda", "Isadora" ], "edges": [ [ 0, 5 ], [ 0, 9 ], [ 1, 6 ], [ 1, 7 ], [ 1, 8 ], [ 4, 2 ], [ 7, 3 ], [ 8, 4 ], [ 9, 1 ], [ 10, 15 ], [ 10, 19 ], [ 11, 16 ], [ 11, 17 ], [ 11, 18 ], [ 14, 12 ], [ 17, 13 ], [ 18, 14 ], [ 19, 11 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Gunnar knows Winston. Deborah knows Victor. Laura knows Pam. Celia knows Joel. Victor knows Jack. Dominic knows Susan. Laura knows Julio. Andre knows Corinne. Darren knows Celia. Henrietta knows Deborah. Henrietta knows Candice. Susan knows Terrence. Laura knows Gunnar. Corinne knows Dominic. Winston knows Andre. Joel knows Jaime. Jack knows Darren. Henrietta knows Luis. Which of Corinne and Darren can Henrietta reach?", "answer": "Darren", "steps": [ "Henrietta knows Deborah.", "Deborah knows Victor.", "Victor knows Jack.", "Jack knows Darren." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Henrietta", "Candice", "Deborah", "Jack", "Joel", "Darren", "Jaime", "Luis", "Victor", "Celia", "Laura", "Julio", "Gunnar", "Andre", "Susan", "Corinne", "Terrence", "Pam", "Winston", "Dominic" ], "edges": [ [ 0, 1 ], [ 0, 7 ], [ 0, 2 ], [ 2, 8 ], [ 3, 5 ], [ 4, 6 ], [ 5, 9 ], [ 8, 3 ], [ 9, 4 ], [ 10, 11 ], [ 10, 17 ], [ 10, 12 ], [ 12, 18 ], [ 13, 15 ], [ 14, 16 ], [ 15, 19 ], [ 18, 13 ], [ 19, 14 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Lena knows Atlas. Lena knows Reed. Taylor knows Erwin. Lena knows Alana. Alexa knows Arnold. Drake knows Keaton. Geoffrey knows Stephanie. Keaton knows Wade. Ezra knows Drake. Lena knows Ezra. Atlas knows Rosemary. Arnold knows Tiffany. Stacy knows Taylor. Reed knows Corey. Stacy knows Geoffrey. Stacy knows Calvin. Jerome knows Alexa. Stacy knows Jerome. Which of Alexa and Drake can Lena reach?", "answer": "Drake", "steps": [ "Lena knows Ezra.", "Ezra knows Drake." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Lena", "Alana", "Corey", "Atlas", "Keaton", "Wade", "Drake", "Rosemary", "Reed", "Ezra", "Stacy", "Calvin", "Stephanie", "Taylor", "Arnold", "Tiffany", "Alexa", "Erwin", "Geoffrey", "Jerome" ], "edges": [ [ 0, 1 ], [ 0, 3 ], [ 0, 8 ], [ 0, 9 ], [ 3, 7 ], [ 4, 5 ], [ 6, 4 ], [ 8, 2 ], [ 9, 6 ], [ 10, 11 ], [ 10, 13 ], [ 10, 18 ], [ 10, 19 ], [ 13, 17 ], [ 14, 15 ], [ 16, 14 ], [ 18, 12 ], [ 19, 16 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Leroy knows Nadine. Carlos knows Julio. Keegan knows Trevor. Lennox knows Felix. Rosa knows Allison. Nadine knows Kareem. Trevor knows Adelaide. Leo knows Carlos. Garland knows Barbara. Adelaide knows Lennox. Nadine knows Lucy. Allison knows Leo. Keegan knows Giselle. Rosa knows Darla. Houston knows Garland. Trevor knows Houston. Garland knows Monica. Allison knows Leroy. Which of Nadine and Garland can Rosa reach?", "answer": "Nadine", "steps": [ "Rosa knows Allison.", "Allison knows Leroy.", "Leroy knows Nadine." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Rosa", "Kareem", "Leo", "Carlos", "Leroy", "Julio", "Nadine", "Allison", "Lucy", "Darla", "Keegan", "Barbara", "Adelaide", "Lennox", "Houston", "Felix", "Garland", "Trevor", "Monica", "Giselle" ], "edges": [ [ 0, 7 ], [ 0, 9 ], [ 2, 3 ], [ 3, 5 ], [ 4, 6 ], [ 6, 1 ], [ 6, 8 ], [ 7, 2 ], [ 7, 4 ], [ 10, 17 ], [ 10, 19 ], [ 12, 13 ], [ 13, 15 ], [ 14, 16 ], [ 16, 11 ], [ 16, 18 ], [ 17, 12 ], [ 17, 14 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Ella knows Anita. Emily knows Denver. Luella knows Todd. Lucille knows Flora. Anita knows Luella. Ella knows Harmony. Lucille knows Harris. Harris knows Jerome. Anita knows Leonard. Emily knows Damian. Gideon knows Lucille. Harris knows Everett. Harrison knows Thea. Clay knows Harrison. Denver knows Ella. Damian knows Frida. Clay knows Gideon. Everett knows Julius. Which of Julius and Todd can Emily reach?", "answer": "Todd", "steps": [ "Emily knows Denver.", "Denver knows Ella.", "Ella knows Anita.", "Anita knows Luella.", "Luella knows Todd." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Emily", "Frida", "Luella", "Anita", "Denver", "Todd", "Ella", "Damian", "Leonard", "Harmony", "Clay", "Thea", "Everett", "Harris", "Gideon", "Julius", "Lucille", "Harrison", "Jerome", "Flora" ], "edges": [ [ 0, 7 ], [ 0, 4 ], [ 2, 5 ], [ 3, 2 ], [ 3, 8 ], [ 4, 6 ], [ 6, 3 ], [ 6, 9 ], [ 7, 1 ], [ 10, 17 ], [ 10, 14 ], [ 12, 15 ], [ 13, 12 ], [ 13, 18 ], [ 14, 16 ], [ 16, 13 ], [ 16, 19 ], [ 17, 11 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Perry knows Javier. Cornelius knows Dick. Leopold knows Gordon. Marie knows Alex. Perry knows Leopold. Jonas knows Marie. Kylie knows Enid. Cornelius knows Jordan. Enid knows Gina. Earle knows Cornelius. Leopold knows Neville. Dick knows Travis. Kylie knows Deanna. Enid knows Earle. Marie knows Darius. Dick knows Alexa. Jonas knows Gregory. Gordon knows Jonas. Which of Marie and Dick can Perry reach?", "answer": "Marie", "steps": [ "Perry knows Leopold.", "Leopold knows Gordon.", "Gordon knows Jonas.", "Jonas knows Marie." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Perry", "Neville", "Alex", "Jonas", "Leopold", "Marie", "Javier", "Gregory", "Darius", "Gordon", "Kylie", "Gina", "Alexa", "Cornelius", "Enid", "Dick", "Deanna", "Jordan", "Travis", "Earle" ], "edges": [ [ 0, 6 ], [ 0, 4 ], [ 3, 7 ], [ 3, 5 ], [ 4, 1 ], [ 4, 9 ], [ 5, 2 ], [ 5, 8 ], [ 9, 3 ], [ 10, 16 ], [ 10, 14 ], [ 13, 17 ], [ 13, 15 ], [ 14, 11 ], [ 14, 19 ], [ 15, 12 ], [ 15, 18 ], [ 19, 13 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Keira knows Lamont. Jorge knows Lyle. Ryan knows Jorge. Doug knows Emma. Lambert knows Keira. Lyle knows Ilene. Devin knows Mario. Lambert knows Ryan. Clara knows Devin. Clara knows Doug. Lambert knows Dahlia. Ronald knows Lance. Lyle knows Quinn. Ronald knows Adam. Jude knows Wanda. Clara knows Jude. Wanda knows Ronald. Dahlia knows Hendrix. Which of Jorge and Wanda can Clara reach?", "answer": "Wanda", "steps": [ "Clara knows Jude.", "Jude knows Wanda." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Clara", "Jude", "Lance", "Adam", "Wanda", "Devin", "Doug", "Emma", "Mario", "Ronald", "Lambert", "Ryan", "Ilene", "Quinn", "Jorge", "Dahlia", "Keira", "Lamont", "Hendrix", "Lyle" ], "edges": [ [ 0, 6 ], [ 0, 5 ], [ 0, 1 ], [ 1, 4 ], [ 4, 9 ], [ 5, 8 ], [ 6, 7 ], [ 9, 2 ], [ 9, 3 ], [ 10, 16 ], [ 10, 15 ], [ 10, 11 ], [ 11, 14 ], [ 14, 19 ], [ 15, 18 ], [ 16, 17 ], [ 19, 12 ], [ 19, 13 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Estella knows Caroline. Stanley knows Susan. Emery knows Estella. Neville knows Emery. Neville knows Julian. Emery knows Dave. Caroline knows Aurora. Wade knows Axel. Charity knows Roger. Wade knows Charity. Kim knows Colette. Wade knows Rosemary. Neville knows Kim. Rosemary knows Lance. Daniella knows Neville. Rosemary knows Stanley. Heidi knows Wade. Susan knows Francesca. Which of Estella and Stanley can Heidi reach?", "answer": "Stanley", "steps": [ "Heidi knows Wade.", "Wade knows Rosemary.", "Rosemary knows Stanley." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Heidi", "Stanley", "Francesca", "Lance", "Charity", "Rosemary", "Axel", "Susan", "Wade", "Roger", "Daniella", "Estella", "Aurora", "Dave", "Kim", "Emery", "Julian", "Caroline", "Neville", "Colette" ], "edges": [ [ 0, 8 ], [ 1, 7 ], [ 4, 9 ], [ 5, 3 ], [ 5, 1 ], [ 7, 2 ], [ 8, 6 ], [ 8, 5 ], [ 8, 4 ], [ 10, 18 ], [ 11, 17 ], [ 14, 19 ], [ 15, 13 ], [ 15, 11 ], [ 17, 12 ], [ 18, 16 ], [ 18, 15 ], [ 18, 14 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Helene knows Glenn. Trina knows Noah. Stuart knows Trina. Kit knows Jake. Martin knows Carlos. Stuart knows Pete. Trina knows Kit. Jake knows Chloe. Doug knows Brooke. Dayton knows William. Chloe knows Jose. Martin knows Iris. Martin knows Kay. Kay knows Taylor. Kendrick knows Helene. Trina knows Dayton. Carlos knows Kendrick. Doug knows Martin. Which of Martin and Trina can Doug reach?", "answer": "Martin", "steps": [ "Doug knows Martin." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Doug", "Kay", "Martin", "Glenn", "Carlos", "Helene", "Brooke", "Iris", "Kendrick", "Taylor", "Stuart", "Dayton", "Trina", "Jose", "Kit", "Chloe", "Pete", "Noah", "Jake", "William" ], "edges": [ [ 0, 6 ], [ 0, 2 ], [ 1, 9 ], [ 2, 7 ], [ 2, 4 ], [ 2, 1 ], [ 4, 8 ], [ 5, 3 ], [ 8, 5 ], [ 10, 16 ], [ 10, 12 ], [ 11, 19 ], [ 12, 17 ], [ 12, 14 ], [ 12, 11 ], [ 14, 18 ], [ 15, 13 ], [ 18, 15 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Ibrahim knows Byron. Frank knows Walter. Edward knows Ibrahim. Larry knows Norman. Edward knows Louisa. Kristina knows Tabitha. Fraser knows Frank. Dylan knows Kristina. Frank knows Chad. Chad knows Dylan. Fernando knows Gail. Louisa knows Irma. Larry knows Jeanette. Ross knows Larry. Kristina knows Janelle. Hayley knows Ross. Ibrahim knows Hayley. Fraser knows Fernando. Which of Chad and Hayley can Fraser reach?", "answer": "Chad", "steps": [ "Fraser knows Frank.", "Frank knows Chad." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Fraser", "Kristina", "Janelle", "Chad", "Gail", "Frank", "Tabitha", "Walter", "Dylan", "Fernando", "Edward", "Larry", "Jeanette", "Hayley", "Irma", "Ibrahim", "Norman", "Byron", "Ross", "Louisa" ], "edges": [ [ 0, 5 ], [ 0, 9 ], [ 1, 2 ], [ 1, 6 ], [ 3, 8 ], [ 5, 7 ], [ 5, 3 ], [ 8, 1 ], [ 9, 4 ], [ 10, 15 ], [ 10, 19 ], [ 11, 12 ], [ 11, 16 ], [ 13, 18 ], [ 15, 17 ], [ 15, 13 ], [ 18, 11 ], [ 19, 14 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Chloe knows Frida. Leander knows Wilson. Frida knows Hope. Imogen knows Yolanda. Katherine knows Leander. Leander knows Imogen. Alison knows Ada. Janet knows Seth. Frida knows Chantal. Dale knows Janet. Frida knows Javier. Lilia knows Ann. Joyce knows Lilia. Chantal knows Alison. Leander knows Keith. Katherine knows Dale. Yolanda knows Preston. Chloe knows Joyce. Which of Imogen and Chantal can Katherine reach?", "answer": "Imogen", "steps": [ "Katherine knows Leander.", "Leander knows Imogen." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Katherine", "Keith", "Imogen", "Preston", "Dale", "Wilson", "Leander", "Janet", "Seth", "Yolanda", "Chloe", "Javier", "Chantal", "Ada", "Joyce", "Hope", "Frida", "Lilia", "Ann", "Alison" ], "edges": [ [ 0, 4 ], [ 0, 6 ], [ 2, 9 ], [ 4, 7 ], [ 6, 1 ], [ 6, 5 ], [ 6, 2 ], [ 7, 8 ], [ 9, 3 ], [ 10, 14 ], [ 10, 16 ], [ 12, 19 ], [ 14, 17 ], [ 16, 11 ], [ 16, 15 ], [ 16, 12 ], [ 17, 18 ], [ 19, 13 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Camille knows Trina. Ember knows Benjamin. Clarissa knows Foster. Ember knows Camille. Trina knows Marion. John knows Whitney. Alfonso knows Chloe. Richard knows Rachel. Whitney knows Drew. Benjamin knows Lois. Carter knows John. Chester knows Owen. Foster knows Richard. Chester knows Kirsten. Foster knows Ember. Owen knows Susanne. John knows Chester. Kirsten knows Alfonso. Which of Kirsten and Camille can Carter reach?", "answer": "Kirsten", "steps": [ "Carter knows John.", "John knows Chester.", "Chester knows Kirsten." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Carter", "Chloe", "Chester", "John", "Alfonso", "Whitney", "Kirsten", "Drew", "Susanne", "Owen", "Clarissa", "Marion", "Ember", "Foster", "Trina", "Richard", "Camille", "Rachel", "Lois", "Benjamin" ], "edges": [ [ 0, 3 ], [ 2, 6 ], [ 2, 9 ], [ 3, 5 ], [ 3, 2 ], [ 4, 1 ], [ 5, 7 ], [ 6, 4 ], [ 9, 8 ], [ 10, 13 ], [ 12, 16 ], [ 12, 19 ], [ 13, 15 ], [ 13, 12 ], [ 14, 11 ], [ 15, 17 ], [ 16, 14 ], [ 19, 18 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Matthew knows Irene. Eamon knows Emily. Matthew knows Blake. Emily knows Matthew. Blake knows Elliot. Emily knows Phoebe. Joseph knows Melody. Jim knows Cole. Boris knows Jim. Joseph knows Geoffrey. Joseph knows Lisa. Lisa knows Frida. Melody knows Hamilton. Frances knows Dolores. Matthew knows Frances. Jim knows Joseph. Emily knows Laurel. Jim knows Harriet. Which of Blake and Lisa can Eamon reach?", "answer": "Blake", "steps": [ "Eamon knows Emily.", "Emily knows Matthew.", "Matthew knows Blake." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Eamon", "Blake", "Phoebe", "Laurel", "Dolores", "Emily", "Frances", "Elliot", "Matthew", "Irene", "Boris", "Lisa", "Cole", "Harriet", "Hamilton", "Jim", "Melody", "Frida", "Joseph", "Geoffrey" ], "edges": [ [ 0, 5 ], [ 1, 7 ], [ 5, 2 ], [ 5, 3 ], [ 5, 8 ], [ 6, 4 ], [ 8, 6 ], [ 8, 1 ], [ 8, 9 ], [ 10, 15 ], [ 11, 17 ], [ 15, 12 ], [ 15, 13 ], [ 15, 18 ], [ 16, 14 ], [ 18, 16 ], [ 18, 11 ], [ 18, 19 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Lucy knows Diego. Joaquin knows Hope. Lee knows Coral. Arden knows Lee. Grace knows Jose. Chase knows Dante. Joaquin knows Kennedy. Lucy knows Maria. Dante knows Kerry. Lars knows Bart. Hope knows Lucy. Coral knows Grace. Jerome knows Lars. Lars knows Burt. Grace knows Ibrahim. Dante knows Arden. Burt knows Joaquin. Lee knows Oliver. Which of Jose and Maria can Jerome reach?", "answer": "Maria", "steps": [ "Jerome knows Lars.", "Lars knows Burt.", "Burt knows Joaquin.", "Joaquin knows Hope.", "Hope knows Lucy.", "Lucy knows Maria." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Jerome", "Bart", "Joaquin", "Kennedy", "Diego", "Hope", "Burt", "Lars", "Maria", "Lucy", "Chase", "Kerry", "Lee", "Oliver", "Ibrahim", "Coral", "Arden", "Dante", "Jose", "Grace" ], "edges": [ [ 0, 7 ], [ 2, 3 ], [ 2, 5 ], [ 5, 9 ], [ 6, 2 ], [ 7, 1 ], [ 7, 6 ], [ 9, 4 ], [ 9, 8 ], [ 10, 17 ], [ 12, 13 ], [ 12, 15 ], [ 15, 19 ], [ 16, 12 ], [ 17, 11 ], [ 17, 16 ], [ 19, 14 ], [ 19, 18 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Keaton knows Elizabeth. Morris knows Maude. Constance knows Michelle. Morris knows Leopold. Michelle knows Keaton. Wade knows Celeste. Constance knows Carey. Celeste knows Isadora. Celeste knows Daniel. Celeste knows Lucille. Keaton knows Morris. Daniel knows Katrina. Katrina knows Victor. Katrina knows Farrah. Constance knows Patrick. Victor knows Elena. Bernadette knows Constance. Victor knows Seth. Which of Elena and Leopold can Bernadette reach?", "answer": "Leopold", "steps": [ "Bernadette knows Constance.", "Constance knows Michelle.", "Michelle knows Keaton.", "Keaton knows Morris.", "Morris knows Leopold." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Bernadette", "Morris", "Keaton", "Constance", "Leopold", "Michelle", "Patrick", "Maude", "Carey", "Elizabeth", "Wade", "Victor", "Katrina", "Celeste", "Elena", "Daniel", "Isadora", "Seth", "Lucille", "Farrah" ], "edges": [ [ 0, 3 ], [ 1, 4 ], [ 1, 7 ], [ 2, 1 ], [ 2, 9 ], [ 3, 6 ], [ 3, 8 ], [ 3, 5 ], [ 5, 2 ], [ 10, 13 ], [ 11, 14 ], [ 11, 17 ], [ 12, 11 ], [ 12, 19 ], [ 13, 16 ], [ 13, 18 ], [ 13, 15 ], [ 15, 12 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Cora knows Alder. James knows Noel. Carol knows Gonzalo. Donovan knows Cora. Gonzalo knows Tristan. Ian knows Asher. Donovan knows Phoebe. Fritz knows Dakota. Philip knows Ian. Philip knows Ernesto. Philip knows Angela. Noel knows Glenda. Asher knows Xavier. Ian knows Demetrius. Carol knows Donovan. Cora knows Fritz. James knows Philip. Donovan knows Adam. Which of Cora and Ian can James reach?", "answer": "Ian", "steps": [ "James knows Philip.", "Philip knows Ian." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "James", "Ian", "Noel", "Asher", "Ernesto", "Demetrius", "Philip", "Angela", "Glenda", "Xavier", "Carol", "Cora", "Gonzalo", "Fritz", "Phoebe", "Alder", "Donovan", "Adam", "Tristan", "Dakota" ], "edges": [ [ 0, 2 ], [ 0, 6 ], [ 1, 5 ], [ 1, 3 ], [ 2, 8 ], [ 3, 9 ], [ 6, 4 ], [ 6, 7 ], [ 6, 1 ], [ 10, 12 ], [ 10, 16 ], [ 11, 15 ], [ 11, 13 ], [ 12, 18 ], [ 13, 19 ], [ 16, 14 ], [ 16, 17 ], [ 16, 11 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Randy knows Preston. Robin knows Billy. Randy knows Penny. Robin knows Brett. Robin knows Asher. Arthur knows Scott. Dallas knows Joseph. Itzel knows Hadley. Randy knows Dallas. Asher knows Farrah. Robin knows Arthur. Itzel knows Craig. Joseph knows Lorraine. Randy knows Betty. Farrah knows Clifford. Betty knows Itzel. Scott knows Cora. Farrah knows Justine. Which of Asher and Betty can Robin reach?", "answer": "Asher", "steps": [ "Robin knows Asher." ], "difficulty": 1, "original_distance": 3, "idx_to_symbol": [ "Robin", "Justine", "Clifford", "Brett", "Cora", "Scott", "Billy", "Farrah", "Arthur", "Asher", "Randy", "Craig", "Hadley", "Preston", "Lorraine", "Joseph", "Penny", "Itzel", "Dallas", "Betty" ], "edges": [ [ 0, 3 ], [ 0, 6 ], [ 0, 8 ], [ 0, 9 ], [ 5, 4 ], [ 7, 1 ], [ 7, 2 ], [ 8, 5 ], [ 9, 7 ], [ 10, 13 ], [ 10, 16 ], [ 10, 18 ], [ 10, 19 ], [ 15, 14 ], [ 17, 11 ], [ 17, 12 ], [ 18, 15 ], [ 19, 17 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Yara knows Andre. Irene knows Shelly. Ilene knows Barry. Kent knows Ivy. Brenda knows Sean. Andre knows Heidi. Shelly knows June. Felicia knows Tanya. Heidi knows Ilene. Jameson knows Angelica. Sean knows Jameson. Tanya knows Irene. Felicia knows Hamilton. June knows Brad. Ilene knows Ezra. June knows Jude. Jameson knows Yara. Ivy knows Felicia. Which of Andre and Irene can Kent reach?", "answer": "Irene", "steps": [ "Kent knows Ivy.", "Ivy knows Felicia.", "Felicia knows Tanya.", "Tanya knows Irene." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Kent", "Shelly", "Irene", "Ivy", "Brad", "Tanya", "June", "Jude", "Felicia", "Hamilton", "Brenda", "Heidi", "Andre", "Sean", "Ezra", "Yara", "Ilene", "Barry", "Jameson", "Angelica" ], "edges": [ [ 0, 3 ], [ 1, 6 ], [ 2, 1 ], [ 3, 8 ], [ 5, 2 ], [ 6, 4 ], [ 6, 7 ], [ 8, 5 ], [ 8, 9 ], [ 10, 13 ], [ 11, 16 ], [ 12, 11 ], [ 13, 18 ], [ 15, 12 ], [ 16, 14 ], [ 16, 17 ], [ 18, 15 ], [ 18, 19 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Austin knows Molly. Laurel knows Anton. Ellis knows Austin. Karen knows Henrietta. Henrietta knows Kingsley. Austin knows Yara. Grady knows Duke. Dahlia knows Laurel. Ivy knows Yvonne. Nadine knows Shane. Kingsley knows Ivy. Yvonne knows Dahlia. Melanie knows Eamon. Kingsley knows Melanie. Molly knows Lola. Kylie knows Ellis. Yara knows Nadine. Shane knows Grady. Which of Austin and Kingsley can Kylie reach?", "answer": "Austin", "steps": [ "Kylie knows Ellis.", "Ellis knows Austin." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Kylie", "Molly", "Austin", "Yara", "Grady", "Shane", "Ellis", "Lola", "Duke", "Nadine", "Karen", "Melanie", "Kingsley", "Ivy", "Laurel", "Dahlia", "Henrietta", "Eamon", "Anton", "Yvonne" ], "edges": [ [ 0, 6 ], [ 1, 7 ], [ 2, 1 ], [ 2, 3 ], [ 3, 9 ], [ 4, 8 ], [ 5, 4 ], [ 6, 2 ], [ 9, 5 ], [ 10, 16 ], [ 11, 17 ], [ 12, 11 ], [ 12, 13 ], [ 13, 19 ], [ 14, 18 ], [ 15, 14 ], [ 16, 12 ], [ 19, 15 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Vivian knows Natalie. Veronica knows Mitchell. Katrina knows Zack. Dalton knows Miranda. Zoe knows Inez. Mitchell knows Jewel. Fred knows Patrick. Vivian knows Katrina. Zack knows Harmony. Shelly knows Vivian. Jessica knows Zoe. Mitchell knows Robin. Jessica knows Bernard. Inez knows Fred. Miranda knows Shelly. Fred knows Veronica. Zack knows Clarence. Dalton knows Dora. Which of Katrina and Veronica can Dalton reach?", "answer": "Katrina", "steps": [ "Dalton knows Miranda.", "Miranda knows Shelly.", "Shelly knows Vivian.", "Vivian knows Katrina." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Dalton", "Katrina", "Miranda", "Clarence", "Dora", "Zack", "Harmony", "Vivian", "Shelly", "Natalie", "Jessica", "Veronica", "Zoe", "Jewel", "Bernard", "Mitchell", "Robin", "Fred", "Inez", "Patrick" ], "edges": [ [ 0, 4 ], [ 0, 2 ], [ 1, 5 ], [ 2, 8 ], [ 5, 3 ], [ 5, 6 ], [ 7, 1 ], [ 7, 9 ], [ 8, 7 ], [ 10, 14 ], [ 10, 12 ], [ 11, 15 ], [ 12, 18 ], [ 15, 13 ], [ 15, 16 ], [ 17, 11 ], [ 17, 19 ], [ 18, 17 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Dean knows Horace. Dean knows Tamara. Kane knows Joy. India knows Emanuel. Jeanne knows Nadine. Hannah knows Dora. Kit knows Morgan. Jeanne knows Harris. Jeanne knows Chandler. Morgan knows Ariel. Riley knows Jeanne. Chandler knows Elvis. Joy knows India. Jeanne knows Elaine. Kane knows Dean. Dean knows Harold. Riley knows Kit. Dean knows Hannah. Which of Jeanne and Dean can Riley reach?", "answer": "Jeanne", "steps": [ "Riley knows Jeanne." ], "difficulty": 1, "original_distance": 3, "idx_to_symbol": [ "Riley", "Ariel", "Morgan", "Kit", "Elvis", "Nadine", "Chandler", "Elaine", "Harris", "Jeanne", "Kane", "Emanuel", "India", "Joy", "Dora", "Harold", "Hannah", "Horace", "Tamara", "Dean" ], "edges": [ [ 0, 3 ], [ 0, 9 ], [ 2, 1 ], [ 3, 2 ], [ 6, 4 ], [ 9, 5 ], [ 9, 6 ], [ 9, 7 ], [ 9, 8 ], [ 10, 13 ], [ 10, 19 ], [ 12, 11 ], [ 13, 12 ], [ 16, 14 ], [ 19, 15 ], [ 19, 16 ], [ 19, 17 ], [ 19, 18 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Chase knows Electra. Susanne knows Roger. Felicia knows Chase. Miriam knows Gareth. Roman knows Hannah. Yolanda knows Susanne. Kay knows Bob. Roger knows Carl. Felicia knows Lacey. Laverne knows Felicia. Kay knows Blanche. Roger knows Kay. Hannah knows Yolanda. Roger knows Jeff. Heather knows Laverne. Felicia knows Ruby. Gareth knows Heather. Chase knows Ada. Which of Kay and Chase can Roman reach?", "answer": "Kay", "steps": [ "Roman knows Hannah.", "Hannah knows Yolanda.", "Yolanda knows Susanne.", "Susanne knows Roger.", "Roger knows Kay." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Roman", "Bob", "Kay", "Carl", "Blanche", "Yolanda", "Roger", "Jeff", "Susanne", "Hannah", "Miriam", "Electra", "Chase", "Lacey", "Ada", "Heather", "Felicia", "Ruby", "Laverne", "Gareth" ], "edges": [ [ 0, 9 ], [ 2, 1 ], [ 2, 4 ], [ 5, 8 ], [ 6, 3 ], [ 6, 2 ], [ 6, 7 ], [ 8, 6 ], [ 9, 5 ], [ 10, 19 ], [ 12, 11 ], [ 12, 14 ], [ 15, 18 ], [ 16, 13 ], [ 16, 12 ], [ 16, 17 ], [ 18, 16 ], [ 19, 15 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "James knows Boyd. Adelaide knows Clinton. Drew knows Dorothy. Jakob knows James. Adelaide knows Kurt. Brody knows Kai. Russ knows Renee. Aaron knows Adelaide. Drew knows Pete. Cynthia knows Jakob. Renee knows Lisette. Nora knows Brody. Rex knows Chelsea. Kai knows Cynthia. Chelsea knows Aaron. Lisette knows Rhonda. Rhonda knows Rex. Boyd knows Drew. Which of Pete and Clinton can Nora reach?", "answer": "Pete", "steps": [ "Nora knows Brody.", "Brody knows Kai.", "Kai knows Cynthia.", "Cynthia knows Jakob.", "Jakob knows James.", "James knows Boyd.", "Boyd knows Drew.", "Drew knows Pete." ], "difficulty": 8, "original_distance": 8, "idx_to_symbol": [ "Nora", "James", "Drew", "Dorothy", "Jakob", "Kai", "Brody", "Boyd", "Pete", "Cynthia", "Russ", "Chelsea", "Adelaide", "Kurt", "Rex", "Lisette", "Renee", "Aaron", "Clinton", "Rhonda" ], "edges": [ [ 0, 6 ], [ 1, 7 ], [ 2, 3 ], [ 2, 8 ], [ 4, 1 ], [ 5, 9 ], [ 6, 5 ], [ 7, 2 ], [ 9, 4 ], [ 10, 16 ], [ 11, 17 ], [ 12, 13 ], [ 12, 18 ], [ 14, 11 ], [ 15, 19 ], [ 16, 15 ], [ 17, 12 ], [ 19, 14 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Melody knows Adam. Gerald knows Landon. Darwin knows Evan. Gwen knows Gavin. Ariana knows Wanda. Jameson knows Tabitha. Fraser knows Ariana. Gavin knows Melody. Gavin knows Jameson. Darwin knows Omar. Darwin knows Fraser. Wendy knows Julia. Mario knows Darwin. Gavin knows Nadine. Melody knows Wendy. Adam knows Olive. Omar knows Greg. Fraser knows Gerald. Which of Gavin and Darwin can Mario reach?", "answer": "Darwin", "steps": [ "Mario knows Darwin." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Mario", "Ariana", "Darwin", "Landon", "Greg", "Omar", "Gerald", "Wanda", "Fraser", "Evan", "Gwen", "Wendy", "Gavin", "Olive", "Tabitha", "Jameson", "Adam", "Julia", "Melody", "Nadine" ], "edges": [ [ 0, 2 ], [ 1, 7 ], [ 2, 5 ], [ 2, 8 ], [ 2, 9 ], [ 5, 4 ], [ 6, 3 ], [ 8, 6 ], [ 8, 1 ], [ 10, 12 ], [ 11, 17 ], [ 12, 15 ], [ 12, 18 ], [ 12, 19 ], [ 15, 14 ], [ 16, 13 ], [ 18, 16 ], [ 18, 11 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "April knows Lynn. Lynn knows Darrell. Elmer knows Darwin. Virginia knows Khashayar. Nancy knows Charity. Virginia knows Jake. April knows Hendrix. Lynn knows Lillian. Arlene knows Deborah. Charity knows Ray. Charity knows Ember. Enrique knows Nancy. Deborah knows April. Ray knows Lois. Jake knows Enrique. Ray knows Autumn. Elmer knows Eldon. Darwin knows Arlene. Which of Darrell and Autumn can Elmer reach?", "answer": "Darrell", "steps": [ "Elmer knows Darwin.", "Darwin knows Arlene.", "Arlene knows Deborah.", "Deborah knows April.", "April knows Lynn.", "Lynn knows Darrell." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Elmer", "Deborah", "Lynn", "Arlene", "Darrell", "Lillian", "April", "Hendrix", "Eldon", "Darwin", "Virginia", "Nancy", "Ray", "Enrique", "Autumn", "Lois", "Charity", "Ember", "Khashayar", "Jake" ], "edges": [ [ 0, 8 ], [ 0, 9 ], [ 1, 6 ], [ 2, 4 ], [ 2, 5 ], [ 3, 1 ], [ 6, 2 ], [ 6, 7 ], [ 9, 3 ], [ 10, 18 ], [ 10, 19 ], [ 11, 16 ], [ 12, 14 ], [ 12, 15 ], [ 13, 11 ], [ 16, 12 ], [ 16, 17 ], [ 19, 13 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Karina knows Virgil. June knows Jaime. Karina knows Devon. Brooke knows Eduardo. Demetrius knows Israel. Israel knows Melody. Brooke knows Lars. Vanessa knows June. Lars knows Vanessa. Archie knows Ilene. Fanny knows Brett. June knows Elias. Devon knows Trevor. Israel knows Elliot. Virgil knows Demetrius. Eduardo knows Ben. Ben knows Fanny. Trevor knows Archie. Which of Israel and June can Karina reach?", "answer": "Israel", "steps": [ "Karina knows Virgil.", "Virgil knows Demetrius.", "Demetrius knows Israel." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Karina", "Israel", "Trevor", "Demetrius", "Devon", "Archie", "Elliot", "Virgil", "Melody", "Ilene", "Brooke", "June", "Ben", "Vanessa", "Eduardo", "Fanny", "Elias", "Lars", "Jaime", "Brett" ], "edges": [ [ 0, 7 ], [ 0, 4 ], [ 1, 6 ], [ 1, 8 ], [ 2, 5 ], [ 3, 1 ], [ 4, 2 ], [ 5, 9 ], [ 7, 3 ], [ 10, 17 ], [ 10, 14 ], [ 11, 16 ], [ 11, 18 ], [ 12, 15 ], [ 13, 11 ], [ 14, 12 ], [ 15, 19 ], [ 17, 13 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Antonio knows Margaret. Dirk knows Mitchell. Margaret knows Sonia. Lucia knows Constance. Isaac knows Emmett. Magdalena knows Isaac. Glenn knows Essie. Serena knows Glenn. Khashayar knows Riley. Sonia knows Khashayar. Constance knows Jasmine. Lucia knows Dirk. Emmett knows Bailey. Tyler knows Javier. Mitchell knows Brent. Tyler knows Serena. Jasmine knows Magdalena. Javier knows Antonio. Which of Khashayar and Emmett can Lucia reach?", "answer": "Emmett", "steps": [ "Lucia knows Constance.", "Constance knows Jasmine.", "Jasmine knows Magdalena.", "Magdalena knows Isaac.", "Isaac knows Emmett." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Lucia", "Dirk", "Brent", "Bailey", "Magdalena", "Mitchell", "Jasmine", "Isaac", "Constance", "Emmett", "Tyler", "Serena", "Essie", "Riley", "Margaret", "Glenn", "Antonio", "Sonia", "Javier", "Khashayar" ], "edges": [ [ 0, 1 ], [ 0, 8 ], [ 1, 5 ], [ 4, 7 ], [ 5, 2 ], [ 6, 4 ], [ 7, 9 ], [ 8, 6 ], [ 9, 3 ], [ 10, 11 ], [ 10, 18 ], [ 11, 15 ], [ 14, 17 ], [ 15, 12 ], [ 16, 14 ], [ 17, 19 ], [ 18, 16 ], [ 19, 13 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "August knows Josie. Zara knows Arthur. Carson knows Saul. Cristina knows August. Karl knows Lorna. Annie knows Troy. Hubert knows Sadie. Ebony knows Aspen. Todd knows Hubert. Arthur knows Malik. Malik knows Ebony. Aspen knows Karl. Chandler knows Todd. Courtney knows Annie. Aspen knows Cristina. Todd knows Carson. Saul knows George. Troy knows Chandler. Which of Ebony and Chandler can Zara reach?", "answer": "Ebony", "steps": [ "Zara knows Arthur.", "Arthur knows Malik.", "Malik knows Ebony." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Zara", "Malik", "Josie", "Arthur", "Cristina", "Karl", "Ebony", "Lorna", "August", "Aspen", "Courtney", "Troy", "George", "Annie", "Carson", "Hubert", "Chandler", "Sadie", "Saul", "Todd" ], "edges": [ [ 0, 3 ], [ 1, 6 ], [ 3, 1 ], [ 4, 8 ], [ 5, 7 ], [ 6, 9 ], [ 8, 2 ], [ 9, 5 ], [ 9, 4 ], [ 10, 13 ], [ 11, 16 ], [ 13, 11 ], [ 14, 18 ], [ 15, 17 ], [ 16, 19 ], [ 18, 12 ], [ 19, 15 ], [ 19, 14 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Chantal knows Curtis. Vivian knows James. Sydney knows Don. Don knows Benjamin. Lars knows Sydney. Calvin knows Heidi. Wanda knows Enid. Clinton knows Bruno. Clarissa knows Violet. Kenzie knows Calvin. Violet knows Wanda. Benjamin knows Kenzie. Marcia knows Clarissa. James knows Marcia. Benjamin knows Kent. Bruno knows Vivian. Curtis knows Lars. Clarissa knows Destiny. Which of Enid and Heidi can Chantal reach?", "answer": "Heidi", "steps": [ "Chantal knows Curtis.", "Curtis knows Lars.", "Lars knows Sydney.", "Sydney knows Don.", "Don knows Benjamin.", "Benjamin knows Kenzie.", "Kenzie knows Calvin.", "Calvin knows Heidi." ], "difficulty": 8, "original_distance": 8, "idx_to_symbol": [ "Chantal", "Curtis", "Don", "Kent", "Lars", "Benjamin", "Kenzie", "Sydney", "Calvin", "Heidi", "Clinton", "Bruno", "Marcia", "Destiny", "Vivian", "Clarissa", "Violet", "James", "Wanda", "Enid" ], "edges": [ [ 0, 1 ], [ 1, 4 ], [ 2, 5 ], [ 4, 7 ], [ 5, 3 ], [ 5, 6 ], [ 6, 8 ], [ 7, 2 ], [ 8, 9 ], [ 10, 11 ], [ 11, 14 ], [ 12, 15 ], [ 14, 17 ], [ 15, 13 ], [ 15, 16 ], [ 16, 18 ], [ 17, 12 ], [ 18, 19 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Rhonda knows Allison. Cameron knows Cliff. Will knows Susanne. Brock knows Beau. Wilma knows Goldie. Brock knows Keaton. Will knows Hayley. Mitchell knows Cameron. Susanne knows Brock. Wilma knows Randy. Goldie knows Hudson. Randy knows Mitchell. Hayley knows Axel. Rhonda knows Thea. Cameron knows Lars. Mitchell knows Colleen. Brock knows Rhonda. Mitchell knows Victoria. Which of Thea and Cliff can Wilma reach?", "answer": "Cliff", "steps": [ "Wilma knows Randy.", "Randy knows Mitchell.", "Mitchell knows Cameron.", "Cameron knows Cliff." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Wilma", "Mitchell", "Lars", "Randy", "Hudson", "Colleen", "Victoria", "Cameron", "Cliff", "Goldie", "Will", "Brock", "Allison", "Susanne", "Axel", "Keaton", "Beau", "Rhonda", "Thea", "Hayley" ], "edges": [ [ 0, 3 ], [ 0, 9 ], [ 1, 5 ], [ 1, 6 ], [ 1, 7 ], [ 3, 1 ], [ 7, 2 ], [ 7, 8 ], [ 9, 4 ], [ 10, 13 ], [ 10, 19 ], [ 11, 15 ], [ 11, 16 ], [ 11, 17 ], [ 13, 11 ], [ 17, 12 ], [ 17, 18 ], [ 19, 14 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Irma knows Declan. Elena knows Dirk. Jim knows Vivian. Rufus knows Erik. Erik knows Jillian. Percy knows Lillian. Martin knows Michael. Simon knows Anita. Declan knows Carla. Lillian knows Elena. Carla knows Rufus. Rufus knows Jamie. Anita knows Cora. Percy knows Simon. Vivian knows Esperanza. Irma knows Jim. Dirk knows Cameron. Dirk knows Martin. Which of Dirk and Rufus can Irma reach?", "answer": "Rufus", "steps": [ "Irma knows Declan.", "Declan knows Carla.", "Carla knows Rufus." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Irma", "Esperanza", "Carla", "Jamie", "Erik", "Jim", "Jillian", "Rufus", "Vivian", "Declan", "Percy", "Cora", "Elena", "Cameron", "Martin", "Simon", "Michael", "Dirk", "Anita", "Lillian" ], "edges": [ [ 0, 5 ], [ 0, 9 ], [ 2, 7 ], [ 4, 6 ], [ 5, 8 ], [ 7, 3 ], [ 7, 4 ], [ 8, 1 ], [ 9, 2 ], [ 10, 15 ], [ 10, 19 ], [ 12, 17 ], [ 14, 16 ], [ 15, 18 ], [ 17, 13 ], [ 17, 14 ], [ 18, 11 ], [ 19, 12 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Joan knows Donald. Emery knows Neil. Will knows Norman. Will knows Sierra. Donald knows Paige. Milo knows Etta. Jasper knows Leland. Donald knows Emery. Jasper knows Martha. Jude knows Gina. Martha knows Milo. Emery knows Elliot. Elliot knows Sonia. Martha knows Pam. Sierra knows Jasper. Kristin knows Jude. Jude knows Joan. Ignacio knows Will. Which of Sierra and Joan can Kristin reach?", "answer": "Joan", "steps": [ "Kristin knows Jude.", "Jude knows Joan." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Kristin", "Gina", "Sonia", "Emery", "Elliot", "Joan", "Jude", "Donald", "Neil", "Paige", "Ignacio", "Norman", "Etta", "Martha", "Milo", "Sierra", "Will", "Jasper", "Pam", "Leland" ], "edges": [ [ 0, 6 ], [ 3, 4 ], [ 3, 8 ], [ 4, 2 ], [ 5, 7 ], [ 6, 1 ], [ 6, 5 ], [ 7, 3 ], [ 7, 9 ], [ 10, 16 ], [ 13, 14 ], [ 13, 18 ], [ 14, 12 ], [ 15, 17 ], [ 16, 11 ], [ 16, 15 ], [ 17, 13 ], [ 17, 19 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Hattie knows Archie. Freya knows Larry. Freya knows Nell. Georgia knows Keegan. Hattie knows June. Edward knows Barbara. Wallace knows Dallas. Jamie knows Kurt. Fanny knows Edward. Wallace knows Fanny. Larry knows Jamie. Wallace knows Olivia. Hattie knows Beau. Sonia knows Georgia. Georgia knows Rod. Jamie knows Theodore. Archie knows Freya. Edward knows Sonia. Which of Keegan and Theodore can Hattie reach?", "answer": "Theodore", "steps": [ "Hattie knows Archie.", "Archie knows Freya.", "Freya knows Larry.", "Larry knows Jamie.", "Jamie knows Theodore." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Hattie", "Nell", "Archie", "Theodore", "June", "Larry", "Jamie", "Kurt", "Beau", "Freya", "Wallace", "Barbara", "Fanny", "Keegan", "Olivia", "Sonia", "Georgia", "Rod", "Dallas", "Edward" ], "edges": [ [ 0, 4 ], [ 0, 8 ], [ 0, 2 ], [ 2, 9 ], [ 5, 6 ], [ 6, 3 ], [ 6, 7 ], [ 9, 1 ], [ 9, 5 ], [ 10, 14 ], [ 10, 18 ], [ 10, 12 ], [ 12, 19 ], [ 15, 16 ], [ 16, 13 ], [ 16, 17 ], [ 19, 11 ], [ 19, 15 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Roger knows Lambert. Trevor knows Louis. Henry knows Virginia. Spencer knows Trevor. Louis knows Henry. Henrietta knows Spencer. Lambert knows Enid. Hope knows Heath. Pearl knows Edwin. Edwin knows Callum. Jakob knows Guy. Carla knows Chester. Lambert knows Carla. Chester knows Hope. Hope knows Pearl. Jakob knows Henrietta. Trevor knows Vera. Cindy knows Jakob. Which of Henry and Edwin can Roger reach?", "answer": "Edwin", "steps": [ "Roger knows Lambert.", "Lambert knows Carla.", "Carla knows Chester.", "Chester knows Hope.", "Hope knows Pearl.", "Pearl knows Edwin." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Roger", "Heath", "Hope", "Enid", "Pearl", "Chester", "Lambert", "Callum", "Carla", "Edwin", "Cindy", "Vera", "Trevor", "Guy", "Louis", "Spencer", "Jakob", "Virginia", "Henrietta", "Henry" ], "edges": [ [ 0, 6 ], [ 2, 1 ], [ 2, 4 ], [ 4, 9 ], [ 5, 2 ], [ 6, 3 ], [ 6, 8 ], [ 8, 5 ], [ 9, 7 ], [ 10, 16 ], [ 12, 11 ], [ 12, 14 ], [ 14, 19 ], [ 15, 12 ], [ 16, 13 ], [ 16, 18 ], [ 18, 15 ], [ 19, 17 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Gus knows Aaron. Gus knows Anton. Melissa knows Jerry. Hayley knows Homer. Rufus knows Amanda. Hayley knows Grant. Annie knows Garrison. Aaron knows Melissa. Selena knows Oliver. Hayley knows Theodore. Gus knows Harry. Garrison knows Kathleen. Oliver knows Eloise. Oliver knows Kendrick. Melissa knows Stefan. Homer knows Rufus. Gus knows Annie. Hayley knows Selena. Which of Selena and Aaron can Hayley reach?", "answer": "Selena", "steps": [ "Hayley knows Selena." ], "difficulty": 1, "original_distance": 3, "idx_to_symbol": [ "Hayley", "Theodore", "Oliver", "Selena", "Grant", "Amanda", "Kendrick", "Eloise", "Rufus", "Homer", "Gus", "Anton", "Melissa", "Aaron", "Harry", "Kathleen", "Jerry", "Stefan", "Garrison", "Annie" ], "edges": [ [ 0, 1 ], [ 0, 4 ], [ 0, 3 ], [ 0, 9 ], [ 2, 6 ], [ 2, 7 ], [ 3, 2 ], [ 8, 5 ], [ 9, 8 ], [ 10, 11 ], [ 10, 14 ], [ 10, 13 ], [ 10, 19 ], [ 12, 16 ], [ 12, 17 ], [ 13, 12 ], [ 18, 15 ], [ 19, 18 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Sierra knows Lana. Judith knows Ezra. Landon knows Sara. Lana knows Fred. Emanuel knows Giselle. Judith knows Chase. Bette knows Judith. Ezra knows Cate. Vivian knows Wesley. Cruz knows Landon. Hunter knows Vivian. Landon knows Jeanne. Cate knows Wanda. Wanda knows Hunter. Fred knows Emanuel. Landon knows Jordan. Jeanne knows Sierra. Judith knows Chloe. Which of Hunter and Fred can Bette reach?", "answer": "Hunter", "steps": [ "Bette knows Judith.", "Judith knows Ezra.", "Ezra knows Cate.", "Cate knows Wanda.", "Wanda knows Hunter." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Bette", "Wesley", "Judith", "Ezra", "Chase", "Hunter", "Cate", "Chloe", "Vivian", "Wanda", "Cruz", "Giselle", "Landon", "Jeanne", "Sara", "Fred", "Sierra", "Jordan", "Emanuel", "Lana" ], "edges": [ [ 0, 2 ], [ 2, 4 ], [ 2, 7 ], [ 2, 3 ], [ 3, 6 ], [ 5, 8 ], [ 6, 9 ], [ 8, 1 ], [ 9, 5 ], [ 10, 12 ], [ 12, 14 ], [ 12, 17 ], [ 12, 13 ], [ 13, 16 ], [ 15, 18 ], [ 16, 19 ], [ 18, 11 ], [ 19, 15 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Gonzalo knows Luella. Linda knows Tyler. Ted knows Kimberly. Joshua knows Ian. Rena knows Kate. Autumn knows Kenneth. Ted knows Zelda. Kimberly knows Esme. Tyler knows Rena. Gonzalo knows Joshua. Tyler knows Hayden. Esme knows Winifred. Allison knows Cecilia. Alma knows Sally. Kenneth knows Alma. Winifred knows Linda. Sally knows Gonzalo. Allison knows Autumn. Which of Ian and Kate can Ted reach?", "answer": "Kate", "steps": [ "Ted knows Kimberly.", "Kimberly knows Esme.", "Esme knows Winifred.", "Winifred knows Linda.", "Linda knows Tyler.", "Tyler knows Rena.", "Rena knows Kate." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Ted", "Hayden", "Tyler", "Kimberly", "Kate", "Esme", "Linda", "Rena", "Zelda", "Winifred", "Allison", "Luella", "Gonzalo", "Autumn", "Ian", "Kenneth", "Sally", "Joshua", "Cecilia", "Alma" ], "edges": [ [ 0, 8 ], [ 0, 3 ], [ 2, 1 ], [ 2, 7 ], [ 3, 5 ], [ 5, 9 ], [ 6, 2 ], [ 7, 4 ], [ 9, 6 ], [ 10, 18 ], [ 10, 13 ], [ 12, 11 ], [ 12, 17 ], [ 13, 15 ], [ 15, 19 ], [ 16, 12 ], [ 17, 14 ], [ 19, 16 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Kendrick knows Knox. Iris knows Clark. Clark knows Perry. Dewey knows Monica. Jeff knows Brenda. Clark knows Jeff. Anthony knows Francesca. Heidi knows Anthony. Sybil knows Jon. Heidi knows Clayton. Josie knows Kendrick. Dewey knows Chantal. Clark knows Heidi. Alicia knows Iris. Andre knows Josie. Kendrick knows Dewey. Kendrick knows Sybil. Monica knows Blair. Which of Heidi and Dewey can Andre reach?", "answer": "Dewey", "steps": [ "Andre knows Josie.", "Josie knows Kendrick.", "Kendrick knows Dewey." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Andre", "Chantal", "Knox", "Sybil", "Monica", "Josie", "Blair", "Jon", "Dewey", "Kendrick", "Alicia", "Clayton", "Perry", "Jeff", "Anthony", "Iris", "Francesca", "Brenda", "Heidi", "Clark" ], "edges": [ [ 0, 5 ], [ 3, 7 ], [ 4, 6 ], [ 5, 9 ], [ 8, 1 ], [ 8, 4 ], [ 9, 2 ], [ 9, 3 ], [ 9, 8 ], [ 10, 15 ], [ 13, 17 ], [ 14, 16 ], [ 15, 19 ], [ 18, 11 ], [ 18, 14 ], [ 19, 12 ], [ 19, 13 ], [ 19, 18 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Jerry knows Greg. Marie knows Erwin. Jennifer knows Byron. Daria knows Jerry. Julius knows Leland. Helen knows Enrique. Luella knows Helen. Lucy knows Beth. Jennifer knows Julius. Lucy knows Darla. Greg knows Elizabeth. Elizabeth knows Lamar. Darla knows Luella. Daria knows Bernice. Reed knows Knox. Erwin knows Reed. Helen knows Marie. Leland knows Daria. Which of Julius and Darla can Lucy reach?", "answer": "Darla", "steps": [ "Lucy knows Darla." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Lucy", "Reed", "Marie", "Luella", "Enrique", "Helen", "Knox", "Darla", "Erwin", "Beth", "Jennifer", "Elizabeth", "Jerry", "Leland", "Bernice", "Daria", "Lamar", "Julius", "Greg", "Byron" ], "edges": [ [ 0, 7 ], [ 0, 9 ], [ 1, 6 ], [ 2, 8 ], [ 3, 5 ], [ 5, 4 ], [ 5, 2 ], [ 7, 3 ], [ 8, 1 ], [ 10, 17 ], [ 10, 19 ], [ 11, 16 ], [ 12, 18 ], [ 13, 15 ], [ 15, 14 ], [ 15, 12 ], [ 17, 13 ], [ 18, 11 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Scott knows Loretta. Eldon knows Clifford. Isaac knows Magdalena. Eldon knows Amelia. Mason knows Kareem. Mason knows Darnell. Amelia knows Pete. Alison knows Tracy. Kareem knows Alison. Isaac knows Elodie. Walter knows Isaac. Drew knows Scott. Pete knows Diego. Sadie knows Mason. Scott knows Norman. Norman knows Eldon. Scott knows Franklin. Isaac knows Sadie. Which of Scott and Isaac can Drew reach?", "answer": "Scott", "steps": [ "Drew knows Scott." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Drew", "Clifford", "Norman", "Amelia", "Diego", "Franklin", "Pete", "Loretta", "Eldon", "Scott", "Walter", "Darnell", "Sadie", "Kareem", "Tracy", "Elodie", "Alison", "Magdalena", "Mason", "Isaac" ], "edges": [ [ 0, 9 ], [ 2, 8 ], [ 3, 6 ], [ 6, 4 ], [ 8, 1 ], [ 8, 3 ], [ 9, 5 ], [ 9, 7 ], [ 9, 2 ], [ 10, 19 ], [ 12, 18 ], [ 13, 16 ], [ 16, 14 ], [ 18, 11 ], [ 18, 13 ], [ 19, 15 ], [ 19, 17 ], [ 19, 12 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Gunnar knows Winston. Deborah knows Victor. Laura knows Pam. Celia knows Joel. Victor knows Jack. Dominic knows Susan. Laura knows Julio. Andre knows Corinne. Darren knows Celia. Henrietta knows Deborah. Henrietta knows Candice. Susan knows Terrence. Laura knows Gunnar. Corinne knows Dominic. Winston knows Andre. Joel knows Jaime. Jack knows Darren. Henrietta knows Luis. Which of Deborah and Gunnar can Henrietta reach?", "answer": "Deborah", "steps": [ "Henrietta knows Deborah." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Henrietta", "Candice", "Deborah", "Jack", "Joel", "Darren", "Jaime", "Luis", "Victor", "Celia", "Laura", "Julio", "Gunnar", "Andre", "Susan", "Corinne", "Terrence", "Pam", "Winston", "Dominic" ], "edges": [ [ 0, 1 ], [ 0, 7 ], [ 0, 2 ], [ 2, 8 ], [ 3, 5 ], [ 4, 6 ], [ 5, 9 ], [ 8, 3 ], [ 9, 4 ], [ 10, 11 ], [ 10, 17 ], [ 10, 12 ], [ 12, 18 ], [ 13, 15 ], [ 14, 16 ], [ 15, 19 ], [ 18, 13 ], [ 19, 14 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Justine knows Autumn. Dewey knows Joshua. Rita knows Theodore. Rita knows Jason. Ann knows Alicia. Dewey knows Tony. Evelyn knows Gail. Ann knows Adam. Adam knows Hilda. Lorna knows Tristan. Logan knows Fanny. Justine knows Evelyn. Rita knows Lorna. Lorna knows Dewey. Tony knows Kelly. Jason knows Zara. Ann knows Logan. Logan knows Justine. Which of Evelyn and Tony can Rita reach?", "answer": "Tony", "steps": [ "Rita knows Lorna.", "Lorna knows Dewey.", "Dewey knows Tony." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Rita", "Dewey", "Lorna", "Tony", "Jason", "Theodore", "Joshua", "Tristan", "Zara", "Kelly", "Ann", "Justine", "Logan", "Evelyn", "Adam", "Alicia", "Autumn", "Fanny", "Hilda", "Gail" ], "edges": [ [ 0, 5 ], [ 0, 4 ], [ 0, 2 ], [ 1, 6 ], [ 1, 3 ], [ 2, 7 ], [ 2, 1 ], [ 3, 9 ], [ 4, 8 ], [ 10, 15 ], [ 10, 14 ], [ 10, 12 ], [ 11, 16 ], [ 11, 13 ], [ 12, 17 ], [ 12, 11 ], [ 13, 19 ], [ 14, 18 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Emanuel knows Chance. Marshall knows Cooper. Gonzalo knows Jewel. Cooper knows Peggy. Chance knows Landon. Belinda knows Gonzalo. Devin knows Ted. Marshall knows Cornelius. Emanuel knows Wade. Landon knows Robin. Ted knows Edmund. Gonzalo knows Emanuel. Ted knows Teresa. Gonzalo knows Noah. Cooper knows Devin. Landon knows Blanche. Mildred knows Marshall. Marshall knows Dante. Which of Robin and Teresa can Mildred reach?", "answer": "Teresa", "steps": [ "Mildred knows Marshall.", "Marshall knows Cooper.", "Cooper knows Devin.", "Devin knows Ted.", "Ted knows Teresa." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Mildred", "Ted", "Peggy", "Edmund", "Dante", "Teresa", "Marshall", "Cooper", "Devin", "Cornelius", "Belinda", "Landon", "Wade", "Blanche", "Noah", "Robin", "Gonzalo", "Emanuel", "Chance", "Jewel" ], "edges": [ [ 0, 6 ], [ 1, 3 ], [ 1, 5 ], [ 6, 4 ], [ 6, 7 ], [ 6, 9 ], [ 7, 2 ], [ 7, 8 ], [ 8, 1 ], [ 10, 16 ], [ 11, 13 ], [ 11, 15 ], [ 16, 14 ], [ 16, 17 ], [ 16, 19 ], [ 17, 12 ], [ 17, 18 ], [ 18, 11 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Christopher knows Jodi. Clinton knows Alvin. Gonzalo knows Boyd. Naomi knows Livia. Alvin knows Christopher. Alvin knows Miriam. Alvin knows Marcia. Boyd knows Erica. Sidney knows Perry. Jodi knows Herbert. Dirk knows Naomi. Naomi knows Skyler. Harry knows Eugene. Yara knows Harry. Livia knows Sidney. Miriam knows Yara. Skyler knows Gonzalo. Naomi knows Connor. Which of Skyler and Miriam can Clinton reach?", "answer": "Miriam", "steps": [ "Clinton knows Alvin.", "Alvin knows Miriam." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Clinton", "Alvin", "Marcia", "Herbert", "Yara", "Miriam", "Eugene", "Jodi", "Harry", "Christopher", "Dirk", "Naomi", "Connor", "Perry", "Gonzalo", "Skyler", "Erica", "Sidney", "Boyd", "Livia" ], "edges": [ [ 0, 1 ], [ 1, 2 ], [ 1, 5 ], [ 1, 9 ], [ 4, 8 ], [ 5, 4 ], [ 7, 3 ], [ 8, 6 ], [ 9, 7 ], [ 10, 11 ], [ 11, 12 ], [ 11, 15 ], [ 11, 19 ], [ 14, 18 ], [ 15, 14 ], [ 17, 13 ], [ 18, 16 ], [ 19, 17 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Fernando knows Marcia. Fraser knows Doris. Donovan knows Hailey. Hailey knows Marie. Howard knows Gwen. Roy knows Peggy. Hailey knows John. Doris knows Lyle. Marcia knows Howard. John knows Roy. Peggy knows Larissa. Marie knows Atlas. Peggy knows Carmen. Fraser knows Fernando. Howard knows Patricia. Peggy knows Elizabeth. Howard knows Kay. Sam knows Fraser. Which of Peggy and Howard can Sam reach?", "answer": "Howard", "steps": [ "Sam knows Fraser.", "Fraser knows Fernando.", "Fernando knows Marcia.", "Marcia knows Howard." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Sam", "Fernando", "Lyle", "Fraser", "Doris", "Marcia", "Gwen", "Patricia", "Kay", "Howard", "Donovan", "John", "Atlas", "Hailey", "Marie", "Roy", "Elizabeth", "Larissa", "Carmen", "Peggy" ], "edges": [ [ 0, 3 ], [ 1, 5 ], [ 3, 4 ], [ 3, 1 ], [ 4, 2 ], [ 5, 9 ], [ 9, 6 ], [ 9, 7 ], [ 9, 8 ], [ 10, 13 ], [ 11, 15 ], [ 13, 14 ], [ 13, 11 ], [ 14, 12 ], [ 15, 19 ], [ 19, 16 ], [ 19, 17 ], [ 19, 18 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Hadley knows Wendell. Noel knows Coral. Louisa knows Hadley. Colin knows Edward. Pauline knows Tristan. Noel knows Alder. Coral knows Fisher. Wendell knows Amanda. Wendell knows Colin. Marcia knows Kim. Alder knows Randall. Hadley knows Pauline. Fisher knows Albert. Coral knows Dale. Edward knows Samantha. Marcia knows Noel. Albert knows Atlas. Louisa knows Dakota. Which of Samantha and Atlas can Marcia reach?", "answer": "Atlas", "steps": [ "Marcia knows Noel.", "Noel knows Coral.", "Coral knows Fisher.", "Fisher knows Albert.", "Albert knows Atlas." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Marcia", "Alder", "Atlas", "Coral", "Kim", "Noel", "Fisher", "Randall", "Dale", "Albert", "Louisa", "Pauline", "Samantha", "Wendell", "Dakota", "Hadley", "Colin", "Tristan", "Amanda", "Edward" ], "edges": [ [ 0, 4 ], [ 0, 5 ], [ 1, 7 ], [ 3, 8 ], [ 3, 6 ], [ 5, 1 ], [ 5, 3 ], [ 6, 9 ], [ 9, 2 ], [ 10, 14 ], [ 10, 15 ], [ 11, 17 ], [ 13, 18 ], [ 13, 16 ], [ 15, 11 ], [ 15, 13 ], [ 16, 19 ], [ 19, 12 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Xavier knows Gus. Teresa knows Abel. Bruce knows Louisa. Darla knows Atlas. Lily knows William. Dell knows Emma. Eugenia knows Teresa. Luz knows Rod. Atlas knows Lily. Nolan knows Howard. Donovan knows Nolan. Nolan knows Darla. Bruce knows Hattie. Dante knows Eugenia. Hattie knows Donovan. Rod knows Xavier. Xavier knows Dante. Dell knows Luz. Which of Lily and Teresa can Dell reach?", "answer": "Teresa", "steps": [ "Dell knows Luz.", "Luz knows Rod.", "Rod knows Xavier.", "Xavier knows Dante.", "Dante knows Eugenia.", "Eugenia knows Teresa." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Dell", "Teresa", "Abel", "Emma", "Rod", "Luz", "Dante", "Eugenia", "Xavier", "Gus", "Bruce", "Lily", "William", "Louisa", "Donovan", "Hattie", "Darla", "Atlas", "Nolan", "Howard" ], "edges": [ [ 0, 3 ], [ 0, 5 ], [ 1, 2 ], [ 4, 8 ], [ 5, 4 ], [ 6, 7 ], [ 7, 1 ], [ 8, 6 ], [ 8, 9 ], [ 10, 13 ], [ 10, 15 ], [ 11, 12 ], [ 14, 18 ], [ 15, 14 ], [ 16, 17 ], [ 17, 11 ], [ 18, 16 ], [ 18, 19 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Dudley knows Milo. Bill knows Fritz. Dudley knows Lara. Fritz knows Leland. Blair knows Mabel. Ross knows Dudley. Elijah knows Seth. Adam knows Blair. Bill knows Anita. Dudley knows Marcia. Quinn knows Hazel. Marcia knows Daniella. Bill knows Boyd. Leland knows Adam. Fraser knows Quinn. Elijah knows Bill. Ross knows Trina. Daniella knows Fraser. Which of Leland and Daniella can Ross reach?", "answer": "Daniella", "steps": [ "Ross knows Dudley.", "Dudley knows Marcia.", "Marcia knows Daniella." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Ross", "Quinn", "Lara", "Fraser", "Daniella", "Marcia", "Hazel", "Trina", "Milo", "Dudley", "Elijah", "Blair", "Anita", "Adam", "Leland", "Fritz", "Mabel", "Seth", "Boyd", "Bill" ], "edges": [ [ 0, 7 ], [ 0, 9 ], [ 1, 6 ], [ 3, 1 ], [ 4, 3 ], [ 5, 4 ], [ 9, 2 ], [ 9, 5 ], [ 9, 8 ], [ 10, 17 ], [ 10, 19 ], [ 11, 16 ], [ 13, 11 ], [ 14, 13 ], [ 15, 14 ], [ 19, 12 ], [ 19, 15 ], [ 19, 18 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Lucas knows Abigail. Dwight knows Kathleen. Michelle knows Ray. Will knows Jana. Marilyn knows Christopher. Lucas knows Marilyn. Christopher knows Madeline. Destiny knows Blake. Constance knows Gregory. Blake knows Chantal. Lucas knows Will. Dwight knows Michelle. Destiny knows Constance. Marilyn knows Farrah. Dwight knows Ken. Abigail knows Colby. Destiny knows Dwight. Marilyn knows Christina. Which of Michelle and Christopher can Lucas reach?", "answer": "Christopher", "steps": [ "Lucas knows Marilyn.", "Marilyn knows Christopher." ], "difficulty": 2, "original_distance": 3, "idx_to_symbol": [ "Lucas", "Christopher", "Jana", "Colby", "Christina", "Abigail", "Marilyn", "Madeline", "Will", "Farrah", "Destiny", "Michelle", "Chantal", "Gregory", "Ken", "Constance", "Dwight", "Ray", "Blake", "Kathleen" ], "edges": [ [ 0, 5 ], [ 0, 8 ], [ 0, 6 ], [ 1, 7 ], [ 5, 3 ], [ 6, 4 ], [ 6, 1 ], [ 6, 9 ], [ 8, 2 ], [ 10, 15 ], [ 10, 18 ], [ 10, 16 ], [ 11, 17 ], [ 15, 13 ], [ 16, 14 ], [ 16, 11 ], [ 16, 19 ], [ 18, 12 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Sybil knows Bernadette. Finn knows India. India knows Faith. Sybil knows Hardy. Jose knows Sue. Finn knows Jose. Larry knows Arturo. Alyssa knows Logan. Pierce knows Larry. Arturo knows Sybil. Geraldine knows Lara. Sue knows Camille. Bernadette knows Elvira. Hardy knows Alyssa. Fern knows Geraldine. Bernadette knows Bella. Lara knows Finn. India knows Forrest. Which of Finn and Sybil can Pierce reach?", "answer": "Sybil", "steps": [ "Pierce knows Larry.", "Larry knows Arturo.", "Arturo knows Sybil." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Pierce", "Alyssa", "Hardy", "Logan", "Arturo", "Elvira", "Bella", "Sybil", "Bernadette", "Larry", "Fern", "Sue", "Jose", "Camille", "Lara", "Faith", "Forrest", "Finn", "India", "Geraldine" ], "edges": [ [ 0, 9 ], [ 1, 3 ], [ 2, 1 ], [ 4, 7 ], [ 7, 2 ], [ 7, 8 ], [ 8, 5 ], [ 8, 6 ], [ 9, 4 ], [ 10, 19 ], [ 11, 13 ], [ 12, 11 ], [ 14, 17 ], [ 17, 12 ], [ 17, 18 ], [ 18, 15 ], [ 18, 16 ], [ 19, 14 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Eileen knows Perry. Eileen knows Julio. Randall knows Cate. Jeff knows Karina. Emmett knows Billy. Eileen knows Griffith. Wyatt knows Lilia. Elijah knows Randall. Griffith knows Jakob. Perry knows Eugene. Itzel knows Hubert. Perry knows Elijah. Emmett knows Wyatt. Jeff knows Emmett. Lilia knows Gwen. Perry knows Luis. Emmett knows Estelle. Jeff knows Itzel. Which of Lilia and Randall can Eileen reach?", "answer": "Randall", "steps": [ "Eileen knows Perry.", "Perry knows Elijah.", "Elijah knows Randall." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Eileen", "Julio", "Luis", "Perry", "Cate", "Eugene", "Elijah", "Randall", "Jakob", "Griffith", "Jeff", "Karina", "Billy", "Emmett", "Gwen", "Estelle", "Wyatt", "Lilia", "Hubert", "Itzel" ], "edges": [ [ 0, 1 ], [ 0, 3 ], [ 0, 9 ], [ 3, 2 ], [ 3, 5 ], [ 3, 6 ], [ 6, 7 ], [ 7, 4 ], [ 9, 8 ], [ 10, 11 ], [ 10, 13 ], [ 10, 19 ], [ 13, 12 ], [ 13, 15 ], [ 13, 16 ], [ 16, 17 ], [ 17, 14 ], [ 19, 18 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Goldie knows Jasmine. Colby knows Violet. Goldie knows Brynn. Harmony knows Colby. Travis knows Javier. Ada knows Hunter. Destiny knows Brody. Brody knows Ada. Bennett knows Travis. Jasmine knows Fleur. Violet knows Bernard. Pedro knows Cristina. Colby knows Nicholas. Brody knows Pedro. Bennett knows Natalie. Nicholas knows Martha. Bennett knows Harmony. Goldie knows Destiny. Which of Hunter and Bernard can Goldie reach?", "answer": "Hunter", "steps": [ "Goldie knows Destiny.", "Destiny knows Brody.", "Brody knows Ada.", "Ada knows Hunter." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Goldie", "Ada", "Jasmine", "Cristina", "Fleur", "Brynn", "Hunter", "Brody", "Destiny", "Pedro", "Bennett", "Violet", "Travis", "Martha", "Javier", "Natalie", "Bernard", "Colby", "Harmony", "Nicholas" ], "edges": [ [ 0, 2 ], [ 0, 5 ], [ 0, 8 ], [ 1, 6 ], [ 2, 4 ], [ 7, 1 ], [ 7, 9 ], [ 8, 7 ], [ 9, 3 ], [ 10, 12 ], [ 10, 15 ], [ 10, 18 ], [ 11, 16 ], [ 12, 14 ], [ 17, 11 ], [ 17, 19 ], [ 18, 17 ], [ 19, 13 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Earle knows Laura. Roland knows Darcy. Lucy knows Betty. Kevin knows Dixie. Yolanda knows Mae. Betty knows Kevin. Greer knows Earle. George knows Thea. Joy knows Lucy. Kevin knows Yolanda. Edna knows Wallace. Laura knows George. Dirk knows Agnes. Thea knows Roland. Ivan knows Joy. Darcy knows Dirk. Darcy knows Cecilia. Wallace knows Ivan. Which of Dirk and Yolanda can Edna reach?", "answer": "Yolanda", "steps": [ "Edna knows Wallace.", "Wallace knows Ivan.", "Ivan knows Joy.", "Joy knows Lucy.", "Lucy knows Betty.", "Betty knows Kevin.", "Kevin knows Yolanda." ], "difficulty": 7, "original_distance": 8, "idx_to_symbol": [ "Edna", "Mae", "Kevin", "Wallace", "Joy", "Lucy", "Betty", "Yolanda", "Dixie", "Ivan", "Greer", "Agnes", "Darcy", "Earle", "George", "Thea", "Roland", "Dirk", "Cecilia", "Laura" ], "edges": [ [ 0, 3 ], [ 2, 7 ], [ 2, 8 ], [ 3, 9 ], [ 4, 5 ], [ 5, 6 ], [ 6, 2 ], [ 7, 1 ], [ 9, 4 ], [ 10, 13 ], [ 12, 17 ], [ 12, 18 ], [ 13, 19 ], [ 14, 15 ], [ 15, 16 ], [ 16, 12 ], [ 17, 11 ], [ 19, 14 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Latoya knows Mildred. Margaret knows Nicholas. Veronica knows Saul. Mildred knows Lisa. Kristin knows Eldon. Veronica knows Beverly. Lisa knows Ellis. Barbara knows Cody. Cameron knows Veronica. Aubrey knows Cameron. Ellis knows Cesar. Cesar knows Alison. Nicholas knows Barbara. Cesar knows Betty. Barbara knows Clay. Eldon knows Latoya. Latoya knows Julio. Beverly knows Margaret. Which of Eldon and Cameron can Aubrey reach?", "answer": "Cameron", "steps": [ "Aubrey knows Cameron." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Aubrey", "Veronica", "Nicholas", "Barbara", "Margaret", "Cameron", "Saul", "Clay", "Beverly", "Cody", "Kristin", "Latoya", "Ellis", "Cesar", "Lisa", "Eldon", "Julio", "Alison", "Mildred", "Betty" ], "edges": [ [ 0, 5 ], [ 1, 6 ], [ 1, 8 ], [ 2, 3 ], [ 3, 7 ], [ 3, 9 ], [ 4, 2 ], [ 5, 1 ], [ 8, 4 ], [ 10, 15 ], [ 11, 16 ], [ 11, 18 ], [ 12, 13 ], [ 13, 17 ], [ 13, 19 ], [ 14, 12 ], [ 15, 11 ], [ 18, 14 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Perry knows Javier. Cornelius knows Dick. Leopold knows Gordon. Marie knows Alex. Perry knows Leopold. Jonas knows Marie. Kylie knows Enid. Cornelius knows Jordan. Enid knows Gina. Earle knows Cornelius. Leopold knows Neville. Dick knows Travis. Kylie knows Deanna. Enid knows Earle. Marie knows Darius. Dick knows Alexa. Jonas knows Gregory. Gordon knows Jonas. Which of Earle and Gordon can Perry reach?", "answer": "Gordon", "steps": [ "Perry knows Leopold.", "Leopold knows Gordon." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Perry", "Neville", "Alex", "Jonas", "Leopold", "Marie", "Javier", "Gregory", "Darius", "Gordon", "Kylie", "Gina", "Alexa", "Cornelius", "Enid", "Dick", "Deanna", "Jordan", "Travis", "Earle" ], "edges": [ [ 0, 6 ], [ 0, 4 ], [ 3, 7 ], [ 3, 5 ], [ 4, 1 ], [ 4, 9 ], [ 5, 2 ], [ 5, 8 ], [ 9, 3 ], [ 10, 16 ], [ 10, 14 ], [ 13, 17 ], [ 13, 15 ], [ 14, 11 ], [ 14, 19 ], [ 15, 12 ], [ 15, 18 ], [ 19, 13 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Ada knows Greta. Bert knows Jean. Claude knows Mildred. Vivian knows Sydney. Sydney knows Oliver. Greta knows Eden. Sheryl knows Gabriel. Brett knows Elias. Brett knows Atlas. Eden knows Lucille. Nancy knows Brett. Justin knows Nancy. Justin knows Claude. Elias knows Joshua. Greta knows Cate. Vivian knows Ada. Vivian knows Bert. Justin knows Sheryl. Which of Brett and Greta can Vivian reach?", "answer": "Greta", "steps": [ "Vivian knows Ada.", "Ada knows Greta." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Vivian", "Bert", "Eden", "Lucille", "Ada", "Greta", "Oliver", "Cate", "Sydney", "Jean", "Justin", "Claude", "Elias", "Joshua", "Nancy", "Brett", "Gabriel", "Atlas", "Sheryl", "Mildred" ], "edges": [ [ 0, 4 ], [ 0, 8 ], [ 0, 1 ], [ 1, 9 ], [ 2, 3 ], [ 4, 5 ], [ 5, 2 ], [ 5, 7 ], [ 8, 6 ], [ 10, 14 ], [ 10, 18 ], [ 10, 11 ], [ 11, 19 ], [ 12, 13 ], [ 14, 15 ], [ 15, 12 ], [ 15, 17 ], [ 18, 16 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Annie knows Eunice. Eunice knows Deborah. Bruno knows Glenn. Graeme knows Bruno. Deborah knows Cody. Patricia knows Jason. Chandler knows Abel. Lisette knows Ezra. Charlotte knows Graeme. Noah knows Garrett. Bruno knows Sue. Patricia knows June. Lisette knows Geoffrey. Jason knows Chandler. Annie knows Charlotte. Patricia knows Noah. Annie knows Elias. Garrett knows Lisette. Which of Noah and Charlotte can Annie reach?", "answer": "Charlotte", "steps": [ "Annie knows Charlotte." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Annie", "Cody", "Charlotte", "Sue", "Deborah", "Bruno", "Glenn", "Eunice", "Elias", "Graeme", "Patricia", "Abel", "Noah", "Geoffrey", "Chandler", "Lisette", "Ezra", "Jason", "June", "Garrett" ], "edges": [ [ 0, 7 ], [ 0, 8 ], [ 0, 2 ], [ 2, 9 ], [ 4, 1 ], [ 5, 3 ], [ 5, 6 ], [ 7, 4 ], [ 9, 5 ], [ 10, 17 ], [ 10, 18 ], [ 10, 12 ], [ 12, 19 ], [ 14, 11 ], [ 15, 13 ], [ 15, 16 ], [ 17, 14 ], [ 19, 15 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Maureen knows Hattie. Isadora knows Daphne. Daphne knows Jordan. Dalton knows Jennifer. Mara knows Isla. Isla knows Isadora. Maureen knows Dirk. Dirk knows Brooks. Jordan knows Otto. Kane knows Jay. Carla knows Penny. Jennifer knows Ford. Brody knows Lucille. Jay knows Eden. Jay knows Carla. Jordan knows Maureen. Ford knows Kane. Carla knows Brody. Which of Jordan and Jay can Mara reach?", "answer": "Jordan", "steps": [ "Mara knows Isla.", "Isla knows Isadora.", "Isadora knows Daphne.", "Daphne knows Jordan." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Mara", "Brooks", "Daphne", "Hattie", "Isla", "Maureen", "Dirk", "Otto", "Isadora", "Jordan", "Dalton", "Lucille", "Kane", "Penny", "Jennifer", "Carla", "Brody", "Eden", "Ford", "Jay" ], "edges": [ [ 0, 4 ], [ 2, 9 ], [ 4, 8 ], [ 5, 3 ], [ 5, 6 ], [ 6, 1 ], [ 8, 2 ], [ 9, 5 ], [ 9, 7 ], [ 10, 14 ], [ 12, 19 ], [ 14, 18 ], [ 15, 13 ], [ 15, 16 ], [ 16, 11 ], [ 18, 12 ], [ 19, 15 ], [ 19, 17 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Tonya knows Austin. Geneva knows Caroline. Haley knows Jeanne. Henry knows Geneva. Geneva knows Langston. Byron knows Cruz. Levi knows Sandra. Edna knows Tonya. Levi knows Byron. Jeanne knows Glenda. Langston knows Lorraine. Cruz knows Henry. Byron knows Denver. Tonya knows Malcolm. Malcolm knows Judy. Jeanne knows Gina. Haley knows Kingsley. Glenda knows Edna. Which of Henry and Edna can Haley reach?", "answer": "Edna", "steps": [ "Haley knows Jeanne.", "Jeanne knows Glenda.", "Glenda knows Edna." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Haley", "Austin", "Tonya", "Kingsley", "Judy", "Glenda", "Gina", "Edna", "Jeanne", "Malcolm", "Levi", "Caroline", "Geneva", "Sandra", "Lorraine", "Cruz", "Denver", "Henry", "Byron", "Langston" ], "edges": [ [ 0, 3 ], [ 0, 8 ], [ 2, 1 ], [ 2, 9 ], [ 5, 7 ], [ 7, 2 ], [ 8, 6 ], [ 8, 5 ], [ 9, 4 ], [ 10, 13 ], [ 10, 18 ], [ 12, 11 ], [ 12, 19 ], [ 15, 17 ], [ 17, 12 ], [ 18, 16 ], [ 18, 15 ], [ 19, 14 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Pete knows Kirk. Jackson knows Ricardo. Louise knows Janet. Louise knows Dee. Abigail knows Oscar. Sean knows Sandra. Louise knows Bella. Billy knows Abigail. Bella knows Kareem. Sean knows Jackson. Sean knows Will. Abigail knows Rocco. Sandra knows Louise. Rocco knows Kimberly. Katrina knows Donald. Abigail knows Blake. Pete knows Katrina. Pete knows Billy. Which of Billy and Sandra can Pete reach?", "answer": "Billy", "steps": [ "Pete knows Billy." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Pete", "Kimberly", "Billy", "Rocco", "Kirk", "Abigail", "Oscar", "Donald", "Blake", "Katrina", "Sean", "Kareem", "Sandra", "Bella", "Will", "Louise", "Janet", "Ricardo", "Dee", "Jackson" ], "edges": [ [ 0, 4 ], [ 0, 2 ], [ 0, 9 ], [ 2, 5 ], [ 3, 1 ], [ 5, 3 ], [ 5, 6 ], [ 5, 8 ], [ 9, 7 ], [ 10, 14 ], [ 10, 12 ], [ 10, 19 ], [ 12, 15 ], [ 13, 11 ], [ 15, 13 ], [ 15, 16 ], [ 15, 18 ], [ 19, 17 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Cody knows Alyssa. Veronica knows Marie. Julio knows Eugene. Randall knows Julio. Calvin knows Jennifer. Eugene knows Cody. Julio knows Chloe. Shane knows Daniella. Shane knows Herman. Jennifer knows Lionel. Jeffery knows Giselle. Herman knows Dwight. Marie knows Calvin. Estelle knows Veronica. Calvin knows Verna. Ross knows Jeffery. Chloe knows Shane. Veronica knows Ross. Which of Dwight and Lionel can Randall reach?", "answer": "Dwight", "steps": [ "Randall knows Julio.", "Julio knows Chloe.", "Chloe knows Shane.", "Shane knows Herman.", "Herman knows Dwight." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Randall", "Daniella", "Dwight", "Herman", "Chloe", "Alyssa", "Julio", "Cody", "Eugene", "Shane", "Estelle", "Verna", "Lionel", "Jennifer", "Marie", "Giselle", "Veronica", "Jeffery", "Ross", "Calvin" ], "edges": [ [ 0, 6 ], [ 3, 2 ], [ 4, 9 ], [ 6, 8 ], [ 6, 4 ], [ 7, 5 ], [ 8, 7 ], [ 9, 1 ], [ 9, 3 ], [ 10, 16 ], [ 13, 12 ], [ 14, 19 ], [ 16, 18 ], [ 16, 14 ], [ 17, 15 ], [ 18, 17 ], [ 19, 11 ], [ 19, 13 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Alder knows Robin. Alder knows Leander. Derrick knows Clay. Jerome knows Kathleen. Mae knows Peggy. Derrick knows Jose. Robin knows Latoya. Jose knows Hamilton. Jose knows Craig. Peggy knows Delilah. Nolan knows Yolanda. Clay knows Jodi. Peggy knows Nolan. Mae knows Jerome. Nolan knows Lena. Jose knows Alder. Peggy knows Maya. Yolanda knows Lewis. Which of Jose and Peggy can Derrick reach?", "answer": "Jose", "steps": [ "Derrick knows Jose." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Derrick", "Alder", "Robin", "Clay", "Jodi", "Jose", "Craig", "Hamilton", "Leander", "Latoya", "Mae", "Nolan", "Yolanda", "Jerome", "Kathleen", "Peggy", "Maya", "Delilah", "Lena", "Lewis" ], "edges": [ [ 0, 3 ], [ 0, 5 ], [ 1, 8 ], [ 1, 2 ], [ 2, 9 ], [ 3, 4 ], [ 5, 6 ], [ 5, 7 ], [ 5, 1 ], [ 10, 13 ], [ 10, 15 ], [ 11, 18 ], [ 11, 12 ], [ 12, 19 ], [ 13, 14 ], [ 15, 16 ], [ 15, 17 ], [ 15, 11 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Frida knows Kristina. Virginia knows Frida. Fergus knows Hudson. Lena knows Brock. Kristin knows Ralph. Jocelyn knows Kai. Jeremy knows Jocelyn. Kristina knows Alfonso. Harper knows Jillian. Jackson knows Kristin. Hudson knows Harper. Bryan knows Jeremy. Jeremy knows Sue. Kai knows Fergus. Kristin knows Lena. Ralph knows Virginia. Alfonso knows Brian. Sue knows Frank. Which of Frida and Fergus can Bryan reach?", "answer": "Fergus", "steps": [ "Bryan knows Jeremy.", "Jeremy knows Jocelyn.", "Jocelyn knows Kai.", "Kai knows Fergus." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Bryan", "Sue", "Jillian", "Harper", "Jocelyn", "Fergus", "Frank", "Hudson", "Jeremy", "Kai", "Jackson", "Lena", "Brian", "Alfonso", "Ralph", "Frida", "Brock", "Kristina", "Kristin", "Virginia" ], "edges": [ [ 0, 8 ], [ 1, 6 ], [ 3, 2 ], [ 4, 9 ], [ 5, 7 ], [ 7, 3 ], [ 8, 1 ], [ 8, 4 ], [ 9, 5 ], [ 10, 18 ], [ 11, 16 ], [ 13, 12 ], [ 14, 19 ], [ 15, 17 ], [ 17, 13 ], [ 18, 11 ], [ 18, 14 ], [ 19, 15 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Janet knows Gideon. Gustavo knows Guy. Gideon knows Alejandro. Bridget knows Anastasia. Alejandro knows Ernest. June knows Leo. Alejandro knows Brandon. Becky knows Paul. Russell knows Lambert. Wilson knows Alma. Paul knows Bridget. Lambert knows Becky. Gideon knows Wilson. Lambert knows June. June knows Lamar. Wilson knows Gustavo. Becky knows Susanne. Guy knows Stanley. Which of Gustavo and Paul can Russell reach?", "answer": "Paul", "steps": [ "Russell knows Lambert.", "Lambert knows Becky.", "Becky knows Paul." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Russell", "Lambert", "Susanne", "Anastasia", "Bridget", "Leo", "June", "Paul", "Lamar", "Becky", "Janet", "Gideon", "Alma", "Stanley", "Guy", "Brandon", "Alejandro", "Gustavo", "Ernest", "Wilson" ], "edges": [ [ 0, 1 ], [ 1, 6 ], [ 1, 9 ], [ 4, 3 ], [ 6, 5 ], [ 6, 8 ], [ 7, 4 ], [ 9, 2 ], [ 9, 7 ], [ 10, 11 ], [ 11, 16 ], [ 11, 19 ], [ 14, 13 ], [ 16, 15 ], [ 16, 18 ], [ 17, 14 ], [ 19, 12 ], [ 19, 17 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Cody knows Alyssa. Veronica knows Marie. Julio knows Eugene. Randall knows Julio. Calvin knows Jennifer. Eugene knows Cody. Julio knows Chloe. Shane knows Daniella. Shane knows Herman. Jennifer knows Lionel. Jeffery knows Giselle. Herman knows Dwight. Marie knows Calvin. Estelle knows Veronica. Calvin knows Verna. Ross knows Jeffery. Chloe knows Shane. Veronica knows Ross. Which of Herman and Jennifer can Randall reach?", "answer": "Herman", "steps": [ "Randall knows Julio.", "Julio knows Chloe.", "Chloe knows Shane.", "Shane knows Herman." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Randall", "Daniella", "Dwight", "Herman", "Chloe", "Alyssa", "Julio", "Cody", "Eugene", "Shane", "Estelle", "Verna", "Lionel", "Jennifer", "Marie", "Giselle", "Veronica", "Jeffery", "Ross", "Calvin" ], "edges": [ [ 0, 6 ], [ 3, 2 ], [ 4, 9 ], [ 6, 8 ], [ 6, 4 ], [ 7, 5 ], [ 8, 7 ], [ 9, 1 ], [ 9, 3 ], [ 10, 16 ], [ 13, 12 ], [ 14, 19 ], [ 16, 18 ], [ 16, 14 ], [ 17, 15 ], [ 18, 17 ], [ 19, 11 ], [ 19, 13 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Lorna knows Louisa. Dudley knows Lorna. Gustavo knows Susan. Darla knows Alyssa. Laurel knows Gustavo. Myrtle knows June. Myrtle knows Dudley. Susan knows Opal. June knows Jeanette. Dudley knows Henrietta. Louisa knows Magdalena. Nicholas knows Darla. Nicholas knows Paige. Nicholas knows Bernard. Bernard knows David. Darla knows Laurel. Myrtle knows Karen. Magdalena knows Herbert. Which of Darla and Dudley can Myrtle reach?", "answer": "Dudley", "steps": [ "Myrtle knows Dudley." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Myrtle", "Henrietta", "Lorna", "Dudley", "Magdalena", "June", "Jeanette", "Louisa", "Karen", "Herbert", "Nicholas", "Alyssa", "Laurel", "Darla", "Susan", "Bernard", "David", "Gustavo", "Paige", "Opal" ], "edges": [ [ 0, 5 ], [ 0, 8 ], [ 0, 3 ], [ 2, 7 ], [ 3, 1 ], [ 3, 2 ], [ 4, 9 ], [ 5, 6 ], [ 7, 4 ], [ 10, 15 ], [ 10, 18 ], [ 10, 13 ], [ 12, 17 ], [ 13, 11 ], [ 13, 12 ], [ 14, 19 ], [ 15, 16 ], [ 17, 14 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Jeffery knows Keegan. John knows Dexter. Adrian knows Max. Eugenia knows John. Sarah knows Shelly. Milton knows Crystal. Crystal knows Paula. Max knows Darren. Holly knows Shaun. Keegan knows Gail. Dexter knows Milton. Gail knows Eugenia. Shaun knows Curtis. Darren knows Sarah. Shelly knows Carl. Curtis knows Adrian. Jeffery knows Chelsea. Holly knows Neal. Which of Max and John can Holly reach?", "answer": "Max", "steps": [ "Holly knows Shaun.", "Shaun knows Curtis.", "Curtis knows Adrian.", "Adrian knows Max." ], "difficulty": 4, "original_distance": 8, "idx_to_symbol": [ "Holly", "Adrian", "Shaun", "Carl", "Max", "Shelly", "Curtis", "Darren", "Neal", "Sarah", "Jeffery", "Eugenia", "Keegan", "Paula", "John", "Crystal", "Gail", "Dexter", "Chelsea", "Milton" ], "edges": [ [ 0, 8 ], [ 0, 2 ], [ 1, 4 ], [ 2, 6 ], [ 4, 7 ], [ 5, 3 ], [ 6, 1 ], [ 7, 9 ], [ 9, 5 ], [ 10, 18 ], [ 10, 12 ], [ 11, 14 ], [ 12, 16 ], [ 14, 17 ], [ 15, 13 ], [ 16, 11 ], [ 17, 19 ], [ 19, 15 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Geraldine knows Isabel. Maria knows Autumn. Cain knows Jared. Floyd knows Willis. Blair knows Cain. Kelsey knows Geraldine. Isabel knows Stefan. Floyd knows Ron. Maria knows Mindy. Geraldine knows Bailey. David knows Floyd. Victor knows Maria. Isabel knows Clyde. Dale knows Forrest. Cain knows Dale. Jared knows Victor. Dale knows Cate. Bailey knows David. Which of Floyd and Maria can Blair reach?", "answer": "Maria", "steps": [ "Blair knows Cain.", "Cain knows Jared.", "Jared knows Victor.", "Victor knows Maria." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Blair", "Cate", "Cain", "Dale", "Autumn", "Mindy", "Maria", "Jared", "Forrest", "Victor", "Kelsey", "Clyde", "Geraldine", "Isabel", "Ron", "Willis", "Floyd", "Bailey", "Stefan", "David" ], "edges": [ [ 0, 2 ], [ 2, 3 ], [ 2, 7 ], [ 3, 1 ], [ 3, 8 ], [ 6, 4 ], [ 6, 5 ], [ 7, 9 ], [ 9, 6 ], [ 10, 12 ], [ 12, 13 ], [ 12, 17 ], [ 13, 11 ], [ 13, 18 ], [ 16, 14 ], [ 16, 15 ], [ 17, 19 ], [ 19, 16 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Jay knows Eve. Xander knows Jay. Verna knows Holly. Vicki knows Ellis. Emmett knows Steve. Reed knows Vicki. Jay knows Ilene. Vivian knows Jenny. Jay knows Heidi. Jenny knows Emmett. Archer knows Reed. Verna knows Diego. Verna knows Yasmin. Jenny knows Claudia. Reed knows Kenzie. Xander knows Vivian. Abigail knows Verna. Abigail knows Archer. Which of Vicki and Emmett can Abigail reach?", "answer": "Vicki", "steps": [ "Abigail knows Archer.", "Archer knows Reed.", "Reed knows Vicki." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Abigail", "Archer", "Ellis", "Kenzie", "Verna", "Vicki", "Yasmin", "Diego", "Holly", "Reed", "Xander", "Vivian", "Steve", "Claudia", "Jay", "Emmett", "Eve", "Ilene", "Heidi", "Jenny" ], "edges": [ [ 0, 4 ], [ 0, 1 ], [ 1, 9 ], [ 4, 6 ], [ 4, 7 ], [ 4, 8 ], [ 5, 2 ], [ 9, 3 ], [ 9, 5 ], [ 10, 14 ], [ 10, 11 ], [ 11, 19 ], [ 14, 16 ], [ 14, 17 ], [ 14, 18 ], [ 15, 12 ], [ 19, 13 ], [ 19, 15 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Morris knows Brynn. Morris knows Hugh. Darin knows Kristin. Erin knows Pam. Jolena knows Cristina. Nathan knows Jolena. James knows Nathan. Brynn knows Reed. Tina knows Vincent. Nathan knows Darin. Hugh knows Ellen. Morris knows August. Natalie knows Desmond. August knows Gene. Reed knows Natalie. Kristin knows Tina. Peter knows Morris. Nathan knows Erin. Which of Tina and Natalie can James reach?", "answer": "Tina", "steps": [ "James knows Nathan.", "Nathan knows Darin.", "Darin knows Kristin.", "Kristin knows Tina." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "James", "Cristina", "Vincent", "Jolena", "Erin", "Darin", "Tina", "Pam", "Kristin", "Nathan", "Peter", "Gene", "Desmond", "August", "Hugh", "Brynn", "Natalie", "Ellen", "Reed", "Morris" ], "edges": [ [ 0, 9 ], [ 3, 1 ], [ 4, 7 ], [ 5, 8 ], [ 6, 2 ], [ 8, 6 ], [ 9, 3 ], [ 9, 4 ], [ 9, 5 ], [ 10, 19 ], [ 13, 11 ], [ 14, 17 ], [ 15, 18 ], [ 16, 12 ], [ 18, 16 ], [ 19, 13 ], [ 19, 14 ], [ 19, 15 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Brooke knows Leonard. Mae knows Aurora. Alex knows Dick. Gavin knows Gus. Geoffrey knows John. Dick knows Desmond. Aurora knows Electra. Barry knows Gavin. Elvira knows Geoffrey. Lark knows Doug. Gus knows Brooke. Louise knows Janet. Brooke knows Elvira. Pauline knows Alex. Pauline knows Lark. Doug knows Fernando. Leonard knows Louise. Electra knows Pauline. Which of John and Desmond can Barry reach?", "answer": "John", "steps": [ "Barry knows Gavin.", "Gavin knows Gus.", "Gus knows Brooke.", "Brooke knows Elvira.", "Elvira knows Geoffrey.", "Geoffrey knows John." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Barry", "Gus", "Gavin", "Leonard", "Elvira", "Janet", "Louise", "John", "Geoffrey", "Brooke", "Mae", "Electra", "Aurora", "Lark", "Alex", "Fernando", "Doug", "Desmond", "Dick", "Pauline" ], "edges": [ [ 0, 2 ], [ 1, 9 ], [ 2, 1 ], [ 3, 6 ], [ 4, 8 ], [ 6, 5 ], [ 8, 7 ], [ 9, 3 ], [ 9, 4 ], [ 10, 12 ], [ 11, 19 ], [ 12, 11 ], [ 13, 16 ], [ 14, 18 ], [ 16, 15 ], [ 18, 17 ], [ 19, 13 ], [ 19, 14 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Harold knows Jules. Houston knows Roland. Kristin knows Fisher. Dick knows Ariel. Valerie knows Jane. Derrick knows Yvonne. Elena knows Harold. Valerie knows Houston. Yvonne knows Elena. Dee knows Maureen. Tyler knows Aurora. Noah knows Fritz. Derrick knows Wesley. Yvonne knows Noah. Maureen knows Valerie. Tyler knows Dee. Harold knows Dick. Dee knows Kristin. Which of Roland and Ariel can Tyler reach?", "answer": "Roland", "steps": [ "Tyler knows Dee.", "Dee knows Maureen.", "Maureen knows Valerie.", "Valerie knows Houston.", "Houston knows Roland." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Tyler", "Maureen", "Valerie", "Jane", "Dee", "Houston", "Fisher", "Aurora", "Kristin", "Roland", "Derrick", "Elena", "Harold", "Jules", "Yvonne", "Dick", "Fritz", "Wesley", "Noah", "Ariel" ], "edges": [ [ 0, 7 ], [ 0, 4 ], [ 1, 2 ], [ 2, 3 ], [ 2, 5 ], [ 4, 8 ], [ 4, 1 ], [ 5, 9 ], [ 8, 6 ], [ 10, 17 ], [ 10, 14 ], [ 11, 12 ], [ 12, 13 ], [ 12, 15 ], [ 14, 18 ], [ 14, 11 ], [ 15, 19 ], [ 18, 16 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Brynn knows Reid. Reid knows Chandler. Mindy knows Dell. Alyson knows Gonzalo. Dorian knows Alyson. Tracy knows Virgil. Margaret knows Brynn. Jim knows Dina. Hayes knows Dorian. Elena knows Julio. Dudley knows Diana. Diana knows Mindy. Virgil knows Margaret. Chandler knows Hayes. Simon knows Jim. Sean knows Simon. Julio knows Dudley. Dell knows Sean. Which of Julio and Virgil can Elena reach?", "answer": "Julio", "steps": [ "Elena knows Julio." ], "difficulty": 1, "original_distance": 9, "idx_to_symbol": [ "Elena", "Jim", "Simon", "Dudley", "Dina", "Dell", "Julio", "Diana", "Sean", "Mindy", "Tracy", "Alyson", "Dorian", "Margaret", "Gonzalo", "Chandler", "Virgil", "Brynn", "Hayes", "Reid" ], "edges": [ [ 0, 6 ], [ 1, 4 ], [ 2, 1 ], [ 3, 7 ], [ 5, 8 ], [ 6, 3 ], [ 7, 9 ], [ 8, 2 ], [ 9, 5 ], [ 10, 16 ], [ 11, 14 ], [ 12, 11 ], [ 13, 17 ], [ 15, 18 ], [ 16, 13 ], [ 17, 19 ], [ 18, 12 ], [ 19, 15 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Janet knows Gideon. Gustavo knows Guy. Gideon knows Alejandro. Bridget knows Anastasia. Alejandro knows Ernest. June knows Leo. Alejandro knows Brandon. Becky knows Paul. Russell knows Lambert. Wilson knows Alma. Paul knows Bridget. Lambert knows Becky. Gideon knows Wilson. Lambert knows June. June knows Lamar. Wilson knows Gustavo. Becky knows Susanne. Guy knows Stanley. Which of Bridget and Guy can Russell reach?", "answer": "Bridget", "steps": [ "Russell knows Lambert.", "Lambert knows Becky.", "Becky knows Paul.", "Paul knows Bridget." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Russell", "Lambert", "Susanne", "Anastasia", "Bridget", "Leo", "June", "Paul", "Lamar", "Becky", "Janet", "Gideon", "Alma", "Stanley", "Guy", "Brandon", "Alejandro", "Gustavo", "Ernest", "Wilson" ], "edges": [ [ 0, 1 ], [ 1, 6 ], [ 1, 9 ], [ 4, 3 ], [ 6, 5 ], [ 6, 8 ], [ 7, 4 ], [ 9, 2 ], [ 9, 7 ], [ 10, 11 ], [ 11, 16 ], [ 11, 19 ], [ 14, 13 ], [ 16, 15 ], [ 16, 18 ], [ 17, 14 ], [ 19, 12 ], [ 19, 17 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Keira knows Lamont. Jorge knows Lyle. Ryan knows Jorge. Doug knows Emma. Lambert knows Keira. Lyle knows Ilene. Devin knows Mario. Lambert knows Ryan. Clara knows Devin. Clara knows Doug. Lambert knows Dahlia. Ronald knows Lance. Lyle knows Quinn. Ronald knows Adam. Jude knows Wanda. Clara knows Jude. Wanda knows Ronald. Dahlia knows Hendrix. Which of Ronald and Lyle can Clara reach?", "answer": "Ronald", "steps": [ "Clara knows Jude.", "Jude knows Wanda.", "Wanda knows Ronald." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Clara", "Jude", "Lance", "Adam", "Wanda", "Devin", "Doug", "Emma", "Mario", "Ronald", "Lambert", "Ryan", "Ilene", "Quinn", "Jorge", "Dahlia", "Keira", "Lamont", "Hendrix", "Lyle" ], "edges": [ [ 0, 6 ], [ 0, 5 ], [ 0, 1 ], [ 1, 4 ], [ 4, 9 ], [ 5, 8 ], [ 6, 7 ], [ 9, 2 ], [ 9, 3 ], [ 10, 16 ], [ 10, 15 ], [ 10, 11 ], [ 11, 14 ], [ 14, 19 ], [ 15, 18 ], [ 16, 17 ], [ 19, 12 ], [ 19, 13 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Melanie knows Kara. Finn knows Brody. Grover knows Henrietta. Grover knows Ron. Glen knows Nicole. Grover knows Chelsea. Will knows Sam. Parker knows Alexa. Dolores knows Freya. Glen knows Finn. Gustavo knows Irma. Will knows Henry. Carmen knows Gustavo. Will knows Carmen. Ron knows Glen. Sam knows Dolores. Gustavo knows Parker. Chelsea knows Melanie. Which of Finn and Parker can Will reach?", "answer": "Parker", "steps": [ "Will knows Carmen.", "Carmen knows Gustavo.", "Gustavo knows Parker." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Will", "Alexa", "Carmen", "Irma", "Dolores", "Freya", "Henry", "Gustavo", "Parker", "Sam", "Grover", "Brody", "Ron", "Nicole", "Melanie", "Kara", "Henrietta", "Glen", "Finn", "Chelsea" ], "edges": [ [ 0, 6 ], [ 0, 2 ], [ 0, 9 ], [ 2, 7 ], [ 4, 5 ], [ 7, 3 ], [ 7, 8 ], [ 8, 1 ], [ 9, 4 ], [ 10, 16 ], [ 10, 12 ], [ 10, 19 ], [ 12, 17 ], [ 14, 15 ], [ 17, 13 ], [ 17, 18 ], [ 18, 11 ], [ 19, 14 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Gina knows Philip. Cora knows Rhonda. Bart knows Rebecca. Elaine knows Gina. Douglas knows Bart. Tom knows Ted. Randall knows Byron. Philip knows Aspen. Ted knows Elaine. Holden knows Claude. Aspen knows Trevor. Rebecca knows Ivy. Kane knows Tom. Rhonda knows Samantha. Claude knows Kane. Ivy knows Horace. Horace knows Cora. Samantha knows Randall. Which of Samantha and Philip can Douglas reach?", "answer": "Samantha", "steps": [ "Douglas knows Bart.", "Bart knows Rebecca.", "Rebecca knows Ivy.", "Ivy knows Horace.", "Horace knows Cora.", "Cora knows Rhonda.", "Rhonda knows Samantha." ], "difficulty": 7, "original_distance": 9, "idx_to_symbol": [ "Douglas", "Bart", "Randall", "Cora", "Ivy", "Rhonda", "Byron", "Rebecca", "Samantha", "Horace", "Holden", "Claude", "Aspen", "Elaine", "Tom", "Gina", "Trevor", "Kane", "Philip", "Ted" ], "edges": [ [ 0, 1 ], [ 1, 7 ], [ 2, 6 ], [ 3, 5 ], [ 4, 9 ], [ 5, 8 ], [ 7, 4 ], [ 8, 2 ], [ 9, 3 ], [ 10, 11 ], [ 11, 17 ], [ 12, 16 ], [ 13, 15 ], [ 14, 19 ], [ 15, 18 ], [ 17, 14 ], [ 18, 12 ], [ 19, 13 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Vera knows Cassidy. Florence knows Tina. Dean knows Blanche. Celeste knows Magdalena. Kai knows Leo. Brandon knows Faith. Celeste knows Vera. Faith knows Samantha. Dean knows Drake. Virgil knows Brandon. Florence knows Dean. Greg knows Kai. Greg knows Jamie. Kirsten knows Celeste. Brandon knows Sheryl. Blanche knows Greg. Vera knows Virgil. Leigh knows Florence. Which of Samantha and Leo can Leigh reach?", "answer": "Leo", "steps": [ "Leigh knows Florence.", "Florence knows Dean.", "Dean knows Blanche.", "Blanche knows Greg.", "Greg knows Kai.", "Kai knows Leo." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Leigh", "Blanche", "Kai", "Greg", "Jamie", "Dean", "Leo", "Drake", "Florence", "Tina", "Kirsten", "Virgil", "Faith", "Brandon", "Sheryl", "Vera", "Samantha", "Cassidy", "Celeste", "Magdalena" ], "edges": [ [ 0, 8 ], [ 1, 3 ], [ 2, 6 ], [ 3, 4 ], [ 3, 2 ], [ 5, 1 ], [ 5, 7 ], [ 8, 5 ], [ 8, 9 ], [ 10, 18 ], [ 11, 13 ], [ 12, 16 ], [ 13, 14 ], [ 13, 12 ], [ 15, 11 ], [ 15, 17 ], [ 18, 15 ], [ 18, 19 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Derek knows Ember. Graeme knows Eleanor. Dell knows Bruno. Walter knows Dell. Jodi knows Diane. Diane knows Justine. Jocelyn knows Mia. Lyric knows Odette. Dell knows Carmela. Carmela knows Belinda. Justine knows Lyric. Bruno knows Garland. Justine knows Derek. Jodi knows Lacey. Justine knows Graeme. Raquel knows Walter. Raquel knows Olivia. Dell knows Jocelyn. Which of Diane and Walter can Raquel reach?", "answer": "Walter", "steps": [ "Raquel knows Walter." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Raquel", "Carmela", "Bruno", "Dell", "Garland", "Olivia", "Belinda", "Jocelyn", "Mia", "Walter", "Jodi", "Graeme", "Lyric", "Justine", "Odette", "Lacey", "Eleanor", "Derek", "Ember", "Diane" ], "edges": [ [ 0, 5 ], [ 0, 9 ], [ 1, 6 ], [ 2, 4 ], [ 3, 2 ], [ 3, 1 ], [ 3, 7 ], [ 7, 8 ], [ 9, 3 ], [ 10, 15 ], [ 10, 19 ], [ 11, 16 ], [ 12, 14 ], [ 13, 12 ], [ 13, 11 ], [ 13, 17 ], [ 17, 18 ], [ 19, 13 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Brittany knows Louis. Kim knows Raymond. Noel knows Douglas. Goldie knows Atlas. Raymond knows Austin. Mary knows Tara. Yuki knows Mary. Donovan knows Yuki. Louis knows Lyle. Damian knows Autumn. Douglas knows Goldie. Gregory knows Kim. Autumn knows Gregory. Tamara knows Brittany. Mary knows Tamara. Gregory knows Noel. Nadine knows Nicole. Tara knows Nadine. Which of Noel and Tamara can Damian reach?", "answer": "Noel", "steps": [ "Damian knows Autumn.", "Autumn knows Gregory.", "Gregory knows Noel." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Damian", "Kim", "Douglas", "Autumn", "Austin", "Gregory", "Atlas", "Raymond", "Goldie", "Noel", "Donovan", "Tara", "Brittany", "Yuki", "Nicole", "Mary", "Lyle", "Nadine", "Louis", "Tamara" ], "edges": [ [ 0, 3 ], [ 1, 7 ], [ 2, 8 ], [ 3, 5 ], [ 5, 1 ], [ 5, 9 ], [ 7, 4 ], [ 8, 6 ], [ 9, 2 ], [ 10, 13 ], [ 11, 17 ], [ 12, 18 ], [ 13, 15 ], [ 15, 11 ], [ 15, 19 ], [ 17, 14 ], [ 18, 16 ], [ 19, 12 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Colin knows Susanne. Marian knows Beau. Charles knows Ashton. Charles knows Emery. Darnell knows Emanuel. Susanne knows Ira. Kyle knows Diana. Marian knows Trudy. Darnell knows Charles. Kyle knows Wendell. Susanne knows Lillian. Kyle knows Jude. Lillian knows Ken. Lillian knows Harrison. Charles knows Jon. Lillian knows Tony. Jude knows Darnell. Marian knows Colin. Which of Darnell and Susanne can Marian reach?", "answer": "Susanne", "steps": [ "Marian knows Colin.", "Colin knows Susanne." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Marian", "Lillian", "Ira", "Susanne", "Colin", "Ken", "Beau", "Trudy", "Harrison", "Tony", "Kyle", "Charles", "Emanuel", "Darnell", "Jude", "Jon", "Wendell", "Diana", "Ashton", "Emery" ], "edges": [ [ 0, 6 ], [ 0, 7 ], [ 0, 4 ], [ 1, 5 ], [ 1, 8 ], [ 1, 9 ], [ 3, 2 ], [ 3, 1 ], [ 4, 3 ], [ 10, 16 ], [ 10, 17 ], [ 10, 14 ], [ 11, 15 ], [ 11, 18 ], [ 11, 19 ], [ 13, 12 ], [ 13, 11 ], [ 14, 13 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Chantal knows Curtis. Vivian knows James. Sydney knows Don. Don knows Benjamin. Lars knows Sydney. Calvin knows Heidi. Wanda knows Enid. Clinton knows Bruno. Clarissa knows Violet. Kenzie knows Calvin. Violet knows Wanda. Benjamin knows Kenzie. Marcia knows Clarissa. James knows Marcia. Benjamin knows Kent. Bruno knows Vivian. Curtis knows Lars. Clarissa knows Destiny. Which of Don and Marcia can Chantal reach?", "answer": "Don", "steps": [ "Chantal knows Curtis.", "Curtis knows Lars.", "Lars knows Sydney.", "Sydney knows Don." ], "difficulty": 4, "original_distance": 8, "idx_to_symbol": [ "Chantal", "Curtis", "Don", "Kent", "Lars", "Benjamin", "Kenzie", "Sydney", "Calvin", "Heidi", "Clinton", "Bruno", "Marcia", "Destiny", "Vivian", "Clarissa", "Violet", "James", "Wanda", "Enid" ], "edges": [ [ 0, 1 ], [ 1, 4 ], [ 2, 5 ], [ 4, 7 ], [ 5, 3 ], [ 5, 6 ], [ 6, 8 ], [ 7, 2 ], [ 8, 9 ], [ 10, 11 ], [ 11, 14 ], [ 12, 15 ], [ 14, 17 ], [ 15, 13 ], [ 15, 16 ], [ 16, 18 ], [ 17, 12 ], [ 18, 19 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Christopher knows Jodi. Clinton knows Alvin. Gonzalo knows Boyd. Naomi knows Livia. Alvin knows Christopher. Alvin knows Miriam. Alvin knows Marcia. Boyd knows Erica. Sidney knows Perry. Jodi knows Herbert. Dirk knows Naomi. Naomi knows Skyler. Harry knows Eugene. Yara knows Harry. Livia knows Sidney. Miriam knows Yara. Skyler knows Gonzalo. Naomi knows Connor. Which of Naomi and Alvin can Clinton reach?", "answer": "Alvin", "steps": [ "Clinton knows Alvin." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Clinton", "Alvin", "Marcia", "Herbert", "Yara", "Miriam", "Eugene", "Jodi", "Harry", "Christopher", "Dirk", "Naomi", "Connor", "Perry", "Gonzalo", "Skyler", "Erica", "Sidney", "Boyd", "Livia" ], "edges": [ [ 0, 1 ], [ 1, 2 ], [ 1, 5 ], [ 1, 9 ], [ 4, 8 ], [ 5, 4 ], [ 7, 3 ], [ 8, 6 ], [ 9, 7 ], [ 10, 11 ], [ 11, 12 ], [ 11, 15 ], [ 11, 19 ], [ 14, 18 ], [ 15, 14 ], [ 17, 13 ], [ 18, 16 ], [ 19, 17 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Tracy knows Chris. Angela knows Joan. Julia knows Rose. Kennedy knows Aldo. Tracy knows Damien. Antonio knows Angela. Joan knows Kennedy. Rose knows Jonathan. Cornelius knows Janice. Kennedy knows Lance. Kennedy knows Cornelius. Tracy knows Donald. Rose knows Gloria. Antonio knows Lenora. Gloria knows Guillermo. Guillermo knows Tracy. Chris knows Langston. Bert knows Antonio. Which of Joan and Guillermo can Julia reach?", "answer": "Guillermo", "steps": [ "Julia knows Rose.", "Rose knows Gloria.", "Gloria knows Guillermo." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Julia", "Guillermo", "Jonathan", "Tracy", "Donald", "Langston", "Rose", "Chris", "Damien", "Gloria", "Bert", "Joan", "Lenora", "Kennedy", "Aldo", "Janice", "Antonio", "Cornelius", "Lance", "Angela" ], "edges": [ [ 0, 6 ], [ 1, 3 ], [ 3, 4 ], [ 3, 7 ], [ 3, 8 ], [ 6, 2 ], [ 6, 9 ], [ 7, 5 ], [ 9, 1 ], [ 10, 16 ], [ 11, 13 ], [ 13, 14 ], [ 13, 17 ], [ 13, 18 ], [ 16, 12 ], [ 16, 19 ], [ 17, 15 ], [ 19, 11 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Jenny knows Boris. Kenneth knows Garrison. Candice knows Kenneth. Sheryl knows Philip. Gerald knows Sheryl. Hayes knows Lawson. Candice knows Aiden. Sheryl knows Joy. Maria knows Nathan. Boris knows Maria. Logan knows Hayes. Philip knows Candice. Jenny knows Xander. Maria knows Logan. Alana knows Justine. Alana knows Jenny. Garrison knows Craig. Gerald knows Sean. Which of Craig and Lawson can Gerald reach?", "answer": "Craig", "steps": [ "Gerald knows Sheryl.", "Sheryl knows Philip.", "Philip knows Candice.", "Candice knows Kenneth.", "Kenneth knows Garrison.", "Garrison knows Craig." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Gerald", "Kenneth", "Sean", "Craig", "Aiden", "Garrison", "Philip", "Sheryl", "Candice", "Joy", "Alana", "Logan", "Justine", "Lawson", "Nathan", "Hayes", "Boris", "Jenny", "Maria", "Xander" ], "edges": [ [ 0, 2 ], [ 0, 7 ], [ 1, 5 ], [ 5, 3 ], [ 6, 8 ], [ 7, 6 ], [ 7, 9 ], [ 8, 4 ], [ 8, 1 ], [ 10, 12 ], [ 10, 17 ], [ 11, 15 ], [ 15, 13 ], [ 16, 18 ], [ 17, 16 ], [ 17, 19 ], [ 18, 14 ], [ 18, 11 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Javier knows Inez. Abigail knows Javier. Kent knows Jenny. Javier knows Lawson. Dewey knows Charlotte. Charlotte knows Barbara. Logan knows Magdalena. Inez knows Camden. Eli knows Ellen. Jenny knows Dewey. Logan knows Jenna. Dewey knows Logan. Dewey knows Hope. Jenna knows Stacy. Jameson knows Abigail. Inez knows Serena. Camden knows Jewel. Javier knows Eli. Which of Camden and Jenna can Jameson reach?", "answer": "Camden", "steps": [ "Jameson knows Abigail.", "Abigail knows Javier.", "Javier knows Inez.", "Inez knows Camden." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Jameson", "Serena", "Abigail", "Eli", "Camden", "Inez", "Javier", "Lawson", "Ellen", "Jewel", "Kent", "Magdalena", "Jenny", "Charlotte", "Jenna", "Logan", "Dewey", "Hope", "Barbara", "Stacy" ], "edges": [ [ 0, 2 ], [ 2, 6 ], [ 3, 8 ], [ 4, 9 ], [ 5, 1 ], [ 5, 4 ], [ 6, 7 ], [ 6, 3 ], [ 6, 5 ], [ 10, 12 ], [ 12, 16 ], [ 13, 18 ], [ 14, 19 ], [ 15, 11 ], [ 15, 14 ], [ 16, 17 ], [ 16, 13 ], [ 16, 15 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Abel knows Morris. Kay knows Ruby. Carey knows Dolores. Celia knows Franklin. Latoya knows Linda. Ember knows Abel. Latoya knows Jared. Nina knows Latoya. Franklin knows Sally. Ralph knows Kay. Chester knows Flora. Dolores knows Nina. Chester knows Ellis. Carey knows Skyler. Dolores knows Celia. Ember knows Marlene. Abel knows Ralph. Morris knows Chester. Which of Abel and Dolores can Ember reach?", "answer": "Abel", "steps": [ "Ember knows Abel." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Ember", "Kay", "Ralph", "Morris", "Abel", "Chester", "Flora", "Ellis", "Ruby", "Marlene", "Carey", "Franklin", "Celia", "Nina", "Dolores", "Latoya", "Linda", "Jared", "Sally", "Skyler" ], "edges": [ [ 0, 4 ], [ 0, 9 ], [ 1, 8 ], [ 2, 1 ], [ 3, 5 ], [ 4, 3 ], [ 4, 2 ], [ 5, 6 ], [ 5, 7 ], [ 10, 14 ], [ 10, 19 ], [ 11, 18 ], [ 12, 11 ], [ 13, 15 ], [ 14, 13 ], [ 14, 12 ], [ 15, 16 ], [ 15, 17 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Ivy knows Seth. Denver knows Regina. Saul knows Kelly. Eamon knows Sam. Regina knows Ivy. Nina knows Otto. Alan knows Mara. Jeanette knows Ezra. Regina knows Eamon. Nina knows Jesse. Mara knows Jeanette. Jodi knows Billy. Mara knows Nina. Ivy knows Gabe. Jodi knows Alan. Jeanette knows Ruby. Saul knows Denver. Eamon knows Tyler. Which of Sam and Otto can Saul reach?", "answer": "Sam", "steps": [ "Saul knows Denver.", "Denver knows Regina.", "Regina knows Eamon.", "Eamon knows Sam." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Saul", "Regina", "Seth", "Gabe", "Eamon", "Tyler", "Denver", "Sam", "Kelly", "Ivy", "Jodi", "Mara", "Ruby", "Ezra", "Nina", "Jesse", "Alan", "Otto", "Billy", "Jeanette" ], "edges": [ [ 0, 8 ], [ 0, 6 ], [ 1, 4 ], [ 1, 9 ], [ 4, 5 ], [ 4, 7 ], [ 6, 1 ], [ 9, 2 ], [ 9, 3 ], [ 10, 18 ], [ 10, 16 ], [ 11, 14 ], [ 11, 19 ], [ 14, 15 ], [ 14, 17 ], [ 16, 11 ], [ 19, 12 ], [ 19, 13 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Hugh knows Archer. Archer knows Yuki. Harriet knows Dexter. Harriet knows Don. Blake knows Bennett. Troy knows Stella. Bennett knows Harriet. Brock knows Hazel. Khashayar knows Blake. Bennett knows Troy. Vernon knows Beverly. Yuki knows Brock. Delilah knows Samuel. Patrick knows Kate. Dexter knows Patrick. Vernon knows Charles. Yuki knows Vernon. Beverly knows Delilah. Which of Harriet and Vernon can Khashayar reach?", "answer": "Harriet", "steps": [ "Khashayar knows Blake.", "Blake knows Bennett.", "Bennett knows Harriet." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Khashayar", "Blake", "Harriet", "Bennett", "Patrick", "Kate", "Don", "Troy", "Dexter", "Stella", "Hugh", "Archer", "Vernon", "Yuki", "Delilah", "Samuel", "Charles", "Brock", "Beverly", "Hazel" ], "edges": [ [ 0, 1 ], [ 1, 3 ], [ 2, 6 ], [ 2, 8 ], [ 3, 2 ], [ 3, 7 ], [ 4, 5 ], [ 7, 9 ], [ 8, 4 ], [ 10, 11 ], [ 11, 13 ], [ 12, 16 ], [ 12, 18 ], [ 13, 12 ], [ 13, 17 ], [ 14, 15 ], [ 17, 19 ], [ 18, 14 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Lola knows Mark. Val knows Nathan. Aaron knows Ada. Ada knows Val. Hayden knows Ashley. Judith knows Hayden. Joel knows Lola. Brooke knows Julian. Greg knows Becky. Becky knows Cesar. Iris knows Jolena. Iris knows Gerald. Hayden knows Boyd. Mark knows Iris. Lola knows Kathleen. Kathleen knows Greg. Julian knows Judith. Julian knows Aaron. Which of Lola and Julian can Brooke reach?", "answer": "Julian", "steps": [ "Brooke knows Julian." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Brooke", "Ada", "Boyd", "Aaron", "Nathan", "Julian", "Judith", "Hayden", "Ashley", "Val", "Joel", "Greg", "Gerald", "Kathleen", "Cesar", "Lola", "Mark", "Iris", "Jolena", "Becky" ], "edges": [ [ 0, 5 ], [ 1, 9 ], [ 3, 1 ], [ 5, 6 ], [ 5, 3 ], [ 6, 7 ], [ 7, 2 ], [ 7, 8 ], [ 9, 4 ], [ 10, 15 ], [ 11, 19 ], [ 13, 11 ], [ 15, 16 ], [ 15, 13 ], [ 16, 17 ], [ 17, 12 ], [ 17, 18 ], [ 19, 14 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Colby knows Colette. Erica knows Sam. Hilda knows Colby. Kendra knows Porter. Hilda knows Bruce. Anita knows Hilda. Kendra knows Dudley. Aaron knows Anita. Otto knows India. India knows June. Bruce knows Houston. India knows Kendra. Sam knows Otto. Monroe knows Aaron. June knows Daniel. June knows Owen. Bruce knows Arturo. Colby knows Noel. Which of Anita and Otto can Monroe reach?", "answer": "Anita", "steps": [ "Monroe knows Aaron.", "Aaron knows Anita." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Monroe", "Bruce", "Colby", "Anita", "Colette", "Aaron", "Hilda", "Houston", "Noel", "Arturo", "Erica", "June", "Kendra", "Otto", "Dudley", "Sam", "India", "Owen", "Porter", "Daniel" ], "edges": [ [ 0, 5 ], [ 1, 7 ], [ 1, 9 ], [ 2, 4 ], [ 2, 8 ], [ 3, 6 ], [ 5, 3 ], [ 6, 2 ], [ 6, 1 ], [ 10, 15 ], [ 11, 17 ], [ 11, 19 ], [ 12, 14 ], [ 12, 18 ], [ 13, 16 ], [ 15, 13 ], [ 16, 12 ], [ 16, 11 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Eden knows Viola. Marilyn knows Val. Eden knows Wanda. William knows Gwen. Hope knows Estella. Ella knows Dora. Colin knows Demetrius. Dora knows Marilyn. Hope knows Eden. Earle knows Hope. Jonah knows Colin. Marilyn knows Porter. Demetrius knows Ella. Pearl knows Earle. Harris knows Pearl. Dora knows William. Estella knows Cameron. Corinne knows Harris. Which of Viola and Val can Corinne reach?", "answer": "Viola", "steps": [ "Corinne knows Harris.", "Harris knows Pearl.", "Pearl knows Earle.", "Earle knows Hope.", "Hope knows Eden.", "Eden knows Viola." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Corinne", "Harris", "Hope", "Eden", "Estella", "Cameron", "Pearl", "Viola", "Earle", "Wanda", "Jonah", "Colin", "Dora", "Marilyn", "William", "Gwen", "Demetrius", "Val", "Ella", "Porter" ], "edges": [ [ 0, 1 ], [ 1, 6 ], [ 2, 4 ], [ 2, 3 ], [ 3, 7 ], [ 3, 9 ], [ 4, 5 ], [ 6, 8 ], [ 8, 2 ], [ 10, 11 ], [ 11, 16 ], [ 12, 14 ], [ 12, 13 ], [ 13, 17 ], [ 13, 19 ], [ 14, 15 ], [ 16, 18 ], [ 18, 12 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Harry knows Joaquin. Boris knows Eric. Lois knows Dina. Eric knows Winifred. Hattie knows Milo. Roger knows Lark. Luna knows Boris. Lark knows Keaton. Keaton knows Zelda. Joaquin knows Vance. Milo knows Julian. Luna knows Fleur. Lois knows Roger. Luna knows Ruth. Zelda knows Hattie. Lois knows Dallas. Elaine knows Harry. Winifred knows Elaine. Which of Hattie and Harry can Luna reach?", "answer": "Harry", "steps": [ "Luna knows Boris.", "Boris knows Eric.", "Eric knows Winifred.", "Winifred knows Elaine.", "Elaine knows Harry." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Luna", "Vance", "Winifred", "Fleur", "Boris", "Joaquin", "Eric", "Elaine", "Ruth", "Harry", "Lois", "Julian", "Keaton", "Dallas", "Roger", "Milo", "Lark", "Zelda", "Dina", "Hattie" ], "edges": [ [ 0, 3 ], [ 0, 8 ], [ 0, 4 ], [ 2, 7 ], [ 4, 6 ], [ 5, 1 ], [ 6, 2 ], [ 7, 9 ], [ 9, 5 ], [ 10, 13 ], [ 10, 18 ], [ 10, 14 ], [ 12, 17 ], [ 14, 16 ], [ 15, 11 ], [ 16, 12 ], [ 17, 19 ], [ 19, 15 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Dalton knows Lara. Dalton knows Simon. Leland knows Jeremy. Autumn knows Rick. Jeremy knows Esperanza. Lara knows Geneva. Adele knows Isla. Geneva knows Darla. Isla knows Helene. Fletcher knows Ivy. Helene knows Dalton. Dalton knows Daphna. Daphna knows Federico. Jeremy knows Kai. Yuki knows Leland. Jeremy knows Autumn. Sue knows Yuki. Esperanza knows Fletcher. Which of Jeremy and Dalton can Sue reach?", "answer": "Jeremy", "steps": [ "Sue knows Yuki.", "Yuki knows Leland.", "Leland knows Jeremy." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Sue", "Leland", "Esperanza", "Kai", "Fletcher", "Yuki", "Rick", "Jeremy", "Ivy", "Autumn", "Adele", "Helene", "Lara", "Simon", "Geneva", "Isla", "Federico", "Dalton", "Darla", "Daphna" ], "edges": [ [ 0, 5 ], [ 1, 7 ], [ 2, 4 ], [ 4, 8 ], [ 5, 1 ], [ 7, 3 ], [ 7, 2 ], [ 7, 9 ], [ 9, 6 ], [ 10, 15 ], [ 11, 17 ], [ 12, 14 ], [ 14, 18 ], [ 15, 11 ], [ 17, 13 ], [ 17, 12 ], [ 17, 19 ], [ 19, 16 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Marco knows Javier. Hugo knows Milo. Noah knows Chelsea. Carmela knows Glenn. Milo knows Knox. Marco knows Noah. Hugo knows Jade. Ray knows Carmela. Chelsea knows Aubrey. Milo knows Elias. Ray knows Gemma. Ray knows Marco. Milo knows Wallace. Marco knows Melody. Wallace knows Kelly. Hugo knows Terrence. Terrence knows Ava. Kelly knows Freya. Which of Noah and Wallace can Hugo reach?", "answer": "Wallace", "steps": [ "Hugo knows Milo.", "Milo knows Wallace." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Hugo", "Terrence", "Knox", "Kelly", "Jade", "Elias", "Ava", "Milo", "Freya", "Wallace", "Ray", "Carmela", "Javier", "Chelsea", "Gemma", "Melody", "Glenn", "Marco", "Aubrey", "Noah" ], "edges": [ [ 0, 4 ], [ 0, 1 ], [ 0, 7 ], [ 1, 6 ], [ 3, 8 ], [ 7, 2 ], [ 7, 5 ], [ 7, 9 ], [ 9, 3 ], [ 10, 14 ], [ 10, 11 ], [ 10, 17 ], [ 11, 16 ], [ 13, 18 ], [ 17, 12 ], [ 17, 15 ], [ 17, 19 ], [ 19, 13 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Tessa knows Patricia. Tessa knows Camille. Cody knows Declan. Frida knows Joseph. Grant knows Samuel. Itzel knows Grant. Frida knows Travis. Declan knows Lamont. Clifford knows Kara. Joseph knows Ernesto. Samuel knows Cody. Frida knows Lyle. Travis knows Matt. Kara knows Frida. Yvette knows Clifford. Cody knows Demetrius. Cody knows Tessa. Joseph knows Dawn. Which of Clifford and Grant can Yvette reach?", "answer": "Clifford", "steps": [ "Yvette knows Clifford." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Yvette", "Clifford", "Joseph", "Matt", "Dawn", "Ernesto", "Frida", "Kara", "Lyle", "Travis", "Itzel", "Grant", "Tessa", "Lamont", "Patricia", "Camille", "Cody", "Samuel", "Demetrius", "Declan" ], "edges": [ [ 0, 1 ], [ 1, 7 ], [ 2, 4 ], [ 2, 5 ], [ 6, 2 ], [ 6, 8 ], [ 6, 9 ], [ 7, 6 ], [ 9, 3 ], [ 10, 11 ], [ 11, 17 ], [ 12, 14 ], [ 12, 15 ], [ 16, 12 ], [ 16, 18 ], [ 16, 19 ], [ 17, 16 ], [ 19, 13 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "April knows Diane. Damian knows Xavier. Fergus knows April. Clyde knows Pauline. Andrea knows Desmond. Coral knows Damian. Desmond knows Fergus. Andrea knows Graham. Diane knows Tracy. Damian knows Miriam. Diane knows Blair. Elodie knows Sally. Xavier knows Elodie. Justine knows Andrea. Fergus knows Faith. Pauline knows Coral. Elodie knows Monica. Pauline knows Declan. Which of Coral and Desmond can Justine reach?", "answer": "Desmond", "steps": [ "Justine knows Andrea.", "Andrea knows Desmond." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Justine", "Blair", "Andrea", "April", "Desmond", "Faith", "Tracy", "Graham", "Diane", "Fergus", "Clyde", "Monica", "Pauline", "Xavier", "Coral", "Miriam", "Sally", "Declan", "Elodie", "Damian" ], "edges": [ [ 0, 2 ], [ 2, 7 ], [ 2, 4 ], [ 3, 8 ], [ 4, 9 ], [ 8, 1 ], [ 8, 6 ], [ 9, 5 ], [ 9, 3 ], [ 10, 12 ], [ 12, 17 ], [ 12, 14 ], [ 13, 18 ], [ 14, 19 ], [ 18, 11 ], [ 18, 16 ], [ 19, 15 ], [ 19, 13 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Hannah knows Sheila. Chandler knows Enrique. Penny knows Chandler. Chandler knows Eloise. Dina knows Sonia. Wilma knows Jessie. Jessie knows Dina. Dina knows Dominic. Raquel knows Hannah. Penny knows Eduardo. Jessie knows Joseph. Yolanda knows William. Wilma knows Virgil. Thomas knows Raquel. Eduardo knows Merle. William knows Wilma. Hannah knows Penny. Joseph knows Ariana. Which of Joseph and Eduardo can Thomas reach?", "answer": "Eduardo", "steps": [ "Thomas knows Raquel.", "Raquel knows Hannah.", "Hannah knows Penny.", "Penny knows Eduardo." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Thomas", "Sheila", "Hannah", "Chandler", "Penny", "Merle", "Enrique", "Raquel", "Eloise", "Eduardo", "Yolanda", "Virgil", "Wilma", "Dina", "Jessie", "Ariana", "Dominic", "William", "Sonia", "Joseph" ], "edges": [ [ 0, 7 ], [ 2, 1 ], [ 2, 4 ], [ 3, 6 ], [ 3, 8 ], [ 4, 3 ], [ 4, 9 ], [ 7, 2 ], [ 9, 5 ], [ 10, 17 ], [ 12, 11 ], [ 12, 14 ], [ 13, 16 ], [ 13, 18 ], [ 14, 13 ], [ 14, 19 ], [ 17, 12 ], [ 19, 15 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Christopher knows Jodi. Clinton knows Alvin. Gonzalo knows Boyd. Naomi knows Livia. Alvin knows Christopher. Alvin knows Miriam. Alvin knows Marcia. Boyd knows Erica. Sidney knows Perry. Jodi knows Herbert. Dirk knows Naomi. Naomi knows Skyler. Harry knows Eugene. Yara knows Harry. Livia knows Sidney. Miriam knows Yara. Skyler knows Gonzalo. Naomi knows Connor. Which of Harry and Boyd can Clinton reach?", "answer": "Harry", "steps": [ "Clinton knows Alvin.", "Alvin knows Miriam.", "Miriam knows Yara.", "Yara knows Harry." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Clinton", "Alvin", "Marcia", "Herbert", "Yara", "Miriam", "Eugene", "Jodi", "Harry", "Christopher", "Dirk", "Naomi", "Connor", "Perry", "Gonzalo", "Skyler", "Erica", "Sidney", "Boyd", "Livia" ], "edges": [ [ 0, 1 ], [ 1, 2 ], [ 1, 5 ], [ 1, 9 ], [ 4, 8 ], [ 5, 4 ], [ 7, 3 ], [ 8, 6 ], [ 9, 7 ], [ 10, 11 ], [ 11, 12 ], [ 11, 15 ], [ 11, 19 ], [ 14, 18 ], [ 15, 14 ], [ 17, 13 ], [ 18, 16 ], [ 19, 17 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Lorraine knows Hampton. Eve knows Electra. Charles knows Winston. Elaine knows Ember. Julio knows Lorraine. Ember knows Judy. Everett knows Isadora. Francis knows Karina. Ross knows Eve. Clayton knows Charles. India knows Jared. Francis knows Emily. Karina knows Darnell. India knows Clayton. Winston knows Everett. Electra knows Julio. Isadora knows Elaine. Darnell knows Ross. Which of Julio and Elaine can India reach?", "answer": "Elaine", "steps": [ "India knows Clayton.", "Clayton knows Charles.", "Charles knows Winston.", "Winston knows Everett.", "Everett knows Isadora.", "Isadora knows Elaine." ], "difficulty": 6, "original_distance": 8, "idx_to_symbol": [ "India", "Ember", "Everett", "Winston", "Judy", "Jared", "Elaine", "Charles", "Isadora", "Clayton", "Francis", "Lorraine", "Eve", "Ross", "Hampton", "Emily", "Julio", "Darnell", "Electra", "Karina" ], "edges": [ [ 0, 5 ], [ 0, 9 ], [ 1, 4 ], [ 2, 8 ], [ 3, 2 ], [ 6, 1 ], [ 7, 3 ], [ 8, 6 ], [ 9, 7 ], [ 10, 15 ], [ 10, 19 ], [ 11, 14 ], [ 12, 18 ], [ 13, 12 ], [ 16, 11 ], [ 17, 13 ], [ 18, 16 ], [ 19, 17 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Fergus knows Jonas. Sydney knows Erik. Russ knows Faith. Carter knows Bennett. Leigh knows Ashton. Desmond knows Steve. Bennett knows Dave. Desmond knows Edgar. Bennett knows Sydney. Colette knows Russ. Leigh knows Lena. Fergus knows Colette. Carter knows Hope. Sydney knows Desmond. Russ knows Leigh. Hope knows Tom. Colette knows Stephen. Jonas knows Arlene. Which of Sydney and Russ can Fergus reach?", "answer": "Russ", "steps": [ "Fergus knows Colette.", "Colette knows Russ." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Fergus", "Jonas", "Stephen", "Faith", "Colette", "Lena", "Arlene", "Russ", "Ashton", "Leigh", "Carter", "Hope", "Dave", "Erik", "Bennett", "Edgar", "Tom", "Sydney", "Steve", "Desmond" ], "edges": [ [ 0, 1 ], [ 0, 4 ], [ 1, 6 ], [ 4, 2 ], [ 4, 7 ], [ 7, 3 ], [ 7, 9 ], [ 9, 5 ], [ 9, 8 ], [ 10, 11 ], [ 10, 14 ], [ 11, 16 ], [ 14, 12 ], [ 14, 17 ], [ 17, 13 ], [ 17, 19 ], [ 19, 15 ], [ 19, 18 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Demetrius knows Neil. Josie knows Brittany. Eva knows Lucas. Josie knows Nora. Zach knows Daisy. Claire knows Virgil. Zach knows Philip. Sybil knows Enid. Sybil knows Layla. Eva knows Henry. Eva knows Demetrius. Zach knows Claire. Josie knows Jeremiah. Cruz knows Uma. Jeremiah knows Haley. Claire knows Eva. Sybil knows Cruz. Cruz knows Josie. Which of Josie and Eva can Sybil reach?", "answer": "Josie", "steps": [ "Sybil knows Cruz.", "Cruz knows Josie." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Sybil", "Uma", "Nora", "Layla", "Jeremiah", "Haley", "Enid", "Brittany", "Josie", "Cruz", "Zach", "Virgil", "Lucas", "Philip", "Demetrius", "Neil", "Daisy", "Henry", "Eva", "Claire" ], "edges": [ [ 0, 3 ], [ 0, 6 ], [ 0, 9 ], [ 4, 5 ], [ 8, 2 ], [ 8, 4 ], [ 8, 7 ], [ 9, 1 ], [ 9, 8 ], [ 10, 13 ], [ 10, 16 ], [ 10, 19 ], [ 14, 15 ], [ 18, 12 ], [ 18, 14 ], [ 18, 17 ], [ 19, 11 ], [ 19, 18 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Dorothy knows Colette. Priscilla knows Regina. Fanny knows Lorna. Jakob knows Lee. Lorna knows Zane. Jakob knows Grace. Jaime knows Humphrey. Dorothy knows Parker. Erwin knows Todd. Zane knows Dixie. Jaime knows Erwin. Parker knows Priscilla. Grace knows Fanny. Grace knows Celia. Miles knows Jaime. Sam knows Jakob. Erwin knows Dorothy. Fanny knows Sierra. Which of Fanny and Dorothy can Miles reach?", "answer": "Dorothy", "steps": [ "Miles knows Jaime.", "Jaime knows Erwin.", "Erwin knows Dorothy." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Miles", "Regina", "Jaime", "Erwin", "Todd", "Dorothy", "Priscilla", "Parker", "Humphrey", "Colette", "Sam", "Dixie", "Jakob", "Grace", "Celia", "Fanny", "Zane", "Lorna", "Lee", "Sierra" ], "edges": [ [ 0, 2 ], [ 2, 8 ], [ 2, 3 ], [ 3, 4 ], [ 3, 5 ], [ 5, 7 ], [ 5, 9 ], [ 6, 1 ], [ 7, 6 ], [ 10, 12 ], [ 12, 18 ], [ 12, 13 ], [ 13, 14 ], [ 13, 15 ], [ 15, 17 ], [ 15, 19 ], [ 16, 11 ], [ 17, 16 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Arden knows Eunice. Austin knows Laura. Constance knows Wayne. Arden knows Simon. Lauren knows Dolly. Alejandro knows Ricardo. Austin knows Kristin. Peter knows Donovan. Alejandro knows Lamont. Lamont knows Austin. Donovan knows Kerry. Wayne knows Lauren. Austin knows Peter. Constance knows Hardy. Constance knows Sean. Ramona knows Arden. Eunice knows Constance. Emery knows Alejandro. Which of Peter and Wayne can Emery reach?", "answer": "Peter", "steps": [ "Emery knows Alejandro.", "Alejandro knows Lamont.", "Lamont knows Austin.", "Austin knows Peter." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Emery", "Austin", "Alejandro", "Ricardo", "Peter", "Kristin", "Donovan", "Lamont", "Kerry", "Laura", "Ramona", "Constance", "Arden", "Simon", "Wayne", "Hardy", "Lauren", "Eunice", "Dolly", "Sean" ], "edges": [ [ 0, 2 ], [ 1, 5 ], [ 1, 4 ], [ 1, 9 ], [ 2, 3 ], [ 2, 7 ], [ 4, 6 ], [ 6, 8 ], [ 7, 1 ], [ 10, 12 ], [ 11, 15 ], [ 11, 14 ], [ 11, 19 ], [ 12, 13 ], [ 12, 17 ], [ 14, 16 ], [ 16, 18 ], [ 17, 11 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Earle knows Laura. Roland knows Darcy. Lucy knows Betty. Kevin knows Dixie. Yolanda knows Mae. Betty knows Kevin. Greer knows Earle. George knows Thea. Joy knows Lucy. Kevin knows Yolanda. Edna knows Wallace. Laura knows George. Dirk knows Agnes. Thea knows Roland. Ivan knows Joy. Darcy knows Dirk. Darcy knows Cecilia. Wallace knows Ivan. Which of Ivan and Laura can Edna reach?", "answer": "Ivan", "steps": [ "Edna knows Wallace.", "Wallace knows Ivan." ], "difficulty": 2, "original_distance": 8, "idx_to_symbol": [ "Edna", "Mae", "Kevin", "Wallace", "Joy", "Lucy", "Betty", "Yolanda", "Dixie", "Ivan", "Greer", "Agnes", "Darcy", "Earle", "George", "Thea", "Roland", "Dirk", "Cecilia", "Laura" ], "edges": [ [ 0, 3 ], [ 2, 7 ], [ 2, 8 ], [ 3, 9 ], [ 4, 5 ], [ 5, 6 ], [ 6, 2 ], [ 7, 1 ], [ 9, 4 ], [ 10, 13 ], [ 12, 17 ], [ 12, 18 ], [ 13, 19 ], [ 14, 15 ], [ 15, 16 ], [ 16, 12 ], [ 17, 11 ], [ 19, 14 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Miles knows Dee. Jules knows Joshua. Miles knows Ethan. Joshua knows Becky. Erik knows Jules. Ernesto knows Cecilia. Whitney knows Fritz. Nash knows Dewey. Ethan knows Beau. Erik knows Katrina. Beau knows Blair. Nash knows Whitney. Joshua knows Ernesto. Karen knows Elaine. Dee knows Nash. Katrina knows Karen. Beau knows Eduardo. Karen knows Franklin. Which of Dee and Jules can Erik reach?", "answer": "Jules", "steps": [ "Erik knows Jules." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Erik", "Ernesto", "Katrina", "Elaine", "Joshua", "Karen", "Jules", "Becky", "Franklin", "Cecilia", "Miles", "Whitney", "Ethan", "Blair", "Nash", "Beau", "Dee", "Dewey", "Eduardo", "Fritz" ], "edges": [ [ 0, 2 ], [ 0, 6 ], [ 1, 9 ], [ 2, 5 ], [ 4, 7 ], [ 4, 1 ], [ 5, 3 ], [ 5, 8 ], [ 6, 4 ], [ 10, 12 ], [ 10, 16 ], [ 11, 19 ], [ 12, 15 ], [ 14, 17 ], [ 14, 11 ], [ 15, 13 ], [ 15, 18 ], [ 16, 14 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Boris knows Hendrix. Ann knows Khashayar. Hendrix knows Jessie. Boris knows Myrtle. Boris knows Stefan. Pedro knows Peter. Stefan knows Eric. Carlos knows Louise. Eric knows Denise. Greta knows Robin. Khashayar knows Carlos. Blake knows Greta. Blake knows Marvin. Marvin knows Ann. Blake knows Dean. Dean knows Jane. Myrtle knows Faye. Denise knows Pedro. Which of Ann and Eric can Blake reach?", "answer": "Ann", "steps": [ "Blake knows Marvin.", "Marvin knows Ann." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Blake", "Dean", "Jane", "Louise", "Carlos", "Robin", "Greta", "Marvin", "Ann", "Khashayar", "Boris", "Myrtle", "Faye", "Peter", "Pedro", "Jessie", "Hendrix", "Stefan", "Eric", "Denise" ], "edges": [ [ 0, 1 ], [ 0, 6 ], [ 0, 7 ], [ 1, 2 ], [ 4, 3 ], [ 6, 5 ], [ 7, 8 ], [ 8, 9 ], [ 9, 4 ], [ 10, 11 ], [ 10, 16 ], [ 10, 17 ], [ 11, 12 ], [ 14, 13 ], [ 16, 15 ], [ 17, 18 ], [ 18, 19 ], [ 19, 14 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Luis knows Michael. Jim knows Lynn. Winston knows Alana. Stella knows Winston. George knows Eve. Michael knows Nell. Andrea knows Carey. Lenora knows Paul. Eve knows Carol. Luis knows Harlan. Michael knows Stella. Alan knows Fraser. Eden knows Jim. Alan knows George. Alana knows Eden. Andrea knows Alan. Magdalena knows Lenora. Carol knows Magdalena. Which of Magdalena and Eden can Luis reach?", "answer": "Eden", "steps": [ "Luis knows Michael.", "Michael knows Stella.", "Stella knows Winston.", "Winston knows Alana.", "Alana knows Eden." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Luis", "Winston", "Stella", "Eden", "Harlan", "Lynn", "Jim", "Alana", "Michael", "Nell", "Andrea", "Eve", "George", "Magdalena", "Carey", "Paul", "Lenora", "Carol", "Alan", "Fraser" ], "edges": [ [ 0, 4 ], [ 0, 8 ], [ 1, 7 ], [ 2, 1 ], [ 3, 6 ], [ 6, 5 ], [ 7, 3 ], [ 8, 2 ], [ 8, 9 ], [ 10, 14 ], [ 10, 18 ], [ 11, 17 ], [ 12, 11 ], [ 13, 16 ], [ 16, 15 ], [ 17, 13 ], [ 18, 12 ], [ 18, 19 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Brynn knows Reid. Reid knows Chandler. Mindy knows Dell. Alyson knows Gonzalo. Dorian knows Alyson. Tracy knows Virgil. Margaret knows Brynn. Jim knows Dina. Hayes knows Dorian. Elena knows Julio. Dudley knows Diana. Diana knows Mindy. Virgil knows Margaret. Chandler knows Hayes. Simon knows Jim. Sean knows Simon. Julio knows Dudley. Dell knows Sean. Which of Mindy and Reid can Elena reach?", "answer": "Mindy", "steps": [ "Elena knows Julio.", "Julio knows Dudley.", "Dudley knows Diana.", "Diana knows Mindy." ], "difficulty": 4, "original_distance": 9, "idx_to_symbol": [ "Elena", "Jim", "Simon", "Dudley", "Dina", "Dell", "Julio", "Diana", "Sean", "Mindy", "Tracy", "Alyson", "Dorian", "Margaret", "Gonzalo", "Chandler", "Virgil", "Brynn", "Hayes", "Reid" ], "edges": [ [ 0, 6 ], [ 1, 4 ], [ 2, 1 ], [ 3, 7 ], [ 5, 8 ], [ 6, 3 ], [ 7, 9 ], [ 8, 2 ], [ 9, 5 ], [ 10, 16 ], [ 11, 14 ], [ 12, 11 ], [ 13, 17 ], [ 15, 18 ], [ 16, 13 ], [ 17, 19 ], [ 18, 12 ], [ 19, 15 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Omar knows Beth. Geraldine knows Scott. Lawrence knows Ralph. Desmond knows Burt. Burt knows Kobe. Burt knows Pierce. Isabel knows Lola. Scott knows Nora. Hayes knows Riley. Rex knows Conner. Scott knows Omar. Ralph knows Isabel. Kobe knows Geraldine. Ralph knows Ramon. Hayes knows Rex. Kobe knows Harry. Isabel knows Helene. Helene knows Hayes. Which of Omar and Rex can Lawrence reach?", "answer": "Rex", "steps": [ "Lawrence knows Ralph.", "Ralph knows Isabel.", "Isabel knows Helene.", "Helene knows Hayes.", "Hayes knows Rex." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Lawrence", "Conner", "Isabel", "Rex", "Hayes", "Ramon", "Riley", "Lola", "Helene", "Ralph", "Desmond", "Beth", "Kobe", "Omar", "Scott", "Pierce", "Nora", "Harry", "Geraldine", "Burt" ], "edges": [ [ 0, 9 ], [ 2, 7 ], [ 2, 8 ], [ 3, 1 ], [ 4, 3 ], [ 4, 6 ], [ 8, 4 ], [ 9, 5 ], [ 9, 2 ], [ 10, 19 ], [ 12, 17 ], [ 12, 18 ], [ 13, 11 ], [ 14, 13 ], [ 14, 16 ], [ 18, 14 ], [ 19, 15 ], [ 19, 12 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Kieran knows Walter. Hugh knows Skyler. Damien knows Julio. Edith knows Crystal. Jocelyn knows Jolena. Luz knows Brooke. Jocelyn knows Hugh. Kieran knows Fergus. Damien knows Ursula. Ursula knows Jocelyn. Sydney knows Damien. Jolena knows Kaleb. Tony knows Vance. Vance knows Luz. Kingsley knows Edith. Edith knows Tony. Hugh knows Dustin. Vance knows Kieran. Which of Luz and Jolena can Sydney reach?", "answer": "Jolena", "steps": [ "Sydney knows Damien.", "Damien knows Ursula.", "Ursula knows Jocelyn.", "Jocelyn knows Jolena." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Sydney", "Jolena", "Damien", "Ursula", "Hugh", "Skyler", "Kaleb", "Julio", "Dustin", "Jocelyn", "Kingsley", "Luz", "Edith", "Tony", "Kieran", "Fergus", "Brooke", "Crystal", "Walter", "Vance" ], "edges": [ [ 0, 2 ], [ 1, 6 ], [ 2, 7 ], [ 2, 3 ], [ 3, 9 ], [ 4, 5 ], [ 4, 8 ], [ 9, 1 ], [ 9, 4 ], [ 10, 12 ], [ 11, 16 ], [ 12, 17 ], [ 12, 13 ], [ 13, 19 ], [ 14, 15 ], [ 14, 18 ], [ 19, 11 ], [ 19, 14 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Felix knows Mike. Alma knows Harry. Grace knows Enrique. Emily knows Grace. Harry knows Howard. Mike knows Ray. Jerome knows Jakob. Ray knows Todd. Jakob knows Ellis. Kara knows Brody. Mike knows Yasmin. Todd knows Jerome. Lorenzo knows Kara. Brody knows Cruz. Ellis knows Jessica. Enrique knows Lorenzo. Harry knows Emily. Jessica knows Blanche. Which of Ellis and Kara can Felix reach?", "answer": "Ellis", "steps": [ "Felix knows Mike.", "Mike knows Ray.", "Ray knows Todd.", "Todd knows Jerome.", "Jerome knows Jakob.", "Jakob knows Ellis." ], "difficulty": 6, "original_distance": 8, "idx_to_symbol": [ "Felix", "Blanche", "Mike", "Ray", "Jakob", "Yasmin", "Todd", "Jessica", "Ellis", "Jerome", "Alma", "Cruz", "Harry", "Emily", "Lorenzo", "Howard", "Grace", "Brody", "Kara", "Enrique" ], "edges": [ [ 0, 2 ], [ 2, 5 ], [ 2, 3 ], [ 3, 6 ], [ 4, 8 ], [ 6, 9 ], [ 7, 1 ], [ 8, 7 ], [ 9, 4 ], [ 10, 12 ], [ 12, 15 ], [ 12, 13 ], [ 13, 16 ], [ 14, 18 ], [ 16, 19 ], [ 17, 11 ], [ 18, 17 ], [ 19, 14 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Demetrius knows Kristin. Vance knows Lillian. Wendy knows Isabel. Roland knows Demetrius. Lillian knows Connor. Roland knows Brody. Pam knows Roland. Maude knows Marie. Wendy knows Roger. Nina knows Miles. Lillian knows Nina. Roland knows Blake. Kristin knows Leopold. Nina knows Jenna. Lillian knows Maude. Marie knows Nicole. Lillian knows Yvette. Roland knows Wendy. Which of Leopold and Nicole can Pam reach?", "answer": "Leopold", "steps": [ "Pam knows Roland.", "Roland knows Demetrius.", "Demetrius knows Kristin.", "Kristin knows Leopold." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Pam", "Roland", "Leopold", "Kristin", "Roger", "Demetrius", "Brody", "Blake", "Isabel", "Wendy", "Vance", "Lillian", "Nicole", "Marie", "Miles", "Maude", "Yvette", "Connor", "Jenna", "Nina" ], "edges": [ [ 0, 1 ], [ 1, 5 ], [ 1, 6 ], [ 1, 7 ], [ 1, 9 ], [ 3, 2 ], [ 5, 3 ], [ 9, 4 ], [ 9, 8 ], [ 10, 11 ], [ 11, 15 ], [ 11, 16 ], [ 11, 17 ], [ 11, 19 ], [ 13, 12 ], [ 15, 13 ], [ 19, 14 ], [ 19, 18 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Ariana knows Rhea. Destiny knows Peggy. Keith knows Gideon. Will knows Lyric. Heath knows Virginia. Ember knows Jerome. Viola knows Heath. Heath knows Will. Destiny knows Margaret. Destiny knows Blair. Blaine knows Ariana. Gideon knows Destiny. Rhea knows Viola. Heath knows Abigail. Jerome knows Keith. Peggy knows Erwin. Peggy knows Tony. Will knows Nicole. Which of Destiny and Heath can Ember reach?", "answer": "Destiny", "steps": [ "Ember knows Jerome.", "Jerome knows Keith.", "Keith knows Gideon.", "Gideon knows Destiny." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Ember", "Erwin", "Tony", "Blair", "Jerome", "Gideon", "Peggy", "Destiny", "Keith", "Margaret", "Blaine", "Nicole", "Lyric", "Abigail", "Ariana", "Viola", "Will", "Heath", "Rhea", "Virginia" ], "edges": [ [ 0, 4 ], [ 4, 8 ], [ 5, 7 ], [ 6, 1 ], [ 6, 2 ], [ 7, 3 ], [ 7, 6 ], [ 7, 9 ], [ 8, 5 ], [ 10, 14 ], [ 14, 18 ], [ 15, 17 ], [ 16, 11 ], [ 16, 12 ], [ 17, 13 ], [ 17, 16 ], [ 17, 19 ], [ 18, 15 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Heath knows Aaron. Kristin knows Arden. Pablo knows Beau. Sierra knows Gonzalo. Bailey knows Gilbert. Gilbert knows Judy. Gonzalo knows Heath. Beau knows Bailey. Jessie knows Kristin. Melody knows Peggy. Peggy knows Lois. Beau knows Ernesto. Kristin knows Cornelius. Aaron knows Declan. Sierra knows Stella. Gilbert knows Cara. Cara knows Melody. Arden knows Sierra. Which of Bailey and Arden can Jessie reach?", "answer": "Arden", "steps": [ "Jessie knows Kristin.", "Kristin knows Arden." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Jessie", "Cornelius", "Aaron", "Heath", "Gonzalo", "Stella", "Arden", "Kristin", "Sierra", "Declan", "Pablo", "Ernesto", "Peggy", "Melody", "Cara", "Judy", "Bailey", "Beau", "Gilbert", "Lois" ], "edges": [ [ 0, 7 ], [ 2, 9 ], [ 3, 2 ], [ 4, 3 ], [ 6, 8 ], [ 7, 1 ], [ 7, 6 ], [ 8, 5 ], [ 8, 4 ], [ 10, 17 ], [ 12, 19 ], [ 13, 12 ], [ 14, 13 ], [ 16, 18 ], [ 17, 11 ], [ 17, 16 ], [ 18, 15 ], [ 18, 14 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Marshall knows Leopold. Marshall knows Latoya. Oscar knows Marshall. Clayton knows Harry. Henry knows Estelle. Oscar knows Pam. Marshall knows Otto. Graeme knows Devin. Graeme knows Paul. Paul knows Kobe. Harry knows Elliot. Elliot knows Roger. Paul knows Henry. Brock knows Porter. Estelle knows Finn. Finn knows Brock. Latoya knows Clayton. Paul knows Jolene. Which of Henry and Latoya can Graeme reach?", "answer": "Henry", "steps": [ "Graeme knows Paul.", "Paul knows Henry." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Graeme", "Brock", "Jolene", "Paul", "Devin", "Finn", "Henry", "Porter", "Kobe", "Estelle", "Oscar", "Elliot", "Otto", "Marshall", "Pam", "Harry", "Latoya", "Roger", "Leopold", "Clayton" ], "edges": [ [ 0, 4 ], [ 0, 3 ], [ 1, 7 ], [ 3, 2 ], [ 3, 8 ], [ 3, 6 ], [ 5, 1 ], [ 6, 9 ], [ 9, 5 ], [ 10, 14 ], [ 10, 13 ], [ 11, 17 ], [ 13, 12 ], [ 13, 18 ], [ 13, 16 ], [ 15, 11 ], [ 16, 19 ], [ 19, 15 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Boris knows Hendrix. Ann knows Khashayar. Hendrix knows Jessie. Boris knows Myrtle. Boris knows Stefan. Pedro knows Peter. Stefan knows Eric. Carlos knows Louise. Eric knows Denise. Greta knows Robin. Khashayar knows Carlos. Blake knows Greta. Blake knows Marvin. Marvin knows Ann. Blake knows Dean. Dean knows Jane. Myrtle knows Faye. Denise knows Pedro. Which of Stefan and Marvin can Blake reach?", "answer": "Marvin", "steps": [ "Blake knows Marvin." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Blake", "Dean", "Jane", "Louise", "Carlos", "Robin", "Greta", "Marvin", "Ann", "Khashayar", "Boris", "Myrtle", "Faye", "Peter", "Pedro", "Jessie", "Hendrix", "Stefan", "Eric", "Denise" ], "edges": [ [ 0, 1 ], [ 0, 6 ], [ 0, 7 ], [ 1, 2 ], [ 4, 3 ], [ 6, 5 ], [ 7, 8 ], [ 8, 9 ], [ 9, 4 ], [ 10, 11 ], [ 10, 16 ], [ 10, 17 ], [ 11, 12 ], [ 14, 13 ], [ 16, 15 ], [ 17, 18 ], [ 18, 19 ], [ 19, 14 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Cruz knows Shelby. Shelby knows Kit. Jake knows Jerome. Jake knows Nina. Wade knows Sue. Shelby knows Nancy. Sue knows Jake. Sue knows Jermaine. Lyric knows Gladys. Percy knows Eamon. Jermaine knows Lyric. Rex knows Eunice. Rex knows Kane. Eamon knows Gloria. Gloria knows Cruz. Juan knows Wade. Gloria knows Rex. Lyric knows Antonio. Which of Jermaine and Cruz can Juan reach?", "answer": "Jermaine", "steps": [ "Juan knows Wade.", "Wade knows Sue.", "Sue knows Jermaine." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Juan", "Jake", "Jermaine", "Lyric", "Wade", "Nina", "Jerome", "Sue", "Gladys", "Antonio", "Percy", "Rex", "Cruz", "Shelby", "Eamon", "Kane", "Eunice", "Gloria", "Kit", "Nancy" ], "edges": [ [ 0, 4 ], [ 1, 5 ], [ 1, 6 ], [ 2, 3 ], [ 3, 8 ], [ 3, 9 ], [ 4, 7 ], [ 7, 1 ], [ 7, 2 ], [ 10, 14 ], [ 11, 15 ], [ 11, 16 ], [ 12, 13 ], [ 13, 18 ], [ 13, 19 ], [ 14, 17 ], [ 17, 11 ], [ 17, 12 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Alexa knows Knox. Randall knows Nolan. Blaine knows Barbara. Allen knows Terry. Felicia knows Blaine. Randall knows Alana. Felicia knows Jarvis. Lily knows Elliot. Lily knows Teresa. Elliot knows Margaret. Edna knows Lily. Lamar knows Felicia. Nolan knows Palmer. Allen knows Lawson. Lawson knows Alexa. Elliot knows Randall. Palmer knows Paul. Blaine knows Allen. Which of Palmer and Alexa can Lamar reach?", "answer": "Alexa", "steps": [ "Lamar knows Felicia.", "Felicia knows Blaine.", "Blaine knows Allen.", "Allen knows Lawson.", "Lawson knows Alexa." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Lamar", "Knox", "Alexa", "Blaine", "Felicia", "Terry", "Allen", "Lawson", "Jarvis", "Barbara", "Edna", "Paul", "Palmer", "Elliot", "Lily", "Alana", "Randall", "Nolan", "Teresa", "Margaret" ], "edges": [ [ 0, 4 ], [ 2, 1 ], [ 3, 6 ], [ 3, 9 ], [ 4, 8 ], [ 4, 3 ], [ 6, 5 ], [ 6, 7 ], [ 7, 2 ], [ 10, 14 ], [ 12, 11 ], [ 13, 16 ], [ 13, 19 ], [ 14, 18 ], [ 14, 13 ], [ 16, 15 ], [ 16, 17 ], [ 17, 12 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Lily knows Effie. Kylie knows Geoffrey. Denver knows Kelsey. Ariana knows Nolan. Jane knows Max. Alicia knows Erma. Max knows Kylie. Effie knows Liam. Lauren knows Devin. Ivy knows Alicia. Denver knows Jane. Shane knows Lauren. Nolan knows Ivy. Clark knows Carson. Effie knows Ariana. Devin knows Denver. Geoffrey knows Marian. Carson knows Lily. Which of Lily and Devin can Clark reach?", "answer": "Lily", "steps": [ "Clark knows Carson.", "Carson knows Lily." ], "difficulty": 2, "original_distance": 8, "idx_to_symbol": [ "Clark", "Lily", "Erma", "Alicia", "Ivy", "Ariana", "Effie", "Nolan", "Carson", "Liam", "Shane", "Devin", "Marian", "Geoffrey", "Kylie", "Jane", "Denver", "Max", "Lauren", "Kelsey" ], "edges": [ [ 0, 8 ], [ 1, 6 ], [ 3, 2 ], [ 4, 3 ], [ 5, 7 ], [ 6, 5 ], [ 6, 9 ], [ 7, 4 ], [ 8, 1 ], [ 10, 18 ], [ 11, 16 ], [ 13, 12 ], [ 14, 13 ], [ 15, 17 ], [ 16, 15 ], [ 16, 19 ], [ 17, 14 ], [ 18, 11 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Quinn knows Kristina. Ava knows Rufus. Bette knows Raymond. Ava knows Anita. Fanny knows Nicole. Janice knows Vivian. Janice knows Enid. Janice knows Quinn. Rufus knows Fanny. Nicole knows Enrique. Madeline knows Griffith. Kristina knows Edith. Ava knows Bette. Enid knows Anton. Glenda knows Madeline. Edith knows Glenda. Enrique knows Jonathan. Jonathan knows Dahlia. Which of Madeline and Jonathan can Ava reach?", "answer": "Jonathan", "steps": [ "Ava knows Rufus.", "Rufus knows Fanny.", "Fanny knows Nicole.", "Nicole knows Enrique.", "Enrique knows Jonathan." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Ava", "Raymond", "Dahlia", "Jonathan", "Enrique", "Rufus", "Bette", "Nicole", "Anita", "Fanny", "Janice", "Anton", "Griffith", "Madeline", "Glenda", "Quinn", "Enid", "Edith", "Vivian", "Kristina" ], "edges": [ [ 0, 6 ], [ 0, 8 ], [ 0, 5 ], [ 3, 2 ], [ 4, 3 ], [ 5, 9 ], [ 6, 1 ], [ 7, 4 ], [ 9, 7 ], [ 10, 16 ], [ 10, 18 ], [ 10, 15 ], [ 13, 12 ], [ 14, 13 ], [ 15, 19 ], [ 16, 11 ], [ 17, 14 ], [ 19, 17 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Mike knows Laura. Ursula knows Jeremy. Laura knows Stefan. Greta knows Faye. Blanche knows Leon. Ann knows Bernadette. Dalton knows Derek. August knows Heather. Lorraine knows Tyler. Ursula knows Lorraine. Faye knows Dalton. Parker knows Ann. Faye knows Parker. Leon knows Greta. Tyler knows Mike. Miles knows August. Blanche knows Basil. Mike knows Miles. Which of Bernadette and Heather can Blanche reach?", "answer": "Bernadette", "steps": [ "Blanche knows Leon.", "Leon knows Greta.", "Greta knows Faye.", "Faye knows Parker.", "Parker knows Ann.", "Ann knows Bernadette." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Blanche", "Greta", "Bernadette", "Dalton", "Basil", "Parker", "Leon", "Faye", "Ann", "Derek", "Ursula", "Tyler", "Heather", "Laura", "Jeremy", "Miles", "Lorraine", "Mike", "August", "Stefan" ], "edges": [ [ 0, 4 ], [ 0, 6 ], [ 1, 7 ], [ 3, 9 ], [ 5, 8 ], [ 6, 1 ], [ 7, 5 ], [ 7, 3 ], [ 8, 2 ], [ 10, 14 ], [ 10, 16 ], [ 11, 17 ], [ 13, 19 ], [ 15, 18 ], [ 16, 11 ], [ 17, 15 ], [ 17, 13 ], [ 18, 12 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Hazel knows Robert. Ellen knows Martin. Lars knows Charles. Robert knows Hope. Esme knows Bernice. Charles knows Cesar. Heidi knows Ellen. Charles knows Tina. Douglas knows Alfred. Alfred knows Nell. Heidi knows Darcy. Alfred knows Lars. Tina knows Esme. Martin knows Barney. Ellen knows Ricardo. Barney knows Brett. Douglas knows Flora. Barney knows Hazel. Which of Hope and Bernice can Douglas reach?", "answer": "Bernice", "steps": [ "Douglas knows Alfred.", "Alfred knows Lars.", "Lars knows Charles.", "Charles knows Tina.", "Tina knows Esme.", "Esme knows Bernice." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Douglas", "Tina", "Flora", "Lars", "Charles", "Alfred", "Cesar", "Nell", "Bernice", "Esme", "Heidi", "Hazel", "Darcy", "Martin", "Barney", "Ellen", "Brett", "Ricardo", "Hope", "Robert" ], "edges": [ [ 0, 2 ], [ 0, 5 ], [ 1, 9 ], [ 3, 4 ], [ 4, 6 ], [ 4, 1 ], [ 5, 7 ], [ 5, 3 ], [ 9, 8 ], [ 10, 12 ], [ 10, 15 ], [ 11, 19 ], [ 13, 14 ], [ 14, 16 ], [ 14, 11 ], [ 15, 17 ], [ 15, 13 ], [ 19, 18 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Trevor knows Lewis. Elodie knows Alfonso. Peggy knows Beth. Emery knows Pauline. Beth knows Landon. Alfonso knows Barney. Bert knows Arden. Emery knows Aubrey. Gail knows Peggy. Landon knows Lark. Alfonso knows Magdalena. Barney knows Trevor. Trevor knows Houston. Emery knows Gail. Houston knows Bert. Alfonso knows Mindy. Hannah knows Emery. Peggy knows Graham. Which of Trevor and Peggy can Elodie reach?", "answer": "Trevor", "steps": [ "Elodie knows Alfonso.", "Alfonso knows Barney.", "Barney knows Trevor." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Elodie", "Lewis", "Houston", "Mindy", "Alfonso", "Trevor", "Bert", "Magdalena", "Arden", "Barney", "Hannah", "Graham", "Beth", "Pauline", "Emery", "Peggy", "Landon", "Aubrey", "Lark", "Gail" ], "edges": [ [ 0, 4 ], [ 2, 6 ], [ 4, 3 ], [ 4, 7 ], [ 4, 9 ], [ 5, 1 ], [ 5, 2 ], [ 6, 8 ], [ 9, 5 ], [ 10, 14 ], [ 12, 16 ], [ 14, 13 ], [ 14, 17 ], [ 14, 19 ], [ 15, 11 ], [ 15, 12 ], [ 16, 18 ], [ 19, 15 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Hampton knows Amy. Chester knows Andre. Marcia knows Melody. Lane knows Troy. Thomas knows Hampton. Gus knows Ember. Darin knows Trudy. Jasmine knows Beth. Thomas knows Fabian. John knows Thomas. Beth knows Elodie. Andre knows Sue. Darin knows Jasmine. Trudy knows Gus. Beth knows Lane. Sue knows Marcia. Chester knows John. Ember knows Dexter. Which of Hampton and Lane can Darin reach?", "answer": "Lane", "steps": [ "Darin knows Jasmine.", "Jasmine knows Beth.", "Beth knows Lane." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Darin", "Jasmine", "Gus", "Ember", "Beth", "Troy", "Trudy", "Elodie", "Lane", "Dexter", "Chester", "John", "Sue", "Marcia", "Thomas", "Amy", "Andre", "Fabian", "Hampton", "Melody" ], "edges": [ [ 0, 1 ], [ 0, 6 ], [ 1, 4 ], [ 2, 3 ], [ 3, 9 ], [ 4, 7 ], [ 4, 8 ], [ 6, 2 ], [ 8, 5 ], [ 10, 11 ], [ 10, 16 ], [ 11, 14 ], [ 12, 13 ], [ 13, 19 ], [ 14, 17 ], [ 14, 18 ], [ 16, 12 ], [ 18, 15 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Trevor knows Lewis. Elodie knows Alfonso. Peggy knows Beth. Emery knows Pauline. Beth knows Landon. Alfonso knows Barney. Bert knows Arden. Emery knows Aubrey. Gail knows Peggy. Landon knows Lark. Alfonso knows Magdalena. Barney knows Trevor. Trevor knows Houston. Emery knows Gail. Houston knows Bert. Alfonso knows Mindy. Hannah knows Emery. Peggy knows Graham. Which of Bert and Landon can Elodie reach?", "answer": "Bert", "steps": [ "Elodie knows Alfonso.", "Alfonso knows Barney.", "Barney knows Trevor.", "Trevor knows Houston.", "Houston knows Bert." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Elodie", "Lewis", "Houston", "Mindy", "Alfonso", "Trevor", "Bert", "Magdalena", "Arden", "Barney", "Hannah", "Graham", "Beth", "Pauline", "Emery", "Peggy", "Landon", "Aubrey", "Lark", "Gail" ], "edges": [ [ 0, 4 ], [ 2, 6 ], [ 4, 3 ], [ 4, 7 ], [ 4, 9 ], [ 5, 1 ], [ 5, 2 ], [ 6, 8 ], [ 9, 5 ], [ 10, 14 ], [ 12, 16 ], [ 14, 13 ], [ 14, 17 ], [ 14, 19 ], [ 15, 11 ], [ 15, 12 ], [ 16, 18 ], [ 19, 15 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Beth knows Derek. Kirsten knows Archer. Gerald knows Fanny. Bill knows Jorge. April knows Kirsten. Fanny knows Harlan. Archer knows Kira. Chance knows Giselle. Derek knows Brynn. Derek knows Jolene. Kira knows Claire. Giselle knows Maria. Jolene knows Gerald. Kira knows Marvin. Giselle knows Beth. Marvin knows Bill. Kirsten knows Vincent. Jorge knows Dennis. Which of Archer and Beth can April reach?", "answer": "Archer", "steps": [ "April knows Kirsten.", "Kirsten knows Archer." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "April", "Dennis", "Kira", "Marvin", "Claire", "Bill", "Vincent", "Kirsten", "Jorge", "Archer", "Chance", "Harlan", "Derek", "Jolene", "Brynn", "Gerald", "Maria", "Giselle", "Fanny", "Beth" ], "edges": [ [ 0, 7 ], [ 2, 4 ], [ 2, 3 ], [ 3, 5 ], [ 5, 8 ], [ 7, 6 ], [ 7, 9 ], [ 8, 1 ], [ 9, 2 ], [ 10, 17 ], [ 12, 14 ], [ 12, 13 ], [ 13, 15 ], [ 15, 18 ], [ 17, 16 ], [ 17, 19 ], [ 18, 11 ], [ 19, 12 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Estella knows Caroline. Stanley knows Susan. Emery knows Estella. Neville knows Emery. Neville knows Julian. Emery knows Dave. Caroline knows Aurora. Wade knows Axel. Charity knows Roger. Wade knows Charity. Kim knows Colette. Wade knows Rosemary. Neville knows Kim. Rosemary knows Lance. Daniella knows Neville. Rosemary knows Stanley. Heidi knows Wade. Susan knows Francesca. Which of Emery and Rosemary can Heidi reach?", "answer": "Rosemary", "steps": [ "Heidi knows Wade.", "Wade knows Rosemary." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Heidi", "Stanley", "Francesca", "Lance", "Charity", "Rosemary", "Axel", "Susan", "Wade", "Roger", "Daniella", "Estella", "Aurora", "Dave", "Kim", "Emery", "Julian", "Caroline", "Neville", "Colette" ], "edges": [ [ 0, 8 ], [ 1, 7 ], [ 4, 9 ], [ 5, 3 ], [ 5, 1 ], [ 7, 2 ], [ 8, 6 ], [ 8, 5 ], [ 8, 4 ], [ 10, 18 ], [ 11, 17 ], [ 14, 19 ], [ 15, 13 ], [ 15, 11 ], [ 17, 12 ], [ 18, 16 ], [ 18, 15 ], [ 18, 14 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Keegan knows Juan. Jill knows Penny. Keegan knows Jill. Daria knows Brent. Mark knows Hugh. Mark knows Xavier. Hugh knows Cody. Xavier knows Malik. Brandon knows Mark. Cody knows Gene. Mark knows Leslie. Brent knows Elmer. Drake knows Keegan. Hugh knows Alison. Bart knows Larissa. Alison knows Kerry. Daria knows Bart. Keegan knows Daria. Which of Daria and Hugh can Drake reach?", "answer": "Daria", "steps": [ "Drake knows Keegan.", "Keegan knows Daria." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Drake", "Daria", "Juan", "Brent", "Elmer", "Keegan", "Jill", "Penny", "Larissa", "Bart", "Brandon", "Hugh", "Leslie", "Alison", "Kerry", "Mark", "Xavier", "Malik", "Gene", "Cody" ], "edges": [ [ 0, 5 ], [ 1, 3 ], [ 1, 9 ], [ 3, 4 ], [ 5, 2 ], [ 5, 6 ], [ 5, 1 ], [ 6, 7 ], [ 9, 8 ], [ 10, 15 ], [ 11, 13 ], [ 11, 19 ], [ 13, 14 ], [ 15, 12 ], [ 15, 16 ], [ 15, 11 ], [ 16, 17 ], [ 19, 18 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Devon knows Ava. Earl knows Clifford. Serena knows Malik. Devon knows Verna. Cody knows Carlos. Austin knows Raquel. Earl knows Eunice. Carlos knows Joyce. Cody knows Edna. Devon knows Morgan. Malik knows Marshall. Jules knows Cody. Edna knows Jennifer. Eunice knows Serena. Earl knows Dick. Serena knows Austin. Earl knows Theodore. Devon knows Jules. Which of Austin and Edna can Earl reach?", "answer": "Austin", "steps": [ "Earl knows Eunice.", "Eunice knows Serena.", "Serena knows Austin." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Earl", "Clifford", "Malik", "Austin", "Marshall", "Serena", "Theodore", "Eunice", "Raquel", "Dick", "Devon", "Verna", "Carlos", "Edna", "Joyce", "Cody", "Ava", "Jules", "Jennifer", "Morgan" ], "edges": [ [ 0, 1 ], [ 0, 6 ], [ 0, 7 ], [ 0, 9 ], [ 2, 4 ], [ 3, 8 ], [ 5, 2 ], [ 5, 3 ], [ 7, 5 ], [ 10, 11 ], [ 10, 16 ], [ 10, 17 ], [ 10, 19 ], [ 12, 14 ], [ 13, 18 ], [ 15, 12 ], [ 15, 13 ], [ 17, 15 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Brooks knows Laura. Jon knows Bonnie. James knows Emery. Brad knows Geraldine. Jon knows Brad. Geraldine knows Wyatt. Brad knows Reed. Laura knows Katrina. Reed knows Harlan. Candice knows Aiden. Wyatt knows Brooks. Chad knows Jasmine. Terrence knows Keegan. Keegan knows Chad. Terrence knows Dayton. Keegan knows Candice. Emery knows Helen. Jasmine knows James. Which of Emery and Laura can Terrence reach?", "answer": "Emery", "steps": [ "Terrence knows Keegan.", "Keegan knows Chad.", "Chad knows Jasmine.", "Jasmine knows James.", "James knows Emery." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Terrence", "Keegan", "Chad", "James", "Jasmine", "Dayton", "Aiden", "Candice", "Emery", "Helen", "Jon", "Brad", "Geraldine", "Brooks", "Wyatt", "Bonnie", "Harlan", "Reed", "Laura", "Katrina" ], "edges": [ [ 0, 5 ], [ 0, 1 ], [ 1, 7 ], [ 1, 2 ], [ 2, 4 ], [ 3, 8 ], [ 4, 3 ], [ 7, 6 ], [ 8, 9 ], [ 10, 15 ], [ 10, 11 ], [ 11, 17 ], [ 11, 12 ], [ 12, 14 ], [ 13, 18 ], [ 14, 13 ], [ 17, 16 ], [ 18, 19 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Kendrick knows Glenda. Aspen knows Adam. Hattie knows Kendrick. Bernard knows Hattie. Adam knows Karen. David knows Stella. Frida knows Latoya. Hattie knows Bernice. Daphna knows Jorge. Frida knows Aspen. Aspen knows Chantal. Bernard knows Quinn. Frida knows Peggy. Jorge knows Bernard. Stella knows Frida. Karen knows Keira. Bernard knows Teresa. Glenda knows Abby. Which of Kendrick and Adam can Daphna reach?", "answer": "Kendrick", "steps": [ "Daphna knows Jorge.", "Jorge knows Bernard.", "Bernard knows Hattie.", "Hattie knows Kendrick." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Daphna", "Abby", "Kendrick", "Glenda", "Jorge", "Hattie", "Quinn", "Bernard", "Teresa", "Bernice", "David", "Keira", "Adam", "Karen", "Stella", "Aspen", "Latoya", "Frida", "Peggy", "Chantal" ], "edges": [ [ 0, 4 ], [ 2, 3 ], [ 3, 1 ], [ 4, 7 ], [ 5, 2 ], [ 5, 9 ], [ 7, 6 ], [ 7, 8 ], [ 7, 5 ], [ 10, 14 ], [ 12, 13 ], [ 13, 11 ], [ 14, 17 ], [ 15, 12 ], [ 15, 19 ], [ 17, 16 ], [ 17, 18 ], [ 17, 15 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Charlotte knows Dawn. Clayton knows Ruth. Isiah knows Clayton. Carl knows Bart. Fabian knows Cody. Fabian knows Carl. Amelia knows Theodore. Jean knows Amelia. Fabian knows Clara. Stephanie knows Charlotte. Dawn knows Ramona. Grant knows Jean. Jean knows Itzel. Veronica knows Isiah. Miriam knows Stephanie. Jean knows Eve. Miriam knows Fabian. Grant knows Veronica. Which of Clayton and Dawn can Miriam reach?", "answer": "Dawn", "steps": [ "Miriam knows Stephanie.", "Stephanie knows Charlotte.", "Charlotte knows Dawn." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Miriam", "Carl", "Ramona", "Cody", "Dawn", "Charlotte", "Fabian", "Clara", "Bart", "Stephanie", "Grant", "Amelia", "Ruth", "Itzel", "Clayton", "Isiah", "Jean", "Eve", "Theodore", "Veronica" ], "edges": [ [ 0, 6 ], [ 0, 9 ], [ 1, 8 ], [ 4, 2 ], [ 5, 4 ], [ 6, 3 ], [ 6, 7 ], [ 6, 1 ], [ 9, 5 ], [ 10, 16 ], [ 10, 19 ], [ 11, 18 ], [ 14, 12 ], [ 15, 14 ], [ 16, 13 ], [ 16, 17 ], [ 16, 11 ], [ 19, 15 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Haven knows Dylan. Arthur knows Declan. Madeline knows Julian. Arthur knows Bill. Tonya knows Erica. Elsa knows Gerald. Haven knows Fred. Erica knows Madeline. Gonzalo knows Rhonda. Gonzalo knows Tanya. Gerald knows Ramon. Dylan knows Elsa. Martha knows Lottie. Lottie knows Edmund. Fred knows Gonzalo. Lottie knows Tonya. Clay knows Haven. Edmund knows Arthur. Which of Julian and Ramon can Martha reach?", "answer": "Julian", "steps": [ "Martha knows Lottie.", "Lottie knows Tonya.", "Tonya knows Erica.", "Erica knows Madeline.", "Madeline knows Julian." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Martha", "Erica", "Declan", "Tonya", "Arthur", "Julian", "Lottie", "Edmund", "Madeline", "Bill", "Clay", "Elsa", "Rhonda", "Dylan", "Gonzalo", "Ramon", "Haven", "Fred", "Gerald", "Tanya" ], "edges": [ [ 0, 6 ], [ 1, 8 ], [ 3, 1 ], [ 4, 2 ], [ 4, 9 ], [ 6, 3 ], [ 6, 7 ], [ 7, 4 ], [ 8, 5 ], [ 10, 16 ], [ 11, 18 ], [ 13, 11 ], [ 14, 12 ], [ 14, 19 ], [ 16, 13 ], [ 16, 17 ], [ 17, 14 ], [ 18, 15 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Justine knows Diego. Justine knows Elise. Opal knows Cole. Opal knows Jon. Justine knows Gerard. Dustin knows Kelly. Lena knows Heath. Lena knows Deirdre. Jon knows Leticia. Dustin knows Becky. Opal knows Marion. Heath knows Opal. Elise knows Dustin. Dustin knows Carmen. Kelly knows Nash. Dustin knows Liam. Lena knows Cate. Opal knows Rick. Which of Elise and Heath can Lena reach?", "answer": "Heath", "steps": [ "Lena knows Heath." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Lena", "Deirdre", "Leticia", "Cole", "Cate", "Heath", "Jon", "Marion", "Opal", "Rick", "Justine", "Gerard", "Nash", "Becky", "Diego", "Elise", "Kelly", "Liam", "Dustin", "Carmen" ], "edges": [ [ 0, 1 ], [ 0, 4 ], [ 0, 5 ], [ 5, 8 ], [ 6, 2 ], [ 8, 3 ], [ 8, 6 ], [ 8, 7 ], [ 8, 9 ], [ 10, 11 ], [ 10, 14 ], [ 10, 15 ], [ 15, 18 ], [ 16, 12 ], [ 18, 13 ], [ 18, 16 ], [ 18, 17 ], [ 18, 19 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Dave knows Oliver. Claudia knows Hubert. Dave knows Samuel. Viola knows Dave. Samuel knows Jon. Jarvis knows Liam. Oliver knows Jarvis. Ilene knows Claudia. Jon knows Keegan. Jarvis knows Myra. Dina knows Darren. Claudia knows Dina. Hubert knows Lillian. Darren knows Walt. Ilene knows Max. Darren knows Verna. Lillian knows Arden. Viola knows Sharon. Which of Verna and Liam can Ilene reach?", "answer": "Verna", "steps": [ "Ilene knows Claudia.", "Claudia knows Dina.", "Dina knows Darren.", "Darren knows Verna." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Ilene", "Walt", "Dina", "Claudia", "Arden", "Hubert", "Lillian", "Darren", "Verna", "Max", "Viola", "Myra", "Oliver", "Dave", "Keegan", "Samuel", "Jon", "Jarvis", "Liam", "Sharon" ], "edges": [ [ 0, 3 ], [ 0, 9 ], [ 2, 7 ], [ 3, 5 ], [ 3, 2 ], [ 5, 6 ], [ 6, 4 ], [ 7, 1 ], [ 7, 8 ], [ 10, 13 ], [ 10, 19 ], [ 12, 17 ], [ 13, 15 ], [ 13, 12 ], [ 15, 16 ], [ 16, 14 ], [ 17, 11 ], [ 17, 18 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Jessica knows Henry. Liam knows Geneva. Lamar knows Liam. Jamie knows Alice. Liam knows Tabitha. Marshall knows Jacques. Alice knows Sybil. Layla knows Estella. Henry knows Floyd. Lamar knows Layla. Sam knows Goldie. Jamie knows Arlene. Clifford knows Zara. Sybil knows Lamar. Marshall knows Milo. Floyd knows Clifford. Sam knows Jessica. Floyd knows Marshall. Which of Alice and Jessica can Jamie reach?", "answer": "Alice", "steps": [ "Jamie knows Alice." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Jamie", "Geneva", "Estella", "Layla", "Lamar", "Tabitha", "Sybil", "Arlene", "Liam", "Alice", "Sam", "Jacques", "Zara", "Clifford", "Floyd", "Milo", "Henry", "Goldie", "Marshall", "Jessica" ], "edges": [ [ 0, 7 ], [ 0, 9 ], [ 3, 2 ], [ 4, 3 ], [ 4, 8 ], [ 6, 4 ], [ 8, 1 ], [ 8, 5 ], [ 9, 6 ], [ 10, 17 ], [ 10, 19 ], [ 13, 12 ], [ 14, 13 ], [ 14, 18 ], [ 16, 14 ], [ 18, 11 ], [ 18, 15 ], [ 19, 16 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Troy knows Cassidy. Susanne knows Ebony. Harmony knows Jaime. Franklin knows Lacey. Matthew knows Amy. Dina knows Susanne. Franklin knows Clark. Sadie knows Matthew. Cassidy knows Dina. Troy knows Sadie. Frank knows Franklin. Justin knows Rocco. Troy knows Gustavo. Franklin knows Michelle. Jaime knows Tyler. Darcy knows Troy. Clark knows Justin. Michelle knows Harmony. Which of Dina and Harmony can Darcy reach?", "answer": "Dina", "steps": [ "Darcy knows Troy.", "Troy knows Cassidy.", "Cassidy knows Dina." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Darcy", "Matthew", "Troy", "Amy", "Ebony", "Dina", "Cassidy", "Sadie", "Gustavo", "Susanne", "Frank", "Justin", "Franklin", "Rocco", "Tyler", "Harmony", "Michelle", "Clark", "Lacey", "Jaime" ], "edges": [ [ 0, 2 ], [ 1, 3 ], [ 2, 7 ], [ 2, 8 ], [ 2, 6 ], [ 5, 9 ], [ 6, 5 ], [ 7, 1 ], [ 9, 4 ], [ 10, 12 ], [ 11, 13 ], [ 12, 17 ], [ 12, 18 ], [ 12, 16 ], [ 15, 19 ], [ 16, 15 ], [ 17, 11 ], [ 19, 14 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Fred knows Darrell. Hayes knows Beverly. Agnes knows Mike. Oliver knows Roman. Yvonne knows Larry. Larry knows Daisy. Daisy knows Darnell. Julia knows Lucia. Gabriel knows Oliver. Hayes knows Walter. April knows Gabriel. Jamie knows Yvonne. Gabriel knows Troy. Gabriel knows Craig. Lucia knows Agnes. Mike knows April. Darnell knows Hayes. Hayes knows Fred. Which of Oliver and Fred can Jamie reach?", "answer": "Fred", "steps": [ "Jamie knows Yvonne.", "Yvonne knows Larry.", "Larry knows Daisy.", "Daisy knows Darnell.", "Darnell knows Hayes.", "Hayes knows Fred." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Jamie", "Larry", "Darrell", "Hayes", "Fred", "Walter", "Yvonne", "Daisy", "Darnell", "Beverly", "Julia", "Agnes", "Roman", "Gabriel", "Oliver", "Craig", "Lucia", "Mike", "April", "Troy" ], "edges": [ [ 0, 6 ], [ 1, 7 ], [ 3, 4 ], [ 3, 5 ], [ 3, 9 ], [ 4, 2 ], [ 6, 1 ], [ 7, 8 ], [ 8, 3 ], [ 10, 16 ], [ 11, 17 ], [ 13, 14 ], [ 13, 15 ], [ 13, 19 ], [ 14, 12 ], [ 16, 11 ], [ 17, 18 ], [ 18, 13 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Hattie knows Archie. Freya knows Larry. Freya knows Nell. Georgia knows Keegan. Hattie knows June. Edward knows Barbara. Wallace knows Dallas. Jamie knows Kurt. Fanny knows Edward. Wallace knows Fanny. Larry knows Jamie. Wallace knows Olivia. Hattie knows Beau. Sonia knows Georgia. Georgia knows Rod. Jamie knows Theodore. Archie knows Freya. Edward knows Sonia. Which of Freya and Edward can Hattie reach?", "answer": "Freya", "steps": [ "Hattie knows Archie.", "Archie knows Freya." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Hattie", "Nell", "Archie", "Theodore", "June", "Larry", "Jamie", "Kurt", "Beau", "Freya", "Wallace", "Barbara", "Fanny", "Keegan", "Olivia", "Sonia", "Georgia", "Rod", "Dallas", "Edward" ], "edges": [ [ 0, 4 ], [ 0, 8 ], [ 0, 2 ], [ 2, 9 ], [ 5, 6 ], [ 6, 3 ], [ 6, 7 ], [ 9, 1 ], [ 9, 5 ], [ 10, 14 ], [ 10, 18 ], [ 10, 12 ], [ 12, 19 ], [ 15, 16 ], [ 16, 13 ], [ 16, 17 ], [ 19, 11 ], [ 19, 15 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Christopher knows Jodi. Clinton knows Alvin. Gonzalo knows Boyd. Naomi knows Livia. Alvin knows Christopher. Alvin knows Miriam. Alvin knows Marcia. Boyd knows Erica. Sidney knows Perry. Jodi knows Herbert. Dirk knows Naomi. Naomi knows Skyler. Harry knows Eugene. Yara knows Harry. Livia knows Sidney. Miriam knows Yara. Skyler knows Gonzalo. Naomi knows Connor. Which of Gonzalo and Yara can Clinton reach?", "answer": "Yara", "steps": [ "Clinton knows Alvin.", "Alvin knows Miriam.", "Miriam knows Yara." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Clinton", "Alvin", "Marcia", "Herbert", "Yara", "Miriam", "Eugene", "Jodi", "Harry", "Christopher", "Dirk", "Naomi", "Connor", "Perry", "Gonzalo", "Skyler", "Erica", "Sidney", "Boyd", "Livia" ], "edges": [ [ 0, 1 ], [ 1, 2 ], [ 1, 5 ], [ 1, 9 ], [ 4, 8 ], [ 5, 4 ], [ 7, 3 ], [ 8, 6 ], [ 9, 7 ], [ 10, 11 ], [ 11, 12 ], [ 11, 15 ], [ 11, 19 ], [ 14, 18 ], [ 15, 14 ], [ 17, 13 ], [ 18, 16 ], [ 19, 17 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Gladys knows Jenna. Cristina knows Peggy. Ursula knows Leigh. Antonio knows Guy. Sally knows Carmela. Gladys knows Lola. Catherine knows Monroe. Leigh knows Sally. Rebecca knows Arturo. Charles knows Jonathan. Rebecca knows Antonio. Sally knows Noel. Justine knows Charles. Guy knows Tom. Catherine knows Justine. Guy knows Cristina. Peggy knows Gladys. Charles knows Ursula. Which of Ursula and Cristina can Catherine reach?", "answer": "Ursula", "steps": [ "Catherine knows Justine.", "Justine knows Charles.", "Charles knows Ursula." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Catherine", "Charles", "Jonathan", "Noel", "Ursula", "Justine", "Sally", "Carmela", "Monroe", "Leigh", "Rebecca", "Guy", "Tom", "Lola", "Cristina", "Antonio", "Gladys", "Jenna", "Arturo", "Peggy" ], "edges": [ [ 0, 8 ], [ 0, 5 ], [ 1, 2 ], [ 1, 4 ], [ 4, 9 ], [ 5, 1 ], [ 6, 3 ], [ 6, 7 ], [ 9, 6 ], [ 10, 18 ], [ 10, 15 ], [ 11, 12 ], [ 11, 14 ], [ 14, 19 ], [ 15, 11 ], [ 16, 13 ], [ 16, 17 ], [ 19, 16 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Aspen knows Ian. Marvin knows Walt. Dayton knows Vivian. Winifred knows Lola. Sheryl knows Beth. Vivian knows Sara. Sonia knows Arnold. Sara knows Molly. Molly knows Roman. Roman knows Aiden. Dayton knows Aspen. Stephen knows Sonia. Vivian knows Edmund. Sonia knows Winifred. Ian knows Joanna. Beth knows Wayne. Stephen knows Sheryl. Lola knows Marvin. Which of Winifred and Sara can Dayton reach?", "answer": "Sara", "steps": [ "Dayton knows Vivian.", "Vivian knows Sara." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Dayton", "Ian", "Aiden", "Sara", "Joanna", "Aspen", "Vivian", "Roman", "Edmund", "Molly", "Stephen", "Beth", "Walt", "Winifred", "Wayne", "Sheryl", "Sonia", "Marvin", "Arnold", "Lola" ], "edges": [ [ 0, 5 ], [ 0, 6 ], [ 1, 4 ], [ 3, 9 ], [ 5, 1 ], [ 6, 8 ], [ 6, 3 ], [ 7, 2 ], [ 9, 7 ], [ 10, 15 ], [ 10, 16 ], [ 11, 14 ], [ 13, 19 ], [ 15, 11 ], [ 16, 18 ], [ 16, 13 ], [ 17, 12 ], [ 19, 17 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Alejandro knows Luna. Inez knows Landon. Gwen knows Carrie. Landon knows Gwen. Cesar knows Frankie. Leroy knows Ethan. Marion knows Tonya. Alejandro knows Morris. Frankie knows Helen. Marion knows Cesar. Arthur knows Aiden. Alejandro knows Lucia. Lucia knows Inez. Marion knows Leroy. Luna knows Joaquin. Helen knows Arthur. Arthur knows Corinne. Gwen knows Ford. Which of Gwen and Arthur can Marion reach?", "answer": "Arthur", "steps": [ "Marion knows Cesar.", "Cesar knows Frankie.", "Frankie knows Helen.", "Helen knows Arthur." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Marion", "Leroy", "Frankie", "Ethan", "Helen", "Aiden", "Cesar", "Tonya", "Arthur", "Corinne", "Alejandro", "Luna", "Inez", "Joaquin", "Landon", "Carrie", "Lucia", "Morris", "Gwen", "Ford" ], "edges": [ [ 0, 1 ], [ 0, 7 ], [ 0, 6 ], [ 1, 3 ], [ 2, 4 ], [ 4, 8 ], [ 6, 2 ], [ 8, 5 ], [ 8, 9 ], [ 10, 11 ], [ 10, 17 ], [ 10, 16 ], [ 11, 13 ], [ 12, 14 ], [ 14, 18 ], [ 16, 12 ], [ 18, 15 ], [ 18, 19 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Demetrius knows Chandler. Corinne knows Omar. Bella knows Kimberly. Javier knows Demetrius. Bryan knows Jude. Herbert knows Claire. Demetrius knows Herbert. Karen knows Eileen. Candice knows Jessica. Leroy knows Candice. Kevin knows Eric. Jude knows Leroy. Eileen knows Javier. Leroy knows Corinne. Corinne knows Drew. Kevin knows Tessa. Javier knows Kevin. Candice knows Bella. Which of Herbert and Bella can Bryan reach?", "answer": "Bella", "steps": [ "Bryan knows Jude.", "Jude knows Leroy.", "Leroy knows Candice.", "Candice knows Bella." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Bryan", "Bella", "Candice", "Leroy", "Kimberly", "Drew", "Jessica", "Jude", "Corinne", "Omar", "Karen", "Herbert", "Demetrius", "Javier", "Claire", "Tessa", "Chandler", "Eileen", "Kevin", "Eric" ], "edges": [ [ 0, 7 ], [ 1, 4 ], [ 2, 1 ], [ 2, 6 ], [ 3, 2 ], [ 3, 8 ], [ 7, 3 ], [ 8, 5 ], [ 8, 9 ], [ 10, 17 ], [ 11, 14 ], [ 12, 11 ], [ 12, 16 ], [ 13, 12 ], [ 13, 18 ], [ 17, 13 ], [ 18, 15 ], [ 18, 19 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Brooks knows Laura. Jon knows Bonnie. James knows Emery. Brad knows Geraldine. Jon knows Brad. Geraldine knows Wyatt. Brad knows Reed. Laura knows Katrina. Reed knows Harlan. Candice knows Aiden. Wyatt knows Brooks. Chad knows Jasmine. Terrence knows Keegan. Keegan knows Chad. Terrence knows Dayton. Keegan knows Candice. Emery knows Helen. Jasmine knows James. Which of Brad and Keegan can Terrence reach?", "answer": "Keegan", "steps": [ "Terrence knows Keegan." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Terrence", "Keegan", "Chad", "James", "Jasmine", "Dayton", "Aiden", "Candice", "Emery", "Helen", "Jon", "Brad", "Geraldine", "Brooks", "Wyatt", "Bonnie", "Harlan", "Reed", "Laura", "Katrina" ], "edges": [ [ 0, 5 ], [ 0, 1 ], [ 1, 7 ], [ 1, 2 ], [ 2, 4 ], [ 3, 8 ], [ 4, 3 ], [ 7, 6 ], [ 8, 9 ], [ 10, 15 ], [ 10, 11 ], [ 11, 17 ], [ 11, 12 ], [ 12, 14 ], [ 13, 18 ], [ 14, 13 ], [ 17, 16 ], [ 18, 19 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Laura knows Sybil. Esperanza knows Deanna. Tonya knows Irving. Esperanza knows Keith. Jana knows Roland. Hayden knows Esperanza. Hampton knows Lily. Hampton knows Laura. Keith knows Tonya. Dante knows Hampton. Dante knows Jaime. Winifred knows Dante. Deanna knows Anton. Keith knows Jana. Laura knows Darius. Jaime knows Brent. Lily knows Eldon. Jana knows Zachary. Which of Jana and Laura can Winifred reach?", "answer": "Laura", "steps": [ "Winifred knows Dante.", "Dante knows Hampton.", "Hampton knows Laura." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Winifred", "Laura", "Lily", "Hampton", "Darius", "Brent", "Sybil", "Jaime", "Dante", "Eldon", "Hayden", "Jana", "Tonya", "Keith", "Zachary", "Anton", "Roland", "Deanna", "Esperanza", "Irving" ], "edges": [ [ 0, 8 ], [ 1, 4 ], [ 1, 6 ], [ 2, 9 ], [ 3, 1 ], [ 3, 2 ], [ 7, 5 ], [ 8, 7 ], [ 8, 3 ], [ 10, 18 ], [ 11, 14 ], [ 11, 16 ], [ 12, 19 ], [ 13, 11 ], [ 13, 12 ], [ 17, 15 ], [ 18, 17 ], [ 18, 13 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Pete knows Kirk. Jackson knows Ricardo. Louise knows Janet. Louise knows Dee. Abigail knows Oscar. Sean knows Sandra. Louise knows Bella. Billy knows Abigail. Bella knows Kareem. Sean knows Jackson. Sean knows Will. Abigail knows Rocco. Sandra knows Louise. Rocco knows Kimberly. Katrina knows Donald. Abigail knows Blake. Pete knows Katrina. Pete knows Billy. Which of Kareem and Kimberly can Pete reach?", "answer": "Kimberly", "steps": [ "Pete knows Billy.", "Billy knows Abigail.", "Abigail knows Rocco.", "Rocco knows Kimberly." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Pete", "Kimberly", "Billy", "Rocco", "Kirk", "Abigail", "Oscar", "Donald", "Blake", "Katrina", "Sean", "Kareem", "Sandra", "Bella", "Will", "Louise", "Janet", "Ricardo", "Dee", "Jackson" ], "edges": [ [ 0, 4 ], [ 0, 2 ], [ 0, 9 ], [ 2, 5 ], [ 3, 1 ], [ 5, 3 ], [ 5, 6 ], [ 5, 8 ], [ 9, 7 ], [ 10, 14 ], [ 10, 12 ], [ 10, 19 ], [ 12, 15 ], [ 13, 11 ], [ 15, 13 ], [ 15, 16 ], [ 15, 18 ], [ 19, 17 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Effie knows Irving. Pierce knows Myrtle. Pat knows Luis. Howard knows Daphne. Blanche knows Lance. Pierce knows Howard. Daphne knows Dustin. Pat knows Effie. Irving knows Colby. Greg knows Jarvis. Lance knows Sierra. Irving knows Avery. Daphne knows Greg. Howard knows Leticia. Myrtle knows Elvis. Greg knows Willis. Effie knows June. Blanche knows Pat. Which of Irving and Greg can Blanche reach?", "answer": "Irving", "steps": [ "Blanche knows Pat.", "Pat knows Effie.", "Effie knows Irving." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Blanche", "Luis", "Sierra", "Lance", "Colby", "Effie", "Irving", "June", "Avery", "Pat", "Pierce", "Leticia", "Elvis", "Myrtle", "Willis", "Daphne", "Greg", "Dustin", "Jarvis", "Howard" ], "edges": [ [ 0, 3 ], [ 0, 9 ], [ 3, 2 ], [ 5, 7 ], [ 5, 6 ], [ 6, 4 ], [ 6, 8 ], [ 9, 1 ], [ 9, 5 ], [ 10, 13 ], [ 10, 19 ], [ 13, 12 ], [ 15, 17 ], [ 15, 16 ], [ 16, 14 ], [ 16, 18 ], [ 19, 11 ], [ 19, 15 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Veronica knows Hayley. Hayley knows Rose. Holly knows Terry. Glenn knows Wilson. Nolan knows Kennedy. Glenn knows Blair. Alice knows Nolan. Janice knows Edith. Hayley knows Dolores. Tim knows Glenn. Sandra knows Winston. Glenn knows Veronica. Winston knows Tim. Nolan knows Gene. Holly knows Alice. Edith knows Lenora. Holly knows Sheryl. Lenora knows Holly. Which of Hayley and Nolan can Sandra reach?", "answer": "Hayley", "steps": [ "Sandra knows Winston.", "Winston knows Tim.", "Tim knows Glenn.", "Glenn knows Veronica.", "Veronica knows Hayley." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Sandra", "Blair", "Veronica", "Winston", "Wilson", "Hayley", "Dolores", "Rose", "Glenn", "Tim", "Janice", "Sheryl", "Alice", "Edith", "Terry", "Nolan", "Kennedy", "Gene", "Holly", "Lenora" ], "edges": [ [ 0, 3 ], [ 2, 5 ], [ 3, 9 ], [ 5, 6 ], [ 5, 7 ], [ 8, 1 ], [ 8, 4 ], [ 8, 2 ], [ 9, 8 ], [ 10, 13 ], [ 12, 15 ], [ 13, 19 ], [ 15, 16 ], [ 15, 17 ], [ 18, 11 ], [ 18, 14 ], [ 18, 12 ], [ 19, 18 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Fred knows Darrell. Hayes knows Beverly. Agnes knows Mike. Oliver knows Roman. Yvonne knows Larry. Larry knows Daisy. Daisy knows Darnell. Julia knows Lucia. Gabriel knows Oliver. Hayes knows Walter. April knows Gabriel. Jamie knows Yvonne. Gabriel knows Troy. Gabriel knows Craig. Lucia knows Agnes. Mike knows April. Darnell knows Hayes. Hayes knows Fred. Which of Darrell and Roman can Jamie reach?", "answer": "Darrell", "steps": [ "Jamie knows Yvonne.", "Yvonne knows Larry.", "Larry knows Daisy.", "Daisy knows Darnell.", "Darnell knows Hayes.", "Hayes knows Fred.", "Fred knows Darrell." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Jamie", "Larry", "Darrell", "Hayes", "Fred", "Walter", "Yvonne", "Daisy", "Darnell", "Beverly", "Julia", "Agnes", "Roman", "Gabriel", "Oliver", "Craig", "Lucia", "Mike", "April", "Troy" ], "edges": [ [ 0, 6 ], [ 1, 7 ], [ 3, 4 ], [ 3, 5 ], [ 3, 9 ], [ 4, 2 ], [ 6, 1 ], [ 7, 8 ], [ 8, 3 ], [ 10, 16 ], [ 11, 17 ], [ 13, 14 ], [ 13, 15 ], [ 13, 19 ], [ 14, 12 ], [ 16, 11 ], [ 17, 18 ], [ 18, 13 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Amelia knows Pearl. Amelia knows Chloe. Chloe knows Aisha. Dustin knows Olivia. Lacey knows Dustin. Walt knows Paul. Theodore knows Esme. Walt knows Inez. Aisha knows Clifford. Aisha knows Dakota. Aisha knows Fleur. Ken knows Clayton. Olivia knows Walt. Dakota knows Theodore. Trudy knows Amelia. Grady knows Ken. Dustin knows Val. Walt knows Grady. Which of Chloe and Olivia can Lacey reach?", "answer": "Olivia", "steps": [ "Lacey knows Dustin.", "Dustin knows Olivia." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Lacey", "Inez", "Olivia", "Walt", "Val", "Ken", "Clayton", "Grady", "Dustin", "Paul", "Trudy", "Fleur", "Chloe", "Aisha", "Pearl", "Theodore", "Esme", "Dakota", "Amelia", "Clifford" ], "edges": [ [ 0, 8 ], [ 2, 3 ], [ 3, 1 ], [ 3, 7 ], [ 3, 9 ], [ 5, 6 ], [ 7, 5 ], [ 8, 4 ], [ 8, 2 ], [ 10, 18 ], [ 12, 13 ], [ 13, 11 ], [ 13, 17 ], [ 13, 19 ], [ 15, 16 ], [ 17, 15 ], [ 18, 14 ], [ 18, 12 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Lorraine knows Hampton. Eve knows Electra. Charles knows Winston. Elaine knows Ember. Julio knows Lorraine. Ember knows Judy. Everett knows Isadora. Francis knows Karina. Ross knows Eve. Clayton knows Charles. India knows Jared. Francis knows Emily. Karina knows Darnell. India knows Clayton. Winston knows Everett. Electra knows Julio. Isadora knows Elaine. Darnell knows Ross. Which of Hampton and Judy can India reach?", "answer": "Judy", "steps": [ "India knows Clayton.", "Clayton knows Charles.", "Charles knows Winston.", "Winston knows Everett.", "Everett knows Isadora.", "Isadora knows Elaine.", "Elaine knows Ember.", "Ember knows Judy." ], "difficulty": 8, "original_distance": 8, "idx_to_symbol": [ "India", "Ember", "Everett", "Winston", "Judy", "Jared", "Elaine", "Charles", "Isadora", "Clayton", "Francis", "Lorraine", "Eve", "Ross", "Hampton", "Emily", "Julio", "Darnell", "Electra", "Karina" ], "edges": [ [ 0, 5 ], [ 0, 9 ], [ 1, 4 ], [ 2, 8 ], [ 3, 2 ], [ 6, 1 ], [ 7, 3 ], [ 8, 6 ], [ 9, 7 ], [ 10, 15 ], [ 10, 19 ], [ 11, 14 ], [ 12, 18 ], [ 13, 12 ], [ 16, 11 ], [ 17, 13 ], [ 18, 16 ], [ 19, 17 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Pierce knows Graham. Louisa knows Victor. Kim knows Sheila. Victor knows Lewis. Tina knows Ford. Lennox knows Jenna. Gabriel knows Carla. Jem knows Marco. Carla knows Merle. Ford knows Edmund. Hudson knows Kim. Pierce knows Tina. Carla knows Judith. Victor knows Hudson. Marco knows Lennox. Kim knows Jem. Merle knows Pierce. Edmund knows Leigh. Which of Edmund and Lennox can Gabriel reach?", "answer": "Edmund", "steps": [ "Gabriel knows Carla.", "Carla knows Merle.", "Merle knows Pierce.", "Pierce knows Tina.", "Tina knows Ford.", "Ford knows Edmund." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Gabriel", "Graham", "Edmund", "Tina", "Pierce", "Carla", "Ford", "Merle", "Leigh", "Judith", "Louisa", "Sheila", "Lennox", "Jem", "Kim", "Victor", "Marco", "Hudson", "Jenna", "Lewis" ], "edges": [ [ 0, 5 ], [ 2, 8 ], [ 3, 6 ], [ 4, 1 ], [ 4, 3 ], [ 5, 7 ], [ 5, 9 ], [ 6, 2 ], [ 7, 4 ], [ 10, 15 ], [ 12, 18 ], [ 13, 16 ], [ 14, 11 ], [ 14, 13 ], [ 15, 17 ], [ 15, 19 ], [ 16, 12 ], [ 17, 14 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Brittany knows Louis. Kim knows Raymond. Noel knows Douglas. Goldie knows Atlas. Raymond knows Austin. Mary knows Tara. Yuki knows Mary. Donovan knows Yuki. Louis knows Lyle. Damian knows Autumn. Douglas knows Goldie. Gregory knows Kim. Autumn knows Gregory. Tamara knows Brittany. Mary knows Tamara. Gregory knows Noel. Nadine knows Nicole. Tara knows Nadine. Which of Goldie and Louis can Damian reach?", "answer": "Goldie", "steps": [ "Damian knows Autumn.", "Autumn knows Gregory.", "Gregory knows Noel.", "Noel knows Douglas.", "Douglas knows Goldie." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Damian", "Kim", "Douglas", "Autumn", "Austin", "Gregory", "Atlas", "Raymond", "Goldie", "Noel", "Donovan", "Tara", "Brittany", "Yuki", "Nicole", "Mary", "Lyle", "Nadine", "Louis", "Tamara" ], "edges": [ [ 0, 3 ], [ 1, 7 ], [ 2, 8 ], [ 3, 5 ], [ 5, 1 ], [ 5, 9 ], [ 7, 4 ], [ 8, 6 ], [ 9, 2 ], [ 10, 13 ], [ 11, 17 ], [ 12, 18 ], [ 13, 15 ], [ 15, 11 ], [ 15, 19 ], [ 17, 14 ], [ 18, 16 ], [ 19, 12 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Zane knows Electra. Luella knows Hattie. Gerald knows Elodie. Cristina knows Ramona. Jacob knows Tabitha. Zane knows Houston. Luella knows Walt. Maureen knows Eden. Anton knows Jacob. Camille knows Cristina. Levi knows Luella. Elodie knows Maureen. Carmela knows Felicia. Ramona knows Carmela. Carmela knows Melody. Houston knows Levi. Electra knows Anton. Camille knows Gerald. Which of Carmela and Luella can Camille reach?", "answer": "Carmela", "steps": [ "Camille knows Cristina.", "Cristina knows Ramona.", "Ramona knows Carmela." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Camille", "Maureen", "Cristina", "Ramona", "Elodie", "Gerald", "Carmela", "Eden", "Melody", "Felicia", "Zane", "Jacob", "Houston", "Levi", "Anton", "Electra", "Luella", "Tabitha", "Walt", "Hattie" ], "edges": [ [ 0, 5 ], [ 0, 2 ], [ 1, 7 ], [ 2, 3 ], [ 3, 6 ], [ 4, 1 ], [ 5, 4 ], [ 6, 8 ], [ 6, 9 ], [ 10, 15 ], [ 10, 12 ], [ 11, 17 ], [ 12, 13 ], [ 13, 16 ], [ 14, 11 ], [ 15, 14 ], [ 16, 18 ], [ 16, 19 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Beth knows Derek. Kirsten knows Archer. Gerald knows Fanny. Bill knows Jorge. April knows Kirsten. Fanny knows Harlan. Archer knows Kira. Chance knows Giselle. Derek knows Brynn. Derek knows Jolene. Kira knows Claire. Giselle knows Maria. Jolene knows Gerald. Kira knows Marvin. Giselle knows Beth. Marvin knows Bill. Kirsten knows Vincent. Jorge knows Dennis. Which of Kirsten and Giselle can April reach?", "answer": "Kirsten", "steps": [ "April knows Kirsten." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "April", "Dennis", "Kira", "Marvin", "Claire", "Bill", "Vincent", "Kirsten", "Jorge", "Archer", "Chance", "Harlan", "Derek", "Jolene", "Brynn", "Gerald", "Maria", "Giselle", "Fanny", "Beth" ], "edges": [ [ 0, 7 ], [ 2, 4 ], [ 2, 3 ], [ 3, 5 ], [ 5, 8 ], [ 7, 6 ], [ 7, 9 ], [ 8, 1 ], [ 9, 2 ], [ 10, 17 ], [ 12, 14 ], [ 12, 13 ], [ 13, 15 ], [ 15, 18 ], [ 17, 16 ], [ 17, 19 ], [ 18, 11 ], [ 19, 12 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Christian knows Sandra. Glenda knows Joseph. Uma knows Christopher. Nancy knows Joaquin. Bennett knows Glenda. Joseph knows Gary. Joaquin knows Ariana. Susan knows Emmett. Uma knows Boyd. Susan knows Clifford. Harmony knows Herbert. Emmett knows Garrett. Emmett knows Bennett. Karen knows Nancy. Karen knows Harmony. Boyd knows Olive. Boyd knows Karen. Bennett knows Christian. Which of Karen and Bennett can Uma reach?", "answer": "Karen", "steps": [ "Uma knows Boyd.", "Boyd knows Karen." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Uma", "Harmony", "Olive", "Nancy", "Christopher", "Boyd", "Karen", "Joaquin", "Ariana", "Herbert", "Susan", "Christian", "Garrett", "Glenda", "Clifford", "Emmett", "Bennett", "Joseph", "Gary", "Sandra" ], "edges": [ [ 0, 4 ], [ 0, 5 ], [ 1, 9 ], [ 3, 7 ], [ 5, 2 ], [ 5, 6 ], [ 6, 3 ], [ 6, 1 ], [ 7, 8 ], [ 10, 14 ], [ 10, 15 ], [ 11, 19 ], [ 13, 17 ], [ 15, 12 ], [ 15, 16 ], [ 16, 13 ], [ 16, 11 ], [ 17, 18 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Cordelia knows Tamara. Vivian knows Adelaide. Willis knows Andre. Willis knows Maude. Donovan knows Willis. Kai knows Basil. Kai knows Cordelia. Cordelia knows Percy. Adelaide knows Darin. Donovan knows Abel. Basil knows Ariana. Tamara knows Mindy. Elsa knows Camille. Christian knows Vivian. Vivian knows Clarence. Elsa knows Angela. Basil knows Elsa. Christian knows Donovan. Which of Darin and Mindy can Kai reach?", "answer": "Mindy", "steps": [ "Kai knows Cordelia.", "Cordelia knows Tamara.", "Tamara knows Mindy." ], "difficulty": 3, "original_distance": 3, "idx_to_symbol": [ "Kai", "Tamara", "Mindy", "Elsa", "Basil", "Percy", "Camille", "Angela", "Ariana", "Cordelia", "Christian", "Adelaide", "Darin", "Willis", "Donovan", "Clarence", "Andre", "Maude", "Abel", "Vivian" ], "edges": [ [ 0, 4 ], [ 0, 9 ], [ 1, 2 ], [ 3, 6 ], [ 3, 7 ], [ 4, 3 ], [ 4, 8 ], [ 9, 1 ], [ 9, 5 ], [ 10, 14 ], [ 10, 19 ], [ 11, 12 ], [ 13, 16 ], [ 13, 17 ], [ 14, 13 ], [ 14, 18 ], [ 19, 11 ], [ 19, 15 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Jeffery knows Keegan. John knows Dexter. Adrian knows Max. Eugenia knows John. Sarah knows Shelly. Milton knows Crystal. Crystal knows Paula. Max knows Darren. Holly knows Shaun. Keegan knows Gail. Dexter knows Milton. Gail knows Eugenia. Shaun knows Curtis. Darren knows Sarah. Shelly knows Carl. Curtis knows Adrian. Jeffery knows Chelsea. Holly knows Neal. Which of Shaun and Keegan can Holly reach?", "answer": "Shaun", "steps": [ "Holly knows Shaun." ], "difficulty": 1, "original_distance": 8, "idx_to_symbol": [ "Holly", "Adrian", "Shaun", "Carl", "Max", "Shelly", "Curtis", "Darren", "Neal", "Sarah", "Jeffery", "Eugenia", "Keegan", "Paula", "John", "Crystal", "Gail", "Dexter", "Chelsea", "Milton" ], "edges": [ [ 0, 8 ], [ 0, 2 ], [ 1, 4 ], [ 2, 6 ], [ 4, 7 ], [ 5, 3 ], [ 6, 1 ], [ 7, 9 ], [ 9, 5 ], [ 10, 18 ], [ 10, 12 ], [ 11, 14 ], [ 12, 16 ], [ 14, 17 ], [ 15, 13 ], [ 16, 11 ], [ 17, 19 ], [ 19, 15 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Fred knows Darrell. Hayes knows Beverly. Agnes knows Mike. Oliver knows Roman. Yvonne knows Larry. Larry knows Daisy. Daisy knows Darnell. Julia knows Lucia. Gabriel knows Oliver. Hayes knows Walter. April knows Gabriel. Jamie knows Yvonne. Gabriel knows Troy. Gabriel knows Craig. Lucia knows Agnes. Mike knows April. Darnell knows Hayes. Hayes knows Fred. Which of Daisy and Mike can Jamie reach?", "answer": "Daisy", "steps": [ "Jamie knows Yvonne.", "Yvonne knows Larry.", "Larry knows Daisy." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Jamie", "Larry", "Darrell", "Hayes", "Fred", "Walter", "Yvonne", "Daisy", "Darnell", "Beverly", "Julia", "Agnes", "Roman", "Gabriel", "Oliver", "Craig", "Lucia", "Mike", "April", "Troy" ], "edges": [ [ 0, 6 ], [ 1, 7 ], [ 3, 4 ], [ 3, 5 ], [ 3, 9 ], [ 4, 2 ], [ 6, 1 ], [ 7, 8 ], [ 8, 3 ], [ 10, 16 ], [ 11, 17 ], [ 13, 14 ], [ 13, 15 ], [ 13, 19 ], [ 14, 12 ], [ 16, 11 ], [ 17, 18 ], [ 18, 13 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Malik knows Mae. India knows Kieran. Randy knows Lyle. India knows Kobe. Kieran knows Ella. Virgil knows Kyle. Lyle knows Malik. Malik knows Kurt. India knows Nancy. Mae knows Annie. Malik knows Hailey. Kurt knows Lionel. Malik knows Virgil. India knows Holly. Eamon knows Maya. Maya knows India. Kobe knows Chester. Nancy knows Samuel. Which of Ella and Kyle can Eamon reach?", "answer": "Ella", "steps": [ "Eamon knows Maya.", "Maya knows India.", "India knows Kieran.", "Kieran knows Ella." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Eamon", "Ella", "Holly", "Maya", "Nancy", "Kieran", "Samuel", "Kobe", "Chester", "India", "Randy", "Kyle", "Hailey", "Lyle", "Mae", "Virgil", "Annie", "Kurt", "Lionel", "Malik" ], "edges": [ [ 0, 3 ], [ 3, 9 ], [ 4, 6 ], [ 5, 1 ], [ 7, 8 ], [ 9, 2 ], [ 9, 5 ], [ 9, 4 ], [ 9, 7 ], [ 10, 13 ], [ 13, 19 ], [ 14, 16 ], [ 15, 11 ], [ 17, 18 ], [ 19, 12 ], [ 19, 15 ], [ 19, 14 ], [ 19, 17 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Pauline knows Eunice. Abigail knows Dolly. Carson knows Maya. Keira knows Joshua. Gwen knows Keira. Natalie knows Greer. Sally knows Carson. Eunice knows Natalie. Dolly knows Dorian. Joshua knows Janet. Gwen knows Harlan. Caroline knows Ilene. Brad knows Warren. Janet knows Caroline. Pauline knows Amelia. Ilene knows Sally. Warren knows Abigail. Greer knows Brad. Which of Janet and Greer can Gwen reach?", "answer": "Janet", "steps": [ "Gwen knows Keira.", "Keira knows Joshua.", "Joshua knows Janet." ], "difficulty": 3, "original_distance": 8, "idx_to_symbol": [ "Gwen", "Joshua", "Harlan", "Carson", "Maya", "Keira", "Caroline", "Janet", "Ilene", "Sally", "Pauline", "Natalie", "Amelia", "Dolly", "Dorian", "Eunice", "Brad", "Greer", "Warren", "Abigail" ], "edges": [ [ 0, 2 ], [ 0, 5 ], [ 1, 7 ], [ 3, 4 ], [ 5, 1 ], [ 6, 8 ], [ 7, 6 ], [ 8, 9 ], [ 9, 3 ], [ 10, 12 ], [ 10, 15 ], [ 11, 17 ], [ 13, 14 ], [ 15, 11 ], [ 16, 18 ], [ 17, 16 ], [ 18, 19 ], [ 19, 13 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Becky knows Cole. Jermaine knows Gwen. Cole knows Jamie. Gwen knows Jeanne. Jeanne knows Whitney. Isadora knows Alex. Irma knows Isadora. Jared knows Levi. Hector knows Darius. Becky knows Selena. Jermaine knows Irma. Alex knows Cynthia. Selena knows Hector. Jared knows Eamon. Jamie knows Jared. Whitney knows Grover. Darius knows Ellen. Whitney knows Leah. Which of Cole and Gwen can Jermaine reach?", "answer": "Gwen", "steps": [ "Jermaine knows Gwen." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Jermaine", "Gwen", "Cynthia", "Grover", "Jeanne", "Isadora", "Alex", "Whitney", "Leah", "Irma", "Becky", "Cole", "Ellen", "Eamon", "Jamie", "Hector", "Darius", "Jared", "Levi", "Selena" ], "edges": [ [ 0, 1 ], [ 0, 9 ], [ 1, 4 ], [ 4, 7 ], [ 5, 6 ], [ 6, 2 ], [ 7, 3 ], [ 7, 8 ], [ 9, 5 ], [ 10, 11 ], [ 10, 19 ], [ 11, 14 ], [ 14, 17 ], [ 15, 16 ], [ 16, 12 ], [ 17, 13 ], [ 17, 18 ], [ 19, 15 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Jocelyn knows Gregory. Ron knows Leticia. Luella knows Foster. Irene knows Ron. Yara knows Bernadette. Viola knows Imogen. Jeff knows Norma. Ron knows Yasmin. Ron knows Luella. Gregory knows Yara. Tara knows Irene. Viola knows Jeff. Parsa knows Tara. Ford knows Parsa. Darrell knows Ford. Viola knows Phoebe. Gladys knows Jocelyn. Bernadette knows Viola. Which of Yara and Tara can Gladys reach?", "answer": "Yara", "steps": [ "Gladys knows Jocelyn.", "Jocelyn knows Gregory.", "Gregory knows Yara." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Gladys", "Phoebe", "Imogen", "Norma", "Bernadette", "Viola", "Gregory", "Yara", "Jeff", "Jocelyn", "Darrell", "Leticia", "Yasmin", "Foster", "Irene", "Ron", "Parsa", "Tara", "Luella", "Ford" ], "edges": [ [ 0, 9 ], [ 4, 5 ], [ 5, 1 ], [ 5, 2 ], [ 5, 8 ], [ 6, 7 ], [ 7, 4 ], [ 8, 3 ], [ 9, 6 ], [ 10, 19 ], [ 14, 15 ], [ 15, 11 ], [ 15, 12 ], [ 15, 18 ], [ 16, 17 ], [ 17, 14 ], [ 18, 13 ], [ 19, 16 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Dean knows Drake. Chandler knows Fernando. Jarvis knows Skyler. Keegan knows Jarvis. Cody knows Walter. Walter knows Opal. Ernesto knows Seth. Fisher knows Ibrahim. Mia knows Heath. Cody knows Bart. Bart knows Chandler. Keegan knows Alice. Odette knows Cody. Seth knows Mia. Skyler knows Ernesto. Fernando knows Fisher. Jarvis knows Dean. Odette knows Curtis. Which of Cody and Jarvis can Odette reach?", "answer": "Cody", "steps": [ "Odette knows Cody." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Odette", "Chandler", "Ibrahim", "Fisher", "Bart", "Opal", "Cody", "Curtis", "Fernando", "Walter", "Keegan", "Ernesto", "Heath", "Mia", "Skyler", "Drake", "Jarvis", "Alice", "Seth", "Dean" ], "edges": [ [ 0, 7 ], [ 0, 6 ], [ 1, 8 ], [ 3, 2 ], [ 4, 1 ], [ 6, 4 ], [ 6, 9 ], [ 8, 3 ], [ 9, 5 ], [ 10, 17 ], [ 10, 16 ], [ 11, 18 ], [ 13, 12 ], [ 14, 11 ], [ 16, 14 ], [ 16, 19 ], [ 18, 13 ], [ 19, 15 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Gerald knows Susan. Jolene knows Omar. Angela knows Cate. Jake knows Lloyd. Dorothy knows Angela. Drew knows Jake. Marc knows Harold. Zachary knows Jolene. Susan knows Peggy. Zachary knows Ramona. Francesca knows Heather. Jeanette knows Ernie. Cate knows Marc. Rachel knows Zachary. Rachel knows Gerald. Marc knows Jeanette. Heather knows Rachel. Cate knows Drew. Which of Jake and Susan can Francesca reach?", "answer": "Susan", "steps": [ "Francesca knows Heather.", "Heather knows Rachel.", "Rachel knows Gerald.", "Gerald knows Susan." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Francesca", "Ramona", "Rachel", "Omar", "Gerald", "Peggy", "Susan", "Heather", "Jolene", "Zachary", "Dorothy", "Harold", "Cate", "Ernie", "Drew", "Lloyd", "Jake", "Angela", "Jeanette", "Marc" ], "edges": [ [ 0, 7 ], [ 2, 4 ], [ 2, 9 ], [ 4, 6 ], [ 6, 5 ], [ 7, 2 ], [ 8, 3 ], [ 9, 1 ], [ 9, 8 ], [ 10, 17 ], [ 12, 14 ], [ 12, 19 ], [ 14, 16 ], [ 16, 15 ], [ 17, 12 ], [ 18, 13 ], [ 19, 11 ], [ 19, 18 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Ava knows Rebecca. Rebecca knows Ross. Ian knows Cole. Florence knows Antonio. Livia knows Lloyd. Gemma knows Esther. Gemma knows Ian. Florence knows Ava. Harlan knows Max. Rebecca knows Tristan. Rosemary knows Florence. Cole knows Alyson. Tristan knows Greg. Harlan knows Rosemary. Cole knows Nicole. Louise knows Samantha. Nicole knows Louise. Louise knows Livia. Which of Ian and Rosemary can Gemma reach?", "answer": "Ian", "steps": [ "Gemma knows Ian." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Gemma", "Samantha", "Ian", "Livia", "Cole", "Louise", "Esther", "Nicole", "Lloyd", "Alyson", "Harlan", "Ross", "Rosemary", "Tristan", "Florence", "Rebecca", "Max", "Ava", "Greg", "Antonio" ], "edges": [ [ 0, 6 ], [ 0, 2 ], [ 2, 4 ], [ 3, 8 ], [ 4, 7 ], [ 4, 9 ], [ 5, 1 ], [ 5, 3 ], [ 7, 5 ], [ 10, 16 ], [ 10, 12 ], [ 12, 14 ], [ 13, 18 ], [ 14, 17 ], [ 14, 19 ], [ 15, 11 ], [ 15, 13 ], [ 17, 15 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Carmen knows Wilson. Myrtle knows Carlos. Leonard knows Norma. Pauline knows Leonard. Chad knows Pauline. Chad knows Myrtle. Sean knows Marilyn. Pablo knows Hannah. Norma knows Kai. Wilson knows Celia. Marilyn knows Bill. Leonard knows Daphna. Pablo knows Chad. Audrey knows Geraldine. Marilyn knows Dave. Bill knows Winifred. Carmen knows Sean. Audrey knows Carmen. Which of Leonard and Marilyn can Audrey reach?", "answer": "Marilyn", "steps": [ "Audrey knows Carmen.", "Carmen knows Sean.", "Sean knows Marilyn." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Audrey", "Sean", "Geraldine", "Marilyn", "Celia", "Carmen", "Wilson", "Dave", "Winifred", "Bill", "Pablo", "Pauline", "Hannah", "Leonard", "Carlos", "Chad", "Myrtle", "Daphna", "Kai", "Norma" ], "edges": [ [ 0, 2 ], [ 0, 5 ], [ 1, 3 ], [ 3, 7 ], [ 3, 9 ], [ 5, 6 ], [ 5, 1 ], [ 6, 4 ], [ 9, 8 ], [ 10, 12 ], [ 10, 15 ], [ 11, 13 ], [ 13, 17 ], [ 13, 19 ], [ 15, 16 ], [ 15, 11 ], [ 16, 14 ], [ 19, 18 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "George knows Dolores. Carl knows Cecilia. Mitchell knows Parsa. Cecilia knows Blanche. Leigh knows Elliot. Todd knows Randy. Selena knows Marcia. Todd knows Charity. Norman knows Lily. Selena knows Gabe. Selena knows Eugenia. Blanche knows Leigh. Todd knows George. Dolores knows Mitchell. Lily knows Donna. Dewey knows Carl. Eugenia knows Dewey. Parsa knows Norman. Which of Parsa and Cecilia can Todd reach?", "answer": "Parsa", "steps": [ "Todd knows George.", "George knows Dolores.", "Dolores knows Mitchell.", "Mitchell knows Parsa." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Todd", "Charity", "Parsa", "Mitchell", "Lily", "Randy", "George", "Norman", "Dolores", "Donna", "Selena", "Gabe", "Cecilia", "Carl", "Leigh", "Marcia", "Eugenia", "Blanche", "Dewey", "Elliot" ], "edges": [ [ 0, 1 ], [ 0, 5 ], [ 0, 6 ], [ 2, 7 ], [ 3, 2 ], [ 4, 9 ], [ 6, 8 ], [ 7, 4 ], [ 8, 3 ], [ 10, 11 ], [ 10, 15 ], [ 10, 16 ], [ 12, 17 ], [ 13, 12 ], [ 14, 19 ], [ 16, 18 ], [ 17, 14 ], [ 18, 13 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Valerie knows Malcolm. Virgil knows Ava. Vincent knows Nora. Valerie knows Alicia. Nora knows Jacques. Alicia knows Vincent. Alicia knows Eugenia. Ava knows Lauren. Malcolm knows Tyler. Virgil knows Ember. Cameron knows Ivan. Warren knows Cameron. Malcolm knows Caleb. Cameron knows Peggy. Lauren knows Forrest. Warren knows Virgil. Jacques knows Leah. Forrest knows Gerard. Which of Leah and Gerard can Warren reach?", "answer": "Gerard", "steps": [ "Warren knows Virgil.", "Virgil knows Ava.", "Ava knows Lauren.", "Lauren knows Forrest.", "Forrest knows Gerard." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Warren", "Ember", "Ava", "Peggy", "Gerard", "Lauren", "Cameron", "Forrest", "Ivan", "Virgil", "Valerie", "Eugenia", "Vincent", "Caleb", "Leah", "Nora", "Malcolm", "Jacques", "Tyler", "Alicia" ], "edges": [ [ 0, 6 ], [ 0, 9 ], [ 2, 5 ], [ 5, 7 ], [ 6, 3 ], [ 6, 8 ], [ 7, 4 ], [ 9, 1 ], [ 9, 2 ], [ 10, 16 ], [ 10, 19 ], [ 12, 15 ], [ 15, 17 ], [ 16, 13 ], [ 16, 18 ], [ 17, 14 ], [ 19, 11 ], [ 19, 12 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Blaine knows Rebecca. Rebecca knows Marc. Blaine knows Donovan. Marion knows Ross. Doris knows Bridget. Doris knows Inez. Rebecca knows Saul. Chester knows Haven. Tamara knows Lee. Jane knows Marion. Diego knows Lottie. Inez knows Chester. Keaton knows Blaine. Marc knows Tamara. Diego knows Doris. Lee knows Davis. Marc knows Rosa. Marion knows Diego. Which of Blaine and Marion can Keaton reach?", "answer": "Blaine", "steps": [ "Keaton knows Blaine." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Keaton", "Lee", "Tamara", "Marc", "Saul", "Davis", "Rebecca", "Rosa", "Donovan", "Blaine", "Jane", "Chester", "Inez", "Doris", "Lottie", "Haven", "Diego", "Bridget", "Ross", "Marion" ], "edges": [ [ 0, 9 ], [ 1, 5 ], [ 2, 1 ], [ 3, 2 ], [ 3, 7 ], [ 6, 4 ], [ 6, 3 ], [ 9, 6 ], [ 9, 8 ], [ 10, 19 ], [ 11, 15 ], [ 12, 11 ], [ 13, 12 ], [ 13, 17 ], [ 16, 14 ], [ 16, 13 ], [ 19, 16 ], [ 19, 18 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Greer knows Alicia. Clara knows Linda. Bernard knows Conner. Bernard knows Deirdre. Deirdre knows Lauren. Cara knows Bill. Callum knows Clara. Cara knows Gordon. Clara knows Cara. Garland knows Callum. Lauren knows Kelsey. Kelsey knows Vanessa. Langston knows Jeff. Gordon knows Greer. Carrie knows Bernard. Jeff knows Carrie. Carrie knows Marie. Alicia knows Deanna. Which of Carrie and Clara can Garland reach?", "answer": "Clara", "steps": [ "Garland knows Callum.", "Callum knows Clara." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Garland", "Bill", "Linda", "Cara", "Clara", "Alicia", "Callum", "Deanna", "Gordon", "Greer", "Langston", "Conner", "Marie", "Bernard", "Carrie", "Kelsey", "Jeff", "Vanessa", "Deirdre", "Lauren" ], "edges": [ [ 0, 6 ], [ 3, 1 ], [ 3, 8 ], [ 4, 2 ], [ 4, 3 ], [ 5, 7 ], [ 6, 4 ], [ 8, 9 ], [ 9, 5 ], [ 10, 16 ], [ 13, 11 ], [ 13, 18 ], [ 14, 12 ], [ 14, 13 ], [ 15, 17 ], [ 16, 14 ], [ 18, 19 ], [ 19, 15 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Miles knows Dee. Jules knows Joshua. Miles knows Ethan. Joshua knows Becky. Erik knows Jules. Ernesto knows Cecilia. Whitney knows Fritz. Nash knows Dewey. Ethan knows Beau. Erik knows Katrina. Beau knows Blair. Nash knows Whitney. Joshua knows Ernesto. Karen knows Elaine. Dee knows Nash. Katrina knows Karen. Beau knows Eduardo. Karen knows Franklin. Which of Cecilia and Fritz can Erik reach?", "answer": "Cecilia", "steps": [ "Erik knows Jules.", "Jules knows Joshua.", "Joshua knows Ernesto.", "Ernesto knows Cecilia." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Erik", "Ernesto", "Katrina", "Elaine", "Joshua", "Karen", "Jules", "Becky", "Franklin", "Cecilia", "Miles", "Whitney", "Ethan", "Blair", "Nash", "Beau", "Dee", "Dewey", "Eduardo", "Fritz" ], "edges": [ [ 0, 2 ], [ 0, 6 ], [ 1, 9 ], [ 2, 5 ], [ 4, 7 ], [ 4, 1 ], [ 5, 3 ], [ 5, 8 ], [ 6, 4 ], [ 10, 12 ], [ 10, 16 ], [ 11, 19 ], [ 12, 15 ], [ 14, 17 ], [ 14, 11 ], [ 15, 13 ], [ 15, 18 ], [ 16, 14 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Catherine knows Clinton. Jessie knows Mindy. Jonathan knows Catherine. Heather knows Leo. Eric knows Dolores. Diane knows Desmond. Rhea knows Stacy. Gloria knows Laverne. Jonathan knows Griffith. Clyde knows Porter. Rhea knows Clyde. Jenna knows Heather. Gloria knows Diane. Gloria knows Jonathan. Stacy knows Eric. Stacy knows Jenna. Griffith knows Jessie. Rhea knows Perry. Which of Jonathan and Stacy can Gloria reach?", "answer": "Jonathan", "steps": [ "Gloria knows Jonathan." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Gloria", "Laverne", "Griffith", "Desmond", "Catherine", "Mindy", "Clinton", "Jessie", "Diane", "Jonathan", "Rhea", "Perry", "Jenna", "Porter", "Eric", "Leo", "Dolores", "Heather", "Clyde", "Stacy" ], "edges": [ [ 0, 1 ], [ 0, 8 ], [ 0, 9 ], [ 2, 7 ], [ 4, 6 ], [ 7, 5 ], [ 8, 3 ], [ 9, 4 ], [ 9, 2 ], [ 10, 11 ], [ 10, 18 ], [ 10, 19 ], [ 12, 17 ], [ 14, 16 ], [ 17, 15 ], [ 18, 13 ], [ 19, 14 ], [ 19, 12 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Daria knows Adelaide. Philip knows Anita. Griffith knows Iris. Russell knows Max. Katrina knows Melody. Katrina knows Xander. Avery knows Daria. Melody knows Griffith. Basil knows Autumn. Ken knows Harrison. Max knows Basil. Iris knows Philip. Hal knows Aisha. Daria knows Russell. Aisha knows Katrina. Hal knows Josie. Ken knows Avery. Autumn knows Elliot. Which of Iris and Basil can Ken reach?", "answer": "Basil", "steps": [ "Ken knows Avery.", "Avery knows Daria.", "Daria knows Russell.", "Russell knows Max.", "Max knows Basil." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Ken", "Russell", "Elliot", "Harrison", "Basil", "Adelaide", "Max", "Avery", "Daria", "Autumn", "Hal", "Melody", "Anita", "Josie", "Iris", "Xander", "Griffith", "Aisha", "Katrina", "Philip" ], "edges": [ [ 0, 3 ], [ 0, 7 ], [ 1, 6 ], [ 4, 9 ], [ 6, 4 ], [ 7, 8 ], [ 8, 5 ], [ 8, 1 ], [ 9, 2 ], [ 10, 13 ], [ 10, 17 ], [ 11, 16 ], [ 14, 19 ], [ 16, 14 ], [ 17, 18 ], [ 18, 15 ], [ 18, 11 ], [ 19, 12 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Adam knows Fern. Adam knows Richard. Alejandro knows April. Justin knows Alejandro. Leah knows Justin. Flora knows Griffith. Justin knows Taylor. Kristina knows Adam. April knows Karen. Katrina knows Kristina. Richard knows Flora. Belinda knows Keith. Justin knows Layla. Adam knows Ashton. Dallas knows Chris. Rachel knows Leah. Kristina knows Belinda. Leah knows Dallas. Which of Kristina and Leah can Rachel reach?", "answer": "Leah", "steps": [ "Rachel knows Leah." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Rachel", "Karen", "Taylor", "Alejandro", "Layla", "Justin", "Chris", "Leah", "Dallas", "April", "Katrina", "Griffith", "Ashton", "Richard", "Fern", "Adam", "Keith", "Kristina", "Belinda", "Flora" ], "edges": [ [ 0, 7 ], [ 3, 9 ], [ 5, 2 ], [ 5, 4 ], [ 5, 3 ], [ 7, 8 ], [ 7, 5 ], [ 8, 6 ], [ 9, 1 ], [ 10, 17 ], [ 13, 19 ], [ 15, 12 ], [ 15, 14 ], [ 15, 13 ], [ 17, 18 ], [ 17, 15 ], [ 18, 16 ], [ 19, 11 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Jeremiah knows Glen. Jenny knows Jose. Arlene knows Vincent. Marie knows Allison. Bert knows Caroline. Jean knows Rufus. Jose knows Merle. Sylvia knows Jeremiah. Corinne knows Morgan. Jose knows Walter. Jenny knows Jean. Rufus knows Simon. Marie knows Esther. Arlene knows Marie. Corinne knows Jenny. Simon knows Eunice. Vincent knows Sylvia. Bert knows Arlene. Which of Jenny and Arlene can Corinne reach?", "answer": "Jenny", "steps": [ "Corinne knows Jenny." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Corinne", "Jose", "Simon", "Morgan", "Eunice", "Jenny", "Rufus", "Jean", "Walter", "Merle", "Bert", "Marie", "Jeremiah", "Caroline", "Glen", "Arlene", "Sylvia", "Vincent", "Allison", "Esther" ], "edges": [ [ 0, 3 ], [ 0, 5 ], [ 1, 8 ], [ 1, 9 ], [ 2, 4 ], [ 5, 7 ], [ 5, 1 ], [ 6, 2 ], [ 7, 6 ], [ 10, 13 ], [ 10, 15 ], [ 11, 18 ], [ 11, 19 ], [ 12, 14 ], [ 15, 17 ], [ 15, 11 ], [ 16, 12 ], [ 17, 16 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Rhonda knows Allison. Cameron knows Cliff. Will knows Susanne. Brock knows Beau. Wilma knows Goldie. Brock knows Keaton. Will knows Hayley. Mitchell knows Cameron. Susanne knows Brock. Wilma knows Randy. Goldie knows Hudson. Randy knows Mitchell. Hayley knows Axel. Rhonda knows Thea. Cameron knows Lars. Mitchell knows Colleen. Brock knows Rhonda. Mitchell knows Victoria. Which of Rhonda and Cameron can Wilma reach?", "answer": "Cameron", "steps": [ "Wilma knows Randy.", "Randy knows Mitchell.", "Mitchell knows Cameron." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Wilma", "Mitchell", "Lars", "Randy", "Hudson", "Colleen", "Victoria", "Cameron", "Cliff", "Goldie", "Will", "Brock", "Allison", "Susanne", "Axel", "Keaton", "Beau", "Rhonda", "Thea", "Hayley" ], "edges": [ [ 0, 3 ], [ 0, 9 ], [ 1, 5 ], [ 1, 6 ], [ 1, 7 ], [ 3, 1 ], [ 7, 2 ], [ 7, 8 ], [ 9, 4 ], [ 10, 13 ], [ 10, 19 ], [ 11, 15 ], [ 11, 16 ], [ 11, 17 ], [ 13, 11 ], [ 17, 12 ], [ 17, 18 ], [ 19, 14 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Keegan knows Frances. Bennett knows Derrick. Bruno knows Bart. Dolores knows Merle. Chance knows Max. Derrick knows Jeremy. Bennett knows Warren. Keegan knows Jasper. Fergus knows Ashton. Warren knows Finn. Maude knows Dolores. Bruno knows Arden. Jeremy knows Chance. Frances knows Maude. Maude knows Yvette. Bart knows Bennett. Yvette knows Jonas. Jonas knows Fergus. Which of Bart and Frances can Keegan reach?", "answer": "Frances", "steps": [ "Keegan knows Frances." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Keegan", "Dolores", "Fergus", "Yvette", "Ashton", "Maude", "Frances", "Merle", "Jasper", "Jonas", "Bruno", "Warren", "Chance", "Derrick", "Max", "Bennett", "Bart", "Finn", "Arden", "Jeremy" ], "edges": [ [ 0, 8 ], [ 0, 6 ], [ 1, 7 ], [ 2, 4 ], [ 3, 9 ], [ 5, 1 ], [ 5, 3 ], [ 6, 5 ], [ 9, 2 ], [ 10, 18 ], [ 10, 16 ], [ 11, 17 ], [ 12, 14 ], [ 13, 19 ], [ 15, 11 ], [ 15, 13 ], [ 16, 15 ], [ 19, 12 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Alicia knows Blanche. Alexa knows Jolene. Kay knows Alexa. Jolene knows Dorian. Arturo knows Eunice. Diana knows Angela. Dorian knows Christopher. Alicia knows Christian. Alana knows Diana. Ignacio knows Alana. Ross knows Erma. Alicia knows Lucas. Christian knows Clement. Arturo knows Kay. Alana knows Saul. Dorian knows Ross. Clement knows Ignacio. Arturo knows Oliver. Which of Christian and Kay can Arturo reach?", "answer": "Kay", "steps": [ "Arturo knows Kay." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Arturo", "Ross", "Jolene", "Erma", "Oliver", "Kay", "Alexa", "Christopher", "Eunice", "Dorian", "Alicia", "Diana", "Ignacio", "Angela", "Lucas", "Christian", "Clement", "Saul", "Blanche", "Alana" ], "edges": [ [ 0, 4 ], [ 0, 8 ], [ 0, 5 ], [ 1, 3 ], [ 2, 9 ], [ 5, 6 ], [ 6, 2 ], [ 9, 1 ], [ 9, 7 ], [ 10, 14 ], [ 10, 18 ], [ 10, 15 ], [ 11, 13 ], [ 12, 19 ], [ 15, 16 ], [ 16, 12 ], [ 19, 11 ], [ 19, 17 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Marie knows Patrick. Mabel knows Donald. Clyde knows Marie. Carmen knows Mabel. Allison knows Carmen. Harmony knows Allison. Harriet knows Giselle. Kara knows Harriet. Yvette knows Kara. Kara knows Dawn. Carmen knows Keaton. Evan knows Yvette. Sierra knows Harmony. Harriet knows Clyde. Carmen knows Kamila. Allison knows Jill. Donald knows Jillian. Harriet knows Derrick. Which of Marie and Donald can Sierra reach?", "answer": "Donald", "steps": [ "Sierra knows Harmony.", "Harmony knows Allison.", "Allison knows Carmen.", "Carmen knows Mabel.", "Mabel knows Donald." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Sierra", "Keaton", "Donald", "Jill", "Mabel", "Carmen", "Kamila", "Allison", "Jillian", "Harmony", "Evan", "Giselle", "Marie", "Dawn", "Clyde", "Harriet", "Derrick", "Kara", "Patrick", "Yvette" ], "edges": [ [ 0, 9 ], [ 2, 8 ], [ 4, 2 ], [ 5, 1 ], [ 5, 6 ], [ 5, 4 ], [ 7, 3 ], [ 7, 5 ], [ 9, 7 ], [ 10, 19 ], [ 12, 18 ], [ 14, 12 ], [ 15, 11 ], [ 15, 16 ], [ 15, 14 ], [ 17, 13 ], [ 17, 15 ], [ 19, 17 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Sybil knows Bernadette. Finn knows India. India knows Faith. Sybil knows Hardy. Jose knows Sue. Finn knows Jose. Larry knows Arturo. Alyssa knows Logan. Pierce knows Larry. Arturo knows Sybil. Geraldine knows Lara. Sue knows Camille. Bernadette knows Elvira. Hardy knows Alyssa. Fern knows Geraldine. Bernadette knows Bella. Lara knows Finn. India knows Forrest. Which of Jose and Hardy can Pierce reach?", "answer": "Hardy", "steps": [ "Pierce knows Larry.", "Larry knows Arturo.", "Arturo knows Sybil.", "Sybil knows Hardy." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Pierce", "Alyssa", "Hardy", "Logan", "Arturo", "Elvira", "Bella", "Sybil", "Bernadette", "Larry", "Fern", "Sue", "Jose", "Camille", "Lara", "Faith", "Forrest", "Finn", "India", "Geraldine" ], "edges": [ [ 0, 9 ], [ 1, 3 ], [ 2, 1 ], [ 4, 7 ], [ 7, 2 ], [ 7, 8 ], [ 8, 5 ], [ 8, 6 ], [ 9, 4 ], [ 10, 19 ], [ 11, 13 ], [ 12, 11 ], [ 14, 17 ], [ 17, 12 ], [ 17, 18 ], [ 18, 15 ], [ 18, 16 ], [ 19, 14 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Jolena knows Hailey. Cyrus knows George. Jennifer knows Kamila. Grady knows Keaton. Regina knows Cyrus. Hardy knows Regina. Virginia knows Marian. Grady knows Jolena. Brian knows Hardy. Brandon knows Virginia. Hailey knows Jennifer. Brandon knows Brian. Cyrus knows Lance. Keaton knows Lena. Kamila knows Clayton. Marian knows Paul. Lena knows Sheryl. Kamila knows Dominic. Which of Hardy and Hailey can Grady reach?", "answer": "Hailey", "steps": [ "Grady knows Jolena.", "Jolena knows Hailey." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Grady", "Jolena", "Jennifer", "Lena", "Sheryl", "Dominic", "Keaton", "Clayton", "Hailey", "Kamila", "Brandon", "Brian", "Regina", "Marian", "Paul", "Lance", "Virginia", "George", "Hardy", "Cyrus" ], "edges": [ [ 0, 6 ], [ 0, 1 ], [ 1, 8 ], [ 2, 9 ], [ 3, 4 ], [ 6, 3 ], [ 8, 2 ], [ 9, 5 ], [ 9, 7 ], [ 10, 16 ], [ 10, 11 ], [ 11, 18 ], [ 12, 19 ], [ 13, 14 ], [ 16, 13 ], [ 18, 12 ], [ 19, 15 ], [ 19, 17 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Eileen knows Perry. Eileen knows Julio. Randall knows Cate. Jeff knows Karina. Emmett knows Billy. Eileen knows Griffith. Wyatt knows Lilia. Elijah knows Randall. Griffith knows Jakob. Perry knows Eugene. Itzel knows Hubert. Perry knows Elijah. Emmett knows Wyatt. Jeff knows Emmett. Lilia knows Gwen. Perry knows Luis. Emmett knows Estelle. Jeff knows Itzel. Which of Cate and Gwen can Eileen reach?", "answer": "Cate", "steps": [ "Eileen knows Perry.", "Perry knows Elijah.", "Elijah knows Randall.", "Randall knows Cate." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Eileen", "Julio", "Luis", "Perry", "Cate", "Eugene", "Elijah", "Randall", "Jakob", "Griffith", "Jeff", "Karina", "Billy", "Emmett", "Gwen", "Estelle", "Wyatt", "Lilia", "Hubert", "Itzel" ], "edges": [ [ 0, 1 ], [ 0, 3 ], [ 0, 9 ], [ 3, 2 ], [ 3, 5 ], [ 3, 6 ], [ 6, 7 ], [ 7, 4 ], [ 9, 8 ], [ 10, 11 ], [ 10, 13 ], [ 10, 19 ], [ 13, 12 ], [ 13, 15 ], [ 13, 16 ], [ 16, 17 ], [ 17, 14 ], [ 19, 18 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Duncan knows Jeffery. Jacques knows Gideon. Aldo knows Zach. Keira knows Colin. Neil knows Wesley. Jacques knows Aldo. Kit knows Jacques. Zach knows Warren. Madeline knows Paul. Gideon knows Brooks. Matt knows Dakota. Madeline knows Matt. Kit knows Neil. Paul knows Sebastian. Sebastian knows Ellis. Aldo knows Shelly. Sebastian knows Keira. Paul knows Duncan. Which of Sebastian and Aldo can Madeline reach?", "answer": "Sebastian", "steps": [ "Madeline knows Paul.", "Paul knows Sebastian." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Madeline", "Colin", "Paul", "Matt", "Ellis", "Sebastian", "Keira", "Duncan", "Jeffery", "Dakota", "Kit", "Warren", "Jacques", "Neil", "Shelly", "Aldo", "Zach", "Gideon", "Brooks", "Wesley" ], "edges": [ [ 0, 2 ], [ 0, 3 ], [ 2, 5 ], [ 2, 7 ], [ 3, 9 ], [ 5, 4 ], [ 5, 6 ], [ 6, 1 ], [ 7, 8 ], [ 10, 12 ], [ 10, 13 ], [ 12, 15 ], [ 12, 17 ], [ 13, 19 ], [ 15, 14 ], [ 15, 16 ], [ 16, 11 ], [ 17, 18 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Peggy knows Saul. Grace knows Peggy. Darin knows Arthur. Cooper knows Simon. Simon knows Myra. Hendrix knows Grace. Eldon knows Heidi. Eldon knows Denise. Myra knows Lillian. Saul knows Eldon. Cooper knows Conner. Myra knows Marco. Graeme knows Aisha. Peggy knows Jacqueline. Doug knows Cooper. Lillian knows Darin. Bryan knows Doug. Denise knows Graeme. Which of Eldon and Myra can Hendrix reach?", "answer": "Eldon", "steps": [ "Hendrix knows Grace.", "Grace knows Peggy.", "Peggy knows Saul.", "Saul knows Eldon." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Hendrix", "Graeme", "Jacqueline", "Eldon", "Saul", "Grace", "Peggy", "Aisha", "Denise", "Heidi", "Bryan", "Darin", "Conner", "Myra", "Simon", "Doug", "Cooper", "Arthur", "Lillian", "Marco" ], "edges": [ [ 0, 5 ], [ 1, 7 ], [ 3, 8 ], [ 3, 9 ], [ 4, 3 ], [ 5, 6 ], [ 6, 2 ], [ 6, 4 ], [ 8, 1 ], [ 10, 15 ], [ 11, 17 ], [ 13, 18 ], [ 13, 19 ], [ 14, 13 ], [ 15, 16 ], [ 16, 12 ], [ 16, 14 ], [ 18, 11 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Hugo knows Samuel. Kurt knows Brenda. Brenda knows Kamila. Brenda knows Freya. Merle knows Valerie. Julia knows Abby. Kurt knows Gabe. Brent knows Hugo. Freya knows Merle. Julia knows Colby. Hugo knows Kendra. Brenda knows Eugenia. Julia knows Lamont. Hugo knows Jack. Samuel knows Julia. Merle knows Dina. Merle knows Tabitha. Brent knows Stefan. Which of Freya and Samuel can Kurt reach?", "answer": "Freya", "steps": [ "Kurt knows Brenda.", "Brenda knows Freya." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Kurt", "Gabe", "Dina", "Merle", "Eugenia", "Valerie", "Kamila", "Tabitha", "Freya", "Brenda", "Brent", "Stefan", "Lamont", "Julia", "Kendra", "Colby", "Jack", "Abby", "Samuel", "Hugo" ], "edges": [ [ 0, 1 ], [ 0, 9 ], [ 3, 2 ], [ 3, 5 ], [ 3, 7 ], [ 8, 3 ], [ 9, 4 ], [ 9, 6 ], [ 9, 8 ], [ 10, 11 ], [ 10, 19 ], [ 13, 12 ], [ 13, 15 ], [ 13, 17 ], [ 18, 13 ], [ 19, 14 ], [ 19, 16 ], [ 19, 18 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Leroy knows Nadine. Carlos knows Julio. Keegan knows Trevor. Lennox knows Felix. Rosa knows Allison. Nadine knows Kareem. Trevor knows Adelaide. Leo knows Carlos. Garland knows Barbara. Adelaide knows Lennox. Nadine knows Lucy. Allison knows Leo. Keegan knows Giselle. Rosa knows Darla. Houston knows Garland. Trevor knows Houston. Garland knows Monica. Allison knows Leroy. Which of Lucy and Monica can Rosa reach?", "answer": "Lucy", "steps": [ "Rosa knows Allison.", "Allison knows Leroy.", "Leroy knows Nadine.", "Nadine knows Lucy." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Rosa", "Kareem", "Leo", "Carlos", "Leroy", "Julio", "Nadine", "Allison", "Lucy", "Darla", "Keegan", "Barbara", "Adelaide", "Lennox", "Houston", "Felix", "Garland", "Trevor", "Monica", "Giselle" ], "edges": [ [ 0, 7 ], [ 0, 9 ], [ 2, 3 ], [ 3, 5 ], [ 4, 6 ], [ 6, 1 ], [ 6, 8 ], [ 7, 2 ], [ 7, 4 ], [ 10, 17 ], [ 10, 19 ], [ 12, 13 ], [ 13, 15 ], [ 14, 16 ], [ 16, 11 ], [ 16, 18 ], [ 17, 12 ], [ 17, 14 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Lawson knows Isabel. Pam knows Maureen. Lawson knows Jared. Maureen knows Jasmine. Sylvia knows Deborah. Dahlia knows Jeremiah. Dahlia knows Colby. Jacques knows Dahlia. Kennedy knows Sebastian. Pam knows Jacques. Sylvia knows Dexter. Dahlia knows Harris. Lawson knows Fritz. Lawson knows Herbert. Deborah knows Kennedy. Dexter knows Lawson. Jasmine knows Candice. Dahlia knows Ernie. Which of Kennedy and Jasmine can Sylvia reach?", "answer": "Kennedy", "steps": [ "Sylvia knows Deborah.", "Deborah knows Kennedy." ], "difficulty": 2, "original_distance": 3, "idx_to_symbol": [ "Sylvia", "Deborah", "Herbert", "Kennedy", "Fritz", "Sebastian", "Isabel", "Dexter", "Lawson", "Jared", "Pam", "Maureen", "Colby", "Jasmine", "Harris", "Candice", "Jeremiah", "Jacques", "Dahlia", "Ernie" ], "edges": [ [ 0, 1 ], [ 0, 7 ], [ 1, 3 ], [ 3, 5 ], [ 7, 8 ], [ 8, 2 ], [ 8, 4 ], [ 8, 6 ], [ 8, 9 ], [ 10, 11 ], [ 10, 17 ], [ 11, 13 ], [ 13, 15 ], [ 17, 18 ], [ 18, 12 ], [ 18, 14 ], [ 18, 16 ], [ 18, 19 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Susanne knows Brock. Ebony knows Giselle. Kate knows Bart. Bart knows Ebony. Randall knows Arnold. Trina knows Dana. Arnold knows Camden. Bailey knows Jeff. Dana knows Carmen. Bart knows Cassidy. Ernest knows Shelly. Arnold knows Jordan. Shelly knows Bailey. Jordan knows Kenneth. Shelly knows Daphne. Cassidy knows Randall. Dana knows Susanne. Carmen knows Ernest. Which of Bailey and Jordan can Kate reach?", "answer": "Jordan", "steps": [ "Kate knows Bart.", "Bart knows Cassidy.", "Cassidy knows Randall.", "Randall knows Arnold.", "Arnold knows Jordan." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Kate", "Kenneth", "Arnold", "Cassidy", "Randall", "Ebony", "Giselle", "Bart", "Camden", "Jordan", "Trina", "Jeff", "Shelly", "Carmen", "Ernest", "Susanne", "Brock", "Dana", "Daphne", "Bailey" ], "edges": [ [ 0, 7 ], [ 2, 8 ], [ 2, 9 ], [ 3, 4 ], [ 4, 2 ], [ 5, 6 ], [ 7, 5 ], [ 7, 3 ], [ 9, 1 ], [ 10, 17 ], [ 12, 18 ], [ 12, 19 ], [ 13, 14 ], [ 14, 12 ], [ 15, 16 ], [ 17, 15 ], [ 17, 13 ], [ 19, 11 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Laura knows Sybil. Esperanza knows Deanna. Tonya knows Irving. Esperanza knows Keith. Jana knows Roland. Hayden knows Esperanza. Hampton knows Lily. Hampton knows Laura. Keith knows Tonya. Dante knows Hampton. Dante knows Jaime. Winifred knows Dante. Deanna knows Anton. Keith knows Jana. Laura knows Darius. Jaime knows Brent. Lily knows Eldon. Jana knows Zachary. Which of Hampton and Keith can Winifred reach?", "answer": "Hampton", "steps": [ "Winifred knows Dante.", "Dante knows Hampton." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Winifred", "Laura", "Lily", "Hampton", "Darius", "Brent", "Sybil", "Jaime", "Dante", "Eldon", "Hayden", "Jana", "Tonya", "Keith", "Zachary", "Anton", "Roland", "Deanna", "Esperanza", "Irving" ], "edges": [ [ 0, 8 ], [ 1, 4 ], [ 1, 6 ], [ 2, 9 ], [ 3, 1 ], [ 3, 2 ], [ 7, 5 ], [ 8, 7 ], [ 8, 3 ], [ 10, 18 ], [ 11, 14 ], [ 11, 16 ], [ 12, 19 ], [ 13, 11 ], [ 13, 12 ], [ 17, 15 ], [ 18, 17 ], [ 18, 13 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Crystal knows Victor. Guillermo knows Luella. Bette knows Jewel. Renee knows Darcy. Val knows Guillermo. Darcy knows Perry. Martha knows Val. Rhonda knows Catherine. Luella knows Leah. Catherine knows Lucy. Catherine knows Autumn. Victor knows Alfonso. Lucy knows Martin. Martha knows Cruz. Martin knows Bette. Graeme knows Martha. Renee knows Graeme. Crystal knows Rhonda. Which of Bette and Luella can Crystal reach?", "answer": "Bette", "steps": [ "Crystal knows Rhonda.", "Rhonda knows Catherine.", "Catherine knows Lucy.", "Lucy knows Martin.", "Martin knows Bette." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Crystal", "Rhonda", "Martin", "Bette", "Victor", "Lucy", "Jewel", "Catherine", "Autumn", "Alfonso", "Renee", "Graeme", "Guillermo", "Luella", "Darcy", "Val", "Leah", "Martha", "Cruz", "Perry" ], "edges": [ [ 0, 1 ], [ 0, 4 ], [ 1, 7 ], [ 2, 3 ], [ 3, 6 ], [ 4, 9 ], [ 5, 2 ], [ 7, 5 ], [ 7, 8 ], [ 10, 11 ], [ 10, 14 ], [ 11, 17 ], [ 12, 13 ], [ 13, 16 ], [ 14, 19 ], [ 15, 12 ], [ 17, 15 ], [ 17, 18 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Zach knows Jeffery. Magdalena knows Hattie. Myrtle knows Gregory. Myrtle knows Elmer. Goldie knows Electra. Matt knows James. James knows Myrtle. Matt knows Tamara. Clarence knows Deborah. Clarence knows Henrietta. Ernesto knows Clarence. Dave knows Magdalena. Myrtle knows Goldie. Zach knows Ernesto. Ebony knows Leticia. Goldie knows Ebony. Clarence knows Dave. Dave knows Fred. Which of Ebony and Magdalena can Matt reach?", "answer": "Ebony", "steps": [ "Matt knows James.", "James knows Myrtle.", "Myrtle knows Goldie.", "Goldie knows Ebony." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Matt", "Goldie", "James", "Tamara", "Gregory", "Elmer", "Myrtle", "Ebony", "Electra", "Leticia", "Zach", "Dave", "Ernesto", "Jeffery", "Henrietta", "Deborah", "Clarence", "Magdalena", "Fred", "Hattie" ], "edges": [ [ 0, 3 ], [ 0, 2 ], [ 1, 8 ], [ 1, 7 ], [ 2, 6 ], [ 6, 4 ], [ 6, 5 ], [ 6, 1 ], [ 7, 9 ], [ 10, 13 ], [ 10, 12 ], [ 11, 18 ], [ 11, 17 ], [ 12, 16 ], [ 16, 14 ], [ 16, 15 ], [ 16, 11 ], [ 17, 19 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Ashley knows Leon. Ibrahim knows Lillian. Lola knows Ann. Alexa knows Beau. Stacy knows Corinne. Stacy knows Cynthia. Leon knows Marshall. Shane knows Ibrahim. Ann knows Dwight. Corinne knows Cesar. Jane knows Shelly. Corinne knows Eduardo. Ibrahim knows Alexa. Alexa knows Ashley. Margaret knows Shane. Shane knows Jeff. Eduardo knows Jane. Ann knows Stacy. Which of Ann and Shane can Margaret reach?", "answer": "Shane", "steps": [ "Margaret knows Shane." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Margaret", "Leon", "Alexa", "Shane", "Jeff", "Ashley", "Beau", "Marshall", "Ibrahim", "Lillian", "Lola", "Jane", "Corinne", "Ann", "Dwight", "Eduardo", "Cesar", "Shelly", "Stacy", "Cynthia" ], "edges": [ [ 0, 3 ], [ 1, 7 ], [ 2, 6 ], [ 2, 5 ], [ 3, 4 ], [ 3, 8 ], [ 5, 1 ], [ 8, 2 ], [ 8, 9 ], [ 10, 13 ], [ 11, 17 ], [ 12, 16 ], [ 12, 15 ], [ 13, 14 ], [ 13, 18 ], [ 15, 11 ], [ 18, 12 ], [ 18, 19 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Magdalena knows Duncan. Paul knows Claire. Anton knows Frankie. Darla knows Chantal. Conrad knows Dana. Tony knows Leo. Drake knows Anton. Magdalena knows Logan. Chantal knows Jacques. Joshua knows Kara. Nicholas knows Paul. Duncan knows Joshua. Dana knows Darla. Leo knows Drake. Nicholas knows Charlene. Kara knows Conrad. Shelly knows Tony. Claire knows Shelly. Which of Darla and Drake can Nicholas reach?", "answer": "Drake", "steps": [ "Nicholas knows Paul.", "Paul knows Claire.", "Claire knows Shelly.", "Shelly knows Tony.", "Tony knows Leo.", "Leo knows Drake." ], "difficulty": 6, "original_distance": 8, "idx_to_symbol": [ "Nicholas", "Leo", "Charlene", "Frankie", "Paul", "Shelly", "Tony", "Claire", "Drake", "Anton", "Magdalena", "Dana", "Logan", "Jacques", "Duncan", "Kara", "Conrad", "Joshua", "Darla", "Chantal" ], "edges": [ [ 0, 2 ], [ 0, 4 ], [ 1, 8 ], [ 4, 7 ], [ 5, 6 ], [ 6, 1 ], [ 7, 5 ], [ 8, 9 ], [ 9, 3 ], [ 10, 12 ], [ 10, 14 ], [ 11, 18 ], [ 14, 17 ], [ 15, 16 ], [ 16, 11 ], [ 17, 15 ], [ 18, 19 ], [ 19, 13 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Adam knows Callum. Harper knows Charlene. Callum knows Kurt. Lola knows Emery. Adam knows Harper. Susanne knows Peggy. Bryan knows Keith. Graeme knows Rosa. Pedro knows Kieran. Susanne knows Pedro. Keith knows Maureen. Pedro knows Darrell. Adam knows Lola. Susanne knows Luther. Luther knows Bryan. Harper knows Todd. Peggy knows Don. Kurt knows Graeme. Which of Maureen and Rosa can Susanne reach?", "answer": "Maureen", "steps": [ "Susanne knows Luther.", "Luther knows Bryan.", "Bryan knows Keith.", "Keith knows Maureen." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Susanne", "Bryan", "Maureen", "Luther", "Pedro", "Kieran", "Keith", "Don", "Darrell", "Peggy", "Adam", "Kurt", "Rosa", "Callum", "Harper", "Charlene", "Graeme", "Emery", "Todd", "Lola" ], "edges": [ [ 0, 3 ], [ 0, 4 ], [ 0, 9 ], [ 1, 6 ], [ 3, 1 ], [ 4, 5 ], [ 4, 8 ], [ 6, 2 ], [ 9, 7 ], [ 10, 13 ], [ 10, 14 ], [ 10, 19 ], [ 11, 16 ], [ 13, 11 ], [ 14, 15 ], [ 14, 18 ], [ 16, 12 ], [ 19, 17 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Ramon knows Harmony. Jessie knows Ramon. Sierra knows Dell. Jessie knows Sierra. Grace knows Gladys. Jessie knows Alyson. Lamont knows Grace. Roland knows Phoebe. Craig knows Kay. Adelaide knows Michelle. Bert knows Lamont. Sierra knows Roland. Adelaide knows Greer. Dell knows Zach. Greer knows Shane. Phoebe knows Luna. Bert knows Craig. Adelaide knows Bert. Which of Grace and Phoebe can Jessie reach?", "answer": "Phoebe", "steps": [ "Jessie knows Sierra.", "Sierra knows Roland.", "Roland knows Phoebe." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Jessie", "Ramon", "Phoebe", "Zach", "Harmony", "Sierra", "Dell", "Luna", "Roland", "Alyson", "Adelaide", "Greer", "Grace", "Kay", "Shane", "Bert", "Craig", "Gladys", "Lamont", "Michelle" ], "edges": [ [ 0, 1 ], [ 0, 5 ], [ 0, 9 ], [ 1, 4 ], [ 2, 7 ], [ 5, 6 ], [ 5, 8 ], [ 6, 3 ], [ 8, 2 ], [ 10, 11 ], [ 10, 15 ], [ 10, 19 ], [ 11, 14 ], [ 12, 17 ], [ 15, 16 ], [ 15, 18 ], [ 16, 13 ], [ 18, 12 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Loretta knows Dorothy. Eldon knows Daisy. Kristina knows Marc. Dorothy knows Colleen. Naomi knows Jordan. Gareth knows Farrah. Spencer knows Eldon. Gareth knows Spencer. Dorothy knows Kristina. Renee knows Loretta. Tonya knows Naomi. Spencer knows Lennox. Tonya knows Gareth. Harriet knows Aisha. Loretta knows Gage. Spencer knows Dudley. Dorothy knows Lawrence. Renee knows Harriet. Which of Kristina and Eldon can Renee reach?", "answer": "Kristina", "steps": [ "Renee knows Loretta.", "Loretta knows Dorothy.", "Dorothy knows Kristina." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Renee", "Aisha", "Loretta", "Lawrence", "Dorothy", "Gage", "Marc", "Kristina", "Colleen", "Harriet", "Tonya", "Jordan", "Gareth", "Dudley", "Spencer", "Farrah", "Daisy", "Eldon", "Lennox", "Naomi" ], "edges": [ [ 0, 2 ], [ 0, 9 ], [ 2, 5 ], [ 2, 4 ], [ 4, 3 ], [ 4, 7 ], [ 4, 8 ], [ 7, 6 ], [ 9, 1 ], [ 10, 12 ], [ 10, 19 ], [ 12, 15 ], [ 12, 14 ], [ 14, 13 ], [ 14, 17 ], [ 14, 18 ], [ 17, 16 ], [ 19, 11 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Troy knows Cassidy. Susanne knows Ebony. Harmony knows Jaime. Franklin knows Lacey. Matthew knows Amy. Dina knows Susanne. Franklin knows Clark. Sadie knows Matthew. Cassidy knows Dina. Troy knows Sadie. Frank knows Franklin. Justin knows Rocco. Troy knows Gustavo. Franklin knows Michelle. Jaime knows Tyler. Darcy knows Troy. Clark knows Justin. Michelle knows Harmony. Which of Ebony and Tyler can Darcy reach?", "answer": "Ebony", "steps": [ "Darcy knows Troy.", "Troy knows Cassidy.", "Cassidy knows Dina.", "Dina knows Susanne.", "Susanne knows Ebony." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Darcy", "Matthew", "Troy", "Amy", "Ebony", "Dina", "Cassidy", "Sadie", "Gustavo", "Susanne", "Frank", "Justin", "Franklin", "Rocco", "Tyler", "Harmony", "Michelle", "Clark", "Lacey", "Jaime" ], "edges": [ [ 0, 2 ], [ 1, 3 ], [ 2, 7 ], [ 2, 8 ], [ 2, 6 ], [ 5, 9 ], [ 6, 5 ], [ 7, 1 ], [ 9, 4 ], [ 10, 12 ], [ 11, 13 ], [ 12, 17 ], [ 12, 18 ], [ 12, 16 ], [ 15, 19 ], [ 16, 15 ], [ 17, 11 ], [ 19, 14 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Patrick knows Brent. Lena knows Edgar. Leon knows Dustin. Shelby knows Xander. Dominic knows Lena. Monica knows Griffith. Edgar knows Pete. Patrick knows Monica. Everett knows Shelby. Monica knows Erin. Rocco knows Eloise. Xander knows Rocco. Shelby knows Kit. Griffith knows Dominic. Everett knows Brooks. Neville knows Patrick. Hazel knows Everett. Eloise knows Leon. Which of Pete and Dustin can Neville reach?", "answer": "Pete", "steps": [ "Neville knows Patrick.", "Patrick knows Monica.", "Monica knows Griffith.", "Griffith knows Dominic.", "Dominic knows Lena.", "Lena knows Edgar.", "Edgar knows Pete." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Neville", "Pete", "Dominic", "Brent", "Lena", "Griffith", "Monica", "Erin", "Patrick", "Edgar", "Hazel", "Dustin", "Rocco", "Brooks", "Eloise", "Xander", "Shelby", "Kit", "Everett", "Leon" ], "edges": [ [ 0, 8 ], [ 2, 4 ], [ 4, 9 ], [ 5, 2 ], [ 6, 7 ], [ 6, 5 ], [ 8, 3 ], [ 8, 6 ], [ 9, 1 ], [ 10, 18 ], [ 12, 14 ], [ 14, 19 ], [ 15, 12 ], [ 16, 17 ], [ 16, 15 ], [ 18, 13 ], [ 18, 16 ], [ 19, 11 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Dolores knows Lois. Dolores knows Finn. Stella knows Leon. Leon knows Holden. Nash knows Stella. Chantal knows Glen. Ramona knows Fraser. Iris knows Angela. Sydney knows Horace. Horace knows Cora. Finn knows Mara. Finn knows Charlene. Angela knows Fergus. Chantal knows Denver. Denver knows Iris. Lois knows Ramona. Nash knows Chantal. Charlene knows Sydney. Which of Charlene and Denver can Dolores reach?", "answer": "Charlene", "steps": [ "Dolores knows Finn.", "Finn knows Charlene." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Dolores", "Fraser", "Finn", "Charlene", "Mara", "Cora", "Sydney", "Lois", "Ramona", "Horace", "Nash", "Holden", "Chantal", "Denver", "Glen", "Fergus", "Iris", "Stella", "Leon", "Angela" ], "edges": [ [ 0, 7 ], [ 0, 2 ], [ 2, 4 ], [ 2, 3 ], [ 3, 6 ], [ 6, 9 ], [ 7, 8 ], [ 8, 1 ], [ 9, 5 ], [ 10, 17 ], [ 10, 12 ], [ 12, 14 ], [ 12, 13 ], [ 13, 16 ], [ 16, 19 ], [ 17, 18 ], [ 18, 11 ], [ 19, 15 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Harrison knows Yvonne. Yvonne knows Fraser. Lauren knows Maggie. Lorna knows Randall. Laura knows Lauren. Yvonne knows Ainsley. Blake knows Sam. Burt knows Laura. Lola knows Burt. Lauren knows Lewis. Blake knows Aubrey. Lauren knows Darrell. Blake knows Daphna. Fraser knows Dayton. Burt knows Jolena. Burt knows Lorna. Yvonne knows Anton. Ainsley knows Blake. Which of Aubrey and Lewis can Harrison reach?", "answer": "Aubrey", "steps": [ "Harrison knows Yvonne.", "Yvonne knows Ainsley.", "Ainsley knows Blake.", "Blake knows Aubrey." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Harrison", "Ainsley", "Dayton", "Daphna", "Blake", "Aubrey", "Fraser", "Anton", "Yvonne", "Sam", "Lola", "Laura", "Randall", "Maggie", "Lauren", "Lewis", "Lorna", "Jolena", "Burt", "Darrell" ], "edges": [ [ 0, 8 ], [ 1, 4 ], [ 4, 3 ], [ 4, 5 ], [ 4, 9 ], [ 6, 2 ], [ 8, 6 ], [ 8, 7 ], [ 8, 1 ], [ 10, 18 ], [ 11, 14 ], [ 14, 13 ], [ 14, 15 ], [ 14, 19 ], [ 16, 12 ], [ 18, 16 ], [ 18, 17 ], [ 18, 11 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Vivian knows Natalie. Veronica knows Mitchell. Katrina knows Zack. Dalton knows Miranda. Zoe knows Inez. Mitchell knows Jewel. Fred knows Patrick. Vivian knows Katrina. Zack knows Harmony. Shelly knows Vivian. Jessica knows Zoe. Mitchell knows Robin. Jessica knows Bernard. Inez knows Fred. Miranda knows Shelly. Fred knows Veronica. Zack knows Clarence. Dalton knows Dora. Which of Harmony and Robin can Dalton reach?", "answer": "Harmony", "steps": [ "Dalton knows Miranda.", "Miranda knows Shelly.", "Shelly knows Vivian.", "Vivian knows Katrina.", "Katrina knows Zack.", "Zack knows Harmony." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Dalton", "Katrina", "Miranda", "Clarence", "Dora", "Zack", "Harmony", "Vivian", "Shelly", "Natalie", "Jessica", "Veronica", "Zoe", "Jewel", "Bernard", "Mitchell", "Robin", "Fred", "Inez", "Patrick" ], "edges": [ [ 0, 4 ], [ 0, 2 ], [ 1, 5 ], [ 2, 8 ], [ 5, 3 ], [ 5, 6 ], [ 7, 1 ], [ 7, 9 ], [ 8, 7 ], [ 10, 14 ], [ 10, 12 ], [ 11, 15 ], [ 12, 18 ], [ 15, 13 ], [ 15, 16 ], [ 17, 11 ], [ 17, 19 ], [ 18, 17 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Bryan knows Dennis. Peter knows Morgan. Bryan knows Susan. Fred knows Lawson. Peter knows Fred. Morgan knows Cecilia. Percy knows Thea. Nolan knows Willard. Estelle knows Peter. Willard knows Kurt. Percy knows Lamar. Lamar knows Bryan. Raquel knows Percy. Willard knows Estelle. Kurt knows Lennox. Thea knows Malik. Susan knows Claudia. Dennis knows Albert. Which of Dennis and Morgan can Nolan reach?", "answer": "Morgan", "steps": [ "Nolan knows Willard.", "Willard knows Estelle.", "Estelle knows Peter.", "Peter knows Morgan." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Nolan", "Peter", "Lennox", "Kurt", "Cecilia", "Estelle", "Fred", "Morgan", "Lawson", "Willard", "Raquel", "Bryan", "Malik", "Thea", "Albert", "Lamar", "Susan", "Dennis", "Claudia", "Percy" ], "edges": [ [ 0, 9 ], [ 1, 7 ], [ 1, 6 ], [ 3, 2 ], [ 5, 1 ], [ 6, 8 ], [ 7, 4 ], [ 9, 3 ], [ 9, 5 ], [ 10, 19 ], [ 11, 17 ], [ 11, 16 ], [ 13, 12 ], [ 15, 11 ], [ 16, 18 ], [ 17, 14 ], [ 19, 13 ], [ 19, 15 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Robin knows Charlene. Isla knows Deborah. Ember knows Lyric. Ashton knows Robin. Isla knows Fergus. Ember knows Patricia. Ella knows Verna. Charlene knows Frank. Lyric knows Isla. Fergus knows Sheila. Ella knows Gerard. Frank knows Dayton. Frank knows Archer. Gerard knows Ember. Melody knows Pierce. Robin knows Keaton. Melody knows Ashton. Archer knows Caleb. Which of Isla and Frank can Ella reach?", "answer": "Isla", "steps": [ "Ella knows Gerard.", "Gerard knows Ember.", "Ember knows Lyric.", "Lyric knows Isla." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Ella", "Gerard", "Sheila", "Lyric", "Verna", "Fergus", "Deborah", "Patricia", "Isla", "Ember", "Melody", "Ashton", "Caleb", "Charlene", "Pierce", "Archer", "Dayton", "Keaton", "Frank", "Robin" ], "edges": [ [ 0, 4 ], [ 0, 1 ], [ 1, 9 ], [ 3, 8 ], [ 5, 2 ], [ 8, 5 ], [ 8, 6 ], [ 9, 7 ], [ 9, 3 ], [ 10, 14 ], [ 10, 11 ], [ 11, 19 ], [ 13, 18 ], [ 15, 12 ], [ 18, 15 ], [ 18, 16 ], [ 19, 17 ], [ 19, 13 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Courtney knows Jean. Eileen knows Rosa. Fred knows Courtney. Fraser knows Nelson. Courtney knows Julio. Iris knows Eve. Anita knows Erin. Iris knows Anita. Courtney knows Fraser. Iris knows Lambert. Iris knows Francis. Iris knows Eileen. Fred knows Trudy. Courtney knows Essie. Lyric knows Iris. Courtney knows Corey. Lyric knows Hope. Jean knows Nancy. Which of Iris and Courtney can Lyric reach?", "answer": "Iris", "steps": [ "Lyric knows Iris." ], "difficulty": 1, "original_distance": 3, "idx_to_symbol": [ "Lyric", "Francis", "Rosa", "Anita", "Eve", "Eileen", "Erin", "Iris", "Hope", "Lambert", "Fred", "Essie", "Nancy", "Fraser", "Julio", "Jean", "Nelson", "Courtney", "Trudy", "Corey" ], "edges": [ [ 0, 8 ], [ 0, 7 ], [ 3, 6 ], [ 5, 2 ], [ 7, 1 ], [ 7, 4 ], [ 7, 5 ], [ 7, 3 ], [ 7, 9 ], [ 10, 18 ], [ 10, 17 ], [ 13, 16 ], [ 15, 12 ], [ 17, 11 ], [ 17, 14 ], [ 17, 15 ], [ 17, 13 ], [ 17, 19 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Adelaide knows Robin. Wilson knows Roger. Roger knows Joaquin. Rufus knows Joanna. Oliver knows Xander. Oliver knows Maureen. Isaac knows Wilson. Wilson knows Federico. Emily knows Rufus. Wilson knows Jeremiah. Emily knows Oliver. Wilson knows Katherine. Oliver knows Adelaide. Isaac knows Preston. Oliver knows Amanda. Preston knows Eli. Roger knows Clark. Adelaide knows Shawn. Which of Clark and Robin can Isaac reach?", "answer": "Clark", "steps": [ "Isaac knows Wilson.", "Wilson knows Roger.", "Roger knows Clark." ], "difficulty": 3, "original_distance": 3, "idx_to_symbol": [ "Isaac", "Joaquin", "Eli", "Katherine", "Federico", "Clark", "Jeremiah", "Wilson", "Preston", "Roger", "Emily", "Shawn", "Joanna", "Amanda", "Maureen", "Robin", "Xander", "Oliver", "Rufus", "Adelaide" ], "edges": [ [ 0, 8 ], [ 0, 7 ], [ 7, 3 ], [ 7, 4 ], [ 7, 6 ], [ 7, 9 ], [ 8, 2 ], [ 9, 1 ], [ 9, 5 ], [ 10, 18 ], [ 10, 17 ], [ 17, 13 ], [ 17, 14 ], [ 17, 16 ], [ 17, 19 ], [ 18, 12 ], [ 19, 11 ], [ 19, 15 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Francis knows Kenneth. Frank knows Emanuel. Brian knows Erik. Mara knows Leah. Seth knows Beatrice. Frank knows Leigh. Allan knows Mabel. Adele knows Frank. Allan knows Tyler. Emanuel knows Francis. Mabel knows Seth. Leigh knows Amy. Tyler knows Brian. Jackson knows Jodi. Sierra knows Jackson. Amy knows Heather. Jodi knows Allan. Leah knows Adele. Which of Brian and Francis can Mara reach?", "answer": "Francis", "steps": [ "Mara knows Leah.", "Leah knows Adele.", "Adele knows Frank.", "Frank knows Emanuel.", "Emanuel knows Francis." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Mara", "Leigh", "Francis", "Heather", "Emanuel", "Amy", "Leah", "Frank", "Kenneth", "Adele", "Sierra", "Mabel", "Brian", "Beatrice", "Tyler", "Seth", "Jackson", "Allan", "Erik", "Jodi" ], "edges": [ [ 0, 6 ], [ 1, 5 ], [ 2, 8 ], [ 4, 2 ], [ 5, 3 ], [ 6, 9 ], [ 7, 1 ], [ 7, 4 ], [ 9, 7 ], [ 10, 16 ], [ 11, 15 ], [ 12, 18 ], [ 14, 12 ], [ 15, 13 ], [ 16, 19 ], [ 17, 11 ], [ 17, 14 ], [ 19, 17 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Camille knows Trina. Ember knows Benjamin. Clarissa knows Foster. Ember knows Camille. Trina knows Marion. John knows Whitney. Alfonso knows Chloe. Richard knows Rachel. Whitney knows Drew. Benjamin knows Lois. Carter knows John. Chester knows Owen. Foster knows Richard. Chester knows Kirsten. Foster knows Ember. Owen knows Susanne. John knows Chester. Kirsten knows Alfonso. Which of Trina and Alfonso can Carter reach?", "answer": "Alfonso", "steps": [ "Carter knows John.", "John knows Chester.", "Chester knows Kirsten.", "Kirsten knows Alfonso." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Carter", "Chloe", "Chester", "John", "Alfonso", "Whitney", "Kirsten", "Drew", "Susanne", "Owen", "Clarissa", "Marion", "Ember", "Foster", "Trina", "Richard", "Camille", "Rachel", "Lois", "Benjamin" ], "edges": [ [ 0, 3 ], [ 2, 6 ], [ 2, 9 ], [ 3, 5 ], [ 3, 2 ], [ 4, 1 ], [ 5, 7 ], [ 6, 4 ], [ 9, 8 ], [ 10, 13 ], [ 12, 16 ], [ 12, 19 ], [ 13, 15 ], [ 13, 12 ], [ 14, 11 ], [ 15, 17 ], [ 16, 14 ], [ 19, 18 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Duncan knows Clarence. Hector knows Kenneth. Clarence knows Holly. Elton knows Essie. Holly knows Florence. Conner knows Rufus. Chase knows Heather. Peggy knows Layla. Jermaine knows Chase. Dudley knows Duncan. Essie knows Megan. Duncan knows Tamara. Rufus knows Peggy. Florence knows Jermaine. Kenneth knows Elton. Randy knows Hector. Rufus knows Randy. Tamara knows Alyssa. Which of Clarence and Randy can Dudley reach?", "answer": "Clarence", "steps": [ "Dudley knows Duncan.", "Duncan knows Clarence." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Dudley", "Chase", "Alyssa", "Tamara", "Florence", "Holly", "Clarence", "Heather", "Duncan", "Jermaine", "Conner", "Essie", "Layla", "Peggy", "Kenneth", "Hector", "Randy", "Megan", "Rufus", "Elton" ], "edges": [ [ 0, 8 ], [ 1, 7 ], [ 3, 2 ], [ 4, 9 ], [ 5, 4 ], [ 6, 5 ], [ 8, 3 ], [ 8, 6 ], [ 9, 1 ], [ 10, 18 ], [ 11, 17 ], [ 13, 12 ], [ 14, 19 ], [ 15, 14 ], [ 16, 15 ], [ 18, 13 ], [ 18, 16 ], [ 19, 11 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Langston knows Robert. Frida knows Clark. Belinda knows Dora. Bella knows Frida. Kelsey knows Ebony. Devon knows Trudy. Gail knows Ira. Dora knows Langston. Rachel knows Alyssa. Robert knows Autumn. Hampton knows Rachel. Rachel knows Janet. Alyssa knows Erwin. Kelsey knows Devon. Langston knows Hampton. Layla knows Bella. Frida knows Gail. Clark knows Kelsey. Which of Trudy and Erwin can Belinda reach?", "answer": "Erwin", "steps": [ "Belinda knows Dora.", "Dora knows Langston.", "Langston knows Hampton.", "Hampton knows Rachel.", "Rachel knows Alyssa.", "Alyssa knows Erwin." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Belinda", "Hampton", "Autumn", "Rachel", "Alyssa", "Janet", "Langston", "Dora", "Robert", "Erwin", "Layla", "Clark", "Ira", "Kelsey", "Devon", "Ebony", "Frida", "Bella", "Gail", "Trudy" ], "edges": [ [ 0, 7 ], [ 1, 3 ], [ 3, 5 ], [ 3, 4 ], [ 4, 9 ], [ 6, 8 ], [ 6, 1 ], [ 7, 6 ], [ 8, 2 ], [ 10, 17 ], [ 11, 13 ], [ 13, 15 ], [ 13, 14 ], [ 14, 19 ], [ 16, 18 ], [ 16, 11 ], [ 17, 16 ], [ 18, 12 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Estella knows Israel. Percy knows Cornelius. Rocco knows Ralph. Sam knows Cooper. Estella knows Percy. Graham knows Basil. Cooper knows Graham. Herman knows Clark. Dalton knows Herman. Cornelius knows Ursula. Basil knows Camille. Sam knows Rocco. Herman knows Don. Dalton knows Estella. Cooper knows Monica. Darin knows Sam. Rocco knows Adelaide. Bonnie knows Dalton. Which of Basil and Cornelius can Bonnie reach?", "answer": "Cornelius", "steps": [ "Bonnie knows Dalton.", "Dalton knows Estella.", "Estella knows Percy.", "Percy knows Cornelius." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Bonnie", "Don", "Cornelius", "Ursula", "Dalton", "Herman", "Percy", "Estella", "Clark", "Israel", "Darin", "Ralph", "Basil", "Camille", "Sam", "Rocco", "Graham", "Cooper", "Adelaide", "Monica" ], "edges": [ [ 0, 4 ], [ 2, 3 ], [ 4, 5 ], [ 4, 7 ], [ 5, 1 ], [ 5, 8 ], [ 6, 2 ], [ 7, 6 ], [ 7, 9 ], [ 10, 14 ], [ 12, 13 ], [ 14, 15 ], [ 14, 17 ], [ 15, 11 ], [ 15, 18 ], [ 16, 12 ], [ 17, 16 ], [ 17, 19 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Fern knows Darla. Greta knows Virgil. Ann knows Leroy. Keaton knows Barry. Greta knows Ann. Ann knows Eamon. Leroy knows Jose. Eli knows Kate. Edison knows Harper. Lars knows Fern. Harper knows Roland. Kate knows Edison. Ann knows Justin. Keaton knows Eli. Eli knows Daphne. Justin knows Lars. Daphne knows Taylor. Eli knows Reed. Which of Ann and Eli can Greta reach?", "answer": "Ann", "steps": [ "Greta knows Ann." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Greta", "Lars", "Ann", "Virgil", "Jose", "Eamon", "Leroy", "Justin", "Fern", "Darla", "Keaton", "Edison", "Eli", "Barry", "Taylor", "Reed", "Daphne", "Kate", "Harper", "Roland" ], "edges": [ [ 0, 3 ], [ 0, 2 ], [ 1, 8 ], [ 2, 5 ], [ 2, 6 ], [ 2, 7 ], [ 6, 4 ], [ 7, 1 ], [ 8, 9 ], [ 10, 13 ], [ 10, 12 ], [ 11, 18 ], [ 12, 15 ], [ 12, 16 ], [ 12, 17 ], [ 16, 14 ], [ 17, 11 ], [ 18, 19 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Pauline knows Eunice. Abigail knows Dolly. Carson knows Maya. Keira knows Joshua. Gwen knows Keira. Natalie knows Greer. Sally knows Carson. Eunice knows Natalie. Dolly knows Dorian. Joshua knows Janet. Gwen knows Harlan. Caroline knows Ilene. Brad knows Warren. Janet knows Caroline. Pauline knows Amelia. Ilene knows Sally. Warren knows Abigail. Greer knows Brad. Which of Dorian and Maya can Gwen reach?", "answer": "Maya", "steps": [ "Gwen knows Keira.", "Keira knows Joshua.", "Joshua knows Janet.", "Janet knows Caroline.", "Caroline knows Ilene.", "Ilene knows Sally.", "Sally knows Carson.", "Carson knows Maya." ], "difficulty": 8, "original_distance": 8, "idx_to_symbol": [ "Gwen", "Joshua", "Harlan", "Carson", "Maya", "Keira", "Caroline", "Janet", "Ilene", "Sally", "Pauline", "Natalie", "Amelia", "Dolly", "Dorian", "Eunice", "Brad", "Greer", "Warren", "Abigail" ], "edges": [ [ 0, 2 ], [ 0, 5 ], [ 1, 7 ], [ 3, 4 ], [ 5, 1 ], [ 6, 8 ], [ 7, 6 ], [ 8, 9 ], [ 9, 3 ], [ 10, 12 ], [ 10, 15 ], [ 11, 17 ], [ 13, 14 ], [ 15, 11 ], [ 16, 18 ], [ 17, 16 ], [ 18, 19 ], [ 19, 13 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Harris knows Ainsley. Franklin knows Raquel. Brian knows Daniella. Larissa knows Milo. Landon knows Susan. Willis knows Charlene. Charlene knows Graham. Clayton knows Brian. Harris knows Hector. Clayton knows Larissa. Hector knows Gwen. Graham knows Bennett. Ainsley knows Freya. Charlene knows Franklin. Gwen knows Clayton. Landon knows Lisette. Lisette knows Lorraine. Susan knows Willis. Which of Bennett and Milo can Harris reach?", "answer": "Milo", "steps": [ "Harris knows Hector.", "Hector knows Gwen.", "Gwen knows Clayton.", "Clayton knows Larissa.", "Larissa knows Milo." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Harris", "Brian", "Milo", "Freya", "Daniella", "Hector", "Clayton", "Ainsley", "Larissa", "Gwen", "Landon", "Franklin", "Bennett", "Lorraine", "Raquel", "Susan", "Charlene", "Lisette", "Graham", "Willis" ], "edges": [ [ 0, 7 ], [ 0, 5 ], [ 1, 4 ], [ 5, 9 ], [ 6, 1 ], [ 6, 8 ], [ 7, 3 ], [ 8, 2 ], [ 9, 6 ], [ 10, 17 ], [ 10, 15 ], [ 11, 14 ], [ 15, 19 ], [ 16, 11 ], [ 16, 18 ], [ 17, 13 ], [ 18, 12 ], [ 19, 16 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Hattie knows Edgar. Naomi knows Darcy. Haley knows Zara. Hattie knows Denver. Hattie knows Haley. Humphrey knows Jake. Hank knows Joel. Edison knows Pedro. Pedro knows Clayton. Pedro knows Naomi. Naomi knows Hank. Zara knows Arlene. Edgar knows Wesley. Gregory knows Kurt. Edgar knows Gregory. Jake knows Leroy. Pedro knows Humphrey. Marlene knows Hattie. Which of Kurt and Joel can Edison reach?", "answer": "Joel", "steps": [ "Edison knows Pedro.", "Pedro knows Naomi.", "Naomi knows Hank.", "Hank knows Joel." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Edison", "Clayton", "Naomi", "Hank", "Leroy", "Joel", "Darcy", "Pedro", "Jake", "Humphrey", "Marlene", "Denver", "Edgar", "Gregory", "Arlene", "Kurt", "Wesley", "Hattie", "Zara", "Haley" ], "edges": [ [ 0, 7 ], [ 2, 3 ], [ 2, 6 ], [ 3, 5 ], [ 7, 1 ], [ 7, 2 ], [ 7, 9 ], [ 8, 4 ], [ 9, 8 ], [ 10, 17 ], [ 12, 13 ], [ 12, 16 ], [ 13, 15 ], [ 17, 11 ], [ 17, 12 ], [ 17, 19 ], [ 18, 14 ], [ 19, 18 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Gilbert knows Kenzie. Carter knows Lee. Tom knows Leigh. Leon knows Jackson. Carter knows Samuel. Georgia knows Carter. Lucas knows Charlotte. Leigh knows Leon. Leon knows Elodie. Gilbert knows Craig. Rick knows Gilbert. Gilbert knows Angela. Samuel knows Aldo. Angela knows Tom. Carter knows Shane. Mark knows Lucas. Lucas knows Howard. Aldo knows Mark. Which of Gilbert and Carter can Georgia reach?", "answer": "Carter", "steps": [ "Georgia knows Carter." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Georgia", "Samuel", "Lucas", "Charlotte", "Aldo", "Howard", "Mark", "Carter", "Shane", "Lee", "Rick", "Angela", "Leon", "Jackson", "Tom", "Elodie", "Leigh", "Gilbert", "Kenzie", "Craig" ], "edges": [ [ 0, 7 ], [ 1, 4 ], [ 2, 3 ], [ 2, 5 ], [ 4, 6 ], [ 6, 2 ], [ 7, 1 ], [ 7, 8 ], [ 7, 9 ], [ 10, 17 ], [ 11, 14 ], [ 12, 13 ], [ 12, 15 ], [ 14, 16 ], [ 16, 12 ], [ 17, 11 ], [ 17, 18 ], [ 17, 19 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Lorraine knows Hampton. Eve knows Electra. Charles knows Winston. Elaine knows Ember. Julio knows Lorraine. Ember knows Judy. Everett knows Isadora. Francis knows Karina. Ross knows Eve. Clayton knows Charles. India knows Jared. Francis knows Emily. Karina knows Darnell. India knows Clayton. Winston knows Everett. Electra knows Julio. Isadora knows Elaine. Darnell knows Ross. Which of Ross and Winston can India reach?", "answer": "Winston", "steps": [ "India knows Clayton.", "Clayton knows Charles.", "Charles knows Winston." ], "difficulty": 3, "original_distance": 8, "idx_to_symbol": [ "India", "Ember", "Everett", "Winston", "Judy", "Jared", "Elaine", "Charles", "Isadora", "Clayton", "Francis", "Lorraine", "Eve", "Ross", "Hampton", "Emily", "Julio", "Darnell", "Electra", "Karina" ], "edges": [ [ 0, 5 ], [ 0, 9 ], [ 1, 4 ], [ 2, 8 ], [ 3, 2 ], [ 6, 1 ], [ 7, 3 ], [ 8, 6 ], [ 9, 7 ], [ 10, 15 ], [ 10, 19 ], [ 11, 14 ], [ 12, 18 ], [ 13, 12 ], [ 16, 11 ], [ 17, 13 ], [ 18, 16 ], [ 19, 17 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Erin knows Brock. Isabel knows Terry. Trudy knows Gwen. Jameson knows Trudy. Terry knows Mabel. Yolanda knows Hadley. Jacqueline knows Zach. Jacqueline knows Yolanda. Hadley knows Isabel. Russ knows Cody. Hadley knows Erin. Jacqueline knows Rex. Gwen knows Judith. Victor knows Lee. Victor knows Fabian. Jameson knows Russ. Victor knows Brandon. Lee knows Jameson. Which of Gwen and Terry can Jacqueline reach?", "answer": "Terry", "steps": [ "Jacqueline knows Yolanda.", "Yolanda knows Hadley.", "Hadley knows Isabel.", "Isabel knows Terry." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Jacqueline", "Mabel", "Terry", "Hadley", "Yolanda", "Rex", "Erin", "Brock", "Zach", "Isabel", "Victor", "Judith", "Gwen", "Jameson", "Lee", "Brandon", "Russ", "Cody", "Fabian", "Trudy" ], "edges": [ [ 0, 5 ], [ 0, 8 ], [ 0, 4 ], [ 2, 1 ], [ 3, 6 ], [ 3, 9 ], [ 4, 3 ], [ 6, 7 ], [ 9, 2 ], [ 10, 15 ], [ 10, 18 ], [ 10, 14 ], [ 12, 11 ], [ 13, 16 ], [ 13, 19 ], [ 14, 13 ], [ 16, 17 ], [ 19, 12 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Valerie knows Malcolm. Virgil knows Ava. Vincent knows Nora. Valerie knows Alicia. Nora knows Jacques. Alicia knows Vincent. Alicia knows Eugenia. Ava knows Lauren. Malcolm knows Tyler. Virgil knows Ember. Cameron knows Ivan. Warren knows Cameron. Malcolm knows Caleb. Cameron knows Peggy. Lauren knows Forrest. Warren knows Virgil. Jacques knows Leah. Forrest knows Gerard. Which of Lauren and Nora can Warren reach?", "answer": "Lauren", "steps": [ "Warren knows Virgil.", "Virgil knows Ava.", "Ava knows Lauren." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Warren", "Ember", "Ava", "Peggy", "Gerard", "Lauren", "Cameron", "Forrest", "Ivan", "Virgil", "Valerie", "Eugenia", "Vincent", "Caleb", "Leah", "Nora", "Malcolm", "Jacques", "Tyler", "Alicia" ], "edges": [ [ 0, 6 ], [ 0, 9 ], [ 2, 5 ], [ 5, 7 ], [ 6, 3 ], [ 6, 8 ], [ 7, 4 ], [ 9, 1 ], [ 9, 2 ], [ 10, 16 ], [ 10, 19 ], [ 12, 15 ], [ 15, 17 ], [ 16, 13 ], [ 16, 18 ], [ 17, 14 ], [ 19, 11 ], [ 19, 12 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Troy knows Cassidy. Susanne knows Ebony. Harmony knows Jaime. Franklin knows Lacey. Matthew knows Amy. Dina knows Susanne. Franklin knows Clark. Sadie knows Matthew. Cassidy knows Dina. Troy knows Sadie. Frank knows Franklin. Justin knows Rocco. Troy knows Gustavo. Franklin knows Michelle. Jaime knows Tyler. Darcy knows Troy. Clark knows Justin. Michelle knows Harmony. Which of Susanne and Jaime can Darcy reach?", "answer": "Susanne", "steps": [ "Darcy knows Troy.", "Troy knows Cassidy.", "Cassidy knows Dina.", "Dina knows Susanne." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Darcy", "Matthew", "Troy", "Amy", "Ebony", "Dina", "Cassidy", "Sadie", "Gustavo", "Susanne", "Frank", "Justin", "Franklin", "Rocco", "Tyler", "Harmony", "Michelle", "Clark", "Lacey", "Jaime" ], "edges": [ [ 0, 2 ], [ 1, 3 ], [ 2, 7 ], [ 2, 8 ], [ 2, 6 ], [ 5, 9 ], [ 6, 5 ], [ 7, 1 ], [ 9, 4 ], [ 10, 12 ], [ 11, 13 ], [ 12, 17 ], [ 12, 18 ], [ 12, 16 ], [ 15, 19 ], [ 16, 15 ], [ 17, 11 ], [ 19, 14 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Francis knows Kenneth. Frank knows Emanuel. Brian knows Erik. Mara knows Leah. Seth knows Beatrice. Frank knows Leigh. Allan knows Mabel. Adele knows Frank. Allan knows Tyler. Emanuel knows Francis. Mabel knows Seth. Leigh knows Amy. Tyler knows Brian. Jackson knows Jodi. Sierra knows Jackson. Amy knows Heather. Jodi knows Allan. Leah knows Adele. Which of Adele and Jodi can Mara reach?", "answer": "Adele", "steps": [ "Mara knows Leah.", "Leah knows Adele." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Mara", "Leigh", "Francis", "Heather", "Emanuel", "Amy", "Leah", "Frank", "Kenneth", "Adele", "Sierra", "Mabel", "Brian", "Beatrice", "Tyler", "Seth", "Jackson", "Allan", "Erik", "Jodi" ], "edges": [ [ 0, 6 ], [ 1, 5 ], [ 2, 8 ], [ 4, 2 ], [ 5, 3 ], [ 6, 9 ], [ 7, 1 ], [ 7, 4 ], [ 9, 7 ], [ 10, 16 ], [ 11, 15 ], [ 12, 18 ], [ 14, 12 ], [ 15, 13 ], [ 16, 19 ], [ 17, 11 ], [ 17, 14 ], [ 19, 17 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Hugh knows Amy. Virginia knows Claudia. Max knows Homer. Homer knows Pat. Claudia knows Stephen. Ella knows Hugh. Amy knows Lily. Kit knows William. Edison knows Allan. Max knows Randall. Randall knows Edison. Claudia knows Ella. Lily knows Bernice. Kit knows Hannah. Maria knows Kit. Bob knows Holden. Hugh knows Bob. Hannah knows Max. Which of Randall and Amy can Virginia reach?", "answer": "Amy", "steps": [ "Virginia knows Claudia.", "Claudia knows Ella.", "Ella knows Hugh.", "Hugh knows Amy." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Virginia", "Ella", "Claudia", "Amy", "Holden", "Bernice", "Hugh", "Bob", "Stephen", "Lily", "Maria", "Hannah", "Kit", "Randall", "Pat", "Allan", "Max", "Homer", "William", "Edison" ], "edges": [ [ 0, 2 ], [ 1, 6 ], [ 2, 8 ], [ 2, 1 ], [ 3, 9 ], [ 6, 7 ], [ 6, 3 ], [ 7, 4 ], [ 9, 5 ], [ 10, 12 ], [ 11, 16 ], [ 12, 18 ], [ 12, 11 ], [ 13, 19 ], [ 16, 17 ], [ 16, 13 ], [ 17, 14 ], [ 19, 15 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Lola knows Mark. Val knows Nathan. Aaron knows Ada. Ada knows Val. Hayden knows Ashley. Judith knows Hayden. Joel knows Lola. Brooke knows Julian. Greg knows Becky. Becky knows Cesar. Iris knows Jolena. Iris knows Gerald. Hayden knows Boyd. Mark knows Iris. Lola knows Kathleen. Kathleen knows Greg. Julian knows Judith. Julian knows Aaron. Which of Greg and Ada can Brooke reach?", "answer": "Ada", "steps": [ "Brooke knows Julian.", "Julian knows Aaron.", "Aaron knows Ada." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Brooke", "Ada", "Boyd", "Aaron", "Nathan", "Julian", "Judith", "Hayden", "Ashley", "Val", "Joel", "Greg", "Gerald", "Kathleen", "Cesar", "Lola", "Mark", "Iris", "Jolena", "Becky" ], "edges": [ [ 0, 5 ], [ 1, 9 ], [ 3, 1 ], [ 5, 6 ], [ 5, 3 ], [ 6, 7 ], [ 7, 2 ], [ 7, 8 ], [ 9, 4 ], [ 10, 15 ], [ 11, 19 ], [ 13, 11 ], [ 15, 16 ], [ 15, 13 ], [ 16, 17 ], [ 17, 12 ], [ 17, 18 ], [ 19, 14 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Ray knows Cornelius. Brian knows Rick. Ashley knows Joaquin. Alyson knows Willard. Fred knows Brooks. Aubrey knows Ashley. Ray knows Marion. Brooks knows Aria. Ray knows Hayden. Aubrey knows Alyson. Aubrey knows Brian. Brian knows Darius. Bruce knows Virgil. Bruce knows Ray. Virgil knows June. Willard knows Brynn. Brian knows Dick. Bruce knows Fred. Which of Brooks and Willard can Bruce reach?", "answer": "Brooks", "steps": [ "Bruce knows Fred.", "Fred knows Brooks." ], "difficulty": 2, "original_distance": 3, "idx_to_symbol": [ "Bruce", "Brooks", "Hayden", "Marion", "Aria", "Cornelius", "Virgil", "Ray", "June", "Fred", "Aubrey", "Willard", "Darius", "Dick", "Brynn", "Rick", "Ashley", "Brian", "Joaquin", "Alyson" ], "edges": [ [ 0, 7 ], [ 0, 6 ], [ 0, 9 ], [ 1, 4 ], [ 6, 8 ], [ 7, 2 ], [ 7, 3 ], [ 7, 5 ], [ 9, 1 ], [ 10, 17 ], [ 10, 16 ], [ 10, 19 ], [ 11, 14 ], [ 16, 18 ], [ 17, 12 ], [ 17, 13 ], [ 17, 15 ], [ 19, 11 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Emanuel knows Joshua. Zach knows Agnes. Axel knows Aaron. Lars knows Constance. Emanuel knows Oscar. Zach knows Don. Leonard knows Dixie. Zach knows Daphna. Philip knows Zach. Agnes knows Axel. Emanuel knows Whitney. Oscar knows Karen. Karen knows Tiffany. Lennox knows Leonard. Whitney knows Lennox. Roger knows Lars. Daphna knows Roger. Iris knows Emanuel. Which of Constance and Dixie can Philip reach?", "answer": "Constance", "steps": [ "Philip knows Zach.", "Zach knows Daphna.", "Daphna knows Roger.", "Roger knows Lars.", "Lars knows Constance." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Philip", "Roger", "Aaron", "Don", "Daphna", "Zach", "Axel", "Lars", "Constance", "Agnes", "Iris", "Lennox", "Tiffany", "Joshua", "Whitney", "Emanuel", "Karen", "Leonard", "Dixie", "Oscar" ], "edges": [ [ 0, 5 ], [ 1, 7 ], [ 4, 1 ], [ 5, 3 ], [ 5, 4 ], [ 5, 9 ], [ 6, 2 ], [ 7, 8 ], [ 9, 6 ], [ 10, 15 ], [ 11, 17 ], [ 14, 11 ], [ 15, 13 ], [ 15, 14 ], [ 15, 19 ], [ 16, 12 ], [ 17, 18 ], [ 19, 16 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Justine knows Autumn. Dewey knows Joshua. Rita knows Theodore. Rita knows Jason. Ann knows Alicia. Dewey knows Tony. Evelyn knows Gail. Ann knows Adam. Adam knows Hilda. Lorna knows Tristan. Logan knows Fanny. Justine knows Evelyn. Rita knows Lorna. Lorna knows Dewey. Tony knows Kelly. Jason knows Zara. Ann knows Logan. Logan knows Justine. Which of Lorna and Logan can Rita reach?", "answer": "Lorna", "steps": [ "Rita knows Lorna." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Rita", "Dewey", "Lorna", "Tony", "Jason", "Theodore", "Joshua", "Tristan", "Zara", "Kelly", "Ann", "Justine", "Logan", "Evelyn", "Adam", "Alicia", "Autumn", "Fanny", "Hilda", "Gail" ], "edges": [ [ 0, 5 ], [ 0, 4 ], [ 0, 2 ], [ 1, 6 ], [ 1, 3 ], [ 2, 7 ], [ 2, 1 ], [ 3, 9 ], [ 4, 8 ], [ 10, 15 ], [ 10, 14 ], [ 10, 12 ], [ 11, 16 ], [ 11, 13 ], [ 12, 17 ], [ 12, 11 ], [ 13, 19 ], [ 14, 18 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Brian knows Alvin. Daphna knows Jenny. Alvin knows Morris. Kylie knows Clay. Clay knows Heidi. Joyce knows Tristan. Louise knows William. Heidi knows Brandon. Randall knows Kylie. Noel knows Winston. Jenny knows Randall. Fisher knows Finn. Heidi knows Jonathan. Finn knows Noel. Joyce knows Brian. Winston knows Dolores. Jonathan knows Louise. Dolores knows Joyce. Which of Morris and William can Fisher reach?", "answer": "Morris", "steps": [ "Fisher knows Finn.", "Finn knows Noel.", "Noel knows Winston.", "Winston knows Dolores.", "Dolores knows Joyce.", "Joyce knows Brian.", "Brian knows Alvin.", "Alvin knows Morris." ], "difficulty": 8, "original_distance": 8, "idx_to_symbol": [ "Fisher", "Winston", "Tristan", "Finn", "Noel", "Morris", "Joyce", "Alvin", "Dolores", "Brian", "Daphna", "Kylie", "Brandon", "Jenny", "Randall", "William", "Heidi", "Louise", "Clay", "Jonathan" ], "edges": [ [ 0, 3 ], [ 1, 8 ], [ 3, 4 ], [ 4, 1 ], [ 6, 2 ], [ 6, 9 ], [ 7, 5 ], [ 8, 6 ], [ 9, 7 ], [ 10, 13 ], [ 11, 18 ], [ 13, 14 ], [ 14, 11 ], [ 16, 12 ], [ 16, 19 ], [ 17, 15 ], [ 18, 16 ], [ 19, 17 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Lucia knows Melody. Celia knows Willard. Melody knows Kareem. Eunice knows Edmund. Jeff knows Winston. Eunice knows Marilyn. Eunice knows Conrad. Cordelia knows Celia. Conrad knows Lucia. Kareem knows Alex. Malcolm knows Chance. Winston knows Charlotte. Edmund knows Malcolm. Leah knows Jeff. Judy knows Cordelia. Willard knows Arden. Leah knows Marcus. Leah knows Judy. Which of Lucia and Cordelia can Leah reach?", "answer": "Cordelia", "steps": [ "Leah knows Judy.", "Judy knows Cordelia." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Leah", "Jeff", "Winston", "Charlotte", "Marcus", "Judy", "Willard", "Cordelia", "Arden", "Celia", "Eunice", "Edmund", "Malcolm", "Chance", "Marilyn", "Conrad", "Kareem", "Lucia", "Alex", "Melody" ], "edges": [ [ 0, 1 ], [ 0, 4 ], [ 0, 5 ], [ 1, 2 ], [ 2, 3 ], [ 5, 7 ], [ 6, 8 ], [ 7, 9 ], [ 9, 6 ], [ 10, 11 ], [ 10, 14 ], [ 10, 15 ], [ 11, 12 ], [ 12, 13 ], [ 15, 17 ], [ 16, 18 ], [ 17, 19 ], [ 19, 16 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Henry knows Juan. Isiah knows Henry. Emmett knows Chantal. Daniella knows Theodore. Eamon knows Heath. Glenn knows Zack. Daniella knows Karl. Victor knows Daniella. Chantal knows Whitney. Barbara knows Emmett. Eamon knows Grace. Nelson knows Isabel. Isiah knows Victor. Daniella knows Kennedy. Whitney knows Eamon. Isabel knows Isiah. Eamon knows Joaquin. Chantal knows Glenn. Which of Emmett and Isabel can Nelson reach?", "answer": "Isabel", "steps": [ "Nelson knows Isabel." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Nelson", "Juan", "Victor", "Isiah", "Theodore", "Kennedy", "Henry", "Isabel", "Daniella", "Karl", "Barbara", "Zack", "Whitney", "Chantal", "Joaquin", "Heath", "Glenn", "Emmett", "Eamon", "Grace" ], "edges": [ [ 0, 7 ], [ 2, 8 ], [ 3, 6 ], [ 3, 2 ], [ 6, 1 ], [ 7, 3 ], [ 8, 4 ], [ 8, 5 ], [ 8, 9 ], [ 10, 17 ], [ 12, 18 ], [ 13, 16 ], [ 13, 12 ], [ 16, 11 ], [ 17, 13 ], [ 18, 14 ], [ 18, 15 ], [ 18, 19 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Owen knows Zara. Shawn knows Lyric. Shawn knows Gail. Steve knows Tessa. Pedro knows Shawn. Zara knows Shelby. Emanuel knows Dolly. Zara knows Steve. Jem knows Mia. Helen knows Gina. Selena knows Nadine. Ursula knows Merle. Jem knows Selena. Owen knows Emanuel. Emanuel knows Jaime. Helen knows Owen. Ursula knows Pedro. Pedro knows Jem. Which of Jem and Zara can Ursula reach?", "answer": "Jem", "steps": [ "Ursula knows Pedro.", "Pedro knows Jem." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Ursula", "Merle", "Lyric", "Pedro", "Mia", "Nadine", "Shawn", "Jem", "Selena", "Gail", "Helen", "Gina", "Dolly", "Owen", "Shelby", "Tessa", "Emanuel", "Zara", "Steve", "Jaime" ], "edges": [ [ 0, 1 ], [ 0, 3 ], [ 3, 7 ], [ 3, 6 ], [ 6, 2 ], [ 6, 9 ], [ 7, 4 ], [ 7, 8 ], [ 8, 5 ], [ 10, 11 ], [ 10, 13 ], [ 13, 17 ], [ 13, 16 ], [ 16, 12 ], [ 16, 19 ], [ 17, 14 ], [ 17, 18 ], [ 18, 15 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Fiona knows Damian. Henrietta knows Dorian. Jude knows Faye. Vernon knows Callum. Hugo knows Yolanda. Jude knows Ivan. Hugo knows Jason. Jason knows Eugenia. Martha knows Hugo. Hugo knows Hardy. Faye knows Boyd. Rocco knows Alfred. Jude knows Craig. Dorian knows Jude. Vernon knows Martha. Martha knows Fiona. Dorian knows Rocco. Henrietta knows Kobe. Which of Dorian and Martha can Henrietta reach?", "answer": "Dorian", "steps": [ "Henrietta knows Dorian." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Henrietta", "Ivan", "Rocco", "Faye", "Alfred", "Jude", "Boyd", "Craig", "Kobe", "Dorian", "Vernon", "Hardy", "Fiona", "Jason", "Damian", "Hugo", "Eugenia", "Yolanda", "Callum", "Martha" ], "edges": [ [ 0, 8 ], [ 0, 9 ], [ 2, 4 ], [ 3, 6 ], [ 5, 1 ], [ 5, 3 ], [ 5, 7 ], [ 9, 2 ], [ 9, 5 ], [ 10, 18 ], [ 10, 19 ], [ 12, 14 ], [ 13, 16 ], [ 15, 11 ], [ 15, 13 ], [ 15, 17 ], [ 19, 12 ], [ 19, 15 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Leland knows Janice. Langston knows Damian. Langston knows Edmund. Edmund knows Lauren. Andrea knows Todd. Janice knows Lars. Patrick knows Sydney. Cornelius knows Doris. Janice knows Andrea. Cornelius knows Wilbur. Patrick knows Horace. Graeme knows Dana. Doris knows Enid. Sydney knows Leland. Lars knows Marie. Wilbur knows Graeme. Lauren knows Cornelius. Todd knows Hank. Which of Andrea and Wilbur can Langston reach?", "answer": "Wilbur", "steps": [ "Langston knows Edmund.", "Edmund knows Lauren.", "Lauren knows Cornelius.", "Cornelius knows Wilbur." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Langston", "Enid", "Dana", "Damian", "Doris", "Wilbur", "Cornelius", "Graeme", "Lauren", "Edmund", "Patrick", "Marie", "Hank", "Horace", "Lars", "Andrea", "Janice", "Todd", "Leland", "Sydney" ], "edges": [ [ 0, 3 ], [ 0, 9 ], [ 4, 1 ], [ 5, 7 ], [ 6, 4 ], [ 6, 5 ], [ 7, 2 ], [ 8, 6 ], [ 9, 8 ], [ 10, 13 ], [ 10, 19 ], [ 14, 11 ], [ 15, 17 ], [ 16, 14 ], [ 16, 15 ], [ 17, 12 ], [ 18, 16 ], [ 19, 18 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Sarah knows Kobe. Ivy knows Earl. Hannah knows Bill. Joaquin knows Harold. Kobe knows Kathleen. Bill knows Curtis. Brent knows Vicki. Earl knows Theodore. Matt knows Wilbur. Tonya knows Erin. Callum knows Ivy. Theodore knows Joaquin. Hannah knows Doug. Erin knows Sarah. Brent knows Matt. Molly knows Tonya. Callum knows Brent. Molly knows Hannah. Which of Harold and Kathleen can Molly reach?", "answer": "Kathleen", "steps": [ "Molly knows Tonya.", "Tonya knows Erin.", "Erin knows Sarah.", "Sarah knows Kobe.", "Kobe knows Kathleen." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Molly", "Sarah", "Curtis", "Doug", "Kathleen", "Kobe", "Bill", "Tonya", "Hannah", "Erin", "Callum", "Theodore", "Wilbur", "Vicki", "Harold", "Joaquin", "Matt", "Ivy", "Brent", "Earl" ], "edges": [ [ 0, 8 ], [ 0, 7 ], [ 1, 5 ], [ 5, 4 ], [ 6, 2 ], [ 7, 9 ], [ 8, 3 ], [ 8, 6 ], [ 9, 1 ], [ 10, 18 ], [ 10, 17 ], [ 11, 15 ], [ 15, 14 ], [ 16, 12 ], [ 17, 19 ], [ 18, 13 ], [ 18, 16 ], [ 19, 11 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Earle knows Sybil. Sierra knows Earle. Sierra knows Lyle. Anita knows Chad. Anita knows Alyson. Sally knows Roman. Priscilla knows Damien. Jacob knows Anita. Sally knows Earl. Priscilla knows Bette. Sally knows Tony. Evelyn knows Calvin. Bert knows Priscilla. Jacob knows Bert. Calvin knows Sierra. Evelyn knows Sally. Bette knows Larissa. Anita knows Mark. Which of Priscilla and Sierra can Evelyn reach?", "answer": "Sierra", "steps": [ "Evelyn knows Calvin.", "Calvin knows Sierra." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Evelyn", "Sierra", "Sally", "Roman", "Sybil", "Calvin", "Earle", "Tony", "Lyle", "Earl", "Jacob", "Priscilla", "Anita", "Alyson", "Larissa", "Bert", "Bette", "Mark", "Damien", "Chad" ], "edges": [ [ 0, 5 ], [ 0, 2 ], [ 1, 6 ], [ 1, 8 ], [ 2, 3 ], [ 2, 7 ], [ 2, 9 ], [ 5, 1 ], [ 6, 4 ], [ 10, 15 ], [ 10, 12 ], [ 11, 16 ], [ 11, 18 ], [ 12, 13 ], [ 12, 17 ], [ 12, 19 ], [ 15, 11 ], [ 16, 14 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Omar knows Beth. Geraldine knows Scott. Lawrence knows Ralph. Desmond knows Burt. Burt knows Kobe. Burt knows Pierce. Isabel knows Lola. Scott knows Nora. Hayes knows Riley. Rex knows Conner. Scott knows Omar. Ralph knows Isabel. Kobe knows Geraldine. Ralph knows Ramon. Hayes knows Rex. Kobe knows Harry. Isabel knows Helene. Helene knows Hayes. Which of Burt and Ralph can Lawrence reach?", "answer": "Ralph", "steps": [ "Lawrence knows Ralph." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Lawrence", "Conner", "Isabel", "Rex", "Hayes", "Ramon", "Riley", "Lola", "Helene", "Ralph", "Desmond", "Beth", "Kobe", "Omar", "Scott", "Pierce", "Nora", "Harry", "Geraldine", "Burt" ], "edges": [ [ 0, 9 ], [ 2, 7 ], [ 2, 8 ], [ 3, 1 ], [ 4, 3 ], [ 4, 6 ], [ 8, 4 ], [ 9, 5 ], [ 9, 2 ], [ 10, 19 ], [ 12, 17 ], [ 12, 18 ], [ 13, 11 ], [ 14, 13 ], [ 14, 16 ], [ 18, 14 ], [ 19, 15 ], [ 19, 12 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "James knows Boyd. Adelaide knows Clinton. Drew knows Dorothy. Jakob knows James. Adelaide knows Kurt. Brody knows Kai. Russ knows Renee. Aaron knows Adelaide. Drew knows Pete. Cynthia knows Jakob. Renee knows Lisette. Nora knows Brody. Rex knows Chelsea. Kai knows Cynthia. Chelsea knows Aaron. Lisette knows Rhonda. Rhonda knows Rex. Boyd knows Drew. Which of Kai and Lisette can Nora reach?", "answer": "Kai", "steps": [ "Nora knows Brody.", "Brody knows Kai." ], "difficulty": 2, "original_distance": 8, "idx_to_symbol": [ "Nora", "James", "Drew", "Dorothy", "Jakob", "Kai", "Brody", "Boyd", "Pete", "Cynthia", "Russ", "Chelsea", "Adelaide", "Kurt", "Rex", "Lisette", "Renee", "Aaron", "Clinton", "Rhonda" ], "edges": [ [ 0, 6 ], [ 1, 7 ], [ 2, 3 ], [ 2, 8 ], [ 4, 1 ], [ 5, 9 ], [ 6, 5 ], [ 7, 2 ], [ 9, 4 ], [ 10, 16 ], [ 11, 17 ], [ 12, 13 ], [ 12, 18 ], [ 14, 11 ], [ 15, 19 ], [ 16, 15 ], [ 17, 12 ], [ 19, 14 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Quinn knows Kristina. Ava knows Rufus. Bette knows Raymond. Ava knows Anita. Fanny knows Nicole. Janice knows Vivian. Janice knows Enid. Janice knows Quinn. Rufus knows Fanny. Nicole knows Enrique. Madeline knows Griffith. Kristina knows Edith. Ava knows Bette. Enid knows Anton. Glenda knows Madeline. Edith knows Glenda. Enrique knows Jonathan. Jonathan knows Dahlia. Which of Glenda and Enrique can Ava reach?", "answer": "Enrique", "steps": [ "Ava knows Rufus.", "Rufus knows Fanny.", "Fanny knows Nicole.", "Nicole knows Enrique." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Ava", "Raymond", "Dahlia", "Jonathan", "Enrique", "Rufus", "Bette", "Nicole", "Anita", "Fanny", "Janice", "Anton", "Griffith", "Madeline", "Glenda", "Quinn", "Enid", "Edith", "Vivian", "Kristina" ], "edges": [ [ 0, 6 ], [ 0, 8 ], [ 0, 5 ], [ 3, 2 ], [ 4, 3 ], [ 5, 9 ], [ 6, 1 ], [ 7, 4 ], [ 9, 7 ], [ 10, 16 ], [ 10, 18 ], [ 10, 15 ], [ 13, 12 ], [ 14, 13 ], [ 15, 19 ], [ 16, 11 ], [ 17, 14 ], [ 19, 17 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Verna knows August. Ben knows Cristina. Warren knows Celia. Jacqueline knows Keira. Sara knows Byron. Jacqueline knows Daphne. Byron knows Verna. Ben knows Dewey. Byron knows Jacqueline. Emery knows Warren. Emery knows Ben. Aisha knows Tara. Lucille knows Aisha. Jacqueline knows Marie. Marie knows Itzel. Itzel knows Rebecca. Ben knows Lucille. Calvin knows Emery. Which of Aisha and Itzel can Calvin reach?", "answer": "Aisha", "steps": [ "Calvin knows Emery.", "Emery knows Ben.", "Ben knows Lucille.", "Lucille knows Aisha." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Calvin", "Dewey", "Celia", "Cristina", "Aisha", "Warren", "Emery", "Tara", "Lucille", "Ben", "Sara", "Keira", "August", "Daphne", "Itzel", "Verna", "Byron", "Rebecca", "Marie", "Jacqueline" ], "edges": [ [ 0, 6 ], [ 4, 7 ], [ 5, 2 ], [ 6, 5 ], [ 6, 9 ], [ 8, 4 ], [ 9, 1 ], [ 9, 3 ], [ 9, 8 ], [ 10, 16 ], [ 14, 17 ], [ 15, 12 ], [ 16, 15 ], [ 16, 19 ], [ 18, 14 ], [ 19, 11 ], [ 19, 13 ], [ 19, 18 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Lana knows Hayley. Mildred knows Mitchell. Arlene knows Davis. Arden knows Agnes. Angela knows Lana. Hayley knows Hunter. Charlotte knows Adrian. Karl knows Marco. Fanny knows Arden. Effie knows Angela. Mitchell knows Wayne. Angela knows Brody. Effie knows Charlotte. Mildred knows Arlene. Charlotte knows Jakob. Adrian knows April. Arlene knows Fanny. Mitchell knows Karl. Which of Lana and Fanny can Effie reach?", "answer": "Lana", "steps": [ "Effie knows Angela.", "Angela knows Lana." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Effie", "Angela", "Jakob", "Lana", "Charlotte", "Hayley", "Brody", "Adrian", "Hunter", "April", "Mildred", "Arlene", "Wayne", "Fanny", "Mitchell", "Arden", "Davis", "Karl", "Agnes", "Marco" ], "edges": [ [ 0, 1 ], [ 0, 4 ], [ 1, 6 ], [ 1, 3 ], [ 3, 5 ], [ 4, 2 ], [ 4, 7 ], [ 5, 8 ], [ 7, 9 ], [ 10, 11 ], [ 10, 14 ], [ 11, 16 ], [ 11, 13 ], [ 13, 15 ], [ 14, 12 ], [ 14, 17 ], [ 15, 18 ], [ 17, 19 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Alan knows Lena. Gerard knows Hunter. Hunter knows Maureen. Dawn knows Marlene. Keith knows Hank. Hank knows Emery. Keith knows Clinton. Gerard knows Ben. Darla knows Nell. Eli knows Marian. Eli knows Gerard. Lilia knows Ashton. Nell knows Dawn. Ben knows Zach. Lilia knows Keith. Lena knows Ariana. Zach knows Alan. Clinton knows Darla. Which of Marlene and Ariana can Eli reach?", "answer": "Ariana", "steps": [ "Eli knows Gerard.", "Gerard knows Ben.", "Ben knows Zach.", "Zach knows Alan.", "Alan knows Lena.", "Lena knows Ariana." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Eli", "Alan", "Lena", "Ben", "Maureen", "Hunter", "Marian", "Ariana", "Gerard", "Zach", "Lilia", "Nell", "Dawn", "Clinton", "Emery", "Hank", "Ashton", "Marlene", "Keith", "Darla" ], "edges": [ [ 0, 6 ], [ 0, 8 ], [ 1, 2 ], [ 2, 7 ], [ 3, 9 ], [ 5, 4 ], [ 8, 5 ], [ 8, 3 ], [ 9, 1 ], [ 10, 16 ], [ 10, 18 ], [ 11, 12 ], [ 12, 17 ], [ 13, 19 ], [ 15, 14 ], [ 18, 15 ], [ 18, 13 ], [ 19, 11 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Khashayar knows Luis. Anton knows Bob. Darwin knows Anton. Luis knows Valerie. Elsa knows Lacey. Warren knows Desmond. Claudia knows Khashayar. Judith knows Claudia. Luis knows Ruby. Jack knows Elsa. Desmond knows Darwin. Lacey knows Dahlia. Ibrahim knows Asher. Darwin knows Jack. Lacey knows Gertrude. Asher knows Judith. Judith knows Aubrey. Aubrey knows Kate. Which of Elsa and Khashayar can Warren reach?", "answer": "Elsa", "steps": [ "Warren knows Desmond.", "Desmond knows Darwin.", "Darwin knows Jack.", "Jack knows Elsa." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Warren", "Desmond", "Gertrude", "Elsa", "Anton", "Lacey", "Darwin", "Dahlia", "Bob", "Jack", "Ibrahim", "Asher", "Valerie", "Khashayar", "Aubrey", "Luis", "Judith", "Ruby", "Kate", "Claudia" ], "edges": [ [ 0, 1 ], [ 1, 6 ], [ 3, 5 ], [ 4, 8 ], [ 5, 2 ], [ 5, 7 ], [ 6, 4 ], [ 6, 9 ], [ 9, 3 ], [ 10, 11 ], [ 11, 16 ], [ 13, 15 ], [ 14, 18 ], [ 15, 12 ], [ 15, 17 ], [ 16, 14 ], [ 16, 19 ], [ 19, 13 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Daniel knows Cora. Kaleb knows Cindy. Cindy knows Jocelyn. Floyd knows Rex. Carmen knows Daniel. Beverly knows Grady. Frankie knows Belinda. Carmen knows Zane. Frankie knows Kaleb. Wanda knows Mack. Belinda knows Wanda. Eunice knows Itzel. Itzel knows Floyd. Kaleb knows Vivian. Itzel knows Dexter. Belinda knows Beverly. Eunice knows Carmen. Dexter knows Sonia. Which of Cora and Jocelyn can Eunice reach?", "answer": "Cora", "steps": [ "Eunice knows Carmen.", "Carmen knows Daniel.", "Daniel knows Cora." ], "difficulty": 3, "original_distance": 3, "idx_to_symbol": [ "Eunice", "Carmen", "Itzel", "Dexter", "Cora", "Floyd", "Sonia", "Zane", "Rex", "Daniel", "Frankie", "Kaleb", "Belinda", "Beverly", "Jocelyn", "Wanda", "Grady", "Vivian", "Mack", "Cindy" ], "edges": [ [ 0, 2 ], [ 0, 1 ], [ 1, 7 ], [ 1, 9 ], [ 2, 3 ], [ 2, 5 ], [ 3, 6 ], [ 5, 8 ], [ 9, 4 ], [ 10, 12 ], [ 10, 11 ], [ 11, 17 ], [ 11, 19 ], [ 12, 13 ], [ 12, 15 ], [ 13, 16 ], [ 15, 18 ], [ 19, 14 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Nicholas knows Elsa. Joaquin knows Allen. Fiona knows Joyce. Fiona knows Pablo. Kathleen knows Claudia. Claudia knows Hilda. Peter knows Ashley. Lana knows Alfonso. Yvonne knows Nicholas. Dwight knows Greg. Kathleen knows Lana. Joyce knows Dwight. Yvonne knows Kathleen. Hilda knows Marshall. Claudia knows Jerry. Pablo knows Vicki. Joyce knows Peter. Dwight knows Joaquin. Which of Joaquin and Hilda can Fiona reach?", "answer": "Joaquin", "steps": [ "Fiona knows Joyce.", "Joyce knows Dwight.", "Dwight knows Joaquin." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Fiona", "Ashley", "Dwight", "Pablo", "Vicki", "Joyce", "Joaquin", "Greg", "Peter", "Allen", "Yvonne", "Alfonso", "Claudia", "Nicholas", "Elsa", "Kathleen", "Hilda", "Jerry", "Lana", "Marshall" ], "edges": [ [ 0, 3 ], [ 0, 5 ], [ 2, 7 ], [ 2, 6 ], [ 3, 4 ], [ 5, 8 ], [ 5, 2 ], [ 6, 9 ], [ 8, 1 ], [ 10, 13 ], [ 10, 15 ], [ 12, 17 ], [ 12, 16 ], [ 13, 14 ], [ 15, 18 ], [ 15, 12 ], [ 16, 19 ], [ 18, 11 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Candice knows Levi. Ariel knows Candice. Devon knows Todd. Devon knows Marshall. Alexa knows Jasmine. Albert knows Kingsley. Erin knows Faye. Sadie knows Kyle. Sadie knows Kira. Sadie knows Alexa. Alexa knows April. Lorenzo knows Reed. Faye knows Chance. Ariel knows Devon. Devon knows Lorenzo. Lorenzo knows Albert. Erin knows Sadie. Jasmine knows Clarissa. Which of Alexa and Lorenzo can Ariel reach?", "answer": "Lorenzo", "steps": [ "Ariel knows Devon.", "Devon knows Lorenzo." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Ariel", "Kingsley", "Lorenzo", "Candice", "Levi", "Albert", "Todd", "Reed", "Marshall", "Devon", "Erin", "Clarissa", "Alexa", "Faye", "Chance", "Jasmine", "Kyle", "April", "Kira", "Sadie" ], "edges": [ [ 0, 3 ], [ 0, 9 ], [ 2, 5 ], [ 2, 7 ], [ 3, 4 ], [ 5, 1 ], [ 9, 6 ], [ 9, 2 ], [ 9, 8 ], [ 10, 13 ], [ 10, 19 ], [ 12, 15 ], [ 12, 17 ], [ 13, 14 ], [ 15, 11 ], [ 19, 16 ], [ 19, 12 ], [ 19, 18 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Alan knows Lena. Gerard knows Hunter. Hunter knows Maureen. Dawn knows Marlene. Keith knows Hank. Hank knows Emery. Keith knows Clinton. Gerard knows Ben. Darla knows Nell. Eli knows Marian. Eli knows Gerard. Lilia knows Ashton. Nell knows Dawn. Ben knows Zach. Lilia knows Keith. Lena knows Ariana. Zach knows Alan. Clinton knows Darla. Which of Keith and Gerard can Eli reach?", "answer": "Gerard", "steps": [ "Eli knows Gerard." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Eli", "Alan", "Lena", "Ben", "Maureen", "Hunter", "Marian", "Ariana", "Gerard", "Zach", "Lilia", "Nell", "Dawn", "Clinton", "Emery", "Hank", "Ashton", "Marlene", "Keith", "Darla" ], "edges": [ [ 0, 6 ], [ 0, 8 ], [ 1, 2 ], [ 2, 7 ], [ 3, 9 ], [ 5, 4 ], [ 8, 5 ], [ 8, 3 ], [ 9, 1 ], [ 10, 16 ], [ 10, 18 ], [ 11, 12 ], [ 12, 17 ], [ 13, 19 ], [ 15, 14 ], [ 18, 15 ], [ 18, 13 ], [ 19, 11 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Cruz knows Shelby. Shelby knows Kit. Jake knows Jerome. Jake knows Nina. Wade knows Sue. Shelby knows Nancy. Sue knows Jake. Sue knows Jermaine. Lyric knows Gladys. Percy knows Eamon. Jermaine knows Lyric. Rex knows Eunice. Rex knows Kane. Eamon knows Gloria. Gloria knows Cruz. Juan knows Wade. Gloria knows Rex. Lyric knows Antonio. Which of Wade and Eamon can Juan reach?", "answer": "Wade", "steps": [ "Juan knows Wade." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Juan", "Jake", "Jermaine", "Lyric", "Wade", "Nina", "Jerome", "Sue", "Gladys", "Antonio", "Percy", "Rex", "Cruz", "Shelby", "Eamon", "Kane", "Eunice", "Gloria", "Kit", "Nancy" ], "edges": [ [ 0, 4 ], [ 1, 5 ], [ 1, 6 ], [ 2, 3 ], [ 3, 8 ], [ 3, 9 ], [ 4, 7 ], [ 7, 1 ], [ 7, 2 ], [ 10, 14 ], [ 11, 15 ], [ 11, 16 ], [ 12, 13 ], [ 13, 18 ], [ 13, 19 ], [ 14, 17 ], [ 17, 11 ], [ 17, 12 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Joanna knows Earle. Rhonda knows Katherine. Greta knows Rhonda. Jean knows Judy. Katherine knows Daniel. Francesca knows Greta. Daniel knows Scott. Daniel knows Yvonne. Kay knows Joanna. Jack knows Cesar. Yvonne knows Janice. Judy knows Emanuel. Earle knows Cain. Judy knows Axel. Cain knows Tonya. Cesar knows Francesca. Tonya knows Jean. Emanuel knows Ariana. Which of Ariana and Janice can Jack reach?", "answer": "Janice", "steps": [ "Jack knows Cesar.", "Cesar knows Francesca.", "Francesca knows Greta.", "Greta knows Rhonda.", "Rhonda knows Katherine.", "Katherine knows Daniel.", "Daniel knows Yvonne.", "Yvonne knows Janice." ], "difficulty": 8, "original_distance": 8, "idx_to_symbol": [ "Jack", "Greta", "Cesar", "Scott", "Katherine", "Yvonne", "Janice", "Daniel", "Francesca", "Rhonda", "Kay", "Cain", "Joanna", "Axel", "Jean", "Emanuel", "Ariana", "Judy", "Earle", "Tonya" ], "edges": [ [ 0, 2 ], [ 1, 9 ], [ 2, 8 ], [ 4, 7 ], [ 5, 6 ], [ 7, 3 ], [ 7, 5 ], [ 8, 1 ], [ 9, 4 ], [ 10, 12 ], [ 11, 19 ], [ 12, 18 ], [ 14, 17 ], [ 15, 16 ], [ 17, 13 ], [ 17, 15 ], [ 18, 11 ], [ 19, 14 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Ellen knows Jenna. Essie knows Sybil. Lynn knows Todd. Leopold knows Hugh. Todd knows Dina. Emery knows Ellen. Emery knows Luke. Milton knows Essie. Joan knows Milton. Shelby knows Joan. Milton knows Leopold. Joan knows Travis. Todd knows Fern. Shelby knows Lois. Ellen knows Lynn. Essie knows Pearl. Rufus knows Garrison. Lynn knows Rufus. Which of Essie and Todd can Shelby reach?", "answer": "Essie", "steps": [ "Shelby knows Joan.", "Joan knows Milton.", "Milton knows Essie." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Shelby", "Hugh", "Milton", "Joan", "Travis", "Sybil", "Pearl", "Lois", "Essie", "Leopold", "Emery", "Garrison", "Lynn", "Ellen", "Jenna", "Fern", "Dina", "Luke", "Todd", "Rufus" ], "edges": [ [ 0, 7 ], [ 0, 3 ], [ 2, 8 ], [ 2, 9 ], [ 3, 4 ], [ 3, 2 ], [ 8, 5 ], [ 8, 6 ], [ 9, 1 ], [ 10, 17 ], [ 10, 13 ], [ 12, 18 ], [ 12, 19 ], [ 13, 14 ], [ 13, 12 ], [ 18, 15 ], [ 18, 16 ], [ 19, 11 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "August knows Nora. Beau knows Jennifer. Jennifer knows Sandra. Ariel knows Aria. Tracy knows Beau. Tracy knows Wilma. Mae knows Priscilla. Sandra knows Gina. Evelyn knows Cruz. Evelyn knows Beth. Mae knows Ariel. Wilma knows August. Delia knows Penny. Chester knows Leon. Cruz knows Mae. August knows Delia. Beth knows Vanessa. Vanessa knows Chester. Which of Aria and Penny can Tracy reach?", "answer": "Penny", "steps": [ "Tracy knows Wilma.", "Wilma knows August.", "August knows Delia.", "Delia knows Penny." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Tracy", "Gina", "Jennifer", "Wilma", "Delia", "Penny", "Sandra", "August", "Beau", "Nora", "Evelyn", "Leon", "Vanessa", "Cruz", "Ariel", "Aria", "Chester", "Mae", "Beth", "Priscilla" ], "edges": [ [ 0, 8 ], [ 0, 3 ], [ 2, 6 ], [ 3, 7 ], [ 4, 5 ], [ 6, 1 ], [ 7, 4 ], [ 7, 9 ], [ 8, 2 ], [ 10, 18 ], [ 10, 13 ], [ 12, 16 ], [ 13, 17 ], [ 14, 15 ], [ 16, 11 ], [ 17, 14 ], [ 17, 19 ], [ 18, 12 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Hannah knows Sheila. Chandler knows Enrique. Penny knows Chandler. Chandler knows Eloise. Dina knows Sonia. Wilma knows Jessie. Jessie knows Dina. Dina knows Dominic. Raquel knows Hannah. Penny knows Eduardo. Jessie knows Joseph. Yolanda knows William. Wilma knows Virgil. Thomas knows Raquel. Eduardo knows Merle. William knows Wilma. Hannah knows Penny. Joseph knows Ariana. Which of Wilma and Hannah can Thomas reach?", "answer": "Hannah", "steps": [ "Thomas knows Raquel.", "Raquel knows Hannah." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Thomas", "Sheila", "Hannah", "Chandler", "Penny", "Merle", "Enrique", "Raquel", "Eloise", "Eduardo", "Yolanda", "Virgil", "Wilma", "Dina", "Jessie", "Ariana", "Dominic", "William", "Sonia", "Joseph" ], "edges": [ [ 0, 7 ], [ 2, 1 ], [ 2, 4 ], [ 3, 6 ], [ 3, 8 ], [ 4, 3 ], [ 4, 9 ], [ 7, 2 ], [ 9, 5 ], [ 10, 17 ], [ 12, 11 ], [ 12, 14 ], [ 13, 16 ], [ 13, 18 ], [ 14, 13 ], [ 14, 19 ], [ 17, 12 ], [ 19, 15 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Xavier knows Gus. Teresa knows Abel. Bruce knows Louisa. Darla knows Atlas. Lily knows William. Dell knows Emma. Eugenia knows Teresa. Luz knows Rod. Atlas knows Lily. Nolan knows Howard. Donovan knows Nolan. Nolan knows Darla. Bruce knows Hattie. Dante knows Eugenia. Hattie knows Donovan. Rod knows Xavier. Xavier knows Dante. Dell knows Luz. Which of Luz and Hattie can Dell reach?", "answer": "Luz", "steps": [ "Dell knows Luz." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Dell", "Teresa", "Abel", "Emma", "Rod", "Luz", "Dante", "Eugenia", "Xavier", "Gus", "Bruce", "Lily", "William", "Louisa", "Donovan", "Hattie", "Darla", "Atlas", "Nolan", "Howard" ], "edges": [ [ 0, 3 ], [ 0, 5 ], [ 1, 2 ], [ 4, 8 ], [ 5, 4 ], [ 6, 7 ], [ 7, 1 ], [ 8, 6 ], [ 8, 9 ], [ 10, 13 ], [ 10, 15 ], [ 11, 12 ], [ 14, 18 ], [ 15, 14 ], [ 16, 17 ], [ 17, 11 ], [ 18, 16 ], [ 18, 19 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Tessa knows Patricia. Tessa knows Camille. Cody knows Declan. Frida knows Joseph. Grant knows Samuel. Itzel knows Grant. Frida knows Travis. Declan knows Lamont. Clifford knows Kara. Joseph knows Ernesto. Samuel knows Cody. Frida knows Lyle. Travis knows Matt. Kara knows Frida. Yvette knows Clifford. Cody knows Demetrius. Cody knows Tessa. Joseph knows Dawn. Which of Kara and Samuel can Yvette reach?", "answer": "Kara", "steps": [ "Yvette knows Clifford.", "Clifford knows Kara." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Yvette", "Clifford", "Joseph", "Matt", "Dawn", "Ernesto", "Frida", "Kara", "Lyle", "Travis", "Itzel", "Grant", "Tessa", "Lamont", "Patricia", "Camille", "Cody", "Samuel", "Demetrius", "Declan" ], "edges": [ [ 0, 1 ], [ 1, 7 ], [ 2, 4 ], [ 2, 5 ], [ 6, 2 ], [ 6, 8 ], [ 6, 9 ], [ 7, 6 ], [ 9, 3 ], [ 10, 11 ], [ 11, 17 ], [ 12, 14 ], [ 12, 15 ], [ 16, 12 ], [ 16, 18 ], [ 16, 19 ], [ 17, 16 ], [ 19, 13 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Abel knows Fiona. Rosemary knows Annette. Trevor knows Archie. Geraldine knows Aubrey. Fiona knows Jamie. Archie knows Abel. Ken knows Trevor. Jamie knows Jorge. Thea knows Stefan. Dell knows Valerie. Archie knows Geraldine. Valerie knows Ford. Rosemary knows Porter. Stefan knows Rosemary. Annette knows Bernadette. Bernadette knows Edith. Porter knows Dell. Aubrey knows Fern. Which of Jorge and Ford can Thea reach?", "answer": "Ford", "steps": [ "Thea knows Stefan.", "Stefan knows Rosemary.", "Rosemary knows Porter.", "Porter knows Dell.", "Dell knows Valerie.", "Valerie knows Ford." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Thea", "Valerie", "Edith", "Porter", "Bernadette", "Rosemary", "Stefan", "Dell", "Annette", "Ford", "Ken", "Jamie", "Fern", "Abel", "Aubrey", "Archie", "Trevor", "Fiona", "Geraldine", "Jorge" ], "edges": [ [ 0, 6 ], [ 1, 9 ], [ 3, 7 ], [ 4, 2 ], [ 5, 8 ], [ 5, 3 ], [ 6, 5 ], [ 7, 1 ], [ 8, 4 ], [ 10, 16 ], [ 11, 19 ], [ 13, 17 ], [ 14, 12 ], [ 15, 18 ], [ 15, 13 ], [ 16, 15 ], [ 17, 11 ], [ 18, 14 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Charlotte knows Celia. Fred knows Brody. Brody knows Jillian. Chester knows Spencer. Brenda knows Alyson. Darnell knows Kim. Celia knows Ross. Gail knows India. Spencer knows Ivan. Sidney knows Archer. Archer knows Gail. Ivan knows Luke. Dorothy knows Darnell. Kim knows Erma. Charlotte knows Fred. India knows Brenda. Ross knows Dorothy. Chester knows Sidney. Which of Darnell and India can Chester reach?", "answer": "India", "steps": [ "Chester knows Sidney.", "Sidney knows Archer.", "Archer knows Gail.", "Gail knows India." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Chester", "Luke", "India", "Spencer", "Archer", "Alyson", "Gail", "Ivan", "Brenda", "Sidney", "Charlotte", "Jillian", "Darnell", "Fred", "Ross", "Erma", "Dorothy", "Brody", "Kim", "Celia" ], "edges": [ [ 0, 3 ], [ 0, 9 ], [ 2, 8 ], [ 3, 7 ], [ 4, 6 ], [ 6, 2 ], [ 7, 1 ], [ 8, 5 ], [ 9, 4 ], [ 10, 13 ], [ 10, 19 ], [ 12, 18 ], [ 13, 17 ], [ 14, 16 ], [ 16, 12 ], [ 17, 11 ], [ 18, 15 ], [ 19, 14 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Fern knows Jacques. Dalton knows Larry. Jacques knows Adrian. Elliot knows Harris. Belinda knows Frances. Belinda knows Noah. Ivan knows Fern. Larry knows Yolanda. Imogen knows Dalton. Frances knows Keira. Fiona knows Kerry. Damian knows Belinda. Zelda knows Imogen. Kerry knows Zelda. Yolanda knows Don. Adrian knows Damian. Larry knows Elliot. Noah knows Joseph. Which of Fern and Kerry can Fiona reach?", "answer": "Kerry", "steps": [ "Fiona knows Kerry." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Fiona", "Larry", "Kerry", "Harris", "Don", "Elliot", "Dalton", "Imogen", "Zelda", "Yolanda", "Ivan", "Belinda", "Fern", "Keira", "Joseph", "Frances", "Damian", "Adrian", "Jacques", "Noah" ], "edges": [ [ 0, 2 ], [ 1, 5 ], [ 1, 9 ], [ 2, 8 ], [ 5, 3 ], [ 6, 1 ], [ 7, 6 ], [ 8, 7 ], [ 9, 4 ], [ 10, 12 ], [ 11, 15 ], [ 11, 19 ], [ 12, 18 ], [ 15, 13 ], [ 16, 11 ], [ 17, 16 ], [ 18, 17 ], [ 19, 14 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Eli knows Mia. Etta knows Bridget. Etta knows Howard. Theodore knows Etta. Melissa knows Hank. Melissa knows Eli. Melissa knows Lydia. Lydia knows Erik. Gus knows Ivan. Luz knows Herbert. Eli knows Luz. Demetrius knows Fletcher. Demetrius knows Gus. Luz knows Imogen. Theodore knows Seth. Demetrius knows Theodore. Theodore knows Camden. Eli knows Frances. Which of Etta and Luz can Melissa reach?", "answer": "Luz", "steps": [ "Melissa knows Eli.", "Eli knows Luz." ], "difficulty": 2, "original_distance": 3, "idx_to_symbol": [ "Melissa", "Hank", "Imogen", "Herbert", "Mia", "Frances", "Luz", "Lydia", "Erik", "Eli", "Demetrius", "Fletcher", "Howard", "Bridget", "Seth", "Camden", "Etta", "Gus", "Ivan", "Theodore" ], "edges": [ [ 0, 1 ], [ 0, 7 ], [ 0, 9 ], [ 6, 2 ], [ 6, 3 ], [ 7, 8 ], [ 9, 4 ], [ 9, 5 ], [ 9, 6 ], [ 10, 11 ], [ 10, 17 ], [ 10, 19 ], [ 16, 12 ], [ 16, 13 ], [ 17, 18 ], [ 19, 14 ], [ 19, 15 ], [ 19, 16 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Chase knows Electra. Susanne knows Roger. Felicia knows Chase. Miriam knows Gareth. Roman knows Hannah. Yolanda knows Susanne. Kay knows Bob. Roger knows Carl. Felicia knows Lacey. Laverne knows Felicia. Kay knows Blanche. Roger knows Kay. Hannah knows Yolanda. Roger knows Jeff. Heather knows Laverne. Felicia knows Ruby. Gareth knows Heather. Chase knows Ada. Which of Blanche and Ada can Roman reach?", "answer": "Blanche", "steps": [ "Roman knows Hannah.", "Hannah knows Yolanda.", "Yolanda knows Susanne.", "Susanne knows Roger.", "Roger knows Kay.", "Kay knows Blanche." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Roman", "Bob", "Kay", "Carl", "Blanche", "Yolanda", "Roger", "Jeff", "Susanne", "Hannah", "Miriam", "Electra", "Chase", "Lacey", "Ada", "Heather", "Felicia", "Ruby", "Laverne", "Gareth" ], "edges": [ [ 0, 9 ], [ 2, 1 ], [ 2, 4 ], [ 5, 8 ], [ 6, 3 ], [ 6, 2 ], [ 6, 7 ], [ 8, 6 ], [ 9, 5 ], [ 10, 19 ], [ 12, 11 ], [ 12, 14 ], [ 15, 18 ], [ 16, 13 ], [ 16, 12 ], [ 16, 17 ], [ 18, 16 ], [ 19, 15 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Eden knows Viola. Marilyn knows Val. Eden knows Wanda. William knows Gwen. Hope knows Estella. Ella knows Dora. Colin knows Demetrius. Dora knows Marilyn. Hope knows Eden. Earle knows Hope. Jonah knows Colin. Marilyn knows Porter. Demetrius knows Ella. Pearl knows Earle. Harris knows Pearl. Dora knows William. Estella knows Cameron. Corinne knows Harris. Which of Dora and Hope can Corinne reach?", "answer": "Hope", "steps": [ "Corinne knows Harris.", "Harris knows Pearl.", "Pearl knows Earle.", "Earle knows Hope." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Corinne", "Harris", "Hope", "Eden", "Estella", "Cameron", "Pearl", "Viola", "Earle", "Wanda", "Jonah", "Colin", "Dora", "Marilyn", "William", "Gwen", "Demetrius", "Val", "Ella", "Porter" ], "edges": [ [ 0, 1 ], [ 1, 6 ], [ 2, 4 ], [ 2, 3 ], [ 3, 7 ], [ 3, 9 ], [ 4, 5 ], [ 6, 8 ], [ 8, 2 ], [ 10, 11 ], [ 11, 16 ], [ 12, 14 ], [ 12, 13 ], [ 13, 17 ], [ 13, 19 ], [ 14, 15 ], [ 16, 18 ], [ 18, 12 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Hector knows Nash. Edmund knows Darin. Carrie knows Edmund. Asher knows Lyric. Fred knows Fern. Nash knows Asher. Nadine knows Alison. Zoe knows Hector. Zoe knows Corinne. Carrie knows Elsa. Zoe knows Boris. Darin knows Haven. Asher knows Eugene. Alison knows Dane. Lyric knows Fred. Carrie knows Parker. Haven knows Nadine. Haven knows Jules. Which of Nash and Darin can Carrie reach?", "answer": "Darin", "steps": [ "Carrie knows Edmund.", "Edmund knows Darin." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Carrie", "Haven", "Dane", "Alison", "Edmund", "Nadine", "Jules", "Elsa", "Parker", "Darin", "Zoe", "Asher", "Fern", "Fred", "Hector", "Lyric", "Eugene", "Corinne", "Boris", "Nash" ], "edges": [ [ 0, 7 ], [ 0, 8 ], [ 0, 4 ], [ 1, 5 ], [ 1, 6 ], [ 3, 2 ], [ 4, 9 ], [ 5, 3 ], [ 9, 1 ], [ 10, 17 ], [ 10, 18 ], [ 10, 14 ], [ 11, 15 ], [ 11, 16 ], [ 13, 12 ], [ 14, 19 ], [ 15, 13 ], [ 19, 11 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Khashayar knows Luis. Anton knows Bob. Darwin knows Anton. Luis knows Valerie. Elsa knows Lacey. Warren knows Desmond. Claudia knows Khashayar. Judith knows Claudia. Luis knows Ruby. Jack knows Elsa. Desmond knows Darwin. Lacey knows Dahlia. Ibrahim knows Asher. Darwin knows Jack. Lacey knows Gertrude. Asher knows Judith. Judith knows Aubrey. Aubrey knows Kate. Which of Jack and Claudia can Warren reach?", "answer": "Jack", "steps": [ "Warren knows Desmond.", "Desmond knows Darwin.", "Darwin knows Jack." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Warren", "Desmond", "Gertrude", "Elsa", "Anton", "Lacey", "Darwin", "Dahlia", "Bob", "Jack", "Ibrahim", "Asher", "Valerie", "Khashayar", "Aubrey", "Luis", "Judith", "Ruby", "Kate", "Claudia" ], "edges": [ [ 0, 1 ], [ 1, 6 ], [ 3, 5 ], [ 4, 8 ], [ 5, 2 ], [ 5, 7 ], [ 6, 4 ], [ 6, 9 ], [ 9, 3 ], [ 10, 11 ], [ 11, 16 ], [ 13, 15 ], [ 14, 18 ], [ 15, 12 ], [ 15, 17 ], [ 16, 14 ], [ 16, 19 ], [ 19, 13 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Devon knows Ava. Earl knows Clifford. Serena knows Malik. Devon knows Verna. Cody knows Carlos. Austin knows Raquel. Earl knows Eunice. Carlos knows Joyce. Cody knows Edna. Devon knows Morgan. Malik knows Marshall. Jules knows Cody. Edna knows Jennifer. Eunice knows Serena. Earl knows Dick. Serena knows Austin. Earl knows Theodore. Devon knows Jules. Which of Jules and Eunice can Earl reach?", "answer": "Eunice", "steps": [ "Earl knows Eunice." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Earl", "Clifford", "Malik", "Austin", "Marshall", "Serena", "Theodore", "Eunice", "Raquel", "Dick", "Devon", "Verna", "Carlos", "Edna", "Joyce", "Cody", "Ava", "Jules", "Jennifer", "Morgan" ], "edges": [ [ 0, 1 ], [ 0, 6 ], [ 0, 7 ], [ 0, 9 ], [ 2, 4 ], [ 3, 8 ], [ 5, 2 ], [ 5, 3 ], [ 7, 5 ], [ 10, 11 ], [ 10, 16 ], [ 10, 17 ], [ 10, 19 ], [ 12, 14 ], [ 13, 18 ], [ 15, 12 ], [ 15, 13 ], [ 17, 15 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Donovan knows Neil. Lennox knows Hayley. Dylan knows Guy. Barney knows Nora. Tonya knows Kai. Kai knows Ray. Hank knows Lennox. Dylan knows Donovan. Kai knows Emily. Dylan knows Milo. Lennox knows Carter. Nora knows Tonya. Jocelyn knows Barney. Jocelyn knows Sydney. Jocelyn knows Louis. Curtis knows Hank. Guy knows Curtis. Louis knows Barry. Which of Guy and Barney can Jocelyn reach?", "answer": "Barney", "steps": [ "Jocelyn knows Barney." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Jocelyn", "Emily", "Kai", "Barry", "Barney", "Tonya", "Sydney", "Nora", "Ray", "Louis", "Dylan", "Carter", "Lennox", "Neil", "Guy", "Hank", "Milo", "Curtis", "Hayley", "Donovan" ], "edges": [ [ 0, 6 ], [ 0, 4 ], [ 0, 9 ], [ 2, 1 ], [ 2, 8 ], [ 4, 7 ], [ 5, 2 ], [ 7, 5 ], [ 9, 3 ], [ 10, 16 ], [ 10, 14 ], [ 10, 19 ], [ 12, 11 ], [ 12, 18 ], [ 14, 17 ], [ 15, 12 ], [ 17, 15 ], [ 19, 13 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Axel knows Clayton. Clayton knows Max. Clayton knows Wanda. Glenda knows Jackson. Faith knows Dorothy. Faith knows Colleen. Jackson knows Faith. Ivy knows Priscilla. Priscilla knows Elaine. Dana knows Amanda. Ivy knows Eleanor. Dana knows Geoffrey. Geoffrey knows Jennifer. Jennifer knows Madeline. Wanda knows Dana. Elaine knows Crystal. Benjamin knows Axel. Dorothy knows Ivy. Which of Wanda and Dorothy can Glenda reach?", "answer": "Dorothy", "steps": [ "Glenda knows Jackson.", "Jackson knows Faith.", "Faith knows Dorothy." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Glenda", "Colleen", "Eleanor", "Ivy", "Elaine", "Dorothy", "Jackson", "Priscilla", "Faith", "Crystal", "Benjamin", "Max", "Amanda", "Dana", "Jennifer", "Wanda", "Axel", "Geoffrey", "Clayton", "Madeline" ], "edges": [ [ 0, 6 ], [ 3, 2 ], [ 3, 7 ], [ 4, 9 ], [ 5, 3 ], [ 6, 8 ], [ 7, 4 ], [ 8, 1 ], [ 8, 5 ], [ 10, 16 ], [ 13, 12 ], [ 13, 17 ], [ 14, 19 ], [ 15, 13 ], [ 16, 18 ], [ 17, 14 ], [ 18, 11 ], [ 18, 15 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Louise knows Melissa. June knows Kira. Lambert knows Ashton. Rachel knows Kingsley. Kira knows Morgan. Roman knows Rachel. Melissa knows Ian. Ian knows William. Cora knows Robin. Kingsley knows Stefan. Madeline knows Heather. Darwin knows June. Leo knows Ida. Louise knows Lambert. Ida knows Madeline. Melissa knows Roman. Leo knows Cora. Ida knows Darwin. Which of Melissa and Ida can Leo reach?", "answer": "Ida", "steps": [ "Leo knows Ida." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Leo", "Kira", "Madeline", "June", "Darwin", "Morgan", "Robin", "Cora", "Heather", "Ida", "Louise", "Kingsley", "Ian", "Rachel", "Roman", "Stefan", "Ashton", "Lambert", "William", "Melissa" ], "edges": [ [ 0, 7 ], [ 0, 9 ], [ 1, 5 ], [ 2, 8 ], [ 3, 1 ], [ 4, 3 ], [ 7, 6 ], [ 9, 4 ], [ 9, 2 ], [ 10, 17 ], [ 10, 19 ], [ 11, 15 ], [ 12, 18 ], [ 13, 11 ], [ 14, 13 ], [ 17, 16 ], [ 19, 14 ], [ 19, 12 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Dahlia knows Erin. Gabriel knows Ebony. Erin knows Hudson. Dahlia knows Lucas. Lambert knows Gabriel. Keith knows Bernard. Bernard knows Pete. Gabriel knows Greta. Pete knows Rocco. Sean knows Darren. Lucas knows Keith. Deirdre knows Becky. Charity knows Deirdre. Madeline knows Dahlia. Greta knows Grady. Darren knows Charity. Rocco knows Harper. Ebony knows Sean. Which of Rocco and Deirdre can Lambert reach?", "answer": "Deirdre", "steps": [ "Lambert knows Gabriel.", "Gabriel knows Ebony.", "Ebony knows Sean.", "Sean knows Darren.", "Darren knows Charity.", "Charity knows Deirdre." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Lambert", "Deirdre", "Darren", "Gabriel", "Charity", "Becky", "Grady", "Sean", "Ebony", "Greta", "Madeline", "Rocco", "Bernard", "Dahlia", "Pete", "Harper", "Hudson", "Keith", "Lucas", "Erin" ], "edges": [ [ 0, 3 ], [ 1, 5 ], [ 2, 4 ], [ 3, 8 ], [ 3, 9 ], [ 4, 1 ], [ 7, 2 ], [ 8, 7 ], [ 9, 6 ], [ 10, 13 ], [ 11, 15 ], [ 12, 14 ], [ 13, 18 ], [ 13, 19 ], [ 14, 11 ], [ 17, 12 ], [ 18, 17 ], [ 19, 16 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Patrick knows Brent. Lena knows Edgar. Leon knows Dustin. Shelby knows Xander. Dominic knows Lena. Monica knows Griffith. Edgar knows Pete. Patrick knows Monica. Everett knows Shelby. Monica knows Erin. Rocco knows Eloise. Xander knows Rocco. Shelby knows Kit. Griffith knows Dominic. Everett knows Brooks. Neville knows Patrick. Hazel knows Everett. Eloise knows Leon. Which of Lena and Eloise can Neville reach?", "answer": "Lena", "steps": [ "Neville knows Patrick.", "Patrick knows Monica.", "Monica knows Griffith.", "Griffith knows Dominic.", "Dominic knows Lena." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Neville", "Pete", "Dominic", "Brent", "Lena", "Griffith", "Monica", "Erin", "Patrick", "Edgar", "Hazel", "Dustin", "Rocco", "Brooks", "Eloise", "Xander", "Shelby", "Kit", "Everett", "Leon" ], "edges": [ [ 0, 8 ], [ 2, 4 ], [ 4, 9 ], [ 5, 2 ], [ 6, 7 ], [ 6, 5 ], [ 8, 3 ], [ 8, 6 ], [ 9, 1 ], [ 10, 18 ], [ 12, 14 ], [ 14, 19 ], [ 15, 12 ], [ 16, 17 ], [ 16, 15 ], [ 18, 13 ], [ 18, 16 ], [ 19, 11 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Edward knows Edmund. Kane knows Cameron. Kelsey knows Rose. Rena knows Leigh. Luther knows Jake. Luther knows Ron. Leigh knows Maya. Jared knows Linda. Maya knows Axel. Rena knows Tara. Leigh knows Dakota. Jake knows Kelsey. Edmund knows Luther. Ingrid knows Rena. Jake knows Greg. Jake knows Kane. Leigh knows Jared. Jerome knows Ingrid. Which of Rose and Linda can Edward reach?", "answer": "Rose", "steps": [ "Edward knows Edmund.", "Edmund knows Luther.", "Luther knows Jake.", "Jake knows Kelsey.", "Kelsey knows Rose." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Edward", "Edmund", "Cameron", "Kelsey", "Rose", "Jake", "Kane", "Greg", "Ron", "Luther", "Jerome", "Ingrid", "Axel", "Jared", "Linda", "Leigh", "Maya", "Dakota", "Tara", "Rena" ], "edges": [ [ 0, 1 ], [ 1, 9 ], [ 3, 4 ], [ 5, 3 ], [ 5, 6 ], [ 5, 7 ], [ 6, 2 ], [ 9, 5 ], [ 9, 8 ], [ 10, 11 ], [ 11, 19 ], [ 13, 14 ], [ 15, 13 ], [ 15, 16 ], [ 15, 17 ], [ 16, 12 ], [ 19, 15 ], [ 19, 18 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Archer knows Duncan. Eduardo knows Ramon. Rex knows Conrad. Rex knows Archer. Jessie knows Lydia. Lydia knows Wilbur. Lydia knows Tara. Gareth knows Forrest. Sean knows Janice. Ross knows Jessie. Forrest knows Eduardo. Rena knows Sean. Tara knows Rena. Grace knows Rex. Archer knows Gareth. Jessie knows Ramona. Ramon knows Amelia. Janice knows Sam. Which of Rex and Jessie can Grace reach?", "answer": "Rex", "steps": [ "Grace knows Rex." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Grace", "Ramon", "Duncan", "Gareth", "Amelia", "Archer", "Eduardo", "Rex", "Forrest", "Conrad", "Ross", "Janice", "Wilbur", "Tara", "Sam", "Lydia", "Sean", "Jessie", "Rena", "Ramona" ], "edges": [ [ 0, 7 ], [ 1, 4 ], [ 3, 8 ], [ 5, 2 ], [ 5, 3 ], [ 6, 1 ], [ 7, 5 ], [ 7, 9 ], [ 8, 6 ], [ 10, 17 ], [ 11, 14 ], [ 13, 18 ], [ 15, 12 ], [ 15, 13 ], [ 16, 11 ], [ 17, 15 ], [ 17, 19 ], [ 18, 16 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Marcus knows Gene. Stephanie knows Ernie. Jane knows Brody. Wendell knows Effie. Perry knows Lauren. Lauren knows Marcus. Ernie knows Colette. Wendell knows Milton. Zoe knows Stephanie. Riley knows Jane. Lyric knows Simon. Milton knows Rocco. Colette knows Wendell. Lauren knows Arturo. Arturo knows Hector. Stephanie knows Lyric. Riley knows Jon. Gene knows Riley. Which of Milton and Jane can Zoe reach?", "answer": "Milton", "steps": [ "Zoe knows Stephanie.", "Stephanie knows Ernie.", "Ernie knows Colette.", "Colette knows Wendell.", "Wendell knows Milton." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Zoe", "Stephanie", "Lyric", "Colette", "Effie", "Ernie", "Simon", "Wendell", "Rocco", "Milton", "Perry", "Lauren", "Arturo", "Gene", "Jon", "Marcus", "Hector", "Riley", "Brody", "Jane" ], "edges": [ [ 0, 1 ], [ 1, 2 ], [ 1, 5 ], [ 2, 6 ], [ 3, 7 ], [ 5, 3 ], [ 7, 4 ], [ 7, 9 ], [ 9, 8 ], [ 10, 11 ], [ 11, 12 ], [ 11, 15 ], [ 12, 16 ], [ 13, 17 ], [ 15, 13 ], [ 17, 14 ], [ 17, 19 ], [ 19, 18 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Stacy knows Eden. Jasmine knows Morris. Christopher knows Lisette. Heather knows Louisa. Dylan knows Heather. Evan knows Sheila. Stacy knows Joaquin. Leopold knows Jasmine. Joaquin knows Stephen. Dylan knows Ella. Christopher knows Stacy. Heather knows Duke. Marian knows Evan. Louisa knows Marvin. Louisa knows Colin. Joaquin knows Edison. Edison knows Marian. Colin knows Leopold. Which of Evan and Jasmine can Christopher reach?", "answer": "Evan", "steps": [ "Christopher knows Stacy.", "Stacy knows Joaquin.", "Joaquin knows Edison.", "Edison knows Marian.", "Marian knows Evan." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Christopher", "Stacy", "Sheila", "Joaquin", "Edison", "Marian", "Lisette", "Eden", "Evan", "Stephen", "Dylan", "Heather", "Morris", "Louisa", "Colin", "Leopold", "Ella", "Duke", "Jasmine", "Marvin" ], "edges": [ [ 0, 6 ], [ 0, 1 ], [ 1, 7 ], [ 1, 3 ], [ 3, 4 ], [ 3, 9 ], [ 4, 5 ], [ 5, 8 ], [ 8, 2 ], [ 10, 16 ], [ 10, 11 ], [ 11, 17 ], [ 11, 13 ], [ 13, 14 ], [ 13, 19 ], [ 14, 15 ], [ 15, 18 ], [ 18, 12 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Ada knows Greta. Bert knows Jean. Claude knows Mildred. Vivian knows Sydney. Sydney knows Oliver. Greta knows Eden. Sheryl knows Gabriel. Brett knows Elias. Brett knows Atlas. Eden knows Lucille. Nancy knows Brett. Justin knows Nancy. Justin knows Claude. Elias knows Joshua. Greta knows Cate. Vivian knows Ada. Vivian knows Bert. Justin knows Sheryl. Which of Lucille and Joshua can Vivian reach?", "answer": "Lucille", "steps": [ "Vivian knows Ada.", "Ada knows Greta.", "Greta knows Eden.", "Eden knows Lucille." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Vivian", "Bert", "Eden", "Lucille", "Ada", "Greta", "Oliver", "Cate", "Sydney", "Jean", "Justin", "Claude", "Elias", "Joshua", "Nancy", "Brett", "Gabriel", "Atlas", "Sheryl", "Mildred" ], "edges": [ [ 0, 4 ], [ 0, 8 ], [ 0, 1 ], [ 1, 9 ], [ 2, 3 ], [ 4, 5 ], [ 5, 2 ], [ 5, 7 ], [ 8, 6 ], [ 10, 14 ], [ 10, 18 ], [ 10, 11 ], [ 11, 19 ], [ 12, 13 ], [ 14, 15 ], [ 15, 12 ], [ 15, 17 ], [ 18, 16 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Jerry knows Greg. Marie knows Erwin. Jennifer knows Byron. Daria knows Jerry. Julius knows Leland. Helen knows Enrique. Luella knows Helen. Lucy knows Beth. Jennifer knows Julius. Lucy knows Darla. Greg knows Elizabeth. Elizabeth knows Lamar. Darla knows Luella. Daria knows Bernice. Reed knows Knox. Erwin knows Reed. Helen knows Marie. Leland knows Daria. Which of Greg and Erwin can Lucy reach?", "answer": "Erwin", "steps": [ "Lucy knows Darla.", "Darla knows Luella.", "Luella knows Helen.", "Helen knows Marie.", "Marie knows Erwin." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Lucy", "Reed", "Marie", "Luella", "Enrique", "Helen", "Knox", "Darla", "Erwin", "Beth", "Jennifer", "Elizabeth", "Jerry", "Leland", "Bernice", "Daria", "Lamar", "Julius", "Greg", "Byron" ], "edges": [ [ 0, 7 ], [ 0, 9 ], [ 1, 6 ], [ 2, 8 ], [ 3, 5 ], [ 5, 4 ], [ 5, 2 ], [ 7, 3 ], [ 8, 1 ], [ 10, 17 ], [ 10, 19 ], [ 11, 16 ], [ 12, 18 ], [ 13, 15 ], [ 15, 14 ], [ 15, 12 ], [ 17, 13 ], [ 18, 11 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Russell knows Ibrahim. Heath knows Joel. Richard knows Oliver. Virginia knows Simon. Joel knows Jaime. Oliver knows Rocco. Taylor knows Zack. Kelsey knows Fleur. Simon knows Kelsey. Devon knows Russell. Rocco knows Heath. Russell knows Charity. Virginia knows Devon. Alan knows Brooks. Fleur knows Taylor. Norman knows Alan. Richard knows Norman. Alan knows Cora. Which of Rocco and Kelsey can Richard reach?", "answer": "Rocco", "steps": [ "Richard knows Oliver.", "Oliver knows Rocco." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Richard", "Norman", "Joel", "Cora", "Heath", "Jaime", "Alan", "Oliver", "Rocco", "Brooks", "Virginia", "Devon", "Taylor", "Ibrahim", "Fleur", "Zack", "Russell", "Simon", "Kelsey", "Charity" ], "edges": [ [ 0, 7 ], [ 0, 1 ], [ 1, 6 ], [ 2, 5 ], [ 4, 2 ], [ 6, 3 ], [ 6, 9 ], [ 7, 8 ], [ 8, 4 ], [ 10, 17 ], [ 10, 11 ], [ 11, 16 ], [ 12, 15 ], [ 14, 12 ], [ 16, 13 ], [ 16, 19 ], [ 17, 18 ], [ 18, 14 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Kira knows Tina. Curtis knows Hugo. Sybil knows Patricia. Denise knows Fleur. Rita knows Keith. Keith knows Dawn. Rita knows Erma. Joyce knows Marion. Sybil knows Rita. Joyce knows Billy. Fleur knows Kira. Spencer knows Demetrius. Billy knows Yolanda. Alex knows Carter. Curtis knows Sybil. Hugo knows Alex. Denise knows Spencer. Spencer knows Joyce. Which of Sybil and Spencer can Denise reach?", "answer": "Spencer", "steps": [ "Denise knows Spencer." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Denise", "Fleur", "Marion", "Billy", "Tina", "Joyce", "Kira", "Yolanda", "Demetrius", "Spencer", "Curtis", "Hugo", "Erma", "Keith", "Carter", "Rita", "Alex", "Dawn", "Patricia", "Sybil" ], "edges": [ [ 0, 1 ], [ 0, 9 ], [ 1, 6 ], [ 3, 7 ], [ 5, 2 ], [ 5, 3 ], [ 6, 4 ], [ 9, 5 ], [ 9, 8 ], [ 10, 11 ], [ 10, 19 ], [ 11, 16 ], [ 13, 17 ], [ 15, 12 ], [ 15, 13 ], [ 16, 14 ], [ 19, 15 ], [ 19, 18 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Zelda knows Diego. Ira knows Gunnar. Mack knows Essie. Landon knows Elsa. Landon knows Walt. Landon knows Randy. Mack knows Conrad. Emma knows Isiah. Howard knows Roland. Emma knows Lawson. Ashton knows Esme. Diego knows Ira. Howard knows Becky. Walt knows Emma. Zelda knows Mack. Walt knows Ashton. Esme knows Geoffrey. Howard knows Zelda. Which of Gunnar and Geoffrey can Howard reach?", "answer": "Gunnar", "steps": [ "Howard knows Zelda.", "Zelda knows Diego.", "Diego knows Ira.", "Ira knows Gunnar." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Howard", "Mack", "Roland", "Becky", "Ira", "Diego", "Zelda", "Gunnar", "Essie", "Conrad", "Landon", "Emma", "Randy", "Elsa", "Esme", "Ashton", "Walt", "Geoffrey", "Lawson", "Isiah" ], "edges": [ [ 0, 2 ], [ 0, 3 ], [ 0, 6 ], [ 1, 8 ], [ 1, 9 ], [ 4, 7 ], [ 5, 4 ], [ 6, 5 ], [ 6, 1 ], [ 10, 12 ], [ 10, 13 ], [ 10, 16 ], [ 11, 18 ], [ 11, 19 ], [ 14, 17 ], [ 15, 14 ], [ 16, 15 ], [ 16, 11 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Beth knows Derek. Kirsten knows Archer. Gerald knows Fanny. Bill knows Jorge. April knows Kirsten. Fanny knows Harlan. Archer knows Kira. Chance knows Giselle. Derek knows Brynn. Derek knows Jolene. Kira knows Claire. Giselle knows Maria. Jolene knows Gerald. Kira knows Marvin. Giselle knows Beth. Marvin knows Bill. Kirsten knows Vincent. Jorge knows Dennis. Which of Dennis and Harlan can April reach?", "answer": "Dennis", "steps": [ "April knows Kirsten.", "Kirsten knows Archer.", "Archer knows Kira.", "Kira knows Marvin.", "Marvin knows Bill.", "Bill knows Jorge.", "Jorge knows Dennis." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "April", "Dennis", "Kira", "Marvin", "Claire", "Bill", "Vincent", "Kirsten", "Jorge", "Archer", "Chance", "Harlan", "Derek", "Jolene", "Brynn", "Gerald", "Maria", "Giselle", "Fanny", "Beth" ], "edges": [ [ 0, 7 ], [ 2, 4 ], [ 2, 3 ], [ 3, 5 ], [ 5, 8 ], [ 7, 6 ], [ 7, 9 ], [ 8, 1 ], [ 9, 2 ], [ 10, 17 ], [ 12, 14 ], [ 12, 13 ], [ 13, 15 ], [ 15, 18 ], [ 17, 16 ], [ 17, 19 ], [ 18, 11 ], [ 19, 12 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Sybil knows Bernadette. Finn knows India. India knows Faith. Sybil knows Hardy. Jose knows Sue. Finn knows Jose. Larry knows Arturo. Alyssa knows Logan. Pierce knows Larry. Arturo knows Sybil. Geraldine knows Lara. Sue knows Camille. Bernadette knows Elvira. Hardy knows Alyssa. Fern knows Geraldine. Bernadette knows Bella. Lara knows Finn. India knows Forrest. Which of Geraldine and Larry can Pierce reach?", "answer": "Larry", "steps": [ "Pierce knows Larry." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Pierce", "Alyssa", "Hardy", "Logan", "Arturo", "Elvira", "Bella", "Sybil", "Bernadette", "Larry", "Fern", "Sue", "Jose", "Camille", "Lara", "Faith", "Forrest", "Finn", "India", "Geraldine" ], "edges": [ [ 0, 9 ], [ 1, 3 ], [ 2, 1 ], [ 4, 7 ], [ 7, 2 ], [ 7, 8 ], [ 8, 5 ], [ 8, 6 ], [ 9, 4 ], [ 10, 19 ], [ 11, 13 ], [ 12, 11 ], [ 14, 17 ], [ 17, 12 ], [ 17, 18 ], [ 18, 15 ], [ 18, 16 ], [ 19, 14 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Chloe knows Chester. Benjamin knows Claude. Otto knows Kieran. Sue knows Dayton. Lily knows Otto. Benjamin knows Charles. Otto knows Wendy. Chloe knows Laura. Noel knows Chloe. Chloe knows Devin. Otto knows Boyd. Lily knows Jacqueline. Kieran knows Benjamin. Noel knows Isabel. Sue knows Gareth. Noel knows Grady. Laura knows Sue. Lily knows Margaret. Which of Claude and Dayton can Noel reach?", "answer": "Dayton", "steps": [ "Noel knows Chloe.", "Chloe knows Laura.", "Laura knows Sue.", "Sue knows Dayton." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Noel", "Chester", "Chloe", "Gareth", "Dayton", "Devin", "Grady", "Sue", "Isabel", "Laura", "Lily", "Boyd", "Otto", "Charles", "Claude", "Wendy", "Margaret", "Benjamin", "Jacqueline", "Kieran" ], "edges": [ [ 0, 6 ], [ 0, 8 ], [ 0, 2 ], [ 2, 1 ], [ 2, 5 ], [ 2, 9 ], [ 7, 3 ], [ 7, 4 ], [ 9, 7 ], [ 10, 16 ], [ 10, 18 ], [ 10, 12 ], [ 12, 11 ], [ 12, 15 ], [ 12, 19 ], [ 17, 13 ], [ 17, 14 ], [ 19, 17 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Lee knows Beau. Tabitha knows Verna. Randall knows Lawrence. Randall knows Vance. Beau knows Hannah. Noel knows Randall. Aspen knows Tabitha. Tabitha knows Noel. Lawrence knows Lisa. Essie knows Hugo. Hilda knows Lee. Hilda knows Warren. Lee knows Essie. Essie knows Arthur. Noel knows Allen. Arthur knows Stephen. Ronald knows Hilda. Allen knows Troy. Which of Arthur and Lawrence can Aspen reach?", "answer": "Lawrence", "steps": [ "Aspen knows Tabitha.", "Tabitha knows Noel.", "Noel knows Randall.", "Randall knows Lawrence." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Aspen", "Randall", "Tabitha", "Lawrence", "Verna", "Lisa", "Noel", "Troy", "Allen", "Vance", "Ronald", "Essie", "Hilda", "Arthur", "Warren", "Stephen", "Lee", "Hannah", "Beau", "Hugo" ], "edges": [ [ 0, 2 ], [ 1, 3 ], [ 1, 9 ], [ 2, 4 ], [ 2, 6 ], [ 3, 5 ], [ 6, 8 ], [ 6, 1 ], [ 8, 7 ], [ 10, 12 ], [ 11, 13 ], [ 11, 19 ], [ 12, 14 ], [ 12, 16 ], [ 13, 15 ], [ 16, 18 ], [ 16, 11 ], [ 18, 17 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Yara knows Andre. Irene knows Shelly. Ilene knows Barry. Kent knows Ivy. Brenda knows Sean. Andre knows Heidi. Shelly knows June. Felicia knows Tanya. Heidi knows Ilene. Jameson knows Angelica. Sean knows Jameson. Tanya knows Irene. Felicia knows Hamilton. June knows Brad. Ilene knows Ezra. June knows Jude. Jameson knows Yara. Ivy knows Felicia. Which of Shelly and Heidi can Kent reach?", "answer": "Shelly", "steps": [ "Kent knows Ivy.", "Ivy knows Felicia.", "Felicia knows Tanya.", "Tanya knows Irene.", "Irene knows Shelly." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Kent", "Shelly", "Irene", "Ivy", "Brad", "Tanya", "June", "Jude", "Felicia", "Hamilton", "Brenda", "Heidi", "Andre", "Sean", "Ezra", "Yara", "Ilene", "Barry", "Jameson", "Angelica" ], "edges": [ [ 0, 3 ], [ 1, 6 ], [ 2, 1 ], [ 3, 8 ], [ 5, 2 ], [ 6, 4 ], [ 6, 7 ], [ 8, 5 ], [ 8, 9 ], [ 10, 13 ], [ 11, 16 ], [ 12, 11 ], [ 13, 18 ], [ 15, 12 ], [ 16, 14 ], [ 16, 17 ], [ 18, 15 ], [ 18, 19 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Javier knows Inez. Abigail knows Javier. Kent knows Jenny. Javier knows Lawson. Dewey knows Charlotte. Charlotte knows Barbara. Logan knows Magdalena. Inez knows Camden. Eli knows Ellen. Jenny knows Dewey. Logan knows Jenna. Dewey knows Logan. Dewey knows Hope. Jenna knows Stacy. Jameson knows Abigail. Inez knows Serena. Camden knows Jewel. Javier knows Eli. Which of Logan and Inez can Jameson reach?", "answer": "Inez", "steps": [ "Jameson knows Abigail.", "Abigail knows Javier.", "Javier knows Inez." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Jameson", "Serena", "Abigail", "Eli", "Camden", "Inez", "Javier", "Lawson", "Ellen", "Jewel", "Kent", "Magdalena", "Jenny", "Charlotte", "Jenna", "Logan", "Dewey", "Hope", "Barbara", "Stacy" ], "edges": [ [ 0, 2 ], [ 2, 6 ], [ 3, 8 ], [ 4, 9 ], [ 5, 1 ], [ 5, 4 ], [ 6, 7 ], [ 6, 3 ], [ 6, 5 ], [ 10, 12 ], [ 12, 16 ], [ 13, 18 ], [ 14, 19 ], [ 15, 11 ], [ 15, 14 ], [ 16, 17 ], [ 16, 13 ], [ 16, 15 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Frida knows Kristina. Virginia knows Frida. Fergus knows Hudson. Lena knows Brock. Kristin knows Ralph. Jocelyn knows Kai. Jeremy knows Jocelyn. Kristina knows Alfonso. Harper knows Jillian. Jackson knows Kristin. Hudson knows Harper. Bryan knows Jeremy. Jeremy knows Sue. Kai knows Fergus. Kristin knows Lena. Ralph knows Virginia. Alfonso knows Brian. Sue knows Frank. Which of Ralph and Jocelyn can Bryan reach?", "answer": "Jocelyn", "steps": [ "Bryan knows Jeremy.", "Jeremy knows Jocelyn." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Bryan", "Sue", "Jillian", "Harper", "Jocelyn", "Fergus", "Frank", "Hudson", "Jeremy", "Kai", "Jackson", "Lena", "Brian", "Alfonso", "Ralph", "Frida", "Brock", "Kristina", "Kristin", "Virginia" ], "edges": [ [ 0, 8 ], [ 1, 6 ], [ 3, 2 ], [ 4, 9 ], [ 5, 7 ], [ 7, 3 ], [ 8, 1 ], [ 8, 4 ], [ 9, 5 ], [ 10, 18 ], [ 11, 16 ], [ 13, 12 ], [ 14, 19 ], [ 15, 17 ], [ 17, 13 ], [ 18, 11 ], [ 18, 14 ], [ 19, 15 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Ava knows Rebecca. Rebecca knows Ross. Ian knows Cole. Florence knows Antonio. Livia knows Lloyd. Gemma knows Esther. Gemma knows Ian. Florence knows Ava. Harlan knows Max. Rebecca knows Tristan. Rosemary knows Florence. Cole knows Alyson. Tristan knows Greg. Harlan knows Rosemary. Cole knows Nicole. Louise knows Samantha. Nicole knows Louise. Louise knows Livia. Which of Ava and Nicole can Gemma reach?", "answer": "Nicole", "steps": [ "Gemma knows Ian.", "Ian knows Cole.", "Cole knows Nicole." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Gemma", "Samantha", "Ian", "Livia", "Cole", "Louise", "Esther", "Nicole", "Lloyd", "Alyson", "Harlan", "Ross", "Rosemary", "Tristan", "Florence", "Rebecca", "Max", "Ava", "Greg", "Antonio" ], "edges": [ [ 0, 6 ], [ 0, 2 ], [ 2, 4 ], [ 3, 8 ], [ 4, 7 ], [ 4, 9 ], [ 5, 1 ], [ 5, 3 ], [ 7, 5 ], [ 10, 16 ], [ 10, 12 ], [ 12, 14 ], [ 13, 18 ], [ 14, 17 ], [ 14, 19 ], [ 15, 11 ], [ 15, 13 ], [ 17, 15 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Anastasia knows Amanda. Hailey knows Pauline. Jaime knows Dorian. Brooke knows Hailey. Pauline knows Dave. Dave knows Adele. Carrie knows Geneva. Brooke knows Ernest. Carrie knows Ibrahim. Anastasia knows Hudson. Hudson knows Carrie. Pauline knows Pablo. Lauren knows Anastasia. Dorian knows Lionel. Dorian knows Brooke. Jamie knows Lauren. Ibrahim knows Kirsten. Lauren knows Owen. Which of Lauren and Dorian can Jamie reach?", "answer": "Lauren", "steps": [ "Jamie knows Lauren." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Jamie", "Amanda", "Lauren", "Geneva", "Carrie", "Anastasia", "Hudson", "Owen", "Kirsten", "Ibrahim", "Jaime", "Ernest", "Dorian", "Pablo", "Pauline", "Brooke", "Hailey", "Lionel", "Adele", "Dave" ], "edges": [ [ 0, 2 ], [ 2, 7 ], [ 2, 5 ], [ 4, 3 ], [ 4, 9 ], [ 5, 1 ], [ 5, 6 ], [ 6, 4 ], [ 9, 8 ], [ 10, 12 ], [ 12, 17 ], [ 12, 15 ], [ 14, 13 ], [ 14, 19 ], [ 15, 11 ], [ 15, 16 ], [ 16, 14 ], [ 19, 18 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Linda knows Fisher. Linda knows Tiffany. Benjamin knows Harrison. Tom knows Parker. Tiffany knows Gina. Linda knows Benjamin. Ian knows Naomi. Naomi knows Pauline. Harrison knows Geoffrey. Pedro knows Jake. Ian knows Pedro. Alan knows Tom. Gina knows Fergus. Jake knows Nolan. Linda knows Cara. Ian knows Charles. Fisher knows Vera. Ian knows Alan. Which of Fergus and Nolan can Ian reach?", "answer": "Nolan", "steps": [ "Ian knows Pedro.", "Pedro knows Jake.", "Jake knows Nolan." ], "difficulty": 3, "original_distance": 3, "idx_to_symbol": [ "Ian", "Jake", "Pedro", "Parker", "Nolan", "Alan", "Tom", "Charles", "Naomi", "Pauline", "Linda", "Gina", "Tiffany", "Geoffrey", "Fergus", "Benjamin", "Harrison", "Cara", "Fisher", "Vera" ], "edges": [ [ 0, 2 ], [ 0, 5 ], [ 0, 7 ], [ 0, 8 ], [ 1, 4 ], [ 2, 1 ], [ 5, 6 ], [ 6, 3 ], [ 8, 9 ], [ 10, 12 ], [ 10, 15 ], [ 10, 17 ], [ 10, 18 ], [ 11, 14 ], [ 12, 11 ], [ 15, 16 ], [ 16, 13 ], [ 18, 19 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Gladys knows Jenna. Cristina knows Peggy. Ursula knows Leigh. Antonio knows Guy. Sally knows Carmela. Gladys knows Lola. Catherine knows Monroe. Leigh knows Sally. Rebecca knows Arturo. Charles knows Jonathan. Rebecca knows Antonio. Sally knows Noel. Justine knows Charles. Guy knows Tom. Catherine knows Justine. Guy knows Cristina. Peggy knows Gladys. Charles knows Ursula. Which of Justine and Antonio can Catherine reach?", "answer": "Justine", "steps": [ "Catherine knows Justine." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Catherine", "Charles", "Jonathan", "Noel", "Ursula", "Justine", "Sally", "Carmela", "Monroe", "Leigh", "Rebecca", "Guy", "Tom", "Lola", "Cristina", "Antonio", "Gladys", "Jenna", "Arturo", "Peggy" ], "edges": [ [ 0, 8 ], [ 0, 5 ], [ 1, 2 ], [ 1, 4 ], [ 4, 9 ], [ 5, 1 ], [ 6, 3 ], [ 6, 7 ], [ 9, 6 ], [ 10, 18 ], [ 10, 15 ], [ 11, 12 ], [ 11, 14 ], [ 14, 19 ], [ 15, 11 ], [ 16, 13 ], [ 16, 17 ], [ 19, 16 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Elijah knows Yasmin. Val knows Abby. Lloyd knows Estella. Ashton knows Alice. Zach knows Alan. Abby knows Elijah. Ashton knows Laura. Electra knows Fletcher. Don knows Lewis. Abby knows Julius. Jeremy knows Electra. Zelda knows Dante. Elijah knows Zelda. Fabian knows Val. Laura knows Jeremy. Zach knows Ashton. Dante knows Don. Estella knows Zach. Which of Jeremy and Dante can Lloyd reach?", "answer": "Jeremy", "steps": [ "Lloyd knows Estella.", "Estella knows Zach.", "Zach knows Ashton.", "Ashton knows Laura.", "Laura knows Jeremy." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Lloyd", "Ashton", "Laura", "Alan", "Zach", "Electra", "Alice", "Jeremy", "Fletcher", "Estella", "Fabian", "Elijah", "Zelda", "Julius", "Abby", "Don", "Yasmin", "Dante", "Lewis", "Val" ], "edges": [ [ 0, 9 ], [ 1, 6 ], [ 1, 2 ], [ 2, 7 ], [ 4, 3 ], [ 4, 1 ], [ 5, 8 ], [ 7, 5 ], [ 9, 4 ], [ 10, 19 ], [ 11, 16 ], [ 11, 12 ], [ 12, 17 ], [ 14, 13 ], [ 14, 11 ], [ 15, 18 ], [ 17, 15 ], [ 19, 14 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Iris knows Gene. Harriet knows Kevin. Eric knows Larissa. Byron knows Rocco. Emmett knows Jarvis. Lambert knows Lewis. Harriet knows Geoffrey. Lewis knows Byron. Iris knows Rosa. Desmond knows Lambert. Emmett knows Harriet. Byron knows Bella. Desmond knows Isadora. Florence knows Desmond. Lambert knows Lorenzo. Kevin knows Iris. Eric knows Emmett. Florence knows Chance. Which of Desmond and Emmett can Florence reach?", "answer": "Desmond", "steps": [ "Florence knows Desmond." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Florence", "Lewis", "Chance", "Lorenzo", "Rocco", "Lambert", "Bella", "Byron", "Desmond", "Isadora", "Eric", "Kevin", "Larissa", "Geoffrey", "Gene", "Harriet", "Rosa", "Iris", "Emmett", "Jarvis" ], "edges": [ [ 0, 2 ], [ 0, 8 ], [ 1, 7 ], [ 5, 3 ], [ 5, 1 ], [ 7, 4 ], [ 7, 6 ], [ 8, 5 ], [ 8, 9 ], [ 10, 12 ], [ 10, 18 ], [ 11, 17 ], [ 15, 13 ], [ 15, 11 ], [ 17, 14 ], [ 17, 16 ], [ 18, 15 ], [ 18, 19 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Jeffery knows Keegan. John knows Dexter. Adrian knows Max. Eugenia knows John. Sarah knows Shelly. Milton knows Crystal. Crystal knows Paula. Max knows Darren. Holly knows Shaun. Keegan knows Gail. Dexter knows Milton. Gail knows Eugenia. Shaun knows Curtis. Darren knows Sarah. Shelly knows Carl. Curtis knows Adrian. Jeffery knows Chelsea. Holly knows Neal. Which of Darren and Dexter can Holly reach?", "answer": "Darren", "steps": [ "Holly knows Shaun.", "Shaun knows Curtis.", "Curtis knows Adrian.", "Adrian knows Max.", "Max knows Darren." ], "difficulty": 5, "original_distance": 8, "idx_to_symbol": [ "Holly", "Adrian", "Shaun", "Carl", "Max", "Shelly", "Curtis", "Darren", "Neal", "Sarah", "Jeffery", "Eugenia", "Keegan", "Paula", "John", "Crystal", "Gail", "Dexter", "Chelsea", "Milton" ], "edges": [ [ 0, 8 ], [ 0, 2 ], [ 1, 4 ], [ 2, 6 ], [ 4, 7 ], [ 5, 3 ], [ 6, 1 ], [ 7, 9 ], [ 9, 5 ], [ 10, 18 ], [ 10, 12 ], [ 11, 14 ], [ 12, 16 ], [ 14, 17 ], [ 15, 13 ], [ 16, 11 ], [ 17, 19 ], [ 19, 15 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Roger knows Kit. Jana knows Bruno. Bennett knows Mack. Jana knows Tabitha. Kai knows Dallas. Tamara knows Jana. Jillian knows Harley. Myra knows Luke. Myra knows Herbert. Kendrick knows Lark. Harley knows Myra. John knows Kendrick. John knows Roger. Bruno knows Jonah. Roger knows Jillian. Tamara knows Bennett. Jonah knows Kai. Kai knows Justine. Which of Bruno and Jillian can John reach?", "answer": "Jillian", "steps": [ "John knows Roger.", "Roger knows Jillian." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "John", "Harley", "Myra", "Kit", "Herbert", "Roger", "Luke", "Jillian", "Kendrick", "Lark", "Tamara", "Jonah", "Kai", "Tabitha", "Justine", "Jana", "Dallas", "Bruno", "Bennett", "Mack" ], "edges": [ [ 0, 5 ], [ 0, 8 ], [ 1, 2 ], [ 2, 4 ], [ 2, 6 ], [ 5, 3 ], [ 5, 7 ], [ 7, 1 ], [ 8, 9 ], [ 10, 15 ], [ 10, 18 ], [ 11, 12 ], [ 12, 14 ], [ 12, 16 ], [ 15, 13 ], [ 15, 17 ], [ 17, 11 ], [ 18, 19 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Aiden knows Larissa. Calvin knows Mabel. Aiden knows Declan. Anastasia knows Jermaine. Anastasia knows Leticia. Aiden knows Willard. Mabel knows Preston. Eamon knows Sandra. Jocelyn knows Trevor. Donna knows Anastasia. Jocelyn knows Larry. Larissa knows Jocelyn. Aiden knows Frida. Anastasia knows Eamon. Mabel knows Beth. Anastasia knows Calvin. Sean knows Aiden. Willard knows Gerard. Which of Jocelyn and Mabel can Donna reach?", "answer": "Mabel", "steps": [ "Donna knows Anastasia.", "Anastasia knows Calvin.", "Calvin knows Mabel." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Donna", "Leticia", "Calvin", "Preston", "Anastasia", "Sandra", "Jermaine", "Beth", "Mabel", "Eamon", "Sean", "Declan", "Larissa", "Trevor", "Aiden", "Gerard", "Frida", "Larry", "Jocelyn", "Willard" ], "edges": [ [ 0, 4 ], [ 2, 8 ], [ 4, 1 ], [ 4, 6 ], [ 4, 2 ], [ 4, 9 ], [ 8, 3 ], [ 8, 7 ], [ 9, 5 ], [ 10, 14 ], [ 12, 18 ], [ 14, 11 ], [ 14, 16 ], [ 14, 12 ], [ 14, 19 ], [ 18, 13 ], [ 18, 17 ], [ 19, 15 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Peggy knows Saul. Grace knows Peggy. Darin knows Arthur. Cooper knows Simon. Simon knows Myra. Hendrix knows Grace. Eldon knows Heidi. Eldon knows Denise. Myra knows Lillian. Saul knows Eldon. Cooper knows Conner. Myra knows Marco. Graeme knows Aisha. Peggy knows Jacqueline. Doug knows Cooper. Lillian knows Darin. Bryan knows Doug. Denise knows Graeme. Which of Saul and Simon can Hendrix reach?", "answer": "Saul", "steps": [ "Hendrix knows Grace.", "Grace knows Peggy.", "Peggy knows Saul." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Hendrix", "Graeme", "Jacqueline", "Eldon", "Saul", "Grace", "Peggy", "Aisha", "Denise", "Heidi", "Bryan", "Darin", "Conner", "Myra", "Simon", "Doug", "Cooper", "Arthur", "Lillian", "Marco" ], "edges": [ [ 0, 5 ], [ 1, 7 ], [ 3, 8 ], [ 3, 9 ], [ 4, 3 ], [ 5, 6 ], [ 6, 2 ], [ 6, 4 ], [ 8, 1 ], [ 10, 15 ], [ 11, 17 ], [ 13, 18 ], [ 13, 19 ], [ 14, 13 ], [ 15, 16 ], [ 16, 12 ], [ 16, 14 ], [ 18, 11 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Earl knows Clement. Joan knows Belinda. Roger knows Isiah. Jessica knows Deborah. Simon knows Landon. Russ knows Jessica. Gage knows Joan. Dewey knows Teresa. Belinda knows Tanya. Isiah knows Jules. Landon knows Russ. Abel knows Gus. Joan knows Abel. Gus knows Jenny. Gus knows Roger. Landon knows Andre. Teresa knows Earl. Teresa knows Simon. Which of Roger and Russ can Gage reach?", "answer": "Roger", "steps": [ "Gage knows Joan.", "Joan knows Abel.", "Abel knows Gus.", "Gus knows Roger." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Gage", "Joan", "Abel", "Jenny", "Roger", "Jules", "Isiah", "Gus", "Tanya", "Belinda", "Dewey", "Teresa", "Simon", "Andre", "Russ", "Deborah", "Jessica", "Landon", "Clement", "Earl" ], "edges": [ [ 0, 1 ], [ 1, 2 ], [ 1, 9 ], [ 2, 7 ], [ 4, 6 ], [ 6, 5 ], [ 7, 3 ], [ 7, 4 ], [ 9, 8 ], [ 10, 11 ], [ 11, 12 ], [ 11, 19 ], [ 12, 17 ], [ 14, 16 ], [ 16, 15 ], [ 17, 13 ], [ 17, 14 ], [ 19, 18 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Adrian knows Sharon. Sharon knows Julie. August knows Neil. Eric knows Sebastian. Verna knows Simon. Warren knows Stephen. Khashayar knows Kate. Graham knows Clement. Simon knows Ann. Kate knows Bert. Julie knows Khashayar. Kate knows Eric. Simon knows Graham. Warren knows Harvey. Clement knows Warren. Warren knows August. Sharon knows Dee. Kate knows Mara. Which of Sebastian and Neil can Adrian reach?", "answer": "Sebastian", "steps": [ "Adrian knows Sharon.", "Sharon knows Julie.", "Julie knows Khashayar.", "Khashayar knows Kate.", "Kate knows Eric.", "Eric knows Sebastian." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Adrian", "Bert", "Dee", "Julie", "Khashayar", "Kate", "Sebastian", "Mara", "Eric", "Sharon", "Verna", "Stephen", "Ann", "Graham", "Clement", "Warren", "Neil", "Harvey", "August", "Simon" ], "edges": [ [ 0, 9 ], [ 3, 4 ], [ 4, 5 ], [ 5, 1 ], [ 5, 7 ], [ 5, 8 ], [ 8, 6 ], [ 9, 2 ], [ 9, 3 ], [ 10, 19 ], [ 13, 14 ], [ 14, 15 ], [ 15, 11 ], [ 15, 17 ], [ 15, 18 ], [ 18, 16 ], [ 19, 12 ], [ 19, 13 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Jack knows Gavin. Davis knows Allan. Darrell knows Anthony. Jack knows Whitney. Dora knows Lynn. Federico knows Ignacio. Federico knows Demetrius. Anthony knows Martha. Jack knows Jaime. Dora knows Renee. Virginia knows Jack. Anthony knows Jonah. Whitney knows Dora. Faye knows Jean. Allan knows Virginia. Anthony knows Clement. Jean knows Darrell. Martha knows Federico. Which of Virginia and Darrell can Faye reach?", "answer": "Darrell", "steps": [ "Faye knows Jean.", "Jean knows Darrell." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Faye", "Jonah", "Jean", "Martha", "Darrell", "Clement", "Federico", "Ignacio", "Anthony", "Demetrius", "Davis", "Gavin", "Allan", "Whitney", "Virginia", "Jaime", "Dora", "Lynn", "Jack", "Renee" ], "edges": [ [ 0, 2 ], [ 2, 4 ], [ 3, 6 ], [ 4, 8 ], [ 6, 7 ], [ 6, 9 ], [ 8, 1 ], [ 8, 5 ], [ 8, 3 ], [ 10, 12 ], [ 12, 14 ], [ 13, 16 ], [ 14, 18 ], [ 16, 17 ], [ 16, 19 ], [ 18, 11 ], [ 18, 15 ], [ 18, 13 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Louise knows Melissa. June knows Kira. Lambert knows Ashton. Rachel knows Kingsley. Kira knows Morgan. Roman knows Rachel. Melissa knows Ian. Ian knows William. Cora knows Robin. Kingsley knows Stefan. Madeline knows Heather. Darwin knows June. Leo knows Ida. Louise knows Lambert. Ida knows Madeline. Melissa knows Roman. Leo knows Cora. Ida knows Darwin. Which of Kingsley and Kira can Leo reach?", "answer": "Kira", "steps": [ "Leo knows Ida.", "Ida knows Darwin.", "Darwin knows June.", "June knows Kira." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Leo", "Kira", "Madeline", "June", "Darwin", "Morgan", "Robin", "Cora", "Heather", "Ida", "Louise", "Kingsley", "Ian", "Rachel", "Roman", "Stefan", "Ashton", "Lambert", "William", "Melissa" ], "edges": [ [ 0, 7 ], [ 0, 9 ], [ 1, 5 ], [ 2, 8 ], [ 3, 1 ], [ 4, 3 ], [ 7, 6 ], [ 9, 4 ], [ 9, 2 ], [ 10, 17 ], [ 10, 19 ], [ 11, 15 ], [ 12, 18 ], [ 13, 11 ], [ 14, 13 ], [ 17, 16 ], [ 19, 14 ], [ 19, 12 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Evan knows Kerry. Kerry knows Guy. Dahlia knows Miriam. Shannon knows Devin. Jason knows Matt. Jason knows Erwin. Guy knows Herbert. Dahlia knows Jason. Evan knows Kaleb. Alfonso knows Magdalena. Dahlia knows Virginia. Alfonso knows Dahlia. Kerry knows Lillian. Kerry knows Atlas. Matt knows Langston. Guy knows Shannon. Erwin knows Barry. Herbert knows Cain. Which of Cain and Langston can Evan reach?", "answer": "Cain", "steps": [ "Evan knows Kerry.", "Kerry knows Guy.", "Guy knows Herbert.", "Herbert knows Cain." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Evan", "Shannon", "Herbert", "Guy", "Lillian", "Cain", "Devin", "Atlas", "Kaleb", "Kerry", "Alfonso", "Erwin", "Matt", "Jason", "Miriam", "Langston", "Barry", "Virginia", "Magdalena", "Dahlia" ], "edges": [ [ 0, 8 ], [ 0, 9 ], [ 1, 6 ], [ 2, 5 ], [ 3, 2 ], [ 3, 1 ], [ 9, 4 ], [ 9, 3 ], [ 9, 7 ], [ 10, 18 ], [ 10, 19 ], [ 11, 16 ], [ 12, 15 ], [ 13, 12 ], [ 13, 11 ], [ 19, 14 ], [ 19, 13 ], [ 19, 17 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Tessa knows Patricia. Tessa knows Camille. Cody knows Declan. Frida knows Joseph. Grant knows Samuel. Itzel knows Grant. Frida knows Travis. Declan knows Lamont. Clifford knows Kara. Joseph knows Ernesto. Samuel knows Cody. Frida knows Lyle. Travis knows Matt. Kara knows Frida. Yvette knows Clifford. Cody knows Demetrius. Cody knows Tessa. Joseph knows Dawn. Which of Declan and Travis can Yvette reach?", "answer": "Travis", "steps": [ "Yvette knows Clifford.", "Clifford knows Kara.", "Kara knows Frida.", "Frida knows Travis." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Yvette", "Clifford", "Joseph", "Matt", "Dawn", "Ernesto", "Frida", "Kara", "Lyle", "Travis", "Itzel", "Grant", "Tessa", "Lamont", "Patricia", "Camille", "Cody", "Samuel", "Demetrius", "Declan" ], "edges": [ [ 0, 1 ], [ 1, 7 ], [ 2, 4 ], [ 2, 5 ], [ 6, 2 ], [ 6, 8 ], [ 6, 9 ], [ 7, 6 ], [ 9, 3 ], [ 10, 11 ], [ 11, 17 ], [ 12, 14 ], [ 12, 15 ], [ 16, 12 ], [ 16, 18 ], [ 16, 19 ], [ 17, 16 ], [ 19, 13 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Sebastian knows Elvira. Jessica knows Harmony. Whitney knows Riley. Elvira knows Lucia. Sebastian knows Miles. Daphne knows Itzel. Laurel knows Warren. Dakota knows Laurel. Dakota knows Fabian. Laurel knows Whitney. Elvira knows Jessica. Harmony knows Daphne. Riley knows Wayne. Riley knows Antonio. Sebastian knows Logan. Harmony knows Lana. Dakota knows Guy. Antonio knows Barney. Which of Daphne and Antonio can Sebastian reach?", "answer": "Daphne", "steps": [ "Sebastian knows Elvira.", "Elvira knows Jessica.", "Jessica knows Harmony.", "Harmony knows Daphne." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Sebastian", "Lucia", "Logan", "Daphne", "Jessica", "Lana", "Itzel", "Miles", "Harmony", "Elvira", "Dakota", "Warren", "Fabian", "Antonio", "Whitney", "Wayne", "Barney", "Guy", "Riley", "Laurel" ], "edges": [ [ 0, 2 ], [ 0, 7 ], [ 0, 9 ], [ 3, 6 ], [ 4, 8 ], [ 8, 5 ], [ 8, 3 ], [ 9, 1 ], [ 9, 4 ], [ 10, 12 ], [ 10, 17 ], [ 10, 19 ], [ 13, 16 ], [ 14, 18 ], [ 18, 15 ], [ 18, 13 ], [ 19, 11 ], [ 19, 14 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Effie knows Irving. Pierce knows Myrtle. Pat knows Luis. Howard knows Daphne. Blanche knows Lance. Pierce knows Howard. Daphne knows Dustin. Pat knows Effie. Irving knows Colby. Greg knows Jarvis. Lance knows Sierra. Irving knows Avery. Daphne knows Greg. Howard knows Leticia. Myrtle knows Elvis. Greg knows Willis. Effie knows June. Blanche knows Pat. Which of Daphne and Effie can Blanche reach?", "answer": "Effie", "steps": [ "Blanche knows Pat.", "Pat knows Effie." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Blanche", "Luis", "Sierra", "Lance", "Colby", "Effie", "Irving", "June", "Avery", "Pat", "Pierce", "Leticia", "Elvis", "Myrtle", "Willis", "Daphne", "Greg", "Dustin", "Jarvis", "Howard" ], "edges": [ [ 0, 3 ], [ 0, 9 ], [ 3, 2 ], [ 5, 7 ], [ 5, 6 ], [ 6, 4 ], [ 6, 8 ], [ 9, 1 ], [ 9, 5 ], [ 10, 13 ], [ 10, 19 ], [ 13, 12 ], [ 15, 17 ], [ 15, 16 ], [ 16, 14 ], [ 16, 18 ], [ 19, 11 ], [ 19, 15 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Isla knows Caroline. Hattie knows Bruce. Deirdre knows Chance. Bruce knows Chase. Ford knows Xavier. Andrew knows Laura. Chance knows Nicholas. Chris knows Gunnar. Mara knows Chris. Chris knows Hattie. Bruce knows Andrew. Nicholas knows Greg. Deirdre knows Jem. Hattie knows Knox. Ford knows Deirdre. Isla knows Ford. Chance knows Ronald. Mara knows Brody. Which of Hattie and Deirdre can Isla reach?", "answer": "Deirdre", "steps": [ "Isla knows Ford.", "Ford knows Deirdre." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Isla", "Deirdre", "Ronald", "Jem", "Greg", "Chance", "Caroline", "Nicholas", "Ford", "Xavier", "Mara", "Hattie", "Chase", "Knox", "Laura", "Bruce", "Brody", "Andrew", "Chris", "Gunnar" ], "edges": [ [ 0, 6 ], [ 0, 8 ], [ 1, 3 ], [ 1, 5 ], [ 5, 2 ], [ 5, 7 ], [ 7, 4 ], [ 8, 1 ], [ 8, 9 ], [ 10, 16 ], [ 10, 18 ], [ 11, 13 ], [ 11, 15 ], [ 15, 12 ], [ 15, 17 ], [ 17, 14 ], [ 18, 11 ], [ 18, 19 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Rhonda knows Allison. Cameron knows Cliff. Will knows Susanne. Brock knows Beau. Wilma knows Goldie. Brock knows Keaton. Will knows Hayley. Mitchell knows Cameron. Susanne knows Brock. Wilma knows Randy. Goldie knows Hudson. Randy knows Mitchell. Hayley knows Axel. Rhonda knows Thea. Cameron knows Lars. Mitchell knows Colleen. Brock knows Rhonda. Mitchell knows Victoria. Which of Brock and Mitchell can Wilma reach?", "answer": "Mitchell", "steps": [ "Wilma knows Randy.", "Randy knows Mitchell." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Wilma", "Mitchell", "Lars", "Randy", "Hudson", "Colleen", "Victoria", "Cameron", "Cliff", "Goldie", "Will", "Brock", "Allison", "Susanne", "Axel", "Keaton", "Beau", "Rhonda", "Thea", "Hayley" ], "edges": [ [ 0, 3 ], [ 0, 9 ], [ 1, 5 ], [ 1, 6 ], [ 1, 7 ], [ 3, 1 ], [ 7, 2 ], [ 7, 8 ], [ 9, 4 ], [ 10, 13 ], [ 10, 19 ], [ 11, 15 ], [ 11, 16 ], [ 11, 17 ], [ 13, 11 ], [ 17, 12 ], [ 17, 18 ], [ 19, 14 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Beau knows Amber. Rosemary knows Jordan. Camille knows Kimberly. Camille knows Sharon. Faith knows Samantha. Rick knows Faith. Vera knows Jolene. Vera knows Etta. Gemma knows Effie. Etta knows Beau. Jordan knows Michelle. Rick knows Hilda. Rick knows Vera. Gemma knows Cameron. Cameron knows Tina. Cameron knows Rosemary. Faith knows Louis. Gemma knows Camille. Which of Jordan and Beau can Rick reach?", "answer": "Beau", "steps": [ "Rick knows Vera.", "Vera knows Etta.", "Etta knows Beau." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Rick", "Beau", "Vera", "Amber", "Louis", "Hilda", "Jolene", "Faith", "Etta", "Samantha", "Gemma", "Jordan", "Cameron", "Michelle", "Kimberly", "Effie", "Tina", "Camille", "Rosemary", "Sharon" ], "edges": [ [ 0, 5 ], [ 0, 2 ], [ 0, 7 ], [ 1, 3 ], [ 2, 6 ], [ 2, 8 ], [ 7, 4 ], [ 7, 9 ], [ 8, 1 ], [ 10, 15 ], [ 10, 12 ], [ 10, 17 ], [ 11, 13 ], [ 12, 16 ], [ 12, 18 ], [ 17, 14 ], [ 17, 19 ], [ 18, 11 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Chad knows Tristan. Tristan knows Carlos. Tristan knows Ellis. Damian knows Oliver. Oliver knows Valerie. Flora knows Camille. Leander knows Damian. Ellis knows Ira. Ellis knows Tonya. Quinn knows Jacob. Christopher knows Dwight. Oliver knows Christopher. Alyssa knows Chad. Marlene knows Alyssa. Quinn knows Leander. Christopher knows Flora. Marlene knows Marco. Ira knows Willis. Which of Camille and Willis can Marlene reach?", "answer": "Willis", "steps": [ "Marlene knows Alyssa.", "Alyssa knows Chad.", "Chad knows Tristan.", "Tristan knows Ellis.", "Ellis knows Ira.", "Ira knows Willis." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Marlene", "Chad", "Ellis", "Willis", "Carlos", "Tristan", "Alyssa", "Marco", "Ira", "Tonya", "Quinn", "Damian", "Christopher", "Camille", "Valerie", "Oliver", "Leander", "Jacob", "Flora", "Dwight" ], "edges": [ [ 0, 7 ], [ 0, 6 ], [ 1, 5 ], [ 2, 8 ], [ 2, 9 ], [ 5, 4 ], [ 5, 2 ], [ 6, 1 ], [ 8, 3 ], [ 10, 17 ], [ 10, 16 ], [ 11, 15 ], [ 12, 18 ], [ 12, 19 ], [ 15, 14 ], [ 15, 12 ], [ 16, 11 ], [ 18, 13 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Tracy knows Chris. Angela knows Joan. Julia knows Rose. Kennedy knows Aldo. Tracy knows Damien. Antonio knows Angela. Joan knows Kennedy. Rose knows Jonathan. Cornelius knows Janice. Kennedy knows Lance. Kennedy knows Cornelius. Tracy knows Donald. Rose knows Gloria. Antonio knows Lenora. Gloria knows Guillermo. Guillermo knows Tracy. Chris knows Langston. Bert knows Antonio. Which of Rose and Antonio can Julia reach?", "answer": "Rose", "steps": [ "Julia knows Rose." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Julia", "Guillermo", "Jonathan", "Tracy", "Donald", "Langston", "Rose", "Chris", "Damien", "Gloria", "Bert", "Joan", "Lenora", "Kennedy", "Aldo", "Janice", "Antonio", "Cornelius", "Lance", "Angela" ], "edges": [ [ 0, 6 ], [ 1, 3 ], [ 3, 4 ], [ 3, 7 ], [ 3, 8 ], [ 6, 2 ], [ 6, 9 ], [ 7, 5 ], [ 9, 1 ], [ 10, 16 ], [ 11, 13 ], [ 13, 14 ], [ 13, 17 ], [ 13, 18 ], [ 16, 12 ], [ 16, 19 ], [ 17, 15 ], [ 19, 11 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Federico knows Coral. Jim knows Elvis. Elvis knows Cora. Saul knows Edwin. Grant knows Sandy. Corinne knows Pablo. Gabe knows George. Gabe knows Clifford. Saul knows Grant. Morris knows Cate. Gabe knows Chris. Landon knows Morris. Sandy knows Federico. Clifford knows Landon. Grant knows Corinne. Clifford knows Jim. Pablo knows Jolene. Saul knows Hazel. Which of Cora and Jolene can Saul reach?", "answer": "Jolene", "steps": [ "Saul knows Grant.", "Grant knows Corinne.", "Corinne knows Pablo.", "Pablo knows Jolene." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Saul", "Pablo", "Grant", "Federico", "Sandy", "Corinne", "Coral", "Edwin", "Hazel", "Jolene", "Gabe", "Elvis", "Clifford", "Morris", "Landon", "Jim", "Cate", "George", "Chris", "Cora" ], "edges": [ [ 0, 7 ], [ 0, 8 ], [ 0, 2 ], [ 1, 9 ], [ 2, 4 ], [ 2, 5 ], [ 3, 6 ], [ 4, 3 ], [ 5, 1 ], [ 10, 17 ], [ 10, 18 ], [ 10, 12 ], [ 11, 19 ], [ 12, 14 ], [ 12, 15 ], [ 13, 16 ], [ 14, 13 ], [ 15, 11 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Constance knows Lisette. Drake knows Eldon. Aiden knows Robin. Eldon knows Brock. Cole knows Adele. Cole knows Jacob. Constance knows Lawrence. Constance knows Eileen. Robin knows Diane. Drake knows Craig. Jana knows Etta. Lisette knows Jana. Beth knows Constance. Cole knows Neville. Asher knows Cole. Jacob knows Drake. Jana knows Aiden. Brock knows Emmett. Which of Jana and Drake can Beth reach?", "answer": "Jana", "steps": [ "Beth knows Constance.", "Constance knows Lisette.", "Lisette knows Jana." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Beth", "Lawrence", "Etta", "Aiden", "Robin", "Eileen", "Diane", "Jana", "Constance", "Lisette", "Asher", "Neville", "Craig", "Eldon", "Brock", "Adele", "Emmett", "Drake", "Cole", "Jacob" ], "edges": [ [ 0, 8 ], [ 3, 4 ], [ 4, 6 ], [ 7, 2 ], [ 7, 3 ], [ 8, 1 ], [ 8, 5 ], [ 8, 9 ], [ 9, 7 ], [ 10, 18 ], [ 13, 14 ], [ 14, 16 ], [ 17, 12 ], [ 17, 13 ], [ 18, 11 ], [ 18, 15 ], [ 18, 19 ], [ 19, 17 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Riley knows Edith. Lawson knows Edison. Alvin knows Andre. Trina knows Riley. Riley knows Lionel. Iris knows Wendell. Jeanne knows Lawson. Lionel knows Elliot. Lawson knows Leroy. Rick knows Gary. Alvin knows Clara. Wendell knows Peter. Peter knows Gareth. Gary knows Jeanne. Peter knows Rick. Benjamin knows Trina. Janet knows Alvin. Elliot knows Janet. Which of Trina and Wendell can Benjamin reach?", "answer": "Trina", "steps": [ "Benjamin knows Trina." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Benjamin", "Edith", "Janet", "Trina", "Riley", "Andre", "Lionel", "Clara", "Elliot", "Alvin", "Iris", "Gareth", "Jeanne", "Wendell", "Peter", "Edison", "Rick", "Leroy", "Gary", "Lawson" ], "edges": [ [ 0, 3 ], [ 2, 9 ], [ 3, 4 ], [ 4, 1 ], [ 4, 6 ], [ 6, 8 ], [ 8, 2 ], [ 9, 5 ], [ 9, 7 ], [ 10, 13 ], [ 12, 19 ], [ 13, 14 ], [ 14, 11 ], [ 14, 16 ], [ 16, 18 ], [ 18, 12 ], [ 19, 15 ], [ 19, 17 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Magdalena knows Alice. Logan knows Dale. Willis knows Fletcher. Emery knows Farrah. Logan knows Emery. Karina knows Tonya. Estella knows Frida. Nell knows Magdalena. Magdalena knows Eileen. Willis knows Anastasia. Dale knows Constance. Karina knows Estella. Avery knows Willis. Eileen knows Hope. Tonya knows Yuki. Karina knows Avery. Logan knows Nell. Anastasia knows Neville. Which of Avery and Nell can Logan reach?", "answer": "Nell", "steps": [ "Logan knows Nell." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Logan", "Nell", "Constance", "Emery", "Hope", "Magdalena", "Alice", "Farrah", "Dale", "Eileen", "Karina", "Avery", "Yuki", "Estella", "Neville", "Willis", "Fletcher", "Frida", "Tonya", "Anastasia" ], "edges": [ [ 0, 3 ], [ 0, 8 ], [ 0, 1 ], [ 1, 5 ], [ 3, 7 ], [ 5, 6 ], [ 5, 9 ], [ 8, 2 ], [ 9, 4 ], [ 10, 13 ], [ 10, 18 ], [ 10, 11 ], [ 11, 15 ], [ 13, 17 ], [ 15, 16 ], [ 15, 19 ], [ 18, 12 ], [ 19, 14 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Ray knows Cornelius. Brian knows Rick. Ashley knows Joaquin. Alyson knows Willard. Fred knows Brooks. Aubrey knows Ashley. Ray knows Marion. Brooks knows Aria. Ray knows Hayden. Aubrey knows Alyson. Aubrey knows Brian. Brian knows Darius. Bruce knows Virgil. Bruce knows Ray. Virgil knows June. Willard knows Brynn. Brian knows Dick. Bruce knows Fred. Which of Aria and Brynn can Bruce reach?", "answer": "Aria", "steps": [ "Bruce knows Fred.", "Fred knows Brooks.", "Brooks knows Aria." ], "difficulty": 3, "original_distance": 3, "idx_to_symbol": [ "Bruce", "Brooks", "Hayden", "Marion", "Aria", "Cornelius", "Virgil", "Ray", "June", "Fred", "Aubrey", "Willard", "Darius", "Dick", "Brynn", "Rick", "Ashley", "Brian", "Joaquin", "Alyson" ], "edges": [ [ 0, 7 ], [ 0, 6 ], [ 0, 9 ], [ 1, 4 ], [ 6, 8 ], [ 7, 2 ], [ 7, 3 ], [ 7, 5 ], [ 9, 1 ], [ 10, 17 ], [ 10, 16 ], [ 10, 19 ], [ 11, 14 ], [ 16, 18 ], [ 17, 12 ], [ 17, 13 ], [ 17, 15 ], [ 19, 11 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Gene knows Peggy. Sidney knows Zach. Dina knows Herbert. Ava knows Iris. Bernice knows Morris. Alfred knows Christian. Todd knows Julia. Sidney knows Ava. Adrian knows Todd. Julia knows Wendell. Peggy knows Deborah. Peggy knows Bernice. Todd knows Dina. Herbert knows Sidney. Evan knows Alfred. Elliot knows Gene. Alfred knows Elliot. Christian knows Inez. Which of Herbert and Gene can Evan reach?", "answer": "Gene", "steps": [ "Evan knows Alfred.", "Alfred knows Elliot.", "Elliot knows Gene." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Evan", "Christian", "Bernice", "Elliot", "Morris", "Deborah", "Inez", "Alfred", "Gene", "Peggy", "Adrian", "Julia", "Ava", "Dina", "Iris", "Zach", "Wendell", "Todd", "Herbert", "Sidney" ], "edges": [ [ 0, 7 ], [ 1, 6 ], [ 2, 4 ], [ 3, 8 ], [ 7, 1 ], [ 7, 3 ], [ 8, 9 ], [ 9, 2 ], [ 9, 5 ], [ 10, 17 ], [ 11, 16 ], [ 12, 14 ], [ 13, 18 ], [ 17, 11 ], [ 17, 13 ], [ 18, 19 ], [ 19, 12 ], [ 19, 15 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Marshall knows Leopold. Marshall knows Latoya. Oscar knows Marshall. Clayton knows Harry. Henry knows Estelle. Oscar knows Pam. Marshall knows Otto. Graeme knows Devin. Graeme knows Paul. Paul knows Kobe. Harry knows Elliot. Elliot knows Roger. Paul knows Henry. Brock knows Porter. Estelle knows Finn. Finn knows Brock. Latoya knows Clayton. Paul knows Jolene. Which of Harry and Finn can Graeme reach?", "answer": "Finn", "steps": [ "Graeme knows Paul.", "Paul knows Henry.", "Henry knows Estelle.", "Estelle knows Finn." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Graeme", "Brock", "Jolene", "Paul", "Devin", "Finn", "Henry", "Porter", "Kobe", "Estelle", "Oscar", "Elliot", "Otto", "Marshall", "Pam", "Harry", "Latoya", "Roger", "Leopold", "Clayton" ], "edges": [ [ 0, 4 ], [ 0, 3 ], [ 1, 7 ], [ 3, 2 ], [ 3, 8 ], [ 3, 6 ], [ 5, 1 ], [ 6, 9 ], [ 9, 5 ], [ 10, 14 ], [ 10, 13 ], [ 11, 17 ], [ 13, 12 ], [ 13, 18 ], [ 13, 16 ], [ 15, 11 ], [ 16, 19 ], [ 19, 15 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Helen knows Palmer. Clifford knows Helen. Lacey knows Adelaide. Yasmin knows Louis. Kristin knows Yasmin. Yasmin knows Coral. Dante knows Eli. Yasmin knows Dante. Clifford knows Jaime. Vicki knows Jill. Louis knows Vicki. Clifford knows Etta. Louis knows Camille. Jaime knows Reed. Vicki knows Edgar. Jaime knows Lacey. Josie knows Clifford. Lacey knows Colin. Which of Lacey and Vicki can Josie reach?", "answer": "Lacey", "steps": [ "Josie knows Clifford.", "Clifford knows Jaime.", "Jaime knows Lacey." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Josie", "Clifford", "Etta", "Helen", "Palmer", "Jaime", "Adelaide", "Colin", "Reed", "Lacey", "Kristin", "Yasmin", "Coral", "Dante", "Eli", "Louis", "Jill", "Edgar", "Camille", "Vicki" ], "edges": [ [ 0, 1 ], [ 1, 2 ], [ 1, 3 ], [ 1, 5 ], [ 3, 4 ], [ 5, 8 ], [ 5, 9 ], [ 9, 6 ], [ 9, 7 ], [ 10, 11 ], [ 11, 12 ], [ 11, 13 ], [ 11, 15 ], [ 13, 14 ], [ 15, 18 ], [ 15, 19 ], [ 19, 16 ], [ 19, 17 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Abel knows Fiona. Rosemary knows Annette. Trevor knows Archie. Geraldine knows Aubrey. Fiona knows Jamie. Archie knows Abel. Ken knows Trevor. Jamie knows Jorge. Thea knows Stefan. Dell knows Valerie. Archie knows Geraldine. Valerie knows Ford. Rosemary knows Porter. Stefan knows Rosemary. Annette knows Bernadette. Bernadette knows Edith. Porter knows Dell. Aubrey knows Fern. Which of Porter and Abel can Thea reach?", "answer": "Porter", "steps": [ "Thea knows Stefan.", "Stefan knows Rosemary.", "Rosemary knows Porter." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Thea", "Valerie", "Edith", "Porter", "Bernadette", "Rosemary", "Stefan", "Dell", "Annette", "Ford", "Ken", "Jamie", "Fern", "Abel", "Aubrey", "Archie", "Trevor", "Fiona", "Geraldine", "Jorge" ], "edges": [ [ 0, 6 ], [ 1, 9 ], [ 3, 7 ], [ 4, 2 ], [ 5, 8 ], [ 5, 3 ], [ 6, 5 ], [ 7, 1 ], [ 8, 4 ], [ 10, 16 ], [ 11, 19 ], [ 13, 17 ], [ 14, 12 ], [ 15, 18 ], [ 15, 13 ], [ 16, 15 ], [ 17, 11 ], [ 18, 14 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Kira knows Samuel. Natalie knows Julia. Earl knows Hubert. Hilda knows Carla. Cruz knows Billy. Cruz knows Shaun. Harper knows Jean. Harper knows Hilda. Julia knows Kira. Gordon knows Harper. Levi knows Donald. Levi knows Earl. Billy knows Alder. Hubert knows Merle. Ashton knows Levi. Jean knows Cruz. Julia knows Ashton. Alder knows Homer. Which of Hubert and Alder can Natalie reach?", "answer": "Hubert", "steps": [ "Natalie knows Julia.", "Julia knows Ashton.", "Ashton knows Levi.", "Levi knows Earl.", "Earl knows Hubert." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Natalie", "Merle", "Levi", "Donald", "Earl", "Ashton", "Hubert", "Samuel", "Julia", "Kira", "Gordon", "Homer", "Cruz", "Shaun", "Billy", "Jean", "Alder", "Carla", "Harper", "Hilda" ], "edges": [ [ 0, 8 ], [ 2, 3 ], [ 2, 4 ], [ 4, 6 ], [ 5, 2 ], [ 6, 1 ], [ 8, 5 ], [ 8, 9 ], [ 9, 7 ], [ 10, 18 ], [ 12, 13 ], [ 12, 14 ], [ 14, 16 ], [ 15, 12 ], [ 16, 11 ], [ 18, 15 ], [ 18, 19 ], [ 19, 17 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Ava knows Rebecca. Rebecca knows Ross. Ian knows Cole. Florence knows Antonio. Livia knows Lloyd. Gemma knows Esther. Gemma knows Ian. Florence knows Ava. Harlan knows Max. Rebecca knows Tristan. Rosemary knows Florence. Cole knows Alyson. Tristan knows Greg. Harlan knows Rosemary. Cole knows Nicole. Louise knows Samantha. Nicole knows Louise. Louise knows Livia. Which of Cole and Florence can Gemma reach?", "answer": "Cole", "steps": [ "Gemma knows Ian.", "Ian knows Cole." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Gemma", "Samantha", "Ian", "Livia", "Cole", "Louise", "Esther", "Nicole", "Lloyd", "Alyson", "Harlan", "Ross", "Rosemary", "Tristan", "Florence", "Rebecca", "Max", "Ava", "Greg", "Antonio" ], "edges": [ [ 0, 6 ], [ 0, 2 ], [ 2, 4 ], [ 3, 8 ], [ 4, 7 ], [ 4, 9 ], [ 5, 1 ], [ 5, 3 ], [ 7, 5 ], [ 10, 16 ], [ 10, 12 ], [ 12, 14 ], [ 13, 18 ], [ 14, 17 ], [ 14, 19 ], [ 15, 11 ], [ 15, 13 ], [ 17, 15 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Kira knows Tina. Curtis knows Hugo. Sybil knows Patricia. Denise knows Fleur. Rita knows Keith. Keith knows Dawn. Rita knows Erma. Joyce knows Marion. Sybil knows Rita. Joyce knows Billy. Fleur knows Kira. Spencer knows Demetrius. Billy knows Yolanda. Alex knows Carter. Curtis knows Sybil. Hugo knows Alex. Denise knows Spencer. Spencer knows Joyce. Which of Keith and Billy can Denise reach?", "answer": "Billy", "steps": [ "Denise knows Spencer.", "Spencer knows Joyce.", "Joyce knows Billy." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Denise", "Fleur", "Marion", "Billy", "Tina", "Joyce", "Kira", "Yolanda", "Demetrius", "Spencer", "Curtis", "Hugo", "Erma", "Keith", "Carter", "Rita", "Alex", "Dawn", "Patricia", "Sybil" ], "edges": [ [ 0, 1 ], [ 0, 9 ], [ 1, 6 ], [ 3, 7 ], [ 5, 2 ], [ 5, 3 ], [ 6, 4 ], [ 9, 5 ], [ 9, 8 ], [ 10, 11 ], [ 10, 19 ], [ 11, 16 ], [ 13, 17 ], [ 15, 12 ], [ 15, 13 ], [ 16, 14 ], [ 19, 15 ], [ 19, 18 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Beau knows Fleur. Frances knows Beau. Hazel knows Dee. Alejandro knows Tony. Frances knows Lillian. Frankie knows Gail. Dolores knows Kira. Georgia knows Dirk. Dee knows Anton. Frankie knows Hazel. Lillian knows Virginia. Dirk knows Frances. Frances knows Alejandro. Dirk knows Juan. Federico knows Frankie. Hazel knows Dolores. Hazel knows Jasper. Jasper knows Melissa. Which of Dirk and Frankie can Georgia reach?", "answer": "Dirk", "steps": [ "Georgia knows Dirk." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Georgia", "Fleur", "Juan", "Virginia", "Frances", "Dirk", "Alejandro", "Lillian", "Tony", "Beau", "Federico", "Kira", "Gail", "Melissa", "Hazel", "Frankie", "Dee", "Jasper", "Anton", "Dolores" ], "edges": [ [ 0, 5 ], [ 4, 7 ], [ 4, 6 ], [ 4, 9 ], [ 5, 2 ], [ 5, 4 ], [ 6, 8 ], [ 7, 3 ], [ 9, 1 ], [ 10, 15 ], [ 14, 17 ], [ 14, 16 ], [ 14, 19 ], [ 15, 12 ], [ 15, 14 ], [ 16, 18 ], [ 17, 13 ], [ 19, 11 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Xavier knows Ben. Lorna knows Sandra. Patricia knows Carlos. Yuki knows Patricia. Maude knows Allan. Tyler knows Xavier. Lamont knows Kai. Hannah knows Laverne. Xavier knows Lamont. Patricia knows Wade. Xavier knows Lorna. Rick knows Tyler. Laverne knows Rick. Sadie knows Maude. Wade knows Hector. Patricia knows Skyler. Skyler knows Arden. Allan knows Yuki. Which of Xavier and Patricia can Sadie reach?", "answer": "Patricia", "steps": [ "Sadie knows Maude.", "Maude knows Allan.", "Allan knows Yuki.", "Yuki knows Patricia." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Sadie", "Hector", "Yuki", "Patricia", "Allan", "Carlos", "Maude", "Arden", "Skyler", "Wade", "Hannah", "Kai", "Tyler", "Xavier", "Rick", "Ben", "Laverne", "Sandra", "Lorna", "Lamont" ], "edges": [ [ 0, 6 ], [ 2, 3 ], [ 3, 5 ], [ 3, 8 ], [ 3, 9 ], [ 4, 2 ], [ 6, 4 ], [ 8, 7 ], [ 9, 1 ], [ 10, 16 ], [ 12, 13 ], [ 13, 15 ], [ 13, 18 ], [ 13, 19 ], [ 14, 12 ], [ 16, 14 ], [ 18, 17 ], [ 19, 11 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Marilyn knows Jewel. Aisha knows Martha. Kirsten knows Federico. Lois knows Everett. Winifred knows Sandra. Everett knows Ruby. Miranda knows Winifred. Alvin knows Patrick. Winifred knows Dave. Gwen knows Brett. Martha knows Gwen. Carrie knows Alvin. Julius knows Lois. Brett knows Marilyn. Dave knows Aisha. Lois knows Frances. Ruby knows Carrie. Patrick knows Kirsten. Which of Marilyn and Kirsten can Julius reach?", "answer": "Kirsten", "steps": [ "Julius knows Lois.", "Lois knows Everett.", "Everett knows Ruby.", "Ruby knows Carrie.", "Carrie knows Alvin.", "Alvin knows Patrick.", "Patrick knows Kirsten." ], "difficulty": 7, "original_distance": 8, "idx_to_symbol": [ "Julius", "Carrie", "Kirsten", "Federico", "Ruby", "Everett", "Patrick", "Alvin", "Frances", "Lois", "Miranda", "Martha", "Marilyn", "Jewel", "Aisha", "Dave", "Brett", "Gwen", "Sandra", "Winifred" ], "edges": [ [ 0, 9 ], [ 1, 7 ], [ 2, 3 ], [ 4, 1 ], [ 5, 4 ], [ 6, 2 ], [ 7, 6 ], [ 9, 5 ], [ 9, 8 ], [ 10, 19 ], [ 11, 17 ], [ 12, 13 ], [ 14, 11 ], [ 15, 14 ], [ 16, 12 ], [ 17, 16 ], [ 19, 15 ], [ 19, 18 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Spencer knows Archer. Victor knows Gemma. Victor knows Margaret. Luna knows Dawn. Dawn knows Preston. Camille knows Pablo. Patrick knows Luna. Kerry knows Kent. Kobe knows Kay. Archer knows Kerry. Jacqueline knows Spencer. Gemma knows Farrah. Margaret knows Zane. Archer knows Kobe. Spencer knows Camille. Jacqueline knows Jeanette. Patrick knows Patricia. Luna knows Victor. Which of Spencer and Luna can Jacqueline reach?", "answer": "Spencer", "steps": [ "Jacqueline knows Spencer." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Jacqueline", "Pablo", "Camille", "Archer", "Kay", "Kobe", "Jeanette", "Spencer", "Kerry", "Kent", "Patrick", "Preston", "Dawn", "Victor", "Zane", "Margaret", "Patricia", "Luna", "Gemma", "Farrah" ], "edges": [ [ 0, 6 ], [ 0, 7 ], [ 2, 1 ], [ 3, 5 ], [ 3, 8 ], [ 5, 4 ], [ 7, 2 ], [ 7, 3 ], [ 8, 9 ], [ 10, 16 ], [ 10, 17 ], [ 12, 11 ], [ 13, 15 ], [ 13, 18 ], [ 15, 14 ], [ 17, 12 ], [ 17, 13 ], [ 18, 19 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Dennis knows Atlas. Ainsley knows Cristina. Hampton knows Dennis. Jacques knows Ross. Rose knows Harlan. Tabitha knows Graham. Rose knows Jacques. Cristina knows Justine. Harlan knows Tabitha. Atlas knows Jean. Graham knows Jennifer. Jacques knows Gerard. Justine knows Susanne. Dennis knows Clayton. Jean knows Linda. Beau knows Erica. Hampton knows Ainsley. Gerard knows Beau. Which of Dennis and Jacques can Rose reach?", "answer": "Jacques", "steps": [ "Rose knows Jacques." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Rose", "Erica", "Tabitha", "Graham", "Jennifer", "Ross", "Jacques", "Harlan", "Gerard", "Beau", "Hampton", "Linda", "Cristina", "Justine", "Susanne", "Clayton", "Dennis", "Ainsley", "Atlas", "Jean" ], "edges": [ [ 0, 7 ], [ 0, 6 ], [ 2, 3 ], [ 3, 4 ], [ 6, 5 ], [ 6, 8 ], [ 7, 2 ], [ 8, 9 ], [ 9, 1 ], [ 10, 17 ], [ 10, 16 ], [ 12, 13 ], [ 13, 14 ], [ 16, 15 ], [ 16, 18 ], [ 17, 12 ], [ 18, 19 ], [ 19, 11 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Amber knows Valerie. Dirk knows Jonas. Herman knows Chloe. Chloe knows Amber. Lucille knows Eugenia. Bart knows Dirk. Chloe knows Lucille. Penny knows Bert. Amber knows Janice. Bert knows Fletcher. Fletcher knows Jeff. Gabe knows Josie. Frida knows Julio. Sean knows Penny. Janice knows Bart. Penny knows Frida. Jeff knows Gabe. Bert knows Lisa. Which of Bart and Jeff can Sean reach?", "answer": "Jeff", "steps": [ "Sean knows Penny.", "Penny knows Bert.", "Bert knows Fletcher.", "Fletcher knows Jeff." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Sean", "Lisa", "Frida", "Penny", "Gabe", "Jeff", "Fletcher", "Josie", "Bert", "Julio", "Herman", "Valerie", "Lucille", "Chloe", "Dirk", "Bart", "Janice", "Jonas", "Amber", "Eugenia" ], "edges": [ [ 0, 3 ], [ 2, 9 ], [ 3, 8 ], [ 3, 2 ], [ 4, 7 ], [ 5, 4 ], [ 6, 5 ], [ 8, 1 ], [ 8, 6 ], [ 10, 13 ], [ 12, 19 ], [ 13, 18 ], [ 13, 12 ], [ 14, 17 ], [ 15, 14 ], [ 16, 15 ], [ 18, 11 ], [ 18, 16 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Morris knows Brynn. Morris knows Hugh. Darin knows Kristin. Erin knows Pam. Jolena knows Cristina. Nathan knows Jolena. James knows Nathan. Brynn knows Reed. Tina knows Vincent. Nathan knows Darin. Hugh knows Ellen. Morris knows August. Natalie knows Desmond. August knows Gene. Reed knows Natalie. Kristin knows Tina. Peter knows Morris. Nathan knows Erin. Which of Darin and Brynn can James reach?", "answer": "Darin", "steps": [ "James knows Nathan.", "Nathan knows Darin." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "James", "Cristina", "Vincent", "Jolena", "Erin", "Darin", "Tina", "Pam", "Kristin", "Nathan", "Peter", "Gene", "Desmond", "August", "Hugh", "Brynn", "Natalie", "Ellen", "Reed", "Morris" ], "edges": [ [ 0, 9 ], [ 3, 1 ], [ 4, 7 ], [ 5, 8 ], [ 6, 2 ], [ 8, 6 ], [ 9, 3 ], [ 9, 4 ], [ 9, 5 ], [ 10, 19 ], [ 13, 11 ], [ 14, 17 ], [ 15, 18 ], [ 16, 12 ], [ 18, 16 ], [ 19, 13 ], [ 19, 14 ], [ 19, 15 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Ryan knows Javier. Dustin knows Ava. Ryan knows Wyatt. Carol knows Luke. Abel knows Kristin. Abel knows Preston. Wyatt knows Paige. Griffith knows Eleanor. Preston knows Darrell. Ryan knows Dustin. Kristin knows Carol. Dustin knows Colby. Landon knows Dayton. Don knows Landon. Luke knows Hampton. Javier knows Don. Griffith knows Larry. Abel knows Griffith. Which of Javier and Kristin can Ryan reach?", "answer": "Javier", "steps": [ "Ryan knows Javier." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Ryan", "Javier", "Dustin", "Paige", "Dayton", "Wyatt", "Ava", "Colby", "Landon", "Don", "Abel", "Kristin", "Griffith", "Darrell", "Hampton", "Preston", "Eleanor", "Larry", "Luke", "Carol" ], "edges": [ [ 0, 5 ], [ 0, 2 ], [ 0, 1 ], [ 1, 9 ], [ 2, 6 ], [ 2, 7 ], [ 5, 3 ], [ 8, 4 ], [ 9, 8 ], [ 10, 15 ], [ 10, 12 ], [ 10, 11 ], [ 11, 19 ], [ 12, 16 ], [ 12, 17 ], [ 15, 13 ], [ 18, 14 ], [ 19, 18 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Ryan knows Javier. Dustin knows Ava. Ryan knows Wyatt. Carol knows Luke. Abel knows Kristin. Abel knows Preston. Wyatt knows Paige. Griffith knows Eleanor. Preston knows Darrell. Ryan knows Dustin. Kristin knows Carol. Dustin knows Colby. Landon knows Dayton. Don knows Landon. Luke knows Hampton. Javier knows Don. Griffith knows Larry. Abel knows Griffith. Which of Luke and Landon can Ryan reach?", "answer": "Landon", "steps": [ "Ryan knows Javier.", "Javier knows Don.", "Don knows Landon." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Ryan", "Javier", "Dustin", "Paige", "Dayton", "Wyatt", "Ava", "Colby", "Landon", "Don", "Abel", "Kristin", "Griffith", "Darrell", "Hampton", "Preston", "Eleanor", "Larry", "Luke", "Carol" ], "edges": [ [ 0, 5 ], [ 0, 2 ], [ 0, 1 ], [ 1, 9 ], [ 2, 6 ], [ 2, 7 ], [ 5, 3 ], [ 8, 4 ], [ 9, 8 ], [ 10, 15 ], [ 10, 12 ], [ 10, 11 ], [ 11, 19 ], [ 12, 16 ], [ 12, 17 ], [ 15, 13 ], [ 18, 14 ], [ 19, 18 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Liam knows Cassidy. Jill knows Clarence. Chester knows Elsa. George knows Guillermo. Israel knows Cornelius. Guillermo knows Enrique. Cassidy knows George. Whitney knows Marlene. George knows Dawn. Chester knows Kent. Chester knows Jana. Marlene knows Elvis. Elvis knows Chester. Clarence knows Kerry. Kent knows Crystal. Jill knows Liam. George knows Becky. Whitney knows Israel. Which of Chester and George can Whitney reach?", "answer": "Chester", "steps": [ "Whitney knows Marlene.", "Marlene knows Elvis.", "Elvis knows Chester." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Whitney", "Kent", "Crystal", "Israel", "Jana", "Chester", "Cornelius", "Elsa", "Elvis", "Marlene", "Jill", "Guillermo", "Enrique", "Clarence", "Dawn", "George", "Kerry", "Becky", "Cassidy", "Liam" ], "edges": [ [ 0, 3 ], [ 0, 9 ], [ 1, 2 ], [ 3, 6 ], [ 5, 1 ], [ 5, 4 ], [ 5, 7 ], [ 8, 5 ], [ 9, 8 ], [ 10, 13 ], [ 10, 19 ], [ 11, 12 ], [ 13, 16 ], [ 15, 11 ], [ 15, 14 ], [ 15, 17 ], [ 18, 15 ], [ 19, 18 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Carrie knows June. Alfonso knows Bailey. Claude knows Gloria. Gertrude knows Jenna. Carrie knows Gertrude. Rebecca knows Heath. Kane knows Gabriel. Kane knows Rebecca. June knows Alfonso. Kane knows Forrest. Veronica knows Felix. Gabriel knows Claude. Forrest knows Jacob. Gloria knows Ellis. Carrie knows Veronica. Gertrude knows Greg. Bailey knows Dayton. Rebecca knows Jack. Which of Claude and Alfonso can Kane reach?", "answer": "Claude", "steps": [ "Kane knows Gabriel.", "Gabriel knows Claude." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Kane", "Jack", "Claude", "Forrest", "Ellis", "Gabriel", "Jacob", "Gloria", "Rebecca", "Heath", "Carrie", "Greg", "Alfonso", "Veronica", "Dayton", "June", "Felix", "Bailey", "Gertrude", "Jenna" ], "edges": [ [ 0, 3 ], [ 0, 5 ], [ 0, 8 ], [ 2, 7 ], [ 3, 6 ], [ 5, 2 ], [ 7, 4 ], [ 8, 1 ], [ 8, 9 ], [ 10, 13 ], [ 10, 15 ], [ 10, 18 ], [ 12, 17 ], [ 13, 16 ], [ 15, 12 ], [ 17, 14 ], [ 18, 11 ], [ 18, 19 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Paula knows Barney. Scott knows Derek. Grover knows Thomas. Saul knows Ruby. Paula knows Wallace. Paula knows Griffith. Saul knows Grover. Clyde knows Scott. Chad knows Harlan. Thomas knows Deirdre. Barney knows Walter. Saul knows Frances. Saul knows Emery. Emery knows Chad. Paula knows Clyde. Walter knows Shelly. Emery knows Faye. Barney knows Hampton. Which of Barney and Emery can Saul reach?", "answer": "Emery", "steps": [ "Saul knows Emery." ], "difficulty": 1, "original_distance": 3, "idx_to_symbol": [ "Saul", "Grover", "Deirdre", "Chad", "Ruby", "Faye", "Thomas", "Harlan", "Frances", "Emery", "Paula", "Clyde", "Derek", "Walter", "Griffith", "Hampton", "Scott", "Shelly", "Wallace", "Barney" ], "edges": [ [ 0, 4 ], [ 0, 1 ], [ 0, 8 ], [ 0, 9 ], [ 1, 6 ], [ 3, 7 ], [ 6, 2 ], [ 9, 5 ], [ 9, 3 ], [ 10, 14 ], [ 10, 11 ], [ 10, 18 ], [ 10, 19 ], [ 11, 16 ], [ 13, 17 ], [ 16, 12 ], [ 19, 15 ], [ 19, 13 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Earl knows Clement. Joan knows Belinda. Roger knows Isiah. Jessica knows Deborah. Simon knows Landon. Russ knows Jessica. Gage knows Joan. Dewey knows Teresa. Belinda knows Tanya. Isiah knows Jules. Landon knows Russ. Abel knows Gus. Joan knows Abel. Gus knows Jenny. Gus knows Roger. Landon knows Andre. Teresa knows Earl. Teresa knows Simon. Which of Abel and Simon can Gage reach?", "answer": "Abel", "steps": [ "Gage knows Joan.", "Joan knows Abel." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Gage", "Joan", "Abel", "Jenny", "Roger", "Jules", "Isiah", "Gus", "Tanya", "Belinda", "Dewey", "Teresa", "Simon", "Andre", "Russ", "Deborah", "Jessica", "Landon", "Clement", "Earl" ], "edges": [ [ 0, 1 ], [ 1, 2 ], [ 1, 9 ], [ 2, 7 ], [ 4, 6 ], [ 6, 5 ], [ 7, 3 ], [ 7, 4 ], [ 9, 8 ], [ 10, 11 ], [ 11, 12 ], [ 11, 19 ], [ 12, 17 ], [ 14, 16 ], [ 16, 15 ], [ 17, 13 ], [ 17, 14 ], [ 19, 18 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Richard knows Erin. Darrell knows Hank. Ainsley knows Darla. Hamilton knows Elliot. Elliot knows Maude. Elliot knows Mack. Darla knows Reed. Richard knows Dean. Elliot knows Shawn. Aurora knows Jason. Dean knows Aurora. Dominic knows Jorge. Aurora knows Ainsley. Aurora knows Enrique. Dominic knows Hamilton. Maude knows Darrell. Darrell knows Connor. Darla knows Joyce. Which of Elliot and Aurora can Richard reach?", "answer": "Aurora", "steps": [ "Richard knows Dean.", "Dean knows Aurora." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Richard", "Enrique", "Dean", "Ainsley", "Reed", "Darla", "Jason", "Joyce", "Aurora", "Erin", "Dominic", "Shawn", "Hamilton", "Maude", "Connor", "Darrell", "Mack", "Hank", "Elliot", "Jorge" ], "edges": [ [ 0, 2 ], [ 0, 9 ], [ 2, 8 ], [ 3, 5 ], [ 5, 4 ], [ 5, 7 ], [ 8, 1 ], [ 8, 6 ], [ 8, 3 ], [ 10, 12 ], [ 10, 19 ], [ 12, 18 ], [ 13, 15 ], [ 15, 14 ], [ 15, 17 ], [ 18, 11 ], [ 18, 16 ], [ 18, 13 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Fernando knows Marcia. Fraser knows Doris. Donovan knows Hailey. Hailey knows Marie. Howard knows Gwen. Roy knows Peggy. Hailey knows John. Doris knows Lyle. Marcia knows Howard. John knows Roy. Peggy knows Larissa. Marie knows Atlas. Peggy knows Carmen. Fraser knows Fernando. Howard knows Patricia. Peggy knows Elizabeth. Howard knows Kay. Sam knows Fraser. Which of Kay and Carmen can Sam reach?", "answer": "Kay", "steps": [ "Sam knows Fraser.", "Fraser knows Fernando.", "Fernando knows Marcia.", "Marcia knows Howard.", "Howard knows Kay." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Sam", "Fernando", "Lyle", "Fraser", "Doris", "Marcia", "Gwen", "Patricia", "Kay", "Howard", "Donovan", "John", "Atlas", "Hailey", "Marie", "Roy", "Elizabeth", "Larissa", "Carmen", "Peggy" ], "edges": [ [ 0, 3 ], [ 1, 5 ], [ 3, 4 ], [ 3, 1 ], [ 4, 2 ], [ 5, 9 ], [ 9, 6 ], [ 9, 7 ], [ 9, 8 ], [ 10, 13 ], [ 11, 15 ], [ 13, 14 ], [ 13, 11 ], [ 14, 12 ], [ 15, 19 ], [ 19, 16 ], [ 19, 17 ], [ 19, 18 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Jesse knows Marcia. Victor knows Lucas. Lucas knows Tabitha. Jarvis knows Jeff. Wallace knows Jarvis. Vicki knows Jesse. Anthony knows Todd. Anthony knows Verna. Verna knows Maya. Albert knows Gemma. Todd knows Wallace. Cornelius knows Anthony. Nancy knows Vicki. Gemma knows Victor. Blanche knows Iris. Tabitha knows Drew. Vicki knows Albert. Jeff knows Blanche. Which of Blanche and Tabitha can Cornelius reach?", "answer": "Blanche", "steps": [ "Cornelius knows Anthony.", "Anthony knows Todd.", "Todd knows Wallace.", "Wallace knows Jarvis.", "Jarvis knows Jeff.", "Jeff knows Blanche." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Cornelius", "Jeff", "Blanche", "Anthony", "Todd", "Wallace", "Iris", "Jarvis", "Maya", "Verna", "Nancy", "Lucas", "Tabitha", "Vicki", "Albert", "Gemma", "Drew", "Victor", "Marcia", "Jesse" ], "edges": [ [ 0, 3 ], [ 1, 2 ], [ 2, 6 ], [ 3, 4 ], [ 3, 9 ], [ 4, 5 ], [ 5, 7 ], [ 7, 1 ], [ 9, 8 ], [ 10, 13 ], [ 11, 12 ], [ 12, 16 ], [ 13, 14 ], [ 13, 19 ], [ 14, 15 ], [ 15, 17 ], [ 17, 11 ], [ 19, 18 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "June knows Hattie. Rita knows Daria. Jeanette knows Perry. Beverly knows Jeanette. Rita knows Langston. Alejandro knows Lyle. Susan knows June. Hattie knows Saul. Milo knows Hilda. Verna knows Luz. Alejandro knows Shelly. Lars knows Alejandro. Perry knows Rita. Hilda knows Beverly. Alejandro knows Verna. Emily knows Owen. Saul knows Lars. Rita knows Emily. Which of Alejandro and Rita can Susan reach?", "answer": "Alejandro", "steps": [ "Susan knows June.", "June knows Hattie.", "Hattie knows Saul.", "Saul knows Lars.", "Lars knows Alejandro." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Susan", "Hattie", "Luz", "Alejandro", "Lars", "Shelly", "Lyle", "Verna", "Saul", "June", "Milo", "Beverly", "Owen", "Rita", "Perry", "Daria", "Langston", "Emily", "Jeanette", "Hilda" ], "edges": [ [ 0, 9 ], [ 1, 8 ], [ 3, 5 ], [ 3, 6 ], [ 3, 7 ], [ 4, 3 ], [ 7, 2 ], [ 8, 4 ], [ 9, 1 ], [ 10, 19 ], [ 11, 18 ], [ 13, 15 ], [ 13, 16 ], [ 13, 17 ], [ 14, 13 ], [ 17, 12 ], [ 18, 14 ], [ 19, 11 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Sadie knows Brynn. Marco knows Eve. Haley knows Sadie. Stefan knows Dee. Valerie knows Bonnie. Morris knows Susanne. Bonnie knows Elvira. Amy knows Jodi. Cameron knows Amy. Cordelia knows Haley. Dee knows Eli. Sadie knows Deborah. Fergus knows Zachary. Amy knows Stefan. Marco knows Cameron. Deborah knows Morris. Zachary knows Marco. Morris knows Valerie. Which of Stefan and Valerie can Cordelia reach?", "answer": "Valerie", "steps": [ "Cordelia knows Haley.", "Haley knows Sadie.", "Sadie knows Deborah.", "Deborah knows Morris.", "Morris knows Valerie." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Cordelia", "Elvira", "Brynn", "Susanne", "Sadie", "Valerie", "Morris", "Bonnie", "Haley", "Deborah", "Fergus", "Eli", "Eve", "Jodi", "Marco", "Stefan", "Amy", "Dee", "Zachary", "Cameron" ], "edges": [ [ 0, 8 ], [ 4, 2 ], [ 4, 9 ], [ 5, 7 ], [ 6, 3 ], [ 6, 5 ], [ 7, 1 ], [ 8, 4 ], [ 9, 6 ], [ 10, 18 ], [ 14, 12 ], [ 14, 19 ], [ 15, 17 ], [ 16, 13 ], [ 16, 15 ], [ 17, 11 ], [ 18, 14 ], [ 19, 16 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Ada knows Garrison. Ruth knows Layla. Greg knows Matt. Garrison knows Keith. Keith knows Lyle. Eden knows Cain. Livia knows Michelle. Priscilla knows Ruth. Eli knows Lucia. Eden knows Chris. Eli knows Eden. Greg knows Blanche. Chris knows Stella. Garrison knows Greg. Cain knows Priscilla. Chris knows Jermaine. Ada knows Abigail. Lyle knows Livia. Which of Keith and Cain can Ada reach?", "answer": "Keith", "steps": [ "Ada knows Garrison.", "Garrison knows Keith." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Ada", "Blanche", "Garrison", "Lyle", "Michelle", "Greg", "Livia", "Abigail", "Matt", "Keith", "Eli", "Jermaine", "Eden", "Priscilla", "Layla", "Chris", "Ruth", "Lucia", "Stella", "Cain" ], "edges": [ [ 0, 7 ], [ 0, 2 ], [ 2, 5 ], [ 2, 9 ], [ 3, 6 ], [ 5, 1 ], [ 5, 8 ], [ 6, 4 ], [ 9, 3 ], [ 10, 17 ], [ 10, 12 ], [ 12, 15 ], [ 12, 19 ], [ 13, 16 ], [ 15, 11 ], [ 15, 18 ], [ 16, 14 ], [ 19, 13 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Ariana knows Rhea. Destiny knows Peggy. Keith knows Gideon. Will knows Lyric. Heath knows Virginia. Ember knows Jerome. Viola knows Heath. Heath knows Will. Destiny knows Margaret. Destiny knows Blair. Blaine knows Ariana. Gideon knows Destiny. Rhea knows Viola. Heath knows Abigail. Jerome knows Keith. Peggy knows Erwin. Peggy knows Tony. Will knows Nicole. Which of Ariana and Jerome can Ember reach?", "answer": "Jerome", "steps": [ "Ember knows Jerome." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Ember", "Erwin", "Tony", "Blair", "Jerome", "Gideon", "Peggy", "Destiny", "Keith", "Margaret", "Blaine", "Nicole", "Lyric", "Abigail", "Ariana", "Viola", "Will", "Heath", "Rhea", "Virginia" ], "edges": [ [ 0, 4 ], [ 4, 8 ], [ 5, 7 ], [ 6, 1 ], [ 6, 2 ], [ 7, 3 ], [ 7, 6 ], [ 7, 9 ], [ 8, 5 ], [ 10, 14 ], [ 14, 18 ], [ 15, 17 ], [ 16, 11 ], [ 16, 12 ], [ 17, 13 ], [ 17, 16 ], [ 17, 19 ], [ 18, 15 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Hannah knows Kendrick. Melody knows Pat. Hannah knows Malcolm. Gavin knows Lionel. Lionel knows Lyle. Gavin knows Yuki. Enid knows Jack. Gavin knows Hayes. Hannah knows Adele. Stephanie knows Ivan. Kendrick knows Tanya. Enid knows Hannah. Ashton knows Edward. Melody knows Magdalena. Stephanie knows Ashton. Ashton knows Christopher. Stephanie knows Gavin. Enid knows Melody. Which of Gavin and Hannah can Stephanie reach?", "answer": "Gavin", "steps": [ "Stephanie knows Gavin." ], "difficulty": 1, "original_distance": 3, "idx_to_symbol": [ "Stephanie", "Ashton", "Lionel", "Gavin", "Lyle", "Yuki", "Christopher", "Ivan", "Hayes", "Edward", "Enid", "Melody", "Kendrick", "Hannah", "Tanya", "Malcolm", "Pat", "Jack", "Adele", "Magdalena" ], "edges": [ [ 0, 7 ], [ 0, 3 ], [ 0, 1 ], [ 1, 6 ], [ 1, 9 ], [ 2, 4 ], [ 3, 2 ], [ 3, 5 ], [ 3, 8 ], [ 10, 17 ], [ 10, 13 ], [ 10, 11 ], [ 11, 16 ], [ 11, 19 ], [ 12, 14 ], [ 13, 12 ], [ 13, 15 ], [ 13, 18 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Constance knows Lisette. Drake knows Eldon. Aiden knows Robin. Eldon knows Brock. Cole knows Adele. Cole knows Jacob. Constance knows Lawrence. Constance knows Eileen. Robin knows Diane. Drake knows Craig. Jana knows Etta. Lisette knows Jana. Beth knows Constance. Cole knows Neville. Asher knows Cole. Jacob knows Drake. Jana knows Aiden. Brock knows Emmett. Which of Lisette and Jacob can Beth reach?", "answer": "Lisette", "steps": [ "Beth knows Constance.", "Constance knows Lisette." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Beth", "Lawrence", "Etta", "Aiden", "Robin", "Eileen", "Diane", "Jana", "Constance", "Lisette", "Asher", "Neville", "Craig", "Eldon", "Brock", "Adele", "Emmett", "Drake", "Cole", "Jacob" ], "edges": [ [ 0, 8 ], [ 3, 4 ], [ 4, 6 ], [ 7, 2 ], [ 7, 3 ], [ 8, 1 ], [ 8, 5 ], [ 8, 9 ], [ 9, 7 ], [ 10, 18 ], [ 13, 14 ], [ 14, 16 ], [ 17, 12 ], [ 17, 13 ], [ 18, 11 ], [ 18, 15 ], [ 18, 19 ], [ 19, 17 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Vera knows Cassidy. Florence knows Tina. Dean knows Blanche. Celeste knows Magdalena. Kai knows Leo. Brandon knows Faith. Celeste knows Vera. Faith knows Samantha. Dean knows Drake. Virgil knows Brandon. Florence knows Dean. Greg knows Kai. Greg knows Jamie. Kirsten knows Celeste. Brandon knows Sheryl. Blanche knows Greg. Vera knows Virgil. Leigh knows Florence. Which of Kai and Faith can Leigh reach?", "answer": "Kai", "steps": [ "Leigh knows Florence.", "Florence knows Dean.", "Dean knows Blanche.", "Blanche knows Greg.", "Greg knows Kai." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Leigh", "Blanche", "Kai", "Greg", "Jamie", "Dean", "Leo", "Drake", "Florence", "Tina", "Kirsten", "Virgil", "Faith", "Brandon", "Sheryl", "Vera", "Samantha", "Cassidy", "Celeste", "Magdalena" ], "edges": [ [ 0, 8 ], [ 1, 3 ], [ 2, 6 ], [ 3, 4 ], [ 3, 2 ], [ 5, 1 ], [ 5, 7 ], [ 8, 5 ], [ 8, 9 ], [ 10, 18 ], [ 11, 13 ], [ 12, 16 ], [ 13, 14 ], [ 13, 12 ], [ 15, 11 ], [ 15, 17 ], [ 18, 15 ], [ 18, 19 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Bennett knows Miranda. Stephen knows Marian. Bennett knows Ruby. Miranda knows Claude. Celia knows Dana. Stephen knows Alejandro. Fergus knows Celia. Bernadette knows Blanche. Celia knows Morgan. Dana knows Pam. Dana knows Lambert. Bennett knows Stephen. Bennett knows Sierra. Jude knows Devin. Celia knows Logan. Devin knows Bennett. Celia knows Bernadette. Heidi knows Fergus. Which of Celia and Bennett can Heidi reach?", "answer": "Celia", "steps": [ "Heidi knows Fergus.", "Fergus knows Celia." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Heidi", "Fergus", "Blanche", "Logan", "Bernadette", "Celia", "Morgan", "Dana", "Pam", "Lambert", "Jude", "Devin", "Claude", "Sierra", "Miranda", "Bennett", "Ruby", "Stephen", "Alejandro", "Marian" ], "edges": [ [ 0, 1 ], [ 1, 5 ], [ 4, 2 ], [ 5, 3 ], [ 5, 4 ], [ 5, 6 ], [ 5, 7 ], [ 7, 8 ], [ 7, 9 ], [ 10, 11 ], [ 11, 15 ], [ 14, 12 ], [ 15, 13 ], [ 15, 14 ], [ 15, 16 ], [ 15, 17 ], [ 17, 18 ], [ 17, 19 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Felix knows Mike. Alma knows Harry. Grace knows Enrique. Emily knows Grace. Harry knows Howard. Mike knows Ray. Jerome knows Jakob. Ray knows Todd. Jakob knows Ellis. Kara knows Brody. Mike knows Yasmin. Todd knows Jerome. Lorenzo knows Kara. Brody knows Cruz. Ellis knows Jessica. Enrique knows Lorenzo. Harry knows Emily. Jessica knows Blanche. Which of Todd and Grace can Felix reach?", "answer": "Todd", "steps": [ "Felix knows Mike.", "Mike knows Ray.", "Ray knows Todd." ], "difficulty": 3, "original_distance": 8, "idx_to_symbol": [ "Felix", "Blanche", "Mike", "Ray", "Jakob", "Yasmin", "Todd", "Jessica", "Ellis", "Jerome", "Alma", "Cruz", "Harry", "Emily", "Lorenzo", "Howard", "Grace", "Brody", "Kara", "Enrique" ], "edges": [ [ 0, 2 ], [ 2, 5 ], [ 2, 3 ], [ 3, 6 ], [ 4, 8 ], [ 6, 9 ], [ 7, 1 ], [ 8, 7 ], [ 9, 4 ], [ 10, 12 ], [ 12, 15 ], [ 12, 13 ], [ 13, 16 ], [ 14, 18 ], [ 16, 19 ], [ 17, 11 ], [ 18, 17 ], [ 19, 14 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Grady knows Dora. Clement knows Darcy. Daphna knows Kendra. Donovan knows Luz. Patrick knows Susan. Jude knows Patrick. Kristin knows Julius. Darcy knows Kane. Kendra knows Luther. Susan knows Sandra. Luz knows Rhonda. Sandra knows Clement. Eldon knows Kirsten. Rhonda knows Kristin. Luther knows Donovan. Rhonda knows Grady. Darcy knows Eldon. Kane knows Riley. Which of Luz and Clement can Daphna reach?", "answer": "Luz", "steps": [ "Daphna knows Kendra.", "Kendra knows Luther.", "Luther knows Donovan.", "Donovan knows Luz." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Daphna", "Julius", "Kristin", "Dora", "Grady", "Donovan", "Rhonda", "Luther", "Luz", "Kendra", "Jude", "Kirsten", "Eldon", "Riley", "Kane", "Sandra", "Darcy", "Susan", "Clement", "Patrick" ], "edges": [ [ 0, 9 ], [ 2, 1 ], [ 4, 3 ], [ 5, 8 ], [ 6, 2 ], [ 6, 4 ], [ 7, 5 ], [ 8, 6 ], [ 9, 7 ], [ 10, 19 ], [ 12, 11 ], [ 14, 13 ], [ 15, 18 ], [ 16, 12 ], [ 16, 14 ], [ 17, 15 ], [ 18, 16 ], [ 19, 17 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "August knows Josie. Zara knows Arthur. Carson knows Saul. Cristina knows August. Karl knows Lorna. Annie knows Troy. Hubert knows Sadie. Ebony knows Aspen. Todd knows Hubert. Arthur knows Malik. Malik knows Ebony. Aspen knows Karl. Chandler knows Todd. Courtney knows Annie. Aspen knows Cristina. Todd knows Carson. Saul knows George. Troy knows Chandler. Which of Carson and Cristina can Zara reach?", "answer": "Cristina", "steps": [ "Zara knows Arthur.", "Arthur knows Malik.", "Malik knows Ebony.", "Ebony knows Aspen.", "Aspen knows Cristina." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Zara", "Malik", "Josie", "Arthur", "Cristina", "Karl", "Ebony", "Lorna", "August", "Aspen", "Courtney", "Troy", "George", "Annie", "Carson", "Hubert", "Chandler", "Sadie", "Saul", "Todd" ], "edges": [ [ 0, 3 ], [ 1, 6 ], [ 3, 1 ], [ 4, 8 ], [ 5, 7 ], [ 6, 9 ], [ 8, 2 ], [ 9, 5 ], [ 9, 4 ], [ 10, 13 ], [ 11, 16 ], [ 13, 11 ], [ 14, 18 ], [ 15, 17 ], [ 16, 19 ], [ 18, 12 ], [ 19, 15 ], [ 19, 14 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Demetrius knows Neil. Josie knows Brittany. Eva knows Lucas. Josie knows Nora. Zach knows Daisy. Claire knows Virgil. Zach knows Philip. Sybil knows Enid. Sybil knows Layla. Eva knows Henry. Eva knows Demetrius. Zach knows Claire. Josie knows Jeremiah. Cruz knows Uma. Jeremiah knows Haley. Claire knows Eva. Sybil knows Cruz. Cruz knows Josie. Which of Jeremiah and Demetrius can Sybil reach?", "answer": "Jeremiah", "steps": [ "Sybil knows Cruz.", "Cruz knows Josie.", "Josie knows Jeremiah." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Sybil", "Uma", "Nora", "Layla", "Jeremiah", "Haley", "Enid", "Brittany", "Josie", "Cruz", "Zach", "Virgil", "Lucas", "Philip", "Demetrius", "Neil", "Daisy", "Henry", "Eva", "Claire" ], "edges": [ [ 0, 3 ], [ 0, 6 ], [ 0, 9 ], [ 4, 5 ], [ 8, 2 ], [ 8, 4 ], [ 8, 7 ], [ 9, 1 ], [ 9, 8 ], [ 10, 13 ], [ 10, 16 ], [ 10, 19 ], [ 14, 15 ], [ 18, 12 ], [ 18, 14 ], [ 18, 17 ], [ 19, 11 ], [ 19, 18 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Warren knows Nancy. John knows Austin. Atlas knows John. Constance knows Claude. John knows Zara. Austin knows Daphne. Bart knows Hunter. Alma knows Ray. Bart knows Warren. Hunter knows Henrietta. Ray knows Hannah. Don knows Atlas. Bart knows Clyde. Hannah knows Bart. John knows Constance. Hunter knows Celia. Allison knows Don. Austin knows Carla. Which of Celia and Carla can Allison reach?", "answer": "Carla", "steps": [ "Allison knows Don.", "Don knows Atlas.", "Atlas knows John.", "John knows Austin.", "Austin knows Carla." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Allison", "Constance", "Austin", "Don", "Zara", "Atlas", "Carla", "Claude", "John", "Daphne", "Alma", "Warren", "Hunter", "Ray", "Clyde", "Hannah", "Celia", "Nancy", "Bart", "Henrietta" ], "edges": [ [ 0, 3 ], [ 1, 7 ], [ 2, 6 ], [ 2, 9 ], [ 3, 5 ], [ 5, 8 ], [ 8, 4 ], [ 8, 1 ], [ 8, 2 ], [ 10, 13 ], [ 11, 17 ], [ 12, 16 ], [ 12, 19 ], [ 13, 15 ], [ 15, 18 ], [ 18, 14 ], [ 18, 11 ], [ 18, 12 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Christian knows Shelby. Camden knows Celeste. Allen knows Verna. Marie knows Claude. Wallace knows Marie. Celeste knows Christian. Vicki knows Maude. Landon knows Abby. Vanessa knows Bennett. Lana knows Morris. Claude knows Allen. Verna knows Brett. Celeste knows Bonnie. Claude knows Landon. Shelby knows Vanessa. Bonnie knows Josie. Marie knows Vicki. Christian knows Lana. Which of Christian and Claude can Wallace reach?", "answer": "Claude", "steps": [ "Wallace knows Marie.", "Marie knows Claude." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Wallace", "Landon", "Verna", "Brett", "Allen", "Vicki", "Marie", "Abby", "Claude", "Maude", "Camden", "Lana", "Vanessa", "Bennett", "Shelby", "Bonnie", "Celeste", "Morris", "Christian", "Josie" ], "edges": [ [ 0, 6 ], [ 1, 7 ], [ 2, 3 ], [ 4, 2 ], [ 5, 9 ], [ 6, 8 ], [ 6, 5 ], [ 8, 4 ], [ 8, 1 ], [ 10, 16 ], [ 11, 17 ], [ 12, 13 ], [ 14, 12 ], [ 15, 19 ], [ 16, 18 ], [ 16, 15 ], [ 18, 14 ], [ 18, 11 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Irma knows Elmer. Verna knows Clyde. Clyde knows Serena. Ariana knows Irma. Dell knows Xander. Rosemary knows Archie. Cyrus knows Blanche. Serena knows Pierce. Jennifer knows Uma. Elmer knows Jennifer. Archie knows Verna. Irma knows Cyrus. Kai knows Devin. Archie knows Kai. Verna knows Doris. Devin knows Sheila. Cyrus knows Wesley. Wesley knows Dell. Which of Wesley and Clyde can Rosemary reach?", "answer": "Clyde", "steps": [ "Rosemary knows Archie.", "Archie knows Verna.", "Verna knows Clyde." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Rosemary", "Sheila", "Kai", "Devin", "Serena", "Doris", "Verna", "Clyde", "Pierce", "Archie", "Ariana", "Uma", "Elmer", "Jennifer", "Dell", "Blanche", "Cyrus", "Wesley", "Xander", "Irma" ], "edges": [ [ 0, 9 ], [ 2, 3 ], [ 3, 1 ], [ 4, 8 ], [ 6, 5 ], [ 6, 7 ], [ 7, 4 ], [ 9, 2 ], [ 9, 6 ], [ 10, 19 ], [ 12, 13 ], [ 13, 11 ], [ 14, 18 ], [ 16, 15 ], [ 16, 17 ], [ 17, 14 ], [ 19, 12 ], [ 19, 16 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Winifred knows Kara. Yara knows Jeanne. Miriam knows Coral. Wilson knows Cynthia. Dana knows Declan. Jeanne knows Dennis. Hank knows Elijah. Elijah knows Winifred. Louise knows Dana. Roger knows Miriam. Winifred knows Louise. Kara knows Joseph. Cynthia knows Freya. Joseph knows Philip. Dennis knows Regina. Freya knows Roger. Freya knows Yara. Declan knows Sierra. Which of Jeanne and Dana can Wilson reach?", "answer": "Jeanne", "steps": [ "Wilson knows Cynthia.", "Cynthia knows Freya.", "Freya knows Yara.", "Yara knows Jeanne." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Wilson", "Regina", "Roger", "Jeanne", "Coral", "Yara", "Dennis", "Cynthia", "Miriam", "Freya", "Hank", "Sierra", "Kara", "Dana", "Philip", "Louise", "Declan", "Elijah", "Joseph", "Winifred" ], "edges": [ [ 0, 7 ], [ 2, 8 ], [ 3, 6 ], [ 5, 3 ], [ 6, 1 ], [ 7, 9 ], [ 8, 4 ], [ 9, 5 ], [ 9, 2 ], [ 10, 17 ], [ 12, 18 ], [ 13, 16 ], [ 15, 13 ], [ 16, 11 ], [ 17, 19 ], [ 18, 14 ], [ 19, 15 ], [ 19, 12 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Henry knows Juan. Isiah knows Henry. Emmett knows Chantal. Daniella knows Theodore. Eamon knows Heath. Glenn knows Zack. Daniella knows Karl. Victor knows Daniella. Chantal knows Whitney. Barbara knows Emmett. Eamon knows Grace. Nelson knows Isabel. Isiah knows Victor. Daniella knows Kennedy. Whitney knows Eamon. Isabel knows Isiah. Eamon knows Joaquin. Chantal knows Glenn. Which of Daniella and Eamon can Nelson reach?", "answer": "Daniella", "steps": [ "Nelson knows Isabel.", "Isabel knows Isiah.", "Isiah knows Victor.", "Victor knows Daniella." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Nelson", "Juan", "Victor", "Isiah", "Theodore", "Kennedy", "Henry", "Isabel", "Daniella", "Karl", "Barbara", "Zack", "Whitney", "Chantal", "Joaquin", "Heath", "Glenn", "Emmett", "Eamon", "Grace" ], "edges": [ [ 0, 7 ], [ 2, 8 ], [ 3, 6 ], [ 3, 2 ], [ 6, 1 ], [ 7, 3 ], [ 8, 4 ], [ 8, 5 ], [ 8, 9 ], [ 10, 17 ], [ 12, 18 ], [ 13, 16 ], [ 13, 12 ], [ 16, 11 ], [ 17, 13 ], [ 18, 14 ], [ 18, 15 ], [ 18, 19 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Elijah knows Yasmin. Val knows Abby. Lloyd knows Estella. Ashton knows Alice. Zach knows Alan. Abby knows Elijah. Ashton knows Laura. Electra knows Fletcher. Don knows Lewis. Abby knows Julius. Jeremy knows Electra. Zelda knows Dante. Elijah knows Zelda. Fabian knows Val. Laura knows Jeremy. Zach knows Ashton. Dante knows Don. Estella knows Zach. Which of Don and Electra can Lloyd reach?", "answer": "Electra", "steps": [ "Lloyd knows Estella.", "Estella knows Zach.", "Zach knows Ashton.", "Ashton knows Laura.", "Laura knows Jeremy.", "Jeremy knows Electra." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Lloyd", "Ashton", "Laura", "Alan", "Zach", "Electra", "Alice", "Jeremy", "Fletcher", "Estella", "Fabian", "Elijah", "Zelda", "Julius", "Abby", "Don", "Yasmin", "Dante", "Lewis", "Val" ], "edges": [ [ 0, 9 ], [ 1, 6 ], [ 1, 2 ], [ 2, 7 ], [ 4, 3 ], [ 4, 1 ], [ 5, 8 ], [ 7, 5 ], [ 9, 4 ], [ 10, 19 ], [ 11, 16 ], [ 11, 12 ], [ 12, 17 ], [ 14, 13 ], [ 14, 11 ], [ 15, 18 ], [ 17, 15 ], [ 19, 14 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Dennis knows Atlas. Ainsley knows Cristina. Hampton knows Dennis. Jacques knows Ross. Rose knows Harlan. Tabitha knows Graham. Rose knows Jacques. Cristina knows Justine. Harlan knows Tabitha. Atlas knows Jean. Graham knows Jennifer. Jacques knows Gerard. Justine knows Susanne. Dennis knows Clayton. Jean knows Linda. Beau knows Erica. Hampton knows Ainsley. Gerard knows Beau. Which of Beau and Jean can Rose reach?", "answer": "Beau", "steps": [ "Rose knows Jacques.", "Jacques knows Gerard.", "Gerard knows Beau." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Rose", "Erica", "Tabitha", "Graham", "Jennifer", "Ross", "Jacques", "Harlan", "Gerard", "Beau", "Hampton", "Linda", "Cristina", "Justine", "Susanne", "Clayton", "Dennis", "Ainsley", "Atlas", "Jean" ], "edges": [ [ 0, 7 ], [ 0, 6 ], [ 2, 3 ], [ 3, 4 ], [ 6, 5 ], [ 6, 8 ], [ 7, 2 ], [ 8, 9 ], [ 9, 1 ], [ 10, 17 ], [ 10, 16 ], [ 12, 13 ], [ 13, 14 ], [ 16, 15 ], [ 16, 18 ], [ 17, 12 ], [ 18, 19 ], [ 19, 11 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Avery knows Charlotte. Gail knows Hayley. Gail knows Lucia. Avery knows Gail. Charlotte knows Nina. Hayley knows Hunter. Hunter knows Glen. Luke knows Jameson. Darius knows Dennis. Marcia knows Samuel. Marcia knows Darius. Marcia knows Brooks. Keaton knows Luke. Avery knows Ron. Brooks knows Keaton. Brooks knows Riley. Nina knows Dustin. Dennis knows Isadora. Which of Hayley and Keaton can Marcia reach?", "answer": "Keaton", "steps": [ "Marcia knows Brooks.", "Brooks knows Keaton." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Marcia", "Isadora", "Dennis", "Keaton", "Luke", "Darius", "Samuel", "Jameson", "Brooks", "Riley", "Avery", "Dustin", "Nina", "Hayley", "Hunter", "Charlotte", "Ron", "Glen", "Gail", "Lucia" ], "edges": [ [ 0, 5 ], [ 0, 6 ], [ 0, 8 ], [ 2, 1 ], [ 3, 4 ], [ 4, 7 ], [ 5, 2 ], [ 8, 3 ], [ 8, 9 ], [ 10, 15 ], [ 10, 16 ], [ 10, 18 ], [ 12, 11 ], [ 13, 14 ], [ 14, 17 ], [ 15, 12 ], [ 18, 13 ], [ 18, 19 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Robin knows Charlene. Isla knows Deborah. Ember knows Lyric. Ashton knows Robin. Isla knows Fergus. Ember knows Patricia. Ella knows Verna. Charlene knows Frank. Lyric knows Isla. Fergus knows Sheila. Ella knows Gerard. Frank knows Dayton. Frank knows Archer. Gerard knows Ember. Melody knows Pierce. Robin knows Keaton. Melody knows Ashton. Archer knows Caleb. Which of Sheila and Caleb can Ella reach?", "answer": "Sheila", "steps": [ "Ella knows Gerard.", "Gerard knows Ember.", "Ember knows Lyric.", "Lyric knows Isla.", "Isla knows Fergus.", "Fergus knows Sheila." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Ella", "Gerard", "Sheila", "Lyric", "Verna", "Fergus", "Deborah", "Patricia", "Isla", "Ember", "Melody", "Ashton", "Caleb", "Charlene", "Pierce", "Archer", "Dayton", "Keaton", "Frank", "Robin" ], "edges": [ [ 0, 4 ], [ 0, 1 ], [ 1, 9 ], [ 3, 8 ], [ 5, 2 ], [ 8, 5 ], [ 8, 6 ], [ 9, 7 ], [ 9, 3 ], [ 10, 14 ], [ 10, 11 ], [ 11, 19 ], [ 13, 18 ], [ 15, 12 ], [ 18, 15 ], [ 18, 16 ], [ 19, 17 ], [ 19, 13 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Jeremiah knows Glen. Jenny knows Jose. Arlene knows Vincent. Marie knows Allison. Bert knows Caroline. Jean knows Rufus. Jose knows Merle. Sylvia knows Jeremiah. Corinne knows Morgan. Jose knows Walter. Jenny knows Jean. Rufus knows Simon. Marie knows Esther. Arlene knows Marie. Corinne knows Jenny. Simon knows Eunice. Vincent knows Sylvia. Bert knows Arlene. Which of Simon and Jeremiah can Corinne reach?", "answer": "Simon", "steps": [ "Corinne knows Jenny.", "Jenny knows Jean.", "Jean knows Rufus.", "Rufus knows Simon." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Corinne", "Jose", "Simon", "Morgan", "Eunice", "Jenny", "Rufus", "Jean", "Walter", "Merle", "Bert", "Marie", "Jeremiah", "Caroline", "Glen", "Arlene", "Sylvia", "Vincent", "Allison", "Esther" ], "edges": [ [ 0, 3 ], [ 0, 5 ], [ 1, 8 ], [ 1, 9 ], [ 2, 4 ], [ 5, 7 ], [ 5, 1 ], [ 6, 2 ], [ 7, 6 ], [ 10, 13 ], [ 10, 15 ], [ 11, 18 ], [ 11, 19 ], [ 12, 14 ], [ 15, 17 ], [ 15, 11 ], [ 16, 12 ], [ 17, 16 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Ernest knows Anna. Ida knows Ernest. Vincent knows Ted. Anna knows Emma. Etta knows Uma. Ida knows Ronald. Ted knows Leroy. Vincent knows Pedro. Brad knows Candice. Ted knows Ann. Todd knows Madeline. Vincent knows Brad. Pedro knows Erma. Ernest knows Humphrey. Anna knows Malik. Ernest knows Todd. Humphrey knows Ernesto. Etta knows Vincent. Which of Ann and Malik can Etta reach?", "answer": "Ann", "steps": [ "Etta knows Vincent.", "Vincent knows Ted.", "Ted knows Ann." ], "difficulty": 3, "original_distance": 3, "idx_to_symbol": [ "Etta", "Ted", "Ann", "Brad", "Uma", "Erma", "Vincent", "Pedro", "Candice", "Leroy", "Ida", "Anna", "Malik", "Todd", "Ronald", "Ernesto", "Ernest", "Humphrey", "Madeline", "Emma" ], "edges": [ [ 0, 4 ], [ 0, 6 ], [ 1, 2 ], [ 1, 9 ], [ 3, 8 ], [ 6, 7 ], [ 6, 3 ], [ 6, 1 ], [ 7, 5 ], [ 10, 14 ], [ 10, 16 ], [ 11, 12 ], [ 11, 19 ], [ 13, 18 ], [ 16, 17 ], [ 16, 13 ], [ 16, 11 ], [ 17, 15 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Abel knows Fiona. Rosemary knows Annette. Trevor knows Archie. Geraldine knows Aubrey. Fiona knows Jamie. Archie knows Abel. Ken knows Trevor. Jamie knows Jorge. Thea knows Stefan. Dell knows Valerie. Archie knows Geraldine. Valerie knows Ford. Rosemary knows Porter. Stefan knows Rosemary. Annette knows Bernadette. Bernadette knows Edith. Porter knows Dell. Aubrey knows Fern. Which of Archie and Rosemary can Thea reach?", "answer": "Rosemary", "steps": [ "Thea knows Stefan.", "Stefan knows Rosemary." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Thea", "Valerie", "Edith", "Porter", "Bernadette", "Rosemary", "Stefan", "Dell", "Annette", "Ford", "Ken", "Jamie", "Fern", "Abel", "Aubrey", "Archie", "Trevor", "Fiona", "Geraldine", "Jorge" ], "edges": [ [ 0, 6 ], [ 1, 9 ], [ 3, 7 ], [ 4, 2 ], [ 5, 8 ], [ 5, 3 ], [ 6, 5 ], [ 7, 1 ], [ 8, 4 ], [ 10, 16 ], [ 11, 19 ], [ 13, 17 ], [ 14, 12 ], [ 15, 18 ], [ 15, 13 ], [ 16, 15 ], [ 17, 11 ], [ 18, 14 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Leander knows Harlan. Wilson knows Hal. Sally knows Flora. Flora knows Barbara. Chloe knows Janet. Atlas knows Vernon. Chloe knows Nina. Nina knows Dexter. Eva knows Leander. Wilson knows Sally. Wilson knows Vicki. Barbara knows Courtney. Dexter knows Clark. Clark knows Eva. Sally knows Giselle. Courtney knows Atlas. Nina knows Paige. Chloe knows Irving. Which of Nina and Sally can Wilson reach?", "answer": "Sally", "steps": [ "Wilson knows Sally." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Wilson", "Hal", "Sally", "Giselle", "Vernon", "Barbara", "Atlas", "Vicki", "Courtney", "Flora", "Chloe", "Irving", "Nina", "Paige", "Harlan", "Clark", "Leander", "Janet", "Eva", "Dexter" ], "edges": [ [ 0, 1 ], [ 0, 7 ], [ 0, 2 ], [ 2, 3 ], [ 2, 9 ], [ 5, 8 ], [ 6, 4 ], [ 8, 6 ], [ 9, 5 ], [ 10, 11 ], [ 10, 17 ], [ 10, 12 ], [ 12, 13 ], [ 12, 19 ], [ 15, 18 ], [ 16, 14 ], [ 18, 16 ], [ 19, 15 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Hugh knows Daria. Jane knows Mara. Arden knows Opal. Paige knows Sean. Yuki knows Victor. Colin knows Rhonda. Lars knows Leopold. Victor knows Arden. Archer knows Paige. Fanny knows Ramona. Fanny knows Hugh. Sean knows Carl. Leopold knows Maggie. Maggie knows Jane. Opal knows Fanny. Daria knows Colin. Jane knows Archer. Hayes knows Lars. Which of Victor and Lars can Yuki reach?", "answer": "Victor", "steps": [ "Yuki knows Victor." ], "difficulty": 1, "original_distance": 8, "idx_to_symbol": [ "Yuki", "Victor", "Daria", "Colin", "Fanny", "Opal", "Rhonda", "Arden", "Hugh", "Ramona", "Hayes", "Lars", "Paige", "Sean", "Jane", "Maggie", "Carl", "Leopold", "Archer", "Mara" ], "edges": [ [ 0, 1 ], [ 1, 7 ], [ 2, 3 ], [ 3, 6 ], [ 4, 8 ], [ 4, 9 ], [ 5, 4 ], [ 7, 5 ], [ 8, 2 ], [ 10, 11 ], [ 11, 17 ], [ 12, 13 ], [ 13, 16 ], [ 14, 18 ], [ 14, 19 ], [ 15, 14 ], [ 17, 15 ], [ 18, 12 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Marco knows Javier. Hugo knows Milo. Noah knows Chelsea. Carmela knows Glenn. Milo knows Knox. Marco knows Noah. Hugo knows Jade. Ray knows Carmela. Chelsea knows Aubrey. Milo knows Elias. Ray knows Gemma. Ray knows Marco. Milo knows Wallace. Marco knows Melody. Wallace knows Kelly. Hugo knows Terrence. Terrence knows Ava. Kelly knows Freya. Which of Milo and Marco can Hugo reach?", "answer": "Milo", "steps": [ "Hugo knows Milo." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Hugo", "Terrence", "Knox", "Kelly", "Jade", "Elias", "Ava", "Milo", "Freya", "Wallace", "Ray", "Carmela", "Javier", "Chelsea", "Gemma", "Melody", "Glenn", "Marco", "Aubrey", "Noah" ], "edges": [ [ 0, 4 ], [ 0, 1 ], [ 0, 7 ], [ 1, 6 ], [ 3, 8 ], [ 7, 2 ], [ 7, 5 ], [ 7, 9 ], [ 9, 3 ], [ 10, 14 ], [ 10, 11 ], [ 10, 17 ], [ 11, 16 ], [ 13, 18 ], [ 17, 12 ], [ 17, 15 ], [ 17, 19 ], [ 19, 13 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Eugene knows Raquel. Alyssa knows Anton. Jewel knows Aurora. Anton knows Geoffrey. Rebecca knows Alyssa. Geoffrey knows Saul. Aurora knows Vernon. Stuart knows Jewel. Caroline knows Charles. Brody knows Sally. Sally knows Stuart. Raquel knows Daniel. Sally knows Emanuel. Raquel knows Belinda. Vernon knows Caroline. Aurora knows Lisa. Alyssa knows Clay. Daniel knows Rebecca. Which of Aurora and Alyssa can Eugene reach?", "answer": "Alyssa", "steps": [ "Eugene knows Raquel.", "Raquel knows Daniel.", "Daniel knows Rebecca.", "Rebecca knows Alyssa." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Eugene", "Belinda", "Geoffrey", "Alyssa", "Daniel", "Saul", "Anton", "Raquel", "Rebecca", "Clay", "Brody", "Emanuel", "Caroline", "Aurora", "Stuart", "Charles", "Vernon", "Sally", "Jewel", "Lisa" ], "edges": [ [ 0, 7 ], [ 2, 5 ], [ 3, 6 ], [ 3, 9 ], [ 4, 8 ], [ 6, 2 ], [ 7, 1 ], [ 7, 4 ], [ 8, 3 ], [ 10, 17 ], [ 12, 15 ], [ 13, 16 ], [ 13, 19 ], [ 14, 18 ], [ 16, 12 ], [ 17, 11 ], [ 17, 14 ], [ 18, 13 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Gustavo knows Bart. Marvin knows Shelby. Hendrix knows Lambert. Peter knows Marvin. Emmett knows Bernard. Peter knows Gustavo. Clay knows Alyson. Katherine knows Wendy. Aisha knows Clay. Shelby knows Katherine. Peter knows Hendrix. Nathan knows Levi. Casey knows Gus. Bernard knows Nathan. Alyson knows Ruth. Chester knows Peter. Clay knows Emmett. Clay knows Casey. Which of Shelby and Bernard can Aisha reach?", "answer": "Bernard", "steps": [ "Aisha knows Clay.", "Clay knows Emmett.", "Emmett knows Bernard." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Aisha", "Levi", "Bernard", "Alyson", "Emmett", "Nathan", "Ruth", "Clay", "Casey", "Gus", "Chester", "Wendy", "Shelby", "Hendrix", "Marvin", "Katherine", "Lambert", "Peter", "Gustavo", "Bart" ], "edges": [ [ 0, 7 ], [ 2, 5 ], [ 3, 6 ], [ 4, 2 ], [ 5, 1 ], [ 7, 4 ], [ 7, 3 ], [ 7, 8 ], [ 8, 9 ], [ 10, 17 ], [ 12, 15 ], [ 13, 16 ], [ 14, 12 ], [ 15, 11 ], [ 17, 14 ], [ 17, 13 ], [ 17, 18 ], [ 18, 19 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Colby knows Colette. Erica knows Sam. Hilda knows Colby. Kendra knows Porter. Hilda knows Bruce. Anita knows Hilda. Kendra knows Dudley. Aaron knows Anita. Otto knows India. India knows June. Bruce knows Houston. India knows Kendra. Sam knows Otto. Monroe knows Aaron. June knows Daniel. June knows Owen. Bruce knows Arturo. Colby knows Noel. Which of India and Hilda can Monroe reach?", "answer": "Hilda", "steps": [ "Monroe knows Aaron.", "Aaron knows Anita.", "Anita knows Hilda." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Monroe", "Bruce", "Colby", "Anita", "Colette", "Aaron", "Hilda", "Houston", "Noel", "Arturo", "Erica", "June", "Kendra", "Otto", "Dudley", "Sam", "India", "Owen", "Porter", "Daniel" ], "edges": [ [ 0, 5 ], [ 1, 7 ], [ 1, 9 ], [ 2, 4 ], [ 2, 8 ], [ 3, 6 ], [ 5, 3 ], [ 6, 2 ], [ 6, 1 ], [ 10, 15 ], [ 11, 17 ], [ 11, 19 ], [ 12, 14 ], [ 12, 18 ], [ 13, 16 ], [ 15, 13 ], [ 16, 12 ], [ 16, 11 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Anthony knows Dawn. Marco knows Clay. Chad knows Wendell. Wendell knows Samantha. Kaleb knows Sarah. Damian knows Herman. Keith knows Susanne. Susanne knows Marco. Sarah knows Anthony. Brittany knows Knox. Keith knows Chad. Knox knows Keith. Dawn knows Shelby. Helene knows Luna. Pat knows Brittany. Herman knows Arden. Dawn knows Damian. Shelby knows Helene. Which of Keith and Dawn can Kaleb reach?", "answer": "Dawn", "steps": [ "Kaleb knows Sarah.", "Sarah knows Anthony.", "Anthony knows Dawn." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Kaleb", "Herman", "Dawn", "Sarah", "Luna", "Shelby", "Damian", "Arden", "Anthony", "Helene", "Pat", "Marco", "Keith", "Brittany", "Samantha", "Chad", "Susanne", "Clay", "Knox", "Wendell" ], "edges": [ [ 0, 3 ], [ 1, 7 ], [ 2, 6 ], [ 2, 5 ], [ 3, 8 ], [ 5, 9 ], [ 6, 1 ], [ 8, 2 ], [ 9, 4 ], [ 10, 13 ], [ 11, 17 ], [ 12, 16 ], [ 12, 15 ], [ 13, 18 ], [ 15, 19 ], [ 16, 11 ], [ 18, 12 ], [ 19, 14 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Carol knows Duncan. Ilene knows Federico. Harper knows Elvira. Emily knows Cody. Myra knows Jenna. Jenna knows Ilene. Emily knows Aldo. Duncan knows Ruth. Kingsley knows Carol. Cody knows Kingsley. Emily knows Josie. Harper knows Myra. Jenna knows Edna. Carmela knows Graham. Carol knows Foster. Carmela knows Harper. Carmela knows Carlos. Cody knows Horace. Which of Ilene and Duncan can Emily reach?", "answer": "Duncan", "steps": [ "Emily knows Cody.", "Cody knows Kingsley.", "Kingsley knows Carol.", "Carol knows Duncan." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Emily", "Josie", "Cody", "Carol", "Aldo", "Kingsley", "Horace", "Foster", "Duncan", "Ruth", "Carmela", "Graham", "Harper", "Jenna", "Carlos", "Myra", "Elvira", "Edna", "Ilene", "Federico" ], "edges": [ [ 0, 1 ], [ 0, 4 ], [ 0, 2 ], [ 2, 6 ], [ 2, 5 ], [ 3, 7 ], [ 3, 8 ], [ 5, 3 ], [ 8, 9 ], [ 10, 11 ], [ 10, 14 ], [ 10, 12 ], [ 12, 16 ], [ 12, 15 ], [ 13, 17 ], [ 13, 18 ], [ 15, 13 ], [ 18, 19 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Martin knows Karla. Diego knows Carrie. Conner knows Bella. Judith knows Fletcher. Lennox knows Della. Alyssa knows Juan. Conner knows Michelle. Fletcher knows Hope. Lennox knows Martin. Della knows Kendra. Alyssa knows Conner. Karla knows Gemma. Karla knows Tina. Fletcher knows Diego. Della knows Jeremy. Judith knows Alyssa. Martin knows Dallas. Jeremy knows Flora. Which of Diego and Jeremy can Lennox reach?", "answer": "Jeremy", "steps": [ "Lennox knows Della.", "Della knows Jeremy." ], "difficulty": 2, "original_distance": 3, "idx_to_symbol": [ "Lennox", "Gemma", "Flora", "Karla", "Jeremy", "Della", "Tina", "Dallas", "Martin", "Kendra", "Judith", "Bella", "Carrie", "Conner", "Diego", "Fletcher", "Michelle", "Juan", "Alyssa", "Hope" ], "edges": [ [ 0, 8 ], [ 0, 5 ], [ 3, 1 ], [ 3, 6 ], [ 4, 2 ], [ 5, 4 ], [ 5, 9 ], [ 8, 3 ], [ 8, 7 ], [ 10, 18 ], [ 10, 15 ], [ 13, 11 ], [ 13, 16 ], [ 14, 12 ], [ 15, 14 ], [ 15, 19 ], [ 18, 13 ], [ 18, 17 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Bennett knows Carla. Violet knows Albert. Violet knows Nicole. Henry knows Kareem. Adele knows Walter. Beatrice knows Hayley. Kareem knows Bernard. Albert knows Terrence. Bruno knows Hubert. Ronald knows Jeremy. Henry knows Tamara. Bruno knows Ronald. Doris knows Erma. Nicole knows Bennett. Hayley knows Adele. Bernard knows Beatrice. Beatrice knows Doris. Jeremy knows Violet. Which of Beatrice and Violet can Bruno reach?", "answer": "Violet", "steps": [ "Bruno knows Ronald.", "Ronald knows Jeremy.", "Jeremy knows Violet." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Bruno", "Ronald", "Jeremy", "Violet", "Bennett", "Terrence", "Carla", "Hubert", "Nicole", "Albert", "Henry", "Kareem", "Bernard", "Beatrice", "Adele", "Erma", "Walter", "Tamara", "Hayley", "Doris" ], "edges": [ [ 0, 7 ], [ 0, 1 ], [ 1, 2 ], [ 2, 3 ], [ 3, 8 ], [ 3, 9 ], [ 4, 6 ], [ 8, 4 ], [ 9, 5 ], [ 10, 17 ], [ 10, 11 ], [ 11, 12 ], [ 12, 13 ], [ 13, 18 ], [ 13, 19 ], [ 14, 16 ], [ 18, 14 ], [ 19, 15 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "India knows Aldo. Latoya knows Lance. Randy knows Isla. Dick knows Omar. Cruz knows Dick. Latoya knows Myrtle. Isabel knows Jill. Myrtle knows Isabel. Dick knows Willis. Basil knows Cruz. Randy knows Byron. Terrence knows Gerard. Hattie knows Vicki. Jill knows Terrence. Cruz knows India. Hattie knows Aurora. Jill knows Hattie. Isla knows Basil. Which of Jill and Cruz can Latoya reach?", "answer": "Jill", "steps": [ "Latoya knows Myrtle.", "Myrtle knows Isabel.", "Isabel knows Jill." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Latoya", "Vicki", "Gerard", "Lance", "Isabel", "Jill", "Terrence", "Myrtle", "Aurora", "Hattie", "Randy", "Willis", "Aldo", "Byron", "Basil", "Cruz", "India", "Isla", "Omar", "Dick" ], "edges": [ [ 0, 3 ], [ 0, 7 ], [ 4, 5 ], [ 5, 6 ], [ 5, 9 ], [ 6, 2 ], [ 7, 4 ], [ 9, 1 ], [ 9, 8 ], [ 10, 13 ], [ 10, 17 ], [ 14, 15 ], [ 15, 16 ], [ 15, 19 ], [ 16, 12 ], [ 17, 14 ], [ 19, 11 ], [ 19, 18 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Lisette knows Holly. Erma knows Ernesto. Andre knows Ursula. Ernesto knows Harmony. Shannon knows Amber. Eunice knows Andre. Randy knows Eunice. Duke knows Randy. Luis knows Martin. Amber knows Erma. Shannon knows Esperanza. Randy knows Luis. Hardy knows Duke. Norma knows Lisette. Martin knows Troy. Amber knows Norma. Rena knows Shannon. Duke knows Kyle. Which of Amber and Randy can Rena reach?", "answer": "Amber", "steps": [ "Rena knows Shannon.", "Shannon knows Amber." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Rena", "Holly", "Lisette", "Erma", "Shannon", "Esperanza", "Amber", "Norma", "Ernesto", "Harmony", "Hardy", "Troy", "Martin", "Eunice", "Duke", "Kyle", "Randy", "Luis", "Andre", "Ursula" ], "edges": [ [ 0, 4 ], [ 2, 1 ], [ 3, 8 ], [ 4, 5 ], [ 4, 6 ], [ 6, 7 ], [ 6, 3 ], [ 7, 2 ], [ 8, 9 ], [ 10, 14 ], [ 12, 11 ], [ 13, 18 ], [ 14, 15 ], [ 14, 16 ], [ 16, 17 ], [ 16, 13 ], [ 17, 12 ], [ 18, 19 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Hampton knows Amy. Chester knows Andre. Marcia knows Melody. Lane knows Troy. Thomas knows Hampton. Gus knows Ember. Darin knows Trudy. Jasmine knows Beth. Thomas knows Fabian. John knows Thomas. Beth knows Elodie. Andre knows Sue. Darin knows Jasmine. Trudy knows Gus. Beth knows Lane. Sue knows Marcia. Chester knows John. Ember knows Dexter. Which of Beth and Thomas can Darin reach?", "answer": "Beth", "steps": [ "Darin knows Jasmine.", "Jasmine knows Beth." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Darin", "Jasmine", "Gus", "Ember", "Beth", "Troy", "Trudy", "Elodie", "Lane", "Dexter", "Chester", "John", "Sue", "Marcia", "Thomas", "Amy", "Andre", "Fabian", "Hampton", "Melody" ], "edges": [ [ 0, 1 ], [ 0, 6 ], [ 1, 4 ], [ 2, 3 ], [ 3, 9 ], [ 4, 7 ], [ 4, 8 ], [ 6, 2 ], [ 8, 5 ], [ 10, 11 ], [ 10, 16 ], [ 11, 14 ], [ 12, 13 ], [ 13, 19 ], [ 14, 17 ], [ 14, 18 ], [ 16, 12 ], [ 18, 15 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Brynn knows Reid. Reid knows Chandler. Mindy knows Dell. Alyson knows Gonzalo. Dorian knows Alyson. Tracy knows Virgil. Margaret knows Brynn. Jim knows Dina. Hayes knows Dorian. Elena knows Julio. Dudley knows Diana. Diana knows Mindy. Virgil knows Margaret. Chandler knows Hayes. Simon knows Jim. Sean knows Simon. Julio knows Dudley. Dell knows Sean. Which of Sean and Hayes can Elena reach?", "answer": "Sean", "steps": [ "Elena knows Julio.", "Julio knows Dudley.", "Dudley knows Diana.", "Diana knows Mindy.", "Mindy knows Dell.", "Dell knows Sean." ], "difficulty": 6, "original_distance": 9, "idx_to_symbol": [ "Elena", "Jim", "Simon", "Dudley", "Dina", "Dell", "Julio", "Diana", "Sean", "Mindy", "Tracy", "Alyson", "Dorian", "Margaret", "Gonzalo", "Chandler", "Virgil", "Brynn", "Hayes", "Reid" ], "edges": [ [ 0, 6 ], [ 1, 4 ], [ 2, 1 ], [ 3, 7 ], [ 5, 8 ], [ 6, 3 ], [ 7, 9 ], [ 8, 2 ], [ 9, 5 ], [ 10, 16 ], [ 11, 14 ], [ 12, 11 ], [ 13, 17 ], [ 15, 18 ], [ 16, 13 ], [ 17, 19 ], [ 18, 12 ], [ 19, 15 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Edward knows Edmund. Kane knows Cameron. Kelsey knows Rose. Rena knows Leigh. Luther knows Jake. Luther knows Ron. Leigh knows Maya. Jared knows Linda. Maya knows Axel. Rena knows Tara. Leigh knows Dakota. Jake knows Kelsey. Edmund knows Luther. Ingrid knows Rena. Jake knows Greg. Jake knows Kane. Leigh knows Jared. Jerome knows Ingrid. Which of Ingrid and Edmund can Edward reach?", "answer": "Edmund", "steps": [ "Edward knows Edmund." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Edward", "Edmund", "Cameron", "Kelsey", "Rose", "Jake", "Kane", "Greg", "Ron", "Luther", "Jerome", "Ingrid", "Axel", "Jared", "Linda", "Leigh", "Maya", "Dakota", "Tara", "Rena" ], "edges": [ [ 0, 1 ], [ 1, 9 ], [ 3, 4 ], [ 5, 3 ], [ 5, 6 ], [ 5, 7 ], [ 6, 2 ], [ 9, 5 ], [ 9, 8 ], [ 10, 11 ], [ 11, 19 ], [ 13, 14 ], [ 15, 13 ], [ 15, 16 ], [ 15, 17 ], [ 16, 12 ], [ 19, 15 ], [ 19, 18 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Kira knows Samuel. Natalie knows Julia. Earl knows Hubert. Hilda knows Carla. Cruz knows Billy. Cruz knows Shaun. Harper knows Jean. Harper knows Hilda. Julia knows Kira. Gordon knows Harper. Levi knows Donald. Levi knows Earl. Billy knows Alder. Hubert knows Merle. Ashton knows Levi. Jean knows Cruz. Julia knows Ashton. Alder knows Homer. Which of Julia and Harper can Natalie reach?", "answer": "Julia", "steps": [ "Natalie knows Julia." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Natalie", "Merle", "Levi", "Donald", "Earl", "Ashton", "Hubert", "Samuel", "Julia", "Kira", "Gordon", "Homer", "Cruz", "Shaun", "Billy", "Jean", "Alder", "Carla", "Harper", "Hilda" ], "edges": [ [ 0, 8 ], [ 2, 3 ], [ 2, 4 ], [ 4, 6 ], [ 5, 2 ], [ 6, 1 ], [ 8, 5 ], [ 8, 9 ], [ 9, 7 ], [ 10, 18 ], [ 12, 13 ], [ 12, 14 ], [ 14, 16 ], [ 15, 12 ], [ 16, 11 ], [ 18, 15 ], [ 18, 19 ], [ 19, 17 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Alison knows Caleb. Dean knows Atlas. Dean knows Lenora. Zachary knows Joanna. Ibrahim knows Alison. Zachary knows Kerry. Martha knows Ibrahim. Rick knows Malik. Atlas knows Byron. Darius knows Edith. Atlas knows Rick. Darius knows Dean. Joanna knows Carl. Carl knows Sharon. Serena knows Haley. Alison knows Zachary. Joanna knows Victoria. Haley knows Darius. Which of Joanna and Atlas can Serena reach?", "answer": "Atlas", "steps": [ "Serena knows Haley.", "Haley knows Darius.", "Darius knows Dean.", "Dean knows Atlas." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Serena", "Edith", "Rick", "Dean", "Lenora", "Darius", "Byron", "Malik", "Atlas", "Haley", "Martha", "Caleb", "Carl", "Zachary", "Kerry", "Alison", "Victoria", "Sharon", "Joanna", "Ibrahim" ], "edges": [ [ 0, 9 ], [ 2, 7 ], [ 3, 4 ], [ 3, 8 ], [ 5, 1 ], [ 5, 3 ], [ 8, 6 ], [ 8, 2 ], [ 9, 5 ], [ 10, 19 ], [ 12, 17 ], [ 13, 14 ], [ 13, 18 ], [ 15, 11 ], [ 15, 13 ], [ 18, 16 ], [ 18, 12 ], [ 19, 15 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Gustavo knows Bart. Marvin knows Shelby. Hendrix knows Lambert. Peter knows Marvin. Emmett knows Bernard. Peter knows Gustavo. Clay knows Alyson. Katherine knows Wendy. Aisha knows Clay. Shelby knows Katherine. Peter knows Hendrix. Nathan knows Levi. Casey knows Gus. Bernard knows Nathan. Alyson knows Ruth. Chester knows Peter. Clay knows Emmett. Clay knows Casey. Which of Katherine and Nathan can Aisha reach?", "answer": "Nathan", "steps": [ "Aisha knows Clay.", "Clay knows Emmett.", "Emmett knows Bernard.", "Bernard knows Nathan." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Aisha", "Levi", "Bernard", "Alyson", "Emmett", "Nathan", "Ruth", "Clay", "Casey", "Gus", "Chester", "Wendy", "Shelby", "Hendrix", "Marvin", "Katherine", "Lambert", "Peter", "Gustavo", "Bart" ], "edges": [ [ 0, 7 ], [ 2, 5 ], [ 3, 6 ], [ 4, 2 ], [ 5, 1 ], [ 7, 4 ], [ 7, 3 ], [ 7, 8 ], [ 8, 9 ], [ 10, 17 ], [ 12, 15 ], [ 13, 16 ], [ 14, 12 ], [ 15, 11 ], [ 17, 14 ], [ 17, 13 ], [ 17, 18 ], [ 18, 19 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Jolena knows Hailey. Cyrus knows George. Jennifer knows Kamila. Grady knows Keaton. Regina knows Cyrus. Hardy knows Regina. Virginia knows Marian. Grady knows Jolena. Brian knows Hardy. Brandon knows Virginia. Hailey knows Jennifer. Brandon knows Brian. Cyrus knows Lance. Keaton knows Lena. Kamila knows Clayton. Marian knows Paul. Lena knows Sheryl. Kamila knows Dominic. Which of Jolena and Brian can Grady reach?", "answer": "Jolena", "steps": [ "Grady knows Jolena." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Grady", "Jolena", "Jennifer", "Lena", "Sheryl", "Dominic", "Keaton", "Clayton", "Hailey", "Kamila", "Brandon", "Brian", "Regina", "Marian", "Paul", "Lance", "Virginia", "George", "Hardy", "Cyrus" ], "edges": [ [ 0, 6 ], [ 0, 1 ], [ 1, 8 ], [ 2, 9 ], [ 3, 4 ], [ 6, 3 ], [ 8, 2 ], [ 9, 5 ], [ 9, 7 ], [ 10, 16 ], [ 10, 11 ], [ 11, 18 ], [ 12, 19 ], [ 13, 14 ], [ 16, 13 ], [ 18, 12 ], [ 19, 15 ], [ 19, 17 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Ariana knows Fletcher. Harley knows Federico. Ariana knows Lisa. Ariana knows Henrietta. Erica knows Fisher. Erica knows Gage. Joyce knows Leon. Javier knows Sandy. Dexter knows Joyce. Javier knows Herbert. Henrietta knows Dexter. Dexter knows Garrison. Dexter knows Natalie. Erica knows Jeanne. Gage knows Javier. Javier knows Harley. Harley knows Bella. Joyce knows Enid. Which of Javier and Dexter can Ariana reach?", "answer": "Dexter", "steps": [ "Ariana knows Henrietta.", "Henrietta knows Dexter." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Ariana", "Enid", "Fletcher", "Lisa", "Henrietta", "Garrison", "Leon", "Natalie", "Joyce", "Dexter", "Erica", "Bella", "Jeanne", "Fisher", "Gage", "Sandy", "Federico", "Herbert", "Harley", "Javier" ], "edges": [ [ 0, 2 ], [ 0, 3 ], [ 0, 4 ], [ 4, 9 ], [ 8, 1 ], [ 8, 6 ], [ 9, 5 ], [ 9, 7 ], [ 9, 8 ], [ 10, 12 ], [ 10, 13 ], [ 10, 14 ], [ 14, 19 ], [ 18, 11 ], [ 18, 16 ], [ 19, 15 ], [ 19, 17 ], [ 19, 18 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Luis knows Michael. Jim knows Lynn. Winston knows Alana. Stella knows Winston. George knows Eve. Michael knows Nell. Andrea knows Carey. Lenora knows Paul. Eve knows Carol. Luis knows Harlan. Michael knows Stella. Alan knows Fraser. Eden knows Jim. Alan knows George. Alana knows Eden. Andrea knows Alan. Magdalena knows Lenora. Carol knows Magdalena. Which of Jim and Lenora can Luis reach?", "answer": "Jim", "steps": [ "Luis knows Michael.", "Michael knows Stella.", "Stella knows Winston.", "Winston knows Alana.", "Alana knows Eden.", "Eden knows Jim." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Luis", "Winston", "Stella", "Eden", "Harlan", "Lynn", "Jim", "Alana", "Michael", "Nell", "Andrea", "Eve", "George", "Magdalena", "Carey", "Paul", "Lenora", "Carol", "Alan", "Fraser" ], "edges": [ [ 0, 4 ], [ 0, 8 ], [ 1, 7 ], [ 2, 1 ], [ 3, 6 ], [ 6, 5 ], [ 7, 3 ], [ 8, 2 ], [ 8, 9 ], [ 10, 14 ], [ 10, 18 ], [ 11, 17 ], [ 12, 11 ], [ 13, 16 ], [ 16, 15 ], [ 17, 13 ], [ 18, 12 ], [ 18, 19 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Will knows Colin. Vance knows Will. Colin knows Kristina. Casey knows Jewel. Sara knows Casey. Hubert knows Douglas. Will knows Ashton. Will knows Parker. Fanny knows Bennett. Fanny knows Elizabeth. Lennox knows Leon. Sara knows Laverne. Parker knows Fanny. Patricia knows Vance. Laverne knows Hubert. Hubert knows Porter. Sara knows Jerome. Leon knows Sara. Which of Vance and Leon can Patricia reach?", "answer": "Vance", "steps": [ "Patricia knows Vance." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Patricia", "Vance", "Colin", "Ashton", "Fanny", "Parker", "Kristina", "Elizabeth", "Bennett", "Will", "Lennox", "Leon", "Casey", "Jerome", "Hubert", "Laverne", "Jewel", "Porter", "Douglas", "Sara" ], "edges": [ [ 0, 1 ], [ 1, 9 ], [ 2, 6 ], [ 4, 7 ], [ 4, 8 ], [ 5, 4 ], [ 9, 3 ], [ 9, 2 ], [ 9, 5 ], [ 10, 11 ], [ 11, 19 ], [ 12, 16 ], [ 14, 17 ], [ 14, 18 ], [ 15, 14 ], [ 19, 13 ], [ 19, 12 ], [ 19, 15 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Clement knows Greta. Clement knows Dylan. Ashton knows Simon. Robin knows Gareth. Ashton knows Reid. Gareth knows Lorna. Simon knows Jack. Lyric knows Nelson. Jack knows Lyric. Reid knows Clement. Yvette knows Raymond. Raymond knows Robin. Dylan knows Clayton. Kit knows Bert. Carmen knows Kit. Yvette knows Carmen. Lyle knows Teresa. Kit knows Lyle. Which of Carmen and Reid can Yvette reach?", "answer": "Carmen", "steps": [ "Yvette knows Carmen." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Yvette", "Robin", "Raymond", "Kit", "Bert", "Gareth", "Teresa", "Lorna", "Carmen", "Lyle", "Ashton", "Jack", "Simon", "Clement", "Greta", "Lyric", "Clayton", "Nelson", "Reid", "Dylan" ], "edges": [ [ 0, 2 ], [ 0, 8 ], [ 1, 5 ], [ 2, 1 ], [ 3, 4 ], [ 3, 9 ], [ 5, 7 ], [ 8, 3 ], [ 9, 6 ], [ 10, 12 ], [ 10, 18 ], [ 11, 15 ], [ 12, 11 ], [ 13, 14 ], [ 13, 19 ], [ 15, 17 ], [ 18, 13 ], [ 19, 16 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Freya knows Kennedy. Gerald knows Freya. Sheila knows Lola. Viola knows Callum. Tonya knows Kaleb. Jocelyn knows Gerald. Leon knows Ted. Leon knows Adelaide. Kennedy knows Georgia. Gavin knows Travis. Viola knows Tonya. Tonya knows Jocelyn. Jake knows Sheila. Lola knows Leon. Gavin knows Jake. Adelaide knows Eileen. Freya knows Iris. Jake knows Ruth. Which of Eileen and Georgia can Viola reach?", "answer": "Georgia", "steps": [ "Viola knows Tonya.", "Tonya knows Jocelyn.", "Jocelyn knows Gerald.", "Gerald knows Freya.", "Freya knows Kennedy.", "Kennedy knows Georgia." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Viola", "Georgia", "Gerald", "Callum", "Freya", "Kaleb", "Kennedy", "Jocelyn", "Iris", "Tonya", "Gavin", "Eileen", "Lola", "Travis", "Leon", "Ruth", "Adelaide", "Sheila", "Ted", "Jake" ], "edges": [ [ 0, 3 ], [ 0, 9 ], [ 2, 4 ], [ 4, 6 ], [ 4, 8 ], [ 6, 1 ], [ 7, 2 ], [ 9, 5 ], [ 9, 7 ], [ 10, 13 ], [ 10, 19 ], [ 12, 14 ], [ 14, 16 ], [ 14, 18 ], [ 16, 11 ], [ 17, 12 ], [ 19, 15 ], [ 19, 17 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Chase knows Electra. Susanne knows Roger. Felicia knows Chase. Miriam knows Gareth. Roman knows Hannah. Yolanda knows Susanne. Kay knows Bob. Roger knows Carl. Felicia knows Lacey. Laverne knows Felicia. Kay knows Blanche. Roger knows Kay. Hannah knows Yolanda. Roger knows Jeff. Heather knows Laverne. Felicia knows Ruby. Gareth knows Heather. Chase knows Ada. Which of Hannah and Gareth can Roman reach?", "answer": "Hannah", "steps": [ "Roman knows Hannah." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Roman", "Bob", "Kay", "Carl", "Blanche", "Yolanda", "Roger", "Jeff", "Susanne", "Hannah", "Miriam", "Electra", "Chase", "Lacey", "Ada", "Heather", "Felicia", "Ruby", "Laverne", "Gareth" ], "edges": [ [ 0, 9 ], [ 2, 1 ], [ 2, 4 ], [ 5, 8 ], [ 6, 3 ], [ 6, 2 ], [ 6, 7 ], [ 8, 6 ], [ 9, 5 ], [ 10, 19 ], [ 12, 11 ], [ 12, 14 ], [ 15, 18 ], [ 16, 13 ], [ 16, 12 ], [ 16, 17 ], [ 18, 16 ], [ 19, 15 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Ava knows Rebecca. Rebecca knows Ross. Ian knows Cole. Florence knows Antonio. Livia knows Lloyd. Gemma knows Esther. Gemma knows Ian. Florence knows Ava. Harlan knows Max. Rebecca knows Tristan. Rosemary knows Florence. Cole knows Alyson. Tristan knows Greg. Harlan knows Rosemary. Cole knows Nicole. Louise knows Samantha. Nicole knows Louise. Louise knows Livia. Which of Rebecca and Louise can Gemma reach?", "answer": "Louise", "steps": [ "Gemma knows Ian.", "Ian knows Cole.", "Cole knows Nicole.", "Nicole knows Louise." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Gemma", "Samantha", "Ian", "Livia", "Cole", "Louise", "Esther", "Nicole", "Lloyd", "Alyson", "Harlan", "Ross", "Rosemary", "Tristan", "Florence", "Rebecca", "Max", "Ava", "Greg", "Antonio" ], "edges": [ [ 0, 6 ], [ 0, 2 ], [ 2, 4 ], [ 3, 8 ], [ 4, 7 ], [ 4, 9 ], [ 5, 1 ], [ 5, 3 ], [ 7, 5 ], [ 10, 16 ], [ 10, 12 ], [ 12, 14 ], [ 13, 18 ], [ 14, 17 ], [ 14, 19 ], [ 15, 11 ], [ 15, 13 ], [ 17, 15 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Freya knows Kennedy. Gerald knows Freya. Sheila knows Lola. Viola knows Callum. Tonya knows Kaleb. Jocelyn knows Gerald. Leon knows Ted. Leon knows Adelaide. Kennedy knows Georgia. Gavin knows Travis. Viola knows Tonya. Tonya knows Jocelyn. Jake knows Sheila. Lola knows Leon. Gavin knows Jake. Adelaide knows Eileen. Freya knows Iris. Jake knows Ruth. Which of Sheila and Jocelyn can Viola reach?", "answer": "Jocelyn", "steps": [ "Viola knows Tonya.", "Tonya knows Jocelyn." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Viola", "Georgia", "Gerald", "Callum", "Freya", "Kaleb", "Kennedy", "Jocelyn", "Iris", "Tonya", "Gavin", "Eileen", "Lola", "Travis", "Leon", "Ruth", "Adelaide", "Sheila", "Ted", "Jake" ], "edges": [ [ 0, 3 ], [ 0, 9 ], [ 2, 4 ], [ 4, 6 ], [ 4, 8 ], [ 6, 1 ], [ 7, 2 ], [ 9, 5 ], [ 9, 7 ], [ 10, 13 ], [ 10, 19 ], [ 12, 14 ], [ 14, 16 ], [ 14, 18 ], [ 16, 11 ], [ 17, 12 ], [ 19, 15 ], [ 19, 17 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Keira knows Humphrey. Lillian knows Federico. Walter knows Zach. Harold knows Eileen. Zach knows Griffith. Lacey knows Leroy. Eileen knows Carla. Eugene knows Harold. Lorraine knows Eugene. Humphrey knows Russ. Forrest knows Demetrius. Griffith knows Lillian. Leroy knows Forrest. Demetrius knows Jameson. Keith knows Elias. Elias knows Keira. Humphrey knows Lacey. Eileen knows Walter. Which of Griffith and Forrest can Lorraine reach?", "answer": "Griffith", "steps": [ "Lorraine knows Eugene.", "Eugene knows Harold.", "Harold knows Eileen.", "Eileen knows Walter.", "Walter knows Zach.", "Zach knows Griffith." ], "difficulty": 6, "original_distance": 8, "idx_to_symbol": [ "Lorraine", "Harold", "Zach", "Federico", "Eugene", "Griffith", "Eileen", "Lillian", "Walter", "Carla", "Keith", "Keira", "Leroy", "Jameson", "Elias", "Forrest", "Humphrey", "Demetrius", "Lacey", "Russ" ], "edges": [ [ 0, 4 ], [ 1, 6 ], [ 2, 5 ], [ 4, 1 ], [ 5, 7 ], [ 6, 8 ], [ 6, 9 ], [ 7, 3 ], [ 8, 2 ], [ 10, 14 ], [ 11, 16 ], [ 12, 15 ], [ 14, 11 ], [ 15, 17 ], [ 16, 18 ], [ 16, 19 ], [ 17, 13 ], [ 18, 12 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Cara knows Bette. Winifred knows Maude. Hendrix knows Wilma. Luella knows Hudson. Donna knows Cara. Milton knows Erik. Tonya knows Hendrix. Destiny knows Hadley. Hudson knows Winifred. Maude knows Milton. Hendrix knows Wanda. Wanda knows Bill. Hadley knows Skyler. Donna knows Nicholas. Milton knows Destiny. Luella knows Essie. Bette knows Tonya. Bill knows Peggy. Which of Bette and Winifred can Donna reach?", "answer": "Bette", "steps": [ "Donna knows Cara.", "Cara knows Bette." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Donna", "Tonya", "Cara", "Wilma", "Bette", "Peggy", "Wanda", "Bill", "Hendrix", "Nicholas", "Luella", "Maude", "Hudson", "Erik", "Winifred", "Skyler", "Destiny", "Hadley", "Milton", "Essie" ], "edges": [ [ 0, 2 ], [ 0, 9 ], [ 1, 8 ], [ 2, 4 ], [ 4, 1 ], [ 6, 7 ], [ 7, 5 ], [ 8, 3 ], [ 8, 6 ], [ 10, 12 ], [ 10, 19 ], [ 11, 18 ], [ 12, 14 ], [ 14, 11 ], [ 16, 17 ], [ 17, 15 ], [ 18, 13 ], [ 18, 16 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Jay knows Eve. Xander knows Jay. Verna knows Holly. Vicki knows Ellis. Emmett knows Steve. Reed knows Vicki. Jay knows Ilene. Vivian knows Jenny. Jay knows Heidi. Jenny knows Emmett. Archer knows Reed. Verna knows Diego. Verna knows Yasmin. Jenny knows Claudia. Reed knows Kenzie. Xander knows Vivian. Abigail knows Verna. Abigail knows Archer. Which of Reed and Jenny can Abigail reach?", "answer": "Reed", "steps": [ "Abigail knows Archer.", "Archer knows Reed." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Abigail", "Archer", "Ellis", "Kenzie", "Verna", "Vicki", "Yasmin", "Diego", "Holly", "Reed", "Xander", "Vivian", "Steve", "Claudia", "Jay", "Emmett", "Eve", "Ilene", "Heidi", "Jenny" ], "edges": [ [ 0, 4 ], [ 0, 1 ], [ 1, 9 ], [ 4, 6 ], [ 4, 7 ], [ 4, 8 ], [ 5, 2 ], [ 9, 3 ], [ 9, 5 ], [ 10, 14 ], [ 10, 11 ], [ 11, 19 ], [ 14, 16 ], [ 14, 17 ], [ 14, 18 ], [ 15, 12 ], [ 19, 13 ], [ 19, 15 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Elijah knows Pablo. Boris knows Ida. Lois knows Odette. Odette knows Boris. Julia knows Antonio. Diana knows Fernando. Pablo knows Ruth. Foster knows Elijah. Lois knows Jude. Antonio knows Inez. Kirsten knows Lois. Diana knows Ember. Fernando knows Foster. Elizabeth knows Rena. Jude knows Elizabeth. Isaac knows Kirsten. Foster knows Julia. Isaac knows Kenzie. Which of Foster and Lois can Diana reach?", "answer": "Foster", "steps": [ "Diana knows Fernando.", "Fernando knows Foster." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Diana", "Ember", "Fernando", "Elijah", "Ruth", "Foster", "Pablo", "Inez", "Julia", "Antonio", "Isaac", "Kenzie", "Kirsten", "Odette", "Ida", "Lois", "Boris", "Rena", "Jude", "Elizabeth" ], "edges": [ [ 0, 1 ], [ 0, 2 ], [ 2, 5 ], [ 3, 6 ], [ 5, 3 ], [ 5, 8 ], [ 6, 4 ], [ 8, 9 ], [ 9, 7 ], [ 10, 11 ], [ 10, 12 ], [ 12, 15 ], [ 13, 16 ], [ 15, 13 ], [ 15, 18 ], [ 16, 14 ], [ 18, 19 ], [ 19, 17 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Matthew knows Irene. Eamon knows Emily. Matthew knows Blake. Emily knows Matthew. Blake knows Elliot. Emily knows Phoebe. Joseph knows Melody. Jim knows Cole. Boris knows Jim. Joseph knows Geoffrey. Joseph knows Lisa. Lisa knows Frida. Melody knows Hamilton. Frances knows Dolores. Matthew knows Frances. Jim knows Joseph. Emily knows Laurel. Jim knows Harriet. Which of Emily and Jim can Eamon reach?", "answer": "Emily", "steps": [ "Eamon knows Emily." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Eamon", "Blake", "Phoebe", "Laurel", "Dolores", "Emily", "Frances", "Elliot", "Matthew", "Irene", "Boris", "Lisa", "Cole", "Harriet", "Hamilton", "Jim", "Melody", "Frida", "Joseph", "Geoffrey" ], "edges": [ [ 0, 5 ], [ 1, 7 ], [ 5, 2 ], [ 5, 3 ], [ 5, 8 ], [ 6, 4 ], [ 8, 6 ], [ 8, 1 ], [ 8, 9 ], [ 10, 15 ], [ 11, 17 ], [ 15, 12 ], [ 15, 13 ], [ 15, 18 ], [ 16, 14 ], [ 18, 16 ], [ 18, 11 ], [ 18, 19 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Zara knows Donna. Preston knows Albert. Erica knows Claudia. Preston knows Leon. Darla knows Randall. Glenn knows Erica. Barbara knows Zara. Emma knows Jared. Earle knows Emma. Leon knows Glenn. Jared knows Rena. Randall knows Earle. Claudia knows Blaine. Randall knows Lana. Kieran knows Kirsten. Rena knows Kieran. Earle knows Adam. Zara knows Preston. Which of Rena and Erica can Barbara reach?", "answer": "Erica", "steps": [ "Barbara knows Zara.", "Zara knows Preston.", "Preston knows Leon.", "Leon knows Glenn.", "Glenn knows Erica." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Barbara", "Blaine", "Albert", "Claudia", "Erica", "Donna", "Leon", "Glenn", "Preston", "Zara", "Darla", "Kirsten", "Adam", "Kieran", "Rena", "Lana", "Emma", "Jared", "Earle", "Randall" ], "edges": [ [ 0, 9 ], [ 3, 1 ], [ 4, 3 ], [ 6, 7 ], [ 7, 4 ], [ 8, 2 ], [ 8, 6 ], [ 9, 5 ], [ 9, 8 ], [ 10, 19 ], [ 13, 11 ], [ 14, 13 ], [ 16, 17 ], [ 17, 14 ], [ 18, 12 ], [ 18, 16 ], [ 19, 15 ], [ 19, 18 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Paul knows Delia. Edith knows Abigail. Oscar knows Rena. Edith knows Blake. Crystal knows Chandler. Blake knows Bernard. Janice knows Daria. Norman knows Esperanza. Langston knows Edith. Rena knows Greg. Oscar knows Lynn. Paul knows Oscar. Delia knows Crystal. Daria knows Langston. Sue knows Veronica. Jonah knows Norman. Veronica knows Paul. Langston knows Jonah. Which of Bernard and Greg can Sue reach?", "answer": "Greg", "steps": [ "Sue knows Veronica.", "Veronica knows Paul.", "Paul knows Oscar.", "Oscar knows Rena.", "Rena knows Greg." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Sue", "Paul", "Veronica", "Chandler", "Lynn", "Oscar", "Rena", "Greg", "Delia", "Crystal", "Janice", "Langston", "Daria", "Esperanza", "Abigail", "Edith", "Blake", "Bernard", "Jonah", "Norman" ], "edges": [ [ 0, 2 ], [ 1, 5 ], [ 1, 8 ], [ 2, 1 ], [ 5, 4 ], [ 5, 6 ], [ 6, 7 ], [ 8, 9 ], [ 9, 3 ], [ 10, 12 ], [ 11, 15 ], [ 11, 18 ], [ 12, 11 ], [ 15, 14 ], [ 15, 16 ], [ 16, 17 ], [ 18, 19 ], [ 19, 13 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Sadie knows Brynn. Marco knows Eve. Haley knows Sadie. Stefan knows Dee. Valerie knows Bonnie. Morris knows Susanne. Bonnie knows Elvira. Amy knows Jodi. Cameron knows Amy. Cordelia knows Haley. Dee knows Eli. Sadie knows Deborah. Fergus knows Zachary. Amy knows Stefan. Marco knows Cameron. Deborah knows Morris. Zachary knows Marco. Morris knows Valerie. Which of Sadie and Marco can Cordelia reach?", "answer": "Sadie", "steps": [ "Cordelia knows Haley.", "Haley knows Sadie." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Cordelia", "Elvira", "Brynn", "Susanne", "Sadie", "Valerie", "Morris", "Bonnie", "Haley", "Deborah", "Fergus", "Eli", "Eve", "Jodi", "Marco", "Stefan", "Amy", "Dee", "Zachary", "Cameron" ], "edges": [ [ 0, 8 ], [ 4, 2 ], [ 4, 9 ], [ 5, 7 ], [ 6, 3 ], [ 6, 5 ], [ 7, 1 ], [ 8, 4 ], [ 9, 6 ], [ 10, 18 ], [ 14, 12 ], [ 14, 19 ], [ 15, 17 ], [ 16, 13 ], [ 16, 15 ], [ 17, 11 ], [ 18, 14 ], [ 19, 16 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Colby knows Colette. Erica knows Sam. Hilda knows Colby. Kendra knows Porter. Hilda knows Bruce. Anita knows Hilda. Kendra knows Dudley. Aaron knows Anita. Otto knows India. India knows June. Bruce knows Houston. India knows Kendra. Sam knows Otto. Monroe knows Aaron. June knows Daniel. June knows Owen. Bruce knows Arturo. Colby knows Noel. Which of Daniel and Arturo can Monroe reach?", "answer": "Arturo", "steps": [ "Monroe knows Aaron.", "Aaron knows Anita.", "Anita knows Hilda.", "Hilda knows Bruce.", "Bruce knows Arturo." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Monroe", "Bruce", "Colby", "Anita", "Colette", "Aaron", "Hilda", "Houston", "Noel", "Arturo", "Erica", "June", "Kendra", "Otto", "Dudley", "Sam", "India", "Owen", "Porter", "Daniel" ], "edges": [ [ 0, 5 ], [ 1, 7 ], [ 1, 9 ], [ 2, 4 ], [ 2, 8 ], [ 3, 6 ], [ 5, 3 ], [ 6, 2 ], [ 6, 1 ], [ 10, 15 ], [ 11, 17 ], [ 11, 19 ], [ 12, 14 ], [ 12, 18 ], [ 13, 16 ], [ 15, 13 ], [ 16, 12 ], [ 16, 11 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Mark knows Etta. Hannah knows Garland. Jacqueline knows Kenzie. Myrtle knows Alex. Alex knows Aria. Julian knows Marcus. Nicholas knows Ramon. Garland knows Mark. Erik knows Hannah. Ramon knows Wanda. Alex knows Jacqueline. Jana knows Floyd. Marcus knows Myrtle. Mark knows Jana. Mike knows Giselle. Giselle knows Roman. Wanda knows Julian. Roman knows Erik. Which of Ramon and Giselle can Mike reach?", "answer": "Giselle", "steps": [ "Mike knows Giselle." ], "difficulty": 1, "original_distance": 8, "idx_to_symbol": [ "Mike", "Etta", "Jana", "Mark", "Floyd", "Hannah", "Erik", "Giselle", "Garland", "Roman", "Nicholas", "Aria", "Jacqueline", "Alex", "Kenzie", "Marcus", "Julian", "Ramon", "Myrtle", "Wanda" ], "edges": [ [ 0, 7 ], [ 2, 4 ], [ 3, 1 ], [ 3, 2 ], [ 5, 8 ], [ 6, 5 ], [ 7, 9 ], [ 8, 3 ], [ 9, 6 ], [ 10, 17 ], [ 12, 14 ], [ 13, 11 ], [ 13, 12 ], [ 15, 18 ], [ 16, 15 ], [ 17, 19 ], [ 18, 13 ], [ 19, 16 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Alan knows Lena. Gerard knows Hunter. Hunter knows Maureen. Dawn knows Marlene. Keith knows Hank. Hank knows Emery. Keith knows Clinton. Gerard knows Ben. Darla knows Nell. Eli knows Marian. Eli knows Gerard. Lilia knows Ashton. Nell knows Dawn. Ben knows Zach. Lilia knows Keith. Lena knows Ariana. Zach knows Alan. Clinton knows Darla. Which of Ben and Clinton can Eli reach?", "answer": "Ben", "steps": [ "Eli knows Gerard.", "Gerard knows Ben." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Eli", "Alan", "Lena", "Ben", "Maureen", "Hunter", "Marian", "Ariana", "Gerard", "Zach", "Lilia", "Nell", "Dawn", "Clinton", "Emery", "Hank", "Ashton", "Marlene", "Keith", "Darla" ], "edges": [ [ 0, 6 ], [ 0, 8 ], [ 1, 2 ], [ 2, 7 ], [ 3, 9 ], [ 5, 4 ], [ 8, 5 ], [ 8, 3 ], [ 9, 1 ], [ 10, 16 ], [ 10, 18 ], [ 11, 12 ], [ 12, 17 ], [ 13, 19 ], [ 15, 14 ], [ 18, 15 ], [ 18, 13 ], [ 19, 11 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Bennett knows Miranda. Stephen knows Marian. Bennett knows Ruby. Miranda knows Claude. Celia knows Dana. Stephen knows Alejandro. Fergus knows Celia. Bernadette knows Blanche. Celia knows Morgan. Dana knows Pam. Dana knows Lambert. Bennett knows Stephen. Bennett knows Sierra. Jude knows Devin. Celia knows Logan. Devin knows Bennett. Celia knows Bernadette. Heidi knows Fergus. Which of Dana and Stephen can Heidi reach?", "answer": "Dana", "steps": [ "Heidi knows Fergus.", "Fergus knows Celia.", "Celia knows Dana." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Heidi", "Fergus", "Blanche", "Logan", "Bernadette", "Celia", "Morgan", "Dana", "Pam", "Lambert", "Jude", "Devin", "Claude", "Sierra", "Miranda", "Bennett", "Ruby", "Stephen", "Alejandro", "Marian" ], "edges": [ [ 0, 1 ], [ 1, 5 ], [ 4, 2 ], [ 5, 3 ], [ 5, 4 ], [ 5, 6 ], [ 5, 7 ], [ 7, 8 ], [ 7, 9 ], [ 10, 11 ], [ 11, 15 ], [ 14, 12 ], [ 15, 13 ], [ 15, 14 ], [ 15, 16 ], [ 15, 17 ], [ 17, 18 ], [ 17, 19 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Ella knows Anita. Emily knows Denver. Luella knows Todd. Lucille knows Flora. Anita knows Luella. Ella knows Harmony. Lucille knows Harris. Harris knows Jerome. Anita knows Leonard. Emily knows Damian. Gideon knows Lucille. Harris knows Everett. Harrison knows Thea. Clay knows Harrison. Denver knows Ella. Damian knows Frida. Clay knows Gideon. Everett knows Julius. Which of Ella and Lucille can Emily reach?", "answer": "Ella", "steps": [ "Emily knows Denver.", "Denver knows Ella." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Emily", "Frida", "Luella", "Anita", "Denver", "Todd", "Ella", "Damian", "Leonard", "Harmony", "Clay", "Thea", "Everett", "Harris", "Gideon", "Julius", "Lucille", "Harrison", "Jerome", "Flora" ], "edges": [ [ 0, 7 ], [ 0, 4 ], [ 2, 5 ], [ 3, 2 ], [ 3, 8 ], [ 4, 6 ], [ 6, 3 ], [ 6, 9 ], [ 7, 1 ], [ 10, 17 ], [ 10, 14 ], [ 12, 15 ], [ 13, 12 ], [ 13, 18 ], [ 14, 16 ], [ 16, 13 ], [ 16, 19 ], [ 17, 11 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Earl knows Jose. Kirsten knows Justin. Harper knows Francesca. Israel knows Layla. Luella knows Diego. Jude knows Chandler. Logan knows Emmett. Earl knows Harper. Logan knows Jude. Logan knows Ross. Logan knows Kirsten. Harper knows Mary. Israel knows Earl. Israel knows Luella. Angelica knows Sonia. Jude knows Angelica. Angelica knows Oliver. Israel knows Hannah. Which of Earl and Jude can Israel reach?", "answer": "Earl", "steps": [ "Israel knows Earl." ], "difficulty": 1, "original_distance": 3, "idx_to_symbol": [ "Israel", "Harper", "Francesca", "Hannah", "Layla", "Earl", "Diego", "Luella", "Jose", "Mary", "Logan", "Angelica", "Oliver", "Emmett", "Ross", "Jude", "Justin", "Kirsten", "Chandler", "Sonia" ], "edges": [ [ 0, 3 ], [ 0, 4 ], [ 0, 7 ], [ 0, 5 ], [ 1, 2 ], [ 1, 9 ], [ 5, 8 ], [ 5, 1 ], [ 7, 6 ], [ 10, 13 ], [ 10, 14 ], [ 10, 17 ], [ 10, 15 ], [ 11, 12 ], [ 11, 19 ], [ 15, 18 ], [ 15, 11 ], [ 17, 16 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Carter knows Byron. Elise knows Sidney. Karina knows Jasmine. Byron knows Peggy. Uma knows Bruno. Carter knows Carl. Austin knows Elise. Angela knows Harvey. Jasmine knows Amelia. Harvey knows Amy. Amy knows Austin. Angela knows Arlene. Amelia knows Viola. Derrick knows Justin. Sidney knows Hal. Sidney knows Uma. Amelia knows Derrick. Peggy knows Karina. Which of Amelia and Sidney can Carter reach?", "answer": "Amelia", "steps": [ "Carter knows Byron.", "Byron knows Peggy.", "Peggy knows Karina.", "Karina knows Jasmine.", "Jasmine knows Amelia." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Carter", "Jasmine", "Byron", "Derrick", "Amelia", "Viola", "Karina", "Justin", "Peggy", "Carl", "Angela", "Elise", "Harvey", "Uma", "Sidney", "Hal", "Austin", "Bruno", "Amy", "Arlene" ], "edges": [ [ 0, 2 ], [ 0, 9 ], [ 1, 4 ], [ 2, 8 ], [ 3, 7 ], [ 4, 5 ], [ 4, 3 ], [ 6, 1 ], [ 8, 6 ], [ 10, 12 ], [ 10, 19 ], [ 11, 14 ], [ 12, 18 ], [ 13, 17 ], [ 14, 15 ], [ 14, 13 ], [ 16, 11 ], [ 18, 16 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Irma knows Elmer. Verna knows Clyde. Clyde knows Serena. Ariana knows Irma. Dell knows Xander. Rosemary knows Archie. Cyrus knows Blanche. Serena knows Pierce. Jennifer knows Uma. Elmer knows Jennifer. Archie knows Verna. Irma knows Cyrus. Kai knows Devin. Archie knows Kai. Verna knows Doris. Devin knows Sheila. Cyrus knows Wesley. Wesley knows Dell. Which of Archie and Irma can Rosemary reach?", "answer": "Archie", "steps": [ "Rosemary knows Archie." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Rosemary", "Sheila", "Kai", "Devin", "Serena", "Doris", "Verna", "Clyde", "Pierce", "Archie", "Ariana", "Uma", "Elmer", "Jennifer", "Dell", "Blanche", "Cyrus", "Wesley", "Xander", "Irma" ], "edges": [ [ 0, 9 ], [ 2, 3 ], [ 3, 1 ], [ 4, 8 ], [ 6, 5 ], [ 6, 7 ], [ 7, 4 ], [ 9, 2 ], [ 9, 6 ], [ 10, 19 ], [ 12, 13 ], [ 13, 11 ], [ 14, 18 ], [ 16, 15 ], [ 16, 17 ], [ 17, 14 ], [ 19, 12 ], [ 19, 16 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Jules knows Estelle. Edmund knows Opal. Hazel knows Layla. Malik knows Hazel. Hazel knows Floyd. Dwight knows Joanna. Penny knows Darla. Opal knows Dwight. Carol knows Hope. Carol knows Penny. Dwight knows Robert. Katrina knows Edmund. Joanna knows Jules. Edmund knows Marilyn. Michael knows Carol. Michael knows Gerald. Joanna knows Preston. Layla knows Michael. Which of Dwight and Michael can Katrina reach?", "answer": "Dwight", "steps": [ "Katrina knows Edmund.", "Edmund knows Opal.", "Opal knows Dwight." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Katrina", "Marilyn", "Estelle", "Opal", "Joanna", "Robert", "Jules", "Dwight", "Preston", "Edmund", "Malik", "Floyd", "Darla", "Layla", "Carol", "Gerald", "Penny", "Michael", "Hope", "Hazel" ], "edges": [ [ 0, 9 ], [ 3, 7 ], [ 4, 6 ], [ 4, 8 ], [ 6, 2 ], [ 7, 5 ], [ 7, 4 ], [ 9, 1 ], [ 9, 3 ], [ 10, 19 ], [ 13, 17 ], [ 14, 16 ], [ 14, 18 ], [ 16, 12 ], [ 17, 15 ], [ 17, 14 ], [ 19, 11 ], [ 19, 13 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Hugo knows Samuel. Kurt knows Brenda. Brenda knows Kamila. Brenda knows Freya. Merle knows Valerie. Julia knows Abby. Kurt knows Gabe. Brent knows Hugo. Freya knows Merle. Julia knows Colby. Hugo knows Kendra. Brenda knows Eugenia. Julia knows Lamont. Hugo knows Jack. Samuel knows Julia. Merle knows Dina. Merle knows Tabitha. Brent knows Stefan. Which of Hugo and Brenda can Kurt reach?", "answer": "Brenda", "steps": [ "Kurt knows Brenda." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Kurt", "Gabe", "Dina", "Merle", "Eugenia", "Valerie", "Kamila", "Tabitha", "Freya", "Brenda", "Brent", "Stefan", "Lamont", "Julia", "Kendra", "Colby", "Jack", "Abby", "Samuel", "Hugo" ], "edges": [ [ 0, 1 ], [ 0, 9 ], [ 3, 2 ], [ 3, 5 ], [ 3, 7 ], [ 8, 3 ], [ 9, 4 ], [ 9, 6 ], [ 9, 8 ], [ 10, 11 ], [ 10, 19 ], [ 13, 12 ], [ 13, 15 ], [ 13, 17 ], [ 18, 13 ], [ 19, 14 ], [ 19, 16 ], [ 19, 18 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Jake knows Helen. Nina knows Derrick. Shaun knows Esperanza. Luis knows Bernadette. Karl knows Luis. Nadine knows Nina. Karl knows Elton. Karl knows Ethan. Nina knows Karl. Shaun knows Jake. Jake knows Celia. Celia knows Simon. Jake knows Hayden. Jake knows Emery. Karl knows Lark. Esperanza knows Seth. Derrick knows Daphne. Whitney knows Shaun. Which of Simon and Bernadette can Nadine reach?", "answer": "Bernadette", "steps": [ "Nadine knows Nina.", "Nina knows Karl.", "Karl knows Luis.", "Luis knows Bernadette." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Nadine", "Bernadette", "Daphne", "Elton", "Lark", "Derrick", "Luis", "Ethan", "Nina", "Karl", "Whitney", "Simon", "Seth", "Hayden", "Emery", "Esperanza", "Celia", "Helen", "Shaun", "Jake" ], "edges": [ [ 0, 8 ], [ 5, 2 ], [ 6, 1 ], [ 8, 5 ], [ 8, 9 ], [ 9, 3 ], [ 9, 4 ], [ 9, 6 ], [ 9, 7 ], [ 10, 18 ], [ 15, 12 ], [ 16, 11 ], [ 18, 15 ], [ 18, 19 ], [ 19, 13 ], [ 19, 14 ], [ 19, 16 ], [ 19, 17 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Miriam knows Sally. Fisher knows Paige. Wilma knows Mildred. Miriam knows Barbara. Federico knows Alicia. Rosemary knows Willis. Earl knows Jennifer. Jennifer knows Avery. Lorna knows Rosemary. Wilma knows Patrick. Miriam knows Drake. Mildred knows Louis. Barbara knows Natalie. Conner knows Federico. Alicia knows Lorna. Paige knows Earl. Sally knows Fisher. Wilma knows Conner. Which of Jennifer and Rosemary can Wilma reach?", "answer": "Rosemary", "steps": [ "Wilma knows Conner.", "Conner knows Federico.", "Federico knows Alicia.", "Alicia knows Lorna.", "Lorna knows Rosemary." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Wilma", "Rosemary", "Willis", "Mildred", "Lorna", "Patrick", "Louis", "Federico", "Alicia", "Conner", "Miriam", "Jennifer", "Avery", "Barbara", "Earl", "Drake", "Natalie", "Fisher", "Paige", "Sally" ], "edges": [ [ 0, 5 ], [ 0, 3 ], [ 0, 9 ], [ 1, 2 ], [ 3, 6 ], [ 4, 1 ], [ 7, 8 ], [ 8, 4 ], [ 9, 7 ], [ 10, 15 ], [ 10, 13 ], [ 10, 19 ], [ 11, 12 ], [ 13, 16 ], [ 14, 11 ], [ 17, 18 ], [ 18, 14 ], [ 19, 17 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Emanuel knows Carol. Andrew knows Ruby. Kennedy knows Fiona. Leroy knows Willis. Carol knows Kirsten. Martin knows Amelia. Saul knows Khashayar. Ruby knows Jamie. Willis knows Earle. Kirsten knows Leroy. Kirsten knows Kennedy. Willis knows Corey. Corey knows Uma. Jamie knows Keith. Khashayar knows Vivian. Amelia knows Saul. Ruby knows Liam. Saul knows Andrew. Which of Amelia and Carol can Martin reach?", "answer": "Amelia", "steps": [ "Martin knows Amelia." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Martin", "Jamie", "Khashayar", "Amelia", "Saul", "Ruby", "Liam", "Andrew", "Keith", "Vivian", "Emanuel", "Corey", "Kennedy", "Carol", "Kirsten", "Willis", "Earle", "Leroy", "Uma", "Fiona" ], "edges": [ [ 0, 3 ], [ 1, 8 ], [ 2, 9 ], [ 3, 4 ], [ 4, 7 ], [ 4, 2 ], [ 5, 6 ], [ 5, 1 ], [ 7, 5 ], [ 10, 13 ], [ 11, 18 ], [ 12, 19 ], [ 13, 14 ], [ 14, 17 ], [ 14, 12 ], [ 15, 16 ], [ 15, 11 ], [ 17, 15 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Clifford knows Jared. Sally knows Effie. Adam knows Shannon. Jane knows Wilson. Clayton knows Ignacio. Adam knows Jane. Clifford knows Jillian. Jake knows Adam. Wilson knows Pam. Ignacio knows Miles. Sally knows Juan. Clayton knows Edward. Kate knows Ray. Wilson knows Ada. Juan knows Clifford. Miles knows Sally. Simon knows Jake. Kate knows Simon. Which of Wilson and Clifford can Clayton reach?", "answer": "Clifford", "steps": [ "Clayton knows Ignacio.", "Ignacio knows Miles.", "Miles knows Sally.", "Sally knows Juan.", "Juan knows Clifford." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Clayton", "Sally", "Edward", "Clifford", "Jared", "Effie", "Jillian", "Juan", "Ignacio", "Miles", "Kate", "Adam", "Ray", "Wilson", "Pam", "Shannon", "Ada", "Jane", "Simon", "Jake" ], "edges": [ [ 0, 2 ], [ 0, 8 ], [ 1, 5 ], [ 1, 7 ], [ 3, 4 ], [ 3, 6 ], [ 7, 3 ], [ 8, 9 ], [ 9, 1 ], [ 10, 12 ], [ 10, 18 ], [ 11, 15 ], [ 11, 17 ], [ 13, 14 ], [ 13, 16 ], [ 17, 13 ], [ 18, 19 ], [ 19, 11 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Dalton knows Lara. Dalton knows Simon. Leland knows Jeremy. Autumn knows Rick. Jeremy knows Esperanza. Lara knows Geneva. Adele knows Isla. Geneva knows Darla. Isla knows Helene. Fletcher knows Ivy. Helene knows Dalton. Dalton knows Daphna. Daphna knows Federico. Jeremy knows Kai. Yuki knows Leland. Jeremy knows Autumn. Sue knows Yuki. Esperanza knows Fletcher. Which of Ivy and Darla can Sue reach?", "answer": "Ivy", "steps": [ "Sue knows Yuki.", "Yuki knows Leland.", "Leland knows Jeremy.", "Jeremy knows Esperanza.", "Esperanza knows Fletcher.", "Fletcher knows Ivy." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Sue", "Leland", "Esperanza", "Kai", "Fletcher", "Yuki", "Rick", "Jeremy", "Ivy", "Autumn", "Adele", "Helene", "Lara", "Simon", "Geneva", "Isla", "Federico", "Dalton", "Darla", "Daphna" ], "edges": [ [ 0, 5 ], [ 1, 7 ], [ 2, 4 ], [ 4, 8 ], [ 5, 1 ], [ 7, 3 ], [ 7, 2 ], [ 7, 9 ], [ 9, 6 ], [ 10, 15 ], [ 11, 17 ], [ 12, 14 ], [ 14, 18 ], [ 15, 11 ], [ 17, 13 ], [ 17, 12 ], [ 17, 19 ], [ 19, 16 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Sybil knows Bernadette. Finn knows India. India knows Faith. Sybil knows Hardy. Jose knows Sue. Finn knows Jose. Larry knows Arturo. Alyssa knows Logan. Pierce knows Larry. Arturo knows Sybil. Geraldine knows Lara. Sue knows Camille. Bernadette knows Elvira. Hardy knows Alyssa. Fern knows Geraldine. Bernadette knows Bella. Lara knows Finn. India knows Forrest. Which of Sue and Alyssa can Pierce reach?", "answer": "Alyssa", "steps": [ "Pierce knows Larry.", "Larry knows Arturo.", "Arturo knows Sybil.", "Sybil knows Hardy.", "Hardy knows Alyssa." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Pierce", "Alyssa", "Hardy", "Logan", "Arturo", "Elvira", "Bella", "Sybil", "Bernadette", "Larry", "Fern", "Sue", "Jose", "Camille", "Lara", "Faith", "Forrest", "Finn", "India", "Geraldine" ], "edges": [ [ 0, 9 ], [ 1, 3 ], [ 2, 1 ], [ 4, 7 ], [ 7, 2 ], [ 7, 8 ], [ 8, 5 ], [ 8, 6 ], [ 9, 4 ], [ 10, 19 ], [ 11, 13 ], [ 12, 11 ], [ 14, 17 ], [ 17, 12 ], [ 17, 18 ], [ 18, 15 ], [ 18, 16 ], [ 19, 14 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Glenda knows Kristin. Dominic knows Eva. Alex knows Tamara. Dee knows Gus. Casey knows Carol. Hailey knows Angela. Angela knows Alex. Casey knows Alder. Alex knows Glenda. Alex knows Colleen. Gus knows Casey. Kendra knows Hailey. Gladys knows Kendra. Eva knows Dee. Lennox knows Mary. Eva knows Bernice. Casey knows Lennox. Kendra knows Kai. Which of Casey and Alex can Gladys reach?", "answer": "Alex", "steps": [ "Gladys knows Kendra.", "Kendra knows Hailey.", "Hailey knows Angela.", "Angela knows Alex." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Gladys", "Kristin", "Colleen", "Glenda", "Kendra", "Tamara", "Kai", "Alex", "Angela", "Hailey", "Dominic", "Mary", "Alder", "Lennox", "Eva", "Carol", "Bernice", "Casey", "Gus", "Dee" ], "edges": [ [ 0, 4 ], [ 3, 1 ], [ 4, 6 ], [ 4, 9 ], [ 7, 2 ], [ 7, 3 ], [ 7, 5 ], [ 8, 7 ], [ 9, 8 ], [ 10, 14 ], [ 13, 11 ], [ 14, 16 ], [ 14, 19 ], [ 17, 12 ], [ 17, 13 ], [ 17, 15 ], [ 18, 17 ], [ 19, 18 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Gemma knows Marie. Cameron knows Paula. Calvin knows Lois. Ashley knows Calvin. Paula knows Kira. Lois knows Roger. Calvin knows Vivian. Roger knows Carrie. Marie knows Karla. Gage knows Hannah. Kira knows Gemma. Carrie knows Martin. Aaron knows Jocelyn. Paula knows Aaron. Aaron knows Zane. Calvin knows Gage. Paula knows Opal. Gage knows Lenora. Which of Martin and Karla can Cameron reach?", "answer": "Karla", "steps": [ "Cameron knows Paula.", "Paula knows Kira.", "Kira knows Gemma.", "Gemma knows Marie.", "Marie knows Karla." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Cameron", "Kira", "Marie", "Gemma", "Karla", "Paula", "Aaron", "Opal", "Zane", "Jocelyn", "Ashley", "Lois", "Carrie", "Roger", "Martin", "Calvin", "Gage", "Vivian", "Hannah", "Lenora" ], "edges": [ [ 0, 5 ], [ 1, 3 ], [ 2, 4 ], [ 3, 2 ], [ 5, 1 ], [ 5, 7 ], [ 5, 6 ], [ 6, 8 ], [ 6, 9 ], [ 10, 15 ], [ 11, 13 ], [ 12, 14 ], [ 13, 12 ], [ 15, 11 ], [ 15, 17 ], [ 15, 16 ], [ 16, 18 ], [ 16, 19 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Edward knows Edmund. Kane knows Cameron. Kelsey knows Rose. Rena knows Leigh. Luther knows Jake. Luther knows Ron. Leigh knows Maya. Jared knows Linda. Maya knows Axel. Rena knows Tara. Leigh knows Dakota. Jake knows Kelsey. Edmund knows Luther. Ingrid knows Rena. Jake knows Greg. Jake knows Kane. Leigh knows Jared. Jerome knows Ingrid. Which of Leigh and Jake can Edward reach?", "answer": "Jake", "steps": [ "Edward knows Edmund.", "Edmund knows Luther.", "Luther knows Jake." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Edward", "Edmund", "Cameron", "Kelsey", "Rose", "Jake", "Kane", "Greg", "Ron", "Luther", "Jerome", "Ingrid", "Axel", "Jared", "Linda", "Leigh", "Maya", "Dakota", "Tara", "Rena" ], "edges": [ [ 0, 1 ], [ 1, 9 ], [ 3, 4 ], [ 5, 3 ], [ 5, 6 ], [ 5, 7 ], [ 6, 2 ], [ 9, 5 ], [ 9, 8 ], [ 10, 11 ], [ 11, 19 ], [ 13, 14 ], [ 15, 13 ], [ 15, 16 ], [ 15, 17 ], [ 16, 12 ], [ 19, 15 ], [ 19, 18 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "August knows Josie. Zara knows Arthur. Carson knows Saul. Cristina knows August. Karl knows Lorna. Annie knows Troy. Hubert knows Sadie. Ebony knows Aspen. Todd knows Hubert. Arthur knows Malik. Malik knows Ebony. Aspen knows Karl. Chandler knows Todd. Courtney knows Annie. Aspen knows Cristina. Todd knows Carson. Saul knows George. Troy knows Chandler. Which of Arthur and Annie can Zara reach?", "answer": "Arthur", "steps": [ "Zara knows Arthur." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Zara", "Malik", "Josie", "Arthur", "Cristina", "Karl", "Ebony", "Lorna", "August", "Aspen", "Courtney", "Troy", "George", "Annie", "Carson", "Hubert", "Chandler", "Sadie", "Saul", "Todd" ], "edges": [ [ 0, 3 ], [ 1, 6 ], [ 3, 1 ], [ 4, 8 ], [ 5, 7 ], [ 6, 9 ], [ 8, 2 ], [ 9, 5 ], [ 9, 4 ], [ 10, 13 ], [ 11, 16 ], [ 13, 11 ], [ 14, 18 ], [ 15, 17 ], [ 16, 19 ], [ 18, 12 ], [ 19, 15 ], [ 19, 14 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Glenn knows Desmond. Hayes knows Monica. Levi knows Gerard. Xavier knows Helen. Matt knows Destiny. Marvin knows Glenn. Matthew knows Matt. Kylie knows Fabian. Marvin knows Jason. Jason knows Kylie. Jason knows Levi. Gwen knows Matthew. Xavier knows Earle. Gwen knows Xavier. Glenn knows Cesar. Earle knows Sonia. Matthew knows Hayes. Cesar knows Erma. Which of Levi and Matt can Gwen reach?", "answer": "Matt", "steps": [ "Gwen knows Matthew.", "Matthew knows Matt." ], "difficulty": 2, "original_distance": 3, "idx_to_symbol": [ "Gwen", "Helen", "Monica", "Destiny", "Matt", "Hayes", "Xavier", "Matthew", "Earle", "Sonia", "Marvin", "Desmond", "Fabian", "Gerard", "Levi", "Kylie", "Glenn", "Jason", "Cesar", "Erma" ], "edges": [ [ 0, 7 ], [ 0, 6 ], [ 4, 3 ], [ 5, 2 ], [ 6, 1 ], [ 6, 8 ], [ 7, 4 ], [ 7, 5 ], [ 8, 9 ], [ 10, 17 ], [ 10, 16 ], [ 14, 13 ], [ 15, 12 ], [ 16, 11 ], [ 16, 18 ], [ 17, 14 ], [ 17, 15 ], [ 18, 19 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Pedro knows Russ. Russ knows Pam. Judy knows Clark. Sylvia knows Greg. Sylvia knows Pedro. Pedro knows Harmony. Adrian knows Clay. Clark knows Claudia. Clay knows Stacy. Sylvia knows Leonard. Adrian knows Neville. Judy knows Ernest. Ruth knows Geoffrey. Neville knows Kylie. Russ knows Ruth. Adrian knows Parsa. Clay knows Judy. Leonard knows Chandler. Which of Russ and Judy can Sylvia reach?", "answer": "Russ", "steps": [ "Sylvia knows Pedro.", "Pedro knows Russ." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Sylvia", "Pam", "Geoffrey", "Russ", "Pedro", "Greg", "Harmony", "Chandler", "Leonard", "Ruth", "Adrian", "Ernest", "Claudia", "Judy", "Clay", "Parsa", "Stacy", "Kylie", "Neville", "Clark" ], "edges": [ [ 0, 5 ], [ 0, 8 ], [ 0, 4 ], [ 3, 1 ], [ 3, 9 ], [ 4, 6 ], [ 4, 3 ], [ 8, 7 ], [ 9, 2 ], [ 10, 15 ], [ 10, 18 ], [ 10, 14 ], [ 13, 11 ], [ 13, 19 ], [ 14, 16 ], [ 14, 13 ], [ 18, 17 ], [ 19, 12 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Denise knows Guillermo. Effie knows Dina. Dina knows Mara. Haven knows Aspen. Cesar knows Haven. Mara knows Marc. Haven knows Rena. Haven knows Samuel. Dina knows Stella. Rena knows Brian. Haven knows Denise. Ralph knows Helene. Helene knows Caroline. Aspen knows Daphne. Dina knows Leigh. Guillermo knows Marcus. Dina knows Ralph. Stella knows Ramon. Which of Caroline and Marcus can Cesar reach?", "answer": "Marcus", "steps": [ "Cesar knows Haven.", "Haven knows Denise.", "Denise knows Guillermo.", "Guillermo knows Marcus." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Cesar", "Samuel", "Brian", "Guillermo", "Aspen", "Rena", "Marcus", "Haven", "Daphne", "Denise", "Effie", "Leigh", "Ramon", "Helene", "Mara", "Stella", "Caroline", "Dina", "Marc", "Ralph" ], "edges": [ [ 0, 7 ], [ 3, 6 ], [ 4, 8 ], [ 5, 2 ], [ 7, 1 ], [ 7, 5 ], [ 7, 4 ], [ 7, 9 ], [ 9, 3 ], [ 10, 17 ], [ 13, 16 ], [ 14, 18 ], [ 15, 12 ], [ 17, 11 ], [ 17, 15 ], [ 17, 14 ], [ 17, 19 ], [ 19, 13 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Billy knows Crystal. Alyson knows Erwin. Alyson knows Billy. Billy knows Gail. Claire knows Fiona. Justine knows Demetrius. Sharon knows Edith. Alyson knows Justine. Crystal knows Magdalena. Sharon knows Jules. Edith knows Carey. Claire knows Greta. Claire knows Wade. Sharon knows Claire. Justine knows Josie. Fiona knows Levi. Edith knows Myra. Billy knows Matthew. Which of Claire and Billy can Alyson reach?", "answer": "Billy", "steps": [ "Alyson knows Billy." ], "difficulty": 1, "original_distance": 3, "idx_to_symbol": [ "Alyson", "Matthew", "Erwin", "Magdalena", "Billy", "Josie", "Justine", "Crystal", "Demetrius", "Gail", "Sharon", "Wade", "Jules", "Levi", "Claire", "Myra", "Edith", "Fiona", "Carey", "Greta" ], "edges": [ [ 0, 2 ], [ 0, 6 ], [ 0, 4 ], [ 4, 1 ], [ 4, 7 ], [ 4, 9 ], [ 6, 5 ], [ 6, 8 ], [ 7, 3 ], [ 10, 12 ], [ 10, 16 ], [ 10, 14 ], [ 14, 11 ], [ 14, 17 ], [ 14, 19 ], [ 16, 15 ], [ 16, 18 ], [ 17, 13 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Jerry knows Greg. Marie knows Erwin. Jennifer knows Byron. Daria knows Jerry. Julius knows Leland. Helen knows Enrique. Luella knows Helen. Lucy knows Beth. Jennifer knows Julius. Lucy knows Darla. Greg knows Elizabeth. Elizabeth knows Lamar. Darla knows Luella. Daria knows Bernice. Reed knows Knox. Erwin knows Reed. Helen knows Marie. Leland knows Daria. Which of Luella and Leland can Lucy reach?", "answer": "Luella", "steps": [ "Lucy knows Darla.", "Darla knows Luella." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Lucy", "Reed", "Marie", "Luella", "Enrique", "Helen", "Knox", "Darla", "Erwin", "Beth", "Jennifer", "Elizabeth", "Jerry", "Leland", "Bernice", "Daria", "Lamar", "Julius", "Greg", "Byron" ], "edges": [ [ 0, 7 ], [ 0, 9 ], [ 1, 6 ], [ 2, 8 ], [ 3, 5 ], [ 5, 4 ], [ 5, 2 ], [ 7, 3 ], [ 8, 1 ], [ 10, 17 ], [ 10, 19 ], [ 11, 16 ], [ 12, 18 ], [ 13, 15 ], [ 15, 14 ], [ 15, 12 ], [ 17, 13 ], [ 18, 11 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Lucy knows Vincent. Colby knows Jakob. Charity knows Colby. Leopold knows Lydia. Charity knows Houston. Lydia knows Byron. Randy knows Irving. August knows Annie. Vincent knows August. Annie knows Zoe. Zoe knows Eric. Kieran knows Charity. Houston knows Leopold. Tabitha knows Lucy. Eric knows Sharon. August knows Randy. Edward knows Tom. Tom knows Kieran. Which of Annie and Houston can Tabitha reach?", "answer": "Annie", "steps": [ "Tabitha knows Lucy.", "Lucy knows Vincent.", "Vincent knows August.", "August knows Annie." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Tabitha", "August", "Irving", "Lucy", "Randy", "Vincent", "Annie", "Sharon", "Zoe", "Eric", "Edward", "Charity", "Jakob", "Tom", "Colby", "Kieran", "Houston", "Byron", "Leopold", "Lydia" ], "edges": [ [ 0, 3 ], [ 1, 4 ], [ 1, 6 ], [ 3, 5 ], [ 4, 2 ], [ 5, 1 ], [ 6, 8 ], [ 8, 9 ], [ 9, 7 ], [ 10, 13 ], [ 11, 14 ], [ 11, 16 ], [ 13, 15 ], [ 14, 12 ], [ 15, 11 ], [ 16, 18 ], [ 18, 19 ], [ 19, 17 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Rose knows Martha. Dirk knows Ursula. Arnold knows Camden. Hendrix knows Della. Leigh knows Curtis. Arnold knows Leigh. Della knows Wilson. Fanny knows Rose. Kerry knows Justin. Arnold knows Myrtle. Della knows Dirk. Carey knows Arnold. Dirk knows Troy. Justin knows Heath. Della knows Roy. Leigh knows Irene. Camden knows Kerry. Wilson knows Fanny. Which of Heath and Martha can Carey reach?", "answer": "Heath", "steps": [ "Carey knows Arnold.", "Arnold knows Camden.", "Camden knows Kerry.", "Kerry knows Justin.", "Justin knows Heath." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Carey", "Leigh", "Justin", "Curtis", "Myrtle", "Irene", "Camden", "Kerry", "Heath", "Arnold", "Hendrix", "Dirk", "Rose", "Ursula", "Roy", "Troy", "Wilson", "Fanny", "Martha", "Della" ], "edges": [ [ 0, 9 ], [ 1, 3 ], [ 1, 5 ], [ 2, 8 ], [ 6, 7 ], [ 7, 2 ], [ 9, 4 ], [ 9, 1 ], [ 9, 6 ], [ 10, 19 ], [ 11, 13 ], [ 11, 15 ], [ 12, 18 ], [ 16, 17 ], [ 17, 12 ], [ 19, 14 ], [ 19, 11 ], [ 19, 16 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Colin knows Susanne. Marian knows Beau. Charles knows Ashton. Charles knows Emery. Darnell knows Emanuel. Susanne knows Ira. Kyle knows Diana. Marian knows Trudy. Darnell knows Charles. Kyle knows Wendell. Susanne knows Lillian. Kyle knows Jude. Lillian knows Ken. Lillian knows Harrison. Charles knows Jon. Lillian knows Tony. Jude knows Darnell. Marian knows Colin. Which of Colin and Jude can Marian reach?", "answer": "Colin", "steps": [ "Marian knows Colin." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Marian", "Lillian", "Ira", "Susanne", "Colin", "Ken", "Beau", "Trudy", "Harrison", "Tony", "Kyle", "Charles", "Emanuel", "Darnell", "Jude", "Jon", "Wendell", "Diana", "Ashton", "Emery" ], "edges": [ [ 0, 6 ], [ 0, 7 ], [ 0, 4 ], [ 1, 5 ], [ 1, 8 ], [ 1, 9 ], [ 3, 2 ], [ 3, 1 ], [ 4, 3 ], [ 10, 16 ], [ 10, 17 ], [ 10, 14 ], [ 11, 15 ], [ 11, 18 ], [ 11, 19 ], [ 13, 12 ], [ 13, 11 ], [ 14, 13 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Ainsley knows Brody. Dean knows Anna. Fergus knows Cliff. Kelly knows Fergus. Stefan knows Dean. Archer knows Dirk. Clinton knows Kathleen. Kirk knows Ainsley. Percy knows Clinton. Brody knows Archer. Brody knows Dawn. Ramon knows Marilyn. Dirk knows Cara. Clinton knows Stefan. Miranda knows Percy. Kathleen knows Beth. Dawn knows Kelly. Beth knows Ramon. Which of Fergus and Ramon can Kirk reach?", "answer": "Fergus", "steps": [ "Kirk knows Ainsley.", "Ainsley knows Brody.", "Brody knows Dawn.", "Dawn knows Kelly.", "Kelly knows Fergus." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Kirk", "Archer", "Cara", "Brody", "Fergus", "Dirk", "Cliff", "Ainsley", "Kelly", "Dawn", "Miranda", "Stefan", "Anna", "Clinton", "Ramon", "Dean", "Marilyn", "Percy", "Beth", "Kathleen" ], "edges": [ [ 0, 7 ], [ 1, 5 ], [ 3, 1 ], [ 3, 9 ], [ 4, 6 ], [ 5, 2 ], [ 7, 3 ], [ 8, 4 ], [ 9, 8 ], [ 10, 17 ], [ 11, 15 ], [ 13, 11 ], [ 13, 19 ], [ 14, 16 ], [ 15, 12 ], [ 17, 13 ], [ 18, 14 ], [ 19, 18 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Hadley knows Lyric. Evelyn knows Catherine. Hadley knows Oscar. Griffith knows Deanna. Harrison knows Zach. Riley knows Elaine. Rebecca knows Harrison. Deanna knows Riley. Anita knows Zane. Margaret knows Anita. Anita knows Griffith. Riley knows Keith. Riley knows Evelyn. Lyric knows Odette. Zach knows Jeanne. Harrison knows Jorge. Hadley knows Basil. Jeanne knows Hadley. Which of Zach and Griffith can Rebecca reach?", "answer": "Zach", "steps": [ "Rebecca knows Harrison.", "Harrison knows Zach." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Rebecca", "Harrison", "Basil", "Jeanne", "Oscar", "Odette", "Lyric", "Zach", "Jorge", "Hadley", "Margaret", "Anita", "Elaine", "Deanna", "Keith", "Catherine", "Evelyn", "Griffith", "Zane", "Riley" ], "edges": [ [ 0, 1 ], [ 1, 8 ], [ 1, 7 ], [ 3, 9 ], [ 6, 5 ], [ 7, 3 ], [ 9, 2 ], [ 9, 4 ], [ 9, 6 ], [ 10, 11 ], [ 11, 18 ], [ 11, 17 ], [ 13, 19 ], [ 16, 15 ], [ 17, 13 ], [ 19, 12 ], [ 19, 14 ], [ 19, 16 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Zara knows Donna. Preston knows Albert. Erica knows Claudia. Preston knows Leon. Darla knows Randall. Glenn knows Erica. Barbara knows Zara. Emma knows Jared. Earle knows Emma. Leon knows Glenn. Jared knows Rena. Randall knows Earle. Claudia knows Blaine. Randall knows Lana. Kieran knows Kirsten. Rena knows Kieran. Earle knows Adam. Zara knows Preston. Which of Claudia and Kieran can Barbara reach?", "answer": "Claudia", "steps": [ "Barbara knows Zara.", "Zara knows Preston.", "Preston knows Leon.", "Leon knows Glenn.", "Glenn knows Erica.", "Erica knows Claudia." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Barbara", "Blaine", "Albert", "Claudia", "Erica", "Donna", "Leon", "Glenn", "Preston", "Zara", "Darla", "Kirsten", "Adam", "Kieran", "Rena", "Lana", "Emma", "Jared", "Earle", "Randall" ], "edges": [ [ 0, 9 ], [ 3, 1 ], [ 4, 3 ], [ 6, 7 ], [ 7, 4 ], [ 8, 2 ], [ 8, 6 ], [ 9, 5 ], [ 9, 8 ], [ 10, 19 ], [ 13, 11 ], [ 14, 13 ], [ 16, 17 ], [ 17, 14 ], [ 18, 12 ], [ 18, 16 ], [ 19, 15 ], [ 19, 18 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Dora knows Erma. Aria knows Lane. Eden knows Fraser. Anthony knows Ron. Byron knows Eden. Davis knows Aria. Eden knows Kerry. Ron knows Molly. Kerry knows Clifford. Lane knows Jenna. Erma knows Taylor. Rod knows Ava. Molly knows Byron. Gunnar knows Dora. Ron knows Harley. Archie knows Anthony. Lane knows Gunnar. Erma knows Rod. Which of Anthony and Aria can Archie reach?", "answer": "Anthony", "steps": [ "Archie knows Anthony." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Archie", "Kerry", "Harley", "Byron", "Anthony", "Ron", "Molly", "Fraser", "Clifford", "Eden", "Davis", "Rod", "Jenna", "Dora", "Aria", "Lane", "Gunnar", "Taylor", "Ava", "Erma" ], "edges": [ [ 0, 4 ], [ 1, 8 ], [ 3, 9 ], [ 4, 5 ], [ 5, 2 ], [ 5, 6 ], [ 6, 3 ], [ 9, 7 ], [ 9, 1 ], [ 10, 14 ], [ 11, 18 ], [ 13, 19 ], [ 14, 15 ], [ 15, 12 ], [ 15, 16 ], [ 16, 13 ], [ 19, 17 ], [ 19, 11 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Bennett knows Jeff. Aspen knows Israel. Aspen knows Gerald. Israel knows Everett. Jeff knows Della. Leland knows Saul. Leland knows Geoffrey. Grace knows Zane. Dora knows Bennett. Saul knows Lara. Geoffrey knows Gordon. Reid knows Dora. Yvette knows Fabian. Saul knows Malik. Malik knows Yvette. Everett knows Cesar. Zane knows Leland. Bennett knows Aspen. Which of Yvette and Everett can Reid reach?", "answer": "Everett", "steps": [ "Reid knows Dora.", "Dora knows Bennett.", "Bennett knows Aspen.", "Aspen knows Israel.", "Israel knows Everett." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Reid", "Jeff", "Gerald", "Aspen", "Israel", "Della", "Bennett", "Cesar", "Dora", "Everett", "Grace", "Geoffrey", "Lara", "Saul", "Malik", "Gordon", "Leland", "Fabian", "Zane", "Yvette" ], "edges": [ [ 0, 8 ], [ 1, 5 ], [ 3, 2 ], [ 3, 4 ], [ 4, 9 ], [ 6, 1 ], [ 6, 3 ], [ 8, 6 ], [ 9, 7 ], [ 10, 18 ], [ 11, 15 ], [ 13, 12 ], [ 13, 14 ], [ 14, 19 ], [ 16, 11 ], [ 16, 13 ], [ 18, 16 ], [ 19, 17 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Hazel knows Robert. Ellen knows Martin. Lars knows Charles. Robert knows Hope. Esme knows Bernice. Charles knows Cesar. Heidi knows Ellen. Charles knows Tina. Douglas knows Alfred. Alfred knows Nell. Heidi knows Darcy. Alfred knows Lars. Tina knows Esme. Martin knows Barney. Ellen knows Ricardo. Barney knows Brett. Douglas knows Flora. Barney knows Hazel. Which of Ellen and Alfred can Douglas reach?", "answer": "Alfred", "steps": [ "Douglas knows Alfred." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Douglas", "Tina", "Flora", "Lars", "Charles", "Alfred", "Cesar", "Nell", "Bernice", "Esme", "Heidi", "Hazel", "Darcy", "Martin", "Barney", "Ellen", "Brett", "Ricardo", "Hope", "Robert" ], "edges": [ [ 0, 2 ], [ 0, 5 ], [ 1, 9 ], [ 3, 4 ], [ 4, 6 ], [ 4, 1 ], [ 5, 7 ], [ 5, 3 ], [ 9, 8 ], [ 10, 12 ], [ 10, 15 ], [ 11, 19 ], [ 13, 14 ], [ 14, 16 ], [ 14, 11 ], [ 15, 17 ], [ 15, 13 ], [ 19, 18 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Earl knows Eamon. Aaron knows Cassidy. Aaron knows Ignacio. Earl knows Alexa. Lyric knows Jolene. Lyric knows Carla. Aaron knows Lyric. Ignacio knows Clyde. Marlene knows Seth. Ignacio knows Gonzalo. Marlene knows Earl. Marlene knows Hugh. Boris knows Marlene. Hugh knows Beth. Hugh knows Julie. Amber knows Aaron. Hugh knows Wanda. Ignacio knows Ezra. Which of Jolene and Alexa can Boris reach?", "answer": "Alexa", "steps": [ "Boris knows Marlene.", "Marlene knows Earl.", "Earl knows Alexa." ], "difficulty": 3, "original_distance": 3, "idx_to_symbol": [ "Boris", "Eamon", "Earl", "Hugh", "Marlene", "Beth", "Wanda", "Julie", "Alexa", "Seth", "Amber", "Carla", "Lyric", "Ignacio", "Aaron", "Clyde", "Ezra", "Gonzalo", "Jolene", "Cassidy" ], "edges": [ [ 0, 4 ], [ 2, 1 ], [ 2, 8 ], [ 3, 5 ], [ 3, 6 ], [ 3, 7 ], [ 4, 3 ], [ 4, 2 ], [ 4, 9 ], [ 10, 14 ], [ 12, 11 ], [ 12, 18 ], [ 13, 15 ], [ 13, 16 ], [ 13, 17 ], [ 14, 13 ], [ 14, 12 ], [ 14, 19 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Asher knows Ramon. Aspen knows Ted. Raquel knows Kirk. Theodore knows Dudley. Dudley knows Raquel. Dexter knows Madeline. Dexter knows Camden. Asher knows Dexter. Ainsley knows Tara. Ted knows Adele. Gina knows Cordelia. Cordelia knows Ainsley. Wallace knows Aspen. Raquel knows Alyssa. Ramon knows Gina. August knows Wallace. Dudley knows August. Hubert knows Asher. Which of Ramon and August can Theodore reach?", "answer": "August", "steps": [ "Theodore knows Dudley.", "Dudley knows August." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Theodore", "Wallace", "Aspen", "Ted", "Dudley", "Adele", "Raquel", "Kirk", "August", "Alyssa", "Hubert", "Gina", "Cordelia", "Ainsley", "Asher", "Tara", "Dexter", "Madeline", "Ramon", "Camden" ], "edges": [ [ 0, 4 ], [ 1, 2 ], [ 2, 3 ], [ 3, 5 ], [ 4, 8 ], [ 4, 6 ], [ 6, 7 ], [ 6, 9 ], [ 8, 1 ], [ 10, 14 ], [ 11, 12 ], [ 12, 13 ], [ 13, 15 ], [ 14, 18 ], [ 14, 16 ], [ 16, 17 ], [ 16, 19 ], [ 18, 11 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Carmen knows Alyssa. Miriam knows Austin. Kieran knows Gordon. Kieran knows Miriam. Dominic knows Mark. Austin knows Cassidy. Hilda knows Faith. Essie knows Elmer. Andre knows Daniel. Essie knows Delia. Mark knows Essie. Faith knows Carmen. Andre knows Belinda. Carmen knows Jillian. Merle knows Latoya. Hilda knows Andre. Daniel knows Merle. Dominic knows Kieran. Which of Miriam and Daniel can Dominic reach?", "answer": "Miriam", "steps": [ "Dominic knows Kieran.", "Kieran knows Miriam." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Dominic", "Elmer", "Austin", "Gordon", "Delia", "Kieran", "Mark", "Cassidy", "Miriam", "Essie", "Hilda", "Alyssa", "Merle", "Belinda", "Jillian", "Andre", "Faith", "Latoya", "Daniel", "Carmen" ], "edges": [ [ 0, 5 ], [ 0, 6 ], [ 2, 7 ], [ 5, 3 ], [ 5, 8 ], [ 6, 9 ], [ 8, 2 ], [ 9, 1 ], [ 9, 4 ], [ 10, 15 ], [ 10, 16 ], [ 12, 17 ], [ 15, 13 ], [ 15, 18 ], [ 16, 19 ], [ 18, 12 ], [ 19, 11 ], [ 19, 14 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "James knows Daisy. Duke knows Raquel. Griffith knows Hardy. Dakota knows Gordon. Keegan knows Lamont. Lamont knows Griffith. Teresa knows James. Dakota knows Vance. Leah knows Teresa. Alma knows Ramona. Ramona knows Duke. Ariel knows Keegan. Hardy knows Dakota. Adrian knows Ariel. Lamont knows Devin. James knows Alma. Trevor knows Leah. Duke knows Daniella. Which of Ariel and Leah can Trevor reach?", "answer": "Leah", "steps": [ "Trevor knows Leah." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Trevor", "Teresa", "Ramona", "Raquel", "Daisy", "James", "Alma", "Leah", "Duke", "Daniella", "Adrian", "Keegan", "Hardy", "Gordon", "Devin", "Lamont", "Griffith", "Ariel", "Dakota", "Vance" ], "edges": [ [ 0, 7 ], [ 1, 5 ], [ 2, 8 ], [ 5, 4 ], [ 5, 6 ], [ 6, 2 ], [ 7, 1 ], [ 8, 3 ], [ 8, 9 ], [ 10, 17 ], [ 11, 15 ], [ 12, 18 ], [ 15, 14 ], [ 15, 16 ], [ 16, 12 ], [ 17, 11 ], [ 18, 13 ], [ 18, 19 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Langston knows Robert. Frida knows Clark. Belinda knows Dora. Bella knows Frida. Kelsey knows Ebony. Devon knows Trudy. Gail knows Ira. Dora knows Langston. Rachel knows Alyssa. Robert knows Autumn. Hampton knows Rachel. Rachel knows Janet. Alyssa knows Erwin. Kelsey knows Devon. Langston knows Hampton. Layla knows Bella. Frida knows Gail. Clark knows Kelsey. Which of Dora and Bella can Belinda reach?", "answer": "Dora", "steps": [ "Belinda knows Dora." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Belinda", "Hampton", "Autumn", "Rachel", "Alyssa", "Janet", "Langston", "Dora", "Robert", "Erwin", "Layla", "Clark", "Ira", "Kelsey", "Devon", "Ebony", "Frida", "Bella", "Gail", "Trudy" ], "edges": [ [ 0, 7 ], [ 1, 3 ], [ 3, 5 ], [ 3, 4 ], [ 4, 9 ], [ 6, 8 ], [ 6, 1 ], [ 7, 6 ], [ 8, 2 ], [ 10, 17 ], [ 11, 13 ], [ 13, 15 ], [ 13, 14 ], [ 14, 19 ], [ 16, 18 ], [ 16, 11 ], [ 17, 16 ], [ 18, 12 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Carla knows Cassidy. Colette knows Wade. Leroy knows Delilah. Barbara knows Leroy. Carla knows Teresa. Ernesto knows Barbara. Emanuel knows Edward. Teresa knows Dakota. Greg knows Carla. Ernesto knows Harlan. Denise knows Martin. Terry knows Denise. Martin knows Colette. Edward knows Greg. Dakota knows Andre. Greg knows Jules. Jules knows Dora. Martin knows Ernesto. Which of Barbara and Teresa can Emanuel reach?", "answer": "Teresa", "steps": [ "Emanuel knows Edward.", "Edward knows Greg.", "Greg knows Carla.", "Carla knows Teresa." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Emanuel", "Andre", "Dora", "Greg", "Dakota", "Jules", "Carla", "Teresa", "Cassidy", "Edward", "Terry", "Delilah", "Wade", "Martin", "Leroy", "Colette", "Ernesto", "Barbara", "Harlan", "Denise" ], "edges": [ [ 0, 9 ], [ 3, 5 ], [ 3, 6 ], [ 4, 1 ], [ 5, 2 ], [ 6, 7 ], [ 6, 8 ], [ 7, 4 ], [ 9, 3 ], [ 10, 19 ], [ 13, 15 ], [ 13, 16 ], [ 14, 11 ], [ 15, 12 ], [ 16, 17 ], [ 16, 18 ], [ 17, 14 ], [ 19, 13 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Ariana knows Fletcher. Harley knows Federico. Ariana knows Lisa. Ariana knows Henrietta. Erica knows Fisher. Erica knows Gage. Joyce knows Leon. Javier knows Sandy. Dexter knows Joyce. Javier knows Herbert. Henrietta knows Dexter. Dexter knows Garrison. Dexter knows Natalie. Erica knows Jeanne. Gage knows Javier. Javier knows Harley. Harley knows Bella. Joyce knows Enid. Which of Federico and Leon can Ariana reach?", "answer": "Leon", "steps": [ "Ariana knows Henrietta.", "Henrietta knows Dexter.", "Dexter knows Joyce.", "Joyce knows Leon." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Ariana", "Enid", "Fletcher", "Lisa", "Henrietta", "Garrison", "Leon", "Natalie", "Joyce", "Dexter", "Erica", "Bella", "Jeanne", "Fisher", "Gage", "Sandy", "Federico", "Herbert", "Harley", "Javier" ], "edges": [ [ 0, 2 ], [ 0, 3 ], [ 0, 4 ], [ 4, 9 ], [ 8, 1 ], [ 8, 6 ], [ 9, 5 ], [ 9, 7 ], [ 9, 8 ], [ 10, 12 ], [ 10, 13 ], [ 10, 14 ], [ 14, 19 ], [ 18, 11 ], [ 18, 16 ], [ 19, 15 ], [ 19, 17 ], [ 19, 18 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "John knows Clyde. Julian knows Luella. Lawrence knows Julian. Mara knows Alana. Daphna knows Dudley. John knows Dustin. Leonard knows Walt. Clyde knows Dave. Luella knows Elise. Walt knows Kerry. John knows Gustavo. Fleur knows Erma. Leonard knows Mara. Luella knows Daphna. Fleur knows Lawrence. Fleur knows Nash. Dave knows Leonard. Elise knows Aldo. Which of Dudley and Alana can John reach?", "answer": "Alana", "steps": [ "John knows Clyde.", "Clyde knows Dave.", "Dave knows Leonard.", "Leonard knows Mara.", "Mara knows Alana." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "John", "Alana", "Gustavo", "Leonard", "Walt", "Mara", "Clyde", "Dustin", "Kerry", "Dave", "Fleur", "Dudley", "Erma", "Luella", "Elise", "Daphna", "Lawrence", "Nash", "Aldo", "Julian" ], "edges": [ [ 0, 2 ], [ 0, 7 ], [ 0, 6 ], [ 3, 5 ], [ 3, 4 ], [ 4, 8 ], [ 5, 1 ], [ 6, 9 ], [ 9, 3 ], [ 10, 12 ], [ 10, 17 ], [ 10, 16 ], [ 13, 15 ], [ 13, 14 ], [ 14, 18 ], [ 15, 11 ], [ 16, 19 ], [ 19, 13 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Ainsley knows Brody. Dean knows Anna. Fergus knows Cliff. Kelly knows Fergus. Stefan knows Dean. Archer knows Dirk. Clinton knows Kathleen. Kirk knows Ainsley. Percy knows Clinton. Brody knows Archer. Brody knows Dawn. Ramon knows Marilyn. Dirk knows Cara. Clinton knows Stefan. Miranda knows Percy. Kathleen knows Beth. Dawn knows Kelly. Beth knows Ramon. Which of Clinton and Brody can Kirk reach?", "answer": "Brody", "steps": [ "Kirk knows Ainsley.", "Ainsley knows Brody." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Kirk", "Archer", "Cara", "Brody", "Fergus", "Dirk", "Cliff", "Ainsley", "Kelly", "Dawn", "Miranda", "Stefan", "Anna", "Clinton", "Ramon", "Dean", "Marilyn", "Percy", "Beth", "Kathleen" ], "edges": [ [ 0, 7 ], [ 1, 5 ], [ 3, 1 ], [ 3, 9 ], [ 4, 6 ], [ 5, 2 ], [ 7, 3 ], [ 8, 4 ], [ 9, 8 ], [ 10, 17 ], [ 11, 15 ], [ 13, 11 ], [ 13, 19 ], [ 14, 16 ], [ 15, 12 ], [ 17, 13 ], [ 18, 14 ], [ 19, 18 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Lorraine knows Hampton. Eve knows Electra. Charles knows Winston. Elaine knows Ember. Julio knows Lorraine. Ember knows Judy. Everett knows Isadora. Francis knows Karina. Ross knows Eve. Clayton knows Charles. India knows Jared. Francis knows Emily. Karina knows Darnell. India knows Clayton. Winston knows Everett. Electra knows Julio. Isadora knows Elaine. Darnell knows Ross. Which of Darnell and Charles can India reach?", "answer": "Charles", "steps": [ "India knows Clayton.", "Clayton knows Charles." ], "difficulty": 2, "original_distance": 8, "idx_to_symbol": [ "India", "Ember", "Everett", "Winston", "Judy", "Jared", "Elaine", "Charles", "Isadora", "Clayton", "Francis", "Lorraine", "Eve", "Ross", "Hampton", "Emily", "Julio", "Darnell", "Electra", "Karina" ], "edges": [ [ 0, 5 ], [ 0, 9 ], [ 1, 4 ], [ 2, 8 ], [ 3, 2 ], [ 6, 1 ], [ 7, 3 ], [ 8, 6 ], [ 9, 7 ], [ 10, 15 ], [ 10, 19 ], [ 11, 14 ], [ 12, 18 ], [ 13, 12 ], [ 16, 11 ], [ 17, 13 ], [ 18, 16 ], [ 19, 17 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Keegan knows Juan. Jill knows Penny. Keegan knows Jill. Daria knows Brent. Mark knows Hugh. Mark knows Xavier. Hugh knows Cody. Xavier knows Malik. Brandon knows Mark. Cody knows Gene. Mark knows Leslie. Brent knows Elmer. Drake knows Keegan. Hugh knows Alison. Bart knows Larissa. Alison knows Kerry. Daria knows Bart. Keegan knows Daria. Which of Keegan and Mark can Drake reach?", "answer": "Keegan", "steps": [ "Drake knows Keegan." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Drake", "Daria", "Juan", "Brent", "Elmer", "Keegan", "Jill", "Penny", "Larissa", "Bart", "Brandon", "Hugh", "Leslie", "Alison", "Kerry", "Mark", "Xavier", "Malik", "Gene", "Cody" ], "edges": [ [ 0, 5 ], [ 1, 3 ], [ 1, 9 ], [ 3, 4 ], [ 5, 2 ], [ 5, 6 ], [ 5, 1 ], [ 6, 7 ], [ 9, 8 ], [ 10, 15 ], [ 11, 13 ], [ 11, 19 ], [ 13, 14 ], [ 15, 12 ], [ 15, 16 ], [ 15, 11 ], [ 16, 17 ], [ 19, 18 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Melanie knows Kara. Finn knows Brody. Grover knows Henrietta. Grover knows Ron. Glen knows Nicole. Grover knows Chelsea. Will knows Sam. Parker knows Alexa. Dolores knows Freya. Glen knows Finn. Gustavo knows Irma. Will knows Henry. Carmen knows Gustavo. Will knows Carmen. Ron knows Glen. Sam knows Dolores. Gustavo knows Parker. Chelsea knows Melanie. Which of Glen and Gustavo can Will reach?", "answer": "Gustavo", "steps": [ "Will knows Carmen.", "Carmen knows Gustavo." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Will", "Alexa", "Carmen", "Irma", "Dolores", "Freya", "Henry", "Gustavo", "Parker", "Sam", "Grover", "Brody", "Ron", "Nicole", "Melanie", "Kara", "Henrietta", "Glen", "Finn", "Chelsea" ], "edges": [ [ 0, 6 ], [ 0, 2 ], [ 0, 9 ], [ 2, 7 ], [ 4, 5 ], [ 7, 3 ], [ 7, 8 ], [ 8, 1 ], [ 9, 4 ], [ 10, 16 ], [ 10, 12 ], [ 10, 19 ], [ 12, 17 ], [ 14, 15 ], [ 17, 13 ], [ 17, 18 ], [ 18, 11 ], [ 19, 14 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Helene knows Glenn. Trina knows Noah. Stuart knows Trina. Kit knows Jake. Martin knows Carlos. Stuart knows Pete. Trina knows Kit. Jake knows Chloe. Doug knows Brooke. Dayton knows William. Chloe knows Jose. Martin knows Iris. Martin knows Kay. Kay knows Taylor. Kendrick knows Helene. Trina knows Dayton. Carlos knows Kendrick. Doug knows Martin. Which of Jake and Kendrick can Doug reach?", "answer": "Kendrick", "steps": [ "Doug knows Martin.", "Martin knows Carlos.", "Carlos knows Kendrick." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Doug", "Kay", "Martin", "Glenn", "Carlos", "Helene", "Brooke", "Iris", "Kendrick", "Taylor", "Stuart", "Dayton", "Trina", "Jose", "Kit", "Chloe", "Pete", "Noah", "Jake", "William" ], "edges": [ [ 0, 6 ], [ 0, 2 ], [ 1, 9 ], [ 2, 7 ], [ 2, 4 ], [ 2, 1 ], [ 4, 8 ], [ 5, 3 ], [ 8, 5 ], [ 10, 16 ], [ 10, 12 ], [ 11, 19 ], [ 12, 17 ], [ 12, 14 ], [ 12, 11 ], [ 14, 18 ], [ 15, 13 ], [ 18, 15 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Emanuel knows Carol. Andrew knows Ruby. Kennedy knows Fiona. Leroy knows Willis. Carol knows Kirsten. Martin knows Amelia. Saul knows Khashayar. Ruby knows Jamie. Willis knows Earle. Kirsten knows Leroy. Kirsten knows Kennedy. Willis knows Corey. Corey knows Uma. Jamie knows Keith. Khashayar knows Vivian. Amelia knows Saul. Ruby knows Liam. Saul knows Andrew. Which of Leroy and Andrew can Martin reach?", "answer": "Andrew", "steps": [ "Martin knows Amelia.", "Amelia knows Saul.", "Saul knows Andrew." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Martin", "Jamie", "Khashayar", "Amelia", "Saul", "Ruby", "Liam", "Andrew", "Keith", "Vivian", "Emanuel", "Corey", "Kennedy", "Carol", "Kirsten", "Willis", "Earle", "Leroy", "Uma", "Fiona" ], "edges": [ [ 0, 3 ], [ 1, 8 ], [ 2, 9 ], [ 3, 4 ], [ 4, 7 ], [ 4, 2 ], [ 5, 6 ], [ 5, 1 ], [ 7, 5 ], [ 10, 13 ], [ 11, 18 ], [ 12, 19 ], [ 13, 14 ], [ 14, 17 ], [ 14, 12 ], [ 15, 16 ], [ 15, 11 ], [ 17, 15 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Vicki knows Miranda. Rowan knows Kay. Rowan knows Percy. Jameson knows Lamont. Rachel knows Lennox. Miranda knows Rowan. Lennox knows Fanny. Lennox knows Garrett. Lennox knows Peggy. Rowan knows Ford. Garrett knows Kenneth. Ford knows Margaret. Merle knows Hayley. Autumn knows Rachel. Kenneth knows Jameson. Jameson knows Griffith. Margaret knows Merle. Merle knows Marvin. Which of Ford and Garrett can Vicki reach?", "answer": "Ford", "steps": [ "Vicki knows Miranda.", "Miranda knows Rowan.", "Rowan knows Ford." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Vicki", "Miranda", "Ford", "Hayley", "Marvin", "Percy", "Rowan", "Kay", "Margaret", "Merle", "Autumn", "Rachel", "Garrett", "Lamont", "Griffith", "Fanny", "Lennox", "Peggy", "Kenneth", "Jameson" ], "edges": [ [ 0, 1 ], [ 1, 6 ], [ 2, 8 ], [ 6, 5 ], [ 6, 7 ], [ 6, 2 ], [ 8, 9 ], [ 9, 3 ], [ 9, 4 ], [ 10, 11 ], [ 11, 16 ], [ 12, 18 ], [ 16, 15 ], [ 16, 17 ], [ 16, 12 ], [ 18, 19 ], [ 19, 13 ], [ 19, 14 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Camille knows Trina. Ember knows Benjamin. Clarissa knows Foster. Ember knows Camille. Trina knows Marion. John knows Whitney. Alfonso knows Chloe. Richard knows Rachel. Whitney knows Drew. Benjamin knows Lois. Carter knows John. Chester knows Owen. Foster knows Richard. Chester knows Kirsten. Foster knows Ember. Owen knows Susanne. John knows Chester. Kirsten knows Alfonso. Which of Chloe and Marion can Carter reach?", "answer": "Chloe", "steps": [ "Carter knows John.", "John knows Chester.", "Chester knows Kirsten.", "Kirsten knows Alfonso.", "Alfonso knows Chloe." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Carter", "Chloe", "Chester", "John", "Alfonso", "Whitney", "Kirsten", "Drew", "Susanne", "Owen", "Clarissa", "Marion", "Ember", "Foster", "Trina", "Richard", "Camille", "Rachel", "Lois", "Benjamin" ], "edges": [ [ 0, 3 ], [ 2, 6 ], [ 2, 9 ], [ 3, 5 ], [ 3, 2 ], [ 4, 1 ], [ 5, 7 ], [ 6, 4 ], [ 9, 8 ], [ 10, 13 ], [ 12, 16 ], [ 12, 19 ], [ 13, 15 ], [ 13, 12 ], [ 14, 11 ], [ 15, 17 ], [ 16, 14 ], [ 19, 18 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Kevin knows Harrison. Fabian knows Kira. Finn knows Colin. Lorna knows Jacqueline. Hudson knows Elijah. Fabian knows Renee. Ida knows Hudson. Philip knows Fabian. Fabian knows Lucy. Jasmine knows Catherine. Lucy knows Ida. Colin knows Colleen. Jacqueline knows Kevin. Lucy knows Jasmine. Harrison knows Rachel. Jacqueline knows Joyce. Kevin knows Finn. Jacqueline knows Carson. Which of Elijah and Colleen can Lorna reach?", "answer": "Colleen", "steps": [ "Lorna knows Jacqueline.", "Jacqueline knows Kevin.", "Kevin knows Finn.", "Finn knows Colin.", "Colin knows Colleen." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Lorna", "Rachel", "Colin", "Colleen", "Joyce", "Jacqueline", "Kevin", "Harrison", "Carson", "Finn", "Philip", "Catherine", "Hudson", "Elijah", "Kira", "Fabian", "Lucy", "Jasmine", "Renee", "Ida" ], "edges": [ [ 0, 5 ], [ 2, 3 ], [ 5, 4 ], [ 5, 8 ], [ 5, 6 ], [ 6, 7 ], [ 6, 9 ], [ 7, 1 ], [ 9, 2 ], [ 10, 15 ], [ 12, 13 ], [ 15, 14 ], [ 15, 18 ], [ 15, 16 ], [ 16, 17 ], [ 16, 19 ], [ 17, 11 ], [ 19, 12 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Veronica knows Hayley. Hayley knows Rose. Holly knows Terry. Glenn knows Wilson. Nolan knows Kennedy. Glenn knows Blair. Alice knows Nolan. Janice knows Edith. Hayley knows Dolores. Tim knows Glenn. Sandra knows Winston. Glenn knows Veronica. Winston knows Tim. Nolan knows Gene. Holly knows Alice. Edith knows Lenora. Holly knows Sheryl. Lenora knows Holly. Which of Lenora and Tim can Sandra reach?", "answer": "Tim", "steps": [ "Sandra knows Winston.", "Winston knows Tim." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Sandra", "Blair", "Veronica", "Winston", "Wilson", "Hayley", "Dolores", "Rose", "Glenn", "Tim", "Janice", "Sheryl", "Alice", "Edith", "Terry", "Nolan", "Kennedy", "Gene", "Holly", "Lenora" ], "edges": [ [ 0, 3 ], [ 2, 5 ], [ 3, 9 ], [ 5, 6 ], [ 5, 7 ], [ 8, 1 ], [ 8, 4 ], [ 8, 2 ], [ 9, 8 ], [ 10, 13 ], [ 12, 15 ], [ 13, 19 ], [ 15, 16 ], [ 15, 17 ], [ 18, 11 ], [ 18, 14 ], [ 18, 12 ], [ 19, 18 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Karina knows Virgil. June knows Jaime. Karina knows Devon. Brooke knows Eduardo. Demetrius knows Israel. Israel knows Melody. Brooke knows Lars. Vanessa knows June. Lars knows Vanessa. Archie knows Ilene. Fanny knows Brett. June knows Elias. Devon knows Trevor. Israel knows Elliot. Virgil knows Demetrius. Eduardo knows Ben. Ben knows Fanny. Trevor knows Archie. Which of Demetrius and Vanessa can Karina reach?", "answer": "Demetrius", "steps": [ "Karina knows Virgil.", "Virgil knows Demetrius." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Karina", "Israel", "Trevor", "Demetrius", "Devon", "Archie", "Elliot", "Virgil", "Melody", "Ilene", "Brooke", "June", "Ben", "Vanessa", "Eduardo", "Fanny", "Elias", "Lars", "Jaime", "Brett" ], "edges": [ [ 0, 7 ], [ 0, 4 ], [ 1, 6 ], [ 1, 8 ], [ 2, 5 ], [ 3, 1 ], [ 4, 2 ], [ 5, 9 ], [ 7, 3 ], [ 10, 17 ], [ 10, 14 ], [ 11, 16 ], [ 11, 18 ], [ 12, 15 ], [ 13, 11 ], [ 14, 12 ], [ 15, 19 ], [ 17, 13 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Valerie knows Irving. Lois knows Clifford. Kira knows Valerie. Ralph knows Freya. Wilma knows Marc. Peter knows Xander. Ford knows Kira. Irving knows Leopold. Peter knows Wilma. Lois knows Lauren. Freya knows Lois. Valerie knows Ralph. Damien knows Peter. Jolena knows Fritz. Enrique knows Jolena. Xander knows Enrique. Jolena knows Andrew. Lucia knows Damien. Which of Freya and Enrique can Ford reach?", "answer": "Freya", "steps": [ "Ford knows Kira.", "Kira knows Valerie.", "Valerie knows Ralph.", "Ralph knows Freya." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Ford", "Leopold", "Lois", "Kira", "Valerie", "Lauren", "Freya", "Ralph", "Clifford", "Irving", "Lucia", "Marc", "Jolena", "Damien", "Peter", "Fritz", "Enrique", "Xander", "Andrew", "Wilma" ], "edges": [ [ 0, 3 ], [ 2, 5 ], [ 2, 8 ], [ 3, 4 ], [ 4, 7 ], [ 4, 9 ], [ 6, 2 ], [ 7, 6 ], [ 9, 1 ], [ 10, 13 ], [ 12, 15 ], [ 12, 18 ], [ 13, 14 ], [ 14, 17 ], [ 14, 19 ], [ 16, 12 ], [ 17, 16 ], [ 19, 11 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Haven knows Dylan. Arthur knows Declan. Madeline knows Julian. Arthur knows Bill. Tonya knows Erica. Elsa knows Gerald. Haven knows Fred. Erica knows Madeline. Gonzalo knows Rhonda. Gonzalo knows Tanya. Gerald knows Ramon. Dylan knows Elsa. Martha knows Lottie. Lottie knows Edmund. Fred knows Gonzalo. Lottie knows Tonya. Clay knows Haven. Edmund knows Arthur. Which of Elsa and Erica can Martha reach?", "answer": "Erica", "steps": [ "Martha knows Lottie.", "Lottie knows Tonya.", "Tonya knows Erica." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Martha", "Erica", "Declan", "Tonya", "Arthur", "Julian", "Lottie", "Edmund", "Madeline", "Bill", "Clay", "Elsa", "Rhonda", "Dylan", "Gonzalo", "Ramon", "Haven", "Fred", "Gerald", "Tanya" ], "edges": [ [ 0, 6 ], [ 1, 8 ], [ 3, 1 ], [ 4, 2 ], [ 4, 9 ], [ 6, 3 ], [ 6, 7 ], [ 7, 4 ], [ 8, 5 ], [ 10, 16 ], [ 11, 18 ], [ 13, 11 ], [ 14, 12 ], [ 14, 19 ], [ 16, 13 ], [ 16, 17 ], [ 17, 14 ], [ 18, 15 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Jocelyn knows Gregory. Ron knows Leticia. Luella knows Foster. Irene knows Ron. Yara knows Bernadette. Viola knows Imogen. Jeff knows Norma. Ron knows Yasmin. Ron knows Luella. Gregory knows Yara. Tara knows Irene. Viola knows Jeff. Parsa knows Tara. Ford knows Parsa. Darrell knows Ford. Viola knows Phoebe. Gladys knows Jocelyn. Bernadette knows Viola. Which of Jeff and Luella can Gladys reach?", "answer": "Jeff", "steps": [ "Gladys knows Jocelyn.", "Jocelyn knows Gregory.", "Gregory knows Yara.", "Yara knows Bernadette.", "Bernadette knows Viola.", "Viola knows Jeff." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Gladys", "Phoebe", "Imogen", "Norma", "Bernadette", "Viola", "Gregory", "Yara", "Jeff", "Jocelyn", "Darrell", "Leticia", "Yasmin", "Foster", "Irene", "Ron", "Parsa", "Tara", "Luella", "Ford" ], "edges": [ [ 0, 9 ], [ 4, 5 ], [ 5, 1 ], [ 5, 2 ], [ 5, 8 ], [ 6, 7 ], [ 7, 4 ], [ 8, 3 ], [ 9, 6 ], [ 10, 19 ], [ 14, 15 ], [ 15, 11 ], [ 15, 12 ], [ 15, 18 ], [ 16, 17 ], [ 17, 14 ], [ 18, 13 ], [ 19, 16 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Percy knows Carrie. Percy knows Joaquin. Lyric knows Eileen. Carrie knows Jade. Jane knows Wayne. Laura knows Julius. Sheila knows Livia. Evelyn knows Florence. Wayne knows Diego. Percy knows Richard. Julius knows Lyric. Lyric knows Randy. Laura knows Jane. Travis knows Jason. Evelyn knows Flora. Joaquin knows Travis. Laura knows Sheila. Richard knows Evelyn. Which of Lyric and Evelyn can Percy reach?", "answer": "Evelyn", "steps": [ "Percy knows Richard.", "Richard knows Evelyn." ], "difficulty": 2, "original_distance": 3, "idx_to_symbol": [ "Percy", "Jade", "Carrie", "Richard", "Florence", "Travis", "Evelyn", "Jason", "Flora", "Joaquin", "Laura", "Livia", "Sheila", "Julius", "Randy", "Wayne", "Lyric", "Diego", "Eileen", "Jane" ], "edges": [ [ 0, 2 ], [ 0, 3 ], [ 0, 9 ], [ 2, 1 ], [ 3, 6 ], [ 5, 7 ], [ 6, 4 ], [ 6, 8 ], [ 9, 5 ], [ 10, 12 ], [ 10, 13 ], [ 10, 19 ], [ 12, 11 ], [ 13, 16 ], [ 15, 17 ], [ 16, 14 ], [ 16, 18 ], [ 19, 15 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Jack knows Gavin. Davis knows Allan. Darrell knows Anthony. Jack knows Whitney. Dora knows Lynn. Federico knows Ignacio. Federico knows Demetrius. Anthony knows Martha. Jack knows Jaime. Dora knows Renee. Virginia knows Jack. Anthony knows Jonah. Whitney knows Dora. Faye knows Jean. Allan knows Virginia. Anthony knows Clement. Jean knows Darrell. Martha knows Federico. Which of Whitney and Martha can Faye reach?", "answer": "Martha", "steps": [ "Faye knows Jean.", "Jean knows Darrell.", "Darrell knows Anthony.", "Anthony knows Martha." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Faye", "Jonah", "Jean", "Martha", "Darrell", "Clement", "Federico", "Ignacio", "Anthony", "Demetrius", "Davis", "Gavin", "Allan", "Whitney", "Virginia", "Jaime", "Dora", "Lynn", "Jack", "Renee" ], "edges": [ [ 0, 2 ], [ 2, 4 ], [ 3, 6 ], [ 4, 8 ], [ 6, 7 ], [ 6, 9 ], [ 8, 1 ], [ 8, 5 ], [ 8, 3 ], [ 10, 12 ], [ 12, 14 ], [ 13, 16 ], [ 14, 18 ], [ 16, 17 ], [ 16, 19 ], [ 18, 11 ], [ 18, 15 ], [ 18, 13 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Roger knows Lambert. Trevor knows Louis. Henry knows Virginia. Spencer knows Trevor. Louis knows Henry. Henrietta knows Spencer. Lambert knows Enid. Hope knows Heath. Pearl knows Edwin. Edwin knows Callum. Jakob knows Guy. Carla knows Chester. Lambert knows Carla. Chester knows Hope. Hope knows Pearl. Jakob knows Henrietta. Trevor knows Vera. Cindy knows Jakob. Which of Spencer and Chester can Roger reach?", "answer": "Chester", "steps": [ "Roger knows Lambert.", "Lambert knows Carla.", "Carla knows Chester." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Roger", "Heath", "Hope", "Enid", "Pearl", "Chester", "Lambert", "Callum", "Carla", "Edwin", "Cindy", "Vera", "Trevor", "Guy", "Louis", "Spencer", "Jakob", "Virginia", "Henrietta", "Henry" ], "edges": [ [ 0, 6 ], [ 2, 1 ], [ 2, 4 ], [ 4, 9 ], [ 5, 2 ], [ 6, 3 ], [ 6, 8 ], [ 8, 5 ], [ 9, 7 ], [ 10, 16 ], [ 12, 11 ], [ 12, 14 ], [ 14, 19 ], [ 15, 12 ], [ 16, 13 ], [ 16, 18 ], [ 18, 15 ], [ 19, 17 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Sadie knows Brynn. Marco knows Eve. Haley knows Sadie. Stefan knows Dee. Valerie knows Bonnie. Morris knows Susanne. Bonnie knows Elvira. Amy knows Jodi. Cameron knows Amy. Cordelia knows Haley. Dee knows Eli. Sadie knows Deborah. Fergus knows Zachary. Amy knows Stefan. Marco knows Cameron. Deborah knows Morris. Zachary knows Marco. Morris knows Valerie. Which of Dee and Bonnie can Cordelia reach?", "answer": "Bonnie", "steps": [ "Cordelia knows Haley.", "Haley knows Sadie.", "Sadie knows Deborah.", "Deborah knows Morris.", "Morris knows Valerie.", "Valerie knows Bonnie." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Cordelia", "Elvira", "Brynn", "Susanne", "Sadie", "Valerie", "Morris", "Bonnie", "Haley", "Deborah", "Fergus", "Eli", "Eve", "Jodi", "Marco", "Stefan", "Amy", "Dee", "Zachary", "Cameron" ], "edges": [ [ 0, 8 ], [ 4, 2 ], [ 4, 9 ], [ 5, 7 ], [ 6, 3 ], [ 6, 5 ], [ 7, 1 ], [ 8, 4 ], [ 9, 6 ], [ 10, 18 ], [ 14, 12 ], [ 14, 19 ], [ 15, 17 ], [ 16, 13 ], [ 16, 15 ], [ 17, 11 ], [ 18, 14 ], [ 19, 16 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Greer knows Alicia. Clara knows Linda. Bernard knows Conner. Bernard knows Deirdre. Deirdre knows Lauren. Cara knows Bill. Callum knows Clara. Cara knows Gordon. Clara knows Cara. Garland knows Callum. Lauren knows Kelsey. Kelsey knows Vanessa. Langston knows Jeff. Gordon knows Greer. Carrie knows Bernard. Jeff knows Carrie. Carrie knows Marie. Alicia knows Deanna. Which of Vanessa and Deanna can Garland reach?", "answer": "Deanna", "steps": [ "Garland knows Callum.", "Callum knows Clara.", "Clara knows Cara.", "Cara knows Gordon.", "Gordon knows Greer.", "Greer knows Alicia.", "Alicia knows Deanna." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Garland", "Bill", "Linda", "Cara", "Clara", "Alicia", "Callum", "Deanna", "Gordon", "Greer", "Langston", "Conner", "Marie", "Bernard", "Carrie", "Kelsey", "Jeff", "Vanessa", "Deirdre", "Lauren" ], "edges": [ [ 0, 6 ], [ 3, 1 ], [ 3, 8 ], [ 4, 2 ], [ 4, 3 ], [ 5, 7 ], [ 6, 4 ], [ 8, 9 ], [ 9, 5 ], [ 10, 16 ], [ 13, 11 ], [ 13, 18 ], [ 14, 12 ], [ 14, 13 ], [ 15, 17 ], [ 16, 14 ], [ 18, 19 ], [ 19, 15 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Jesse knows Marcia. Victor knows Lucas. Lucas knows Tabitha. Jarvis knows Jeff. Wallace knows Jarvis. Vicki knows Jesse. Anthony knows Todd. Anthony knows Verna. Verna knows Maya. Albert knows Gemma. Todd knows Wallace. Cornelius knows Anthony. Nancy knows Vicki. Gemma knows Victor. Blanche knows Iris. Tabitha knows Drew. Vicki knows Albert. Jeff knows Blanche. Which of Jarvis and Victor can Cornelius reach?", "answer": "Jarvis", "steps": [ "Cornelius knows Anthony.", "Anthony knows Todd.", "Todd knows Wallace.", "Wallace knows Jarvis." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Cornelius", "Jeff", "Blanche", "Anthony", "Todd", "Wallace", "Iris", "Jarvis", "Maya", "Verna", "Nancy", "Lucas", "Tabitha", "Vicki", "Albert", "Gemma", "Drew", "Victor", "Marcia", "Jesse" ], "edges": [ [ 0, 3 ], [ 1, 2 ], [ 2, 6 ], [ 3, 4 ], [ 3, 9 ], [ 4, 5 ], [ 5, 7 ], [ 7, 1 ], [ 9, 8 ], [ 10, 13 ], [ 11, 12 ], [ 12, 16 ], [ 13, 14 ], [ 13, 19 ], [ 14, 15 ], [ 15, 17 ], [ 17, 11 ], [ 19, 18 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Wesley knows Esperanza. Vincent knows Lennox. Clarissa knows Samuel. Jeremy knows Gerald. Gideon knows Nora. Virgil knows Val. Wesley knows Ellis. Samuel knows Arden. Vincent knows Garrett. Esperanza knows Virgil. Gideon knows Lorna. Vincent knows Wesley. Gideon knows Clarissa. Samuel knows Jeremy. Esperanza knows Della. Omar knows Vincent. Zoe knows Gideon. Clarissa knows Selena. Which of Samuel and Esperanza can Omar reach?", "answer": "Esperanza", "steps": [ "Omar knows Vincent.", "Vincent knows Wesley.", "Wesley knows Esperanza." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Omar", "Wesley", "Vincent", "Lennox", "Val", "Garrett", "Ellis", "Della", "Esperanza", "Virgil", "Zoe", "Clarissa", "Gideon", "Lorna", "Gerald", "Nora", "Selena", "Arden", "Samuel", "Jeremy" ], "edges": [ [ 0, 2 ], [ 1, 6 ], [ 1, 8 ], [ 2, 3 ], [ 2, 5 ], [ 2, 1 ], [ 8, 7 ], [ 8, 9 ], [ 9, 4 ], [ 10, 12 ], [ 11, 16 ], [ 11, 18 ], [ 12, 13 ], [ 12, 15 ], [ 12, 11 ], [ 18, 17 ], [ 18, 19 ], [ 19, 14 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Hattie knows Archie. Freya knows Larry. Freya knows Nell. Georgia knows Keegan. Hattie knows June. Edward knows Barbara. Wallace knows Dallas. Jamie knows Kurt. Fanny knows Edward. Wallace knows Fanny. Larry knows Jamie. Wallace knows Olivia. Hattie knows Beau. Sonia knows Georgia. Georgia knows Rod. Jamie knows Theodore. Archie knows Freya. Edward knows Sonia. Which of Sonia and Larry can Hattie reach?", "answer": "Larry", "steps": [ "Hattie knows Archie.", "Archie knows Freya.", "Freya knows Larry." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Hattie", "Nell", "Archie", "Theodore", "June", "Larry", "Jamie", "Kurt", "Beau", "Freya", "Wallace", "Barbara", "Fanny", "Keegan", "Olivia", "Sonia", "Georgia", "Rod", "Dallas", "Edward" ], "edges": [ [ 0, 4 ], [ 0, 8 ], [ 0, 2 ], [ 2, 9 ], [ 5, 6 ], [ 6, 3 ], [ 6, 7 ], [ 9, 1 ], [ 9, 5 ], [ 10, 14 ], [ 10, 18 ], [ 10, 12 ], [ 12, 19 ], [ 15, 16 ], [ 16, 13 ], [ 16, 17 ], [ 19, 11 ], [ 19, 15 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Joshua knows Erin. Erin knows Ezra. Damian knows Trevor. Carl knows Diego. Carl knows Julio. Erin knows Sheila. Samantha knows Damian. Jackson knows Dominic. Lambert knows Jorge. Patricia knows Lilia. Dolores knows Kate. Jorge knows Carl. Samantha knows Joshua. Lambert knows Jackson. Carl knows Kara. Erin knows Alma. Erin knows Dolores. Carl knows Patricia. Which of Patricia and Dolores can Samantha reach?", "answer": "Dolores", "steps": [ "Samantha knows Joshua.", "Joshua knows Erin.", "Erin knows Dolores." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Samantha", "Ezra", "Kate", "Damian", "Erin", "Trevor", "Joshua", "Alma", "Sheila", "Dolores", "Lambert", "Julio", "Lilia", "Jackson", "Carl", "Dominic", "Jorge", "Diego", "Kara", "Patricia" ], "edges": [ [ 0, 3 ], [ 0, 6 ], [ 3, 5 ], [ 4, 1 ], [ 4, 7 ], [ 4, 8 ], [ 4, 9 ], [ 6, 4 ], [ 9, 2 ], [ 10, 13 ], [ 10, 16 ], [ 13, 15 ], [ 14, 11 ], [ 14, 17 ], [ 14, 18 ], [ 14, 19 ], [ 16, 14 ], [ 19, 12 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Imogen knows Brett. Bella knows Brandon. Imogen knows Chris. Lee knows Frankie. Lee knows Quinn. Lars knows Kate. Darin knows Bonnie. Brandon knows Dorian. Dell knows Naomi. Chris knows Lars. Bella knows Janice. Darin knows Mason. Guy knows Dell. Dell knows Bella. Serena knows Imogen. Guy knows Lee. Chris knows Hazel. Serena knows Darin. Which of Brandon and Lars can Guy reach?", "answer": "Brandon", "steps": [ "Guy knows Dell.", "Dell knows Bella.", "Bella knows Brandon." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Guy", "Janice", "Lee", "Frankie", "Bella", "Dorian", "Naomi", "Brandon", "Quinn", "Dell", "Serena", "Hazel", "Darin", "Mason", "Chris", "Kate", "Brett", "Lars", "Bonnie", "Imogen" ], "edges": [ [ 0, 2 ], [ 0, 9 ], [ 2, 3 ], [ 2, 8 ], [ 4, 1 ], [ 4, 7 ], [ 7, 5 ], [ 9, 6 ], [ 9, 4 ], [ 10, 12 ], [ 10, 19 ], [ 12, 13 ], [ 12, 18 ], [ 14, 11 ], [ 14, 17 ], [ 17, 15 ], [ 19, 16 ], [ 19, 14 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Jeffery knows Israel. Terry knows Levi. Jeffery knows Russell. Becky knows Daphne. Jay knows Adelaide. Russell knows Marie. Jill knows Ignacio. Ignacio knows Terry. Becky knows Belinda. Daphne knows Dudley. Levi knows Francesca. Marie knows Dee. Jeffery knows Leigh. Daphne knows Jill. Bennett knows Jeffery. Bennett knows Eric. Daphne knows Camille. Dee knows Jay. Which of Jill and Russell can Becky reach?", "answer": "Jill", "steps": [ "Becky knows Daphne.", "Daphne knows Jill." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Becky", "Levi", "Belinda", "Daphne", "Dudley", "Terry", "Ignacio", "Francesca", "Jill", "Camille", "Bennett", "Jay", "Eric", "Jeffery", "Leigh", "Dee", "Marie", "Adelaide", "Russell", "Israel" ], "edges": [ [ 0, 2 ], [ 0, 3 ], [ 1, 7 ], [ 3, 4 ], [ 3, 8 ], [ 3, 9 ], [ 5, 1 ], [ 6, 5 ], [ 8, 6 ], [ 10, 12 ], [ 10, 13 ], [ 11, 17 ], [ 13, 14 ], [ 13, 18 ], [ 13, 19 ], [ 15, 11 ], [ 16, 15 ], [ 18, 16 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Tanya knows Neal. Jessie knows Vance. Jackson knows Louisa. Kit knows Marian. Janet knows Jessie. Marian knows Harmony. Harvey knows Otto. Teresa knows Jackson. Jolena knows Tanya. Kit knows Janet. Kit knows Hal. Harmony knows Dustin. Hilda knows Kit. Otto knows Gail. Tanya knows Vera. Tanya knows Harvey. Dustin knows Mara. Vera knows Teresa. Which of Marian and Vera can Hilda reach?", "answer": "Marian", "steps": [ "Hilda knows Kit.", "Kit knows Marian." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Hilda", "Kit", "Harmony", "Vance", "Dustin", "Marian", "Hal", "Janet", "Jessie", "Mara", "Jolena", "Tanya", "Teresa", "Gail", "Jackson", "Vera", "Neal", "Harvey", "Otto", "Louisa" ], "edges": [ [ 0, 1 ], [ 1, 6 ], [ 1, 7 ], [ 1, 5 ], [ 2, 4 ], [ 4, 9 ], [ 5, 2 ], [ 7, 8 ], [ 8, 3 ], [ 10, 11 ], [ 11, 16 ], [ 11, 17 ], [ 11, 15 ], [ 12, 14 ], [ 14, 19 ], [ 15, 12 ], [ 17, 18 ], [ 18, 13 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Aspen knows Carla. Garrison knows Aspen. Aspen knows Greg. Aspen knows Callum. Clinton knows Darla. Darla knows Peter. Bennett knows Celia. Heather knows Garrison. Celia knows Jesse. Federico knows Anton. Callum knows Barry. Federico knows Glenn. Glenn knows Eli. Jesse knows Federico. Donald knows Aiden. Federico knows Raquel. Bennett knows Donald. Clinton knows Heather. Which of Glenn and Callum can Bennett reach?", "answer": "Glenn", "steps": [ "Bennett knows Celia.", "Celia knows Jesse.", "Jesse knows Federico.", "Federico knows Glenn." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Bennett", "Anton", "Eli", "Federico", "Aiden", "Celia", "Donald", "Glenn", "Raquel", "Jesse", "Clinton", "Carla", "Barry", "Aspen", "Peter", "Heather", "Darla", "Callum", "Greg", "Garrison" ], "edges": [ [ 0, 6 ], [ 0, 5 ], [ 3, 1 ], [ 3, 7 ], [ 3, 8 ], [ 5, 9 ], [ 6, 4 ], [ 7, 2 ], [ 9, 3 ], [ 10, 16 ], [ 10, 15 ], [ 13, 11 ], [ 13, 17 ], [ 13, 18 ], [ 15, 19 ], [ 16, 14 ], [ 17, 12 ], [ 19, 13 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Zachary knows Ella. Darnell knows Zachary. Ella knows Jasper. Merle knows Melody. Parker knows Matthew. Kathleen knows Fletcher. Kathleen knows Kane. Ella knows Israel. Matthew knows Aspen. Kathleen knows Marilyn. Aspen knows Kathleen. Melody knows Darnell. Lara knows Ryan. Ryan knows Daniella. Dalton knows Merle. Merle knows Lydia. Ryan knows Parker. Ella knows Valerie. Which of Kathleen and Ella can Dalton reach?", "answer": "Ella", "steps": [ "Dalton knows Merle.", "Merle knows Melody.", "Melody knows Darnell.", "Darnell knows Zachary.", "Zachary knows Ella." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Dalton", "Jasper", "Ella", "Valerie", "Melody", "Israel", "Darnell", "Lydia", "Zachary", "Merle", "Lara", "Marilyn", "Kathleen", "Kane", "Parker", "Fletcher", "Matthew", "Daniella", "Aspen", "Ryan" ], "edges": [ [ 0, 9 ], [ 2, 1 ], [ 2, 3 ], [ 2, 5 ], [ 4, 6 ], [ 6, 8 ], [ 8, 2 ], [ 9, 7 ], [ 9, 4 ], [ 10, 19 ], [ 12, 11 ], [ 12, 13 ], [ 12, 15 ], [ 14, 16 ], [ 16, 18 ], [ 18, 12 ], [ 19, 17 ], [ 19, 14 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Billy knows Crystal. Alyson knows Erwin. Alyson knows Billy. Billy knows Gail. Claire knows Fiona. Justine knows Demetrius. Sharon knows Edith. Alyson knows Justine. Crystal knows Magdalena. Sharon knows Jules. Edith knows Carey. Claire knows Greta. Claire knows Wade. Sharon knows Claire. Justine knows Josie. Fiona knows Levi. Edith knows Myra. Billy knows Matthew. Which of Levi and Magdalena can Alyson reach?", "answer": "Magdalena", "steps": [ "Alyson knows Billy.", "Billy knows Crystal.", "Crystal knows Magdalena." ], "difficulty": 3, "original_distance": 3, "idx_to_symbol": [ "Alyson", "Matthew", "Erwin", "Magdalena", "Billy", "Josie", "Justine", "Crystal", "Demetrius", "Gail", "Sharon", "Wade", "Jules", "Levi", "Claire", "Myra", "Edith", "Fiona", "Carey", "Greta" ], "edges": [ [ 0, 2 ], [ 0, 6 ], [ 0, 4 ], [ 4, 1 ], [ 4, 7 ], [ 4, 9 ], [ 6, 5 ], [ 6, 8 ], [ 7, 3 ], [ 10, 12 ], [ 10, 16 ], [ 10, 14 ], [ 14, 11 ], [ 14, 17 ], [ 14, 19 ], [ 16, 15 ], [ 16, 18 ], [ 17, 13 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Winifred knows Kara. Yara knows Jeanne. Miriam knows Coral. Wilson knows Cynthia. Dana knows Declan. Jeanne knows Dennis. Hank knows Elijah. Elijah knows Winifred. Louise knows Dana. Roger knows Miriam. Winifred knows Louise. Kara knows Joseph. Cynthia knows Freya. Joseph knows Philip. Dennis knows Regina. Freya knows Roger. Freya knows Yara. Declan knows Sierra. Which of Regina and Sierra can Wilson reach?", "answer": "Regina", "steps": [ "Wilson knows Cynthia.", "Cynthia knows Freya.", "Freya knows Yara.", "Yara knows Jeanne.", "Jeanne knows Dennis.", "Dennis knows Regina." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Wilson", "Regina", "Roger", "Jeanne", "Coral", "Yara", "Dennis", "Cynthia", "Miriam", "Freya", "Hank", "Sierra", "Kara", "Dana", "Philip", "Louise", "Declan", "Elijah", "Joseph", "Winifred" ], "edges": [ [ 0, 7 ], [ 2, 8 ], [ 3, 6 ], [ 5, 3 ], [ 6, 1 ], [ 7, 9 ], [ 8, 4 ], [ 9, 5 ], [ 9, 2 ], [ 10, 17 ], [ 12, 18 ], [ 13, 16 ], [ 15, 13 ], [ 16, 11 ], [ 17, 19 ], [ 18, 14 ], [ 19, 15 ], [ 19, 12 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Emanuel knows Carol. Andrew knows Ruby. Kennedy knows Fiona. Leroy knows Willis. Carol knows Kirsten. Martin knows Amelia. Saul knows Khashayar. Ruby knows Jamie. Willis knows Earle. Kirsten knows Leroy. Kirsten knows Kennedy. Willis knows Corey. Corey knows Uma. Jamie knows Keith. Khashayar knows Vivian. Amelia knows Saul. Ruby knows Liam. Saul knows Andrew. Which of Corey and Jamie can Martin reach?", "answer": "Jamie", "steps": [ "Martin knows Amelia.", "Amelia knows Saul.", "Saul knows Andrew.", "Andrew knows Ruby.", "Ruby knows Jamie." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Martin", "Jamie", "Khashayar", "Amelia", "Saul", "Ruby", "Liam", "Andrew", "Keith", "Vivian", "Emanuel", "Corey", "Kennedy", "Carol", "Kirsten", "Willis", "Earle", "Leroy", "Uma", "Fiona" ], "edges": [ [ 0, 3 ], [ 1, 8 ], [ 2, 9 ], [ 3, 4 ], [ 4, 7 ], [ 4, 2 ], [ 5, 6 ], [ 5, 1 ], [ 7, 5 ], [ 10, 13 ], [ 11, 18 ], [ 12, 19 ], [ 13, 14 ], [ 14, 17 ], [ 14, 12 ], [ 15, 16 ], [ 15, 11 ], [ 17, 15 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Valerie knows Irving. Lois knows Clifford. Kira knows Valerie. Ralph knows Freya. Wilma knows Marc. Peter knows Xander. Ford knows Kira. Irving knows Leopold. Peter knows Wilma. Lois knows Lauren. Freya knows Lois. Valerie knows Ralph. Damien knows Peter. Jolena knows Fritz. Enrique knows Jolena. Xander knows Enrique. Jolena knows Andrew. Lucia knows Damien. Which of Andrew and Clifford can Ford reach?", "answer": "Clifford", "steps": [ "Ford knows Kira.", "Kira knows Valerie.", "Valerie knows Ralph.", "Ralph knows Freya.", "Freya knows Lois.", "Lois knows Clifford." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Ford", "Leopold", "Lois", "Kira", "Valerie", "Lauren", "Freya", "Ralph", "Clifford", "Irving", "Lucia", "Marc", "Jolena", "Damien", "Peter", "Fritz", "Enrique", "Xander", "Andrew", "Wilma" ], "edges": [ [ 0, 3 ], [ 2, 5 ], [ 2, 8 ], [ 3, 4 ], [ 4, 7 ], [ 4, 9 ], [ 6, 2 ], [ 7, 6 ], [ 9, 1 ], [ 10, 13 ], [ 12, 15 ], [ 12, 18 ], [ 13, 14 ], [ 14, 17 ], [ 14, 19 ], [ 16, 12 ], [ 17, 16 ], [ 19, 11 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Austin knows Molly. Laurel knows Anton. Ellis knows Austin. Karen knows Henrietta. Henrietta knows Kingsley. Austin knows Yara. Grady knows Duke. Dahlia knows Laurel. Ivy knows Yvonne. Nadine knows Shane. Kingsley knows Ivy. Yvonne knows Dahlia. Melanie knows Eamon. Kingsley knows Melanie. Molly knows Lola. Kylie knows Ellis. Yara knows Nadine. Shane knows Grady. Which of Anton and Duke can Kylie reach?", "answer": "Duke", "steps": [ "Kylie knows Ellis.", "Ellis knows Austin.", "Austin knows Yara.", "Yara knows Nadine.", "Nadine knows Shane.", "Shane knows Grady.", "Grady knows Duke." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Kylie", "Molly", "Austin", "Yara", "Grady", "Shane", "Ellis", "Lola", "Duke", "Nadine", "Karen", "Melanie", "Kingsley", "Ivy", "Laurel", "Dahlia", "Henrietta", "Eamon", "Anton", "Yvonne" ], "edges": [ [ 0, 6 ], [ 1, 7 ], [ 2, 1 ], [ 2, 3 ], [ 3, 9 ], [ 4, 8 ], [ 5, 4 ], [ 6, 2 ], [ 9, 5 ], [ 10, 16 ], [ 11, 17 ], [ 12, 11 ], [ 12, 13 ], [ 13, 19 ], [ 14, 18 ], [ 15, 14 ], [ 16, 12 ], [ 19, 15 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Catherine knows Julie. Catherine knows Sybil. Denver knows Catherine. Carlos knows Eunice. Faith knows Robin. Robin knows Iris. Denver knows Carey. Sybil knows Homer. Lucy knows Dick. Faith knows Wayne. Clarence knows Charity. Eunice knows Lana. Kenzie knows Allan. Robin knows Clarence. Allan knows Lucy. Kenzie knows Faith. Elena knows Denver. Elena knows Carlos. Which of Sybil and Clarence can Elena reach?", "answer": "Sybil", "steps": [ "Elena knows Denver.", "Denver knows Catherine.", "Catherine knows Sybil." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Elena", "Homer", "Carlos", "Lana", "Carey", "Eunice", "Denver", "Sybil", "Julie", "Catherine", "Kenzie", "Charity", "Allan", "Dick", "Wayne", "Lucy", "Faith", "Clarence", "Iris", "Robin" ], "edges": [ [ 0, 2 ], [ 0, 6 ], [ 2, 5 ], [ 5, 3 ], [ 6, 4 ], [ 6, 9 ], [ 7, 1 ], [ 9, 7 ], [ 9, 8 ], [ 10, 12 ], [ 10, 16 ], [ 12, 15 ], [ 15, 13 ], [ 16, 14 ], [ 16, 19 ], [ 17, 11 ], [ 19, 17 ], [ 19, 18 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Jerry knows Greg. Marie knows Erwin. Jennifer knows Byron. Daria knows Jerry. Julius knows Leland. Helen knows Enrique. Luella knows Helen. Lucy knows Beth. Jennifer knows Julius. Lucy knows Darla. Greg knows Elizabeth. Elizabeth knows Lamar. Darla knows Luella. Daria knows Bernice. Reed knows Knox. Erwin knows Reed. Helen knows Marie. Leland knows Daria. Which of Knox and Lamar can Lucy reach?", "answer": "Knox", "steps": [ "Lucy knows Darla.", "Darla knows Luella.", "Luella knows Helen.", "Helen knows Marie.", "Marie knows Erwin.", "Erwin knows Reed.", "Reed knows Knox." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Lucy", "Reed", "Marie", "Luella", "Enrique", "Helen", "Knox", "Darla", "Erwin", "Beth", "Jennifer", "Elizabeth", "Jerry", "Leland", "Bernice", "Daria", "Lamar", "Julius", "Greg", "Byron" ], "edges": [ [ 0, 7 ], [ 0, 9 ], [ 1, 6 ], [ 2, 8 ], [ 3, 5 ], [ 5, 4 ], [ 5, 2 ], [ 7, 3 ], [ 8, 1 ], [ 10, 17 ], [ 10, 19 ], [ 11, 16 ], [ 12, 18 ], [ 13, 15 ], [ 15, 14 ], [ 15, 12 ], [ 17, 13 ], [ 18, 11 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Pierce knows Graham. Louisa knows Victor. Kim knows Sheila. Victor knows Lewis. Tina knows Ford. Lennox knows Jenna. Gabriel knows Carla. Jem knows Marco. Carla knows Merle. Ford knows Edmund. Hudson knows Kim. Pierce knows Tina. Carla knows Judith. Victor knows Hudson. Marco knows Lennox. Kim knows Jem. Merle knows Pierce. Edmund knows Leigh. Which of Victor and Carla can Gabriel reach?", "answer": "Carla", "steps": [ "Gabriel knows Carla." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Gabriel", "Graham", "Edmund", "Tina", "Pierce", "Carla", "Ford", "Merle", "Leigh", "Judith", "Louisa", "Sheila", "Lennox", "Jem", "Kim", "Victor", "Marco", "Hudson", "Jenna", "Lewis" ], "edges": [ [ 0, 5 ], [ 2, 8 ], [ 3, 6 ], [ 4, 1 ], [ 4, 3 ], [ 5, 7 ], [ 5, 9 ], [ 6, 2 ], [ 7, 4 ], [ 10, 15 ], [ 12, 18 ], [ 13, 16 ], [ 14, 11 ], [ 14, 13 ], [ 15, 17 ], [ 15, 19 ], [ 16, 12 ], [ 17, 14 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Valerie knows Malcolm. Virgil knows Ava. Vincent knows Nora. Valerie knows Alicia. Nora knows Jacques. Alicia knows Vincent. Alicia knows Eugenia. Ava knows Lauren. Malcolm knows Tyler. Virgil knows Ember. Cameron knows Ivan. Warren knows Cameron. Malcolm knows Caleb. Cameron knows Peggy. Lauren knows Forrest. Warren knows Virgil. Jacques knows Leah. Forrest knows Gerard. Which of Alicia and Virgil can Warren reach?", "answer": "Virgil", "steps": [ "Warren knows Virgil." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Warren", "Ember", "Ava", "Peggy", "Gerard", "Lauren", "Cameron", "Forrest", "Ivan", "Virgil", "Valerie", "Eugenia", "Vincent", "Caleb", "Leah", "Nora", "Malcolm", "Jacques", "Tyler", "Alicia" ], "edges": [ [ 0, 6 ], [ 0, 9 ], [ 2, 5 ], [ 5, 7 ], [ 6, 3 ], [ 6, 8 ], [ 7, 4 ], [ 9, 1 ], [ 9, 2 ], [ 10, 16 ], [ 10, 19 ], [ 12, 15 ], [ 15, 17 ], [ 16, 13 ], [ 16, 18 ], [ 17, 14 ], [ 19, 11 ], [ 19, 12 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Jeremiah knows Glen. Jenny knows Jose. Arlene knows Vincent. Marie knows Allison. Bert knows Caroline. Jean knows Rufus. Jose knows Merle. Sylvia knows Jeremiah. Corinne knows Morgan. Jose knows Walter. Jenny knows Jean. Rufus knows Simon. Marie knows Esther. Arlene knows Marie. Corinne knows Jenny. Simon knows Eunice. Vincent knows Sylvia. Bert knows Arlene. Which of Sylvia and Rufus can Corinne reach?", "answer": "Rufus", "steps": [ "Corinne knows Jenny.", "Jenny knows Jean.", "Jean knows Rufus." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Corinne", "Jose", "Simon", "Morgan", "Eunice", "Jenny", "Rufus", "Jean", "Walter", "Merle", "Bert", "Marie", "Jeremiah", "Caroline", "Glen", "Arlene", "Sylvia", "Vincent", "Allison", "Esther" ], "edges": [ [ 0, 3 ], [ 0, 5 ], [ 1, 8 ], [ 1, 9 ], [ 2, 4 ], [ 5, 7 ], [ 5, 1 ], [ 6, 2 ], [ 7, 6 ], [ 10, 13 ], [ 10, 15 ], [ 11, 18 ], [ 11, 19 ], [ 12, 14 ], [ 15, 17 ], [ 15, 11 ], [ 16, 12 ], [ 17, 16 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Jermaine knows Aurora. Ann knows Gina. Monica knows Ruby. Ann knows Maude. Saul knows Monica. Ruby knows Yolanda. Amelia knows Jules. Eleanor knows Ann. Levi knows Veronica. Eleanor knows Archie. Jules knows Cesar. Jermaine knows Amelia. Yolanda knows Lars. Yolanda knows Kenzie. Lars knows Levi. Monica knows Eugenia. Maude knows Jermaine. Saul knows Lewis. Which of Levi and Jules can Saul reach?", "answer": "Levi", "steps": [ "Saul knows Monica.", "Monica knows Ruby.", "Ruby knows Yolanda.", "Yolanda knows Lars.", "Lars knows Levi." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Saul", "Veronica", "Monica", "Kenzie", "Eugenia", "Lewis", "Levi", "Lars", "Ruby", "Yolanda", "Eleanor", "Cesar", "Ann", "Aurora", "Gina", "Archie", "Jules", "Amelia", "Maude", "Jermaine" ], "edges": [ [ 0, 5 ], [ 0, 2 ], [ 2, 4 ], [ 2, 8 ], [ 6, 1 ], [ 7, 6 ], [ 8, 9 ], [ 9, 3 ], [ 9, 7 ], [ 10, 15 ], [ 10, 12 ], [ 12, 14 ], [ 12, 18 ], [ 16, 11 ], [ 17, 16 ], [ 18, 19 ], [ 19, 13 ], [ 19, 17 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Ford knows Sidney. Yvonne knows Winifred. Jeffery knows Alice. Diane knows Ford. Ainsley knows Rocco. Harry knows Ashley. Rocco knows Yvonne. Cordelia knows Vance. Effie knows Harry. Cordelia knows Latoya. Ainsley knows Jeffery. Vance knows Effie. Harry knows Janice. Wendy knows Roy. Latoya knows Bryan. Janice knows Wendy. Winifred knows Heath. Winifred knows Diane. Which of Ford and Wendy can Cordelia reach?", "answer": "Wendy", "steps": [ "Cordelia knows Vance.", "Vance knows Effie.", "Effie knows Harry.", "Harry knows Janice.", "Janice knows Wendy." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Cordelia", "Bryan", "Ashley", "Latoya", "Effie", "Roy", "Harry", "Vance", "Wendy", "Janice", "Ainsley", "Alice", "Heath", "Jeffery", "Yvonne", "Sidney", "Winifred", "Rocco", "Ford", "Diane" ], "edges": [ [ 0, 3 ], [ 0, 7 ], [ 3, 1 ], [ 4, 6 ], [ 6, 2 ], [ 6, 9 ], [ 7, 4 ], [ 8, 5 ], [ 9, 8 ], [ 10, 13 ], [ 10, 17 ], [ 13, 11 ], [ 14, 16 ], [ 16, 12 ], [ 16, 19 ], [ 17, 14 ], [ 18, 15 ], [ 19, 18 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Adam knows Fern. Adam knows Richard. Alejandro knows April. Justin knows Alejandro. Leah knows Justin. Flora knows Griffith. Justin knows Taylor. Kristina knows Adam. April knows Karen. Katrina knows Kristina. Richard knows Flora. Belinda knows Keith. Justin knows Layla. Adam knows Ashton. Dallas knows Chris. Rachel knows Leah. Kristina knows Belinda. Leah knows Dallas. Which of Alejandro and Richard can Rachel reach?", "answer": "Alejandro", "steps": [ "Rachel knows Leah.", "Leah knows Justin.", "Justin knows Alejandro." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Rachel", "Karen", "Taylor", "Alejandro", "Layla", "Justin", "Chris", "Leah", "Dallas", "April", "Katrina", "Griffith", "Ashton", "Richard", "Fern", "Adam", "Keith", "Kristina", "Belinda", "Flora" ], "edges": [ [ 0, 7 ], [ 3, 9 ], [ 5, 2 ], [ 5, 4 ], [ 5, 3 ], [ 7, 8 ], [ 7, 5 ], [ 8, 6 ], [ 9, 1 ], [ 10, 17 ], [ 13, 19 ], [ 15, 12 ], [ 15, 14 ], [ 15, 13 ], [ 17, 18 ], [ 17, 15 ], [ 18, 16 ], [ 19, 11 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Zach knows Jeffery. Magdalena knows Hattie. Myrtle knows Gregory. Myrtle knows Elmer. Goldie knows Electra. Matt knows James. James knows Myrtle. Matt knows Tamara. Clarence knows Deborah. Clarence knows Henrietta. Ernesto knows Clarence. Dave knows Magdalena. Myrtle knows Goldie. Zach knows Ernesto. Ebony knows Leticia. Goldie knows Ebony. Clarence knows Dave. Dave knows Fred. Which of Myrtle and Clarence can Matt reach?", "answer": "Myrtle", "steps": [ "Matt knows James.", "James knows Myrtle." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Matt", "Goldie", "James", "Tamara", "Gregory", "Elmer", "Myrtle", "Ebony", "Electra", "Leticia", "Zach", "Dave", "Ernesto", "Jeffery", "Henrietta", "Deborah", "Clarence", "Magdalena", "Fred", "Hattie" ], "edges": [ [ 0, 3 ], [ 0, 2 ], [ 1, 8 ], [ 1, 7 ], [ 2, 6 ], [ 6, 4 ], [ 6, 5 ], [ 6, 1 ], [ 7, 9 ], [ 10, 13 ], [ 10, 12 ], [ 11, 18 ], [ 11, 17 ], [ 12, 16 ], [ 16, 14 ], [ 16, 15 ], [ 16, 11 ], [ 17, 19 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Ember knows Marc. Marion knows Arturo. Gertrude knows Delia. Arturo knows Sebastian. Harper knows Chantal. Helene knows Hector. Hayden knows Gertrude. Harry knows Kevin. Donald knows Helene. Sue knows Donald. Kennedy knows Stephanie. Stephanie knows Hayden. Ember knows Harper. Marc knows Kennedy. Arturo knows Sue. Hector knows Harry. Sebastian knows Josie. Abby knows Ember. Which of Sue and Marc can Marion reach?", "answer": "Sue", "steps": [ "Marion knows Arturo.", "Arturo knows Sue." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Marion", "Helene", "Josie", "Harry", "Arturo", "Sue", "Hector", "Sebastian", "Kevin", "Donald", "Abby", "Stephanie", "Chantal", "Gertrude", "Ember", "Marc", "Hayden", "Harper", "Delia", "Kennedy" ], "edges": [ [ 0, 4 ], [ 1, 6 ], [ 3, 8 ], [ 4, 7 ], [ 4, 5 ], [ 5, 9 ], [ 6, 3 ], [ 7, 2 ], [ 9, 1 ], [ 10, 14 ], [ 11, 16 ], [ 13, 18 ], [ 14, 17 ], [ 14, 15 ], [ 15, 19 ], [ 16, 13 ], [ 17, 12 ], [ 19, 11 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Julian knows Giselle. Della knows Brooke. Julian knows Sybil. Fanny knows Myrtle. Jared knows Pete. Della knows Malik. Brooke knows Jay. Elise knows Stephen. Julian knows Ruth. Fanny knows Della. Layla knows Lambert. Myrtle knows Jared. Della knows Clayton. Jared knows Farrah. Elise knows Julian. Stephen knows Layla. Ruth knows Drake. Layla knows Madeline. Which of Jay and Drake can Elise reach?", "answer": "Drake", "steps": [ "Elise knows Julian.", "Julian knows Ruth.", "Ruth knows Drake." ], "difficulty": 3, "original_distance": 3, "idx_to_symbol": [ "Elise", "Layla", "Sybil", "Julian", "Madeline", "Lambert", "Ruth", "Drake", "Stephen", "Giselle", "Fanny", "Jared", "Clayton", "Della", "Farrah", "Pete", "Brooke", "Jay", "Myrtle", "Malik" ], "edges": [ [ 0, 8 ], [ 0, 3 ], [ 1, 4 ], [ 1, 5 ], [ 3, 2 ], [ 3, 6 ], [ 3, 9 ], [ 6, 7 ], [ 8, 1 ], [ 10, 18 ], [ 10, 13 ], [ 11, 14 ], [ 11, 15 ], [ 13, 12 ], [ 13, 16 ], [ 13, 19 ], [ 16, 17 ], [ 18, 11 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Leah knows Judith. Ernesto knows Diana. Judith knows Cody. Eamon knows Leah. Don knows Ariana. Diana knows Lacey. Wyatt knows Lisette. Maude knows Brian. Fernando knows Edmund. Eamon knows Jason. Marion knows Don. Leah knows Maude. Lacey knows Eamon. Fernando knows Jenna. Ariana knows Fernando. Edmund knows Wyatt. Bernadette knows Dudley. Edmund knows Bernadette. Which of Don and Diana can Ernesto reach?", "answer": "Diana", "steps": [ "Ernesto knows Diana." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Ernesto", "Leah", "Diana", "Cody", "Jason", "Maude", "Lacey", "Brian", "Judith", "Eamon", "Marion", "Edmund", "Don", "Lisette", "Jenna", "Bernadette", "Ariana", "Dudley", "Wyatt", "Fernando" ], "edges": [ [ 0, 2 ], [ 1, 5 ], [ 1, 8 ], [ 2, 6 ], [ 5, 7 ], [ 6, 9 ], [ 8, 3 ], [ 9, 4 ], [ 9, 1 ], [ 10, 12 ], [ 11, 15 ], [ 11, 18 ], [ 12, 16 ], [ 15, 17 ], [ 16, 19 ], [ 18, 13 ], [ 19, 14 ], [ 19, 11 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Jenny knows Boris. Kenneth knows Garrison. Candice knows Kenneth. Sheryl knows Philip. Gerald knows Sheryl. Hayes knows Lawson. Candice knows Aiden. Sheryl knows Joy. Maria knows Nathan. Boris knows Maria. Logan knows Hayes. Philip knows Candice. Jenny knows Xander. Maria knows Logan. Alana knows Justine. Alana knows Jenny. Garrison knows Craig. Gerald knows Sean. Which of Boris and Philip can Gerald reach?", "answer": "Philip", "steps": [ "Gerald knows Sheryl.", "Sheryl knows Philip." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Gerald", "Kenneth", "Sean", "Craig", "Aiden", "Garrison", "Philip", "Sheryl", "Candice", "Joy", "Alana", "Logan", "Justine", "Lawson", "Nathan", "Hayes", "Boris", "Jenny", "Maria", "Xander" ], "edges": [ [ 0, 2 ], [ 0, 7 ], [ 1, 5 ], [ 5, 3 ], [ 6, 8 ], [ 7, 6 ], [ 7, 9 ], [ 8, 4 ], [ 8, 1 ], [ 10, 12 ], [ 10, 17 ], [ 11, 15 ], [ 15, 13 ], [ 16, 18 ], [ 17, 16 ], [ 17, 19 ], [ 18, 14 ], [ 18, 11 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Irma knows Elmer. Verna knows Clyde. Clyde knows Serena. Ariana knows Irma. Dell knows Xander. Rosemary knows Archie. Cyrus knows Blanche. Serena knows Pierce. Jennifer knows Uma. Elmer knows Jennifer. Archie knows Verna. Irma knows Cyrus. Kai knows Devin. Archie knows Kai. Verna knows Doris. Devin knows Sheila. Cyrus knows Wesley. Wesley knows Dell. Which of Pierce and Xander can Rosemary reach?", "answer": "Pierce", "steps": [ "Rosemary knows Archie.", "Archie knows Verna.", "Verna knows Clyde.", "Clyde knows Serena.", "Serena knows Pierce." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Rosemary", "Sheila", "Kai", "Devin", "Serena", "Doris", "Verna", "Clyde", "Pierce", "Archie", "Ariana", "Uma", "Elmer", "Jennifer", "Dell", "Blanche", "Cyrus", "Wesley", "Xander", "Irma" ], "edges": [ [ 0, 9 ], [ 2, 3 ], [ 3, 1 ], [ 4, 8 ], [ 6, 5 ], [ 6, 7 ], [ 7, 4 ], [ 9, 2 ], [ 9, 6 ], [ 10, 19 ], [ 12, 13 ], [ 13, 11 ], [ 14, 18 ], [ 16, 15 ], [ 16, 17 ], [ 17, 14 ], [ 19, 12 ], [ 19, 16 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Shelly knows Brett. Justine knows Benjamin. Brett knows Parker. Benjamin knows Aiden. Jeanette knows Justine. Carol knows Helene. Carol knows Georgia. Alyssa knows Lionel. Alejandro knows Edmund. Parker knows Alyssa. Benjamin knows Chester. Dean knows Jeanette. Justine knows Hadley. Edmund knows Dean. Dean knows August. Alyssa knows Carol. Wallace knows Shelly. Brett knows Kendra. Which of Carol and Benjamin can Wallace reach?", "answer": "Carol", "steps": [ "Wallace knows Shelly.", "Shelly knows Brett.", "Brett knows Parker.", "Parker knows Alyssa.", "Alyssa knows Carol." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Wallace", "Alyssa", "Georgia", "Lionel", "Carol", "Parker", "Helene", "Kendra", "Brett", "Shelly", "Alejandro", "Justine", "Aiden", "Hadley", "Benjamin", "Jeanette", "Chester", "August", "Dean", "Edmund" ], "edges": [ [ 0, 9 ], [ 1, 3 ], [ 1, 4 ], [ 4, 2 ], [ 4, 6 ], [ 5, 1 ], [ 8, 5 ], [ 8, 7 ], [ 9, 8 ], [ 10, 19 ], [ 11, 13 ], [ 11, 14 ], [ 14, 12 ], [ 14, 16 ], [ 15, 11 ], [ 18, 15 ], [ 18, 17 ], [ 19, 18 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Bennett knows Jeff. Aspen knows Israel. Aspen knows Gerald. Israel knows Everett. Jeff knows Della. Leland knows Saul. Leland knows Geoffrey. Grace knows Zane. Dora knows Bennett. Saul knows Lara. Geoffrey knows Gordon. Reid knows Dora. Yvette knows Fabian. Saul knows Malik. Malik knows Yvette. Everett knows Cesar. Zane knows Leland. Bennett knows Aspen. Which of Bennett and Leland can Reid reach?", "answer": "Bennett", "steps": [ "Reid knows Dora.", "Dora knows Bennett." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Reid", "Jeff", "Gerald", "Aspen", "Israel", "Della", "Bennett", "Cesar", "Dora", "Everett", "Grace", "Geoffrey", "Lara", "Saul", "Malik", "Gordon", "Leland", "Fabian", "Zane", "Yvette" ], "edges": [ [ 0, 8 ], [ 1, 5 ], [ 3, 2 ], [ 3, 4 ], [ 4, 9 ], [ 6, 1 ], [ 6, 3 ], [ 8, 6 ], [ 9, 7 ], [ 10, 18 ], [ 11, 15 ], [ 13, 12 ], [ 13, 14 ], [ 14, 19 ], [ 16, 11 ], [ 16, 13 ], [ 18, 16 ], [ 19, 17 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Ainsley knows Brody. Dean knows Anna. Fergus knows Cliff. Kelly knows Fergus. Stefan knows Dean. Archer knows Dirk. Clinton knows Kathleen. Kirk knows Ainsley. Percy knows Clinton. Brody knows Archer. Brody knows Dawn. Ramon knows Marilyn. Dirk knows Cara. Clinton knows Stefan. Miranda knows Percy. Kathleen knows Beth. Dawn knows Kelly. Beth knows Ramon. Which of Dawn and Kathleen can Kirk reach?", "answer": "Dawn", "steps": [ "Kirk knows Ainsley.", "Ainsley knows Brody.", "Brody knows Dawn." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Kirk", "Archer", "Cara", "Brody", "Fergus", "Dirk", "Cliff", "Ainsley", "Kelly", "Dawn", "Miranda", "Stefan", "Anna", "Clinton", "Ramon", "Dean", "Marilyn", "Percy", "Beth", "Kathleen" ], "edges": [ [ 0, 7 ], [ 1, 5 ], [ 3, 1 ], [ 3, 9 ], [ 4, 6 ], [ 5, 2 ], [ 7, 3 ], [ 8, 4 ], [ 9, 8 ], [ 10, 17 ], [ 11, 15 ], [ 13, 11 ], [ 13, 19 ], [ 14, 16 ], [ 15, 12 ], [ 17, 13 ], [ 18, 14 ], [ 19, 18 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Leroy knows Nadine. Carlos knows Julio. Keegan knows Trevor. Lennox knows Felix. Rosa knows Allison. Nadine knows Kareem. Trevor knows Adelaide. Leo knows Carlos. Garland knows Barbara. Adelaide knows Lennox. Nadine knows Lucy. Allison knows Leo. Keegan knows Giselle. Rosa knows Darla. Houston knows Garland. Trevor knows Houston. Garland knows Monica. Allison knows Leroy. Which of Houston and Leroy can Rosa reach?", "answer": "Leroy", "steps": [ "Rosa knows Allison.", "Allison knows Leroy." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Rosa", "Kareem", "Leo", "Carlos", "Leroy", "Julio", "Nadine", "Allison", "Lucy", "Darla", "Keegan", "Barbara", "Adelaide", "Lennox", "Houston", "Felix", "Garland", "Trevor", "Monica", "Giselle" ], "edges": [ [ 0, 7 ], [ 0, 9 ], [ 2, 3 ], [ 3, 5 ], [ 4, 6 ], [ 6, 1 ], [ 6, 8 ], [ 7, 2 ], [ 7, 4 ], [ 10, 17 ], [ 10, 19 ], [ 12, 13 ], [ 13, 15 ], [ 14, 16 ], [ 16, 11 ], [ 16, 18 ], [ 17, 12 ], [ 17, 14 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Justine knows Karen. Justine knows Imogen. Ezra knows Dante. Karen knows Odette. Dave knows Ezra. Justine knows Gemma. Whitney knows Lois. Daniel knows Justine. Karen knows Dave. Ricardo knows Courtney. Courtney knows Gerard. Whitney knows Opal. Opal knows Tanya. Camden knows Ricardo. Whitney knows Camden. Gemma knows Leland. Camden knows Travis. Natalie knows Whitney. Which of Gerard and Dante can Daniel reach?", "answer": "Dante", "steps": [ "Daniel knows Justine.", "Justine knows Karen.", "Karen knows Dave.", "Dave knows Ezra.", "Ezra knows Dante." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Daniel", "Dante", "Imogen", "Ezra", "Leland", "Karen", "Justine", "Odette", "Gemma", "Dave", "Natalie", "Gerard", "Lois", "Courtney", "Tanya", "Camden", "Whitney", "Travis", "Opal", "Ricardo" ], "edges": [ [ 0, 6 ], [ 3, 1 ], [ 5, 7 ], [ 5, 9 ], [ 6, 2 ], [ 6, 8 ], [ 6, 5 ], [ 8, 4 ], [ 9, 3 ], [ 10, 16 ], [ 13, 11 ], [ 15, 17 ], [ 15, 19 ], [ 16, 12 ], [ 16, 18 ], [ 16, 15 ], [ 18, 14 ], [ 19, 13 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Lily knows Effie. Kylie knows Geoffrey. Denver knows Kelsey. Ariana knows Nolan. Jane knows Max. Alicia knows Erma. Max knows Kylie. Effie knows Liam. Lauren knows Devin. Ivy knows Alicia. Denver knows Jane. Shane knows Lauren. Nolan knows Ivy. Clark knows Carson. Effie knows Ariana. Devin knows Denver. Geoffrey knows Marian. Carson knows Lily. Which of Effie and Denver can Clark reach?", "answer": "Effie", "steps": [ "Clark knows Carson.", "Carson knows Lily.", "Lily knows Effie." ], "difficulty": 3, "original_distance": 8, "idx_to_symbol": [ "Clark", "Lily", "Erma", "Alicia", "Ivy", "Ariana", "Effie", "Nolan", "Carson", "Liam", "Shane", "Devin", "Marian", "Geoffrey", "Kylie", "Jane", "Denver", "Max", "Lauren", "Kelsey" ], "edges": [ [ 0, 8 ], [ 1, 6 ], [ 3, 2 ], [ 4, 3 ], [ 5, 7 ], [ 6, 5 ], [ 6, 9 ], [ 7, 4 ], [ 8, 1 ], [ 10, 18 ], [ 11, 16 ], [ 13, 12 ], [ 14, 13 ], [ 15, 17 ], [ 16, 15 ], [ 16, 19 ], [ 17, 14 ], [ 18, 11 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Estella knows Caroline. Stanley knows Susan. Emery knows Estella. Neville knows Emery. Neville knows Julian. Emery knows Dave. Caroline knows Aurora. Wade knows Axel. Charity knows Roger. Wade knows Charity. Kim knows Colette. Wade knows Rosemary. Neville knows Kim. Rosemary knows Lance. Daniella knows Neville. Rosemary knows Stanley. Heidi knows Wade. Susan knows Francesca. Which of Wade and Neville can Heidi reach?", "answer": "Wade", "steps": [ "Heidi knows Wade." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Heidi", "Stanley", "Francesca", "Lance", "Charity", "Rosemary", "Axel", "Susan", "Wade", "Roger", "Daniella", "Estella", "Aurora", "Dave", "Kim", "Emery", "Julian", "Caroline", "Neville", "Colette" ], "edges": [ [ 0, 8 ], [ 1, 7 ], [ 4, 9 ], [ 5, 3 ], [ 5, 1 ], [ 7, 2 ], [ 8, 6 ], [ 8, 5 ], [ 8, 4 ], [ 10, 18 ], [ 11, 17 ], [ 14, 19 ], [ 15, 13 ], [ 15, 11 ], [ 17, 12 ], [ 18, 16 ], [ 18, 15 ], [ 18, 14 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Vera knows Henrietta. Federico knows Haven. Mark knows Hannah. Fiona knows Mabel. Annie knows Mark. Fiona knows Bob. Bob knows Federico. Jolene knows Roger. Henrietta knows Fiona. Ivan knows Robin. Robin knows Annie. Mabel knows Avery. Annie knows Jolene. Hannah knows Yvette. Ivan knows Celeste. Fiona knows Marcus. Vera knows Ramona. Annie knows India. Which of Mark and Bob can Vera reach?", "answer": "Bob", "steps": [ "Vera knows Henrietta.", "Henrietta knows Fiona.", "Fiona knows Bob." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Vera", "Federico", "Marcus", "Avery", "Haven", "Mabel", "Henrietta", "Fiona", "Ramona", "Bob", "Ivan", "Hannah", "India", "Roger", "Yvette", "Jolene", "Robin", "Annie", "Celeste", "Mark" ], "edges": [ [ 0, 8 ], [ 0, 6 ], [ 1, 4 ], [ 5, 3 ], [ 6, 7 ], [ 7, 2 ], [ 7, 5 ], [ 7, 9 ], [ 9, 1 ], [ 10, 18 ], [ 10, 16 ], [ 11, 14 ], [ 15, 13 ], [ 16, 17 ], [ 17, 12 ], [ 17, 15 ], [ 17, 19 ], [ 19, 11 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Isla knows Caroline. Hattie knows Bruce. Deirdre knows Chance. Bruce knows Chase. Ford knows Xavier. Andrew knows Laura. Chance knows Nicholas. Chris knows Gunnar. Mara knows Chris. Chris knows Hattie. Bruce knows Andrew. Nicholas knows Greg. Deirdre knows Jem. Hattie knows Knox. Ford knows Deirdre. Isla knows Ford. Chance knows Ronald. Mara knows Brody. Which of Ford and Chris can Isla reach?", "answer": "Ford", "steps": [ "Isla knows Ford." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Isla", "Deirdre", "Ronald", "Jem", "Greg", "Chance", "Caroline", "Nicholas", "Ford", "Xavier", "Mara", "Hattie", "Chase", "Knox", "Laura", "Bruce", "Brody", "Andrew", "Chris", "Gunnar" ], "edges": [ [ 0, 6 ], [ 0, 8 ], [ 1, 3 ], [ 1, 5 ], [ 5, 2 ], [ 5, 7 ], [ 7, 4 ], [ 8, 1 ], [ 8, 9 ], [ 10, 16 ], [ 10, 18 ], [ 11, 13 ], [ 11, 15 ], [ 15, 12 ], [ 15, 17 ], [ 17, 14 ], [ 18, 11 ], [ 18, 19 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Kay knows Neal. Calvin knows Olive. Gunnar knows Eunice. Burt knows Hunter. Amelia knows Lana. Gunnar knows Russell. Frank knows Gabriel. Russell knows Drew. Burt knows Wilma. Hunter knows Hailey. Drew knows Calvin. Amelia knows Ingrid. Gabriel knows Melody. Ingrid knows Frank. Hunter knows Gunnar. Cassidy knows Bart. Kay knows Amelia. Cassidy knows Kay. Which of Amelia and Gunnar can Cassidy reach?", "answer": "Amelia", "steps": [ "Cassidy knows Kay.", "Kay knows Amelia." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Cassidy", "Gabriel", "Kay", "Frank", "Bart", "Melody", "Ingrid", "Neal", "Amelia", "Lana", "Burt", "Calvin", "Hunter", "Drew", "Wilma", "Olive", "Russell", "Hailey", "Gunnar", "Eunice" ], "edges": [ [ 0, 4 ], [ 0, 2 ], [ 1, 5 ], [ 2, 7 ], [ 2, 8 ], [ 3, 1 ], [ 6, 3 ], [ 8, 6 ], [ 8, 9 ], [ 10, 14 ], [ 10, 12 ], [ 11, 15 ], [ 12, 17 ], [ 12, 18 ], [ 13, 11 ], [ 16, 13 ], [ 18, 16 ], [ 18, 19 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Dean knows Horace. Dean knows Tamara. Kane knows Joy. India knows Emanuel. Jeanne knows Nadine. Hannah knows Dora. Kit knows Morgan. Jeanne knows Harris. Jeanne knows Chandler. Morgan knows Ariel. Riley knows Jeanne. Chandler knows Elvis. Joy knows India. Jeanne knows Elaine. Kane knows Dean. Dean knows Harold. Riley knows Kit. Dean knows Hannah. Which of Chandler and Hannah can Riley reach?", "answer": "Chandler", "steps": [ "Riley knows Jeanne.", "Jeanne knows Chandler." ], "difficulty": 2, "original_distance": 3, "idx_to_symbol": [ "Riley", "Ariel", "Morgan", "Kit", "Elvis", "Nadine", "Chandler", "Elaine", "Harris", "Jeanne", "Kane", "Emanuel", "India", "Joy", "Dora", "Harold", "Hannah", "Horace", "Tamara", "Dean" ], "edges": [ [ 0, 3 ], [ 0, 9 ], [ 2, 1 ], [ 3, 2 ], [ 6, 4 ], [ 9, 5 ], [ 9, 6 ], [ 9, 7 ], [ 9, 8 ], [ 10, 13 ], [ 10, 19 ], [ 12, 11 ], [ 13, 12 ], [ 16, 14 ], [ 19, 15 ], [ 19, 16 ], [ 19, 17 ], [ 19, 18 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Dudley knows Milo. Bill knows Fritz. Dudley knows Lara. Fritz knows Leland. Blair knows Mabel. Ross knows Dudley. Elijah knows Seth. Adam knows Blair. Bill knows Anita. Dudley knows Marcia. Quinn knows Hazel. Marcia knows Daniella. Bill knows Boyd. Leland knows Adam. Fraser knows Quinn. Elijah knows Bill. Ross knows Trina. Daniella knows Fraser. Which of Mabel and Hazel can Ross reach?", "answer": "Hazel", "steps": [ "Ross knows Dudley.", "Dudley knows Marcia.", "Marcia knows Daniella.", "Daniella knows Fraser.", "Fraser knows Quinn.", "Quinn knows Hazel." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Ross", "Quinn", "Lara", "Fraser", "Daniella", "Marcia", "Hazel", "Trina", "Milo", "Dudley", "Elijah", "Blair", "Anita", "Adam", "Leland", "Fritz", "Mabel", "Seth", "Boyd", "Bill" ], "edges": [ [ 0, 7 ], [ 0, 9 ], [ 1, 6 ], [ 3, 1 ], [ 4, 3 ], [ 5, 4 ], [ 9, 2 ], [ 9, 5 ], [ 9, 8 ], [ 10, 17 ], [ 10, 19 ], [ 11, 16 ], [ 13, 11 ], [ 14, 13 ], [ 15, 14 ], [ 19, 12 ], [ 19, 15 ], [ 19, 18 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Fred knows Erwin. Irma knows Avery. Verna knows Thomas. Fred knows Verna. Steve knows Bruce. Jonathan knows Steve. Leticia knows Declan. Violet knows Inez. Steve knows Ella. Bruce knows Lloyd. Viola knows Wendy. Fanny knows Jonathan. Verna knows Viola. Preston knows Don. Steve knows Leticia. Bruce knows Violet. Fred knows Irma. Don knows Fred. Which of Violet and Viola can Preston reach?", "answer": "Viola", "steps": [ "Preston knows Don.", "Don knows Fred.", "Fred knows Verna.", "Verna knows Viola." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Preston", "Erwin", "Avery", "Don", "Verna", "Fred", "Viola", "Wendy", "Irma", "Thomas", "Fanny", "Ella", "Declan", "Jonathan", "Bruce", "Steve", "Violet", "Inez", "Leticia", "Lloyd" ], "edges": [ [ 0, 3 ], [ 3, 5 ], [ 4, 6 ], [ 4, 9 ], [ 5, 1 ], [ 5, 8 ], [ 5, 4 ], [ 6, 7 ], [ 8, 2 ], [ 10, 13 ], [ 13, 15 ], [ 14, 16 ], [ 14, 19 ], [ 15, 11 ], [ 15, 18 ], [ 15, 14 ], [ 16, 17 ], [ 18, 12 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Brynn knows Reid. Reid knows Chandler. Mindy knows Dell. Alyson knows Gonzalo. Dorian knows Alyson. Tracy knows Virgil. Margaret knows Brynn. Jim knows Dina. Hayes knows Dorian. Elena knows Julio. Dudley knows Diana. Diana knows Mindy. Virgil knows Margaret. Chandler knows Hayes. Simon knows Jim. Sean knows Simon. Julio knows Dudley. Dell knows Sean. Which of Brynn and Diana can Elena reach?", "answer": "Diana", "steps": [ "Elena knows Julio.", "Julio knows Dudley.", "Dudley knows Diana." ], "difficulty": 3, "original_distance": 9, "idx_to_symbol": [ "Elena", "Jim", "Simon", "Dudley", "Dina", "Dell", "Julio", "Diana", "Sean", "Mindy", "Tracy", "Alyson", "Dorian", "Margaret", "Gonzalo", "Chandler", "Virgil", "Brynn", "Hayes", "Reid" ], "edges": [ [ 0, 6 ], [ 1, 4 ], [ 2, 1 ], [ 3, 7 ], [ 5, 8 ], [ 6, 3 ], [ 7, 9 ], [ 8, 2 ], [ 9, 5 ], [ 10, 16 ], [ 11, 14 ], [ 12, 11 ], [ 13, 17 ], [ 15, 18 ], [ 16, 13 ], [ 17, 19 ], [ 18, 12 ], [ 19, 15 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Lorna knows Louisa. Dudley knows Lorna. Gustavo knows Susan. Darla knows Alyssa. Laurel knows Gustavo. Myrtle knows June. Myrtle knows Dudley. Susan knows Opal. June knows Jeanette. Dudley knows Henrietta. Louisa knows Magdalena. Nicholas knows Darla. Nicholas knows Paige. Nicholas knows Bernard. Bernard knows David. Darla knows Laurel. Myrtle knows Karen. Magdalena knows Herbert. Which of Louisa and Gustavo can Myrtle reach?", "answer": "Louisa", "steps": [ "Myrtle knows Dudley.", "Dudley knows Lorna.", "Lorna knows Louisa." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Myrtle", "Henrietta", "Lorna", "Dudley", "Magdalena", "June", "Jeanette", "Louisa", "Karen", "Herbert", "Nicholas", "Alyssa", "Laurel", "Darla", "Susan", "Bernard", "David", "Gustavo", "Paige", "Opal" ], "edges": [ [ 0, 5 ], [ 0, 8 ], [ 0, 3 ], [ 2, 7 ], [ 3, 1 ], [ 3, 2 ], [ 4, 9 ], [ 5, 6 ], [ 7, 4 ], [ 10, 15 ], [ 10, 18 ], [ 10, 13 ], [ 12, 17 ], [ 13, 11 ], [ 13, 12 ], [ 14, 19 ], [ 15, 16 ], [ 17, 14 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Pierce knows Graham. Louisa knows Victor. Kim knows Sheila. Victor knows Lewis. Tina knows Ford. Lennox knows Jenna. Gabriel knows Carla. Jem knows Marco. Carla knows Merle. Ford knows Edmund. Hudson knows Kim. Pierce knows Tina. Carla knows Judith. Victor knows Hudson. Marco knows Lennox. Kim knows Jem. Merle knows Pierce. Edmund knows Leigh. Which of Kim and Pierce can Gabriel reach?", "answer": "Pierce", "steps": [ "Gabriel knows Carla.", "Carla knows Merle.", "Merle knows Pierce." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Gabriel", "Graham", "Edmund", "Tina", "Pierce", "Carla", "Ford", "Merle", "Leigh", "Judith", "Louisa", "Sheila", "Lennox", "Jem", "Kim", "Victor", "Marco", "Hudson", "Jenna", "Lewis" ], "edges": [ [ 0, 5 ], [ 2, 8 ], [ 3, 6 ], [ 4, 1 ], [ 4, 3 ], [ 5, 7 ], [ 5, 9 ], [ 6, 2 ], [ 7, 4 ], [ 10, 15 ], [ 12, 18 ], [ 13, 16 ], [ 14, 11 ], [ 14, 13 ], [ 15, 17 ], [ 15, 19 ], [ 16, 12 ], [ 17, 14 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Lorna knows Louisa. Dudley knows Lorna. Gustavo knows Susan. Darla knows Alyssa. Laurel knows Gustavo. Myrtle knows June. Myrtle knows Dudley. Susan knows Opal. June knows Jeanette. Dudley knows Henrietta. Louisa knows Magdalena. Nicholas knows Darla. Nicholas knows Paige. Nicholas knows Bernard. Bernard knows David. Darla knows Laurel. Myrtle knows Karen. Magdalena knows Herbert. Which of Opal and Herbert can Myrtle reach?", "answer": "Herbert", "steps": [ "Myrtle knows Dudley.", "Dudley knows Lorna.", "Lorna knows Louisa.", "Louisa knows Magdalena.", "Magdalena knows Herbert." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Myrtle", "Henrietta", "Lorna", "Dudley", "Magdalena", "June", "Jeanette", "Louisa", "Karen", "Herbert", "Nicholas", "Alyssa", "Laurel", "Darla", "Susan", "Bernard", "David", "Gustavo", "Paige", "Opal" ], "edges": [ [ 0, 5 ], [ 0, 8 ], [ 0, 3 ], [ 2, 7 ], [ 3, 1 ], [ 3, 2 ], [ 4, 9 ], [ 5, 6 ], [ 7, 4 ], [ 10, 15 ], [ 10, 18 ], [ 10, 13 ], [ 12, 17 ], [ 13, 11 ], [ 13, 12 ], [ 14, 19 ], [ 15, 16 ], [ 17, 14 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Hugh knows Amy. Virginia knows Claudia. Max knows Homer. Homer knows Pat. Claudia knows Stephen. Ella knows Hugh. Amy knows Lily. Kit knows William. Edison knows Allan. Max knows Randall. Randall knows Edison. Claudia knows Ella. Lily knows Bernice. Kit knows Hannah. Maria knows Kit. Bob knows Holden. Hugh knows Bob. Hannah knows Max. Which of Kit and Claudia can Virginia reach?", "answer": "Claudia", "steps": [ "Virginia knows Claudia." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Virginia", "Ella", "Claudia", "Amy", "Holden", "Bernice", "Hugh", "Bob", "Stephen", "Lily", "Maria", "Hannah", "Kit", "Randall", "Pat", "Allan", "Max", "Homer", "William", "Edison" ], "edges": [ [ 0, 2 ], [ 1, 6 ], [ 2, 8 ], [ 2, 1 ], [ 3, 9 ], [ 6, 7 ], [ 6, 3 ], [ 7, 4 ], [ 9, 5 ], [ 10, 12 ], [ 11, 16 ], [ 12, 18 ], [ 12, 11 ], [ 13, 19 ], [ 16, 17 ], [ 16, 13 ], [ 17, 14 ], [ 19, 15 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Tonya knows Austin. Geneva knows Caroline. Haley knows Jeanne. Henry knows Geneva. Geneva knows Langston. Byron knows Cruz. Levi knows Sandra. Edna knows Tonya. Levi knows Byron. Jeanne knows Glenda. Langston knows Lorraine. Cruz knows Henry. Byron knows Denver. Tonya knows Malcolm. Malcolm knows Judy. Jeanne knows Gina. Haley knows Kingsley. Glenda knows Edna. Which of Cruz and Glenda can Haley reach?", "answer": "Glenda", "steps": [ "Haley knows Jeanne.", "Jeanne knows Glenda." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Haley", "Austin", "Tonya", "Kingsley", "Judy", "Glenda", "Gina", "Edna", "Jeanne", "Malcolm", "Levi", "Caroline", "Geneva", "Sandra", "Lorraine", "Cruz", "Denver", "Henry", "Byron", "Langston" ], "edges": [ [ 0, 3 ], [ 0, 8 ], [ 2, 1 ], [ 2, 9 ], [ 5, 7 ], [ 7, 2 ], [ 8, 6 ], [ 8, 5 ], [ 9, 4 ], [ 10, 13 ], [ 10, 18 ], [ 12, 11 ], [ 12, 19 ], [ 15, 17 ], [ 17, 12 ], [ 18, 16 ], [ 18, 15 ], [ 19, 14 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Gerald knows Susan. Jolene knows Omar. Angela knows Cate. Jake knows Lloyd. Dorothy knows Angela. Drew knows Jake. Marc knows Harold. Zachary knows Jolene. Susan knows Peggy. Zachary knows Ramona. Francesca knows Heather. Jeanette knows Ernie. Cate knows Marc. Rachel knows Zachary. Rachel knows Gerald. Marc knows Jeanette. Heather knows Rachel. Cate knows Drew. Which of Cate and Rachel can Francesca reach?", "answer": "Rachel", "steps": [ "Francesca knows Heather.", "Heather knows Rachel." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Francesca", "Ramona", "Rachel", "Omar", "Gerald", "Peggy", "Susan", "Heather", "Jolene", "Zachary", "Dorothy", "Harold", "Cate", "Ernie", "Drew", "Lloyd", "Jake", "Angela", "Jeanette", "Marc" ], "edges": [ [ 0, 7 ], [ 2, 4 ], [ 2, 9 ], [ 4, 6 ], [ 6, 5 ], [ 7, 2 ], [ 8, 3 ], [ 9, 1 ], [ 9, 8 ], [ 10, 17 ], [ 12, 14 ], [ 12, 19 ], [ 14, 16 ], [ 16, 15 ], [ 17, 12 ], [ 18, 13 ], [ 19, 11 ], [ 19, 18 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Kane knows Luz. Skyler knows Clay. Luz knows Lana. Clay knows Parsa. Parsa knows Nash. Marc knows Selena. Parsa knows Kendra. Hendrix knows Graeme. Yolanda knows Dina. Parsa knows Hudson. Skyler knows Norma. Skyler knows Elvira. Eden knows Marc. Nash knows Hendrix. Marc knows Kane. Yolanda knows Dudley. Yolanda knows Eden. Marc knows Elaine. Which of Graeme and Lana can Skyler reach?", "answer": "Graeme", "steps": [ "Skyler knows Clay.", "Clay knows Parsa.", "Parsa knows Nash.", "Nash knows Hendrix.", "Hendrix knows Graeme." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Skyler", "Elvira", "Parsa", "Hendrix", "Clay", "Norma", "Hudson", "Graeme", "Kendra", "Nash", "Yolanda", "Dudley", "Marc", "Luz", "Eden", "Dina", "Elaine", "Lana", "Selena", "Kane" ], "edges": [ [ 0, 1 ], [ 0, 5 ], [ 0, 4 ], [ 2, 6 ], [ 2, 8 ], [ 2, 9 ], [ 3, 7 ], [ 4, 2 ], [ 9, 3 ], [ 10, 11 ], [ 10, 15 ], [ 10, 14 ], [ 12, 16 ], [ 12, 18 ], [ 12, 19 ], [ 13, 17 ], [ 14, 12 ], [ 19, 13 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Clifford knows Jared. Sally knows Effie. Adam knows Shannon. Jane knows Wilson. Clayton knows Ignacio. Adam knows Jane. Clifford knows Jillian. Jake knows Adam. Wilson knows Pam. Ignacio knows Miles. Sally knows Juan. Clayton knows Edward. Kate knows Ray. Wilson knows Ada. Juan knows Clifford. Miles knows Sally. Simon knows Jake. Kate knows Simon. Which of Adam and Sally can Clayton reach?", "answer": "Sally", "steps": [ "Clayton knows Ignacio.", "Ignacio knows Miles.", "Miles knows Sally." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Clayton", "Sally", "Edward", "Clifford", "Jared", "Effie", "Jillian", "Juan", "Ignacio", "Miles", "Kate", "Adam", "Ray", "Wilson", "Pam", "Shannon", "Ada", "Jane", "Simon", "Jake" ], "edges": [ [ 0, 2 ], [ 0, 8 ], [ 1, 5 ], [ 1, 7 ], [ 3, 4 ], [ 3, 6 ], [ 7, 3 ], [ 8, 9 ], [ 9, 1 ], [ 10, 12 ], [ 10, 18 ], [ 11, 15 ], [ 11, 17 ], [ 13, 14 ], [ 13, 16 ], [ 17, 13 ], [ 18, 19 ], [ 19, 11 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Loretta knows Dorothy. Eldon knows Daisy. Kristina knows Marc. Dorothy knows Colleen. Naomi knows Jordan. Gareth knows Farrah. Spencer knows Eldon. Gareth knows Spencer. Dorothy knows Kristina. Renee knows Loretta. Tonya knows Naomi. Spencer knows Lennox. Tonya knows Gareth. Harriet knows Aisha. Loretta knows Gage. Spencer knows Dudley. Dorothy knows Lawrence. Renee knows Harriet. Which of Dorothy and Spencer can Renee reach?", "answer": "Dorothy", "steps": [ "Renee knows Loretta.", "Loretta knows Dorothy." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Renee", "Aisha", "Loretta", "Lawrence", "Dorothy", "Gage", "Marc", "Kristina", "Colleen", "Harriet", "Tonya", "Jordan", "Gareth", "Dudley", "Spencer", "Farrah", "Daisy", "Eldon", "Lennox", "Naomi" ], "edges": [ [ 0, 2 ], [ 0, 9 ], [ 2, 5 ], [ 2, 4 ], [ 4, 3 ], [ 4, 7 ], [ 4, 8 ], [ 7, 6 ], [ 9, 1 ], [ 10, 12 ], [ 10, 19 ], [ 12, 15 ], [ 12, 14 ], [ 14, 13 ], [ 14, 17 ], [ 14, 18 ], [ 17, 16 ], [ 19, 11 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Fred knows Darrell. Hayes knows Beverly. Agnes knows Mike. Oliver knows Roman. Yvonne knows Larry. Larry knows Daisy. Daisy knows Darnell. Julia knows Lucia. Gabriel knows Oliver. Hayes knows Walter. April knows Gabriel. Jamie knows Yvonne. Gabriel knows Troy. Gabriel knows Craig. Lucia knows Agnes. Mike knows April. Darnell knows Hayes. Hayes knows Fred. Which of April and Darnell can Jamie reach?", "answer": "Darnell", "steps": [ "Jamie knows Yvonne.", "Yvonne knows Larry.", "Larry knows Daisy.", "Daisy knows Darnell." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Jamie", "Larry", "Darrell", "Hayes", "Fred", "Walter", "Yvonne", "Daisy", "Darnell", "Beverly", "Julia", "Agnes", "Roman", "Gabriel", "Oliver", "Craig", "Lucia", "Mike", "April", "Troy" ], "edges": [ [ 0, 6 ], [ 1, 7 ], [ 3, 4 ], [ 3, 5 ], [ 3, 9 ], [ 4, 2 ], [ 6, 1 ], [ 7, 8 ], [ 8, 3 ], [ 10, 16 ], [ 11, 17 ], [ 13, 14 ], [ 13, 15 ], [ 13, 19 ], [ 14, 12 ], [ 16, 11 ], [ 17, 18 ], [ 18, 13 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Ibrahim knows Byron. Frank knows Walter. Edward knows Ibrahim. Larry knows Norman. Edward knows Louisa. Kristina knows Tabitha. Fraser knows Frank. Dylan knows Kristina. Frank knows Chad. Chad knows Dylan. Fernando knows Gail. Louisa knows Irma. Larry knows Jeanette. Ross knows Larry. Kristina knows Janelle. Hayley knows Ross. Ibrahim knows Hayley. Fraser knows Fernando. Which of Frank and Ibrahim can Fraser reach?", "answer": "Frank", "steps": [ "Fraser knows Frank." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Fraser", "Kristina", "Janelle", "Chad", "Gail", "Frank", "Tabitha", "Walter", "Dylan", "Fernando", "Edward", "Larry", "Jeanette", "Hayley", "Irma", "Ibrahim", "Norman", "Byron", "Ross", "Louisa" ], "edges": [ [ 0, 5 ], [ 0, 9 ], [ 1, 2 ], [ 1, 6 ], [ 3, 8 ], [ 5, 7 ], [ 5, 3 ], [ 8, 1 ], [ 9, 4 ], [ 10, 15 ], [ 10, 19 ], [ 11, 12 ], [ 11, 16 ], [ 13, 18 ], [ 15, 17 ], [ 15, 13 ], [ 18, 11 ], [ 19, 14 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Kaleb knows Clark. Louise knows Joyce. Mindy knows Julius. Malcolm knows Rose. Victor knows Kylie. Renee knows Julio. Lucia knows Lana. Victor knows Cynthia. Brock knows Jane. Joyce knows Mindy. Julio knows Malcolm. Victor knows Brock. Lana knows Gary. Joyce knows Ashton. Joyce knows Kaleb. Louise knows Lucia. Kylie knows Annette. Renee knows Victor. Which of Annette and Clark can Renee reach?", "answer": "Annette", "steps": [ "Renee knows Victor.", "Victor knows Kylie.", "Kylie knows Annette." ], "difficulty": 3, "original_distance": 3, "idx_to_symbol": [ "Renee", "Cynthia", "Rose", "Jane", "Annette", "Malcolm", "Kylie", "Brock", "Julio", "Victor", "Louise", "Ashton", "Gary", "Julius", "Clark", "Lana", "Kaleb", "Mindy", "Lucia", "Joyce" ], "edges": [ [ 0, 8 ], [ 0, 9 ], [ 5, 2 ], [ 6, 4 ], [ 7, 3 ], [ 8, 5 ], [ 9, 1 ], [ 9, 6 ], [ 9, 7 ], [ 10, 18 ], [ 10, 19 ], [ 15, 12 ], [ 16, 14 ], [ 17, 13 ], [ 18, 15 ], [ 19, 11 ], [ 19, 16 ], [ 19, 17 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Sierra knows Lana. Judith knows Ezra. Landon knows Sara. Lana knows Fred. Emanuel knows Giselle. Judith knows Chase. Bette knows Judith. Ezra knows Cate. Vivian knows Wesley. Cruz knows Landon. Hunter knows Vivian. Landon knows Jeanne. Cate knows Wanda. Wanda knows Hunter. Fred knows Emanuel. Landon knows Jordan. Jeanne knows Sierra. Judith knows Chloe. Which of Ezra and Jeanne can Bette reach?", "answer": "Ezra", "steps": [ "Bette knows Judith.", "Judith knows Ezra." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Bette", "Wesley", "Judith", "Ezra", "Chase", "Hunter", "Cate", "Chloe", "Vivian", "Wanda", "Cruz", "Giselle", "Landon", "Jeanne", "Sara", "Fred", "Sierra", "Jordan", "Emanuel", "Lana" ], "edges": [ [ 0, 2 ], [ 2, 4 ], [ 2, 7 ], [ 2, 3 ], [ 3, 6 ], [ 5, 8 ], [ 6, 9 ], [ 8, 1 ], [ 9, 5 ], [ 10, 12 ], [ 12, 14 ], [ 12, 17 ], [ 12, 13 ], [ 13, 16 ], [ 15, 18 ], [ 16, 19 ], [ 18, 11 ], [ 19, 15 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Harold knows Joyce. Miles knows Joaquin. Saul knows Harold. Sonia knows Gregory. Dane knows Coral. Clara knows Eugene. Joaquin knows George. Saul knows Clayton. Joyce knows Howard. Joaquin knows Clara. Eugene knows Serena. Howard knows Arden. Howard knows Charles. Howard knows Federico. Federico knows Dane. Sonia knows Harper. Gregory knows Miles. Joaquin knows Natalie. Which of Coral and Serena can Saul reach?", "answer": "Coral", "steps": [ "Saul knows Harold.", "Harold knows Joyce.", "Joyce knows Howard.", "Howard knows Federico.", "Federico knows Dane.", "Dane knows Coral." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Saul", "Howard", "Federico", "Arden", "Coral", "Dane", "Clayton", "Joyce", "Charles", "Harold", "Sonia", "Joaquin", "Clara", "George", "Serena", "Eugene", "Harper", "Miles", "Natalie", "Gregory" ], "edges": [ [ 0, 6 ], [ 0, 9 ], [ 1, 3 ], [ 1, 2 ], [ 1, 8 ], [ 2, 5 ], [ 5, 4 ], [ 7, 1 ], [ 9, 7 ], [ 10, 16 ], [ 10, 19 ], [ 11, 13 ], [ 11, 12 ], [ 11, 18 ], [ 12, 15 ], [ 15, 14 ], [ 17, 11 ], [ 19, 17 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Bruce knows Merle. Glenda knows Ricardo. Kimberly knows Chester. Everett knows Esme. Bruce knows Geraldine. Glenda knows Claire. Ricardo knows Nolan. Lucas knows Kimberly. Nolan knows Ken. Everett knows Riley. Louis knows Trevor. Esme knows Louis. Geraldine knows Lucas. Joaquin knows Dorian. Joaquin knows Gideon. Geraldine knows Beth. Nolan knows Everett. Gideon knows Bruce. Which of Nolan and Bruce can Joaquin reach?", "answer": "Bruce", "steps": [ "Joaquin knows Gideon.", "Gideon knows Bruce." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Joaquin", "Chester", "Dorian", "Lucas", "Gideon", "Bruce", "Kimberly", "Beth", "Merle", "Geraldine", "Glenda", "Trevor", "Claire", "Esme", "Ricardo", "Nolan", "Louis", "Riley", "Ken", "Everett" ], "edges": [ [ 0, 2 ], [ 0, 4 ], [ 3, 6 ], [ 4, 5 ], [ 5, 8 ], [ 5, 9 ], [ 6, 1 ], [ 9, 3 ], [ 9, 7 ], [ 10, 12 ], [ 10, 14 ], [ 13, 16 ], [ 14, 15 ], [ 15, 18 ], [ 15, 19 ], [ 16, 11 ], [ 19, 13 ], [ 19, 17 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Lily knows Effie. Kylie knows Geoffrey. Denver knows Kelsey. Ariana knows Nolan. Jane knows Max. Alicia knows Erma. Max knows Kylie. Effie knows Liam. Lauren knows Devin. Ivy knows Alicia. Denver knows Jane. Shane knows Lauren. Nolan knows Ivy. Clark knows Carson. Effie knows Ariana. Devin knows Denver. Geoffrey knows Marian. Carson knows Lily. Which of Carson and Lauren can Clark reach?", "answer": "Carson", "steps": [ "Clark knows Carson." ], "difficulty": 1, "original_distance": 8, "idx_to_symbol": [ "Clark", "Lily", "Erma", "Alicia", "Ivy", "Ariana", "Effie", "Nolan", "Carson", "Liam", "Shane", "Devin", "Marian", "Geoffrey", "Kylie", "Jane", "Denver", "Max", "Lauren", "Kelsey" ], "edges": [ [ 0, 8 ], [ 1, 6 ], [ 3, 2 ], [ 4, 3 ], [ 5, 7 ], [ 6, 5 ], [ 6, 9 ], [ 7, 4 ], [ 8, 1 ], [ 10, 18 ], [ 11, 16 ], [ 13, 12 ], [ 14, 13 ], [ 15, 17 ], [ 16, 15 ], [ 16, 19 ], [ 17, 14 ], [ 18, 11 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Keira knows Humphrey. Lillian knows Federico. Walter knows Zach. Harold knows Eileen. Zach knows Griffith. Lacey knows Leroy. Eileen knows Carla. Eugene knows Harold. Lorraine knows Eugene. Humphrey knows Russ. Forrest knows Demetrius. Griffith knows Lillian. Leroy knows Forrest. Demetrius knows Jameson. Keith knows Elias. Elias knows Keira. Humphrey knows Lacey. Eileen knows Walter. Which of Demetrius and Lillian can Lorraine reach?", "answer": "Lillian", "steps": [ "Lorraine knows Eugene.", "Eugene knows Harold.", "Harold knows Eileen.", "Eileen knows Walter.", "Walter knows Zach.", "Zach knows Griffith.", "Griffith knows Lillian." ], "difficulty": 7, "original_distance": 8, "idx_to_symbol": [ "Lorraine", "Harold", "Zach", "Federico", "Eugene", "Griffith", "Eileen", "Lillian", "Walter", "Carla", "Keith", "Keira", "Leroy", "Jameson", "Elias", "Forrest", "Humphrey", "Demetrius", "Lacey", "Russ" ], "edges": [ [ 0, 4 ], [ 1, 6 ], [ 2, 5 ], [ 4, 1 ], [ 5, 7 ], [ 6, 8 ], [ 6, 9 ], [ 7, 3 ], [ 8, 2 ], [ 10, 14 ], [ 11, 16 ], [ 12, 15 ], [ 14, 11 ], [ 15, 17 ], [ 16, 18 ], [ 16, 19 ], [ 17, 13 ], [ 18, 12 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "India knows Aldo. Latoya knows Lance. Randy knows Isla. Dick knows Omar. Cruz knows Dick. Latoya knows Myrtle. Isabel knows Jill. Myrtle knows Isabel. Dick knows Willis. Basil knows Cruz. Randy knows Byron. Terrence knows Gerard. Hattie knows Vicki. Jill knows Terrence. Cruz knows India. Hattie knows Aurora. Jill knows Hattie. Isla knows Basil. Which of Isla and Myrtle can Latoya reach?", "answer": "Myrtle", "steps": [ "Latoya knows Myrtle." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Latoya", "Vicki", "Gerard", "Lance", "Isabel", "Jill", "Terrence", "Myrtle", "Aurora", "Hattie", "Randy", "Willis", "Aldo", "Byron", "Basil", "Cruz", "India", "Isla", "Omar", "Dick" ], "edges": [ [ 0, 3 ], [ 0, 7 ], [ 4, 5 ], [ 5, 6 ], [ 5, 9 ], [ 6, 2 ], [ 7, 4 ], [ 9, 1 ], [ 9, 8 ], [ 10, 13 ], [ 10, 17 ], [ 14, 15 ], [ 15, 16 ], [ 15, 19 ], [ 16, 12 ], [ 17, 14 ], [ 19, 11 ], [ 19, 18 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Ada knows Greta. Bert knows Jean. Claude knows Mildred. Vivian knows Sydney. Sydney knows Oliver. Greta knows Eden. Sheryl knows Gabriel. Brett knows Elias. Brett knows Atlas. Eden knows Lucille. Nancy knows Brett. Justin knows Nancy. Justin knows Claude. Elias knows Joshua. Greta knows Cate. Vivian knows Ada. Vivian knows Bert. Justin knows Sheryl. Which of Elias and Eden can Vivian reach?", "answer": "Eden", "steps": [ "Vivian knows Ada.", "Ada knows Greta.", "Greta knows Eden." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Vivian", "Bert", "Eden", "Lucille", "Ada", "Greta", "Oliver", "Cate", "Sydney", "Jean", "Justin", "Claude", "Elias", "Joshua", "Nancy", "Brett", "Gabriel", "Atlas", "Sheryl", "Mildred" ], "edges": [ [ 0, 4 ], [ 0, 8 ], [ 0, 1 ], [ 1, 9 ], [ 2, 3 ], [ 4, 5 ], [ 5, 2 ], [ 5, 7 ], [ 8, 6 ], [ 10, 14 ], [ 10, 18 ], [ 10, 11 ], [ 11, 19 ], [ 12, 13 ], [ 14, 15 ], [ 15, 12 ], [ 15, 17 ], [ 18, 16 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Imogen knows Brett. Bella knows Brandon. Imogen knows Chris. Lee knows Frankie. Lee knows Quinn. Lars knows Kate. Darin knows Bonnie. Brandon knows Dorian. Dell knows Naomi. Chris knows Lars. Bella knows Janice. Darin knows Mason. Guy knows Dell. Dell knows Bella. Serena knows Imogen. Guy knows Lee. Chris knows Hazel. Serena knows Darin. Which of Bella and Chris can Guy reach?", "answer": "Bella", "steps": [ "Guy knows Dell.", "Dell knows Bella." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Guy", "Janice", "Lee", "Frankie", "Bella", "Dorian", "Naomi", "Brandon", "Quinn", "Dell", "Serena", "Hazel", "Darin", "Mason", "Chris", "Kate", "Brett", "Lars", "Bonnie", "Imogen" ], "edges": [ [ 0, 2 ], [ 0, 9 ], [ 2, 3 ], [ 2, 8 ], [ 4, 1 ], [ 4, 7 ], [ 7, 5 ], [ 9, 6 ], [ 9, 4 ], [ 10, 12 ], [ 10, 19 ], [ 12, 13 ], [ 12, 18 ], [ 14, 11 ], [ 14, 17 ], [ 17, 15 ], [ 19, 16 ], [ 19, 14 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Lucy knows Diego. Joaquin knows Hope. Lee knows Coral. Arden knows Lee. Grace knows Jose. Chase knows Dante. Joaquin knows Kennedy. Lucy knows Maria. Dante knows Kerry. Lars knows Bart. Hope knows Lucy. Coral knows Grace. Jerome knows Lars. Lars knows Burt. Grace knows Ibrahim. Dante knows Arden. Burt knows Joaquin. Lee knows Oliver. Which of Coral and Hope can Jerome reach?", "answer": "Hope", "steps": [ "Jerome knows Lars.", "Lars knows Burt.", "Burt knows Joaquin.", "Joaquin knows Hope." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Jerome", "Bart", "Joaquin", "Kennedy", "Diego", "Hope", "Burt", "Lars", "Maria", "Lucy", "Chase", "Kerry", "Lee", "Oliver", "Ibrahim", "Coral", "Arden", "Dante", "Jose", "Grace" ], "edges": [ [ 0, 7 ], [ 2, 3 ], [ 2, 5 ], [ 5, 9 ], [ 6, 2 ], [ 7, 1 ], [ 7, 6 ], [ 9, 4 ], [ 9, 8 ], [ 10, 17 ], [ 12, 13 ], [ 12, 15 ], [ 15, 19 ], [ 16, 12 ], [ 17, 11 ], [ 17, 16 ], [ 19, 14 ], [ 19, 18 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Jane knows Monica. April knows Bette. Gina knows Jane. April knows Marcia. Irving knows Candice. Jonathan knows Boyd. April knows Garrett. April knows Claire. Marcia knows Lynn. Dennis knows Ryan. Dennis knows Abigail. Lynn knows Jonathan. Dennis knows Gina. Dennis knows Sonia. Boyd knows Ann. Monica knows Irving. Dennis knows Forrest. April knows Vicki. Which of Jane and Lynn can Dennis reach?", "answer": "Jane", "steps": [ "Dennis knows Gina.", "Gina knows Jane." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Dennis", "Candice", "Irving", "Monica", "Forrest", "Abigail", "Jane", "Sonia", "Gina", "Ryan", "April", "Ann", "Boyd", "Jonathan", "Garrett", "Vicki", "Lynn", "Claire", "Marcia", "Bette" ], "edges": [ [ 0, 4 ], [ 0, 5 ], [ 0, 7 ], [ 0, 8 ], [ 0, 9 ], [ 2, 1 ], [ 3, 2 ], [ 6, 3 ], [ 8, 6 ], [ 10, 14 ], [ 10, 15 ], [ 10, 17 ], [ 10, 18 ], [ 10, 19 ], [ 12, 11 ], [ 13, 12 ], [ 16, 13 ], [ 18, 16 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Luis knows Michael. Jim knows Lynn. Winston knows Alana. Stella knows Winston. George knows Eve. Michael knows Nell. Andrea knows Carey. Lenora knows Paul. Eve knows Carol. Luis knows Harlan. Michael knows Stella. Alan knows Fraser. Eden knows Jim. Alan knows George. Alana knows Eden. Andrea knows Alan. Magdalena knows Lenora. Carol knows Magdalena. Which of Carol and Alana can Luis reach?", "answer": "Alana", "steps": [ "Luis knows Michael.", "Michael knows Stella.", "Stella knows Winston.", "Winston knows Alana." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Luis", "Winston", "Stella", "Eden", "Harlan", "Lynn", "Jim", "Alana", "Michael", "Nell", "Andrea", "Eve", "George", "Magdalena", "Carey", "Paul", "Lenora", "Carol", "Alan", "Fraser" ], "edges": [ [ 0, 4 ], [ 0, 8 ], [ 1, 7 ], [ 2, 1 ], [ 3, 6 ], [ 6, 5 ], [ 7, 3 ], [ 8, 2 ], [ 8, 9 ], [ 10, 14 ], [ 10, 18 ], [ 11, 17 ], [ 12, 11 ], [ 13, 16 ], [ 16, 15 ], [ 17, 13 ], [ 18, 12 ], [ 18, 19 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "August knows Nora. Beau knows Jennifer. Jennifer knows Sandra. Ariel knows Aria. Tracy knows Beau. Tracy knows Wilma. Mae knows Priscilla. Sandra knows Gina. Evelyn knows Cruz. Evelyn knows Beth. Mae knows Ariel. Wilma knows August. Delia knows Penny. Chester knows Leon. Cruz knows Mae. August knows Delia. Beth knows Vanessa. Vanessa knows Chester. Which of August and Mae can Tracy reach?", "answer": "August", "steps": [ "Tracy knows Wilma.", "Wilma knows August." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Tracy", "Gina", "Jennifer", "Wilma", "Delia", "Penny", "Sandra", "August", "Beau", "Nora", "Evelyn", "Leon", "Vanessa", "Cruz", "Ariel", "Aria", "Chester", "Mae", "Beth", "Priscilla" ], "edges": [ [ 0, 8 ], [ 0, 3 ], [ 2, 6 ], [ 3, 7 ], [ 4, 5 ], [ 6, 1 ], [ 7, 4 ], [ 7, 9 ], [ 8, 2 ], [ 10, 18 ], [ 10, 13 ], [ 12, 16 ], [ 13, 17 ], [ 14, 15 ], [ 16, 11 ], [ 17, 14 ], [ 17, 19 ], [ 18, 12 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Irene knows Damien. Irene knows Lisa. Damien knows Layla. James knows Cyrus. Blanche knows Irene. Randy knows Frida. Lisa knows Adelaide. Cyrus knows Robin. Frida knows Lucy. Virginia knows Randy. Randy knows James. April knows Blanche. Nadine knows Chantal. Seth knows Lamont. Adelaide knows Grant. Frida knows Nadine. Willis knows Virginia. Damien knows Seth. Which of Blanche and Virginia can April reach?", "answer": "Blanche", "steps": [ "April knows Blanche." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "April", "Irene", "Lisa", "Layla", "Adelaide", "Blanche", "Lamont", "Seth", "Damien", "Grant", "Willis", "Randy", "James", "Lucy", "Cyrus", "Virginia", "Chantal", "Nadine", "Frida", "Robin" ], "edges": [ [ 0, 5 ], [ 1, 8 ], [ 1, 2 ], [ 2, 4 ], [ 4, 9 ], [ 5, 1 ], [ 7, 6 ], [ 8, 3 ], [ 8, 7 ], [ 10, 15 ], [ 11, 18 ], [ 11, 12 ], [ 12, 14 ], [ 14, 19 ], [ 15, 11 ], [ 17, 16 ], [ 18, 13 ], [ 18, 17 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Archer knows Duncan. Eduardo knows Ramon. Rex knows Conrad. Rex knows Archer. Jessie knows Lydia. Lydia knows Wilbur. Lydia knows Tara. Gareth knows Forrest. Sean knows Janice. Ross knows Jessie. Forrest knows Eduardo. Rena knows Sean. Tara knows Rena. Grace knows Rex. Archer knows Gareth. Jessie knows Ramona. Ramon knows Amelia. Janice knows Sam. Which of Sam and Amelia can Grace reach?", "answer": "Amelia", "steps": [ "Grace knows Rex.", "Rex knows Archer.", "Archer knows Gareth.", "Gareth knows Forrest.", "Forrest knows Eduardo.", "Eduardo knows Ramon.", "Ramon knows Amelia." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Grace", "Ramon", "Duncan", "Gareth", "Amelia", "Archer", "Eduardo", "Rex", "Forrest", "Conrad", "Ross", "Janice", "Wilbur", "Tara", "Sam", "Lydia", "Sean", "Jessie", "Rena", "Ramona" ], "edges": [ [ 0, 7 ], [ 1, 4 ], [ 3, 8 ], [ 5, 2 ], [ 5, 3 ], [ 6, 1 ], [ 7, 5 ], [ 7, 9 ], [ 8, 6 ], [ 10, 17 ], [ 11, 14 ], [ 13, 18 ], [ 15, 12 ], [ 15, 13 ], [ 16, 11 ], [ 17, 15 ], [ 17, 19 ], [ 18, 16 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Keaton knows Elizabeth. Morris knows Maude. Constance knows Michelle. Morris knows Leopold. Michelle knows Keaton. Wade knows Celeste. Constance knows Carey. Celeste knows Isadora. Celeste knows Daniel. Celeste knows Lucille. Keaton knows Morris. Daniel knows Katrina. Katrina knows Victor. Katrina knows Farrah. Constance knows Patrick. Victor knows Elena. Bernadette knows Constance. Victor knows Seth. Which of Constance and Celeste can Bernadette reach?", "answer": "Constance", "steps": [ "Bernadette knows Constance." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Bernadette", "Morris", "Keaton", "Constance", "Leopold", "Michelle", "Patrick", "Maude", "Carey", "Elizabeth", "Wade", "Victor", "Katrina", "Celeste", "Elena", "Daniel", "Isadora", "Seth", "Lucille", "Farrah" ], "edges": [ [ 0, 3 ], [ 1, 4 ], [ 1, 7 ], [ 2, 1 ], [ 2, 9 ], [ 3, 6 ], [ 3, 8 ], [ 3, 5 ], [ 5, 2 ], [ 10, 13 ], [ 11, 14 ], [ 11, 17 ], [ 12, 11 ], [ 12, 19 ], [ 13, 16 ], [ 13, 18 ], [ 13, 15 ], [ 15, 12 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Erwin knows Cole. Trudy knows Pauline. Kristina knows Dean. Warren knows Trudy. Benjamin knows Karina. Karina knows Lucia. Warren knows Lola. Kristina knows Estella. Estella knows Evan. Warren knows Jacob. Jacob knows Doug. Lola knows Douglas. Erwin knows Kristina. Kristina knows Neville. Neville knows Jane. Ann knows Erwin. Karina knows Warren. Dean knows Olive. Which of Olive and Pauline can Benjamin reach?", "answer": "Pauline", "steps": [ "Benjamin knows Karina.", "Karina knows Warren.", "Warren knows Trudy.", "Trudy knows Pauline." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Benjamin", "Karina", "Jacob", "Pauline", "Doug", "Trudy", "Warren", "Douglas", "Lola", "Lucia", "Ann", "Erwin", "Neville", "Olive", "Jane", "Dean", "Kristina", "Evan", "Estella", "Cole" ], "edges": [ [ 0, 1 ], [ 1, 6 ], [ 1, 9 ], [ 2, 4 ], [ 5, 3 ], [ 6, 2 ], [ 6, 5 ], [ 6, 8 ], [ 8, 7 ], [ 10, 11 ], [ 11, 16 ], [ 11, 19 ], [ 12, 14 ], [ 15, 13 ], [ 16, 12 ], [ 16, 15 ], [ 16, 18 ], [ 18, 17 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Vera knows Henrietta. Federico knows Haven. Mark knows Hannah. Fiona knows Mabel. Annie knows Mark. Fiona knows Bob. Bob knows Federico. Jolene knows Roger. Henrietta knows Fiona. Ivan knows Robin. Robin knows Annie. Mabel knows Avery. Annie knows Jolene. Hannah knows Yvette. Ivan knows Celeste. Fiona knows Marcus. Vera knows Ramona. Annie knows India. Which of Robin and Henrietta can Vera reach?", "answer": "Henrietta", "steps": [ "Vera knows Henrietta." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Vera", "Federico", "Marcus", "Avery", "Haven", "Mabel", "Henrietta", "Fiona", "Ramona", "Bob", "Ivan", "Hannah", "India", "Roger", "Yvette", "Jolene", "Robin", "Annie", "Celeste", "Mark" ], "edges": [ [ 0, 8 ], [ 0, 6 ], [ 1, 4 ], [ 5, 3 ], [ 6, 7 ], [ 7, 2 ], [ 7, 5 ], [ 7, 9 ], [ 9, 1 ], [ 10, 18 ], [ 10, 16 ], [ 11, 14 ], [ 15, 13 ], [ 16, 17 ], [ 17, 12 ], [ 17, 15 ], [ 17, 19 ], [ 19, 11 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Ivy knows Seth. Denver knows Regina. Saul knows Kelly. Eamon knows Sam. Regina knows Ivy. Nina knows Otto. Alan knows Mara. Jeanette knows Ezra. Regina knows Eamon. Nina knows Jesse. Mara knows Jeanette. Jodi knows Billy. Mara knows Nina. Ivy knows Gabe. Jodi knows Alan. Jeanette knows Ruby. Saul knows Denver. Eamon knows Tyler. Which of Nina and Eamon can Saul reach?", "answer": "Eamon", "steps": [ "Saul knows Denver.", "Denver knows Regina.", "Regina knows Eamon." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Saul", "Regina", "Seth", "Gabe", "Eamon", "Tyler", "Denver", "Sam", "Kelly", "Ivy", "Jodi", "Mara", "Ruby", "Ezra", "Nina", "Jesse", "Alan", "Otto", "Billy", "Jeanette" ], "edges": [ [ 0, 8 ], [ 0, 6 ], [ 1, 4 ], [ 1, 9 ], [ 4, 5 ], [ 4, 7 ], [ 6, 1 ], [ 9, 2 ], [ 9, 3 ], [ 10, 18 ], [ 10, 16 ], [ 11, 14 ], [ 11, 19 ], [ 14, 15 ], [ 14, 17 ], [ 16, 11 ], [ 19, 12 ], [ 19, 13 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Keira knows Lamont. Jorge knows Lyle. Ryan knows Jorge. Doug knows Emma. Lambert knows Keira. Lyle knows Ilene. Devin knows Mario. Lambert knows Ryan. Clara knows Devin. Clara knows Doug. Lambert knows Dahlia. Ronald knows Lance. Lyle knows Quinn. Ronald knows Adam. Jude knows Wanda. Clara knows Jude. Wanda knows Ronald. Dahlia knows Hendrix. Which of Adam and Quinn can Clara reach?", "answer": "Adam", "steps": [ "Clara knows Jude.", "Jude knows Wanda.", "Wanda knows Ronald.", "Ronald knows Adam." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Clara", "Jude", "Lance", "Adam", "Wanda", "Devin", "Doug", "Emma", "Mario", "Ronald", "Lambert", "Ryan", "Ilene", "Quinn", "Jorge", "Dahlia", "Keira", "Lamont", "Hendrix", "Lyle" ], "edges": [ [ 0, 6 ], [ 0, 5 ], [ 0, 1 ], [ 1, 4 ], [ 4, 9 ], [ 5, 8 ], [ 6, 7 ], [ 9, 2 ], [ 9, 3 ], [ 10, 16 ], [ 10, 15 ], [ 10, 11 ], [ 11, 14 ], [ 14, 19 ], [ 15, 18 ], [ 16, 17 ], [ 19, 12 ], [ 19, 13 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Constance knows Lisette. Drake knows Eldon. Aiden knows Robin. Eldon knows Brock. Cole knows Adele. Cole knows Jacob. Constance knows Lawrence. Constance knows Eileen. Robin knows Diane. Drake knows Craig. Jana knows Etta. Lisette knows Jana. Beth knows Constance. Cole knows Neville. Asher knows Cole. Jacob knows Drake. Jana knows Aiden. Brock knows Emmett. Which of Eldon and Aiden can Beth reach?", "answer": "Aiden", "steps": [ "Beth knows Constance.", "Constance knows Lisette.", "Lisette knows Jana.", "Jana knows Aiden." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Beth", "Lawrence", "Etta", "Aiden", "Robin", "Eileen", "Diane", "Jana", "Constance", "Lisette", "Asher", "Neville", "Craig", "Eldon", "Brock", "Adele", "Emmett", "Drake", "Cole", "Jacob" ], "edges": [ [ 0, 8 ], [ 3, 4 ], [ 4, 6 ], [ 7, 2 ], [ 7, 3 ], [ 8, 1 ], [ 8, 5 ], [ 8, 9 ], [ 9, 7 ], [ 10, 18 ], [ 13, 14 ], [ 14, 16 ], [ 17, 12 ], [ 17, 13 ], [ 18, 11 ], [ 18, 15 ], [ 18, 19 ], [ 19, 17 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Kendrick knows Glenda. Aspen knows Adam. Hattie knows Kendrick. Bernard knows Hattie. Adam knows Karen. David knows Stella. Frida knows Latoya. Hattie knows Bernice. Daphna knows Jorge. Frida knows Aspen. Aspen knows Chantal. Bernard knows Quinn. Frida knows Peggy. Jorge knows Bernard. Stella knows Frida. Karen knows Keira. Bernard knows Teresa. Glenda knows Abby. Which of Frida and Bernard can Daphna reach?", "answer": "Bernard", "steps": [ "Daphna knows Jorge.", "Jorge knows Bernard." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Daphna", "Abby", "Kendrick", "Glenda", "Jorge", "Hattie", "Quinn", "Bernard", "Teresa", "Bernice", "David", "Keira", "Adam", "Karen", "Stella", "Aspen", "Latoya", "Frida", "Peggy", "Chantal" ], "edges": [ [ 0, 4 ], [ 2, 3 ], [ 3, 1 ], [ 4, 7 ], [ 5, 2 ], [ 5, 9 ], [ 7, 6 ], [ 7, 8 ], [ 7, 5 ], [ 10, 14 ], [ 12, 13 ], [ 13, 11 ], [ 14, 17 ], [ 15, 12 ], [ 15, 19 ], [ 17, 16 ], [ 17, 18 ], [ 17, 15 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Roger knows Kit. Jana knows Bruno. Bennett knows Mack. Jana knows Tabitha. Kai knows Dallas. Tamara knows Jana. Jillian knows Harley. Myra knows Luke. Myra knows Herbert. Kendrick knows Lark. Harley knows Myra. John knows Kendrick. John knows Roger. Bruno knows Jonah. Roger knows Jillian. Tamara knows Bennett. Jonah knows Kai. Kai knows Justine. Which of Kai and Myra can John reach?", "answer": "Myra", "steps": [ "John knows Roger.", "Roger knows Jillian.", "Jillian knows Harley.", "Harley knows Myra." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "John", "Harley", "Myra", "Kit", "Herbert", "Roger", "Luke", "Jillian", "Kendrick", "Lark", "Tamara", "Jonah", "Kai", "Tabitha", "Justine", "Jana", "Dallas", "Bruno", "Bennett", "Mack" ], "edges": [ [ 0, 5 ], [ 0, 8 ], [ 1, 2 ], [ 2, 4 ], [ 2, 6 ], [ 5, 3 ], [ 5, 7 ], [ 7, 1 ], [ 8, 9 ], [ 10, 15 ], [ 10, 18 ], [ 11, 12 ], [ 12, 14 ], [ 12, 16 ], [ 15, 13 ], [ 15, 17 ], [ 17, 11 ], [ 18, 19 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "June knows Hattie. Rita knows Daria. Jeanette knows Perry. Beverly knows Jeanette. Rita knows Langston. Alejandro knows Lyle. Susan knows June. Hattie knows Saul. Milo knows Hilda. Verna knows Luz. Alejandro knows Shelly. Lars knows Alejandro. Perry knows Rita. Hilda knows Beverly. Alejandro knows Verna. Emily knows Owen. Saul knows Lars. Rita knows Emily. Which of Verna and Emily can Susan reach?", "answer": "Verna", "steps": [ "Susan knows June.", "June knows Hattie.", "Hattie knows Saul.", "Saul knows Lars.", "Lars knows Alejandro.", "Alejandro knows Verna." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Susan", "Hattie", "Luz", "Alejandro", "Lars", "Shelly", "Lyle", "Verna", "Saul", "June", "Milo", "Beverly", "Owen", "Rita", "Perry", "Daria", "Langston", "Emily", "Jeanette", "Hilda" ], "edges": [ [ 0, 9 ], [ 1, 8 ], [ 3, 5 ], [ 3, 6 ], [ 3, 7 ], [ 4, 3 ], [ 7, 2 ], [ 8, 4 ], [ 9, 1 ], [ 10, 19 ], [ 11, 18 ], [ 13, 15 ], [ 13, 16 ], [ 13, 17 ], [ 14, 13 ], [ 17, 12 ], [ 18, 14 ], [ 19, 11 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Zach knows Jeffery. Magdalena knows Hattie. Myrtle knows Gregory. Myrtle knows Elmer. Goldie knows Electra. Matt knows James. James knows Myrtle. Matt knows Tamara. Clarence knows Deborah. Clarence knows Henrietta. Ernesto knows Clarence. Dave knows Magdalena. Myrtle knows Goldie. Zach knows Ernesto. Ebony knows Leticia. Goldie knows Ebony. Clarence knows Dave. Dave knows Fred. Which of Hattie and Leticia can Matt reach?", "answer": "Leticia", "steps": [ "Matt knows James.", "James knows Myrtle.", "Myrtle knows Goldie.", "Goldie knows Ebony.", "Ebony knows Leticia." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Matt", "Goldie", "James", "Tamara", "Gregory", "Elmer", "Myrtle", "Ebony", "Electra", "Leticia", "Zach", "Dave", "Ernesto", "Jeffery", "Henrietta", "Deborah", "Clarence", "Magdalena", "Fred", "Hattie" ], "edges": [ [ 0, 3 ], [ 0, 2 ], [ 1, 8 ], [ 1, 7 ], [ 2, 6 ], [ 6, 4 ], [ 6, 5 ], [ 6, 1 ], [ 7, 9 ], [ 10, 13 ], [ 10, 12 ], [ 11, 18 ], [ 11, 17 ], [ 12, 16 ], [ 16, 14 ], [ 16, 15 ], [ 16, 11 ], [ 17, 19 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Marshall knows Leopold. Marshall knows Latoya. Oscar knows Marshall. Clayton knows Harry. Henry knows Estelle. Oscar knows Pam. Marshall knows Otto. Graeme knows Devin. Graeme knows Paul. Paul knows Kobe. Harry knows Elliot. Elliot knows Roger. Paul knows Henry. Brock knows Porter. Estelle knows Finn. Finn knows Brock. Latoya knows Clayton. Paul knows Jolene. Which of Clayton and Estelle can Graeme reach?", "answer": "Estelle", "steps": [ "Graeme knows Paul.", "Paul knows Henry.", "Henry knows Estelle." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Graeme", "Brock", "Jolene", "Paul", "Devin", "Finn", "Henry", "Porter", "Kobe", "Estelle", "Oscar", "Elliot", "Otto", "Marshall", "Pam", "Harry", "Latoya", "Roger", "Leopold", "Clayton" ], "edges": [ [ 0, 4 ], [ 0, 3 ], [ 1, 7 ], [ 3, 2 ], [ 3, 8 ], [ 3, 6 ], [ 5, 1 ], [ 6, 9 ], [ 9, 5 ], [ 10, 14 ], [ 10, 13 ], [ 11, 17 ], [ 13, 12 ], [ 13, 18 ], [ 13, 16 ], [ 15, 11 ], [ 16, 19 ], [ 19, 15 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Wendy knows Wade. Jamie knows Wendy. Justine knows Jamie. Lamont knows Nell. Wendy knows Owen. Gail knows Helene. Gail knows Anna. Vera knows Jewel. Arthur knows Lamont. Ivy knows Vera. Owen knows Bernadette. Federico knows Gail. Cecilia knows Jacob. Owen knows Arthur. Helene knows Ivy. Jacob knows Federico. Dahlia knows Justine. Helene knows Kristina. Which of Arthur and Ivy can Dahlia reach?", "answer": "Arthur", "steps": [ "Dahlia knows Justine.", "Justine knows Jamie.", "Jamie knows Wendy.", "Wendy knows Owen.", "Owen knows Arthur." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Dahlia", "Justine", "Lamont", "Bernadette", "Owen", "Wade", "Nell", "Wendy", "Jamie", "Arthur", "Cecilia", "Jacob", "Vera", "Kristina", "Helene", "Anna", "Jewel", "Gail", "Federico", "Ivy" ], "edges": [ [ 0, 1 ], [ 1, 8 ], [ 2, 6 ], [ 4, 3 ], [ 4, 9 ], [ 7, 5 ], [ 7, 4 ], [ 8, 7 ], [ 9, 2 ], [ 10, 11 ], [ 11, 18 ], [ 12, 16 ], [ 14, 13 ], [ 14, 19 ], [ 17, 15 ], [ 17, 14 ], [ 18, 17 ], [ 19, 12 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Jeffery knows Keegan. John knows Dexter. Adrian knows Max. Eugenia knows John. Sarah knows Shelly. Milton knows Crystal. Crystal knows Paula. Max knows Darren. Holly knows Shaun. Keegan knows Gail. Dexter knows Milton. Gail knows Eugenia. Shaun knows Curtis. Darren knows Sarah. Shelly knows Carl. Curtis knows Adrian. Jeffery knows Chelsea. Holly knows Neal. Which of Carl and Paula can Holly reach?", "answer": "Carl", "steps": [ "Holly knows Shaun.", "Shaun knows Curtis.", "Curtis knows Adrian.", "Adrian knows Max.", "Max knows Darren.", "Darren knows Sarah.", "Sarah knows Shelly.", "Shelly knows Carl." ], "difficulty": 8, "original_distance": 8, "idx_to_symbol": [ "Holly", "Adrian", "Shaun", "Carl", "Max", "Shelly", "Curtis", "Darren", "Neal", "Sarah", "Jeffery", "Eugenia", "Keegan", "Paula", "John", "Crystal", "Gail", "Dexter", "Chelsea", "Milton" ], "edges": [ [ 0, 8 ], [ 0, 2 ], [ 1, 4 ], [ 2, 6 ], [ 4, 7 ], [ 5, 3 ], [ 6, 1 ], [ 7, 9 ], [ 9, 5 ], [ 10, 18 ], [ 10, 12 ], [ 11, 14 ], [ 12, 16 ], [ 14, 17 ], [ 15, 13 ], [ 16, 11 ], [ 17, 19 ], [ 19, 15 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Shane knows Molly. Tina knows Shane. Ilene knows Faith. Molly knows Palmer. Cody knows Paul. Ilene knows Eden. Claire knows Mitchell. Roland knows Chantal. Darrell knows Tina. Bert knows Chloe. Cody knows Bert. Eden knows Darrell. Jade knows Claire. Jade knows Martha. Mitchell knows Roland. Molly knows Annie. Chantal knows Cody. Palmer knows Estella. Which of Palmer and Bert can Jade reach?", "answer": "Bert", "steps": [ "Jade knows Claire.", "Claire knows Mitchell.", "Mitchell knows Roland.", "Roland knows Chantal.", "Chantal knows Cody.", "Cody knows Bert." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Jade", "Claire", "Martha", "Mitchell", "Chloe", "Chantal", "Paul", "Bert", "Cody", "Roland", "Ilene", "Eden", "Faith", "Darrell", "Estella", "Shane", "Annie", "Palmer", "Molly", "Tina" ], "edges": [ [ 0, 2 ], [ 0, 1 ], [ 1, 3 ], [ 3, 9 ], [ 5, 8 ], [ 7, 4 ], [ 8, 6 ], [ 8, 7 ], [ 9, 5 ], [ 10, 12 ], [ 10, 11 ], [ 11, 13 ], [ 13, 19 ], [ 15, 18 ], [ 17, 14 ], [ 18, 16 ], [ 18, 17 ], [ 19, 15 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Kaleb knows Clark. Louise knows Joyce. Mindy knows Julius. Malcolm knows Rose. Victor knows Kylie. Renee knows Julio. Lucia knows Lana. Victor knows Cynthia. Brock knows Jane. Joyce knows Mindy. Julio knows Malcolm. Victor knows Brock. Lana knows Gary. Joyce knows Ashton. Joyce knows Kaleb. Louise knows Lucia. Kylie knows Annette. Renee knows Victor. Which of Joyce and Victor can Renee reach?", "answer": "Victor", "steps": [ "Renee knows Victor." ], "difficulty": 1, "original_distance": 3, "idx_to_symbol": [ "Renee", "Cynthia", "Rose", "Jane", "Annette", "Malcolm", "Kylie", "Brock", "Julio", "Victor", "Louise", "Ashton", "Gary", "Julius", "Clark", "Lana", "Kaleb", "Mindy", "Lucia", "Joyce" ], "edges": [ [ 0, 8 ], [ 0, 9 ], [ 5, 2 ], [ 6, 4 ], [ 7, 3 ], [ 8, 5 ], [ 9, 1 ], [ 9, 6 ], [ 9, 7 ], [ 10, 18 ], [ 10, 19 ], [ 15, 12 ], [ 16, 14 ], [ 17, 13 ], [ 18, 15 ], [ 19, 11 ], [ 19, 16 ], [ 19, 17 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Brooks knows Laura. Jon knows Bonnie. James knows Emery. Brad knows Geraldine. Jon knows Brad. Geraldine knows Wyatt. Brad knows Reed. Laura knows Katrina. Reed knows Harlan. Candice knows Aiden. Wyatt knows Brooks. Chad knows Jasmine. Terrence knows Keegan. Keegan knows Chad. Terrence knows Dayton. Keegan knows Candice. Emery knows Helen. Jasmine knows James. Which of Chad and Geraldine can Terrence reach?", "answer": "Chad", "steps": [ "Terrence knows Keegan.", "Keegan knows Chad." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Terrence", "Keegan", "Chad", "James", "Jasmine", "Dayton", "Aiden", "Candice", "Emery", "Helen", "Jon", "Brad", "Geraldine", "Brooks", "Wyatt", "Bonnie", "Harlan", "Reed", "Laura", "Katrina" ], "edges": [ [ 0, 5 ], [ 0, 1 ], [ 1, 7 ], [ 1, 2 ], [ 2, 4 ], [ 3, 8 ], [ 4, 3 ], [ 7, 6 ], [ 8, 9 ], [ 10, 15 ], [ 10, 11 ], [ 11, 17 ], [ 11, 12 ], [ 12, 14 ], [ 13, 18 ], [ 14, 13 ], [ 17, 16 ], [ 18, 19 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Marilyn knows Jewel. Aisha knows Martha. Kirsten knows Federico. Lois knows Everett. Winifred knows Sandra. Everett knows Ruby. Miranda knows Winifred. Alvin knows Patrick. Winifred knows Dave. Gwen knows Brett. Martha knows Gwen. Carrie knows Alvin. Julius knows Lois. Brett knows Marilyn. Dave knows Aisha. Lois knows Frances. Ruby knows Carrie. Patrick knows Kirsten. Which of Martha and Carrie can Julius reach?", "answer": "Carrie", "steps": [ "Julius knows Lois.", "Lois knows Everett.", "Everett knows Ruby.", "Ruby knows Carrie." ], "difficulty": 4, "original_distance": 8, "idx_to_symbol": [ "Julius", "Carrie", "Kirsten", "Federico", "Ruby", "Everett", "Patrick", "Alvin", "Frances", "Lois", "Miranda", "Martha", "Marilyn", "Jewel", "Aisha", "Dave", "Brett", "Gwen", "Sandra", "Winifred" ], "edges": [ [ 0, 9 ], [ 1, 7 ], [ 2, 3 ], [ 4, 1 ], [ 5, 4 ], [ 6, 2 ], [ 7, 6 ], [ 9, 5 ], [ 9, 8 ], [ 10, 19 ], [ 11, 17 ], [ 12, 13 ], [ 14, 11 ], [ 15, 14 ], [ 16, 12 ], [ 17, 16 ], [ 19, 15 ], [ 19, 18 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Lena knows Claire. Houston knows Sean. Forrest knows Houston. Houston knows Janet. Chase knows Naomi. Nolan knows Livia. Sean knows Eric. Livia knows Selena. Livia knows Judith. Judith knows Doug. Houston knows Chase. Judith knows Olive. Sean knows Tabitha. Chase knows Lena. Livia knows Kelly. Selena knows Imogen. Olive knows Liam. Selena knows Stephanie. Which of Houston and Livia can Nolan reach?", "answer": "Livia", "steps": [ "Nolan knows Livia." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Nolan", "Stephanie", "Kelly", "Selena", "Liam", "Livia", "Doug", "Imogen", "Olive", "Judith", "Forrest", "Tabitha", "Janet", "Sean", "Claire", "Houston", "Naomi", "Eric", "Lena", "Chase" ], "edges": [ [ 0, 5 ], [ 3, 1 ], [ 3, 7 ], [ 5, 2 ], [ 5, 3 ], [ 5, 9 ], [ 8, 4 ], [ 9, 6 ], [ 9, 8 ], [ 10, 15 ], [ 13, 11 ], [ 13, 17 ], [ 15, 12 ], [ 15, 13 ], [ 15, 19 ], [ 18, 14 ], [ 19, 16 ], [ 19, 18 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Chase knows Electra. Susanne knows Roger. Felicia knows Chase. Miriam knows Gareth. Roman knows Hannah. Yolanda knows Susanne. Kay knows Bob. Roger knows Carl. Felicia knows Lacey. Laverne knows Felicia. Kay knows Blanche. Roger knows Kay. Hannah knows Yolanda. Roger knows Jeff. Heather knows Laverne. Felicia knows Ruby. Gareth knows Heather. Chase knows Ada. Which of Felicia and Roger can Roman reach?", "answer": "Roger", "steps": [ "Roman knows Hannah.", "Hannah knows Yolanda.", "Yolanda knows Susanne.", "Susanne knows Roger." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Roman", "Bob", "Kay", "Carl", "Blanche", "Yolanda", "Roger", "Jeff", "Susanne", "Hannah", "Miriam", "Electra", "Chase", "Lacey", "Ada", "Heather", "Felicia", "Ruby", "Laverne", "Gareth" ], "edges": [ [ 0, 9 ], [ 2, 1 ], [ 2, 4 ], [ 5, 8 ], [ 6, 3 ], [ 6, 2 ], [ 6, 7 ], [ 8, 6 ], [ 9, 5 ], [ 10, 19 ], [ 12, 11 ], [ 12, 14 ], [ 15, 18 ], [ 16, 13 ], [ 16, 12 ], [ 16, 17 ], [ 18, 16 ], [ 19, 15 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "India knows Marc. Brock knows India. Damien knows Wesley. Irving knows Veronica. Vanessa knows Desmond. Irving knows Damien. Joyce knows Gina. Callum knows Luz. Luz knows Malik. Damien knows Brock. India knows Deirdre. Callum knows Ada. Damien knows Joyce. Luz knows Morgan. Vanessa knows Courtney. Malik knows Jade. Amber knows Vanessa. Luz knows Amber. Which of Deirdre and Courtney can Irving reach?", "answer": "Deirdre", "steps": [ "Irving knows Damien.", "Damien knows Brock.", "Brock knows India.", "India knows Deirdre." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Irving", "Deirdre", "Wesley", "Veronica", "Gina", "Damien", "Joyce", "India", "Brock", "Marc", "Callum", "Courtney", "Morgan", "Ada", "Jade", "Luz", "Malik", "Vanessa", "Amber", "Desmond" ], "edges": [ [ 0, 3 ], [ 0, 5 ], [ 5, 2 ], [ 5, 6 ], [ 5, 8 ], [ 6, 4 ], [ 7, 1 ], [ 7, 9 ], [ 8, 7 ], [ 10, 13 ], [ 10, 15 ], [ 15, 12 ], [ 15, 16 ], [ 15, 18 ], [ 16, 14 ], [ 17, 11 ], [ 17, 19 ], [ 18, 17 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Sandy knows Darin. Howard knows Boyd. Felicia knows Wilbur. Glenda knows Sandy. Boyd knows Nell. Audrey knows Mia. Wayne knows Howard. Howard knows Donna. Drake knows Earl. Felicia knows Goldie. Howard knows Jean. Nell knows Dexter. Felicia knows Elijah. Hannah knows Drake. Mia knows Glenda. Dexter knows Hannah. Farrah knows Felicia. Goldie knows Audrey. Which of Glenda and Hannah can Farrah reach?", "answer": "Glenda", "steps": [ "Farrah knows Felicia.", "Felicia knows Goldie.", "Goldie knows Audrey.", "Audrey knows Mia.", "Mia knows Glenda." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Farrah", "Darin", "Audrey", "Elijah", "Goldie", "Wilbur", "Glenda", "Sandy", "Felicia", "Mia", "Wayne", "Earl", "Nell", "Jean", "Boyd", "Donna", "Hannah", "Drake", "Howard", "Dexter" ], "edges": [ [ 0, 8 ], [ 2, 9 ], [ 4, 2 ], [ 6, 7 ], [ 7, 1 ], [ 8, 3 ], [ 8, 5 ], [ 8, 4 ], [ 9, 6 ], [ 10, 18 ], [ 12, 19 ], [ 14, 12 ], [ 16, 17 ], [ 17, 11 ], [ 18, 13 ], [ 18, 15 ], [ 18, 14 ], [ 19, 16 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Laurel knows Zach. Zelda knows Clifford. Celia knows Atlas. Guy knows Celia. Russell knows Grady. Laurel knows Guy. Casey knows Keaton. Laurel knows Franklin. Dwight knows Tom. Keaton knows Daphna. Tom knows Russell. Imogen knows Jenny. Aaron knows Laurel. Daphna knows Aaron. Luna knows Imogen. Grady knows Zelda. Zelda knows Luna. Zelda knows Cornelius. Which of Imogen and Celia can Dwight reach?", "answer": "Imogen", "steps": [ "Dwight knows Tom.", "Tom knows Russell.", "Russell knows Grady.", "Grady knows Zelda.", "Zelda knows Luna.", "Luna knows Imogen." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Dwight", "Grady", "Jenny", "Zelda", "Clifford", "Luna", "Russell", "Imogen", "Tom", "Cornelius", "Casey", "Aaron", "Atlas", "Laurel", "Zach", "Guy", "Daphna", "Celia", "Keaton", "Franklin" ], "edges": [ [ 0, 8 ], [ 1, 3 ], [ 3, 4 ], [ 3, 5 ], [ 3, 9 ], [ 5, 7 ], [ 6, 1 ], [ 7, 2 ], [ 8, 6 ], [ 10, 18 ], [ 11, 13 ], [ 13, 14 ], [ 13, 15 ], [ 13, 19 ], [ 15, 17 ], [ 16, 11 ], [ 17, 12 ], [ 18, 16 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Bryan knows Dennis. Peter knows Morgan. Bryan knows Susan. Fred knows Lawson. Peter knows Fred. Morgan knows Cecilia. Percy knows Thea. Nolan knows Willard. Estelle knows Peter. Willard knows Kurt. Percy knows Lamar. Lamar knows Bryan. Raquel knows Percy. Willard knows Estelle. Kurt knows Lennox. Thea knows Malik. Susan knows Claudia. Dennis knows Albert. Which of Cecilia and Albert can Nolan reach?", "answer": "Cecilia", "steps": [ "Nolan knows Willard.", "Willard knows Estelle.", "Estelle knows Peter.", "Peter knows Morgan.", "Morgan knows Cecilia." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Nolan", "Peter", "Lennox", "Kurt", "Cecilia", "Estelle", "Fred", "Morgan", "Lawson", "Willard", "Raquel", "Bryan", "Malik", "Thea", "Albert", "Lamar", "Susan", "Dennis", "Claudia", "Percy" ], "edges": [ [ 0, 9 ], [ 1, 7 ], [ 1, 6 ], [ 3, 2 ], [ 5, 1 ], [ 6, 8 ], [ 7, 4 ], [ 9, 3 ], [ 9, 5 ], [ 10, 19 ], [ 11, 17 ], [ 11, 16 ], [ 13, 12 ], [ 15, 11 ], [ 16, 18 ], [ 17, 14 ], [ 19, 13 ], [ 19, 15 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Darwin knows Stella. Sebastian knows Michael. Donna knows Shannon. Lenora knows Brynn. Kit knows Alejandro. Kit knows Lenora. Bailey knows Jewel. Lenora knows Esther. Donna knows Fisher. Bailey knows Ernesto. Donna knows Duncan. Darwin knows Maude. Lenora knows Tina. Sebastian knows Darwin. Bailey knows Ray. Ernesto knows Sebastian. Shannon knows Kit. Darwin knows Foster. Which of Ernesto and Shannon can Donna reach?", "answer": "Shannon", "steps": [ "Donna knows Shannon." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Donna", "Fisher", "Lenora", "Tina", "Esther", "Brynn", "Shannon", "Alejandro", "Kit", "Duncan", "Bailey", "Ray", "Darwin", "Stella", "Maude", "Foster", "Ernesto", "Michael", "Sebastian", "Jewel" ], "edges": [ [ 0, 1 ], [ 0, 6 ], [ 0, 9 ], [ 2, 3 ], [ 2, 4 ], [ 2, 5 ], [ 6, 8 ], [ 8, 2 ], [ 8, 7 ], [ 10, 11 ], [ 10, 16 ], [ 10, 19 ], [ 12, 13 ], [ 12, 14 ], [ 12, 15 ], [ 16, 18 ], [ 18, 12 ], [ 18, 17 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Leah knows Darius. Pam knows Ethan. Ethan knows Russell. Brock knows Maria. Frances knows Brock. Paula knows Garland. Darius knows Frances. Darius knows Anthony. Anthony knows Abby. Ethan knows Miranda. Ethan knows Sandy. Brock knows Riley. Garland knows Ray. Brock knows Chad. Garland knows Pam. Ray knows Dolores. Darius knows Miles. Garland knows Jude. Which of Garland and Darius can Leah reach?", "answer": "Darius", "steps": [ "Leah knows Darius." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Leah", "Darius", "Chad", "Riley", "Anthony", "Frances", "Abby", "Maria", "Miles", "Brock", "Paula", "Garland", "Sandy", "Miranda", "Ray", "Pam", "Dolores", "Russell", "Jude", "Ethan" ], "edges": [ [ 0, 1 ], [ 1, 4 ], [ 1, 8 ], [ 1, 5 ], [ 4, 6 ], [ 5, 9 ], [ 9, 2 ], [ 9, 3 ], [ 9, 7 ], [ 10, 11 ], [ 11, 14 ], [ 11, 18 ], [ 11, 15 ], [ 14, 16 ], [ 15, 19 ], [ 19, 12 ], [ 19, 13 ], [ 19, 17 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Leander knows Harlan. Wilson knows Hal. Sally knows Flora. Flora knows Barbara. Chloe knows Janet. Atlas knows Vernon. Chloe knows Nina. Nina knows Dexter. Eva knows Leander. Wilson knows Sally. Wilson knows Vicki. Barbara knows Courtney. Dexter knows Clark. Clark knows Eva. Sally knows Giselle. Courtney knows Atlas. Nina knows Paige. Chloe knows Irving. Which of Harlan and Vernon can Wilson reach?", "answer": "Vernon", "steps": [ "Wilson knows Sally.", "Sally knows Flora.", "Flora knows Barbara.", "Barbara knows Courtney.", "Courtney knows Atlas.", "Atlas knows Vernon." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Wilson", "Hal", "Sally", "Giselle", "Vernon", "Barbara", "Atlas", "Vicki", "Courtney", "Flora", "Chloe", "Irving", "Nina", "Paige", "Harlan", "Clark", "Leander", "Janet", "Eva", "Dexter" ], "edges": [ [ 0, 1 ], [ 0, 7 ], [ 0, 2 ], [ 2, 3 ], [ 2, 9 ], [ 5, 8 ], [ 6, 4 ], [ 8, 6 ], [ 9, 5 ], [ 10, 11 ], [ 10, 17 ], [ 10, 12 ], [ 12, 13 ], [ 12, 19 ], [ 15, 18 ], [ 16, 14 ], [ 18, 16 ], [ 19, 15 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Jennifer knows Gerald. Amber knows Leah. Amber knows Jennifer. Fleur knows Lee. Anita knows Amanda. Laurel knows Tonya. Sydney knows Erwin. Max knows Amber. Bonnie knows Wilson. Anita knows Sydney. Leah knows Fleur. Arden knows Laurel. Lee knows Joaquin. Gerald knows Cody. Max knows Kristin. Sydney knows Dominic. Erwin knows Bonnie. Dominic knows Arden. Which of Lee and Laurel can Max reach?", "answer": "Lee", "steps": [ "Max knows Amber.", "Amber knows Leah.", "Leah knows Fleur.", "Fleur knows Lee." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Max", "Cody", "Jennifer", "Joaquin", "Lee", "Kristin", "Fleur", "Gerald", "Amber", "Leah", "Anita", "Wilson", "Erwin", "Tonya", "Laurel", "Amanda", "Arden", "Bonnie", "Sydney", "Dominic" ], "edges": [ [ 0, 5 ], [ 0, 8 ], [ 2, 7 ], [ 4, 3 ], [ 6, 4 ], [ 7, 1 ], [ 8, 2 ], [ 8, 9 ], [ 9, 6 ], [ 10, 15 ], [ 10, 18 ], [ 12, 17 ], [ 14, 13 ], [ 16, 14 ], [ 17, 11 ], [ 18, 12 ], [ 18, 19 ], [ 19, 16 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Hugh knows Amy. Virginia knows Claudia. Max knows Homer. Homer knows Pat. Claudia knows Stephen. Ella knows Hugh. Amy knows Lily. Kit knows William. Edison knows Allan. Max knows Randall. Randall knows Edison. Claudia knows Ella. Lily knows Bernice. Kit knows Hannah. Maria knows Kit. Bob knows Holden. Hugh knows Bob. Hannah knows Max. Which of Allan and Bernice can Virginia reach?", "answer": "Bernice", "steps": [ "Virginia knows Claudia.", "Claudia knows Ella.", "Ella knows Hugh.", "Hugh knows Amy.", "Amy knows Lily.", "Lily knows Bernice." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Virginia", "Ella", "Claudia", "Amy", "Holden", "Bernice", "Hugh", "Bob", "Stephen", "Lily", "Maria", "Hannah", "Kit", "Randall", "Pat", "Allan", "Max", "Homer", "William", "Edison" ], "edges": [ [ 0, 2 ], [ 1, 6 ], [ 2, 8 ], [ 2, 1 ], [ 3, 9 ], [ 6, 7 ], [ 6, 3 ], [ 7, 4 ], [ 9, 5 ], [ 10, 12 ], [ 11, 16 ], [ 12, 18 ], [ 12, 11 ], [ 13, 19 ], [ 16, 17 ], [ 16, 13 ], [ 17, 14 ], [ 19, 15 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Bruce knows Merle. Glenda knows Ricardo. Kimberly knows Chester. Everett knows Esme. Bruce knows Geraldine. Glenda knows Claire. Ricardo knows Nolan. Lucas knows Kimberly. Nolan knows Ken. Everett knows Riley. Louis knows Trevor. Esme knows Louis. Geraldine knows Lucas. Joaquin knows Dorian. Joaquin knows Gideon. Geraldine knows Beth. Nolan knows Everett. Gideon knows Bruce. Which of Kimberly and Louis can Joaquin reach?", "answer": "Kimberly", "steps": [ "Joaquin knows Gideon.", "Gideon knows Bruce.", "Bruce knows Geraldine.", "Geraldine knows Lucas.", "Lucas knows Kimberly." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Joaquin", "Chester", "Dorian", "Lucas", "Gideon", "Bruce", "Kimberly", "Beth", "Merle", "Geraldine", "Glenda", "Trevor", "Claire", "Esme", "Ricardo", "Nolan", "Louis", "Riley", "Ken", "Everett" ], "edges": [ [ 0, 2 ], [ 0, 4 ], [ 3, 6 ], [ 4, 5 ], [ 5, 8 ], [ 5, 9 ], [ 6, 1 ], [ 9, 3 ], [ 9, 7 ], [ 10, 12 ], [ 10, 14 ], [ 13, 16 ], [ 14, 15 ], [ 15, 18 ], [ 15, 19 ], [ 16, 11 ], [ 19, 13 ], [ 19, 17 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Jennifer knows Gerald. Amber knows Leah. Amber knows Jennifer. Fleur knows Lee. Anita knows Amanda. Laurel knows Tonya. Sydney knows Erwin. Max knows Amber. Bonnie knows Wilson. Anita knows Sydney. Leah knows Fleur. Arden knows Laurel. Lee knows Joaquin. Gerald knows Cody. Max knows Kristin. Sydney knows Dominic. Erwin knows Bonnie. Dominic knows Arden. Which of Fleur and Arden can Max reach?", "answer": "Fleur", "steps": [ "Max knows Amber.", "Amber knows Leah.", "Leah knows Fleur." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Max", "Cody", "Jennifer", "Joaquin", "Lee", "Kristin", "Fleur", "Gerald", "Amber", "Leah", "Anita", "Wilson", "Erwin", "Tonya", "Laurel", "Amanda", "Arden", "Bonnie", "Sydney", "Dominic" ], "edges": [ [ 0, 5 ], [ 0, 8 ], [ 2, 7 ], [ 4, 3 ], [ 6, 4 ], [ 7, 1 ], [ 8, 2 ], [ 8, 9 ], [ 9, 6 ], [ 10, 15 ], [ 10, 18 ], [ 12, 17 ], [ 14, 13 ], [ 16, 14 ], [ 17, 11 ], [ 18, 12 ], [ 18, 19 ], [ 19, 16 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Kendrick knows Knox. Iris knows Clark. Clark knows Perry. Dewey knows Monica. Jeff knows Brenda. Clark knows Jeff. Anthony knows Francesca. Heidi knows Anthony. Sybil knows Jon. Heidi knows Clayton. Josie knows Kendrick. Dewey knows Chantal. Clark knows Heidi. Alicia knows Iris. Andre knows Josie. Kendrick knows Dewey. Kendrick knows Sybil. Monica knows Blair. Which of Kendrick and Clark can Andre reach?", "answer": "Kendrick", "steps": [ "Andre knows Josie.", "Josie knows Kendrick." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Andre", "Chantal", "Knox", "Sybil", "Monica", "Josie", "Blair", "Jon", "Dewey", "Kendrick", "Alicia", "Clayton", "Perry", "Jeff", "Anthony", "Iris", "Francesca", "Brenda", "Heidi", "Clark" ], "edges": [ [ 0, 5 ], [ 3, 7 ], [ 4, 6 ], [ 5, 9 ], [ 8, 1 ], [ 8, 4 ], [ 9, 2 ], [ 9, 3 ], [ 9, 8 ], [ 10, 15 ], [ 13, 17 ], [ 14, 16 ], [ 15, 19 ], [ 18, 11 ], [ 18, 14 ], [ 19, 12 ], [ 19, 13 ], [ 19, 18 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Aspen knows Ian. Marvin knows Walt. Dayton knows Vivian. Winifred knows Lola. Sheryl knows Beth. Vivian knows Sara. Sonia knows Arnold. Sara knows Molly. Molly knows Roman. Roman knows Aiden. Dayton knows Aspen. Stephen knows Sonia. Vivian knows Edmund. Sonia knows Winifred. Ian knows Joanna. Beth knows Wayne. Stephen knows Sheryl. Lola knows Marvin. Which of Walt and Aiden can Dayton reach?", "answer": "Aiden", "steps": [ "Dayton knows Vivian.", "Vivian knows Sara.", "Sara knows Molly.", "Molly knows Roman.", "Roman knows Aiden." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Dayton", "Ian", "Aiden", "Sara", "Joanna", "Aspen", "Vivian", "Roman", "Edmund", "Molly", "Stephen", "Beth", "Walt", "Winifred", "Wayne", "Sheryl", "Sonia", "Marvin", "Arnold", "Lola" ], "edges": [ [ 0, 5 ], [ 0, 6 ], [ 1, 4 ], [ 3, 9 ], [ 5, 1 ], [ 6, 8 ], [ 6, 3 ], [ 7, 2 ], [ 9, 7 ], [ 10, 15 ], [ 10, 16 ], [ 11, 14 ], [ 13, 19 ], [ 15, 11 ], [ 16, 18 ], [ 16, 13 ], [ 17, 12 ], [ 19, 17 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "India knows Marc. Brock knows India. Damien knows Wesley. Irving knows Veronica. Vanessa knows Desmond. Irving knows Damien. Joyce knows Gina. Callum knows Luz. Luz knows Malik. Damien knows Brock. India knows Deirdre. Callum knows Ada. Damien knows Joyce. Luz knows Morgan. Vanessa knows Courtney. Malik knows Jade. Amber knows Vanessa. Luz knows Amber. Which of India and Vanessa can Irving reach?", "answer": "India", "steps": [ "Irving knows Damien.", "Damien knows Brock.", "Brock knows India." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Irving", "Deirdre", "Wesley", "Veronica", "Gina", "Damien", "Joyce", "India", "Brock", "Marc", "Callum", "Courtney", "Morgan", "Ada", "Jade", "Luz", "Malik", "Vanessa", "Amber", "Desmond" ], "edges": [ [ 0, 3 ], [ 0, 5 ], [ 5, 2 ], [ 5, 6 ], [ 5, 8 ], [ 6, 4 ], [ 7, 1 ], [ 7, 9 ], [ 8, 7 ], [ 10, 13 ], [ 10, 15 ], [ 15, 12 ], [ 15, 16 ], [ 15, 18 ], [ 16, 14 ], [ 17, 11 ], [ 17, 19 ], [ 18, 17 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Alexa knows Knox. Randall knows Nolan. Blaine knows Barbara. Allen knows Terry. Felicia knows Blaine. Randall knows Alana. Felicia knows Jarvis. Lily knows Elliot. Lily knows Teresa. Elliot knows Margaret. Edna knows Lily. Lamar knows Felicia. Nolan knows Palmer. Allen knows Lawson. Lawson knows Alexa. Elliot knows Randall. Palmer knows Paul. Blaine knows Allen. Which of Lawson and Nolan can Lamar reach?", "answer": "Lawson", "steps": [ "Lamar knows Felicia.", "Felicia knows Blaine.", "Blaine knows Allen.", "Allen knows Lawson." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Lamar", "Knox", "Alexa", "Blaine", "Felicia", "Terry", "Allen", "Lawson", "Jarvis", "Barbara", "Edna", "Paul", "Palmer", "Elliot", "Lily", "Alana", "Randall", "Nolan", "Teresa", "Margaret" ], "edges": [ [ 0, 4 ], [ 2, 1 ], [ 3, 6 ], [ 3, 9 ], [ 4, 8 ], [ 4, 3 ], [ 6, 5 ], [ 6, 7 ], [ 7, 2 ], [ 10, 14 ], [ 12, 11 ], [ 13, 16 ], [ 13, 19 ], [ 14, 18 ], [ 14, 13 ], [ 16, 15 ], [ 16, 17 ], [ 17, 12 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Lamont knows Dakota. Arturo knows Lamont. Herman knows Deanna. Herman knows Kieran. Hattie knows Selena. Seth knows Kelsey. Alfonso knows Hattie. Virginia knows Keith. Arturo knows Seth. Virginia knows Edison. Hattie knows Jacqueline. Jacqueline knows Violet. Lamont knows Virginia. Selena knows Gertrude. Lena knows Hamilton. Jacqueline knows Herman. Hamilton knows Arturo. Stacy knows Alfonso. Which of Herman and Virginia can Stacy reach?", "answer": "Herman", "steps": [ "Stacy knows Alfonso.", "Alfonso knows Hattie.", "Hattie knows Jacqueline.", "Jacqueline knows Herman." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Stacy", "Herman", "Selena", "Jacqueline", "Violet", "Deanna", "Alfonso", "Kieran", "Hattie", "Gertrude", "Lena", "Virginia", "Seth", "Lamont", "Dakota", "Edison", "Hamilton", "Keith", "Arturo", "Kelsey" ], "edges": [ [ 0, 6 ], [ 1, 5 ], [ 1, 7 ], [ 2, 9 ], [ 3, 4 ], [ 3, 1 ], [ 6, 8 ], [ 8, 3 ], [ 8, 2 ], [ 10, 16 ], [ 11, 15 ], [ 11, 17 ], [ 12, 19 ], [ 13, 14 ], [ 13, 11 ], [ 16, 18 ], [ 18, 13 ], [ 18, 12 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Lucia knows Melody. Celia knows Willard. Melody knows Kareem. Eunice knows Edmund. Jeff knows Winston. Eunice knows Marilyn. Eunice knows Conrad. Cordelia knows Celia. Conrad knows Lucia. Kareem knows Alex. Malcolm knows Chance. Winston knows Charlotte. Edmund knows Malcolm. Leah knows Jeff. Judy knows Cordelia. Willard knows Arden. Leah knows Marcus. Leah knows Judy. Which of Alex and Arden can Leah reach?", "answer": "Arden", "steps": [ "Leah knows Judy.", "Judy knows Cordelia.", "Cordelia knows Celia.", "Celia knows Willard.", "Willard knows Arden." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Leah", "Jeff", "Winston", "Charlotte", "Marcus", "Judy", "Willard", "Cordelia", "Arden", "Celia", "Eunice", "Edmund", "Malcolm", "Chance", "Marilyn", "Conrad", "Kareem", "Lucia", "Alex", "Melody" ], "edges": [ [ 0, 1 ], [ 0, 4 ], [ 0, 5 ], [ 1, 2 ], [ 2, 3 ], [ 5, 7 ], [ 6, 8 ], [ 7, 9 ], [ 9, 6 ], [ 10, 11 ], [ 10, 14 ], [ 10, 15 ], [ 11, 12 ], [ 12, 13 ], [ 15, 17 ], [ 16, 18 ], [ 17, 19 ], [ 19, 16 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Becky knows Cole. Jermaine knows Gwen. Cole knows Jamie. Gwen knows Jeanne. Jeanne knows Whitney. Isadora knows Alex. Irma knows Isadora. Jared knows Levi. Hector knows Darius. Becky knows Selena. Jermaine knows Irma. Alex knows Cynthia. Selena knows Hector. Jared knows Eamon. Jamie knows Jared. Whitney knows Grover. Darius knows Ellen. Whitney knows Leah. Which of Eamon and Grover can Jermaine reach?", "answer": "Grover", "steps": [ "Jermaine knows Gwen.", "Gwen knows Jeanne.", "Jeanne knows Whitney.", "Whitney knows Grover." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Jermaine", "Gwen", "Cynthia", "Grover", "Jeanne", "Isadora", "Alex", "Whitney", "Leah", "Irma", "Becky", "Cole", "Ellen", "Eamon", "Jamie", "Hector", "Darius", "Jared", "Levi", "Selena" ], "edges": [ [ 0, 1 ], [ 0, 9 ], [ 1, 4 ], [ 4, 7 ], [ 5, 6 ], [ 6, 2 ], [ 7, 3 ], [ 7, 8 ], [ 9, 5 ], [ 10, 11 ], [ 10, 19 ], [ 11, 14 ], [ 14, 17 ], [ 15, 16 ], [ 16, 12 ], [ 17, 13 ], [ 17, 18 ], [ 19, 15 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Pierce knows Graham. Louisa knows Victor. Kim knows Sheila. Victor knows Lewis. Tina knows Ford. Lennox knows Jenna. Gabriel knows Carla. Jem knows Marco. Carla knows Merle. Ford knows Edmund. Hudson knows Kim. Pierce knows Tina. Carla knows Judith. Victor knows Hudson. Marco knows Lennox. Kim knows Jem. Merle knows Pierce. Edmund knows Leigh. Which of Tina and Jem can Gabriel reach?", "answer": "Tina", "steps": [ "Gabriel knows Carla.", "Carla knows Merle.", "Merle knows Pierce.", "Pierce knows Tina." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Gabriel", "Graham", "Edmund", "Tina", "Pierce", "Carla", "Ford", "Merle", "Leigh", "Judith", "Louisa", "Sheila", "Lennox", "Jem", "Kim", "Victor", "Marco", "Hudson", "Jenna", "Lewis" ], "edges": [ [ 0, 5 ], [ 2, 8 ], [ 3, 6 ], [ 4, 1 ], [ 4, 3 ], [ 5, 7 ], [ 5, 9 ], [ 6, 2 ], [ 7, 4 ], [ 10, 15 ], [ 12, 18 ], [ 13, 16 ], [ 14, 11 ], [ 14, 13 ], [ 15, 17 ], [ 15, 19 ], [ 16, 12 ], [ 17, 14 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Gage knows Bart. Boyd knows Bernice. Simon knows Pedro. Jordan knows Beau. Leopold knows Darrell. Erwin knows Nathan. Bernice knows Gonzalo. Bernice knows Bonnie. Frankie knows Boyd. Francesca knows Jermaine. Bart knows Erwin. Leopold knows Gage. Bart knows Damien. Bernice knows Hattie. Beau knows Leopold. Leopold knows Kay. Francesca knows Simon. Hattie knows Francesca. Which of Boyd and Beau can Frankie reach?", "answer": "Boyd", "steps": [ "Frankie knows Boyd." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Frankie", "Jermaine", "Pedro", "Hattie", "Boyd", "Simon", "Francesca", "Bernice", "Bonnie", "Gonzalo", "Jordan", "Damien", "Nathan", "Gage", "Beau", "Erwin", "Bart", "Leopold", "Kay", "Darrell" ], "edges": [ [ 0, 4 ], [ 3, 6 ], [ 4, 7 ], [ 5, 2 ], [ 6, 1 ], [ 6, 5 ], [ 7, 3 ], [ 7, 8 ], [ 7, 9 ], [ 10, 14 ], [ 13, 16 ], [ 14, 17 ], [ 15, 12 ], [ 16, 11 ], [ 16, 15 ], [ 17, 13 ], [ 17, 18 ], [ 17, 19 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Jade knows Mara. Garrett knows Logan. Larry knows Desmond. Mara knows Roy. Marie knows Kira. Keegan knows Gail. Keegan knows Hunter. Laverne knows Keegan. Gail knows Neal. Jeffery knows Annie. Hattie knows Marie. Jeffery knows Larry. Drew knows Laverne. Logan knows Susanne. Drew knows Garrett. Marie knows Jade. Kira knows Jeffery. Sharon knows Drew. Which of Kira and Laverne can Sharon reach?", "answer": "Laverne", "steps": [ "Sharon knows Drew.", "Drew knows Laverne." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Sharon", "Drew", "Laverne", "Hunter", "Gail", "Neal", "Garrett", "Keegan", "Susanne", "Logan", "Hattie", "Marie", "Kira", "Annie", "Larry", "Desmond", "Jade", "Jeffery", "Roy", "Mara" ], "edges": [ [ 0, 1 ], [ 1, 2 ], [ 1, 6 ], [ 2, 7 ], [ 4, 5 ], [ 6, 9 ], [ 7, 3 ], [ 7, 4 ], [ 9, 8 ], [ 10, 11 ], [ 11, 12 ], [ 11, 16 ], [ 12, 17 ], [ 14, 15 ], [ 16, 19 ], [ 17, 13 ], [ 17, 14 ], [ 19, 18 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Lewis knows Destiny. Harmony knows Audrey. Sebastian knows Effie. Destiny knows Leo. Devon knows Janice. Sarah knows Shannon. Shannon knows Hailey. Vicki knows Harmony. Leo knows Rita. Effie knows Jean. Michelle knows Sebastian. Effie knows Alma. Audrey knows Maria. Harmony knows Arturo. Destiny knows Vicki. Leo knows Wendy. Shannon knows Devon. Sebastian knows Sarah. Which of Shannon and Harmony can Michelle reach?", "answer": "Shannon", "steps": [ "Michelle knows Sebastian.", "Sebastian knows Sarah.", "Sarah knows Shannon." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Michelle", "Sebastian", "Shannon", "Sarah", "Effie", "Jean", "Alma", "Hailey", "Janice", "Devon", "Lewis", "Destiny", "Harmony", "Vicki", "Leo", "Wendy", "Rita", "Arturo", "Maria", "Audrey" ], "edges": [ [ 0, 1 ], [ 1, 4 ], [ 1, 3 ], [ 2, 7 ], [ 2, 9 ], [ 3, 2 ], [ 4, 5 ], [ 4, 6 ], [ 9, 8 ], [ 10, 11 ], [ 11, 14 ], [ 11, 13 ], [ 12, 17 ], [ 12, 19 ], [ 13, 12 ], [ 14, 15 ], [ 14, 16 ], [ 19, 18 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Chad knows Tristan. Tristan knows Carlos. Tristan knows Ellis. Damian knows Oliver. Oliver knows Valerie. Flora knows Camille. Leander knows Damian. Ellis knows Ira. Ellis knows Tonya. Quinn knows Jacob. Christopher knows Dwight. Oliver knows Christopher. Alyssa knows Chad. Marlene knows Alyssa. Quinn knows Leander. Christopher knows Flora. Marlene knows Marco. Ira knows Willis. Which of Christopher and Ellis can Marlene reach?", "answer": "Ellis", "steps": [ "Marlene knows Alyssa.", "Alyssa knows Chad.", "Chad knows Tristan.", "Tristan knows Ellis." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Marlene", "Chad", "Ellis", "Willis", "Carlos", "Tristan", "Alyssa", "Marco", "Ira", "Tonya", "Quinn", "Damian", "Christopher", "Camille", "Valerie", "Oliver", "Leander", "Jacob", "Flora", "Dwight" ], "edges": [ [ 0, 7 ], [ 0, 6 ], [ 1, 5 ], [ 2, 8 ], [ 2, 9 ], [ 5, 4 ], [ 5, 2 ], [ 6, 1 ], [ 8, 3 ], [ 10, 17 ], [ 10, 16 ], [ 11, 15 ], [ 12, 18 ], [ 12, 19 ], [ 15, 14 ], [ 15, 12 ], [ 16, 11 ], [ 18, 13 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Felicia knows Nell. Yara knows Gilbert. Luella knows Edwin. Dora knows Ellis. Luella knows Catherine. Felicia knows Rachel. Gilbert knows Sadie. Hannah knows Dora. Crystal knows Luella. Catherine knows Marcus. Catherine knows Hannah. Cordelia knows Joel. Marcus knows Edmund. Nell knows Miriam. Crystal knows Kristina. Cordelia knows Felicia. Nell knows Yara. Miriam knows Eleanor. Which of Gilbert and Dora can Cordelia reach?", "answer": "Gilbert", "steps": [ "Cordelia knows Felicia.", "Felicia knows Nell.", "Nell knows Yara.", "Yara knows Gilbert." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Cordelia", "Eleanor", "Gilbert", "Joel", "Sadie", "Felicia", "Yara", "Nell", "Rachel", "Miriam", "Crystal", "Edmund", "Dora", "Kristina", "Ellis", "Luella", "Hannah", "Catherine", "Edwin", "Marcus" ], "edges": [ [ 0, 3 ], [ 0, 5 ], [ 2, 4 ], [ 5, 8 ], [ 5, 7 ], [ 6, 2 ], [ 7, 6 ], [ 7, 9 ], [ 9, 1 ], [ 10, 13 ], [ 10, 15 ], [ 12, 14 ], [ 15, 18 ], [ 15, 17 ], [ 16, 12 ], [ 17, 16 ], [ 17, 19 ], [ 19, 11 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Sadie knows Brynn. Marco knows Eve. Haley knows Sadie. Stefan knows Dee. Valerie knows Bonnie. Morris knows Susanne. Bonnie knows Elvira. Amy knows Jodi. Cameron knows Amy. Cordelia knows Haley. Dee knows Eli. Sadie knows Deborah. Fergus knows Zachary. Amy knows Stefan. Marco knows Cameron. Deborah knows Morris. Zachary knows Marco. Morris knows Valerie. Which of Deborah and Cameron can Cordelia reach?", "answer": "Deborah", "steps": [ "Cordelia knows Haley.", "Haley knows Sadie.", "Sadie knows Deborah." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Cordelia", "Elvira", "Brynn", "Susanne", "Sadie", "Valerie", "Morris", "Bonnie", "Haley", "Deborah", "Fergus", "Eli", "Eve", "Jodi", "Marco", "Stefan", "Amy", "Dee", "Zachary", "Cameron" ], "edges": [ [ 0, 8 ], [ 4, 2 ], [ 4, 9 ], [ 5, 7 ], [ 6, 3 ], [ 6, 5 ], [ 7, 1 ], [ 8, 4 ], [ 9, 6 ], [ 10, 18 ], [ 14, 12 ], [ 14, 19 ], [ 15, 17 ], [ 16, 13 ], [ 16, 15 ], [ 17, 11 ], [ 18, 14 ], [ 19, 16 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Lara knows Hardy. Kathleen knows Oliver. Margaret knows Khashayar. Reid knows Ignacio. Hardy knows Reid. Mitchell knows Ava. Ignacio knows Damien. Margaret knows Pedro. Donna knows Arthur. Oliver knows Ruth. Arthur knows Fritz. Ignacio knows Kieran. Reid knows Valerie. Ruth knows Donna. Ruth knows Margaret. Pedro knows Dean. Damien knows Tabitha. Valerie knows Mitchell. Which of Reid and Ruth can Lara reach?", "answer": "Reid", "steps": [ "Lara knows Hardy.", "Hardy knows Reid." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Lara", "Valerie", "Mitchell", "Hardy", "Kieran", "Ignacio", "Reid", "Damien", "Ava", "Tabitha", "Kathleen", "Donna", "Arthur", "Oliver", "Khashayar", "Margaret", "Ruth", "Pedro", "Fritz", "Dean" ], "edges": [ [ 0, 3 ], [ 1, 2 ], [ 2, 8 ], [ 3, 6 ], [ 5, 4 ], [ 5, 7 ], [ 6, 1 ], [ 6, 5 ], [ 7, 9 ], [ 10, 13 ], [ 11, 12 ], [ 12, 18 ], [ 13, 16 ], [ 15, 14 ], [ 15, 17 ], [ 16, 11 ], [ 16, 15 ], [ 17, 19 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Fred knows Erwin. Irma knows Avery. Verna knows Thomas. Fred knows Verna. Steve knows Bruce. Jonathan knows Steve. Leticia knows Declan. Violet knows Inez. Steve knows Ella. Bruce knows Lloyd. Viola knows Wendy. Fanny knows Jonathan. Verna knows Viola. Preston knows Don. Steve knows Leticia. Bruce knows Violet. Fred knows Irma. Don knows Fred. Which of Jonathan and Don can Preston reach?", "answer": "Don", "steps": [ "Preston knows Don." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Preston", "Erwin", "Avery", "Don", "Verna", "Fred", "Viola", "Wendy", "Irma", "Thomas", "Fanny", "Ella", "Declan", "Jonathan", "Bruce", "Steve", "Violet", "Inez", "Leticia", "Lloyd" ], "edges": [ [ 0, 3 ], [ 3, 5 ], [ 4, 6 ], [ 4, 9 ], [ 5, 1 ], [ 5, 8 ], [ 5, 4 ], [ 6, 7 ], [ 8, 2 ], [ 10, 13 ], [ 13, 15 ], [ 14, 16 ], [ 14, 19 ], [ 15, 11 ], [ 15, 18 ], [ 15, 14 ], [ 16, 17 ], [ 18, 12 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Edna knows Kendrick. Edna knows Fabian. Austin knows Alice. Austin knows Daphne. Wallace knows Austin. Bert knows Edna. Jose knows Olive. Mack knows Bert. Delilah knows Martha. Alison knows Adam. Martha knows Kirk. Martha knows Dallas. Vicki knows Arden. Wallace knows Delilah. Dallas knows Jose. Kendrick knows Alison. Vicki knows Garrison. Mack knows Vicki. Which of Edna and Martha can Wallace reach?", "answer": "Martha", "steps": [ "Wallace knows Delilah.", "Delilah knows Martha." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Wallace", "Jose", "Olive", "Dallas", "Alice", "Austin", "Martha", "Delilah", "Kirk", "Daphne", "Mack", "Alison", "Adam", "Kendrick", "Garrison", "Vicki", "Edna", "Bert", "Fabian", "Arden" ], "edges": [ [ 0, 7 ], [ 0, 5 ], [ 1, 2 ], [ 3, 1 ], [ 5, 4 ], [ 5, 9 ], [ 6, 3 ], [ 6, 8 ], [ 7, 6 ], [ 10, 17 ], [ 10, 15 ], [ 11, 12 ], [ 13, 11 ], [ 15, 14 ], [ 15, 19 ], [ 16, 13 ], [ 16, 18 ], [ 17, 16 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Gunnar knows Sebastian. Alyson knows Gunnar. Alyson knows Clarissa. Zack knows Alyson. Arthur knows Latoya. Finn knows Zack. Lillian knows Wendy. Keegan knows Destiny. Lenora knows Susanne. Keegan knows Sean. Arthur knows Felix. Julia knows Finn. Lillian knows Tracy. Wendy knows Seth. Susanne knows Graham. Graham knows Lillian. Alyson knows Arthur. Lillian knows Keegan. Which of Lillian and Alyson can Julia reach?", "answer": "Alyson", "steps": [ "Julia knows Finn.", "Finn knows Zack.", "Zack knows Alyson." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Julia", "Gunnar", "Sebastian", "Zack", "Latoya", "Clarissa", "Arthur", "Finn", "Alyson", "Felix", "Lenora", "Wendy", "Seth", "Graham", "Destiny", "Tracy", "Keegan", "Susanne", "Lillian", "Sean" ], "edges": [ [ 0, 7 ], [ 1, 2 ], [ 3, 8 ], [ 6, 4 ], [ 6, 9 ], [ 7, 3 ], [ 8, 1 ], [ 8, 5 ], [ 8, 6 ], [ 10, 17 ], [ 11, 12 ], [ 13, 18 ], [ 16, 14 ], [ 16, 19 ], [ 17, 13 ], [ 18, 11 ], [ 18, 15 ], [ 18, 16 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Matt knows Christopher. Porter knows Clarence. Selena knows Conrad. Porter knows Amanda. Alyssa knows Julian. Earle knows Delilah. Daisy knows Linda. Delilah knows Hope. Isabel knows Nash. Alyssa knows Matt. Matt knows Selena. Julian knows Merle. Amanda knows Lawrence. Clarence knows Daisy. Christopher knows Earle. Isabel knows Porter. Nash knows Yolanda. Linda knows Mack. Which of Matt and Porter can Isabel reach?", "answer": "Porter", "steps": [ "Isabel knows Porter." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Isabel", "Lawrence", "Yolanda", "Porter", "Clarence", "Daisy", "Nash", "Linda", "Mack", "Amanda", "Alyssa", "Conrad", "Merle", "Matt", "Christopher", "Earle", "Julian", "Delilah", "Hope", "Selena" ], "edges": [ [ 0, 6 ], [ 0, 3 ], [ 3, 4 ], [ 3, 9 ], [ 4, 5 ], [ 5, 7 ], [ 6, 2 ], [ 7, 8 ], [ 9, 1 ], [ 10, 16 ], [ 10, 13 ], [ 13, 14 ], [ 13, 19 ], [ 14, 15 ], [ 15, 17 ], [ 16, 12 ], [ 17, 18 ], [ 19, 11 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Arden knows Frida. Tina knows Clark. Jeff knows Paige. Tina knows Derek. Lenora knows Jillian. Arden knows Kira. Arden knows Lenora. Lenora knows Brenda. Jillian knows Darin. Darin knows Fred. Darin knows Marian. Hubert knows Robert. Jeff knows Claudia. Jeff knows Hubert. Hank knows Tina. Claudia knows Noel. Frida knows Darcy. Hubert knows Hank. Which of Hank and Jillian can Jeff reach?", "answer": "Hank", "steps": [ "Jeff knows Hubert.", "Hubert knows Hank." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Jeff", "Hank", "Tina", "Clark", "Robert", "Paige", "Noel", "Hubert", "Derek", "Claudia", "Arden", "Jillian", "Darin", "Marian", "Brenda", "Kira", "Darcy", "Lenora", "Fred", "Frida" ], "edges": [ [ 0, 5 ], [ 0, 7 ], [ 0, 9 ], [ 1, 2 ], [ 2, 3 ], [ 2, 8 ], [ 7, 4 ], [ 7, 1 ], [ 9, 6 ], [ 10, 15 ], [ 10, 17 ], [ 10, 19 ], [ 11, 12 ], [ 12, 13 ], [ 12, 18 ], [ 17, 14 ], [ 17, 11 ], [ 19, 16 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Tanya knows Neal. Jessie knows Vance. Jackson knows Louisa. Kit knows Marian. Janet knows Jessie. Marian knows Harmony. Harvey knows Otto. Teresa knows Jackson. Jolena knows Tanya. Kit knows Janet. Kit knows Hal. Harmony knows Dustin. Hilda knows Kit. Otto knows Gail. Tanya knows Vera. Tanya knows Harvey. Dustin knows Mara. Vera knows Teresa. Which of Jackson and Dustin can Hilda reach?", "answer": "Dustin", "steps": [ "Hilda knows Kit.", "Kit knows Marian.", "Marian knows Harmony.", "Harmony knows Dustin." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Hilda", "Kit", "Harmony", "Vance", "Dustin", "Marian", "Hal", "Janet", "Jessie", "Mara", "Jolena", "Tanya", "Teresa", "Gail", "Jackson", "Vera", "Neal", "Harvey", "Otto", "Louisa" ], "edges": [ [ 0, 1 ], [ 1, 6 ], [ 1, 7 ], [ 1, 5 ], [ 2, 4 ], [ 4, 9 ], [ 5, 2 ], [ 7, 8 ], [ 8, 3 ], [ 10, 11 ], [ 11, 16 ], [ 11, 17 ], [ 11, 15 ], [ 12, 14 ], [ 14, 19 ], [ 15, 12 ], [ 17, 18 ], [ 18, 13 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Lucas knows Abigail. Dwight knows Kathleen. Michelle knows Ray. Will knows Jana. Marilyn knows Christopher. Lucas knows Marilyn. Christopher knows Madeline. Destiny knows Blake. Constance knows Gregory. Blake knows Chantal. Lucas knows Will. Dwight knows Michelle. Destiny knows Constance. Marilyn knows Farrah. Dwight knows Ken. Abigail knows Colby. Destiny knows Dwight. Marilyn knows Christina. Which of Madeline and Ray can Lucas reach?", "answer": "Madeline", "steps": [ "Lucas knows Marilyn.", "Marilyn knows Christopher.", "Christopher knows Madeline." ], "difficulty": 3, "original_distance": 3, "idx_to_symbol": [ "Lucas", "Christopher", "Jana", "Colby", "Christina", "Abigail", "Marilyn", "Madeline", "Will", "Farrah", "Destiny", "Michelle", "Chantal", "Gregory", "Ken", "Constance", "Dwight", "Ray", "Blake", "Kathleen" ], "edges": [ [ 0, 5 ], [ 0, 8 ], [ 0, 6 ], [ 1, 7 ], [ 5, 3 ], [ 6, 4 ], [ 6, 1 ], [ 6, 9 ], [ 8, 2 ], [ 10, 15 ], [ 10, 18 ], [ 10, 16 ], [ 11, 17 ], [ 15, 13 ], [ 16, 14 ], [ 16, 11 ], [ 16, 19 ], [ 18, 12 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "George knows Dolores. Carl knows Cecilia. Mitchell knows Parsa. Cecilia knows Blanche. Leigh knows Elliot. Todd knows Randy. Selena knows Marcia. Todd knows Charity. Norman knows Lily. Selena knows Gabe. Selena knows Eugenia. Blanche knows Leigh. Todd knows George. Dolores knows Mitchell. Lily knows Donna. Dewey knows Carl. Eugenia knows Dewey. Parsa knows Norman. Which of George and Eugenia can Todd reach?", "answer": "George", "steps": [ "Todd knows George." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Todd", "Charity", "Parsa", "Mitchell", "Lily", "Randy", "George", "Norman", "Dolores", "Donna", "Selena", "Gabe", "Cecilia", "Carl", "Leigh", "Marcia", "Eugenia", "Blanche", "Dewey", "Elliot" ], "edges": [ [ 0, 1 ], [ 0, 5 ], [ 0, 6 ], [ 2, 7 ], [ 3, 2 ], [ 4, 9 ], [ 6, 8 ], [ 7, 4 ], [ 8, 3 ], [ 10, 11 ], [ 10, 15 ], [ 10, 16 ], [ 12, 17 ], [ 13, 12 ], [ 14, 19 ], [ 16, 18 ], [ 17, 14 ], [ 18, 13 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Keegan knows Frances. Bennett knows Derrick. Bruno knows Bart. Dolores knows Merle. Chance knows Max. Derrick knows Jeremy. Bennett knows Warren. Keegan knows Jasper. Fergus knows Ashton. Warren knows Finn. Maude knows Dolores. Bruno knows Arden. Jeremy knows Chance. Frances knows Maude. Maude knows Yvette. Bart knows Bennett. Yvette knows Jonas. Jonas knows Fergus. Which of Max and Ashton can Keegan reach?", "answer": "Ashton", "steps": [ "Keegan knows Frances.", "Frances knows Maude.", "Maude knows Yvette.", "Yvette knows Jonas.", "Jonas knows Fergus.", "Fergus knows Ashton." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Keegan", "Dolores", "Fergus", "Yvette", "Ashton", "Maude", "Frances", "Merle", "Jasper", "Jonas", "Bruno", "Warren", "Chance", "Derrick", "Max", "Bennett", "Bart", "Finn", "Arden", "Jeremy" ], "edges": [ [ 0, 8 ], [ 0, 6 ], [ 1, 7 ], [ 2, 4 ], [ 3, 9 ], [ 5, 1 ], [ 5, 3 ], [ 6, 5 ], [ 9, 2 ], [ 10, 18 ], [ 10, 16 ], [ 11, 17 ], [ 12, 14 ], [ 13, 19 ], [ 15, 11 ], [ 15, 13 ], [ 16, 15 ], [ 19, 12 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Charlotte knows Dawn. Clayton knows Ruth. Isiah knows Clayton. Carl knows Bart. Fabian knows Cody. Fabian knows Carl. Amelia knows Theodore. Jean knows Amelia. Fabian knows Clara. Stephanie knows Charlotte. Dawn knows Ramona. Grant knows Jean. Jean knows Itzel. Veronica knows Isiah. Miriam knows Stephanie. Jean knows Eve. Miriam knows Fabian. Grant knows Veronica. Which of Veronica and Stephanie can Miriam reach?", "answer": "Stephanie", "steps": [ "Miriam knows Stephanie." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Miriam", "Carl", "Ramona", "Cody", "Dawn", "Charlotte", "Fabian", "Clara", "Bart", "Stephanie", "Grant", "Amelia", "Ruth", "Itzel", "Clayton", "Isiah", "Jean", "Eve", "Theodore", "Veronica" ], "edges": [ [ 0, 6 ], [ 0, 9 ], [ 1, 8 ], [ 4, 2 ], [ 5, 4 ], [ 6, 3 ], [ 6, 7 ], [ 6, 1 ], [ 9, 5 ], [ 10, 16 ], [ 10, 19 ], [ 11, 18 ], [ 14, 12 ], [ 15, 14 ], [ 16, 13 ], [ 16, 17 ], [ 16, 11 ], [ 19, 15 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Abby knows Cole. Cole knows Clifford. Jon knows Joan. Yara knows Merle. Calvin knows Marie. Florence knows Calvin. Cole knows Harriet. Merle knows Emery. Levi knows Laura. Cole knows Shaun. Jon knows Levi. Jon knows Edison. Clifford knows Ruth. Marie knows Abby. Archer knows Joseph. Emery knows Archer. Abby knows Fleur. Archer knows Jon. Which of Calvin and Merle can Yara reach?", "answer": "Merle", "steps": [ "Yara knows Merle." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Yara", "Laura", "Emery", "Joan", "Edison", "Merle", "Joseph", "Levi", "Jon", "Archer", "Florence", "Ruth", "Marie", "Harriet", "Shaun", "Calvin", "Fleur", "Clifford", "Cole", "Abby" ], "edges": [ [ 0, 5 ], [ 2, 9 ], [ 5, 2 ], [ 7, 1 ], [ 8, 3 ], [ 8, 4 ], [ 8, 7 ], [ 9, 6 ], [ 9, 8 ], [ 10, 15 ], [ 12, 19 ], [ 15, 12 ], [ 17, 11 ], [ 18, 13 ], [ 18, 14 ], [ 18, 17 ], [ 19, 16 ], [ 19, 18 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Joshua knows Lamont. Harry knows Camden. Joshua knows Harris. Casey knows Lee. Darnell knows Virginia. Darnell knows Nolan. Joshua knows Willard. Joshua knows Corey. Virginia knows Ada. Willard knows Ava. Blake knows Cesar. Casey knows Harry. Ada knows Blake. Blake knows Kristin. Ava knows Casey. Darnell knows Cordelia. Kristin knows Steve. Darnell knows Patricia. Which of Ava and Ada can Darnell reach?", "answer": "Ada", "steps": [ "Darnell knows Virginia.", "Virginia knows Ada." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Darnell", "Kristin", "Cordelia", "Blake", "Steve", "Cesar", "Nolan", "Ada", "Virginia", "Patricia", "Joshua", "Harry", "Harris", "Casey", "Camden", "Lee", "Lamont", "Ava", "Willard", "Corey" ], "edges": [ [ 0, 2 ], [ 0, 6 ], [ 0, 8 ], [ 0, 9 ], [ 1, 4 ], [ 3, 1 ], [ 3, 5 ], [ 7, 3 ], [ 8, 7 ], [ 10, 12 ], [ 10, 16 ], [ 10, 18 ], [ 10, 19 ], [ 11, 14 ], [ 13, 11 ], [ 13, 15 ], [ 17, 13 ], [ 18, 17 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "April knows Lynn. Lynn knows Darrell. Elmer knows Darwin. Virginia knows Khashayar. Nancy knows Charity. Virginia knows Jake. April knows Hendrix. Lynn knows Lillian. Arlene knows Deborah. Charity knows Ray. Charity knows Ember. Enrique knows Nancy. Deborah knows April. Ray knows Lois. Jake knows Enrique. Ray knows Autumn. Elmer knows Eldon. Darwin knows Arlene. Which of April and Charity can Elmer reach?", "answer": "April", "steps": [ "Elmer knows Darwin.", "Darwin knows Arlene.", "Arlene knows Deborah.", "Deborah knows April." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Elmer", "Deborah", "Lynn", "Arlene", "Darrell", "Lillian", "April", "Hendrix", "Eldon", "Darwin", "Virginia", "Nancy", "Ray", "Enrique", "Autumn", "Lois", "Charity", "Ember", "Khashayar", "Jake" ], "edges": [ [ 0, 8 ], [ 0, 9 ], [ 1, 6 ], [ 2, 4 ], [ 2, 5 ], [ 3, 1 ], [ 6, 2 ], [ 6, 7 ], [ 9, 3 ], [ 10, 18 ], [ 10, 19 ], [ 11, 16 ], [ 12, 14 ], [ 12, 15 ], [ 13, 11 ], [ 16, 12 ], [ 16, 17 ], [ 19, 13 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Magdalena knows Alice. Logan knows Dale. Willis knows Fletcher. Emery knows Farrah. Logan knows Emery. Karina knows Tonya. Estella knows Frida. Nell knows Magdalena. Magdalena knows Eileen. Willis knows Anastasia. Dale knows Constance. Karina knows Estella. Avery knows Willis. Eileen knows Hope. Tonya knows Yuki. Karina knows Avery. Logan knows Nell. Anastasia knows Neville. Which of Eileen and Anastasia can Logan reach?", "answer": "Eileen", "steps": [ "Logan knows Nell.", "Nell knows Magdalena.", "Magdalena knows Eileen." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Logan", "Nell", "Constance", "Emery", "Hope", "Magdalena", "Alice", "Farrah", "Dale", "Eileen", "Karina", "Avery", "Yuki", "Estella", "Neville", "Willis", "Fletcher", "Frida", "Tonya", "Anastasia" ], "edges": [ [ 0, 3 ], [ 0, 8 ], [ 0, 1 ], [ 1, 5 ], [ 3, 7 ], [ 5, 6 ], [ 5, 9 ], [ 8, 2 ], [ 9, 4 ], [ 10, 13 ], [ 10, 18 ], [ 10, 11 ], [ 11, 15 ], [ 13, 17 ], [ 15, 16 ], [ 15, 19 ], [ 18, 12 ], [ 19, 14 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Francis knows Kenneth. Frank knows Emanuel. Brian knows Erik. Mara knows Leah. Seth knows Beatrice. Frank knows Leigh. Allan knows Mabel. Adele knows Frank. Allan knows Tyler. Emanuel knows Francis. Mabel knows Seth. Leigh knows Amy. Tyler knows Brian. Jackson knows Jodi. Sierra knows Jackson. Amy knows Heather. Jodi knows Allan. Leah knows Adele. Which of Kenneth and Erik can Mara reach?", "answer": "Kenneth", "steps": [ "Mara knows Leah.", "Leah knows Adele.", "Adele knows Frank.", "Frank knows Emanuel.", "Emanuel knows Francis.", "Francis knows Kenneth." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Mara", "Leigh", "Francis", "Heather", "Emanuel", "Amy", "Leah", "Frank", "Kenneth", "Adele", "Sierra", "Mabel", "Brian", "Beatrice", "Tyler", "Seth", "Jackson", "Allan", "Erik", "Jodi" ], "edges": [ [ 0, 6 ], [ 1, 5 ], [ 2, 8 ], [ 4, 2 ], [ 5, 3 ], [ 6, 9 ], [ 7, 1 ], [ 7, 4 ], [ 9, 7 ], [ 10, 16 ], [ 11, 15 ], [ 12, 18 ], [ 14, 12 ], [ 15, 13 ], [ 16, 19 ], [ 17, 11 ], [ 17, 14 ], [ 19, 17 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "James knows Boyd. Adelaide knows Clinton. Drew knows Dorothy. Jakob knows James. Adelaide knows Kurt. Brody knows Kai. Russ knows Renee. Aaron knows Adelaide. Drew knows Pete. Cynthia knows Jakob. Renee knows Lisette. Nora knows Brody. Rex knows Chelsea. Kai knows Cynthia. Chelsea knows Aaron. Lisette knows Rhonda. Rhonda knows Rex. Boyd knows Drew. Which of James and Chelsea can Nora reach?", "answer": "James", "steps": [ "Nora knows Brody.", "Brody knows Kai.", "Kai knows Cynthia.", "Cynthia knows Jakob.", "Jakob knows James." ], "difficulty": 5, "original_distance": 8, "idx_to_symbol": [ "Nora", "James", "Drew", "Dorothy", "Jakob", "Kai", "Brody", "Boyd", "Pete", "Cynthia", "Russ", "Chelsea", "Adelaide", "Kurt", "Rex", "Lisette", "Renee", "Aaron", "Clinton", "Rhonda" ], "edges": [ [ 0, 6 ], [ 1, 7 ], [ 2, 3 ], [ 2, 8 ], [ 4, 1 ], [ 5, 9 ], [ 6, 5 ], [ 7, 2 ], [ 9, 4 ], [ 10, 16 ], [ 11, 17 ], [ 12, 13 ], [ 12, 18 ], [ 14, 11 ], [ 15, 19 ], [ 16, 15 ], [ 17, 12 ], [ 19, 14 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Veronica knows Hayley. Hayley knows Rose. Holly knows Terry. Glenn knows Wilson. Nolan knows Kennedy. Glenn knows Blair. Alice knows Nolan. Janice knows Edith. Hayley knows Dolores. Tim knows Glenn. Sandra knows Winston. Glenn knows Veronica. Winston knows Tim. Nolan knows Gene. Holly knows Alice. Edith knows Lenora. Holly knows Sheryl. Lenora knows Holly. Which of Dolores and Kennedy can Sandra reach?", "answer": "Dolores", "steps": [ "Sandra knows Winston.", "Winston knows Tim.", "Tim knows Glenn.", "Glenn knows Veronica.", "Veronica knows Hayley.", "Hayley knows Dolores." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Sandra", "Blair", "Veronica", "Winston", "Wilson", "Hayley", "Dolores", "Rose", "Glenn", "Tim", "Janice", "Sheryl", "Alice", "Edith", "Terry", "Nolan", "Kennedy", "Gene", "Holly", "Lenora" ], "edges": [ [ 0, 3 ], [ 2, 5 ], [ 3, 9 ], [ 5, 6 ], [ 5, 7 ], [ 8, 1 ], [ 8, 4 ], [ 8, 2 ], [ 9, 8 ], [ 10, 13 ], [ 12, 15 ], [ 13, 19 ], [ 15, 16 ], [ 15, 17 ], [ 18, 11 ], [ 18, 14 ], [ 18, 12 ], [ 19, 18 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Shelly knows Brett. Justine knows Benjamin. Brett knows Parker. Benjamin knows Aiden. Jeanette knows Justine. Carol knows Helene. Carol knows Georgia. Alyssa knows Lionel. Alejandro knows Edmund. Parker knows Alyssa. Benjamin knows Chester. Dean knows Jeanette. Justine knows Hadley. Edmund knows Dean. Dean knows August. Alyssa knows Carol. Wallace knows Shelly. Brett knows Kendra. Which of Brett and Dean can Wallace reach?", "answer": "Brett", "steps": [ "Wallace knows Shelly.", "Shelly knows Brett." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Wallace", "Alyssa", "Georgia", "Lionel", "Carol", "Parker", "Helene", "Kendra", "Brett", "Shelly", "Alejandro", "Justine", "Aiden", "Hadley", "Benjamin", "Jeanette", "Chester", "August", "Dean", "Edmund" ], "edges": [ [ 0, 9 ], [ 1, 3 ], [ 1, 4 ], [ 4, 2 ], [ 4, 6 ], [ 5, 1 ], [ 8, 5 ], [ 8, 7 ], [ 9, 8 ], [ 10, 19 ], [ 11, 13 ], [ 11, 14 ], [ 14, 12 ], [ 14, 16 ], [ 15, 11 ], [ 18, 15 ], [ 18, 17 ], [ 19, 18 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Derek knows Ember. Graeme knows Eleanor. Dell knows Bruno. Walter knows Dell. Jodi knows Diane. Diane knows Justine. Jocelyn knows Mia. Lyric knows Odette. Dell knows Carmela. Carmela knows Belinda. Justine knows Lyric. Bruno knows Garland. Justine knows Derek. Jodi knows Lacey. Justine knows Graeme. Raquel knows Walter. Raquel knows Olivia. Dell knows Jocelyn. Which of Derek and Jocelyn can Raquel reach?", "answer": "Jocelyn", "steps": [ "Raquel knows Walter.", "Walter knows Dell.", "Dell knows Jocelyn." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Raquel", "Carmela", "Bruno", "Dell", "Garland", "Olivia", "Belinda", "Jocelyn", "Mia", "Walter", "Jodi", "Graeme", "Lyric", "Justine", "Odette", "Lacey", "Eleanor", "Derek", "Ember", "Diane" ], "edges": [ [ 0, 5 ], [ 0, 9 ], [ 1, 6 ], [ 2, 4 ], [ 3, 2 ], [ 3, 1 ], [ 3, 7 ], [ 7, 8 ], [ 9, 3 ], [ 10, 15 ], [ 10, 19 ], [ 11, 16 ], [ 12, 14 ], [ 13, 12 ], [ 13, 11 ], [ 13, 17 ], [ 17, 18 ], [ 19, 13 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Heath knows Aaron. Kristin knows Arden. Pablo knows Beau. Sierra knows Gonzalo. Bailey knows Gilbert. Gilbert knows Judy. Gonzalo knows Heath. Beau knows Bailey. Jessie knows Kristin. Melody knows Peggy. Peggy knows Lois. Beau knows Ernesto. Kristin knows Cornelius. Aaron knows Declan. Sierra knows Stella. Gilbert knows Cara. Cara knows Melody. Arden knows Sierra. Which of Gilbert and Sierra can Jessie reach?", "answer": "Sierra", "steps": [ "Jessie knows Kristin.", "Kristin knows Arden.", "Arden knows Sierra." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Jessie", "Cornelius", "Aaron", "Heath", "Gonzalo", "Stella", "Arden", "Kristin", "Sierra", "Declan", "Pablo", "Ernesto", "Peggy", "Melody", "Cara", "Judy", "Bailey", "Beau", "Gilbert", "Lois" ], "edges": [ [ 0, 7 ], [ 2, 9 ], [ 3, 2 ], [ 4, 3 ], [ 6, 8 ], [ 7, 1 ], [ 7, 6 ], [ 8, 5 ], [ 8, 4 ], [ 10, 17 ], [ 12, 19 ], [ 13, 12 ], [ 14, 13 ], [ 16, 18 ], [ 17, 11 ], [ 17, 16 ], [ 18, 15 ], [ 18, 14 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Lily knows Effie. Kylie knows Geoffrey. Denver knows Kelsey. Ariana knows Nolan. Jane knows Max. Alicia knows Erma. Max knows Kylie. Effie knows Liam. Lauren knows Devin. Ivy knows Alicia. Denver knows Jane. Shane knows Lauren. Nolan knows Ivy. Clark knows Carson. Effie knows Ariana. Devin knows Denver. Geoffrey knows Marian. Carson knows Lily. Which of Alicia and Geoffrey can Clark reach?", "answer": "Alicia", "steps": [ "Clark knows Carson.", "Carson knows Lily.", "Lily knows Effie.", "Effie knows Ariana.", "Ariana knows Nolan.", "Nolan knows Ivy.", "Ivy knows Alicia." ], "difficulty": 7, "original_distance": 8, "idx_to_symbol": [ "Clark", "Lily", "Erma", "Alicia", "Ivy", "Ariana", "Effie", "Nolan", "Carson", "Liam", "Shane", "Devin", "Marian", "Geoffrey", "Kylie", "Jane", "Denver", "Max", "Lauren", "Kelsey" ], "edges": [ [ 0, 8 ], [ 1, 6 ], [ 3, 2 ], [ 4, 3 ], [ 5, 7 ], [ 6, 5 ], [ 6, 9 ], [ 7, 4 ], [ 8, 1 ], [ 10, 18 ], [ 11, 16 ], [ 13, 12 ], [ 14, 13 ], [ 15, 17 ], [ 16, 15 ], [ 16, 19 ], [ 17, 14 ], [ 18, 11 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Winifred knows Casey. Linda knows Neil. Enrique knows Trudy. Lacey knows Linda. Casey knows Dustin. Ashton knows Mario. Graham knows Kevin. Trudy knows Kendrick. Kendrick knows Corinne. Kendrick knows Della. Christina knows Ashton. Melanie knows Enrique. Kaleb knows Graham. Enrique knows Henrietta. Casey knows Rowan. Lacey knows Christina. Ashton knows Winifred. Kaleb knows Melanie. Which of Melanie and Christina can Lacey reach?", "answer": "Christina", "steps": [ "Lacey knows Christina." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Lacey", "Christina", "Casey", "Ashton", "Rowan", "Dustin", "Neil", "Mario", "Winifred", "Linda", "Kaleb", "Melanie", "Kendrick", "Enrique", "Corinne", "Della", "Kevin", "Henrietta", "Trudy", "Graham" ], "edges": [ [ 0, 1 ], [ 0, 9 ], [ 1, 3 ], [ 2, 4 ], [ 2, 5 ], [ 3, 7 ], [ 3, 8 ], [ 8, 2 ], [ 9, 6 ], [ 10, 11 ], [ 10, 19 ], [ 11, 13 ], [ 12, 14 ], [ 12, 15 ], [ 13, 17 ], [ 13, 18 ], [ 18, 12 ], [ 19, 16 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Lisa knows Ruby. Marshall knows Iris. Barney knows Marshall. Ruby knows Aisha. Connor knows Shane. Eamon knows Denise. Marshall knows Justine. Shane knows Andre. Eugene knows Barney. Emily knows Kelsey. Justine knows Eamon. Ruby knows Emily. Holly knows Leland. Andre knows Camden. Willis knows Eugene. Aisha knows Connor. Eugene knows Holly. Connor knows Marcia. Which of Aisha and Barney can Willis reach?", "answer": "Barney", "steps": [ "Willis knows Eugene.", "Eugene knows Barney." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Willis", "Denise", "Justine", "Barney", "Eamon", "Holly", "Iris", "Marshall", "Eugene", "Leland", "Lisa", "Camden", "Shane", "Aisha", "Andre", "Emily", "Marcia", "Connor", "Ruby", "Kelsey" ], "edges": [ [ 0, 8 ], [ 2, 4 ], [ 3, 7 ], [ 4, 1 ], [ 5, 9 ], [ 7, 2 ], [ 7, 6 ], [ 8, 3 ], [ 8, 5 ], [ 10, 18 ], [ 12, 14 ], [ 13, 17 ], [ 14, 11 ], [ 15, 19 ], [ 17, 12 ], [ 17, 16 ], [ 18, 13 ], [ 18, 15 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Harold knows Joyce. Miles knows Joaquin. Saul knows Harold. Sonia knows Gregory. Dane knows Coral. Clara knows Eugene. Joaquin knows George. Saul knows Clayton. Joyce knows Howard. Joaquin knows Clara. Eugene knows Serena. Howard knows Arden. Howard knows Charles. Howard knows Federico. Federico knows Dane. Sonia knows Harper. Gregory knows Miles. Joaquin knows Natalie. Which of Eugene and Dane can Saul reach?", "answer": "Dane", "steps": [ "Saul knows Harold.", "Harold knows Joyce.", "Joyce knows Howard.", "Howard knows Federico.", "Federico knows Dane." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Saul", "Howard", "Federico", "Arden", "Coral", "Dane", "Clayton", "Joyce", "Charles", "Harold", "Sonia", "Joaquin", "Clara", "George", "Serena", "Eugene", "Harper", "Miles", "Natalie", "Gregory" ], "edges": [ [ 0, 6 ], [ 0, 9 ], [ 1, 3 ], [ 1, 2 ], [ 1, 8 ], [ 2, 5 ], [ 5, 4 ], [ 7, 1 ], [ 9, 7 ], [ 10, 16 ], [ 10, 19 ], [ 11, 13 ], [ 11, 12 ], [ 11, 18 ], [ 12, 15 ], [ 15, 14 ], [ 17, 11 ], [ 19, 17 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Dorothy knows Colette. Priscilla knows Regina. Fanny knows Lorna. Jakob knows Lee. Lorna knows Zane. Jakob knows Grace. Jaime knows Humphrey. Dorothy knows Parker. Erwin knows Todd. Zane knows Dixie. Jaime knows Erwin. Parker knows Priscilla. Grace knows Fanny. Grace knows Celia. Miles knows Jaime. Sam knows Jakob. Erwin knows Dorothy. Fanny knows Sierra. Which of Dixie and Regina can Miles reach?", "answer": "Regina", "steps": [ "Miles knows Jaime.", "Jaime knows Erwin.", "Erwin knows Dorothy.", "Dorothy knows Parker.", "Parker knows Priscilla.", "Priscilla knows Regina." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Miles", "Regina", "Jaime", "Erwin", "Todd", "Dorothy", "Priscilla", "Parker", "Humphrey", "Colette", "Sam", "Dixie", "Jakob", "Grace", "Celia", "Fanny", "Zane", "Lorna", "Lee", "Sierra" ], "edges": [ [ 0, 2 ], [ 2, 8 ], [ 2, 3 ], [ 3, 4 ], [ 3, 5 ], [ 5, 7 ], [ 5, 9 ], [ 6, 1 ], [ 7, 6 ], [ 10, 12 ], [ 12, 18 ], [ 12, 13 ], [ 13, 14 ], [ 13, 15 ], [ 15, 17 ], [ 15, 19 ], [ 16, 11 ], [ 17, 16 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Hadley knows Sandy. Brooks knows Brody. Nancy knows Gladys. Brooks knows Frankie. Celia knows Brooks. Sandy knows Hendrix. Bert knows Beatrice. Brody knows Geneva. Nancy knows Gus. Nancy knows Sebastian. Beatrice knows Nancy. Frankie knows Hadley. Eunice knows Martha. Martha knows Finn. Brody knows Logan. Brody knows Colby. Beatrice knows Amanda. Amanda knows Eunice. Which of Finn and Hendrix can Celia reach?", "answer": "Hendrix", "steps": [ "Celia knows Brooks.", "Brooks knows Frankie.", "Frankie knows Hadley.", "Hadley knows Sandy.", "Sandy knows Hendrix." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Celia", "Frankie", "Logan", "Geneva", "Hadley", "Brody", "Sandy", "Hendrix", "Brooks", "Colby", "Bert", "Amanda", "Gus", "Gladys", "Eunice", "Nancy", "Martha", "Finn", "Beatrice", "Sebastian" ], "edges": [ [ 0, 8 ], [ 1, 4 ], [ 4, 6 ], [ 5, 2 ], [ 5, 3 ], [ 5, 9 ], [ 6, 7 ], [ 8, 1 ], [ 8, 5 ], [ 10, 18 ], [ 11, 14 ], [ 14, 16 ], [ 15, 12 ], [ 15, 13 ], [ 15, 19 ], [ 16, 17 ], [ 18, 11 ], [ 18, 15 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Aspen knows Carla. Garrison knows Aspen. Aspen knows Greg. Aspen knows Callum. Clinton knows Darla. Darla knows Peter. Bennett knows Celia. Heather knows Garrison. Celia knows Jesse. Federico knows Anton. Callum knows Barry. Federico knows Glenn. Glenn knows Eli. Jesse knows Federico. Donald knows Aiden. Federico knows Raquel. Bennett knows Donald. Clinton knows Heather. Which of Heather and Celia can Bennett reach?", "answer": "Celia", "steps": [ "Bennett knows Celia." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Bennett", "Anton", "Eli", "Federico", "Aiden", "Celia", "Donald", "Glenn", "Raquel", "Jesse", "Clinton", "Carla", "Barry", "Aspen", "Peter", "Heather", "Darla", "Callum", "Greg", "Garrison" ], "edges": [ [ 0, 6 ], [ 0, 5 ], [ 3, 1 ], [ 3, 7 ], [ 3, 8 ], [ 5, 9 ], [ 6, 4 ], [ 7, 2 ], [ 9, 3 ], [ 10, 16 ], [ 10, 15 ], [ 13, 11 ], [ 13, 17 ], [ 13, 18 ], [ 15, 19 ], [ 16, 14 ], [ 17, 12 ], [ 19, 13 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Irma knows Elmer. Verna knows Clyde. Clyde knows Serena. Ariana knows Irma. Dell knows Xander. Rosemary knows Archie. Cyrus knows Blanche. Serena knows Pierce. Jennifer knows Uma. Elmer knows Jennifer. Archie knows Verna. Irma knows Cyrus. Kai knows Devin. Archie knows Kai. Verna knows Doris. Devin knows Sheila. Cyrus knows Wesley. Wesley knows Dell. Which of Serena and Dell can Rosemary reach?", "answer": "Serena", "steps": [ "Rosemary knows Archie.", "Archie knows Verna.", "Verna knows Clyde.", "Clyde knows Serena." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Rosemary", "Sheila", "Kai", "Devin", "Serena", "Doris", "Verna", "Clyde", "Pierce", "Archie", "Ariana", "Uma", "Elmer", "Jennifer", "Dell", "Blanche", "Cyrus", "Wesley", "Xander", "Irma" ], "edges": [ [ 0, 9 ], [ 2, 3 ], [ 3, 1 ], [ 4, 8 ], [ 6, 5 ], [ 6, 7 ], [ 7, 4 ], [ 9, 2 ], [ 9, 6 ], [ 10, 19 ], [ 12, 13 ], [ 13, 11 ], [ 14, 18 ], [ 16, 15 ], [ 16, 17 ], [ 17, 14 ], [ 19, 12 ], [ 19, 16 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Carol knows Leticia. Julia knows Deborah. Gerald knows Lambert. Lambert knows Cain. Uma knows Gerald. Reid knows Edgar. Uma knows Katrina. Carol knows Marcia. Reid knows Rita. Deborah knows Byron. Leticia knows Corinne. Uma knows Julia. Leticia knows Monroe. Julia knows Fred. Alison knows Reid. Monroe knows Jenny. Carol knows Alison. Lambert knows Declan. Which of Edgar and Cain can Carol reach?", "answer": "Edgar", "steps": [ "Carol knows Alison.", "Alison knows Reid.", "Reid knows Edgar." ], "difficulty": 3, "original_distance": 3, "idx_to_symbol": [ "Carol", "Monroe", "Rita", "Corinne", "Edgar", "Alison", "Jenny", "Marcia", "Reid", "Leticia", "Uma", "Deborah", "Declan", "Fred", "Cain", "Gerald", "Byron", "Katrina", "Lambert", "Julia" ], "edges": [ [ 0, 7 ], [ 0, 5 ], [ 0, 9 ], [ 1, 6 ], [ 5, 8 ], [ 8, 2 ], [ 8, 4 ], [ 9, 3 ], [ 9, 1 ], [ 10, 17 ], [ 10, 15 ], [ 10, 19 ], [ 11, 16 ], [ 15, 18 ], [ 18, 12 ], [ 18, 14 ], [ 19, 13 ], [ 19, 11 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "June knows Hattie. Rita knows Daria. Jeanette knows Perry. Beverly knows Jeanette. Rita knows Langston. Alejandro knows Lyle. Susan knows June. Hattie knows Saul. Milo knows Hilda. Verna knows Luz. Alejandro knows Shelly. Lars knows Alejandro. Perry knows Rita. Hilda knows Beverly. Alejandro knows Verna. Emily knows Owen. Saul knows Lars. Rita knows Emily. Which of Hattie and Beverly can Susan reach?", "answer": "Hattie", "steps": [ "Susan knows June.", "June knows Hattie." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Susan", "Hattie", "Luz", "Alejandro", "Lars", "Shelly", "Lyle", "Verna", "Saul", "June", "Milo", "Beverly", "Owen", "Rita", "Perry", "Daria", "Langston", "Emily", "Jeanette", "Hilda" ], "edges": [ [ 0, 9 ], [ 1, 8 ], [ 3, 5 ], [ 3, 6 ], [ 3, 7 ], [ 4, 3 ], [ 7, 2 ], [ 8, 4 ], [ 9, 1 ], [ 10, 19 ], [ 11, 18 ], [ 13, 15 ], [ 13, 16 ], [ 13, 17 ], [ 14, 13 ], [ 17, 12 ], [ 18, 14 ], [ 19, 11 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Harrison knows Yvonne. Yvonne knows Fraser. Lauren knows Maggie. Lorna knows Randall. Laura knows Lauren. Yvonne knows Ainsley. Blake knows Sam. Burt knows Laura. Lola knows Burt. Lauren knows Lewis. Blake knows Aubrey. Lauren knows Darrell. Blake knows Daphna. Fraser knows Dayton. Burt knows Jolena. Burt knows Lorna. Yvonne knows Anton. Ainsley knows Blake. Which of Lauren and Blake can Harrison reach?", "answer": "Blake", "steps": [ "Harrison knows Yvonne.", "Yvonne knows Ainsley.", "Ainsley knows Blake." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Harrison", "Ainsley", "Dayton", "Daphna", "Blake", "Aubrey", "Fraser", "Anton", "Yvonne", "Sam", "Lola", "Laura", "Randall", "Maggie", "Lauren", "Lewis", "Lorna", "Jolena", "Burt", "Darrell" ], "edges": [ [ 0, 8 ], [ 1, 4 ], [ 4, 3 ], [ 4, 5 ], [ 4, 9 ], [ 6, 2 ], [ 8, 6 ], [ 8, 7 ], [ 8, 1 ], [ 10, 18 ], [ 11, 14 ], [ 14, 13 ], [ 14, 15 ], [ 14, 19 ], [ 16, 12 ], [ 18, 16 ], [ 18, 17 ], [ 18, 11 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Kira knows Samuel. Natalie knows Julia. Earl knows Hubert. Hilda knows Carla. Cruz knows Billy. Cruz knows Shaun. Harper knows Jean. Harper knows Hilda. Julia knows Kira. Gordon knows Harper. Levi knows Donald. Levi knows Earl. Billy knows Alder. Hubert knows Merle. Ashton knows Levi. Jean knows Cruz. Julia knows Ashton. Alder knows Homer. Which of Ashton and Jean can Natalie reach?", "answer": "Ashton", "steps": [ "Natalie knows Julia.", "Julia knows Ashton." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Natalie", "Merle", "Levi", "Donald", "Earl", "Ashton", "Hubert", "Samuel", "Julia", "Kira", "Gordon", "Homer", "Cruz", "Shaun", "Billy", "Jean", "Alder", "Carla", "Harper", "Hilda" ], "edges": [ [ 0, 8 ], [ 2, 3 ], [ 2, 4 ], [ 4, 6 ], [ 5, 2 ], [ 6, 1 ], [ 8, 5 ], [ 8, 9 ], [ 9, 7 ], [ 10, 18 ], [ 12, 13 ], [ 12, 14 ], [ 14, 16 ], [ 15, 12 ], [ 16, 11 ], [ 18, 15 ], [ 18, 19 ], [ 19, 17 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Eileen knows Perry. Eileen knows Julio. Randall knows Cate. Jeff knows Karina. Emmett knows Billy. Eileen knows Griffith. Wyatt knows Lilia. Elijah knows Randall. Griffith knows Jakob. Perry knows Eugene. Itzel knows Hubert. Perry knows Elijah. Emmett knows Wyatt. Jeff knows Emmett. Lilia knows Gwen. Perry knows Luis. Emmett knows Estelle. Jeff knows Itzel. Which of Wyatt and Elijah can Eileen reach?", "answer": "Elijah", "steps": [ "Eileen knows Perry.", "Perry knows Elijah." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Eileen", "Julio", "Luis", "Perry", "Cate", "Eugene", "Elijah", "Randall", "Jakob", "Griffith", "Jeff", "Karina", "Billy", "Emmett", "Gwen", "Estelle", "Wyatt", "Lilia", "Hubert", "Itzel" ], "edges": [ [ 0, 1 ], [ 0, 3 ], [ 0, 9 ], [ 3, 2 ], [ 3, 5 ], [ 3, 6 ], [ 6, 7 ], [ 7, 4 ], [ 9, 8 ], [ 10, 11 ], [ 10, 13 ], [ 10, 19 ], [ 13, 12 ], [ 13, 15 ], [ 13, 16 ], [ 16, 17 ], [ 17, 14 ], [ 19, 18 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Belinda knows Langston. Isla knows Megan. Gemma knows Kingsley. Kate knows Graeme. Eugene knows Griffith. Kate knows Max. Graham knows Kate. Laura knows Devon. Griffith knows Belinda. Belinda knows Tina. Kate knows Celeste. Belinda knows Frank. Megan knows Dick. Gemma knows Isla. Julian knows Parker. Kingsley knows Graham. Parker knows Laura. Julian knows Eugene. Which of Kingsley and Eugene can Julian reach?", "answer": "Eugene", "steps": [ "Julian knows Eugene." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Julian", "Parker", "Laura", "Langston", "Devon", "Frank", "Belinda", "Griffith", "Tina", "Eugene", "Gemma", "Isla", "Megan", "Celeste", "Dick", "Graeme", "Kate", "Graham", "Max", "Kingsley" ], "edges": [ [ 0, 1 ], [ 0, 9 ], [ 1, 2 ], [ 2, 4 ], [ 6, 3 ], [ 6, 5 ], [ 6, 8 ], [ 7, 6 ], [ 9, 7 ], [ 10, 11 ], [ 10, 19 ], [ 11, 12 ], [ 12, 14 ], [ 16, 13 ], [ 16, 15 ], [ 16, 18 ], [ 17, 16 ], [ 19, 17 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Gage knows Zara. Virgil knows Billy. Trudy knows Rebecca. Shannon knows Kimberly. Zara knows Lois. Chandler knows Kirk. Jessie knows Lydia. Jessie knows Doris. Shannon knows Chandler. Doris knows Tristan. Ruth knows Arthur. Ruth knows Ingrid. Shannon knows Trudy. Jessie knows Ruth. Billy knows Atlas. Trudy knows Virgil. Ingrid knows Gage. Atlas knows Judith. Which of Virgil and Ingrid can Jessie reach?", "answer": "Ingrid", "steps": [ "Jessie knows Ruth.", "Ruth knows Ingrid." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Jessie", "Lydia", "Zara", "Doris", "Gage", "Arthur", "Ingrid", "Ruth", "Tristan", "Lois", "Shannon", "Kimberly", "Atlas", "Chandler", "Billy", "Rebecca", "Virgil", "Trudy", "Kirk", "Judith" ], "edges": [ [ 0, 1 ], [ 0, 3 ], [ 0, 7 ], [ 2, 9 ], [ 3, 8 ], [ 4, 2 ], [ 6, 4 ], [ 7, 5 ], [ 7, 6 ], [ 10, 11 ], [ 10, 13 ], [ 10, 17 ], [ 12, 19 ], [ 13, 18 ], [ 14, 12 ], [ 16, 14 ], [ 17, 15 ], [ 17, 16 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Caroline knows Adam. Ember knows Lilia. Eamon knows Ember. Max knows Connor. Myrtle knows Devin. Lilia knows Esther. Myrtle knows Xander. Leslie knows Myrtle. Adam knows Pedro. Priscilla knows Eamon. Jared knows Jill. Eamon knows Jenna. Myrtle knows Caroline. Eamon knows Doris. Jared knows Priscilla. Max knows Jermaine. Jared knows Yvonne. Max knows Leslie. Which of Caroline and Ember can Jared reach?", "answer": "Ember", "steps": [ "Jared knows Priscilla.", "Priscilla knows Eamon.", "Eamon knows Ember." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Jared", "Lilia", "Priscilla", "Jill", "Doris", "Ember", "Yvonne", "Esther", "Jenna", "Eamon", "Max", "Adam", "Leslie", "Connor", "Devin", "Caroline", "Jermaine", "Pedro", "Xander", "Myrtle" ], "edges": [ [ 0, 3 ], [ 0, 6 ], [ 0, 2 ], [ 1, 7 ], [ 2, 9 ], [ 5, 1 ], [ 9, 4 ], [ 9, 5 ], [ 9, 8 ], [ 10, 13 ], [ 10, 16 ], [ 10, 12 ], [ 11, 17 ], [ 12, 19 ], [ 15, 11 ], [ 19, 14 ], [ 19, 15 ], [ 19, 18 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Demetrius knows Chandler. Corinne knows Omar. Bella knows Kimberly. Javier knows Demetrius. Bryan knows Jude. Herbert knows Claire. Demetrius knows Herbert. Karen knows Eileen. Candice knows Jessica. Leroy knows Candice. Kevin knows Eric. Jude knows Leroy. Eileen knows Javier. Leroy knows Corinne. Corinne knows Drew. Kevin knows Tessa. Javier knows Kevin. Candice knows Bella. Which of Jude and Eileen can Bryan reach?", "answer": "Jude", "steps": [ "Bryan knows Jude." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Bryan", "Bella", "Candice", "Leroy", "Kimberly", "Drew", "Jessica", "Jude", "Corinne", "Omar", "Karen", "Herbert", "Demetrius", "Javier", "Claire", "Tessa", "Chandler", "Eileen", "Kevin", "Eric" ], "edges": [ [ 0, 7 ], [ 1, 4 ], [ 2, 1 ], [ 2, 6 ], [ 3, 2 ], [ 3, 8 ], [ 7, 3 ], [ 8, 5 ], [ 8, 9 ], [ 10, 17 ], [ 11, 14 ], [ 12, 11 ], [ 12, 16 ], [ 13, 12 ], [ 13, 18 ], [ 17, 13 ], [ 18, 15 ], [ 18, 19 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Julian knows Giselle. Della knows Brooke. Julian knows Sybil. Fanny knows Myrtle. Jared knows Pete. Della knows Malik. Brooke knows Jay. Elise knows Stephen. Julian knows Ruth. Fanny knows Della. Layla knows Lambert. Myrtle knows Jared. Della knows Clayton. Jared knows Farrah. Elise knows Julian. Stephen knows Layla. Ruth knows Drake. Layla knows Madeline. Which of Brooke and Ruth can Elise reach?", "answer": "Ruth", "steps": [ "Elise knows Julian.", "Julian knows Ruth." ], "difficulty": 2, "original_distance": 3, "idx_to_symbol": [ "Elise", "Layla", "Sybil", "Julian", "Madeline", "Lambert", "Ruth", "Drake", "Stephen", "Giselle", "Fanny", "Jared", "Clayton", "Della", "Farrah", "Pete", "Brooke", "Jay", "Myrtle", "Malik" ], "edges": [ [ 0, 8 ], [ 0, 3 ], [ 1, 4 ], [ 1, 5 ], [ 3, 2 ], [ 3, 6 ], [ 3, 9 ], [ 6, 7 ], [ 8, 1 ], [ 10, 18 ], [ 10, 13 ], [ 11, 14 ], [ 11, 15 ], [ 13, 12 ], [ 13, 16 ], [ 13, 19 ], [ 16, 17 ], [ 18, 11 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Jessica knows Henry. Liam knows Geneva. Lamar knows Liam. Jamie knows Alice. Liam knows Tabitha. Marshall knows Jacques. Alice knows Sybil. Layla knows Estella. Henry knows Floyd. Lamar knows Layla. Sam knows Goldie. Jamie knows Arlene. Clifford knows Zara. Sybil knows Lamar. Marshall knows Milo. Floyd knows Clifford. Sam knows Jessica. Floyd knows Marshall. Which of Lamar and Floyd can Jamie reach?", "answer": "Lamar", "steps": [ "Jamie knows Alice.", "Alice knows Sybil.", "Sybil knows Lamar." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Jamie", "Geneva", "Estella", "Layla", "Lamar", "Tabitha", "Sybil", "Arlene", "Liam", "Alice", "Sam", "Jacques", "Zara", "Clifford", "Floyd", "Milo", "Henry", "Goldie", "Marshall", "Jessica" ], "edges": [ [ 0, 7 ], [ 0, 9 ], [ 3, 2 ], [ 4, 3 ], [ 4, 8 ], [ 6, 4 ], [ 8, 1 ], [ 8, 5 ], [ 9, 6 ], [ 10, 17 ], [ 10, 19 ], [ 13, 12 ], [ 14, 13 ], [ 14, 18 ], [ 16, 14 ], [ 18, 11 ], [ 18, 15 ], [ 19, 16 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Alan knows Lena. Gerard knows Hunter. Hunter knows Maureen. Dawn knows Marlene. Keith knows Hank. Hank knows Emery. Keith knows Clinton. Gerard knows Ben. Darla knows Nell. Eli knows Marian. Eli knows Gerard. Lilia knows Ashton. Nell knows Dawn. Ben knows Zach. Lilia knows Keith. Lena knows Ariana. Zach knows Alan. Clinton knows Darla. Which of Darla and Zach can Eli reach?", "answer": "Zach", "steps": [ "Eli knows Gerard.", "Gerard knows Ben.", "Ben knows Zach." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Eli", "Alan", "Lena", "Ben", "Maureen", "Hunter", "Marian", "Ariana", "Gerard", "Zach", "Lilia", "Nell", "Dawn", "Clinton", "Emery", "Hank", "Ashton", "Marlene", "Keith", "Darla" ], "edges": [ [ 0, 6 ], [ 0, 8 ], [ 1, 2 ], [ 2, 7 ], [ 3, 9 ], [ 5, 4 ], [ 8, 5 ], [ 8, 3 ], [ 9, 1 ], [ 10, 16 ], [ 10, 18 ], [ 11, 12 ], [ 12, 17 ], [ 13, 19 ], [ 15, 14 ], [ 18, 15 ], [ 18, 13 ], [ 19, 11 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Demetrius knows Kristin. Vance knows Lillian. Wendy knows Isabel. Roland knows Demetrius. Lillian knows Connor. Roland knows Brody. Pam knows Roland. Maude knows Marie. Wendy knows Roger. Nina knows Miles. Lillian knows Nina. Roland knows Blake. Kristin knows Leopold. Nina knows Jenna. Lillian knows Maude. Marie knows Nicole. Lillian knows Yvette. Roland knows Wendy. Which of Lillian and Roland can Pam reach?", "answer": "Roland", "steps": [ "Pam knows Roland." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Pam", "Roland", "Leopold", "Kristin", "Roger", "Demetrius", "Brody", "Blake", "Isabel", "Wendy", "Vance", "Lillian", "Nicole", "Marie", "Miles", "Maude", "Yvette", "Connor", "Jenna", "Nina" ], "edges": [ [ 0, 1 ], [ 1, 5 ], [ 1, 6 ], [ 1, 7 ], [ 1, 9 ], [ 3, 2 ], [ 5, 3 ], [ 9, 4 ], [ 9, 8 ], [ 10, 11 ], [ 11, 15 ], [ 11, 16 ], [ 11, 17 ], [ 11, 19 ], [ 13, 12 ], [ 15, 13 ], [ 19, 14 ], [ 19, 18 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Keegan knows Archer. Magdalena knows Mike. Lisette knows Lily. Derrick knows Foster. Jasmine knows Adele. Gabriel knows Kimberly. Gabriel knows Darrell. Naomi knows Khashayar. Gabriel knows Hal. Lily knows Naomi. Lily knows Keegan. Derrick knows Hendrix. Lily knows Matthew. Kimberly knows Gage. Jasmine knows Lisette. Hendrix knows Gabriel. Archer knows Teresa. Darrell knows Magdalena. Which of Archer and Magdalena can Jasmine reach?", "answer": "Archer", "steps": [ "Jasmine knows Lisette.", "Lisette knows Lily.", "Lily knows Keegan.", "Keegan knows Archer." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Jasmine", "Matthew", "Keegan", "Khashayar", "Lisette", "Teresa", "Naomi", "Archer", "Adele", "Lily", "Derrick", "Hal", "Darrell", "Gage", "Hendrix", "Mike", "Kimberly", "Magdalena", "Foster", "Gabriel" ], "edges": [ [ 0, 8 ], [ 0, 4 ], [ 2, 7 ], [ 4, 9 ], [ 6, 3 ], [ 7, 5 ], [ 9, 1 ], [ 9, 6 ], [ 9, 2 ], [ 10, 18 ], [ 10, 14 ], [ 12, 17 ], [ 14, 19 ], [ 16, 13 ], [ 17, 15 ], [ 19, 11 ], [ 19, 16 ], [ 19, 12 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "George knows Dolores. Carl knows Cecilia. Mitchell knows Parsa. Cecilia knows Blanche. Leigh knows Elliot. Todd knows Randy. Selena knows Marcia. Todd knows Charity. Norman knows Lily. Selena knows Gabe. Selena knows Eugenia. Blanche knows Leigh. Todd knows George. Dolores knows Mitchell. Lily knows Donna. Dewey knows Carl. Eugenia knows Dewey. Parsa knows Norman. Which of Dewey and Dolores can Todd reach?", "answer": "Dolores", "steps": [ "Todd knows George.", "George knows Dolores." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Todd", "Charity", "Parsa", "Mitchell", "Lily", "Randy", "George", "Norman", "Dolores", "Donna", "Selena", "Gabe", "Cecilia", "Carl", "Leigh", "Marcia", "Eugenia", "Blanche", "Dewey", "Elliot" ], "edges": [ [ 0, 1 ], [ 0, 5 ], [ 0, 6 ], [ 2, 7 ], [ 3, 2 ], [ 4, 9 ], [ 6, 8 ], [ 7, 4 ], [ 8, 3 ], [ 10, 11 ], [ 10, 15 ], [ 10, 16 ], [ 12, 17 ], [ 13, 12 ], [ 14, 19 ], [ 16, 18 ], [ 17, 14 ], [ 18, 13 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Pearl knows Dante. Ellen knows Carey. Adele knows Conner. Tabitha knows Emily. Tiffany knows Oscar. Carey knows Julie. Franklin knows Edgar. Tiffany knows Conrad. Heather knows Tabitha. Adele knows Ron. Edgar knows Jasmine. Franklin knows Ellen. Emily knows Adele. Tiffany knows Naomi. Jasmine knows Tiffany. Adele knows Shannon. Heather knows Larry. Larry knows Pearl. Which of Jasmine and Emily can Heather reach?", "answer": "Emily", "steps": [ "Heather knows Tabitha.", "Tabitha knows Emily." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Heather", "Larry", "Tabitha", "Shannon", "Conner", "Pearl", "Emily", "Dante", "Adele", "Ron", "Franklin", "Ellen", "Edgar", "Oscar", "Naomi", "Carey", "Jasmine", "Julie", "Tiffany", "Conrad" ], "edges": [ [ 0, 1 ], [ 0, 2 ], [ 1, 5 ], [ 2, 6 ], [ 5, 7 ], [ 6, 8 ], [ 8, 3 ], [ 8, 4 ], [ 8, 9 ], [ 10, 11 ], [ 10, 12 ], [ 11, 15 ], [ 12, 16 ], [ 15, 17 ], [ 16, 18 ], [ 18, 13 ], [ 18, 14 ], [ 18, 19 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Charles knows Ethan. Cody knows Frank. Luis knows Xavier. Hazel knows Langston. Harriet knows Brenda. Carter knows Hazel. Larissa knows Carmela. Larissa knows Carter. Langston knows Luis. Cody knows Violet. Brenda knows Gerald. Larissa knows Mason. Cody knows Harriet. Freya knows Lane. Carter knows Charles. Harriet knows Ernie. Ernie knows Vicki. Gerald knows Freya. Which of Gerald and Langston can Cody reach?", "answer": "Gerald", "steps": [ "Cody knows Harriet.", "Harriet knows Brenda.", "Brenda knows Gerald." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Cody", "Harriet", "Violet", "Gerald", "Ernie", "Frank", "Freya", "Brenda", "Lane", "Vicki", "Larissa", "Carter", "Mason", "Langston", "Charles", "Carmela", "Luis", "Hazel", "Xavier", "Ethan" ], "edges": [ [ 0, 2 ], [ 0, 5 ], [ 0, 1 ], [ 1, 7 ], [ 1, 4 ], [ 3, 6 ], [ 4, 9 ], [ 6, 8 ], [ 7, 3 ], [ 10, 12 ], [ 10, 15 ], [ 10, 11 ], [ 11, 17 ], [ 11, 14 ], [ 13, 16 ], [ 14, 19 ], [ 16, 18 ], [ 17, 13 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Jackson knows Ivy. Mike knows Sarah. Jolena knows Erica. Fleur knows Reed. Ivy knows Jolena. Priscilla knows Doug. Dixie knows Jose. Jackson knows Sandra. Kylie knows Ron. Jose knows Priscilla. Dixie knows Kylie. Doug knows Rosemary. Mike knows Jackson. Mike knows Fleur. Dixie knows Eunice. Jose knows Noah. Jackson knows Hugh. Jose knows Catherine. Which of Ivy and Priscilla can Dixie reach?", "answer": "Priscilla", "steps": [ "Dixie knows Jose.", "Jose knows Priscilla." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Dixie", "Jose", "Catherine", "Doug", "Rosemary", "Noah", "Eunice", "Ron", "Priscilla", "Kylie", "Mike", "Jackson", "Sandra", "Jolena", "Erica", "Hugh", "Sarah", "Reed", "Ivy", "Fleur" ], "edges": [ [ 0, 6 ], [ 0, 1 ], [ 0, 9 ], [ 1, 2 ], [ 1, 5 ], [ 1, 8 ], [ 3, 4 ], [ 8, 3 ], [ 9, 7 ], [ 10, 16 ], [ 10, 11 ], [ 10, 19 ], [ 11, 12 ], [ 11, 15 ], [ 11, 18 ], [ 13, 14 ], [ 18, 13 ], [ 19, 17 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Sierra knows Lana. Judith knows Ezra. Landon knows Sara. Lana knows Fred. Emanuel knows Giselle. Judith knows Chase. Bette knows Judith. Ezra knows Cate. Vivian knows Wesley. Cruz knows Landon. Hunter knows Vivian. Landon knows Jeanne. Cate knows Wanda. Wanda knows Hunter. Fred knows Emanuel. Landon knows Jordan. Jeanne knows Sierra. Judith knows Chloe. Which of Emanuel and Vivian can Bette reach?", "answer": "Vivian", "steps": [ "Bette knows Judith.", "Judith knows Ezra.", "Ezra knows Cate.", "Cate knows Wanda.", "Wanda knows Hunter.", "Hunter knows Vivian." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Bette", "Wesley", "Judith", "Ezra", "Chase", "Hunter", "Cate", "Chloe", "Vivian", "Wanda", "Cruz", "Giselle", "Landon", "Jeanne", "Sara", "Fred", "Sierra", "Jordan", "Emanuel", "Lana" ], "edges": [ [ 0, 2 ], [ 2, 4 ], [ 2, 7 ], [ 2, 3 ], [ 3, 6 ], [ 5, 8 ], [ 6, 9 ], [ 8, 1 ], [ 9, 5 ], [ 10, 12 ], [ 12, 14 ], [ 12, 17 ], [ 12, 13 ], [ 13, 16 ], [ 15, 18 ], [ 16, 19 ], [ 18, 11 ], [ 19, 15 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Alex knows Elvis. Leigh knows Jeff. Wayne knows Erma. Sidney knows Connor. Earl knows Ira. Alfred knows Catherine. Lorna knows Earl. Leigh knows Alfred. Boris knows Jenna. Wayne knows Martha. Catherine knows Boris. Erma knows Lorna. Jenna knows Vance. Catherine knows Mia. Lorna knows Anton. Lorna knows Carey. Carey knows Sidney. Catherine knows Alex. Which of Alfred and Erma can Leigh reach?", "answer": "Alfred", "steps": [ "Leigh knows Alfred." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Leigh", "Jenna", "Jeff", "Boris", "Vance", "Elvis", "Catherine", "Alex", "Alfred", "Mia", "Wayne", "Sidney", "Martha", "Carey", "Connor", "Ira", "Lorna", "Earl", "Erma", "Anton" ], "edges": [ [ 0, 2 ], [ 0, 8 ], [ 1, 4 ], [ 3, 1 ], [ 6, 3 ], [ 6, 7 ], [ 6, 9 ], [ 7, 5 ], [ 8, 6 ], [ 10, 12 ], [ 10, 18 ], [ 11, 14 ], [ 13, 11 ], [ 16, 13 ], [ 16, 17 ], [ 16, 19 ], [ 17, 15 ], [ 18, 16 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Cordelia knows Ezra. Ezra knows Zoe. Anita knows Jodi. Jane knows Adele. Edwin knows Graeme. Maria knows Lilia. Zoe knows Bruno. Graeme knows Hayley. Adele knows Howard. Maude knows Edwin. Jane knows Maude. Zoe knows Russ. Russ knows Eleanor. Edwin knows Maria. Anita knows Holly. Cordelia knows Anita. Bruno knows Pat. Adele knows Allison. Which of Pat and Hayley can Jane reach?", "answer": "Hayley", "steps": [ "Jane knows Maude.", "Maude knows Edwin.", "Edwin knows Graeme.", "Graeme knows Hayley." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Jane", "Allison", "Graeme", "Lilia", "Maude", "Maria", "Hayley", "Howard", "Edwin", "Adele", "Cordelia", "Holly", "Bruno", "Eleanor", "Ezra", "Russ", "Pat", "Jodi", "Zoe", "Anita" ], "edges": [ [ 0, 4 ], [ 0, 9 ], [ 2, 6 ], [ 4, 8 ], [ 5, 3 ], [ 8, 5 ], [ 8, 2 ], [ 9, 1 ], [ 9, 7 ], [ 10, 14 ], [ 10, 19 ], [ 12, 16 ], [ 14, 18 ], [ 15, 13 ], [ 18, 15 ], [ 18, 12 ], [ 19, 11 ], [ 19, 17 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Dean knows Drake. Chandler knows Fernando. Jarvis knows Skyler. Keegan knows Jarvis. Cody knows Walter. Walter knows Opal. Ernesto knows Seth. Fisher knows Ibrahim. Mia knows Heath. Cody knows Bart. Bart knows Chandler. Keegan knows Alice. Odette knows Cody. Seth knows Mia. Skyler knows Ernesto. Fernando knows Fisher. Jarvis knows Dean. Odette knows Curtis. Which of Heath and Ibrahim can Odette reach?", "answer": "Ibrahim", "steps": [ "Odette knows Cody.", "Cody knows Bart.", "Bart knows Chandler.", "Chandler knows Fernando.", "Fernando knows Fisher.", "Fisher knows Ibrahim." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Odette", "Chandler", "Ibrahim", "Fisher", "Bart", "Opal", "Cody", "Curtis", "Fernando", "Walter", "Keegan", "Ernesto", "Heath", "Mia", "Skyler", "Drake", "Jarvis", "Alice", "Seth", "Dean" ], "edges": [ [ 0, 7 ], [ 0, 6 ], [ 1, 8 ], [ 3, 2 ], [ 4, 1 ], [ 6, 4 ], [ 6, 9 ], [ 8, 3 ], [ 9, 5 ], [ 10, 17 ], [ 10, 16 ], [ 11, 18 ], [ 13, 12 ], [ 14, 11 ], [ 16, 14 ], [ 16, 19 ], [ 18, 13 ], [ 19, 15 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Fleur knows Hailey. Samantha knows Archer. Loretta knows Charlotte. Hadley knows Burt. Harriet knows Asher. Burt knows Samantha. Fritz knows Hunter. Teresa knows Norman. Harriet knows Allan. Harriet knows Loretta. Hailey knows Lottie. Burt knows Teresa. Amanda knows Hayes. Burt knows Ross. Hayes knows Fritz. Hunter knows Harriet. Lottie knows Hadley. Asher knows Hank. Which of Harriet and Burt can Amanda reach?", "answer": "Harriet", "steps": [ "Amanda knows Hayes.", "Hayes knows Fritz.", "Fritz knows Hunter.", "Hunter knows Harriet." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Amanda", "Allan", "Hank", "Hunter", "Harriet", "Loretta", "Asher", "Fritz", "Hayes", "Charlotte", "Fleur", "Ross", "Archer", "Hadley", "Burt", "Teresa", "Samantha", "Lottie", "Hailey", "Norman" ], "edges": [ [ 0, 8 ], [ 3, 4 ], [ 4, 1 ], [ 4, 6 ], [ 4, 5 ], [ 5, 9 ], [ 6, 2 ], [ 7, 3 ], [ 8, 7 ], [ 10, 18 ], [ 13, 14 ], [ 14, 11 ], [ 14, 16 ], [ 14, 15 ], [ 15, 19 ], [ 16, 12 ], [ 17, 13 ], [ 18, 17 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Anthony knows Dawn. Marco knows Clay. Chad knows Wendell. Wendell knows Samantha. Kaleb knows Sarah. Damian knows Herman. Keith knows Susanne. Susanne knows Marco. Sarah knows Anthony. Brittany knows Knox. Keith knows Chad. Knox knows Keith. Dawn knows Shelby. Helene knows Luna. Pat knows Brittany. Herman knows Arden. Dawn knows Damian. Shelby knows Helene. Which of Chad and Shelby can Kaleb reach?", "answer": "Shelby", "steps": [ "Kaleb knows Sarah.", "Sarah knows Anthony.", "Anthony knows Dawn.", "Dawn knows Shelby." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Kaleb", "Herman", "Dawn", "Sarah", "Luna", "Shelby", "Damian", "Arden", "Anthony", "Helene", "Pat", "Marco", "Keith", "Brittany", "Samantha", "Chad", "Susanne", "Clay", "Knox", "Wendell" ], "edges": [ [ 0, 3 ], [ 1, 7 ], [ 2, 6 ], [ 2, 5 ], [ 3, 8 ], [ 5, 9 ], [ 6, 1 ], [ 8, 2 ], [ 9, 4 ], [ 10, 13 ], [ 11, 17 ], [ 12, 16 ], [ 12, 15 ], [ 13, 18 ], [ 15, 19 ], [ 16, 11 ], [ 18, 12 ], [ 19, 14 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Brynn knows Reid. Reid knows Chandler. Mindy knows Dell. Alyson knows Gonzalo. Dorian knows Alyson. Tracy knows Virgil. Margaret knows Brynn. Jim knows Dina. Hayes knows Dorian. Elena knows Julio. Dudley knows Diana. Diana knows Mindy. Virgil knows Margaret. Chandler knows Hayes. Simon knows Jim. Sean knows Simon. Julio knows Dudley. Dell knows Sean. Which of Margaret and Dudley can Elena reach?", "answer": "Dudley", "steps": [ "Elena knows Julio.", "Julio knows Dudley." ], "difficulty": 2, "original_distance": 9, "idx_to_symbol": [ "Elena", "Jim", "Simon", "Dudley", "Dina", "Dell", "Julio", "Diana", "Sean", "Mindy", "Tracy", "Alyson", "Dorian", "Margaret", "Gonzalo", "Chandler", "Virgil", "Brynn", "Hayes", "Reid" ], "edges": [ [ 0, 6 ], [ 1, 4 ], [ 2, 1 ], [ 3, 7 ], [ 5, 8 ], [ 6, 3 ], [ 7, 9 ], [ 8, 2 ], [ 9, 5 ], [ 10, 16 ], [ 11, 14 ], [ 12, 11 ], [ 13, 17 ], [ 15, 18 ], [ 16, 13 ], [ 17, 19 ], [ 18, 12 ], [ 19, 15 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Felicia knows Nell. Yara knows Gilbert. Luella knows Edwin. Dora knows Ellis. Luella knows Catherine. Felicia knows Rachel. Gilbert knows Sadie. Hannah knows Dora. Crystal knows Luella. Catherine knows Marcus. Catherine knows Hannah. Cordelia knows Joel. Marcus knows Edmund. Nell knows Miriam. Crystal knows Kristina. Cordelia knows Felicia. Nell knows Yara. Miriam knows Eleanor. Which of Yara and Hannah can Cordelia reach?", "answer": "Yara", "steps": [ "Cordelia knows Felicia.", "Felicia knows Nell.", "Nell knows Yara." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Cordelia", "Eleanor", "Gilbert", "Joel", "Sadie", "Felicia", "Yara", "Nell", "Rachel", "Miriam", "Crystal", "Edmund", "Dora", "Kristina", "Ellis", "Luella", "Hannah", "Catherine", "Edwin", "Marcus" ], "edges": [ [ 0, 3 ], [ 0, 5 ], [ 2, 4 ], [ 5, 8 ], [ 5, 7 ], [ 6, 2 ], [ 7, 6 ], [ 7, 9 ], [ 9, 1 ], [ 10, 13 ], [ 10, 15 ], [ 12, 14 ], [ 15, 18 ], [ 15, 17 ], [ 16, 12 ], [ 17, 16 ], [ 17, 19 ], [ 19, 11 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Jessica knows Henry. Liam knows Geneva. Lamar knows Liam. Jamie knows Alice. Liam knows Tabitha. Marshall knows Jacques. Alice knows Sybil. Layla knows Estella. Henry knows Floyd. Lamar knows Layla. Sam knows Goldie. Jamie knows Arlene. Clifford knows Zara. Sybil knows Lamar. Marshall knows Milo. Floyd knows Clifford. Sam knows Jessica. Floyd knows Marshall. Which of Tabitha and Milo can Jamie reach?", "answer": "Tabitha", "steps": [ "Jamie knows Alice.", "Alice knows Sybil.", "Sybil knows Lamar.", "Lamar knows Liam.", "Liam knows Tabitha." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Jamie", "Geneva", "Estella", "Layla", "Lamar", "Tabitha", "Sybil", "Arlene", "Liam", "Alice", "Sam", "Jacques", "Zara", "Clifford", "Floyd", "Milo", "Henry", "Goldie", "Marshall", "Jessica" ], "edges": [ [ 0, 7 ], [ 0, 9 ], [ 3, 2 ], [ 4, 3 ], [ 4, 8 ], [ 6, 4 ], [ 8, 1 ], [ 8, 5 ], [ 9, 6 ], [ 10, 17 ], [ 10, 19 ], [ 13, 12 ], [ 14, 13 ], [ 14, 18 ], [ 16, 14 ], [ 18, 11 ], [ 18, 15 ], [ 19, 16 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Darwin knows Stella. Sebastian knows Michael. Donna knows Shannon. Lenora knows Brynn. Kit knows Alejandro. Kit knows Lenora. Bailey knows Jewel. Lenora knows Esther. Donna knows Fisher. Bailey knows Ernesto. Donna knows Duncan. Darwin knows Maude. Lenora knows Tina. Sebastian knows Darwin. Bailey knows Ray. Ernesto knows Sebastian. Shannon knows Kit. Darwin knows Foster. Which of Darwin and Lenora can Donna reach?", "answer": "Lenora", "steps": [ "Donna knows Shannon.", "Shannon knows Kit.", "Kit knows Lenora." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Donna", "Fisher", "Lenora", "Tina", "Esther", "Brynn", "Shannon", "Alejandro", "Kit", "Duncan", "Bailey", "Ray", "Darwin", "Stella", "Maude", "Foster", "Ernesto", "Michael", "Sebastian", "Jewel" ], "edges": [ [ 0, 1 ], [ 0, 6 ], [ 0, 9 ], [ 2, 3 ], [ 2, 4 ], [ 2, 5 ], [ 6, 8 ], [ 8, 2 ], [ 8, 7 ], [ 10, 11 ], [ 10, 16 ], [ 10, 19 ], [ 12, 13 ], [ 12, 14 ], [ 12, 15 ], [ 16, 18 ], [ 18, 12 ], [ 18, 17 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Zara knows Electra. Pearl knows Todd. Whitney knows Victoria. Pearl knows Morris. Zara knows Kirk. Morris knows Donald. Whitney knows Fabian. Pearl knows Dalton. Julian knows Pearl. Victoria knows Bella. Whitney knows Zara. Harold knows Whitney. Todd knows Beatrice. Todd knows Cody. Whitney knows Nicholas. Pearl knows Darrell. Donald knows Julio. Bella knows Betty. Which of Victoria and Morris can Harold reach?", "answer": "Victoria", "steps": [ "Harold knows Whitney.", "Whitney knows Victoria." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Harold", "Whitney", "Zara", "Bella", "Betty", "Victoria", "Nicholas", "Fabian", "Electra", "Kirk", "Julian", "Pearl", "Todd", "Donald", "Julio", "Morris", "Dalton", "Darrell", "Cody", "Beatrice" ], "edges": [ [ 0, 1 ], [ 1, 5 ], [ 1, 6 ], [ 1, 7 ], [ 1, 2 ], [ 2, 8 ], [ 2, 9 ], [ 3, 4 ], [ 5, 3 ], [ 10, 11 ], [ 11, 15 ], [ 11, 16 ], [ 11, 17 ], [ 11, 12 ], [ 12, 18 ], [ 12, 19 ], [ 13, 14 ], [ 15, 13 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Alan knows Lena. Gerard knows Hunter. Hunter knows Maureen. Dawn knows Marlene. Keith knows Hank. Hank knows Emery. Keith knows Clinton. Gerard knows Ben. Darla knows Nell. Eli knows Marian. Eli knows Gerard. Lilia knows Ashton. Nell knows Dawn. Ben knows Zach. Lilia knows Keith. Lena knows Ariana. Zach knows Alan. Clinton knows Darla. Which of Dawn and Lena can Eli reach?", "answer": "Lena", "steps": [ "Eli knows Gerard.", "Gerard knows Ben.", "Ben knows Zach.", "Zach knows Alan.", "Alan knows Lena." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Eli", "Alan", "Lena", "Ben", "Maureen", "Hunter", "Marian", "Ariana", "Gerard", "Zach", "Lilia", "Nell", "Dawn", "Clinton", "Emery", "Hank", "Ashton", "Marlene", "Keith", "Darla" ], "edges": [ [ 0, 6 ], [ 0, 8 ], [ 1, 2 ], [ 2, 7 ], [ 3, 9 ], [ 5, 4 ], [ 8, 5 ], [ 8, 3 ], [ 9, 1 ], [ 10, 16 ], [ 10, 18 ], [ 11, 12 ], [ 12, 17 ], [ 13, 19 ], [ 15, 14 ], [ 18, 15 ], [ 18, 13 ], [ 19, 11 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Kay knows Neal. Calvin knows Olive. Gunnar knows Eunice. Burt knows Hunter. Amelia knows Lana. Gunnar knows Russell. Frank knows Gabriel. Russell knows Drew. Burt knows Wilma. Hunter knows Hailey. Drew knows Calvin. Amelia knows Ingrid. Gabriel knows Melody. Ingrid knows Frank. Hunter knows Gunnar. Cassidy knows Bart. Kay knows Amelia. Cassidy knows Kay. Which of Olive and Melody can Cassidy reach?", "answer": "Melody", "steps": [ "Cassidy knows Kay.", "Kay knows Amelia.", "Amelia knows Ingrid.", "Ingrid knows Frank.", "Frank knows Gabriel.", "Gabriel knows Melody." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Cassidy", "Gabriel", "Kay", "Frank", "Bart", "Melody", "Ingrid", "Neal", "Amelia", "Lana", "Burt", "Calvin", "Hunter", "Drew", "Wilma", "Olive", "Russell", "Hailey", "Gunnar", "Eunice" ], "edges": [ [ 0, 4 ], [ 0, 2 ], [ 1, 5 ], [ 2, 7 ], [ 2, 8 ], [ 3, 1 ], [ 6, 3 ], [ 8, 6 ], [ 8, 9 ], [ 10, 14 ], [ 10, 12 ], [ 11, 15 ], [ 12, 17 ], [ 12, 18 ], [ 13, 11 ], [ 16, 13 ], [ 18, 16 ], [ 18, 19 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Jeffery knows Israel. Terry knows Levi. Jeffery knows Russell. Becky knows Daphne. Jay knows Adelaide. Russell knows Marie. Jill knows Ignacio. Ignacio knows Terry. Becky knows Belinda. Daphne knows Dudley. Levi knows Francesca. Marie knows Dee. Jeffery knows Leigh. Daphne knows Jill. Bennett knows Jeffery. Bennett knows Eric. Daphne knows Camille. Dee knows Jay. Which of Levi and Jay can Becky reach?", "answer": "Levi", "steps": [ "Becky knows Daphne.", "Daphne knows Jill.", "Jill knows Ignacio.", "Ignacio knows Terry.", "Terry knows Levi." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Becky", "Levi", "Belinda", "Daphne", "Dudley", "Terry", "Ignacio", "Francesca", "Jill", "Camille", "Bennett", "Jay", "Eric", "Jeffery", "Leigh", "Dee", "Marie", "Adelaide", "Russell", "Israel" ], "edges": [ [ 0, 2 ], [ 0, 3 ], [ 1, 7 ], [ 3, 4 ], [ 3, 8 ], [ 3, 9 ], [ 5, 1 ], [ 6, 5 ], [ 8, 6 ], [ 10, 12 ], [ 10, 13 ], [ 11, 17 ], [ 13, 14 ], [ 13, 18 ], [ 13, 19 ], [ 15, 11 ], [ 16, 15 ], [ 18, 16 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Aiden knows Larissa. Calvin knows Mabel. Aiden knows Declan. Anastasia knows Jermaine. Anastasia knows Leticia. Aiden knows Willard. Mabel knows Preston. Eamon knows Sandra. Jocelyn knows Trevor. Donna knows Anastasia. Jocelyn knows Larry. Larissa knows Jocelyn. Aiden knows Frida. Anastasia knows Eamon. Mabel knows Beth. Anastasia knows Calvin. Sean knows Aiden. Willard knows Gerard. Which of Anastasia and Aiden can Donna reach?", "answer": "Anastasia", "steps": [ "Donna knows Anastasia." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Donna", "Leticia", "Calvin", "Preston", "Anastasia", "Sandra", "Jermaine", "Beth", "Mabel", "Eamon", "Sean", "Declan", "Larissa", "Trevor", "Aiden", "Gerard", "Frida", "Larry", "Jocelyn", "Willard" ], "edges": [ [ 0, 4 ], [ 2, 8 ], [ 4, 1 ], [ 4, 6 ], [ 4, 2 ], [ 4, 9 ], [ 8, 3 ], [ 8, 7 ], [ 9, 5 ], [ 10, 14 ], [ 12, 18 ], [ 14, 11 ], [ 14, 16 ], [ 14, 12 ], [ 14, 19 ], [ 18, 13 ], [ 18, 17 ], [ 19, 15 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Garrison knows Fleur. Uma knows Bryan. Jerry knows Caroline. Clyde knows Cody. Otto knows Florence. Clyde knows Darcy. Francesca knows Lauren. Florence knows Jillian. Otto knows Jerry. Douglas knows Francesca. Douglas knows Corey. Clyde knows Sara. Sara knows Elena. Cody knows Garrison. Darcy knows Barry. Otto knows Douglas. Darcy knows Uma. Caroline knows Inez. Which of Fleur and Inez can Otto reach?", "answer": "Inez", "steps": [ "Otto knows Jerry.", "Jerry knows Caroline.", "Caroline knows Inez." ], "difficulty": 3, "original_distance": 3, "idx_to_symbol": [ "Otto", "Corey", "Jerry", "Jillian", "Lauren", "Inez", "Douglas", "Florence", "Francesca", "Caroline", "Clyde", "Barry", "Cody", "Elena", "Bryan", "Fleur", "Darcy", "Sara", "Uma", "Garrison" ], "edges": [ [ 0, 7 ], [ 0, 6 ], [ 0, 2 ], [ 2, 9 ], [ 6, 1 ], [ 6, 8 ], [ 7, 3 ], [ 8, 4 ], [ 9, 5 ], [ 10, 17 ], [ 10, 16 ], [ 10, 12 ], [ 12, 19 ], [ 16, 11 ], [ 16, 18 ], [ 17, 13 ], [ 18, 14 ], [ 19, 15 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Leah knows Luz. Clara knows Michelle. Norma knows Corey. Maude knows Estelle. Norma knows Elijah. Nicole knows Leah. Darren knows Rose. Ariel knows Sebastian. Theodore knows Cameron. Ariel knows Clara. Maude knows Norma. Clark knows Adam. Michelle knows Nicole. Clara knows Theodore. Clara knows Trina. Rose knows Clark. Elijah knows Alexa. Norma knows Darren. Which of Luz and Adam can Ariel reach?", "answer": "Luz", "steps": [ "Ariel knows Clara.", "Clara knows Michelle.", "Michelle knows Nicole.", "Nicole knows Leah.", "Leah knows Luz." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Ariel", "Michelle", "Trina", "Cameron", "Sebastian", "Luz", "Clara", "Theodore", "Nicole", "Leah", "Maude", "Darren", "Corey", "Alexa", "Estelle", "Adam", "Norma", "Elijah", "Rose", "Clark" ], "edges": [ [ 0, 4 ], [ 0, 6 ], [ 1, 8 ], [ 6, 2 ], [ 6, 7 ], [ 6, 1 ], [ 7, 3 ], [ 8, 9 ], [ 9, 5 ], [ 10, 14 ], [ 10, 16 ], [ 11, 18 ], [ 16, 12 ], [ 16, 17 ], [ 16, 11 ], [ 17, 13 ], [ 18, 19 ], [ 19, 15 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Keegan knows Frances. Bennett knows Derrick. Bruno knows Bart. Dolores knows Merle. Chance knows Max. Derrick knows Jeremy. Bennett knows Warren. Keegan knows Jasper. Fergus knows Ashton. Warren knows Finn. Maude knows Dolores. Bruno knows Arden. Jeremy knows Chance. Frances knows Maude. Maude knows Yvette. Bart knows Bennett. Yvette knows Jonas. Jonas knows Fergus. Which of Jeremy and Jonas can Keegan reach?", "answer": "Jonas", "steps": [ "Keegan knows Frances.", "Frances knows Maude.", "Maude knows Yvette.", "Yvette knows Jonas." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Keegan", "Dolores", "Fergus", "Yvette", "Ashton", "Maude", "Frances", "Merle", "Jasper", "Jonas", "Bruno", "Warren", "Chance", "Derrick", "Max", "Bennett", "Bart", "Finn", "Arden", "Jeremy" ], "edges": [ [ 0, 8 ], [ 0, 6 ], [ 1, 7 ], [ 2, 4 ], [ 3, 9 ], [ 5, 1 ], [ 5, 3 ], [ 6, 5 ], [ 9, 2 ], [ 10, 18 ], [ 10, 16 ], [ 11, 17 ], [ 12, 14 ], [ 13, 19 ], [ 15, 11 ], [ 15, 13 ], [ 16, 15 ], [ 19, 12 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Darin knows Elton. Jean knows George. Adam knows Ilene. Diego knows Dixie. Felix knows Fred. Jean knows Jacques. Jean knows Diego. Paige knows Austin. Colby knows Felix. Colby knows Griffith. Fred knows Wade. Felix knows Adam. Dave knows Carter. Colby knows Clement. Colby knows Darin. Jacques knows Dave. Jean knows Hayley. Jacques knows Paige. Which of Fred and Paige can Jean reach?", "answer": "Paige", "steps": [ "Jean knows Jacques.", "Jacques knows Paige." ], "difficulty": 2, "original_distance": 3, "idx_to_symbol": [ "Jean", "Paige", "Jacques", "Carter", "Diego", "George", "Dave", "Dixie", "Austin", "Hayley", "Colby", "Fred", "Felix", "Ilene", "Darin", "Clement", "Adam", "Elton", "Wade", "Griffith" ], "edges": [ [ 0, 5 ], [ 0, 4 ], [ 0, 2 ], [ 0, 9 ], [ 1, 8 ], [ 2, 6 ], [ 2, 1 ], [ 4, 7 ], [ 6, 3 ], [ 10, 15 ], [ 10, 14 ], [ 10, 12 ], [ 10, 19 ], [ 11, 18 ], [ 12, 16 ], [ 12, 11 ], [ 14, 17 ], [ 16, 13 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Constance knows Lisette. Drake knows Eldon. Aiden knows Robin. Eldon knows Brock. Cole knows Adele. Cole knows Jacob. Constance knows Lawrence. Constance knows Eileen. Robin knows Diane. Drake knows Craig. Jana knows Etta. Lisette knows Jana. Beth knows Constance. Cole knows Neville. Asher knows Cole. Jacob knows Drake. Jana knows Aiden. Brock knows Emmett. Which of Brock and Robin can Beth reach?", "answer": "Robin", "steps": [ "Beth knows Constance.", "Constance knows Lisette.", "Lisette knows Jana.", "Jana knows Aiden.", "Aiden knows Robin." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Beth", "Lawrence", "Etta", "Aiden", "Robin", "Eileen", "Diane", "Jana", "Constance", "Lisette", "Asher", "Neville", "Craig", "Eldon", "Brock", "Adele", "Emmett", "Drake", "Cole", "Jacob" ], "edges": [ [ 0, 8 ], [ 3, 4 ], [ 4, 6 ], [ 7, 2 ], [ 7, 3 ], [ 8, 1 ], [ 8, 5 ], [ 8, 9 ], [ 9, 7 ], [ 10, 18 ], [ 13, 14 ], [ 14, 16 ], [ 17, 12 ], [ 17, 13 ], [ 18, 11 ], [ 18, 15 ], [ 18, 19 ], [ 19, 17 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Gus knows Aaron. Gus knows Anton. Melissa knows Jerry. Hayley knows Homer. Rufus knows Amanda. Hayley knows Grant. Annie knows Garrison. Aaron knows Melissa. Selena knows Oliver. Hayley knows Theodore. Gus knows Harry. Garrison knows Kathleen. Oliver knows Eloise. Oliver knows Kendrick. Melissa knows Stefan. Homer knows Rufus. Gus knows Annie. Hayley knows Selena. Which of Melissa and Oliver can Hayley reach?", "answer": "Oliver", "steps": [ "Hayley knows Selena.", "Selena knows Oliver." ], "difficulty": 2, "original_distance": 3, "idx_to_symbol": [ "Hayley", "Theodore", "Oliver", "Selena", "Grant", "Amanda", "Kendrick", "Eloise", "Rufus", "Homer", "Gus", "Anton", "Melissa", "Aaron", "Harry", "Kathleen", "Jerry", "Stefan", "Garrison", "Annie" ], "edges": [ [ 0, 1 ], [ 0, 4 ], [ 0, 3 ], [ 0, 9 ], [ 2, 6 ], [ 2, 7 ], [ 3, 2 ], [ 8, 5 ], [ 9, 8 ], [ 10, 11 ], [ 10, 14 ], [ 10, 13 ], [ 10, 19 ], [ 12, 16 ], [ 12, 17 ], [ 13, 12 ], [ 18, 15 ], [ 19, 18 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Randy knows Preston. Robin knows Billy. Randy knows Penny. Robin knows Brett. Robin knows Asher. Arthur knows Scott. Dallas knows Joseph. Itzel knows Hadley. Randy knows Dallas. Asher knows Farrah. Robin knows Arthur. Itzel knows Craig. Joseph knows Lorraine. Randy knows Betty. Farrah knows Clifford. Betty knows Itzel. Scott knows Cora. Farrah knows Justine. Which of Justine and Craig can Robin reach?", "answer": "Justine", "steps": [ "Robin knows Asher.", "Asher knows Farrah.", "Farrah knows Justine." ], "difficulty": 3, "original_distance": 3, "idx_to_symbol": [ "Robin", "Justine", "Clifford", "Brett", "Cora", "Scott", "Billy", "Farrah", "Arthur", "Asher", "Randy", "Craig", "Hadley", "Preston", "Lorraine", "Joseph", "Penny", "Itzel", "Dallas", "Betty" ], "edges": [ [ 0, 3 ], [ 0, 6 ], [ 0, 8 ], [ 0, 9 ], [ 5, 4 ], [ 7, 1 ], [ 7, 2 ], [ 8, 5 ], [ 9, 7 ], [ 10, 13 ], [ 10, 16 ], [ 10, 18 ], [ 10, 19 ], [ 15, 14 ], [ 17, 11 ], [ 17, 12 ], [ 18, 15 ], [ 19, 17 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Derek knows Ember. Graeme knows Eleanor. Dell knows Bruno. Walter knows Dell. Jodi knows Diane. Diane knows Justine. Jocelyn knows Mia. Lyric knows Odette. Dell knows Carmela. Carmela knows Belinda. Justine knows Lyric. Bruno knows Garland. Justine knows Derek. Jodi knows Lacey. Justine knows Graeme. Raquel knows Walter. Raquel knows Olivia. Dell knows Jocelyn. Which of Ember and Mia can Raquel reach?", "answer": "Mia", "steps": [ "Raquel knows Walter.", "Walter knows Dell.", "Dell knows Jocelyn.", "Jocelyn knows Mia." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Raquel", "Carmela", "Bruno", "Dell", "Garland", "Olivia", "Belinda", "Jocelyn", "Mia", "Walter", "Jodi", "Graeme", "Lyric", "Justine", "Odette", "Lacey", "Eleanor", "Derek", "Ember", "Diane" ], "edges": [ [ 0, 5 ], [ 0, 9 ], [ 1, 6 ], [ 2, 4 ], [ 3, 2 ], [ 3, 1 ], [ 3, 7 ], [ 7, 8 ], [ 9, 3 ], [ 10, 15 ], [ 10, 19 ], [ 11, 16 ], [ 12, 14 ], [ 13, 12 ], [ 13, 11 ], [ 13, 17 ], [ 17, 18 ], [ 19, 13 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Spencer knows Archer. Victor knows Gemma. Victor knows Margaret. Luna knows Dawn. Dawn knows Preston. Camille knows Pablo. Patrick knows Luna. Kerry knows Kent. Kobe knows Kay. Archer knows Kerry. Jacqueline knows Spencer. Gemma knows Farrah. Margaret knows Zane. Archer knows Kobe. Spencer knows Camille. Jacqueline knows Jeanette. Patrick knows Patricia. Luna knows Victor. Which of Kerry and Gemma can Jacqueline reach?", "answer": "Kerry", "steps": [ "Jacqueline knows Spencer.", "Spencer knows Archer.", "Archer knows Kerry." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Jacqueline", "Pablo", "Camille", "Archer", "Kay", "Kobe", "Jeanette", "Spencer", "Kerry", "Kent", "Patrick", "Preston", "Dawn", "Victor", "Zane", "Margaret", "Patricia", "Luna", "Gemma", "Farrah" ], "edges": [ [ 0, 6 ], [ 0, 7 ], [ 2, 1 ], [ 3, 5 ], [ 3, 8 ], [ 5, 4 ], [ 7, 2 ], [ 7, 3 ], [ 8, 9 ], [ 10, 16 ], [ 10, 17 ], [ 12, 11 ], [ 13, 15 ], [ 13, 18 ], [ 15, 14 ], [ 17, 12 ], [ 17, 13 ], [ 18, 19 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Cara knows Bette. Winifred knows Maude. Hendrix knows Wilma. Luella knows Hudson. Donna knows Cara. Milton knows Erik. Tonya knows Hendrix. Destiny knows Hadley. Hudson knows Winifred. Maude knows Milton. Hendrix knows Wanda. Wanda knows Bill. Hadley knows Skyler. Donna knows Nicholas. Milton knows Destiny. Luella knows Essie. Bette knows Tonya. Bill knows Peggy. Which of Hadley and Bill can Donna reach?", "answer": "Bill", "steps": [ "Donna knows Cara.", "Cara knows Bette.", "Bette knows Tonya.", "Tonya knows Hendrix.", "Hendrix knows Wanda.", "Wanda knows Bill." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Donna", "Tonya", "Cara", "Wilma", "Bette", "Peggy", "Wanda", "Bill", "Hendrix", "Nicholas", "Luella", "Maude", "Hudson", "Erik", "Winifred", "Skyler", "Destiny", "Hadley", "Milton", "Essie" ], "edges": [ [ 0, 2 ], [ 0, 9 ], [ 1, 8 ], [ 2, 4 ], [ 4, 1 ], [ 6, 7 ], [ 7, 5 ], [ 8, 3 ], [ 8, 6 ], [ 10, 12 ], [ 10, 19 ], [ 11, 18 ], [ 12, 14 ], [ 14, 11 ], [ 16, 17 ], [ 17, 15 ], [ 18, 13 ], [ 18, 16 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Brian knows Aldo. Lorraine knows Troy. Winston knows Derek. Jerry knows Harley. Jerry knows Diego. Harry knows Brian. Grant knows Lorraine. Autumn knows Frida. Troy knows Jerry. Aldo knows Jeff. Harley knows Autumn. Jeff knows Doris. Louisa knows Harry. Doris knows Willard. Diego knows Darrell. Aldo knows Winston. Winston knows Cora. Diego knows Dawn. Which of Troy and Brian can Louisa reach?", "answer": "Brian", "steps": [ "Louisa knows Harry.", "Harry knows Brian." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Louisa", "Willard", "Brian", "Derek", "Aldo", "Doris", "Jeff", "Harry", "Cora", "Winston", "Grant", "Frida", "Troy", "Darrell", "Jerry", "Autumn", "Harley", "Lorraine", "Dawn", "Diego" ], "edges": [ [ 0, 7 ], [ 2, 4 ], [ 4, 6 ], [ 4, 9 ], [ 5, 1 ], [ 6, 5 ], [ 7, 2 ], [ 9, 3 ], [ 9, 8 ], [ 10, 17 ], [ 12, 14 ], [ 14, 16 ], [ 14, 19 ], [ 15, 11 ], [ 16, 15 ], [ 17, 12 ], [ 19, 13 ], [ 19, 18 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Pete knows Kirk. Jackson knows Ricardo. Louise knows Janet. Louise knows Dee. Abigail knows Oscar. Sean knows Sandra. Louise knows Bella. Billy knows Abigail. Bella knows Kareem. Sean knows Jackson. Sean knows Will. Abigail knows Rocco. Sandra knows Louise. Rocco knows Kimberly. Katrina knows Donald. Abigail knows Blake. Pete knows Katrina. Pete knows Billy. Which of Louise and Abigail can Pete reach?", "answer": "Abigail", "steps": [ "Pete knows Billy.", "Billy knows Abigail." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Pete", "Kimberly", "Billy", "Rocco", "Kirk", "Abigail", "Oscar", "Donald", "Blake", "Katrina", "Sean", "Kareem", "Sandra", "Bella", "Will", "Louise", "Janet", "Ricardo", "Dee", "Jackson" ], "edges": [ [ 0, 4 ], [ 0, 2 ], [ 0, 9 ], [ 2, 5 ], [ 3, 1 ], [ 5, 3 ], [ 5, 6 ], [ 5, 8 ], [ 9, 7 ], [ 10, 14 ], [ 10, 12 ], [ 10, 19 ], [ 12, 15 ], [ 13, 11 ], [ 15, 13 ], [ 15, 16 ], [ 15, 18 ], [ 19, 17 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Carmen knows Alyssa. Miriam knows Austin. Kieran knows Gordon. Kieran knows Miriam. Dominic knows Mark. Austin knows Cassidy. Hilda knows Faith. Essie knows Elmer. Andre knows Daniel. Essie knows Delia. Mark knows Essie. Faith knows Carmen. Andre knows Belinda. Carmen knows Jillian. Merle knows Latoya. Hilda knows Andre. Daniel knows Merle. Dominic knows Kieran. Which of Kieran and Andre can Dominic reach?", "answer": "Kieran", "steps": [ "Dominic knows Kieran." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Dominic", "Elmer", "Austin", "Gordon", "Delia", "Kieran", "Mark", "Cassidy", "Miriam", "Essie", "Hilda", "Alyssa", "Merle", "Belinda", "Jillian", "Andre", "Faith", "Latoya", "Daniel", "Carmen" ], "edges": [ [ 0, 5 ], [ 0, 6 ], [ 2, 7 ], [ 5, 3 ], [ 5, 8 ], [ 6, 9 ], [ 8, 2 ], [ 9, 1 ], [ 9, 4 ], [ 10, 15 ], [ 10, 16 ], [ 12, 17 ], [ 15, 13 ], [ 15, 18 ], [ 16, 19 ], [ 18, 12 ], [ 19, 11 ], [ 19, 14 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Marshall knows Hardy. Francesca knows Blair. Fred knows Goldie. Marshall knows Francesca. Julio knows Kaleb. Eugenia knows Claudia. Pedro knows Julio. Fred knows Noah. Claudia knows Marilyn. Eugenia knows Marshall. Blair knows Tony. Noah knows Geneva. Pedro knows Fred. Tony knows Vanessa. Goldie knows Parker. Parker knows Valerie. Hardy knows Beverly. Valerie knows Jessie. Which of Jessie and Vanessa can Pedro reach?", "answer": "Jessie", "steps": [ "Pedro knows Fred.", "Fred knows Goldie.", "Goldie knows Parker.", "Parker knows Valerie.", "Valerie knows Jessie." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Pedro", "Kaleb", "Noah", "Julio", "Valerie", "Goldie", "Geneva", "Parker", "Jessie", "Fred", "Eugenia", "Marilyn", "Hardy", "Claudia", "Tony", "Francesca", "Beverly", "Blair", "Vanessa", "Marshall" ], "edges": [ [ 0, 3 ], [ 0, 9 ], [ 2, 6 ], [ 3, 1 ], [ 4, 8 ], [ 5, 7 ], [ 7, 4 ], [ 9, 2 ], [ 9, 5 ], [ 10, 13 ], [ 10, 19 ], [ 12, 16 ], [ 13, 11 ], [ 14, 18 ], [ 15, 17 ], [ 17, 14 ], [ 19, 12 ], [ 19, 15 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Gonzalo knows Luella. Linda knows Tyler. Ted knows Kimberly. Joshua knows Ian. Rena knows Kate. Autumn knows Kenneth. Ted knows Zelda. Kimberly knows Esme. Tyler knows Rena. Gonzalo knows Joshua. Tyler knows Hayden. Esme knows Winifred. Allison knows Cecilia. Alma knows Sally. Kenneth knows Alma. Winifred knows Linda. Sally knows Gonzalo. Allison knows Autumn. Which of Winifred and Alma can Ted reach?", "answer": "Winifred", "steps": [ "Ted knows Kimberly.", "Kimberly knows Esme.", "Esme knows Winifred." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Ted", "Hayden", "Tyler", "Kimberly", "Kate", "Esme", "Linda", "Rena", "Zelda", "Winifred", "Allison", "Luella", "Gonzalo", "Autumn", "Ian", "Kenneth", "Sally", "Joshua", "Cecilia", "Alma" ], "edges": [ [ 0, 8 ], [ 0, 3 ], [ 2, 1 ], [ 2, 7 ], [ 3, 5 ], [ 5, 9 ], [ 6, 2 ], [ 7, 4 ], [ 9, 6 ], [ 10, 18 ], [ 10, 13 ], [ 12, 11 ], [ 12, 17 ], [ 13, 15 ], [ 15, 19 ], [ 16, 12 ], [ 17, 14 ], [ 19, 16 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Helene knows Dennis. Nina knows Lyle. Mia knows Jermaine. Jay knows Blair. Rhonda knows Eva. Adele knows Billy. Helene knows Adele. Sean knows Sam. Helene knows Rhonda. Hayden knows Helene. Blair knows Fern. Jermaine knows Dominic. Helene knows Joyce. Blair knows Mia. Samantha knows Javier. Dennis knows Samantha. Blair knows Sean. Blair knows Nina. Which of Mia and Dennis can Hayden reach?", "answer": "Dennis", "steps": [ "Hayden knows Helene.", "Helene knows Dennis." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Hayden", "Samantha", "Joyce", "Billy", "Dennis", "Helene", "Adele", "Rhonda", "Eva", "Javier", "Jay", "Jermaine", "Fern", "Sam", "Mia", "Blair", "Sean", "Nina", "Lyle", "Dominic" ], "edges": [ [ 0, 5 ], [ 1, 9 ], [ 4, 1 ], [ 5, 2 ], [ 5, 6 ], [ 5, 7 ], [ 5, 4 ], [ 6, 3 ], [ 7, 8 ], [ 10, 15 ], [ 11, 19 ], [ 14, 11 ], [ 15, 12 ], [ 15, 16 ], [ 15, 17 ], [ 15, 14 ], [ 16, 13 ], [ 17, 18 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Brittany knows Louis. Kim knows Raymond. Noel knows Douglas. Goldie knows Atlas. Raymond knows Austin. Mary knows Tara. Yuki knows Mary. Donovan knows Yuki. Louis knows Lyle. Damian knows Autumn. Douglas knows Goldie. Gregory knows Kim. Autumn knows Gregory. Tamara knows Brittany. Mary knows Tamara. Gregory knows Noel. Nadine knows Nicole. Tara knows Nadine. Which of Douglas and Brittany can Damian reach?", "answer": "Douglas", "steps": [ "Damian knows Autumn.", "Autumn knows Gregory.", "Gregory knows Noel.", "Noel knows Douglas." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Damian", "Kim", "Douglas", "Autumn", "Austin", "Gregory", "Atlas", "Raymond", "Goldie", "Noel", "Donovan", "Tara", "Brittany", "Yuki", "Nicole", "Mary", "Lyle", "Nadine", "Louis", "Tamara" ], "edges": [ [ 0, 3 ], [ 1, 7 ], [ 2, 8 ], [ 3, 5 ], [ 5, 1 ], [ 5, 9 ], [ 7, 4 ], [ 8, 6 ], [ 9, 2 ], [ 10, 13 ], [ 11, 17 ], [ 12, 18 ], [ 13, 15 ], [ 15, 11 ], [ 15, 19 ], [ 17, 14 ], [ 18, 16 ], [ 19, 12 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Clay knows Yara. Quinn knows Alan. Margaret knows Opal. Kennedy knows Hailey. Hailey knows Cornelius. Nicole knows Margaret. Clara knows Clay. Zack knows Helene. Brody knows Kennedy. Clay knows Zack. Clay knows Allison. Clara knows Nicole. Alan knows Lionel. Kennedy knows Dennis. Kennedy knows Cody. Cody knows Carlton. Allison knows Thea. Brody knows Quinn. Which of Hailey and Zack can Clara reach?", "answer": "Zack", "steps": [ "Clara knows Clay.", "Clay knows Zack." ], "difficulty": 2, "original_distance": 3, "idx_to_symbol": [ "Clara", "Opal", "Thea", "Clay", "Yara", "Zack", "Helene", "Margaret", "Allison", "Nicole", "Brody", "Lionel", "Carlton", "Kennedy", "Dennis", "Hailey", "Cornelius", "Alan", "Cody", "Quinn" ], "edges": [ [ 0, 3 ], [ 0, 9 ], [ 3, 4 ], [ 3, 5 ], [ 3, 8 ], [ 5, 6 ], [ 7, 1 ], [ 8, 2 ], [ 9, 7 ], [ 10, 13 ], [ 10, 19 ], [ 13, 14 ], [ 13, 15 ], [ 13, 18 ], [ 15, 16 ], [ 17, 11 ], [ 18, 12 ], [ 19, 17 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Aspen knows Carla. Garrison knows Aspen. Aspen knows Greg. Aspen knows Callum. Clinton knows Darla. Darla knows Peter. Bennett knows Celia. Heather knows Garrison. Celia knows Jesse. Federico knows Anton. Callum knows Barry. Federico knows Glenn. Glenn knows Eli. Jesse knows Federico. Donald knows Aiden. Federico knows Raquel. Bennett knows Donald. Clinton knows Heather. Which of Federico and Aspen can Bennett reach?", "answer": "Federico", "steps": [ "Bennett knows Celia.", "Celia knows Jesse.", "Jesse knows Federico." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Bennett", "Anton", "Eli", "Federico", "Aiden", "Celia", "Donald", "Glenn", "Raquel", "Jesse", "Clinton", "Carla", "Barry", "Aspen", "Peter", "Heather", "Darla", "Callum", "Greg", "Garrison" ], "edges": [ [ 0, 6 ], [ 0, 5 ], [ 3, 1 ], [ 3, 7 ], [ 3, 8 ], [ 5, 9 ], [ 6, 4 ], [ 7, 2 ], [ 9, 3 ], [ 10, 16 ], [ 10, 15 ], [ 13, 11 ], [ 13, 17 ], [ 13, 18 ], [ 15, 19 ], [ 16, 14 ], [ 17, 12 ], [ 19, 13 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Greer knows Alicia. Clara knows Linda. Bernard knows Conner. Bernard knows Deirdre. Deirdre knows Lauren. Cara knows Bill. Callum knows Clara. Cara knows Gordon. Clara knows Cara. Garland knows Callum. Lauren knows Kelsey. Kelsey knows Vanessa. Langston knows Jeff. Gordon knows Greer. Carrie knows Bernard. Jeff knows Carrie. Carrie knows Marie. Alicia knows Deanna. Which of Lauren and Greer can Garland reach?", "answer": "Greer", "steps": [ "Garland knows Callum.", "Callum knows Clara.", "Clara knows Cara.", "Cara knows Gordon.", "Gordon knows Greer." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Garland", "Bill", "Linda", "Cara", "Clara", "Alicia", "Callum", "Deanna", "Gordon", "Greer", "Langston", "Conner", "Marie", "Bernard", "Carrie", "Kelsey", "Jeff", "Vanessa", "Deirdre", "Lauren" ], "edges": [ [ 0, 6 ], [ 3, 1 ], [ 3, 8 ], [ 4, 2 ], [ 4, 3 ], [ 5, 7 ], [ 6, 4 ], [ 8, 9 ], [ 9, 5 ], [ 10, 16 ], [ 13, 11 ], [ 13, 18 ], [ 14, 12 ], [ 14, 13 ], [ 15, 17 ], [ 16, 14 ], [ 18, 19 ], [ 19, 15 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Keegan knows Frances. Bennett knows Derrick. Bruno knows Bart. Dolores knows Merle. Chance knows Max. Derrick knows Jeremy. Bennett knows Warren. Keegan knows Jasper. Fergus knows Ashton. Warren knows Finn. Maude knows Dolores. Bruno knows Arden. Jeremy knows Chance. Frances knows Maude. Maude knows Yvette. Bart knows Bennett. Yvette knows Jonas. Jonas knows Fergus. Which of Derrick and Yvette can Keegan reach?", "answer": "Yvette", "steps": [ "Keegan knows Frances.", "Frances knows Maude.", "Maude knows Yvette." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Keegan", "Dolores", "Fergus", "Yvette", "Ashton", "Maude", "Frances", "Merle", "Jasper", "Jonas", "Bruno", "Warren", "Chance", "Derrick", "Max", "Bennett", "Bart", "Finn", "Arden", "Jeremy" ], "edges": [ [ 0, 8 ], [ 0, 6 ], [ 1, 7 ], [ 2, 4 ], [ 3, 9 ], [ 5, 1 ], [ 5, 3 ], [ 6, 5 ], [ 9, 2 ], [ 10, 18 ], [ 10, 16 ], [ 11, 17 ], [ 12, 14 ], [ 13, 19 ], [ 15, 11 ], [ 15, 13 ], [ 16, 15 ], [ 19, 12 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Edward knows Edmund. Kane knows Cameron. Kelsey knows Rose. Rena knows Leigh. Luther knows Jake. Luther knows Ron. Leigh knows Maya. Jared knows Linda. Maya knows Axel. Rena knows Tara. Leigh knows Dakota. Jake knows Kelsey. Edmund knows Luther. Ingrid knows Rena. Jake knows Greg. Jake knows Kane. Leigh knows Jared. Jerome knows Ingrid. Which of Rena and Luther can Edward reach?", "answer": "Luther", "steps": [ "Edward knows Edmund.", "Edmund knows Luther." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Edward", "Edmund", "Cameron", "Kelsey", "Rose", "Jake", "Kane", "Greg", "Ron", "Luther", "Jerome", "Ingrid", "Axel", "Jared", "Linda", "Leigh", "Maya", "Dakota", "Tara", "Rena" ], "edges": [ [ 0, 1 ], [ 1, 9 ], [ 3, 4 ], [ 5, 3 ], [ 5, 6 ], [ 5, 7 ], [ 6, 2 ], [ 9, 5 ], [ 9, 8 ], [ 10, 11 ], [ 11, 19 ], [ 13, 14 ], [ 15, 13 ], [ 15, 16 ], [ 15, 17 ], [ 16, 12 ], [ 19, 15 ], [ 19, 18 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Will knows Colin. Vance knows Will. Colin knows Kristina. Casey knows Jewel. Sara knows Casey. Hubert knows Douglas. Will knows Ashton. Will knows Parker. Fanny knows Bennett. Fanny knows Elizabeth. Lennox knows Leon. Sara knows Laverne. Parker knows Fanny. Patricia knows Vance. Laverne knows Hubert. Hubert knows Porter. Sara knows Jerome. Leon knows Sara. Which of Elizabeth and Porter can Patricia reach?", "answer": "Elizabeth", "steps": [ "Patricia knows Vance.", "Vance knows Will.", "Will knows Parker.", "Parker knows Fanny.", "Fanny knows Elizabeth." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Patricia", "Vance", "Colin", "Ashton", "Fanny", "Parker", "Kristina", "Elizabeth", "Bennett", "Will", "Lennox", "Leon", "Casey", "Jerome", "Hubert", "Laverne", "Jewel", "Porter", "Douglas", "Sara" ], "edges": [ [ 0, 1 ], [ 1, 9 ], [ 2, 6 ], [ 4, 7 ], [ 4, 8 ], [ 5, 4 ], [ 9, 3 ], [ 9, 2 ], [ 9, 5 ], [ 10, 11 ], [ 11, 19 ], [ 12, 16 ], [ 14, 17 ], [ 14, 18 ], [ 15, 14 ], [ 19, 13 ], [ 19, 12 ], [ 19, 15 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Marie knows Patrick. Mabel knows Donald. Clyde knows Marie. Carmen knows Mabel. Allison knows Carmen. Harmony knows Allison. Harriet knows Giselle. Kara knows Harriet. Yvette knows Kara. Kara knows Dawn. Carmen knows Keaton. Evan knows Yvette. Sierra knows Harmony. Harriet knows Clyde. Carmen knows Kamila. Allison knows Jill. Donald knows Jillian. Harriet knows Derrick. Which of Clyde and Mabel can Sierra reach?", "answer": "Mabel", "steps": [ "Sierra knows Harmony.", "Harmony knows Allison.", "Allison knows Carmen.", "Carmen knows Mabel." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Sierra", "Keaton", "Donald", "Jill", "Mabel", "Carmen", "Kamila", "Allison", "Jillian", "Harmony", "Evan", "Giselle", "Marie", "Dawn", "Clyde", "Harriet", "Derrick", "Kara", "Patrick", "Yvette" ], "edges": [ [ 0, 9 ], [ 2, 8 ], [ 4, 2 ], [ 5, 1 ], [ 5, 6 ], [ 5, 4 ], [ 7, 3 ], [ 7, 5 ], [ 9, 7 ], [ 10, 19 ], [ 12, 18 ], [ 14, 12 ], [ 15, 11 ], [ 15, 16 ], [ 15, 14 ], [ 17, 13 ], [ 17, 15 ], [ 19, 17 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Dave knows Oliver. Claudia knows Hubert. Dave knows Samuel. Viola knows Dave. Samuel knows Jon. Jarvis knows Liam. Oliver knows Jarvis. Ilene knows Claudia. Jon knows Keegan. Jarvis knows Myra. Dina knows Darren. Claudia knows Dina. Hubert knows Lillian. Darren knows Walt. Ilene knows Max. Darren knows Verna. Lillian knows Arden. Viola knows Sharon. Which of Oliver and Dina can Ilene reach?", "answer": "Dina", "steps": [ "Ilene knows Claudia.", "Claudia knows Dina." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Ilene", "Walt", "Dina", "Claudia", "Arden", "Hubert", "Lillian", "Darren", "Verna", "Max", "Viola", "Myra", "Oliver", "Dave", "Keegan", "Samuel", "Jon", "Jarvis", "Liam", "Sharon" ], "edges": [ [ 0, 3 ], [ 0, 9 ], [ 2, 7 ], [ 3, 5 ], [ 3, 2 ], [ 5, 6 ], [ 6, 4 ], [ 7, 1 ], [ 7, 8 ], [ 10, 13 ], [ 10, 19 ], [ 12, 17 ], [ 13, 15 ], [ 13, 12 ], [ 15, 16 ], [ 16, 14 ], [ 17, 11 ], [ 17, 18 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Sue knows Leticia. Russell knows Xavier. Sue knows Yolanda. Xavier knows Hazel. Mae knows Brent. Yolanda knows Zoe. Brent knows Neville. Sue knows Jerry. Fleur knows Jocelyn. Sue knows Daphna. Brent knows Tara. Tara knows Anita. Nathan knows Sue. Yolanda knows Fleur. Daphna knows Chandler. Brent knows Russell. Russell knows Virginia. Brent knows Janet. Which of Brent and Sue can Mae reach?", "answer": "Brent", "steps": [ "Mae knows Brent." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Mae", "Neville", "Janet", "Anita", "Russell", "Hazel", "Xavier", "Brent", "Tara", "Virginia", "Nathan", "Leticia", "Jerry", "Chandler", "Yolanda", "Jocelyn", "Fleur", "Sue", "Daphna", "Zoe" ], "edges": [ [ 0, 7 ], [ 4, 6 ], [ 4, 9 ], [ 6, 5 ], [ 7, 1 ], [ 7, 2 ], [ 7, 8 ], [ 7, 4 ], [ 8, 3 ], [ 10, 17 ], [ 14, 16 ], [ 14, 19 ], [ 16, 15 ], [ 17, 11 ], [ 17, 12 ], [ 17, 18 ], [ 17, 14 ], [ 18, 13 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Gage knows Zara. Virgil knows Billy. Trudy knows Rebecca. Shannon knows Kimberly. Zara knows Lois. Chandler knows Kirk. Jessie knows Lydia. Jessie knows Doris. Shannon knows Chandler. Doris knows Tristan. Ruth knows Arthur. Ruth knows Ingrid. Shannon knows Trudy. Jessie knows Ruth. Billy knows Atlas. Trudy knows Virgil. Ingrid knows Gage. Atlas knows Judith. Which of Zara and Atlas can Jessie reach?", "answer": "Zara", "steps": [ "Jessie knows Ruth.", "Ruth knows Ingrid.", "Ingrid knows Gage.", "Gage knows Zara." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Jessie", "Lydia", "Zara", "Doris", "Gage", "Arthur", "Ingrid", "Ruth", "Tristan", "Lois", "Shannon", "Kimberly", "Atlas", "Chandler", "Billy", "Rebecca", "Virgil", "Trudy", "Kirk", "Judith" ], "edges": [ [ 0, 1 ], [ 0, 3 ], [ 0, 7 ], [ 2, 9 ], [ 3, 8 ], [ 4, 2 ], [ 6, 4 ], [ 7, 5 ], [ 7, 6 ], [ 10, 11 ], [ 10, 13 ], [ 10, 17 ], [ 12, 19 ], [ 13, 18 ], [ 14, 12 ], [ 16, 14 ], [ 17, 15 ], [ 17, 16 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Melanie knows Kara. Finn knows Brody. Grover knows Henrietta. Grover knows Ron. Glen knows Nicole. Grover knows Chelsea. Will knows Sam. Parker knows Alexa. Dolores knows Freya. Glen knows Finn. Gustavo knows Irma. Will knows Henry. Carmen knows Gustavo. Will knows Carmen. Ron knows Glen. Sam knows Dolores. Gustavo knows Parker. Chelsea knows Melanie. Which of Alexa and Brody can Will reach?", "answer": "Alexa", "steps": [ "Will knows Carmen.", "Carmen knows Gustavo.", "Gustavo knows Parker.", "Parker knows Alexa." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Will", "Alexa", "Carmen", "Irma", "Dolores", "Freya", "Henry", "Gustavo", "Parker", "Sam", "Grover", "Brody", "Ron", "Nicole", "Melanie", "Kara", "Henrietta", "Glen", "Finn", "Chelsea" ], "edges": [ [ 0, 6 ], [ 0, 2 ], [ 0, 9 ], [ 2, 7 ], [ 4, 5 ], [ 7, 3 ], [ 7, 8 ], [ 8, 1 ], [ 9, 4 ], [ 10, 16 ], [ 10, 12 ], [ 10, 19 ], [ 12, 17 ], [ 14, 15 ], [ 17, 13 ], [ 17, 18 ], [ 18, 11 ], [ 19, 14 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Hugh knows Amy. Virginia knows Claudia. Max knows Homer. Homer knows Pat. Claudia knows Stephen. Ella knows Hugh. Amy knows Lily. Kit knows William. Edison knows Allan. Max knows Randall. Randall knows Edison. Claudia knows Ella. Lily knows Bernice. Kit knows Hannah. Maria knows Kit. Bob knows Holden. Hugh knows Bob. Hannah knows Max. Which of Hugh and Max can Virginia reach?", "answer": "Hugh", "steps": [ "Virginia knows Claudia.", "Claudia knows Ella.", "Ella knows Hugh." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Virginia", "Ella", "Claudia", "Amy", "Holden", "Bernice", "Hugh", "Bob", "Stephen", "Lily", "Maria", "Hannah", "Kit", "Randall", "Pat", "Allan", "Max", "Homer", "William", "Edison" ], "edges": [ [ 0, 2 ], [ 1, 6 ], [ 2, 8 ], [ 2, 1 ], [ 3, 9 ], [ 6, 7 ], [ 6, 3 ], [ 7, 4 ], [ 9, 5 ], [ 10, 12 ], [ 11, 16 ], [ 12, 18 ], [ 12, 11 ], [ 13, 19 ], [ 16, 17 ], [ 16, 13 ], [ 17, 14 ], [ 19, 15 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Yara knows Andre. Irene knows Shelly. Ilene knows Barry. Kent knows Ivy. Brenda knows Sean. Andre knows Heidi. Shelly knows June. Felicia knows Tanya. Heidi knows Ilene. Jameson knows Angelica. Sean knows Jameson. Tanya knows Irene. Felicia knows Hamilton. June knows Brad. Ilene knows Ezra. June knows Jude. Jameson knows Yara. Ivy knows Felicia. Which of June and Ilene can Kent reach?", "answer": "June", "steps": [ "Kent knows Ivy.", "Ivy knows Felicia.", "Felicia knows Tanya.", "Tanya knows Irene.", "Irene knows Shelly.", "Shelly knows June." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Kent", "Shelly", "Irene", "Ivy", "Brad", "Tanya", "June", "Jude", "Felicia", "Hamilton", "Brenda", "Heidi", "Andre", "Sean", "Ezra", "Yara", "Ilene", "Barry", "Jameson", "Angelica" ], "edges": [ [ 0, 3 ], [ 1, 6 ], [ 2, 1 ], [ 3, 8 ], [ 5, 2 ], [ 6, 4 ], [ 6, 7 ], [ 8, 5 ], [ 8, 9 ], [ 10, 13 ], [ 11, 16 ], [ 12, 11 ], [ 13, 18 ], [ 15, 12 ], [ 16, 14 ], [ 16, 17 ], [ 18, 15 ], [ 18, 19 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Lawson knows Rhea. Lucas knows Lawson. Chandler knows Herbert. Cornelius knows Sonia. Rhea knows Jenny. Cornelius knows Kenneth. Tessa knows Chandler. Dalton knows Dean. Dave knows Cornelius. Lawson knows Amber. Chandler knows Leland. Leland knows Marcus. Amber knows Cruz. Jenny knows Dave. Herbert knows Leigh. Dalton knows Larry. Joseph knows Dalton. Leigh knows Joseph. Which of Sonia and Larry can Tessa reach?", "answer": "Larry", "steps": [ "Tessa knows Chandler.", "Chandler knows Herbert.", "Herbert knows Leigh.", "Leigh knows Joseph.", "Joseph knows Dalton.", "Dalton knows Larry." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Tessa", "Larry", "Marcus", "Leigh", "Dean", "Herbert", "Joseph", "Dalton", "Leland", "Chandler", "Lucas", "Sonia", "Cruz", "Jenny", "Kenneth", "Rhea", "Dave", "Cornelius", "Amber", "Lawson" ], "edges": [ [ 0, 9 ], [ 3, 6 ], [ 5, 3 ], [ 6, 7 ], [ 7, 1 ], [ 7, 4 ], [ 8, 2 ], [ 9, 5 ], [ 9, 8 ], [ 10, 19 ], [ 13, 16 ], [ 15, 13 ], [ 16, 17 ], [ 17, 11 ], [ 17, 14 ], [ 18, 12 ], [ 19, 15 ], [ 19, 18 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Lloyd knows Jason. Bart knows Lorna. Elaine knows Rex. Jolena knows Elliot. Elaine knows Molly. Pat knows Lark. Lorna knows Felix. Jason knows Elaine. Pat knows Lloyd. Kathleen knows Tracy. Jackson knows Kamila. Lloyd knows Kathleen. Bart knows Mario. Elliot knows Bart. Elliot knows Jackson. Jolena knows Leslie. Lorna knows Lilia. Jason knows Palmer. Which of Lloyd and Elliot can Pat reach?", "answer": "Lloyd", "steps": [ "Pat knows Lloyd." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Pat", "Elaine", "Kathleen", "Palmer", "Lloyd", "Rex", "Jason", "Tracy", "Molly", "Lark", "Jolena", "Lorna", "Jackson", "Mario", "Elliot", "Felix", "Bart", "Kamila", "Lilia", "Leslie" ], "edges": [ [ 0, 4 ], [ 0, 9 ], [ 1, 5 ], [ 1, 8 ], [ 2, 7 ], [ 4, 2 ], [ 4, 6 ], [ 6, 3 ], [ 6, 1 ], [ 10, 14 ], [ 10, 19 ], [ 11, 15 ], [ 11, 18 ], [ 12, 17 ], [ 14, 12 ], [ 14, 16 ], [ 16, 13 ], [ 16, 11 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Pierce knows Graham. Louisa knows Victor. Kim knows Sheila. Victor knows Lewis. Tina knows Ford. Lennox knows Jenna. Gabriel knows Carla. Jem knows Marco. Carla knows Merle. Ford knows Edmund. Hudson knows Kim. Pierce knows Tina. Carla knows Judith. Victor knows Hudson. Marco knows Lennox. Kim knows Jem. Merle knows Pierce. Edmund knows Leigh. Which of Leigh and Jenna can Gabriel reach?", "answer": "Leigh", "steps": [ "Gabriel knows Carla.", "Carla knows Merle.", "Merle knows Pierce.", "Pierce knows Tina.", "Tina knows Ford.", "Ford knows Edmund.", "Edmund knows Leigh." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Gabriel", "Graham", "Edmund", "Tina", "Pierce", "Carla", "Ford", "Merle", "Leigh", "Judith", "Louisa", "Sheila", "Lennox", "Jem", "Kim", "Victor", "Marco", "Hudson", "Jenna", "Lewis" ], "edges": [ [ 0, 5 ], [ 2, 8 ], [ 3, 6 ], [ 4, 1 ], [ 4, 3 ], [ 5, 7 ], [ 5, 9 ], [ 6, 2 ], [ 7, 4 ], [ 10, 15 ], [ 12, 18 ], [ 13, 16 ], [ 14, 11 ], [ 14, 13 ], [ 15, 17 ], [ 15, 19 ], [ 16, 12 ], [ 17, 14 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Charlotte knows Celia. Fred knows Brody. Brody knows Jillian. Chester knows Spencer. Brenda knows Alyson. Darnell knows Kim. Celia knows Ross. Gail knows India. Spencer knows Ivan. Sidney knows Archer. Archer knows Gail. Ivan knows Luke. Dorothy knows Darnell. Kim knows Erma. Charlotte knows Fred. India knows Brenda. Ross knows Dorothy. Chester knows Sidney. Which of Brenda and Kim can Chester reach?", "answer": "Brenda", "steps": [ "Chester knows Sidney.", "Sidney knows Archer.", "Archer knows Gail.", "Gail knows India.", "India knows Brenda." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Chester", "Luke", "India", "Spencer", "Archer", "Alyson", "Gail", "Ivan", "Brenda", "Sidney", "Charlotte", "Jillian", "Darnell", "Fred", "Ross", "Erma", "Dorothy", "Brody", "Kim", "Celia" ], "edges": [ [ 0, 3 ], [ 0, 9 ], [ 2, 8 ], [ 3, 7 ], [ 4, 6 ], [ 6, 2 ], [ 7, 1 ], [ 8, 5 ], [ 9, 4 ], [ 10, 13 ], [ 10, 19 ], [ 12, 18 ], [ 13, 17 ], [ 14, 16 ], [ 16, 12 ], [ 17, 11 ], [ 18, 15 ], [ 19, 14 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Roger knows Kit. Jana knows Bruno. Bennett knows Mack. Jana knows Tabitha. Kai knows Dallas. Tamara knows Jana. Jillian knows Harley. Myra knows Luke. Myra knows Herbert. Kendrick knows Lark. Harley knows Myra. John knows Kendrick. John knows Roger. Bruno knows Jonah. Roger knows Jillian. Tamara knows Bennett. Jonah knows Kai. Kai knows Justine. Which of Jonah and Harley can John reach?", "answer": "Harley", "steps": [ "John knows Roger.", "Roger knows Jillian.", "Jillian knows Harley." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "John", "Harley", "Myra", "Kit", "Herbert", "Roger", "Luke", "Jillian", "Kendrick", "Lark", "Tamara", "Jonah", "Kai", "Tabitha", "Justine", "Jana", "Dallas", "Bruno", "Bennett", "Mack" ], "edges": [ [ 0, 5 ], [ 0, 8 ], [ 1, 2 ], [ 2, 4 ], [ 2, 6 ], [ 5, 3 ], [ 5, 7 ], [ 7, 1 ], [ 8, 9 ], [ 10, 15 ], [ 10, 18 ], [ 11, 12 ], [ 12, 14 ], [ 12, 16 ], [ 15, 13 ], [ 15, 17 ], [ 17, 11 ], [ 18, 19 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Bruce knows Merle. Glenda knows Ricardo. Kimberly knows Chester. Everett knows Esme. Bruce knows Geraldine. Glenda knows Claire. Ricardo knows Nolan. Lucas knows Kimberly. Nolan knows Ken. Everett knows Riley. Louis knows Trevor. Esme knows Louis. Geraldine knows Lucas. Joaquin knows Dorian. Joaquin knows Gideon. Geraldine knows Beth. Nolan knows Everett. Gideon knows Bruce. Which of Lucas and Esme can Joaquin reach?", "answer": "Lucas", "steps": [ "Joaquin knows Gideon.", "Gideon knows Bruce.", "Bruce knows Geraldine.", "Geraldine knows Lucas." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Joaquin", "Chester", "Dorian", "Lucas", "Gideon", "Bruce", "Kimberly", "Beth", "Merle", "Geraldine", "Glenda", "Trevor", "Claire", "Esme", "Ricardo", "Nolan", "Louis", "Riley", "Ken", "Everett" ], "edges": [ [ 0, 2 ], [ 0, 4 ], [ 3, 6 ], [ 4, 5 ], [ 5, 8 ], [ 5, 9 ], [ 6, 1 ], [ 9, 3 ], [ 9, 7 ], [ 10, 12 ], [ 10, 14 ], [ 13, 16 ], [ 14, 15 ], [ 15, 18 ], [ 15, 19 ], [ 16, 11 ], [ 19, 13 ], [ 19, 17 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Alma knows Bruno. Marshall knows Ethan. Jillian knows Wesley. Alma knows Roland. Hugh knows Selena. Marshall knows Freya. Lily knows Tiffany. Selena knows Camille. Alma knows Nell. Shane knows Kara. Camille knows Devin. Freya knows Jerome. Camille knows Lily. Marshall knows Hugh. Bruno knows Jillian. Wesley knows Shane. Wesley knows Arnold. Nell knows Cyrus. Which of Camille and Wesley can Alma reach?", "answer": "Wesley", "steps": [ "Alma knows Bruno.", "Bruno knows Jillian.", "Jillian knows Wesley." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Alma", "Cyrus", "Wesley", "Roland", "Nell", "Kara", "Arnold", "Shane", "Bruno", "Jillian", "Marshall", "Jerome", "Camille", "Ethan", "Freya", "Tiffany", "Devin", "Lily", "Hugh", "Selena" ], "edges": [ [ 0, 3 ], [ 0, 4 ], [ 0, 8 ], [ 2, 6 ], [ 2, 7 ], [ 4, 1 ], [ 7, 5 ], [ 8, 9 ], [ 9, 2 ], [ 10, 13 ], [ 10, 14 ], [ 10, 18 ], [ 12, 16 ], [ 12, 17 ], [ 14, 11 ], [ 17, 15 ], [ 18, 19 ], [ 19, 12 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Anastasia knows Amanda. Hailey knows Pauline. Jaime knows Dorian. Brooke knows Hailey. Pauline knows Dave. Dave knows Adele. Carrie knows Geneva. Brooke knows Ernest. Carrie knows Ibrahim. Anastasia knows Hudson. Hudson knows Carrie. Pauline knows Pablo. Lauren knows Anastasia. Dorian knows Lionel. Dorian knows Brooke. Jamie knows Lauren. Ibrahim knows Kirsten. Lauren knows Owen. Which of Pauline and Carrie can Jamie reach?", "answer": "Carrie", "steps": [ "Jamie knows Lauren.", "Lauren knows Anastasia.", "Anastasia knows Hudson.", "Hudson knows Carrie." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Jamie", "Amanda", "Lauren", "Geneva", "Carrie", "Anastasia", "Hudson", "Owen", "Kirsten", "Ibrahim", "Jaime", "Ernest", "Dorian", "Pablo", "Pauline", "Brooke", "Hailey", "Lionel", "Adele", "Dave" ], "edges": [ [ 0, 2 ], [ 2, 7 ], [ 2, 5 ], [ 4, 3 ], [ 4, 9 ], [ 5, 1 ], [ 5, 6 ], [ 6, 4 ], [ 9, 8 ], [ 10, 12 ], [ 12, 17 ], [ 12, 15 ], [ 14, 13 ], [ 14, 19 ], [ 15, 11 ], [ 15, 16 ], [ 16, 14 ], [ 19, 18 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Greer knows Darin. Brody knows Angelica. Maureen knows Kira. Jordan knows Hope. Saul knows Ariana. Greer knows Francesca. Jillian knows Enrique. Opal knows Brody. Darin knows Rebecca. Darin knows Betty. Opal knows Dwight. Dudley knows Jillian. Ariana knows Maureen. Ariana knows Jordan. Betty knows Jocelyn. Jillian knows Greer. Maureen knows Opal. Enrique knows Latoya. Which of Angelica and Jocelyn can Saul reach?", "answer": "Angelica", "steps": [ "Saul knows Ariana.", "Ariana knows Maureen.", "Maureen knows Opal.", "Opal knows Brody.", "Brody knows Angelica." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Saul", "Jordan", "Angelica", "Hope", "Dwight", "Opal", "Ariana", "Maureen", "Brody", "Kira", "Dudley", "Enrique", "Jocelyn", "Latoya", "Rebecca", "Darin", "Jillian", "Greer", "Betty", "Francesca" ], "edges": [ [ 0, 6 ], [ 1, 3 ], [ 5, 4 ], [ 5, 8 ], [ 6, 1 ], [ 6, 7 ], [ 7, 5 ], [ 7, 9 ], [ 8, 2 ], [ 10, 16 ], [ 11, 13 ], [ 15, 14 ], [ 15, 18 ], [ 16, 11 ], [ 16, 17 ], [ 17, 15 ], [ 17, 19 ], [ 18, 12 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Gonzalo knows Luella. Linda knows Tyler. Ted knows Kimberly. Joshua knows Ian. Rena knows Kate. Autumn knows Kenneth. Ted knows Zelda. Kimberly knows Esme. Tyler knows Rena. Gonzalo knows Joshua. Tyler knows Hayden. Esme knows Winifred. Allison knows Cecilia. Alma knows Sally. Kenneth knows Alma. Winifred knows Linda. Sally knows Gonzalo. Allison knows Autumn. Which of Sally and Linda can Ted reach?", "answer": "Linda", "steps": [ "Ted knows Kimberly.", "Kimberly knows Esme.", "Esme knows Winifred.", "Winifred knows Linda." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Ted", "Hayden", "Tyler", "Kimberly", "Kate", "Esme", "Linda", "Rena", "Zelda", "Winifred", "Allison", "Luella", "Gonzalo", "Autumn", "Ian", "Kenneth", "Sally", "Joshua", "Cecilia", "Alma" ], "edges": [ [ 0, 8 ], [ 0, 3 ], [ 2, 1 ], [ 2, 7 ], [ 3, 5 ], [ 5, 9 ], [ 6, 2 ], [ 7, 4 ], [ 9, 6 ], [ 10, 18 ], [ 10, 13 ], [ 12, 11 ], [ 12, 17 ], [ 13, 15 ], [ 15, 19 ], [ 16, 12 ], [ 17, 14 ], [ 19, 16 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Miriam knows Nancy. Miriam knows Dawn. Miriam knows Chad. Dane knows Brad. Lamont knows Angelica. Darin knows Adelaide. Brad knows Lamont. Dell knows Paige. Adelaide knows Gilbert. Jane knows Gail. Corinne knows Arturo. Ernie knows Miriam. Chad knows Lennox. Dell knows Dane. Brad knows Darin. Brad knows Melissa. Nancy knows Corinne. Jane knows Ernie. Which of Ernie and Dane can Jane reach?", "answer": "Ernie", "steps": [ "Jane knows Ernie." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Jane", "Miriam", "Arturo", "Dawn", "Lennox", "Gail", "Corinne", "Chad", "Ernie", "Nancy", "Dell", "Brad", "Gilbert", "Melissa", "Angelica", "Paige", "Adelaide", "Lamont", "Dane", "Darin" ], "edges": [ [ 0, 5 ], [ 0, 8 ], [ 1, 3 ], [ 1, 7 ], [ 1, 9 ], [ 6, 2 ], [ 7, 4 ], [ 8, 1 ], [ 9, 6 ], [ 10, 15 ], [ 10, 18 ], [ 11, 13 ], [ 11, 17 ], [ 11, 19 ], [ 16, 12 ], [ 17, 14 ], [ 18, 11 ], [ 19, 16 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Camille knows Trina. Ember knows Benjamin. Clarissa knows Foster. Ember knows Camille. Trina knows Marion. John knows Whitney. Alfonso knows Chloe. Richard knows Rachel. Whitney knows Drew. Benjamin knows Lois. Carter knows John. Chester knows Owen. Foster knows Richard. Chester knows Kirsten. Foster knows Ember. Owen knows Susanne. John knows Chester. Kirsten knows Alfonso. Which of Ember and Chester can Carter reach?", "answer": "Chester", "steps": [ "Carter knows John.", "John knows Chester." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Carter", "Chloe", "Chester", "John", "Alfonso", "Whitney", "Kirsten", "Drew", "Susanne", "Owen", "Clarissa", "Marion", "Ember", "Foster", "Trina", "Richard", "Camille", "Rachel", "Lois", "Benjamin" ], "edges": [ [ 0, 3 ], [ 2, 6 ], [ 2, 9 ], [ 3, 5 ], [ 3, 2 ], [ 4, 1 ], [ 5, 7 ], [ 6, 4 ], [ 9, 8 ], [ 10, 13 ], [ 12, 16 ], [ 12, 19 ], [ 13, 15 ], [ 13, 12 ], [ 14, 11 ], [ 15, 17 ], [ 16, 14 ], [ 19, 18 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Omar knows Beth. Geraldine knows Scott. Lawrence knows Ralph. Desmond knows Burt. Burt knows Kobe. Burt knows Pierce. Isabel knows Lola. Scott knows Nora. Hayes knows Riley. Rex knows Conner. Scott knows Omar. Ralph knows Isabel. Kobe knows Geraldine. Ralph knows Ramon. Hayes knows Rex. Kobe knows Harry. Isabel knows Helene. Helene knows Hayes. Which of Scott and Hayes can Lawrence reach?", "answer": "Hayes", "steps": [ "Lawrence knows Ralph.", "Ralph knows Isabel.", "Isabel knows Helene.", "Helene knows Hayes." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Lawrence", "Conner", "Isabel", "Rex", "Hayes", "Ramon", "Riley", "Lola", "Helene", "Ralph", "Desmond", "Beth", "Kobe", "Omar", "Scott", "Pierce", "Nora", "Harry", "Geraldine", "Burt" ], "edges": [ [ 0, 9 ], [ 2, 7 ], [ 2, 8 ], [ 3, 1 ], [ 4, 3 ], [ 4, 6 ], [ 8, 4 ], [ 9, 5 ], [ 9, 2 ], [ 10, 19 ], [ 12, 17 ], [ 12, 18 ], [ 13, 11 ], [ 14, 13 ], [ 14, 16 ], [ 18, 14 ], [ 19, 15 ], [ 19, 12 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Elijah knows Yasmin. Val knows Abby. Lloyd knows Estella. Ashton knows Alice. Zach knows Alan. Abby knows Elijah. Ashton knows Laura. Electra knows Fletcher. Don knows Lewis. Abby knows Julius. Jeremy knows Electra. Zelda knows Dante. Elijah knows Zelda. Fabian knows Val. Laura knows Jeremy. Zach knows Ashton. Dante knows Don. Estella knows Zach. Which of Estella and Val can Lloyd reach?", "answer": "Estella", "steps": [ "Lloyd knows Estella." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Lloyd", "Ashton", "Laura", "Alan", "Zach", "Electra", "Alice", "Jeremy", "Fletcher", "Estella", "Fabian", "Elijah", "Zelda", "Julius", "Abby", "Don", "Yasmin", "Dante", "Lewis", "Val" ], "edges": [ [ 0, 9 ], [ 1, 6 ], [ 1, 2 ], [ 2, 7 ], [ 4, 3 ], [ 4, 1 ], [ 5, 8 ], [ 7, 5 ], [ 9, 4 ], [ 10, 19 ], [ 11, 16 ], [ 11, 12 ], [ 12, 17 ], [ 14, 13 ], [ 14, 11 ], [ 15, 18 ], [ 17, 15 ], [ 19, 14 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Cordelia knows Ezra. Ezra knows Zoe. Anita knows Jodi. Jane knows Adele. Edwin knows Graeme. Maria knows Lilia. Zoe knows Bruno. Graeme knows Hayley. Adele knows Howard. Maude knows Edwin. Jane knows Maude. Zoe knows Russ. Russ knows Eleanor. Edwin knows Maria. Anita knows Holly. Cordelia knows Anita. Bruno knows Pat. Adele knows Allison. Which of Maude and Ezra can Jane reach?", "answer": "Maude", "steps": [ "Jane knows Maude." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Jane", "Allison", "Graeme", "Lilia", "Maude", "Maria", "Hayley", "Howard", "Edwin", "Adele", "Cordelia", "Holly", "Bruno", "Eleanor", "Ezra", "Russ", "Pat", "Jodi", "Zoe", "Anita" ], "edges": [ [ 0, 4 ], [ 0, 9 ], [ 2, 6 ], [ 4, 8 ], [ 5, 3 ], [ 8, 5 ], [ 8, 2 ], [ 9, 1 ], [ 9, 7 ], [ 10, 14 ], [ 10, 19 ], [ 12, 16 ], [ 14, 18 ], [ 15, 13 ], [ 18, 15 ], [ 18, 12 ], [ 19, 11 ], [ 19, 17 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Amber knows Valerie. Dirk knows Jonas. Herman knows Chloe. Chloe knows Amber. Lucille knows Eugenia. Bart knows Dirk. Chloe knows Lucille. Penny knows Bert. Amber knows Janice. Bert knows Fletcher. Fletcher knows Jeff. Gabe knows Josie. Frida knows Julio. Sean knows Penny. Janice knows Bart. Penny knows Frida. Jeff knows Gabe. Bert knows Lisa. Which of Dirk and Gabe can Sean reach?", "answer": "Gabe", "steps": [ "Sean knows Penny.", "Penny knows Bert.", "Bert knows Fletcher.", "Fletcher knows Jeff.", "Jeff knows Gabe." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Sean", "Lisa", "Frida", "Penny", "Gabe", "Jeff", "Fletcher", "Josie", "Bert", "Julio", "Herman", "Valerie", "Lucille", "Chloe", "Dirk", "Bart", "Janice", "Jonas", "Amber", "Eugenia" ], "edges": [ [ 0, 3 ], [ 2, 9 ], [ 3, 8 ], [ 3, 2 ], [ 4, 7 ], [ 5, 4 ], [ 6, 5 ], [ 8, 1 ], [ 8, 6 ], [ 10, 13 ], [ 12, 19 ], [ 13, 18 ], [ 13, 12 ], [ 14, 17 ], [ 15, 14 ], [ 16, 15 ], [ 18, 11 ], [ 18, 16 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Jake knows Helen. Nina knows Derrick. Shaun knows Esperanza. Luis knows Bernadette. Karl knows Luis. Nadine knows Nina. Karl knows Elton. Karl knows Ethan. Nina knows Karl. Shaun knows Jake. Jake knows Celia. Celia knows Simon. Jake knows Hayden. Jake knows Emery. Karl knows Lark. Esperanza knows Seth. Derrick knows Daphne. Whitney knows Shaun. Which of Shaun and Nina can Nadine reach?", "answer": "Nina", "steps": [ "Nadine knows Nina." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Nadine", "Bernadette", "Daphne", "Elton", "Lark", "Derrick", "Luis", "Ethan", "Nina", "Karl", "Whitney", "Simon", "Seth", "Hayden", "Emery", "Esperanza", "Celia", "Helen", "Shaun", "Jake" ], "edges": [ [ 0, 8 ], [ 5, 2 ], [ 6, 1 ], [ 8, 5 ], [ 8, 9 ], [ 9, 3 ], [ 9, 4 ], [ 9, 6 ], [ 9, 7 ], [ 10, 18 ], [ 15, 12 ], [ 16, 11 ], [ 18, 15 ], [ 18, 19 ], [ 19, 13 ], [ 19, 14 ], [ 19, 16 ], [ 19, 17 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Kira knows Samuel. Natalie knows Julia. Earl knows Hubert. Hilda knows Carla. Cruz knows Billy. Cruz knows Shaun. Harper knows Jean. Harper knows Hilda. Julia knows Kira. Gordon knows Harper. Levi knows Donald. Levi knows Earl. Billy knows Alder. Hubert knows Merle. Ashton knows Levi. Jean knows Cruz. Julia knows Ashton. Alder knows Homer. Which of Merle and Homer can Natalie reach?", "answer": "Merle", "steps": [ "Natalie knows Julia.", "Julia knows Ashton.", "Ashton knows Levi.", "Levi knows Earl.", "Earl knows Hubert.", "Hubert knows Merle." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Natalie", "Merle", "Levi", "Donald", "Earl", "Ashton", "Hubert", "Samuel", "Julia", "Kira", "Gordon", "Homer", "Cruz", "Shaun", "Billy", "Jean", "Alder", "Carla", "Harper", "Hilda" ], "edges": [ [ 0, 8 ], [ 2, 3 ], [ 2, 4 ], [ 4, 6 ], [ 5, 2 ], [ 6, 1 ], [ 8, 5 ], [ 8, 9 ], [ 9, 7 ], [ 10, 18 ], [ 12, 13 ], [ 12, 14 ], [ 14, 16 ], [ 15, 12 ], [ 16, 11 ], [ 18, 15 ], [ 18, 19 ], [ 19, 17 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Melissa knows Ruby. Darin knows Myrtle. Norman knows Melissa. Darin knows Leopold. Ida knows Joyce. Doris knows Malik. Myrtle knows Kamila. Kamila knows Norman. Joyce knows Louis. Jenny knows Leslie. Yvonne knows Wesley. Leslie knows Ida. Malik knows Darin. Malik knows Cain. Louis knows Yvonne. Clement knows Jenny. Jenny knows Forrest. Leslie knows Jolene. Which of Malik and Jenny can Doris reach?", "answer": "Malik", "steps": [ "Doris knows Malik." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Doris", "Kamila", "Myrtle", "Malik", "Leopold", "Darin", "Melissa", "Ruby", "Norman", "Cain", "Clement", "Joyce", "Ida", "Jenny", "Jolene", "Leslie", "Yvonne", "Wesley", "Louis", "Forrest" ], "edges": [ [ 0, 3 ], [ 1, 8 ], [ 2, 1 ], [ 3, 5 ], [ 3, 9 ], [ 5, 4 ], [ 5, 2 ], [ 6, 7 ], [ 8, 6 ], [ 10, 13 ], [ 11, 18 ], [ 12, 11 ], [ 13, 15 ], [ 13, 19 ], [ 15, 14 ], [ 15, 12 ], [ 16, 17 ], [ 18, 16 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Erwin knows Cole. Trudy knows Pauline. Kristina knows Dean. Warren knows Trudy. Benjamin knows Karina. Karina knows Lucia. Warren knows Lola. Kristina knows Estella. Estella knows Evan. Warren knows Jacob. Jacob knows Doug. Lola knows Douglas. Erwin knows Kristina. Kristina knows Neville. Neville knows Jane. Ann knows Erwin. Karina knows Warren. Dean knows Olive. Which of Kristina and Warren can Benjamin reach?", "answer": "Warren", "steps": [ "Benjamin knows Karina.", "Karina knows Warren." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Benjamin", "Karina", "Jacob", "Pauline", "Doug", "Trudy", "Warren", "Douglas", "Lola", "Lucia", "Ann", "Erwin", "Neville", "Olive", "Jane", "Dean", "Kristina", "Evan", "Estella", "Cole" ], "edges": [ [ 0, 1 ], [ 1, 6 ], [ 1, 9 ], [ 2, 4 ], [ 5, 3 ], [ 6, 2 ], [ 6, 5 ], [ 6, 8 ], [ 8, 7 ], [ 10, 11 ], [ 11, 16 ], [ 11, 19 ], [ 12, 14 ], [ 15, 13 ], [ 16, 12 ], [ 16, 15 ], [ 16, 18 ], [ 18, 17 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Zachary knows Ella. Darnell knows Zachary. Ella knows Jasper. Merle knows Melody. Parker knows Matthew. Kathleen knows Fletcher. Kathleen knows Kane. Ella knows Israel. Matthew knows Aspen. Kathleen knows Marilyn. Aspen knows Kathleen. Melody knows Darnell. Lara knows Ryan. Ryan knows Daniella. Dalton knows Merle. Merle knows Lydia. Ryan knows Parker. Ella knows Valerie. Which of Aspen and Zachary can Dalton reach?", "answer": "Zachary", "steps": [ "Dalton knows Merle.", "Merle knows Melody.", "Melody knows Darnell.", "Darnell knows Zachary." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Dalton", "Jasper", "Ella", "Valerie", "Melody", "Israel", "Darnell", "Lydia", "Zachary", "Merle", "Lara", "Marilyn", "Kathleen", "Kane", "Parker", "Fletcher", "Matthew", "Daniella", "Aspen", "Ryan" ], "edges": [ [ 0, 9 ], [ 2, 1 ], [ 2, 3 ], [ 2, 5 ], [ 4, 6 ], [ 6, 8 ], [ 8, 2 ], [ 9, 7 ], [ 9, 4 ], [ 10, 19 ], [ 12, 11 ], [ 12, 13 ], [ 12, 15 ], [ 14, 16 ], [ 16, 18 ], [ 18, 12 ], [ 19, 17 ], [ 19, 14 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Mark knows Etta. Hannah knows Garland. Jacqueline knows Kenzie. Myrtle knows Alex. Alex knows Aria. Julian knows Marcus. Nicholas knows Ramon. Garland knows Mark. Erik knows Hannah. Ramon knows Wanda. Alex knows Jacqueline. Jana knows Floyd. Marcus knows Myrtle. Mark knows Jana. Mike knows Giselle. Giselle knows Roman. Wanda knows Julian. Roman knows Erik. Which of Myrtle and Garland can Mike reach?", "answer": "Garland", "steps": [ "Mike knows Giselle.", "Giselle knows Roman.", "Roman knows Erik.", "Erik knows Hannah.", "Hannah knows Garland." ], "difficulty": 5, "original_distance": 8, "idx_to_symbol": [ "Mike", "Etta", "Jana", "Mark", "Floyd", "Hannah", "Erik", "Giselle", "Garland", "Roman", "Nicholas", "Aria", "Jacqueline", "Alex", "Kenzie", "Marcus", "Julian", "Ramon", "Myrtle", "Wanda" ], "edges": [ [ 0, 7 ], [ 2, 4 ], [ 3, 1 ], [ 3, 2 ], [ 5, 8 ], [ 6, 5 ], [ 7, 9 ], [ 8, 3 ], [ 9, 6 ], [ 10, 17 ], [ 12, 14 ], [ 13, 11 ], [ 13, 12 ], [ 15, 18 ], [ 16, 15 ], [ 17, 19 ], [ 18, 13 ], [ 19, 16 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Adam knows Jenna. Lucy knows Colby. Emanuel knows Dirk. Helene knows Emanuel. Jenna knows Lucy. Arturo knows Chloe. Beverly knows Alana. Simon knows Constance. Simon knows Aubrey. Rowan knows Lydia. Alana knows Kendra. Franklin knows Helene. Franklin knows Alejandro. Lucy knows Simon. Constance knows Beverly. Dirk knows Robert. Arturo knows Franklin. Lydia knows Arturo. Which of Dirk and Alana can Rowan reach?", "answer": "Dirk", "steps": [ "Rowan knows Lydia.", "Lydia knows Arturo.", "Arturo knows Franklin.", "Franklin knows Helene.", "Helene knows Emanuel.", "Emanuel knows Dirk." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Rowan", "Chloe", "Franklin", "Arturo", "Dirk", "Emanuel", "Helene", "Lydia", "Alejandro", "Robert", "Adam", "Colby", "Simon", "Lucy", "Alana", "Beverly", "Constance", "Jenna", "Aubrey", "Kendra" ], "edges": [ [ 0, 7 ], [ 2, 8 ], [ 2, 6 ], [ 3, 1 ], [ 3, 2 ], [ 4, 9 ], [ 5, 4 ], [ 6, 5 ], [ 7, 3 ], [ 10, 17 ], [ 12, 18 ], [ 12, 16 ], [ 13, 11 ], [ 13, 12 ], [ 14, 19 ], [ 15, 14 ], [ 16, 15 ], [ 17, 13 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Jermaine knows Aurora. Ann knows Gina. Monica knows Ruby. Ann knows Maude. Saul knows Monica. Ruby knows Yolanda. Amelia knows Jules. Eleanor knows Ann. Levi knows Veronica. Eleanor knows Archie. Jules knows Cesar. Jermaine knows Amelia. Yolanda knows Lars. Yolanda knows Kenzie. Lars knows Levi. Monica knows Eugenia. Maude knows Jermaine. Saul knows Lewis. Which of Ruby and Maude can Saul reach?", "answer": "Ruby", "steps": [ "Saul knows Monica.", "Monica knows Ruby." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Saul", "Veronica", "Monica", "Kenzie", "Eugenia", "Lewis", "Levi", "Lars", "Ruby", "Yolanda", "Eleanor", "Cesar", "Ann", "Aurora", "Gina", "Archie", "Jules", "Amelia", "Maude", "Jermaine" ], "edges": [ [ 0, 5 ], [ 0, 2 ], [ 2, 4 ], [ 2, 8 ], [ 6, 1 ], [ 7, 6 ], [ 8, 9 ], [ 9, 3 ], [ 9, 7 ], [ 10, 15 ], [ 10, 12 ], [ 12, 14 ], [ 12, 18 ], [ 16, 11 ], [ 17, 16 ], [ 18, 19 ], [ 19, 13 ], [ 19, 17 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Carmen knows Wilson. Myrtle knows Carlos. Leonard knows Norma. Pauline knows Leonard. Chad knows Pauline. Chad knows Myrtle. Sean knows Marilyn. Pablo knows Hannah. Norma knows Kai. Wilson knows Celia. Marilyn knows Bill. Leonard knows Daphna. Pablo knows Chad. Audrey knows Geraldine. Marilyn knows Dave. Bill knows Winifred. Carmen knows Sean. Audrey knows Carmen. Which of Carmen and Chad can Audrey reach?", "answer": "Carmen", "steps": [ "Audrey knows Carmen." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Audrey", "Sean", "Geraldine", "Marilyn", "Celia", "Carmen", "Wilson", "Dave", "Winifred", "Bill", "Pablo", "Pauline", "Hannah", "Leonard", "Carlos", "Chad", "Myrtle", "Daphna", "Kai", "Norma" ], "edges": [ [ 0, 2 ], [ 0, 5 ], [ 1, 3 ], [ 3, 7 ], [ 3, 9 ], [ 5, 6 ], [ 5, 1 ], [ 6, 4 ], [ 9, 8 ], [ 10, 12 ], [ 10, 15 ], [ 11, 13 ], [ 13, 17 ], [ 13, 19 ], [ 15, 16 ], [ 15, 11 ], [ 16, 14 ], [ 19, 18 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Jeremy knows Samuel. Charles knows Dorian. Charles knows Fergus. Charles knows Jose. Jeremy knows Bernard. Charles knows Delilah. Deanna knows Charles. Jose knows Quinn. Charles knows Frida. Kirsten knows Isla. Justin knows Chester. Jeremy knows Adam. Delilah knows Kirsten. August knows Jeremy. Samuel knows Harvey. Jeremy knows Nolan. Nolan knows Justin. Jeremy knows William. Which of Justin and Kirsten can Deanna reach?", "answer": "Kirsten", "steps": [ "Deanna knows Charles.", "Charles knows Delilah.", "Delilah knows Kirsten." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Deanna", "Charles", "Delilah", "Jose", "Frida", "Dorian", "Fergus", "Kirsten", "Quinn", "Isla", "August", "Jeremy", "Nolan", "Samuel", "Adam", "Bernard", "William", "Justin", "Harvey", "Chester" ], "edges": [ [ 0, 1 ], [ 1, 4 ], [ 1, 5 ], [ 1, 6 ], [ 1, 3 ], [ 1, 2 ], [ 2, 7 ], [ 3, 8 ], [ 7, 9 ], [ 10, 11 ], [ 11, 14 ], [ 11, 15 ], [ 11, 16 ], [ 11, 13 ], [ 11, 12 ], [ 12, 17 ], [ 13, 18 ], [ 17, 19 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Erin knows Brock. Isabel knows Terry. Trudy knows Gwen. Jameson knows Trudy. Terry knows Mabel. Yolanda knows Hadley. Jacqueline knows Zach. Jacqueline knows Yolanda. Hadley knows Isabel. Russ knows Cody. Hadley knows Erin. Jacqueline knows Rex. Gwen knows Judith. Victor knows Lee. Victor knows Fabian. Jameson knows Russ. Victor knows Brandon. Lee knows Jameson. Which of Mabel and Judith can Jacqueline reach?", "answer": "Mabel", "steps": [ "Jacqueline knows Yolanda.", "Yolanda knows Hadley.", "Hadley knows Isabel.", "Isabel knows Terry.", "Terry knows Mabel." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Jacqueline", "Mabel", "Terry", "Hadley", "Yolanda", "Rex", "Erin", "Brock", "Zach", "Isabel", "Victor", "Judith", "Gwen", "Jameson", "Lee", "Brandon", "Russ", "Cody", "Fabian", "Trudy" ], "edges": [ [ 0, 5 ], [ 0, 8 ], [ 0, 4 ], [ 2, 1 ], [ 3, 6 ], [ 3, 9 ], [ 4, 3 ], [ 6, 7 ], [ 9, 2 ], [ 10, 15 ], [ 10, 18 ], [ 10, 14 ], [ 12, 11 ], [ 13, 16 ], [ 13, 19 ], [ 14, 13 ], [ 16, 17 ], [ 19, 12 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Aiden knows Larissa. Calvin knows Mabel. Aiden knows Declan. Anastasia knows Jermaine. Anastasia knows Leticia. Aiden knows Willard. Mabel knows Preston. Eamon knows Sandra. Jocelyn knows Trevor. Donna knows Anastasia. Jocelyn knows Larry. Larissa knows Jocelyn. Aiden knows Frida. Anastasia knows Eamon. Mabel knows Beth. Anastasia knows Calvin. Sean knows Aiden. Willard knows Gerard. Which of Trevor and Preston can Donna reach?", "answer": "Preston", "steps": [ "Donna knows Anastasia.", "Anastasia knows Calvin.", "Calvin knows Mabel.", "Mabel knows Preston." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Donna", "Leticia", "Calvin", "Preston", "Anastasia", "Sandra", "Jermaine", "Beth", "Mabel", "Eamon", "Sean", "Declan", "Larissa", "Trevor", "Aiden", "Gerard", "Frida", "Larry", "Jocelyn", "Willard" ], "edges": [ [ 0, 4 ], [ 2, 8 ], [ 4, 1 ], [ 4, 6 ], [ 4, 2 ], [ 4, 9 ], [ 8, 3 ], [ 8, 7 ], [ 9, 5 ], [ 10, 14 ], [ 12, 18 ], [ 14, 11 ], [ 14, 16 ], [ 14, 12 ], [ 14, 19 ], [ 18, 13 ], [ 18, 17 ], [ 19, 15 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Hazel knows Robert. Ellen knows Martin. Lars knows Charles. Robert knows Hope. Esme knows Bernice. Charles knows Cesar. Heidi knows Ellen. Charles knows Tina. Douglas knows Alfred. Alfred knows Nell. Heidi knows Darcy. Alfred knows Lars. Tina knows Esme. Martin knows Barney. Ellen knows Ricardo. Barney knows Brett. Douglas knows Flora. Barney knows Hazel. Which of Barney and Charles can Douglas reach?", "answer": "Charles", "steps": [ "Douglas knows Alfred.", "Alfred knows Lars.", "Lars knows Charles." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Douglas", "Tina", "Flora", "Lars", "Charles", "Alfred", "Cesar", "Nell", "Bernice", "Esme", "Heidi", "Hazel", "Darcy", "Martin", "Barney", "Ellen", "Brett", "Ricardo", "Hope", "Robert" ], "edges": [ [ 0, 2 ], [ 0, 5 ], [ 1, 9 ], [ 3, 4 ], [ 4, 6 ], [ 4, 1 ], [ 5, 7 ], [ 5, 3 ], [ 9, 8 ], [ 10, 12 ], [ 10, 15 ], [ 11, 19 ], [ 13, 14 ], [ 14, 16 ], [ 14, 11 ], [ 15, 17 ], [ 15, 13 ], [ 19, 18 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Gareth knows Dee. Scott knows Magdalena. Gareth knows Forrest. Judith knows Diego. Teresa knows Monica. Monica knows Scott. Aaron knows Pierce. Aaron knows Allison. Diego knows Evelyn. Magdalena knows Darnell. Dee knows Ivy. Aaron knows Alison. Alison knows Christian. Evelyn knows Gonzalo. Gonzalo knows Fern. Gareth knows Jon. Fern knows Aaron. Darnell knows Gareth. Which of Diego and Monica can Teresa reach?", "answer": "Monica", "steps": [ "Teresa knows Monica." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Teresa", "Dee", "Jon", "Gareth", "Forrest", "Scott", "Ivy", "Darnell", "Magdalena", "Monica", "Judith", "Alison", "Allison", "Aaron", "Pierce", "Evelyn", "Christian", "Fern", "Gonzalo", "Diego" ], "edges": [ [ 0, 9 ], [ 1, 6 ], [ 3, 2 ], [ 3, 4 ], [ 3, 1 ], [ 5, 8 ], [ 7, 3 ], [ 8, 7 ], [ 9, 5 ], [ 10, 19 ], [ 11, 16 ], [ 13, 12 ], [ 13, 14 ], [ 13, 11 ], [ 15, 18 ], [ 17, 13 ], [ 18, 17 ], [ 19, 15 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Valerie knows Irving. Lois knows Clifford. Kira knows Valerie. Ralph knows Freya. Wilma knows Marc. Peter knows Xander. Ford knows Kira. Irving knows Leopold. Peter knows Wilma. Lois knows Lauren. Freya knows Lois. Valerie knows Ralph. Damien knows Peter. Jolena knows Fritz. Enrique knows Jolena. Xander knows Enrique. Jolena knows Andrew. Lucia knows Damien. Which of Damien and Kira can Ford reach?", "answer": "Kira", "steps": [ "Ford knows Kira." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Ford", "Leopold", "Lois", "Kira", "Valerie", "Lauren", "Freya", "Ralph", "Clifford", "Irving", "Lucia", "Marc", "Jolena", "Damien", "Peter", "Fritz", "Enrique", "Xander", "Andrew", "Wilma" ], "edges": [ [ 0, 3 ], [ 2, 5 ], [ 2, 8 ], [ 3, 4 ], [ 4, 7 ], [ 4, 9 ], [ 6, 2 ], [ 7, 6 ], [ 9, 1 ], [ 10, 13 ], [ 12, 15 ], [ 12, 18 ], [ 13, 14 ], [ 14, 17 ], [ 14, 19 ], [ 16, 12 ], [ 17, 16 ], [ 19, 11 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Kirk knows Nora. Isla knows Vanessa. Isla knows Florence. Isla knows Sylvia. Lilia knows Ramona. Xander knows Enrique. Florence knows Darnell. Uma knows Lilia. Ramona knows Vera. Dora knows Hattie. Melody knows Kirk. Kirk knows Xander. Jeremiah knows Dora. Darnell knows Foster. Enrique knows Donna. Kirk knows Gerald. Uma knows Isla. Melody knows Jeremiah. Which of Florence and Xander can Uma reach?", "answer": "Florence", "steps": [ "Uma knows Isla.", "Isla knows Florence." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Uma", "Ramona", "Florence", "Lilia", "Vera", "Sylvia", "Foster", "Vanessa", "Isla", "Darnell", "Melody", "Dora", "Xander", "Jeremiah", "Hattie", "Nora", "Donna", "Gerald", "Kirk", "Enrique" ], "edges": [ [ 0, 3 ], [ 0, 8 ], [ 1, 4 ], [ 2, 9 ], [ 3, 1 ], [ 8, 5 ], [ 8, 7 ], [ 8, 2 ], [ 9, 6 ], [ 10, 13 ], [ 10, 18 ], [ 11, 14 ], [ 12, 19 ], [ 13, 11 ], [ 18, 15 ], [ 18, 17 ], [ 18, 12 ], [ 19, 16 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Carla knows Jem. Guillermo knows Devon. Guillermo knows Darla. Esme knows Milo. Jeanne knows Matthew. Carla knows Amanda. Lark knows Darius. Darius knows Duncan. Guillermo knows Diego. Rocco knows Cain. Guillermo knows Troy. Duncan knows Guillermo. Katrina knows Carla. Carla knows Rocco. Troy knows Jeanne. Milo knows Katrina. Carla knows Rosa. Cain knows Travis. Which of Travis and Matthew can Esme reach?", "answer": "Travis", "steps": [ "Esme knows Milo.", "Milo knows Katrina.", "Katrina knows Carla.", "Carla knows Rocco.", "Rocco knows Cain.", "Cain knows Travis." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Esme", "Rosa", "Katrina", "Amanda", "Carla", "Travis", "Milo", "Jem", "Rocco", "Cain", "Lark", "Darla", "Duncan", "Diego", "Guillermo", "Matthew", "Darius", "Devon", "Troy", "Jeanne" ], "edges": [ [ 0, 6 ], [ 2, 4 ], [ 4, 1 ], [ 4, 3 ], [ 4, 7 ], [ 4, 8 ], [ 6, 2 ], [ 8, 9 ], [ 9, 5 ], [ 10, 16 ], [ 12, 14 ], [ 14, 11 ], [ 14, 13 ], [ 14, 17 ], [ 14, 18 ], [ 16, 12 ], [ 18, 19 ], [ 19, 15 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "James knows Boyd. Adelaide knows Clinton. Drew knows Dorothy. Jakob knows James. Adelaide knows Kurt. Brody knows Kai. Russ knows Renee. Aaron knows Adelaide. Drew knows Pete. Cynthia knows Jakob. Renee knows Lisette. Nora knows Brody. Rex knows Chelsea. Kai knows Cynthia. Chelsea knows Aaron. Lisette knows Rhonda. Rhonda knows Rex. Boyd knows Drew. Which of Rex and Jakob can Nora reach?", "answer": "Jakob", "steps": [ "Nora knows Brody.", "Brody knows Kai.", "Kai knows Cynthia.", "Cynthia knows Jakob." ], "difficulty": 4, "original_distance": 8, "idx_to_symbol": [ "Nora", "James", "Drew", "Dorothy", "Jakob", "Kai", "Brody", "Boyd", "Pete", "Cynthia", "Russ", "Chelsea", "Adelaide", "Kurt", "Rex", "Lisette", "Renee", "Aaron", "Clinton", "Rhonda" ], "edges": [ [ 0, 6 ], [ 1, 7 ], [ 2, 3 ], [ 2, 8 ], [ 4, 1 ], [ 5, 9 ], [ 6, 5 ], [ 7, 2 ], [ 9, 4 ], [ 10, 16 ], [ 11, 17 ], [ 12, 13 ], [ 12, 18 ], [ 14, 11 ], [ 15, 19 ], [ 16, 15 ], [ 17, 12 ], [ 19, 14 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Alma knows Bruno. Marshall knows Ethan. Jillian knows Wesley. Alma knows Roland. Hugh knows Selena. Marshall knows Freya. Lily knows Tiffany. Selena knows Camille. Alma knows Nell. Shane knows Kara. Camille knows Devin. Freya knows Jerome. Camille knows Lily. Marshall knows Hugh. Bruno knows Jillian. Wesley knows Shane. Wesley knows Arnold. Nell knows Cyrus. Which of Hugh and Bruno can Alma reach?", "answer": "Bruno", "steps": [ "Alma knows Bruno." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Alma", "Cyrus", "Wesley", "Roland", "Nell", "Kara", "Arnold", "Shane", "Bruno", "Jillian", "Marshall", "Jerome", "Camille", "Ethan", "Freya", "Tiffany", "Devin", "Lily", "Hugh", "Selena" ], "edges": [ [ 0, 3 ], [ 0, 4 ], [ 0, 8 ], [ 2, 6 ], [ 2, 7 ], [ 4, 1 ], [ 7, 5 ], [ 8, 9 ], [ 9, 2 ], [ 10, 13 ], [ 10, 14 ], [ 10, 18 ], [ 12, 16 ], [ 12, 17 ], [ 14, 11 ], [ 17, 15 ], [ 18, 19 ], [ 19, 12 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Willard knows Arturo. Marcus knows Ariana. Conrad knows Isadora. Dee knows Conrad. Dee knows Edna. Miranda knows Raymond. Darwin knows Marcus. Kobe knows Jeremiah. Mildred knows Angela. Raymond knows Willard. Ruth knows Spencer. Lacey knows Mildred. Jeremiah knows Dee. Esther knows Darwin. Angela knows Geneva. Marcus knows Ruth. Esther knows Miranda. Kobe knows Lacey. Which of Isadora and Spencer can Esther reach?", "answer": "Spencer", "steps": [ "Esther knows Darwin.", "Darwin knows Marcus.", "Marcus knows Ruth.", "Ruth knows Spencer." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Esther", "Raymond", "Ariana", "Miranda", "Arturo", "Willard", "Spencer", "Ruth", "Darwin", "Marcus", "Kobe", "Mildred", "Edna", "Lacey", "Geneva", "Angela", "Isadora", "Conrad", "Jeremiah", "Dee" ], "edges": [ [ 0, 3 ], [ 0, 8 ], [ 1, 5 ], [ 3, 1 ], [ 5, 4 ], [ 7, 6 ], [ 8, 9 ], [ 9, 2 ], [ 9, 7 ], [ 10, 13 ], [ 10, 18 ], [ 11, 15 ], [ 13, 11 ], [ 15, 14 ], [ 17, 16 ], [ 18, 19 ], [ 19, 12 ], [ 19, 17 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Deborah knows Pierce. Brett knows Ivan. Walter knows Selena. Darcy knows Deborah. Brett knows Walter. Darrell knows Jolene. Jermaine knows Colin. Brett knows Jermaine. Kay knows Ralph. Ralph knows Andrew. Ralph knows Clay. Ralph knows Camden. Laverne knows Brett. Andrew knows Sheryl. Selena knows Liam. Clay knows Darcy. Pierce knows Ignacio. Liam knows Darrell. Which of Darcy and Selena can Kay reach?", "answer": "Darcy", "steps": [ "Kay knows Ralph.", "Ralph knows Clay.", "Clay knows Darcy." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Kay", "Darcy", "Sheryl", "Camden", "Andrew", "Clay", "Deborah", "Ralph", "Pierce", "Ignacio", "Laverne", "Selena", "Colin", "Ivan", "Jermaine", "Walter", "Liam", "Brett", "Darrell", "Jolene" ], "edges": [ [ 0, 7 ], [ 1, 6 ], [ 4, 2 ], [ 5, 1 ], [ 6, 8 ], [ 7, 3 ], [ 7, 4 ], [ 7, 5 ], [ 8, 9 ], [ 10, 17 ], [ 11, 16 ], [ 14, 12 ], [ 15, 11 ], [ 16, 18 ], [ 17, 13 ], [ 17, 14 ], [ 17, 15 ], [ 18, 19 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Fred knows Darrell. Hayes knows Beverly. Agnes knows Mike. Oliver knows Roman. Yvonne knows Larry. Larry knows Daisy. Daisy knows Darnell. Julia knows Lucia. Gabriel knows Oliver. Hayes knows Walter. April knows Gabriel. Jamie knows Yvonne. Gabriel knows Troy. Gabriel knows Craig. Lucia knows Agnes. Mike knows April. Darnell knows Hayes. Hayes knows Fred. Which of Agnes and Larry can Jamie reach?", "answer": "Larry", "steps": [ "Jamie knows Yvonne.", "Yvonne knows Larry." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Jamie", "Larry", "Darrell", "Hayes", "Fred", "Walter", "Yvonne", "Daisy", "Darnell", "Beverly", "Julia", "Agnes", "Roman", "Gabriel", "Oliver", "Craig", "Lucia", "Mike", "April", "Troy" ], "edges": [ [ 0, 6 ], [ 1, 7 ], [ 3, 4 ], [ 3, 5 ], [ 3, 9 ], [ 4, 2 ], [ 6, 1 ], [ 7, 8 ], [ 8, 3 ], [ 10, 16 ], [ 11, 17 ], [ 13, 14 ], [ 13, 15 ], [ 13, 19 ], [ 14, 12 ], [ 16, 11 ], [ 17, 18 ], [ 18, 13 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Annette knows Tom. Ruby knows Ellis. Theodore knows Bryan. Wendell knows Julian. Annette knows Val. Val knows Cate. Penny knows Pearl. Tom knows Samuel. Theodore knows Ray. Ruby knows Penny. Penny knows Percy. Julian knows Kaleb. Alison knows Wendell. Bryan knows Ruby. Percy knows Carlos. Julian knows Annette. Alison knows Renee. Pearl knows Evelyn. Which of Samuel and Carlos can Theodore reach?", "answer": "Carlos", "steps": [ "Theodore knows Bryan.", "Bryan knows Ruby.", "Ruby knows Penny.", "Penny knows Percy.", "Percy knows Carlos." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Theodore", "Bryan", "Percy", "Ray", "Pearl", "Ruby", "Ellis", "Evelyn", "Carlos", "Penny", "Alison", "Wendell", "Tom", "Renee", "Val", "Julian", "Kaleb", "Cate", "Samuel", "Annette" ], "edges": [ [ 0, 3 ], [ 0, 1 ], [ 1, 5 ], [ 2, 8 ], [ 4, 7 ], [ 5, 6 ], [ 5, 9 ], [ 9, 4 ], [ 9, 2 ], [ 10, 13 ], [ 10, 11 ], [ 11, 15 ], [ 12, 18 ], [ 14, 17 ], [ 15, 16 ], [ 15, 19 ], [ 19, 14 ], [ 19, 12 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Mary knows Owen. Owen knows Allen. Allen knows Ernest. Janice knows Alison. Alison knows Jill. Daisy knows Chance. Justin knows Enid. Tina knows Daisy. Ernest knows Josie. Tina knows Joshua. Javier knows Janice. Ernest knows Brittany. Carrie knows Mary. Joshua knows Javier. Harper knows Justin. Carrie knows Harper. Alison knows Nadine. Chance knows Burt. Which of Joshua and Mary can Tina reach?", "answer": "Joshua", "steps": [ "Tina knows Joshua." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Tina", "Nadine", "Joshua", "Daisy", "Jill", "Chance", "Javier", "Alison", "Burt", "Janice", "Carrie", "Josie", "Mary", "Harper", "Brittany", "Justin", "Owen", "Ernest", "Enid", "Allen" ], "edges": [ [ 0, 3 ], [ 0, 2 ], [ 2, 6 ], [ 3, 5 ], [ 5, 8 ], [ 6, 9 ], [ 7, 1 ], [ 7, 4 ], [ 9, 7 ], [ 10, 13 ], [ 10, 12 ], [ 12, 16 ], [ 13, 15 ], [ 15, 18 ], [ 16, 19 ], [ 17, 11 ], [ 17, 14 ], [ 19, 17 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Lyric knows Cate. Josie knows Greer. Lillian knows Lyric. Lillian knows Josie. Erica knows Herman. Dustin knows Kendra. Jamie knows Laura. Hazel knows Estella. Dustin knows Lewis. Lewis knows Erica. Hazel knows Penny. Erica knows Hazel. Josie knows Mary. Greer knows Cliff. Estella knows Jana. Herman knows Lorraine. Jamie knows Melody. Melody knows Lillian. Which of Lewis and Melody can Dustin reach?", "answer": "Lewis", "steps": [ "Dustin knows Lewis." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Dustin", "Lewis", "Hazel", "Penny", "Kendra", "Herman", "Erica", "Jana", "Lorraine", "Estella", "Jamie", "Melody", "Josie", "Mary", "Laura", "Lyric", "Lillian", "Cliff", "Cate", "Greer" ], "edges": [ [ 0, 4 ], [ 0, 1 ], [ 1, 6 ], [ 2, 3 ], [ 2, 9 ], [ 5, 8 ], [ 6, 5 ], [ 6, 2 ], [ 9, 7 ], [ 10, 14 ], [ 10, 11 ], [ 11, 16 ], [ 12, 13 ], [ 12, 19 ], [ 15, 18 ], [ 16, 15 ], [ 16, 12 ], [ 19, 17 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Darwin knows Stella. Sebastian knows Michael. Donna knows Shannon. Lenora knows Brynn. Kit knows Alejandro. Kit knows Lenora. Bailey knows Jewel. Lenora knows Esther. Donna knows Fisher. Bailey knows Ernesto. Donna knows Duncan. Darwin knows Maude. Lenora knows Tina. Sebastian knows Darwin. Bailey knows Ray. Ernesto knows Sebastian. Shannon knows Kit. Darwin knows Foster. Which of Sebastian and Kit can Donna reach?", "answer": "Kit", "steps": [ "Donna knows Shannon.", "Shannon knows Kit." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Donna", "Fisher", "Lenora", "Tina", "Esther", "Brynn", "Shannon", "Alejandro", "Kit", "Duncan", "Bailey", "Ray", "Darwin", "Stella", "Maude", "Foster", "Ernesto", "Michael", "Sebastian", "Jewel" ], "edges": [ [ 0, 1 ], [ 0, 6 ], [ 0, 9 ], [ 2, 3 ], [ 2, 4 ], [ 2, 5 ], [ 6, 8 ], [ 8, 2 ], [ 8, 7 ], [ 10, 11 ], [ 10, 16 ], [ 10, 19 ], [ 12, 13 ], [ 12, 14 ], [ 12, 15 ], [ 16, 18 ], [ 18, 12 ], [ 18, 17 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Tonya knows Austin. Geneva knows Caroline. Haley knows Jeanne. Henry knows Geneva. Geneva knows Langston. Byron knows Cruz. Levi knows Sandra. Edna knows Tonya. Levi knows Byron. Jeanne knows Glenda. Langston knows Lorraine. Cruz knows Henry. Byron knows Denver. Tonya knows Malcolm. Malcolm knows Judy. Jeanne knows Gina. Haley knows Kingsley. Glenda knows Edna. Which of Byron and Jeanne can Haley reach?", "answer": "Jeanne", "steps": [ "Haley knows Jeanne." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Haley", "Austin", "Tonya", "Kingsley", "Judy", "Glenda", "Gina", "Edna", "Jeanne", "Malcolm", "Levi", "Caroline", "Geneva", "Sandra", "Lorraine", "Cruz", "Denver", "Henry", "Byron", "Langston" ], "edges": [ [ 0, 3 ], [ 0, 8 ], [ 2, 1 ], [ 2, 9 ], [ 5, 7 ], [ 7, 2 ], [ 8, 6 ], [ 8, 5 ], [ 9, 4 ], [ 10, 13 ], [ 10, 18 ], [ 12, 11 ], [ 12, 19 ], [ 15, 17 ], [ 17, 12 ], [ 18, 16 ], [ 18, 15 ], [ 19, 14 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Lola knows Mark. Val knows Nathan. Aaron knows Ada. Ada knows Val. Hayden knows Ashley. Judith knows Hayden. Joel knows Lola. Brooke knows Julian. Greg knows Becky. Becky knows Cesar. Iris knows Jolena. Iris knows Gerald. Hayden knows Boyd. Mark knows Iris. Lola knows Kathleen. Kathleen knows Greg. Julian knows Judith. Julian knows Aaron. Which of Becky and Val can Brooke reach?", "answer": "Val", "steps": [ "Brooke knows Julian.", "Julian knows Aaron.", "Aaron knows Ada.", "Ada knows Val." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Brooke", "Ada", "Boyd", "Aaron", "Nathan", "Julian", "Judith", "Hayden", "Ashley", "Val", "Joel", "Greg", "Gerald", "Kathleen", "Cesar", "Lola", "Mark", "Iris", "Jolena", "Becky" ], "edges": [ [ 0, 5 ], [ 1, 9 ], [ 3, 1 ], [ 5, 6 ], [ 5, 3 ], [ 6, 7 ], [ 7, 2 ], [ 7, 8 ], [ 9, 4 ], [ 10, 15 ], [ 11, 19 ], [ 13, 11 ], [ 15, 16 ], [ 15, 13 ], [ 16, 17 ], [ 17, 12 ], [ 17, 18 ], [ 19, 14 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Helene knows Dennis. Nina knows Lyle. Mia knows Jermaine. Jay knows Blair. Rhonda knows Eva. Adele knows Billy. Helene knows Adele. Sean knows Sam. Helene knows Rhonda. Hayden knows Helene. Blair knows Fern. Jermaine knows Dominic. Helene knows Joyce. Blair knows Mia. Samantha knows Javier. Dennis knows Samantha. Blair knows Sean. Blair knows Nina. Which of Samantha and Jermaine can Hayden reach?", "answer": "Samantha", "steps": [ "Hayden knows Helene.", "Helene knows Dennis.", "Dennis knows Samantha." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Hayden", "Samantha", "Joyce", "Billy", "Dennis", "Helene", "Adele", "Rhonda", "Eva", "Javier", "Jay", "Jermaine", "Fern", "Sam", "Mia", "Blair", "Sean", "Nina", "Lyle", "Dominic" ], "edges": [ [ 0, 5 ], [ 1, 9 ], [ 4, 1 ], [ 5, 2 ], [ 5, 6 ], [ 5, 7 ], [ 5, 4 ], [ 6, 3 ], [ 7, 8 ], [ 10, 15 ], [ 11, 19 ], [ 14, 11 ], [ 15, 12 ], [ 15, 16 ], [ 15, 17 ], [ 15, 14 ], [ 16, 13 ], [ 17, 18 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Christian knows Shelby. Camden knows Celeste. Allen knows Verna. Marie knows Claude. Wallace knows Marie. Celeste knows Christian. Vicki knows Maude. Landon knows Abby. Vanessa knows Bennett. Lana knows Morris. Claude knows Allen. Verna knows Brett. Celeste knows Bonnie. Claude knows Landon. Shelby knows Vanessa. Bonnie knows Josie. Marie knows Vicki. Christian knows Lana. Which of Vanessa and Verna can Wallace reach?", "answer": "Verna", "steps": [ "Wallace knows Marie.", "Marie knows Claude.", "Claude knows Allen.", "Allen knows Verna." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Wallace", "Landon", "Verna", "Brett", "Allen", "Vicki", "Marie", "Abby", "Claude", "Maude", "Camden", "Lana", "Vanessa", "Bennett", "Shelby", "Bonnie", "Celeste", "Morris", "Christian", "Josie" ], "edges": [ [ 0, 6 ], [ 1, 7 ], [ 2, 3 ], [ 4, 2 ], [ 5, 9 ], [ 6, 8 ], [ 6, 5 ], [ 8, 4 ], [ 8, 1 ], [ 10, 16 ], [ 11, 17 ], [ 12, 13 ], [ 14, 12 ], [ 15, 19 ], [ 16, 18 ], [ 16, 15 ], [ 18, 14 ], [ 18, 11 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Amber knows Valerie. Dirk knows Jonas. Herman knows Chloe. Chloe knows Amber. Lucille knows Eugenia. Bart knows Dirk. Chloe knows Lucille. Penny knows Bert. Amber knows Janice. Bert knows Fletcher. Fletcher knows Jeff. Gabe knows Josie. Frida knows Julio. Sean knows Penny. Janice knows Bart. Penny knows Frida. Jeff knows Gabe. Bert knows Lisa. Which of Amber and Bert can Sean reach?", "answer": "Bert", "steps": [ "Sean knows Penny.", "Penny knows Bert." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Sean", "Lisa", "Frida", "Penny", "Gabe", "Jeff", "Fletcher", "Josie", "Bert", "Julio", "Herman", "Valerie", "Lucille", "Chloe", "Dirk", "Bart", "Janice", "Jonas", "Amber", "Eugenia" ], "edges": [ [ 0, 3 ], [ 2, 9 ], [ 3, 8 ], [ 3, 2 ], [ 4, 7 ], [ 5, 4 ], [ 6, 5 ], [ 8, 1 ], [ 8, 6 ], [ 10, 13 ], [ 12, 19 ], [ 13, 18 ], [ 13, 12 ], [ 14, 17 ], [ 15, 14 ], [ 16, 15 ], [ 18, 11 ], [ 18, 16 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Derek knows Ember. Graeme knows Eleanor. Dell knows Bruno. Walter knows Dell. Jodi knows Diane. Diane knows Justine. Jocelyn knows Mia. Lyric knows Odette. Dell knows Carmela. Carmela knows Belinda. Justine knows Lyric. Bruno knows Garland. Justine knows Derek. Jodi knows Lacey. Justine knows Graeme. Raquel knows Walter. Raquel knows Olivia. Dell knows Jocelyn. Which of Dell and Justine can Raquel reach?", "answer": "Dell", "steps": [ "Raquel knows Walter.", "Walter knows Dell." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Raquel", "Carmela", "Bruno", "Dell", "Garland", "Olivia", "Belinda", "Jocelyn", "Mia", "Walter", "Jodi", "Graeme", "Lyric", "Justine", "Odette", "Lacey", "Eleanor", "Derek", "Ember", "Diane" ], "edges": [ [ 0, 5 ], [ 0, 9 ], [ 1, 6 ], [ 2, 4 ], [ 3, 2 ], [ 3, 1 ], [ 3, 7 ], [ 7, 8 ], [ 9, 3 ], [ 10, 15 ], [ 10, 19 ], [ 11, 16 ], [ 12, 14 ], [ 13, 12 ], [ 13, 11 ], [ 13, 17 ], [ 17, 18 ], [ 19, 13 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Gene knows Peggy. Sidney knows Zach. Dina knows Herbert. Ava knows Iris. Bernice knows Morris. Alfred knows Christian. Todd knows Julia. Sidney knows Ava. Adrian knows Todd. Julia knows Wendell. Peggy knows Deborah. Peggy knows Bernice. Todd knows Dina. Herbert knows Sidney. Evan knows Alfred. Elliot knows Gene. Alfred knows Elliot. Christian knows Inez. Which of Alfred and Todd can Evan reach?", "answer": "Alfred", "steps": [ "Evan knows Alfred." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Evan", "Christian", "Bernice", "Elliot", "Morris", "Deborah", "Inez", "Alfred", "Gene", "Peggy", "Adrian", "Julia", "Ava", "Dina", "Iris", "Zach", "Wendell", "Todd", "Herbert", "Sidney" ], "edges": [ [ 0, 7 ], [ 1, 6 ], [ 2, 4 ], [ 3, 8 ], [ 7, 1 ], [ 7, 3 ], [ 8, 9 ], [ 9, 2 ], [ 9, 5 ], [ 10, 17 ], [ 11, 16 ], [ 12, 14 ], [ 13, 18 ], [ 17, 11 ], [ 17, 13 ], [ 18, 19 ], [ 19, 12 ], [ 19, 15 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Kieran knows Walter. Hugh knows Skyler. Damien knows Julio. Edith knows Crystal. Jocelyn knows Jolena. Luz knows Brooke. Jocelyn knows Hugh. Kieran knows Fergus. Damien knows Ursula. Ursula knows Jocelyn. Sydney knows Damien. Jolena knows Kaleb. Tony knows Vance. Vance knows Luz. Kingsley knows Edith. Edith knows Tony. Hugh knows Dustin. Vance knows Kieran. Which of Ursula and Tony can Sydney reach?", "answer": "Ursula", "steps": [ "Sydney knows Damien.", "Damien knows Ursula." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Sydney", "Jolena", "Damien", "Ursula", "Hugh", "Skyler", "Kaleb", "Julio", "Dustin", "Jocelyn", "Kingsley", "Luz", "Edith", "Tony", "Kieran", "Fergus", "Brooke", "Crystal", "Walter", "Vance" ], "edges": [ [ 0, 2 ], [ 1, 6 ], [ 2, 7 ], [ 2, 3 ], [ 3, 9 ], [ 4, 5 ], [ 4, 8 ], [ 9, 1 ], [ 9, 4 ], [ 10, 12 ], [ 11, 16 ], [ 12, 17 ], [ 12, 13 ], [ 13, 19 ], [ 14, 15 ], [ 14, 18 ], [ 19, 11 ], [ 19, 14 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Virgil knows Chad. Lola knows Lena. Jared knows Ben. Virgil knows Finn. Maria knows Seth. Mildred knows Virgil. Dave knows Dora. Chad knows Chase. Deborah knows Justine. Lola knows Maria. Rocco knows Deborah. Serena knows Mildred. Justine knows Jared. Jared knows Lola. Jocelyn knows Dave. Mildred knows Merle. Dora knows Serena. Ashley knows Rocco. Which of Deborah and Dora can Ashley reach?", "answer": "Deborah", "steps": [ "Ashley knows Rocco.", "Rocco knows Deborah." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Ashley", "Lola", "Ben", "Seth", "Justine", "Deborah", "Rocco", "Lena", "Jared", "Maria", "Jocelyn", "Virgil", "Merle", "Chase", "Serena", "Dora", "Dave", "Finn", "Mildred", "Chad" ], "edges": [ [ 0, 6 ], [ 1, 7 ], [ 1, 9 ], [ 4, 8 ], [ 5, 4 ], [ 6, 5 ], [ 8, 2 ], [ 8, 1 ], [ 9, 3 ], [ 10, 16 ], [ 11, 17 ], [ 11, 19 ], [ 14, 18 ], [ 15, 14 ], [ 16, 15 ], [ 18, 12 ], [ 18, 11 ], [ 19, 13 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Adrian knows Sharon. Sharon knows Julie. August knows Neil. Eric knows Sebastian. Verna knows Simon. Warren knows Stephen. Khashayar knows Kate. Graham knows Clement. Simon knows Ann. Kate knows Bert. Julie knows Khashayar. Kate knows Eric. Simon knows Graham. Warren knows Harvey. Clement knows Warren. Warren knows August. Sharon knows Dee. Kate knows Mara. Which of Kate and Warren can Adrian reach?", "answer": "Kate", "steps": [ "Adrian knows Sharon.", "Sharon knows Julie.", "Julie knows Khashayar.", "Khashayar knows Kate." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Adrian", "Bert", "Dee", "Julie", "Khashayar", "Kate", "Sebastian", "Mara", "Eric", "Sharon", "Verna", "Stephen", "Ann", "Graham", "Clement", "Warren", "Neil", "Harvey", "August", "Simon" ], "edges": [ [ 0, 9 ], [ 3, 4 ], [ 4, 5 ], [ 5, 1 ], [ 5, 7 ], [ 5, 8 ], [ 8, 6 ], [ 9, 2 ], [ 9, 3 ], [ 10, 19 ], [ 13, 14 ], [ 14, 15 ], [ 15, 11 ], [ 15, 17 ], [ 15, 18 ], [ 18, 16 ], [ 19, 12 ], [ 19, 13 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Abby knows Cole. Cole knows Clifford. Jon knows Joan. Yara knows Merle. Calvin knows Marie. Florence knows Calvin. Cole knows Harriet. Merle knows Emery. Levi knows Laura. Cole knows Shaun. Jon knows Levi. Jon knows Edison. Clifford knows Ruth. Marie knows Abby. Archer knows Joseph. Emery knows Archer. Abby knows Fleur. Archer knows Jon. Which of Laura and Ruth can Yara reach?", "answer": "Laura", "steps": [ "Yara knows Merle.", "Merle knows Emery.", "Emery knows Archer.", "Archer knows Jon.", "Jon knows Levi.", "Levi knows Laura." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Yara", "Laura", "Emery", "Joan", "Edison", "Merle", "Joseph", "Levi", "Jon", "Archer", "Florence", "Ruth", "Marie", "Harriet", "Shaun", "Calvin", "Fleur", "Clifford", "Cole", "Abby" ], "edges": [ [ 0, 5 ], [ 2, 9 ], [ 5, 2 ], [ 7, 1 ], [ 8, 3 ], [ 8, 4 ], [ 8, 7 ], [ 9, 6 ], [ 9, 8 ], [ 10, 15 ], [ 12, 19 ], [ 15, 12 ], [ 17, 11 ], [ 18, 13 ], [ 18, 14 ], [ 18, 17 ], [ 19, 16 ], [ 19, 18 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Daria knows Adelaide. Philip knows Anita. Griffith knows Iris. Russell knows Max. Katrina knows Melody. Katrina knows Xander. Avery knows Daria. Melody knows Griffith. Basil knows Autumn. Ken knows Harrison. Max knows Basil. Iris knows Philip. Hal knows Aisha. Daria knows Russell. Aisha knows Katrina. Hal knows Josie. Ken knows Avery. Autumn knows Elliot. Which of Avery and Aisha can Ken reach?", "answer": "Avery", "steps": [ "Ken knows Avery." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Ken", "Russell", "Elliot", "Harrison", "Basil", "Adelaide", "Max", "Avery", "Daria", "Autumn", "Hal", "Melody", "Anita", "Josie", "Iris", "Xander", "Griffith", "Aisha", "Katrina", "Philip" ], "edges": [ [ 0, 3 ], [ 0, 7 ], [ 1, 6 ], [ 4, 9 ], [ 6, 4 ], [ 7, 8 ], [ 8, 5 ], [ 8, 1 ], [ 9, 2 ], [ 10, 13 ], [ 10, 17 ], [ 11, 16 ], [ 14, 19 ], [ 16, 14 ], [ 17, 18 ], [ 18, 15 ], [ 18, 11 ], [ 19, 12 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Omar knows Beth. Geraldine knows Scott. Lawrence knows Ralph. Desmond knows Burt. Burt knows Kobe. Burt knows Pierce. Isabel knows Lola. Scott knows Nora. Hayes knows Riley. Rex knows Conner. Scott knows Omar. Ralph knows Isabel. Kobe knows Geraldine. Ralph knows Ramon. Hayes knows Rex. Kobe knows Harry. Isabel knows Helene. Helene knows Hayes. Which of Geraldine and Helene can Lawrence reach?", "answer": "Helene", "steps": [ "Lawrence knows Ralph.", "Ralph knows Isabel.", "Isabel knows Helene." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Lawrence", "Conner", "Isabel", "Rex", "Hayes", "Ramon", "Riley", "Lola", "Helene", "Ralph", "Desmond", "Beth", "Kobe", "Omar", "Scott", "Pierce", "Nora", "Harry", "Geraldine", "Burt" ], "edges": [ [ 0, 9 ], [ 2, 7 ], [ 2, 8 ], [ 3, 1 ], [ 4, 3 ], [ 4, 6 ], [ 8, 4 ], [ 9, 5 ], [ 9, 2 ], [ 10, 19 ], [ 12, 17 ], [ 12, 18 ], [ 13, 11 ], [ 14, 13 ], [ 14, 16 ], [ 18, 14 ], [ 19, 15 ], [ 19, 12 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Charles knows Ethan. Cody knows Frank. Luis knows Xavier. Hazel knows Langston. Harriet knows Brenda. Carter knows Hazel. Larissa knows Carmela. Larissa knows Carter. Langston knows Luis. Cody knows Violet. Brenda knows Gerald. Larissa knows Mason. Cody knows Harriet. Freya knows Lane. Carter knows Charles. Harriet knows Ernie. Ernie knows Vicki. Gerald knows Freya. Which of Brenda and Hazel can Cody reach?", "answer": "Brenda", "steps": [ "Cody knows Harriet.", "Harriet knows Brenda." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Cody", "Harriet", "Violet", "Gerald", "Ernie", "Frank", "Freya", "Brenda", "Lane", "Vicki", "Larissa", "Carter", "Mason", "Langston", "Charles", "Carmela", "Luis", "Hazel", "Xavier", "Ethan" ], "edges": [ [ 0, 2 ], [ 0, 5 ], [ 0, 1 ], [ 1, 7 ], [ 1, 4 ], [ 3, 6 ], [ 4, 9 ], [ 6, 8 ], [ 7, 3 ], [ 10, 12 ], [ 10, 15 ], [ 10, 11 ], [ 11, 17 ], [ 11, 14 ], [ 13, 16 ], [ 14, 19 ], [ 16, 18 ], [ 17, 13 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Rose knows Martha. Dirk knows Ursula. Arnold knows Camden. Hendrix knows Della. Leigh knows Curtis. Arnold knows Leigh. Della knows Wilson. Fanny knows Rose. Kerry knows Justin. Arnold knows Myrtle. Della knows Dirk. Carey knows Arnold. Dirk knows Troy. Justin knows Heath. Della knows Roy. Leigh knows Irene. Camden knows Kerry. Wilson knows Fanny. Which of Arnold and Della can Carey reach?", "answer": "Arnold", "steps": [ "Carey knows Arnold." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Carey", "Leigh", "Justin", "Curtis", "Myrtle", "Irene", "Camden", "Kerry", "Heath", "Arnold", "Hendrix", "Dirk", "Rose", "Ursula", "Roy", "Troy", "Wilson", "Fanny", "Martha", "Della" ], "edges": [ [ 0, 9 ], [ 1, 3 ], [ 1, 5 ], [ 2, 8 ], [ 6, 7 ], [ 7, 2 ], [ 9, 4 ], [ 9, 1 ], [ 9, 6 ], [ 10, 19 ], [ 11, 13 ], [ 11, 15 ], [ 12, 18 ], [ 16, 17 ], [ 17, 12 ], [ 19, 14 ], [ 19, 11 ], [ 19, 16 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Liam knows Cassidy. Jill knows Clarence. Chester knows Elsa. George knows Guillermo. Israel knows Cornelius. Guillermo knows Enrique. Cassidy knows George. Whitney knows Marlene. George knows Dawn. Chester knows Kent. Chester knows Jana. Marlene knows Elvis. Elvis knows Chester. Clarence knows Kerry. Kent knows Crystal. Jill knows Liam. George knows Becky. Whitney knows Israel. Which of Guillermo and Kent can Whitney reach?", "answer": "Kent", "steps": [ "Whitney knows Marlene.", "Marlene knows Elvis.", "Elvis knows Chester.", "Chester knows Kent." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Whitney", "Kent", "Crystal", "Israel", "Jana", "Chester", "Cornelius", "Elsa", "Elvis", "Marlene", "Jill", "Guillermo", "Enrique", "Clarence", "Dawn", "George", "Kerry", "Becky", "Cassidy", "Liam" ], "edges": [ [ 0, 3 ], [ 0, 9 ], [ 1, 2 ], [ 3, 6 ], [ 5, 1 ], [ 5, 4 ], [ 5, 7 ], [ 8, 5 ], [ 9, 8 ], [ 10, 13 ], [ 10, 19 ], [ 11, 12 ], [ 13, 16 ], [ 15, 11 ], [ 15, 14 ], [ 15, 17 ], [ 18, 15 ], [ 19, 18 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Stacy knows Magdalena. Stanley knows Marcia. Arnold knows Farrah. Ernesto knows Cruz. Amelia knows Grant. Elise knows Stanley. Jared knows Elise. Carter knows Eldon. Stanley knows Lorenzo. Farrah knows India. Craig knows Tina. Craig knows Ernesto. Marcia knows Arnold. Tina knows Harley. Arnold knows Amelia. Stacy knows Uma. Magdalena knows Craig. Eldon knows Stacy. Which of Stacy and Stanley can Jared reach?", "answer": "Stanley", "steps": [ "Jared knows Elise.", "Elise knows Stanley." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Jared", "India", "Lorenzo", "Marcia", "Arnold", "Farrah", "Grant", "Stanley", "Amelia", "Elise", "Carter", "Cruz", "Uma", "Magdalena", "Craig", "Ernesto", "Harley", "Stacy", "Tina", "Eldon" ], "edges": [ [ 0, 9 ], [ 3, 4 ], [ 4, 5 ], [ 4, 8 ], [ 5, 1 ], [ 7, 2 ], [ 7, 3 ], [ 8, 6 ], [ 9, 7 ], [ 10, 19 ], [ 13, 14 ], [ 14, 15 ], [ 14, 18 ], [ 15, 11 ], [ 17, 12 ], [ 17, 13 ], [ 18, 16 ], [ 19, 17 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Keira knows Humphrey. Lillian knows Federico. Walter knows Zach. Harold knows Eileen. Zach knows Griffith. Lacey knows Leroy. Eileen knows Carla. Eugene knows Harold. Lorraine knows Eugene. Humphrey knows Russ. Forrest knows Demetrius. Griffith knows Lillian. Leroy knows Forrest. Demetrius knows Jameson. Keith knows Elias. Elias knows Keira. Humphrey knows Lacey. Eileen knows Walter. Which of Walter and Lacey can Lorraine reach?", "answer": "Walter", "steps": [ "Lorraine knows Eugene.", "Eugene knows Harold.", "Harold knows Eileen.", "Eileen knows Walter." ], "difficulty": 4, "original_distance": 8, "idx_to_symbol": [ "Lorraine", "Harold", "Zach", "Federico", "Eugene", "Griffith", "Eileen", "Lillian", "Walter", "Carla", "Keith", "Keira", "Leroy", "Jameson", "Elias", "Forrest", "Humphrey", "Demetrius", "Lacey", "Russ" ], "edges": [ [ 0, 4 ], [ 1, 6 ], [ 2, 5 ], [ 4, 1 ], [ 5, 7 ], [ 6, 8 ], [ 6, 9 ], [ 7, 3 ], [ 8, 2 ], [ 10, 14 ], [ 11, 16 ], [ 12, 15 ], [ 14, 11 ], [ 15, 17 ], [ 16, 18 ], [ 16, 19 ], [ 17, 13 ], [ 18, 12 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Warren knows Nancy. John knows Austin. Atlas knows John. Constance knows Claude. John knows Zara. Austin knows Daphne. Bart knows Hunter. Alma knows Ray. Bart knows Warren. Hunter knows Henrietta. Ray knows Hannah. Don knows Atlas. Bart knows Clyde. Hannah knows Bart. John knows Constance. Hunter knows Celia. Allison knows Don. Austin knows Carla. Which of John and Bart can Allison reach?", "answer": "John", "steps": [ "Allison knows Don.", "Don knows Atlas.", "Atlas knows John." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Allison", "Constance", "Austin", "Don", "Zara", "Atlas", "Carla", "Claude", "John", "Daphne", "Alma", "Warren", "Hunter", "Ray", "Clyde", "Hannah", "Celia", "Nancy", "Bart", "Henrietta" ], "edges": [ [ 0, 3 ], [ 1, 7 ], [ 2, 6 ], [ 2, 9 ], [ 3, 5 ], [ 5, 8 ], [ 8, 4 ], [ 8, 1 ], [ 8, 2 ], [ 10, 13 ], [ 11, 17 ], [ 12, 16 ], [ 12, 19 ], [ 13, 15 ], [ 15, 18 ], [ 18, 14 ], [ 18, 11 ], [ 18, 12 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Deborah knows Pierce. Brett knows Ivan. Walter knows Selena. Darcy knows Deborah. Brett knows Walter. Darrell knows Jolene. Jermaine knows Colin. Brett knows Jermaine. Kay knows Ralph. Ralph knows Andrew. Ralph knows Clay. Ralph knows Camden. Laverne knows Brett. Andrew knows Sheryl. Selena knows Liam. Clay knows Darcy. Pierce knows Ignacio. Liam knows Darrell. Which of Pierce and Darrell can Kay reach?", "answer": "Pierce", "steps": [ "Kay knows Ralph.", "Ralph knows Clay.", "Clay knows Darcy.", "Darcy knows Deborah.", "Deborah knows Pierce." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Kay", "Darcy", "Sheryl", "Camden", "Andrew", "Clay", "Deborah", "Ralph", "Pierce", "Ignacio", "Laverne", "Selena", "Colin", "Ivan", "Jermaine", "Walter", "Liam", "Brett", "Darrell", "Jolene" ], "edges": [ [ 0, 7 ], [ 1, 6 ], [ 4, 2 ], [ 5, 1 ], [ 6, 8 ], [ 7, 3 ], [ 7, 4 ], [ 7, 5 ], [ 8, 9 ], [ 10, 17 ], [ 11, 16 ], [ 14, 12 ], [ 15, 11 ], [ 16, 18 ], [ 17, 13 ], [ 17, 14 ], [ 17, 15 ], [ 18, 19 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Devon knows Ava. Earl knows Clifford. Serena knows Malik. Devon knows Verna. Cody knows Carlos. Austin knows Raquel. Earl knows Eunice. Carlos knows Joyce. Cody knows Edna. Devon knows Morgan. Malik knows Marshall. Jules knows Cody. Edna knows Jennifer. Eunice knows Serena. Earl knows Dick. Serena knows Austin. Earl knows Theodore. Devon knows Jules. Which of Raquel and Jennifer can Earl reach?", "answer": "Raquel", "steps": [ "Earl knows Eunice.", "Eunice knows Serena.", "Serena knows Austin.", "Austin knows Raquel." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Earl", "Clifford", "Malik", "Austin", "Marshall", "Serena", "Theodore", "Eunice", "Raquel", "Dick", "Devon", "Verna", "Carlos", "Edna", "Joyce", "Cody", "Ava", "Jules", "Jennifer", "Morgan" ], "edges": [ [ 0, 1 ], [ 0, 6 ], [ 0, 7 ], [ 0, 9 ], [ 2, 4 ], [ 3, 8 ], [ 5, 2 ], [ 5, 3 ], [ 7, 5 ], [ 10, 11 ], [ 10, 16 ], [ 10, 17 ], [ 10, 19 ], [ 12, 14 ], [ 13, 18 ], [ 15, 12 ], [ 15, 13 ], [ 17, 15 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Ellen knows Warren. Joaquin knows Gina. Emanuel knows Gustavo. Ken knows Martha. Carter knows Jem. Dennis knows Alma. Gina knows Isaac. Jules knows Ken. Ken knows Ellen. Erma knows Jules. Calvin knows Theodore. Jules knows Emanuel. Warren knows Lily. Lily knows Jack. Joaquin knows Dennis. Julius knows Joaquin. Gina knows Carter. Jem knows Calvin. Which of Jack and Theodore can Erma reach?", "answer": "Jack", "steps": [ "Erma knows Jules.", "Jules knows Ken.", "Ken knows Ellen.", "Ellen knows Warren.", "Warren knows Lily.", "Lily knows Jack." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Erma", "Warren", "Gustavo", "Ken", "Jules", "Ellen", "Martha", "Jack", "Lily", "Emanuel", "Julius", "Jem", "Alma", "Gina", "Joaquin", "Carter", "Isaac", "Theodore", "Calvin", "Dennis" ], "edges": [ [ 0, 4 ], [ 1, 8 ], [ 3, 6 ], [ 3, 5 ], [ 4, 3 ], [ 4, 9 ], [ 5, 1 ], [ 8, 7 ], [ 9, 2 ], [ 10, 14 ], [ 11, 18 ], [ 13, 16 ], [ 13, 15 ], [ 14, 13 ], [ 14, 19 ], [ 15, 11 ], [ 18, 17 ], [ 19, 12 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Eugene knows Inez. Porter knows Philip. Carlton knows Chester. Chester knows Edna. Tristan knows Beverly. Dwight knows Tristan. Inez knows Carlton. Inez knows Elodie. Jackson knows Eugene. Philip knows Quinn. Beverly knows Colby. Chester knows Calvin. Beverly knows Porter. Joan knows Rosa. Lucia knows Aspen. Philip knows Dominic. Carlton knows Joan. Porter knows Lucia. Which of Chester and Philip can Jackson reach?", "answer": "Chester", "steps": [ "Jackson knows Eugene.", "Eugene knows Inez.", "Inez knows Carlton.", "Carlton knows Chester." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Jackson", "Calvin", "Elodie", "Edna", "Joan", "Eugene", "Rosa", "Inez", "Carlton", "Chester", "Dwight", "Dominic", "Colby", "Quinn", "Lucia", "Tristan", "Aspen", "Beverly", "Porter", "Philip" ], "edges": [ [ 0, 5 ], [ 4, 6 ], [ 5, 7 ], [ 7, 2 ], [ 7, 8 ], [ 8, 4 ], [ 8, 9 ], [ 9, 1 ], [ 9, 3 ], [ 10, 15 ], [ 14, 16 ], [ 15, 17 ], [ 17, 12 ], [ 17, 18 ], [ 18, 14 ], [ 18, 19 ], [ 19, 11 ], [ 19, 13 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Miriam knows Sally. Fisher knows Paige. Wilma knows Mildred. Miriam knows Barbara. Federico knows Alicia. Rosemary knows Willis. Earl knows Jennifer. Jennifer knows Avery. Lorna knows Rosemary. Wilma knows Patrick. Miriam knows Drake. Mildred knows Louis. Barbara knows Natalie. Conner knows Federico. Alicia knows Lorna. Paige knows Earl. Sally knows Fisher. Wilma knows Conner. Which of Fisher and Federico can Wilma reach?", "answer": "Federico", "steps": [ "Wilma knows Conner.", "Conner knows Federico." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Wilma", "Rosemary", "Willis", "Mildred", "Lorna", "Patrick", "Louis", "Federico", "Alicia", "Conner", "Miriam", "Jennifer", "Avery", "Barbara", "Earl", "Drake", "Natalie", "Fisher", "Paige", "Sally" ], "edges": [ [ 0, 5 ], [ 0, 3 ], [ 0, 9 ], [ 1, 2 ], [ 3, 6 ], [ 4, 1 ], [ 7, 8 ], [ 8, 4 ], [ 9, 7 ], [ 10, 15 ], [ 10, 13 ], [ 10, 19 ], [ 11, 12 ], [ 13, 16 ], [ 14, 11 ], [ 17, 18 ], [ 18, 14 ], [ 19, 17 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Langston knows Kara. Aspen knows Grover. Eunice knows Langston. Edwin knows Eunice. Grover knows Norman. Adam knows Dolores. Langston knows Nora. Eunice knows Caleb. Sierra knows Parker. Adam knows Gary. Eunice knows Courtney. Dolores knows Emery. Edwin knows Sierra. Freya knows Edwin. Adam knows Miriam. Grover knows Adam. Dolores knows Dawn. Norman knows Jordan. Which of Eunice and Adam can Freya reach?", "answer": "Eunice", "steps": [ "Freya knows Edwin.", "Edwin knows Eunice." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Freya", "Sierra", "Langston", "Caleb", "Courtney", "Nora", "Parker", "Kara", "Edwin", "Eunice", "Aspen", "Norman", "Dolores", "Gary", "Miriam", "Emery", "Jordan", "Dawn", "Grover", "Adam" ], "edges": [ [ 0, 8 ], [ 1, 6 ], [ 2, 5 ], [ 2, 7 ], [ 8, 1 ], [ 8, 9 ], [ 9, 3 ], [ 9, 4 ], [ 9, 2 ], [ 10, 18 ], [ 11, 16 ], [ 12, 15 ], [ 12, 17 ], [ 18, 11 ], [ 18, 19 ], [ 19, 13 ], [ 19, 14 ], [ 19, 12 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Grady knows Dora. Clement knows Darcy. Daphna knows Kendra. Donovan knows Luz. Patrick knows Susan. Jude knows Patrick. Kristin knows Julius. Darcy knows Kane. Kendra knows Luther. Susan knows Sandra. Luz knows Rhonda. Sandra knows Clement. Eldon knows Kirsten. Rhonda knows Kristin. Luther knows Donovan. Rhonda knows Grady. Darcy knows Eldon. Kane knows Riley. Which of Donovan and Sandra can Daphna reach?", "answer": "Donovan", "steps": [ "Daphna knows Kendra.", "Kendra knows Luther.", "Luther knows Donovan." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Daphna", "Julius", "Kristin", "Dora", "Grady", "Donovan", "Rhonda", "Luther", "Luz", "Kendra", "Jude", "Kirsten", "Eldon", "Riley", "Kane", "Sandra", "Darcy", "Susan", "Clement", "Patrick" ], "edges": [ [ 0, 9 ], [ 2, 1 ], [ 4, 3 ], [ 5, 8 ], [ 6, 2 ], [ 6, 4 ], [ 7, 5 ], [ 8, 6 ], [ 9, 7 ], [ 10, 19 ], [ 12, 11 ], [ 14, 13 ], [ 15, 18 ], [ 16, 12 ], [ 16, 14 ], [ 17, 15 ], [ 18, 16 ], [ 19, 17 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Leroy knows Lorenzo. Alice knows Ainsley. Judy knows Ida. Leroy knows Kit. Ainsley knows Janice. Wilma knows Isla. Kit knows Alice. Arthur knows Tina. Gus knows Judy. Ida knows Uma. Laverne knows Luther. Lorenzo knows Paige. Tina knows Laverne. Luther knows Pearl. Luther knows Myra. Ainsley knows Donald. Arthur knows Gus. Paige knows Wilma. Which of Gus and Lorenzo can Arthur reach?", "answer": "Gus", "steps": [ "Arthur knows Gus." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Arthur", "Luther", "Tina", "Pearl", "Ida", "Uma", "Laverne", "Gus", "Myra", "Judy", "Leroy", "Ainsley", "Kit", "Janice", "Wilma", "Isla", "Alice", "Lorenzo", "Donald", "Paige" ], "edges": [ [ 0, 2 ], [ 0, 7 ], [ 1, 3 ], [ 1, 8 ], [ 2, 6 ], [ 4, 5 ], [ 6, 1 ], [ 7, 9 ], [ 9, 4 ], [ 10, 12 ], [ 10, 17 ], [ 11, 13 ], [ 11, 18 ], [ 12, 16 ], [ 14, 15 ], [ 16, 11 ], [ 17, 19 ], [ 19, 14 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Maude knows Casey. Jamie knows Fraser. Uma knows Clay. Yasmin knows Cruz. Clay knows Kristin. Naomi knows Agnes. Fraser knows Denise. Rowan knows Jaime. Devin knows Yasmin. Marcia knows Tina. Terrence knows Jamie. Devin knows Uma. Jamie knows Naomi. Rowan knows Marcia. Brynn knows Terrence. Jaime knows Devin. Brynn knows Maude. Denise knows Erma. Which of Erma and Kristin can Rowan reach?", "answer": "Kristin", "steps": [ "Rowan knows Jaime.", "Jaime knows Devin.", "Devin knows Uma.", "Uma knows Clay.", "Clay knows Kristin." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Rowan", "Tina", "Cruz", "Uma", "Marcia", "Yasmin", "Clay", "Jaime", "Kristin", "Devin", "Brynn", "Casey", "Agnes", "Fraser", "Maude", "Naomi", "Denise", "Terrence", "Erma", "Jamie" ], "edges": [ [ 0, 4 ], [ 0, 7 ], [ 3, 6 ], [ 4, 1 ], [ 5, 2 ], [ 6, 8 ], [ 7, 9 ], [ 9, 5 ], [ 9, 3 ], [ 10, 14 ], [ 10, 17 ], [ 13, 16 ], [ 14, 11 ], [ 15, 12 ], [ 16, 18 ], [ 17, 19 ], [ 19, 15 ], [ 19, 13 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Chloe knows Frida. Leander knows Wilson. Frida knows Hope. Imogen knows Yolanda. Katherine knows Leander. Leander knows Imogen. Alison knows Ada. Janet knows Seth. Frida knows Chantal. Dale knows Janet. Frida knows Javier. Lilia knows Ann. Joyce knows Lilia. Chantal knows Alison. Leander knows Keith. Katherine knows Dale. Yolanda knows Preston. Chloe knows Joyce. Which of Yolanda and Alison can Katherine reach?", "answer": "Yolanda", "steps": [ "Katherine knows Leander.", "Leander knows Imogen.", "Imogen knows Yolanda." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Katherine", "Keith", "Imogen", "Preston", "Dale", "Wilson", "Leander", "Janet", "Seth", "Yolanda", "Chloe", "Javier", "Chantal", "Ada", "Joyce", "Hope", "Frida", "Lilia", "Ann", "Alison" ], "edges": [ [ 0, 4 ], [ 0, 6 ], [ 2, 9 ], [ 4, 7 ], [ 6, 1 ], [ 6, 5 ], [ 6, 2 ], [ 7, 8 ], [ 9, 3 ], [ 10, 14 ], [ 10, 16 ], [ 12, 19 ], [ 14, 17 ], [ 16, 11 ], [ 16, 15 ], [ 16, 12 ], [ 17, 18 ], [ 19, 13 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Rhonda knows Ruth. Daria knows Christian. Christian knows Renee. Morgan knows Dahlia. Marcia knows Ben. Morgan knows Forrest. Oliver knows Morgan. Graeme knows Louise. August knows Emery. Renee knows Graeme. Morgan knows Marcia. Daria knows Brock. Marcia knows Gustavo. Ruth knows Will. Bette knows August. Gustavo knows Bette. Ruth knows Daria. Ruth knows June. Which of Gustavo and Christian can Rhonda reach?", "answer": "Christian", "steps": [ "Rhonda knows Ruth.", "Ruth knows Daria.", "Daria knows Christian." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Rhonda", "Graeme", "Brock", "Christian", "June", "Ruth", "Daria", "Renee", "Will", "Louise", "Oliver", "August", "Ben", "Gustavo", "Dahlia", "Morgan", "Marcia", "Bette", "Forrest", "Emery" ], "edges": [ [ 0, 5 ], [ 1, 9 ], [ 3, 7 ], [ 5, 4 ], [ 5, 8 ], [ 5, 6 ], [ 6, 2 ], [ 6, 3 ], [ 7, 1 ], [ 10, 15 ], [ 11, 19 ], [ 13, 17 ], [ 15, 14 ], [ 15, 18 ], [ 15, 16 ], [ 16, 12 ], [ 16, 13 ], [ 17, 11 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Rhonda knows Allison. Cameron knows Cliff. Will knows Susanne. Brock knows Beau. Wilma knows Goldie. Brock knows Keaton. Will knows Hayley. Mitchell knows Cameron. Susanne knows Brock. Wilma knows Randy. Goldie knows Hudson. Randy knows Mitchell. Hayley knows Axel. Rhonda knows Thea. Cameron knows Lars. Mitchell knows Colleen. Brock knows Rhonda. Mitchell knows Victoria. Which of Susanne and Randy can Wilma reach?", "answer": "Randy", "steps": [ "Wilma knows Randy." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Wilma", "Mitchell", "Lars", "Randy", "Hudson", "Colleen", "Victoria", "Cameron", "Cliff", "Goldie", "Will", "Brock", "Allison", "Susanne", "Axel", "Keaton", "Beau", "Rhonda", "Thea", "Hayley" ], "edges": [ [ 0, 3 ], [ 0, 9 ], [ 1, 5 ], [ 1, 6 ], [ 1, 7 ], [ 3, 1 ], [ 7, 2 ], [ 7, 8 ], [ 9, 4 ], [ 10, 13 ], [ 10, 19 ], [ 11, 15 ], [ 11, 16 ], [ 11, 17 ], [ 13, 11 ], [ 17, 12 ], [ 17, 18 ], [ 19, 14 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Ellen knows Warren. Joaquin knows Gina. Emanuel knows Gustavo. Ken knows Martha. Carter knows Jem. Dennis knows Alma. Gina knows Isaac. Jules knows Ken. Ken knows Ellen. Erma knows Jules. Calvin knows Theodore. Jules knows Emanuel. Warren knows Lily. Lily knows Jack. Joaquin knows Dennis. Julius knows Joaquin. Gina knows Carter. Jem knows Calvin. Which of Calvin and Lily can Erma reach?", "answer": "Lily", "steps": [ "Erma knows Jules.", "Jules knows Ken.", "Ken knows Ellen.", "Ellen knows Warren.", "Warren knows Lily." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Erma", "Warren", "Gustavo", "Ken", "Jules", "Ellen", "Martha", "Jack", "Lily", "Emanuel", "Julius", "Jem", "Alma", "Gina", "Joaquin", "Carter", "Isaac", "Theodore", "Calvin", "Dennis" ], "edges": [ [ 0, 4 ], [ 1, 8 ], [ 3, 6 ], [ 3, 5 ], [ 4, 3 ], [ 4, 9 ], [ 5, 1 ], [ 8, 7 ], [ 9, 2 ], [ 10, 14 ], [ 11, 18 ], [ 13, 16 ], [ 13, 15 ], [ 14, 13 ], [ 14, 19 ], [ 15, 11 ], [ 18, 17 ], [ 19, 12 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Jenna knows Lauren. Regina knows Mae. Hamilton knows Lance. Tessa knows Katherine. Joshua knows Inez. India knows Wilma. Joshua knows Jenna. Mildred knows Elena. Regina knows Mildred. Haven knows Claire. Joy knows Jake. Jenna knows India. Cristina knows Hamilton. Wilma knows Tessa. Mildred knows Callum. Wilma knows Haven. Callum knows Cristina. Cristina knows Joy. Which of Cristina and Wilma can Joshua reach?", "answer": "Wilma", "steps": [ "Joshua knows Jenna.", "Jenna knows India.", "India knows Wilma." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Joshua", "Haven", "Lauren", "Inez", "Jenna", "India", "Claire", "Katherine", "Tessa", "Wilma", "Regina", "Joy", "Elena", "Mae", "Mildred", "Callum", "Jake", "Lance", "Hamilton", "Cristina" ], "edges": [ [ 0, 3 ], [ 0, 4 ], [ 1, 6 ], [ 4, 2 ], [ 4, 5 ], [ 5, 9 ], [ 8, 7 ], [ 9, 1 ], [ 9, 8 ], [ 10, 13 ], [ 10, 14 ], [ 11, 16 ], [ 14, 12 ], [ 14, 15 ], [ 15, 19 ], [ 18, 17 ], [ 19, 11 ], [ 19, 18 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Iris knows Gene. Harriet knows Kevin. Eric knows Larissa. Byron knows Rocco. Emmett knows Jarvis. Lambert knows Lewis. Harriet knows Geoffrey. Lewis knows Byron. Iris knows Rosa. Desmond knows Lambert. Emmett knows Harriet. Byron knows Bella. Desmond knows Isadora. Florence knows Desmond. Lambert knows Lorenzo. Kevin knows Iris. Eric knows Emmett. Florence knows Chance. Which of Iris and Byron can Florence reach?", "answer": "Byron", "steps": [ "Florence knows Desmond.", "Desmond knows Lambert.", "Lambert knows Lewis.", "Lewis knows Byron." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Florence", "Lewis", "Chance", "Lorenzo", "Rocco", "Lambert", "Bella", "Byron", "Desmond", "Isadora", "Eric", "Kevin", "Larissa", "Geoffrey", "Gene", "Harriet", "Rosa", "Iris", "Emmett", "Jarvis" ], "edges": [ [ 0, 2 ], [ 0, 8 ], [ 1, 7 ], [ 5, 3 ], [ 5, 1 ], [ 7, 4 ], [ 7, 6 ], [ 8, 5 ], [ 8, 9 ], [ 10, 12 ], [ 10, 18 ], [ 11, 17 ], [ 15, 13 ], [ 15, 11 ], [ 17, 14 ], [ 17, 16 ], [ 18, 15 ], [ 18, 19 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Emmett knows Esperanza. Nadine knows Chase. Cameron knows Sidney. Isiah knows Gene. Emmett knows Nicole. Nadine knows Brad. Declan knows Nadine. Albert knows Isiah. Albert knows Darius. Brad knows Zane. Emmett knows Eileen. Declan knows Cameron. Brad knows Colette. Brad knows Karl. Nicole knows Pablo. Darius knows Emmett. Colette knows Derrick. Darius knows Grant. Which of Pablo and Derrick can Declan reach?", "answer": "Derrick", "steps": [ "Declan knows Nadine.", "Nadine knows Brad.", "Brad knows Colette.", "Colette knows Derrick." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Declan", "Brad", "Karl", "Cameron", "Derrick", "Zane", "Colette", "Nadine", "Chase", "Sidney", "Albert", "Emmett", "Esperanza", "Isiah", "Pablo", "Eileen", "Nicole", "Darius", "Grant", "Gene" ], "edges": [ [ 0, 7 ], [ 0, 3 ], [ 1, 2 ], [ 1, 5 ], [ 1, 6 ], [ 3, 9 ], [ 6, 4 ], [ 7, 1 ], [ 7, 8 ], [ 10, 17 ], [ 10, 13 ], [ 11, 12 ], [ 11, 15 ], [ 11, 16 ], [ 13, 19 ], [ 16, 14 ], [ 17, 11 ], [ 17, 18 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Kane knows Luz. Skyler knows Clay. Luz knows Lana. Clay knows Parsa. Parsa knows Nash. Marc knows Selena. Parsa knows Kendra. Hendrix knows Graeme. Yolanda knows Dina. Parsa knows Hudson. Skyler knows Norma. Skyler knows Elvira. Eden knows Marc. Nash knows Hendrix. Marc knows Kane. Yolanda knows Dudley. Yolanda knows Eden. Marc knows Elaine. Which of Hendrix and Luz can Skyler reach?", "answer": "Hendrix", "steps": [ "Skyler knows Clay.", "Clay knows Parsa.", "Parsa knows Nash.", "Nash knows Hendrix." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Skyler", "Elvira", "Parsa", "Hendrix", "Clay", "Norma", "Hudson", "Graeme", "Kendra", "Nash", "Yolanda", "Dudley", "Marc", "Luz", "Eden", "Dina", "Elaine", "Lana", "Selena", "Kane" ], "edges": [ [ 0, 1 ], [ 0, 5 ], [ 0, 4 ], [ 2, 6 ], [ 2, 8 ], [ 2, 9 ], [ 3, 7 ], [ 4, 2 ], [ 9, 3 ], [ 10, 11 ], [ 10, 15 ], [ 10, 14 ], [ 12, 16 ], [ 12, 18 ], [ 12, 19 ], [ 13, 17 ], [ 14, 12 ], [ 19, 13 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Clement knows Greta. Clement knows Dylan. Ashton knows Simon. Robin knows Gareth. Ashton knows Reid. Gareth knows Lorna. Simon knows Jack. Lyric knows Nelson. Jack knows Lyric. Reid knows Clement. Yvette knows Raymond. Raymond knows Robin. Dylan knows Clayton. Kit knows Bert. Carmen knows Kit. Yvette knows Carmen. Lyle knows Teresa. Kit knows Lyle. Which of Clement and Kit can Yvette reach?", "answer": "Kit", "steps": [ "Yvette knows Carmen.", "Carmen knows Kit." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Yvette", "Robin", "Raymond", "Kit", "Bert", "Gareth", "Teresa", "Lorna", "Carmen", "Lyle", "Ashton", "Jack", "Simon", "Clement", "Greta", "Lyric", "Clayton", "Nelson", "Reid", "Dylan" ], "edges": [ [ 0, 2 ], [ 0, 8 ], [ 1, 5 ], [ 2, 1 ], [ 3, 4 ], [ 3, 9 ], [ 5, 7 ], [ 8, 3 ], [ 9, 6 ], [ 10, 12 ], [ 10, 18 ], [ 11, 15 ], [ 12, 11 ], [ 13, 14 ], [ 13, 19 ], [ 15, 17 ], [ 18, 13 ], [ 19, 16 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Eden knows Viola. Marilyn knows Val. Eden knows Wanda. William knows Gwen. Hope knows Estella. Ella knows Dora. Colin knows Demetrius. Dora knows Marilyn. Hope knows Eden. Earle knows Hope. Jonah knows Colin. Marilyn knows Porter. Demetrius knows Ella. Pearl knows Earle. Harris knows Pearl. Dora knows William. Estella knows Cameron. Corinne knows Harris. Which of Ella and Earle can Corinne reach?", "answer": "Earle", "steps": [ "Corinne knows Harris.", "Harris knows Pearl.", "Pearl knows Earle." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Corinne", "Harris", "Hope", "Eden", "Estella", "Cameron", "Pearl", "Viola", "Earle", "Wanda", "Jonah", "Colin", "Dora", "Marilyn", "William", "Gwen", "Demetrius", "Val", "Ella", "Porter" ], "edges": [ [ 0, 1 ], [ 1, 6 ], [ 2, 4 ], [ 2, 3 ], [ 3, 7 ], [ 3, 9 ], [ 4, 5 ], [ 6, 8 ], [ 8, 2 ], [ 10, 11 ], [ 11, 16 ], [ 12, 14 ], [ 12, 13 ], [ 13, 17 ], [ 13, 19 ], [ 14, 15 ], [ 16, 18 ], [ 18, 12 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Fergus knows Jonas. Sydney knows Erik. Russ knows Faith. Carter knows Bennett. Leigh knows Ashton. Desmond knows Steve. Bennett knows Dave. Desmond knows Edgar. Bennett knows Sydney. Colette knows Russ. Leigh knows Lena. Fergus knows Colette. Carter knows Hope. Sydney knows Desmond. Russ knows Leigh. Hope knows Tom. Colette knows Stephen. Jonas knows Arlene. Which of Ashton and Steve can Fergus reach?", "answer": "Ashton", "steps": [ "Fergus knows Colette.", "Colette knows Russ.", "Russ knows Leigh.", "Leigh knows Ashton." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Fergus", "Jonas", "Stephen", "Faith", "Colette", "Lena", "Arlene", "Russ", "Ashton", "Leigh", "Carter", "Hope", "Dave", "Erik", "Bennett", "Edgar", "Tom", "Sydney", "Steve", "Desmond" ], "edges": [ [ 0, 1 ], [ 0, 4 ], [ 1, 6 ], [ 4, 2 ], [ 4, 7 ], [ 7, 3 ], [ 7, 9 ], [ 9, 5 ], [ 9, 8 ], [ 10, 11 ], [ 10, 14 ], [ 11, 16 ], [ 14, 12 ], [ 14, 17 ], [ 17, 13 ], [ 17, 19 ], [ 19, 15 ], [ 19, 18 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Estella knows Caroline. Stanley knows Susan. Emery knows Estella. Neville knows Emery. Neville knows Julian. Emery knows Dave. Caroline knows Aurora. Wade knows Axel. Charity knows Roger. Wade knows Charity. Kim knows Colette. Wade knows Rosemary. Neville knows Kim. Rosemary knows Lance. Daniella knows Neville. Rosemary knows Stanley. Heidi knows Wade. Susan knows Francesca. Which of Susan and Caroline can Heidi reach?", "answer": "Susan", "steps": [ "Heidi knows Wade.", "Wade knows Rosemary.", "Rosemary knows Stanley.", "Stanley knows Susan." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Heidi", "Stanley", "Francesca", "Lance", "Charity", "Rosemary", "Axel", "Susan", "Wade", "Roger", "Daniella", "Estella", "Aurora", "Dave", "Kim", "Emery", "Julian", "Caroline", "Neville", "Colette" ], "edges": [ [ 0, 8 ], [ 1, 7 ], [ 4, 9 ], [ 5, 3 ], [ 5, 1 ], [ 7, 2 ], [ 8, 6 ], [ 8, 5 ], [ 8, 4 ], [ 10, 18 ], [ 11, 17 ], [ 14, 19 ], [ 15, 13 ], [ 15, 11 ], [ 17, 12 ], [ 18, 16 ], [ 18, 15 ], [ 18, 14 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Emanuel knows Joshua. Zach knows Agnes. Axel knows Aaron. Lars knows Constance. Emanuel knows Oscar. Zach knows Don. Leonard knows Dixie. Zach knows Daphna. Philip knows Zach. Agnes knows Axel. Emanuel knows Whitney. Oscar knows Karen. Karen knows Tiffany. Lennox knows Leonard. Whitney knows Lennox. Roger knows Lars. Daphna knows Roger. Iris knows Emanuel. Which of Emanuel and Zach can Philip reach?", "answer": "Zach", "steps": [ "Philip knows Zach." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Philip", "Roger", "Aaron", "Don", "Daphna", "Zach", "Axel", "Lars", "Constance", "Agnes", "Iris", "Lennox", "Tiffany", "Joshua", "Whitney", "Emanuel", "Karen", "Leonard", "Dixie", "Oscar" ], "edges": [ [ 0, 5 ], [ 1, 7 ], [ 4, 1 ], [ 5, 3 ], [ 5, 4 ], [ 5, 9 ], [ 6, 2 ], [ 7, 8 ], [ 9, 6 ], [ 10, 15 ], [ 11, 17 ], [ 14, 11 ], [ 15, 13 ], [ 15, 14 ], [ 15, 19 ], [ 16, 12 ], [ 17, 18 ], [ 19, 16 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Morris knows Brynn. Morris knows Hugh. Darin knows Kristin. Erin knows Pam. Jolena knows Cristina. Nathan knows Jolena. James knows Nathan. Brynn knows Reed. Tina knows Vincent. Nathan knows Darin. Hugh knows Ellen. Morris knows August. Natalie knows Desmond. August knows Gene. Reed knows Natalie. Kristin knows Tina. Peter knows Morris. Nathan knows Erin. Which of Reed and Kristin can James reach?", "answer": "Kristin", "steps": [ "James knows Nathan.", "Nathan knows Darin.", "Darin knows Kristin." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "James", "Cristina", "Vincent", "Jolena", "Erin", "Darin", "Tina", "Pam", "Kristin", "Nathan", "Peter", "Gene", "Desmond", "August", "Hugh", "Brynn", "Natalie", "Ellen", "Reed", "Morris" ], "edges": [ [ 0, 9 ], [ 3, 1 ], [ 4, 7 ], [ 5, 8 ], [ 6, 2 ], [ 8, 6 ], [ 9, 3 ], [ 9, 4 ], [ 9, 5 ], [ 10, 19 ], [ 13, 11 ], [ 14, 17 ], [ 15, 18 ], [ 16, 12 ], [ 18, 16 ], [ 19, 13 ], [ 19, 14 ], [ 19, 15 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Jules knows Estelle. Edmund knows Opal. Hazel knows Layla. Malik knows Hazel. Hazel knows Floyd. Dwight knows Joanna. Penny knows Darla. Opal knows Dwight. Carol knows Hope. Carol knows Penny. Dwight knows Robert. Katrina knows Edmund. Joanna knows Jules. Edmund knows Marilyn. Michael knows Carol. Michael knows Gerald. Joanna knows Preston. Layla knows Michael. Which of Penny and Jules can Katrina reach?", "answer": "Jules", "steps": [ "Katrina knows Edmund.", "Edmund knows Opal.", "Opal knows Dwight.", "Dwight knows Joanna.", "Joanna knows Jules." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Katrina", "Marilyn", "Estelle", "Opal", "Joanna", "Robert", "Jules", "Dwight", "Preston", "Edmund", "Malik", "Floyd", "Darla", "Layla", "Carol", "Gerald", "Penny", "Michael", "Hope", "Hazel" ], "edges": [ [ 0, 9 ], [ 3, 7 ], [ 4, 6 ], [ 4, 8 ], [ 6, 2 ], [ 7, 5 ], [ 7, 4 ], [ 9, 1 ], [ 9, 3 ], [ 10, 19 ], [ 13, 17 ], [ 14, 16 ], [ 14, 18 ], [ 16, 12 ], [ 17, 15 ], [ 17, 14 ], [ 19, 11 ], [ 19, 13 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Hadley knows Melanie. Alma knows Ignacio. Tabitha knows Chance. Gwen knows Abigail. Luke knows Chloe. Luz knows Henrietta. Gerard knows Levi. Ignacio knows Horace. Levi knows Alma. Mason knows Bernard. Gerard knows Tracy. Melanie knows Gwen. Levi knows Tabitha. Bernard knows Victor. Luke knows Hadley. Hadley knows Adelaide. Melanie knows Mason. Luz knows Gerard. Which of Bernard and Ignacio can Luke reach?", "answer": "Bernard", "steps": [ "Luke knows Hadley.", "Hadley knows Melanie.", "Melanie knows Mason.", "Mason knows Bernard." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Luke", "Mason", "Hadley", "Gwen", "Bernard", "Chloe", "Victor", "Adelaide", "Melanie", "Abigail", "Luz", "Alma", "Gerard", "Tabitha", "Ignacio", "Henrietta", "Horace", "Tracy", "Levi", "Chance" ], "edges": [ [ 0, 5 ], [ 0, 2 ], [ 1, 4 ], [ 2, 7 ], [ 2, 8 ], [ 3, 9 ], [ 4, 6 ], [ 8, 1 ], [ 8, 3 ], [ 10, 15 ], [ 10, 12 ], [ 11, 14 ], [ 12, 17 ], [ 12, 18 ], [ 13, 19 ], [ 14, 16 ], [ 18, 11 ], [ 18, 13 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Emmett knows Gwen. Abel knows Arlene. Glen knows Essie. Emmett knows Abel. Carla knows Dewey. Reid knows Hardy. April knows Kirsten. Essie knows Frank. Helene knows Carla. Essie knows Mae. Guy knows Reid. Hardy knows Finn. Harry knows Helene. Helene knows James. Reid knows Emanuel. Reid knows Harry. Essie knows April. Frank knows Emmett. Which of Helene and Emmett can Glen reach?", "answer": "Emmett", "steps": [ "Glen knows Essie.", "Essie knows Frank.", "Frank knows Emmett." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Glen", "Mae", "Essie", "Arlene", "April", "Frank", "Gwen", "Emmett", "Abel", "Kirsten", "Guy", "Emanuel", "Reid", "Dewey", "Hardy", "Harry", "James", "Helene", "Carla", "Finn" ], "edges": [ [ 0, 2 ], [ 2, 1 ], [ 2, 5 ], [ 2, 4 ], [ 4, 9 ], [ 5, 7 ], [ 7, 6 ], [ 7, 8 ], [ 8, 3 ], [ 10, 12 ], [ 12, 11 ], [ 12, 15 ], [ 12, 14 ], [ 14, 19 ], [ 15, 17 ], [ 17, 16 ], [ 17, 18 ], [ 18, 13 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Laurel knows Zach. Zelda knows Clifford. Celia knows Atlas. Guy knows Celia. Russell knows Grady. Laurel knows Guy. Casey knows Keaton. Laurel knows Franklin. Dwight knows Tom. Keaton knows Daphna. Tom knows Russell. Imogen knows Jenny. Aaron knows Laurel. Daphna knows Aaron. Luna knows Imogen. Grady knows Zelda. Zelda knows Luna. Zelda knows Cornelius. Which of Russell and Daphna can Dwight reach?", "answer": "Russell", "steps": [ "Dwight knows Tom.", "Tom knows Russell." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Dwight", "Grady", "Jenny", "Zelda", "Clifford", "Luna", "Russell", "Imogen", "Tom", "Cornelius", "Casey", "Aaron", "Atlas", "Laurel", "Zach", "Guy", "Daphna", "Celia", "Keaton", "Franklin" ], "edges": [ [ 0, 8 ], [ 1, 3 ], [ 3, 4 ], [ 3, 5 ], [ 3, 9 ], [ 5, 7 ], [ 6, 1 ], [ 7, 2 ], [ 8, 6 ], [ 10, 18 ], [ 11, 13 ], [ 13, 14 ], [ 13, 15 ], [ 13, 19 ], [ 15, 17 ], [ 16, 11 ], [ 17, 12 ], [ 18, 16 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Coral knows Axel. Roman knows Houston. Carey knows Gertrude. Dick knows Roy. Carey knows Imogen. Axel knows Effie. Julio knows Roman. Julio knows Hugh. Imogen knows Sandra. Houston knows Coral. Jeanne knows Laurel. Julio knows Mike. Melanie knows Mark. Roy knows Leah. Sandra knows Teresa. Mike knows Jeanne. Carey knows Melanie. Mark knows Dick. Which of Roy and Axel can Carey reach?", "answer": "Roy", "steps": [ "Carey knows Melanie.", "Melanie knows Mark.", "Mark knows Dick.", "Dick knows Roy." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Carey", "Mark", "Roy", "Teresa", "Melanie", "Dick", "Sandra", "Leah", "Gertrude", "Imogen", "Julio", "Houston", "Axel", "Laurel", "Roman", "Coral", "Jeanne", "Effie", "Hugh", "Mike" ], "edges": [ [ 0, 4 ], [ 0, 8 ], [ 0, 9 ], [ 1, 5 ], [ 2, 7 ], [ 4, 1 ], [ 5, 2 ], [ 6, 3 ], [ 9, 6 ], [ 10, 14 ], [ 10, 18 ], [ 10, 19 ], [ 11, 15 ], [ 12, 17 ], [ 14, 11 ], [ 15, 12 ], [ 16, 13 ], [ 19, 16 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Sebastian knows Elvira. Jessica knows Harmony. Whitney knows Riley. Elvira knows Lucia. Sebastian knows Miles. Daphne knows Itzel. Laurel knows Warren. Dakota knows Laurel. Dakota knows Fabian. Laurel knows Whitney. Elvira knows Jessica. Harmony knows Daphne. Riley knows Wayne. Riley knows Antonio. Sebastian knows Logan. Harmony knows Lana. Dakota knows Guy. Antonio knows Barney. Which of Barney and Itzel can Sebastian reach?", "answer": "Itzel", "steps": [ "Sebastian knows Elvira.", "Elvira knows Jessica.", "Jessica knows Harmony.", "Harmony knows Daphne.", "Daphne knows Itzel." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Sebastian", "Lucia", "Logan", "Daphne", "Jessica", "Lana", "Itzel", "Miles", "Harmony", "Elvira", "Dakota", "Warren", "Fabian", "Antonio", "Whitney", "Wayne", "Barney", "Guy", "Riley", "Laurel" ], "edges": [ [ 0, 2 ], [ 0, 7 ], [ 0, 9 ], [ 3, 6 ], [ 4, 8 ], [ 8, 5 ], [ 8, 3 ], [ 9, 1 ], [ 9, 4 ], [ 10, 12 ], [ 10, 17 ], [ 10, 19 ], [ 13, 16 ], [ 14, 18 ], [ 18, 15 ], [ 18, 13 ], [ 19, 11 ], [ 19, 14 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Alicia knows Blanche. Alexa knows Jolene. Kay knows Alexa. Jolene knows Dorian. Arturo knows Eunice. Diana knows Angela. Dorian knows Christopher. Alicia knows Christian. Alana knows Diana. Ignacio knows Alana. Ross knows Erma. Alicia knows Lucas. Christian knows Clement. Arturo knows Kay. Alana knows Saul. Dorian knows Ross. Clement knows Ignacio. Arturo knows Oliver. Which of Erma and Angela can Arturo reach?", "answer": "Erma", "steps": [ "Arturo knows Kay.", "Kay knows Alexa.", "Alexa knows Jolene.", "Jolene knows Dorian.", "Dorian knows Ross.", "Ross knows Erma." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Arturo", "Ross", "Jolene", "Erma", "Oliver", "Kay", "Alexa", "Christopher", "Eunice", "Dorian", "Alicia", "Diana", "Ignacio", "Angela", "Lucas", "Christian", "Clement", "Saul", "Blanche", "Alana" ], "edges": [ [ 0, 4 ], [ 0, 8 ], [ 0, 5 ], [ 1, 3 ], [ 2, 9 ], [ 5, 6 ], [ 6, 2 ], [ 9, 1 ], [ 9, 7 ], [ 10, 14 ], [ 10, 18 ], [ 10, 15 ], [ 11, 13 ], [ 12, 19 ], [ 15, 16 ], [ 16, 12 ], [ 19, 11 ], [ 19, 17 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Axel knows Clayton. Clayton knows Max. Clayton knows Wanda. Glenda knows Jackson. Faith knows Dorothy. Faith knows Colleen. Jackson knows Faith. Ivy knows Priscilla. Priscilla knows Elaine. Dana knows Amanda. Ivy knows Eleanor. Dana knows Geoffrey. Geoffrey knows Jennifer. Jennifer knows Madeline. Wanda knows Dana. Elaine knows Crystal. Benjamin knows Axel. Dorothy knows Ivy. Which of Faith and Clayton can Glenda reach?", "answer": "Faith", "steps": [ "Glenda knows Jackson.", "Jackson knows Faith." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Glenda", "Colleen", "Eleanor", "Ivy", "Elaine", "Dorothy", "Jackson", "Priscilla", "Faith", "Crystal", "Benjamin", "Max", "Amanda", "Dana", "Jennifer", "Wanda", "Axel", "Geoffrey", "Clayton", "Madeline" ], "edges": [ [ 0, 6 ], [ 3, 2 ], [ 3, 7 ], [ 4, 9 ], [ 5, 3 ], [ 6, 8 ], [ 7, 4 ], [ 8, 1 ], [ 8, 5 ], [ 10, 16 ], [ 13, 12 ], [ 13, 17 ], [ 14, 19 ], [ 15, 13 ], [ 16, 18 ], [ 17, 14 ], [ 18, 11 ], [ 18, 15 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Hadley knows Wendell. Noel knows Coral. Louisa knows Hadley. Colin knows Edward. Pauline knows Tristan. Noel knows Alder. Coral knows Fisher. Wendell knows Amanda. Wendell knows Colin. Marcia knows Kim. Alder knows Randall. Hadley knows Pauline. Fisher knows Albert. Coral knows Dale. Edward knows Samantha. Marcia knows Noel. Albert knows Atlas. Louisa knows Dakota. Which of Coral and Wendell can Marcia reach?", "answer": "Coral", "steps": [ "Marcia knows Noel.", "Noel knows Coral." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Marcia", "Alder", "Atlas", "Coral", "Kim", "Noel", "Fisher", "Randall", "Dale", "Albert", "Louisa", "Pauline", "Samantha", "Wendell", "Dakota", "Hadley", "Colin", "Tristan", "Amanda", "Edward" ], "edges": [ [ 0, 4 ], [ 0, 5 ], [ 1, 7 ], [ 3, 8 ], [ 3, 6 ], [ 5, 1 ], [ 5, 3 ], [ 6, 9 ], [ 9, 2 ], [ 10, 14 ], [ 10, 15 ], [ 11, 17 ], [ 13, 18 ], [ 13, 16 ], [ 15, 11 ], [ 15, 13 ], [ 16, 19 ], [ 19, 12 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Adelaide knows Robin. Wilson knows Roger. Roger knows Joaquin. Rufus knows Joanna. Oliver knows Xander. Oliver knows Maureen. Isaac knows Wilson. Wilson knows Federico. Emily knows Rufus. Wilson knows Jeremiah. Emily knows Oliver. Wilson knows Katherine. Oliver knows Adelaide. Isaac knows Preston. Oliver knows Amanda. Preston knows Eli. Roger knows Clark. Adelaide knows Shawn. Which of Wilson and Oliver can Isaac reach?", "answer": "Wilson", "steps": [ "Isaac knows Wilson." ], "difficulty": 1, "original_distance": 3, "idx_to_symbol": [ "Isaac", "Joaquin", "Eli", "Katherine", "Federico", "Clark", "Jeremiah", "Wilson", "Preston", "Roger", "Emily", "Shawn", "Joanna", "Amanda", "Maureen", "Robin", "Xander", "Oliver", "Rufus", "Adelaide" ], "edges": [ [ 0, 8 ], [ 0, 7 ], [ 7, 3 ], [ 7, 4 ], [ 7, 6 ], [ 7, 9 ], [ 8, 2 ], [ 9, 1 ], [ 9, 5 ], [ 10, 18 ], [ 10, 17 ], [ 17, 13 ], [ 17, 14 ], [ 17, 16 ], [ 17, 19 ], [ 18, 12 ], [ 19, 11 ], [ 19, 15 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Susan knows Anton. Sidney knows Cesar. Lane knows Fraser. Susan knows Curtis. Conner knows Susan. Lane knows Ava. Hampton knows Destiny. Hampton knows Conner. Jordan knows Sidney. Lane knows Lara. Susan knows Magdalena. Jordan knows Lane. Barry knows Noel. Lewis knows Jordan. Conner knows Barry. Lane knows Daphna. Susan knows Jeff. Lewis knows Frida. Which of Lara and Magdalena can Lewis reach?", "answer": "Lara", "steps": [ "Lewis knows Jordan.", "Jordan knows Lane.", "Lane knows Lara." ], "difficulty": 3, "original_distance": 3, "idx_to_symbol": [ "Lewis", "Sidney", "Daphna", "Lane", "Frida", "Cesar", "Jordan", "Fraser", "Lara", "Ava", "Hampton", "Barry", "Anton", "Susan", "Destiny", "Noel", "Conner", "Jeff", "Magdalena", "Curtis" ], "edges": [ [ 0, 4 ], [ 0, 6 ], [ 1, 5 ], [ 3, 2 ], [ 3, 7 ], [ 3, 8 ], [ 3, 9 ], [ 6, 1 ], [ 6, 3 ], [ 10, 14 ], [ 10, 16 ], [ 11, 15 ], [ 13, 12 ], [ 13, 17 ], [ 13, 18 ], [ 13, 19 ], [ 16, 11 ], [ 16, 13 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Elijah knows Pablo. Boris knows Ida. Lois knows Odette. Odette knows Boris. Julia knows Antonio. Diana knows Fernando. Pablo knows Ruth. Foster knows Elijah. Lois knows Jude. Antonio knows Inez. Kirsten knows Lois. Diana knows Ember. Fernando knows Foster. Elizabeth knows Rena. Jude knows Elizabeth. Isaac knows Kirsten. Foster knows Julia. Isaac knows Kenzie. Which of Julia and Jude can Diana reach?", "answer": "Julia", "steps": [ "Diana knows Fernando.", "Fernando knows Foster.", "Foster knows Julia." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Diana", "Ember", "Fernando", "Elijah", "Ruth", "Foster", "Pablo", "Inez", "Julia", "Antonio", "Isaac", "Kenzie", "Kirsten", "Odette", "Ida", "Lois", "Boris", "Rena", "Jude", "Elizabeth" ], "edges": [ [ 0, 1 ], [ 0, 2 ], [ 2, 5 ], [ 3, 6 ], [ 5, 3 ], [ 5, 8 ], [ 6, 4 ], [ 8, 9 ], [ 9, 7 ], [ 10, 11 ], [ 10, 12 ], [ 12, 15 ], [ 13, 16 ], [ 15, 13 ], [ 15, 18 ], [ 16, 14 ], [ 18, 19 ], [ 19, 17 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Abby knows Cole. Cole knows Clifford. Jon knows Joan. Yara knows Merle. Calvin knows Marie. Florence knows Calvin. Cole knows Harriet. Merle knows Emery. Levi knows Laura. Cole knows Shaun. Jon knows Levi. Jon knows Edison. Clifford knows Ruth. Marie knows Abby. Archer knows Joseph. Emery knows Archer. Abby knows Fleur. Archer knows Jon. Which of Archer and Abby can Yara reach?", "answer": "Archer", "steps": [ "Yara knows Merle.", "Merle knows Emery.", "Emery knows Archer." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Yara", "Laura", "Emery", "Joan", "Edison", "Merle", "Joseph", "Levi", "Jon", "Archer", "Florence", "Ruth", "Marie", "Harriet", "Shaun", "Calvin", "Fleur", "Clifford", "Cole", "Abby" ], "edges": [ [ 0, 5 ], [ 2, 9 ], [ 5, 2 ], [ 7, 1 ], [ 8, 3 ], [ 8, 4 ], [ 8, 7 ], [ 9, 6 ], [ 9, 8 ], [ 10, 15 ], [ 12, 19 ], [ 15, 12 ], [ 17, 11 ], [ 18, 13 ], [ 18, 14 ], [ 18, 17 ], [ 19, 16 ], [ 19, 18 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Joshua knows Lamont. Harry knows Camden. Joshua knows Harris. Casey knows Lee. Darnell knows Virginia. Darnell knows Nolan. Joshua knows Willard. Joshua knows Corey. Virginia knows Ada. Willard knows Ava. Blake knows Cesar. Casey knows Harry. Ada knows Blake. Blake knows Kristin. Ava knows Casey. Darnell knows Cordelia. Kristin knows Steve. Darnell knows Patricia. Which of Blake and Casey can Darnell reach?", "answer": "Blake", "steps": [ "Darnell knows Virginia.", "Virginia knows Ada.", "Ada knows Blake." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Darnell", "Kristin", "Cordelia", "Blake", "Steve", "Cesar", "Nolan", "Ada", "Virginia", "Patricia", "Joshua", "Harry", "Harris", "Casey", "Camden", "Lee", "Lamont", "Ava", "Willard", "Corey" ], "edges": [ [ 0, 2 ], [ 0, 6 ], [ 0, 8 ], [ 0, 9 ], [ 1, 4 ], [ 3, 1 ], [ 3, 5 ], [ 7, 3 ], [ 8, 7 ], [ 10, 12 ], [ 10, 16 ], [ 10, 18 ], [ 10, 19 ], [ 11, 14 ], [ 13, 11 ], [ 13, 15 ], [ 17, 13 ], [ 18, 17 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Erwin knows Cole. Trudy knows Pauline. Kristina knows Dean. Warren knows Trudy. Benjamin knows Karina. Karina knows Lucia. Warren knows Lola. Kristina knows Estella. Estella knows Evan. Warren knows Jacob. Jacob knows Doug. Lola knows Douglas. Erwin knows Kristina. Kristina knows Neville. Neville knows Jane. Ann knows Erwin. Karina knows Warren. Dean knows Olive. Which of Dean and Trudy can Benjamin reach?", "answer": "Trudy", "steps": [ "Benjamin knows Karina.", "Karina knows Warren.", "Warren knows Trudy." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Benjamin", "Karina", "Jacob", "Pauline", "Doug", "Trudy", "Warren", "Douglas", "Lola", "Lucia", "Ann", "Erwin", "Neville", "Olive", "Jane", "Dean", "Kristina", "Evan", "Estella", "Cole" ], "edges": [ [ 0, 1 ], [ 1, 6 ], [ 1, 9 ], [ 2, 4 ], [ 5, 3 ], [ 6, 2 ], [ 6, 5 ], [ 6, 8 ], [ 8, 7 ], [ 10, 11 ], [ 11, 16 ], [ 11, 19 ], [ 12, 14 ], [ 15, 13 ], [ 16, 12 ], [ 16, 15 ], [ 16, 18 ], [ 18, 17 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Dolores knows Lois. Dolores knows Finn. Stella knows Leon. Leon knows Holden. Nash knows Stella. Chantal knows Glen. Ramona knows Fraser. Iris knows Angela. Sydney knows Horace. Horace knows Cora. Finn knows Mara. Finn knows Charlene. Angela knows Fergus. Chantal knows Denver. Denver knows Iris. Lois knows Ramona. Nash knows Chantal. Charlene knows Sydney. Which of Fergus and Cora can Dolores reach?", "answer": "Cora", "steps": [ "Dolores knows Finn.", "Finn knows Charlene.", "Charlene knows Sydney.", "Sydney knows Horace.", "Horace knows Cora." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Dolores", "Fraser", "Finn", "Charlene", "Mara", "Cora", "Sydney", "Lois", "Ramona", "Horace", "Nash", "Holden", "Chantal", "Denver", "Glen", "Fergus", "Iris", "Stella", "Leon", "Angela" ], "edges": [ [ 0, 7 ], [ 0, 2 ], [ 2, 4 ], [ 2, 3 ], [ 3, 6 ], [ 6, 9 ], [ 7, 8 ], [ 8, 1 ], [ 9, 5 ], [ 10, 17 ], [ 10, 12 ], [ 12, 14 ], [ 12, 13 ], [ 13, 16 ], [ 16, 19 ], [ 17, 18 ], [ 18, 11 ], [ 19, 15 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Cordelia knows Ezra. Ezra knows Zoe. Anita knows Jodi. Jane knows Adele. Edwin knows Graeme. Maria knows Lilia. Zoe knows Bruno. Graeme knows Hayley. Adele knows Howard. Maude knows Edwin. Jane knows Maude. Zoe knows Russ. Russ knows Eleanor. Edwin knows Maria. Anita knows Holly. Cordelia knows Anita. Bruno knows Pat. Adele knows Allison. Which of Edwin and Zoe can Jane reach?", "answer": "Edwin", "steps": [ "Jane knows Maude.", "Maude knows Edwin." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Jane", "Allison", "Graeme", "Lilia", "Maude", "Maria", "Hayley", "Howard", "Edwin", "Adele", "Cordelia", "Holly", "Bruno", "Eleanor", "Ezra", "Russ", "Pat", "Jodi", "Zoe", "Anita" ], "edges": [ [ 0, 4 ], [ 0, 9 ], [ 2, 6 ], [ 4, 8 ], [ 5, 3 ], [ 8, 5 ], [ 8, 2 ], [ 9, 1 ], [ 9, 7 ], [ 10, 14 ], [ 10, 19 ], [ 12, 16 ], [ 14, 18 ], [ 15, 13 ], [ 18, 15 ], [ 18, 12 ], [ 19, 11 ], [ 19, 17 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Arden knows Eunice. Austin knows Laura. Constance knows Wayne. Arden knows Simon. Lauren knows Dolly. Alejandro knows Ricardo. Austin knows Kristin. Peter knows Donovan. Alejandro knows Lamont. Lamont knows Austin. Donovan knows Kerry. Wayne knows Lauren. Austin knows Peter. Constance knows Hardy. Constance knows Sean. Ramona knows Arden. Eunice knows Constance. Emery knows Alejandro. Which of Lamont and Eunice can Emery reach?", "answer": "Lamont", "steps": [ "Emery knows Alejandro.", "Alejandro knows Lamont." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Emery", "Austin", "Alejandro", "Ricardo", "Peter", "Kristin", "Donovan", "Lamont", "Kerry", "Laura", "Ramona", "Constance", "Arden", "Simon", "Wayne", "Hardy", "Lauren", "Eunice", "Dolly", "Sean" ], "edges": [ [ 0, 2 ], [ 1, 5 ], [ 1, 4 ], [ 1, 9 ], [ 2, 3 ], [ 2, 7 ], [ 4, 6 ], [ 6, 8 ], [ 7, 1 ], [ 10, 12 ], [ 11, 15 ], [ 11, 14 ], [ 11, 19 ], [ 12, 13 ], [ 12, 17 ], [ 14, 16 ], [ 16, 18 ], [ 17, 11 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Charlotte knows Celia. Fred knows Brody. Brody knows Jillian. Chester knows Spencer. Brenda knows Alyson. Darnell knows Kim. Celia knows Ross. Gail knows India. Spencer knows Ivan. Sidney knows Archer. Archer knows Gail. Ivan knows Luke. Dorothy knows Darnell. Kim knows Erma. Charlotte knows Fred. India knows Brenda. Ross knows Dorothy. Chester knows Sidney. Which of Alyson and Erma can Chester reach?", "answer": "Alyson", "steps": [ "Chester knows Sidney.", "Sidney knows Archer.", "Archer knows Gail.", "Gail knows India.", "India knows Brenda.", "Brenda knows Alyson." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Chester", "Luke", "India", "Spencer", "Archer", "Alyson", "Gail", "Ivan", "Brenda", "Sidney", "Charlotte", "Jillian", "Darnell", "Fred", "Ross", "Erma", "Dorothy", "Brody", "Kim", "Celia" ], "edges": [ [ 0, 3 ], [ 0, 9 ], [ 2, 8 ], [ 3, 7 ], [ 4, 6 ], [ 6, 2 ], [ 7, 1 ], [ 8, 5 ], [ 9, 4 ], [ 10, 13 ], [ 10, 19 ], [ 12, 18 ], [ 13, 17 ], [ 14, 16 ], [ 16, 12 ], [ 17, 11 ], [ 18, 15 ], [ 19, 14 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Alfonso knows Eric. Shane knows Elton. Katherine knows Hal. Joanna knows David. Carter knows Gustavo. Alfonso knows Shane. Hudson knows Leon. Jordan knows Virginia. Leon knows Dane. Hal knows Alfonso. Alfonso knows Hayes. Hayes knows Lark. Virginia knows Laura. Virginia knows Carter. Laura knows Raquel. Eric knows Joanna. Virginia knows Hudson. Anastasia knows Jordan. Which of David and Dane can Katherine reach?", "answer": "David", "steps": [ "Katherine knows Hal.", "Hal knows Alfonso.", "Alfonso knows Eric.", "Eric knows Joanna.", "Joanna knows David." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Katherine", "Eric", "Hayes", "Shane", "David", "Hal", "Alfonso", "Joanna", "Elton", "Lark", "Anastasia", "Hudson", "Carter", "Laura", "Dane", "Jordan", "Virginia", "Leon", "Raquel", "Gustavo" ], "edges": [ [ 0, 5 ], [ 1, 7 ], [ 2, 9 ], [ 3, 8 ], [ 5, 6 ], [ 6, 1 ], [ 6, 3 ], [ 6, 2 ], [ 7, 4 ], [ 10, 15 ], [ 11, 17 ], [ 12, 19 ], [ 13, 18 ], [ 15, 16 ], [ 16, 11 ], [ 16, 13 ], [ 16, 12 ], [ 17, 14 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "James knows Daisy. Duke knows Raquel. Griffith knows Hardy. Dakota knows Gordon. Keegan knows Lamont. Lamont knows Griffith. Teresa knows James. Dakota knows Vance. Leah knows Teresa. Alma knows Ramona. Ramona knows Duke. Ariel knows Keegan. Hardy knows Dakota. Adrian knows Ariel. Lamont knows Devin. James knows Alma. Trevor knows Leah. Duke knows Daniella. Which of Griffith and Alma can Trevor reach?", "answer": "Alma", "steps": [ "Trevor knows Leah.", "Leah knows Teresa.", "Teresa knows James.", "James knows Alma." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Trevor", "Teresa", "Ramona", "Raquel", "Daisy", "James", "Alma", "Leah", "Duke", "Daniella", "Adrian", "Keegan", "Hardy", "Gordon", "Devin", "Lamont", "Griffith", "Ariel", "Dakota", "Vance" ], "edges": [ [ 0, 7 ], [ 1, 5 ], [ 2, 8 ], [ 5, 4 ], [ 5, 6 ], [ 6, 2 ], [ 7, 1 ], [ 8, 3 ], [ 8, 9 ], [ 10, 17 ], [ 11, 15 ], [ 12, 18 ], [ 15, 14 ], [ 15, 16 ], [ 16, 12 ], [ 17, 11 ], [ 18, 13 ], [ 18, 19 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Lisette knows Holly. Erma knows Ernesto. Andre knows Ursula. Ernesto knows Harmony. Shannon knows Amber. Eunice knows Andre. Randy knows Eunice. Duke knows Randy. Luis knows Martin. Amber knows Erma. Shannon knows Esperanza. Randy knows Luis. Hardy knows Duke. Norma knows Lisette. Martin knows Troy. Amber knows Norma. Rena knows Shannon. Duke knows Kyle. Which of Norma and Luis can Rena reach?", "answer": "Norma", "steps": [ "Rena knows Shannon.", "Shannon knows Amber.", "Amber knows Norma." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Rena", "Holly", "Lisette", "Erma", "Shannon", "Esperanza", "Amber", "Norma", "Ernesto", "Harmony", "Hardy", "Troy", "Martin", "Eunice", "Duke", "Kyle", "Randy", "Luis", "Andre", "Ursula" ], "edges": [ [ 0, 4 ], [ 2, 1 ], [ 3, 8 ], [ 4, 5 ], [ 4, 6 ], [ 6, 7 ], [ 6, 3 ], [ 7, 2 ], [ 8, 9 ], [ 10, 14 ], [ 12, 11 ], [ 13, 18 ], [ 14, 15 ], [ 14, 16 ], [ 16, 17 ], [ 16, 13 ], [ 17, 12 ], [ 18, 19 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Julius knows Nell. Seth knows Kelly. Coral knows Peggy. Leigh knows Saul. Luna knows Calvin. Coral knows Boyd. Martha knows Coral. Kelly knows Carrie. Levi knows Seth. Seth knows Luna. Levi knows Tanya. Martha knows Allen. Martha knows Jude. Levi knows Connor. Boyd knows Julius. Boyd knows Carter. Kelly knows Leigh. Peggy knows Renee. Which of Leigh and Julius can Levi reach?", "answer": "Leigh", "steps": [ "Levi knows Seth.", "Seth knows Kelly.", "Kelly knows Leigh." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Levi", "Calvin", "Saul", "Luna", "Kelly", "Carrie", "Tanya", "Leigh", "Seth", "Connor", "Martha", "Renee", "Nell", "Peggy", "Boyd", "Carter", "Allen", "Julius", "Coral", "Jude" ], "edges": [ [ 0, 6 ], [ 0, 8 ], [ 0, 9 ], [ 3, 1 ], [ 4, 5 ], [ 4, 7 ], [ 7, 2 ], [ 8, 3 ], [ 8, 4 ], [ 10, 16 ], [ 10, 18 ], [ 10, 19 ], [ 13, 11 ], [ 14, 15 ], [ 14, 17 ], [ 17, 12 ], [ 18, 13 ], [ 18, 14 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Warren knows Nancy. John knows Austin. Atlas knows John. Constance knows Claude. John knows Zara. Austin knows Daphne. Bart knows Hunter. Alma knows Ray. Bart knows Warren. Hunter knows Henrietta. Ray knows Hannah. Don knows Atlas. Bart knows Clyde. Hannah knows Bart. John knows Constance. Hunter knows Celia. Allison knows Don. Austin knows Carla. Which of Hannah and Atlas can Allison reach?", "answer": "Atlas", "steps": [ "Allison knows Don.", "Don knows Atlas." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Allison", "Constance", "Austin", "Don", "Zara", "Atlas", "Carla", "Claude", "John", "Daphne", "Alma", "Warren", "Hunter", "Ray", "Clyde", "Hannah", "Celia", "Nancy", "Bart", "Henrietta" ], "edges": [ [ 0, 3 ], [ 1, 7 ], [ 2, 6 ], [ 2, 9 ], [ 3, 5 ], [ 5, 8 ], [ 8, 4 ], [ 8, 1 ], [ 8, 2 ], [ 10, 13 ], [ 11, 17 ], [ 12, 16 ], [ 12, 19 ], [ 13, 15 ], [ 15, 18 ], [ 18, 14 ], [ 18, 11 ], [ 18, 12 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "James knows Daisy. Duke knows Raquel. Griffith knows Hardy. Dakota knows Gordon. Keegan knows Lamont. Lamont knows Griffith. Teresa knows James. Dakota knows Vance. Leah knows Teresa. Alma knows Ramona. Ramona knows Duke. Ariel knows Keegan. Hardy knows Dakota. Adrian knows Ariel. Lamont knows Devin. James knows Alma. Trevor knows Leah. Duke knows Daniella. Which of Gordon and Raquel can Trevor reach?", "answer": "Raquel", "steps": [ "Trevor knows Leah.", "Leah knows Teresa.", "Teresa knows James.", "James knows Alma.", "Alma knows Ramona.", "Ramona knows Duke.", "Duke knows Raquel." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Trevor", "Teresa", "Ramona", "Raquel", "Daisy", "James", "Alma", "Leah", "Duke", "Daniella", "Adrian", "Keegan", "Hardy", "Gordon", "Devin", "Lamont", "Griffith", "Ariel", "Dakota", "Vance" ], "edges": [ [ 0, 7 ], [ 1, 5 ], [ 2, 8 ], [ 5, 4 ], [ 5, 6 ], [ 6, 2 ], [ 7, 1 ], [ 8, 3 ], [ 8, 9 ], [ 10, 17 ], [ 11, 15 ], [ 12, 18 ], [ 15, 14 ], [ 15, 16 ], [ 16, 12 ], [ 17, 11 ], [ 18, 13 ], [ 18, 19 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Carla knows Jem. Guillermo knows Devon. Guillermo knows Darla. Esme knows Milo. Jeanne knows Matthew. Carla knows Amanda. Lark knows Darius. Darius knows Duncan. Guillermo knows Diego. Rocco knows Cain. Guillermo knows Troy. Duncan knows Guillermo. Katrina knows Carla. Carla knows Rocco. Troy knows Jeanne. Milo knows Katrina. Carla knows Rosa. Cain knows Travis. Which of Rocco and Troy can Esme reach?", "answer": "Rocco", "steps": [ "Esme knows Milo.", "Milo knows Katrina.", "Katrina knows Carla.", "Carla knows Rocco." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Esme", "Rosa", "Katrina", "Amanda", "Carla", "Travis", "Milo", "Jem", "Rocco", "Cain", "Lark", "Darla", "Duncan", "Diego", "Guillermo", "Matthew", "Darius", "Devon", "Troy", "Jeanne" ], "edges": [ [ 0, 6 ], [ 2, 4 ], [ 4, 1 ], [ 4, 3 ], [ 4, 7 ], [ 4, 8 ], [ 6, 2 ], [ 8, 9 ], [ 9, 5 ], [ 10, 16 ], [ 12, 14 ], [ 14, 11 ], [ 14, 13 ], [ 14, 17 ], [ 14, 18 ], [ 16, 12 ], [ 18, 19 ], [ 19, 15 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Tanya knows Neal. Jessie knows Vance. Jackson knows Louisa. Kit knows Marian. Janet knows Jessie. Marian knows Harmony. Harvey knows Otto. Teresa knows Jackson. Jolena knows Tanya. Kit knows Janet. Kit knows Hal. Harmony knows Dustin. Hilda knows Kit. Otto knows Gail. Tanya knows Vera. Tanya knows Harvey. Dustin knows Mara. Vera knows Teresa. Which of Tanya and Kit can Hilda reach?", "answer": "Kit", "steps": [ "Hilda knows Kit." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Hilda", "Kit", "Harmony", "Vance", "Dustin", "Marian", "Hal", "Janet", "Jessie", "Mara", "Jolena", "Tanya", "Teresa", "Gail", "Jackson", "Vera", "Neal", "Harvey", "Otto", "Louisa" ], "edges": [ [ 0, 1 ], [ 1, 6 ], [ 1, 7 ], [ 1, 5 ], [ 2, 4 ], [ 4, 9 ], [ 5, 2 ], [ 7, 8 ], [ 8, 3 ], [ 10, 11 ], [ 11, 16 ], [ 11, 17 ], [ 11, 15 ], [ 12, 14 ], [ 14, 19 ], [ 15, 12 ], [ 17, 18 ], [ 18, 13 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Lena knows Clarence. Wanda knows Hattie. Lucia knows Ella. Javier knows Wanda. Sadie knows Adele. Jim knows Sadie. Adele knows Clara. Norma knows Miriam. Sadie knows Norma. Miriam knows Noah. Lucia knows Daphne. Wanda knows Latoya. Cain knows Lucia. Miriam knows Lena. Adele knows Susan. Ken knows Javier. Javier knows Cain. Daphne knows Fabian. Which of Cain and Norma can Jim reach?", "answer": "Norma", "steps": [ "Jim knows Sadie.", "Sadie knows Norma." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Jim", "Clara", "Sadie", "Noah", "Susan", "Miriam", "Norma", "Lena", "Adele", "Clarence", "Ken", "Latoya", "Javier", "Ella", "Hattie", "Lucia", "Cain", "Daphne", "Wanda", "Fabian" ], "edges": [ [ 0, 2 ], [ 2, 8 ], [ 2, 6 ], [ 5, 3 ], [ 5, 7 ], [ 6, 5 ], [ 7, 9 ], [ 8, 1 ], [ 8, 4 ], [ 10, 12 ], [ 12, 18 ], [ 12, 16 ], [ 15, 13 ], [ 15, 17 ], [ 16, 15 ], [ 17, 19 ], [ 18, 11 ], [ 18, 14 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Gareth knows Dee. Scott knows Magdalena. Gareth knows Forrest. Judith knows Diego. Teresa knows Monica. Monica knows Scott. Aaron knows Pierce. Aaron knows Allison. Diego knows Evelyn. Magdalena knows Darnell. Dee knows Ivy. Aaron knows Alison. Alison knows Christian. Evelyn knows Gonzalo. Gonzalo knows Fern. Gareth knows Jon. Fern knows Aaron. Darnell knows Gareth. Which of Dee and Alison can Teresa reach?", "answer": "Dee", "steps": [ "Teresa knows Monica.", "Monica knows Scott.", "Scott knows Magdalena.", "Magdalena knows Darnell.", "Darnell knows Gareth.", "Gareth knows Dee." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Teresa", "Dee", "Jon", "Gareth", "Forrest", "Scott", "Ivy", "Darnell", "Magdalena", "Monica", "Judith", "Alison", "Allison", "Aaron", "Pierce", "Evelyn", "Christian", "Fern", "Gonzalo", "Diego" ], "edges": [ [ 0, 9 ], [ 1, 6 ], [ 3, 2 ], [ 3, 4 ], [ 3, 1 ], [ 5, 8 ], [ 7, 3 ], [ 8, 7 ], [ 9, 5 ], [ 10, 19 ], [ 11, 16 ], [ 13, 12 ], [ 13, 14 ], [ 13, 11 ], [ 15, 18 ], [ 17, 13 ], [ 18, 17 ], [ 19, 15 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Darin knows Asher. Stefan knows Geneva. Sandy knows Blanche. Asher knows Flora. Cliff knows Owen. Cliff knows Stefan. Brent knows Malik. Patrick knows Pauline. Flora knows Sandy. Cliff knows Autumn. Flora knows Vanessa. Stella knows Luz. Flora knows Jillian. Pauline knows Cliff. Stefan knows Destiny. Sandy knows Brent. Malik knows Anthony. Destiny knows Stella. Which of Destiny and Brent can Patrick reach?", "answer": "Destiny", "steps": [ "Patrick knows Pauline.", "Pauline knows Cliff.", "Cliff knows Stefan.", "Stefan knows Destiny." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Patrick", "Luz", "Stefan", "Owen", "Cliff", "Pauline", "Stella", "Destiny", "Geneva", "Autumn", "Darin", "Anthony", "Sandy", "Vanessa", "Flora", "Asher", "Malik", "Brent", "Blanche", "Jillian" ], "edges": [ [ 0, 5 ], [ 2, 7 ], [ 2, 8 ], [ 4, 3 ], [ 4, 2 ], [ 4, 9 ], [ 5, 4 ], [ 6, 1 ], [ 7, 6 ], [ 10, 15 ], [ 12, 17 ], [ 12, 18 ], [ 14, 13 ], [ 14, 12 ], [ 14, 19 ], [ 15, 14 ], [ 16, 11 ], [ 17, 16 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Lisette knows Holly. Erma knows Ernesto. Andre knows Ursula. Ernesto knows Harmony. Shannon knows Amber. Eunice knows Andre. Randy knows Eunice. Duke knows Randy. Luis knows Martin. Amber knows Erma. Shannon knows Esperanza. Randy knows Luis. Hardy knows Duke. Norma knows Lisette. Martin knows Troy. Amber knows Norma. Rena knows Shannon. Duke knows Kyle. Which of Holly and Troy can Rena reach?", "answer": "Holly", "steps": [ "Rena knows Shannon.", "Shannon knows Amber.", "Amber knows Norma.", "Norma knows Lisette.", "Lisette knows Holly." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Rena", "Holly", "Lisette", "Erma", "Shannon", "Esperanza", "Amber", "Norma", "Ernesto", "Harmony", "Hardy", "Troy", "Martin", "Eunice", "Duke", "Kyle", "Randy", "Luis", "Andre", "Ursula" ], "edges": [ [ 0, 4 ], [ 2, 1 ], [ 3, 8 ], [ 4, 5 ], [ 4, 6 ], [ 6, 7 ], [ 6, 3 ], [ 7, 2 ], [ 8, 9 ], [ 10, 14 ], [ 12, 11 ], [ 13, 18 ], [ 14, 15 ], [ 14, 16 ], [ 16, 17 ], [ 16, 13 ], [ 17, 12 ], [ 18, 19 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Riley knows Edith. Lawson knows Edison. Alvin knows Andre. Trina knows Riley. Riley knows Lionel. Iris knows Wendell. Jeanne knows Lawson. Lionel knows Elliot. Lawson knows Leroy. Rick knows Gary. Alvin knows Clara. Wendell knows Peter. Peter knows Gareth. Gary knows Jeanne. Peter knows Rick. Benjamin knows Trina. Janet knows Alvin. Elliot knows Janet. Which of Alvin and Lawson can Benjamin reach?", "answer": "Alvin", "steps": [ "Benjamin knows Trina.", "Trina knows Riley.", "Riley knows Lionel.", "Lionel knows Elliot.", "Elliot knows Janet.", "Janet knows Alvin." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Benjamin", "Edith", "Janet", "Trina", "Riley", "Andre", "Lionel", "Clara", "Elliot", "Alvin", "Iris", "Gareth", "Jeanne", "Wendell", "Peter", "Edison", "Rick", "Leroy", "Gary", "Lawson" ], "edges": [ [ 0, 3 ], [ 2, 9 ], [ 3, 4 ], [ 4, 1 ], [ 4, 6 ], [ 6, 8 ], [ 8, 2 ], [ 9, 5 ], [ 9, 7 ], [ 10, 13 ], [ 12, 19 ], [ 13, 14 ], [ 14, 11 ], [ 14, 16 ], [ 16, 18 ], [ 18, 12 ], [ 19, 15 ], [ 19, 17 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Beth knows Derek. Kirsten knows Archer. Gerald knows Fanny. Bill knows Jorge. April knows Kirsten. Fanny knows Harlan. Archer knows Kira. Chance knows Giselle. Derek knows Brynn. Derek knows Jolene. Kira knows Claire. Giselle knows Maria. Jolene knows Gerald. Kira knows Marvin. Giselle knows Beth. Marvin knows Bill. Kirsten knows Vincent. Jorge knows Dennis. Which of Bill and Gerald can April reach?", "answer": "Bill", "steps": [ "April knows Kirsten.", "Kirsten knows Archer.", "Archer knows Kira.", "Kira knows Marvin.", "Marvin knows Bill." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "April", "Dennis", "Kira", "Marvin", "Claire", "Bill", "Vincent", "Kirsten", "Jorge", "Archer", "Chance", "Harlan", "Derek", "Jolene", "Brynn", "Gerald", "Maria", "Giselle", "Fanny", "Beth" ], "edges": [ [ 0, 7 ], [ 2, 4 ], [ 2, 3 ], [ 3, 5 ], [ 5, 8 ], [ 7, 6 ], [ 7, 9 ], [ 8, 1 ], [ 9, 2 ], [ 10, 17 ], [ 12, 14 ], [ 12, 13 ], [ 13, 15 ], [ 15, 18 ], [ 17, 16 ], [ 17, 19 ], [ 18, 11 ], [ 19, 12 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Mason knows Jewel. Judy knows Geoffrey. Selena knows Hudson. Jewel knows Saul. Estelle knows Dakota. Judy knows Selena. Joel knows Mason. Judy knows Greer. Jewel knows Belinda. Dean knows Christian. Estelle knows Doris. Blanche knows Dean. Greer knows Jonathan. Jewel knows Estelle. Mason knows Vicki. Selena knows Ethan. Dean knows Judy. Saul knows Gabe. Which of Jewel and Judy can Blanche reach?", "answer": "Judy", "steps": [ "Blanche knows Dean.", "Dean knows Judy." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Blanche", "Greer", "Ethan", "Jonathan", "Dean", "Selena", "Hudson", "Christian", "Geoffrey", "Judy", "Joel", "Saul", "Doris", "Gabe", "Mason", "Estelle", "Dakota", "Vicki", "Belinda", "Jewel" ], "edges": [ [ 0, 4 ], [ 1, 3 ], [ 4, 7 ], [ 4, 9 ], [ 5, 2 ], [ 5, 6 ], [ 9, 1 ], [ 9, 5 ], [ 9, 8 ], [ 10, 14 ], [ 11, 13 ], [ 14, 17 ], [ 14, 19 ], [ 15, 12 ], [ 15, 16 ], [ 19, 11 ], [ 19, 15 ], [ 19, 18 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Gunnar knows Sebastian. Alyson knows Gunnar. Alyson knows Clarissa. Zack knows Alyson. Arthur knows Latoya. Finn knows Zack. Lillian knows Wendy. Keegan knows Destiny. Lenora knows Susanne. Keegan knows Sean. Arthur knows Felix. Julia knows Finn. Lillian knows Tracy. Wendy knows Seth. Susanne knows Graham. Graham knows Lillian. Alyson knows Arthur. Lillian knows Keegan. Which of Sean and Felix can Julia reach?", "answer": "Felix", "steps": [ "Julia knows Finn.", "Finn knows Zack.", "Zack knows Alyson.", "Alyson knows Arthur.", "Arthur knows Felix." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Julia", "Gunnar", "Sebastian", "Zack", "Latoya", "Clarissa", "Arthur", "Finn", "Alyson", "Felix", "Lenora", "Wendy", "Seth", "Graham", "Destiny", "Tracy", "Keegan", "Susanne", "Lillian", "Sean" ], "edges": [ [ 0, 7 ], [ 1, 2 ], [ 3, 8 ], [ 6, 4 ], [ 6, 9 ], [ 7, 3 ], [ 8, 1 ], [ 8, 5 ], [ 8, 6 ], [ 10, 17 ], [ 11, 12 ], [ 13, 18 ], [ 16, 14 ], [ 16, 19 ], [ 17, 13 ], [ 18, 11 ], [ 18, 15 ], [ 18, 16 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Jocelyn knows Gregory. Ron knows Leticia. Luella knows Foster. Irene knows Ron. Yara knows Bernadette. Viola knows Imogen. Jeff knows Norma. Ron knows Yasmin. Ron knows Luella. Gregory knows Yara. Tara knows Irene. Viola knows Jeff. Parsa knows Tara. Ford knows Parsa. Darrell knows Ford. Viola knows Phoebe. Gladys knows Jocelyn. Bernadette knows Viola. Which of Norma and Foster can Gladys reach?", "answer": "Norma", "steps": [ "Gladys knows Jocelyn.", "Jocelyn knows Gregory.", "Gregory knows Yara.", "Yara knows Bernadette.", "Bernadette knows Viola.", "Viola knows Jeff.", "Jeff knows Norma." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Gladys", "Phoebe", "Imogen", "Norma", "Bernadette", "Viola", "Gregory", "Yara", "Jeff", "Jocelyn", "Darrell", "Leticia", "Yasmin", "Foster", "Irene", "Ron", "Parsa", "Tara", "Luella", "Ford" ], "edges": [ [ 0, 9 ], [ 4, 5 ], [ 5, 1 ], [ 5, 2 ], [ 5, 8 ], [ 6, 7 ], [ 7, 4 ], [ 8, 3 ], [ 9, 6 ], [ 10, 19 ], [ 14, 15 ], [ 15, 11 ], [ 15, 12 ], [ 15, 18 ], [ 16, 17 ], [ 17, 14 ], [ 18, 13 ], [ 19, 16 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Jeffery knows Israel. Terry knows Levi. Jeffery knows Russell. Becky knows Daphne. Jay knows Adelaide. Russell knows Marie. Jill knows Ignacio. Ignacio knows Terry. Becky knows Belinda. Daphne knows Dudley. Levi knows Francesca. Marie knows Dee. Jeffery knows Leigh. Daphne knows Jill. Bennett knows Jeffery. Bennett knows Eric. Daphne knows Camille. Dee knows Jay. Which of Terry and Dee can Becky reach?", "answer": "Terry", "steps": [ "Becky knows Daphne.", "Daphne knows Jill.", "Jill knows Ignacio.", "Ignacio knows Terry." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Becky", "Levi", "Belinda", "Daphne", "Dudley", "Terry", "Ignacio", "Francesca", "Jill", "Camille", "Bennett", "Jay", "Eric", "Jeffery", "Leigh", "Dee", "Marie", "Adelaide", "Russell", "Israel" ], "edges": [ [ 0, 2 ], [ 0, 3 ], [ 1, 7 ], [ 3, 4 ], [ 3, 8 ], [ 3, 9 ], [ 5, 1 ], [ 6, 5 ], [ 8, 6 ], [ 10, 12 ], [ 10, 13 ], [ 11, 17 ], [ 13, 14 ], [ 13, 18 ], [ 13, 19 ], [ 15, 11 ], [ 16, 15 ], [ 18, 16 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Doug knows Frank. Geraldine knows Alvin. Elmer knows Reid. Elmer knows Harry. Eugene knows Dell. Alfred knows Elmer. Mindy knows Walter. Adrian knows Aldo. Virgil knows Doug. Geraldine knows Mindy. Eugene knows Goldie. Virgil knows Alfred. Helen knows Eugene. Reid knows Estella. Aldo knows Virgil. Dell knows Geraldine. Goldie knows Garrett. Katherine knows Helen. Which of Elmer and Geraldine can Katherine reach?", "answer": "Geraldine", "steps": [ "Katherine knows Helen.", "Helen knows Eugene.", "Eugene knows Dell.", "Dell knows Geraldine." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Katherine", "Eugene", "Garrett", "Walter", "Dell", "Geraldine", "Mindy", "Alvin", "Helen", "Goldie", "Adrian", "Virgil", "Frank", "Estella", "Alfred", "Elmer", "Reid", "Harry", "Aldo", "Doug" ], "edges": [ [ 0, 8 ], [ 1, 4 ], [ 1, 9 ], [ 4, 5 ], [ 5, 6 ], [ 5, 7 ], [ 6, 3 ], [ 8, 1 ], [ 9, 2 ], [ 10, 18 ], [ 11, 14 ], [ 11, 19 ], [ 14, 15 ], [ 15, 16 ], [ 15, 17 ], [ 16, 13 ], [ 18, 11 ], [ 19, 12 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Irma knows Declan. Elena knows Dirk. Jim knows Vivian. Rufus knows Erik. Erik knows Jillian. Percy knows Lillian. Martin knows Michael. Simon knows Anita. Declan knows Carla. Lillian knows Elena. Carla knows Rufus. Rufus knows Jamie. Anita knows Cora. Percy knows Simon. Vivian knows Esperanza. Irma knows Jim. Dirk knows Cameron. Dirk knows Martin. Which of Michael and Jillian can Irma reach?", "answer": "Jillian", "steps": [ "Irma knows Declan.", "Declan knows Carla.", "Carla knows Rufus.", "Rufus knows Erik.", "Erik knows Jillian." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Irma", "Esperanza", "Carla", "Jamie", "Erik", "Jim", "Jillian", "Rufus", "Vivian", "Declan", "Percy", "Cora", "Elena", "Cameron", "Martin", "Simon", "Michael", "Dirk", "Anita", "Lillian" ], "edges": [ [ 0, 5 ], [ 0, 9 ], [ 2, 7 ], [ 4, 6 ], [ 5, 8 ], [ 7, 3 ], [ 7, 4 ], [ 8, 1 ], [ 9, 2 ], [ 10, 15 ], [ 10, 19 ], [ 12, 17 ], [ 14, 16 ], [ 15, 18 ], [ 17, 13 ], [ 17, 14 ], [ 18, 11 ], [ 19, 12 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Vera knows Cassidy. Florence knows Tina. Dean knows Blanche. Celeste knows Magdalena. Kai knows Leo. Brandon knows Faith. Celeste knows Vera. Faith knows Samantha. Dean knows Drake. Virgil knows Brandon. Florence knows Dean. Greg knows Kai. Greg knows Jamie. Kirsten knows Celeste. Brandon knows Sheryl. Blanche knows Greg. Vera knows Virgil. Leigh knows Florence. Which of Vera and Dean can Leigh reach?", "answer": "Dean", "steps": [ "Leigh knows Florence.", "Florence knows Dean." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Leigh", "Blanche", "Kai", "Greg", "Jamie", "Dean", "Leo", "Drake", "Florence", "Tina", "Kirsten", "Virgil", "Faith", "Brandon", "Sheryl", "Vera", "Samantha", "Cassidy", "Celeste", "Magdalena" ], "edges": [ [ 0, 8 ], [ 1, 3 ], [ 2, 6 ], [ 3, 4 ], [ 3, 2 ], [ 5, 1 ], [ 5, 7 ], [ 8, 5 ], [ 8, 9 ], [ 10, 18 ], [ 11, 13 ], [ 12, 16 ], [ 13, 14 ], [ 13, 12 ], [ 15, 11 ], [ 15, 17 ], [ 18, 15 ], [ 18, 19 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Bennett knows Carla. Violet knows Albert. Violet knows Nicole. Henry knows Kareem. Adele knows Walter. Beatrice knows Hayley. Kareem knows Bernard. Albert knows Terrence. Bruno knows Hubert. Ronald knows Jeremy. Henry knows Tamara. Bruno knows Ronald. Doris knows Erma. Nicole knows Bennett. Hayley knows Adele. Bernard knows Beatrice. Beatrice knows Doris. Jeremy knows Violet. Which of Carla and Walter can Bruno reach?", "answer": "Carla", "steps": [ "Bruno knows Ronald.", "Ronald knows Jeremy.", "Jeremy knows Violet.", "Violet knows Nicole.", "Nicole knows Bennett.", "Bennett knows Carla." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Bruno", "Ronald", "Jeremy", "Violet", "Bennett", "Terrence", "Carla", "Hubert", "Nicole", "Albert", "Henry", "Kareem", "Bernard", "Beatrice", "Adele", "Erma", "Walter", "Tamara", "Hayley", "Doris" ], "edges": [ [ 0, 7 ], [ 0, 1 ], [ 1, 2 ], [ 2, 3 ], [ 3, 8 ], [ 3, 9 ], [ 4, 6 ], [ 8, 4 ], [ 9, 5 ], [ 10, 17 ], [ 10, 11 ], [ 11, 12 ], [ 12, 13 ], [ 13, 18 ], [ 13, 19 ], [ 14, 16 ], [ 18, 14 ], [ 19, 15 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Hudson knows Nash. Cruz knows Mara. Dudley knows Douglas. Deirdre knows Kobe. Monroe knows Palmer. Kobe knows Andrew. Farrah knows Hudson. Sandra knows Monroe. Nash knows Dudley. Douglas knows Damian. Hudson knows Rhea. Rhea knows Kendra. Mara knows Burt. Andrew knows Norma. Cruz knows Deirdre. Wendy knows Farrah. Zane knows Wendy. Palmer knows Cruz. Which of Douglas and Andrew can Sandra reach?", "answer": "Andrew", "steps": [ "Sandra knows Monroe.", "Monroe knows Palmer.", "Palmer knows Cruz.", "Cruz knows Deirdre.", "Deirdre knows Kobe.", "Kobe knows Andrew." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Sandra", "Cruz", "Mara", "Burt", "Andrew", "Deirdre", "Norma", "Kobe", "Monroe", "Palmer", "Zane", "Hudson", "Rhea", "Kendra", "Douglas", "Nash", "Damian", "Dudley", "Wendy", "Farrah" ], "edges": [ [ 0, 8 ], [ 1, 2 ], [ 1, 5 ], [ 2, 3 ], [ 4, 6 ], [ 5, 7 ], [ 7, 4 ], [ 8, 9 ], [ 9, 1 ], [ 10, 18 ], [ 11, 12 ], [ 11, 15 ], [ 12, 13 ], [ 14, 16 ], [ 15, 17 ], [ 17, 14 ], [ 18, 19 ], [ 19, 11 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Adrian knows Sharon. Sharon knows Julie. August knows Neil. Eric knows Sebastian. Verna knows Simon. Warren knows Stephen. Khashayar knows Kate. Graham knows Clement. Simon knows Ann. Kate knows Bert. Julie knows Khashayar. Kate knows Eric. Simon knows Graham. Warren knows Harvey. Clement knows Warren. Warren knows August. Sharon knows Dee. Kate knows Mara. Which of Julie and Graham can Adrian reach?", "answer": "Julie", "steps": [ "Adrian knows Sharon.", "Sharon knows Julie." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Adrian", "Bert", "Dee", "Julie", "Khashayar", "Kate", "Sebastian", "Mara", "Eric", "Sharon", "Verna", "Stephen", "Ann", "Graham", "Clement", "Warren", "Neil", "Harvey", "August", "Simon" ], "edges": [ [ 0, 9 ], [ 3, 4 ], [ 4, 5 ], [ 5, 1 ], [ 5, 7 ], [ 5, 8 ], [ 8, 6 ], [ 9, 2 ], [ 9, 3 ], [ 10, 19 ], [ 13, 14 ], [ 14, 15 ], [ 15, 11 ], [ 15, 17 ], [ 15, 18 ], [ 18, 16 ], [ 19, 12 ], [ 19, 13 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Lloyd knows Jason. Bart knows Lorna. Elaine knows Rex. Jolena knows Elliot. Elaine knows Molly. Pat knows Lark. Lorna knows Felix. Jason knows Elaine. Pat knows Lloyd. Kathleen knows Tracy. Jackson knows Kamila. Lloyd knows Kathleen. Bart knows Mario. Elliot knows Bart. Elliot knows Jackson. Jolena knows Leslie. Lorna knows Lilia. Jason knows Palmer. Which of Bart and Jason can Pat reach?", "answer": "Jason", "steps": [ "Pat knows Lloyd.", "Lloyd knows Jason." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Pat", "Elaine", "Kathleen", "Palmer", "Lloyd", "Rex", "Jason", "Tracy", "Molly", "Lark", "Jolena", "Lorna", "Jackson", "Mario", "Elliot", "Felix", "Bart", "Kamila", "Lilia", "Leslie" ], "edges": [ [ 0, 4 ], [ 0, 9 ], [ 1, 5 ], [ 1, 8 ], [ 2, 7 ], [ 4, 2 ], [ 4, 6 ], [ 6, 3 ], [ 6, 1 ], [ 10, 14 ], [ 10, 19 ], [ 11, 15 ], [ 11, 18 ], [ 12, 17 ], [ 14, 12 ], [ 14, 16 ], [ 16, 13 ], [ 16, 11 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Hudson knows Nash. Cruz knows Mara. Dudley knows Douglas. Deirdre knows Kobe. Monroe knows Palmer. Kobe knows Andrew. Farrah knows Hudson. Sandra knows Monroe. Nash knows Dudley. Douglas knows Damian. Hudson knows Rhea. Rhea knows Kendra. Mara knows Burt. Andrew knows Norma. Cruz knows Deirdre. Wendy knows Farrah. Zane knows Wendy. Palmer knows Cruz. Which of Dudley and Kobe can Sandra reach?", "answer": "Kobe", "steps": [ "Sandra knows Monroe.", "Monroe knows Palmer.", "Palmer knows Cruz.", "Cruz knows Deirdre.", "Deirdre knows Kobe." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Sandra", "Cruz", "Mara", "Burt", "Andrew", "Deirdre", "Norma", "Kobe", "Monroe", "Palmer", "Zane", "Hudson", "Rhea", "Kendra", "Douglas", "Nash", "Damian", "Dudley", "Wendy", "Farrah" ], "edges": [ [ 0, 8 ], [ 1, 2 ], [ 1, 5 ], [ 2, 3 ], [ 4, 6 ], [ 5, 7 ], [ 7, 4 ], [ 8, 9 ], [ 9, 1 ], [ 10, 18 ], [ 11, 12 ], [ 11, 15 ], [ 12, 13 ], [ 14, 16 ], [ 15, 17 ], [ 17, 14 ], [ 18, 19 ], [ 19, 11 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Dudley knows Milo. Bill knows Fritz. Dudley knows Lara. Fritz knows Leland. Blair knows Mabel. Ross knows Dudley. Elijah knows Seth. Adam knows Blair. Bill knows Anita. Dudley knows Marcia. Quinn knows Hazel. Marcia knows Daniella. Bill knows Boyd. Leland knows Adam. Fraser knows Quinn. Elijah knows Bill. Ross knows Trina. Daniella knows Fraser. Which of Blair and Quinn can Ross reach?", "answer": "Quinn", "steps": [ "Ross knows Dudley.", "Dudley knows Marcia.", "Marcia knows Daniella.", "Daniella knows Fraser.", "Fraser knows Quinn." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Ross", "Quinn", "Lara", "Fraser", "Daniella", "Marcia", "Hazel", "Trina", "Milo", "Dudley", "Elijah", "Blair", "Anita", "Adam", "Leland", "Fritz", "Mabel", "Seth", "Boyd", "Bill" ], "edges": [ [ 0, 7 ], [ 0, 9 ], [ 1, 6 ], [ 3, 1 ], [ 4, 3 ], [ 5, 4 ], [ 9, 2 ], [ 9, 5 ], [ 9, 8 ], [ 10, 17 ], [ 10, 19 ], [ 11, 16 ], [ 13, 11 ], [ 14, 13 ], [ 15, 14 ], [ 19, 12 ], [ 19, 15 ], [ 19, 18 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Leah knows Judith. Ernesto knows Diana. Judith knows Cody. Eamon knows Leah. Don knows Ariana. Diana knows Lacey. Wyatt knows Lisette. Maude knows Brian. Fernando knows Edmund. Eamon knows Jason. Marion knows Don. Leah knows Maude. Lacey knows Eamon. Fernando knows Jenna. Ariana knows Fernando. Edmund knows Wyatt. Bernadette knows Dudley. Edmund knows Bernadette. Which of Ariana and Lacey can Ernesto reach?", "answer": "Lacey", "steps": [ "Ernesto knows Diana.", "Diana knows Lacey." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Ernesto", "Leah", "Diana", "Cody", "Jason", "Maude", "Lacey", "Brian", "Judith", "Eamon", "Marion", "Edmund", "Don", "Lisette", "Jenna", "Bernadette", "Ariana", "Dudley", "Wyatt", "Fernando" ], "edges": [ [ 0, 2 ], [ 1, 5 ], [ 1, 8 ], [ 2, 6 ], [ 5, 7 ], [ 6, 9 ], [ 8, 3 ], [ 9, 4 ], [ 9, 1 ], [ 10, 12 ], [ 11, 15 ], [ 11, 18 ], [ 12, 16 ], [ 15, 17 ], [ 16, 19 ], [ 18, 13 ], [ 19, 14 ], [ 19, 11 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Perry knows Thea. Garland knows Hayley. Cruz knows Cyrus. Lawrence knows Cliff. Stacy knows Garland. Jameson knows Dewey. Thea knows Ava. Vera knows Dallas. Michelle knows Cruz. Corey knows Xander. Michelle knows Vera. Thea knows Merle. Ava knows Michelle. Dewey knows Lawrence. Elijah knows Perry. Asher knows Stacy. Dewey knows Corey. Garland knows Jameson. Which of Ava and Jameson can Elijah reach?", "answer": "Ava", "steps": [ "Elijah knows Perry.", "Perry knows Thea.", "Thea knows Ava." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Elijah", "Dallas", "Michelle", "Ava", "Perry", "Cyrus", "Thea", "Merle", "Vera", "Cruz", "Asher", "Xander", "Dewey", "Jameson", "Stacy", "Cliff", "Garland", "Hayley", "Corey", "Lawrence" ], "edges": [ [ 0, 4 ], [ 2, 8 ], [ 2, 9 ], [ 3, 2 ], [ 4, 6 ], [ 6, 7 ], [ 6, 3 ], [ 8, 1 ], [ 9, 5 ], [ 10, 14 ], [ 12, 18 ], [ 12, 19 ], [ 13, 12 ], [ 14, 16 ], [ 16, 17 ], [ 16, 13 ], [ 18, 11 ], [ 19, 15 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Randy knows Preston. Robin knows Billy. Randy knows Penny. Robin knows Brett. Robin knows Asher. Arthur knows Scott. Dallas knows Joseph. Itzel knows Hadley. Randy knows Dallas. Asher knows Farrah. Robin knows Arthur. Itzel knows Craig. Joseph knows Lorraine. Randy knows Betty. Farrah knows Clifford. Betty knows Itzel. Scott knows Cora. Farrah knows Justine. Which of Farrah and Itzel can Robin reach?", "answer": "Farrah", "steps": [ "Robin knows Asher.", "Asher knows Farrah." ], "difficulty": 2, "original_distance": 3, "idx_to_symbol": [ "Robin", "Justine", "Clifford", "Brett", "Cora", "Scott", "Billy", "Farrah", "Arthur", "Asher", "Randy", "Craig", "Hadley", "Preston", "Lorraine", "Joseph", "Penny", "Itzel", "Dallas", "Betty" ], "edges": [ [ 0, 3 ], [ 0, 6 ], [ 0, 8 ], [ 0, 9 ], [ 5, 4 ], [ 7, 1 ], [ 7, 2 ], [ 8, 5 ], [ 9, 7 ], [ 10, 13 ], [ 10, 16 ], [ 10, 18 ], [ 10, 19 ], [ 15, 14 ], [ 17, 11 ], [ 17, 12 ], [ 18, 15 ], [ 19, 17 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Paul knows Delia. Edith knows Abigail. Oscar knows Rena. Edith knows Blake. Crystal knows Chandler. Blake knows Bernard. Janice knows Daria. Norman knows Esperanza. Langston knows Edith. Rena knows Greg. Oscar knows Lynn. Paul knows Oscar. Delia knows Crystal. Daria knows Langston. Sue knows Veronica. Jonah knows Norman. Veronica knows Paul. Langston knows Jonah. Which of Paul and Langston can Sue reach?", "answer": "Paul", "steps": [ "Sue knows Veronica.", "Veronica knows Paul." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Sue", "Paul", "Veronica", "Chandler", "Lynn", "Oscar", "Rena", "Greg", "Delia", "Crystal", "Janice", "Langston", "Daria", "Esperanza", "Abigail", "Edith", "Blake", "Bernard", "Jonah", "Norman" ], "edges": [ [ 0, 2 ], [ 1, 5 ], [ 1, 8 ], [ 2, 1 ], [ 5, 4 ], [ 5, 6 ], [ 6, 7 ], [ 8, 9 ], [ 9, 3 ], [ 10, 12 ], [ 11, 15 ], [ 11, 18 ], [ 12, 11 ], [ 15, 14 ], [ 15, 16 ], [ 16, 17 ], [ 18, 19 ], [ 19, 13 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Ellen knows Warren. Joaquin knows Gina. Emanuel knows Gustavo. Ken knows Martha. Carter knows Jem. Dennis knows Alma. Gina knows Isaac. Jules knows Ken. Ken knows Ellen. Erma knows Jules. Calvin knows Theodore. Jules knows Emanuel. Warren knows Lily. Lily knows Jack. Joaquin knows Dennis. Julius knows Joaquin. Gina knows Carter. Jem knows Calvin. Which of Warren and Jem can Erma reach?", "answer": "Warren", "steps": [ "Erma knows Jules.", "Jules knows Ken.", "Ken knows Ellen.", "Ellen knows Warren." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Erma", "Warren", "Gustavo", "Ken", "Jules", "Ellen", "Martha", "Jack", "Lily", "Emanuel", "Julius", "Jem", "Alma", "Gina", "Joaquin", "Carter", "Isaac", "Theodore", "Calvin", "Dennis" ], "edges": [ [ 0, 4 ], [ 1, 8 ], [ 3, 6 ], [ 3, 5 ], [ 4, 3 ], [ 4, 9 ], [ 5, 1 ], [ 8, 7 ], [ 9, 2 ], [ 10, 14 ], [ 11, 18 ], [ 13, 16 ], [ 13, 15 ], [ 14, 13 ], [ 14, 19 ], [ 15, 11 ], [ 18, 17 ], [ 19, 12 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Cassidy knows Jack. Ida knows Kay. Sybil knows Cassidy. Humphrey knows Ida. Ida knows Paige. Hubert knows Jeffery. Ernie knows Francesca. Chad knows Ilene. Kay knows Gideon. Kay knows Knox. Humphrey knows Destiny. Cassidy knows Chad. Humphrey knows Hubert. Sybil knows Kingsley. Gideon knows Arden. Phoebe knows Kenneth. Ernie knows Phoebe. Ernie knows Sybil. Which of Chad and Gideon can Humphrey reach?", "answer": "Gideon", "steps": [ "Humphrey knows Ida.", "Ida knows Kay.", "Kay knows Gideon." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Humphrey", "Arden", "Ida", "Hubert", "Gideon", "Destiny", "Kay", "Jeffery", "Knox", "Paige", "Ernie", "Ilene", "Sybil", "Phoebe", "Chad", "Francesca", "Cassidy", "Kenneth", "Jack", "Kingsley" ], "edges": [ [ 0, 5 ], [ 0, 3 ], [ 0, 2 ], [ 2, 6 ], [ 2, 9 ], [ 3, 7 ], [ 4, 1 ], [ 6, 4 ], [ 6, 8 ], [ 10, 15 ], [ 10, 13 ], [ 10, 12 ], [ 12, 16 ], [ 12, 19 ], [ 13, 17 ], [ 14, 11 ], [ 16, 14 ], [ 16, 18 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Carla knows Cassidy. Colette knows Wade. Leroy knows Delilah. Barbara knows Leroy. Carla knows Teresa. Ernesto knows Barbara. Emanuel knows Edward. Teresa knows Dakota. Greg knows Carla. Ernesto knows Harlan. Denise knows Martin. Terry knows Denise. Martin knows Colette. Edward knows Greg. Dakota knows Andre. Greg knows Jules. Jules knows Dora. Martin knows Ernesto. Which of Greg and Martin can Emanuel reach?", "answer": "Greg", "steps": [ "Emanuel knows Edward.", "Edward knows Greg." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Emanuel", "Andre", "Dora", "Greg", "Dakota", "Jules", "Carla", "Teresa", "Cassidy", "Edward", "Terry", "Delilah", "Wade", "Martin", "Leroy", "Colette", "Ernesto", "Barbara", "Harlan", "Denise" ], "edges": [ [ 0, 9 ], [ 3, 5 ], [ 3, 6 ], [ 4, 1 ], [ 5, 2 ], [ 6, 7 ], [ 6, 8 ], [ 7, 4 ], [ 9, 3 ], [ 10, 19 ], [ 13, 15 ], [ 13, 16 ], [ 14, 11 ], [ 15, 12 ], [ 16, 17 ], [ 16, 18 ], [ 17, 14 ], [ 19, 13 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Ashley knows Leon. Ibrahim knows Lillian. Lola knows Ann. Alexa knows Beau. Stacy knows Corinne. Stacy knows Cynthia. Leon knows Marshall. Shane knows Ibrahim. Ann knows Dwight. Corinne knows Cesar. Jane knows Shelly. Corinne knows Eduardo. Ibrahim knows Alexa. Alexa knows Ashley. Margaret knows Shane. Shane knows Jeff. Eduardo knows Jane. Ann knows Stacy. Which of Ibrahim and Stacy can Margaret reach?", "answer": "Ibrahim", "steps": [ "Margaret knows Shane.", "Shane knows Ibrahim." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Margaret", "Leon", "Alexa", "Shane", "Jeff", "Ashley", "Beau", "Marshall", "Ibrahim", "Lillian", "Lola", "Jane", "Corinne", "Ann", "Dwight", "Eduardo", "Cesar", "Shelly", "Stacy", "Cynthia" ], "edges": [ [ 0, 3 ], [ 1, 7 ], [ 2, 6 ], [ 2, 5 ], [ 3, 4 ], [ 3, 8 ], [ 5, 1 ], [ 8, 2 ], [ 8, 9 ], [ 10, 13 ], [ 11, 17 ], [ 12, 16 ], [ 12, 15 ], [ 13, 14 ], [ 13, 18 ], [ 15, 11 ], [ 18, 12 ], [ 18, 19 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Malik knows Mae. India knows Kieran. Randy knows Lyle. India knows Kobe. Kieran knows Ella. Virgil knows Kyle. Lyle knows Malik. Malik knows Kurt. India knows Nancy. Mae knows Annie. Malik knows Hailey. Kurt knows Lionel. Malik knows Virgil. India knows Holly. Eamon knows Maya. Maya knows India. Kobe knows Chester. Nancy knows Samuel. Which of India and Malik can Eamon reach?", "answer": "India", "steps": [ "Eamon knows Maya.", "Maya knows India." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Eamon", "Ella", "Holly", "Maya", "Nancy", "Kieran", "Samuel", "Kobe", "Chester", "India", "Randy", "Kyle", "Hailey", "Lyle", "Mae", "Virgil", "Annie", "Kurt", "Lionel", "Malik" ], "edges": [ [ 0, 3 ], [ 3, 9 ], [ 4, 6 ], [ 5, 1 ], [ 7, 8 ], [ 9, 2 ], [ 9, 5 ], [ 9, 4 ], [ 9, 7 ], [ 10, 13 ], [ 13, 19 ], [ 14, 16 ], [ 15, 11 ], [ 17, 18 ], [ 19, 12 ], [ 19, 15 ], [ 19, 14 ], [ 19, 17 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Annie knows Eunice. Eunice knows Deborah. Bruno knows Glenn. Graeme knows Bruno. Deborah knows Cody. Patricia knows Jason. Chandler knows Abel. Lisette knows Ezra. Charlotte knows Graeme. Noah knows Garrett. Bruno knows Sue. Patricia knows June. Lisette knows Geoffrey. Jason knows Chandler. Annie knows Charlotte. Patricia knows Noah. Annie knows Elias. Garrett knows Lisette. Which of Bruno and Lisette can Annie reach?", "answer": "Bruno", "steps": [ "Annie knows Charlotte.", "Charlotte knows Graeme.", "Graeme knows Bruno." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Annie", "Cody", "Charlotte", "Sue", "Deborah", "Bruno", "Glenn", "Eunice", "Elias", "Graeme", "Patricia", "Abel", "Noah", "Geoffrey", "Chandler", "Lisette", "Ezra", "Jason", "June", "Garrett" ], "edges": [ [ 0, 7 ], [ 0, 8 ], [ 0, 2 ], [ 2, 9 ], [ 4, 1 ], [ 5, 3 ], [ 5, 6 ], [ 7, 4 ], [ 9, 5 ], [ 10, 17 ], [ 10, 18 ], [ 10, 12 ], [ 12, 19 ], [ 14, 11 ], [ 15, 13 ], [ 15, 16 ], [ 17, 14 ], [ 19, 15 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Abel knows Morris. Kay knows Ruby. Carey knows Dolores. Celia knows Franklin. Latoya knows Linda. Ember knows Abel. Latoya knows Jared. Nina knows Latoya. Franklin knows Sally. Ralph knows Kay. Chester knows Flora. Dolores knows Nina. Chester knows Ellis. Carey knows Skyler. Dolores knows Celia. Ember knows Marlene. Abel knows Ralph. Morris knows Chester. Which of Jared and Ellis can Ember reach?", "answer": "Ellis", "steps": [ "Ember knows Abel.", "Abel knows Morris.", "Morris knows Chester.", "Chester knows Ellis." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Ember", "Kay", "Ralph", "Morris", "Abel", "Chester", "Flora", "Ellis", "Ruby", "Marlene", "Carey", "Franklin", "Celia", "Nina", "Dolores", "Latoya", "Linda", "Jared", "Sally", "Skyler" ], "edges": [ [ 0, 4 ], [ 0, 9 ], [ 1, 8 ], [ 2, 1 ], [ 3, 5 ], [ 4, 3 ], [ 4, 2 ], [ 5, 6 ], [ 5, 7 ], [ 10, 14 ], [ 10, 19 ], [ 11, 18 ], [ 12, 11 ], [ 13, 15 ], [ 14, 13 ], [ 14, 12 ], [ 15, 16 ], [ 15, 17 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Justine knows Karen. Justine knows Imogen. Ezra knows Dante. Karen knows Odette. Dave knows Ezra. Justine knows Gemma. Whitney knows Lois. Daniel knows Justine. Karen knows Dave. Ricardo knows Courtney. Courtney knows Gerard. Whitney knows Opal. Opal knows Tanya. Camden knows Ricardo. Whitney knows Camden. Gemma knows Leland. Camden knows Travis. Natalie knows Whitney. Which of Camden and Karen can Daniel reach?", "answer": "Karen", "steps": [ "Daniel knows Justine.", "Justine knows Karen." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Daniel", "Dante", "Imogen", "Ezra", "Leland", "Karen", "Justine", "Odette", "Gemma", "Dave", "Natalie", "Gerard", "Lois", "Courtney", "Tanya", "Camden", "Whitney", "Travis", "Opal", "Ricardo" ], "edges": [ [ 0, 6 ], [ 3, 1 ], [ 5, 7 ], [ 5, 9 ], [ 6, 2 ], [ 6, 8 ], [ 6, 5 ], [ 8, 4 ], [ 9, 3 ], [ 10, 16 ], [ 13, 11 ], [ 15, 17 ], [ 15, 19 ], [ 16, 12 ], [ 16, 18 ], [ 16, 15 ], [ 18, 14 ], [ 19, 13 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Alma knows Bruno. Marshall knows Ethan. Jillian knows Wesley. Alma knows Roland. Hugh knows Selena. Marshall knows Freya. Lily knows Tiffany. Selena knows Camille. Alma knows Nell. Shane knows Kara. Camille knows Devin. Freya knows Jerome. Camille knows Lily. Marshall knows Hugh. Bruno knows Jillian. Wesley knows Shane. Wesley knows Arnold. Nell knows Cyrus. Which of Kara and Tiffany can Alma reach?", "answer": "Kara", "steps": [ "Alma knows Bruno.", "Bruno knows Jillian.", "Jillian knows Wesley.", "Wesley knows Shane.", "Shane knows Kara." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Alma", "Cyrus", "Wesley", "Roland", "Nell", "Kara", "Arnold", "Shane", "Bruno", "Jillian", "Marshall", "Jerome", "Camille", "Ethan", "Freya", "Tiffany", "Devin", "Lily", "Hugh", "Selena" ], "edges": [ [ 0, 3 ], [ 0, 4 ], [ 0, 8 ], [ 2, 6 ], [ 2, 7 ], [ 4, 1 ], [ 7, 5 ], [ 8, 9 ], [ 9, 2 ], [ 10, 13 ], [ 10, 14 ], [ 10, 18 ], [ 12, 16 ], [ 12, 17 ], [ 14, 11 ], [ 17, 15 ], [ 18, 19 ], [ 19, 12 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Sadie knows Darla. Frances knows Sadie. Hayes knows Ruby. Mike knows Hayes. Gina knows Mike. Valerie knows Kylie. Colin knows Valerie. Frances knows Iris. Valerie knows Donald. Charlotte knows Callum. Hayes knows Frances. Phoebe knows Gina. Donald knows Olive. Iris knows Isiah. Riley knows Colin. Walt knows Riley. Donald knows Charlotte. Olive knows Ramon. Which of Riley and Gina can Phoebe reach?", "answer": "Gina", "steps": [ "Phoebe knows Gina." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Phoebe", "Ruby", "Isiah", "Darla", "Mike", "Gina", "Sadie", "Iris", "Hayes", "Frances", "Walt", "Kylie", "Callum", "Ramon", "Colin", "Riley", "Olive", "Charlotte", "Valerie", "Donald" ], "edges": [ [ 0, 5 ], [ 4, 8 ], [ 5, 4 ], [ 6, 3 ], [ 7, 2 ], [ 8, 1 ], [ 8, 9 ], [ 9, 6 ], [ 9, 7 ], [ 10, 15 ], [ 14, 18 ], [ 15, 14 ], [ 16, 13 ], [ 17, 12 ], [ 18, 11 ], [ 18, 19 ], [ 19, 16 ], [ 19, 17 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Karla knows Leticia. Homer knows Jenna. Keith knows Brett. Harley knows Edwin. Loretta knows Leopold. Harley knows Anastasia. Louise knows Karla. Louise knows Loretta. Troy knows Keaton. Louise knows Jasmine. Josie knows Louise. Anastasia knows Asher. Josie knows Jordan. Brett knows Homer. Brittany knows Dakota. Jordan knows Brittany. Harley knows Troy. Keith knows Harley. Which of Troy and Loretta can Keith reach?", "answer": "Troy", "steps": [ "Keith knows Harley.", "Harley knows Troy." ], "difficulty": 2, "original_distance": 3, "idx_to_symbol": [ "Keith", "Anastasia", "Harley", "Homer", "Jenna", "Brett", "Asher", "Troy", "Keaton", "Edwin", "Josie", "Karla", "Louise", "Brittany", "Dakota", "Jordan", "Leticia", "Loretta", "Leopold", "Jasmine" ], "edges": [ [ 0, 5 ], [ 0, 2 ], [ 1, 6 ], [ 2, 1 ], [ 2, 7 ], [ 2, 9 ], [ 3, 4 ], [ 5, 3 ], [ 7, 8 ], [ 10, 15 ], [ 10, 12 ], [ 11, 16 ], [ 12, 11 ], [ 12, 17 ], [ 12, 19 ], [ 13, 14 ], [ 15, 13 ], [ 17, 18 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Roger knows Kit. Jana knows Bruno. Bennett knows Mack. Jana knows Tabitha. Kai knows Dallas. Tamara knows Jana. Jillian knows Harley. Myra knows Luke. Myra knows Herbert. Kendrick knows Lark. Harley knows Myra. John knows Kendrick. John knows Roger. Bruno knows Jonah. Roger knows Jillian. Tamara knows Bennett. Jonah knows Kai. Kai knows Justine. Which of Jana and Roger can John reach?", "answer": "Roger", "steps": [ "John knows Roger." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "John", "Harley", "Myra", "Kit", "Herbert", "Roger", "Luke", "Jillian", "Kendrick", "Lark", "Tamara", "Jonah", "Kai", "Tabitha", "Justine", "Jana", "Dallas", "Bruno", "Bennett", "Mack" ], "edges": [ [ 0, 5 ], [ 0, 8 ], [ 1, 2 ], [ 2, 4 ], [ 2, 6 ], [ 5, 3 ], [ 5, 7 ], [ 7, 1 ], [ 8, 9 ], [ 10, 15 ], [ 10, 18 ], [ 11, 12 ], [ 12, 14 ], [ 12, 16 ], [ 15, 13 ], [ 15, 17 ], [ 17, 11 ], [ 18, 19 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Kirk knows Nora. Isla knows Vanessa. Isla knows Florence. Isla knows Sylvia. Lilia knows Ramona. Xander knows Enrique. Florence knows Darnell. Uma knows Lilia. Ramona knows Vera. Dora knows Hattie. Melody knows Kirk. Kirk knows Xander. Jeremiah knows Dora. Darnell knows Foster. Enrique knows Donna. Kirk knows Gerald. Uma knows Isla. Melody knows Jeremiah. Which of Enrique and Darnell can Uma reach?", "answer": "Darnell", "steps": [ "Uma knows Isla.", "Isla knows Florence.", "Florence knows Darnell." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Uma", "Ramona", "Florence", "Lilia", "Vera", "Sylvia", "Foster", "Vanessa", "Isla", "Darnell", "Melody", "Dora", "Xander", "Jeremiah", "Hattie", "Nora", "Donna", "Gerald", "Kirk", "Enrique" ], "edges": [ [ 0, 3 ], [ 0, 8 ], [ 1, 4 ], [ 2, 9 ], [ 3, 1 ], [ 8, 5 ], [ 8, 7 ], [ 8, 2 ], [ 9, 6 ], [ 10, 13 ], [ 10, 18 ], [ 11, 14 ], [ 12, 19 ], [ 13, 11 ], [ 18, 15 ], [ 18, 17 ], [ 18, 12 ], [ 19, 16 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Sebastian knows Elvira. Jessica knows Harmony. Whitney knows Riley. Elvira knows Lucia. Sebastian knows Miles. Daphne knows Itzel. Laurel knows Warren. Dakota knows Laurel. Dakota knows Fabian. Laurel knows Whitney. Elvira knows Jessica. Harmony knows Daphne. Riley knows Wayne. Riley knows Antonio. Sebastian knows Logan. Harmony knows Lana. Dakota knows Guy. Antonio knows Barney. Which of Harmony and Riley can Sebastian reach?", "answer": "Harmony", "steps": [ "Sebastian knows Elvira.", "Elvira knows Jessica.", "Jessica knows Harmony." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Sebastian", "Lucia", "Logan", "Daphne", "Jessica", "Lana", "Itzel", "Miles", "Harmony", "Elvira", "Dakota", "Warren", "Fabian", "Antonio", "Whitney", "Wayne", "Barney", "Guy", "Riley", "Laurel" ], "edges": [ [ 0, 2 ], [ 0, 7 ], [ 0, 9 ], [ 3, 6 ], [ 4, 8 ], [ 8, 5 ], [ 8, 3 ], [ 9, 1 ], [ 9, 4 ], [ 10, 12 ], [ 10, 17 ], [ 10, 19 ], [ 13, 16 ], [ 14, 18 ], [ 18, 15 ], [ 18, 13 ], [ 19, 11 ], [ 19, 14 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Wilson knows Neal. Renee knows Matthew. Morgan knows Isabel. Isabel knows Bonnie. Neal knows Camille. Diane knows Renee. Isabel knows Hugo. Renee knows Chad. Gabriel knows Diane. Neal knows Owen. Isabel knows Tara. Morgan knows Zara. Desmond knows Louise. Tara knows Wilson. Desmond knows Keegan. John knows Desmond. Desmond knows Gabriel. John knows Brynn. Which of Diane and Wilson can Morgan reach?", "answer": "Wilson", "steps": [ "Morgan knows Isabel.", "Isabel knows Tara.", "Tara knows Wilson." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Morgan", "Hugo", "Camille", "Bonnie", "Wilson", "Owen", "Isabel", "Neal", "Zara", "Tara", "John", "Louise", "Matthew", "Keegan", "Diane", "Chad", "Desmond", "Renee", "Brynn", "Gabriel" ], "edges": [ [ 0, 8 ], [ 0, 6 ], [ 4, 7 ], [ 6, 1 ], [ 6, 3 ], [ 6, 9 ], [ 7, 2 ], [ 7, 5 ], [ 9, 4 ], [ 10, 18 ], [ 10, 16 ], [ 14, 17 ], [ 16, 11 ], [ 16, 13 ], [ 16, 19 ], [ 17, 12 ], [ 17, 15 ], [ 19, 14 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Emmett knows Lois. Arturo knows Spencer. Dane knows Tabitha. Dane knows Eduardo. Ira knows Roman. Tabitha knows Harrison. Margaret knows Arturo. Terrence knows Sandy. Harrison knows Emmett. Spencer knows Gene. Ira knows Margaret. Terrence knows Ira. Emmett knows Josie. Vera knows Pedro. Vera knows Dane. Vera knows Sam. Spencer knows Leander. Terrence knows Opal. Which of Ira and Dane can Terrence reach?", "answer": "Ira", "steps": [ "Terrence knows Ira." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Terrence", "Roman", "Spencer", "Leander", "Margaret", "Gene", "Opal", "Sandy", "Arturo", "Ira", "Vera", "Eduardo", "Emmett", "Josie", "Tabitha", "Lois", "Pedro", "Sam", "Harrison", "Dane" ], "edges": [ [ 0, 6 ], [ 0, 7 ], [ 0, 9 ], [ 2, 3 ], [ 2, 5 ], [ 4, 8 ], [ 8, 2 ], [ 9, 1 ], [ 9, 4 ], [ 10, 16 ], [ 10, 17 ], [ 10, 19 ], [ 12, 13 ], [ 12, 15 ], [ 14, 18 ], [ 18, 12 ], [ 19, 11 ], [ 19, 14 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Sandy knows Darin. Howard knows Boyd. Felicia knows Wilbur. Glenda knows Sandy. Boyd knows Nell. Audrey knows Mia. Wayne knows Howard. Howard knows Donna. Drake knows Earl. Felicia knows Goldie. Howard knows Jean. Nell knows Dexter. Felicia knows Elijah. Hannah knows Drake. Mia knows Glenda. Dexter knows Hannah. Farrah knows Felicia. Goldie knows Audrey. Which of Mia and Dexter can Farrah reach?", "answer": "Mia", "steps": [ "Farrah knows Felicia.", "Felicia knows Goldie.", "Goldie knows Audrey.", "Audrey knows Mia." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Farrah", "Darin", "Audrey", "Elijah", "Goldie", "Wilbur", "Glenda", "Sandy", "Felicia", "Mia", "Wayne", "Earl", "Nell", "Jean", "Boyd", "Donna", "Hannah", "Drake", "Howard", "Dexter" ], "edges": [ [ 0, 8 ], [ 2, 9 ], [ 4, 2 ], [ 6, 7 ], [ 7, 1 ], [ 8, 3 ], [ 8, 5 ], [ 8, 4 ], [ 9, 6 ], [ 10, 18 ], [ 12, 19 ], [ 14, 12 ], [ 16, 17 ], [ 17, 11 ], [ 18, 13 ], [ 18, 15 ], [ 18, 14 ], [ 19, 16 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Abel knows Alyson. Calvin knows Dell. Dave knows Abel. Alyson knows Naomi. Abel knows Axel. Alyson knows Austin. Jill knows Francesca. Edison knows Clifford. Abel knows Gary. Francesca knows Charlene. Roger knows Haven. Roger knows Edison. Roger knows Kelsey. Abel knows Chloe. Dell knows Dave. Edison knows Paige. Charlene knows Roger. Roger knows Elvis. Which of Dave and Charlene can Jill reach?", "answer": "Charlene", "steps": [ "Jill knows Francesca.", "Francesca knows Charlene." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Jill", "Kelsey", "Edison", "Francesca", "Paige", "Haven", "Clifford", "Roger", "Elvis", "Charlene", "Calvin", "Axel", "Alyson", "Dell", "Naomi", "Gary", "Austin", "Abel", "Chloe", "Dave" ], "edges": [ [ 0, 3 ], [ 2, 4 ], [ 2, 6 ], [ 3, 9 ], [ 7, 1 ], [ 7, 5 ], [ 7, 2 ], [ 7, 8 ], [ 9, 7 ], [ 10, 13 ], [ 12, 14 ], [ 12, 16 ], [ 13, 19 ], [ 17, 11 ], [ 17, 15 ], [ 17, 12 ], [ 17, 18 ], [ 19, 17 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Jenna knows Lauren. Regina knows Mae. Hamilton knows Lance. Tessa knows Katherine. Joshua knows Inez. India knows Wilma. Joshua knows Jenna. Mildred knows Elena. Regina knows Mildred. Haven knows Claire. Joy knows Jake. Jenna knows India. Cristina knows Hamilton. Wilma knows Tessa. Mildred knows Callum. Wilma knows Haven. Callum knows Cristina. Cristina knows Joy. Which of Jenna and Mildred can Joshua reach?", "answer": "Jenna", "steps": [ "Joshua knows Jenna." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Joshua", "Haven", "Lauren", "Inez", "Jenna", "India", "Claire", "Katherine", "Tessa", "Wilma", "Regina", "Joy", "Elena", "Mae", "Mildred", "Callum", "Jake", "Lance", "Hamilton", "Cristina" ], "edges": [ [ 0, 3 ], [ 0, 4 ], [ 1, 6 ], [ 4, 2 ], [ 4, 5 ], [ 5, 9 ], [ 8, 7 ], [ 9, 1 ], [ 9, 8 ], [ 10, 13 ], [ 10, 14 ], [ 11, 16 ], [ 14, 12 ], [ 14, 15 ], [ 15, 19 ], [ 18, 17 ], [ 19, 11 ], [ 19, 18 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Stacy knows Magdalena. Stanley knows Marcia. Arnold knows Farrah. Ernesto knows Cruz. Amelia knows Grant. Elise knows Stanley. Jared knows Elise. Carter knows Eldon. Stanley knows Lorenzo. Farrah knows India. Craig knows Tina. Craig knows Ernesto. Marcia knows Arnold. Tina knows Harley. Arnold knows Amelia. Stacy knows Uma. Magdalena knows Craig. Eldon knows Stacy. Which of Amelia and Tina can Jared reach?", "answer": "Amelia", "steps": [ "Jared knows Elise.", "Elise knows Stanley.", "Stanley knows Marcia.", "Marcia knows Arnold.", "Arnold knows Amelia." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Jared", "India", "Lorenzo", "Marcia", "Arnold", "Farrah", "Grant", "Stanley", "Amelia", "Elise", "Carter", "Cruz", "Uma", "Magdalena", "Craig", "Ernesto", "Harley", "Stacy", "Tina", "Eldon" ], "edges": [ [ 0, 9 ], [ 3, 4 ], [ 4, 5 ], [ 4, 8 ], [ 5, 1 ], [ 7, 2 ], [ 7, 3 ], [ 8, 6 ], [ 9, 7 ], [ 10, 19 ], [ 13, 14 ], [ 14, 15 ], [ 14, 18 ], [ 15, 11 ], [ 17, 12 ], [ 17, 13 ], [ 18, 16 ], [ 19, 17 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Hugh knows Daria. Jane knows Mara. Arden knows Opal. Paige knows Sean. Yuki knows Victor. Colin knows Rhonda. Lars knows Leopold. Victor knows Arden. Archer knows Paige. Fanny knows Ramona. Fanny knows Hugh. Sean knows Carl. Leopold knows Maggie. Maggie knows Jane. Opal knows Fanny. Daria knows Colin. Jane knows Archer. Hayes knows Lars. Which of Rhonda and Carl can Yuki reach?", "answer": "Rhonda", "steps": [ "Yuki knows Victor.", "Victor knows Arden.", "Arden knows Opal.", "Opal knows Fanny.", "Fanny knows Hugh.", "Hugh knows Daria.", "Daria knows Colin.", "Colin knows Rhonda." ], "difficulty": 8, "original_distance": 8, "idx_to_symbol": [ "Yuki", "Victor", "Daria", "Colin", "Fanny", "Opal", "Rhonda", "Arden", "Hugh", "Ramona", "Hayes", "Lars", "Paige", "Sean", "Jane", "Maggie", "Carl", "Leopold", "Archer", "Mara" ], "edges": [ [ 0, 1 ], [ 1, 7 ], [ 2, 3 ], [ 3, 6 ], [ 4, 8 ], [ 4, 9 ], [ 5, 4 ], [ 7, 5 ], [ 8, 2 ], [ 10, 11 ], [ 11, 17 ], [ 12, 13 ], [ 13, 16 ], [ 14, 18 ], [ 14, 19 ], [ 15, 14 ], [ 17, 15 ], [ 18, 12 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Linda knows Fisher. Linda knows Tiffany. Benjamin knows Harrison. Tom knows Parker. Tiffany knows Gina. Linda knows Benjamin. Ian knows Naomi. Naomi knows Pauline. Harrison knows Geoffrey. Pedro knows Jake. Ian knows Pedro. Alan knows Tom. Gina knows Fergus. Jake knows Nolan. Linda knows Cara. Ian knows Charles. Fisher knows Vera. Ian knows Alan. Which of Gina and Jake can Ian reach?", "answer": "Jake", "steps": [ "Ian knows Pedro.", "Pedro knows Jake." ], "difficulty": 2, "original_distance": 3, "idx_to_symbol": [ "Ian", "Jake", "Pedro", "Parker", "Nolan", "Alan", "Tom", "Charles", "Naomi", "Pauline", "Linda", "Gina", "Tiffany", "Geoffrey", "Fergus", "Benjamin", "Harrison", "Cara", "Fisher", "Vera" ], "edges": [ [ 0, 2 ], [ 0, 5 ], [ 0, 7 ], [ 0, 8 ], [ 1, 4 ], [ 2, 1 ], [ 5, 6 ], [ 6, 3 ], [ 8, 9 ], [ 10, 12 ], [ 10, 15 ], [ 10, 17 ], [ 10, 18 ], [ 11, 14 ], [ 12, 11 ], [ 15, 16 ], [ 16, 13 ], [ 18, 19 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "John knows Clyde. Julian knows Luella. Lawrence knows Julian. Mara knows Alana. Daphna knows Dudley. John knows Dustin. Leonard knows Walt. Clyde knows Dave. Luella knows Elise. Walt knows Kerry. John knows Gustavo. Fleur knows Erma. Leonard knows Mara. Luella knows Daphna. Fleur knows Lawrence. Fleur knows Nash. Dave knows Leonard. Elise knows Aldo. Which of Clyde and Lawrence can John reach?", "answer": "Clyde", "steps": [ "John knows Clyde." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "John", "Alana", "Gustavo", "Leonard", "Walt", "Mara", "Clyde", "Dustin", "Kerry", "Dave", "Fleur", "Dudley", "Erma", "Luella", "Elise", "Daphna", "Lawrence", "Nash", "Aldo", "Julian" ], "edges": [ [ 0, 2 ], [ 0, 7 ], [ 0, 6 ], [ 3, 5 ], [ 3, 4 ], [ 4, 8 ], [ 5, 1 ], [ 6, 9 ], [ 9, 3 ], [ 10, 12 ], [ 10, 17 ], [ 10, 16 ], [ 13, 15 ], [ 13, 14 ], [ 14, 18 ], [ 15, 11 ], [ 16, 19 ], [ 19, 13 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "June knows Hattie. Rita knows Daria. Jeanette knows Perry. Beverly knows Jeanette. Rita knows Langston. Alejandro knows Lyle. Susan knows June. Hattie knows Saul. Milo knows Hilda. Verna knows Luz. Alejandro knows Shelly. Lars knows Alejandro. Perry knows Rita. Hilda knows Beverly. Alejandro knows Verna. Emily knows Owen. Saul knows Lars. Rita knows Emily. Which of June and Hilda can Susan reach?", "answer": "June", "steps": [ "Susan knows June." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Susan", "Hattie", "Luz", "Alejandro", "Lars", "Shelly", "Lyle", "Verna", "Saul", "June", "Milo", "Beverly", "Owen", "Rita", "Perry", "Daria", "Langston", "Emily", "Jeanette", "Hilda" ], "edges": [ [ 0, 9 ], [ 1, 8 ], [ 3, 5 ], [ 3, 6 ], [ 3, 7 ], [ 4, 3 ], [ 7, 2 ], [ 8, 4 ], [ 9, 1 ], [ 10, 19 ], [ 11, 18 ], [ 13, 15 ], [ 13, 16 ], [ 13, 17 ], [ 14, 13 ], [ 17, 12 ], [ 18, 14 ], [ 19, 11 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Sue knows Leticia. Russell knows Xavier. Sue knows Yolanda. Xavier knows Hazel. Mae knows Brent. Yolanda knows Zoe. Brent knows Neville. Sue knows Jerry. Fleur knows Jocelyn. Sue knows Daphna. Brent knows Tara. Tara knows Anita. Nathan knows Sue. Yolanda knows Fleur. Daphna knows Chandler. Brent knows Russell. Russell knows Virginia. Brent knows Janet. Which of Yolanda and Russell can Mae reach?", "answer": "Russell", "steps": [ "Mae knows Brent.", "Brent knows Russell." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Mae", "Neville", "Janet", "Anita", "Russell", "Hazel", "Xavier", "Brent", "Tara", "Virginia", "Nathan", "Leticia", "Jerry", "Chandler", "Yolanda", "Jocelyn", "Fleur", "Sue", "Daphna", "Zoe" ], "edges": [ [ 0, 7 ], [ 4, 6 ], [ 4, 9 ], [ 6, 5 ], [ 7, 1 ], [ 7, 2 ], [ 7, 8 ], [ 7, 4 ], [ 8, 3 ], [ 10, 17 ], [ 14, 16 ], [ 14, 19 ], [ 16, 15 ], [ 17, 11 ], [ 17, 12 ], [ 17, 18 ], [ 17, 14 ], [ 18, 13 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Jay knows Eve. Xander knows Jay. Verna knows Holly. Vicki knows Ellis. Emmett knows Steve. Reed knows Vicki. Jay knows Ilene. Vivian knows Jenny. Jay knows Heidi. Jenny knows Emmett. Archer knows Reed. Verna knows Diego. Verna knows Yasmin. Jenny knows Claudia. Reed knows Kenzie. Xander knows Vivian. Abigail knows Verna. Abigail knows Archer. Which of Archer and Vivian can Abigail reach?", "answer": "Archer", "steps": [ "Abigail knows Archer." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Abigail", "Archer", "Ellis", "Kenzie", "Verna", "Vicki", "Yasmin", "Diego", "Holly", "Reed", "Xander", "Vivian", "Steve", "Claudia", "Jay", "Emmett", "Eve", "Ilene", "Heidi", "Jenny" ], "edges": [ [ 0, 4 ], [ 0, 1 ], [ 1, 9 ], [ 4, 6 ], [ 4, 7 ], [ 4, 8 ], [ 5, 2 ], [ 9, 3 ], [ 9, 5 ], [ 10, 14 ], [ 10, 11 ], [ 11, 19 ], [ 14, 16 ], [ 14, 17 ], [ 14, 18 ], [ 15, 12 ], [ 19, 13 ], [ 19, 15 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Clarissa knows Carol. Roger knows Tyler. Anita knows Demetrius. Aspen knows Vera. Roger knows Ira. Ron knows Destiny. Cooper knows Camden. Vera knows Carla. Tyler knows Aspen. Clarissa knows Khashayar. Carla knows Gail. Zara knows Anita. Zara knows Ron. Demetrius knows Devon. Khashayar knows Zara. Devon knows Lyric. Aspen knows Cooper. Gail knows Patrick. Which of Carla and Demetrius can Roger reach?", "answer": "Carla", "steps": [ "Roger knows Tyler.", "Tyler knows Aspen.", "Aspen knows Vera.", "Vera knows Carla." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Roger", "Gail", "Camden", "Ira", "Aspen", "Patrick", "Cooper", "Carla", "Tyler", "Vera", "Clarissa", "Devon", "Destiny", "Carol", "Zara", "Lyric", "Ron", "Demetrius", "Khashayar", "Anita" ], "edges": [ [ 0, 3 ], [ 0, 8 ], [ 1, 5 ], [ 4, 6 ], [ 4, 9 ], [ 6, 2 ], [ 7, 1 ], [ 8, 4 ], [ 9, 7 ], [ 10, 13 ], [ 10, 18 ], [ 11, 15 ], [ 14, 16 ], [ 14, 19 ], [ 16, 12 ], [ 17, 11 ], [ 18, 14 ], [ 19, 17 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "James knows Boyd. Adelaide knows Clinton. Drew knows Dorothy. Jakob knows James. Adelaide knows Kurt. Brody knows Kai. Russ knows Renee. Aaron knows Adelaide. Drew knows Pete. Cynthia knows Jakob. Renee knows Lisette. Nora knows Brody. Rex knows Chelsea. Kai knows Cynthia. Chelsea knows Aaron. Lisette knows Rhonda. Rhonda knows Rex. Boyd knows Drew. Which of Rhonda and Cynthia can Nora reach?", "answer": "Cynthia", "steps": [ "Nora knows Brody.", "Brody knows Kai.", "Kai knows Cynthia." ], "difficulty": 3, "original_distance": 8, "idx_to_symbol": [ "Nora", "James", "Drew", "Dorothy", "Jakob", "Kai", "Brody", "Boyd", "Pete", "Cynthia", "Russ", "Chelsea", "Adelaide", "Kurt", "Rex", "Lisette", "Renee", "Aaron", "Clinton", "Rhonda" ], "edges": [ [ 0, 6 ], [ 1, 7 ], [ 2, 3 ], [ 2, 8 ], [ 4, 1 ], [ 5, 9 ], [ 6, 5 ], [ 7, 2 ], [ 9, 4 ], [ 10, 16 ], [ 11, 17 ], [ 12, 13 ], [ 12, 18 ], [ 14, 11 ], [ 15, 19 ], [ 16, 15 ], [ 17, 12 ], [ 19, 14 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Grady knows Dora. Clement knows Darcy. Daphna knows Kendra. Donovan knows Luz. Patrick knows Susan. Jude knows Patrick. Kristin knows Julius. Darcy knows Kane. Kendra knows Luther. Susan knows Sandra. Luz knows Rhonda. Sandra knows Clement. Eldon knows Kirsten. Rhonda knows Kristin. Luther knows Donovan. Rhonda knows Grady. Darcy knows Eldon. Kane knows Riley. Which of Luther and Susan can Daphna reach?", "answer": "Luther", "steps": [ "Daphna knows Kendra.", "Kendra knows Luther." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Daphna", "Julius", "Kristin", "Dora", "Grady", "Donovan", "Rhonda", "Luther", "Luz", "Kendra", "Jude", "Kirsten", "Eldon", "Riley", "Kane", "Sandra", "Darcy", "Susan", "Clement", "Patrick" ], "edges": [ [ 0, 9 ], [ 2, 1 ], [ 4, 3 ], [ 5, 8 ], [ 6, 2 ], [ 6, 4 ], [ 7, 5 ], [ 8, 6 ], [ 9, 7 ], [ 10, 19 ], [ 12, 11 ], [ 14, 13 ], [ 15, 18 ], [ 16, 12 ], [ 16, 14 ], [ 17, 15 ], [ 18, 16 ], [ 19, 17 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Freya knows Kennedy. Gerald knows Freya. Sheila knows Lola. Viola knows Callum. Tonya knows Kaleb. Jocelyn knows Gerald. Leon knows Ted. Leon knows Adelaide. Kennedy knows Georgia. Gavin knows Travis. Viola knows Tonya. Tonya knows Jocelyn. Jake knows Sheila. Lola knows Leon. Gavin knows Jake. Adelaide knows Eileen. Freya knows Iris. Jake knows Ruth. Which of Gerald and Lola can Viola reach?", "answer": "Gerald", "steps": [ "Viola knows Tonya.", "Tonya knows Jocelyn.", "Jocelyn knows Gerald." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Viola", "Georgia", "Gerald", "Callum", "Freya", "Kaleb", "Kennedy", "Jocelyn", "Iris", "Tonya", "Gavin", "Eileen", "Lola", "Travis", "Leon", "Ruth", "Adelaide", "Sheila", "Ted", "Jake" ], "edges": [ [ 0, 3 ], [ 0, 9 ], [ 2, 4 ], [ 4, 6 ], [ 4, 8 ], [ 6, 1 ], [ 7, 2 ], [ 9, 5 ], [ 9, 7 ], [ 10, 13 ], [ 10, 19 ], [ 12, 14 ], [ 14, 16 ], [ 14, 18 ], [ 16, 11 ], [ 17, 12 ], [ 19, 15 ], [ 19, 17 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Whitney knows Veronica. Landon knows Whitney. Wayne knows Lena. Landon knows Victor. Eileen knows Landon. Eileen knows Richard. Landon knows Maggie. Cecilia knows Angelica. Omar knows Haven. Wayne knows Cecilia. Kevin knows Will. Wayne knows Kobe. Kobe knows Florence. Maggie knows Pat. Lena knows Randy. Omar knows Wayne. Landon knows Kevin. Wayne knows Rita. Which of Lena and Kevin can Eileen reach?", "answer": "Kevin", "steps": [ "Eileen knows Landon.", "Landon knows Kevin." ], "difficulty": 2, "original_distance": 3, "idx_to_symbol": [ "Eileen", "Victor", "Pat", "Richard", "Veronica", "Maggie", "Landon", "Whitney", "Kevin", "Will", "Omar", "Rita", "Angelica", "Haven", "Florence", "Cecilia", "Wayne", "Kobe", "Lena", "Randy" ], "edges": [ [ 0, 3 ], [ 0, 6 ], [ 5, 2 ], [ 6, 1 ], [ 6, 5 ], [ 6, 7 ], [ 6, 8 ], [ 7, 4 ], [ 8, 9 ], [ 10, 13 ], [ 10, 16 ], [ 15, 12 ], [ 16, 11 ], [ 16, 15 ], [ 16, 17 ], [ 16, 18 ], [ 17, 14 ], [ 18, 19 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Chad knows Tristan. Tristan knows Carlos. Tristan knows Ellis. Damian knows Oliver. Oliver knows Valerie. Flora knows Camille. Leander knows Damian. Ellis knows Ira. Ellis knows Tonya. Quinn knows Jacob. Christopher knows Dwight. Oliver knows Christopher. Alyssa knows Chad. Marlene knows Alyssa. Quinn knows Leander. Christopher knows Flora. Marlene knows Marco. Ira knows Willis. Which of Tristan and Oliver can Marlene reach?", "answer": "Tristan", "steps": [ "Marlene knows Alyssa.", "Alyssa knows Chad.", "Chad knows Tristan." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Marlene", "Chad", "Ellis", "Willis", "Carlos", "Tristan", "Alyssa", "Marco", "Ira", "Tonya", "Quinn", "Damian", "Christopher", "Camille", "Valerie", "Oliver", "Leander", "Jacob", "Flora", "Dwight" ], "edges": [ [ 0, 7 ], [ 0, 6 ], [ 1, 5 ], [ 2, 8 ], [ 2, 9 ], [ 5, 4 ], [ 5, 2 ], [ 6, 1 ], [ 8, 3 ], [ 10, 17 ], [ 10, 16 ], [ 11, 15 ], [ 12, 18 ], [ 12, 19 ], [ 15, 14 ], [ 15, 12 ], [ 16, 11 ], [ 18, 13 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Dahlia knows Erin. Gabriel knows Ebony. Erin knows Hudson. Dahlia knows Lucas. Lambert knows Gabriel. Keith knows Bernard. Bernard knows Pete. Gabriel knows Greta. Pete knows Rocco. Sean knows Darren. Lucas knows Keith. Deirdre knows Becky. Charity knows Deirdre. Madeline knows Dahlia. Greta knows Grady. Darren knows Charity. Rocco knows Harper. Ebony knows Sean. Which of Ebony and Lucas can Lambert reach?", "answer": "Ebony", "steps": [ "Lambert knows Gabriel.", "Gabriel knows Ebony." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Lambert", "Deirdre", "Darren", "Gabriel", "Charity", "Becky", "Grady", "Sean", "Ebony", "Greta", "Madeline", "Rocco", "Bernard", "Dahlia", "Pete", "Harper", "Hudson", "Keith", "Lucas", "Erin" ], "edges": [ [ 0, 3 ], [ 1, 5 ], [ 2, 4 ], [ 3, 8 ], [ 3, 9 ], [ 4, 1 ], [ 7, 2 ], [ 8, 7 ], [ 9, 6 ], [ 10, 13 ], [ 11, 15 ], [ 12, 14 ], [ 13, 18 ], [ 13, 19 ], [ 14, 11 ], [ 17, 12 ], [ 18, 17 ], [ 19, 16 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Hannah knows Sheila. Chandler knows Enrique. Penny knows Chandler. Chandler knows Eloise. Dina knows Sonia. Wilma knows Jessie. Jessie knows Dina. Dina knows Dominic. Raquel knows Hannah. Penny knows Eduardo. Jessie knows Joseph. Yolanda knows William. Wilma knows Virgil. Thomas knows Raquel. Eduardo knows Merle. William knows Wilma. Hannah knows Penny. Joseph knows Ariana. Which of Jessie and Penny can Thomas reach?", "answer": "Penny", "steps": [ "Thomas knows Raquel.", "Raquel knows Hannah.", "Hannah knows Penny." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Thomas", "Sheila", "Hannah", "Chandler", "Penny", "Merle", "Enrique", "Raquel", "Eloise", "Eduardo", "Yolanda", "Virgil", "Wilma", "Dina", "Jessie", "Ariana", "Dominic", "William", "Sonia", "Joseph" ], "edges": [ [ 0, 7 ], [ 2, 1 ], [ 2, 4 ], [ 3, 6 ], [ 3, 8 ], [ 4, 3 ], [ 4, 9 ], [ 7, 2 ], [ 9, 5 ], [ 10, 17 ], [ 12, 11 ], [ 12, 14 ], [ 13, 16 ], [ 13, 18 ], [ 14, 13 ], [ 14, 19 ], [ 17, 12 ], [ 19, 15 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Melody knows Adam. Gerald knows Landon. Darwin knows Evan. Gwen knows Gavin. Ariana knows Wanda. Jameson knows Tabitha. Fraser knows Ariana. Gavin knows Melody. Gavin knows Jameson. Darwin knows Omar. Darwin knows Fraser. Wendy knows Julia. Mario knows Darwin. Gavin knows Nadine. Melody knows Wendy. Adam knows Olive. Omar knows Greg. Fraser knows Gerald. Which of Wanda and Julia can Mario reach?", "answer": "Wanda", "steps": [ "Mario knows Darwin.", "Darwin knows Fraser.", "Fraser knows Ariana.", "Ariana knows Wanda." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Mario", "Ariana", "Darwin", "Landon", "Greg", "Omar", "Gerald", "Wanda", "Fraser", "Evan", "Gwen", "Wendy", "Gavin", "Olive", "Tabitha", "Jameson", "Adam", "Julia", "Melody", "Nadine" ], "edges": [ [ 0, 2 ], [ 1, 7 ], [ 2, 5 ], [ 2, 8 ], [ 2, 9 ], [ 5, 4 ], [ 6, 3 ], [ 8, 6 ], [ 8, 1 ], [ 10, 12 ], [ 11, 17 ], [ 12, 15 ], [ 12, 18 ], [ 12, 19 ], [ 15, 14 ], [ 16, 13 ], [ 18, 16 ], [ 18, 11 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Ava knows Geneva. Henry knows Christian. Percy knows Faye. Gavin knows Amanda. Earl knows Ava. Earl knows Kieran. Chad knows Gavin. Henry knows Edith. Chad knows Percy. Faye knows Selena. Edith knows Jolene. Christian knows Earl. Selena knows Sydney. Edith knows Ann. Faye knows Jameson. Ann knows Jermaine. Grover knows Jeff. Gavin knows Grover. Which of Earl and Faye can Henry reach?", "answer": "Earl", "steps": [ "Henry knows Christian.", "Christian knows Earl." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Henry", "Jolene", "Ann", "Jermaine", "Christian", "Geneva", "Ava", "Kieran", "Earl", "Edith", "Chad", "Amanda", "Grover", "Jeff", "Percy", "Sydney", "Selena", "Jameson", "Faye", "Gavin" ], "edges": [ [ 0, 4 ], [ 0, 9 ], [ 2, 3 ], [ 4, 8 ], [ 6, 5 ], [ 8, 6 ], [ 8, 7 ], [ 9, 1 ], [ 9, 2 ], [ 10, 14 ], [ 10, 19 ], [ 12, 13 ], [ 14, 18 ], [ 16, 15 ], [ 18, 16 ], [ 18, 17 ], [ 19, 11 ], [ 19, 12 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Cora knows Alder. James knows Noel. Carol knows Gonzalo. Donovan knows Cora. Gonzalo knows Tristan. Ian knows Asher. Donovan knows Phoebe. Fritz knows Dakota. Philip knows Ian. Philip knows Ernesto. Philip knows Angela. Noel knows Glenda. Asher knows Xavier. Ian knows Demetrius. Carol knows Donovan. Cora knows Fritz. James knows Philip. Donovan knows Adam. Which of Fritz and Asher can James reach?", "answer": "Asher", "steps": [ "James knows Philip.", "Philip knows Ian.", "Ian knows Asher." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "James", "Ian", "Noel", "Asher", "Ernesto", "Demetrius", "Philip", "Angela", "Glenda", "Xavier", "Carol", "Cora", "Gonzalo", "Fritz", "Phoebe", "Alder", "Donovan", "Adam", "Tristan", "Dakota" ], "edges": [ [ 0, 2 ], [ 0, 6 ], [ 1, 5 ], [ 1, 3 ], [ 2, 8 ], [ 3, 9 ], [ 6, 4 ], [ 6, 7 ], [ 6, 1 ], [ 10, 12 ], [ 10, 16 ], [ 11, 15 ], [ 11, 13 ], [ 12, 18 ], [ 13, 19 ], [ 16, 14 ], [ 16, 17 ], [ 16, 11 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Lee knows Beau. Tabitha knows Verna. Randall knows Lawrence. Randall knows Vance. Beau knows Hannah. Noel knows Randall. Aspen knows Tabitha. Tabitha knows Noel. Lawrence knows Lisa. Essie knows Hugo. Hilda knows Lee. Hilda knows Warren. Lee knows Essie. Essie knows Arthur. Noel knows Allen. Arthur knows Stephen. Ronald knows Hilda. Allen knows Troy. Which of Lisa and Stephen can Aspen reach?", "answer": "Lisa", "steps": [ "Aspen knows Tabitha.", "Tabitha knows Noel.", "Noel knows Randall.", "Randall knows Lawrence.", "Lawrence knows Lisa." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Aspen", "Randall", "Tabitha", "Lawrence", "Verna", "Lisa", "Noel", "Troy", "Allen", "Vance", "Ronald", "Essie", "Hilda", "Arthur", "Warren", "Stephen", "Lee", "Hannah", "Beau", "Hugo" ], "edges": [ [ 0, 2 ], [ 1, 3 ], [ 1, 9 ], [ 2, 4 ], [ 2, 6 ], [ 3, 5 ], [ 6, 8 ], [ 6, 1 ], [ 8, 7 ], [ 10, 12 ], [ 11, 13 ], [ 11, 19 ], [ 12, 14 ], [ 12, 16 ], [ 13, 15 ], [ 16, 18 ], [ 16, 11 ], [ 18, 17 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Ross knows Sybil. David knows Darnell. Fergus knows Roland. Stacy knows Lyle. Kelsey knows Giselle. Roland knows Richard. Hugh knows Terrence. Terrence knows Grady. Sybil knows Parsa. Sybil knows Michelle. Hugh knows Ross. Richard knows Kelsey. Parsa knows Ernest. Roland knows Derrick. Fergus knows Yara. Kelsey knows Stacy. Derrick knows Livia. David knows Hugh. Which of Kelsey and Sybil can David reach?", "answer": "Sybil", "steps": [ "David knows Hugh.", "Hugh knows Ross.", "Ross knows Sybil." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "David", "Ross", "Sybil", "Ernest", "Darnell", "Michelle", "Hugh", "Terrence", "Grady", "Parsa", "Fergus", "Richard", "Kelsey", "Lyle", "Yara", "Giselle", "Roland", "Derrick", "Livia", "Stacy" ], "edges": [ [ 0, 4 ], [ 0, 6 ], [ 1, 2 ], [ 2, 5 ], [ 2, 9 ], [ 6, 7 ], [ 6, 1 ], [ 7, 8 ], [ 9, 3 ], [ 10, 14 ], [ 10, 16 ], [ 11, 12 ], [ 12, 15 ], [ 12, 19 ], [ 16, 17 ], [ 16, 11 ], [ 17, 18 ], [ 19, 13 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Rowan knows Becky. Electra knows Mindy. Becky knows Ethan. Laura knows Ronald. Caroline knows Deanna. Caroline knows Ricardo. Max knows Henrietta. Becky knows Jane. Mindy knows Caroline. Ronald knows Chandler. Mindy knows Cameron. Rocco knows Max. Ethan knows Anita. Ethan knows Laura. Darren knows Tara. Deanna knows Bailey. Caroline knows Rocco. Ethan knows Darren. Which of Rocco and Laura can Rowan reach?", "answer": "Laura", "steps": [ "Rowan knows Becky.", "Becky knows Ethan.", "Ethan knows Laura." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Rowan", "Anita", "Darren", "Jane", "Becky", "Tara", "Laura", "Ethan", "Chandler", "Ronald", "Electra", "Ricardo", "Deanna", "Cameron", "Mindy", "Bailey", "Rocco", "Caroline", "Henrietta", "Max" ], "edges": [ [ 0, 4 ], [ 2, 5 ], [ 4, 3 ], [ 4, 7 ], [ 6, 9 ], [ 7, 1 ], [ 7, 2 ], [ 7, 6 ], [ 9, 8 ], [ 10, 14 ], [ 12, 15 ], [ 14, 13 ], [ 14, 17 ], [ 16, 19 ], [ 17, 11 ], [ 17, 12 ], [ 17, 16 ], [ 19, 18 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Crystal knows Harrison. Hugh knows Felicia. Bennett knows Emanuel. Robin knows Marc. Bennett knows Tim. Hugh knows Irving. Harrison knows Yasmin. Xavier knows Mildred. Crystal knows Robin. Xavier knows Beau. Felicia knows Irene. James knows Bennett. Jesse knows Catherine. Crystal knows James. Beau knows Jonathan. Irving knows Xavier. Tim knows Clyde. Hugh knows Jesse. Which of Bennett and Xavier can Hugh reach?", "answer": "Xavier", "steps": [ "Hugh knows Irving.", "Irving knows Xavier." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Hugh", "Felicia", "Xavier", "Jesse", "Mildred", "Catherine", "Beau", "Jonathan", "Irving", "Irene", "Crystal", "Robin", "Bennett", "Harrison", "Emanuel", "Yasmin", "Tim", "Clyde", "James", "Marc" ], "edges": [ [ 0, 3 ], [ 0, 8 ], [ 0, 1 ], [ 1, 9 ], [ 2, 4 ], [ 2, 6 ], [ 3, 5 ], [ 6, 7 ], [ 8, 2 ], [ 10, 13 ], [ 10, 18 ], [ 10, 11 ], [ 11, 19 ], [ 12, 14 ], [ 12, 16 ], [ 13, 15 ], [ 16, 17 ], [ 18, 12 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Vera knows Henrietta. Federico knows Haven. Mark knows Hannah. Fiona knows Mabel. Annie knows Mark. Fiona knows Bob. Bob knows Federico. Jolene knows Roger. Henrietta knows Fiona. Ivan knows Robin. Robin knows Annie. Mabel knows Avery. Annie knows Jolene. Hannah knows Yvette. Ivan knows Celeste. Fiona knows Marcus. Vera knows Ramona. Annie knows India. Which of Haven and Yvette can Vera reach?", "answer": "Haven", "steps": [ "Vera knows Henrietta.", "Henrietta knows Fiona.", "Fiona knows Bob.", "Bob knows Federico.", "Federico knows Haven." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Vera", "Federico", "Marcus", "Avery", "Haven", "Mabel", "Henrietta", "Fiona", "Ramona", "Bob", "Ivan", "Hannah", "India", "Roger", "Yvette", "Jolene", "Robin", "Annie", "Celeste", "Mark" ], "edges": [ [ 0, 8 ], [ 0, 6 ], [ 1, 4 ], [ 5, 3 ], [ 6, 7 ], [ 7, 2 ], [ 7, 5 ], [ 7, 9 ], [ 9, 1 ], [ 10, 18 ], [ 10, 16 ], [ 11, 14 ], [ 15, 13 ], [ 16, 17 ], [ 17, 12 ], [ 17, 15 ], [ 17, 19 ], [ 19, 11 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Ariel knows Hope. Tyler knows Fritz. Marcia knows Celia. Henry knows Jeffery. Tyler knows Mary. Tyler knows Cruz. Brandon knows Constance. Brandon knows Ariel. Mary knows Leslie. Brandon knows Alvin. Celia knows Frank. Marcia knows Ebony. Chance knows Sonia. Henry knows Pearl. Leslie knows Brandon. Frank knows Henry. Marcia knows Allison. Henry knows Chance. Which of Brandon and Henry can Tyler reach?", "answer": "Brandon", "steps": [ "Tyler knows Mary.", "Mary knows Leslie.", "Leslie knows Brandon." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Tyler", "Mary", "Constance", "Hope", "Leslie", "Cruz", "Ariel", "Fritz", "Brandon", "Alvin", "Marcia", "Celia", "Jeffery", "Sonia", "Frank", "Ebony", "Chance", "Allison", "Henry", "Pearl" ], "edges": [ [ 0, 5 ], [ 0, 7 ], [ 0, 1 ], [ 1, 4 ], [ 4, 8 ], [ 6, 3 ], [ 8, 2 ], [ 8, 6 ], [ 8, 9 ], [ 10, 15 ], [ 10, 17 ], [ 10, 11 ], [ 11, 14 ], [ 14, 18 ], [ 16, 13 ], [ 18, 12 ], [ 18, 16 ], [ 18, 19 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Iris knows Gene. Harriet knows Kevin. Eric knows Larissa. Byron knows Rocco. Emmett knows Jarvis. Lambert knows Lewis. Harriet knows Geoffrey. Lewis knows Byron. Iris knows Rosa. Desmond knows Lambert. Emmett knows Harriet. Byron knows Bella. Desmond knows Isadora. Florence knows Desmond. Lambert knows Lorenzo. Kevin knows Iris. Eric knows Emmett. Florence knows Chance. Which of Kevin and Lewis can Florence reach?", "answer": "Lewis", "steps": [ "Florence knows Desmond.", "Desmond knows Lambert.", "Lambert knows Lewis." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Florence", "Lewis", "Chance", "Lorenzo", "Rocco", "Lambert", "Bella", "Byron", "Desmond", "Isadora", "Eric", "Kevin", "Larissa", "Geoffrey", "Gene", "Harriet", "Rosa", "Iris", "Emmett", "Jarvis" ], "edges": [ [ 0, 2 ], [ 0, 8 ], [ 1, 7 ], [ 5, 3 ], [ 5, 1 ], [ 7, 4 ], [ 7, 6 ], [ 8, 5 ], [ 8, 9 ], [ 10, 12 ], [ 10, 18 ], [ 11, 17 ], [ 15, 13 ], [ 15, 11 ], [ 17, 14 ], [ 17, 16 ], [ 18, 15 ], [ 18, 19 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Trevor knows Lewis. Elodie knows Alfonso. Peggy knows Beth. Emery knows Pauline. Beth knows Landon. Alfonso knows Barney. Bert knows Arden. Emery knows Aubrey. Gail knows Peggy. Landon knows Lark. Alfonso knows Magdalena. Barney knows Trevor. Trevor knows Houston. Emery knows Gail. Houston knows Bert. Alfonso knows Mindy. Hannah knows Emery. Peggy knows Graham. Which of Lark and Arden can Elodie reach?", "answer": "Arden", "steps": [ "Elodie knows Alfonso.", "Alfonso knows Barney.", "Barney knows Trevor.", "Trevor knows Houston.", "Houston knows Bert.", "Bert knows Arden." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Elodie", "Lewis", "Houston", "Mindy", "Alfonso", "Trevor", "Bert", "Magdalena", "Arden", "Barney", "Hannah", "Graham", "Beth", "Pauline", "Emery", "Peggy", "Landon", "Aubrey", "Lark", "Gail" ], "edges": [ [ 0, 4 ], [ 2, 6 ], [ 4, 3 ], [ 4, 7 ], [ 4, 9 ], [ 5, 1 ], [ 5, 2 ], [ 6, 8 ], [ 9, 5 ], [ 10, 14 ], [ 12, 16 ], [ 14, 13 ], [ 14, 17 ], [ 14, 19 ], [ 15, 11 ], [ 15, 12 ], [ 16, 18 ], [ 19, 15 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Chase knows Electra. Susanne knows Roger. Felicia knows Chase. Miriam knows Gareth. Roman knows Hannah. Yolanda knows Susanne. Kay knows Bob. Roger knows Carl. Felicia knows Lacey. Laverne knows Felicia. Kay knows Blanche. Roger knows Kay. Hannah knows Yolanda. Roger knows Jeff. Heather knows Laverne. Felicia knows Ruby. Gareth knows Heather. Chase knows Ada. Which of Heather and Yolanda can Roman reach?", "answer": "Yolanda", "steps": [ "Roman knows Hannah.", "Hannah knows Yolanda." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Roman", "Bob", "Kay", "Carl", "Blanche", "Yolanda", "Roger", "Jeff", "Susanne", "Hannah", "Miriam", "Electra", "Chase", "Lacey", "Ada", "Heather", "Felicia", "Ruby", "Laverne", "Gareth" ], "edges": [ [ 0, 9 ], [ 2, 1 ], [ 2, 4 ], [ 5, 8 ], [ 6, 3 ], [ 6, 2 ], [ 6, 7 ], [ 8, 6 ], [ 9, 5 ], [ 10, 19 ], [ 12, 11 ], [ 12, 14 ], [ 15, 18 ], [ 16, 13 ], [ 16, 12 ], [ 16, 17 ], [ 18, 16 ], [ 19, 15 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Ellen knows Jenna. Essie knows Sybil. Lynn knows Todd. Leopold knows Hugh. Todd knows Dina. Emery knows Ellen. Emery knows Luke. Milton knows Essie. Joan knows Milton. Shelby knows Joan. Milton knows Leopold. Joan knows Travis. Todd knows Fern. Shelby knows Lois. Ellen knows Lynn. Essie knows Pearl. Rufus knows Garrison. Lynn knows Rufus. Which of Ellen and Joan can Shelby reach?", "answer": "Joan", "steps": [ "Shelby knows Joan." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Shelby", "Hugh", "Milton", "Joan", "Travis", "Sybil", "Pearl", "Lois", "Essie", "Leopold", "Emery", "Garrison", "Lynn", "Ellen", "Jenna", "Fern", "Dina", "Luke", "Todd", "Rufus" ], "edges": [ [ 0, 7 ], [ 0, 3 ], [ 2, 8 ], [ 2, 9 ], [ 3, 4 ], [ 3, 2 ], [ 8, 5 ], [ 8, 6 ], [ 9, 1 ], [ 10, 17 ], [ 10, 13 ], [ 12, 18 ], [ 12, 19 ], [ 13, 14 ], [ 13, 12 ], [ 18, 15 ], [ 18, 16 ], [ 19, 11 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Vivian knows Natalie. Veronica knows Mitchell. Katrina knows Zack. Dalton knows Miranda. Zoe knows Inez. Mitchell knows Jewel. Fred knows Patrick. Vivian knows Katrina. Zack knows Harmony. Shelly knows Vivian. Jessica knows Zoe. Mitchell knows Robin. Jessica knows Bernard. Inez knows Fred. Miranda knows Shelly. Fred knows Veronica. Zack knows Clarence. Dalton knows Dora. Which of Zack and Mitchell can Dalton reach?", "answer": "Zack", "steps": [ "Dalton knows Miranda.", "Miranda knows Shelly.", "Shelly knows Vivian.", "Vivian knows Katrina.", "Katrina knows Zack." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Dalton", "Katrina", "Miranda", "Clarence", "Dora", "Zack", "Harmony", "Vivian", "Shelly", "Natalie", "Jessica", "Veronica", "Zoe", "Jewel", "Bernard", "Mitchell", "Robin", "Fred", "Inez", "Patrick" ], "edges": [ [ 0, 4 ], [ 0, 2 ], [ 1, 5 ], [ 2, 8 ], [ 5, 3 ], [ 5, 6 ], [ 7, 1 ], [ 7, 9 ], [ 8, 7 ], [ 10, 14 ], [ 10, 12 ], [ 11, 15 ], [ 12, 18 ], [ 15, 13 ], [ 15, 16 ], [ 17, 11 ], [ 17, 19 ], [ 18, 17 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Omar knows Floyd. Karl knows Lucia. Floyd knows Arden. Troy knows Kurt. Natalie knows Jana. Natalie knows Jared. Zack knows Louisa. Adelaide knows Casey. Victoria knows Earl. Floyd knows Julian. Lucia knows Dawn. Kevin knows Karl. Adelaide knows Zack. Omar knows Adelaide. Earl knows Logan. Casey knows Troy. Kevin knows Natalie. Karl knows Victoria. Which of Adelaide and Karl can Kevin reach?", "answer": "Karl", "steps": [ "Kevin knows Karl." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Kevin", "Jared", "Natalie", "Lucia", "Logan", "Victoria", "Jana", "Dawn", "Karl", "Earl", "Omar", "Julian", "Floyd", "Zack", "Kurt", "Casey", "Arden", "Louisa", "Adelaide", "Troy" ], "edges": [ [ 0, 2 ], [ 0, 8 ], [ 2, 1 ], [ 2, 6 ], [ 3, 7 ], [ 5, 9 ], [ 8, 3 ], [ 8, 5 ], [ 9, 4 ], [ 10, 12 ], [ 10, 18 ], [ 12, 11 ], [ 12, 16 ], [ 13, 17 ], [ 15, 19 ], [ 18, 13 ], [ 18, 15 ], [ 19, 14 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Fern knows Alma. Constance knows Sarah. Alma knows Ryan. Mack knows Fern. Alex knows Lisa. Steve knows Estelle. Estelle knows Alex. Jules knows Mack. Alex knows Constance. Steve knows Lisette. Ryan knows Sheila. Ryan knows Jolene. Haley knows Steve. Mack knows Chantal. Mack knows Wilbur. Constance knows Jewel. Steve knows Enid. Alma knows Bernard. Which of Fern and Estelle can Haley reach?", "answer": "Estelle", "steps": [ "Haley knows Steve.", "Steve knows Estelle." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Haley", "Sarah", "Constance", "Jewel", "Steve", "Alex", "Enid", "Lisa", "Lisette", "Estelle", "Jules", "Jolene", "Ryan", "Sheila", "Mack", "Alma", "Wilbur", "Bernard", "Chantal", "Fern" ], "edges": [ [ 0, 4 ], [ 2, 1 ], [ 2, 3 ], [ 4, 6 ], [ 4, 8 ], [ 4, 9 ], [ 5, 2 ], [ 5, 7 ], [ 9, 5 ], [ 10, 14 ], [ 12, 11 ], [ 12, 13 ], [ 14, 16 ], [ 14, 18 ], [ 14, 19 ], [ 15, 12 ], [ 15, 17 ], [ 19, 15 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Crystal knows Victor. Guillermo knows Luella. Bette knows Jewel. Renee knows Darcy. Val knows Guillermo. Darcy knows Perry. Martha knows Val. Rhonda knows Catherine. Luella knows Leah. Catherine knows Lucy. Catherine knows Autumn. Victor knows Alfonso. Lucy knows Martin. Martha knows Cruz. Martin knows Bette. Graeme knows Martha. Renee knows Graeme. Crystal knows Rhonda. Which of Graeme and Rhonda can Crystal reach?", "answer": "Rhonda", "steps": [ "Crystal knows Rhonda." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Crystal", "Rhonda", "Martin", "Bette", "Victor", "Lucy", "Jewel", "Catherine", "Autumn", "Alfonso", "Renee", "Graeme", "Guillermo", "Luella", "Darcy", "Val", "Leah", "Martha", "Cruz", "Perry" ], "edges": [ [ 0, 1 ], [ 0, 4 ], [ 1, 7 ], [ 2, 3 ], [ 3, 6 ], [ 4, 9 ], [ 5, 2 ], [ 7, 5 ], [ 7, 8 ], [ 10, 11 ], [ 10, 14 ], [ 11, 17 ], [ 12, 13 ], [ 13, 16 ], [ 14, 19 ], [ 15, 12 ], [ 17, 15 ], [ 17, 18 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Heath knows Aaron. Kristin knows Arden. Pablo knows Beau. Sierra knows Gonzalo. Bailey knows Gilbert. Gilbert knows Judy. Gonzalo knows Heath. Beau knows Bailey. Jessie knows Kristin. Melody knows Peggy. Peggy knows Lois. Beau knows Ernesto. Kristin knows Cornelius. Aaron knows Declan. Sierra knows Stella. Gilbert knows Cara. Cara knows Melody. Arden knows Sierra. Which of Aaron and Peggy can Jessie reach?", "answer": "Aaron", "steps": [ "Jessie knows Kristin.", "Kristin knows Arden.", "Arden knows Sierra.", "Sierra knows Gonzalo.", "Gonzalo knows Heath.", "Heath knows Aaron." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Jessie", "Cornelius", "Aaron", "Heath", "Gonzalo", "Stella", "Arden", "Kristin", "Sierra", "Declan", "Pablo", "Ernesto", "Peggy", "Melody", "Cara", "Judy", "Bailey", "Beau", "Gilbert", "Lois" ], "edges": [ [ 0, 7 ], [ 2, 9 ], [ 3, 2 ], [ 4, 3 ], [ 6, 8 ], [ 7, 1 ], [ 7, 6 ], [ 8, 5 ], [ 8, 4 ], [ 10, 17 ], [ 12, 19 ], [ 13, 12 ], [ 14, 13 ], [ 16, 18 ], [ 17, 11 ], [ 17, 16 ], [ 18, 15 ], [ 18, 14 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Marie knows Patrick. Mabel knows Donald. Clyde knows Marie. Carmen knows Mabel. Allison knows Carmen. Harmony knows Allison. Harriet knows Giselle. Kara knows Harriet. Yvette knows Kara. Kara knows Dawn. Carmen knows Keaton. Evan knows Yvette. Sierra knows Harmony. Harriet knows Clyde. Carmen knows Kamila. Allison knows Jill. Donald knows Jillian. Harriet knows Derrick. Which of Jillian and Patrick can Sierra reach?", "answer": "Jillian", "steps": [ "Sierra knows Harmony.", "Harmony knows Allison.", "Allison knows Carmen.", "Carmen knows Mabel.", "Mabel knows Donald.", "Donald knows Jillian." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Sierra", "Keaton", "Donald", "Jill", "Mabel", "Carmen", "Kamila", "Allison", "Jillian", "Harmony", "Evan", "Giselle", "Marie", "Dawn", "Clyde", "Harriet", "Derrick", "Kara", "Patrick", "Yvette" ], "edges": [ [ 0, 9 ], [ 2, 8 ], [ 4, 2 ], [ 5, 1 ], [ 5, 6 ], [ 5, 4 ], [ 7, 3 ], [ 7, 5 ], [ 9, 7 ], [ 10, 19 ], [ 12, 18 ], [ 14, 12 ], [ 15, 11 ], [ 15, 16 ], [ 15, 14 ], [ 17, 13 ], [ 17, 15 ], [ 19, 17 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Cruz knows Shelby. Shelby knows Kit. Jake knows Jerome. Jake knows Nina. Wade knows Sue. Shelby knows Nancy. Sue knows Jake. Sue knows Jermaine. Lyric knows Gladys. Percy knows Eamon. Jermaine knows Lyric. Rex knows Eunice. Rex knows Kane. Eamon knows Gloria. Gloria knows Cruz. Juan knows Wade. Gloria knows Rex. Lyric knows Antonio. Which of Gloria and Sue can Juan reach?", "answer": "Sue", "steps": [ "Juan knows Wade.", "Wade knows Sue." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Juan", "Jake", "Jermaine", "Lyric", "Wade", "Nina", "Jerome", "Sue", "Gladys", "Antonio", "Percy", "Rex", "Cruz", "Shelby", "Eamon", "Kane", "Eunice", "Gloria", "Kit", "Nancy" ], "edges": [ [ 0, 4 ], [ 1, 5 ], [ 1, 6 ], [ 2, 3 ], [ 3, 8 ], [ 3, 9 ], [ 4, 7 ], [ 7, 1 ], [ 7, 2 ], [ 10, 14 ], [ 11, 15 ], [ 11, 16 ], [ 12, 13 ], [ 13, 18 ], [ 13, 19 ], [ 14, 17 ], [ 17, 11 ], [ 17, 12 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Kirk knows Nora. Isla knows Vanessa. Isla knows Florence. Isla knows Sylvia. Lilia knows Ramona. Xander knows Enrique. Florence knows Darnell. Uma knows Lilia. Ramona knows Vera. Dora knows Hattie. Melody knows Kirk. Kirk knows Xander. Jeremiah knows Dora. Darnell knows Foster. Enrique knows Donna. Kirk knows Gerald. Uma knows Isla. Melody knows Jeremiah. Which of Kirk and Isla can Uma reach?", "answer": "Isla", "steps": [ "Uma knows Isla." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Uma", "Ramona", "Florence", "Lilia", "Vera", "Sylvia", "Foster", "Vanessa", "Isla", "Darnell", "Melody", "Dora", "Xander", "Jeremiah", "Hattie", "Nora", "Donna", "Gerald", "Kirk", "Enrique" ], "edges": [ [ 0, 3 ], [ 0, 8 ], [ 1, 4 ], [ 2, 9 ], [ 3, 1 ], [ 8, 5 ], [ 8, 7 ], [ 8, 2 ], [ 9, 6 ], [ 10, 13 ], [ 10, 18 ], [ 11, 14 ], [ 12, 19 ], [ 13, 11 ], [ 18, 15 ], [ 18, 17 ], [ 18, 12 ], [ 19, 16 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Leander knows Harlan. Wilson knows Hal. Sally knows Flora. Flora knows Barbara. Chloe knows Janet. Atlas knows Vernon. Chloe knows Nina. Nina knows Dexter. Eva knows Leander. Wilson knows Sally. Wilson knows Vicki. Barbara knows Courtney. Dexter knows Clark. Clark knows Eva. Sally knows Giselle. Courtney knows Atlas. Nina knows Paige. Chloe knows Irving. Which of Barbara and Clark can Wilson reach?", "answer": "Barbara", "steps": [ "Wilson knows Sally.", "Sally knows Flora.", "Flora knows Barbara." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Wilson", "Hal", "Sally", "Giselle", "Vernon", "Barbara", "Atlas", "Vicki", "Courtney", "Flora", "Chloe", "Irving", "Nina", "Paige", "Harlan", "Clark", "Leander", "Janet", "Eva", "Dexter" ], "edges": [ [ 0, 1 ], [ 0, 7 ], [ 0, 2 ], [ 2, 3 ], [ 2, 9 ], [ 5, 8 ], [ 6, 4 ], [ 8, 6 ], [ 9, 5 ], [ 10, 11 ], [ 10, 17 ], [ 10, 12 ], [ 12, 13 ], [ 12, 19 ], [ 15, 18 ], [ 16, 14 ], [ 18, 16 ], [ 19, 15 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Duncan knows Clarence. Hector knows Kenneth. Clarence knows Holly. Elton knows Essie. Holly knows Florence. Conner knows Rufus. Chase knows Heather. Peggy knows Layla. Jermaine knows Chase. Dudley knows Duncan. Essie knows Megan. Duncan knows Tamara. Rufus knows Peggy. Florence knows Jermaine. Kenneth knows Elton. Randy knows Hector. Rufus knows Randy. Tamara knows Alyssa. Which of Duncan and Rufus can Dudley reach?", "answer": "Duncan", "steps": [ "Dudley knows Duncan." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Dudley", "Chase", "Alyssa", "Tamara", "Florence", "Holly", "Clarence", "Heather", "Duncan", "Jermaine", "Conner", "Essie", "Layla", "Peggy", "Kenneth", "Hector", "Randy", "Megan", "Rufus", "Elton" ], "edges": [ [ 0, 8 ], [ 1, 7 ], [ 3, 2 ], [ 4, 9 ], [ 5, 4 ], [ 6, 5 ], [ 8, 3 ], [ 8, 6 ], [ 9, 1 ], [ 10, 18 ], [ 11, 17 ], [ 13, 12 ], [ 14, 19 ], [ 15, 14 ], [ 16, 15 ], [ 18, 13 ], [ 18, 16 ], [ 19, 11 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Haven knows Dylan. Arthur knows Declan. Madeline knows Julian. Arthur knows Bill. Tonya knows Erica. Elsa knows Gerald. Haven knows Fred. Erica knows Madeline. Gonzalo knows Rhonda. Gonzalo knows Tanya. Gerald knows Ramon. Dylan knows Elsa. Martha knows Lottie. Lottie knows Edmund. Fred knows Gonzalo. Lottie knows Tonya. Clay knows Haven. Edmund knows Arthur. Which of Madeline and Gerald can Martha reach?", "answer": "Madeline", "steps": [ "Martha knows Lottie.", "Lottie knows Tonya.", "Tonya knows Erica.", "Erica knows Madeline." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Martha", "Erica", "Declan", "Tonya", "Arthur", "Julian", "Lottie", "Edmund", "Madeline", "Bill", "Clay", "Elsa", "Rhonda", "Dylan", "Gonzalo", "Ramon", "Haven", "Fred", "Gerald", "Tanya" ], "edges": [ [ 0, 6 ], [ 1, 8 ], [ 3, 1 ], [ 4, 2 ], [ 4, 9 ], [ 6, 3 ], [ 6, 7 ], [ 7, 4 ], [ 8, 5 ], [ 10, 16 ], [ 11, 18 ], [ 13, 11 ], [ 14, 12 ], [ 14, 19 ], [ 16, 13 ], [ 16, 17 ], [ 17, 14 ], [ 18, 15 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Lucia knows Melody. Celia knows Willard. Melody knows Kareem. Eunice knows Edmund. Jeff knows Winston. Eunice knows Marilyn. Eunice knows Conrad. Cordelia knows Celia. Conrad knows Lucia. Kareem knows Alex. Malcolm knows Chance. Winston knows Charlotte. Edmund knows Malcolm. Leah knows Jeff. Judy knows Cordelia. Willard knows Arden. Leah knows Marcus. Leah knows Judy. Which of Kareem and Willard can Leah reach?", "answer": "Willard", "steps": [ "Leah knows Judy.", "Judy knows Cordelia.", "Cordelia knows Celia.", "Celia knows Willard." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Leah", "Jeff", "Winston", "Charlotte", "Marcus", "Judy", "Willard", "Cordelia", "Arden", "Celia", "Eunice", "Edmund", "Malcolm", "Chance", "Marilyn", "Conrad", "Kareem", "Lucia", "Alex", "Melody" ], "edges": [ [ 0, 1 ], [ 0, 4 ], [ 0, 5 ], [ 1, 2 ], [ 2, 3 ], [ 5, 7 ], [ 6, 8 ], [ 7, 9 ], [ 9, 6 ], [ 10, 11 ], [ 10, 14 ], [ 10, 15 ], [ 11, 12 ], [ 12, 13 ], [ 15, 17 ], [ 16, 18 ], [ 17, 19 ], [ 19, 16 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Sidney knows Willis. Fanny knows Lloyd. Chester knows Sidney. Harold knows Harry. Lloyd knows Chester. Willis knows Yolanda. Harold knows Luella. Laverne knows Anton. Wendell knows Harold. Willis knows Betty. Sidney knows Callum. Wendell knows Alison. Chester knows Sandra. Lloyd knows Etta. Anton knows Griffith. Anton knows Curtis. Griffith knows Wendell. Griffith knows Finn. Which of Lloyd and Anton can Fanny reach?", "answer": "Lloyd", "steps": [ "Fanny knows Lloyd." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Fanny", "Callum", "Willis", "Etta", "Yolanda", "Chester", "Betty", "Lloyd", "Sandra", "Sidney", "Laverne", "Alison", "Harold", "Curtis", "Luella", "Griffith", "Harry", "Anton", "Finn", "Wendell" ], "edges": [ [ 0, 7 ], [ 2, 4 ], [ 2, 6 ], [ 5, 8 ], [ 5, 9 ], [ 7, 3 ], [ 7, 5 ], [ 9, 1 ], [ 9, 2 ], [ 10, 17 ], [ 12, 14 ], [ 12, 16 ], [ 15, 18 ], [ 15, 19 ], [ 17, 13 ], [ 17, 15 ], [ 19, 11 ], [ 19, 12 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Hugh knows Amy. Virginia knows Claudia. Max knows Homer. Homer knows Pat. Claudia knows Stephen. Ella knows Hugh. Amy knows Lily. Kit knows William. Edison knows Allan. Max knows Randall. Randall knows Edison. Claudia knows Ella. Lily knows Bernice. Kit knows Hannah. Maria knows Kit. Bob knows Holden. Hugh knows Bob. Hannah knows Max. Which of Ella and Hannah can Virginia reach?", "answer": "Ella", "steps": [ "Virginia knows Claudia.", "Claudia knows Ella." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Virginia", "Ella", "Claudia", "Amy", "Holden", "Bernice", "Hugh", "Bob", "Stephen", "Lily", "Maria", "Hannah", "Kit", "Randall", "Pat", "Allan", "Max", "Homer", "William", "Edison" ], "edges": [ [ 0, 2 ], [ 1, 6 ], [ 2, 8 ], [ 2, 1 ], [ 3, 9 ], [ 6, 7 ], [ 6, 3 ], [ 7, 4 ], [ 9, 5 ], [ 10, 12 ], [ 11, 16 ], [ 12, 18 ], [ 12, 11 ], [ 13, 19 ], [ 16, 17 ], [ 16, 13 ], [ 17, 14 ], [ 19, 15 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Kane knows Luz. Skyler knows Clay. Luz knows Lana. Clay knows Parsa. Parsa knows Nash. Marc knows Selena. Parsa knows Kendra. Hendrix knows Graeme. Yolanda knows Dina. Parsa knows Hudson. Skyler knows Norma. Skyler knows Elvira. Eden knows Marc. Nash knows Hendrix. Marc knows Kane. Yolanda knows Dudley. Yolanda knows Eden. Marc knows Elaine. Which of Nash and Kane can Skyler reach?", "answer": "Nash", "steps": [ "Skyler knows Clay.", "Clay knows Parsa.", "Parsa knows Nash." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Skyler", "Elvira", "Parsa", "Hendrix", "Clay", "Norma", "Hudson", "Graeme", "Kendra", "Nash", "Yolanda", "Dudley", "Marc", "Luz", "Eden", "Dina", "Elaine", "Lana", "Selena", "Kane" ], "edges": [ [ 0, 1 ], [ 0, 5 ], [ 0, 4 ], [ 2, 6 ], [ 2, 8 ], [ 2, 9 ], [ 3, 7 ], [ 4, 2 ], [ 9, 3 ], [ 10, 11 ], [ 10, 15 ], [ 10, 14 ], [ 12, 16 ], [ 12, 18 ], [ 12, 19 ], [ 13, 17 ], [ 14, 12 ], [ 19, 13 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Lisa knows Ruby. Marshall knows Iris. Barney knows Marshall. Ruby knows Aisha. Connor knows Shane. Eamon knows Denise. Marshall knows Justine. Shane knows Andre. Eugene knows Barney. Emily knows Kelsey. Justine knows Eamon. Ruby knows Emily. Holly knows Leland. Andre knows Camden. Willis knows Eugene. Aisha knows Connor. Eugene knows Holly. Connor knows Marcia. Which of Marshall and Connor can Willis reach?", "answer": "Marshall", "steps": [ "Willis knows Eugene.", "Eugene knows Barney.", "Barney knows Marshall." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Willis", "Denise", "Justine", "Barney", "Eamon", "Holly", "Iris", "Marshall", "Eugene", "Leland", "Lisa", "Camden", "Shane", "Aisha", "Andre", "Emily", "Marcia", "Connor", "Ruby", "Kelsey" ], "edges": [ [ 0, 8 ], [ 2, 4 ], [ 3, 7 ], [ 4, 1 ], [ 5, 9 ], [ 7, 2 ], [ 7, 6 ], [ 8, 3 ], [ 8, 5 ], [ 10, 18 ], [ 12, 14 ], [ 13, 17 ], [ 14, 11 ], [ 15, 19 ], [ 17, 12 ], [ 17, 16 ], [ 18, 13 ], [ 18, 15 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Stacy knows Eden. Jasmine knows Morris. Christopher knows Lisette. Heather knows Louisa. Dylan knows Heather. Evan knows Sheila. Stacy knows Joaquin. Leopold knows Jasmine. Joaquin knows Stephen. Dylan knows Ella. Christopher knows Stacy. Heather knows Duke. Marian knows Evan. Louisa knows Marvin. Louisa knows Colin. Joaquin knows Edison. Edison knows Marian. Colin knows Leopold. Which of Sheila and Morris can Christopher reach?", "answer": "Sheila", "steps": [ "Christopher knows Stacy.", "Stacy knows Joaquin.", "Joaquin knows Edison.", "Edison knows Marian.", "Marian knows Evan.", "Evan knows Sheila." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Christopher", "Stacy", "Sheila", "Joaquin", "Edison", "Marian", "Lisette", "Eden", "Evan", "Stephen", "Dylan", "Heather", "Morris", "Louisa", "Colin", "Leopold", "Ella", "Duke", "Jasmine", "Marvin" ], "edges": [ [ 0, 6 ], [ 0, 1 ], [ 1, 7 ], [ 1, 3 ], [ 3, 4 ], [ 3, 9 ], [ 4, 5 ], [ 5, 8 ], [ 8, 2 ], [ 10, 16 ], [ 10, 11 ], [ 11, 17 ], [ 11, 13 ], [ 13, 14 ], [ 13, 19 ], [ 14, 15 ], [ 15, 18 ], [ 18, 12 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Amelia knows Pearl. Amelia knows Chloe. Chloe knows Aisha. Dustin knows Olivia. Lacey knows Dustin. Walt knows Paul. Theodore knows Esme. Walt knows Inez. Aisha knows Clifford. Aisha knows Dakota. Aisha knows Fleur. Ken knows Clayton. Olivia knows Walt. Dakota knows Theodore. Trudy knows Amelia. Grady knows Ken. Dustin knows Val. Walt knows Grady. Which of Aisha and Walt can Lacey reach?", "answer": "Walt", "steps": [ "Lacey knows Dustin.", "Dustin knows Olivia.", "Olivia knows Walt." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Lacey", "Inez", "Olivia", "Walt", "Val", "Ken", "Clayton", "Grady", "Dustin", "Paul", "Trudy", "Fleur", "Chloe", "Aisha", "Pearl", "Theodore", "Esme", "Dakota", "Amelia", "Clifford" ], "edges": [ [ 0, 8 ], [ 2, 3 ], [ 3, 1 ], [ 3, 7 ], [ 3, 9 ], [ 5, 6 ], [ 7, 5 ], [ 8, 4 ], [ 8, 2 ], [ 10, 18 ], [ 12, 13 ], [ 13, 11 ], [ 13, 17 ], [ 13, 19 ], [ 15, 16 ], [ 17, 15 ], [ 18, 14 ], [ 18, 12 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Hadley knows Lyric. Evelyn knows Catherine. Hadley knows Oscar. Griffith knows Deanna. Harrison knows Zach. Riley knows Elaine. Rebecca knows Harrison. Deanna knows Riley. Anita knows Zane. Margaret knows Anita. Anita knows Griffith. Riley knows Keith. Riley knows Evelyn. Lyric knows Odette. Zach knows Jeanne. Harrison knows Jorge. Hadley knows Basil. Jeanne knows Hadley. Which of Riley and Hadley can Rebecca reach?", "answer": "Hadley", "steps": [ "Rebecca knows Harrison.", "Harrison knows Zach.", "Zach knows Jeanne.", "Jeanne knows Hadley." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Rebecca", "Harrison", "Basil", "Jeanne", "Oscar", "Odette", "Lyric", "Zach", "Jorge", "Hadley", "Margaret", "Anita", "Elaine", "Deanna", "Keith", "Catherine", "Evelyn", "Griffith", "Zane", "Riley" ], "edges": [ [ 0, 1 ], [ 1, 8 ], [ 1, 7 ], [ 3, 9 ], [ 6, 5 ], [ 7, 3 ], [ 9, 2 ], [ 9, 4 ], [ 9, 6 ], [ 10, 11 ], [ 11, 18 ], [ 11, 17 ], [ 13, 19 ], [ 16, 15 ], [ 17, 13 ], [ 19, 12 ], [ 19, 14 ], [ 19, 16 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Leo knows Clinton. Fletcher knows Cornelius. Fletcher knows Karla. Roy knows Fletcher. Fletcher knows Zara. Neal knows Colin. Zara knows Michelle. Selena knows Leo. Daniella knows Omar. Neal knows Luella. Luella knows Ralph. Gustavo knows Evan. Leo knows Daniella. Fletcher knows Inez. Leo knows Neal. Karla knows Marcus. Karla knows Gustavo. Leo knows Jacqueline. Which of Leo and Fletcher can Selena reach?", "answer": "Leo", "steps": [ "Selena knows Leo." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Selena", "Luella", "Neal", "Daniella", "Jacqueline", "Ralph", "Omar", "Colin", "Leo", "Clinton", "Roy", "Gustavo", "Karla", "Zara", "Inez", "Evan", "Michelle", "Marcus", "Fletcher", "Cornelius" ], "edges": [ [ 0, 8 ], [ 1, 5 ], [ 2, 1 ], [ 2, 7 ], [ 3, 6 ], [ 8, 4 ], [ 8, 3 ], [ 8, 2 ], [ 8, 9 ], [ 10, 18 ], [ 11, 15 ], [ 12, 11 ], [ 12, 17 ], [ 13, 16 ], [ 18, 14 ], [ 18, 13 ], [ 18, 12 ], [ 18, 19 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Bennett knows Jeff. Aspen knows Israel. Aspen knows Gerald. Israel knows Everett. Jeff knows Della. Leland knows Saul. Leland knows Geoffrey. Grace knows Zane. Dora knows Bennett. Saul knows Lara. Geoffrey knows Gordon. Reid knows Dora. Yvette knows Fabian. Saul knows Malik. Malik knows Yvette. Everett knows Cesar. Zane knows Leland. Bennett knows Aspen. Which of Saul and Aspen can Reid reach?", "answer": "Aspen", "steps": [ "Reid knows Dora.", "Dora knows Bennett.", "Bennett knows Aspen." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Reid", "Jeff", "Gerald", "Aspen", "Israel", "Della", "Bennett", "Cesar", "Dora", "Everett", "Grace", "Geoffrey", "Lara", "Saul", "Malik", "Gordon", "Leland", "Fabian", "Zane", "Yvette" ], "edges": [ [ 0, 8 ], [ 1, 5 ], [ 3, 2 ], [ 3, 4 ], [ 4, 9 ], [ 6, 1 ], [ 6, 3 ], [ 8, 6 ], [ 9, 7 ], [ 10, 18 ], [ 11, 15 ], [ 13, 12 ], [ 13, 14 ], [ 14, 19 ], [ 16, 11 ], [ 16, 13 ], [ 18, 16 ], [ 19, 17 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Gina knows Philip. Cora knows Rhonda. Bart knows Rebecca. Elaine knows Gina. Douglas knows Bart. Tom knows Ted. Randall knows Byron. Philip knows Aspen. Ted knows Elaine. Holden knows Claude. Aspen knows Trevor. Rebecca knows Ivy. Kane knows Tom. Rhonda knows Samantha. Claude knows Kane. Ivy knows Horace. Horace knows Cora. Samantha knows Randall. Which of Bart and Claude can Douglas reach?", "answer": "Bart", "steps": [ "Douglas knows Bart." ], "difficulty": 1, "original_distance": 9, "idx_to_symbol": [ "Douglas", "Bart", "Randall", "Cora", "Ivy", "Rhonda", "Byron", "Rebecca", "Samantha", "Horace", "Holden", "Claude", "Aspen", "Elaine", "Tom", "Gina", "Trevor", "Kane", "Philip", "Ted" ], "edges": [ [ 0, 1 ], [ 1, 7 ], [ 2, 6 ], [ 3, 5 ], [ 4, 9 ], [ 5, 8 ], [ 7, 4 ], [ 8, 2 ], [ 9, 3 ], [ 10, 11 ], [ 11, 17 ], [ 12, 16 ], [ 13, 15 ], [ 14, 19 ], [ 15, 18 ], [ 17, 14 ], [ 18, 12 ], [ 19, 13 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Cordelia knows Tamara. Vivian knows Adelaide. Willis knows Andre. Willis knows Maude. Donovan knows Willis. Kai knows Basil. Kai knows Cordelia. Cordelia knows Percy. Adelaide knows Darin. Donovan knows Abel. Basil knows Ariana. Tamara knows Mindy. Elsa knows Camille. Christian knows Vivian. Vivian knows Clarence. Elsa knows Angela. Basil knows Elsa. Christian knows Donovan. Which of Cordelia and Vivian can Kai reach?", "answer": "Cordelia", "steps": [ "Kai knows Cordelia." ], "difficulty": 1, "original_distance": 3, "idx_to_symbol": [ "Kai", "Tamara", "Mindy", "Elsa", "Basil", "Percy", "Camille", "Angela", "Ariana", "Cordelia", "Christian", "Adelaide", "Darin", "Willis", "Donovan", "Clarence", "Andre", "Maude", "Abel", "Vivian" ], "edges": [ [ 0, 4 ], [ 0, 9 ], [ 1, 2 ], [ 3, 6 ], [ 3, 7 ], [ 4, 3 ], [ 4, 8 ], [ 9, 1 ], [ 9, 5 ], [ 10, 14 ], [ 10, 19 ], [ 11, 12 ], [ 13, 16 ], [ 13, 17 ], [ 14, 13 ], [ 14, 18 ], [ 19, 11 ], [ 19, 15 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Melanie knows Kara. Finn knows Brody. Grover knows Henrietta. Grover knows Ron. Glen knows Nicole. Grover knows Chelsea. Will knows Sam. Parker knows Alexa. Dolores knows Freya. Glen knows Finn. Gustavo knows Irma. Will knows Henry. Carmen knows Gustavo. Will knows Carmen. Ron knows Glen. Sam knows Dolores. Gustavo knows Parker. Chelsea knows Melanie. Which of Carmen and Ron can Will reach?", "answer": "Carmen", "steps": [ "Will knows Carmen." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Will", "Alexa", "Carmen", "Irma", "Dolores", "Freya", "Henry", "Gustavo", "Parker", "Sam", "Grover", "Brody", "Ron", "Nicole", "Melanie", "Kara", "Henrietta", "Glen", "Finn", "Chelsea" ], "edges": [ [ 0, 6 ], [ 0, 2 ], [ 0, 9 ], [ 2, 7 ], [ 4, 5 ], [ 7, 3 ], [ 7, 8 ], [ 8, 1 ], [ 9, 4 ], [ 10, 16 ], [ 10, 12 ], [ 10, 19 ], [ 12, 17 ], [ 14, 15 ], [ 17, 13 ], [ 17, 18 ], [ 18, 11 ], [ 19, 14 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Leo knows Clinton. Fletcher knows Cornelius. Fletcher knows Karla. Roy knows Fletcher. Fletcher knows Zara. Neal knows Colin. Zara knows Michelle. Selena knows Leo. Daniella knows Omar. Neal knows Luella. Luella knows Ralph. Gustavo knows Evan. Leo knows Daniella. Fletcher knows Inez. Leo knows Neal. Karla knows Marcus. Karla knows Gustavo. Leo knows Jacqueline. Which of Luella and Gustavo can Selena reach?", "answer": "Luella", "steps": [ "Selena knows Leo.", "Leo knows Neal.", "Neal knows Luella." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Selena", "Luella", "Neal", "Daniella", "Jacqueline", "Ralph", "Omar", "Colin", "Leo", "Clinton", "Roy", "Gustavo", "Karla", "Zara", "Inez", "Evan", "Michelle", "Marcus", "Fletcher", "Cornelius" ], "edges": [ [ 0, 8 ], [ 1, 5 ], [ 2, 1 ], [ 2, 7 ], [ 3, 6 ], [ 8, 4 ], [ 8, 3 ], [ 8, 2 ], [ 8, 9 ], [ 10, 18 ], [ 11, 15 ], [ 12, 11 ], [ 12, 17 ], [ 13, 16 ], [ 18, 14 ], [ 18, 13 ], [ 18, 12 ], [ 18, 19 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Dora knows Erma. Aria knows Lane. Eden knows Fraser. Anthony knows Ron. Byron knows Eden. Davis knows Aria. Eden knows Kerry. Ron knows Molly. Kerry knows Clifford. Lane knows Jenna. Erma knows Taylor. Rod knows Ava. Molly knows Byron. Gunnar knows Dora. Ron knows Harley. Archie knows Anthony. Lane knows Gunnar. Erma knows Rod. Which of Dora and Byron can Archie reach?", "answer": "Byron", "steps": [ "Archie knows Anthony.", "Anthony knows Ron.", "Ron knows Molly.", "Molly knows Byron." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Archie", "Kerry", "Harley", "Byron", "Anthony", "Ron", "Molly", "Fraser", "Clifford", "Eden", "Davis", "Rod", "Jenna", "Dora", "Aria", "Lane", "Gunnar", "Taylor", "Ava", "Erma" ], "edges": [ [ 0, 4 ], [ 1, 8 ], [ 3, 9 ], [ 4, 5 ], [ 5, 2 ], [ 5, 6 ], [ 6, 3 ], [ 9, 7 ], [ 9, 1 ], [ 10, 14 ], [ 11, 18 ], [ 13, 19 ], [ 14, 15 ], [ 15, 12 ], [ 15, 16 ], [ 16, 13 ], [ 19, 17 ], [ 19, 11 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Kane knows Luz. Skyler knows Clay. Luz knows Lana. Clay knows Parsa. Parsa knows Nash. Marc knows Selena. Parsa knows Kendra. Hendrix knows Graeme. Yolanda knows Dina. Parsa knows Hudson. Skyler knows Norma. Skyler knows Elvira. Eden knows Marc. Nash knows Hendrix. Marc knows Kane. Yolanda knows Dudley. Yolanda knows Eden. Marc knows Elaine. Which of Marc and Parsa can Skyler reach?", "answer": "Parsa", "steps": [ "Skyler knows Clay.", "Clay knows Parsa." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Skyler", "Elvira", "Parsa", "Hendrix", "Clay", "Norma", "Hudson", "Graeme", "Kendra", "Nash", "Yolanda", "Dudley", "Marc", "Luz", "Eden", "Dina", "Elaine", "Lana", "Selena", "Kane" ], "edges": [ [ 0, 1 ], [ 0, 5 ], [ 0, 4 ], [ 2, 6 ], [ 2, 8 ], [ 2, 9 ], [ 3, 7 ], [ 4, 2 ], [ 9, 3 ], [ 10, 11 ], [ 10, 15 ], [ 10, 14 ], [ 12, 16 ], [ 12, 18 ], [ 12, 19 ], [ 13, 17 ], [ 14, 12 ], [ 19, 13 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Anastasia knows Amanda. Hailey knows Pauline. Jaime knows Dorian. Brooke knows Hailey. Pauline knows Dave. Dave knows Adele. Carrie knows Geneva. Brooke knows Ernest. Carrie knows Ibrahim. Anastasia knows Hudson. Hudson knows Carrie. Pauline knows Pablo. Lauren knows Anastasia. Dorian knows Lionel. Dorian knows Brooke. Jamie knows Lauren. Ibrahim knows Kirsten. Lauren knows Owen. Which of Anastasia and Brooke can Jamie reach?", "answer": "Anastasia", "steps": [ "Jamie knows Lauren.", "Lauren knows Anastasia." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Jamie", "Amanda", "Lauren", "Geneva", "Carrie", "Anastasia", "Hudson", "Owen", "Kirsten", "Ibrahim", "Jaime", "Ernest", "Dorian", "Pablo", "Pauline", "Brooke", "Hailey", "Lionel", "Adele", "Dave" ], "edges": [ [ 0, 2 ], [ 2, 7 ], [ 2, 5 ], [ 4, 3 ], [ 4, 9 ], [ 5, 1 ], [ 5, 6 ], [ 6, 4 ], [ 9, 8 ], [ 10, 12 ], [ 12, 17 ], [ 12, 15 ], [ 14, 13 ], [ 14, 19 ], [ 15, 11 ], [ 15, 16 ], [ 16, 14 ], [ 19, 18 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Jeffery knows Israel. Terry knows Levi. Jeffery knows Russell. Becky knows Daphne. Jay knows Adelaide. Russell knows Marie. Jill knows Ignacio. Ignacio knows Terry. Becky knows Belinda. Daphne knows Dudley. Levi knows Francesca. Marie knows Dee. Jeffery knows Leigh. Daphne knows Jill. Bennett knows Jeffery. Bennett knows Eric. Daphne knows Camille. Dee knows Jay. Which of Ignacio and Marie can Becky reach?", "answer": "Ignacio", "steps": [ "Becky knows Daphne.", "Daphne knows Jill.", "Jill knows Ignacio." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Becky", "Levi", "Belinda", "Daphne", "Dudley", "Terry", "Ignacio", "Francesca", "Jill", "Camille", "Bennett", "Jay", "Eric", "Jeffery", "Leigh", "Dee", "Marie", "Adelaide", "Russell", "Israel" ], "edges": [ [ 0, 2 ], [ 0, 3 ], [ 1, 7 ], [ 3, 4 ], [ 3, 8 ], [ 3, 9 ], [ 5, 1 ], [ 6, 5 ], [ 8, 6 ], [ 10, 12 ], [ 10, 13 ], [ 11, 17 ], [ 13, 14 ], [ 13, 18 ], [ 13, 19 ], [ 15, 11 ], [ 16, 15 ], [ 18, 16 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Charles knows Ethan. Cody knows Frank. Luis knows Xavier. Hazel knows Langston. Harriet knows Brenda. Carter knows Hazel. Larissa knows Carmela. Larissa knows Carter. Langston knows Luis. Cody knows Violet. Brenda knows Gerald. Larissa knows Mason. Cody knows Harriet. Freya knows Lane. Carter knows Charles. Harriet knows Ernie. Ernie knows Vicki. Gerald knows Freya. Which of Harriet and Carter can Cody reach?", "answer": "Harriet", "steps": [ "Cody knows Harriet." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Cody", "Harriet", "Violet", "Gerald", "Ernie", "Frank", "Freya", "Brenda", "Lane", "Vicki", "Larissa", "Carter", "Mason", "Langston", "Charles", "Carmela", "Luis", "Hazel", "Xavier", "Ethan" ], "edges": [ [ 0, 2 ], [ 0, 5 ], [ 0, 1 ], [ 1, 7 ], [ 1, 4 ], [ 3, 6 ], [ 4, 9 ], [ 6, 8 ], [ 7, 3 ], [ 10, 12 ], [ 10, 15 ], [ 10, 11 ], [ 11, 17 ], [ 11, 14 ], [ 13, 16 ], [ 14, 19 ], [ 16, 18 ], [ 17, 13 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Clarissa knows Carol. Roger knows Tyler. Anita knows Demetrius. Aspen knows Vera. Roger knows Ira. Ron knows Destiny. Cooper knows Camden. Vera knows Carla. Tyler knows Aspen. Clarissa knows Khashayar. Carla knows Gail. Zara knows Anita. Zara knows Ron. Demetrius knows Devon. Khashayar knows Zara. Devon knows Lyric. Aspen knows Cooper. Gail knows Patrick. Which of Anita and Vera can Roger reach?", "answer": "Vera", "steps": [ "Roger knows Tyler.", "Tyler knows Aspen.", "Aspen knows Vera." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Roger", "Gail", "Camden", "Ira", "Aspen", "Patrick", "Cooper", "Carla", "Tyler", "Vera", "Clarissa", "Devon", "Destiny", "Carol", "Zara", "Lyric", "Ron", "Demetrius", "Khashayar", "Anita" ], "edges": [ [ 0, 3 ], [ 0, 8 ], [ 1, 5 ], [ 4, 6 ], [ 4, 9 ], [ 6, 2 ], [ 7, 1 ], [ 8, 4 ], [ 9, 7 ], [ 10, 13 ], [ 10, 18 ], [ 11, 15 ], [ 14, 16 ], [ 14, 19 ], [ 16, 12 ], [ 17, 11 ], [ 18, 14 ], [ 19, 17 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Beth knows Derek. Kirsten knows Archer. Gerald knows Fanny. Bill knows Jorge. April knows Kirsten. Fanny knows Harlan. Archer knows Kira. Chance knows Giselle. Derek knows Brynn. Derek knows Jolene. Kira knows Claire. Giselle knows Maria. Jolene knows Gerald. Kira knows Marvin. Giselle knows Beth. Marvin knows Bill. Kirsten knows Vincent. Jorge knows Dennis. Which of Marvin and Jolene can April reach?", "answer": "Marvin", "steps": [ "April knows Kirsten.", "Kirsten knows Archer.", "Archer knows Kira.", "Kira knows Marvin." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "April", "Dennis", "Kira", "Marvin", "Claire", "Bill", "Vincent", "Kirsten", "Jorge", "Archer", "Chance", "Harlan", "Derek", "Jolene", "Brynn", "Gerald", "Maria", "Giselle", "Fanny", "Beth" ], "edges": [ [ 0, 7 ], [ 2, 4 ], [ 2, 3 ], [ 3, 5 ], [ 5, 8 ], [ 7, 6 ], [ 7, 9 ], [ 8, 1 ], [ 9, 2 ], [ 10, 17 ], [ 12, 14 ], [ 12, 13 ], [ 13, 15 ], [ 15, 18 ], [ 17, 16 ], [ 17, 19 ], [ 18, 11 ], [ 19, 12 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Winifred knows Kara. Yara knows Jeanne. Miriam knows Coral. Wilson knows Cynthia. Dana knows Declan. Jeanne knows Dennis. Hank knows Elijah. Elijah knows Winifred. Louise knows Dana. Roger knows Miriam. Winifred knows Louise. Kara knows Joseph. Cynthia knows Freya. Joseph knows Philip. Dennis knows Regina. Freya knows Roger. Freya knows Yara. Declan knows Sierra. Which of Winifred and Freya can Wilson reach?", "answer": "Freya", "steps": [ "Wilson knows Cynthia.", "Cynthia knows Freya." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Wilson", "Regina", "Roger", "Jeanne", "Coral", "Yara", "Dennis", "Cynthia", "Miriam", "Freya", "Hank", "Sierra", "Kara", "Dana", "Philip", "Louise", "Declan", "Elijah", "Joseph", "Winifred" ], "edges": [ [ 0, 7 ], [ 2, 8 ], [ 3, 6 ], [ 5, 3 ], [ 6, 1 ], [ 7, 9 ], [ 8, 4 ], [ 9, 5 ], [ 9, 2 ], [ 10, 17 ], [ 12, 18 ], [ 13, 16 ], [ 15, 13 ], [ 16, 11 ], [ 17, 19 ], [ 18, 14 ], [ 19, 15 ], [ 19, 12 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Veronica knows Hayley. Hayley knows Rose. Holly knows Terry. Glenn knows Wilson. Nolan knows Kennedy. Glenn knows Blair. Alice knows Nolan. Janice knows Edith. Hayley knows Dolores. Tim knows Glenn. Sandra knows Winston. Glenn knows Veronica. Winston knows Tim. Nolan knows Gene. Holly knows Alice. Edith knows Lenora. Holly knows Sheryl. Lenora knows Holly. Which of Winston and Edith can Sandra reach?", "answer": "Winston", "steps": [ "Sandra knows Winston." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Sandra", "Blair", "Veronica", "Winston", "Wilson", "Hayley", "Dolores", "Rose", "Glenn", "Tim", "Janice", "Sheryl", "Alice", "Edith", "Terry", "Nolan", "Kennedy", "Gene", "Holly", "Lenora" ], "edges": [ [ 0, 3 ], [ 2, 5 ], [ 3, 9 ], [ 5, 6 ], [ 5, 7 ], [ 8, 1 ], [ 8, 4 ], [ 8, 2 ], [ 9, 8 ], [ 10, 13 ], [ 12, 15 ], [ 13, 19 ], [ 15, 16 ], [ 15, 17 ], [ 18, 11 ], [ 18, 14 ], [ 18, 12 ], [ 19, 18 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Fergus knows Jonas. Sydney knows Erik. Russ knows Faith. Carter knows Bennett. Leigh knows Ashton. Desmond knows Steve. Bennett knows Dave. Desmond knows Edgar. Bennett knows Sydney. Colette knows Russ. Leigh knows Lena. Fergus knows Colette. Carter knows Hope. Sydney knows Desmond. Russ knows Leigh. Hope knows Tom. Colette knows Stephen. Jonas knows Arlene. Which of Bennett and Colette can Fergus reach?", "answer": "Colette", "steps": [ "Fergus knows Colette." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Fergus", "Jonas", "Stephen", "Faith", "Colette", "Lena", "Arlene", "Russ", "Ashton", "Leigh", "Carter", "Hope", "Dave", "Erik", "Bennett", "Edgar", "Tom", "Sydney", "Steve", "Desmond" ], "edges": [ [ 0, 1 ], [ 0, 4 ], [ 1, 6 ], [ 4, 2 ], [ 4, 7 ], [ 7, 3 ], [ 7, 9 ], [ 9, 5 ], [ 9, 8 ], [ 10, 11 ], [ 10, 14 ], [ 11, 16 ], [ 14, 12 ], [ 14, 17 ], [ 17, 13 ], [ 17, 19 ], [ 19, 15 ], [ 19, 18 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Brian knows Alvin. Daphna knows Jenny. Alvin knows Morris. Kylie knows Clay. Clay knows Heidi. Joyce knows Tristan. Louise knows William. Heidi knows Brandon. Randall knows Kylie. Noel knows Winston. Jenny knows Randall. Fisher knows Finn. Heidi knows Jonathan. Finn knows Noel. Joyce knows Brian. Winston knows Dolores. Jonathan knows Louise. Dolores knows Joyce. Which of Kylie and Winston can Fisher reach?", "answer": "Winston", "steps": [ "Fisher knows Finn.", "Finn knows Noel.", "Noel knows Winston." ], "difficulty": 3, "original_distance": 8, "idx_to_symbol": [ "Fisher", "Winston", "Tristan", "Finn", "Noel", "Morris", "Joyce", "Alvin", "Dolores", "Brian", "Daphna", "Kylie", "Brandon", "Jenny", "Randall", "William", "Heidi", "Louise", "Clay", "Jonathan" ], "edges": [ [ 0, 3 ], [ 1, 8 ], [ 3, 4 ], [ 4, 1 ], [ 6, 2 ], [ 6, 9 ], [ 7, 5 ], [ 8, 6 ], [ 9, 7 ], [ 10, 13 ], [ 11, 18 ], [ 13, 14 ], [ 14, 11 ], [ 16, 12 ], [ 16, 19 ], [ 17, 15 ], [ 18, 16 ], [ 19, 17 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Caroline knows Adam. Ember knows Lilia. Eamon knows Ember. Max knows Connor. Myrtle knows Devin. Lilia knows Esther. Myrtle knows Xander. Leslie knows Myrtle. Adam knows Pedro. Priscilla knows Eamon. Jared knows Jill. Eamon knows Jenna. Myrtle knows Caroline. Eamon knows Doris. Jared knows Priscilla. Max knows Jermaine. Jared knows Yvonne. Max knows Leslie. Which of Leslie and Priscilla can Jared reach?", "answer": "Priscilla", "steps": [ "Jared knows Priscilla." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Jared", "Lilia", "Priscilla", "Jill", "Doris", "Ember", "Yvonne", "Esther", "Jenna", "Eamon", "Max", "Adam", "Leslie", "Connor", "Devin", "Caroline", "Jermaine", "Pedro", "Xander", "Myrtle" ], "edges": [ [ 0, 3 ], [ 0, 6 ], [ 0, 2 ], [ 1, 7 ], [ 2, 9 ], [ 5, 1 ], [ 9, 4 ], [ 9, 5 ], [ 9, 8 ], [ 10, 13 ], [ 10, 16 ], [ 10, 12 ], [ 11, 17 ], [ 12, 19 ], [ 15, 11 ], [ 19, 14 ], [ 19, 15 ], [ 19, 18 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Jenny knows Boris. Kenneth knows Garrison. Candice knows Kenneth. Sheryl knows Philip. Gerald knows Sheryl. Hayes knows Lawson. Candice knows Aiden. Sheryl knows Joy. Maria knows Nathan. Boris knows Maria. Logan knows Hayes. Philip knows Candice. Jenny knows Xander. Maria knows Logan. Alana knows Justine. Alana knows Jenny. Garrison knows Craig. Gerald knows Sean. Which of Garrison and Hayes can Gerald reach?", "answer": "Garrison", "steps": [ "Gerald knows Sheryl.", "Sheryl knows Philip.", "Philip knows Candice.", "Candice knows Kenneth.", "Kenneth knows Garrison." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Gerald", "Kenneth", "Sean", "Craig", "Aiden", "Garrison", "Philip", "Sheryl", "Candice", "Joy", "Alana", "Logan", "Justine", "Lawson", "Nathan", "Hayes", "Boris", "Jenny", "Maria", "Xander" ], "edges": [ [ 0, 2 ], [ 0, 7 ], [ 1, 5 ], [ 5, 3 ], [ 6, 8 ], [ 7, 6 ], [ 7, 9 ], [ 8, 4 ], [ 8, 1 ], [ 10, 12 ], [ 10, 17 ], [ 11, 15 ], [ 15, 13 ], [ 16, 18 ], [ 17, 16 ], [ 17, 19 ], [ 18, 14 ], [ 18, 11 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Joan knows Donald. Emery knows Neil. Will knows Norman. Will knows Sierra. Donald knows Paige. Milo knows Etta. Jasper knows Leland. Donald knows Emery. Jasper knows Martha. Jude knows Gina. Martha knows Milo. Emery knows Elliot. Elliot knows Sonia. Martha knows Pam. Sierra knows Jasper. Kristin knows Jude. Jude knows Joan. Ignacio knows Will. Which of Emery and Martha can Kristin reach?", "answer": "Emery", "steps": [ "Kristin knows Jude.", "Jude knows Joan.", "Joan knows Donald.", "Donald knows Emery." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Kristin", "Gina", "Sonia", "Emery", "Elliot", "Joan", "Jude", "Donald", "Neil", "Paige", "Ignacio", "Norman", "Etta", "Martha", "Milo", "Sierra", "Will", "Jasper", "Pam", "Leland" ], "edges": [ [ 0, 6 ], [ 3, 4 ], [ 3, 8 ], [ 4, 2 ], [ 5, 7 ], [ 6, 1 ], [ 6, 5 ], [ 7, 3 ], [ 7, 9 ], [ 10, 16 ], [ 13, 14 ], [ 13, 18 ], [ 14, 12 ], [ 15, 17 ], [ 16, 11 ], [ 16, 15 ], [ 17, 13 ], [ 17, 19 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Crystal knows Harrison. Hugh knows Felicia. Bennett knows Emanuel. Robin knows Marc. Bennett knows Tim. Hugh knows Irving. Harrison knows Yasmin. Xavier knows Mildred. Crystal knows Robin. Xavier knows Beau. Felicia knows Irene. James knows Bennett. Jesse knows Catherine. Crystal knows James. Beau knows Jonathan. Irving knows Xavier. Tim knows Clyde. Hugh knows Jesse. Which of James and Irving can Hugh reach?", "answer": "Irving", "steps": [ "Hugh knows Irving." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Hugh", "Felicia", "Xavier", "Jesse", "Mildred", "Catherine", "Beau", "Jonathan", "Irving", "Irene", "Crystal", "Robin", "Bennett", "Harrison", "Emanuel", "Yasmin", "Tim", "Clyde", "James", "Marc" ], "edges": [ [ 0, 3 ], [ 0, 8 ], [ 0, 1 ], [ 1, 9 ], [ 2, 4 ], [ 2, 6 ], [ 3, 5 ], [ 6, 7 ], [ 8, 2 ], [ 10, 13 ], [ 10, 18 ], [ 10, 11 ], [ 11, 19 ], [ 12, 14 ], [ 12, 16 ], [ 13, 15 ], [ 16, 17 ], [ 18, 12 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Gustavo knows Bart. Marvin knows Shelby. Hendrix knows Lambert. Peter knows Marvin. Emmett knows Bernard. Peter knows Gustavo. Clay knows Alyson. Katherine knows Wendy. Aisha knows Clay. Shelby knows Katherine. Peter knows Hendrix. Nathan knows Levi. Casey knows Gus. Bernard knows Nathan. Alyson knows Ruth. Chester knows Peter. Clay knows Emmett. Clay knows Casey. Which of Clay and Peter can Aisha reach?", "answer": "Clay", "steps": [ "Aisha knows Clay." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Aisha", "Levi", "Bernard", "Alyson", "Emmett", "Nathan", "Ruth", "Clay", "Casey", "Gus", "Chester", "Wendy", "Shelby", "Hendrix", "Marvin", "Katherine", "Lambert", "Peter", "Gustavo", "Bart" ], "edges": [ [ 0, 7 ], [ 2, 5 ], [ 3, 6 ], [ 4, 2 ], [ 5, 1 ], [ 7, 4 ], [ 7, 3 ], [ 7, 8 ], [ 8, 9 ], [ 10, 17 ], [ 12, 15 ], [ 13, 16 ], [ 14, 12 ], [ 15, 11 ], [ 17, 14 ], [ 17, 13 ], [ 17, 18 ], [ 18, 19 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Cecilia knows Angelica. Ainsley knows Monroe. Angelica knows Aisha. Ainsley knows Simon. Aisha knows India. Tamara knows Edwin. Darcy knows Verna. Angelica knows Vivian. Vivian knows Emmett. Simon knows Darcy. Aisha knows Clayton. Clayton knows Belinda. Jeremy knows Ainsley. Darcy knows Horace. Colleen knows Cecilia. Verna knows Nadine. Simon knows Tamara. Cecilia knows Elsa. Which of Angelica and Simon can Jeremy reach?", "answer": "Simon", "steps": [ "Jeremy knows Ainsley.", "Ainsley knows Simon." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Jeremy", "Verna", "Nadine", "Horace", "Darcy", "Monroe", "Ainsley", "Tamara", "Simon", "Edwin", "Colleen", "Clayton", "Belinda", "India", "Aisha", "Elsa", "Cecilia", "Vivian", "Angelica", "Emmett" ], "edges": [ [ 0, 6 ], [ 1, 2 ], [ 4, 1 ], [ 4, 3 ], [ 6, 5 ], [ 6, 8 ], [ 7, 9 ], [ 8, 4 ], [ 8, 7 ], [ 10, 16 ], [ 11, 12 ], [ 14, 11 ], [ 14, 13 ], [ 16, 15 ], [ 16, 18 ], [ 17, 19 ], [ 18, 14 ], [ 18, 17 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Valerie knows Irving. Lois knows Clifford. Kira knows Valerie. Ralph knows Freya. Wilma knows Marc. Peter knows Xander. Ford knows Kira. Irving knows Leopold. Peter knows Wilma. Lois knows Lauren. Freya knows Lois. Valerie knows Ralph. Damien knows Peter. Jolena knows Fritz. Enrique knows Jolena. Xander knows Enrique. Jolena knows Andrew. Lucia knows Damien. Which of Xander and Ralph can Ford reach?", "answer": "Ralph", "steps": [ "Ford knows Kira.", "Kira knows Valerie.", "Valerie knows Ralph." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Ford", "Leopold", "Lois", "Kira", "Valerie", "Lauren", "Freya", "Ralph", "Clifford", "Irving", "Lucia", "Marc", "Jolena", "Damien", "Peter", "Fritz", "Enrique", "Xander", "Andrew", "Wilma" ], "edges": [ [ 0, 3 ], [ 2, 5 ], [ 2, 8 ], [ 3, 4 ], [ 4, 7 ], [ 4, 9 ], [ 6, 2 ], [ 7, 6 ], [ 9, 1 ], [ 10, 13 ], [ 12, 15 ], [ 12, 18 ], [ 13, 14 ], [ 14, 17 ], [ 14, 19 ], [ 16, 12 ], [ 17, 16 ], [ 19, 11 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Kendrick knows Glenda. Aspen knows Adam. Hattie knows Kendrick. Bernard knows Hattie. Adam knows Karen. David knows Stella. Frida knows Latoya. Hattie knows Bernice. Daphna knows Jorge. Frida knows Aspen. Aspen knows Chantal. Bernard knows Quinn. Frida knows Peggy. Jorge knows Bernard. Stella knows Frida. Karen knows Keira. Bernard knows Teresa. Glenda knows Abby. Which of Karen and Glenda can Daphna reach?", "answer": "Glenda", "steps": [ "Daphna knows Jorge.", "Jorge knows Bernard.", "Bernard knows Hattie.", "Hattie knows Kendrick.", "Kendrick knows Glenda." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Daphna", "Abby", "Kendrick", "Glenda", "Jorge", "Hattie", "Quinn", "Bernard", "Teresa", "Bernice", "David", "Keira", "Adam", "Karen", "Stella", "Aspen", "Latoya", "Frida", "Peggy", "Chantal" ], "edges": [ [ 0, 4 ], [ 2, 3 ], [ 3, 1 ], [ 4, 7 ], [ 5, 2 ], [ 5, 9 ], [ 7, 6 ], [ 7, 8 ], [ 7, 5 ], [ 10, 14 ], [ 12, 13 ], [ 13, 11 ], [ 14, 17 ], [ 15, 12 ], [ 15, 19 ], [ 17, 16 ], [ 17, 18 ], [ 17, 15 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Kobe knows Hugo. Ellis knows Joshua. Angelica knows Kobe. Ariel knows Luke. Helene knows Earle. Earle knows Jack. Donald knows Clinton. Lyle knows Irving. Lyle knows Holly. Demetrius knows Helene. Lyle knows Ellis. Lyle knows Angelica. Demetrius knows Jesse. Donald knows Ariel. Demetrius knows Donald. Ellis knows Yasmin. Demetrius knows Milo. Yasmin knows Edwin. Which of Luke and Edwin can Lyle reach?", "answer": "Edwin", "steps": [ "Lyle knows Ellis.", "Ellis knows Yasmin.", "Yasmin knows Edwin." ], "difficulty": 3, "original_distance": 3, "idx_to_symbol": [ "Lyle", "Angelica", "Kobe", "Yasmin", "Hugo", "Ellis", "Holly", "Irving", "Joshua", "Edwin", "Demetrius", "Helene", "Earle", "Ariel", "Jack", "Donald", "Milo", "Jesse", "Clinton", "Luke" ], "edges": [ [ 0, 1 ], [ 0, 6 ], [ 0, 7 ], [ 0, 5 ], [ 1, 2 ], [ 2, 4 ], [ 3, 9 ], [ 5, 8 ], [ 5, 3 ], [ 10, 11 ], [ 10, 16 ], [ 10, 17 ], [ 10, 15 ], [ 11, 12 ], [ 12, 14 ], [ 13, 19 ], [ 15, 18 ], [ 15, 13 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Ariel knows Hope. Tyler knows Fritz. Marcia knows Celia. Henry knows Jeffery. Tyler knows Mary. Tyler knows Cruz. Brandon knows Constance. Brandon knows Ariel. Mary knows Leslie. Brandon knows Alvin. Celia knows Frank. Marcia knows Ebony. Chance knows Sonia. Henry knows Pearl. Leslie knows Brandon. Frank knows Henry. Marcia knows Allison. Henry knows Chance. Which of Mary and Celia can Tyler reach?", "answer": "Mary", "steps": [ "Tyler knows Mary." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Tyler", "Mary", "Constance", "Hope", "Leslie", "Cruz", "Ariel", "Fritz", "Brandon", "Alvin", "Marcia", "Celia", "Jeffery", "Sonia", "Frank", "Ebony", "Chance", "Allison", "Henry", "Pearl" ], "edges": [ [ 0, 5 ], [ 0, 7 ], [ 0, 1 ], [ 1, 4 ], [ 4, 8 ], [ 6, 3 ], [ 8, 2 ], [ 8, 6 ], [ 8, 9 ], [ 10, 15 ], [ 10, 17 ], [ 10, 11 ], [ 11, 14 ], [ 14, 18 ], [ 16, 13 ], [ 18, 12 ], [ 18, 16 ], [ 18, 19 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Adrian knows Sharon. Sharon knows Julie. August knows Neil. Eric knows Sebastian. Verna knows Simon. Warren knows Stephen. Khashayar knows Kate. Graham knows Clement. Simon knows Ann. Kate knows Bert. Julie knows Khashayar. Kate knows Eric. Simon knows Graham. Warren knows Harvey. Clement knows Warren. Warren knows August. Sharon knows Dee. Kate knows Mara. Which of Clement and Khashayar can Adrian reach?", "answer": "Khashayar", "steps": [ "Adrian knows Sharon.", "Sharon knows Julie.", "Julie knows Khashayar." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Adrian", "Bert", "Dee", "Julie", "Khashayar", "Kate", "Sebastian", "Mara", "Eric", "Sharon", "Verna", "Stephen", "Ann", "Graham", "Clement", "Warren", "Neil", "Harvey", "August", "Simon" ], "edges": [ [ 0, 9 ], [ 3, 4 ], [ 4, 5 ], [ 5, 1 ], [ 5, 7 ], [ 5, 8 ], [ 8, 6 ], [ 9, 2 ], [ 9, 3 ], [ 10, 19 ], [ 13, 14 ], [ 14, 15 ], [ 15, 11 ], [ 15, 17 ], [ 15, 18 ], [ 18, 16 ], [ 19, 12 ], [ 19, 13 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Maude knows Casey. Jamie knows Fraser. Uma knows Clay. Yasmin knows Cruz. Clay knows Kristin. Naomi knows Agnes. Fraser knows Denise. Rowan knows Jaime. Devin knows Yasmin. Marcia knows Tina. Terrence knows Jamie. Devin knows Uma. Jamie knows Naomi. Rowan knows Marcia. Brynn knows Terrence. Jaime knows Devin. Brynn knows Maude. Denise knows Erma. Which of Devin and Jamie can Rowan reach?", "answer": "Devin", "steps": [ "Rowan knows Jaime.", "Jaime knows Devin." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Rowan", "Tina", "Cruz", "Uma", "Marcia", "Yasmin", "Clay", "Jaime", "Kristin", "Devin", "Brynn", "Casey", "Agnes", "Fraser", "Maude", "Naomi", "Denise", "Terrence", "Erma", "Jamie" ], "edges": [ [ 0, 4 ], [ 0, 7 ], [ 3, 6 ], [ 4, 1 ], [ 5, 2 ], [ 6, 8 ], [ 7, 9 ], [ 9, 5 ], [ 9, 3 ], [ 10, 14 ], [ 10, 17 ], [ 13, 16 ], [ 14, 11 ], [ 15, 12 ], [ 16, 18 ], [ 17, 19 ], [ 19, 15 ], [ 19, 13 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Bennett knows Carla. Violet knows Albert. Violet knows Nicole. Henry knows Kareem. Adele knows Walter. Beatrice knows Hayley. Kareem knows Bernard. Albert knows Terrence. Bruno knows Hubert. Ronald knows Jeremy. Henry knows Tamara. Bruno knows Ronald. Doris knows Erma. Nicole knows Bennett. Hayley knows Adele. Bernard knows Beatrice. Beatrice knows Doris. Jeremy knows Violet. Which of Hayley and Nicole can Bruno reach?", "answer": "Nicole", "steps": [ "Bruno knows Ronald.", "Ronald knows Jeremy.", "Jeremy knows Violet.", "Violet knows Nicole." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Bruno", "Ronald", "Jeremy", "Violet", "Bennett", "Terrence", "Carla", "Hubert", "Nicole", "Albert", "Henry", "Kareem", "Bernard", "Beatrice", "Adele", "Erma", "Walter", "Tamara", "Hayley", "Doris" ], "edges": [ [ 0, 7 ], [ 0, 1 ], [ 1, 2 ], [ 2, 3 ], [ 3, 8 ], [ 3, 9 ], [ 4, 6 ], [ 8, 4 ], [ 9, 5 ], [ 10, 17 ], [ 10, 11 ], [ 11, 12 ], [ 12, 13 ], [ 13, 18 ], [ 13, 19 ], [ 14, 16 ], [ 18, 14 ], [ 19, 15 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Lorraine knows Hampton. Eve knows Electra. Charles knows Winston. Elaine knows Ember. Julio knows Lorraine. Ember knows Judy. Everett knows Isadora. Francis knows Karina. Ross knows Eve. Clayton knows Charles. India knows Jared. Francis knows Emily. Karina knows Darnell. India knows Clayton. Winston knows Everett. Electra knows Julio. Isadora knows Elaine. Darnell knows Ross. Which of Ember and Lorraine can India reach?", "answer": "Ember", "steps": [ "India knows Clayton.", "Clayton knows Charles.", "Charles knows Winston.", "Winston knows Everett.", "Everett knows Isadora.", "Isadora knows Elaine.", "Elaine knows Ember." ], "difficulty": 7, "original_distance": 8, "idx_to_symbol": [ "India", "Ember", "Everett", "Winston", "Judy", "Jared", "Elaine", "Charles", "Isadora", "Clayton", "Francis", "Lorraine", "Eve", "Ross", "Hampton", "Emily", "Julio", "Darnell", "Electra", "Karina" ], "edges": [ [ 0, 5 ], [ 0, 9 ], [ 1, 4 ], [ 2, 8 ], [ 3, 2 ], [ 6, 1 ], [ 7, 3 ], [ 8, 6 ], [ 9, 7 ], [ 10, 15 ], [ 10, 19 ], [ 11, 14 ], [ 12, 18 ], [ 13, 12 ], [ 16, 11 ], [ 17, 13 ], [ 18, 16 ], [ 19, 17 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Diana knows Brenda. Joan knows Harmony. Holly knows Lorna. Kurt knows Olivia. Yasmin knows Joan. Harmony knows Kurt. Kurt knows Iris. Diana knows Dylan. Holly knows Frances. Alejandro knows Carrie. Yuki knows Sally. Alejandro knows Alma. Dayton knows Yuki. Olivia knows Alejandro. Alma knows Kieran. Frances knows Gordon. Sally knows Diana. Dylan knows Holly. Which of Olivia and Dylan can Dayton reach?", "answer": "Dylan", "steps": [ "Dayton knows Yuki.", "Yuki knows Sally.", "Sally knows Diana.", "Diana knows Dylan." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Dayton", "Holly", "Yuki", "Brenda", "Diana", "Frances", "Sally", "Lorna", "Gordon", "Dylan", "Yasmin", "Alejandro", "Joan", "Iris", "Kurt", "Alma", "Harmony", "Carrie", "Kieran", "Olivia" ], "edges": [ [ 0, 2 ], [ 1, 7 ], [ 1, 5 ], [ 2, 6 ], [ 4, 3 ], [ 4, 9 ], [ 5, 8 ], [ 6, 4 ], [ 9, 1 ], [ 10, 12 ], [ 11, 17 ], [ 11, 15 ], [ 12, 16 ], [ 14, 13 ], [ 14, 19 ], [ 15, 18 ], [ 16, 14 ], [ 19, 11 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Antonio knows Margaret. Dirk knows Mitchell. Margaret knows Sonia. Lucia knows Constance. Isaac knows Emmett. Magdalena knows Isaac. Glenn knows Essie. Serena knows Glenn. Khashayar knows Riley. Sonia knows Khashayar. Constance knows Jasmine. Lucia knows Dirk. Emmett knows Bailey. Tyler knows Javier. Mitchell knows Brent. Tyler knows Serena. Jasmine knows Magdalena. Javier knows Antonio. Which of Riley and Bailey can Lucia reach?", "answer": "Bailey", "steps": [ "Lucia knows Constance.", "Constance knows Jasmine.", "Jasmine knows Magdalena.", "Magdalena knows Isaac.", "Isaac knows Emmett.", "Emmett knows Bailey." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Lucia", "Dirk", "Brent", "Bailey", "Magdalena", "Mitchell", "Jasmine", "Isaac", "Constance", "Emmett", "Tyler", "Serena", "Essie", "Riley", "Margaret", "Glenn", "Antonio", "Sonia", "Javier", "Khashayar" ], "edges": [ [ 0, 1 ], [ 0, 8 ], [ 1, 5 ], [ 4, 7 ], [ 5, 2 ], [ 6, 4 ], [ 7, 9 ], [ 8, 6 ], [ 9, 3 ], [ 10, 11 ], [ 10, 18 ], [ 11, 15 ], [ 14, 17 ], [ 15, 12 ], [ 16, 14 ], [ 17, 19 ], [ 18, 16 ], [ 19, 13 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Clement knows Greta. Clement knows Dylan. Ashton knows Simon. Robin knows Gareth. Ashton knows Reid. Gareth knows Lorna. Simon knows Jack. Lyric knows Nelson. Jack knows Lyric. Reid knows Clement. Yvette knows Raymond. Raymond knows Robin. Dylan knows Clayton. Kit knows Bert. Carmen knows Kit. Yvette knows Carmen. Lyle knows Teresa. Kit knows Lyle. Which of Teresa and Clayton can Yvette reach?", "answer": "Teresa", "steps": [ "Yvette knows Carmen.", "Carmen knows Kit.", "Kit knows Lyle.", "Lyle knows Teresa." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Yvette", "Robin", "Raymond", "Kit", "Bert", "Gareth", "Teresa", "Lorna", "Carmen", "Lyle", "Ashton", "Jack", "Simon", "Clement", "Greta", "Lyric", "Clayton", "Nelson", "Reid", "Dylan" ], "edges": [ [ 0, 2 ], [ 0, 8 ], [ 1, 5 ], [ 2, 1 ], [ 3, 4 ], [ 3, 9 ], [ 5, 7 ], [ 8, 3 ], [ 9, 6 ], [ 10, 12 ], [ 10, 18 ], [ 11, 15 ], [ 12, 11 ], [ 13, 14 ], [ 13, 19 ], [ 15, 17 ], [ 18, 13 ], [ 19, 16 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Emmett knows Lois. Arturo knows Spencer. Dane knows Tabitha. Dane knows Eduardo. Ira knows Roman. Tabitha knows Harrison. Margaret knows Arturo. Terrence knows Sandy. Harrison knows Emmett. Spencer knows Gene. Ira knows Margaret. Terrence knows Ira. Emmett knows Josie. Vera knows Pedro. Vera knows Dane. Vera knows Sam. Spencer knows Leander. Terrence knows Opal. Which of Josie and Leander can Terrence reach?", "answer": "Leander", "steps": [ "Terrence knows Ira.", "Ira knows Margaret.", "Margaret knows Arturo.", "Arturo knows Spencer.", "Spencer knows Leander." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Terrence", "Roman", "Spencer", "Leander", "Margaret", "Gene", "Opal", "Sandy", "Arturo", "Ira", "Vera", "Eduardo", "Emmett", "Josie", "Tabitha", "Lois", "Pedro", "Sam", "Harrison", "Dane" ], "edges": [ [ 0, 6 ], [ 0, 7 ], [ 0, 9 ], [ 2, 3 ], [ 2, 5 ], [ 4, 8 ], [ 8, 2 ], [ 9, 1 ], [ 9, 4 ], [ 10, 16 ], [ 10, 17 ], [ 10, 19 ], [ 12, 13 ], [ 12, 15 ], [ 14, 18 ], [ 18, 12 ], [ 19, 11 ], [ 19, 14 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Jules knows Estelle. Edmund knows Opal. Hazel knows Layla. Malik knows Hazel. Hazel knows Floyd. Dwight knows Joanna. Penny knows Darla. Opal knows Dwight. Carol knows Hope. Carol knows Penny. Dwight knows Robert. Katrina knows Edmund. Joanna knows Jules. Edmund knows Marilyn. Michael knows Carol. Michael knows Gerald. Joanna knows Preston. Layla knows Michael. Which of Edmund and Hazel can Katrina reach?", "answer": "Edmund", "steps": [ "Katrina knows Edmund." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Katrina", "Marilyn", "Estelle", "Opal", "Joanna", "Robert", "Jules", "Dwight", "Preston", "Edmund", "Malik", "Floyd", "Darla", "Layla", "Carol", "Gerald", "Penny", "Michael", "Hope", "Hazel" ], "edges": [ [ 0, 9 ], [ 3, 7 ], [ 4, 6 ], [ 4, 8 ], [ 6, 2 ], [ 7, 5 ], [ 7, 4 ], [ 9, 1 ], [ 9, 3 ], [ 10, 19 ], [ 13, 17 ], [ 14, 16 ], [ 14, 18 ], [ 16, 12 ], [ 17, 15 ], [ 17, 14 ], [ 19, 11 ], [ 19, 13 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Geraldine knows Isabel. Maria knows Autumn. Cain knows Jared. Floyd knows Willis. Blair knows Cain. Kelsey knows Geraldine. Isabel knows Stefan. Floyd knows Ron. Maria knows Mindy. Geraldine knows Bailey. David knows Floyd. Victor knows Maria. Isabel knows Clyde. Dale knows Forrest. Cain knows Dale. Jared knows Victor. Dale knows Cate. Bailey knows David. Which of Autumn and Ron can Blair reach?", "answer": "Autumn", "steps": [ "Blair knows Cain.", "Cain knows Jared.", "Jared knows Victor.", "Victor knows Maria.", "Maria knows Autumn." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Blair", "Cate", "Cain", "Dale", "Autumn", "Mindy", "Maria", "Jared", "Forrest", "Victor", "Kelsey", "Clyde", "Geraldine", "Isabel", "Ron", "Willis", "Floyd", "Bailey", "Stefan", "David" ], "edges": [ [ 0, 2 ], [ 2, 3 ], [ 2, 7 ], [ 3, 1 ], [ 3, 8 ], [ 6, 4 ], [ 6, 5 ], [ 7, 9 ], [ 9, 6 ], [ 10, 12 ], [ 12, 13 ], [ 12, 17 ], [ 13, 11 ], [ 13, 18 ], [ 16, 14 ], [ 16, 15 ], [ 17, 19 ], [ 19, 16 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Sarah knows Kobe. Ivy knows Earl. Hannah knows Bill. Joaquin knows Harold. Kobe knows Kathleen. Bill knows Curtis. Brent knows Vicki. Earl knows Theodore. Matt knows Wilbur. Tonya knows Erin. Callum knows Ivy. Theodore knows Joaquin. Hannah knows Doug. Erin knows Sarah. Brent knows Matt. Molly knows Tonya. Callum knows Brent. Molly knows Hannah. Which of Kobe and Joaquin can Molly reach?", "answer": "Kobe", "steps": [ "Molly knows Tonya.", "Tonya knows Erin.", "Erin knows Sarah.", "Sarah knows Kobe." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Molly", "Sarah", "Curtis", "Doug", "Kathleen", "Kobe", "Bill", "Tonya", "Hannah", "Erin", "Callum", "Theodore", "Wilbur", "Vicki", "Harold", "Joaquin", "Matt", "Ivy", "Brent", "Earl" ], "edges": [ [ 0, 8 ], [ 0, 7 ], [ 1, 5 ], [ 5, 4 ], [ 6, 2 ], [ 7, 9 ], [ 8, 3 ], [ 8, 6 ], [ 9, 1 ], [ 10, 18 ], [ 10, 17 ], [ 11, 15 ], [ 15, 14 ], [ 16, 12 ], [ 17, 19 ], [ 18, 13 ], [ 18, 16 ], [ 19, 11 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Wendy knows Wade. Jamie knows Wendy. Justine knows Jamie. Lamont knows Nell. Wendy knows Owen. Gail knows Helene. Gail knows Anna. Vera knows Jewel. Arthur knows Lamont. Ivy knows Vera. Owen knows Bernadette. Federico knows Gail. Cecilia knows Jacob. Owen knows Arthur. Helene knows Ivy. Jacob knows Federico. Dahlia knows Justine. Helene knows Kristina. Which of Jacob and Justine can Dahlia reach?", "answer": "Justine", "steps": [ "Dahlia knows Justine." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Dahlia", "Justine", "Lamont", "Bernadette", "Owen", "Wade", "Nell", "Wendy", "Jamie", "Arthur", "Cecilia", "Jacob", "Vera", "Kristina", "Helene", "Anna", "Jewel", "Gail", "Federico", "Ivy" ], "edges": [ [ 0, 1 ], [ 1, 8 ], [ 2, 6 ], [ 4, 3 ], [ 4, 9 ], [ 7, 5 ], [ 7, 4 ], [ 8, 7 ], [ 9, 2 ], [ 10, 11 ], [ 11, 18 ], [ 12, 16 ], [ 14, 13 ], [ 14, 19 ], [ 17, 15 ], [ 17, 14 ], [ 18, 17 ], [ 19, 12 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Kira knows Samuel. Natalie knows Julia. Earl knows Hubert. Hilda knows Carla. Cruz knows Billy. Cruz knows Shaun. Harper knows Jean. Harper knows Hilda. Julia knows Kira. Gordon knows Harper. Levi knows Donald. Levi knows Earl. Billy knows Alder. Hubert knows Merle. Ashton knows Levi. Jean knows Cruz. Julia knows Ashton. Alder knows Homer. Which of Levi and Cruz can Natalie reach?", "answer": "Levi", "steps": [ "Natalie knows Julia.", "Julia knows Ashton.", "Ashton knows Levi." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Natalie", "Merle", "Levi", "Donald", "Earl", "Ashton", "Hubert", "Samuel", "Julia", "Kira", "Gordon", "Homer", "Cruz", "Shaun", "Billy", "Jean", "Alder", "Carla", "Harper", "Hilda" ], "edges": [ [ 0, 8 ], [ 2, 3 ], [ 2, 4 ], [ 4, 6 ], [ 5, 2 ], [ 6, 1 ], [ 8, 5 ], [ 8, 9 ], [ 9, 7 ], [ 10, 18 ], [ 12, 13 ], [ 12, 14 ], [ 14, 16 ], [ 15, 12 ], [ 16, 11 ], [ 18, 15 ], [ 18, 19 ], [ 19, 17 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Jack knows Gavin. Davis knows Allan. Darrell knows Anthony. Jack knows Whitney. Dora knows Lynn. Federico knows Ignacio. Federico knows Demetrius. Anthony knows Martha. Jack knows Jaime. Dora knows Renee. Virginia knows Jack. Anthony knows Jonah. Whitney knows Dora. Faye knows Jean. Allan knows Virginia. Anthony knows Clement. Jean knows Darrell. Martha knows Federico. Which of Lynn and Ignacio can Faye reach?", "answer": "Ignacio", "steps": [ "Faye knows Jean.", "Jean knows Darrell.", "Darrell knows Anthony.", "Anthony knows Martha.", "Martha knows Federico.", "Federico knows Ignacio." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Faye", "Jonah", "Jean", "Martha", "Darrell", "Clement", "Federico", "Ignacio", "Anthony", "Demetrius", "Davis", "Gavin", "Allan", "Whitney", "Virginia", "Jaime", "Dora", "Lynn", "Jack", "Renee" ], "edges": [ [ 0, 2 ], [ 2, 4 ], [ 3, 6 ], [ 4, 8 ], [ 6, 7 ], [ 6, 9 ], [ 8, 1 ], [ 8, 5 ], [ 8, 3 ], [ 10, 12 ], [ 12, 14 ], [ 13, 16 ], [ 14, 18 ], [ 16, 17 ], [ 16, 19 ], [ 18, 11 ], [ 18, 15 ], [ 18, 13 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Sandy knows Darin. Howard knows Boyd. Felicia knows Wilbur. Glenda knows Sandy. Boyd knows Nell. Audrey knows Mia. Wayne knows Howard. Howard knows Donna. Drake knows Earl. Felicia knows Goldie. Howard knows Jean. Nell knows Dexter. Felicia knows Elijah. Hannah knows Drake. Mia knows Glenda. Dexter knows Hannah. Farrah knows Felicia. Goldie knows Audrey. Which of Goldie and Boyd can Farrah reach?", "answer": "Goldie", "steps": [ "Farrah knows Felicia.", "Felicia knows Goldie." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Farrah", "Darin", "Audrey", "Elijah", "Goldie", "Wilbur", "Glenda", "Sandy", "Felicia", "Mia", "Wayne", "Earl", "Nell", "Jean", "Boyd", "Donna", "Hannah", "Drake", "Howard", "Dexter" ], "edges": [ [ 0, 8 ], [ 2, 9 ], [ 4, 2 ], [ 6, 7 ], [ 7, 1 ], [ 8, 3 ], [ 8, 5 ], [ 8, 4 ], [ 9, 6 ], [ 10, 18 ], [ 12, 19 ], [ 14, 12 ], [ 16, 17 ], [ 17, 11 ], [ 18, 13 ], [ 18, 15 ], [ 18, 14 ], [ 19, 16 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Lola knows Mark. Val knows Nathan. Aaron knows Ada. Ada knows Val. Hayden knows Ashley. Judith knows Hayden. Joel knows Lola. Brooke knows Julian. Greg knows Becky. Becky knows Cesar. Iris knows Jolena. Iris knows Gerald. Hayden knows Boyd. Mark knows Iris. Lola knows Kathleen. Kathleen knows Greg. Julian knows Judith. Julian knows Aaron. Which of Nathan and Cesar can Brooke reach?", "answer": "Nathan", "steps": [ "Brooke knows Julian.", "Julian knows Aaron.", "Aaron knows Ada.", "Ada knows Val.", "Val knows Nathan." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Brooke", "Ada", "Boyd", "Aaron", "Nathan", "Julian", "Judith", "Hayden", "Ashley", "Val", "Joel", "Greg", "Gerald", "Kathleen", "Cesar", "Lola", "Mark", "Iris", "Jolena", "Becky" ], "edges": [ [ 0, 5 ], [ 1, 9 ], [ 3, 1 ], [ 5, 6 ], [ 5, 3 ], [ 6, 7 ], [ 7, 2 ], [ 7, 8 ], [ 9, 4 ], [ 10, 15 ], [ 11, 19 ], [ 13, 11 ], [ 15, 16 ], [ 15, 13 ], [ 16, 17 ], [ 17, 12 ], [ 17, 18 ], [ 19, 14 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Morris knows Brynn. Morris knows Hugh. Darin knows Kristin. Erin knows Pam. Jolena knows Cristina. Nathan knows Jolena. James knows Nathan. Brynn knows Reed. Tina knows Vincent. Nathan knows Darin. Hugh knows Ellen. Morris knows August. Natalie knows Desmond. August knows Gene. Reed knows Natalie. Kristin knows Tina. Peter knows Morris. Nathan knows Erin. Which of Desmond and Vincent can James reach?", "answer": "Vincent", "steps": [ "James knows Nathan.", "Nathan knows Darin.", "Darin knows Kristin.", "Kristin knows Tina.", "Tina knows Vincent." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "James", "Cristina", "Vincent", "Jolena", "Erin", "Darin", "Tina", "Pam", "Kristin", "Nathan", "Peter", "Gene", "Desmond", "August", "Hugh", "Brynn", "Natalie", "Ellen", "Reed", "Morris" ], "edges": [ [ 0, 9 ], [ 3, 1 ], [ 4, 7 ], [ 5, 8 ], [ 6, 2 ], [ 8, 6 ], [ 9, 3 ], [ 9, 4 ], [ 9, 5 ], [ 10, 19 ], [ 13, 11 ], [ 14, 17 ], [ 15, 18 ], [ 16, 12 ], [ 18, 16 ], [ 19, 13 ], [ 19, 14 ], [ 19, 15 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "George knows Dolores. Carl knows Cecilia. Mitchell knows Parsa. Cecilia knows Blanche. Leigh knows Elliot. Todd knows Randy. Selena knows Marcia. Todd knows Charity. Norman knows Lily. Selena knows Gabe. Selena knows Eugenia. Blanche knows Leigh. Todd knows George. Dolores knows Mitchell. Lily knows Donna. Dewey knows Carl. Eugenia knows Dewey. Parsa knows Norman. Which of Donna and Elliot can Todd reach?", "answer": "Donna", "steps": [ "Todd knows George.", "George knows Dolores.", "Dolores knows Mitchell.", "Mitchell knows Parsa.", "Parsa knows Norman.", "Norman knows Lily.", "Lily knows Donna." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Todd", "Charity", "Parsa", "Mitchell", "Lily", "Randy", "George", "Norman", "Dolores", "Donna", "Selena", "Gabe", "Cecilia", "Carl", "Leigh", "Marcia", "Eugenia", "Blanche", "Dewey", "Elliot" ], "edges": [ [ 0, 1 ], [ 0, 5 ], [ 0, 6 ], [ 2, 7 ], [ 3, 2 ], [ 4, 9 ], [ 6, 8 ], [ 7, 4 ], [ 8, 3 ], [ 10, 11 ], [ 10, 15 ], [ 10, 16 ], [ 12, 17 ], [ 13, 12 ], [ 14, 19 ], [ 16, 18 ], [ 17, 14 ], [ 18, 13 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Adam knows Callum. Harper knows Charlene. Callum knows Kurt. Lola knows Emery. Adam knows Harper. Susanne knows Peggy. Bryan knows Keith. Graeme knows Rosa. Pedro knows Kieran. Susanne knows Pedro. Keith knows Maureen. Pedro knows Darrell. Adam knows Lola. Susanne knows Luther. Luther knows Bryan. Harper knows Todd. Peggy knows Don. Kurt knows Graeme. Which of Bryan and Kurt can Susanne reach?", "answer": "Bryan", "steps": [ "Susanne knows Luther.", "Luther knows Bryan." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Susanne", "Bryan", "Maureen", "Luther", "Pedro", "Kieran", "Keith", "Don", "Darrell", "Peggy", "Adam", "Kurt", "Rosa", "Callum", "Harper", "Charlene", "Graeme", "Emery", "Todd", "Lola" ], "edges": [ [ 0, 3 ], [ 0, 4 ], [ 0, 9 ], [ 1, 6 ], [ 3, 1 ], [ 4, 5 ], [ 4, 8 ], [ 6, 2 ], [ 9, 7 ], [ 10, 13 ], [ 10, 14 ], [ 10, 19 ], [ 11, 16 ], [ 13, 11 ], [ 14, 15 ], [ 14, 18 ], [ 16, 12 ], [ 19, 17 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Frank knows Lucas. Estella knows Delilah. Aubrey knows Jarvis. Aubrey knows Stella. Lucas knows Maya. Eugene knows Agnes. Roland knows Estella. Wendell knows Conrad. Wendell knows Aria. Aubrey knows Tiffany. Wendell knows Leopold. Jarvis knows Giselle. Jarvis knows Alyson. Jarvis knows Diana. Lucas knows Wendell. Frank knows Eugene. Lucas knows Colby. Roland knows Aubrey. Which of Lucas and Aubrey can Roland reach?", "answer": "Aubrey", "steps": [ "Roland knows Aubrey." ], "difficulty": 1, "original_distance": 3, "idx_to_symbol": [ "Roland", "Estella", "Tiffany", "Aubrey", "Jarvis", "Delilah", "Stella", "Diana", "Alyson", "Giselle", "Frank", "Eugene", "Colby", "Lucas", "Wendell", "Agnes", "Maya", "Conrad", "Leopold", "Aria" ], "edges": [ [ 0, 1 ], [ 0, 3 ], [ 1, 5 ], [ 3, 2 ], [ 3, 6 ], [ 3, 4 ], [ 4, 7 ], [ 4, 8 ], [ 4, 9 ], [ 10, 11 ], [ 10, 13 ], [ 11, 15 ], [ 13, 12 ], [ 13, 16 ], [ 13, 14 ], [ 14, 17 ], [ 14, 18 ], [ 14, 19 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Ellen knows Warren. Joaquin knows Gina. Emanuel knows Gustavo. Ken knows Martha. Carter knows Jem. Dennis knows Alma. Gina knows Isaac. Jules knows Ken. Ken knows Ellen. Erma knows Jules. Calvin knows Theodore. Jules knows Emanuel. Warren knows Lily. Lily knows Jack. Joaquin knows Dennis. Julius knows Joaquin. Gina knows Carter. Jem knows Calvin. Which of Jules and Joaquin can Erma reach?", "answer": "Jules", "steps": [ "Erma knows Jules." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Erma", "Warren", "Gustavo", "Ken", "Jules", "Ellen", "Martha", "Jack", "Lily", "Emanuel", "Julius", "Jem", "Alma", "Gina", "Joaquin", "Carter", "Isaac", "Theodore", "Calvin", "Dennis" ], "edges": [ [ 0, 4 ], [ 1, 8 ], [ 3, 6 ], [ 3, 5 ], [ 4, 3 ], [ 4, 9 ], [ 5, 1 ], [ 8, 7 ], [ 9, 2 ], [ 10, 14 ], [ 11, 18 ], [ 13, 16 ], [ 13, 15 ], [ 14, 13 ], [ 14, 19 ], [ 15, 11 ], [ 18, 17 ], [ 19, 12 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Ainsley knows Brody. Dean knows Anna. Fergus knows Cliff. Kelly knows Fergus. Stefan knows Dean. Archer knows Dirk. Clinton knows Kathleen. Kirk knows Ainsley. Percy knows Clinton. Brody knows Archer. Brody knows Dawn. Ramon knows Marilyn. Dirk knows Cara. Clinton knows Stefan. Miranda knows Percy. Kathleen knows Beth. Dawn knows Kelly. Beth knows Ramon. Which of Kelly and Beth can Kirk reach?", "answer": "Kelly", "steps": [ "Kirk knows Ainsley.", "Ainsley knows Brody.", "Brody knows Dawn.", "Dawn knows Kelly." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Kirk", "Archer", "Cara", "Brody", "Fergus", "Dirk", "Cliff", "Ainsley", "Kelly", "Dawn", "Miranda", "Stefan", "Anna", "Clinton", "Ramon", "Dean", "Marilyn", "Percy", "Beth", "Kathleen" ], "edges": [ [ 0, 7 ], [ 1, 5 ], [ 3, 1 ], [ 3, 9 ], [ 4, 6 ], [ 5, 2 ], [ 7, 3 ], [ 8, 4 ], [ 9, 8 ], [ 10, 17 ], [ 11, 15 ], [ 13, 11 ], [ 13, 19 ], [ 14, 16 ], [ 15, 12 ], [ 17, 13 ], [ 18, 14 ], [ 19, 18 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Adam knows Jenna. Lucy knows Colby. Emanuel knows Dirk. Helene knows Emanuel. Jenna knows Lucy. Arturo knows Chloe. Beverly knows Alana. Simon knows Constance. Simon knows Aubrey. Rowan knows Lydia. Alana knows Kendra. Franklin knows Helene. Franklin knows Alejandro. Lucy knows Simon. Constance knows Beverly. Dirk knows Robert. Arturo knows Franklin. Lydia knows Arturo. Which of Helene and Constance can Rowan reach?", "answer": "Helene", "steps": [ "Rowan knows Lydia.", "Lydia knows Arturo.", "Arturo knows Franklin.", "Franklin knows Helene." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Rowan", "Chloe", "Franklin", "Arturo", "Dirk", "Emanuel", "Helene", "Lydia", "Alejandro", "Robert", "Adam", "Colby", "Simon", "Lucy", "Alana", "Beverly", "Constance", "Jenna", "Aubrey", "Kendra" ], "edges": [ [ 0, 7 ], [ 2, 8 ], [ 2, 6 ], [ 3, 1 ], [ 3, 2 ], [ 4, 9 ], [ 5, 4 ], [ 6, 5 ], [ 7, 3 ], [ 10, 17 ], [ 12, 18 ], [ 12, 16 ], [ 13, 11 ], [ 13, 12 ], [ 14, 19 ], [ 15, 14 ], [ 16, 15 ], [ 17, 13 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Bennett knows Jeff. Aspen knows Israel. Aspen knows Gerald. Israel knows Everett. Jeff knows Della. Leland knows Saul. Leland knows Geoffrey. Grace knows Zane. Dora knows Bennett. Saul knows Lara. Geoffrey knows Gordon. Reid knows Dora. Yvette knows Fabian. Saul knows Malik. Malik knows Yvette. Everett knows Cesar. Zane knows Leland. Bennett knows Aspen. Which of Fabian and Cesar can Reid reach?", "answer": "Cesar", "steps": [ "Reid knows Dora.", "Dora knows Bennett.", "Bennett knows Aspen.", "Aspen knows Israel.", "Israel knows Everett.", "Everett knows Cesar." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Reid", "Jeff", "Gerald", "Aspen", "Israel", "Della", "Bennett", "Cesar", "Dora", "Everett", "Grace", "Geoffrey", "Lara", "Saul", "Malik", "Gordon", "Leland", "Fabian", "Zane", "Yvette" ], "edges": [ [ 0, 8 ], [ 1, 5 ], [ 3, 2 ], [ 3, 4 ], [ 4, 9 ], [ 6, 1 ], [ 6, 3 ], [ 8, 6 ], [ 9, 7 ], [ 10, 18 ], [ 11, 15 ], [ 13, 12 ], [ 13, 14 ], [ 14, 19 ], [ 16, 11 ], [ 16, 13 ], [ 18, 16 ], [ 19, 17 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Aspen knows Carla. Garrison knows Aspen. Aspen knows Greg. Aspen knows Callum. Clinton knows Darla. Darla knows Peter. Bennett knows Celia. Heather knows Garrison. Celia knows Jesse. Federico knows Anton. Callum knows Barry. Federico knows Glenn. Glenn knows Eli. Jesse knows Federico. Donald knows Aiden. Federico knows Raquel. Bennett knows Donald. Clinton knows Heather. Which of Eli and Barry can Bennett reach?", "answer": "Eli", "steps": [ "Bennett knows Celia.", "Celia knows Jesse.", "Jesse knows Federico.", "Federico knows Glenn.", "Glenn knows Eli." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Bennett", "Anton", "Eli", "Federico", "Aiden", "Celia", "Donald", "Glenn", "Raquel", "Jesse", "Clinton", "Carla", "Barry", "Aspen", "Peter", "Heather", "Darla", "Callum", "Greg", "Garrison" ], "edges": [ [ 0, 6 ], [ 0, 5 ], [ 3, 1 ], [ 3, 7 ], [ 3, 8 ], [ 5, 9 ], [ 6, 4 ], [ 7, 2 ], [ 9, 3 ], [ 10, 16 ], [ 10, 15 ], [ 13, 11 ], [ 13, 17 ], [ 13, 18 ], [ 15, 19 ], [ 16, 14 ], [ 17, 12 ], [ 19, 13 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Ivan knows Gus. Ivan knows Patrick. Celia knows Effie. Celia knows Conrad. Arthur knows Alison. Colin knows Nancy. Colin knows Kamila. Harrison knows Alvin. Ivan knows Colin. Lydia knows Louise. Celia knows Kane. Effie knows Harrison. Kane knows Heidi. Kamila knows Hayley. Effie knows Lydia. Heidi knows Wilson. Gus knows Arthur. Nancy knows Aiden. Which of Effie and Colin can Celia reach?", "answer": "Effie", "steps": [ "Celia knows Effie." ], "difficulty": 1, "original_distance": 3, "idx_to_symbol": [ "Celia", "Conrad", "Wilson", "Lydia", "Effie", "Kane", "Heidi", "Alvin", "Louise", "Harrison", "Ivan", "Patrick", "Alison", "Nancy", "Colin", "Gus", "Arthur", "Hayley", "Aiden", "Kamila" ], "edges": [ [ 0, 1 ], [ 0, 5 ], [ 0, 4 ], [ 3, 8 ], [ 4, 3 ], [ 4, 9 ], [ 5, 6 ], [ 6, 2 ], [ 9, 7 ], [ 10, 11 ], [ 10, 15 ], [ 10, 14 ], [ 13, 18 ], [ 14, 13 ], [ 14, 19 ], [ 15, 16 ], [ 16, 12 ], [ 19, 17 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Guy knows Hilda. Joanna knows Arthur. Hilda knows Zach. Roland knows Will. Chance knows Joanna. Will knows Ramona. Erwin knows Brittany. Erwin knows Derrick. Connor knows Melody. Elise knows Kendra. Connor knows Kurt. Kendra knows Chance. Guy knows Roland. Elise knows Irving. Zach knows Connor. Irving knows Arnold. Arnold knows Erwin. Ramona knows Deanna. Which of Connor and Erwin can Elise reach?", "answer": "Erwin", "steps": [ "Elise knows Irving.", "Irving knows Arnold.", "Arnold knows Erwin." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Elise", "Erwin", "Kendra", "Arnold", "Chance", "Brittany", "Irving", "Joanna", "Arthur", "Derrick", "Guy", "Connor", "Roland", "Zach", "Will", "Kurt", "Hilda", "Ramona", "Deanna", "Melody" ], "edges": [ [ 0, 2 ], [ 0, 6 ], [ 1, 5 ], [ 1, 9 ], [ 2, 4 ], [ 3, 1 ], [ 4, 7 ], [ 6, 3 ], [ 7, 8 ], [ 10, 12 ], [ 10, 16 ], [ 11, 15 ], [ 11, 19 ], [ 12, 14 ], [ 13, 11 ], [ 14, 17 ], [ 16, 13 ], [ 17, 18 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "John knows Clyde. Julian knows Luella. Lawrence knows Julian. Mara knows Alana. Daphna knows Dudley. John knows Dustin. Leonard knows Walt. Clyde knows Dave. Luella knows Elise. Walt knows Kerry. John knows Gustavo. Fleur knows Erma. Leonard knows Mara. Luella knows Daphna. Fleur knows Lawrence. Fleur knows Nash. Dave knows Leonard. Elise knows Aldo. Which of Julian and Dave can John reach?", "answer": "Dave", "steps": [ "John knows Clyde.", "Clyde knows Dave." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "John", "Alana", "Gustavo", "Leonard", "Walt", "Mara", "Clyde", "Dustin", "Kerry", "Dave", "Fleur", "Dudley", "Erma", "Luella", "Elise", "Daphna", "Lawrence", "Nash", "Aldo", "Julian" ], "edges": [ [ 0, 2 ], [ 0, 7 ], [ 0, 6 ], [ 3, 5 ], [ 3, 4 ], [ 4, 8 ], [ 5, 1 ], [ 6, 9 ], [ 9, 3 ], [ 10, 12 ], [ 10, 17 ], [ 10, 16 ], [ 13, 15 ], [ 13, 14 ], [ 14, 18 ], [ 15, 11 ], [ 16, 19 ], [ 19, 13 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Julius knows Nell. Seth knows Kelly. Coral knows Peggy. Leigh knows Saul. Luna knows Calvin. Coral knows Boyd. Martha knows Coral. Kelly knows Carrie. Levi knows Seth. Seth knows Luna. Levi knows Tanya. Martha knows Allen. Martha knows Jude. Levi knows Connor. Boyd knows Julius. Boyd knows Carter. Kelly knows Leigh. Peggy knows Renee. Which of Boyd and Kelly can Levi reach?", "answer": "Kelly", "steps": [ "Levi knows Seth.", "Seth knows Kelly." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Levi", "Calvin", "Saul", "Luna", "Kelly", "Carrie", "Tanya", "Leigh", "Seth", "Connor", "Martha", "Renee", "Nell", "Peggy", "Boyd", "Carter", "Allen", "Julius", "Coral", "Jude" ], "edges": [ [ 0, 6 ], [ 0, 8 ], [ 0, 9 ], [ 3, 1 ], [ 4, 5 ], [ 4, 7 ], [ 7, 2 ], [ 8, 3 ], [ 8, 4 ], [ 10, 16 ], [ 10, 18 ], [ 10, 19 ], [ 13, 11 ], [ 14, 15 ], [ 14, 17 ], [ 17, 12 ], [ 18, 13 ], [ 18, 14 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Yvette knows Regina. Christina knows Celeste. Joanna knows Sue. Patrick knows Electra. Sue knows Yvette. Patrick knows Georgia. Joanna knows Christina. Alison knows Stephanie. Georgia knows Glen. Patrick knows Declan. Sue knows Isla. Georgia knows Alison. Joanna knows Frank. Joanna knows Barbara. Yvette knows Kennedy. Declan knows Gustavo. Alison knows Chance. Patrick knows India. Which of Yvette and Alison can Joanna reach?", "answer": "Yvette", "steps": [ "Joanna knows Sue.", "Sue knows Yvette." ], "difficulty": 2, "original_distance": 3, "idx_to_symbol": [ "Joanna", "Yvette", "Christina", "Isla", "Sue", "Frank", "Kennedy", "Barbara", "Celeste", "Regina", "Patrick", "Alison", "Declan", "Glen", "Georgia", "India", "Stephanie", "Electra", "Gustavo", "Chance" ], "edges": [ [ 0, 5 ], [ 0, 7 ], [ 0, 2 ], [ 0, 4 ], [ 1, 6 ], [ 1, 9 ], [ 2, 8 ], [ 4, 3 ], [ 4, 1 ], [ 10, 15 ], [ 10, 17 ], [ 10, 12 ], [ 10, 14 ], [ 11, 16 ], [ 11, 19 ], [ 12, 18 ], [ 14, 13 ], [ 14, 11 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Karina knows Virgil. June knows Jaime. Karina knows Devon. Brooke knows Eduardo. Demetrius knows Israel. Israel knows Melody. Brooke knows Lars. Vanessa knows June. Lars knows Vanessa. Archie knows Ilene. Fanny knows Brett. June knows Elias. Devon knows Trevor. Israel knows Elliot. Virgil knows Demetrius. Eduardo knows Ben. Ben knows Fanny. Trevor knows Archie. Which of Elias and Elliot can Karina reach?", "answer": "Elliot", "steps": [ "Karina knows Virgil.", "Virgil knows Demetrius.", "Demetrius knows Israel.", "Israel knows Elliot." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Karina", "Israel", "Trevor", "Demetrius", "Devon", "Archie", "Elliot", "Virgil", "Melody", "Ilene", "Brooke", "June", "Ben", "Vanessa", "Eduardo", "Fanny", "Elias", "Lars", "Jaime", "Brett" ], "edges": [ [ 0, 7 ], [ 0, 4 ], [ 1, 6 ], [ 1, 8 ], [ 2, 5 ], [ 3, 1 ], [ 4, 2 ], [ 5, 9 ], [ 7, 3 ], [ 10, 17 ], [ 10, 14 ], [ 11, 16 ], [ 11, 18 ], [ 12, 15 ], [ 13, 11 ], [ 14, 12 ], [ 15, 19 ], [ 17, 13 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Denver knows Cornelius. Damian knows Dewey. Destiny knows Lorraine. Pablo knows Molly. Denver knows Jack. Jordan knows Karina. Reed knows Owen. Destiny knows Jordan. Jordan knows Pablo. Denver knows Haley. Jordan knows Reed. Denver knows Damian. Jack knows Clyde. Keaton knows Shane. Keaton knows Denver. Luella knows Destiny. Paul knows Keaton. Jordan knows Flora. Which of Jordan and Denver can Luella reach?", "answer": "Jordan", "steps": [ "Luella knows Destiny.", "Destiny knows Jordan." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Luella", "Lorraine", "Destiny", "Molly", "Karina", "Jordan", "Reed", "Pablo", "Owen", "Flora", "Paul", "Shane", "Keaton", "Dewey", "Haley", "Denver", "Jack", "Damian", "Clyde", "Cornelius" ], "edges": [ [ 0, 2 ], [ 2, 1 ], [ 2, 5 ], [ 5, 4 ], [ 5, 7 ], [ 5, 6 ], [ 5, 9 ], [ 6, 8 ], [ 7, 3 ], [ 10, 12 ], [ 12, 11 ], [ 12, 15 ], [ 15, 14 ], [ 15, 17 ], [ 15, 16 ], [ 15, 19 ], [ 16, 18 ], [ 17, 13 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Lana knows Hayley. Mildred knows Mitchell. Arlene knows Davis. Arden knows Agnes. Angela knows Lana. Hayley knows Hunter. Charlotte knows Adrian. Karl knows Marco. Fanny knows Arden. Effie knows Angela. Mitchell knows Wayne. Angela knows Brody. Effie knows Charlotte. Mildred knows Arlene. Charlotte knows Jakob. Adrian knows April. Arlene knows Fanny. Mitchell knows Karl. Which of Agnes and Hunter can Effie reach?", "answer": "Hunter", "steps": [ "Effie knows Angela.", "Angela knows Lana.", "Lana knows Hayley.", "Hayley knows Hunter." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Effie", "Angela", "Jakob", "Lana", "Charlotte", "Hayley", "Brody", "Adrian", "Hunter", "April", "Mildred", "Arlene", "Wayne", "Fanny", "Mitchell", "Arden", "Davis", "Karl", "Agnes", "Marco" ], "edges": [ [ 0, 1 ], [ 0, 4 ], [ 1, 6 ], [ 1, 3 ], [ 3, 5 ], [ 4, 2 ], [ 4, 7 ], [ 5, 8 ], [ 7, 9 ], [ 10, 11 ], [ 10, 14 ], [ 11, 16 ], [ 11, 13 ], [ 13, 15 ], [ 14, 12 ], [ 14, 17 ], [ 15, 18 ], [ 17, 19 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Felix knows Mike. Alma knows Harry. Grace knows Enrique. Emily knows Grace. Harry knows Howard. Mike knows Ray. Jerome knows Jakob. Ray knows Todd. Jakob knows Ellis. Kara knows Brody. Mike knows Yasmin. Todd knows Jerome. Lorenzo knows Kara. Brody knows Cruz. Ellis knows Jessica. Enrique knows Lorenzo. Harry knows Emily. Jessica knows Blanche. Which of Mike and Harry can Felix reach?", "answer": "Mike", "steps": [ "Felix knows Mike." ], "difficulty": 1, "original_distance": 8, "idx_to_symbol": [ "Felix", "Blanche", "Mike", "Ray", "Jakob", "Yasmin", "Todd", "Jessica", "Ellis", "Jerome", "Alma", "Cruz", "Harry", "Emily", "Lorenzo", "Howard", "Grace", "Brody", "Kara", "Enrique" ], "edges": [ [ 0, 2 ], [ 2, 5 ], [ 2, 3 ], [ 3, 6 ], [ 4, 8 ], [ 6, 9 ], [ 7, 1 ], [ 8, 7 ], [ 9, 4 ], [ 10, 12 ], [ 12, 15 ], [ 12, 13 ], [ 13, 16 ], [ 14, 18 ], [ 16, 19 ], [ 17, 11 ], [ 18, 17 ], [ 19, 14 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Kirk knows Nora. Isla knows Vanessa. Isla knows Florence. Isla knows Sylvia. Lilia knows Ramona. Xander knows Enrique. Florence knows Darnell. Uma knows Lilia. Ramona knows Vera. Dora knows Hattie. Melody knows Kirk. Kirk knows Xander. Jeremiah knows Dora. Darnell knows Foster. Enrique knows Donna. Kirk knows Gerald. Uma knows Isla. Melody knows Jeremiah. Which of Donna and Foster can Uma reach?", "answer": "Foster", "steps": [ "Uma knows Isla.", "Isla knows Florence.", "Florence knows Darnell.", "Darnell knows Foster." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Uma", "Ramona", "Florence", "Lilia", "Vera", "Sylvia", "Foster", "Vanessa", "Isla", "Darnell", "Melody", "Dora", "Xander", "Jeremiah", "Hattie", "Nora", "Donna", "Gerald", "Kirk", "Enrique" ], "edges": [ [ 0, 3 ], [ 0, 8 ], [ 1, 4 ], [ 2, 9 ], [ 3, 1 ], [ 8, 5 ], [ 8, 7 ], [ 8, 2 ], [ 9, 6 ], [ 10, 13 ], [ 10, 18 ], [ 11, 14 ], [ 12, 19 ], [ 13, 11 ], [ 18, 15 ], [ 18, 17 ], [ 18, 12 ], [ 19, 16 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Emmett knows Lois. Arturo knows Spencer. Dane knows Tabitha. Dane knows Eduardo. Ira knows Roman. Tabitha knows Harrison. Margaret knows Arturo. Terrence knows Sandy. Harrison knows Emmett. Spencer knows Gene. Ira knows Margaret. Terrence knows Ira. Emmett knows Josie. Vera knows Pedro. Vera knows Dane. Vera knows Sam. Spencer knows Leander. Terrence knows Opal. Which of Tabitha and Margaret can Terrence reach?", "answer": "Margaret", "steps": [ "Terrence knows Ira.", "Ira knows Margaret." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Terrence", "Roman", "Spencer", "Leander", "Margaret", "Gene", "Opal", "Sandy", "Arturo", "Ira", "Vera", "Eduardo", "Emmett", "Josie", "Tabitha", "Lois", "Pedro", "Sam", "Harrison", "Dane" ], "edges": [ [ 0, 6 ], [ 0, 7 ], [ 0, 9 ], [ 2, 3 ], [ 2, 5 ], [ 4, 8 ], [ 8, 2 ], [ 9, 1 ], [ 9, 4 ], [ 10, 16 ], [ 10, 17 ], [ 10, 19 ], [ 12, 13 ], [ 12, 15 ], [ 14, 18 ], [ 18, 12 ], [ 19, 11 ], [ 19, 14 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Vicki knows Miranda. Rowan knows Kay. Rowan knows Percy. Jameson knows Lamont. Rachel knows Lennox. Miranda knows Rowan. Lennox knows Fanny. Lennox knows Garrett. Lennox knows Peggy. Rowan knows Ford. Garrett knows Kenneth. Ford knows Margaret. Merle knows Hayley. Autumn knows Rachel. Kenneth knows Jameson. Jameson knows Griffith. Margaret knows Merle. Merle knows Marvin. Which of Jameson and Merle can Vicki reach?", "answer": "Merle", "steps": [ "Vicki knows Miranda.", "Miranda knows Rowan.", "Rowan knows Ford.", "Ford knows Margaret.", "Margaret knows Merle." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Vicki", "Miranda", "Ford", "Hayley", "Marvin", "Percy", "Rowan", "Kay", "Margaret", "Merle", "Autumn", "Rachel", "Garrett", "Lamont", "Griffith", "Fanny", "Lennox", "Peggy", "Kenneth", "Jameson" ], "edges": [ [ 0, 1 ], [ 1, 6 ], [ 2, 8 ], [ 6, 5 ], [ 6, 7 ], [ 6, 2 ], [ 8, 9 ], [ 9, 3 ], [ 9, 4 ], [ 10, 11 ], [ 11, 16 ], [ 12, 18 ], [ 16, 15 ], [ 16, 17 ], [ 16, 12 ], [ 18, 19 ], [ 19, 13 ], [ 19, 14 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Keira knows Humphrey. Lillian knows Federico. Walter knows Zach. Harold knows Eileen. Zach knows Griffith. Lacey knows Leroy. Eileen knows Carla. Eugene knows Harold. Lorraine knows Eugene. Humphrey knows Russ. Forrest knows Demetrius. Griffith knows Lillian. Leroy knows Forrest. Demetrius knows Jameson. Keith knows Elias. Elias knows Keira. Humphrey knows Lacey. Eileen knows Walter. Which of Keira and Harold can Lorraine reach?", "answer": "Harold", "steps": [ "Lorraine knows Eugene.", "Eugene knows Harold." ], "difficulty": 2, "original_distance": 8, "idx_to_symbol": [ "Lorraine", "Harold", "Zach", "Federico", "Eugene", "Griffith", "Eileen", "Lillian", "Walter", "Carla", "Keith", "Keira", "Leroy", "Jameson", "Elias", "Forrest", "Humphrey", "Demetrius", "Lacey", "Russ" ], "edges": [ [ 0, 4 ], [ 1, 6 ], [ 2, 5 ], [ 4, 1 ], [ 5, 7 ], [ 6, 8 ], [ 6, 9 ], [ 7, 3 ], [ 8, 2 ], [ 10, 14 ], [ 11, 16 ], [ 12, 15 ], [ 14, 11 ], [ 15, 17 ], [ 16, 18 ], [ 16, 19 ], [ 17, 13 ], [ 18, 12 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Jake knows Helen. Nina knows Derrick. Shaun knows Esperanza. Luis knows Bernadette. Karl knows Luis. Nadine knows Nina. Karl knows Elton. Karl knows Ethan. Nina knows Karl. Shaun knows Jake. Jake knows Celia. Celia knows Simon. Jake knows Hayden. Jake knows Emery. Karl knows Lark. Esperanza knows Seth. Derrick knows Daphne. Whitney knows Shaun. Which of Luis and Celia can Nadine reach?", "answer": "Luis", "steps": [ "Nadine knows Nina.", "Nina knows Karl.", "Karl knows Luis." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Nadine", "Bernadette", "Daphne", "Elton", "Lark", "Derrick", "Luis", "Ethan", "Nina", "Karl", "Whitney", "Simon", "Seth", "Hayden", "Emery", "Esperanza", "Celia", "Helen", "Shaun", "Jake" ], "edges": [ [ 0, 8 ], [ 5, 2 ], [ 6, 1 ], [ 8, 5 ], [ 8, 9 ], [ 9, 3 ], [ 9, 4 ], [ 9, 6 ], [ 9, 7 ], [ 10, 18 ], [ 15, 12 ], [ 16, 11 ], [ 18, 15 ], [ 18, 19 ], [ 19, 13 ], [ 19, 14 ], [ 19, 16 ], [ 19, 17 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Percy knows Carrie. Percy knows Joaquin. Lyric knows Eileen. Carrie knows Jade. Jane knows Wayne. Laura knows Julius. Sheila knows Livia. Evelyn knows Florence. Wayne knows Diego. Percy knows Richard. Julius knows Lyric. Lyric knows Randy. Laura knows Jane. Travis knows Jason. Evelyn knows Flora. Joaquin knows Travis. Laura knows Sheila. Richard knows Evelyn. Which of Julius and Richard can Percy reach?", "answer": "Richard", "steps": [ "Percy knows Richard." ], "difficulty": 1, "original_distance": 3, "idx_to_symbol": [ "Percy", "Jade", "Carrie", "Richard", "Florence", "Travis", "Evelyn", "Jason", "Flora", "Joaquin", "Laura", "Livia", "Sheila", "Julius", "Randy", "Wayne", "Lyric", "Diego", "Eileen", "Jane" ], "edges": [ [ 0, 2 ], [ 0, 3 ], [ 0, 9 ], [ 2, 1 ], [ 3, 6 ], [ 5, 7 ], [ 6, 4 ], [ 6, 8 ], [ 9, 5 ], [ 10, 12 ], [ 10, 13 ], [ 10, 19 ], [ 12, 11 ], [ 13, 16 ], [ 15, 17 ], [ 16, 14 ], [ 16, 18 ], [ 19, 15 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Hattie knows Edgar. Naomi knows Darcy. Haley knows Zara. Hattie knows Denver. Hattie knows Haley. Humphrey knows Jake. Hank knows Joel. Edison knows Pedro. Pedro knows Clayton. Pedro knows Naomi. Naomi knows Hank. Zara knows Arlene. Edgar knows Wesley. Gregory knows Kurt. Edgar knows Gregory. Jake knows Leroy. Pedro knows Humphrey. Marlene knows Hattie. Which of Hattie and Pedro can Edison reach?", "answer": "Pedro", "steps": [ "Edison knows Pedro." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Edison", "Clayton", "Naomi", "Hank", "Leroy", "Joel", "Darcy", "Pedro", "Jake", "Humphrey", "Marlene", "Denver", "Edgar", "Gregory", "Arlene", "Kurt", "Wesley", "Hattie", "Zara", "Haley" ], "edges": [ [ 0, 7 ], [ 2, 3 ], [ 2, 6 ], [ 3, 5 ], [ 7, 1 ], [ 7, 2 ], [ 7, 9 ], [ 8, 4 ], [ 9, 8 ], [ 10, 17 ], [ 12, 13 ], [ 12, 16 ], [ 13, 15 ], [ 17, 11 ], [ 17, 12 ], [ 17, 19 ], [ 18, 14 ], [ 19, 18 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Yvette knows Glen. Glen knows Jacques. Elena knows Gladys. Jacques knows Edgar. Brittany knows Heather. Ruth knows Yvette. Elena knows Zoe. Helen knows Kennedy. Helen knows Joshua. Alice knows Merle. Wilma knows Cate. Victoria knows Elena. Ruth knows Darius. Elena knows Brittany. Zoe knows Leo. Jacques knows Alice. Jacques knows Wilma. Joshua knows Victoria. Which of Glen and Victoria can Helen reach?", "answer": "Victoria", "steps": [ "Helen knows Joshua.", "Joshua knows Victoria." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Helen", "Elena", "Gladys", "Victoria", "Kennedy", "Leo", "Heather", "Joshua", "Zoe", "Brittany", "Ruth", "Jacques", "Edgar", "Glen", "Darius", "Merle", "Cate", "Yvette", "Alice", "Wilma" ], "edges": [ [ 0, 4 ], [ 0, 7 ], [ 1, 2 ], [ 1, 8 ], [ 1, 9 ], [ 3, 1 ], [ 7, 3 ], [ 8, 5 ], [ 9, 6 ], [ 10, 14 ], [ 10, 17 ], [ 11, 12 ], [ 11, 18 ], [ 11, 19 ], [ 13, 11 ], [ 17, 13 ], [ 18, 15 ], [ 19, 16 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Sidney knows Willis. Fanny knows Lloyd. Chester knows Sidney. Harold knows Harry. Lloyd knows Chester. Willis knows Yolanda. Harold knows Luella. Laverne knows Anton. Wendell knows Harold. Willis knows Betty. Sidney knows Callum. Wendell knows Alison. Chester knows Sandra. Lloyd knows Etta. Anton knows Griffith. Anton knows Curtis. Griffith knows Wendell. Griffith knows Finn. Which of Harold and Willis can Fanny reach?", "answer": "Willis", "steps": [ "Fanny knows Lloyd.", "Lloyd knows Chester.", "Chester knows Sidney.", "Sidney knows Willis." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Fanny", "Callum", "Willis", "Etta", "Yolanda", "Chester", "Betty", "Lloyd", "Sandra", "Sidney", "Laverne", "Alison", "Harold", "Curtis", "Luella", "Griffith", "Harry", "Anton", "Finn", "Wendell" ], "edges": [ [ 0, 7 ], [ 2, 4 ], [ 2, 6 ], [ 5, 8 ], [ 5, 9 ], [ 7, 3 ], [ 7, 5 ], [ 9, 1 ], [ 9, 2 ], [ 10, 17 ], [ 12, 14 ], [ 12, 16 ], [ 15, 18 ], [ 15, 19 ], [ 17, 13 ], [ 17, 15 ], [ 19, 11 ], [ 19, 12 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Gage knows Bart. Boyd knows Bernice. Simon knows Pedro. Jordan knows Beau. Leopold knows Darrell. Erwin knows Nathan. Bernice knows Gonzalo. Bernice knows Bonnie. Frankie knows Boyd. Francesca knows Jermaine. Bart knows Erwin. Leopold knows Gage. Bart knows Damien. Bernice knows Hattie. Beau knows Leopold. Leopold knows Kay. Francesca knows Simon. Hattie knows Francesca. Which of Erwin and Simon can Frankie reach?", "answer": "Simon", "steps": [ "Frankie knows Boyd.", "Boyd knows Bernice.", "Bernice knows Hattie.", "Hattie knows Francesca.", "Francesca knows Simon." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Frankie", "Jermaine", "Pedro", "Hattie", "Boyd", "Simon", "Francesca", "Bernice", "Bonnie", "Gonzalo", "Jordan", "Damien", "Nathan", "Gage", "Beau", "Erwin", "Bart", "Leopold", "Kay", "Darrell" ], "edges": [ [ 0, 4 ], [ 3, 6 ], [ 4, 7 ], [ 5, 2 ], [ 6, 1 ], [ 6, 5 ], [ 7, 3 ], [ 7, 8 ], [ 7, 9 ], [ 10, 14 ], [ 13, 16 ], [ 14, 17 ], [ 15, 12 ], [ 16, 11 ], [ 16, 15 ], [ 17, 13 ], [ 17, 18 ], [ 17, 19 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Adam knows Callum. Harper knows Charlene. Callum knows Kurt. Lola knows Emery. Adam knows Harper. Susanne knows Peggy. Bryan knows Keith. Graeme knows Rosa. Pedro knows Kieran. Susanne knows Pedro. Keith knows Maureen. Pedro knows Darrell. Adam knows Lola. Susanne knows Luther. Luther knows Bryan. Harper knows Todd. Peggy knows Don. Kurt knows Graeme. Which of Luther and Callum can Susanne reach?", "answer": "Luther", "steps": [ "Susanne knows Luther." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Susanne", "Bryan", "Maureen", "Luther", "Pedro", "Kieran", "Keith", "Don", "Darrell", "Peggy", "Adam", "Kurt", "Rosa", "Callum", "Harper", "Charlene", "Graeme", "Emery", "Todd", "Lola" ], "edges": [ [ 0, 3 ], [ 0, 4 ], [ 0, 9 ], [ 1, 6 ], [ 3, 1 ], [ 4, 5 ], [ 4, 8 ], [ 6, 2 ], [ 9, 7 ], [ 10, 13 ], [ 10, 14 ], [ 10, 19 ], [ 11, 16 ], [ 13, 11 ], [ 14, 15 ], [ 14, 18 ], [ 16, 12 ], [ 19, 17 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Hayden knows Henry. Otto knows Milo. Brett knows Shaun. Otto knows Gloria. Gloria knows Erwin. Hayden knows Grace. Milo knows Bruce. Otto knows Clay. Shaun knows Clinton. Valerie knows Louise. Fred knows Basil. Grace knows Hal. Shaun knows Hayden. Hal knows Brenda. Basil knows Otto. Basil knows Flora. Bruce knows Conner. Hayden knows Valerie. Which of Hal and Bruce can Fred reach?", "answer": "Bruce", "steps": [ "Fred knows Basil.", "Basil knows Otto.", "Otto knows Milo.", "Milo knows Bruce." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Fred", "Milo", "Clay", "Gloria", "Bruce", "Flora", "Otto", "Erwin", "Conner", "Basil", "Brett", "Grace", "Henry", "Valerie", "Hal", "Clinton", "Hayden", "Louise", "Brenda", "Shaun" ], "edges": [ [ 0, 9 ], [ 1, 4 ], [ 3, 7 ], [ 4, 8 ], [ 6, 2 ], [ 6, 3 ], [ 6, 1 ], [ 9, 5 ], [ 9, 6 ], [ 10, 19 ], [ 11, 14 ], [ 13, 17 ], [ 14, 18 ], [ 16, 12 ], [ 16, 13 ], [ 16, 11 ], [ 19, 15 ], [ 19, 16 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Charlene knows Pearl. Maude knows Colby. Karl knows Leon. Maggie knows Ibrahim. Marco knows Walt. Colby knows Marco. June knows Isadora. Isadora knows Ignacio. Walt knows Alan. Ibrahim knows Fernando. Kathleen knows Gage. Anita knows Charlene. Marco knows June. Colby knows Karl. Charlene knows Maggie. Gage knows Ruby. Pearl knows Ivan. Maggie knows Kathleen. Which of Isadora and Gage can Maude reach?", "answer": "Isadora", "steps": [ "Maude knows Colby.", "Colby knows Marco.", "Marco knows June.", "June knows Isadora." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Maude", "Ignacio", "Karl", "Marco", "Walt", "Isadora", "Leon", "June", "Colby", "Alan", "Anita", "Ruby", "Pearl", "Maggie", "Ibrahim", "Gage", "Ivan", "Kathleen", "Charlene", "Fernando" ], "edges": [ [ 0, 8 ], [ 2, 6 ], [ 3, 7 ], [ 3, 4 ], [ 4, 9 ], [ 5, 1 ], [ 7, 5 ], [ 8, 2 ], [ 8, 3 ], [ 10, 18 ], [ 12, 16 ], [ 13, 17 ], [ 13, 14 ], [ 14, 19 ], [ 15, 11 ], [ 17, 15 ], [ 18, 12 ], [ 18, 13 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Justine knows Diego. Justine knows Elise. Opal knows Cole. Opal knows Jon. Justine knows Gerard. Dustin knows Kelly. Lena knows Heath. Lena knows Deirdre. Jon knows Leticia. Dustin knows Becky. Opal knows Marion. Heath knows Opal. Elise knows Dustin. Dustin knows Carmen. Kelly knows Nash. Dustin knows Liam. Lena knows Cate. Opal knows Rick. Which of Kelly and Jon can Lena reach?", "answer": "Jon", "steps": [ "Lena knows Heath.", "Heath knows Opal.", "Opal knows Jon." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Lena", "Deirdre", "Leticia", "Cole", "Cate", "Heath", "Jon", "Marion", "Opal", "Rick", "Justine", "Gerard", "Nash", "Becky", "Diego", "Elise", "Kelly", "Liam", "Dustin", "Carmen" ], "edges": [ [ 0, 1 ], [ 0, 4 ], [ 0, 5 ], [ 5, 8 ], [ 6, 2 ], [ 8, 3 ], [ 8, 6 ], [ 8, 7 ], [ 8, 9 ], [ 10, 11 ], [ 10, 14 ], [ 10, 15 ], [ 15, 18 ], [ 16, 12 ], [ 18, 13 ], [ 18, 16 ], [ 18, 17 ], [ 18, 19 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Keira knows Humphrey. Lillian knows Federico. Walter knows Zach. Harold knows Eileen. Zach knows Griffith. Lacey knows Leroy. Eileen knows Carla. Eugene knows Harold. Lorraine knows Eugene. Humphrey knows Russ. Forrest knows Demetrius. Griffith knows Lillian. Leroy knows Forrest. Demetrius knows Jameson. Keith knows Elias. Elias knows Keira. Humphrey knows Lacey. Eileen knows Walter. Which of Jameson and Federico can Lorraine reach?", "answer": "Federico", "steps": [ "Lorraine knows Eugene.", "Eugene knows Harold.", "Harold knows Eileen.", "Eileen knows Walter.", "Walter knows Zach.", "Zach knows Griffith.", "Griffith knows Lillian.", "Lillian knows Federico." ], "difficulty": 8, "original_distance": 8, "idx_to_symbol": [ "Lorraine", "Harold", "Zach", "Federico", "Eugene", "Griffith", "Eileen", "Lillian", "Walter", "Carla", "Keith", "Keira", "Leroy", "Jameson", "Elias", "Forrest", "Humphrey", "Demetrius", "Lacey", "Russ" ], "edges": [ [ 0, 4 ], [ 1, 6 ], [ 2, 5 ], [ 4, 1 ], [ 5, 7 ], [ 6, 8 ], [ 6, 9 ], [ 7, 3 ], [ 8, 2 ], [ 10, 14 ], [ 11, 16 ], [ 12, 15 ], [ 14, 11 ], [ 15, 17 ], [ 16, 18 ], [ 16, 19 ], [ 17, 13 ], [ 18, 12 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Chase knows Wilson. Langston knows Alan. Langston knows Victor. Percy knows Marcia. Sadie knows Langston. Agnes knows Percy. Veronica knows Chance. Alan knows Chase. Hayley knows Deanna. Ember knows Freya. Hayley knows Veronica. Rufus knows Ember. Victor knows Agnes. Marcia knows Walt. Deanna knows Rufus. Chance knows Wallace. Henry knows Hayley. Freya knows Ethan. Which of Hayley and Langston can Henry reach?", "answer": "Hayley", "steps": [ "Henry knows Hayley." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Henry", "Rufus", "Freya", "Wallace", "Ethan", "Chance", "Hayley", "Deanna", "Ember", "Veronica", "Sadie", "Agnes", "Marcia", "Wilson", "Walt", "Chase", "Langston", "Victor", "Percy", "Alan" ], "edges": [ [ 0, 6 ], [ 1, 8 ], [ 2, 4 ], [ 5, 3 ], [ 6, 7 ], [ 6, 9 ], [ 7, 1 ], [ 8, 2 ], [ 9, 5 ], [ 10, 16 ], [ 11, 18 ], [ 12, 14 ], [ 15, 13 ], [ 16, 17 ], [ 16, 19 ], [ 17, 11 ], [ 18, 12 ], [ 19, 15 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Gustavo knows Bart. Marvin knows Shelby. Hendrix knows Lambert. Peter knows Marvin. Emmett knows Bernard. Peter knows Gustavo. Clay knows Alyson. Katherine knows Wendy. Aisha knows Clay. Shelby knows Katherine. Peter knows Hendrix. Nathan knows Levi. Casey knows Gus. Bernard knows Nathan. Alyson knows Ruth. Chester knows Peter. Clay knows Emmett. Clay knows Casey. Which of Emmett and Marvin can Aisha reach?", "answer": "Emmett", "steps": [ "Aisha knows Clay.", "Clay knows Emmett." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Aisha", "Levi", "Bernard", "Alyson", "Emmett", "Nathan", "Ruth", "Clay", "Casey", "Gus", "Chester", "Wendy", "Shelby", "Hendrix", "Marvin", "Katherine", "Lambert", "Peter", "Gustavo", "Bart" ], "edges": [ [ 0, 7 ], [ 2, 5 ], [ 3, 6 ], [ 4, 2 ], [ 5, 1 ], [ 7, 4 ], [ 7, 3 ], [ 7, 8 ], [ 8, 9 ], [ 10, 17 ], [ 12, 15 ], [ 13, 16 ], [ 14, 12 ], [ 15, 11 ], [ 17, 14 ], [ 17, 13 ], [ 17, 18 ], [ 18, 19 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Gene knows Peggy. Sidney knows Zach. Dina knows Herbert. Ava knows Iris. Bernice knows Morris. Alfred knows Christian. Todd knows Julia. Sidney knows Ava. Adrian knows Todd. Julia knows Wendell. Peggy knows Deborah. Peggy knows Bernice. Todd knows Dina. Herbert knows Sidney. Evan knows Alfred. Elliot knows Gene. Alfred knows Elliot. Christian knows Inez. Which of Dina and Elliot can Evan reach?", "answer": "Elliot", "steps": [ "Evan knows Alfred.", "Alfred knows Elliot." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Evan", "Christian", "Bernice", "Elliot", "Morris", "Deborah", "Inez", "Alfred", "Gene", "Peggy", "Adrian", "Julia", "Ava", "Dina", "Iris", "Zach", "Wendell", "Todd", "Herbert", "Sidney" ], "edges": [ [ 0, 7 ], [ 1, 6 ], [ 2, 4 ], [ 3, 8 ], [ 7, 1 ], [ 7, 3 ], [ 8, 9 ], [ 9, 2 ], [ 9, 5 ], [ 10, 17 ], [ 11, 16 ], [ 12, 14 ], [ 13, 18 ], [ 17, 11 ], [ 17, 13 ], [ 18, 19 ], [ 19, 12 ], [ 19, 15 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Fisher knows Val. Bernice knows Yasmin. Jared knows Keith. Terry knows Ford. Kaleb knows Fisher. Rebecca knows Elvira. Maya knows Natalie. Maya knows Javier. Elvira knows Celeste. Javier knows Kaleb. Celeste knows Bernice. Ford knows Jared. Val knows Latoya. Celeste knows Allan. Julia knows Blaine. Javier knows Everett. Blaine knows Maya. Bernice knows Terry. Which of Elvira and Blaine can Julia reach?", "answer": "Blaine", "steps": [ "Julia knows Blaine." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Julia", "Latoya", "Fisher", "Javier", "Natalie", "Everett", "Blaine", "Val", "Maya", "Kaleb", "Rebecca", "Keith", "Ford", "Bernice", "Allan", "Yasmin", "Elvira", "Jared", "Celeste", "Terry" ], "edges": [ [ 0, 6 ], [ 2, 7 ], [ 3, 5 ], [ 3, 9 ], [ 6, 8 ], [ 7, 1 ], [ 8, 4 ], [ 8, 3 ], [ 9, 2 ], [ 10, 16 ], [ 12, 17 ], [ 13, 15 ], [ 13, 19 ], [ 16, 18 ], [ 17, 11 ], [ 18, 14 ], [ 18, 13 ], [ 19, 12 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Belinda knows Langston. Isla knows Megan. Gemma knows Kingsley. Kate knows Graeme. Eugene knows Griffith. Kate knows Max. Graham knows Kate. Laura knows Devon. Griffith knows Belinda. Belinda knows Tina. Kate knows Celeste. Belinda knows Frank. Megan knows Dick. Gemma knows Isla. Julian knows Parker. Kingsley knows Graham. Parker knows Laura. Julian knows Eugene. Which of Frank and Graeme can Julian reach?", "answer": "Frank", "steps": [ "Julian knows Eugene.", "Eugene knows Griffith.", "Griffith knows Belinda.", "Belinda knows Frank." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Julian", "Parker", "Laura", "Langston", "Devon", "Frank", "Belinda", "Griffith", "Tina", "Eugene", "Gemma", "Isla", "Megan", "Celeste", "Dick", "Graeme", "Kate", "Graham", "Max", "Kingsley" ], "edges": [ [ 0, 1 ], [ 0, 9 ], [ 1, 2 ], [ 2, 4 ], [ 6, 3 ], [ 6, 5 ], [ 6, 8 ], [ 7, 6 ], [ 9, 7 ], [ 10, 11 ], [ 10, 19 ], [ 11, 12 ], [ 12, 14 ], [ 16, 13 ], [ 16, 15 ], [ 16, 18 ], [ 17, 16 ], [ 19, 17 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Felix knows Mike. Alma knows Harry. Grace knows Enrique. Emily knows Grace. Harry knows Howard. Mike knows Ray. Jerome knows Jakob. Ray knows Todd. Jakob knows Ellis. Kara knows Brody. Mike knows Yasmin. Todd knows Jerome. Lorenzo knows Kara. Brody knows Cruz. Ellis knows Jessica. Enrique knows Lorenzo. Harry knows Emily. Jessica knows Blanche. Which of Blanche and Cruz can Felix reach?", "answer": "Blanche", "steps": [ "Felix knows Mike.", "Mike knows Ray.", "Ray knows Todd.", "Todd knows Jerome.", "Jerome knows Jakob.", "Jakob knows Ellis.", "Ellis knows Jessica.", "Jessica knows Blanche." ], "difficulty": 8, "original_distance": 8, "idx_to_symbol": [ "Felix", "Blanche", "Mike", "Ray", "Jakob", "Yasmin", "Todd", "Jessica", "Ellis", "Jerome", "Alma", "Cruz", "Harry", "Emily", "Lorenzo", "Howard", "Grace", "Brody", "Kara", "Enrique" ], "edges": [ [ 0, 2 ], [ 2, 5 ], [ 2, 3 ], [ 3, 6 ], [ 4, 8 ], [ 6, 9 ], [ 7, 1 ], [ 8, 7 ], [ 9, 4 ], [ 10, 12 ], [ 12, 15 ], [ 12, 13 ], [ 13, 16 ], [ 14, 18 ], [ 16, 19 ], [ 17, 11 ], [ 18, 17 ], [ 19, 14 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Liam knows Cassidy. Jill knows Clarence. Chester knows Elsa. George knows Guillermo. Israel knows Cornelius. Guillermo knows Enrique. Cassidy knows George. Whitney knows Marlene. George knows Dawn. Chester knows Kent. Chester knows Jana. Marlene knows Elvis. Elvis knows Chester. Clarence knows Kerry. Kent knows Crystal. Jill knows Liam. George knows Becky. Whitney knows Israel. Which of Liam and Marlene can Whitney reach?", "answer": "Marlene", "steps": [ "Whitney knows Marlene." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Whitney", "Kent", "Crystal", "Israel", "Jana", "Chester", "Cornelius", "Elsa", "Elvis", "Marlene", "Jill", "Guillermo", "Enrique", "Clarence", "Dawn", "George", "Kerry", "Becky", "Cassidy", "Liam" ], "edges": [ [ 0, 3 ], [ 0, 9 ], [ 1, 2 ], [ 3, 6 ], [ 5, 1 ], [ 5, 4 ], [ 5, 7 ], [ 8, 5 ], [ 9, 8 ], [ 10, 13 ], [ 10, 19 ], [ 11, 12 ], [ 13, 16 ], [ 15, 11 ], [ 15, 14 ], [ 15, 17 ], [ 18, 15 ], [ 19, 18 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Karla knows Leticia. Homer knows Jenna. Keith knows Brett. Harley knows Edwin. Loretta knows Leopold. Harley knows Anastasia. Louise knows Karla. Louise knows Loretta. Troy knows Keaton. Louise knows Jasmine. Josie knows Louise. Anastasia knows Asher. Josie knows Jordan. Brett knows Homer. Brittany knows Dakota. Jordan knows Brittany. Harley knows Troy. Keith knows Harley. Which of Keaton and Leopold can Keith reach?", "answer": "Keaton", "steps": [ "Keith knows Harley.", "Harley knows Troy.", "Troy knows Keaton." ], "difficulty": 3, "original_distance": 3, "idx_to_symbol": [ "Keith", "Anastasia", "Harley", "Homer", "Jenna", "Brett", "Asher", "Troy", "Keaton", "Edwin", "Josie", "Karla", "Louise", "Brittany", "Dakota", "Jordan", "Leticia", "Loretta", "Leopold", "Jasmine" ], "edges": [ [ 0, 5 ], [ 0, 2 ], [ 1, 6 ], [ 2, 1 ], [ 2, 7 ], [ 2, 9 ], [ 3, 4 ], [ 5, 3 ], [ 7, 8 ], [ 10, 15 ], [ 10, 12 ], [ 11, 16 ], [ 12, 11 ], [ 12, 17 ], [ 12, 19 ], [ 13, 14 ], [ 15, 13 ], [ 17, 18 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Rowan knows Becky. Electra knows Mindy. Becky knows Ethan. Laura knows Ronald. Caroline knows Deanna. Caroline knows Ricardo. Max knows Henrietta. Becky knows Jane. Mindy knows Caroline. Ronald knows Chandler. Mindy knows Cameron. Rocco knows Max. Ethan knows Anita. Ethan knows Laura. Darren knows Tara. Deanna knows Bailey. Caroline knows Rocco. Ethan knows Darren. Which of Caroline and Ethan can Rowan reach?", "answer": "Ethan", "steps": [ "Rowan knows Becky.", "Becky knows Ethan." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Rowan", "Anita", "Darren", "Jane", "Becky", "Tara", "Laura", "Ethan", "Chandler", "Ronald", "Electra", "Ricardo", "Deanna", "Cameron", "Mindy", "Bailey", "Rocco", "Caroline", "Henrietta", "Max" ], "edges": [ [ 0, 4 ], [ 2, 5 ], [ 4, 3 ], [ 4, 7 ], [ 6, 9 ], [ 7, 1 ], [ 7, 2 ], [ 7, 6 ], [ 9, 8 ], [ 10, 14 ], [ 12, 15 ], [ 14, 13 ], [ 14, 17 ], [ 16, 19 ], [ 17, 11 ], [ 17, 12 ], [ 17, 16 ], [ 19, 18 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Earle knows Laura. Roland knows Darcy. Lucy knows Betty. Kevin knows Dixie. Yolanda knows Mae. Betty knows Kevin. Greer knows Earle. George knows Thea. Joy knows Lucy. Kevin knows Yolanda. Edna knows Wallace. Laura knows George. Dirk knows Agnes. Thea knows Roland. Ivan knows Joy. Darcy knows Dirk. Darcy knows Cecilia. Wallace knows Ivan. Which of Darcy and Kevin can Edna reach?", "answer": "Kevin", "steps": [ "Edna knows Wallace.", "Wallace knows Ivan.", "Ivan knows Joy.", "Joy knows Lucy.", "Lucy knows Betty.", "Betty knows Kevin." ], "difficulty": 6, "original_distance": 8, "idx_to_symbol": [ "Edna", "Mae", "Kevin", "Wallace", "Joy", "Lucy", "Betty", "Yolanda", "Dixie", "Ivan", "Greer", "Agnes", "Darcy", "Earle", "George", "Thea", "Roland", "Dirk", "Cecilia", "Laura" ], "edges": [ [ 0, 3 ], [ 2, 7 ], [ 2, 8 ], [ 3, 9 ], [ 4, 5 ], [ 5, 6 ], [ 6, 2 ], [ 7, 1 ], [ 9, 4 ], [ 10, 13 ], [ 12, 17 ], [ 12, 18 ], [ 13, 19 ], [ 14, 15 ], [ 15, 16 ], [ 16, 12 ], [ 17, 11 ], [ 19, 14 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Earle knows Sybil. Sierra knows Earle. Sierra knows Lyle. Anita knows Chad. Anita knows Alyson. Sally knows Roman. Priscilla knows Damien. Jacob knows Anita. Sally knows Earl. Priscilla knows Bette. Sally knows Tony. Evelyn knows Calvin. Bert knows Priscilla. Jacob knows Bert. Calvin knows Sierra. Evelyn knows Sally. Bette knows Larissa. Anita knows Mark. Which of Larissa and Sybil can Evelyn reach?", "answer": "Sybil", "steps": [ "Evelyn knows Calvin.", "Calvin knows Sierra.", "Sierra knows Earle.", "Earle knows Sybil." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Evelyn", "Sierra", "Sally", "Roman", "Sybil", "Calvin", "Earle", "Tony", "Lyle", "Earl", "Jacob", "Priscilla", "Anita", "Alyson", "Larissa", "Bert", "Bette", "Mark", "Damien", "Chad" ], "edges": [ [ 0, 5 ], [ 0, 2 ], [ 1, 6 ], [ 1, 8 ], [ 2, 3 ], [ 2, 7 ], [ 2, 9 ], [ 5, 1 ], [ 6, 4 ], [ 10, 15 ], [ 10, 12 ], [ 11, 16 ], [ 11, 18 ], [ 12, 13 ], [ 12, 17 ], [ 12, 19 ], [ 15, 11 ], [ 16, 14 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Judith knows Pearl. Tessa knows Ernesto. Diane knows Anastasia. Helen knows Heath. Jared knows Tessa. Elodie knows Chance. Jared knows Doris. Jared knows Gunnar. Gunnar knows Celeste. Denver knows James. Chance knows Judith. Pearl knows Diane. Heath knows Dina. Chance knows Charity. Heath knows Levi. Levi knows Jared. Pearl knows Jessie. Pearl knows Denver. Which of Gunnar and Diane can Helen reach?", "answer": "Gunnar", "steps": [ "Helen knows Heath.", "Heath knows Levi.", "Levi knows Jared.", "Jared knows Gunnar." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Helen", "Gunnar", "Levi", "Doris", "Heath", "Jared", "Ernesto", "Celeste", "Tessa", "Dina", "Elodie", "Diane", "Judith", "Jessie", "Chance", "Pearl", "James", "Anastasia", "Denver", "Charity" ], "edges": [ [ 0, 4 ], [ 1, 7 ], [ 2, 5 ], [ 4, 2 ], [ 4, 9 ], [ 5, 3 ], [ 5, 1 ], [ 5, 8 ], [ 8, 6 ], [ 10, 14 ], [ 11, 17 ], [ 12, 15 ], [ 14, 12 ], [ 14, 19 ], [ 15, 13 ], [ 15, 11 ], [ 15, 18 ], [ 18, 16 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Ryan knows Javier. Dustin knows Ava. Ryan knows Wyatt. Carol knows Luke. Abel knows Kristin. Abel knows Preston. Wyatt knows Paige. Griffith knows Eleanor. Preston knows Darrell. Ryan knows Dustin. Kristin knows Carol. Dustin knows Colby. Landon knows Dayton. Don knows Landon. Luke knows Hampton. Javier knows Don. Griffith knows Larry. Abel knows Griffith. Which of Dayton and Hampton can Ryan reach?", "answer": "Dayton", "steps": [ "Ryan knows Javier.", "Javier knows Don.", "Don knows Landon.", "Landon knows Dayton." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Ryan", "Javier", "Dustin", "Paige", "Dayton", "Wyatt", "Ava", "Colby", "Landon", "Don", "Abel", "Kristin", "Griffith", "Darrell", "Hampton", "Preston", "Eleanor", "Larry", "Luke", "Carol" ], "edges": [ [ 0, 5 ], [ 0, 2 ], [ 0, 1 ], [ 1, 9 ], [ 2, 6 ], [ 2, 7 ], [ 5, 3 ], [ 8, 4 ], [ 9, 8 ], [ 10, 15 ], [ 10, 12 ], [ 10, 11 ], [ 11, 19 ], [ 12, 16 ], [ 12, 17 ], [ 15, 13 ], [ 18, 14 ], [ 19, 18 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Jeremiah knows Glen. Jenny knows Jose. Arlene knows Vincent. Marie knows Allison. Bert knows Caroline. Jean knows Rufus. Jose knows Merle. Sylvia knows Jeremiah. Corinne knows Morgan. Jose knows Walter. Jenny knows Jean. Rufus knows Simon. Marie knows Esther. Arlene knows Marie. Corinne knows Jenny. Simon knows Eunice. Vincent knows Sylvia. Bert knows Arlene. Which of Eunice and Glen can Corinne reach?", "answer": "Eunice", "steps": [ "Corinne knows Jenny.", "Jenny knows Jean.", "Jean knows Rufus.", "Rufus knows Simon.", "Simon knows Eunice." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Corinne", "Jose", "Simon", "Morgan", "Eunice", "Jenny", "Rufus", "Jean", "Walter", "Merle", "Bert", "Marie", "Jeremiah", "Caroline", "Glen", "Arlene", "Sylvia", "Vincent", "Allison", "Esther" ], "edges": [ [ 0, 3 ], [ 0, 5 ], [ 1, 8 ], [ 1, 9 ], [ 2, 4 ], [ 5, 7 ], [ 5, 1 ], [ 6, 2 ], [ 7, 6 ], [ 10, 13 ], [ 10, 15 ], [ 11, 18 ], [ 11, 19 ], [ 12, 14 ], [ 15, 17 ], [ 15, 11 ], [ 16, 12 ], [ 17, 16 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Warren knows Nancy. John knows Austin. Atlas knows John. Constance knows Claude. John knows Zara. Austin knows Daphne. Bart knows Hunter. Alma knows Ray. Bart knows Warren. Hunter knows Henrietta. Ray knows Hannah. Don knows Atlas. Bart knows Clyde. Hannah knows Bart. John knows Constance. Hunter knows Celia. Allison knows Don. Austin knows Carla. Which of Hunter and Austin can Allison reach?", "answer": "Austin", "steps": [ "Allison knows Don.", "Don knows Atlas.", "Atlas knows John.", "John knows Austin." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Allison", "Constance", "Austin", "Don", "Zara", "Atlas", "Carla", "Claude", "John", "Daphne", "Alma", "Warren", "Hunter", "Ray", "Clyde", "Hannah", "Celia", "Nancy", "Bart", "Henrietta" ], "edges": [ [ 0, 3 ], [ 1, 7 ], [ 2, 6 ], [ 2, 9 ], [ 3, 5 ], [ 5, 8 ], [ 8, 4 ], [ 8, 1 ], [ 8, 2 ], [ 10, 13 ], [ 11, 17 ], [ 12, 16 ], [ 12, 19 ], [ 13, 15 ], [ 15, 18 ], [ 18, 14 ], [ 18, 11 ], [ 18, 12 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Gladys knows Jenna. Cristina knows Peggy. Ursula knows Leigh. Antonio knows Guy. Sally knows Carmela. Gladys knows Lola. Catherine knows Monroe. Leigh knows Sally. Rebecca knows Arturo. Charles knows Jonathan. Rebecca knows Antonio. Sally knows Noel. Justine knows Charles. Guy knows Tom. Catherine knows Justine. Guy knows Cristina. Peggy knows Gladys. Charles knows Ursula. Which of Gladys and Sally can Catherine reach?", "answer": "Sally", "steps": [ "Catherine knows Justine.", "Justine knows Charles.", "Charles knows Ursula.", "Ursula knows Leigh.", "Leigh knows Sally." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Catherine", "Charles", "Jonathan", "Noel", "Ursula", "Justine", "Sally", "Carmela", "Monroe", "Leigh", "Rebecca", "Guy", "Tom", "Lola", "Cristina", "Antonio", "Gladys", "Jenna", "Arturo", "Peggy" ], "edges": [ [ 0, 8 ], [ 0, 5 ], [ 1, 2 ], [ 1, 4 ], [ 4, 9 ], [ 5, 1 ], [ 6, 3 ], [ 6, 7 ], [ 9, 6 ], [ 10, 18 ], [ 10, 15 ], [ 11, 12 ], [ 11, 14 ], [ 14, 19 ], [ 15, 11 ], [ 16, 13 ], [ 16, 17 ], [ 19, 16 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Laurel knows Zach. Zelda knows Clifford. Celia knows Atlas. Guy knows Celia. Russell knows Grady. Laurel knows Guy. Casey knows Keaton. Laurel knows Franklin. Dwight knows Tom. Keaton knows Daphna. Tom knows Russell. Imogen knows Jenny. Aaron knows Laurel. Daphna knows Aaron. Luna knows Imogen. Grady knows Zelda. Zelda knows Luna. Zelda knows Cornelius. Which of Grady and Aaron can Dwight reach?", "answer": "Grady", "steps": [ "Dwight knows Tom.", "Tom knows Russell.", "Russell knows Grady." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Dwight", "Grady", "Jenny", "Zelda", "Clifford", "Luna", "Russell", "Imogen", "Tom", "Cornelius", "Casey", "Aaron", "Atlas", "Laurel", "Zach", "Guy", "Daphna", "Celia", "Keaton", "Franklin" ], "edges": [ [ 0, 8 ], [ 1, 3 ], [ 3, 4 ], [ 3, 5 ], [ 3, 9 ], [ 5, 7 ], [ 6, 1 ], [ 7, 2 ], [ 8, 6 ], [ 10, 18 ], [ 11, 13 ], [ 13, 14 ], [ 13, 15 ], [ 13, 19 ], [ 15, 17 ], [ 16, 11 ], [ 17, 12 ], [ 18, 16 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Luis knows Michael. Jim knows Lynn. Winston knows Alana. Stella knows Winston. George knows Eve. Michael knows Nell. Andrea knows Carey. Lenora knows Paul. Eve knows Carol. Luis knows Harlan. Michael knows Stella. Alan knows Fraser. Eden knows Jim. Alan knows George. Alana knows Eden. Andrea knows Alan. Magdalena knows Lenora. Carol knows Magdalena. Which of Paul and Lynn can Luis reach?", "answer": "Lynn", "steps": [ "Luis knows Michael.", "Michael knows Stella.", "Stella knows Winston.", "Winston knows Alana.", "Alana knows Eden.", "Eden knows Jim.", "Jim knows Lynn." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Luis", "Winston", "Stella", "Eden", "Harlan", "Lynn", "Jim", "Alana", "Michael", "Nell", "Andrea", "Eve", "George", "Magdalena", "Carey", "Paul", "Lenora", "Carol", "Alan", "Fraser" ], "edges": [ [ 0, 4 ], [ 0, 8 ], [ 1, 7 ], [ 2, 1 ], [ 3, 6 ], [ 6, 5 ], [ 7, 3 ], [ 8, 2 ], [ 8, 9 ], [ 10, 14 ], [ 10, 18 ], [ 11, 17 ], [ 12, 11 ], [ 13, 16 ], [ 16, 15 ], [ 17, 13 ], [ 18, 12 ], [ 18, 19 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Russell knows Ibrahim. Heath knows Joel. Richard knows Oliver. Virginia knows Simon. Joel knows Jaime. Oliver knows Rocco. Taylor knows Zack. Kelsey knows Fleur. Simon knows Kelsey. Devon knows Russell. Rocco knows Heath. Russell knows Charity. Virginia knows Devon. Alan knows Brooks. Fleur knows Taylor. Norman knows Alan. Richard knows Norman. Alan knows Cora. Which of Joel and Taylor can Richard reach?", "answer": "Joel", "steps": [ "Richard knows Oliver.", "Oliver knows Rocco.", "Rocco knows Heath.", "Heath knows Joel." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Richard", "Norman", "Joel", "Cora", "Heath", "Jaime", "Alan", "Oliver", "Rocco", "Brooks", "Virginia", "Devon", "Taylor", "Ibrahim", "Fleur", "Zack", "Russell", "Simon", "Kelsey", "Charity" ], "edges": [ [ 0, 7 ], [ 0, 1 ], [ 1, 6 ], [ 2, 5 ], [ 4, 2 ], [ 6, 3 ], [ 6, 9 ], [ 7, 8 ], [ 8, 4 ], [ 10, 17 ], [ 10, 11 ], [ 11, 16 ], [ 12, 15 ], [ 14, 12 ], [ 16, 13 ], [ 16, 19 ], [ 17, 18 ], [ 18, 14 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Effie knows Irving. Pierce knows Myrtle. Pat knows Luis. Howard knows Daphne. Blanche knows Lance. Pierce knows Howard. Daphne knows Dustin. Pat knows Effie. Irving knows Colby. Greg knows Jarvis. Lance knows Sierra. Irving knows Avery. Daphne knows Greg. Howard knows Leticia. Myrtle knows Elvis. Greg knows Willis. Effie knows June. Blanche knows Pat. Which of Jarvis and Avery can Blanche reach?", "answer": "Avery", "steps": [ "Blanche knows Pat.", "Pat knows Effie.", "Effie knows Irving.", "Irving knows Avery." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Blanche", "Luis", "Sierra", "Lance", "Colby", "Effie", "Irving", "June", "Avery", "Pat", "Pierce", "Leticia", "Elvis", "Myrtle", "Willis", "Daphne", "Greg", "Dustin", "Jarvis", "Howard" ], "edges": [ [ 0, 3 ], [ 0, 9 ], [ 3, 2 ], [ 5, 7 ], [ 5, 6 ], [ 6, 4 ], [ 6, 8 ], [ 9, 1 ], [ 9, 5 ], [ 10, 13 ], [ 10, 19 ], [ 13, 12 ], [ 15, 17 ], [ 15, 16 ], [ 16, 14 ], [ 16, 18 ], [ 19, 11 ], [ 19, 15 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Owen knows Sylvia. Shannon knows Adele. Ramona knows Jewel. Ramona knows Jim. Louisa knows Karla. Shannon knows Vanessa. Karla knows Neville. Matt knows Ebony. Ebony knows Imogen. Dana knows Owen. Karla knows Martin. Hudson knows Dewey. Louisa knows Karina. Dana knows Ann. Jim knows Dana. Ebony knows Louisa. Owen knows Shannon. Hudson knows Matt. Which of Owen and Louisa can Ramona reach?", "answer": "Owen", "steps": [ "Ramona knows Jim.", "Jim knows Dana.", "Dana knows Owen." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Ramona", "Vanessa", "Owen", "Shannon", "Jim", "Dana", "Adele", "Ann", "Sylvia", "Jewel", "Hudson", "Neville", "Louisa", "Karla", "Matt", "Ebony", "Martin", "Imogen", "Karina", "Dewey" ], "edges": [ [ 0, 4 ], [ 0, 9 ], [ 2, 3 ], [ 2, 8 ], [ 3, 1 ], [ 3, 6 ], [ 4, 5 ], [ 5, 7 ], [ 5, 2 ], [ 10, 14 ], [ 10, 19 ], [ 12, 13 ], [ 12, 18 ], [ 13, 11 ], [ 13, 16 ], [ 14, 15 ], [ 15, 17 ], [ 15, 12 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Rena knows Lola. Federico knows Flora. Sheryl knows Bart. Flora knows Eldon. Flora knows Keaton. April knows Ralph. Beau knows Jacob. April knows Beau. Elvis knows April. Flora knows Carlos. Keaton knows Rena. April knows Sheryl. Julius knows Gerald. Eldon knows Erma. Carlos knows Burt. Ralph knows Rose. Lola knows Kingsley. Bart knows Julius. Which of Lola and Julius can Federico reach?", "answer": "Lola", "steps": [ "Federico knows Flora.", "Flora knows Keaton.", "Keaton knows Rena.", "Rena knows Lola." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Federico", "Erma", "Rena", "Keaton", "Carlos", "Burt", "Eldon", "Lola", "Kingsley", "Flora", "Elvis", "Rose", "Bart", "Sheryl", "Beau", "Jacob", "Ralph", "Julius", "Gerald", "April" ], "edges": [ [ 0, 9 ], [ 2, 7 ], [ 3, 2 ], [ 4, 5 ], [ 6, 1 ], [ 7, 8 ], [ 9, 4 ], [ 9, 6 ], [ 9, 3 ], [ 10, 19 ], [ 12, 17 ], [ 13, 12 ], [ 14, 15 ], [ 16, 11 ], [ 17, 18 ], [ 19, 14 ], [ 19, 16 ], [ 19, 13 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Marshall knows Leopold. Marshall knows Latoya. Oscar knows Marshall. Clayton knows Harry. Henry knows Estelle. Oscar knows Pam. Marshall knows Otto. Graeme knows Devin. Graeme knows Paul. Paul knows Kobe. Harry knows Elliot. Elliot knows Roger. Paul knows Henry. Brock knows Porter. Estelle knows Finn. Finn knows Brock. Latoya knows Clayton. Paul knows Jolene. Which of Marshall and Paul can Graeme reach?", "answer": "Paul", "steps": [ "Graeme knows Paul." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Graeme", "Brock", "Jolene", "Paul", "Devin", "Finn", "Henry", "Porter", "Kobe", "Estelle", "Oscar", "Elliot", "Otto", "Marshall", "Pam", "Harry", "Latoya", "Roger", "Leopold", "Clayton" ], "edges": [ [ 0, 4 ], [ 0, 3 ], [ 1, 7 ], [ 3, 2 ], [ 3, 8 ], [ 3, 6 ], [ 5, 1 ], [ 6, 9 ], [ 9, 5 ], [ 10, 14 ], [ 10, 13 ], [ 11, 17 ], [ 13, 12 ], [ 13, 18 ], [ 13, 16 ], [ 15, 11 ], [ 16, 19 ], [ 19, 15 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Pedro knows Russ. Russ knows Pam. Judy knows Clark. Sylvia knows Greg. Sylvia knows Pedro. Pedro knows Harmony. Adrian knows Clay. Clark knows Claudia. Clay knows Stacy. Sylvia knows Leonard. Adrian knows Neville. Judy knows Ernest. Ruth knows Geoffrey. Neville knows Kylie. Russ knows Ruth. Adrian knows Parsa. Clay knows Judy. Leonard knows Chandler. Which of Clark and Ruth can Sylvia reach?", "answer": "Ruth", "steps": [ "Sylvia knows Pedro.", "Pedro knows Russ.", "Russ knows Ruth." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Sylvia", "Pam", "Geoffrey", "Russ", "Pedro", "Greg", "Harmony", "Chandler", "Leonard", "Ruth", "Adrian", "Ernest", "Claudia", "Judy", "Clay", "Parsa", "Stacy", "Kylie", "Neville", "Clark" ], "edges": [ [ 0, 5 ], [ 0, 8 ], [ 0, 4 ], [ 3, 1 ], [ 3, 9 ], [ 4, 6 ], [ 4, 3 ], [ 8, 7 ], [ 9, 2 ], [ 10, 15 ], [ 10, 18 ], [ 10, 14 ], [ 13, 11 ], [ 13, 19 ], [ 14, 16 ], [ 14, 13 ], [ 18, 17 ], [ 19, 12 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Wallace knows Ted. Humphrey knows Brynn. Cristina knows Harold. Wallace knows Effie. George knows Harry. Delilah knows Stuart. Gwen knows Humphrey. Ashley knows Cristina. Daisy knows Wyatt. Humphrey knows Jose. Wyatt knows Gwen. Ted knows Emma. George knows Daisy. Effie knows Vivian. Gwen knows Delilah. Ashley knows Melissa. Ted knows Garrett. Harold knows Wallace. Which of Stuart and Vivian can Ashley reach?", "answer": "Vivian", "steps": [ "Ashley knows Cristina.", "Cristina knows Harold.", "Harold knows Wallace.", "Wallace knows Effie.", "Effie knows Vivian." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Ashley", "Cristina", "Ted", "Wallace", "Vivian", "Emma", "Harold", "Effie", "Garrett", "Melissa", "George", "Daisy", "Humphrey", "Gwen", "Stuart", "Jose", "Wyatt", "Delilah", "Brynn", "Harry" ], "edges": [ [ 0, 1 ], [ 0, 9 ], [ 1, 6 ], [ 2, 5 ], [ 2, 8 ], [ 3, 7 ], [ 3, 2 ], [ 6, 3 ], [ 7, 4 ], [ 10, 11 ], [ 10, 19 ], [ 11, 16 ], [ 12, 15 ], [ 12, 18 ], [ 13, 17 ], [ 13, 12 ], [ 16, 13 ], [ 17, 14 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Justine knows Diego. Justine knows Elise. Opal knows Cole. Opal knows Jon. Justine knows Gerard. Dustin knows Kelly. Lena knows Heath. Lena knows Deirdre. Jon knows Leticia. Dustin knows Becky. Opal knows Marion. Heath knows Opal. Elise knows Dustin. Dustin knows Carmen. Kelly knows Nash. Dustin knows Liam. Lena knows Cate. Opal knows Rick. Which of Dustin and Opal can Lena reach?", "answer": "Opal", "steps": [ "Lena knows Heath.", "Heath knows Opal." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Lena", "Deirdre", "Leticia", "Cole", "Cate", "Heath", "Jon", "Marion", "Opal", "Rick", "Justine", "Gerard", "Nash", "Becky", "Diego", "Elise", "Kelly", "Liam", "Dustin", "Carmen" ], "edges": [ [ 0, 1 ], [ 0, 4 ], [ 0, 5 ], [ 5, 8 ], [ 6, 2 ], [ 8, 3 ], [ 8, 6 ], [ 8, 7 ], [ 8, 9 ], [ 10, 11 ], [ 10, 14 ], [ 10, 15 ], [ 15, 18 ], [ 16, 12 ], [ 18, 13 ], [ 18, 16 ], [ 18, 17 ], [ 18, 19 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Helen knows Palmer. Clifford knows Helen. Lacey knows Adelaide. Yasmin knows Louis. Kristin knows Yasmin. Yasmin knows Coral. Dante knows Eli. Yasmin knows Dante. Clifford knows Jaime. Vicki knows Jill. Louis knows Vicki. Clifford knows Etta. Louis knows Camille. Jaime knows Reed. Vicki knows Edgar. Jaime knows Lacey. Josie knows Clifford. Lacey knows Colin. Which of Louis and Jaime can Josie reach?", "answer": "Jaime", "steps": [ "Josie knows Clifford.", "Clifford knows Jaime." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Josie", "Clifford", "Etta", "Helen", "Palmer", "Jaime", "Adelaide", "Colin", "Reed", "Lacey", "Kristin", "Yasmin", "Coral", "Dante", "Eli", "Louis", "Jill", "Edgar", "Camille", "Vicki" ], "edges": [ [ 0, 1 ], [ 1, 2 ], [ 1, 3 ], [ 1, 5 ], [ 3, 4 ], [ 5, 8 ], [ 5, 9 ], [ 9, 6 ], [ 9, 7 ], [ 10, 11 ], [ 11, 12 ], [ 11, 13 ], [ 11, 15 ], [ 13, 14 ], [ 15, 18 ], [ 15, 19 ], [ 19, 16 ], [ 19, 17 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Chase knows Wilson. Langston knows Alan. Langston knows Victor. Percy knows Marcia. Sadie knows Langston. Agnes knows Percy. Veronica knows Chance. Alan knows Chase. Hayley knows Deanna. Ember knows Freya. Hayley knows Veronica. Rufus knows Ember. Victor knows Agnes. Marcia knows Walt. Deanna knows Rufus. Chance knows Wallace. Henry knows Hayley. Freya knows Ethan. Which of Marcia and Freya can Henry reach?", "answer": "Freya", "steps": [ "Henry knows Hayley.", "Hayley knows Deanna.", "Deanna knows Rufus.", "Rufus knows Ember.", "Ember knows Freya." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Henry", "Rufus", "Freya", "Wallace", "Ethan", "Chance", "Hayley", "Deanna", "Ember", "Veronica", "Sadie", "Agnes", "Marcia", "Wilson", "Walt", "Chase", "Langston", "Victor", "Percy", "Alan" ], "edges": [ [ 0, 6 ], [ 1, 8 ], [ 2, 4 ], [ 5, 3 ], [ 6, 7 ], [ 6, 9 ], [ 7, 1 ], [ 8, 2 ], [ 9, 5 ], [ 10, 16 ], [ 11, 18 ], [ 12, 14 ], [ 15, 13 ], [ 16, 17 ], [ 16, 19 ], [ 17, 11 ], [ 18, 12 ], [ 19, 15 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Magdalena knows Duncan. Paul knows Claire. Anton knows Frankie. Darla knows Chantal. Conrad knows Dana. Tony knows Leo. Drake knows Anton. Magdalena knows Logan. Chantal knows Jacques. Joshua knows Kara. Nicholas knows Paul. Duncan knows Joshua. Dana knows Darla. Leo knows Drake. Nicholas knows Charlene. Kara knows Conrad. Shelly knows Tony. Claire knows Shelly. Which of Frankie and Jacques can Nicholas reach?", "answer": "Frankie", "steps": [ "Nicholas knows Paul.", "Paul knows Claire.", "Claire knows Shelly.", "Shelly knows Tony.", "Tony knows Leo.", "Leo knows Drake.", "Drake knows Anton.", "Anton knows Frankie." ], "difficulty": 8, "original_distance": 8, "idx_to_symbol": [ "Nicholas", "Leo", "Charlene", "Frankie", "Paul", "Shelly", "Tony", "Claire", "Drake", "Anton", "Magdalena", "Dana", "Logan", "Jacques", "Duncan", "Kara", "Conrad", "Joshua", "Darla", "Chantal" ], "edges": [ [ 0, 2 ], [ 0, 4 ], [ 1, 8 ], [ 4, 7 ], [ 5, 6 ], [ 6, 1 ], [ 7, 5 ], [ 8, 9 ], [ 9, 3 ], [ 10, 12 ], [ 10, 14 ], [ 11, 18 ], [ 14, 17 ], [ 15, 16 ], [ 16, 11 ], [ 17, 15 ], [ 18, 19 ], [ 19, 13 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Emmett knows Lois. Arturo knows Spencer. Dane knows Tabitha. Dane knows Eduardo. Ira knows Roman. Tabitha knows Harrison. Margaret knows Arturo. Terrence knows Sandy. Harrison knows Emmett. Spencer knows Gene. Ira knows Margaret. Terrence knows Ira. Emmett knows Josie. Vera knows Pedro. Vera knows Dane. Vera knows Sam. Spencer knows Leander. Terrence knows Opal. Which of Arturo and Harrison can Terrence reach?", "answer": "Arturo", "steps": [ "Terrence knows Ira.", "Ira knows Margaret.", "Margaret knows Arturo." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Terrence", "Roman", "Spencer", "Leander", "Margaret", "Gene", "Opal", "Sandy", "Arturo", "Ira", "Vera", "Eduardo", "Emmett", "Josie", "Tabitha", "Lois", "Pedro", "Sam", "Harrison", "Dane" ], "edges": [ [ 0, 6 ], [ 0, 7 ], [ 0, 9 ], [ 2, 3 ], [ 2, 5 ], [ 4, 8 ], [ 8, 2 ], [ 9, 1 ], [ 9, 4 ], [ 10, 16 ], [ 10, 17 ], [ 10, 19 ], [ 12, 13 ], [ 12, 15 ], [ 14, 18 ], [ 18, 12 ], [ 19, 11 ], [ 19, 14 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Alison knows Caleb. Dean knows Atlas. Dean knows Lenora. Zachary knows Joanna. Ibrahim knows Alison. Zachary knows Kerry. Martha knows Ibrahim. Rick knows Malik. Atlas knows Byron. Darius knows Edith. Atlas knows Rick. Darius knows Dean. Joanna knows Carl. Carl knows Sharon. Serena knows Haley. Alison knows Zachary. Joanna knows Victoria. Haley knows Darius. Which of Darius and Alison can Serena reach?", "answer": "Darius", "steps": [ "Serena knows Haley.", "Haley knows Darius." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Serena", "Edith", "Rick", "Dean", "Lenora", "Darius", "Byron", "Malik", "Atlas", "Haley", "Martha", "Caleb", "Carl", "Zachary", "Kerry", "Alison", "Victoria", "Sharon", "Joanna", "Ibrahim" ], "edges": [ [ 0, 9 ], [ 2, 7 ], [ 3, 4 ], [ 3, 8 ], [ 5, 1 ], [ 5, 3 ], [ 8, 6 ], [ 8, 2 ], [ 9, 5 ], [ 10, 19 ], [ 12, 17 ], [ 13, 14 ], [ 13, 18 ], [ 15, 11 ], [ 15, 13 ], [ 18, 16 ], [ 18, 12 ], [ 19, 15 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Wilbur knows Xavier. Landon knows Wilbur. Holly knows Vanessa. Abigail knows Arden. Arden knows Edison. Vanessa knows Leonard. Lyle knows Devin. Abigail knows Holly. Beatrice knows Theodore. Lennox knows Conrad. Rowan knows Abigail. Theodore knows Landon. Theodore knows Lennox. Colin knows Ryan. Edison knows Luz. Conrad knows Louis. Devin knows Rowan. Ryan knows Beatrice. Which of Vanessa and Wilbur can Colin reach?", "answer": "Wilbur", "steps": [ "Colin knows Ryan.", "Ryan knows Beatrice.", "Beatrice knows Theodore.", "Theodore knows Landon.", "Landon knows Wilbur." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Colin", "Landon", "Conrad", "Louis", "Theodore", "Beatrice", "Wilbur", "Xavier", "Lennox", "Ryan", "Lyle", "Holly", "Edison", "Luz", "Abigail", "Rowan", "Vanessa", "Leonard", "Arden", "Devin" ], "edges": [ [ 0, 9 ], [ 1, 6 ], [ 2, 3 ], [ 4, 1 ], [ 4, 8 ], [ 5, 4 ], [ 6, 7 ], [ 8, 2 ], [ 9, 5 ], [ 10, 19 ], [ 11, 16 ], [ 12, 13 ], [ 14, 11 ], [ 14, 18 ], [ 15, 14 ], [ 16, 17 ], [ 18, 12 ], [ 19, 15 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Christopher knows Jodi. Clinton knows Alvin. Gonzalo knows Boyd. Naomi knows Livia. Alvin knows Christopher. Alvin knows Miriam. Alvin knows Marcia. Boyd knows Erica. Sidney knows Perry. Jodi knows Herbert. Dirk knows Naomi. Naomi knows Skyler. Harry knows Eugene. Yara knows Harry. Livia knows Sidney. Miriam knows Yara. Skyler knows Gonzalo. Naomi knows Connor. Which of Eugene and Erica can Clinton reach?", "answer": "Eugene", "steps": [ "Clinton knows Alvin.", "Alvin knows Miriam.", "Miriam knows Yara.", "Yara knows Harry.", "Harry knows Eugene." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Clinton", "Alvin", "Marcia", "Herbert", "Yara", "Miriam", "Eugene", "Jodi", "Harry", "Christopher", "Dirk", "Naomi", "Connor", "Perry", "Gonzalo", "Skyler", "Erica", "Sidney", "Boyd", "Livia" ], "edges": [ [ 0, 1 ], [ 1, 2 ], [ 1, 5 ], [ 1, 9 ], [ 4, 8 ], [ 5, 4 ], [ 7, 3 ], [ 8, 6 ], [ 9, 7 ], [ 10, 11 ], [ 11, 12 ], [ 11, 15 ], [ 11, 19 ], [ 14, 18 ], [ 15, 14 ], [ 17, 13 ], [ 18, 16 ], [ 19, 17 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Zachary knows Ella. Darnell knows Zachary. Ella knows Jasper. Merle knows Melody. Parker knows Matthew. Kathleen knows Fletcher. Kathleen knows Kane. Ella knows Israel. Matthew knows Aspen. Kathleen knows Marilyn. Aspen knows Kathleen. Melody knows Darnell. Lara knows Ryan. Ryan knows Daniella. Dalton knows Merle. Merle knows Lydia. Ryan knows Parker. Ella knows Valerie. Which of Matthew and Darnell can Dalton reach?", "answer": "Darnell", "steps": [ "Dalton knows Merle.", "Merle knows Melody.", "Melody knows Darnell." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Dalton", "Jasper", "Ella", "Valerie", "Melody", "Israel", "Darnell", "Lydia", "Zachary", "Merle", "Lara", "Marilyn", "Kathleen", "Kane", "Parker", "Fletcher", "Matthew", "Daniella", "Aspen", "Ryan" ], "edges": [ [ 0, 9 ], [ 2, 1 ], [ 2, 3 ], [ 2, 5 ], [ 4, 6 ], [ 6, 8 ], [ 8, 2 ], [ 9, 7 ], [ 9, 4 ], [ 10, 19 ], [ 12, 11 ], [ 12, 13 ], [ 12, 15 ], [ 14, 16 ], [ 16, 18 ], [ 18, 12 ], [ 19, 17 ], [ 19, 14 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Riley knows Edith. Lawson knows Edison. Alvin knows Andre. Trina knows Riley. Riley knows Lionel. Iris knows Wendell. Jeanne knows Lawson. Lionel knows Elliot. Lawson knows Leroy. Rick knows Gary. Alvin knows Clara. Wendell knows Peter. Peter knows Gareth. Gary knows Jeanne. Peter knows Rick. Benjamin knows Trina. Janet knows Alvin. Elliot knows Janet. Which of Janet and Jeanne can Benjamin reach?", "answer": "Janet", "steps": [ "Benjamin knows Trina.", "Trina knows Riley.", "Riley knows Lionel.", "Lionel knows Elliot.", "Elliot knows Janet." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Benjamin", "Edith", "Janet", "Trina", "Riley", "Andre", "Lionel", "Clara", "Elliot", "Alvin", "Iris", "Gareth", "Jeanne", "Wendell", "Peter", "Edison", "Rick", "Leroy", "Gary", "Lawson" ], "edges": [ [ 0, 3 ], [ 2, 9 ], [ 3, 4 ], [ 4, 1 ], [ 4, 6 ], [ 6, 8 ], [ 8, 2 ], [ 9, 5 ], [ 9, 7 ], [ 10, 13 ], [ 12, 19 ], [ 13, 14 ], [ 14, 11 ], [ 14, 16 ], [ 16, 18 ], [ 18, 12 ], [ 19, 15 ], [ 19, 17 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Wendy knows Wade. Jamie knows Wendy. Justine knows Jamie. Lamont knows Nell. Wendy knows Owen. Gail knows Helene. Gail knows Anna. Vera knows Jewel. Arthur knows Lamont. Ivy knows Vera. Owen knows Bernadette. Federico knows Gail. Cecilia knows Jacob. Owen knows Arthur. Helene knows Ivy. Jacob knows Federico. Dahlia knows Justine. Helene knows Kristina. Which of Federico and Jamie can Dahlia reach?", "answer": "Jamie", "steps": [ "Dahlia knows Justine.", "Justine knows Jamie." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Dahlia", "Justine", "Lamont", "Bernadette", "Owen", "Wade", "Nell", "Wendy", "Jamie", "Arthur", "Cecilia", "Jacob", "Vera", "Kristina", "Helene", "Anna", "Jewel", "Gail", "Federico", "Ivy" ], "edges": [ [ 0, 1 ], [ 1, 8 ], [ 2, 6 ], [ 4, 3 ], [ 4, 9 ], [ 7, 5 ], [ 7, 4 ], [ 8, 7 ], [ 9, 2 ], [ 10, 11 ], [ 11, 18 ], [ 12, 16 ], [ 14, 13 ], [ 14, 19 ], [ 17, 15 ], [ 17, 14 ], [ 18, 17 ], [ 19, 12 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Antonio knows Margaret. Dirk knows Mitchell. Margaret knows Sonia. Lucia knows Constance. Isaac knows Emmett. Magdalena knows Isaac. Glenn knows Essie. Serena knows Glenn. Khashayar knows Riley. Sonia knows Khashayar. Constance knows Jasmine. Lucia knows Dirk. Emmett knows Bailey. Tyler knows Javier. Mitchell knows Brent. Tyler knows Serena. Jasmine knows Magdalena. Javier knows Antonio. Which of Magdalena and Margaret can Lucia reach?", "answer": "Magdalena", "steps": [ "Lucia knows Constance.", "Constance knows Jasmine.", "Jasmine knows Magdalena." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Lucia", "Dirk", "Brent", "Bailey", "Magdalena", "Mitchell", "Jasmine", "Isaac", "Constance", "Emmett", "Tyler", "Serena", "Essie", "Riley", "Margaret", "Glenn", "Antonio", "Sonia", "Javier", "Khashayar" ], "edges": [ [ 0, 1 ], [ 0, 8 ], [ 1, 5 ], [ 4, 7 ], [ 5, 2 ], [ 6, 4 ], [ 7, 9 ], [ 8, 6 ], [ 9, 3 ], [ 10, 11 ], [ 10, 18 ], [ 11, 15 ], [ 14, 17 ], [ 15, 12 ], [ 16, 14 ], [ 17, 19 ], [ 18, 16 ], [ 19, 13 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Estella knows Israel. Percy knows Cornelius. Rocco knows Ralph. Sam knows Cooper. Estella knows Percy. Graham knows Basil. Cooper knows Graham. Herman knows Clark. Dalton knows Herman. Cornelius knows Ursula. Basil knows Camille. Sam knows Rocco. Herman knows Don. Dalton knows Estella. Cooper knows Monica. Darin knows Sam. Rocco knows Adelaide. Bonnie knows Dalton. Which of Cooper and Estella can Bonnie reach?", "answer": "Estella", "steps": [ "Bonnie knows Dalton.", "Dalton knows Estella." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Bonnie", "Don", "Cornelius", "Ursula", "Dalton", "Herman", "Percy", "Estella", "Clark", "Israel", "Darin", "Ralph", "Basil", "Camille", "Sam", "Rocco", "Graham", "Cooper", "Adelaide", "Monica" ], "edges": [ [ 0, 4 ], [ 2, 3 ], [ 4, 5 ], [ 4, 7 ], [ 5, 1 ], [ 5, 8 ], [ 6, 2 ], [ 7, 6 ], [ 7, 9 ], [ 10, 14 ], [ 12, 13 ], [ 14, 15 ], [ 14, 17 ], [ 15, 11 ], [ 15, 18 ], [ 16, 12 ], [ 17, 16 ], [ 17, 19 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Sierra knows Lana. Judith knows Ezra. Landon knows Sara. Lana knows Fred. Emanuel knows Giselle. Judith knows Chase. Bette knows Judith. Ezra knows Cate. Vivian knows Wesley. Cruz knows Landon. Hunter knows Vivian. Landon knows Jeanne. Cate knows Wanda. Wanda knows Hunter. Fred knows Emanuel. Landon knows Jordan. Jeanne knows Sierra. Judith knows Chloe. Which of Giselle and Wesley can Bette reach?", "answer": "Wesley", "steps": [ "Bette knows Judith.", "Judith knows Ezra.", "Ezra knows Cate.", "Cate knows Wanda.", "Wanda knows Hunter.", "Hunter knows Vivian.", "Vivian knows Wesley." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Bette", "Wesley", "Judith", "Ezra", "Chase", "Hunter", "Cate", "Chloe", "Vivian", "Wanda", "Cruz", "Giselle", "Landon", "Jeanne", "Sara", "Fred", "Sierra", "Jordan", "Emanuel", "Lana" ], "edges": [ [ 0, 2 ], [ 2, 4 ], [ 2, 7 ], [ 2, 3 ], [ 3, 6 ], [ 5, 8 ], [ 6, 9 ], [ 8, 1 ], [ 9, 5 ], [ 10, 12 ], [ 12, 14 ], [ 12, 17 ], [ 12, 13 ], [ 13, 16 ], [ 15, 18 ], [ 16, 19 ], [ 18, 11 ], [ 19, 15 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Quinn knows Kristina. Ava knows Rufus. Bette knows Raymond. Ava knows Anita. Fanny knows Nicole. Janice knows Vivian. Janice knows Enid. Janice knows Quinn. Rufus knows Fanny. Nicole knows Enrique. Madeline knows Griffith. Kristina knows Edith. Ava knows Bette. Enid knows Anton. Glenda knows Madeline. Edith knows Glenda. Enrique knows Jonathan. Jonathan knows Dahlia. Which of Rufus and Quinn can Ava reach?", "answer": "Rufus", "steps": [ "Ava knows Rufus." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Ava", "Raymond", "Dahlia", "Jonathan", "Enrique", "Rufus", "Bette", "Nicole", "Anita", "Fanny", "Janice", "Anton", "Griffith", "Madeline", "Glenda", "Quinn", "Enid", "Edith", "Vivian", "Kristina" ], "edges": [ [ 0, 6 ], [ 0, 8 ], [ 0, 5 ], [ 3, 2 ], [ 4, 3 ], [ 5, 9 ], [ 6, 1 ], [ 7, 4 ], [ 9, 7 ], [ 10, 16 ], [ 10, 18 ], [ 10, 15 ], [ 13, 12 ], [ 14, 13 ], [ 15, 19 ], [ 16, 11 ], [ 17, 14 ], [ 19, 17 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Lamont knows Dakota. Arturo knows Lamont. Herman knows Deanna. Herman knows Kieran. Hattie knows Selena. Seth knows Kelsey. Alfonso knows Hattie. Virginia knows Keith. Arturo knows Seth. Virginia knows Edison. Hattie knows Jacqueline. Jacqueline knows Violet. Lamont knows Virginia. Selena knows Gertrude. Lena knows Hamilton. Jacqueline knows Herman. Hamilton knows Arturo. Stacy knows Alfonso. Which of Hamilton and Alfonso can Stacy reach?", "answer": "Alfonso", "steps": [ "Stacy knows Alfonso." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Stacy", "Herman", "Selena", "Jacqueline", "Violet", "Deanna", "Alfonso", "Kieran", "Hattie", "Gertrude", "Lena", "Virginia", "Seth", "Lamont", "Dakota", "Edison", "Hamilton", "Keith", "Arturo", "Kelsey" ], "edges": [ [ 0, 6 ], [ 1, 5 ], [ 1, 7 ], [ 2, 9 ], [ 3, 4 ], [ 3, 1 ], [ 6, 8 ], [ 8, 3 ], [ 8, 2 ], [ 10, 16 ], [ 11, 15 ], [ 11, 17 ], [ 12, 19 ], [ 13, 14 ], [ 13, 11 ], [ 16, 18 ], [ 18, 13 ], [ 18, 12 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Irma knows Declan. Elena knows Dirk. Jim knows Vivian. Rufus knows Erik. Erik knows Jillian. Percy knows Lillian. Martin knows Michael. Simon knows Anita. Declan knows Carla. Lillian knows Elena. Carla knows Rufus. Rufus knows Jamie. Anita knows Cora. Percy knows Simon. Vivian knows Esperanza. Irma knows Jim. Dirk knows Cameron. Dirk knows Martin. Which of Elena and Carla can Irma reach?", "answer": "Carla", "steps": [ "Irma knows Declan.", "Declan knows Carla." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Irma", "Esperanza", "Carla", "Jamie", "Erik", "Jim", "Jillian", "Rufus", "Vivian", "Declan", "Percy", "Cora", "Elena", "Cameron", "Martin", "Simon", "Michael", "Dirk", "Anita", "Lillian" ], "edges": [ [ 0, 5 ], [ 0, 9 ], [ 2, 7 ], [ 4, 6 ], [ 5, 8 ], [ 7, 3 ], [ 7, 4 ], [ 8, 1 ], [ 9, 2 ], [ 10, 15 ], [ 10, 19 ], [ 12, 17 ], [ 14, 16 ], [ 15, 18 ], [ 17, 13 ], [ 17, 14 ], [ 18, 11 ], [ 19, 12 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Boris knows Hendrix. Ann knows Khashayar. Hendrix knows Jessie. Boris knows Myrtle. Boris knows Stefan. Pedro knows Peter. Stefan knows Eric. Carlos knows Louise. Eric knows Denise. Greta knows Robin. Khashayar knows Carlos. Blake knows Greta. Blake knows Marvin. Marvin knows Ann. Blake knows Dean. Dean knows Jane. Myrtle knows Faye. Denise knows Pedro. Which of Pedro and Carlos can Blake reach?", "answer": "Carlos", "steps": [ "Blake knows Marvin.", "Marvin knows Ann.", "Ann knows Khashayar.", "Khashayar knows Carlos." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Blake", "Dean", "Jane", "Louise", "Carlos", "Robin", "Greta", "Marvin", "Ann", "Khashayar", "Boris", "Myrtle", "Faye", "Peter", "Pedro", "Jessie", "Hendrix", "Stefan", "Eric", "Denise" ], "edges": [ [ 0, 1 ], [ 0, 6 ], [ 0, 7 ], [ 1, 2 ], [ 4, 3 ], [ 6, 5 ], [ 7, 8 ], [ 8, 9 ], [ 9, 4 ], [ 10, 11 ], [ 10, 16 ], [ 10, 17 ], [ 11, 12 ], [ 14, 13 ], [ 16, 15 ], [ 17, 18 ], [ 18, 19 ], [ 19, 14 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Carmen knows Alyssa. Miriam knows Austin. Kieran knows Gordon. Kieran knows Miriam. Dominic knows Mark. Austin knows Cassidy. Hilda knows Faith. Essie knows Elmer. Andre knows Daniel. Essie knows Delia. Mark knows Essie. Faith knows Carmen. Andre knows Belinda. Carmen knows Jillian. Merle knows Latoya. Hilda knows Andre. Daniel knows Merle. Dominic knows Kieran. Which of Austin and Merle can Dominic reach?", "answer": "Austin", "steps": [ "Dominic knows Kieran.", "Kieran knows Miriam.", "Miriam knows Austin." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Dominic", "Elmer", "Austin", "Gordon", "Delia", "Kieran", "Mark", "Cassidy", "Miriam", "Essie", "Hilda", "Alyssa", "Merle", "Belinda", "Jillian", "Andre", "Faith", "Latoya", "Daniel", "Carmen" ], "edges": [ [ 0, 5 ], [ 0, 6 ], [ 2, 7 ], [ 5, 3 ], [ 5, 8 ], [ 6, 9 ], [ 8, 2 ], [ 9, 1 ], [ 9, 4 ], [ 10, 15 ], [ 10, 16 ], [ 12, 17 ], [ 15, 13 ], [ 15, 18 ], [ 16, 19 ], [ 18, 12 ], [ 19, 11 ], [ 19, 14 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Hadley knows Lyric. Evelyn knows Catherine. Hadley knows Oscar. Griffith knows Deanna. Harrison knows Zach. Riley knows Elaine. Rebecca knows Harrison. Deanna knows Riley. Anita knows Zane. Margaret knows Anita. Anita knows Griffith. Riley knows Keith. Riley knows Evelyn. Lyric knows Odette. Zach knows Jeanne. Harrison knows Jorge. Hadley knows Basil. Jeanne knows Hadley. Which of Anita and Harrison can Rebecca reach?", "answer": "Harrison", "steps": [ "Rebecca knows Harrison." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Rebecca", "Harrison", "Basil", "Jeanne", "Oscar", "Odette", "Lyric", "Zach", "Jorge", "Hadley", "Margaret", "Anita", "Elaine", "Deanna", "Keith", "Catherine", "Evelyn", "Griffith", "Zane", "Riley" ], "edges": [ [ 0, 1 ], [ 1, 8 ], [ 1, 7 ], [ 3, 9 ], [ 6, 5 ], [ 7, 3 ], [ 9, 2 ], [ 9, 4 ], [ 9, 6 ], [ 10, 11 ], [ 11, 18 ], [ 11, 17 ], [ 13, 19 ], [ 16, 15 ], [ 17, 13 ], [ 19, 12 ], [ 19, 14 ], [ 19, 16 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Gage knows Zara. Virgil knows Billy. Trudy knows Rebecca. Shannon knows Kimberly. Zara knows Lois. Chandler knows Kirk. Jessie knows Lydia. Jessie knows Doris. Shannon knows Chandler. Doris knows Tristan. Ruth knows Arthur. Ruth knows Ingrid. Shannon knows Trudy. Jessie knows Ruth. Billy knows Atlas. Trudy knows Virgil. Ingrid knows Gage. Atlas knows Judith. Which of Lois and Judith can Jessie reach?", "answer": "Lois", "steps": [ "Jessie knows Ruth.", "Ruth knows Ingrid.", "Ingrid knows Gage.", "Gage knows Zara.", "Zara knows Lois." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Jessie", "Lydia", "Zara", "Doris", "Gage", "Arthur", "Ingrid", "Ruth", "Tristan", "Lois", "Shannon", "Kimberly", "Atlas", "Chandler", "Billy", "Rebecca", "Virgil", "Trudy", "Kirk", "Judith" ], "edges": [ [ 0, 1 ], [ 0, 3 ], [ 0, 7 ], [ 2, 9 ], [ 3, 8 ], [ 4, 2 ], [ 6, 4 ], [ 7, 5 ], [ 7, 6 ], [ 10, 11 ], [ 10, 13 ], [ 10, 17 ], [ 12, 19 ], [ 13, 18 ], [ 14, 12 ], [ 16, 14 ], [ 17, 15 ], [ 17, 16 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Cara knows Bette. Winifred knows Maude. Hendrix knows Wilma. Luella knows Hudson. Donna knows Cara. Milton knows Erik. Tonya knows Hendrix. Destiny knows Hadley. Hudson knows Winifred. Maude knows Milton. Hendrix knows Wanda. Wanda knows Bill. Hadley knows Skyler. Donna knows Nicholas. Milton knows Destiny. Luella knows Essie. Bette knows Tonya. Bill knows Peggy. Which of Hendrix and Milton can Donna reach?", "answer": "Hendrix", "steps": [ "Donna knows Cara.", "Cara knows Bette.", "Bette knows Tonya.", "Tonya knows Hendrix." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Donna", "Tonya", "Cara", "Wilma", "Bette", "Peggy", "Wanda", "Bill", "Hendrix", "Nicholas", "Luella", "Maude", "Hudson", "Erik", "Winifred", "Skyler", "Destiny", "Hadley", "Milton", "Essie" ], "edges": [ [ 0, 2 ], [ 0, 9 ], [ 1, 8 ], [ 2, 4 ], [ 4, 1 ], [ 6, 7 ], [ 7, 5 ], [ 8, 3 ], [ 8, 6 ], [ 10, 12 ], [ 10, 19 ], [ 11, 18 ], [ 12, 14 ], [ 14, 11 ], [ 16, 17 ], [ 17, 15 ], [ 18, 13 ], [ 18, 16 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "James knows Daisy. Duke knows Raquel. Griffith knows Hardy. Dakota knows Gordon. Keegan knows Lamont. Lamont knows Griffith. Teresa knows James. Dakota knows Vance. Leah knows Teresa. Alma knows Ramona. Ramona knows Duke. Ariel knows Keegan. Hardy knows Dakota. Adrian knows Ariel. Lamont knows Devin. James knows Alma. Trevor knows Leah. Duke knows Daniella. Which of Dakota and Duke can Trevor reach?", "answer": "Duke", "steps": [ "Trevor knows Leah.", "Leah knows Teresa.", "Teresa knows James.", "James knows Alma.", "Alma knows Ramona.", "Ramona knows Duke." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Trevor", "Teresa", "Ramona", "Raquel", "Daisy", "James", "Alma", "Leah", "Duke", "Daniella", "Adrian", "Keegan", "Hardy", "Gordon", "Devin", "Lamont", "Griffith", "Ariel", "Dakota", "Vance" ], "edges": [ [ 0, 7 ], [ 1, 5 ], [ 2, 8 ], [ 5, 4 ], [ 5, 6 ], [ 6, 2 ], [ 7, 1 ], [ 8, 3 ], [ 8, 9 ], [ 10, 17 ], [ 11, 15 ], [ 12, 18 ], [ 15, 14 ], [ 15, 16 ], [ 16, 12 ], [ 17, 11 ], [ 18, 13 ], [ 18, 19 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Kendrick knows Knox. Iris knows Clark. Clark knows Perry. Dewey knows Monica. Jeff knows Brenda. Clark knows Jeff. Anthony knows Francesca. Heidi knows Anthony. Sybil knows Jon. Heidi knows Clayton. Josie knows Kendrick. Dewey knows Chantal. Clark knows Heidi. Alicia knows Iris. Andre knows Josie. Kendrick knows Dewey. Kendrick knows Sybil. Monica knows Blair. Which of Francesca and Blair can Andre reach?", "answer": "Blair", "steps": [ "Andre knows Josie.", "Josie knows Kendrick.", "Kendrick knows Dewey.", "Dewey knows Monica.", "Monica knows Blair." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Andre", "Chantal", "Knox", "Sybil", "Monica", "Josie", "Blair", "Jon", "Dewey", "Kendrick", "Alicia", "Clayton", "Perry", "Jeff", "Anthony", "Iris", "Francesca", "Brenda", "Heidi", "Clark" ], "edges": [ [ 0, 5 ], [ 3, 7 ], [ 4, 6 ], [ 5, 9 ], [ 8, 1 ], [ 8, 4 ], [ 9, 2 ], [ 9, 3 ], [ 9, 8 ], [ 10, 15 ], [ 13, 17 ], [ 14, 16 ], [ 15, 19 ], [ 18, 11 ], [ 18, 14 ], [ 19, 12 ], [ 19, 13 ], [ 19, 18 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Gilbert knows Kenzie. Carter knows Lee. Tom knows Leigh. Leon knows Jackson. Carter knows Samuel. Georgia knows Carter. Lucas knows Charlotte. Leigh knows Leon. Leon knows Elodie. Gilbert knows Craig. Rick knows Gilbert. Gilbert knows Angela. Samuel knows Aldo. Angela knows Tom. Carter knows Shane. Mark knows Lucas. Lucas knows Howard. Aldo knows Mark. Which of Leon and Lucas can Georgia reach?", "answer": "Lucas", "steps": [ "Georgia knows Carter.", "Carter knows Samuel.", "Samuel knows Aldo.", "Aldo knows Mark.", "Mark knows Lucas." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Georgia", "Samuel", "Lucas", "Charlotte", "Aldo", "Howard", "Mark", "Carter", "Shane", "Lee", "Rick", "Angela", "Leon", "Jackson", "Tom", "Elodie", "Leigh", "Gilbert", "Kenzie", "Craig" ], "edges": [ [ 0, 7 ], [ 1, 4 ], [ 2, 3 ], [ 2, 5 ], [ 4, 6 ], [ 6, 2 ], [ 7, 1 ], [ 7, 8 ], [ 7, 9 ], [ 10, 17 ], [ 11, 14 ], [ 12, 13 ], [ 12, 15 ], [ 14, 16 ], [ 16, 12 ], [ 17, 11 ], [ 17, 18 ], [ 17, 19 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Scott knows Loretta. Eldon knows Clifford. Isaac knows Magdalena. Eldon knows Amelia. Mason knows Kareem. Mason knows Darnell. Amelia knows Pete. Alison knows Tracy. Kareem knows Alison. Isaac knows Elodie. Walter knows Isaac. Drew knows Scott. Pete knows Diego. Sadie knows Mason. Scott knows Norman. Norman knows Eldon. Scott knows Franklin. Isaac knows Sadie. Which of Alison and Pete can Drew reach?", "answer": "Pete", "steps": [ "Drew knows Scott.", "Scott knows Norman.", "Norman knows Eldon.", "Eldon knows Amelia.", "Amelia knows Pete." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Drew", "Clifford", "Norman", "Amelia", "Diego", "Franklin", "Pete", "Loretta", "Eldon", "Scott", "Walter", "Darnell", "Sadie", "Kareem", "Tracy", "Elodie", "Alison", "Magdalena", "Mason", "Isaac" ], "edges": [ [ 0, 9 ], [ 2, 8 ], [ 3, 6 ], [ 6, 4 ], [ 8, 1 ], [ 8, 3 ], [ 9, 5 ], [ 9, 7 ], [ 9, 2 ], [ 10, 19 ], [ 12, 18 ], [ 13, 16 ], [ 16, 14 ], [ 18, 11 ], [ 18, 13 ], [ 19, 15 ], [ 19, 17 ], [ 19, 12 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Jessica knows Henry. Liam knows Geneva. Lamar knows Liam. Jamie knows Alice. Liam knows Tabitha. Marshall knows Jacques. Alice knows Sybil. Layla knows Estella. Henry knows Floyd. Lamar knows Layla. Sam knows Goldie. Jamie knows Arlene. Clifford knows Zara. Sybil knows Lamar. Marshall knows Milo. Floyd knows Clifford. Sam knows Jessica. Floyd knows Marshall. Which of Henry and Sybil can Jamie reach?", "answer": "Sybil", "steps": [ "Jamie knows Alice.", "Alice knows Sybil." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Jamie", "Geneva", "Estella", "Layla", "Lamar", "Tabitha", "Sybil", "Arlene", "Liam", "Alice", "Sam", "Jacques", "Zara", "Clifford", "Floyd", "Milo", "Henry", "Goldie", "Marshall", "Jessica" ], "edges": [ [ 0, 7 ], [ 0, 9 ], [ 3, 2 ], [ 4, 3 ], [ 4, 8 ], [ 6, 4 ], [ 8, 1 ], [ 8, 5 ], [ 9, 6 ], [ 10, 17 ], [ 10, 19 ], [ 13, 12 ], [ 14, 13 ], [ 14, 18 ], [ 16, 14 ], [ 18, 11 ], [ 18, 15 ], [ 19, 16 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Fanny knows Damian. Stacy knows Natalie. Becky knows Parker. Ashton knows Stacy. Parker knows Frances. Edwin knows Gonzalo. Gus knows Fanny. Parker knows Tanya. Edwin knows Ashton. Harper knows Celeste. Marco knows Marc. Gonzalo knows Milo. Frances knows India. Gus knows Becky. Agnes knows Whitney. Stacy knows Harper. Parker knows Agnes. Stacy knows Marco. Which of Agnes and Marco can Edwin reach?", "answer": "Marco", "steps": [ "Edwin knows Ashton.", "Ashton knows Stacy.", "Stacy knows Marco." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Edwin", "Milo", "Ashton", "Natalie", "Stacy", "Gonzalo", "Marco", "Harper", "Marc", "Celeste", "Gus", "Damian", "Becky", "Tanya", "Parker", "Fanny", "Agnes", "Frances", "Whitney", "India" ], "edges": [ [ 0, 5 ], [ 0, 2 ], [ 2, 4 ], [ 4, 3 ], [ 4, 6 ], [ 4, 7 ], [ 5, 1 ], [ 6, 8 ], [ 7, 9 ], [ 10, 15 ], [ 10, 12 ], [ 12, 14 ], [ 14, 13 ], [ 14, 16 ], [ 14, 17 ], [ 15, 11 ], [ 16, 18 ], [ 17, 19 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Earle knows Laura. Roland knows Darcy. Lucy knows Betty. Kevin knows Dixie. Yolanda knows Mae. Betty knows Kevin. Greer knows Earle. George knows Thea. Joy knows Lucy. Kevin knows Yolanda. Edna knows Wallace. Laura knows George. Dirk knows Agnes. Thea knows Roland. Ivan knows Joy. Darcy knows Dirk. Darcy knows Cecilia. Wallace knows Ivan. Which of Earle and Wallace can Edna reach?", "answer": "Wallace", "steps": [ "Edna knows Wallace." ], "difficulty": 1, "original_distance": 8, "idx_to_symbol": [ "Edna", "Mae", "Kevin", "Wallace", "Joy", "Lucy", "Betty", "Yolanda", "Dixie", "Ivan", "Greer", "Agnes", "Darcy", "Earle", "George", "Thea", "Roland", "Dirk", "Cecilia", "Laura" ], "edges": [ [ 0, 3 ], [ 2, 7 ], [ 2, 8 ], [ 3, 9 ], [ 4, 5 ], [ 5, 6 ], [ 6, 2 ], [ 7, 1 ], [ 9, 4 ], [ 10, 13 ], [ 12, 17 ], [ 12, 18 ], [ 13, 19 ], [ 14, 15 ], [ 15, 16 ], [ 16, 12 ], [ 17, 11 ], [ 19, 14 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Ada knows Garrison. Ruth knows Layla. Greg knows Matt. Garrison knows Keith. Keith knows Lyle. Eden knows Cain. Livia knows Michelle. Priscilla knows Ruth. Eli knows Lucia. Eden knows Chris. Eli knows Eden. Greg knows Blanche. Chris knows Stella. Garrison knows Greg. Cain knows Priscilla. Chris knows Jermaine. Ada knows Abigail. Lyle knows Livia. Which of Livia and Ruth can Ada reach?", "answer": "Livia", "steps": [ "Ada knows Garrison.", "Garrison knows Keith.", "Keith knows Lyle.", "Lyle knows Livia." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Ada", "Blanche", "Garrison", "Lyle", "Michelle", "Greg", "Livia", "Abigail", "Matt", "Keith", "Eli", "Jermaine", "Eden", "Priscilla", "Layla", "Chris", "Ruth", "Lucia", "Stella", "Cain" ], "edges": [ [ 0, 7 ], [ 0, 2 ], [ 2, 5 ], [ 2, 9 ], [ 3, 6 ], [ 5, 1 ], [ 5, 8 ], [ 6, 4 ], [ 9, 3 ], [ 10, 17 ], [ 10, 12 ], [ 12, 15 ], [ 12, 19 ], [ 13, 16 ], [ 15, 11 ], [ 15, 18 ], [ 16, 14 ], [ 19, 13 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Wilson knows Neal. Renee knows Matthew. Morgan knows Isabel. Isabel knows Bonnie. Neal knows Camille. Diane knows Renee. Isabel knows Hugo. Renee knows Chad. Gabriel knows Diane. Neal knows Owen. Isabel knows Tara. Morgan knows Zara. Desmond knows Louise. Tara knows Wilson. Desmond knows Keegan. John knows Desmond. Desmond knows Gabriel. John knows Brynn. Which of Chad and Owen can Morgan reach?", "answer": "Owen", "steps": [ "Morgan knows Isabel.", "Isabel knows Tara.", "Tara knows Wilson.", "Wilson knows Neal.", "Neal knows Owen." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Morgan", "Hugo", "Camille", "Bonnie", "Wilson", "Owen", "Isabel", "Neal", "Zara", "Tara", "John", "Louise", "Matthew", "Keegan", "Diane", "Chad", "Desmond", "Renee", "Brynn", "Gabriel" ], "edges": [ [ 0, 8 ], [ 0, 6 ], [ 4, 7 ], [ 6, 1 ], [ 6, 3 ], [ 6, 9 ], [ 7, 2 ], [ 7, 5 ], [ 9, 4 ], [ 10, 18 ], [ 10, 16 ], [ 14, 17 ], [ 16, 11 ], [ 16, 13 ], [ 16, 19 ], [ 17, 12 ], [ 17, 15 ], [ 19, 14 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Lamont knows Dakota. Arturo knows Lamont. Herman knows Deanna. Herman knows Kieran. Hattie knows Selena. Seth knows Kelsey. Alfonso knows Hattie. Virginia knows Keith. Arturo knows Seth. Virginia knows Edison. Hattie knows Jacqueline. Jacqueline knows Violet. Lamont knows Virginia. Selena knows Gertrude. Lena knows Hamilton. Jacqueline knows Herman. Hamilton knows Arturo. Stacy knows Alfonso. Which of Jacqueline and Lamont can Stacy reach?", "answer": "Jacqueline", "steps": [ "Stacy knows Alfonso.", "Alfonso knows Hattie.", "Hattie knows Jacqueline." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Stacy", "Herman", "Selena", "Jacqueline", "Violet", "Deanna", "Alfonso", "Kieran", "Hattie", "Gertrude", "Lena", "Virginia", "Seth", "Lamont", "Dakota", "Edison", "Hamilton", "Keith", "Arturo", "Kelsey" ], "edges": [ [ 0, 6 ], [ 1, 5 ], [ 1, 7 ], [ 2, 9 ], [ 3, 4 ], [ 3, 1 ], [ 6, 8 ], [ 8, 3 ], [ 8, 2 ], [ 10, 16 ], [ 11, 15 ], [ 11, 17 ], [ 12, 19 ], [ 13, 14 ], [ 13, 11 ], [ 16, 18 ], [ 18, 13 ], [ 18, 12 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Melissa knows Ruby. Darin knows Myrtle. Norman knows Melissa. Darin knows Leopold. Ida knows Joyce. Doris knows Malik. Myrtle knows Kamila. Kamila knows Norman. Joyce knows Louis. Jenny knows Leslie. Yvonne knows Wesley. Leslie knows Ida. Malik knows Darin. Malik knows Cain. Louis knows Yvonne. Clement knows Jenny. Jenny knows Forrest. Leslie knows Jolene. Which of Louis and Norman can Doris reach?", "answer": "Norman", "steps": [ "Doris knows Malik.", "Malik knows Darin.", "Darin knows Myrtle.", "Myrtle knows Kamila.", "Kamila knows Norman." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Doris", "Kamila", "Myrtle", "Malik", "Leopold", "Darin", "Melissa", "Ruby", "Norman", "Cain", "Clement", "Joyce", "Ida", "Jenny", "Jolene", "Leslie", "Yvonne", "Wesley", "Louis", "Forrest" ], "edges": [ [ 0, 3 ], [ 1, 8 ], [ 2, 1 ], [ 3, 5 ], [ 3, 9 ], [ 5, 4 ], [ 5, 2 ], [ 6, 7 ], [ 8, 6 ], [ 10, 13 ], [ 11, 18 ], [ 12, 11 ], [ 13, 15 ], [ 13, 19 ], [ 15, 14 ], [ 15, 12 ], [ 16, 17 ], [ 18, 16 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Eugene knows Raquel. Alyssa knows Anton. Jewel knows Aurora. Anton knows Geoffrey. Rebecca knows Alyssa. Geoffrey knows Saul. Aurora knows Vernon. Stuart knows Jewel. Caroline knows Charles. Brody knows Sally. Sally knows Stuart. Raquel knows Daniel. Sally knows Emanuel. Raquel knows Belinda. Vernon knows Caroline. Aurora knows Lisa. Alyssa knows Clay. Daniel knows Rebecca. Which of Stuart and Daniel can Eugene reach?", "answer": "Daniel", "steps": [ "Eugene knows Raquel.", "Raquel knows Daniel." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Eugene", "Belinda", "Geoffrey", "Alyssa", "Daniel", "Saul", "Anton", "Raquel", "Rebecca", "Clay", "Brody", "Emanuel", "Caroline", "Aurora", "Stuart", "Charles", "Vernon", "Sally", "Jewel", "Lisa" ], "edges": [ [ 0, 7 ], [ 2, 5 ], [ 3, 6 ], [ 3, 9 ], [ 4, 8 ], [ 6, 2 ], [ 7, 1 ], [ 7, 4 ], [ 8, 3 ], [ 10, 17 ], [ 12, 15 ], [ 13, 16 ], [ 13, 19 ], [ 14, 18 ], [ 16, 12 ], [ 17, 11 ], [ 17, 14 ], [ 18, 13 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Coral knows Axel. Roman knows Houston. Carey knows Gertrude. Dick knows Roy. Carey knows Imogen. Axel knows Effie. Julio knows Roman. Julio knows Hugh. Imogen knows Sandra. Houston knows Coral. Jeanne knows Laurel. Julio knows Mike. Melanie knows Mark. Roy knows Leah. Sandra knows Teresa. Mike knows Jeanne. Carey knows Melanie. Mark knows Dick. Which of Effie and Leah can Carey reach?", "answer": "Leah", "steps": [ "Carey knows Melanie.", "Melanie knows Mark.", "Mark knows Dick.", "Dick knows Roy.", "Roy knows Leah." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Carey", "Mark", "Roy", "Teresa", "Melanie", "Dick", "Sandra", "Leah", "Gertrude", "Imogen", "Julio", "Houston", "Axel", "Laurel", "Roman", "Coral", "Jeanne", "Effie", "Hugh", "Mike" ], "edges": [ [ 0, 4 ], [ 0, 8 ], [ 0, 9 ], [ 1, 5 ], [ 2, 7 ], [ 4, 1 ], [ 5, 2 ], [ 6, 3 ], [ 9, 6 ], [ 10, 14 ], [ 10, 18 ], [ 10, 19 ], [ 11, 15 ], [ 12, 17 ], [ 14, 11 ], [ 15, 12 ], [ 16, 13 ], [ 19, 16 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Colby knows Colette. Erica knows Sam. Hilda knows Colby. Kendra knows Porter. Hilda knows Bruce. Anita knows Hilda. Kendra knows Dudley. Aaron knows Anita. Otto knows India. India knows June. Bruce knows Houston. India knows Kendra. Sam knows Otto. Monroe knows Aaron. June knows Daniel. June knows Owen. Bruce knows Arturo. Colby knows Noel. Which of Bruce and June can Monroe reach?", "answer": "Bruce", "steps": [ "Monroe knows Aaron.", "Aaron knows Anita.", "Anita knows Hilda.", "Hilda knows Bruce." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Monroe", "Bruce", "Colby", "Anita", "Colette", "Aaron", "Hilda", "Houston", "Noel", "Arturo", "Erica", "June", "Kendra", "Otto", "Dudley", "Sam", "India", "Owen", "Porter", "Daniel" ], "edges": [ [ 0, 5 ], [ 1, 7 ], [ 1, 9 ], [ 2, 4 ], [ 2, 8 ], [ 3, 6 ], [ 5, 3 ], [ 6, 2 ], [ 6, 1 ], [ 10, 15 ], [ 11, 17 ], [ 11, 19 ], [ 12, 14 ], [ 12, 18 ], [ 13, 16 ], [ 15, 13 ], [ 16, 12 ], [ 16, 11 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Spencer knows Archer. Victor knows Gemma. Victor knows Margaret. Luna knows Dawn. Dawn knows Preston. Camille knows Pablo. Patrick knows Luna. Kerry knows Kent. Kobe knows Kay. Archer knows Kerry. Jacqueline knows Spencer. Gemma knows Farrah. Margaret knows Zane. Archer knows Kobe. Spencer knows Camille. Jacqueline knows Jeanette. Patrick knows Patricia. Luna knows Victor. Which of Victor and Archer can Jacqueline reach?", "answer": "Archer", "steps": [ "Jacqueline knows Spencer.", "Spencer knows Archer." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Jacqueline", "Pablo", "Camille", "Archer", "Kay", "Kobe", "Jeanette", "Spencer", "Kerry", "Kent", "Patrick", "Preston", "Dawn", "Victor", "Zane", "Margaret", "Patricia", "Luna", "Gemma", "Farrah" ], "edges": [ [ 0, 6 ], [ 0, 7 ], [ 2, 1 ], [ 3, 5 ], [ 3, 8 ], [ 5, 4 ], [ 7, 2 ], [ 7, 3 ], [ 8, 9 ], [ 10, 16 ], [ 10, 17 ], [ 12, 11 ], [ 13, 15 ], [ 13, 18 ], [ 15, 14 ], [ 17, 12 ], [ 17, 13 ], [ 18, 19 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Demetrius knows Chandler. Corinne knows Omar. Bella knows Kimberly. Javier knows Demetrius. Bryan knows Jude. Herbert knows Claire. Demetrius knows Herbert. Karen knows Eileen. Candice knows Jessica. Leroy knows Candice. Kevin knows Eric. Jude knows Leroy. Eileen knows Javier. Leroy knows Corinne. Corinne knows Drew. Kevin knows Tessa. Javier knows Kevin. Candice knows Bella. Which of Javier and Leroy can Bryan reach?", "answer": "Leroy", "steps": [ "Bryan knows Jude.", "Jude knows Leroy." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Bryan", "Bella", "Candice", "Leroy", "Kimberly", "Drew", "Jessica", "Jude", "Corinne", "Omar", "Karen", "Herbert", "Demetrius", "Javier", "Claire", "Tessa", "Chandler", "Eileen", "Kevin", "Eric" ], "edges": [ [ 0, 7 ], [ 1, 4 ], [ 2, 1 ], [ 2, 6 ], [ 3, 2 ], [ 3, 8 ], [ 7, 3 ], [ 8, 5 ], [ 8, 9 ], [ 10, 17 ], [ 11, 14 ], [ 12, 11 ], [ 12, 16 ], [ 13, 12 ], [ 13, 18 ], [ 17, 13 ], [ 18, 15 ], [ 18, 19 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Eden knows Viola. Marilyn knows Val. Eden knows Wanda. William knows Gwen. Hope knows Estella. Ella knows Dora. Colin knows Demetrius. Dora knows Marilyn. Hope knows Eden. Earle knows Hope. Jonah knows Colin. Marilyn knows Porter. Demetrius knows Ella. Pearl knows Earle. Harris knows Pearl. Dora knows William. Estella knows Cameron. Corinne knows Harris. Which of Pearl and Demetrius can Corinne reach?", "answer": "Pearl", "steps": [ "Corinne knows Harris.", "Harris knows Pearl." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Corinne", "Harris", "Hope", "Eden", "Estella", "Cameron", "Pearl", "Viola", "Earle", "Wanda", "Jonah", "Colin", "Dora", "Marilyn", "William", "Gwen", "Demetrius", "Val", "Ella", "Porter" ], "edges": [ [ 0, 1 ], [ 1, 6 ], [ 2, 4 ], [ 2, 3 ], [ 3, 7 ], [ 3, 9 ], [ 4, 5 ], [ 6, 8 ], [ 8, 2 ], [ 10, 11 ], [ 11, 16 ], [ 12, 14 ], [ 12, 13 ], [ 13, 17 ], [ 13, 19 ], [ 14, 15 ], [ 16, 18 ], [ 18, 12 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Glenda knows Kristin. Dominic knows Eva. Alex knows Tamara. Dee knows Gus. Casey knows Carol. Hailey knows Angela. Angela knows Alex. Casey knows Alder. Alex knows Glenda. Alex knows Colleen. Gus knows Casey. Kendra knows Hailey. Gladys knows Kendra. Eva knows Dee. Lennox knows Mary. Eva knows Bernice. Casey knows Lennox. Kendra knows Kai. Which of Dee and Hailey can Gladys reach?", "answer": "Hailey", "steps": [ "Gladys knows Kendra.", "Kendra knows Hailey." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Gladys", "Kristin", "Colleen", "Glenda", "Kendra", "Tamara", "Kai", "Alex", "Angela", "Hailey", "Dominic", "Mary", "Alder", "Lennox", "Eva", "Carol", "Bernice", "Casey", "Gus", "Dee" ], "edges": [ [ 0, 4 ], [ 3, 1 ], [ 4, 6 ], [ 4, 9 ], [ 7, 2 ], [ 7, 3 ], [ 7, 5 ], [ 8, 7 ], [ 9, 8 ], [ 10, 14 ], [ 13, 11 ], [ 14, 16 ], [ 14, 19 ], [ 17, 12 ], [ 17, 13 ], [ 17, 15 ], [ 18, 17 ], [ 19, 18 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "August knows Josie. Zara knows Arthur. Carson knows Saul. Cristina knows August. Karl knows Lorna. Annie knows Troy. Hubert knows Sadie. Ebony knows Aspen. Todd knows Hubert. Arthur knows Malik. Malik knows Ebony. Aspen knows Karl. Chandler knows Todd. Courtney knows Annie. Aspen knows Cristina. Todd knows Carson. Saul knows George. Troy knows Chandler. Which of Saul and August can Zara reach?", "answer": "August", "steps": [ "Zara knows Arthur.", "Arthur knows Malik.", "Malik knows Ebony.", "Ebony knows Aspen.", "Aspen knows Cristina.", "Cristina knows August." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Zara", "Malik", "Josie", "Arthur", "Cristina", "Karl", "Ebony", "Lorna", "August", "Aspen", "Courtney", "Troy", "George", "Annie", "Carson", "Hubert", "Chandler", "Sadie", "Saul", "Todd" ], "edges": [ [ 0, 3 ], [ 1, 6 ], [ 3, 1 ], [ 4, 8 ], [ 5, 7 ], [ 6, 9 ], [ 8, 2 ], [ 9, 5 ], [ 9, 4 ], [ 10, 13 ], [ 11, 16 ], [ 13, 11 ], [ 14, 18 ], [ 15, 17 ], [ 16, 19 ], [ 18, 12 ], [ 19, 15 ], [ 19, 14 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Zachary knows Ella. Darnell knows Zachary. Ella knows Jasper. Merle knows Melody. Parker knows Matthew. Kathleen knows Fletcher. Kathleen knows Kane. Ella knows Israel. Matthew knows Aspen. Kathleen knows Marilyn. Aspen knows Kathleen. Melody knows Darnell. Lara knows Ryan. Ryan knows Daniella. Dalton knows Merle. Merle knows Lydia. Ryan knows Parker. Ella knows Valerie. Which of Parker and Melody can Dalton reach?", "answer": "Melody", "steps": [ "Dalton knows Merle.", "Merle knows Melody." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Dalton", "Jasper", "Ella", "Valerie", "Melody", "Israel", "Darnell", "Lydia", "Zachary", "Merle", "Lara", "Marilyn", "Kathleen", "Kane", "Parker", "Fletcher", "Matthew", "Daniella", "Aspen", "Ryan" ], "edges": [ [ 0, 9 ], [ 2, 1 ], [ 2, 3 ], [ 2, 5 ], [ 4, 6 ], [ 6, 8 ], [ 8, 2 ], [ 9, 7 ], [ 9, 4 ], [ 10, 19 ], [ 12, 11 ], [ 12, 13 ], [ 12, 15 ], [ 14, 16 ], [ 16, 18 ], [ 18, 12 ], [ 19, 17 ], [ 19, 14 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Kieran knows Walter. Hugh knows Skyler. Damien knows Julio. Edith knows Crystal. Jocelyn knows Jolena. Luz knows Brooke. Jocelyn knows Hugh. Kieran knows Fergus. Damien knows Ursula. Ursula knows Jocelyn. Sydney knows Damien. Jolena knows Kaleb. Tony knows Vance. Vance knows Luz. Kingsley knows Edith. Edith knows Tony. Hugh knows Dustin. Vance knows Kieran. Which of Brooke and Kaleb can Sydney reach?", "answer": "Kaleb", "steps": [ "Sydney knows Damien.", "Damien knows Ursula.", "Ursula knows Jocelyn.", "Jocelyn knows Jolena.", "Jolena knows Kaleb." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Sydney", "Jolena", "Damien", "Ursula", "Hugh", "Skyler", "Kaleb", "Julio", "Dustin", "Jocelyn", "Kingsley", "Luz", "Edith", "Tony", "Kieran", "Fergus", "Brooke", "Crystal", "Walter", "Vance" ], "edges": [ [ 0, 2 ], [ 1, 6 ], [ 2, 7 ], [ 2, 3 ], [ 3, 9 ], [ 4, 5 ], [ 4, 8 ], [ 9, 1 ], [ 9, 4 ], [ 10, 12 ], [ 11, 16 ], [ 12, 17 ], [ 12, 13 ], [ 13, 19 ], [ 14, 15 ], [ 14, 18 ], [ 19, 11 ], [ 19, 14 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Wallace knows Ted. Humphrey knows Brynn. Cristina knows Harold. Wallace knows Effie. George knows Harry. Delilah knows Stuart. Gwen knows Humphrey. Ashley knows Cristina. Daisy knows Wyatt. Humphrey knows Jose. Wyatt knows Gwen. Ted knows Emma. George knows Daisy. Effie knows Vivian. Gwen knows Delilah. Ashley knows Melissa. Ted knows Garrett. Harold knows Wallace. Which of Effie and Delilah can Ashley reach?", "answer": "Effie", "steps": [ "Ashley knows Cristina.", "Cristina knows Harold.", "Harold knows Wallace.", "Wallace knows Effie." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Ashley", "Cristina", "Ted", "Wallace", "Vivian", "Emma", "Harold", "Effie", "Garrett", "Melissa", "George", "Daisy", "Humphrey", "Gwen", "Stuart", "Jose", "Wyatt", "Delilah", "Brynn", "Harry" ], "edges": [ [ 0, 1 ], [ 0, 9 ], [ 1, 6 ], [ 2, 5 ], [ 2, 8 ], [ 3, 7 ], [ 3, 2 ], [ 6, 3 ], [ 7, 4 ], [ 10, 11 ], [ 10, 19 ], [ 11, 16 ], [ 12, 15 ], [ 12, 18 ], [ 13, 17 ], [ 13, 12 ], [ 16, 13 ], [ 17, 14 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Fern knows Alma. Constance knows Sarah. Alma knows Ryan. Mack knows Fern. Alex knows Lisa. Steve knows Estelle. Estelle knows Alex. Jules knows Mack. Alex knows Constance. Steve knows Lisette. Ryan knows Sheila. Ryan knows Jolene. Haley knows Steve. Mack knows Chantal. Mack knows Wilbur. Constance knows Jewel. Steve knows Enid. Alma knows Bernard. Which of Constance and Ryan can Haley reach?", "answer": "Constance", "steps": [ "Haley knows Steve.", "Steve knows Estelle.", "Estelle knows Alex.", "Alex knows Constance." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Haley", "Sarah", "Constance", "Jewel", "Steve", "Alex", "Enid", "Lisa", "Lisette", "Estelle", "Jules", "Jolene", "Ryan", "Sheila", "Mack", "Alma", "Wilbur", "Bernard", "Chantal", "Fern" ], "edges": [ [ 0, 4 ], [ 2, 1 ], [ 2, 3 ], [ 4, 6 ], [ 4, 8 ], [ 4, 9 ], [ 5, 2 ], [ 5, 7 ], [ 9, 5 ], [ 10, 14 ], [ 12, 11 ], [ 12, 13 ], [ 14, 16 ], [ 14, 18 ], [ 14, 19 ], [ 15, 12 ], [ 15, 17 ], [ 19, 15 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Kurt knows Lynn. Jorge knows Michael. Kelly knows Erma. Nolan knows Elizabeth. Kelly knows Shawn. Yvette knows Nolan. Kristina knows Yvette. Michael knows Paula. Lynn knows Kelly. Shawn knows Rick. Kristina knows Dominic. Brody knows Camille. Rick knows April. Lynn knows Dana. Yvette knows Jorge. Viola knows Kristina. Erma knows Brody. Elizabeth knows Ben. Which of Michael and Brody can Viola reach?", "answer": "Michael", "steps": [ "Viola knows Kristina.", "Kristina knows Yvette.", "Yvette knows Jorge.", "Jorge knows Michael." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Viola", "Kristina", "Elizabeth", "Nolan", "Paula", "Yvette", "Jorge", "Ben", "Dominic", "Michael", "Kurt", "Lynn", "Rick", "Shawn", "Camille", "Kelly", "Erma", "April", "Dana", "Brody" ], "edges": [ [ 0, 1 ], [ 1, 8 ], [ 1, 5 ], [ 2, 7 ], [ 3, 2 ], [ 5, 3 ], [ 5, 6 ], [ 6, 9 ], [ 9, 4 ], [ 10, 11 ], [ 11, 18 ], [ 11, 15 ], [ 12, 17 ], [ 13, 12 ], [ 15, 13 ], [ 15, 16 ], [ 16, 19 ], [ 19, 14 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Leland knows Janice. Langston knows Damian. Langston knows Edmund. Edmund knows Lauren. Andrea knows Todd. Janice knows Lars. Patrick knows Sydney. Cornelius knows Doris. Janice knows Andrea. Cornelius knows Wilbur. Patrick knows Horace. Graeme knows Dana. Doris knows Enid. Sydney knows Leland. Lars knows Marie. Wilbur knows Graeme. Lauren knows Cornelius. Todd knows Hank. Which of Lauren and Leland can Langston reach?", "answer": "Lauren", "steps": [ "Langston knows Edmund.", "Edmund knows Lauren." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Langston", "Enid", "Dana", "Damian", "Doris", "Wilbur", "Cornelius", "Graeme", "Lauren", "Edmund", "Patrick", "Marie", "Hank", "Horace", "Lars", "Andrea", "Janice", "Todd", "Leland", "Sydney" ], "edges": [ [ 0, 3 ], [ 0, 9 ], [ 4, 1 ], [ 5, 7 ], [ 6, 4 ], [ 6, 5 ], [ 7, 2 ], [ 8, 6 ], [ 9, 8 ], [ 10, 13 ], [ 10, 19 ], [ 14, 11 ], [ 15, 17 ], [ 16, 14 ], [ 16, 15 ], [ 17, 12 ], [ 18, 16 ], [ 19, 18 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Dora knows Erma. Aria knows Lane. Eden knows Fraser. Anthony knows Ron. Byron knows Eden. Davis knows Aria. Eden knows Kerry. Ron knows Molly. Kerry knows Clifford. Lane knows Jenna. Erma knows Taylor. Rod knows Ava. Molly knows Byron. Gunnar knows Dora. Ron knows Harley. Archie knows Anthony. Lane knows Gunnar. Erma knows Rod. Which of Ava and Clifford can Archie reach?", "answer": "Clifford", "steps": [ "Archie knows Anthony.", "Anthony knows Ron.", "Ron knows Molly.", "Molly knows Byron.", "Byron knows Eden.", "Eden knows Kerry.", "Kerry knows Clifford." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Archie", "Kerry", "Harley", "Byron", "Anthony", "Ron", "Molly", "Fraser", "Clifford", "Eden", "Davis", "Rod", "Jenna", "Dora", "Aria", "Lane", "Gunnar", "Taylor", "Ava", "Erma" ], "edges": [ [ 0, 4 ], [ 1, 8 ], [ 3, 9 ], [ 4, 5 ], [ 5, 2 ], [ 5, 6 ], [ 6, 3 ], [ 9, 7 ], [ 9, 1 ], [ 10, 14 ], [ 11, 18 ], [ 13, 19 ], [ 14, 15 ], [ 15, 12 ], [ 15, 16 ], [ 16, 13 ], [ 19, 17 ], [ 19, 11 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Hampton knows Amy. Chester knows Andre. Marcia knows Melody. Lane knows Troy. Thomas knows Hampton. Gus knows Ember. Darin knows Trudy. Jasmine knows Beth. Thomas knows Fabian. John knows Thomas. Beth knows Elodie. Andre knows Sue. Darin knows Jasmine. Trudy knows Gus. Beth knows Lane. Sue knows Marcia. Chester knows John. Ember knows Dexter. Which of Amy and Troy can Darin reach?", "answer": "Troy", "steps": [ "Darin knows Jasmine.", "Jasmine knows Beth.", "Beth knows Lane.", "Lane knows Troy." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Darin", "Jasmine", "Gus", "Ember", "Beth", "Troy", "Trudy", "Elodie", "Lane", "Dexter", "Chester", "John", "Sue", "Marcia", "Thomas", "Amy", "Andre", "Fabian", "Hampton", "Melody" ], "edges": [ [ 0, 1 ], [ 0, 6 ], [ 1, 4 ], [ 2, 3 ], [ 3, 9 ], [ 4, 7 ], [ 4, 8 ], [ 6, 2 ], [ 8, 5 ], [ 10, 11 ], [ 10, 16 ], [ 11, 14 ], [ 12, 13 ], [ 13, 19 ], [ 14, 17 ], [ 14, 18 ], [ 16, 12 ], [ 18, 15 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Alicia knows Blanche. Alexa knows Jolene. Kay knows Alexa. Jolene knows Dorian. Arturo knows Eunice. Diana knows Angela. Dorian knows Christopher. Alicia knows Christian. Alana knows Diana. Ignacio knows Alana. Ross knows Erma. Alicia knows Lucas. Christian knows Clement. Arturo knows Kay. Alana knows Saul. Dorian knows Ross. Clement knows Ignacio. Arturo knows Oliver. Which of Ignacio and Jolene can Arturo reach?", "answer": "Jolene", "steps": [ "Arturo knows Kay.", "Kay knows Alexa.", "Alexa knows Jolene." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Arturo", "Ross", "Jolene", "Erma", "Oliver", "Kay", "Alexa", "Christopher", "Eunice", "Dorian", "Alicia", "Diana", "Ignacio", "Angela", "Lucas", "Christian", "Clement", "Saul", "Blanche", "Alana" ], "edges": [ [ 0, 4 ], [ 0, 8 ], [ 0, 5 ], [ 1, 3 ], [ 2, 9 ], [ 5, 6 ], [ 6, 2 ], [ 9, 1 ], [ 9, 7 ], [ 10, 14 ], [ 10, 18 ], [ 10, 15 ], [ 11, 13 ], [ 12, 19 ], [ 15, 16 ], [ 16, 12 ], [ 19, 11 ], [ 19, 17 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Susanne knows Brock. Ebony knows Giselle. Kate knows Bart. Bart knows Ebony. Randall knows Arnold. Trina knows Dana. Arnold knows Camden. Bailey knows Jeff. Dana knows Carmen. Bart knows Cassidy. Ernest knows Shelly. Arnold knows Jordan. Shelly knows Bailey. Jordan knows Kenneth. Shelly knows Daphne. Cassidy knows Randall. Dana knows Susanne. Carmen knows Ernest. Which of Kenneth and Jeff can Kate reach?", "answer": "Kenneth", "steps": [ "Kate knows Bart.", "Bart knows Cassidy.", "Cassidy knows Randall.", "Randall knows Arnold.", "Arnold knows Jordan.", "Jordan knows Kenneth." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Kate", "Kenneth", "Arnold", "Cassidy", "Randall", "Ebony", "Giselle", "Bart", "Camden", "Jordan", "Trina", "Jeff", "Shelly", "Carmen", "Ernest", "Susanne", "Brock", "Dana", "Daphne", "Bailey" ], "edges": [ [ 0, 7 ], [ 2, 8 ], [ 2, 9 ], [ 3, 4 ], [ 4, 2 ], [ 5, 6 ], [ 7, 5 ], [ 7, 3 ], [ 9, 1 ], [ 10, 17 ], [ 12, 18 ], [ 12, 19 ], [ 13, 14 ], [ 14, 12 ], [ 15, 16 ], [ 17, 15 ], [ 17, 13 ], [ 19, 11 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Javier knows Inez. Abigail knows Javier. Kent knows Jenny. Javier knows Lawson. Dewey knows Charlotte. Charlotte knows Barbara. Logan knows Magdalena. Inez knows Camden. Eli knows Ellen. Jenny knows Dewey. Logan knows Jenna. Dewey knows Logan. Dewey knows Hope. Jenna knows Stacy. Jameson knows Abigail. Inez knows Serena. Camden knows Jewel. Javier knows Eli. Which of Stacy and Jewel can Jameson reach?", "answer": "Jewel", "steps": [ "Jameson knows Abigail.", "Abigail knows Javier.", "Javier knows Inez.", "Inez knows Camden.", "Camden knows Jewel." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Jameson", "Serena", "Abigail", "Eli", "Camden", "Inez", "Javier", "Lawson", "Ellen", "Jewel", "Kent", "Magdalena", "Jenny", "Charlotte", "Jenna", "Logan", "Dewey", "Hope", "Barbara", "Stacy" ], "edges": [ [ 0, 2 ], [ 2, 6 ], [ 3, 8 ], [ 4, 9 ], [ 5, 1 ], [ 5, 4 ], [ 6, 7 ], [ 6, 3 ], [ 6, 5 ], [ 10, 12 ], [ 12, 16 ], [ 13, 18 ], [ 14, 19 ], [ 15, 11 ], [ 15, 14 ], [ 16, 17 ], [ 16, 13 ], [ 16, 15 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Hector knows Nash. Edmund knows Darin. Carrie knows Edmund. Asher knows Lyric. Fred knows Fern. Nash knows Asher. Nadine knows Alison. Zoe knows Hector. Zoe knows Corinne. Carrie knows Elsa. Zoe knows Boris. Darin knows Haven. Asher knows Eugene. Alison knows Dane. Lyric knows Fred. Carrie knows Parker. Haven knows Nadine. Haven knows Jules. Which of Asher and Haven can Carrie reach?", "answer": "Haven", "steps": [ "Carrie knows Edmund.", "Edmund knows Darin.", "Darin knows Haven." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Carrie", "Haven", "Dane", "Alison", "Edmund", "Nadine", "Jules", "Elsa", "Parker", "Darin", "Zoe", "Asher", "Fern", "Fred", "Hector", "Lyric", "Eugene", "Corinne", "Boris", "Nash" ], "edges": [ [ 0, 7 ], [ 0, 8 ], [ 0, 4 ], [ 1, 5 ], [ 1, 6 ], [ 3, 2 ], [ 4, 9 ], [ 5, 3 ], [ 9, 1 ], [ 10, 17 ], [ 10, 18 ], [ 10, 14 ], [ 11, 15 ], [ 11, 16 ], [ 13, 12 ], [ 14, 19 ], [ 15, 13 ], [ 19, 11 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Stacy knows Magdalena. Stanley knows Marcia. Arnold knows Farrah. Ernesto knows Cruz. Amelia knows Grant. Elise knows Stanley. Jared knows Elise. Carter knows Eldon. Stanley knows Lorenzo. Farrah knows India. Craig knows Tina. Craig knows Ernesto. Marcia knows Arnold. Tina knows Harley. Arnold knows Amelia. Stacy knows Uma. Magdalena knows Craig. Eldon knows Stacy. Which of Arnold and Craig can Jared reach?", "answer": "Arnold", "steps": [ "Jared knows Elise.", "Elise knows Stanley.", "Stanley knows Marcia.", "Marcia knows Arnold." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Jared", "India", "Lorenzo", "Marcia", "Arnold", "Farrah", "Grant", "Stanley", "Amelia", "Elise", "Carter", "Cruz", "Uma", "Magdalena", "Craig", "Ernesto", "Harley", "Stacy", "Tina", "Eldon" ], "edges": [ [ 0, 9 ], [ 3, 4 ], [ 4, 5 ], [ 4, 8 ], [ 5, 1 ], [ 7, 2 ], [ 7, 3 ], [ 8, 6 ], [ 9, 7 ], [ 10, 19 ], [ 13, 14 ], [ 14, 15 ], [ 14, 18 ], [ 15, 11 ], [ 17, 12 ], [ 17, 13 ], [ 18, 16 ], [ 19, 17 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Jesse knows Marcia. Victor knows Lucas. Lucas knows Tabitha. Jarvis knows Jeff. Wallace knows Jarvis. Vicki knows Jesse. Anthony knows Todd. Anthony knows Verna. Verna knows Maya. Albert knows Gemma. Todd knows Wallace. Cornelius knows Anthony. Nancy knows Vicki. Gemma knows Victor. Blanche knows Iris. Tabitha knows Drew. Vicki knows Albert. Jeff knows Blanche. Which of Albert and Todd can Cornelius reach?", "answer": "Todd", "steps": [ "Cornelius knows Anthony.", "Anthony knows Todd." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Cornelius", "Jeff", "Blanche", "Anthony", "Todd", "Wallace", "Iris", "Jarvis", "Maya", "Verna", "Nancy", "Lucas", "Tabitha", "Vicki", "Albert", "Gemma", "Drew", "Victor", "Marcia", "Jesse" ], "edges": [ [ 0, 3 ], [ 1, 2 ], [ 2, 6 ], [ 3, 4 ], [ 3, 9 ], [ 4, 5 ], [ 5, 7 ], [ 7, 1 ], [ 9, 8 ], [ 10, 13 ], [ 11, 12 ], [ 12, 16 ], [ 13, 14 ], [ 13, 19 ], [ 14, 15 ], [ 15, 17 ], [ 17, 11 ], [ 19, 18 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Ellen knows Warren. Joaquin knows Gina. Emanuel knows Gustavo. Ken knows Martha. Carter knows Jem. Dennis knows Alma. Gina knows Isaac. Jules knows Ken. Ken knows Ellen. Erma knows Jules. Calvin knows Theodore. Jules knows Emanuel. Warren knows Lily. Lily knows Jack. Joaquin knows Dennis. Julius knows Joaquin. Gina knows Carter. Jem knows Calvin. Which of Ken and Gina can Erma reach?", "answer": "Ken", "steps": [ "Erma knows Jules.", "Jules knows Ken." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Erma", "Warren", "Gustavo", "Ken", "Jules", "Ellen", "Martha", "Jack", "Lily", "Emanuel", "Julius", "Jem", "Alma", "Gina", "Joaquin", "Carter", "Isaac", "Theodore", "Calvin", "Dennis" ], "edges": [ [ 0, 4 ], [ 1, 8 ], [ 3, 6 ], [ 3, 5 ], [ 4, 3 ], [ 4, 9 ], [ 5, 1 ], [ 8, 7 ], [ 9, 2 ], [ 10, 14 ], [ 11, 18 ], [ 13, 16 ], [ 13, 15 ], [ 14, 13 ], [ 14, 19 ], [ 15, 11 ], [ 18, 17 ], [ 19, 12 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Axel knows Clayton. Clayton knows Max. Clayton knows Wanda. Glenda knows Jackson. Faith knows Dorothy. Faith knows Colleen. Jackson knows Faith. Ivy knows Priscilla. Priscilla knows Elaine. Dana knows Amanda. Ivy knows Eleanor. Dana knows Geoffrey. Geoffrey knows Jennifer. Jennifer knows Madeline. Wanda knows Dana. Elaine knows Crystal. Benjamin knows Axel. Dorothy knows Ivy. Which of Dana and Ivy can Glenda reach?", "answer": "Ivy", "steps": [ "Glenda knows Jackson.", "Jackson knows Faith.", "Faith knows Dorothy.", "Dorothy knows Ivy." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Glenda", "Colleen", "Eleanor", "Ivy", "Elaine", "Dorothy", "Jackson", "Priscilla", "Faith", "Crystal", "Benjamin", "Max", "Amanda", "Dana", "Jennifer", "Wanda", "Axel", "Geoffrey", "Clayton", "Madeline" ], "edges": [ [ 0, 6 ], [ 3, 2 ], [ 3, 7 ], [ 4, 9 ], [ 5, 3 ], [ 6, 8 ], [ 7, 4 ], [ 8, 1 ], [ 8, 5 ], [ 10, 16 ], [ 13, 12 ], [ 13, 17 ], [ 14, 19 ], [ 15, 13 ], [ 16, 18 ], [ 17, 14 ], [ 18, 11 ], [ 18, 15 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Janet knows Gideon. Gustavo knows Guy. Gideon knows Alejandro. Bridget knows Anastasia. Alejandro knows Ernest. June knows Leo. Alejandro knows Brandon. Becky knows Paul. Russell knows Lambert. Wilson knows Alma. Paul knows Bridget. Lambert knows Becky. Gideon knows Wilson. Lambert knows June. June knows Lamar. Wilson knows Gustavo. Becky knows Susanne. Guy knows Stanley. Which of Anastasia and Stanley can Russell reach?", "answer": "Anastasia", "steps": [ "Russell knows Lambert.", "Lambert knows Becky.", "Becky knows Paul.", "Paul knows Bridget.", "Bridget knows Anastasia." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Russell", "Lambert", "Susanne", "Anastasia", "Bridget", "Leo", "June", "Paul", "Lamar", "Becky", "Janet", "Gideon", "Alma", "Stanley", "Guy", "Brandon", "Alejandro", "Gustavo", "Ernest", "Wilson" ], "edges": [ [ 0, 1 ], [ 1, 6 ], [ 1, 9 ], [ 4, 3 ], [ 6, 5 ], [ 6, 8 ], [ 7, 4 ], [ 9, 2 ], [ 9, 7 ], [ 10, 11 ], [ 11, 16 ], [ 11, 19 ], [ 14, 13 ], [ 16, 15 ], [ 16, 18 ], [ 17, 14 ], [ 19, 12 ], [ 19, 17 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Russell knows Ibrahim. Heath knows Joel. Richard knows Oliver. Virginia knows Simon. Joel knows Jaime. Oliver knows Rocco. Taylor knows Zack. Kelsey knows Fleur. Simon knows Kelsey. Devon knows Russell. Rocco knows Heath. Russell knows Charity. Virginia knows Devon. Alan knows Brooks. Fleur knows Taylor. Norman knows Alan. Richard knows Norman. Alan knows Cora. Which of Oliver and Simon can Richard reach?", "answer": "Oliver", "steps": [ "Richard knows Oliver." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Richard", "Norman", "Joel", "Cora", "Heath", "Jaime", "Alan", "Oliver", "Rocco", "Brooks", "Virginia", "Devon", "Taylor", "Ibrahim", "Fleur", "Zack", "Russell", "Simon", "Kelsey", "Charity" ], "edges": [ [ 0, 7 ], [ 0, 1 ], [ 1, 6 ], [ 2, 5 ], [ 4, 2 ], [ 6, 3 ], [ 6, 9 ], [ 7, 8 ], [ 8, 4 ], [ 10, 17 ], [ 10, 11 ], [ 11, 16 ], [ 12, 15 ], [ 14, 12 ], [ 16, 13 ], [ 16, 19 ], [ 17, 18 ], [ 18, 14 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Marshall knows Hardy. Francesca knows Blair. Fred knows Goldie. Marshall knows Francesca. Julio knows Kaleb. Eugenia knows Claudia. Pedro knows Julio. Fred knows Noah. Claudia knows Marilyn. Eugenia knows Marshall. Blair knows Tony. Noah knows Geneva. Pedro knows Fred. Tony knows Vanessa. Goldie knows Parker. Parker knows Valerie. Hardy knows Beverly. Valerie knows Jessie. Which of Valerie and Tony can Pedro reach?", "answer": "Valerie", "steps": [ "Pedro knows Fred.", "Fred knows Goldie.", "Goldie knows Parker.", "Parker knows Valerie." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Pedro", "Kaleb", "Noah", "Julio", "Valerie", "Goldie", "Geneva", "Parker", "Jessie", "Fred", "Eugenia", "Marilyn", "Hardy", "Claudia", "Tony", "Francesca", "Beverly", "Blair", "Vanessa", "Marshall" ], "edges": [ [ 0, 3 ], [ 0, 9 ], [ 2, 6 ], [ 3, 1 ], [ 4, 8 ], [ 5, 7 ], [ 7, 4 ], [ 9, 2 ], [ 9, 5 ], [ 10, 13 ], [ 10, 19 ], [ 12, 16 ], [ 13, 11 ], [ 14, 18 ], [ 15, 17 ], [ 17, 14 ], [ 19, 12 ], [ 19, 15 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Frida knows Kristina. Virginia knows Frida. Fergus knows Hudson. Lena knows Brock. Kristin knows Ralph. Jocelyn knows Kai. Jeremy knows Jocelyn. Kristina knows Alfonso. Harper knows Jillian. Jackson knows Kristin. Hudson knows Harper. Bryan knows Jeremy. Jeremy knows Sue. Kai knows Fergus. Kristin knows Lena. Ralph knows Virginia. Alfonso knows Brian. Sue knows Frank. Which of Virginia and Kai can Bryan reach?", "answer": "Kai", "steps": [ "Bryan knows Jeremy.", "Jeremy knows Jocelyn.", "Jocelyn knows Kai." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Bryan", "Sue", "Jillian", "Harper", "Jocelyn", "Fergus", "Frank", "Hudson", "Jeremy", "Kai", "Jackson", "Lena", "Brian", "Alfonso", "Ralph", "Frida", "Brock", "Kristina", "Kristin", "Virginia" ], "edges": [ [ 0, 8 ], [ 1, 6 ], [ 3, 2 ], [ 4, 9 ], [ 5, 7 ], [ 7, 3 ], [ 8, 1 ], [ 8, 4 ], [ 9, 5 ], [ 10, 18 ], [ 11, 16 ], [ 13, 12 ], [ 14, 19 ], [ 15, 17 ], [ 17, 13 ], [ 18, 11 ], [ 18, 14 ], [ 19, 15 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Lara knows Hardy. Kathleen knows Oliver. Margaret knows Khashayar. Reid knows Ignacio. Hardy knows Reid. Mitchell knows Ava. Ignacio knows Damien. Margaret knows Pedro. Donna knows Arthur. Oliver knows Ruth. Arthur knows Fritz. Ignacio knows Kieran. Reid knows Valerie. Ruth knows Donna. Ruth knows Margaret. Pedro knows Dean. Damien knows Tabitha. Valerie knows Mitchell. Which of Oliver and Hardy can Lara reach?", "answer": "Hardy", "steps": [ "Lara knows Hardy." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Lara", "Valerie", "Mitchell", "Hardy", "Kieran", "Ignacio", "Reid", "Damien", "Ava", "Tabitha", "Kathleen", "Donna", "Arthur", "Oliver", "Khashayar", "Margaret", "Ruth", "Pedro", "Fritz", "Dean" ], "edges": [ [ 0, 3 ], [ 1, 2 ], [ 2, 8 ], [ 3, 6 ], [ 5, 4 ], [ 5, 7 ], [ 6, 1 ], [ 6, 5 ], [ 7, 9 ], [ 10, 13 ], [ 11, 12 ], [ 12, 18 ], [ 13, 16 ], [ 15, 14 ], [ 15, 17 ], [ 16, 11 ], [ 16, 15 ], [ 17, 19 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Greer knows Darin. Brody knows Angelica. Maureen knows Kira. Jordan knows Hope. Saul knows Ariana. Greer knows Francesca. Jillian knows Enrique. Opal knows Brody. Darin knows Rebecca. Darin knows Betty. Opal knows Dwight. Dudley knows Jillian. Ariana knows Maureen. Ariana knows Jordan. Betty knows Jocelyn. Jillian knows Greer. Maureen knows Opal. Enrique knows Latoya. Which of Darin and Opal can Saul reach?", "answer": "Opal", "steps": [ "Saul knows Ariana.", "Ariana knows Maureen.", "Maureen knows Opal." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Saul", "Jordan", "Angelica", "Hope", "Dwight", "Opal", "Ariana", "Maureen", "Brody", "Kira", "Dudley", "Enrique", "Jocelyn", "Latoya", "Rebecca", "Darin", "Jillian", "Greer", "Betty", "Francesca" ], "edges": [ [ 0, 6 ], [ 1, 3 ], [ 5, 4 ], [ 5, 8 ], [ 6, 1 ], [ 6, 7 ], [ 7, 5 ], [ 7, 9 ], [ 8, 2 ], [ 10, 16 ], [ 11, 13 ], [ 15, 14 ], [ 15, 18 ], [ 16, 11 ], [ 16, 17 ], [ 17, 15 ], [ 17, 19 ], [ 18, 12 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Susan knows Anton. Sidney knows Cesar. Lane knows Fraser. Susan knows Curtis. Conner knows Susan. Lane knows Ava. Hampton knows Destiny. Hampton knows Conner. Jordan knows Sidney. Lane knows Lara. Susan knows Magdalena. Jordan knows Lane. Barry knows Noel. Lewis knows Jordan. Conner knows Barry. Lane knows Daphna. Susan knows Jeff. Lewis knows Frida. Which of Conner and Jordan can Lewis reach?", "answer": "Jordan", "steps": [ "Lewis knows Jordan." ], "difficulty": 1, "original_distance": 3, "idx_to_symbol": [ "Lewis", "Sidney", "Daphna", "Lane", "Frida", "Cesar", "Jordan", "Fraser", "Lara", "Ava", "Hampton", "Barry", "Anton", "Susan", "Destiny", "Noel", "Conner", "Jeff", "Magdalena", "Curtis" ], "edges": [ [ 0, 4 ], [ 0, 6 ], [ 1, 5 ], [ 3, 2 ], [ 3, 7 ], [ 3, 8 ], [ 3, 9 ], [ 6, 1 ], [ 6, 3 ], [ 10, 14 ], [ 10, 16 ], [ 11, 15 ], [ 13, 12 ], [ 13, 17 ], [ 13, 18 ], [ 13, 19 ], [ 16, 11 ], [ 16, 13 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Helene knows Dennis. Nina knows Lyle. Mia knows Jermaine. Jay knows Blair. Rhonda knows Eva. Adele knows Billy. Helene knows Adele. Sean knows Sam. Helene knows Rhonda. Hayden knows Helene. Blair knows Fern. Jermaine knows Dominic. Helene knows Joyce. Blair knows Mia. Samantha knows Javier. Dennis knows Samantha. Blair knows Sean. Blair knows Nina. Which of Dominic and Javier can Hayden reach?", "answer": "Javier", "steps": [ "Hayden knows Helene.", "Helene knows Dennis.", "Dennis knows Samantha.", "Samantha knows Javier." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Hayden", "Samantha", "Joyce", "Billy", "Dennis", "Helene", "Adele", "Rhonda", "Eva", "Javier", "Jay", "Jermaine", "Fern", "Sam", "Mia", "Blair", "Sean", "Nina", "Lyle", "Dominic" ], "edges": [ [ 0, 5 ], [ 1, 9 ], [ 4, 1 ], [ 5, 2 ], [ 5, 6 ], [ 5, 7 ], [ 5, 4 ], [ 6, 3 ], [ 7, 8 ], [ 10, 15 ], [ 11, 19 ], [ 14, 11 ], [ 15, 12 ], [ 15, 16 ], [ 15, 17 ], [ 15, 14 ], [ 16, 13 ], [ 17, 18 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Gertrude knows Jem. Ada knows David. Devon knows Horace. Luz knows Harris. Horace knows Ainsley. Lawrence knows Lambert. Dolores knows Elvira. Ainsley knows Mason. Jem knows Luz. David knows Audrey. Colleen knows Ken. Audrey knows Lawrence. Elvira knows Colleen. David knows Devon. Gertrude knows Dolores. Harris knows Dee. Dwight knows Gertrude. Lambert knows Ernie. Which of Dolores and Devon can Dwight reach?", "answer": "Dolores", "steps": [ "Dwight knows Gertrude.", "Gertrude knows Dolores." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Dwight", "Jem", "Dolores", "Luz", "Harris", "Dee", "Gertrude", "Ken", "Elvira", "Colleen", "Ada", "Audrey", "Devon", "Lawrence", "Lambert", "Ernie", "David", "Mason", "Horace", "Ainsley" ], "edges": [ [ 0, 6 ], [ 1, 3 ], [ 2, 8 ], [ 3, 4 ], [ 4, 5 ], [ 6, 1 ], [ 6, 2 ], [ 8, 9 ], [ 9, 7 ], [ 10, 16 ], [ 11, 13 ], [ 12, 18 ], [ 13, 14 ], [ 14, 15 ], [ 16, 11 ], [ 16, 12 ], [ 18, 19 ], [ 19, 17 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Riley knows Edith. Lawson knows Edison. Alvin knows Andre. Trina knows Riley. Riley knows Lionel. Iris knows Wendell. Jeanne knows Lawson. Lionel knows Elliot. Lawson knows Leroy. Rick knows Gary. Alvin knows Clara. Wendell knows Peter. Peter knows Gareth. Gary knows Jeanne. Peter knows Rick. Benjamin knows Trina. Janet knows Alvin. Elliot knows Janet. Which of Gary and Elliot can Benjamin reach?", "answer": "Elliot", "steps": [ "Benjamin knows Trina.", "Trina knows Riley.", "Riley knows Lionel.", "Lionel knows Elliot." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Benjamin", "Edith", "Janet", "Trina", "Riley", "Andre", "Lionel", "Clara", "Elliot", "Alvin", "Iris", "Gareth", "Jeanne", "Wendell", "Peter", "Edison", "Rick", "Leroy", "Gary", "Lawson" ], "edges": [ [ 0, 3 ], [ 2, 9 ], [ 3, 4 ], [ 4, 1 ], [ 4, 6 ], [ 6, 8 ], [ 8, 2 ], [ 9, 5 ], [ 9, 7 ], [ 10, 13 ], [ 12, 19 ], [ 13, 14 ], [ 14, 11 ], [ 14, 16 ], [ 16, 18 ], [ 18, 12 ], [ 19, 15 ], [ 19, 17 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Evan knows Kerry. Kerry knows Guy. Dahlia knows Miriam. Shannon knows Devin. Jason knows Matt. Jason knows Erwin. Guy knows Herbert. Dahlia knows Jason. Evan knows Kaleb. Alfonso knows Magdalena. Dahlia knows Virginia. Alfonso knows Dahlia. Kerry knows Lillian. Kerry knows Atlas. Matt knows Langston. Guy knows Shannon. Erwin knows Barry. Herbert knows Cain. Which of Kerry and Dahlia can Evan reach?", "answer": "Kerry", "steps": [ "Evan knows Kerry." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Evan", "Shannon", "Herbert", "Guy", "Lillian", "Cain", "Devin", "Atlas", "Kaleb", "Kerry", "Alfonso", "Erwin", "Matt", "Jason", "Miriam", "Langston", "Barry", "Virginia", "Magdalena", "Dahlia" ], "edges": [ [ 0, 8 ], [ 0, 9 ], [ 1, 6 ], [ 2, 5 ], [ 3, 2 ], [ 3, 1 ], [ 9, 4 ], [ 9, 3 ], [ 9, 7 ], [ 10, 18 ], [ 10, 19 ], [ 11, 16 ], [ 12, 15 ], [ 13, 12 ], [ 13, 11 ], [ 19, 14 ], [ 19, 13 ], [ 19, 17 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Carrie knows June. Alfonso knows Bailey. Claude knows Gloria. Gertrude knows Jenna. Carrie knows Gertrude. Rebecca knows Heath. Kane knows Gabriel. Kane knows Rebecca. June knows Alfonso. Kane knows Forrest. Veronica knows Felix. Gabriel knows Claude. Forrest knows Jacob. Gloria knows Ellis. Carrie knows Veronica. Gertrude knows Greg. Bailey knows Dayton. Rebecca knows Jack. Which of Ellis and Dayton can Kane reach?", "answer": "Ellis", "steps": [ "Kane knows Gabriel.", "Gabriel knows Claude.", "Claude knows Gloria.", "Gloria knows Ellis." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Kane", "Jack", "Claude", "Forrest", "Ellis", "Gabriel", "Jacob", "Gloria", "Rebecca", "Heath", "Carrie", "Greg", "Alfonso", "Veronica", "Dayton", "June", "Felix", "Bailey", "Gertrude", "Jenna" ], "edges": [ [ 0, 3 ], [ 0, 5 ], [ 0, 8 ], [ 2, 7 ], [ 3, 6 ], [ 5, 2 ], [ 7, 4 ], [ 8, 1 ], [ 8, 9 ], [ 10, 13 ], [ 10, 15 ], [ 10, 18 ], [ 12, 17 ], [ 13, 16 ], [ 15, 12 ], [ 17, 14 ], [ 18, 11 ], [ 18, 19 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Valerie knows Irving. Lois knows Clifford. Kira knows Valerie. Ralph knows Freya. Wilma knows Marc. Peter knows Xander. Ford knows Kira. Irving knows Leopold. Peter knows Wilma. Lois knows Lauren. Freya knows Lois. Valerie knows Ralph. Damien knows Peter. Jolena knows Fritz. Enrique knows Jolena. Xander knows Enrique. Jolena knows Andrew. Lucia knows Damien. Which of Jolena and Lois can Ford reach?", "answer": "Lois", "steps": [ "Ford knows Kira.", "Kira knows Valerie.", "Valerie knows Ralph.", "Ralph knows Freya.", "Freya knows Lois." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Ford", "Leopold", "Lois", "Kira", "Valerie", "Lauren", "Freya", "Ralph", "Clifford", "Irving", "Lucia", "Marc", "Jolena", "Damien", "Peter", "Fritz", "Enrique", "Xander", "Andrew", "Wilma" ], "edges": [ [ 0, 3 ], [ 2, 5 ], [ 2, 8 ], [ 3, 4 ], [ 4, 7 ], [ 4, 9 ], [ 6, 2 ], [ 7, 6 ], [ 9, 1 ], [ 10, 13 ], [ 12, 15 ], [ 12, 18 ], [ 13, 14 ], [ 14, 17 ], [ 14, 19 ], [ 16, 12 ], [ 17, 16 ], [ 19, 11 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Xavier knows Gus. Teresa knows Abel. Bruce knows Louisa. Darla knows Atlas. Lily knows William. Dell knows Emma. Eugenia knows Teresa. Luz knows Rod. Atlas knows Lily. Nolan knows Howard. Donovan knows Nolan. Nolan knows Darla. Bruce knows Hattie. Dante knows Eugenia. Hattie knows Donovan. Rod knows Xavier. Xavier knows Dante. Dell knows Luz. Which of Eugenia and Atlas can Dell reach?", "answer": "Eugenia", "steps": [ "Dell knows Luz.", "Luz knows Rod.", "Rod knows Xavier.", "Xavier knows Dante.", "Dante knows Eugenia." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Dell", "Teresa", "Abel", "Emma", "Rod", "Luz", "Dante", "Eugenia", "Xavier", "Gus", "Bruce", "Lily", "William", "Louisa", "Donovan", "Hattie", "Darla", "Atlas", "Nolan", "Howard" ], "edges": [ [ 0, 3 ], [ 0, 5 ], [ 1, 2 ], [ 4, 8 ], [ 5, 4 ], [ 6, 7 ], [ 7, 1 ], [ 8, 6 ], [ 8, 9 ], [ 10, 13 ], [ 10, 15 ], [ 11, 12 ], [ 14, 18 ], [ 15, 14 ], [ 16, 17 ], [ 17, 11 ], [ 18, 16 ], [ 18, 19 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Valerie knows Irving. Lois knows Clifford. Kira knows Valerie. Ralph knows Freya. Wilma knows Marc. Peter knows Xander. Ford knows Kira. Irving knows Leopold. Peter knows Wilma. Lois knows Lauren. Freya knows Lois. Valerie knows Ralph. Damien knows Peter. Jolena knows Fritz. Enrique knows Jolena. Xander knows Enrique. Jolena knows Andrew. Lucia knows Damien. Which of Valerie and Peter can Ford reach?", "answer": "Valerie", "steps": [ "Ford knows Kira.", "Kira knows Valerie." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Ford", "Leopold", "Lois", "Kira", "Valerie", "Lauren", "Freya", "Ralph", "Clifford", "Irving", "Lucia", "Marc", "Jolena", "Damien", "Peter", "Fritz", "Enrique", "Xander", "Andrew", "Wilma" ], "edges": [ [ 0, 3 ], [ 2, 5 ], [ 2, 8 ], [ 3, 4 ], [ 4, 7 ], [ 4, 9 ], [ 6, 2 ], [ 7, 6 ], [ 9, 1 ], [ 10, 13 ], [ 12, 15 ], [ 12, 18 ], [ 13, 14 ], [ 14, 17 ], [ 14, 19 ], [ 16, 12 ], [ 17, 16 ], [ 19, 11 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Fred knows Darrell. Hayes knows Beverly. Agnes knows Mike. Oliver knows Roman. Yvonne knows Larry. Larry knows Daisy. Daisy knows Darnell. Julia knows Lucia. Gabriel knows Oliver. Hayes knows Walter. April knows Gabriel. Jamie knows Yvonne. Gabriel knows Troy. Gabriel knows Craig. Lucia knows Agnes. Mike knows April. Darnell knows Hayes. Hayes knows Fred. Which of Gabriel and Hayes can Jamie reach?", "answer": "Hayes", "steps": [ "Jamie knows Yvonne.", "Yvonne knows Larry.", "Larry knows Daisy.", "Daisy knows Darnell.", "Darnell knows Hayes." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Jamie", "Larry", "Darrell", "Hayes", "Fred", "Walter", "Yvonne", "Daisy", "Darnell", "Beverly", "Julia", "Agnes", "Roman", "Gabriel", "Oliver", "Craig", "Lucia", "Mike", "April", "Troy" ], "edges": [ [ 0, 6 ], [ 1, 7 ], [ 3, 4 ], [ 3, 5 ], [ 3, 9 ], [ 4, 2 ], [ 6, 1 ], [ 7, 8 ], [ 8, 3 ], [ 10, 16 ], [ 11, 17 ], [ 13, 14 ], [ 13, 15 ], [ 13, 19 ], [ 14, 12 ], [ 16, 11 ], [ 17, 18 ], [ 18, 13 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Brynn knows Reid. Reid knows Chandler. Mindy knows Dell. Alyson knows Gonzalo. Dorian knows Alyson. Tracy knows Virgil. Margaret knows Brynn. Jim knows Dina. Hayes knows Dorian. Elena knows Julio. Dudley knows Diana. Diana knows Mindy. Virgil knows Margaret. Chandler knows Hayes. Simon knows Jim. Sean knows Simon. Julio knows Dudley. Dell knows Sean. Which of Alyson and Jim can Elena reach?", "answer": "Jim", "steps": [ "Elena knows Julio.", "Julio knows Dudley.", "Dudley knows Diana.", "Diana knows Mindy.", "Mindy knows Dell.", "Dell knows Sean.", "Sean knows Simon.", "Simon knows Jim." ], "difficulty": 8, "original_distance": 9, "idx_to_symbol": [ "Elena", "Jim", "Simon", "Dudley", "Dina", "Dell", "Julio", "Diana", "Sean", "Mindy", "Tracy", "Alyson", "Dorian", "Margaret", "Gonzalo", "Chandler", "Virgil", "Brynn", "Hayes", "Reid" ], "edges": [ [ 0, 6 ], [ 1, 4 ], [ 2, 1 ], [ 3, 7 ], [ 5, 8 ], [ 6, 3 ], [ 7, 9 ], [ 8, 2 ], [ 9, 5 ], [ 10, 16 ], [ 11, 14 ], [ 12, 11 ], [ 13, 17 ], [ 15, 18 ], [ 16, 13 ], [ 17, 19 ], [ 18, 12 ], [ 19, 15 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Vivian knows Natalie. Veronica knows Mitchell. Katrina knows Zack. Dalton knows Miranda. Zoe knows Inez. Mitchell knows Jewel. Fred knows Patrick. Vivian knows Katrina. Zack knows Harmony. Shelly knows Vivian. Jessica knows Zoe. Mitchell knows Robin. Jessica knows Bernard. Inez knows Fred. Miranda knows Shelly. Fred knows Veronica. Zack knows Clarence. Dalton knows Dora. Which of Zoe and Miranda can Dalton reach?", "answer": "Miranda", "steps": [ "Dalton knows Miranda." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Dalton", "Katrina", "Miranda", "Clarence", "Dora", "Zack", "Harmony", "Vivian", "Shelly", "Natalie", "Jessica", "Veronica", "Zoe", "Jewel", "Bernard", "Mitchell", "Robin", "Fred", "Inez", "Patrick" ], "edges": [ [ 0, 4 ], [ 0, 2 ], [ 1, 5 ], [ 2, 8 ], [ 5, 3 ], [ 5, 6 ], [ 7, 1 ], [ 7, 9 ], [ 8, 7 ], [ 10, 14 ], [ 10, 12 ], [ 11, 15 ], [ 12, 18 ], [ 15, 13 ], [ 15, 16 ], [ 17, 11 ], [ 17, 19 ], [ 18, 17 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Robin knows Charlene. Isla knows Deborah. Ember knows Lyric. Ashton knows Robin. Isla knows Fergus. Ember knows Patricia. Ella knows Verna. Charlene knows Frank. Lyric knows Isla. Fergus knows Sheila. Ella knows Gerard. Frank knows Dayton. Frank knows Archer. Gerard knows Ember. Melody knows Pierce. Robin knows Keaton. Melody knows Ashton. Archer knows Caleb. Which of Ember and Robin can Ella reach?", "answer": "Ember", "steps": [ "Ella knows Gerard.", "Gerard knows Ember." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Ella", "Gerard", "Sheila", "Lyric", "Verna", "Fergus", "Deborah", "Patricia", "Isla", "Ember", "Melody", "Ashton", "Caleb", "Charlene", "Pierce", "Archer", "Dayton", "Keaton", "Frank", "Robin" ], "edges": [ [ 0, 4 ], [ 0, 1 ], [ 1, 9 ], [ 3, 8 ], [ 5, 2 ], [ 8, 5 ], [ 8, 6 ], [ 9, 7 ], [ 9, 3 ], [ 10, 14 ], [ 10, 11 ], [ 11, 19 ], [ 13, 18 ], [ 15, 12 ], [ 18, 15 ], [ 18, 16 ], [ 19, 17 ], [ 19, 13 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Fleur knows Hailey. Samantha knows Archer. Loretta knows Charlotte. Hadley knows Burt. Harriet knows Asher. Burt knows Samantha. Fritz knows Hunter. Teresa knows Norman. Harriet knows Allan. Harriet knows Loretta. Hailey knows Lottie. Burt knows Teresa. Amanda knows Hayes. Burt knows Ross. Hayes knows Fritz. Hunter knows Harriet. Lottie knows Hadley. Asher knows Hank. Which of Fritz and Lottie can Amanda reach?", "answer": "Fritz", "steps": [ "Amanda knows Hayes.", "Hayes knows Fritz." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Amanda", "Allan", "Hank", "Hunter", "Harriet", "Loretta", "Asher", "Fritz", "Hayes", "Charlotte", "Fleur", "Ross", "Archer", "Hadley", "Burt", "Teresa", "Samantha", "Lottie", "Hailey", "Norman" ], "edges": [ [ 0, 8 ], [ 3, 4 ], [ 4, 1 ], [ 4, 6 ], [ 4, 5 ], [ 5, 9 ], [ 6, 2 ], [ 7, 3 ], [ 8, 7 ], [ 10, 18 ], [ 13, 14 ], [ 14, 11 ], [ 14, 16 ], [ 14, 15 ], [ 15, 19 ], [ 16, 12 ], [ 17, 13 ], [ 18, 17 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Sheila knows August. Lars knows Henrietta. Allan knows Gladys. Jared knows Jasmine. Tim knows Ernie. Ernie knows Sheila. Jared knows Troy. Glenda knows Harper. Ian knows Glenda. Lars knows Samantha. Henrietta knows Ian. August knows Celia. Eloise knows Erica. Erica knows Aubrey. Jasmine knows Allan. Ian knows Bert. Allan knows Tim. Harper knows Eloise. Which of Aubrey and Celia can Lars reach?", "answer": "Aubrey", "steps": [ "Lars knows Henrietta.", "Henrietta knows Ian.", "Ian knows Glenda.", "Glenda knows Harper.", "Harper knows Eloise.", "Eloise knows Erica.", "Erica knows Aubrey." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Lars", "Harper", "Glenda", "Ian", "Erica", "Samantha", "Henrietta", "Aubrey", "Eloise", "Bert", "Jared", "Ernie", "Tim", "Allan", "August", "Troy", "Jasmine", "Celia", "Sheila", "Gladys" ], "edges": [ [ 0, 5 ], [ 0, 6 ], [ 1, 8 ], [ 2, 1 ], [ 3, 2 ], [ 3, 9 ], [ 4, 7 ], [ 6, 3 ], [ 8, 4 ], [ 10, 15 ], [ 10, 16 ], [ 11, 18 ], [ 12, 11 ], [ 13, 12 ], [ 13, 19 ], [ 14, 17 ], [ 16, 13 ], [ 18, 14 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Delia knows Ainsley. Cora knows Lucy. Tony knows Delia. Georgia knows Alyson. Sandy knows Joyce. Elise knows Fritz. Casey knows Terry. Cecilia knows Kendra. Alyson knows Sandy. Cora knows Cecilia. Sandy knows Cora. Tony knows Elliot. Fritz knows Tony. Ainsley knows Dolores. Tony knows Felicia. Sandy knows Casey. Delia knows Ingrid. Felicia knows Chloe. Which of Fritz and Alyson can Georgia reach?", "answer": "Alyson", "steps": [ "Georgia knows Alyson." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Georgia", "Cecilia", "Joyce", "Cora", "Kendra", "Sandy", "Alyson", "Lucy", "Casey", "Terry", "Elise", "Ainsley", "Elliot", "Delia", "Dolores", "Tony", "Fritz", "Ingrid", "Felicia", "Chloe" ], "edges": [ [ 0, 6 ], [ 1, 4 ], [ 3, 1 ], [ 3, 7 ], [ 5, 2 ], [ 5, 3 ], [ 5, 8 ], [ 6, 5 ], [ 8, 9 ], [ 10, 16 ], [ 11, 14 ], [ 13, 11 ], [ 13, 17 ], [ 15, 12 ], [ 15, 13 ], [ 15, 18 ], [ 16, 15 ], [ 18, 19 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Wesley knows Esperanza. Vincent knows Lennox. Clarissa knows Samuel. Jeremy knows Gerald. Gideon knows Nora. Virgil knows Val. Wesley knows Ellis. Samuel knows Arden. Vincent knows Garrett. Esperanza knows Virgil. Gideon knows Lorna. Vincent knows Wesley. Gideon knows Clarissa. Samuel knows Jeremy. Esperanza knows Della. Omar knows Vincent. Zoe knows Gideon. Clarissa knows Selena. Which of Vincent and Gideon can Omar reach?", "answer": "Vincent", "steps": [ "Omar knows Vincent." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Omar", "Wesley", "Vincent", "Lennox", "Val", "Garrett", "Ellis", "Della", "Esperanza", "Virgil", "Zoe", "Clarissa", "Gideon", "Lorna", "Gerald", "Nora", "Selena", "Arden", "Samuel", "Jeremy" ], "edges": [ [ 0, 2 ], [ 1, 6 ], [ 1, 8 ], [ 2, 3 ], [ 2, 5 ], [ 2, 1 ], [ 8, 7 ], [ 8, 9 ], [ 9, 4 ], [ 10, 12 ], [ 11, 16 ], [ 11, 18 ], [ 12, 13 ], [ 12, 15 ], [ 12, 11 ], [ 18, 17 ], [ 18, 19 ], [ 19, 14 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Clarissa knows Carol. Roger knows Tyler. Anita knows Demetrius. Aspen knows Vera. Roger knows Ira. Ron knows Destiny. Cooper knows Camden. Vera knows Carla. Tyler knows Aspen. Clarissa knows Khashayar. Carla knows Gail. Zara knows Anita. Zara knows Ron. Demetrius knows Devon. Khashayar knows Zara. Devon knows Lyric. Aspen knows Cooper. Gail knows Patrick. Which of Aspen and Zara can Roger reach?", "answer": "Aspen", "steps": [ "Roger knows Tyler.", "Tyler knows Aspen." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Roger", "Gail", "Camden", "Ira", "Aspen", "Patrick", "Cooper", "Carla", "Tyler", "Vera", "Clarissa", "Devon", "Destiny", "Carol", "Zara", "Lyric", "Ron", "Demetrius", "Khashayar", "Anita" ], "edges": [ [ 0, 3 ], [ 0, 8 ], [ 1, 5 ], [ 4, 6 ], [ 4, 9 ], [ 6, 2 ], [ 7, 1 ], [ 8, 4 ], [ 9, 7 ], [ 10, 13 ], [ 10, 18 ], [ 11, 15 ], [ 14, 16 ], [ 14, 19 ], [ 16, 12 ], [ 17, 11 ], [ 18, 14 ], [ 19, 17 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Carla knows Jem. Guillermo knows Devon. Guillermo knows Darla. Esme knows Milo. Jeanne knows Matthew. Carla knows Amanda. Lark knows Darius. Darius knows Duncan. Guillermo knows Diego. Rocco knows Cain. Guillermo knows Troy. Duncan knows Guillermo. Katrina knows Carla. Carla knows Rocco. Troy knows Jeanne. Milo knows Katrina. Carla knows Rosa. Cain knows Travis. Which of Guillermo and Carla can Esme reach?", "answer": "Carla", "steps": [ "Esme knows Milo.", "Milo knows Katrina.", "Katrina knows Carla." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Esme", "Rosa", "Katrina", "Amanda", "Carla", "Travis", "Milo", "Jem", "Rocco", "Cain", "Lark", "Darla", "Duncan", "Diego", "Guillermo", "Matthew", "Darius", "Devon", "Troy", "Jeanne" ], "edges": [ [ 0, 6 ], [ 2, 4 ], [ 4, 1 ], [ 4, 3 ], [ 4, 7 ], [ 4, 8 ], [ 6, 2 ], [ 8, 9 ], [ 9, 5 ], [ 10, 16 ], [ 12, 14 ], [ 14, 11 ], [ 14, 13 ], [ 14, 17 ], [ 14, 18 ], [ 16, 12 ], [ 18, 19 ], [ 19, 15 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Deborah knows Pierce. Brett knows Ivan. Walter knows Selena. Darcy knows Deborah. Brett knows Walter. Darrell knows Jolene. Jermaine knows Colin. Brett knows Jermaine. Kay knows Ralph. Ralph knows Andrew. Ralph knows Clay. Ralph knows Camden. Laverne knows Brett. Andrew knows Sheryl. Selena knows Liam. Clay knows Darcy. Pierce knows Ignacio. Liam knows Darrell. Which of Walter and Clay can Kay reach?", "answer": "Clay", "steps": [ "Kay knows Ralph.", "Ralph knows Clay." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Kay", "Darcy", "Sheryl", "Camden", "Andrew", "Clay", "Deborah", "Ralph", "Pierce", "Ignacio", "Laverne", "Selena", "Colin", "Ivan", "Jermaine", "Walter", "Liam", "Brett", "Darrell", "Jolene" ], "edges": [ [ 0, 7 ], [ 1, 6 ], [ 4, 2 ], [ 5, 1 ], [ 6, 8 ], [ 7, 3 ], [ 7, 4 ], [ 7, 5 ], [ 8, 9 ], [ 10, 17 ], [ 11, 16 ], [ 14, 12 ], [ 15, 11 ], [ 16, 18 ], [ 17, 13 ], [ 17, 14 ], [ 17, 15 ], [ 18, 19 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Enrique knows Earle. Houston knows Nina. Winston knows Mae. Enrique knows Carter. Earle knows Jessie. Earle knows Houston. Maya knows Cesar. Earle knows Janice. Alfred knows Winston. Zach knows Alfred. Alfred knows Carlos. Max knows Arturo. Carlos knows Max. Jessie knows Jeffery. Janice knows Archer. Nina knows Olivia. Alfred knows Maya. Zach knows Rose. Which of Houston and Carlos can Enrique reach?", "answer": "Houston", "steps": [ "Enrique knows Earle.", "Earle knows Houston." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Enrique", "Carter", "Houston", "Olivia", "Archer", "Earle", "Jeffery", "Nina", "Jessie", "Janice", "Zach", "Rose", "Carlos", "Arturo", "Mae", "Alfred", "Cesar", "Max", "Maya", "Winston" ], "edges": [ [ 0, 1 ], [ 0, 5 ], [ 2, 7 ], [ 5, 2 ], [ 5, 8 ], [ 5, 9 ], [ 7, 3 ], [ 8, 6 ], [ 9, 4 ], [ 10, 11 ], [ 10, 15 ], [ 12, 17 ], [ 15, 12 ], [ 15, 18 ], [ 15, 19 ], [ 17, 13 ], [ 18, 16 ], [ 19, 14 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Matt knows Christopher. Porter knows Clarence. Selena knows Conrad. Porter knows Amanda. Alyssa knows Julian. Earle knows Delilah. Daisy knows Linda. Delilah knows Hope. Isabel knows Nash. Alyssa knows Matt. Matt knows Selena. Julian knows Merle. Amanda knows Lawrence. Clarence knows Daisy. Christopher knows Earle. Isabel knows Porter. Nash knows Yolanda. Linda knows Mack. Which of Daisy and Earle can Isabel reach?", "answer": "Daisy", "steps": [ "Isabel knows Porter.", "Porter knows Clarence.", "Clarence knows Daisy." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Isabel", "Lawrence", "Yolanda", "Porter", "Clarence", "Daisy", "Nash", "Linda", "Mack", "Amanda", "Alyssa", "Conrad", "Merle", "Matt", "Christopher", "Earle", "Julian", "Delilah", "Hope", "Selena" ], "edges": [ [ 0, 6 ], [ 0, 3 ], [ 3, 4 ], [ 3, 9 ], [ 4, 5 ], [ 5, 7 ], [ 6, 2 ], [ 7, 8 ], [ 9, 1 ], [ 10, 16 ], [ 10, 13 ], [ 13, 14 ], [ 13, 19 ], [ 14, 15 ], [ 15, 17 ], [ 16, 12 ], [ 17, 18 ], [ 19, 11 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Langston knows Kara. Aspen knows Grover. Eunice knows Langston. Edwin knows Eunice. Grover knows Norman. Adam knows Dolores. Langston knows Nora. Eunice knows Caleb. Sierra knows Parker. Adam knows Gary. Eunice knows Courtney. Dolores knows Emery. Edwin knows Sierra. Freya knows Edwin. Adam knows Miriam. Grover knows Adam. Dolores knows Dawn. Norman knows Jordan. Which of Edwin and Grover can Freya reach?", "answer": "Edwin", "steps": [ "Freya knows Edwin." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Freya", "Sierra", "Langston", "Caleb", "Courtney", "Nora", "Parker", "Kara", "Edwin", "Eunice", "Aspen", "Norman", "Dolores", "Gary", "Miriam", "Emery", "Jordan", "Dawn", "Grover", "Adam" ], "edges": [ [ 0, 8 ], [ 1, 6 ], [ 2, 5 ], [ 2, 7 ], [ 8, 1 ], [ 8, 9 ], [ 9, 3 ], [ 9, 4 ], [ 9, 2 ], [ 10, 18 ], [ 11, 16 ], [ 12, 15 ], [ 12, 17 ], [ 18, 11 ], [ 18, 19 ], [ 19, 13 ], [ 19, 14 ], [ 19, 12 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Jerry knows Greg. Marie knows Erwin. Jennifer knows Byron. Daria knows Jerry. Julius knows Leland. Helen knows Enrique. Luella knows Helen. Lucy knows Beth. Jennifer knows Julius. Lucy knows Darla. Greg knows Elizabeth. Elizabeth knows Lamar. Darla knows Luella. Daria knows Bernice. Reed knows Knox. Erwin knows Reed. Helen knows Marie. Leland knows Daria. Which of Reed and Elizabeth can Lucy reach?", "answer": "Reed", "steps": [ "Lucy knows Darla.", "Darla knows Luella.", "Luella knows Helen.", "Helen knows Marie.", "Marie knows Erwin.", "Erwin knows Reed." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Lucy", "Reed", "Marie", "Luella", "Enrique", "Helen", "Knox", "Darla", "Erwin", "Beth", "Jennifer", "Elizabeth", "Jerry", "Leland", "Bernice", "Daria", "Lamar", "Julius", "Greg", "Byron" ], "edges": [ [ 0, 7 ], [ 0, 9 ], [ 1, 6 ], [ 2, 8 ], [ 3, 5 ], [ 5, 4 ], [ 5, 2 ], [ 7, 3 ], [ 8, 1 ], [ 10, 17 ], [ 10, 19 ], [ 11, 16 ], [ 12, 18 ], [ 13, 15 ], [ 15, 14 ], [ 15, 12 ], [ 17, 13 ], [ 18, 11 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Gus knows Aaron. Gus knows Anton. Melissa knows Jerry. Hayley knows Homer. Rufus knows Amanda. Hayley knows Grant. Annie knows Garrison. Aaron knows Melissa. Selena knows Oliver. Hayley knows Theodore. Gus knows Harry. Garrison knows Kathleen. Oliver knows Eloise. Oliver knows Kendrick. Melissa knows Stefan. Homer knows Rufus. Gus knows Annie. Hayley knows Selena. Which of Jerry and Kendrick can Hayley reach?", "answer": "Kendrick", "steps": [ "Hayley knows Selena.", "Selena knows Oliver.", "Oliver knows Kendrick." ], "difficulty": 3, "original_distance": 3, "idx_to_symbol": [ "Hayley", "Theodore", "Oliver", "Selena", "Grant", "Amanda", "Kendrick", "Eloise", "Rufus", "Homer", "Gus", "Anton", "Melissa", "Aaron", "Harry", "Kathleen", "Jerry", "Stefan", "Garrison", "Annie" ], "edges": [ [ 0, 1 ], [ 0, 4 ], [ 0, 3 ], [ 0, 9 ], [ 2, 6 ], [ 2, 7 ], [ 3, 2 ], [ 8, 5 ], [ 9, 8 ], [ 10, 11 ], [ 10, 14 ], [ 10, 13 ], [ 10, 19 ], [ 12, 16 ], [ 12, 17 ], [ 13, 12 ], [ 18, 15 ], [ 19, 18 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Mark knows Etta. Hannah knows Garland. Jacqueline knows Kenzie. Myrtle knows Alex. Alex knows Aria. Julian knows Marcus. Nicholas knows Ramon. Garland knows Mark. Erik knows Hannah. Ramon knows Wanda. Alex knows Jacqueline. Jana knows Floyd. Marcus knows Myrtle. Mark knows Jana. Mike knows Giselle. Giselle knows Roman. Wanda knows Julian. Roman knows Erik. Which of Alex and Mark can Mike reach?", "answer": "Mark", "steps": [ "Mike knows Giselle.", "Giselle knows Roman.", "Roman knows Erik.", "Erik knows Hannah.", "Hannah knows Garland.", "Garland knows Mark." ], "difficulty": 6, "original_distance": 8, "idx_to_symbol": [ "Mike", "Etta", "Jana", "Mark", "Floyd", "Hannah", "Erik", "Giselle", "Garland", "Roman", "Nicholas", "Aria", "Jacqueline", "Alex", "Kenzie", "Marcus", "Julian", "Ramon", "Myrtle", "Wanda" ], "edges": [ [ 0, 7 ], [ 2, 4 ], [ 3, 1 ], [ 3, 2 ], [ 5, 8 ], [ 6, 5 ], [ 7, 9 ], [ 8, 3 ], [ 9, 6 ], [ 10, 17 ], [ 12, 14 ], [ 13, 11 ], [ 13, 12 ], [ 15, 18 ], [ 16, 15 ], [ 17, 19 ], [ 18, 13 ], [ 19, 16 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Amelia knows Pearl. Amelia knows Chloe. Chloe knows Aisha. Dustin knows Olivia. Lacey knows Dustin. Walt knows Paul. Theodore knows Esme. Walt knows Inez. Aisha knows Clifford. Aisha knows Dakota. Aisha knows Fleur. Ken knows Clayton. Olivia knows Walt. Dakota knows Theodore. Trudy knows Amelia. Grady knows Ken. Dustin knows Val. Walt knows Grady. Which of Dustin and Amelia can Lacey reach?", "answer": "Dustin", "steps": [ "Lacey knows Dustin." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Lacey", "Inez", "Olivia", "Walt", "Val", "Ken", "Clayton", "Grady", "Dustin", "Paul", "Trudy", "Fleur", "Chloe", "Aisha", "Pearl", "Theodore", "Esme", "Dakota", "Amelia", "Clifford" ], "edges": [ [ 0, 8 ], [ 2, 3 ], [ 3, 1 ], [ 3, 7 ], [ 3, 9 ], [ 5, 6 ], [ 7, 5 ], [ 8, 4 ], [ 8, 2 ], [ 10, 18 ], [ 12, 13 ], [ 13, 11 ], [ 13, 17 ], [ 13, 19 ], [ 15, 16 ], [ 17, 15 ], [ 18, 14 ], [ 18, 12 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Frank knows Lucas. Estella knows Delilah. Aubrey knows Jarvis. Aubrey knows Stella. Lucas knows Maya. Eugene knows Agnes. Roland knows Estella. Wendell knows Conrad. Wendell knows Aria. Aubrey knows Tiffany. Wendell knows Leopold. Jarvis knows Giselle. Jarvis knows Alyson. Jarvis knows Diana. Lucas knows Wendell. Frank knows Eugene. Lucas knows Colby. Roland knows Aubrey. Which of Jarvis and Wendell can Roland reach?", "answer": "Jarvis", "steps": [ "Roland knows Aubrey.", "Aubrey knows Jarvis." ], "difficulty": 2, "original_distance": 3, "idx_to_symbol": [ "Roland", "Estella", "Tiffany", "Aubrey", "Jarvis", "Delilah", "Stella", "Diana", "Alyson", "Giselle", "Frank", "Eugene", "Colby", "Lucas", "Wendell", "Agnes", "Maya", "Conrad", "Leopold", "Aria" ], "edges": [ [ 0, 1 ], [ 0, 3 ], [ 1, 5 ], [ 3, 2 ], [ 3, 6 ], [ 3, 4 ], [ 4, 7 ], [ 4, 8 ], [ 4, 9 ], [ 10, 11 ], [ 10, 13 ], [ 11, 15 ], [ 13, 12 ], [ 13, 16 ], [ 13, 14 ], [ 14, 17 ], [ 14, 18 ], [ 14, 19 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Hudson knows Nash. Cruz knows Mara. Dudley knows Douglas. Deirdre knows Kobe. Monroe knows Palmer. Kobe knows Andrew. Farrah knows Hudson. Sandra knows Monroe. Nash knows Dudley. Douglas knows Damian. Hudson knows Rhea. Rhea knows Kendra. Mara knows Burt. Andrew knows Norma. Cruz knows Deirdre. Wendy knows Farrah. Zane knows Wendy. Palmer knows Cruz. Which of Wendy and Monroe can Sandra reach?", "answer": "Monroe", "steps": [ "Sandra knows Monroe." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Sandra", "Cruz", "Mara", "Burt", "Andrew", "Deirdre", "Norma", "Kobe", "Monroe", "Palmer", "Zane", "Hudson", "Rhea", "Kendra", "Douglas", "Nash", "Damian", "Dudley", "Wendy", "Farrah" ], "edges": [ [ 0, 8 ], [ 1, 2 ], [ 1, 5 ], [ 2, 3 ], [ 4, 6 ], [ 5, 7 ], [ 7, 4 ], [ 8, 9 ], [ 9, 1 ], [ 10, 18 ], [ 11, 12 ], [ 11, 15 ], [ 12, 13 ], [ 14, 16 ], [ 15, 17 ], [ 17, 14 ], [ 18, 19 ], [ 19, 11 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Fiona knows Damian. Henrietta knows Dorian. Jude knows Faye. Vernon knows Callum. Hugo knows Yolanda. Jude knows Ivan. Hugo knows Jason. Jason knows Eugenia. Martha knows Hugo. Hugo knows Hardy. Faye knows Boyd. Rocco knows Alfred. Jude knows Craig. Dorian knows Jude. Vernon knows Martha. Martha knows Fiona. Dorian knows Rocco. Henrietta knows Kobe. Which of Boyd and Eugenia can Henrietta reach?", "answer": "Boyd", "steps": [ "Henrietta knows Dorian.", "Dorian knows Jude.", "Jude knows Faye.", "Faye knows Boyd." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Henrietta", "Ivan", "Rocco", "Faye", "Alfred", "Jude", "Boyd", "Craig", "Kobe", "Dorian", "Vernon", "Hardy", "Fiona", "Jason", "Damian", "Hugo", "Eugenia", "Yolanda", "Callum", "Martha" ], "edges": [ [ 0, 8 ], [ 0, 9 ], [ 2, 4 ], [ 3, 6 ], [ 5, 1 ], [ 5, 3 ], [ 5, 7 ], [ 9, 2 ], [ 9, 5 ], [ 10, 18 ], [ 10, 19 ], [ 12, 14 ], [ 13, 16 ], [ 15, 11 ], [ 15, 13 ], [ 15, 17 ], [ 19, 12 ], [ 19, 15 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Sandy knows Darin. Howard knows Boyd. Felicia knows Wilbur. Glenda knows Sandy. Boyd knows Nell. Audrey knows Mia. Wayne knows Howard. Howard knows Donna. Drake knows Earl. Felicia knows Goldie. Howard knows Jean. Nell knows Dexter. Felicia knows Elijah. Hannah knows Drake. Mia knows Glenda. Dexter knows Hannah. Farrah knows Felicia. Goldie knows Audrey. Which of Nell and Audrey can Farrah reach?", "answer": "Audrey", "steps": [ "Farrah knows Felicia.", "Felicia knows Goldie.", "Goldie knows Audrey." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Farrah", "Darin", "Audrey", "Elijah", "Goldie", "Wilbur", "Glenda", "Sandy", "Felicia", "Mia", "Wayne", "Earl", "Nell", "Jean", "Boyd", "Donna", "Hannah", "Drake", "Howard", "Dexter" ], "edges": [ [ 0, 8 ], [ 2, 9 ], [ 4, 2 ], [ 6, 7 ], [ 7, 1 ], [ 8, 3 ], [ 8, 5 ], [ 8, 4 ], [ 9, 6 ], [ 10, 18 ], [ 12, 19 ], [ 14, 12 ], [ 16, 17 ], [ 17, 11 ], [ 18, 13 ], [ 18, 15 ], [ 18, 14 ], [ 19, 16 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Lucy knows Vincent. Colby knows Jakob. Charity knows Colby. Leopold knows Lydia. Charity knows Houston. Lydia knows Byron. Randy knows Irving. August knows Annie. Vincent knows August. Annie knows Zoe. Zoe knows Eric. Kieran knows Charity. Houston knows Leopold. Tabitha knows Lucy. Eric knows Sharon. August knows Randy. Edward knows Tom. Tom knows Kieran. Which of Byron and Sharon can Tabitha reach?", "answer": "Sharon", "steps": [ "Tabitha knows Lucy.", "Lucy knows Vincent.", "Vincent knows August.", "August knows Annie.", "Annie knows Zoe.", "Zoe knows Eric.", "Eric knows Sharon." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Tabitha", "August", "Irving", "Lucy", "Randy", "Vincent", "Annie", "Sharon", "Zoe", "Eric", "Edward", "Charity", "Jakob", "Tom", "Colby", "Kieran", "Houston", "Byron", "Leopold", "Lydia" ], "edges": [ [ 0, 3 ], [ 1, 4 ], [ 1, 6 ], [ 3, 5 ], [ 4, 2 ], [ 5, 1 ], [ 6, 8 ], [ 8, 9 ], [ 9, 7 ], [ 10, 13 ], [ 11, 14 ], [ 11, 16 ], [ 13, 15 ], [ 14, 12 ], [ 15, 11 ], [ 16, 18 ], [ 18, 19 ], [ 19, 17 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Zane knows Electra. Luella knows Hattie. Gerald knows Elodie. Cristina knows Ramona. Jacob knows Tabitha. Zane knows Houston. Luella knows Walt. Maureen knows Eden. Anton knows Jacob. Camille knows Cristina. Levi knows Luella. Elodie knows Maureen. Carmela knows Felicia. Ramona knows Carmela. Carmela knows Melody. Houston knows Levi. Electra knows Anton. Camille knows Gerald. Which of Walt and Melody can Camille reach?", "answer": "Melody", "steps": [ "Camille knows Cristina.", "Cristina knows Ramona.", "Ramona knows Carmela.", "Carmela knows Melody." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Camille", "Maureen", "Cristina", "Ramona", "Elodie", "Gerald", "Carmela", "Eden", "Melody", "Felicia", "Zane", "Jacob", "Houston", "Levi", "Anton", "Electra", "Luella", "Tabitha", "Walt", "Hattie" ], "edges": [ [ 0, 5 ], [ 0, 2 ], [ 1, 7 ], [ 2, 3 ], [ 3, 6 ], [ 4, 1 ], [ 5, 4 ], [ 6, 8 ], [ 6, 9 ], [ 10, 15 ], [ 10, 12 ], [ 11, 17 ], [ 12, 13 ], [ 13, 16 ], [ 14, 11 ], [ 15, 14 ], [ 16, 18 ], [ 16, 19 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Austin knows Molly. Laurel knows Anton. Ellis knows Austin. Karen knows Henrietta. Henrietta knows Kingsley. Austin knows Yara. Grady knows Duke. Dahlia knows Laurel. Ivy knows Yvonne. Nadine knows Shane. Kingsley knows Ivy. Yvonne knows Dahlia. Melanie knows Eamon. Kingsley knows Melanie. Molly knows Lola. Kylie knows Ellis. Yara knows Nadine. Shane knows Grady. Which of Nadine and Yvonne can Kylie reach?", "answer": "Nadine", "steps": [ "Kylie knows Ellis.", "Ellis knows Austin.", "Austin knows Yara.", "Yara knows Nadine." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Kylie", "Molly", "Austin", "Yara", "Grady", "Shane", "Ellis", "Lola", "Duke", "Nadine", "Karen", "Melanie", "Kingsley", "Ivy", "Laurel", "Dahlia", "Henrietta", "Eamon", "Anton", "Yvonne" ], "edges": [ [ 0, 6 ], [ 1, 7 ], [ 2, 1 ], [ 2, 3 ], [ 3, 9 ], [ 4, 8 ], [ 5, 4 ], [ 6, 2 ], [ 9, 5 ], [ 10, 16 ], [ 11, 17 ], [ 12, 11 ], [ 12, 13 ], [ 13, 19 ], [ 14, 18 ], [ 15, 14 ], [ 16, 12 ], [ 19, 15 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Evan knows Kerry. Kerry knows Guy. Dahlia knows Miriam. Shannon knows Devin. Jason knows Matt. Jason knows Erwin. Guy knows Herbert. Dahlia knows Jason. Evan knows Kaleb. Alfonso knows Magdalena. Dahlia knows Virginia. Alfonso knows Dahlia. Kerry knows Lillian. Kerry knows Atlas. Matt knows Langston. Guy knows Shannon. Erwin knows Barry. Herbert knows Cain. Which of Matt and Herbert can Evan reach?", "answer": "Herbert", "steps": [ "Evan knows Kerry.", "Kerry knows Guy.", "Guy knows Herbert." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Evan", "Shannon", "Herbert", "Guy", "Lillian", "Cain", "Devin", "Atlas", "Kaleb", "Kerry", "Alfonso", "Erwin", "Matt", "Jason", "Miriam", "Langston", "Barry", "Virginia", "Magdalena", "Dahlia" ], "edges": [ [ 0, 8 ], [ 0, 9 ], [ 1, 6 ], [ 2, 5 ], [ 3, 2 ], [ 3, 1 ], [ 9, 4 ], [ 9, 3 ], [ 9, 7 ], [ 10, 18 ], [ 10, 19 ], [ 11, 16 ], [ 12, 15 ], [ 13, 12 ], [ 13, 11 ], [ 19, 14 ], [ 19, 13 ], [ 19, 17 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Charlotte knows Celia. Fred knows Brody. Brody knows Jillian. Chester knows Spencer. Brenda knows Alyson. Darnell knows Kim. Celia knows Ross. Gail knows India. Spencer knows Ivan. Sidney knows Archer. Archer knows Gail. Ivan knows Luke. Dorothy knows Darnell. Kim knows Erma. Charlotte knows Fred. India knows Brenda. Ross knows Dorothy. Chester knows Sidney. Which of Ross and Archer can Chester reach?", "answer": "Archer", "steps": [ "Chester knows Sidney.", "Sidney knows Archer." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Chester", "Luke", "India", "Spencer", "Archer", "Alyson", "Gail", "Ivan", "Brenda", "Sidney", "Charlotte", "Jillian", "Darnell", "Fred", "Ross", "Erma", "Dorothy", "Brody", "Kim", "Celia" ], "edges": [ [ 0, 3 ], [ 0, 9 ], [ 2, 8 ], [ 3, 7 ], [ 4, 6 ], [ 6, 2 ], [ 7, 1 ], [ 8, 5 ], [ 9, 4 ], [ 10, 13 ], [ 10, 19 ], [ 12, 18 ], [ 13, 17 ], [ 14, 16 ], [ 16, 12 ], [ 17, 11 ], [ 18, 15 ], [ 19, 14 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Cecilia knows Angelica. Ainsley knows Monroe. Angelica knows Aisha. Ainsley knows Simon. Aisha knows India. Tamara knows Edwin. Darcy knows Verna. Angelica knows Vivian. Vivian knows Emmett. Simon knows Darcy. Aisha knows Clayton. Clayton knows Belinda. Jeremy knows Ainsley. Darcy knows Horace. Colleen knows Cecilia. Verna knows Nadine. Simon knows Tamara. Cecilia knows Elsa. Which of Clayton and Verna can Jeremy reach?", "answer": "Verna", "steps": [ "Jeremy knows Ainsley.", "Ainsley knows Simon.", "Simon knows Darcy.", "Darcy knows Verna." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Jeremy", "Verna", "Nadine", "Horace", "Darcy", "Monroe", "Ainsley", "Tamara", "Simon", "Edwin", "Colleen", "Clayton", "Belinda", "India", "Aisha", "Elsa", "Cecilia", "Vivian", "Angelica", "Emmett" ], "edges": [ [ 0, 6 ], [ 1, 2 ], [ 4, 1 ], [ 4, 3 ], [ 6, 5 ], [ 6, 8 ], [ 7, 9 ], [ 8, 4 ], [ 8, 7 ], [ 10, 16 ], [ 11, 12 ], [ 14, 11 ], [ 14, 13 ], [ 16, 15 ], [ 16, 18 ], [ 17, 19 ], [ 18, 14 ], [ 18, 17 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Joshua knows Erin. Erin knows Ezra. Damian knows Trevor. Carl knows Diego. Carl knows Julio. Erin knows Sheila. Samantha knows Damian. Jackson knows Dominic. Lambert knows Jorge. Patricia knows Lilia. Dolores knows Kate. Jorge knows Carl. Samantha knows Joshua. Lambert knows Jackson. Carl knows Kara. Erin knows Alma. Erin knows Dolores. Carl knows Patricia. Which of Erin and Carl can Samantha reach?", "answer": "Erin", "steps": [ "Samantha knows Joshua.", "Joshua knows Erin." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Samantha", "Ezra", "Kate", "Damian", "Erin", "Trevor", "Joshua", "Alma", "Sheila", "Dolores", "Lambert", "Julio", "Lilia", "Jackson", "Carl", "Dominic", "Jorge", "Diego", "Kara", "Patricia" ], "edges": [ [ 0, 3 ], [ 0, 6 ], [ 3, 5 ], [ 4, 1 ], [ 4, 7 ], [ 4, 8 ], [ 4, 9 ], [ 6, 4 ], [ 9, 2 ], [ 10, 13 ], [ 10, 16 ], [ 13, 15 ], [ 14, 11 ], [ 14, 17 ], [ 14, 18 ], [ 14, 19 ], [ 16, 14 ], [ 19, 12 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Cordelia knows Tamara. Vivian knows Adelaide. Willis knows Andre. Willis knows Maude. Donovan knows Willis. Kai knows Basil. Kai knows Cordelia. Cordelia knows Percy. Adelaide knows Darin. Donovan knows Abel. Basil knows Ariana. Tamara knows Mindy. Elsa knows Camille. Christian knows Vivian. Vivian knows Clarence. Elsa knows Angela. Basil knows Elsa. Christian knows Donovan. Which of Tamara and Adelaide can Kai reach?", "answer": "Tamara", "steps": [ "Kai knows Cordelia.", "Cordelia knows Tamara." ], "difficulty": 2, "original_distance": 3, "idx_to_symbol": [ "Kai", "Tamara", "Mindy", "Elsa", "Basil", "Percy", "Camille", "Angela", "Ariana", "Cordelia", "Christian", "Adelaide", "Darin", "Willis", "Donovan", "Clarence", "Andre", "Maude", "Abel", "Vivian" ], "edges": [ [ 0, 4 ], [ 0, 9 ], [ 1, 2 ], [ 3, 6 ], [ 3, 7 ], [ 4, 3 ], [ 4, 8 ], [ 9, 1 ], [ 9, 5 ], [ 10, 14 ], [ 10, 19 ], [ 11, 12 ], [ 13, 16 ], [ 13, 17 ], [ 14, 13 ], [ 14, 18 ], [ 19, 11 ], [ 19, 15 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Harry knows Joaquin. Boris knows Eric. Lois knows Dina. Eric knows Winifred. Hattie knows Milo. Roger knows Lark. Luna knows Boris. Lark knows Keaton. Keaton knows Zelda. Joaquin knows Vance. Milo knows Julian. Luna knows Fleur. Lois knows Roger. Luna knows Ruth. Zelda knows Hattie. Lois knows Dallas. Elaine knows Harry. Winifred knows Elaine. Which of Elaine and Zelda can Luna reach?", "answer": "Elaine", "steps": [ "Luna knows Boris.", "Boris knows Eric.", "Eric knows Winifred.", "Winifred knows Elaine." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Luna", "Vance", "Winifred", "Fleur", "Boris", "Joaquin", "Eric", "Elaine", "Ruth", "Harry", "Lois", "Julian", "Keaton", "Dallas", "Roger", "Milo", "Lark", "Zelda", "Dina", "Hattie" ], "edges": [ [ 0, 3 ], [ 0, 8 ], [ 0, 4 ], [ 2, 7 ], [ 4, 6 ], [ 5, 1 ], [ 6, 2 ], [ 7, 9 ], [ 9, 5 ], [ 10, 13 ], [ 10, 18 ], [ 10, 14 ], [ 12, 17 ], [ 14, 16 ], [ 15, 11 ], [ 16, 12 ], [ 17, 19 ], [ 19, 15 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "April knows Diane. Damian knows Xavier. Fergus knows April. Clyde knows Pauline. Andrea knows Desmond. Coral knows Damian. Desmond knows Fergus. Andrea knows Graham. Diane knows Tracy. Damian knows Miriam. Diane knows Blair. Elodie knows Sally. Xavier knows Elodie. Justine knows Andrea. Fergus knows Faith. Pauline knows Coral. Elodie knows Monica. Pauline knows Declan. Which of Diane and Elodie can Justine reach?", "answer": "Diane", "steps": [ "Justine knows Andrea.", "Andrea knows Desmond.", "Desmond knows Fergus.", "Fergus knows April.", "April knows Diane." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Justine", "Blair", "Andrea", "April", "Desmond", "Faith", "Tracy", "Graham", "Diane", "Fergus", "Clyde", "Monica", "Pauline", "Xavier", "Coral", "Miriam", "Sally", "Declan", "Elodie", "Damian" ], "edges": [ [ 0, 2 ], [ 2, 7 ], [ 2, 4 ], [ 3, 8 ], [ 4, 9 ], [ 8, 1 ], [ 8, 6 ], [ 9, 5 ], [ 9, 3 ], [ 10, 12 ], [ 12, 17 ], [ 12, 14 ], [ 13, 18 ], [ 14, 19 ], [ 18, 11 ], [ 18, 16 ], [ 19, 15 ], [ 19, 13 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Langston knows Robert. Frida knows Clark. Belinda knows Dora. Bella knows Frida. Kelsey knows Ebony. Devon knows Trudy. Gail knows Ira. Dora knows Langston. Rachel knows Alyssa. Robert knows Autumn. Hampton knows Rachel. Rachel knows Janet. Alyssa knows Erwin. Kelsey knows Devon. Langston knows Hampton. Layla knows Bella. Frida knows Gail. Clark knows Kelsey. Which of Kelsey and Rachel can Belinda reach?", "answer": "Rachel", "steps": [ "Belinda knows Dora.", "Dora knows Langston.", "Langston knows Hampton.", "Hampton knows Rachel." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Belinda", "Hampton", "Autumn", "Rachel", "Alyssa", "Janet", "Langston", "Dora", "Robert", "Erwin", "Layla", "Clark", "Ira", "Kelsey", "Devon", "Ebony", "Frida", "Bella", "Gail", "Trudy" ], "edges": [ [ 0, 7 ], [ 1, 3 ], [ 3, 5 ], [ 3, 4 ], [ 4, 9 ], [ 6, 8 ], [ 6, 1 ], [ 7, 6 ], [ 8, 2 ], [ 10, 17 ], [ 11, 13 ], [ 13, 15 ], [ 13, 14 ], [ 14, 19 ], [ 16, 18 ], [ 16, 11 ], [ 17, 16 ], [ 18, 12 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Paul knows Delia. Edith knows Abigail. Oscar knows Rena. Edith knows Blake. Crystal knows Chandler. Blake knows Bernard. Janice knows Daria. Norman knows Esperanza. Langston knows Edith. Rena knows Greg. Oscar knows Lynn. Paul knows Oscar. Delia knows Crystal. Daria knows Langston. Sue knows Veronica. Jonah knows Norman. Veronica knows Paul. Langston knows Jonah. Which of Edith and Oscar can Sue reach?", "answer": "Oscar", "steps": [ "Sue knows Veronica.", "Veronica knows Paul.", "Paul knows Oscar." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Sue", "Paul", "Veronica", "Chandler", "Lynn", "Oscar", "Rena", "Greg", "Delia", "Crystal", "Janice", "Langston", "Daria", "Esperanza", "Abigail", "Edith", "Blake", "Bernard", "Jonah", "Norman" ], "edges": [ [ 0, 2 ], [ 1, 5 ], [ 1, 8 ], [ 2, 1 ], [ 5, 4 ], [ 5, 6 ], [ 6, 7 ], [ 8, 9 ], [ 9, 3 ], [ 10, 12 ], [ 11, 15 ], [ 11, 18 ], [ 12, 11 ], [ 15, 14 ], [ 15, 16 ], [ 16, 17 ], [ 18, 19 ], [ 19, 13 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Archer knows Duncan. Eduardo knows Ramon. Rex knows Conrad. Rex knows Archer. Jessie knows Lydia. Lydia knows Wilbur. Lydia knows Tara. Gareth knows Forrest. Sean knows Janice. Ross knows Jessie. Forrest knows Eduardo. Rena knows Sean. Tara knows Rena. Grace knows Rex. Archer knows Gareth. Jessie knows Ramona. Ramon knows Amelia. Janice knows Sam. Which of Janice and Ramon can Grace reach?", "answer": "Ramon", "steps": [ "Grace knows Rex.", "Rex knows Archer.", "Archer knows Gareth.", "Gareth knows Forrest.", "Forrest knows Eduardo.", "Eduardo knows Ramon." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Grace", "Ramon", "Duncan", "Gareth", "Amelia", "Archer", "Eduardo", "Rex", "Forrest", "Conrad", "Ross", "Janice", "Wilbur", "Tara", "Sam", "Lydia", "Sean", "Jessie", "Rena", "Ramona" ], "edges": [ [ 0, 7 ], [ 1, 4 ], [ 3, 8 ], [ 5, 2 ], [ 5, 3 ], [ 6, 1 ], [ 7, 5 ], [ 7, 9 ], [ 8, 6 ], [ 10, 17 ], [ 11, 14 ], [ 13, 18 ], [ 15, 12 ], [ 15, 13 ], [ 16, 11 ], [ 17, 15 ], [ 17, 19 ], [ 18, 16 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Charles knows Ethan. Cody knows Frank. Luis knows Xavier. Hazel knows Langston. Harriet knows Brenda. Carter knows Hazel. Larissa knows Carmela. Larissa knows Carter. Langston knows Luis. Cody knows Violet. Brenda knows Gerald. Larissa knows Mason. Cody knows Harriet. Freya knows Lane. Carter knows Charles. Harriet knows Ernie. Ernie knows Vicki. Gerald knows Freya. Which of Lane and Xavier can Cody reach?", "answer": "Lane", "steps": [ "Cody knows Harriet.", "Harriet knows Brenda.", "Brenda knows Gerald.", "Gerald knows Freya.", "Freya knows Lane." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Cody", "Harriet", "Violet", "Gerald", "Ernie", "Frank", "Freya", "Brenda", "Lane", "Vicki", "Larissa", "Carter", "Mason", "Langston", "Charles", "Carmela", "Luis", "Hazel", "Xavier", "Ethan" ], "edges": [ [ 0, 2 ], [ 0, 5 ], [ 0, 1 ], [ 1, 7 ], [ 1, 4 ], [ 3, 6 ], [ 4, 9 ], [ 6, 8 ], [ 7, 3 ], [ 10, 12 ], [ 10, 15 ], [ 10, 11 ], [ 11, 17 ], [ 11, 14 ], [ 13, 16 ], [ 14, 19 ], [ 16, 18 ], [ 17, 13 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Hadley knows Sandy. Brooks knows Brody. Nancy knows Gladys. Brooks knows Frankie. Celia knows Brooks. Sandy knows Hendrix. Bert knows Beatrice. Brody knows Geneva. Nancy knows Gus. Nancy knows Sebastian. Beatrice knows Nancy. Frankie knows Hadley. Eunice knows Martha. Martha knows Finn. Brody knows Logan. Brody knows Colby. Beatrice knows Amanda. Amanda knows Eunice. Which of Hadley and Eunice can Celia reach?", "answer": "Hadley", "steps": [ "Celia knows Brooks.", "Brooks knows Frankie.", "Frankie knows Hadley." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Celia", "Frankie", "Logan", "Geneva", "Hadley", "Brody", "Sandy", "Hendrix", "Brooks", "Colby", "Bert", "Amanda", "Gus", "Gladys", "Eunice", "Nancy", "Martha", "Finn", "Beatrice", "Sebastian" ], "edges": [ [ 0, 8 ], [ 1, 4 ], [ 4, 6 ], [ 5, 2 ], [ 5, 3 ], [ 5, 9 ], [ 6, 7 ], [ 8, 1 ], [ 8, 5 ], [ 10, 18 ], [ 11, 14 ], [ 14, 16 ], [ 15, 12 ], [ 15, 13 ], [ 15, 19 ], [ 16, 17 ], [ 18, 11 ], [ 18, 15 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Earle knows Laura. Roland knows Darcy. Lucy knows Betty. Kevin knows Dixie. Yolanda knows Mae. Betty knows Kevin. Greer knows Earle. George knows Thea. Joy knows Lucy. Kevin knows Yolanda. Edna knows Wallace. Laura knows George. Dirk knows Agnes. Thea knows Roland. Ivan knows Joy. Darcy knows Dirk. Darcy knows Cecilia. Wallace knows Ivan. Which of Agnes and Mae can Edna reach?", "answer": "Mae", "steps": [ "Edna knows Wallace.", "Wallace knows Ivan.", "Ivan knows Joy.", "Joy knows Lucy.", "Lucy knows Betty.", "Betty knows Kevin.", "Kevin knows Yolanda.", "Yolanda knows Mae." ], "difficulty": 8, "original_distance": 8, "idx_to_symbol": [ "Edna", "Mae", "Kevin", "Wallace", "Joy", "Lucy", "Betty", "Yolanda", "Dixie", "Ivan", "Greer", "Agnes", "Darcy", "Earle", "George", "Thea", "Roland", "Dirk", "Cecilia", "Laura" ], "edges": [ [ 0, 3 ], [ 2, 7 ], [ 2, 8 ], [ 3, 9 ], [ 4, 5 ], [ 5, 6 ], [ 6, 2 ], [ 7, 1 ], [ 9, 4 ], [ 10, 13 ], [ 12, 17 ], [ 12, 18 ], [ 13, 19 ], [ 14, 15 ], [ 15, 16 ], [ 16, 12 ], [ 17, 11 ], [ 19, 14 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Tanya knows Neal. Jessie knows Vance. Jackson knows Louisa. Kit knows Marian. Janet knows Jessie. Marian knows Harmony. Harvey knows Otto. Teresa knows Jackson. Jolena knows Tanya. Kit knows Janet. Kit knows Hal. Harmony knows Dustin. Hilda knows Kit. Otto knows Gail. Tanya knows Vera. Tanya knows Harvey. Dustin knows Mara. Vera knows Teresa. Which of Louisa and Mara can Hilda reach?", "answer": "Mara", "steps": [ "Hilda knows Kit.", "Kit knows Marian.", "Marian knows Harmony.", "Harmony knows Dustin.", "Dustin knows Mara." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Hilda", "Kit", "Harmony", "Vance", "Dustin", "Marian", "Hal", "Janet", "Jessie", "Mara", "Jolena", "Tanya", "Teresa", "Gail", "Jackson", "Vera", "Neal", "Harvey", "Otto", "Louisa" ], "edges": [ [ 0, 1 ], [ 1, 6 ], [ 1, 7 ], [ 1, 5 ], [ 2, 4 ], [ 4, 9 ], [ 5, 2 ], [ 7, 8 ], [ 8, 3 ], [ 10, 11 ], [ 11, 16 ], [ 11, 17 ], [ 11, 15 ], [ 12, 14 ], [ 14, 19 ], [ 15, 12 ], [ 17, 18 ], [ 18, 13 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Charlotte knows Celia. Fred knows Brody. Brody knows Jillian. Chester knows Spencer. Brenda knows Alyson. Darnell knows Kim. Celia knows Ross. Gail knows India. Spencer knows Ivan. Sidney knows Archer. Archer knows Gail. Ivan knows Luke. Dorothy knows Darnell. Kim knows Erma. Charlotte knows Fred. India knows Brenda. Ross knows Dorothy. Chester knows Sidney. Which of Dorothy and Gail can Chester reach?", "answer": "Gail", "steps": [ "Chester knows Sidney.", "Sidney knows Archer.", "Archer knows Gail." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Chester", "Luke", "India", "Spencer", "Archer", "Alyson", "Gail", "Ivan", "Brenda", "Sidney", "Charlotte", "Jillian", "Darnell", "Fred", "Ross", "Erma", "Dorothy", "Brody", "Kim", "Celia" ], "edges": [ [ 0, 3 ], [ 0, 9 ], [ 2, 8 ], [ 3, 7 ], [ 4, 6 ], [ 6, 2 ], [ 7, 1 ], [ 8, 5 ], [ 9, 4 ], [ 10, 13 ], [ 10, 19 ], [ 12, 18 ], [ 13, 17 ], [ 14, 16 ], [ 16, 12 ], [ 17, 11 ], [ 18, 15 ], [ 19, 14 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Leon knows Taylor. Ainsley knows Leon. Eamon knows Michelle. Leon knows Saul. Helene knows Aspen. Taylor knows Kelsey. Ainsley knows Alana. Kelsey knows Douglas. Lillian knows Maya. Celia knows Graham. Helene knows Martha. Taylor knows Larissa. Martha knows Susan. Maya knows Helene. Maya knows Jakob. Douglas knows Celia. Lillian knows Yvonne. Susan knows Eamon. Which of Taylor and Helene can Lillian reach?", "answer": "Helene", "steps": [ "Lillian knows Maya.", "Maya knows Helene." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Lillian", "Michelle", "Yvonne", "Aspen", "Jakob", "Helene", "Susan", "Martha", "Maya", "Eamon", "Ainsley", "Graham", "Alana", "Larissa", "Saul", "Taylor", "Douglas", "Kelsey", "Leon", "Celia" ], "edges": [ [ 0, 2 ], [ 0, 8 ], [ 5, 3 ], [ 5, 7 ], [ 6, 9 ], [ 7, 6 ], [ 8, 4 ], [ 8, 5 ], [ 9, 1 ], [ 10, 12 ], [ 10, 18 ], [ 15, 13 ], [ 15, 17 ], [ 16, 19 ], [ 17, 16 ], [ 18, 14 ], [ 18, 15 ], [ 19, 11 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Sonia knows Lance. Sonia knows Byron. Daphna knows Ariana. Sonia knows Yara. Eugenia knows Clifford. Sonia knows Eugenia. Florence knows Kristin. Florence knows Walt. Dana knows Sonia. Clifford knows Melody. Byron knows Kenneth. Florence knows Lorraine. Miriam knows Florence. Katherine knows Fabian. Lorraine knows Katherine. Florence knows Kennedy. Kenneth knows Constance. Kennedy knows Daphna. Which of Lorraine and Byron can Dana reach?", "answer": "Byron", "steps": [ "Dana knows Sonia.", "Sonia knows Byron." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Dana", "Sonia", "Eugenia", "Melody", "Kenneth", "Yara", "Byron", "Constance", "Lance", "Clifford", "Miriam", "Florence", "Kennedy", "Ariana", "Katherine", "Walt", "Lorraine", "Fabian", "Kristin", "Daphna" ], "edges": [ [ 0, 1 ], [ 1, 5 ], [ 1, 6 ], [ 1, 8 ], [ 1, 2 ], [ 2, 9 ], [ 4, 7 ], [ 6, 4 ], [ 9, 3 ], [ 10, 11 ], [ 11, 15 ], [ 11, 16 ], [ 11, 18 ], [ 11, 12 ], [ 12, 19 ], [ 14, 17 ], [ 16, 14 ], [ 19, 13 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Zara knows Electra. Pearl knows Todd. Whitney knows Victoria. Pearl knows Morris. Zara knows Kirk. Morris knows Donald. Whitney knows Fabian. Pearl knows Dalton. Julian knows Pearl. Victoria knows Bella. Whitney knows Zara. Harold knows Whitney. Todd knows Beatrice. Todd knows Cody. Whitney knows Nicholas. Pearl knows Darrell. Donald knows Julio. Bella knows Betty. Which of Whitney and Pearl can Harold reach?", "answer": "Whitney", "steps": [ "Harold knows Whitney." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Harold", "Whitney", "Zara", "Bella", "Betty", "Victoria", "Nicholas", "Fabian", "Electra", "Kirk", "Julian", "Pearl", "Todd", "Donald", "Julio", "Morris", "Dalton", "Darrell", "Cody", "Beatrice" ], "edges": [ [ 0, 1 ], [ 1, 5 ], [ 1, 6 ], [ 1, 7 ], [ 1, 2 ], [ 2, 8 ], [ 2, 9 ], [ 3, 4 ], [ 5, 3 ], [ 10, 11 ], [ 11, 15 ], [ 11, 16 ], [ 11, 17 ], [ 11, 12 ], [ 12, 18 ], [ 12, 19 ], [ 13, 14 ], [ 15, 13 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Maude knows Casey. Jamie knows Fraser. Uma knows Clay. Yasmin knows Cruz. Clay knows Kristin. Naomi knows Agnes. Fraser knows Denise. Rowan knows Jaime. Devin knows Yasmin. Marcia knows Tina. Terrence knows Jamie. Devin knows Uma. Jamie knows Naomi. Rowan knows Marcia. Brynn knows Terrence. Jaime knows Devin. Brynn knows Maude. Denise knows Erma. Which of Terrence and Jaime can Rowan reach?", "answer": "Jaime", "steps": [ "Rowan knows Jaime." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Rowan", "Tina", "Cruz", "Uma", "Marcia", "Yasmin", "Clay", "Jaime", "Kristin", "Devin", "Brynn", "Casey", "Agnes", "Fraser", "Maude", "Naomi", "Denise", "Terrence", "Erma", "Jamie" ], "edges": [ [ 0, 4 ], [ 0, 7 ], [ 3, 6 ], [ 4, 1 ], [ 5, 2 ], [ 6, 8 ], [ 7, 9 ], [ 9, 5 ], [ 9, 3 ], [ 10, 14 ], [ 10, 17 ], [ 13, 16 ], [ 14, 11 ], [ 15, 12 ], [ 16, 18 ], [ 17, 19 ], [ 19, 15 ], [ 19, 13 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Hugh knows Amy. Virginia knows Claudia. Max knows Homer. Homer knows Pat. Claudia knows Stephen. Ella knows Hugh. Amy knows Lily. Kit knows William. Edison knows Allan. Max knows Randall. Randall knows Edison. Claudia knows Ella. Lily knows Bernice. Kit knows Hannah. Maria knows Kit. Bob knows Holden. Hugh knows Bob. Hannah knows Max. Which of Edison and Lily can Virginia reach?", "answer": "Lily", "steps": [ "Virginia knows Claudia.", "Claudia knows Ella.", "Ella knows Hugh.", "Hugh knows Amy.", "Amy knows Lily." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Virginia", "Ella", "Claudia", "Amy", "Holden", "Bernice", "Hugh", "Bob", "Stephen", "Lily", "Maria", "Hannah", "Kit", "Randall", "Pat", "Allan", "Max", "Homer", "William", "Edison" ], "edges": [ [ 0, 2 ], [ 1, 6 ], [ 2, 8 ], [ 2, 1 ], [ 3, 9 ], [ 6, 7 ], [ 6, 3 ], [ 7, 4 ], [ 9, 5 ], [ 10, 12 ], [ 11, 16 ], [ 12, 18 ], [ 12, 11 ], [ 13, 19 ], [ 16, 17 ], [ 16, 13 ], [ 17, 14 ], [ 19, 15 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Dean knows Drake. Chandler knows Fernando. Jarvis knows Skyler. Keegan knows Jarvis. Cody knows Walter. Walter knows Opal. Ernesto knows Seth. Fisher knows Ibrahim. Mia knows Heath. Cody knows Bart. Bart knows Chandler. Keegan knows Alice. Odette knows Cody. Seth knows Mia. Skyler knows Ernesto. Fernando knows Fisher. Jarvis knows Dean. Odette knows Curtis. Which of Fernando and Seth can Odette reach?", "answer": "Fernando", "steps": [ "Odette knows Cody.", "Cody knows Bart.", "Bart knows Chandler.", "Chandler knows Fernando." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Odette", "Chandler", "Ibrahim", "Fisher", "Bart", "Opal", "Cody", "Curtis", "Fernando", "Walter", "Keegan", "Ernesto", "Heath", "Mia", "Skyler", "Drake", "Jarvis", "Alice", "Seth", "Dean" ], "edges": [ [ 0, 7 ], [ 0, 6 ], [ 1, 8 ], [ 3, 2 ], [ 4, 1 ], [ 6, 4 ], [ 6, 9 ], [ 8, 3 ], [ 9, 5 ], [ 10, 17 ], [ 10, 16 ], [ 11, 18 ], [ 13, 12 ], [ 14, 11 ], [ 16, 14 ], [ 16, 19 ], [ 18, 13 ], [ 19, 15 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Dorothy knows Chad. Joan knows Ken. Alan knows Arlene. Ken knows Cordelia. Aurora knows Dorothy. Elvira knows Kylie. Elvira knows Guillermo. Alan knows Cameron. Brooks knows Elvira. Leah knows Kobe. Cordelia knows Keith. Alan knows Brooks. Guillermo knows Leah. Ken knows Jesse. Kara knows Alan. Dorothy knows Cruz. Dorothy knows Joan. Keith knows Dee. Which of Leah and Keith can Kara reach?", "answer": "Leah", "steps": [ "Kara knows Alan.", "Alan knows Brooks.", "Brooks knows Elvira.", "Elvira knows Guillermo.", "Guillermo knows Leah." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Kara", "Arlene", "Guillermo", "Cameron", "Kobe", "Elvira", "Brooks", "Leah", "Alan", "Kylie", "Aurora", "Cruz", "Cordelia", "Chad", "Dee", "Ken", "Joan", "Keith", "Dorothy", "Jesse" ], "edges": [ [ 0, 8 ], [ 2, 7 ], [ 5, 2 ], [ 5, 9 ], [ 6, 5 ], [ 7, 4 ], [ 8, 1 ], [ 8, 3 ], [ 8, 6 ], [ 10, 18 ], [ 12, 17 ], [ 15, 12 ], [ 15, 19 ], [ 16, 15 ], [ 17, 14 ], [ 18, 11 ], [ 18, 13 ], [ 18, 16 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Omar knows Beth. Geraldine knows Scott. Lawrence knows Ralph. Desmond knows Burt. Burt knows Kobe. Burt knows Pierce. Isabel knows Lola. Scott knows Nora. Hayes knows Riley. Rex knows Conner. Scott knows Omar. Ralph knows Isabel. Kobe knows Geraldine. Ralph knows Ramon. Hayes knows Rex. Kobe knows Harry. Isabel knows Helene. Helene knows Hayes. Which of Kobe and Isabel can Lawrence reach?", "answer": "Isabel", "steps": [ "Lawrence knows Ralph.", "Ralph knows Isabel." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Lawrence", "Conner", "Isabel", "Rex", "Hayes", "Ramon", "Riley", "Lola", "Helene", "Ralph", "Desmond", "Beth", "Kobe", "Omar", "Scott", "Pierce", "Nora", "Harry", "Geraldine", "Burt" ], "edges": [ [ 0, 9 ], [ 2, 7 ], [ 2, 8 ], [ 3, 1 ], [ 4, 3 ], [ 4, 6 ], [ 8, 4 ], [ 9, 5 ], [ 9, 2 ], [ 10, 19 ], [ 12, 17 ], [ 12, 18 ], [ 13, 11 ], [ 14, 13 ], [ 14, 16 ], [ 18, 14 ], [ 19, 15 ], [ 19, 12 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Fisher knows Val. Bernice knows Yasmin. Jared knows Keith. Terry knows Ford. Kaleb knows Fisher. Rebecca knows Elvira. Maya knows Natalie. Maya knows Javier. Elvira knows Celeste. Javier knows Kaleb. Celeste knows Bernice. Ford knows Jared. Val knows Latoya. Celeste knows Allan. Julia knows Blaine. Javier knows Everett. Blaine knows Maya. Bernice knows Terry. Which of Bernice and Javier can Julia reach?", "answer": "Javier", "steps": [ "Julia knows Blaine.", "Blaine knows Maya.", "Maya knows Javier." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Julia", "Latoya", "Fisher", "Javier", "Natalie", "Everett", "Blaine", "Val", "Maya", "Kaleb", "Rebecca", "Keith", "Ford", "Bernice", "Allan", "Yasmin", "Elvira", "Jared", "Celeste", "Terry" ], "edges": [ [ 0, 6 ], [ 2, 7 ], [ 3, 5 ], [ 3, 9 ], [ 6, 8 ], [ 7, 1 ], [ 8, 4 ], [ 8, 3 ], [ 9, 2 ], [ 10, 16 ], [ 12, 17 ], [ 13, 15 ], [ 13, 19 ], [ 16, 18 ], [ 17, 11 ], [ 18, 14 ], [ 18, 13 ], [ 19, 12 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Charles knows Ethan. Cody knows Frank. Luis knows Xavier. Hazel knows Langston. Harriet knows Brenda. Carter knows Hazel. Larissa knows Carmela. Larissa knows Carter. Langston knows Luis. Cody knows Violet. Brenda knows Gerald. Larissa knows Mason. Cody knows Harriet. Freya knows Lane. Carter knows Charles. Harriet knows Ernie. Ernie knows Vicki. Gerald knows Freya. Which of Freya and Luis can Cody reach?", "answer": "Freya", "steps": [ "Cody knows Harriet.", "Harriet knows Brenda.", "Brenda knows Gerald.", "Gerald knows Freya." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Cody", "Harriet", "Violet", "Gerald", "Ernie", "Frank", "Freya", "Brenda", "Lane", "Vicki", "Larissa", "Carter", "Mason", "Langston", "Charles", "Carmela", "Luis", "Hazel", "Xavier", "Ethan" ], "edges": [ [ 0, 2 ], [ 0, 5 ], [ 0, 1 ], [ 1, 7 ], [ 1, 4 ], [ 3, 6 ], [ 4, 9 ], [ 6, 8 ], [ 7, 3 ], [ 10, 12 ], [ 10, 15 ], [ 10, 11 ], [ 11, 17 ], [ 11, 14 ], [ 13, 16 ], [ 14, 19 ], [ 16, 18 ], [ 17, 13 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Dorothy knows Colette. Priscilla knows Regina. Fanny knows Lorna. Jakob knows Lee. Lorna knows Zane. Jakob knows Grace. Jaime knows Humphrey. Dorothy knows Parker. Erwin knows Todd. Zane knows Dixie. Jaime knows Erwin. Parker knows Priscilla. Grace knows Fanny. Grace knows Celia. Miles knows Jaime. Sam knows Jakob. Erwin knows Dorothy. Fanny knows Sierra. Which of Zane and Priscilla can Miles reach?", "answer": "Priscilla", "steps": [ "Miles knows Jaime.", "Jaime knows Erwin.", "Erwin knows Dorothy.", "Dorothy knows Parker.", "Parker knows Priscilla." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Miles", "Regina", "Jaime", "Erwin", "Todd", "Dorothy", "Priscilla", "Parker", "Humphrey", "Colette", "Sam", "Dixie", "Jakob", "Grace", "Celia", "Fanny", "Zane", "Lorna", "Lee", "Sierra" ], "edges": [ [ 0, 2 ], [ 2, 8 ], [ 2, 3 ], [ 3, 4 ], [ 3, 5 ], [ 5, 7 ], [ 5, 9 ], [ 6, 1 ], [ 7, 6 ], [ 10, 12 ], [ 12, 18 ], [ 12, 13 ], [ 13, 14 ], [ 13, 15 ], [ 15, 17 ], [ 15, 19 ], [ 16, 11 ], [ 17, 16 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Robin knows Charlene. Isla knows Deborah. Ember knows Lyric. Ashton knows Robin. Isla knows Fergus. Ember knows Patricia. Ella knows Verna. Charlene knows Frank. Lyric knows Isla. Fergus knows Sheila. Ella knows Gerard. Frank knows Dayton. Frank knows Archer. Gerard knows Ember. Melody knows Pierce. Robin knows Keaton. Melody knows Ashton. Archer knows Caleb. Which of Charlene and Lyric can Ella reach?", "answer": "Lyric", "steps": [ "Ella knows Gerard.", "Gerard knows Ember.", "Ember knows Lyric." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Ella", "Gerard", "Sheila", "Lyric", "Verna", "Fergus", "Deborah", "Patricia", "Isla", "Ember", "Melody", "Ashton", "Caleb", "Charlene", "Pierce", "Archer", "Dayton", "Keaton", "Frank", "Robin" ], "edges": [ [ 0, 4 ], [ 0, 1 ], [ 1, 9 ], [ 3, 8 ], [ 5, 2 ], [ 8, 5 ], [ 8, 6 ], [ 9, 7 ], [ 9, 3 ], [ 10, 14 ], [ 10, 11 ], [ 11, 19 ], [ 13, 18 ], [ 15, 12 ], [ 18, 15 ], [ 18, 16 ], [ 19, 17 ], [ 19, 13 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Louis knows Calvin. Jaime knows Boyd. Chris knows Boris. Chris knows Esme. Esme knows Arnold. Louis knows Cynthia. Louisa knows Frances. Frances knows Megan. Chris knows Curtis. Boyd knows Ava. Curtis knows Louisa. Arnold knows Doug. Boyd knows Helene. Burt knows Carlton. Calvin knows Burt. Louis knows Evelyn. Cynthia knows Jaime. Frances knows Kobe. Which of Frances and Boyd can Chris reach?", "answer": "Frances", "steps": [ "Chris knows Curtis.", "Curtis knows Louisa.", "Louisa knows Frances." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Chris", "Kobe", "Esme", "Doug", "Frances", "Boris", "Louisa", "Megan", "Arnold", "Curtis", "Louis", "Ava", "Calvin", "Carlton", "Boyd", "Evelyn", "Jaime", "Helene", "Burt", "Cynthia" ], "edges": [ [ 0, 5 ], [ 0, 2 ], [ 0, 9 ], [ 2, 8 ], [ 4, 1 ], [ 4, 7 ], [ 6, 4 ], [ 8, 3 ], [ 9, 6 ], [ 10, 15 ], [ 10, 12 ], [ 10, 19 ], [ 12, 18 ], [ 14, 11 ], [ 14, 17 ], [ 16, 14 ], [ 18, 13 ], [ 19, 16 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Jake knows Helen. Nina knows Derrick. Shaun knows Esperanza. Luis knows Bernadette. Karl knows Luis. Nadine knows Nina. Karl knows Elton. Karl knows Ethan. Nina knows Karl. Shaun knows Jake. Jake knows Celia. Celia knows Simon. Jake knows Hayden. Jake knows Emery. Karl knows Lark. Esperanza knows Seth. Derrick knows Daphne. Whitney knows Shaun. Which of Karl and Jake can Nadine reach?", "answer": "Karl", "steps": [ "Nadine knows Nina.", "Nina knows Karl." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Nadine", "Bernadette", "Daphne", "Elton", "Lark", "Derrick", "Luis", "Ethan", "Nina", "Karl", "Whitney", "Simon", "Seth", "Hayden", "Emery", "Esperanza", "Celia", "Helen", "Shaun", "Jake" ], "edges": [ [ 0, 8 ], [ 5, 2 ], [ 6, 1 ], [ 8, 5 ], [ 8, 9 ], [ 9, 3 ], [ 9, 4 ], [ 9, 6 ], [ 9, 7 ], [ 10, 18 ], [ 15, 12 ], [ 16, 11 ], [ 18, 15 ], [ 18, 19 ], [ 19, 13 ], [ 19, 14 ], [ 19, 16 ], [ 19, 17 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Lucas knows Abigail. Dwight knows Kathleen. Michelle knows Ray. Will knows Jana. Marilyn knows Christopher. Lucas knows Marilyn. Christopher knows Madeline. Destiny knows Blake. Constance knows Gregory. Blake knows Chantal. Lucas knows Will. Dwight knows Michelle. Destiny knows Constance. Marilyn knows Farrah. Dwight knows Ken. Abigail knows Colby. Destiny knows Dwight. Marilyn knows Christina. Which of Marilyn and Dwight can Lucas reach?", "answer": "Marilyn", "steps": [ "Lucas knows Marilyn." ], "difficulty": 1, "original_distance": 3, "idx_to_symbol": [ "Lucas", "Christopher", "Jana", "Colby", "Christina", "Abigail", "Marilyn", "Madeline", "Will", "Farrah", "Destiny", "Michelle", "Chantal", "Gregory", "Ken", "Constance", "Dwight", "Ray", "Blake", "Kathleen" ], "edges": [ [ 0, 5 ], [ 0, 8 ], [ 0, 6 ], [ 1, 7 ], [ 5, 3 ], [ 6, 4 ], [ 6, 1 ], [ 6, 9 ], [ 8, 2 ], [ 10, 15 ], [ 10, 18 ], [ 10, 16 ], [ 11, 17 ], [ 15, 13 ], [ 16, 14 ], [ 16, 11 ], [ 16, 19 ], [ 18, 12 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Emanuel knows Chance. Marshall knows Cooper. Gonzalo knows Jewel. Cooper knows Peggy. Chance knows Landon. Belinda knows Gonzalo. Devin knows Ted. Marshall knows Cornelius. Emanuel knows Wade. Landon knows Robin. Ted knows Edmund. Gonzalo knows Emanuel. Ted knows Teresa. Gonzalo knows Noah. Cooper knows Devin. Landon knows Blanche. Mildred knows Marshall. Marshall knows Dante. Which of Cooper and Emanuel can Mildred reach?", "answer": "Cooper", "steps": [ "Mildred knows Marshall.", "Marshall knows Cooper." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Mildred", "Ted", "Peggy", "Edmund", "Dante", "Teresa", "Marshall", "Cooper", "Devin", "Cornelius", "Belinda", "Landon", "Wade", "Blanche", "Noah", "Robin", "Gonzalo", "Emanuel", "Chance", "Jewel" ], "edges": [ [ 0, 6 ], [ 1, 3 ], [ 1, 5 ], [ 6, 4 ], [ 6, 7 ], [ 6, 9 ], [ 7, 2 ], [ 7, 8 ], [ 8, 1 ], [ 10, 16 ], [ 11, 13 ], [ 11, 15 ], [ 16, 14 ], [ 16, 17 ], [ 16, 19 ], [ 17, 12 ], [ 17, 18 ], [ 18, 11 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Sandy knows Darin. Howard knows Boyd. Felicia knows Wilbur. Glenda knows Sandy. Boyd knows Nell. Audrey knows Mia. Wayne knows Howard. Howard knows Donna. Drake knows Earl. Felicia knows Goldie. Howard knows Jean. Nell knows Dexter. Felicia knows Elijah. Hannah knows Drake. Mia knows Glenda. Dexter knows Hannah. Farrah knows Felicia. Goldie knows Audrey. Which of Felicia and Howard can Farrah reach?", "answer": "Felicia", "steps": [ "Farrah knows Felicia." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Farrah", "Darin", "Audrey", "Elijah", "Goldie", "Wilbur", "Glenda", "Sandy", "Felicia", "Mia", "Wayne", "Earl", "Nell", "Jean", "Boyd", "Donna", "Hannah", "Drake", "Howard", "Dexter" ], "edges": [ [ 0, 8 ], [ 2, 9 ], [ 4, 2 ], [ 6, 7 ], [ 7, 1 ], [ 8, 3 ], [ 8, 5 ], [ 8, 4 ], [ 9, 6 ], [ 10, 18 ], [ 12, 19 ], [ 14, 12 ], [ 16, 17 ], [ 17, 11 ], [ 18, 13 ], [ 18, 15 ], [ 18, 14 ], [ 19, 16 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Cooper knows Shannon. Eva knows Leslie. Chase knows Guy. Chase knows Kylie. Leslie knows Elodie. Khashayar knows Blaine. Myra knows Khashayar. Luis knows Alexa. Guy knows Eva. Alexa knows Sally. Jocelyn knows Dee. Luis knows Susanne. Kylie knows Cooper. Shannon knows Kendrick. Elodie knows Kristin. Susanne knows Alex. Alex knows Myra. Sally knows Jocelyn. Which of Elodie and Khashayar can Chase reach?", "answer": "Elodie", "steps": [ "Chase knows Guy.", "Guy knows Eva.", "Eva knows Leslie.", "Leslie knows Elodie." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Chase", "Elodie", "Kendrick", "Kylie", "Guy", "Eva", "Shannon", "Kristin", "Cooper", "Leslie", "Luis", "Khashayar", "Dee", "Alexa", "Susanne", "Alex", "Jocelyn", "Blaine", "Sally", "Myra" ], "edges": [ [ 0, 3 ], [ 0, 4 ], [ 1, 7 ], [ 3, 8 ], [ 4, 5 ], [ 5, 9 ], [ 6, 2 ], [ 8, 6 ], [ 9, 1 ], [ 10, 13 ], [ 10, 14 ], [ 11, 17 ], [ 13, 18 ], [ 14, 15 ], [ 15, 19 ], [ 16, 12 ], [ 18, 16 ], [ 19, 11 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Hugh knows Archer. Archer knows Yuki. Harriet knows Dexter. Harriet knows Don. Blake knows Bennett. Troy knows Stella. Bennett knows Harriet. Brock knows Hazel. Khashayar knows Blake. Bennett knows Troy. Vernon knows Beverly. Yuki knows Brock. Delilah knows Samuel. Patrick knows Kate. Dexter knows Patrick. Vernon knows Charles. Yuki knows Vernon. Beverly knows Delilah. Which of Dexter and Beverly can Khashayar reach?", "answer": "Dexter", "steps": [ "Khashayar knows Blake.", "Blake knows Bennett.", "Bennett knows Harriet.", "Harriet knows Dexter." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Khashayar", "Blake", "Harriet", "Bennett", "Patrick", "Kate", "Don", "Troy", "Dexter", "Stella", "Hugh", "Archer", "Vernon", "Yuki", "Delilah", "Samuel", "Charles", "Brock", "Beverly", "Hazel" ], "edges": [ [ 0, 1 ], [ 1, 3 ], [ 2, 6 ], [ 2, 8 ], [ 3, 2 ], [ 3, 7 ], [ 4, 5 ], [ 7, 9 ], [ 8, 4 ], [ 10, 11 ], [ 11, 13 ], [ 12, 16 ], [ 12, 18 ], [ 13, 12 ], [ 13, 17 ], [ 14, 15 ], [ 17, 19 ], [ 18, 14 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Lewis knows Destiny. Harmony knows Audrey. Sebastian knows Effie. Destiny knows Leo. Devon knows Janice. Sarah knows Shannon. Shannon knows Hailey. Vicki knows Harmony. Leo knows Rita. Effie knows Jean. Michelle knows Sebastian. Effie knows Alma. Audrey knows Maria. Harmony knows Arturo. Destiny knows Vicki. Leo knows Wendy. Shannon knows Devon. Sebastian knows Sarah. Which of Destiny and Sebastian can Michelle reach?", "answer": "Sebastian", "steps": [ "Michelle knows Sebastian." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Michelle", "Sebastian", "Shannon", "Sarah", "Effie", "Jean", "Alma", "Hailey", "Janice", "Devon", "Lewis", "Destiny", "Harmony", "Vicki", "Leo", "Wendy", "Rita", "Arturo", "Maria", "Audrey" ], "edges": [ [ 0, 1 ], [ 1, 4 ], [ 1, 3 ], [ 2, 7 ], [ 2, 9 ], [ 3, 2 ], [ 4, 5 ], [ 4, 6 ], [ 9, 8 ], [ 10, 11 ], [ 11, 14 ], [ 11, 13 ], [ 12, 17 ], [ 12, 19 ], [ 13, 12 ], [ 14, 15 ], [ 14, 16 ], [ 19, 18 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Abby knows Cole. Cole knows Clifford. Jon knows Joan. Yara knows Merle. Calvin knows Marie. Florence knows Calvin. Cole knows Harriet. Merle knows Emery. Levi knows Laura. Cole knows Shaun. Jon knows Levi. Jon knows Edison. Clifford knows Ruth. Marie knows Abby. Archer knows Joseph. Emery knows Archer. Abby knows Fleur. Archer knows Jon. Which of Clifford and Levi can Yara reach?", "answer": "Levi", "steps": [ "Yara knows Merle.", "Merle knows Emery.", "Emery knows Archer.", "Archer knows Jon.", "Jon knows Levi." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Yara", "Laura", "Emery", "Joan", "Edison", "Merle", "Joseph", "Levi", "Jon", "Archer", "Florence", "Ruth", "Marie", "Harriet", "Shaun", "Calvin", "Fleur", "Clifford", "Cole", "Abby" ], "edges": [ [ 0, 5 ], [ 2, 9 ], [ 5, 2 ], [ 7, 1 ], [ 8, 3 ], [ 8, 4 ], [ 8, 7 ], [ 9, 6 ], [ 9, 8 ], [ 10, 15 ], [ 12, 19 ], [ 15, 12 ], [ 17, 11 ], [ 18, 13 ], [ 18, 14 ], [ 18, 17 ], [ 19, 16 ], [ 19, 18 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Joanna knows Earle. Rhonda knows Katherine. Greta knows Rhonda. Jean knows Judy. Katherine knows Daniel. Francesca knows Greta. Daniel knows Scott. Daniel knows Yvonne. Kay knows Joanna. Jack knows Cesar. Yvonne knows Janice. Judy knows Emanuel. Earle knows Cain. Judy knows Axel. Cain knows Tonya. Cesar knows Francesca. Tonya knows Jean. Emanuel knows Ariana. Which of Judy and Daniel can Jack reach?", "answer": "Daniel", "steps": [ "Jack knows Cesar.", "Cesar knows Francesca.", "Francesca knows Greta.", "Greta knows Rhonda.", "Rhonda knows Katherine.", "Katherine knows Daniel." ], "difficulty": 6, "original_distance": 8, "idx_to_symbol": [ "Jack", "Greta", "Cesar", "Scott", "Katherine", "Yvonne", "Janice", "Daniel", "Francesca", "Rhonda", "Kay", "Cain", "Joanna", "Axel", "Jean", "Emanuel", "Ariana", "Judy", "Earle", "Tonya" ], "edges": [ [ 0, 2 ], [ 1, 9 ], [ 2, 8 ], [ 4, 7 ], [ 5, 6 ], [ 7, 3 ], [ 7, 5 ], [ 8, 1 ], [ 9, 4 ], [ 10, 12 ], [ 11, 19 ], [ 12, 18 ], [ 14, 17 ], [ 15, 16 ], [ 17, 13 ], [ 17, 15 ], [ 18, 11 ], [ 19, 14 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Archer knows Duncan. Eduardo knows Ramon. Rex knows Conrad. Rex knows Archer. Jessie knows Lydia. Lydia knows Wilbur. Lydia knows Tara. Gareth knows Forrest. Sean knows Janice. Ross knows Jessie. Forrest knows Eduardo. Rena knows Sean. Tara knows Rena. Grace knows Rex. Archer knows Gareth. Jessie knows Ramona. Ramon knows Amelia. Janice knows Sam. Which of Archer and Lydia can Grace reach?", "answer": "Archer", "steps": [ "Grace knows Rex.", "Rex knows Archer." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Grace", "Ramon", "Duncan", "Gareth", "Amelia", "Archer", "Eduardo", "Rex", "Forrest", "Conrad", "Ross", "Janice", "Wilbur", "Tara", "Sam", "Lydia", "Sean", "Jessie", "Rena", "Ramona" ], "edges": [ [ 0, 7 ], [ 1, 4 ], [ 3, 8 ], [ 5, 2 ], [ 5, 3 ], [ 6, 1 ], [ 7, 5 ], [ 7, 9 ], [ 8, 6 ], [ 10, 17 ], [ 11, 14 ], [ 13, 18 ], [ 15, 12 ], [ 15, 13 ], [ 16, 11 ], [ 17, 15 ], [ 17, 19 ], [ 18, 16 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Vivian knows Natalie. Veronica knows Mitchell. Katrina knows Zack. Dalton knows Miranda. Zoe knows Inez. Mitchell knows Jewel. Fred knows Patrick. Vivian knows Katrina. Zack knows Harmony. Shelly knows Vivian. Jessica knows Zoe. Mitchell knows Robin. Jessica knows Bernard. Inez knows Fred. Miranda knows Shelly. Fred knows Veronica. Zack knows Clarence. Dalton knows Dora. Which of Shelly and Inez can Dalton reach?", "answer": "Shelly", "steps": [ "Dalton knows Miranda.", "Miranda knows Shelly." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Dalton", "Katrina", "Miranda", "Clarence", "Dora", "Zack", "Harmony", "Vivian", "Shelly", "Natalie", "Jessica", "Veronica", "Zoe", "Jewel", "Bernard", "Mitchell", "Robin", "Fred", "Inez", "Patrick" ], "edges": [ [ 0, 4 ], [ 0, 2 ], [ 1, 5 ], [ 2, 8 ], [ 5, 3 ], [ 5, 6 ], [ 7, 1 ], [ 7, 9 ], [ 8, 7 ], [ 10, 14 ], [ 10, 12 ], [ 11, 15 ], [ 12, 18 ], [ 15, 13 ], [ 15, 16 ], [ 17, 11 ], [ 17, 19 ], [ 18, 17 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Marcus knows Gene. Stephanie knows Ernie. Jane knows Brody. Wendell knows Effie. Perry knows Lauren. Lauren knows Marcus. Ernie knows Colette. Wendell knows Milton. Zoe knows Stephanie. Riley knows Jane. Lyric knows Simon. Milton knows Rocco. Colette knows Wendell. Lauren knows Arturo. Arturo knows Hector. Stephanie knows Lyric. Riley knows Jon. Gene knows Riley. Which of Brody and Rocco can Zoe reach?", "answer": "Rocco", "steps": [ "Zoe knows Stephanie.", "Stephanie knows Ernie.", "Ernie knows Colette.", "Colette knows Wendell.", "Wendell knows Milton.", "Milton knows Rocco." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Zoe", "Stephanie", "Lyric", "Colette", "Effie", "Ernie", "Simon", "Wendell", "Rocco", "Milton", "Perry", "Lauren", "Arturo", "Gene", "Jon", "Marcus", "Hector", "Riley", "Brody", "Jane" ], "edges": [ [ 0, 1 ], [ 1, 2 ], [ 1, 5 ], [ 2, 6 ], [ 3, 7 ], [ 5, 3 ], [ 7, 4 ], [ 7, 9 ], [ 9, 8 ], [ 10, 11 ], [ 11, 12 ], [ 11, 15 ], [ 12, 16 ], [ 13, 17 ], [ 15, 13 ], [ 17, 14 ], [ 17, 19 ], [ 19, 18 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Pierce knows Graham. Louisa knows Victor. Kim knows Sheila. Victor knows Lewis. Tina knows Ford. Lennox knows Jenna. Gabriel knows Carla. Jem knows Marco. Carla knows Merle. Ford knows Edmund. Hudson knows Kim. Pierce knows Tina. Carla knows Judith. Victor knows Hudson. Marco knows Lennox. Kim knows Jem. Merle knows Pierce. Edmund knows Leigh. Which of Hudson and Merle can Gabriel reach?", "answer": "Merle", "steps": [ "Gabriel knows Carla.", "Carla knows Merle." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Gabriel", "Graham", "Edmund", "Tina", "Pierce", "Carla", "Ford", "Merle", "Leigh", "Judith", "Louisa", "Sheila", "Lennox", "Jem", "Kim", "Victor", "Marco", "Hudson", "Jenna", "Lewis" ], "edges": [ [ 0, 5 ], [ 2, 8 ], [ 3, 6 ], [ 4, 1 ], [ 4, 3 ], [ 5, 7 ], [ 5, 9 ], [ 6, 2 ], [ 7, 4 ], [ 10, 15 ], [ 12, 18 ], [ 13, 16 ], [ 14, 11 ], [ 14, 13 ], [ 15, 17 ], [ 15, 19 ], [ 16, 12 ], [ 17, 14 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Lucy knows Diego. Joaquin knows Hope. Lee knows Coral. Arden knows Lee. Grace knows Jose. Chase knows Dante. Joaquin knows Kennedy. Lucy knows Maria. Dante knows Kerry. Lars knows Bart. Hope knows Lucy. Coral knows Grace. Jerome knows Lars. Lars knows Burt. Grace knows Ibrahim. Dante knows Arden. Burt knows Joaquin. Lee knows Oliver. Which of Lee and Joaquin can Jerome reach?", "answer": "Joaquin", "steps": [ "Jerome knows Lars.", "Lars knows Burt.", "Burt knows Joaquin." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Jerome", "Bart", "Joaquin", "Kennedy", "Diego", "Hope", "Burt", "Lars", "Maria", "Lucy", "Chase", "Kerry", "Lee", "Oliver", "Ibrahim", "Coral", "Arden", "Dante", "Jose", "Grace" ], "edges": [ [ 0, 7 ], [ 2, 3 ], [ 2, 5 ], [ 5, 9 ], [ 6, 2 ], [ 7, 1 ], [ 7, 6 ], [ 9, 4 ], [ 9, 8 ], [ 10, 17 ], [ 12, 13 ], [ 12, 15 ], [ 15, 19 ], [ 16, 12 ], [ 17, 11 ], [ 17, 16 ], [ 19, 14 ], [ 19, 18 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "India knows Aldo. Latoya knows Lance. Randy knows Isla. Dick knows Omar. Cruz knows Dick. Latoya knows Myrtle. Isabel knows Jill. Myrtle knows Isabel. Dick knows Willis. Basil knows Cruz. Randy knows Byron. Terrence knows Gerard. Hattie knows Vicki. Jill knows Terrence. Cruz knows India. Hattie knows Aurora. Jill knows Hattie. Isla knows Basil. Which of Isabel and Basil can Latoya reach?", "answer": "Isabel", "steps": [ "Latoya knows Myrtle.", "Myrtle knows Isabel." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Latoya", "Vicki", "Gerard", "Lance", "Isabel", "Jill", "Terrence", "Myrtle", "Aurora", "Hattie", "Randy", "Willis", "Aldo", "Byron", "Basil", "Cruz", "India", "Isla", "Omar", "Dick" ], "edges": [ [ 0, 3 ], [ 0, 7 ], [ 4, 5 ], [ 5, 6 ], [ 5, 9 ], [ 6, 2 ], [ 7, 4 ], [ 9, 1 ], [ 9, 8 ], [ 10, 13 ], [ 10, 17 ], [ 14, 15 ], [ 15, 16 ], [ 15, 19 ], [ 16, 12 ], [ 17, 14 ], [ 19, 11 ], [ 19, 18 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Diana knows Brenda. Joan knows Harmony. Holly knows Lorna. Kurt knows Olivia. Yasmin knows Joan. Harmony knows Kurt. Kurt knows Iris. Diana knows Dylan. Holly knows Frances. Alejandro knows Carrie. Yuki knows Sally. Alejandro knows Alma. Dayton knows Yuki. Olivia knows Alejandro. Alma knows Kieran. Frances knows Gordon. Sally knows Diana. Dylan knows Holly. Which of Holly and Alejandro can Dayton reach?", "answer": "Holly", "steps": [ "Dayton knows Yuki.", "Yuki knows Sally.", "Sally knows Diana.", "Diana knows Dylan.", "Dylan knows Holly." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Dayton", "Holly", "Yuki", "Brenda", "Diana", "Frances", "Sally", "Lorna", "Gordon", "Dylan", "Yasmin", "Alejandro", "Joan", "Iris", "Kurt", "Alma", "Harmony", "Carrie", "Kieran", "Olivia" ], "edges": [ [ 0, 2 ], [ 1, 7 ], [ 1, 5 ], [ 2, 6 ], [ 4, 3 ], [ 4, 9 ], [ 5, 8 ], [ 6, 4 ], [ 9, 1 ], [ 10, 12 ], [ 11, 17 ], [ 11, 15 ], [ 12, 16 ], [ 14, 13 ], [ 14, 19 ], [ 15, 18 ], [ 16, 14 ], [ 19, 11 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Arturo knows Antonio. Tom knows Garrison. Daria knows Etta. Etta knows Ted. Antonio knows Tom. Antonio knows Darren. Ryan knows Eamon. Ryan knows Cara. Alyson knows Arturo. Dexter knows Tanya. Frances knows Ryan. Cara knows Dick. Dexter knows Alyson. Lloyd knows Dexter. Daria knows Celia. Daria knows Dean. Dick knows Daria. Antonio knows Willard. Which of Antonio and Daria can Lloyd reach?", "answer": "Antonio", "steps": [ "Lloyd knows Dexter.", "Dexter knows Alyson.", "Alyson knows Arturo.", "Arturo knows Antonio." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Lloyd", "Darren", "Dexter", "Tom", "Willard", "Antonio", "Garrison", "Tanya", "Arturo", "Alyson", "Frances", "Celia", "Ryan", "Etta", "Dean", "Daria", "Ted", "Eamon", "Dick", "Cara" ], "edges": [ [ 0, 2 ], [ 2, 7 ], [ 2, 9 ], [ 3, 6 ], [ 5, 1 ], [ 5, 4 ], [ 5, 3 ], [ 8, 5 ], [ 9, 8 ], [ 10, 12 ], [ 12, 17 ], [ 12, 19 ], [ 13, 16 ], [ 15, 11 ], [ 15, 14 ], [ 15, 13 ], [ 18, 15 ], [ 19, 18 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Dahlia knows Erin. Gabriel knows Ebony. Erin knows Hudson. Dahlia knows Lucas. Lambert knows Gabriel. Keith knows Bernard. Bernard knows Pete. Gabriel knows Greta. Pete knows Rocco. Sean knows Darren. Lucas knows Keith. Deirdre knows Becky. Charity knows Deirdre. Madeline knows Dahlia. Greta knows Grady. Darren knows Charity. Rocco knows Harper. Ebony knows Sean. Which of Harper and Becky can Lambert reach?", "answer": "Becky", "steps": [ "Lambert knows Gabriel.", "Gabriel knows Ebony.", "Ebony knows Sean.", "Sean knows Darren.", "Darren knows Charity.", "Charity knows Deirdre.", "Deirdre knows Becky." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Lambert", "Deirdre", "Darren", "Gabriel", "Charity", "Becky", "Grady", "Sean", "Ebony", "Greta", "Madeline", "Rocco", "Bernard", "Dahlia", "Pete", "Harper", "Hudson", "Keith", "Lucas", "Erin" ], "edges": [ [ 0, 3 ], [ 1, 5 ], [ 2, 4 ], [ 3, 8 ], [ 3, 9 ], [ 4, 1 ], [ 7, 2 ], [ 8, 7 ], [ 9, 6 ], [ 10, 13 ], [ 11, 15 ], [ 12, 14 ], [ 13, 18 ], [ 13, 19 ], [ 14, 11 ], [ 17, 12 ], [ 18, 17 ], [ 19, 16 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Lawson knows Isabel. Pam knows Maureen. Lawson knows Jared. Maureen knows Jasmine. Sylvia knows Deborah. Dahlia knows Jeremiah. Dahlia knows Colby. Jacques knows Dahlia. Kennedy knows Sebastian. Pam knows Jacques. Sylvia knows Dexter. Dahlia knows Harris. Lawson knows Fritz. Lawson knows Herbert. Deborah knows Kennedy. Dexter knows Lawson. Jasmine knows Candice. Dahlia knows Ernie. Which of Candice and Sebastian can Sylvia reach?", "answer": "Sebastian", "steps": [ "Sylvia knows Deborah.", "Deborah knows Kennedy.", "Kennedy knows Sebastian." ], "difficulty": 3, "original_distance": 3, "idx_to_symbol": [ "Sylvia", "Deborah", "Herbert", "Kennedy", "Fritz", "Sebastian", "Isabel", "Dexter", "Lawson", "Jared", "Pam", "Maureen", "Colby", "Jasmine", "Harris", "Candice", "Jeremiah", "Jacques", "Dahlia", "Ernie" ], "edges": [ [ 0, 1 ], [ 0, 7 ], [ 1, 3 ], [ 3, 5 ], [ 7, 8 ], [ 8, 2 ], [ 8, 4 ], [ 8, 6 ], [ 8, 9 ], [ 10, 11 ], [ 10, 17 ], [ 11, 13 ], [ 13, 15 ], [ 17, 18 ], [ 18, 12 ], [ 18, 14 ], [ 18, 16 ], [ 18, 19 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Jesse knows Marcia. Victor knows Lucas. Lucas knows Tabitha. Jarvis knows Jeff. Wallace knows Jarvis. Vicki knows Jesse. Anthony knows Todd. Anthony knows Verna. Verna knows Maya. Albert knows Gemma. Todd knows Wallace. Cornelius knows Anthony. Nancy knows Vicki. Gemma knows Victor. Blanche knows Iris. Tabitha knows Drew. Vicki knows Albert. Jeff knows Blanche. Which of Drew and Iris can Cornelius reach?", "answer": "Iris", "steps": [ "Cornelius knows Anthony.", "Anthony knows Todd.", "Todd knows Wallace.", "Wallace knows Jarvis.", "Jarvis knows Jeff.", "Jeff knows Blanche.", "Blanche knows Iris." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Cornelius", "Jeff", "Blanche", "Anthony", "Todd", "Wallace", "Iris", "Jarvis", "Maya", "Verna", "Nancy", "Lucas", "Tabitha", "Vicki", "Albert", "Gemma", "Drew", "Victor", "Marcia", "Jesse" ], "edges": [ [ 0, 3 ], [ 1, 2 ], [ 2, 6 ], [ 3, 4 ], [ 3, 9 ], [ 4, 5 ], [ 5, 7 ], [ 7, 1 ], [ 9, 8 ], [ 10, 13 ], [ 11, 12 ], [ 12, 16 ], [ 13, 14 ], [ 13, 19 ], [ 14, 15 ], [ 15, 17 ], [ 17, 11 ], [ 19, 18 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Christian knows Shelby. Camden knows Celeste. Allen knows Verna. Marie knows Claude. Wallace knows Marie. Celeste knows Christian. Vicki knows Maude. Landon knows Abby. Vanessa knows Bennett. Lana knows Morris. Claude knows Allen. Verna knows Brett. Celeste knows Bonnie. Claude knows Landon. Shelby knows Vanessa. Bonnie knows Josie. Marie knows Vicki. Christian knows Lana. Which of Brett and Bennett can Wallace reach?", "answer": "Brett", "steps": [ "Wallace knows Marie.", "Marie knows Claude.", "Claude knows Allen.", "Allen knows Verna.", "Verna knows Brett." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Wallace", "Landon", "Verna", "Brett", "Allen", "Vicki", "Marie", "Abby", "Claude", "Maude", "Camden", "Lana", "Vanessa", "Bennett", "Shelby", "Bonnie", "Celeste", "Morris", "Christian", "Josie" ], "edges": [ [ 0, 6 ], [ 1, 7 ], [ 2, 3 ], [ 4, 2 ], [ 5, 9 ], [ 6, 8 ], [ 6, 5 ], [ 8, 4 ], [ 8, 1 ], [ 10, 16 ], [ 11, 17 ], [ 12, 13 ], [ 14, 12 ], [ 15, 19 ], [ 16, 18 ], [ 16, 15 ], [ 18, 14 ], [ 18, 11 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Luz knows Lorraine. Lorraine knows Ezra. Virginia knows Hunter. Neil knows Kurt. Corey knows Neil. Hunter knows Douglas. Sonia knows Chelsea. Lorraine knows Aurora. Neil knows Brock. Aurora knows Alyssa. Brock knows Sonia. Daisy knows Eduardo. Caroline knows Emma. Eduardo knows Ainsley. Aurora knows Caroline. Corey knows Daisy. Luz knows Virginia. Brock knows Isla. Which of Sonia and Caroline can Corey reach?", "answer": "Sonia", "steps": [ "Corey knows Neil.", "Neil knows Brock.", "Brock knows Sonia." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Corey", "Brock", "Neil", "Sonia", "Kurt", "Daisy", "Eduardo", "Chelsea", "Isla", "Ainsley", "Luz", "Aurora", "Lorraine", "Caroline", "Ezra", "Virginia", "Hunter", "Emma", "Alyssa", "Douglas" ], "edges": [ [ 0, 2 ], [ 0, 5 ], [ 1, 3 ], [ 1, 8 ], [ 2, 4 ], [ 2, 1 ], [ 3, 7 ], [ 5, 6 ], [ 6, 9 ], [ 10, 12 ], [ 10, 15 ], [ 11, 13 ], [ 11, 18 ], [ 12, 14 ], [ 12, 11 ], [ 13, 17 ], [ 15, 16 ], [ 16, 19 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Eden knows Viola. Marilyn knows Val. Eden knows Wanda. William knows Gwen. Hope knows Estella. Ella knows Dora. Colin knows Demetrius. Dora knows Marilyn. Hope knows Eden. Earle knows Hope. Jonah knows Colin. Marilyn knows Porter. Demetrius knows Ella. Pearl knows Earle. Harris knows Pearl. Dora knows William. Estella knows Cameron. Corinne knows Harris. Which of Colin and Harris can Corinne reach?", "answer": "Harris", "steps": [ "Corinne knows Harris." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Corinne", "Harris", "Hope", "Eden", "Estella", "Cameron", "Pearl", "Viola", "Earle", "Wanda", "Jonah", "Colin", "Dora", "Marilyn", "William", "Gwen", "Demetrius", "Val", "Ella", "Porter" ], "edges": [ [ 0, 1 ], [ 1, 6 ], [ 2, 4 ], [ 2, 3 ], [ 3, 7 ], [ 3, 9 ], [ 4, 5 ], [ 6, 8 ], [ 8, 2 ], [ 10, 11 ], [ 11, 16 ], [ 12, 14 ], [ 12, 13 ], [ 13, 17 ], [ 13, 19 ], [ 14, 15 ], [ 16, 18 ], [ 18, 12 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Earle knows Sybil. Sierra knows Earle. Sierra knows Lyle. Anita knows Chad. Anita knows Alyson. Sally knows Roman. Priscilla knows Damien. Jacob knows Anita. Sally knows Earl. Priscilla knows Bette. Sally knows Tony. Evelyn knows Calvin. Bert knows Priscilla. Jacob knows Bert. Calvin knows Sierra. Evelyn knows Sally. Bette knows Larissa. Anita knows Mark. Which of Bette and Earle can Evelyn reach?", "answer": "Earle", "steps": [ "Evelyn knows Calvin.", "Calvin knows Sierra.", "Sierra knows Earle." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Evelyn", "Sierra", "Sally", "Roman", "Sybil", "Calvin", "Earle", "Tony", "Lyle", "Earl", "Jacob", "Priscilla", "Anita", "Alyson", "Larissa", "Bert", "Bette", "Mark", "Damien", "Chad" ], "edges": [ [ 0, 5 ], [ 0, 2 ], [ 1, 6 ], [ 1, 8 ], [ 2, 3 ], [ 2, 7 ], [ 2, 9 ], [ 5, 1 ], [ 6, 4 ], [ 10, 15 ], [ 10, 12 ], [ 11, 16 ], [ 11, 18 ], [ 12, 13 ], [ 12, 17 ], [ 12, 19 ], [ 15, 11 ], [ 16, 14 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Judith knows Pearl. Tessa knows Ernesto. Diane knows Anastasia. Helen knows Heath. Jared knows Tessa. Elodie knows Chance. Jared knows Doris. Jared knows Gunnar. Gunnar knows Celeste. Denver knows James. Chance knows Judith. Pearl knows Diane. Heath knows Dina. Chance knows Charity. Heath knows Levi. Levi knows Jared. Pearl knows Jessie. Pearl knows Denver. Which of Pearl and Jared can Helen reach?", "answer": "Jared", "steps": [ "Helen knows Heath.", "Heath knows Levi.", "Levi knows Jared." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Helen", "Gunnar", "Levi", "Doris", "Heath", "Jared", "Ernesto", "Celeste", "Tessa", "Dina", "Elodie", "Diane", "Judith", "Jessie", "Chance", "Pearl", "James", "Anastasia", "Denver", "Charity" ], "edges": [ [ 0, 4 ], [ 1, 7 ], [ 2, 5 ], [ 4, 2 ], [ 4, 9 ], [ 5, 3 ], [ 5, 1 ], [ 5, 8 ], [ 8, 6 ], [ 10, 14 ], [ 11, 17 ], [ 12, 15 ], [ 14, 12 ], [ 14, 19 ], [ 15, 13 ], [ 15, 11 ], [ 15, 18 ], [ 18, 16 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Ella knows Anita. Emily knows Denver. Luella knows Todd. Lucille knows Flora. Anita knows Luella. Ella knows Harmony. Lucille knows Harris. Harris knows Jerome. Anita knows Leonard. Emily knows Damian. Gideon knows Lucille. Harris knows Everett. Harrison knows Thea. Clay knows Harrison. Denver knows Ella. Damian knows Frida. Clay knows Gideon. Everett knows Julius. Which of Anita and Harris can Emily reach?", "answer": "Anita", "steps": [ "Emily knows Denver.", "Denver knows Ella.", "Ella knows Anita." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Emily", "Frida", "Luella", "Anita", "Denver", "Todd", "Ella", "Damian", "Leonard", "Harmony", "Clay", "Thea", "Everett", "Harris", "Gideon", "Julius", "Lucille", "Harrison", "Jerome", "Flora" ], "edges": [ [ 0, 7 ], [ 0, 4 ], [ 2, 5 ], [ 3, 2 ], [ 3, 8 ], [ 4, 6 ], [ 6, 3 ], [ 6, 9 ], [ 7, 1 ], [ 10, 17 ], [ 10, 14 ], [ 12, 15 ], [ 13, 12 ], [ 13, 18 ], [ 14, 16 ], [ 16, 13 ], [ 16, 19 ], [ 17, 11 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "India knows Marc. Brock knows India. Damien knows Wesley. Irving knows Veronica. Vanessa knows Desmond. Irving knows Damien. Joyce knows Gina. Callum knows Luz. Luz knows Malik. Damien knows Brock. India knows Deirdre. Callum knows Ada. Damien knows Joyce. Luz knows Morgan. Vanessa knows Courtney. Malik knows Jade. Amber knows Vanessa. Luz knows Amber. Which of Brock and Amber can Irving reach?", "answer": "Brock", "steps": [ "Irving knows Damien.", "Damien knows Brock." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Irving", "Deirdre", "Wesley", "Veronica", "Gina", "Damien", "Joyce", "India", "Brock", "Marc", "Callum", "Courtney", "Morgan", "Ada", "Jade", "Luz", "Malik", "Vanessa", "Amber", "Desmond" ], "edges": [ [ 0, 3 ], [ 0, 5 ], [ 5, 2 ], [ 5, 6 ], [ 5, 8 ], [ 6, 4 ], [ 7, 1 ], [ 7, 9 ], [ 8, 7 ], [ 10, 13 ], [ 10, 15 ], [ 15, 12 ], [ 15, 16 ], [ 15, 18 ], [ 16, 14 ], [ 17, 11 ], [ 17, 19 ], [ 18, 17 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Jennifer knows Gerald. Amber knows Leah. Amber knows Jennifer. Fleur knows Lee. Anita knows Amanda. Laurel knows Tonya. Sydney knows Erwin. Max knows Amber. Bonnie knows Wilson. Anita knows Sydney. Leah knows Fleur. Arden knows Laurel. Lee knows Joaquin. Gerald knows Cody. Max knows Kristin. Sydney knows Dominic. Erwin knows Bonnie. Dominic knows Arden. Which of Leah and Dominic can Max reach?", "answer": "Leah", "steps": [ "Max knows Amber.", "Amber knows Leah." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Max", "Cody", "Jennifer", "Joaquin", "Lee", "Kristin", "Fleur", "Gerald", "Amber", "Leah", "Anita", "Wilson", "Erwin", "Tonya", "Laurel", "Amanda", "Arden", "Bonnie", "Sydney", "Dominic" ], "edges": [ [ 0, 5 ], [ 0, 8 ], [ 2, 7 ], [ 4, 3 ], [ 6, 4 ], [ 7, 1 ], [ 8, 2 ], [ 8, 9 ], [ 9, 6 ], [ 10, 15 ], [ 10, 18 ], [ 12, 17 ], [ 14, 13 ], [ 16, 14 ], [ 17, 11 ], [ 18, 12 ], [ 18, 19 ], [ 19, 16 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Ford knows Sidney. Yvonne knows Winifred. Jeffery knows Alice. Diane knows Ford. Ainsley knows Rocco. Harry knows Ashley. Rocco knows Yvonne. Cordelia knows Vance. Effie knows Harry. Cordelia knows Latoya. Ainsley knows Jeffery. Vance knows Effie. Harry knows Janice. Wendy knows Roy. Latoya knows Bryan. Janice knows Wendy. Winifred knows Heath. Winifred knows Diane. Which of Harry and Winifred can Cordelia reach?", "answer": "Harry", "steps": [ "Cordelia knows Vance.", "Vance knows Effie.", "Effie knows Harry." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Cordelia", "Bryan", "Ashley", "Latoya", "Effie", "Roy", "Harry", "Vance", "Wendy", "Janice", "Ainsley", "Alice", "Heath", "Jeffery", "Yvonne", "Sidney", "Winifred", "Rocco", "Ford", "Diane" ], "edges": [ [ 0, 3 ], [ 0, 7 ], [ 3, 1 ], [ 4, 6 ], [ 6, 2 ], [ 6, 9 ], [ 7, 4 ], [ 8, 5 ], [ 9, 8 ], [ 10, 13 ], [ 10, 17 ], [ 13, 11 ], [ 14, 16 ], [ 16, 12 ], [ 16, 19 ], [ 17, 14 ], [ 18, 15 ], [ 19, 18 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Cruz knows Shelby. Shelby knows Kit. Jake knows Jerome. Jake knows Nina. Wade knows Sue. Shelby knows Nancy. Sue knows Jake. Sue knows Jermaine. Lyric knows Gladys. Percy knows Eamon. Jermaine knows Lyric. Rex knows Eunice. Rex knows Kane. Eamon knows Gloria. Gloria knows Cruz. Juan knows Wade. Gloria knows Rex. Lyric knows Antonio. Which of Nancy and Antonio can Juan reach?", "answer": "Antonio", "steps": [ "Juan knows Wade.", "Wade knows Sue.", "Sue knows Jermaine.", "Jermaine knows Lyric.", "Lyric knows Antonio." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Juan", "Jake", "Jermaine", "Lyric", "Wade", "Nina", "Jerome", "Sue", "Gladys", "Antonio", "Percy", "Rex", "Cruz", "Shelby", "Eamon", "Kane", "Eunice", "Gloria", "Kit", "Nancy" ], "edges": [ [ 0, 4 ], [ 1, 5 ], [ 1, 6 ], [ 2, 3 ], [ 3, 8 ], [ 3, 9 ], [ 4, 7 ], [ 7, 1 ], [ 7, 2 ], [ 10, 14 ], [ 11, 15 ], [ 11, 16 ], [ 12, 13 ], [ 13, 18 ], [ 13, 19 ], [ 14, 17 ], [ 17, 11 ], [ 17, 12 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Jane knows Monica. April knows Bette. Gina knows Jane. April knows Marcia. Irving knows Candice. Jonathan knows Boyd. April knows Garrett. April knows Claire. Marcia knows Lynn. Dennis knows Ryan. Dennis knows Abigail. Lynn knows Jonathan. Dennis knows Gina. Dennis knows Sonia. Boyd knows Ann. Monica knows Irving. Dennis knows Forrest. April knows Vicki. Which of Jonathan and Monica can Dennis reach?", "answer": "Monica", "steps": [ "Dennis knows Gina.", "Gina knows Jane.", "Jane knows Monica." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Dennis", "Candice", "Irving", "Monica", "Forrest", "Abigail", "Jane", "Sonia", "Gina", "Ryan", "April", "Ann", "Boyd", "Jonathan", "Garrett", "Vicki", "Lynn", "Claire", "Marcia", "Bette" ], "edges": [ [ 0, 4 ], [ 0, 5 ], [ 0, 7 ], [ 0, 8 ], [ 0, 9 ], [ 2, 1 ], [ 3, 2 ], [ 6, 3 ], [ 8, 6 ], [ 10, 14 ], [ 10, 15 ], [ 10, 17 ], [ 10, 18 ], [ 10, 19 ], [ 12, 11 ], [ 13, 12 ], [ 16, 13 ], [ 18, 16 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Camille knows Trina. Ember knows Benjamin. Clarissa knows Foster. Ember knows Camille. Trina knows Marion. John knows Whitney. Alfonso knows Chloe. Richard knows Rachel. Whitney knows Drew. Benjamin knows Lois. Carter knows John. Chester knows Owen. Foster knows Richard. Chester knows Kirsten. Foster knows Ember. Owen knows Susanne. John knows Chester. Kirsten knows Alfonso. Which of Foster and John can Carter reach?", "answer": "John", "steps": [ "Carter knows John." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Carter", "Chloe", "Chester", "John", "Alfonso", "Whitney", "Kirsten", "Drew", "Susanne", "Owen", "Clarissa", "Marion", "Ember", "Foster", "Trina", "Richard", "Camille", "Rachel", "Lois", "Benjamin" ], "edges": [ [ 0, 3 ], [ 2, 6 ], [ 2, 9 ], [ 3, 5 ], [ 3, 2 ], [ 4, 1 ], [ 5, 7 ], [ 6, 4 ], [ 9, 8 ], [ 10, 13 ], [ 12, 16 ], [ 12, 19 ], [ 13, 15 ], [ 13, 12 ], [ 14, 11 ], [ 15, 17 ], [ 16, 14 ], [ 19, 18 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Pearl knows Dante. Ellen knows Carey. Adele knows Conner. Tabitha knows Emily. Tiffany knows Oscar. Carey knows Julie. Franklin knows Edgar. Tiffany knows Conrad. Heather knows Tabitha. Adele knows Ron. Edgar knows Jasmine. Franklin knows Ellen. Emily knows Adele. Tiffany knows Naomi. Jasmine knows Tiffany. Adele knows Shannon. Heather knows Larry. Larry knows Pearl. Which of Tabitha and Edgar can Heather reach?", "answer": "Tabitha", "steps": [ "Heather knows Tabitha." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Heather", "Larry", "Tabitha", "Shannon", "Conner", "Pearl", "Emily", "Dante", "Adele", "Ron", "Franklin", "Ellen", "Edgar", "Oscar", "Naomi", "Carey", "Jasmine", "Julie", "Tiffany", "Conrad" ], "edges": [ [ 0, 1 ], [ 0, 2 ], [ 1, 5 ], [ 2, 6 ], [ 5, 7 ], [ 6, 8 ], [ 8, 3 ], [ 8, 4 ], [ 8, 9 ], [ 10, 11 ], [ 10, 12 ], [ 11, 15 ], [ 12, 16 ], [ 15, 17 ], [ 16, 18 ], [ 18, 13 ], [ 18, 14 ], [ 18, 19 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Vera knows Cassidy. Florence knows Tina. Dean knows Blanche. Celeste knows Magdalena. Kai knows Leo. Brandon knows Faith. Celeste knows Vera. Faith knows Samantha. Dean knows Drake. Virgil knows Brandon. Florence knows Dean. Greg knows Kai. Greg knows Jamie. Kirsten knows Celeste. Brandon knows Sheryl. Blanche knows Greg. Vera knows Virgil. Leigh knows Florence. Which of Brandon and Greg can Leigh reach?", "answer": "Greg", "steps": [ "Leigh knows Florence.", "Florence knows Dean.", "Dean knows Blanche.", "Blanche knows Greg." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Leigh", "Blanche", "Kai", "Greg", "Jamie", "Dean", "Leo", "Drake", "Florence", "Tina", "Kirsten", "Virgil", "Faith", "Brandon", "Sheryl", "Vera", "Samantha", "Cassidy", "Celeste", "Magdalena" ], "edges": [ [ 0, 8 ], [ 1, 3 ], [ 2, 6 ], [ 3, 4 ], [ 3, 2 ], [ 5, 1 ], [ 5, 7 ], [ 8, 5 ], [ 8, 9 ], [ 10, 18 ], [ 11, 13 ], [ 12, 16 ], [ 13, 14 ], [ 13, 12 ], [ 15, 11 ], [ 15, 17 ], [ 18, 15 ], [ 18, 19 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Mia knows Cara. Wesley knows Elvis. Vera knows Byron. Bailey knows Kay. Elvis knows Drew. Deborah knows Brian. Vera knows Andrea. Elena knows Vera. Byron knows Jason. Elvis knows Jerry. Kay knows Wesley. Leonard knows Axel. Deborah knows Elena. Byron knows Bernadette. Wesley knows Celeste. Bailey knows Vance. Byron knows Leonard. Elvis knows Mia. Which of Cara and Axel can Deborah reach?", "answer": "Axel", "steps": [ "Deborah knows Elena.", "Elena knows Vera.", "Vera knows Byron.", "Byron knows Leonard.", "Leonard knows Axel." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Deborah", "Vera", "Axel", "Andrea", "Leonard", "Bernadette", "Byron", "Elena", "Jason", "Brian", "Bailey", "Wesley", "Cara", "Celeste", "Mia", "Drew", "Elvis", "Kay", "Jerry", "Vance" ], "edges": [ [ 0, 7 ], [ 0, 9 ], [ 1, 3 ], [ 1, 6 ], [ 4, 2 ], [ 6, 4 ], [ 6, 5 ], [ 6, 8 ], [ 7, 1 ], [ 10, 17 ], [ 10, 19 ], [ 11, 13 ], [ 11, 16 ], [ 14, 12 ], [ 16, 14 ], [ 16, 15 ], [ 16, 18 ], [ 17, 11 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Mason knows Jewel. Judy knows Geoffrey. Selena knows Hudson. Jewel knows Saul. Estelle knows Dakota. Judy knows Selena. Joel knows Mason. Judy knows Greer. Jewel knows Belinda. Dean knows Christian. Estelle knows Doris. Blanche knows Dean. Greer knows Jonathan. Jewel knows Estelle. Mason knows Vicki. Selena knows Ethan. Dean knows Judy. Saul knows Gabe. Which of Greer and Saul can Blanche reach?", "answer": "Greer", "steps": [ "Blanche knows Dean.", "Dean knows Judy.", "Judy knows Greer." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Blanche", "Greer", "Ethan", "Jonathan", "Dean", "Selena", "Hudson", "Christian", "Geoffrey", "Judy", "Joel", "Saul", "Doris", "Gabe", "Mason", "Estelle", "Dakota", "Vicki", "Belinda", "Jewel" ], "edges": [ [ 0, 4 ], [ 1, 3 ], [ 4, 7 ], [ 4, 9 ], [ 5, 2 ], [ 5, 6 ], [ 9, 1 ], [ 9, 5 ], [ 9, 8 ], [ 10, 14 ], [ 11, 13 ], [ 14, 17 ], [ 14, 19 ], [ 15, 12 ], [ 15, 16 ], [ 19, 11 ], [ 19, 15 ], [ 19, 18 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Bryan knows Dennis. Peter knows Morgan. Bryan knows Susan. Fred knows Lawson. Peter knows Fred. Morgan knows Cecilia. Percy knows Thea. Nolan knows Willard. Estelle knows Peter. Willard knows Kurt. Percy knows Lamar. Lamar knows Bryan. Raquel knows Percy. Willard knows Estelle. Kurt knows Lennox. Thea knows Malik. Susan knows Claudia. Dennis knows Albert. Which of Percy and Willard can Nolan reach?", "answer": "Willard", "steps": [ "Nolan knows Willard." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Nolan", "Peter", "Lennox", "Kurt", "Cecilia", "Estelle", "Fred", "Morgan", "Lawson", "Willard", "Raquel", "Bryan", "Malik", "Thea", "Albert", "Lamar", "Susan", "Dennis", "Claudia", "Percy" ], "edges": [ [ 0, 9 ], [ 1, 7 ], [ 1, 6 ], [ 3, 2 ], [ 5, 1 ], [ 6, 8 ], [ 7, 4 ], [ 9, 3 ], [ 9, 5 ], [ 10, 19 ], [ 11, 17 ], [ 11, 16 ], [ 13, 12 ], [ 15, 11 ], [ 16, 18 ], [ 17, 14 ], [ 19, 13 ], [ 19, 15 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Dave knows Oliver. Claudia knows Hubert. Dave knows Samuel. Viola knows Dave. Samuel knows Jon. Jarvis knows Liam. Oliver knows Jarvis. Ilene knows Claudia. Jon knows Keegan. Jarvis knows Myra. Dina knows Darren. Claudia knows Dina. Hubert knows Lillian. Darren knows Walt. Ilene knows Max. Darren knows Verna. Lillian knows Arden. Viola knows Sharon. Which of Claudia and Dave can Ilene reach?", "answer": "Claudia", "steps": [ "Ilene knows Claudia." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Ilene", "Walt", "Dina", "Claudia", "Arden", "Hubert", "Lillian", "Darren", "Verna", "Max", "Viola", "Myra", "Oliver", "Dave", "Keegan", "Samuel", "Jon", "Jarvis", "Liam", "Sharon" ], "edges": [ [ 0, 3 ], [ 0, 9 ], [ 2, 7 ], [ 3, 5 ], [ 3, 2 ], [ 5, 6 ], [ 6, 4 ], [ 7, 1 ], [ 7, 8 ], [ 10, 13 ], [ 10, 19 ], [ 12, 17 ], [ 13, 15 ], [ 13, 12 ], [ 15, 16 ], [ 16, 14 ], [ 17, 11 ], [ 17, 18 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Hank knows William. Lenora knows Davis. Hank knows Doug. Boyd knows Gwen. Eleanor knows Boyd. Gerald knows Dennis. Davis knows Christian. Gerald knows Eleanor. Reid knows Bernadette. Doug knows Isadora. Hank knows Jonah. William knows Thomas. Hugo knows Katherine. Reid knows Hugo. William knows Rod. William knows Lenora. Gerald knows Jem. Reid knows Gerald. Which of Eleanor and Lenora can Hank reach?", "answer": "Lenora", "steps": [ "Hank knows William.", "William knows Lenora." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Hank", "Jonah", "Doug", "William", "Christian", "Rod", "Isadora", "Thomas", "Davis", "Lenora", "Reid", "Bernadette", "Hugo", "Gerald", "Gwen", "Dennis", "Katherine", "Jem", "Boyd", "Eleanor" ], "edges": [ [ 0, 1 ], [ 0, 2 ], [ 0, 3 ], [ 2, 6 ], [ 3, 5 ], [ 3, 7 ], [ 3, 9 ], [ 8, 4 ], [ 9, 8 ], [ 10, 11 ], [ 10, 12 ], [ 10, 13 ], [ 12, 16 ], [ 13, 15 ], [ 13, 17 ], [ 13, 19 ], [ 18, 14 ], [ 19, 18 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Lucy knows Diego. Joaquin knows Hope. Lee knows Coral. Arden knows Lee. Grace knows Jose. Chase knows Dante. Joaquin knows Kennedy. Lucy knows Maria. Dante knows Kerry. Lars knows Bart. Hope knows Lucy. Coral knows Grace. Jerome knows Lars. Lars knows Burt. Grace knows Ibrahim. Dante knows Arden. Burt knows Joaquin. Lee knows Oliver. Which of Dante and Lars can Jerome reach?", "answer": "Lars", "steps": [ "Jerome knows Lars." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Jerome", "Bart", "Joaquin", "Kennedy", "Diego", "Hope", "Burt", "Lars", "Maria", "Lucy", "Chase", "Kerry", "Lee", "Oliver", "Ibrahim", "Coral", "Arden", "Dante", "Jose", "Grace" ], "edges": [ [ 0, 7 ], [ 2, 3 ], [ 2, 5 ], [ 5, 9 ], [ 6, 2 ], [ 7, 1 ], [ 7, 6 ], [ 9, 4 ], [ 9, 8 ], [ 10, 17 ], [ 12, 13 ], [ 12, 15 ], [ 15, 19 ], [ 16, 12 ], [ 17, 11 ], [ 17, 16 ], [ 19, 14 ], [ 19, 18 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Abel knows Morris. Kay knows Ruby. Carey knows Dolores. Celia knows Franklin. Latoya knows Linda. Ember knows Abel. Latoya knows Jared. Nina knows Latoya. Franklin knows Sally. Ralph knows Kay. Chester knows Flora. Dolores knows Nina. Chester knows Ellis. Carey knows Skyler. Dolores knows Celia. Ember knows Marlene. Abel knows Ralph. Morris knows Chester. Which of Chester and Latoya can Ember reach?", "answer": "Chester", "steps": [ "Ember knows Abel.", "Abel knows Morris.", "Morris knows Chester." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Ember", "Kay", "Ralph", "Morris", "Abel", "Chester", "Flora", "Ellis", "Ruby", "Marlene", "Carey", "Franklin", "Celia", "Nina", "Dolores", "Latoya", "Linda", "Jared", "Sally", "Skyler" ], "edges": [ [ 0, 4 ], [ 0, 9 ], [ 1, 8 ], [ 2, 1 ], [ 3, 5 ], [ 4, 3 ], [ 4, 2 ], [ 5, 6 ], [ 5, 7 ], [ 10, 14 ], [ 10, 19 ], [ 11, 18 ], [ 12, 11 ], [ 13, 15 ], [ 14, 13 ], [ 14, 12 ], [ 15, 16 ], [ 15, 17 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Judith knows Pearl. Tessa knows Ernesto. Diane knows Anastasia. Helen knows Heath. Jared knows Tessa. Elodie knows Chance. Jared knows Doris. Jared knows Gunnar. Gunnar knows Celeste. Denver knows James. Chance knows Judith. Pearl knows Diane. Heath knows Dina. Chance knows Charity. Heath knows Levi. Levi knows Jared. Pearl knows Jessie. Pearl knows Denver. Which of Anastasia and Celeste can Helen reach?", "answer": "Celeste", "steps": [ "Helen knows Heath.", "Heath knows Levi.", "Levi knows Jared.", "Jared knows Gunnar.", "Gunnar knows Celeste." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Helen", "Gunnar", "Levi", "Doris", "Heath", "Jared", "Ernesto", "Celeste", "Tessa", "Dina", "Elodie", "Diane", "Judith", "Jessie", "Chance", "Pearl", "James", "Anastasia", "Denver", "Charity" ], "edges": [ [ 0, 4 ], [ 1, 7 ], [ 2, 5 ], [ 4, 2 ], [ 4, 9 ], [ 5, 3 ], [ 5, 1 ], [ 5, 8 ], [ 8, 6 ], [ 10, 14 ], [ 11, 17 ], [ 12, 15 ], [ 14, 12 ], [ 14, 19 ], [ 15, 13 ], [ 15, 11 ], [ 15, 18 ], [ 18, 16 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Doug knows Frank. Geraldine knows Alvin. Elmer knows Reid. Elmer knows Harry. Eugene knows Dell. Alfred knows Elmer. Mindy knows Walter. Adrian knows Aldo. Virgil knows Doug. Geraldine knows Mindy. Eugene knows Goldie. Virgil knows Alfred. Helen knows Eugene. Reid knows Estella. Aldo knows Virgil. Dell knows Geraldine. Goldie knows Garrett. Katherine knows Helen. Which of Mindy and Reid can Katherine reach?", "answer": "Mindy", "steps": [ "Katherine knows Helen.", "Helen knows Eugene.", "Eugene knows Dell.", "Dell knows Geraldine.", "Geraldine knows Mindy." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Katherine", "Eugene", "Garrett", "Walter", "Dell", "Geraldine", "Mindy", "Alvin", "Helen", "Goldie", "Adrian", "Virgil", "Frank", "Estella", "Alfred", "Elmer", "Reid", "Harry", "Aldo", "Doug" ], "edges": [ [ 0, 8 ], [ 1, 4 ], [ 1, 9 ], [ 4, 5 ], [ 5, 6 ], [ 5, 7 ], [ 6, 3 ], [ 8, 1 ], [ 9, 2 ], [ 10, 18 ], [ 11, 14 ], [ 11, 19 ], [ 14, 15 ], [ 15, 16 ], [ 15, 17 ], [ 16, 13 ], [ 18, 11 ], [ 19, 12 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Alejandro knows Luna. Inez knows Landon. Gwen knows Carrie. Landon knows Gwen. Cesar knows Frankie. Leroy knows Ethan. Marion knows Tonya. Alejandro knows Morris. Frankie knows Helen. Marion knows Cesar. Arthur knows Aiden. Alejandro knows Lucia. Lucia knows Inez. Marion knows Leroy. Luna knows Joaquin. Helen knows Arthur. Arthur knows Corinne. Gwen knows Ford. Which of Inez and Frankie can Marion reach?", "answer": "Frankie", "steps": [ "Marion knows Cesar.", "Cesar knows Frankie." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Marion", "Leroy", "Frankie", "Ethan", "Helen", "Aiden", "Cesar", "Tonya", "Arthur", "Corinne", "Alejandro", "Luna", "Inez", "Joaquin", "Landon", "Carrie", "Lucia", "Morris", "Gwen", "Ford" ], "edges": [ [ 0, 1 ], [ 0, 7 ], [ 0, 6 ], [ 1, 3 ], [ 2, 4 ], [ 4, 8 ], [ 6, 2 ], [ 8, 5 ], [ 8, 9 ], [ 10, 11 ], [ 10, 17 ], [ 10, 16 ], [ 11, 13 ], [ 12, 14 ], [ 14, 18 ], [ 16, 12 ], [ 18, 15 ], [ 18, 19 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Earl knows Eamon. Aaron knows Cassidy. Aaron knows Ignacio. Earl knows Alexa. Lyric knows Jolene. Lyric knows Carla. Aaron knows Lyric. Ignacio knows Clyde. Marlene knows Seth. Ignacio knows Gonzalo. Marlene knows Earl. Marlene knows Hugh. Boris knows Marlene. Hugh knows Beth. Hugh knows Julie. Amber knows Aaron. Hugh knows Wanda. Ignacio knows Ezra. Which of Earl and Lyric can Boris reach?", "answer": "Earl", "steps": [ "Boris knows Marlene.", "Marlene knows Earl." ], "difficulty": 2, "original_distance": 3, "idx_to_symbol": [ "Boris", "Eamon", "Earl", "Hugh", "Marlene", "Beth", "Wanda", "Julie", "Alexa", "Seth", "Amber", "Carla", "Lyric", "Ignacio", "Aaron", "Clyde", "Ezra", "Gonzalo", "Jolene", "Cassidy" ], "edges": [ [ 0, 4 ], [ 2, 1 ], [ 2, 8 ], [ 3, 5 ], [ 3, 6 ], [ 3, 7 ], [ 4, 3 ], [ 4, 2 ], [ 4, 9 ], [ 10, 14 ], [ 12, 11 ], [ 12, 18 ], [ 13, 15 ], [ 13, 16 ], [ 13, 17 ], [ 14, 13 ], [ 14, 12 ], [ 14, 19 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Geraldine knows Clyde. Mario knows Gideon. Mario knows Jules. Gail knows Foster. Jules knows Chad. Lynn knows Grant. Lynn knows Kirsten. Bill knows Mario. Foster knows Jessica. Geraldine knows Bill. Rhea knows Sidney. Foster knows Lynn. Jessica knows Kira. Rhea knows Gail. Isla knows Logan. Gideon knows Cole. Jules knows Isla. Kirsten knows Justine. Which of Bill and Gail can Geraldine reach?", "answer": "Bill", "steps": [ "Geraldine knows Bill." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Geraldine", "Jules", "Chad", "Gideon", "Clyde", "Cole", "Bill", "Logan", "Mario", "Isla", "Rhea", "Lynn", "Grant", "Jessica", "Sidney", "Kira", "Gail", "Justine", "Foster", "Kirsten" ], "edges": [ [ 0, 4 ], [ 0, 6 ], [ 1, 2 ], [ 1, 9 ], [ 3, 5 ], [ 6, 8 ], [ 8, 3 ], [ 8, 1 ], [ 9, 7 ], [ 10, 14 ], [ 10, 16 ], [ 11, 12 ], [ 11, 19 ], [ 13, 15 ], [ 16, 18 ], [ 18, 13 ], [ 18, 11 ], [ 19, 17 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Cara knows Bette. Winifred knows Maude. Hendrix knows Wilma. Luella knows Hudson. Donna knows Cara. Milton knows Erik. Tonya knows Hendrix. Destiny knows Hadley. Hudson knows Winifred. Maude knows Milton. Hendrix knows Wanda. Wanda knows Bill. Hadley knows Skyler. Donna knows Nicholas. Milton knows Destiny. Luella knows Essie. Bette knows Tonya. Bill knows Peggy. Which of Peggy and Skyler can Donna reach?", "answer": "Peggy", "steps": [ "Donna knows Cara.", "Cara knows Bette.", "Bette knows Tonya.", "Tonya knows Hendrix.", "Hendrix knows Wanda.", "Wanda knows Bill.", "Bill knows Peggy." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Donna", "Tonya", "Cara", "Wilma", "Bette", "Peggy", "Wanda", "Bill", "Hendrix", "Nicholas", "Luella", "Maude", "Hudson", "Erik", "Winifred", "Skyler", "Destiny", "Hadley", "Milton", "Essie" ], "edges": [ [ 0, 2 ], [ 0, 9 ], [ 1, 8 ], [ 2, 4 ], [ 4, 1 ], [ 6, 7 ], [ 7, 5 ], [ 8, 3 ], [ 8, 6 ], [ 10, 12 ], [ 10, 19 ], [ 11, 18 ], [ 12, 14 ], [ 14, 11 ], [ 16, 17 ], [ 17, 15 ], [ 18, 13 ], [ 18, 16 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Emmett knows Darnell. Patrick knows Felicia. Gideon knows Kurt. Emmett knows Tristan. Emmett knows Patrick. Pearl knows Emmett. Davis knows Calvin. Calvin knows Frida. Lorenzo knows Fanny. Calvin knows Sean. Troy knows Davis. Carrie knows Gideon. Carrie knows Samantha. Travis knows Wanda. Lorenzo knows Pearl. Wanda knows Lorenzo. Sean knows Carrie. Carrie knows Benjamin. Which of Calvin and Lorenzo can Travis reach?", "answer": "Lorenzo", "steps": [ "Travis knows Wanda.", "Wanda knows Lorenzo." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Travis", "Emmett", "Felicia", "Wanda", "Darnell", "Lorenzo", "Pearl", "Patrick", "Fanny", "Tristan", "Troy", "Carrie", "Kurt", "Davis", "Benjamin", "Calvin", "Sean", "Gideon", "Frida", "Samantha" ], "edges": [ [ 0, 3 ], [ 1, 4 ], [ 1, 7 ], [ 1, 9 ], [ 3, 5 ], [ 5, 8 ], [ 5, 6 ], [ 6, 1 ], [ 7, 2 ], [ 10, 13 ], [ 11, 14 ], [ 11, 17 ], [ 11, 19 ], [ 13, 15 ], [ 15, 18 ], [ 15, 16 ], [ 16, 11 ], [ 17, 12 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Hattie knows Edgar. Naomi knows Darcy. Haley knows Zara. Hattie knows Denver. Hattie knows Haley. Humphrey knows Jake. Hank knows Joel. Edison knows Pedro. Pedro knows Clayton. Pedro knows Naomi. Naomi knows Hank. Zara knows Arlene. Edgar knows Wesley. Gregory knows Kurt. Edgar knows Gregory. Jake knows Leroy. Pedro knows Humphrey. Marlene knows Hattie. Which of Edgar and Naomi can Edison reach?", "answer": "Naomi", "steps": [ "Edison knows Pedro.", "Pedro knows Naomi." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Edison", "Clayton", "Naomi", "Hank", "Leroy", "Joel", "Darcy", "Pedro", "Jake", "Humphrey", "Marlene", "Denver", "Edgar", "Gregory", "Arlene", "Kurt", "Wesley", "Hattie", "Zara", "Haley" ], "edges": [ [ 0, 7 ], [ 2, 3 ], [ 2, 6 ], [ 3, 5 ], [ 7, 1 ], [ 7, 2 ], [ 7, 9 ], [ 8, 4 ], [ 9, 8 ], [ 10, 17 ], [ 12, 13 ], [ 12, 16 ], [ 13, 15 ], [ 17, 11 ], [ 17, 12 ], [ 17, 19 ], [ 18, 14 ], [ 19, 18 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Emmett knows Lois. Arturo knows Spencer. Dane knows Tabitha. Dane knows Eduardo. Ira knows Roman. Tabitha knows Harrison. Margaret knows Arturo. Terrence knows Sandy. Harrison knows Emmett. Spencer knows Gene. Ira knows Margaret. Terrence knows Ira. Emmett knows Josie. Vera knows Pedro. Vera knows Dane. Vera knows Sam. Spencer knows Leander. Terrence knows Opal. Which of Emmett and Spencer can Terrence reach?", "answer": "Spencer", "steps": [ "Terrence knows Ira.", "Ira knows Margaret.", "Margaret knows Arturo.", "Arturo knows Spencer." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Terrence", "Roman", "Spencer", "Leander", "Margaret", "Gene", "Opal", "Sandy", "Arturo", "Ira", "Vera", "Eduardo", "Emmett", "Josie", "Tabitha", "Lois", "Pedro", "Sam", "Harrison", "Dane" ], "edges": [ [ 0, 6 ], [ 0, 7 ], [ 0, 9 ], [ 2, 3 ], [ 2, 5 ], [ 4, 8 ], [ 8, 2 ], [ 9, 1 ], [ 9, 4 ], [ 10, 16 ], [ 10, 17 ], [ 10, 19 ], [ 12, 13 ], [ 12, 15 ], [ 14, 18 ], [ 18, 12 ], [ 19, 11 ], [ 19, 14 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Marilyn knows Jewel. Aisha knows Martha. Kirsten knows Federico. Lois knows Everett. Winifred knows Sandra. Everett knows Ruby. Miranda knows Winifred. Alvin knows Patrick. Winifred knows Dave. Gwen knows Brett. Martha knows Gwen. Carrie knows Alvin. Julius knows Lois. Brett knows Marilyn. Dave knows Aisha. Lois knows Frances. Ruby knows Carrie. Patrick knows Kirsten. Which of Dave and Everett can Julius reach?", "answer": "Everett", "steps": [ "Julius knows Lois.", "Lois knows Everett." ], "difficulty": 2, "original_distance": 8, "idx_to_symbol": [ "Julius", "Carrie", "Kirsten", "Federico", "Ruby", "Everett", "Patrick", "Alvin", "Frances", "Lois", "Miranda", "Martha", "Marilyn", "Jewel", "Aisha", "Dave", "Brett", "Gwen", "Sandra", "Winifred" ], "edges": [ [ 0, 9 ], [ 1, 7 ], [ 2, 3 ], [ 4, 1 ], [ 5, 4 ], [ 6, 2 ], [ 7, 6 ], [ 9, 5 ], [ 9, 8 ], [ 10, 19 ], [ 11, 17 ], [ 12, 13 ], [ 14, 11 ], [ 15, 14 ], [ 16, 12 ], [ 17, 16 ], [ 19, 15 ], [ 19, 18 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Jane knows Monica. April knows Bette. Gina knows Jane. April knows Marcia. Irving knows Candice. Jonathan knows Boyd. April knows Garrett. April knows Claire. Marcia knows Lynn. Dennis knows Ryan. Dennis knows Abigail. Lynn knows Jonathan. Dennis knows Gina. Dennis knows Sonia. Boyd knows Ann. Monica knows Irving. Dennis knows Forrest. April knows Vicki. Which of Boyd and Irving can Dennis reach?", "answer": "Irving", "steps": [ "Dennis knows Gina.", "Gina knows Jane.", "Jane knows Monica.", "Monica knows Irving." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Dennis", "Candice", "Irving", "Monica", "Forrest", "Abigail", "Jane", "Sonia", "Gina", "Ryan", "April", "Ann", "Boyd", "Jonathan", "Garrett", "Vicki", "Lynn", "Claire", "Marcia", "Bette" ], "edges": [ [ 0, 4 ], [ 0, 5 ], [ 0, 7 ], [ 0, 8 ], [ 0, 9 ], [ 2, 1 ], [ 3, 2 ], [ 6, 3 ], [ 8, 6 ], [ 10, 14 ], [ 10, 15 ], [ 10, 17 ], [ 10, 18 ], [ 10, 19 ], [ 12, 11 ], [ 13, 12 ], [ 16, 13 ], [ 18, 16 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Charlotte knows Dawn. Clayton knows Ruth. Isiah knows Clayton. Carl knows Bart. Fabian knows Cody. Fabian knows Carl. Amelia knows Theodore. Jean knows Amelia. Fabian knows Clara. Stephanie knows Charlotte. Dawn knows Ramona. Grant knows Jean. Jean knows Itzel. Veronica knows Isiah. Miriam knows Stephanie. Jean knows Eve. Miriam knows Fabian. Grant knows Veronica. Which of Isiah and Charlotte can Miriam reach?", "answer": "Charlotte", "steps": [ "Miriam knows Stephanie.", "Stephanie knows Charlotte." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Miriam", "Carl", "Ramona", "Cody", "Dawn", "Charlotte", "Fabian", "Clara", "Bart", "Stephanie", "Grant", "Amelia", "Ruth", "Itzel", "Clayton", "Isiah", "Jean", "Eve", "Theodore", "Veronica" ], "edges": [ [ 0, 6 ], [ 0, 9 ], [ 1, 8 ], [ 4, 2 ], [ 5, 4 ], [ 6, 3 ], [ 6, 7 ], [ 6, 1 ], [ 9, 5 ], [ 10, 16 ], [ 10, 19 ], [ 11, 18 ], [ 14, 12 ], [ 15, 14 ], [ 16, 13 ], [ 16, 17 ], [ 16, 11 ], [ 19, 15 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Peggy knows Saul. Grace knows Peggy. Darin knows Arthur. Cooper knows Simon. Simon knows Myra. Hendrix knows Grace. Eldon knows Heidi. Eldon knows Denise. Myra knows Lillian. Saul knows Eldon. Cooper knows Conner. Myra knows Marco. Graeme knows Aisha. Peggy knows Jacqueline. Doug knows Cooper. Lillian knows Darin. Bryan knows Doug. Denise knows Graeme. Which of Graeme and Darin can Hendrix reach?", "answer": "Graeme", "steps": [ "Hendrix knows Grace.", "Grace knows Peggy.", "Peggy knows Saul.", "Saul knows Eldon.", "Eldon knows Denise.", "Denise knows Graeme." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Hendrix", "Graeme", "Jacqueline", "Eldon", "Saul", "Grace", "Peggy", "Aisha", "Denise", "Heidi", "Bryan", "Darin", "Conner", "Myra", "Simon", "Doug", "Cooper", "Arthur", "Lillian", "Marco" ], "edges": [ [ 0, 5 ], [ 1, 7 ], [ 3, 8 ], [ 3, 9 ], [ 4, 3 ], [ 5, 6 ], [ 6, 2 ], [ 6, 4 ], [ 8, 1 ], [ 10, 15 ], [ 11, 17 ], [ 13, 18 ], [ 13, 19 ], [ 14, 13 ], [ 15, 16 ], [ 16, 12 ], [ 16, 14 ], [ 18, 11 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Greg knows Diego. Graham knows Greg. Odette knows Marian. Tony knows Julio. Dave knows Graham. Madeline knows Kevin. Keith knows Dave. Knox knows Yasmin. Joanna knows Jim. Keith knows Daria. Graham knows Joaquin. Knox knows Joanna. Graham knows Odette. Madeline knows Carmela. Carmela knows Knox. Joaquin knows Natalie. Yasmin knows Margaret. Knox knows Tony. Which of Margaret and Marian can Keith reach?", "answer": "Marian", "steps": [ "Keith knows Dave.", "Dave knows Graham.", "Graham knows Odette.", "Odette knows Marian." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Keith", "Dave", "Greg", "Daria", "Diego", "Odette", "Graham", "Joaquin", "Marian", "Natalie", "Madeline", "Carmela", "Joanna", "Kevin", "Jim", "Yasmin", "Knox", "Tony", "Margaret", "Julio" ], "edges": [ [ 0, 3 ], [ 0, 1 ], [ 1, 6 ], [ 2, 4 ], [ 5, 8 ], [ 6, 2 ], [ 6, 5 ], [ 6, 7 ], [ 7, 9 ], [ 10, 13 ], [ 10, 11 ], [ 11, 16 ], [ 12, 14 ], [ 15, 18 ], [ 16, 12 ], [ 16, 15 ], [ 16, 17 ], [ 17, 19 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Fleur knows Hailey. Samantha knows Archer. Loretta knows Charlotte. Hadley knows Burt. Harriet knows Asher. Burt knows Samantha. Fritz knows Hunter. Teresa knows Norman. Harriet knows Allan. Harriet knows Loretta. Hailey knows Lottie. Burt knows Teresa. Amanda knows Hayes. Burt knows Ross. Hayes knows Fritz. Hunter knows Harriet. Lottie knows Hadley. Asher knows Hank. Which of Norman and Charlotte can Amanda reach?", "answer": "Charlotte", "steps": [ "Amanda knows Hayes.", "Hayes knows Fritz.", "Fritz knows Hunter.", "Hunter knows Harriet.", "Harriet knows Loretta.", "Loretta knows Charlotte." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Amanda", "Allan", "Hank", "Hunter", "Harriet", "Loretta", "Asher", "Fritz", "Hayes", "Charlotte", "Fleur", "Ross", "Archer", "Hadley", "Burt", "Teresa", "Samantha", "Lottie", "Hailey", "Norman" ], "edges": [ [ 0, 8 ], [ 3, 4 ], [ 4, 1 ], [ 4, 6 ], [ 4, 5 ], [ 5, 9 ], [ 6, 2 ], [ 7, 3 ], [ 8, 7 ], [ 10, 18 ], [ 13, 14 ], [ 14, 11 ], [ 14, 16 ], [ 14, 15 ], [ 15, 19 ], [ 16, 12 ], [ 17, 13 ], [ 18, 17 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Khashayar knows Luis. Anton knows Bob. Darwin knows Anton. Luis knows Valerie. Elsa knows Lacey. Warren knows Desmond. Claudia knows Khashayar. Judith knows Claudia. Luis knows Ruby. Jack knows Elsa. Desmond knows Darwin. Lacey knows Dahlia. Ibrahim knows Asher. Darwin knows Jack. Lacey knows Gertrude. Asher knows Judith. Judith knows Aubrey. Aubrey knows Kate. Which of Lacey and Luis can Warren reach?", "answer": "Lacey", "steps": [ "Warren knows Desmond.", "Desmond knows Darwin.", "Darwin knows Jack.", "Jack knows Elsa.", "Elsa knows Lacey." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Warren", "Desmond", "Gertrude", "Elsa", "Anton", "Lacey", "Darwin", "Dahlia", "Bob", "Jack", "Ibrahim", "Asher", "Valerie", "Khashayar", "Aubrey", "Luis", "Judith", "Ruby", "Kate", "Claudia" ], "edges": [ [ 0, 1 ], [ 1, 6 ], [ 3, 5 ], [ 4, 8 ], [ 5, 2 ], [ 5, 7 ], [ 6, 4 ], [ 6, 9 ], [ 9, 3 ], [ 10, 11 ], [ 11, 16 ], [ 13, 15 ], [ 14, 18 ], [ 15, 12 ], [ 15, 17 ], [ 16, 14 ], [ 16, 19 ], [ 19, 13 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Cody knows Alyssa. Veronica knows Marie. Julio knows Eugene. Randall knows Julio. Calvin knows Jennifer. Eugene knows Cody. Julio knows Chloe. Shane knows Daniella. Shane knows Herman. Jennifer knows Lionel. Jeffery knows Giselle. Herman knows Dwight. Marie knows Calvin. Estelle knows Veronica. Calvin knows Verna. Ross knows Jeffery. Chloe knows Shane. Veronica knows Ross. Which of Julio and Veronica can Randall reach?", "answer": "Julio", "steps": [ "Randall knows Julio." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Randall", "Daniella", "Dwight", "Herman", "Chloe", "Alyssa", "Julio", "Cody", "Eugene", "Shane", "Estelle", "Verna", "Lionel", "Jennifer", "Marie", "Giselle", "Veronica", "Jeffery", "Ross", "Calvin" ], "edges": [ [ 0, 6 ], [ 3, 2 ], [ 4, 9 ], [ 6, 8 ], [ 6, 4 ], [ 7, 5 ], [ 8, 7 ], [ 9, 1 ], [ 9, 3 ], [ 10, 16 ], [ 13, 12 ], [ 14, 19 ], [ 16, 18 ], [ 16, 14 ], [ 17, 15 ], [ 18, 17 ], [ 19, 11 ], [ 19, 13 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Keith knows Russ. Vera knows Zelda. Malik knows Marc. Isadora knows Vera. Horace knows Kathleen. Jolene knows Tessa. Keith knows Leo. Leo knows Kieran. Zelda knows Jolene. Horace knows Brett. Keith knows Billy. Vera knows Emanuel. Vera knows Geoffrey. Brett knows Keith. Russ knows Malik. Finn knows Adrian. Geoffrey knows Palmer. Finn knows Isadora. Which of Keith and Vera can Horace reach?", "answer": "Keith", "steps": [ "Horace knows Brett.", "Brett knows Keith." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Horace", "Keith", "Marc", "Kieran", "Malik", "Kathleen", "Billy", "Leo", "Russ", "Brett", "Finn", "Vera", "Tessa", "Palmer", "Jolene", "Adrian", "Emanuel", "Geoffrey", "Zelda", "Isadora" ], "edges": [ [ 0, 5 ], [ 0, 9 ], [ 1, 6 ], [ 1, 7 ], [ 1, 8 ], [ 4, 2 ], [ 7, 3 ], [ 8, 4 ], [ 9, 1 ], [ 10, 15 ], [ 10, 19 ], [ 11, 16 ], [ 11, 17 ], [ 11, 18 ], [ 14, 12 ], [ 17, 13 ], [ 18, 14 ], [ 19, 11 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Carmen knows Wilson. Myrtle knows Carlos. Leonard knows Norma. Pauline knows Leonard. Chad knows Pauline. Chad knows Myrtle. Sean knows Marilyn. Pablo knows Hannah. Norma knows Kai. Wilson knows Celia. Marilyn knows Bill. Leonard knows Daphna. Pablo knows Chad. Audrey knows Geraldine. Marilyn knows Dave. Bill knows Winifred. Carmen knows Sean. Audrey knows Carmen. Which of Bill and Norma can Audrey reach?", "answer": "Bill", "steps": [ "Audrey knows Carmen.", "Carmen knows Sean.", "Sean knows Marilyn.", "Marilyn knows Bill." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Audrey", "Sean", "Geraldine", "Marilyn", "Celia", "Carmen", "Wilson", "Dave", "Winifred", "Bill", "Pablo", "Pauline", "Hannah", "Leonard", "Carlos", "Chad", "Myrtle", "Daphna", "Kai", "Norma" ], "edges": [ [ 0, 2 ], [ 0, 5 ], [ 1, 3 ], [ 3, 7 ], [ 3, 9 ], [ 5, 6 ], [ 5, 1 ], [ 6, 4 ], [ 9, 8 ], [ 10, 12 ], [ 10, 15 ], [ 11, 13 ], [ 13, 17 ], [ 13, 19 ], [ 15, 16 ], [ 15, 11 ], [ 16, 14 ], [ 19, 18 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Brooke knows Jonah. Todd knows Teresa. Heidi knows Gareth. Gloria knows Philip. Teresa knows Francis. Luke knows Estelle. Todd knows Gloria. Jonah knows Jerry. Gareth knows Betty. Dana knows Lee. Michelle knows Dana. Estelle knows Yuki. Francis knows Bailey. Michelle knows Todd. Heidi knows Brooke. Luke knows Heidi. Jonah knows Kara. Francis knows Elton. Which of Heidi and Todd can Michelle reach?", "answer": "Todd", "steps": [ "Michelle knows Todd." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Michelle", "Gloria", "Teresa", "Todd", "Lee", "Philip", "Bailey", "Elton", "Dana", "Francis", "Luke", "Gareth", "Brooke", "Heidi", "Yuki", "Betty", "Kara", "Jerry", "Estelle", "Jonah" ], "edges": [ [ 0, 8 ], [ 0, 3 ], [ 1, 5 ], [ 2, 9 ], [ 3, 1 ], [ 3, 2 ], [ 8, 4 ], [ 9, 6 ], [ 9, 7 ], [ 10, 18 ], [ 10, 13 ], [ 11, 15 ], [ 12, 19 ], [ 13, 11 ], [ 13, 12 ], [ 18, 14 ], [ 19, 16 ], [ 19, 17 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Perry knows Javier. Cornelius knows Dick. Leopold knows Gordon. Marie knows Alex. Perry knows Leopold. Jonas knows Marie. Kylie knows Enid. Cornelius knows Jordan. Enid knows Gina. Earle knows Cornelius. Leopold knows Neville. Dick knows Travis. Kylie knows Deanna. Enid knows Earle. Marie knows Darius. Dick knows Alexa. Jonas knows Gregory. Gordon knows Jonas. Which of Leopold and Enid can Perry reach?", "answer": "Leopold", "steps": [ "Perry knows Leopold." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Perry", "Neville", "Alex", "Jonas", "Leopold", "Marie", "Javier", "Gregory", "Darius", "Gordon", "Kylie", "Gina", "Alexa", "Cornelius", "Enid", "Dick", "Deanna", "Jordan", "Travis", "Earle" ], "edges": [ [ 0, 6 ], [ 0, 4 ], [ 3, 7 ], [ 3, 5 ], [ 4, 1 ], [ 4, 9 ], [ 5, 2 ], [ 5, 8 ], [ 9, 3 ], [ 10, 16 ], [ 10, 14 ], [ 13, 17 ], [ 13, 15 ], [ 14, 11 ], [ 14, 19 ], [ 15, 12 ], [ 15, 18 ], [ 19, 13 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Keith knows Russ. Vera knows Zelda. Malik knows Marc. Isadora knows Vera. Horace knows Kathleen. Jolene knows Tessa. Keith knows Leo. Leo knows Kieran. Zelda knows Jolene. Horace knows Brett. Keith knows Billy. Vera knows Emanuel. Vera knows Geoffrey. Brett knows Keith. Russ knows Malik. Finn knows Adrian. Geoffrey knows Palmer. Finn knows Isadora. Which of Malik and Jolene can Horace reach?", "answer": "Malik", "steps": [ "Horace knows Brett.", "Brett knows Keith.", "Keith knows Russ.", "Russ knows Malik." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Horace", "Keith", "Marc", "Kieran", "Malik", "Kathleen", "Billy", "Leo", "Russ", "Brett", "Finn", "Vera", "Tessa", "Palmer", "Jolene", "Adrian", "Emanuel", "Geoffrey", "Zelda", "Isadora" ], "edges": [ [ 0, 5 ], [ 0, 9 ], [ 1, 6 ], [ 1, 7 ], [ 1, 8 ], [ 4, 2 ], [ 7, 3 ], [ 8, 4 ], [ 9, 1 ], [ 10, 15 ], [ 10, 19 ], [ 11, 16 ], [ 11, 17 ], [ 11, 18 ], [ 14, 12 ], [ 17, 13 ], [ 18, 14 ], [ 19, 11 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Scott knows Loretta. Eldon knows Clifford. Isaac knows Magdalena. Eldon knows Amelia. Mason knows Kareem. Mason knows Darnell. Amelia knows Pete. Alison knows Tracy. Kareem knows Alison. Isaac knows Elodie. Walter knows Isaac. Drew knows Scott. Pete knows Diego. Sadie knows Mason. Scott knows Norman. Norman knows Eldon. Scott knows Franklin. Isaac knows Sadie. Which of Mason and Eldon can Drew reach?", "answer": "Eldon", "steps": [ "Drew knows Scott.", "Scott knows Norman.", "Norman knows Eldon." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Drew", "Clifford", "Norman", "Amelia", "Diego", "Franklin", "Pete", "Loretta", "Eldon", "Scott", "Walter", "Darnell", "Sadie", "Kareem", "Tracy", "Elodie", "Alison", "Magdalena", "Mason", "Isaac" ], "edges": [ [ 0, 9 ], [ 2, 8 ], [ 3, 6 ], [ 6, 4 ], [ 8, 1 ], [ 8, 3 ], [ 9, 5 ], [ 9, 7 ], [ 9, 2 ], [ 10, 19 ], [ 12, 18 ], [ 13, 16 ], [ 16, 14 ], [ 18, 11 ], [ 18, 13 ], [ 19, 15 ], [ 19, 17 ], [ 19, 12 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Kevin knows Harrison. Fabian knows Kira. Finn knows Colin. Lorna knows Jacqueline. Hudson knows Elijah. Fabian knows Renee. Ida knows Hudson. Philip knows Fabian. Fabian knows Lucy. Jasmine knows Catherine. Lucy knows Ida. Colin knows Colleen. Jacqueline knows Kevin. Lucy knows Jasmine. Harrison knows Rachel. Jacqueline knows Joyce. Kevin knows Finn. Jacqueline knows Carson. Which of Finn and Ida can Lorna reach?", "answer": "Finn", "steps": [ "Lorna knows Jacqueline.", "Jacqueline knows Kevin.", "Kevin knows Finn." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Lorna", "Rachel", "Colin", "Colleen", "Joyce", "Jacqueline", "Kevin", "Harrison", "Carson", "Finn", "Philip", "Catherine", "Hudson", "Elijah", "Kira", "Fabian", "Lucy", "Jasmine", "Renee", "Ida" ], "edges": [ [ 0, 5 ], [ 2, 3 ], [ 5, 4 ], [ 5, 8 ], [ 5, 6 ], [ 6, 7 ], [ 6, 9 ], [ 7, 1 ], [ 9, 2 ], [ 10, 15 ], [ 12, 13 ], [ 15, 14 ], [ 15, 18 ], [ 15, 16 ], [ 16, 17 ], [ 16, 19 ], [ 17, 11 ], [ 19, 12 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Melissa knows Ruby. Darin knows Myrtle. Norman knows Melissa. Darin knows Leopold. Ida knows Joyce. Doris knows Malik. Myrtle knows Kamila. Kamila knows Norman. Joyce knows Louis. Jenny knows Leslie. Yvonne knows Wesley. Leslie knows Ida. Malik knows Darin. Malik knows Cain. Louis knows Yvonne. Clement knows Jenny. Jenny knows Forrest. Leslie knows Jolene. Which of Leslie and Darin can Doris reach?", "answer": "Darin", "steps": [ "Doris knows Malik.", "Malik knows Darin." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Doris", "Kamila", "Myrtle", "Malik", "Leopold", "Darin", "Melissa", "Ruby", "Norman", "Cain", "Clement", "Joyce", "Ida", "Jenny", "Jolene", "Leslie", "Yvonne", "Wesley", "Louis", "Forrest" ], "edges": [ [ 0, 3 ], [ 1, 8 ], [ 2, 1 ], [ 3, 5 ], [ 3, 9 ], [ 5, 4 ], [ 5, 2 ], [ 6, 7 ], [ 8, 6 ], [ 10, 13 ], [ 11, 18 ], [ 12, 11 ], [ 13, 15 ], [ 13, 19 ], [ 15, 14 ], [ 15, 12 ], [ 16, 17 ], [ 18, 16 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Laurel knows Zach. Zelda knows Clifford. Celia knows Atlas. Guy knows Celia. Russell knows Grady. Laurel knows Guy. Casey knows Keaton. Laurel knows Franklin. Dwight knows Tom. Keaton knows Daphna. Tom knows Russell. Imogen knows Jenny. Aaron knows Laurel. Daphna knows Aaron. Luna knows Imogen. Grady knows Zelda. Zelda knows Luna. Zelda knows Cornelius. Which of Jenny and Atlas can Dwight reach?", "answer": "Jenny", "steps": [ "Dwight knows Tom.", "Tom knows Russell.", "Russell knows Grady.", "Grady knows Zelda.", "Zelda knows Luna.", "Luna knows Imogen.", "Imogen knows Jenny." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Dwight", "Grady", "Jenny", "Zelda", "Clifford", "Luna", "Russell", "Imogen", "Tom", "Cornelius", "Casey", "Aaron", "Atlas", "Laurel", "Zach", "Guy", "Daphna", "Celia", "Keaton", "Franklin" ], "edges": [ [ 0, 8 ], [ 1, 3 ], [ 3, 4 ], [ 3, 5 ], [ 3, 9 ], [ 5, 7 ], [ 6, 1 ], [ 7, 2 ], [ 8, 6 ], [ 10, 18 ], [ 11, 13 ], [ 13, 14 ], [ 13, 15 ], [ 13, 19 ], [ 15, 17 ], [ 16, 11 ], [ 17, 12 ], [ 18, 16 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Russell knows Ibrahim. Heath knows Joel. Richard knows Oliver. Virginia knows Simon. Joel knows Jaime. Oliver knows Rocco. Taylor knows Zack. Kelsey knows Fleur. Simon knows Kelsey. Devon knows Russell. Rocco knows Heath. Russell knows Charity. Virginia knows Devon. Alan knows Brooks. Fleur knows Taylor. Norman knows Alan. Richard knows Norman. Alan knows Cora. Which of Zack and Jaime can Richard reach?", "answer": "Jaime", "steps": [ "Richard knows Oliver.", "Oliver knows Rocco.", "Rocco knows Heath.", "Heath knows Joel.", "Joel knows Jaime." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Richard", "Norman", "Joel", "Cora", "Heath", "Jaime", "Alan", "Oliver", "Rocco", "Brooks", "Virginia", "Devon", "Taylor", "Ibrahim", "Fleur", "Zack", "Russell", "Simon", "Kelsey", "Charity" ], "edges": [ [ 0, 7 ], [ 0, 1 ], [ 1, 6 ], [ 2, 5 ], [ 4, 2 ], [ 6, 3 ], [ 6, 9 ], [ 7, 8 ], [ 8, 4 ], [ 10, 17 ], [ 10, 11 ], [ 11, 16 ], [ 12, 15 ], [ 14, 12 ], [ 16, 13 ], [ 16, 19 ], [ 17, 18 ], [ 18, 14 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Sheila knows August. Lars knows Henrietta. Allan knows Gladys. Jared knows Jasmine. Tim knows Ernie. Ernie knows Sheila. Jared knows Troy. Glenda knows Harper. Ian knows Glenda. Lars knows Samantha. Henrietta knows Ian. August knows Celia. Eloise knows Erica. Erica knows Aubrey. Jasmine knows Allan. Ian knows Bert. Allan knows Tim. Harper knows Eloise. Which of August and Erica can Lars reach?", "answer": "Erica", "steps": [ "Lars knows Henrietta.", "Henrietta knows Ian.", "Ian knows Glenda.", "Glenda knows Harper.", "Harper knows Eloise.", "Eloise knows Erica." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Lars", "Harper", "Glenda", "Ian", "Erica", "Samantha", "Henrietta", "Aubrey", "Eloise", "Bert", "Jared", "Ernie", "Tim", "Allan", "August", "Troy", "Jasmine", "Celia", "Sheila", "Gladys" ], "edges": [ [ 0, 5 ], [ 0, 6 ], [ 1, 8 ], [ 2, 1 ], [ 3, 2 ], [ 3, 9 ], [ 4, 7 ], [ 6, 3 ], [ 8, 4 ], [ 10, 15 ], [ 10, 16 ], [ 11, 18 ], [ 12, 11 ], [ 13, 12 ], [ 13, 19 ], [ 14, 17 ], [ 16, 13 ], [ 18, 14 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Charlotte knows Dawn. Clayton knows Ruth. Isiah knows Clayton. Carl knows Bart. Fabian knows Cody. Fabian knows Carl. Amelia knows Theodore. Jean knows Amelia. Fabian knows Clara. Stephanie knows Charlotte. Dawn knows Ramona. Grant knows Jean. Jean knows Itzel. Veronica knows Isiah. Miriam knows Stephanie. Jean knows Eve. Miriam knows Fabian. Grant knows Veronica. Which of Ruth and Ramona can Miriam reach?", "answer": "Ramona", "steps": [ "Miriam knows Stephanie.", "Stephanie knows Charlotte.", "Charlotte knows Dawn.", "Dawn knows Ramona." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Miriam", "Carl", "Ramona", "Cody", "Dawn", "Charlotte", "Fabian", "Clara", "Bart", "Stephanie", "Grant", "Amelia", "Ruth", "Itzel", "Clayton", "Isiah", "Jean", "Eve", "Theodore", "Veronica" ], "edges": [ [ 0, 6 ], [ 0, 9 ], [ 1, 8 ], [ 4, 2 ], [ 5, 4 ], [ 6, 3 ], [ 6, 7 ], [ 6, 1 ], [ 9, 5 ], [ 10, 16 ], [ 10, 19 ], [ 11, 18 ], [ 14, 12 ], [ 15, 14 ], [ 16, 13 ], [ 16, 17 ], [ 16, 11 ], [ 19, 15 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Wesley knows Esperanza. Vincent knows Lennox. Clarissa knows Samuel. Jeremy knows Gerald. Gideon knows Nora. Virgil knows Val. Wesley knows Ellis. Samuel knows Arden. Vincent knows Garrett. Esperanza knows Virgil. Gideon knows Lorna. Vincent knows Wesley. Gideon knows Clarissa. Samuel knows Jeremy. Esperanza knows Della. Omar knows Vincent. Zoe knows Gideon. Clarissa knows Selena. Which of Wesley and Clarissa can Omar reach?", "answer": "Wesley", "steps": [ "Omar knows Vincent.", "Vincent knows Wesley." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Omar", "Wesley", "Vincent", "Lennox", "Val", "Garrett", "Ellis", "Della", "Esperanza", "Virgil", "Zoe", "Clarissa", "Gideon", "Lorna", "Gerald", "Nora", "Selena", "Arden", "Samuel", "Jeremy" ], "edges": [ [ 0, 2 ], [ 1, 6 ], [ 1, 8 ], [ 2, 3 ], [ 2, 5 ], [ 2, 1 ], [ 8, 7 ], [ 8, 9 ], [ 9, 4 ], [ 10, 12 ], [ 11, 16 ], [ 11, 18 ], [ 12, 13 ], [ 12, 15 ], [ 12, 11 ], [ 18, 17 ], [ 18, 19 ], [ 19, 14 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Joanna knows Earle. Rhonda knows Katherine. Greta knows Rhonda. Jean knows Judy. Katherine knows Daniel. Francesca knows Greta. Daniel knows Scott. Daniel knows Yvonne. Kay knows Joanna. Jack knows Cesar. Yvonne knows Janice. Judy knows Emanuel. Earle knows Cain. Judy knows Axel. Cain knows Tonya. Cesar knows Francesca. Tonya knows Jean. Emanuel knows Ariana. Which of Cesar and Joanna can Jack reach?", "answer": "Cesar", "steps": [ "Jack knows Cesar." ], "difficulty": 1, "original_distance": 8, "idx_to_symbol": [ "Jack", "Greta", "Cesar", "Scott", "Katherine", "Yvonne", "Janice", "Daniel", "Francesca", "Rhonda", "Kay", "Cain", "Joanna", "Axel", "Jean", "Emanuel", "Ariana", "Judy", "Earle", "Tonya" ], "edges": [ [ 0, 2 ], [ 1, 9 ], [ 2, 8 ], [ 4, 7 ], [ 5, 6 ], [ 7, 3 ], [ 7, 5 ], [ 8, 1 ], [ 9, 4 ], [ 10, 12 ], [ 11, 19 ], [ 12, 18 ], [ 14, 17 ], [ 15, 16 ], [ 17, 13 ], [ 17, 15 ], [ 18, 11 ], [ 19, 14 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "George knows Dolores. Carl knows Cecilia. Mitchell knows Parsa. Cecilia knows Blanche. Leigh knows Elliot. Todd knows Randy. Selena knows Marcia. Todd knows Charity. Norman knows Lily. Selena knows Gabe. Selena knows Eugenia. Blanche knows Leigh. Todd knows George. Dolores knows Mitchell. Lily knows Donna. Dewey knows Carl. Eugenia knows Dewey. Parsa knows Norman. Which of Norman and Blanche can Todd reach?", "answer": "Norman", "steps": [ "Todd knows George.", "George knows Dolores.", "Dolores knows Mitchell.", "Mitchell knows Parsa.", "Parsa knows Norman." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Todd", "Charity", "Parsa", "Mitchell", "Lily", "Randy", "George", "Norman", "Dolores", "Donna", "Selena", "Gabe", "Cecilia", "Carl", "Leigh", "Marcia", "Eugenia", "Blanche", "Dewey", "Elliot" ], "edges": [ [ 0, 1 ], [ 0, 5 ], [ 0, 6 ], [ 2, 7 ], [ 3, 2 ], [ 4, 9 ], [ 6, 8 ], [ 7, 4 ], [ 8, 3 ], [ 10, 11 ], [ 10, 15 ], [ 10, 16 ], [ 12, 17 ], [ 13, 12 ], [ 14, 19 ], [ 16, 18 ], [ 17, 14 ], [ 18, 13 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Ashley knows Leon. Ibrahim knows Lillian. Lola knows Ann. Alexa knows Beau. Stacy knows Corinne. Stacy knows Cynthia. Leon knows Marshall. Shane knows Ibrahim. Ann knows Dwight. Corinne knows Cesar. Jane knows Shelly. Corinne knows Eduardo. Ibrahim knows Alexa. Alexa knows Ashley. Margaret knows Shane. Shane knows Jeff. Eduardo knows Jane. Ann knows Stacy. Which of Eduardo and Ashley can Margaret reach?", "answer": "Ashley", "steps": [ "Margaret knows Shane.", "Shane knows Ibrahim.", "Ibrahim knows Alexa.", "Alexa knows Ashley." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Margaret", "Leon", "Alexa", "Shane", "Jeff", "Ashley", "Beau", "Marshall", "Ibrahim", "Lillian", "Lola", "Jane", "Corinne", "Ann", "Dwight", "Eduardo", "Cesar", "Shelly", "Stacy", "Cynthia" ], "edges": [ [ 0, 3 ], [ 1, 7 ], [ 2, 6 ], [ 2, 5 ], [ 3, 4 ], [ 3, 8 ], [ 5, 1 ], [ 8, 2 ], [ 8, 9 ], [ 10, 13 ], [ 11, 17 ], [ 12, 16 ], [ 12, 15 ], [ 13, 14 ], [ 13, 18 ], [ 15, 11 ], [ 18, 12 ], [ 18, 19 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Earl knows Clement. Joan knows Belinda. Roger knows Isiah. Jessica knows Deborah. Simon knows Landon. Russ knows Jessica. Gage knows Joan. Dewey knows Teresa. Belinda knows Tanya. Isiah knows Jules. Landon knows Russ. Abel knows Gus. Joan knows Abel. Gus knows Jenny. Gus knows Roger. Landon knows Andre. Teresa knows Earl. Teresa knows Simon. Which of Teresa and Joan can Gage reach?", "answer": "Joan", "steps": [ "Gage knows Joan." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Gage", "Joan", "Abel", "Jenny", "Roger", "Jules", "Isiah", "Gus", "Tanya", "Belinda", "Dewey", "Teresa", "Simon", "Andre", "Russ", "Deborah", "Jessica", "Landon", "Clement", "Earl" ], "edges": [ [ 0, 1 ], [ 1, 2 ], [ 1, 9 ], [ 2, 7 ], [ 4, 6 ], [ 6, 5 ], [ 7, 3 ], [ 7, 4 ], [ 9, 8 ], [ 10, 11 ], [ 11, 12 ], [ 11, 19 ], [ 12, 17 ], [ 14, 16 ], [ 16, 15 ], [ 17, 13 ], [ 17, 14 ], [ 19, 18 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Eugene knows Raquel. Alyssa knows Anton. Jewel knows Aurora. Anton knows Geoffrey. Rebecca knows Alyssa. Geoffrey knows Saul. Aurora knows Vernon. Stuart knows Jewel. Caroline knows Charles. Brody knows Sally. Sally knows Stuart. Raquel knows Daniel. Sally knows Emanuel. Raquel knows Belinda. Vernon knows Caroline. Aurora knows Lisa. Alyssa knows Clay. Daniel knows Rebecca. Which of Charles and Saul can Eugene reach?", "answer": "Saul", "steps": [ "Eugene knows Raquel.", "Raquel knows Daniel.", "Daniel knows Rebecca.", "Rebecca knows Alyssa.", "Alyssa knows Anton.", "Anton knows Geoffrey.", "Geoffrey knows Saul." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Eugene", "Belinda", "Geoffrey", "Alyssa", "Daniel", "Saul", "Anton", "Raquel", "Rebecca", "Clay", "Brody", "Emanuel", "Caroline", "Aurora", "Stuart", "Charles", "Vernon", "Sally", "Jewel", "Lisa" ], "edges": [ [ 0, 7 ], [ 2, 5 ], [ 3, 6 ], [ 3, 9 ], [ 4, 8 ], [ 6, 2 ], [ 7, 1 ], [ 7, 4 ], [ 8, 3 ], [ 10, 17 ], [ 12, 15 ], [ 13, 16 ], [ 13, 19 ], [ 14, 18 ], [ 16, 12 ], [ 17, 11 ], [ 17, 14 ], [ 18, 13 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Austin knows Molly. Laurel knows Anton. Ellis knows Austin. Karen knows Henrietta. Henrietta knows Kingsley. Austin knows Yara. Grady knows Duke. Dahlia knows Laurel. Ivy knows Yvonne. Nadine knows Shane. Kingsley knows Ivy. Yvonne knows Dahlia. Melanie knows Eamon. Kingsley knows Melanie. Molly knows Lola. Kylie knows Ellis. Yara knows Nadine. Shane knows Grady. Which of Grady and Laurel can Kylie reach?", "answer": "Grady", "steps": [ "Kylie knows Ellis.", "Ellis knows Austin.", "Austin knows Yara.", "Yara knows Nadine.", "Nadine knows Shane.", "Shane knows Grady." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Kylie", "Molly", "Austin", "Yara", "Grady", "Shane", "Ellis", "Lola", "Duke", "Nadine", "Karen", "Melanie", "Kingsley", "Ivy", "Laurel", "Dahlia", "Henrietta", "Eamon", "Anton", "Yvonne" ], "edges": [ [ 0, 6 ], [ 1, 7 ], [ 2, 1 ], [ 2, 3 ], [ 3, 9 ], [ 4, 8 ], [ 5, 4 ], [ 6, 2 ], [ 9, 5 ], [ 10, 16 ], [ 11, 17 ], [ 12, 11 ], [ 12, 13 ], [ 13, 19 ], [ 14, 18 ], [ 15, 14 ], [ 16, 12 ], [ 19, 15 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Julius knows Nell. Seth knows Kelly. Coral knows Peggy. Leigh knows Saul. Luna knows Calvin. Coral knows Boyd. Martha knows Coral. Kelly knows Carrie. Levi knows Seth. Seth knows Luna. Levi knows Tanya. Martha knows Allen. Martha knows Jude. Levi knows Connor. Boyd knows Julius. Boyd knows Carter. Kelly knows Leigh. Peggy knows Renee. Which of Coral and Seth can Levi reach?", "answer": "Seth", "steps": [ "Levi knows Seth." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Levi", "Calvin", "Saul", "Luna", "Kelly", "Carrie", "Tanya", "Leigh", "Seth", "Connor", "Martha", "Renee", "Nell", "Peggy", "Boyd", "Carter", "Allen", "Julius", "Coral", "Jude" ], "edges": [ [ 0, 6 ], [ 0, 8 ], [ 0, 9 ], [ 3, 1 ], [ 4, 5 ], [ 4, 7 ], [ 7, 2 ], [ 8, 3 ], [ 8, 4 ], [ 10, 16 ], [ 10, 18 ], [ 10, 19 ], [ 13, 11 ], [ 14, 15 ], [ 14, 17 ], [ 17, 12 ], [ 18, 13 ], [ 18, 14 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Carol knows Duncan. Ilene knows Federico. Harper knows Elvira. Emily knows Cody. Myra knows Jenna. Jenna knows Ilene. Emily knows Aldo. Duncan knows Ruth. Kingsley knows Carol. Cody knows Kingsley. Emily knows Josie. Harper knows Myra. Jenna knows Edna. Carmela knows Graham. Carol knows Foster. Carmela knows Harper. Carmela knows Carlos. Cody knows Horace. Which of Kingsley and Myra can Emily reach?", "answer": "Kingsley", "steps": [ "Emily knows Cody.", "Cody knows Kingsley." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Emily", "Josie", "Cody", "Carol", "Aldo", "Kingsley", "Horace", "Foster", "Duncan", "Ruth", "Carmela", "Graham", "Harper", "Jenna", "Carlos", "Myra", "Elvira", "Edna", "Ilene", "Federico" ], "edges": [ [ 0, 1 ], [ 0, 4 ], [ 0, 2 ], [ 2, 6 ], [ 2, 5 ], [ 3, 7 ], [ 3, 8 ], [ 5, 3 ], [ 8, 9 ], [ 10, 11 ], [ 10, 14 ], [ 10, 12 ], [ 12, 16 ], [ 12, 15 ], [ 13, 17 ], [ 13, 18 ], [ 15, 13 ], [ 18, 19 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Catherine knows Julie. Catherine knows Sybil. Denver knows Catherine. Carlos knows Eunice. Faith knows Robin. Robin knows Iris. Denver knows Carey. Sybil knows Homer. Lucy knows Dick. Faith knows Wayne. Clarence knows Charity. Eunice knows Lana. Kenzie knows Allan. Robin knows Clarence. Allan knows Lucy. Kenzie knows Faith. Elena knows Denver. Elena knows Carlos. Which of Catherine and Robin can Elena reach?", "answer": "Catherine", "steps": [ "Elena knows Denver.", "Denver knows Catherine." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Elena", "Homer", "Carlos", "Lana", "Carey", "Eunice", "Denver", "Sybil", "Julie", "Catherine", "Kenzie", "Charity", "Allan", "Dick", "Wayne", "Lucy", "Faith", "Clarence", "Iris", "Robin" ], "edges": [ [ 0, 2 ], [ 0, 6 ], [ 2, 5 ], [ 5, 3 ], [ 6, 4 ], [ 6, 9 ], [ 7, 1 ], [ 9, 7 ], [ 9, 8 ], [ 10, 12 ], [ 10, 16 ], [ 12, 15 ], [ 15, 13 ], [ 16, 14 ], [ 16, 19 ], [ 17, 11 ], [ 19, 17 ], [ 19, 18 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Enrique knows Earle. Houston knows Nina. Winston knows Mae. Enrique knows Carter. Earle knows Jessie. Earle knows Houston. Maya knows Cesar. Earle knows Janice. Alfred knows Winston. Zach knows Alfred. Alfred knows Carlos. Max knows Arturo. Carlos knows Max. Jessie knows Jeffery. Janice knows Archer. Nina knows Olivia. Alfred knows Maya. Zach knows Rose. Which of Max and Nina can Enrique reach?", "answer": "Nina", "steps": [ "Enrique knows Earle.", "Earle knows Houston.", "Houston knows Nina." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Enrique", "Carter", "Houston", "Olivia", "Archer", "Earle", "Jeffery", "Nina", "Jessie", "Janice", "Zach", "Rose", "Carlos", "Arturo", "Mae", "Alfred", "Cesar", "Max", "Maya", "Winston" ], "edges": [ [ 0, 1 ], [ 0, 5 ], [ 2, 7 ], [ 5, 2 ], [ 5, 8 ], [ 5, 9 ], [ 7, 3 ], [ 8, 6 ], [ 9, 4 ], [ 10, 11 ], [ 10, 15 ], [ 12, 17 ], [ 15, 12 ], [ 15, 18 ], [ 15, 19 ], [ 17, 13 ], [ 18, 16 ], [ 19, 14 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Eugene knows Raquel. Alyssa knows Anton. Jewel knows Aurora. Anton knows Geoffrey. Rebecca knows Alyssa. Geoffrey knows Saul. Aurora knows Vernon. Stuart knows Jewel. Caroline knows Charles. Brody knows Sally. Sally knows Stuart. Raquel knows Daniel. Sally knows Emanuel. Raquel knows Belinda. Vernon knows Caroline. Aurora knows Lisa. Alyssa knows Clay. Daniel knows Rebecca. Which of Raquel and Sally can Eugene reach?", "answer": "Raquel", "steps": [ "Eugene knows Raquel." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Eugene", "Belinda", "Geoffrey", "Alyssa", "Daniel", "Saul", "Anton", "Raquel", "Rebecca", "Clay", "Brody", "Emanuel", "Caroline", "Aurora", "Stuart", "Charles", "Vernon", "Sally", "Jewel", "Lisa" ], "edges": [ [ 0, 7 ], [ 2, 5 ], [ 3, 6 ], [ 3, 9 ], [ 4, 8 ], [ 6, 2 ], [ 7, 1 ], [ 7, 4 ], [ 8, 3 ], [ 10, 17 ], [ 12, 15 ], [ 13, 16 ], [ 13, 19 ], [ 14, 18 ], [ 16, 12 ], [ 17, 11 ], [ 17, 14 ], [ 18, 13 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Caroline knows Adam. Ember knows Lilia. Eamon knows Ember. Max knows Connor. Myrtle knows Devin. Lilia knows Esther. Myrtle knows Xander. Leslie knows Myrtle. Adam knows Pedro. Priscilla knows Eamon. Jared knows Jill. Eamon knows Jenna. Myrtle knows Caroline. Eamon knows Doris. Jared knows Priscilla. Max knows Jermaine. Jared knows Yvonne. Max knows Leslie. Which of Adam and Lilia can Jared reach?", "answer": "Lilia", "steps": [ "Jared knows Priscilla.", "Priscilla knows Eamon.", "Eamon knows Ember.", "Ember knows Lilia." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Jared", "Lilia", "Priscilla", "Jill", "Doris", "Ember", "Yvonne", "Esther", "Jenna", "Eamon", "Max", "Adam", "Leslie", "Connor", "Devin", "Caroline", "Jermaine", "Pedro", "Xander", "Myrtle" ], "edges": [ [ 0, 3 ], [ 0, 6 ], [ 0, 2 ], [ 1, 7 ], [ 2, 9 ], [ 5, 1 ], [ 9, 4 ], [ 9, 5 ], [ 9, 8 ], [ 10, 13 ], [ 10, 16 ], [ 10, 12 ], [ 11, 17 ], [ 12, 19 ], [ 15, 11 ], [ 19, 14 ], [ 19, 15 ], [ 19, 18 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Annette knows Tom. Ruby knows Ellis. Theodore knows Bryan. Wendell knows Julian. Annette knows Val. Val knows Cate. Penny knows Pearl. Tom knows Samuel. Theodore knows Ray. Ruby knows Penny. Penny knows Percy. Julian knows Kaleb. Alison knows Wendell. Bryan knows Ruby. Percy knows Carlos. Julian knows Annette. Alison knows Renee. Pearl knows Evelyn. Which of Tom and Percy can Theodore reach?", "answer": "Percy", "steps": [ "Theodore knows Bryan.", "Bryan knows Ruby.", "Ruby knows Penny.", "Penny knows Percy." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Theodore", "Bryan", "Percy", "Ray", "Pearl", "Ruby", "Ellis", "Evelyn", "Carlos", "Penny", "Alison", "Wendell", "Tom", "Renee", "Val", "Julian", "Kaleb", "Cate", "Samuel", "Annette" ], "edges": [ [ 0, 3 ], [ 0, 1 ], [ 1, 5 ], [ 2, 8 ], [ 4, 7 ], [ 5, 6 ], [ 5, 9 ], [ 9, 4 ], [ 9, 2 ], [ 10, 13 ], [ 10, 11 ], [ 11, 15 ], [ 12, 18 ], [ 14, 17 ], [ 15, 16 ], [ 15, 19 ], [ 19, 14 ], [ 19, 12 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Gunnar knows Sebastian. Alyson knows Gunnar. Alyson knows Clarissa. Zack knows Alyson. Arthur knows Latoya. Finn knows Zack. Lillian knows Wendy. Keegan knows Destiny. Lenora knows Susanne. Keegan knows Sean. Arthur knows Felix. Julia knows Finn. Lillian knows Tracy. Wendy knows Seth. Susanne knows Graham. Graham knows Lillian. Alyson knows Arthur. Lillian knows Keegan. Which of Susanne and Finn can Julia reach?", "answer": "Finn", "steps": [ "Julia knows Finn." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Julia", "Gunnar", "Sebastian", "Zack", "Latoya", "Clarissa", "Arthur", "Finn", "Alyson", "Felix", "Lenora", "Wendy", "Seth", "Graham", "Destiny", "Tracy", "Keegan", "Susanne", "Lillian", "Sean" ], "edges": [ [ 0, 7 ], [ 1, 2 ], [ 3, 8 ], [ 6, 4 ], [ 6, 9 ], [ 7, 3 ], [ 8, 1 ], [ 8, 5 ], [ 8, 6 ], [ 10, 17 ], [ 11, 12 ], [ 13, 18 ], [ 16, 14 ], [ 16, 19 ], [ 17, 13 ], [ 18, 11 ], [ 18, 15 ], [ 18, 16 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Arden knows Eunice. Austin knows Laura. Constance knows Wayne. Arden knows Simon. Lauren knows Dolly. Alejandro knows Ricardo. Austin knows Kristin. Peter knows Donovan. Alejandro knows Lamont. Lamont knows Austin. Donovan knows Kerry. Wayne knows Lauren. Austin knows Peter. Constance knows Hardy. Constance knows Sean. Ramona knows Arden. Eunice knows Constance. Emery knows Alejandro. Which of Lauren and Donovan can Emery reach?", "answer": "Donovan", "steps": [ "Emery knows Alejandro.", "Alejandro knows Lamont.", "Lamont knows Austin.", "Austin knows Peter.", "Peter knows Donovan." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Emery", "Austin", "Alejandro", "Ricardo", "Peter", "Kristin", "Donovan", "Lamont", "Kerry", "Laura", "Ramona", "Constance", "Arden", "Simon", "Wayne", "Hardy", "Lauren", "Eunice", "Dolly", "Sean" ], "edges": [ [ 0, 2 ], [ 1, 5 ], [ 1, 4 ], [ 1, 9 ], [ 2, 3 ], [ 2, 7 ], [ 4, 6 ], [ 6, 8 ], [ 7, 1 ], [ 10, 12 ], [ 11, 15 ], [ 11, 14 ], [ 11, 19 ], [ 12, 13 ], [ 12, 17 ], [ 14, 16 ], [ 16, 18 ], [ 17, 11 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Khashayar knows Luis. Anton knows Bob. Darwin knows Anton. Luis knows Valerie. Elsa knows Lacey. Warren knows Desmond. Claudia knows Khashayar. Judith knows Claudia. Luis knows Ruby. Jack knows Elsa. Desmond knows Darwin. Lacey knows Dahlia. Ibrahim knows Asher. Darwin knows Jack. Lacey knows Gertrude. Asher knows Judith. Judith knows Aubrey. Aubrey knows Kate. Which of Valerie and Gertrude can Warren reach?", "answer": "Gertrude", "steps": [ "Warren knows Desmond.", "Desmond knows Darwin.", "Darwin knows Jack.", "Jack knows Elsa.", "Elsa knows Lacey.", "Lacey knows Gertrude." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Warren", "Desmond", "Gertrude", "Elsa", "Anton", "Lacey", "Darwin", "Dahlia", "Bob", "Jack", "Ibrahim", "Asher", "Valerie", "Khashayar", "Aubrey", "Luis", "Judith", "Ruby", "Kate", "Claudia" ], "edges": [ [ 0, 1 ], [ 1, 6 ], [ 3, 5 ], [ 4, 8 ], [ 5, 2 ], [ 5, 7 ], [ 6, 4 ], [ 6, 9 ], [ 9, 3 ], [ 10, 11 ], [ 11, 16 ], [ 13, 15 ], [ 14, 18 ], [ 15, 12 ], [ 15, 17 ], [ 16, 14 ], [ 16, 19 ], [ 19, 13 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Jenny knows Boris. Kenneth knows Garrison. Candice knows Kenneth. Sheryl knows Philip. Gerald knows Sheryl. Hayes knows Lawson. Candice knows Aiden. Sheryl knows Joy. Maria knows Nathan. Boris knows Maria. Logan knows Hayes. Philip knows Candice. Jenny knows Xander. Maria knows Logan. Alana knows Justine. Alana knows Jenny. Garrison knows Craig. Gerald knows Sean. Which of Sheryl and Jenny can Gerald reach?", "answer": "Sheryl", "steps": [ "Gerald knows Sheryl." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Gerald", "Kenneth", "Sean", "Craig", "Aiden", "Garrison", "Philip", "Sheryl", "Candice", "Joy", "Alana", "Logan", "Justine", "Lawson", "Nathan", "Hayes", "Boris", "Jenny", "Maria", "Xander" ], "edges": [ [ 0, 2 ], [ 0, 7 ], [ 1, 5 ], [ 5, 3 ], [ 6, 8 ], [ 7, 6 ], [ 7, 9 ], [ 8, 4 ], [ 8, 1 ], [ 10, 12 ], [ 10, 17 ], [ 11, 15 ], [ 15, 13 ], [ 16, 18 ], [ 17, 16 ], [ 17, 19 ], [ 18, 14 ], [ 18, 11 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Marcus knows Gene. Stephanie knows Ernie. Jane knows Brody. Wendell knows Effie. Perry knows Lauren. Lauren knows Marcus. Ernie knows Colette. Wendell knows Milton. Zoe knows Stephanie. Riley knows Jane. Lyric knows Simon. Milton knows Rocco. Colette knows Wendell. Lauren knows Arturo. Arturo knows Hector. Stephanie knows Lyric. Riley knows Jon. Gene knows Riley. Which of Lauren and Stephanie can Zoe reach?", "answer": "Stephanie", "steps": [ "Zoe knows Stephanie." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Zoe", "Stephanie", "Lyric", "Colette", "Effie", "Ernie", "Simon", "Wendell", "Rocco", "Milton", "Perry", "Lauren", "Arturo", "Gene", "Jon", "Marcus", "Hector", "Riley", "Brody", "Jane" ], "edges": [ [ 0, 1 ], [ 1, 2 ], [ 1, 5 ], [ 2, 6 ], [ 3, 7 ], [ 5, 3 ], [ 7, 4 ], [ 7, 9 ], [ 9, 8 ], [ 10, 11 ], [ 11, 12 ], [ 11, 15 ], [ 12, 16 ], [ 13, 17 ], [ 15, 13 ], [ 17, 14 ], [ 17, 19 ], [ 19, 18 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Miriam knows Nancy. Miriam knows Dawn. Miriam knows Chad. Dane knows Brad. Lamont knows Angelica. Darin knows Adelaide. Brad knows Lamont. Dell knows Paige. Adelaide knows Gilbert. Jane knows Gail. Corinne knows Arturo. Ernie knows Miriam. Chad knows Lennox. Dell knows Dane. Brad knows Darin. Brad knows Melissa. Nancy knows Corinne. Jane knows Ernie. Which of Darin and Nancy can Jane reach?", "answer": "Nancy", "steps": [ "Jane knows Ernie.", "Ernie knows Miriam.", "Miriam knows Nancy." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Jane", "Miriam", "Arturo", "Dawn", "Lennox", "Gail", "Corinne", "Chad", "Ernie", "Nancy", "Dell", "Brad", "Gilbert", "Melissa", "Angelica", "Paige", "Adelaide", "Lamont", "Dane", "Darin" ], "edges": [ [ 0, 5 ], [ 0, 8 ], [ 1, 3 ], [ 1, 7 ], [ 1, 9 ], [ 6, 2 ], [ 7, 4 ], [ 8, 1 ], [ 9, 6 ], [ 10, 15 ], [ 10, 18 ], [ 11, 13 ], [ 11, 17 ], [ 11, 19 ], [ 16, 12 ], [ 17, 14 ], [ 18, 11 ], [ 19, 16 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Latoya knows Mildred. Margaret knows Nicholas. Veronica knows Saul. Mildred knows Lisa. Kristin knows Eldon. Veronica knows Beverly. Lisa knows Ellis. Barbara knows Cody. Cameron knows Veronica. Aubrey knows Cameron. Ellis knows Cesar. Cesar knows Alison. Nicholas knows Barbara. Cesar knows Betty. Barbara knows Clay. Eldon knows Latoya. Latoya knows Julio. Beverly knows Margaret. Which of Betty and Cody can Aubrey reach?", "answer": "Cody", "steps": [ "Aubrey knows Cameron.", "Cameron knows Veronica.", "Veronica knows Beverly.", "Beverly knows Margaret.", "Margaret knows Nicholas.", "Nicholas knows Barbara.", "Barbara knows Cody." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Aubrey", "Veronica", "Nicholas", "Barbara", "Margaret", "Cameron", "Saul", "Clay", "Beverly", "Cody", "Kristin", "Latoya", "Ellis", "Cesar", "Lisa", "Eldon", "Julio", "Alison", "Mildred", "Betty" ], "edges": [ [ 0, 5 ], [ 1, 6 ], [ 1, 8 ], [ 2, 3 ], [ 3, 7 ], [ 3, 9 ], [ 4, 2 ], [ 5, 1 ], [ 8, 4 ], [ 10, 15 ], [ 11, 16 ], [ 11, 18 ], [ 12, 13 ], [ 13, 17 ], [ 13, 19 ], [ 14, 12 ], [ 15, 11 ], [ 18, 14 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Greer knows Darin. Brody knows Angelica. Maureen knows Kira. Jordan knows Hope. Saul knows Ariana. Greer knows Francesca. Jillian knows Enrique. Opal knows Brody. Darin knows Rebecca. Darin knows Betty. Opal knows Dwight. Dudley knows Jillian. Ariana knows Maureen. Ariana knows Jordan. Betty knows Jocelyn. Jillian knows Greer. Maureen knows Opal. Enrique knows Latoya. Which of Maureen and Greer can Saul reach?", "answer": "Maureen", "steps": [ "Saul knows Ariana.", "Ariana knows Maureen." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Saul", "Jordan", "Angelica", "Hope", "Dwight", "Opal", "Ariana", "Maureen", "Brody", "Kira", "Dudley", "Enrique", "Jocelyn", "Latoya", "Rebecca", "Darin", "Jillian", "Greer", "Betty", "Francesca" ], "edges": [ [ 0, 6 ], [ 1, 3 ], [ 5, 4 ], [ 5, 8 ], [ 6, 1 ], [ 6, 7 ], [ 7, 5 ], [ 7, 9 ], [ 8, 2 ], [ 10, 16 ], [ 11, 13 ], [ 15, 14 ], [ 15, 18 ], [ 16, 11 ], [ 16, 17 ], [ 17, 15 ], [ 17, 19 ], [ 18, 12 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Priscilla knows Katherine. Gemma knows Linda. Jay knows Willard. Annette knows Fergus. Myrtle knows Cesar. Eleanor knows Finn. Katherine knows Annette. Annette knows Myrtle. Veronica knows Tim. Tim knows Gemma. Veronica knows Kenneth. Luis knows Priscilla. Linda knows Eleanor. Kenneth knows Dolores. Luis knows Jay. India knows Angelica. Linda knows India. Fergus knows Charles. Which of Katherine and Gemma can Veronica reach?", "answer": "Gemma", "steps": [ "Veronica knows Tim.", "Tim knows Gemma." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Veronica", "Tim", "Gemma", "India", "Linda", "Eleanor", "Angelica", "Kenneth", "Finn", "Dolores", "Luis", "Priscilla", "Katherine", "Fergus", "Annette", "Myrtle", "Charles", "Jay", "Cesar", "Willard" ], "edges": [ [ 0, 1 ], [ 0, 7 ], [ 1, 2 ], [ 2, 4 ], [ 3, 6 ], [ 4, 3 ], [ 4, 5 ], [ 5, 8 ], [ 7, 9 ], [ 10, 11 ], [ 10, 17 ], [ 11, 12 ], [ 12, 14 ], [ 13, 16 ], [ 14, 13 ], [ 14, 15 ], [ 15, 18 ], [ 17, 19 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Gerald knows Susan. Jolene knows Omar. Angela knows Cate. Jake knows Lloyd. Dorothy knows Angela. Drew knows Jake. Marc knows Harold. Zachary knows Jolene. Susan knows Peggy. Zachary knows Ramona. Francesca knows Heather. Jeanette knows Ernie. Cate knows Marc. Rachel knows Zachary. Rachel knows Gerald. Marc knows Jeanette. Heather knows Rachel. Cate knows Drew. Which of Gerald and Drew can Francesca reach?", "answer": "Gerald", "steps": [ "Francesca knows Heather.", "Heather knows Rachel.", "Rachel knows Gerald." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Francesca", "Ramona", "Rachel", "Omar", "Gerald", "Peggy", "Susan", "Heather", "Jolene", "Zachary", "Dorothy", "Harold", "Cate", "Ernie", "Drew", "Lloyd", "Jake", "Angela", "Jeanette", "Marc" ], "edges": [ [ 0, 7 ], [ 2, 4 ], [ 2, 9 ], [ 4, 6 ], [ 6, 5 ], [ 7, 2 ], [ 8, 3 ], [ 9, 1 ], [ 9, 8 ], [ 10, 17 ], [ 12, 14 ], [ 12, 19 ], [ 14, 16 ], [ 16, 15 ], [ 17, 12 ], [ 18, 13 ], [ 19, 11 ], [ 19, 18 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Chase knows Wilson. Langston knows Alan. Langston knows Victor. Percy knows Marcia. Sadie knows Langston. Agnes knows Percy. Veronica knows Chance. Alan knows Chase. Hayley knows Deanna. Ember knows Freya. Hayley knows Veronica. Rufus knows Ember. Victor knows Agnes. Marcia knows Walt. Deanna knows Rufus. Chance knows Wallace. Henry knows Hayley. Freya knows Ethan. Which of Deanna and Victor can Henry reach?", "answer": "Deanna", "steps": [ "Henry knows Hayley.", "Hayley knows Deanna." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Henry", "Rufus", "Freya", "Wallace", "Ethan", "Chance", "Hayley", "Deanna", "Ember", "Veronica", "Sadie", "Agnes", "Marcia", "Wilson", "Walt", "Chase", "Langston", "Victor", "Percy", "Alan" ], "edges": [ [ 0, 6 ], [ 1, 8 ], [ 2, 4 ], [ 5, 3 ], [ 6, 7 ], [ 6, 9 ], [ 7, 1 ], [ 8, 2 ], [ 9, 5 ], [ 10, 16 ], [ 11, 18 ], [ 12, 14 ], [ 15, 13 ], [ 16, 17 ], [ 16, 19 ], [ 17, 11 ], [ 18, 12 ], [ 19, 15 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Stacy knows Blair. Leland knows Homer. Blair knows Maggie. Arnold knows Eugene. Abigail knows Russ. Jon knows Grace. Stacy knows Gwen. Gwen knows Dee. Gwen knows Zoe. Leland knows India. Gwen knows Ariana. Dee knows Arnold. Russ knows Leland. Perry knows Barry. Lorna knows Stacy. Russ knows Perry. Gage knows Jon. Leland knows Gage. Which of Stacy and Russ can Abigail reach?", "answer": "Russ", "steps": [ "Abigail knows Russ." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Abigail", "India", "Barry", "Homer", "Perry", "Leland", "Grace", "Gage", "Jon", "Russ", "Lorna", "Zoe", "Maggie", "Ariana", "Blair", "Gwen", "Eugene", "Dee", "Arnold", "Stacy" ], "edges": [ [ 0, 9 ], [ 4, 2 ], [ 5, 1 ], [ 5, 3 ], [ 5, 7 ], [ 7, 8 ], [ 8, 6 ], [ 9, 4 ], [ 9, 5 ], [ 10, 19 ], [ 14, 12 ], [ 15, 11 ], [ 15, 13 ], [ 15, 17 ], [ 17, 18 ], [ 18, 16 ], [ 19, 14 ], [ 19, 15 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Mary knows Kent. Kevin knows Sybil. Sybil knows Frankie. Eric knows Martha. Atlas knows Devon. Sybil knows Mindy. Eric knows Larry. Eric knows Dick. Frankie knows Bart. Bart knows Conner. Cliff knows Alyson. Alyson knows Colleen. Bart knows Elias. Mary knows Tiffany. Kent knows Eric. Cliff knows Mary. Kevin knows Atlas. Bart knows Clay. Which of Martha and Elias can Kevin reach?", "answer": "Elias", "steps": [ "Kevin knows Sybil.", "Sybil knows Frankie.", "Frankie knows Bart.", "Bart knows Elias." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Kevin", "Sybil", "Devon", "Bart", "Clay", "Elias", "Frankie", "Atlas", "Mindy", "Conner", "Cliff", "Mary", "Colleen", "Eric", "Larry", "Martha", "Kent", "Alyson", "Tiffany", "Dick" ], "edges": [ [ 0, 7 ], [ 0, 1 ], [ 1, 8 ], [ 1, 6 ], [ 3, 4 ], [ 3, 5 ], [ 3, 9 ], [ 6, 3 ], [ 7, 2 ], [ 10, 17 ], [ 10, 11 ], [ 11, 18 ], [ 11, 16 ], [ 13, 14 ], [ 13, 15 ], [ 13, 19 ], [ 16, 13 ], [ 17, 12 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Sonia knows Lance. Sonia knows Byron. Daphna knows Ariana. Sonia knows Yara. Eugenia knows Clifford. Sonia knows Eugenia. Florence knows Kristin. Florence knows Walt. Dana knows Sonia. Clifford knows Melody. Byron knows Kenneth. Florence knows Lorraine. Miriam knows Florence. Katherine knows Fabian. Lorraine knows Katherine. Florence knows Kennedy. Kenneth knows Constance. Kennedy knows Daphna. Which of Kenneth and Katherine can Dana reach?", "answer": "Kenneth", "steps": [ "Dana knows Sonia.", "Sonia knows Byron.", "Byron knows Kenneth." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Dana", "Sonia", "Eugenia", "Melody", "Kenneth", "Yara", "Byron", "Constance", "Lance", "Clifford", "Miriam", "Florence", "Kennedy", "Ariana", "Katherine", "Walt", "Lorraine", "Fabian", "Kristin", "Daphna" ], "edges": [ [ 0, 1 ], [ 1, 5 ], [ 1, 6 ], [ 1, 8 ], [ 1, 2 ], [ 2, 9 ], [ 4, 7 ], [ 6, 4 ], [ 9, 3 ], [ 10, 11 ], [ 11, 15 ], [ 11, 16 ], [ 11, 18 ], [ 11, 12 ], [ 12, 19 ], [ 14, 17 ], [ 16, 14 ], [ 19, 13 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Lawson knows Rhea. Lucas knows Lawson. Chandler knows Herbert. Cornelius knows Sonia. Rhea knows Jenny. Cornelius knows Kenneth. Tessa knows Chandler. Dalton knows Dean. Dave knows Cornelius. Lawson knows Amber. Chandler knows Leland. Leland knows Marcus. Amber knows Cruz. Jenny knows Dave. Herbert knows Leigh. Dalton knows Larry. Joseph knows Dalton. Leigh knows Joseph. Which of Cornelius and Dalton can Tessa reach?", "answer": "Dalton", "steps": [ "Tessa knows Chandler.", "Chandler knows Herbert.", "Herbert knows Leigh.", "Leigh knows Joseph.", "Joseph knows Dalton." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Tessa", "Larry", "Marcus", "Leigh", "Dean", "Herbert", "Joseph", "Dalton", "Leland", "Chandler", "Lucas", "Sonia", "Cruz", "Jenny", "Kenneth", "Rhea", "Dave", "Cornelius", "Amber", "Lawson" ], "edges": [ [ 0, 9 ], [ 3, 6 ], [ 5, 3 ], [ 6, 7 ], [ 7, 1 ], [ 7, 4 ], [ 8, 2 ], [ 9, 5 ], [ 9, 8 ], [ 10, 19 ], [ 13, 16 ], [ 15, 13 ], [ 16, 17 ], [ 17, 11 ], [ 17, 14 ], [ 18, 12 ], [ 19, 15 ], [ 19, 18 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Emanuel knows Joshua. Zach knows Agnes. Axel knows Aaron. Lars knows Constance. Emanuel knows Oscar. Zach knows Don. Leonard knows Dixie. Zach knows Daphna. Philip knows Zach. Agnes knows Axel. Emanuel knows Whitney. Oscar knows Karen. Karen knows Tiffany. Lennox knows Leonard. Whitney knows Lennox. Roger knows Lars. Daphna knows Roger. Iris knows Emanuel. Which of Daphna and Whitney can Philip reach?", "answer": "Daphna", "steps": [ "Philip knows Zach.", "Zach knows Daphna." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Philip", "Roger", "Aaron", "Don", "Daphna", "Zach", "Axel", "Lars", "Constance", "Agnes", "Iris", "Lennox", "Tiffany", "Joshua", "Whitney", "Emanuel", "Karen", "Leonard", "Dixie", "Oscar" ], "edges": [ [ 0, 5 ], [ 1, 7 ], [ 4, 1 ], [ 5, 3 ], [ 5, 4 ], [ 5, 9 ], [ 6, 2 ], [ 7, 8 ], [ 9, 6 ], [ 10, 15 ], [ 11, 17 ], [ 14, 11 ], [ 15, 13 ], [ 15, 14 ], [ 15, 19 ], [ 16, 12 ], [ 17, 18 ], [ 19, 16 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Kurt knows Lynn. Jorge knows Michael. Kelly knows Erma. Nolan knows Elizabeth. Kelly knows Shawn. Yvette knows Nolan. Kristina knows Yvette. Michael knows Paula. Lynn knows Kelly. Shawn knows Rick. Kristina knows Dominic. Brody knows Camille. Rick knows April. Lynn knows Dana. Yvette knows Jorge. Viola knows Kristina. Erma knows Brody. Elizabeth knows Ben. Which of Yvette and Kelly can Viola reach?", "answer": "Yvette", "steps": [ "Viola knows Kristina.", "Kristina knows Yvette." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Viola", "Kristina", "Elizabeth", "Nolan", "Paula", "Yvette", "Jorge", "Ben", "Dominic", "Michael", "Kurt", "Lynn", "Rick", "Shawn", "Camille", "Kelly", "Erma", "April", "Dana", "Brody" ], "edges": [ [ 0, 1 ], [ 1, 8 ], [ 1, 5 ], [ 2, 7 ], [ 3, 2 ], [ 5, 3 ], [ 5, 6 ], [ 6, 9 ], [ 9, 4 ], [ 10, 11 ], [ 11, 18 ], [ 11, 15 ], [ 12, 17 ], [ 13, 12 ], [ 15, 13 ], [ 15, 16 ], [ 16, 19 ], [ 19, 14 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Wendy knows Wade. Jamie knows Wendy. Justine knows Jamie. Lamont knows Nell. Wendy knows Owen. Gail knows Helene. Gail knows Anna. Vera knows Jewel. Arthur knows Lamont. Ivy knows Vera. Owen knows Bernadette. Federico knows Gail. Cecilia knows Jacob. Owen knows Arthur. Helene knows Ivy. Jacob knows Federico. Dahlia knows Justine. Helene knows Kristina. Which of Jewel and Nell can Dahlia reach?", "answer": "Nell", "steps": [ "Dahlia knows Justine.", "Justine knows Jamie.", "Jamie knows Wendy.", "Wendy knows Owen.", "Owen knows Arthur.", "Arthur knows Lamont.", "Lamont knows Nell." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Dahlia", "Justine", "Lamont", "Bernadette", "Owen", "Wade", "Nell", "Wendy", "Jamie", "Arthur", "Cecilia", "Jacob", "Vera", "Kristina", "Helene", "Anna", "Jewel", "Gail", "Federico", "Ivy" ], "edges": [ [ 0, 1 ], [ 1, 8 ], [ 2, 6 ], [ 4, 3 ], [ 4, 9 ], [ 7, 5 ], [ 7, 4 ], [ 8, 7 ], [ 9, 2 ], [ 10, 11 ], [ 11, 18 ], [ 12, 16 ], [ 14, 13 ], [ 14, 19 ], [ 17, 15 ], [ 17, 14 ], [ 18, 17 ], [ 19, 12 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Dolores knows Lois. Dolores knows Finn. Stella knows Leon. Leon knows Holden. Nash knows Stella. Chantal knows Glen. Ramona knows Fraser. Iris knows Angela. Sydney knows Horace. Horace knows Cora. Finn knows Mara. Finn knows Charlene. Angela knows Fergus. Chantal knows Denver. Denver knows Iris. Lois knows Ramona. Nash knows Chantal. Charlene knows Sydney. Which of Iris and Sydney can Dolores reach?", "answer": "Sydney", "steps": [ "Dolores knows Finn.", "Finn knows Charlene.", "Charlene knows Sydney." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Dolores", "Fraser", "Finn", "Charlene", "Mara", "Cora", "Sydney", "Lois", "Ramona", "Horace", "Nash", "Holden", "Chantal", "Denver", "Glen", "Fergus", "Iris", "Stella", "Leon", "Angela" ], "edges": [ [ 0, 7 ], [ 0, 2 ], [ 2, 4 ], [ 2, 3 ], [ 3, 6 ], [ 6, 9 ], [ 7, 8 ], [ 8, 1 ], [ 9, 5 ], [ 10, 17 ], [ 10, 12 ], [ 12, 14 ], [ 12, 13 ], [ 13, 16 ], [ 16, 19 ], [ 17, 18 ], [ 18, 11 ], [ 19, 15 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Arden knows Frida. Tina knows Clark. Jeff knows Paige. Tina knows Derek. Lenora knows Jillian. Arden knows Kira. Arden knows Lenora. Lenora knows Brenda. Jillian knows Darin. Darin knows Fred. Darin knows Marian. Hubert knows Robert. Jeff knows Claudia. Jeff knows Hubert. Hank knows Tina. Claudia knows Noel. Frida knows Darcy. Hubert knows Hank. Which of Hubert and Lenora can Jeff reach?", "answer": "Hubert", "steps": [ "Jeff knows Hubert." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Jeff", "Hank", "Tina", "Clark", "Robert", "Paige", "Noel", "Hubert", "Derek", "Claudia", "Arden", "Jillian", "Darin", "Marian", "Brenda", "Kira", "Darcy", "Lenora", "Fred", "Frida" ], "edges": [ [ 0, 5 ], [ 0, 7 ], [ 0, 9 ], [ 1, 2 ], [ 2, 3 ], [ 2, 8 ], [ 7, 4 ], [ 7, 1 ], [ 9, 6 ], [ 10, 15 ], [ 10, 17 ], [ 10, 19 ], [ 11, 12 ], [ 12, 13 ], [ 12, 18 ], [ 17, 14 ], [ 17, 11 ], [ 19, 16 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Xavier knows Ben. Lorna knows Sandra. Patricia knows Carlos. Yuki knows Patricia. Maude knows Allan. Tyler knows Xavier. Lamont knows Kai. Hannah knows Laverne. Xavier knows Lamont. Patricia knows Wade. Xavier knows Lorna. Rick knows Tyler. Laverne knows Rick. Sadie knows Maude. Wade knows Hector. Patricia knows Skyler. Skyler knows Arden. Allan knows Yuki. Which of Lorna and Skyler can Sadie reach?", "answer": "Skyler", "steps": [ "Sadie knows Maude.", "Maude knows Allan.", "Allan knows Yuki.", "Yuki knows Patricia.", "Patricia knows Skyler." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Sadie", "Hector", "Yuki", "Patricia", "Allan", "Carlos", "Maude", "Arden", "Skyler", "Wade", "Hannah", "Kai", "Tyler", "Xavier", "Rick", "Ben", "Laverne", "Sandra", "Lorna", "Lamont" ], "edges": [ [ 0, 6 ], [ 2, 3 ], [ 3, 5 ], [ 3, 8 ], [ 3, 9 ], [ 4, 2 ], [ 6, 4 ], [ 8, 7 ], [ 9, 1 ], [ 10, 16 ], [ 12, 13 ], [ 13, 15 ], [ 13, 18 ], [ 13, 19 ], [ 14, 12 ], [ 16, 14 ], [ 18, 17 ], [ 19, 11 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Jesse knows Marcia. Victor knows Lucas. Lucas knows Tabitha. Jarvis knows Jeff. Wallace knows Jarvis. Vicki knows Jesse. Anthony knows Todd. Anthony knows Verna. Verna knows Maya. Albert knows Gemma. Todd knows Wallace. Cornelius knows Anthony. Nancy knows Vicki. Gemma knows Victor. Blanche knows Iris. Tabitha knows Drew. Vicki knows Albert. Jeff knows Blanche. Which of Vicki and Anthony can Cornelius reach?", "answer": "Anthony", "steps": [ "Cornelius knows Anthony." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Cornelius", "Jeff", "Blanche", "Anthony", "Todd", "Wallace", "Iris", "Jarvis", "Maya", "Verna", "Nancy", "Lucas", "Tabitha", "Vicki", "Albert", "Gemma", "Drew", "Victor", "Marcia", "Jesse" ], "edges": [ [ 0, 3 ], [ 1, 2 ], [ 2, 6 ], [ 3, 4 ], [ 3, 9 ], [ 4, 5 ], [ 5, 7 ], [ 7, 1 ], [ 9, 8 ], [ 10, 13 ], [ 11, 12 ], [ 12, 16 ], [ 13, 14 ], [ 13, 19 ], [ 14, 15 ], [ 15, 17 ], [ 17, 11 ], [ 19, 18 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Becky knows Cole. Jermaine knows Gwen. Cole knows Jamie. Gwen knows Jeanne. Jeanne knows Whitney. Isadora knows Alex. Irma knows Isadora. Jared knows Levi. Hector knows Darius. Becky knows Selena. Jermaine knows Irma. Alex knows Cynthia. Selena knows Hector. Jared knows Eamon. Jamie knows Jared. Whitney knows Grover. Darius knows Ellen. Whitney knows Leah. Which of Jeanne and Jamie can Jermaine reach?", "answer": "Jeanne", "steps": [ "Jermaine knows Gwen.", "Gwen knows Jeanne." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Jermaine", "Gwen", "Cynthia", "Grover", "Jeanne", "Isadora", "Alex", "Whitney", "Leah", "Irma", "Becky", "Cole", "Ellen", "Eamon", "Jamie", "Hector", "Darius", "Jared", "Levi", "Selena" ], "edges": [ [ 0, 1 ], [ 0, 9 ], [ 1, 4 ], [ 4, 7 ], [ 5, 6 ], [ 6, 2 ], [ 7, 3 ], [ 7, 8 ], [ 9, 5 ], [ 10, 11 ], [ 10, 19 ], [ 11, 14 ], [ 14, 17 ], [ 15, 16 ], [ 16, 12 ], [ 17, 13 ], [ 17, 18 ], [ 19, 15 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Blaine knows Rebecca. Rebecca knows Marc. Blaine knows Donovan. Marion knows Ross. Doris knows Bridget. Doris knows Inez. Rebecca knows Saul. Chester knows Haven. Tamara knows Lee. Jane knows Marion. Diego knows Lottie. Inez knows Chester. Keaton knows Blaine. Marc knows Tamara. Diego knows Doris. Lee knows Davis. Marc knows Rosa. Marion knows Diego. Which of Lee and Chester can Keaton reach?", "answer": "Lee", "steps": [ "Keaton knows Blaine.", "Blaine knows Rebecca.", "Rebecca knows Marc.", "Marc knows Tamara.", "Tamara knows Lee." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Keaton", "Lee", "Tamara", "Marc", "Saul", "Davis", "Rebecca", "Rosa", "Donovan", "Blaine", "Jane", "Chester", "Inez", "Doris", "Lottie", "Haven", "Diego", "Bridget", "Ross", "Marion" ], "edges": [ [ 0, 9 ], [ 1, 5 ], [ 2, 1 ], [ 3, 2 ], [ 3, 7 ], [ 6, 4 ], [ 6, 3 ], [ 9, 6 ], [ 9, 8 ], [ 10, 19 ], [ 11, 15 ], [ 12, 11 ], [ 13, 12 ], [ 13, 17 ], [ 16, 14 ], [ 16, 13 ], [ 19, 16 ], [ 19, 18 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Hazel knows Robert. Ellen knows Martin. Lars knows Charles. Robert knows Hope. Esme knows Bernice. Charles knows Cesar. Heidi knows Ellen. Charles knows Tina. Douglas knows Alfred. Alfred knows Nell. Heidi knows Darcy. Alfred knows Lars. Tina knows Esme. Martin knows Barney. Ellen knows Ricardo. Barney knows Brett. Douglas knows Flora. Barney knows Hazel. Which of Esme and Robert can Douglas reach?", "answer": "Esme", "steps": [ "Douglas knows Alfred.", "Alfred knows Lars.", "Lars knows Charles.", "Charles knows Tina.", "Tina knows Esme." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Douglas", "Tina", "Flora", "Lars", "Charles", "Alfred", "Cesar", "Nell", "Bernice", "Esme", "Heidi", "Hazel", "Darcy", "Martin", "Barney", "Ellen", "Brett", "Ricardo", "Hope", "Robert" ], "edges": [ [ 0, 2 ], [ 0, 5 ], [ 1, 9 ], [ 3, 4 ], [ 4, 6 ], [ 4, 1 ], [ 5, 7 ], [ 5, 3 ], [ 9, 8 ], [ 10, 12 ], [ 10, 15 ], [ 11, 19 ], [ 13, 14 ], [ 14, 16 ], [ 14, 11 ], [ 15, 17 ], [ 15, 13 ], [ 19, 18 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Janet knows Gideon. Gustavo knows Guy. Gideon knows Alejandro. Bridget knows Anastasia. Alejandro knows Ernest. June knows Leo. Alejandro knows Brandon. Becky knows Paul. Russell knows Lambert. Wilson knows Alma. Paul knows Bridget. Lambert knows Becky. Gideon knows Wilson. Lambert knows June. June knows Lamar. Wilson knows Gustavo. Becky knows Susanne. Guy knows Stanley. Which of Gideon and Lambert can Russell reach?", "answer": "Lambert", "steps": [ "Russell knows Lambert." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Russell", "Lambert", "Susanne", "Anastasia", "Bridget", "Leo", "June", "Paul", "Lamar", "Becky", "Janet", "Gideon", "Alma", "Stanley", "Guy", "Brandon", "Alejandro", "Gustavo", "Ernest", "Wilson" ], "edges": [ [ 0, 1 ], [ 1, 6 ], [ 1, 9 ], [ 4, 3 ], [ 6, 5 ], [ 6, 8 ], [ 7, 4 ], [ 9, 2 ], [ 9, 7 ], [ 10, 11 ], [ 11, 16 ], [ 11, 19 ], [ 14, 13 ], [ 16, 15 ], [ 16, 18 ], [ 17, 14 ], [ 19, 12 ], [ 19, 17 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Lorraine knows Jules. Renee knows Mary. Lois knows Hubert. Lorraine knows Foster. Hubert knows Ashton. Lorraine knows Noah. Ibrahim knows Bruce. Lois knows Pedro. Pedro knows Emery. Renee knows Lorraine. Mary knows Ibrahim. Pedro knows Tabitha. Lilia knows Renee. Lois knows Calvin. Renee knows Jorge. Ashton knows Brooke. Pedro knows Lennox. Peggy knows Lois. Which of Mary and Hubert can Lilia reach?", "answer": "Mary", "steps": [ "Lilia knows Renee.", "Renee knows Mary." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Lilia", "Jorge", "Ibrahim", "Mary", "Noah", "Bruce", "Renee", "Lorraine", "Foster", "Jules", "Peggy", "Calvin", "Ashton", "Hubert", "Tabitha", "Brooke", "Lois", "Pedro", "Lennox", "Emery" ], "edges": [ [ 0, 6 ], [ 2, 5 ], [ 3, 2 ], [ 6, 1 ], [ 6, 3 ], [ 6, 7 ], [ 7, 4 ], [ 7, 8 ], [ 7, 9 ], [ 10, 16 ], [ 12, 15 ], [ 13, 12 ], [ 16, 11 ], [ 16, 13 ], [ 16, 17 ], [ 17, 14 ], [ 17, 18 ], [ 17, 19 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Ashley knows Leon. Ibrahim knows Lillian. Lola knows Ann. Alexa knows Beau. Stacy knows Corinne. Stacy knows Cynthia. Leon knows Marshall. Shane knows Ibrahim. Ann knows Dwight. Corinne knows Cesar. Jane knows Shelly. Corinne knows Eduardo. Ibrahim knows Alexa. Alexa knows Ashley. Margaret knows Shane. Shane knows Jeff. Eduardo knows Jane. Ann knows Stacy. Which of Jane and Leon can Margaret reach?", "answer": "Leon", "steps": [ "Margaret knows Shane.", "Shane knows Ibrahim.", "Ibrahim knows Alexa.", "Alexa knows Ashley.", "Ashley knows Leon." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Margaret", "Leon", "Alexa", "Shane", "Jeff", "Ashley", "Beau", "Marshall", "Ibrahim", "Lillian", "Lola", "Jane", "Corinne", "Ann", "Dwight", "Eduardo", "Cesar", "Shelly", "Stacy", "Cynthia" ], "edges": [ [ 0, 3 ], [ 1, 7 ], [ 2, 6 ], [ 2, 5 ], [ 3, 4 ], [ 3, 8 ], [ 5, 1 ], [ 8, 2 ], [ 8, 9 ], [ 10, 13 ], [ 11, 17 ], [ 12, 16 ], [ 12, 15 ], [ 13, 14 ], [ 13, 18 ], [ 15, 11 ], [ 18, 12 ], [ 18, 19 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "James knows Daisy. Duke knows Raquel. Griffith knows Hardy. Dakota knows Gordon. Keegan knows Lamont. Lamont knows Griffith. Teresa knows James. Dakota knows Vance. Leah knows Teresa. Alma knows Ramona. Ramona knows Duke. Ariel knows Keegan. Hardy knows Dakota. Adrian knows Ariel. Lamont knows Devin. James knows Alma. Trevor knows Leah. Duke knows Daniella. Which of Teresa and Keegan can Trevor reach?", "answer": "Teresa", "steps": [ "Trevor knows Leah.", "Leah knows Teresa." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Trevor", "Teresa", "Ramona", "Raquel", "Daisy", "James", "Alma", "Leah", "Duke", "Daniella", "Adrian", "Keegan", "Hardy", "Gordon", "Devin", "Lamont", "Griffith", "Ariel", "Dakota", "Vance" ], "edges": [ [ 0, 7 ], [ 1, 5 ], [ 2, 8 ], [ 5, 4 ], [ 5, 6 ], [ 6, 2 ], [ 7, 1 ], [ 8, 3 ], [ 8, 9 ], [ 10, 17 ], [ 11, 15 ], [ 12, 18 ], [ 15, 14 ], [ 15, 16 ], [ 16, 12 ], [ 17, 11 ], [ 18, 13 ], [ 18, 19 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Kobe knows Hugo. Ellis knows Joshua. Angelica knows Kobe. Ariel knows Luke. Helene knows Earle. Earle knows Jack. Donald knows Clinton. Lyle knows Irving. Lyle knows Holly. Demetrius knows Helene. Lyle knows Ellis. Lyle knows Angelica. Demetrius knows Jesse. Donald knows Ariel. Demetrius knows Donald. Ellis knows Yasmin. Demetrius knows Milo. Yasmin knows Edwin. Which of Donald and Ellis can Lyle reach?", "answer": "Ellis", "steps": [ "Lyle knows Ellis." ], "difficulty": 1, "original_distance": 3, "idx_to_symbol": [ "Lyle", "Angelica", "Kobe", "Yasmin", "Hugo", "Ellis", "Holly", "Irving", "Joshua", "Edwin", "Demetrius", "Helene", "Earle", "Ariel", "Jack", "Donald", "Milo", "Jesse", "Clinton", "Luke" ], "edges": [ [ 0, 1 ], [ 0, 6 ], [ 0, 7 ], [ 0, 5 ], [ 1, 2 ], [ 2, 4 ], [ 3, 9 ], [ 5, 8 ], [ 5, 3 ], [ 10, 11 ], [ 10, 16 ], [ 10, 17 ], [ 10, 15 ], [ 11, 12 ], [ 12, 14 ], [ 13, 19 ], [ 15, 18 ], [ 15, 13 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Carla knows Jem. Guillermo knows Devon. Guillermo knows Darla. Esme knows Milo. Jeanne knows Matthew. Carla knows Amanda. Lark knows Darius. Darius knows Duncan. Guillermo knows Diego. Rocco knows Cain. Guillermo knows Troy. Duncan knows Guillermo. Katrina knows Carla. Carla knows Rocco. Troy knows Jeanne. Milo knows Katrina. Carla knows Rosa. Cain knows Travis. Which of Cain and Jeanne can Esme reach?", "answer": "Cain", "steps": [ "Esme knows Milo.", "Milo knows Katrina.", "Katrina knows Carla.", "Carla knows Rocco.", "Rocco knows Cain." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Esme", "Rosa", "Katrina", "Amanda", "Carla", "Travis", "Milo", "Jem", "Rocco", "Cain", "Lark", "Darla", "Duncan", "Diego", "Guillermo", "Matthew", "Darius", "Devon", "Troy", "Jeanne" ], "edges": [ [ 0, 6 ], [ 2, 4 ], [ 4, 1 ], [ 4, 3 ], [ 4, 7 ], [ 4, 8 ], [ 6, 2 ], [ 8, 9 ], [ 9, 5 ], [ 10, 16 ], [ 12, 14 ], [ 14, 11 ], [ 14, 13 ], [ 14, 17 ], [ 14, 18 ], [ 16, 12 ], [ 18, 19 ], [ 19, 15 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Sandy knows Darin. Howard knows Boyd. Felicia knows Wilbur. Glenda knows Sandy. Boyd knows Nell. Audrey knows Mia. Wayne knows Howard. Howard knows Donna. Drake knows Earl. Felicia knows Goldie. Howard knows Jean. Nell knows Dexter. Felicia knows Elijah. Hannah knows Drake. Mia knows Glenda. Dexter knows Hannah. Farrah knows Felicia. Goldie knows Audrey. Which of Darin and Earl can Farrah reach?", "answer": "Darin", "steps": [ "Farrah knows Felicia.", "Felicia knows Goldie.", "Goldie knows Audrey.", "Audrey knows Mia.", "Mia knows Glenda.", "Glenda knows Sandy.", "Sandy knows Darin." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Farrah", "Darin", "Audrey", "Elijah", "Goldie", "Wilbur", "Glenda", "Sandy", "Felicia", "Mia", "Wayne", "Earl", "Nell", "Jean", "Boyd", "Donna", "Hannah", "Drake", "Howard", "Dexter" ], "edges": [ [ 0, 8 ], [ 2, 9 ], [ 4, 2 ], [ 6, 7 ], [ 7, 1 ], [ 8, 3 ], [ 8, 5 ], [ 8, 4 ], [ 9, 6 ], [ 10, 18 ], [ 12, 19 ], [ 14, 12 ], [ 16, 17 ], [ 17, 11 ], [ 18, 13 ], [ 18, 15 ], [ 18, 14 ], [ 19, 16 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Emmett knows Gwen. Abel knows Arlene. Glen knows Essie. Emmett knows Abel. Carla knows Dewey. Reid knows Hardy. April knows Kirsten. Essie knows Frank. Helene knows Carla. Essie knows Mae. Guy knows Reid. Hardy knows Finn. Harry knows Helene. Helene knows James. Reid knows Emanuel. Reid knows Harry. Essie knows April. Frank knows Emmett. Which of Arlene and Dewey can Glen reach?", "answer": "Arlene", "steps": [ "Glen knows Essie.", "Essie knows Frank.", "Frank knows Emmett.", "Emmett knows Abel.", "Abel knows Arlene." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Glen", "Mae", "Essie", "Arlene", "April", "Frank", "Gwen", "Emmett", "Abel", "Kirsten", "Guy", "Emanuel", "Reid", "Dewey", "Hardy", "Harry", "James", "Helene", "Carla", "Finn" ], "edges": [ [ 0, 2 ], [ 2, 1 ], [ 2, 5 ], [ 2, 4 ], [ 4, 9 ], [ 5, 7 ], [ 7, 6 ], [ 7, 8 ], [ 8, 3 ], [ 10, 12 ], [ 12, 11 ], [ 12, 15 ], [ 12, 14 ], [ 14, 19 ], [ 15, 17 ], [ 17, 16 ], [ 17, 18 ], [ 18, 13 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Hugh knows Daria. Jane knows Mara. Arden knows Opal. Paige knows Sean. Yuki knows Victor. Colin knows Rhonda. Lars knows Leopold. Victor knows Arden. Archer knows Paige. Fanny knows Ramona. Fanny knows Hugh. Sean knows Carl. Leopold knows Maggie. Maggie knows Jane. Opal knows Fanny. Daria knows Colin. Jane knows Archer. Hayes knows Lars. Which of Archer and Hugh can Yuki reach?", "answer": "Hugh", "steps": [ "Yuki knows Victor.", "Victor knows Arden.", "Arden knows Opal.", "Opal knows Fanny.", "Fanny knows Hugh." ], "difficulty": 5, "original_distance": 8, "idx_to_symbol": [ "Yuki", "Victor", "Daria", "Colin", "Fanny", "Opal", "Rhonda", "Arden", "Hugh", "Ramona", "Hayes", "Lars", "Paige", "Sean", "Jane", "Maggie", "Carl", "Leopold", "Archer", "Mara" ], "edges": [ [ 0, 1 ], [ 1, 7 ], [ 2, 3 ], [ 3, 6 ], [ 4, 8 ], [ 4, 9 ], [ 5, 4 ], [ 7, 5 ], [ 8, 2 ], [ 10, 11 ], [ 11, 17 ], [ 12, 13 ], [ 13, 16 ], [ 14, 18 ], [ 14, 19 ], [ 15, 14 ], [ 17, 15 ], [ 18, 12 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Leah knows Darius. Pam knows Ethan. Ethan knows Russell. Brock knows Maria. Frances knows Brock. Paula knows Garland. Darius knows Frances. Darius knows Anthony. Anthony knows Abby. Ethan knows Miranda. Ethan knows Sandy. Brock knows Riley. Garland knows Ray. Brock knows Chad. Garland knows Pam. Ray knows Dolores. Darius knows Miles. Garland knows Jude. Which of Frances and Pam can Leah reach?", "answer": "Frances", "steps": [ "Leah knows Darius.", "Darius knows Frances." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Leah", "Darius", "Chad", "Riley", "Anthony", "Frances", "Abby", "Maria", "Miles", "Brock", "Paula", "Garland", "Sandy", "Miranda", "Ray", "Pam", "Dolores", "Russell", "Jude", "Ethan" ], "edges": [ [ 0, 1 ], [ 1, 4 ], [ 1, 8 ], [ 1, 5 ], [ 4, 6 ], [ 5, 9 ], [ 9, 2 ], [ 9, 3 ], [ 9, 7 ], [ 10, 11 ], [ 11, 14 ], [ 11, 18 ], [ 11, 15 ], [ 14, 16 ], [ 15, 19 ], [ 19, 12 ], [ 19, 13 ], [ 19, 17 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Jenna knows Lauren. Regina knows Mae. Hamilton knows Lance. Tessa knows Katherine. Joshua knows Inez. India knows Wilma. Joshua knows Jenna. Mildred knows Elena. Regina knows Mildred. Haven knows Claire. Joy knows Jake. Jenna knows India. Cristina knows Hamilton. Wilma knows Tessa. Mildred knows Callum. Wilma knows Haven. Callum knows Cristina. Cristina knows Joy. Which of Haven and Joy can Joshua reach?", "answer": "Haven", "steps": [ "Joshua knows Jenna.", "Jenna knows India.", "India knows Wilma.", "Wilma knows Haven." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Joshua", "Haven", "Lauren", "Inez", "Jenna", "India", "Claire", "Katherine", "Tessa", "Wilma", "Regina", "Joy", "Elena", "Mae", "Mildred", "Callum", "Jake", "Lance", "Hamilton", "Cristina" ], "edges": [ [ 0, 3 ], [ 0, 4 ], [ 1, 6 ], [ 4, 2 ], [ 4, 5 ], [ 5, 9 ], [ 8, 7 ], [ 9, 1 ], [ 9, 8 ], [ 10, 13 ], [ 10, 14 ], [ 11, 16 ], [ 14, 12 ], [ 14, 15 ], [ 15, 19 ], [ 18, 17 ], [ 19, 11 ], [ 19, 18 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Tonya knows Austin. Geneva knows Caroline. Haley knows Jeanne. Henry knows Geneva. Geneva knows Langston. Byron knows Cruz. Levi knows Sandra. Edna knows Tonya. Levi knows Byron. Jeanne knows Glenda. Langston knows Lorraine. Cruz knows Henry. Byron knows Denver. Tonya knows Malcolm. Malcolm knows Judy. Jeanne knows Gina. Haley knows Kingsley. Glenda knows Edna. Which of Langston and Malcolm can Haley reach?", "answer": "Malcolm", "steps": [ "Haley knows Jeanne.", "Jeanne knows Glenda.", "Glenda knows Edna.", "Edna knows Tonya.", "Tonya knows Malcolm." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Haley", "Austin", "Tonya", "Kingsley", "Judy", "Glenda", "Gina", "Edna", "Jeanne", "Malcolm", "Levi", "Caroline", "Geneva", "Sandra", "Lorraine", "Cruz", "Denver", "Henry", "Byron", "Langston" ], "edges": [ [ 0, 3 ], [ 0, 8 ], [ 2, 1 ], [ 2, 9 ], [ 5, 7 ], [ 7, 2 ], [ 8, 6 ], [ 8, 5 ], [ 9, 4 ], [ 10, 13 ], [ 10, 18 ], [ 12, 11 ], [ 12, 19 ], [ 15, 17 ], [ 17, 12 ], [ 18, 16 ], [ 18, 15 ], [ 19, 14 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Harry knows Joaquin. Boris knows Eric. Lois knows Dina. Eric knows Winifred. Hattie knows Milo. Roger knows Lark. Luna knows Boris. Lark knows Keaton. Keaton knows Zelda. Joaquin knows Vance. Milo knows Julian. Luna knows Fleur. Lois knows Roger. Luna knows Ruth. Zelda knows Hattie. Lois knows Dallas. Elaine knows Harry. Winifred knows Elaine. Which of Vance and Julian can Luna reach?", "answer": "Vance", "steps": [ "Luna knows Boris.", "Boris knows Eric.", "Eric knows Winifred.", "Winifred knows Elaine.", "Elaine knows Harry.", "Harry knows Joaquin.", "Joaquin knows Vance." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Luna", "Vance", "Winifred", "Fleur", "Boris", "Joaquin", "Eric", "Elaine", "Ruth", "Harry", "Lois", "Julian", "Keaton", "Dallas", "Roger", "Milo", "Lark", "Zelda", "Dina", "Hattie" ], "edges": [ [ 0, 3 ], [ 0, 8 ], [ 0, 4 ], [ 2, 7 ], [ 4, 6 ], [ 5, 1 ], [ 6, 2 ], [ 7, 9 ], [ 9, 5 ], [ 10, 13 ], [ 10, 18 ], [ 10, 14 ], [ 12, 17 ], [ 14, 16 ], [ 15, 11 ], [ 16, 12 ], [ 17, 19 ], [ 19, 15 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Candice knows Levi. Ariel knows Candice. Devon knows Todd. Devon knows Marshall. Alexa knows Jasmine. Albert knows Kingsley. Erin knows Faye. Sadie knows Kyle. Sadie knows Kira. Sadie knows Alexa. Alexa knows April. Lorenzo knows Reed. Faye knows Chance. Ariel knows Devon. Devon knows Lorenzo. Lorenzo knows Albert. Erin knows Sadie. Jasmine knows Clarissa. Which of Devon and Sadie can Ariel reach?", "answer": "Devon", "steps": [ "Ariel knows Devon." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Ariel", "Kingsley", "Lorenzo", "Candice", "Levi", "Albert", "Todd", "Reed", "Marshall", "Devon", "Erin", "Clarissa", "Alexa", "Faye", "Chance", "Jasmine", "Kyle", "April", "Kira", "Sadie" ], "edges": [ [ 0, 3 ], [ 0, 9 ], [ 2, 5 ], [ 2, 7 ], [ 3, 4 ], [ 5, 1 ], [ 9, 6 ], [ 9, 2 ], [ 9, 8 ], [ 10, 13 ], [ 10, 19 ], [ 12, 15 ], [ 12, 17 ], [ 13, 14 ], [ 15, 11 ], [ 19, 16 ], [ 19, 12 ], [ 19, 18 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Darin knows Asher. Stefan knows Geneva. Sandy knows Blanche. Asher knows Flora. Cliff knows Owen. Cliff knows Stefan. Brent knows Malik. Patrick knows Pauline. Flora knows Sandy. Cliff knows Autumn. Flora knows Vanessa. Stella knows Luz. Flora knows Jillian. Pauline knows Cliff. Stefan knows Destiny. Sandy knows Brent. Malik knows Anthony. Destiny knows Stella. Which of Cliff and Flora can Patrick reach?", "answer": "Cliff", "steps": [ "Patrick knows Pauline.", "Pauline knows Cliff." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Patrick", "Luz", "Stefan", "Owen", "Cliff", "Pauline", "Stella", "Destiny", "Geneva", "Autumn", "Darin", "Anthony", "Sandy", "Vanessa", "Flora", "Asher", "Malik", "Brent", "Blanche", "Jillian" ], "edges": [ [ 0, 5 ], [ 2, 7 ], [ 2, 8 ], [ 4, 3 ], [ 4, 2 ], [ 4, 9 ], [ 5, 4 ], [ 6, 1 ], [ 7, 6 ], [ 10, 15 ], [ 12, 17 ], [ 12, 18 ], [ 14, 13 ], [ 14, 12 ], [ 14, 19 ], [ 15, 14 ], [ 16, 11 ], [ 17, 16 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Diana knows Brenda. Joan knows Harmony. Holly knows Lorna. Kurt knows Olivia. Yasmin knows Joan. Harmony knows Kurt. Kurt knows Iris. Diana knows Dylan. Holly knows Frances. Alejandro knows Carrie. Yuki knows Sally. Alejandro knows Alma. Dayton knows Yuki. Olivia knows Alejandro. Alma knows Kieran. Frances knows Gordon. Sally knows Diana. Dylan knows Holly. Which of Harmony and Sally can Dayton reach?", "answer": "Sally", "steps": [ "Dayton knows Yuki.", "Yuki knows Sally." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Dayton", "Holly", "Yuki", "Brenda", "Diana", "Frances", "Sally", "Lorna", "Gordon", "Dylan", "Yasmin", "Alejandro", "Joan", "Iris", "Kurt", "Alma", "Harmony", "Carrie", "Kieran", "Olivia" ], "edges": [ [ 0, 2 ], [ 1, 7 ], [ 1, 5 ], [ 2, 6 ], [ 4, 3 ], [ 4, 9 ], [ 5, 8 ], [ 6, 4 ], [ 9, 1 ], [ 10, 12 ], [ 11, 17 ], [ 11, 15 ], [ 12, 16 ], [ 14, 13 ], [ 14, 19 ], [ 15, 18 ], [ 16, 14 ], [ 19, 11 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Cooper knows Shannon. Eva knows Leslie. Chase knows Guy. Chase knows Kylie. Leslie knows Elodie. Khashayar knows Blaine. Myra knows Khashayar. Luis knows Alexa. Guy knows Eva. Alexa knows Sally. Jocelyn knows Dee. Luis knows Susanne. Kylie knows Cooper. Shannon knows Kendrick. Elodie knows Kristin. Susanne knows Alex. Alex knows Myra. Sally knows Jocelyn. Which of Guy and Susanne can Chase reach?", "answer": "Guy", "steps": [ "Chase knows Guy." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Chase", "Elodie", "Kendrick", "Kylie", "Guy", "Eva", "Shannon", "Kristin", "Cooper", "Leslie", "Luis", "Khashayar", "Dee", "Alexa", "Susanne", "Alex", "Jocelyn", "Blaine", "Sally", "Myra" ], "edges": [ [ 0, 3 ], [ 0, 4 ], [ 1, 7 ], [ 3, 8 ], [ 4, 5 ], [ 5, 9 ], [ 6, 2 ], [ 8, 6 ], [ 9, 1 ], [ 10, 13 ], [ 10, 14 ], [ 11, 17 ], [ 13, 18 ], [ 14, 15 ], [ 15, 19 ], [ 16, 12 ], [ 18, 16 ], [ 19, 11 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Magdalena knows Duncan. Paul knows Claire. Anton knows Frankie. Darla knows Chantal. Conrad knows Dana. Tony knows Leo. Drake knows Anton. Magdalena knows Logan. Chantal knows Jacques. Joshua knows Kara. Nicholas knows Paul. Duncan knows Joshua. Dana knows Darla. Leo knows Drake. Nicholas knows Charlene. Kara knows Conrad. Shelly knows Tony. Claire knows Shelly. Which of Conrad and Tony can Nicholas reach?", "answer": "Tony", "steps": [ "Nicholas knows Paul.", "Paul knows Claire.", "Claire knows Shelly.", "Shelly knows Tony." ], "difficulty": 4, "original_distance": 8, "idx_to_symbol": [ "Nicholas", "Leo", "Charlene", "Frankie", "Paul", "Shelly", "Tony", "Claire", "Drake", "Anton", "Magdalena", "Dana", "Logan", "Jacques", "Duncan", "Kara", "Conrad", "Joshua", "Darla", "Chantal" ], "edges": [ [ 0, 2 ], [ 0, 4 ], [ 1, 8 ], [ 4, 7 ], [ 5, 6 ], [ 6, 1 ], [ 7, 5 ], [ 8, 9 ], [ 9, 3 ], [ 10, 12 ], [ 10, 14 ], [ 11, 18 ], [ 14, 17 ], [ 15, 16 ], [ 16, 11 ], [ 17, 15 ], [ 18, 19 ], [ 19, 13 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Whitney knows Veronica. Landon knows Whitney. Wayne knows Lena. Landon knows Victor. Eileen knows Landon. Eileen knows Richard. Landon knows Maggie. Cecilia knows Angelica. Omar knows Haven. Wayne knows Cecilia. Kevin knows Will. Wayne knows Kobe. Kobe knows Florence. Maggie knows Pat. Lena knows Randy. Omar knows Wayne. Landon knows Kevin. Wayne knows Rita. Which of Will and Randy can Eileen reach?", "answer": "Will", "steps": [ "Eileen knows Landon.", "Landon knows Kevin.", "Kevin knows Will." ], "difficulty": 3, "original_distance": 3, "idx_to_symbol": [ "Eileen", "Victor", "Pat", "Richard", "Veronica", "Maggie", "Landon", "Whitney", "Kevin", "Will", "Omar", "Rita", "Angelica", "Haven", "Florence", "Cecilia", "Wayne", "Kobe", "Lena", "Randy" ], "edges": [ [ 0, 3 ], [ 0, 6 ], [ 5, 2 ], [ 6, 1 ], [ 6, 5 ], [ 6, 7 ], [ 6, 8 ], [ 7, 4 ], [ 8, 9 ], [ 10, 13 ], [ 10, 16 ], [ 15, 12 ], [ 16, 11 ], [ 16, 15 ], [ 16, 17 ], [ 16, 18 ], [ 17, 14 ], [ 18, 19 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Charlene knows Pearl. Maude knows Colby. Karl knows Leon. Maggie knows Ibrahim. Marco knows Walt. Colby knows Marco. June knows Isadora. Isadora knows Ignacio. Walt knows Alan. Ibrahim knows Fernando. Kathleen knows Gage. Anita knows Charlene. Marco knows June. Colby knows Karl. Charlene knows Maggie. Gage knows Ruby. Pearl knows Ivan. Maggie knows Kathleen. Which of Charlene and Colby can Maude reach?", "answer": "Colby", "steps": [ "Maude knows Colby." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Maude", "Ignacio", "Karl", "Marco", "Walt", "Isadora", "Leon", "June", "Colby", "Alan", "Anita", "Ruby", "Pearl", "Maggie", "Ibrahim", "Gage", "Ivan", "Kathleen", "Charlene", "Fernando" ], "edges": [ [ 0, 8 ], [ 2, 6 ], [ 3, 7 ], [ 3, 4 ], [ 4, 9 ], [ 5, 1 ], [ 7, 5 ], [ 8, 2 ], [ 8, 3 ], [ 10, 18 ], [ 12, 16 ], [ 13, 17 ], [ 13, 14 ], [ 14, 19 ], [ 15, 11 ], [ 17, 15 ], [ 18, 12 ], [ 18, 13 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Keegan knows Frances. Bennett knows Derrick. Bruno knows Bart. Dolores knows Merle. Chance knows Max. Derrick knows Jeremy. Bennett knows Warren. Keegan knows Jasper. Fergus knows Ashton. Warren knows Finn. Maude knows Dolores. Bruno knows Arden. Jeremy knows Chance. Frances knows Maude. Maude knows Yvette. Bart knows Bennett. Yvette knows Jonas. Jonas knows Fergus. Which of Chance and Fergus can Keegan reach?", "answer": "Fergus", "steps": [ "Keegan knows Frances.", "Frances knows Maude.", "Maude knows Yvette.", "Yvette knows Jonas.", "Jonas knows Fergus." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Keegan", "Dolores", "Fergus", "Yvette", "Ashton", "Maude", "Frances", "Merle", "Jasper", "Jonas", "Bruno", "Warren", "Chance", "Derrick", "Max", "Bennett", "Bart", "Finn", "Arden", "Jeremy" ], "edges": [ [ 0, 8 ], [ 0, 6 ], [ 1, 7 ], [ 2, 4 ], [ 3, 9 ], [ 5, 1 ], [ 5, 3 ], [ 6, 5 ], [ 9, 2 ], [ 10, 18 ], [ 10, 16 ], [ 11, 17 ], [ 12, 14 ], [ 13, 19 ], [ 15, 11 ], [ 15, 13 ], [ 16, 15 ], [ 19, 12 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Dalton knows Joel. Joanna knows Livia. Clay knows Myra. Yuki knows Penny. Joanna knows Yuki. Yuki knows Harvey. Celia knows Isadora. Lorenzo knows Dalton. Dalton knows Ava. Ava knows Celia. Harvey knows Eldon. Myra knows Lorenzo. Judy knows Abel. Ava knows Sandra. Celia knows Khashayar. Louis knows Joanna. Harvey knows Edison. Abel knows Louis. Which of Yuki and Ava can Judy reach?", "answer": "Yuki", "steps": [ "Judy knows Abel.", "Abel knows Louis.", "Louis knows Joanna.", "Joanna knows Yuki." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Judy", "Harvey", "Joanna", "Louis", "Edison", "Livia", "Eldon", "Yuki", "Abel", "Penny", "Clay", "Celia", "Dalton", "Lorenzo", "Isadora", "Joel", "Khashayar", "Ava", "Myra", "Sandra" ], "edges": [ [ 0, 8 ], [ 1, 4 ], [ 1, 6 ], [ 2, 5 ], [ 2, 7 ], [ 3, 2 ], [ 7, 1 ], [ 7, 9 ], [ 8, 3 ], [ 10, 18 ], [ 11, 14 ], [ 11, 16 ], [ 12, 15 ], [ 12, 17 ], [ 13, 12 ], [ 17, 11 ], [ 17, 19 ], [ 18, 13 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Zelda knows Diego. Ira knows Gunnar. Mack knows Essie. Landon knows Elsa. Landon knows Walt. Landon knows Randy. Mack knows Conrad. Emma knows Isiah. Howard knows Roland. Emma knows Lawson. Ashton knows Esme. Diego knows Ira. Howard knows Becky. Walt knows Emma. Zelda knows Mack. Walt knows Ashton. Esme knows Geoffrey. Howard knows Zelda. Which of Esme and Ira can Howard reach?", "answer": "Ira", "steps": [ "Howard knows Zelda.", "Zelda knows Diego.", "Diego knows Ira." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Howard", "Mack", "Roland", "Becky", "Ira", "Diego", "Zelda", "Gunnar", "Essie", "Conrad", "Landon", "Emma", "Randy", "Elsa", "Esme", "Ashton", "Walt", "Geoffrey", "Lawson", "Isiah" ], "edges": [ [ 0, 2 ], [ 0, 3 ], [ 0, 6 ], [ 1, 8 ], [ 1, 9 ], [ 4, 7 ], [ 5, 4 ], [ 6, 5 ], [ 6, 1 ], [ 10, 12 ], [ 10, 13 ], [ 10, 16 ], [ 11, 18 ], [ 11, 19 ], [ 14, 17 ], [ 15, 14 ], [ 16, 15 ], [ 16, 11 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Sheila knows August. Lars knows Henrietta. Allan knows Gladys. Jared knows Jasmine. Tim knows Ernie. Ernie knows Sheila. Jared knows Troy. Glenda knows Harper. Ian knows Glenda. Lars knows Samantha. Henrietta knows Ian. August knows Celia. Eloise knows Erica. Erica knows Aubrey. Jasmine knows Allan. Ian knows Bert. Allan knows Tim. Harper knows Eloise. Which of Allan and Ian can Lars reach?", "answer": "Ian", "steps": [ "Lars knows Henrietta.", "Henrietta knows Ian." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Lars", "Harper", "Glenda", "Ian", "Erica", "Samantha", "Henrietta", "Aubrey", "Eloise", "Bert", "Jared", "Ernie", "Tim", "Allan", "August", "Troy", "Jasmine", "Celia", "Sheila", "Gladys" ], "edges": [ [ 0, 5 ], [ 0, 6 ], [ 1, 8 ], [ 2, 1 ], [ 3, 2 ], [ 3, 9 ], [ 4, 7 ], [ 6, 3 ], [ 8, 4 ], [ 10, 15 ], [ 10, 16 ], [ 11, 18 ], [ 12, 11 ], [ 13, 12 ], [ 13, 19 ], [ 14, 17 ], [ 16, 13 ], [ 18, 14 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Glenda knows Kristin. Dominic knows Eva. Alex knows Tamara. Dee knows Gus. Casey knows Carol. Hailey knows Angela. Angela knows Alex. Casey knows Alder. Alex knows Glenda. Alex knows Colleen. Gus knows Casey. Kendra knows Hailey. Gladys knows Kendra. Eva knows Dee. Lennox knows Mary. Eva knows Bernice. Casey knows Lennox. Kendra knows Kai. Which of Eva and Kendra can Gladys reach?", "answer": "Kendra", "steps": [ "Gladys knows Kendra." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Gladys", "Kristin", "Colleen", "Glenda", "Kendra", "Tamara", "Kai", "Alex", "Angela", "Hailey", "Dominic", "Mary", "Alder", "Lennox", "Eva", "Carol", "Bernice", "Casey", "Gus", "Dee" ], "edges": [ [ 0, 4 ], [ 3, 1 ], [ 4, 6 ], [ 4, 9 ], [ 7, 2 ], [ 7, 3 ], [ 7, 5 ], [ 8, 7 ], [ 9, 8 ], [ 10, 14 ], [ 13, 11 ], [ 14, 16 ], [ 14, 19 ], [ 17, 12 ], [ 17, 13 ], [ 17, 15 ], [ 18, 17 ], [ 19, 18 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Sheila knows Irma. Trina knows Erica. Richard knows Isla. Trina knows Diane. Jacqueline knows Nash. Jacqueline knows Will. Erica knows Fergus. Fergus knows Preston. Emma knows Bonnie. Fergus knows Clarissa. Jacqueline knows Wanda. Erica knows Sheila. Wanda knows Kaleb. Richard knows Emma. Wanda knows Richard. Trina knows Marian. Kaleb knows Terry. Clarissa knows Hugo. Which of Erica and Wanda can Trina reach?", "answer": "Erica", "steps": [ "Trina knows Erica." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Trina", "Preston", "Sheila", "Marian", "Clarissa", "Diane", "Irma", "Hugo", "Erica", "Fergus", "Jacqueline", "Isla", "Kaleb", "Will", "Emma", "Nash", "Terry", "Bonnie", "Wanda", "Richard" ], "edges": [ [ 0, 3 ], [ 0, 5 ], [ 0, 8 ], [ 2, 6 ], [ 4, 7 ], [ 8, 2 ], [ 8, 9 ], [ 9, 1 ], [ 9, 4 ], [ 10, 13 ], [ 10, 15 ], [ 10, 18 ], [ 12, 16 ], [ 14, 17 ], [ 18, 12 ], [ 18, 19 ], [ 19, 11 ], [ 19, 14 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Brian knows Alvin. Daphna knows Jenny. Alvin knows Morris. Kylie knows Clay. Clay knows Heidi. Joyce knows Tristan. Louise knows William. Heidi knows Brandon. Randall knows Kylie. Noel knows Winston. Jenny knows Randall. Fisher knows Finn. Heidi knows Jonathan. Finn knows Noel. Joyce knows Brian. Winston knows Dolores. Jonathan knows Louise. Dolores knows Joyce. Which of Alvin and Louise can Fisher reach?", "answer": "Alvin", "steps": [ "Fisher knows Finn.", "Finn knows Noel.", "Noel knows Winston.", "Winston knows Dolores.", "Dolores knows Joyce.", "Joyce knows Brian.", "Brian knows Alvin." ], "difficulty": 7, "original_distance": 8, "idx_to_symbol": [ "Fisher", "Winston", "Tristan", "Finn", "Noel", "Morris", "Joyce", "Alvin", "Dolores", "Brian", "Daphna", "Kylie", "Brandon", "Jenny", "Randall", "William", "Heidi", "Louise", "Clay", "Jonathan" ], "edges": [ [ 0, 3 ], [ 1, 8 ], [ 3, 4 ], [ 4, 1 ], [ 6, 2 ], [ 6, 9 ], [ 7, 5 ], [ 8, 6 ], [ 9, 7 ], [ 10, 13 ], [ 11, 18 ], [ 13, 14 ], [ 14, 11 ], [ 16, 12 ], [ 16, 19 ], [ 17, 15 ], [ 18, 16 ], [ 19, 17 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Alison knows Caleb. Dean knows Atlas. Dean knows Lenora. Zachary knows Joanna. Ibrahim knows Alison. Zachary knows Kerry. Martha knows Ibrahim. Rick knows Malik. Atlas knows Byron. Darius knows Edith. Atlas knows Rick. Darius knows Dean. Joanna knows Carl. Carl knows Sharon. Serena knows Haley. Alison knows Zachary. Joanna knows Victoria. Haley knows Darius. Which of Haley and Ibrahim can Serena reach?", "answer": "Haley", "steps": [ "Serena knows Haley." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Serena", "Edith", "Rick", "Dean", "Lenora", "Darius", "Byron", "Malik", "Atlas", "Haley", "Martha", "Caleb", "Carl", "Zachary", "Kerry", "Alison", "Victoria", "Sharon", "Joanna", "Ibrahim" ], "edges": [ [ 0, 9 ], [ 2, 7 ], [ 3, 4 ], [ 3, 8 ], [ 5, 1 ], [ 5, 3 ], [ 8, 6 ], [ 8, 2 ], [ 9, 5 ], [ 10, 19 ], [ 12, 17 ], [ 13, 14 ], [ 13, 18 ], [ 15, 11 ], [ 15, 13 ], [ 18, 16 ], [ 18, 12 ], [ 19, 15 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Jocelyn knows Gregory. Ron knows Leticia. Luella knows Foster. Irene knows Ron. Yara knows Bernadette. Viola knows Imogen. Jeff knows Norma. Ron knows Yasmin. Ron knows Luella. Gregory knows Yara. Tara knows Irene. Viola knows Jeff. Parsa knows Tara. Ford knows Parsa. Darrell knows Ford. Viola knows Phoebe. Gladys knows Jocelyn. Bernadette knows Viola. Which of Parsa and Gregory can Gladys reach?", "answer": "Gregory", "steps": [ "Gladys knows Jocelyn.", "Jocelyn knows Gregory." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Gladys", "Phoebe", "Imogen", "Norma", "Bernadette", "Viola", "Gregory", "Yara", "Jeff", "Jocelyn", "Darrell", "Leticia", "Yasmin", "Foster", "Irene", "Ron", "Parsa", "Tara", "Luella", "Ford" ], "edges": [ [ 0, 9 ], [ 4, 5 ], [ 5, 1 ], [ 5, 2 ], [ 5, 8 ], [ 6, 7 ], [ 7, 4 ], [ 8, 3 ], [ 9, 6 ], [ 10, 19 ], [ 14, 15 ], [ 15, 11 ], [ 15, 12 ], [ 15, 18 ], [ 16, 17 ], [ 17, 14 ], [ 18, 13 ], [ 19, 16 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Geraldine knows Clyde. Mario knows Gideon. Mario knows Jules. Gail knows Foster. Jules knows Chad. Lynn knows Grant. Lynn knows Kirsten. Bill knows Mario. Foster knows Jessica. Geraldine knows Bill. Rhea knows Sidney. Foster knows Lynn. Jessica knows Kira. Rhea knows Gail. Isla knows Logan. Gideon knows Cole. Jules knows Isla. Kirsten knows Justine. Which of Lynn and Jules can Geraldine reach?", "answer": "Jules", "steps": [ "Geraldine knows Bill.", "Bill knows Mario.", "Mario knows Jules." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Geraldine", "Jules", "Chad", "Gideon", "Clyde", "Cole", "Bill", "Logan", "Mario", "Isla", "Rhea", "Lynn", "Grant", "Jessica", "Sidney", "Kira", "Gail", "Justine", "Foster", "Kirsten" ], "edges": [ [ 0, 4 ], [ 0, 6 ], [ 1, 2 ], [ 1, 9 ], [ 3, 5 ], [ 6, 8 ], [ 8, 3 ], [ 8, 1 ], [ 9, 7 ], [ 10, 14 ], [ 10, 16 ], [ 11, 12 ], [ 11, 19 ], [ 13, 15 ], [ 16, 18 ], [ 18, 13 ], [ 18, 11 ], [ 19, 17 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Gemma knows Marie. Cameron knows Paula. Calvin knows Lois. Ashley knows Calvin. Paula knows Kira. Lois knows Roger. Calvin knows Vivian. Roger knows Carrie. Marie knows Karla. Gage knows Hannah. Kira knows Gemma. Carrie knows Martin. Aaron knows Jocelyn. Paula knows Aaron. Aaron knows Zane. Calvin knows Gage. Paula knows Opal. Gage knows Lenora. Which of Carrie and Marie can Cameron reach?", "answer": "Marie", "steps": [ "Cameron knows Paula.", "Paula knows Kira.", "Kira knows Gemma.", "Gemma knows Marie." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Cameron", "Kira", "Marie", "Gemma", "Karla", "Paula", "Aaron", "Opal", "Zane", "Jocelyn", "Ashley", "Lois", "Carrie", "Roger", "Martin", "Calvin", "Gage", "Vivian", "Hannah", "Lenora" ], "edges": [ [ 0, 5 ], [ 1, 3 ], [ 2, 4 ], [ 3, 2 ], [ 5, 1 ], [ 5, 7 ], [ 5, 6 ], [ 6, 8 ], [ 6, 9 ], [ 10, 15 ], [ 11, 13 ], [ 12, 14 ], [ 13, 12 ], [ 15, 11 ], [ 15, 17 ], [ 15, 16 ], [ 16, 18 ], [ 16, 19 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Adam knows Jenna. Lucy knows Colby. Emanuel knows Dirk. Helene knows Emanuel. Jenna knows Lucy. Arturo knows Chloe. Beverly knows Alana. Simon knows Constance. Simon knows Aubrey. Rowan knows Lydia. Alana knows Kendra. Franklin knows Helene. Franklin knows Alejandro. Lucy knows Simon. Constance knows Beverly. Dirk knows Robert. Arturo knows Franklin. Lydia knows Arturo. Which of Beverly and Emanuel can Rowan reach?", "answer": "Emanuel", "steps": [ "Rowan knows Lydia.", "Lydia knows Arturo.", "Arturo knows Franklin.", "Franklin knows Helene.", "Helene knows Emanuel." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Rowan", "Chloe", "Franklin", "Arturo", "Dirk", "Emanuel", "Helene", "Lydia", "Alejandro", "Robert", "Adam", "Colby", "Simon", "Lucy", "Alana", "Beverly", "Constance", "Jenna", "Aubrey", "Kendra" ], "edges": [ [ 0, 7 ], [ 2, 8 ], [ 2, 6 ], [ 3, 1 ], [ 3, 2 ], [ 4, 9 ], [ 5, 4 ], [ 6, 5 ], [ 7, 3 ], [ 10, 17 ], [ 12, 18 ], [ 12, 16 ], [ 13, 11 ], [ 13, 12 ], [ 14, 19 ], [ 15, 14 ], [ 16, 15 ], [ 17, 13 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Sonia knows Lance. Sonia knows Byron. Daphna knows Ariana. Sonia knows Yara. Eugenia knows Clifford. Sonia knows Eugenia. Florence knows Kristin. Florence knows Walt. Dana knows Sonia. Clifford knows Melody. Byron knows Kenneth. Florence knows Lorraine. Miriam knows Florence. Katherine knows Fabian. Lorraine knows Katherine. Florence knows Kennedy. Kenneth knows Constance. Kennedy knows Daphna. Which of Sonia and Florence can Dana reach?", "answer": "Sonia", "steps": [ "Dana knows Sonia." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Dana", "Sonia", "Eugenia", "Melody", "Kenneth", "Yara", "Byron", "Constance", "Lance", "Clifford", "Miriam", "Florence", "Kennedy", "Ariana", "Katherine", "Walt", "Lorraine", "Fabian", "Kristin", "Daphna" ], "edges": [ [ 0, 1 ], [ 1, 5 ], [ 1, 6 ], [ 1, 8 ], [ 1, 2 ], [ 2, 9 ], [ 4, 7 ], [ 6, 4 ], [ 9, 3 ], [ 10, 11 ], [ 11, 15 ], [ 11, 16 ], [ 11, 18 ], [ 11, 12 ], [ 12, 19 ], [ 14, 17 ], [ 16, 14 ], [ 19, 13 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Blaine knows Rebecca. Rebecca knows Marc. Blaine knows Donovan. Marion knows Ross. Doris knows Bridget. Doris knows Inez. Rebecca knows Saul. Chester knows Haven. Tamara knows Lee. Jane knows Marion. Diego knows Lottie. Inez knows Chester. Keaton knows Blaine. Marc knows Tamara. Diego knows Doris. Lee knows Davis. Marc knows Rosa. Marion knows Diego. Which of Diego and Rebecca can Keaton reach?", "answer": "Rebecca", "steps": [ "Keaton knows Blaine.", "Blaine knows Rebecca." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Keaton", "Lee", "Tamara", "Marc", "Saul", "Davis", "Rebecca", "Rosa", "Donovan", "Blaine", "Jane", "Chester", "Inez", "Doris", "Lottie", "Haven", "Diego", "Bridget", "Ross", "Marion" ], "edges": [ [ 0, 9 ], [ 1, 5 ], [ 2, 1 ], [ 3, 2 ], [ 3, 7 ], [ 6, 4 ], [ 6, 3 ], [ 9, 6 ], [ 9, 8 ], [ 10, 19 ], [ 11, 15 ], [ 12, 11 ], [ 13, 12 ], [ 13, 17 ], [ 16, 14 ], [ 16, 13 ], [ 19, 16 ], [ 19, 18 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Clifford knows Jared. Sally knows Effie. Adam knows Shannon. Jane knows Wilson. Clayton knows Ignacio. Adam knows Jane. Clifford knows Jillian. Jake knows Adam. Wilson knows Pam. Ignacio knows Miles. Sally knows Juan. Clayton knows Edward. Kate knows Ray. Wilson knows Ada. Juan knows Clifford. Miles knows Sally. Simon knows Jake. Kate knows Simon. Which of Jake and Miles can Clayton reach?", "answer": "Miles", "steps": [ "Clayton knows Ignacio.", "Ignacio knows Miles." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Clayton", "Sally", "Edward", "Clifford", "Jared", "Effie", "Jillian", "Juan", "Ignacio", "Miles", "Kate", "Adam", "Ray", "Wilson", "Pam", "Shannon", "Ada", "Jane", "Simon", "Jake" ], "edges": [ [ 0, 2 ], [ 0, 8 ], [ 1, 5 ], [ 1, 7 ], [ 3, 4 ], [ 3, 6 ], [ 7, 3 ], [ 8, 9 ], [ 9, 1 ], [ 10, 12 ], [ 10, 18 ], [ 11, 15 ], [ 11, 17 ], [ 13, 14 ], [ 13, 16 ], [ 17, 13 ], [ 18, 19 ], [ 19, 11 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Joan knows Donald. Emery knows Neil. Will knows Norman. Will knows Sierra. Donald knows Paige. Milo knows Etta. Jasper knows Leland. Donald knows Emery. Jasper knows Martha. Jude knows Gina. Martha knows Milo. Emery knows Elliot. Elliot knows Sonia. Martha knows Pam. Sierra knows Jasper. Kristin knows Jude. Jude knows Joan. Ignacio knows Will. Which of Elliot and Milo can Kristin reach?", "answer": "Elliot", "steps": [ "Kristin knows Jude.", "Jude knows Joan.", "Joan knows Donald.", "Donald knows Emery.", "Emery knows Elliot." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Kristin", "Gina", "Sonia", "Emery", "Elliot", "Joan", "Jude", "Donald", "Neil", "Paige", "Ignacio", "Norman", "Etta", "Martha", "Milo", "Sierra", "Will", "Jasper", "Pam", "Leland" ], "edges": [ [ 0, 6 ], [ 3, 4 ], [ 3, 8 ], [ 4, 2 ], [ 5, 7 ], [ 6, 1 ], [ 6, 5 ], [ 7, 3 ], [ 7, 9 ], [ 10, 16 ], [ 13, 14 ], [ 13, 18 ], [ 14, 12 ], [ 15, 17 ], [ 16, 11 ], [ 16, 15 ], [ 17, 13 ], [ 17, 19 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Fisher knows Val. Bernice knows Yasmin. Jared knows Keith. Terry knows Ford. Kaleb knows Fisher. Rebecca knows Elvira. Maya knows Natalie. Maya knows Javier. Elvira knows Celeste. Javier knows Kaleb. Celeste knows Bernice. Ford knows Jared. Val knows Latoya. Celeste knows Allan. Julia knows Blaine. Javier knows Everett. Blaine knows Maya. Bernice knows Terry. Which of Ford and Fisher can Julia reach?", "answer": "Fisher", "steps": [ "Julia knows Blaine.", "Blaine knows Maya.", "Maya knows Javier.", "Javier knows Kaleb.", "Kaleb knows Fisher." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Julia", "Latoya", "Fisher", "Javier", "Natalie", "Everett", "Blaine", "Val", "Maya", "Kaleb", "Rebecca", "Keith", "Ford", "Bernice", "Allan", "Yasmin", "Elvira", "Jared", "Celeste", "Terry" ], "edges": [ [ 0, 6 ], [ 2, 7 ], [ 3, 5 ], [ 3, 9 ], [ 6, 8 ], [ 7, 1 ], [ 8, 4 ], [ 8, 3 ], [ 9, 2 ], [ 10, 16 ], [ 12, 17 ], [ 13, 15 ], [ 13, 19 ], [ 16, 18 ], [ 17, 11 ], [ 18, 14 ], [ 18, 13 ], [ 19, 12 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Demetrius knows Chandler. Corinne knows Omar. Bella knows Kimberly. Javier knows Demetrius. Bryan knows Jude. Herbert knows Claire. Demetrius knows Herbert. Karen knows Eileen. Candice knows Jessica. Leroy knows Candice. Kevin knows Eric. Jude knows Leroy. Eileen knows Javier. Leroy knows Corinne. Corinne knows Drew. Kevin knows Tessa. Javier knows Kevin. Candice knows Bella. Which of Candice and Demetrius can Bryan reach?", "answer": "Candice", "steps": [ "Bryan knows Jude.", "Jude knows Leroy.", "Leroy knows Candice." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Bryan", "Bella", "Candice", "Leroy", "Kimberly", "Drew", "Jessica", "Jude", "Corinne", "Omar", "Karen", "Herbert", "Demetrius", "Javier", "Claire", "Tessa", "Chandler", "Eileen", "Kevin", "Eric" ], "edges": [ [ 0, 7 ], [ 1, 4 ], [ 2, 1 ], [ 2, 6 ], [ 3, 2 ], [ 3, 8 ], [ 7, 3 ], [ 8, 5 ], [ 8, 9 ], [ 10, 17 ], [ 11, 14 ], [ 12, 11 ], [ 12, 16 ], [ 13, 12 ], [ 13, 18 ], [ 17, 13 ], [ 18, 15 ], [ 18, 19 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Elijah knows Yasmin. Val knows Abby. Lloyd knows Estella. Ashton knows Alice. Zach knows Alan. Abby knows Elijah. Ashton knows Laura. Electra knows Fletcher. Don knows Lewis. Abby knows Julius. Jeremy knows Electra. Zelda knows Dante. Elijah knows Zelda. Fabian knows Val. Laura knows Jeremy. Zach knows Ashton. Dante knows Don. Estella knows Zach. Which of Fletcher and Lewis can Lloyd reach?", "answer": "Fletcher", "steps": [ "Lloyd knows Estella.", "Estella knows Zach.", "Zach knows Ashton.", "Ashton knows Laura.", "Laura knows Jeremy.", "Jeremy knows Electra.", "Electra knows Fletcher." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Lloyd", "Ashton", "Laura", "Alan", "Zach", "Electra", "Alice", "Jeremy", "Fletcher", "Estella", "Fabian", "Elijah", "Zelda", "Julius", "Abby", "Don", "Yasmin", "Dante", "Lewis", "Val" ], "edges": [ [ 0, 9 ], [ 1, 6 ], [ 1, 2 ], [ 2, 7 ], [ 4, 3 ], [ 4, 1 ], [ 5, 8 ], [ 7, 5 ], [ 9, 4 ], [ 10, 19 ], [ 11, 16 ], [ 11, 12 ], [ 12, 17 ], [ 14, 13 ], [ 14, 11 ], [ 15, 18 ], [ 17, 15 ], [ 19, 14 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Jeremy knows Samuel. Charles knows Dorian. Charles knows Fergus. Charles knows Jose. Jeremy knows Bernard. Charles knows Delilah. Deanna knows Charles. Jose knows Quinn. Charles knows Frida. Kirsten knows Isla. Justin knows Chester. Jeremy knows Adam. Delilah knows Kirsten. August knows Jeremy. Samuel knows Harvey. Jeremy knows Nolan. Nolan knows Justin. Jeremy knows William. Which of Delilah and Nolan can Deanna reach?", "answer": "Delilah", "steps": [ "Deanna knows Charles.", "Charles knows Delilah." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Deanna", "Charles", "Delilah", "Jose", "Frida", "Dorian", "Fergus", "Kirsten", "Quinn", "Isla", "August", "Jeremy", "Nolan", "Samuel", "Adam", "Bernard", "William", "Justin", "Harvey", "Chester" ], "edges": [ [ 0, 1 ], [ 1, 4 ], [ 1, 5 ], [ 1, 6 ], [ 1, 3 ], [ 1, 2 ], [ 2, 7 ], [ 3, 8 ], [ 7, 9 ], [ 10, 11 ], [ 11, 14 ], [ 11, 15 ], [ 11, 16 ], [ 11, 13 ], [ 11, 12 ], [ 12, 17 ], [ 13, 18 ], [ 17, 19 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Keira knows Humphrey. Lillian knows Federico. Walter knows Zach. Harold knows Eileen. Zach knows Griffith. Lacey knows Leroy. Eileen knows Carla. Eugene knows Harold. Lorraine knows Eugene. Humphrey knows Russ. Forrest knows Demetrius. Griffith knows Lillian. Leroy knows Forrest. Demetrius knows Jameson. Keith knows Elias. Elias knows Keira. Humphrey knows Lacey. Eileen knows Walter. Which of Eileen and Humphrey can Lorraine reach?", "answer": "Eileen", "steps": [ "Lorraine knows Eugene.", "Eugene knows Harold.", "Harold knows Eileen." ], "difficulty": 3, "original_distance": 8, "idx_to_symbol": [ "Lorraine", "Harold", "Zach", "Federico", "Eugene", "Griffith", "Eileen", "Lillian", "Walter", "Carla", "Keith", "Keira", "Leroy", "Jameson", "Elias", "Forrest", "Humphrey", "Demetrius", "Lacey", "Russ" ], "edges": [ [ 0, 4 ], [ 1, 6 ], [ 2, 5 ], [ 4, 1 ], [ 5, 7 ], [ 6, 8 ], [ 6, 9 ], [ 7, 3 ], [ 8, 2 ], [ 10, 14 ], [ 11, 16 ], [ 12, 15 ], [ 14, 11 ], [ 15, 17 ], [ 16, 18 ], [ 16, 19 ], [ 17, 13 ], [ 18, 12 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "April knows Lynn. Lynn knows Darrell. Elmer knows Darwin. Virginia knows Khashayar. Nancy knows Charity. Virginia knows Jake. April knows Hendrix. Lynn knows Lillian. Arlene knows Deborah. Charity knows Ray. Charity knows Ember. Enrique knows Nancy. Deborah knows April. Ray knows Lois. Jake knows Enrique. Ray knows Autumn. Elmer knows Eldon. Darwin knows Arlene. Which of Nancy and Deborah can Elmer reach?", "answer": "Deborah", "steps": [ "Elmer knows Darwin.", "Darwin knows Arlene.", "Arlene knows Deborah." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Elmer", "Deborah", "Lynn", "Arlene", "Darrell", "Lillian", "April", "Hendrix", "Eldon", "Darwin", "Virginia", "Nancy", "Ray", "Enrique", "Autumn", "Lois", "Charity", "Ember", "Khashayar", "Jake" ], "edges": [ [ 0, 8 ], [ 0, 9 ], [ 1, 6 ], [ 2, 4 ], [ 2, 5 ], [ 3, 1 ], [ 6, 2 ], [ 6, 7 ], [ 9, 3 ], [ 10, 18 ], [ 10, 19 ], [ 11, 16 ], [ 12, 14 ], [ 12, 15 ], [ 13, 11 ], [ 16, 12 ], [ 16, 17 ], [ 19, 13 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Emanuel knows Chance. Marshall knows Cooper. Gonzalo knows Jewel. Cooper knows Peggy. Chance knows Landon. Belinda knows Gonzalo. Devin knows Ted. Marshall knows Cornelius. Emanuel knows Wade. Landon knows Robin. Ted knows Edmund. Gonzalo knows Emanuel. Ted knows Teresa. Gonzalo knows Noah. Cooper knows Devin. Landon knows Blanche. Mildred knows Marshall. Marshall knows Dante. Which of Gonzalo and Marshall can Mildred reach?", "answer": "Marshall", "steps": [ "Mildred knows Marshall." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Mildred", "Ted", "Peggy", "Edmund", "Dante", "Teresa", "Marshall", "Cooper", "Devin", "Cornelius", "Belinda", "Landon", "Wade", "Blanche", "Noah", "Robin", "Gonzalo", "Emanuel", "Chance", "Jewel" ], "edges": [ [ 0, 6 ], [ 1, 3 ], [ 1, 5 ], [ 6, 4 ], [ 6, 7 ], [ 6, 9 ], [ 7, 2 ], [ 7, 8 ], [ 8, 1 ], [ 10, 16 ], [ 11, 13 ], [ 11, 15 ], [ 16, 14 ], [ 16, 17 ], [ 16, 19 ], [ 17, 12 ], [ 17, 18 ], [ 18, 11 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Federico knows Coral. Jim knows Elvis. Elvis knows Cora. Saul knows Edwin. Grant knows Sandy. Corinne knows Pablo. Gabe knows George. Gabe knows Clifford. Saul knows Grant. Morris knows Cate. Gabe knows Chris. Landon knows Morris. Sandy knows Federico. Clifford knows Landon. Grant knows Corinne. Clifford knows Jim. Pablo knows Jolene. Saul knows Hazel. Which of Grant and Clifford can Saul reach?", "answer": "Grant", "steps": [ "Saul knows Grant." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Saul", "Pablo", "Grant", "Federico", "Sandy", "Corinne", "Coral", "Edwin", "Hazel", "Jolene", "Gabe", "Elvis", "Clifford", "Morris", "Landon", "Jim", "Cate", "George", "Chris", "Cora" ], "edges": [ [ 0, 7 ], [ 0, 8 ], [ 0, 2 ], [ 1, 9 ], [ 2, 4 ], [ 2, 5 ], [ 3, 6 ], [ 4, 3 ], [ 5, 1 ], [ 10, 17 ], [ 10, 18 ], [ 10, 12 ], [ 11, 19 ], [ 12, 14 ], [ 12, 15 ], [ 13, 16 ], [ 14, 13 ], [ 15, 11 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Dolores knows Walter. Theodore knows Crystal. Yvette knows Verna. Dolores knows Daisy. Hope knows Theodore. Tessa knows Carson. Theodore knows Dolores. Helene knows Willis. Carson knows Gary. Yvette knows Jesse. Tessa knows Cassidy. Randall knows Deborah. Carson knows Jill. Jem knows Tessa. Dolores knows Randall. Carson knows Yvette. Jesse knows Hannah. Randall knows Helene. Which of Yvette and Randall can Jem reach?", "answer": "Yvette", "steps": [ "Jem knows Tessa.", "Tessa knows Carson.", "Carson knows Yvette." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Jem", "Jesse", "Jill", "Hannah", "Tessa", "Carson", "Verna", "Gary", "Cassidy", "Yvette", "Hope", "Helene", "Walter", "Willis", "Theodore", "Dolores", "Deborah", "Daisy", "Crystal", "Randall" ], "edges": [ [ 0, 4 ], [ 1, 3 ], [ 4, 8 ], [ 4, 5 ], [ 5, 2 ], [ 5, 7 ], [ 5, 9 ], [ 9, 1 ], [ 9, 6 ], [ 10, 14 ], [ 11, 13 ], [ 14, 18 ], [ 14, 15 ], [ 15, 12 ], [ 15, 17 ], [ 15, 19 ], [ 19, 11 ], [ 19, 16 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Fisher knows Val. Bernice knows Yasmin. Jared knows Keith. Terry knows Ford. Kaleb knows Fisher. Rebecca knows Elvira. Maya knows Natalie. Maya knows Javier. Elvira knows Celeste. Javier knows Kaleb. Celeste knows Bernice. Ford knows Jared. Val knows Latoya. Celeste knows Allan. Julia knows Blaine. Javier knows Everett. Blaine knows Maya. Bernice knows Terry. Which of Keith and Latoya can Julia reach?", "answer": "Latoya", "steps": [ "Julia knows Blaine.", "Blaine knows Maya.", "Maya knows Javier.", "Javier knows Kaleb.", "Kaleb knows Fisher.", "Fisher knows Val.", "Val knows Latoya." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Julia", "Latoya", "Fisher", "Javier", "Natalie", "Everett", "Blaine", "Val", "Maya", "Kaleb", "Rebecca", "Keith", "Ford", "Bernice", "Allan", "Yasmin", "Elvira", "Jared", "Celeste", "Terry" ], "edges": [ [ 0, 6 ], [ 2, 7 ], [ 3, 5 ], [ 3, 9 ], [ 6, 8 ], [ 7, 1 ], [ 8, 4 ], [ 8, 3 ], [ 9, 2 ], [ 10, 16 ], [ 12, 17 ], [ 13, 15 ], [ 13, 19 ], [ 16, 18 ], [ 17, 11 ], [ 18, 14 ], [ 18, 13 ], [ 19, 12 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Garrison knows Fleur. Uma knows Bryan. Jerry knows Caroline. Clyde knows Cody. Otto knows Florence. Clyde knows Darcy. Francesca knows Lauren. Florence knows Jillian. Otto knows Jerry. Douglas knows Francesca. Douglas knows Corey. Clyde knows Sara. Sara knows Elena. Cody knows Garrison. Darcy knows Barry. Otto knows Douglas. Darcy knows Uma. Caroline knows Inez. Which of Jerry and Cody can Otto reach?", "answer": "Jerry", "steps": [ "Otto knows Jerry." ], "difficulty": 1, "original_distance": 3, "idx_to_symbol": [ "Otto", "Corey", "Jerry", "Jillian", "Lauren", "Inez", "Douglas", "Florence", "Francesca", "Caroline", "Clyde", "Barry", "Cody", "Elena", "Bryan", "Fleur", "Darcy", "Sara", "Uma", "Garrison" ], "edges": [ [ 0, 7 ], [ 0, 6 ], [ 0, 2 ], [ 2, 9 ], [ 6, 1 ], [ 6, 8 ], [ 7, 3 ], [ 8, 4 ], [ 9, 5 ], [ 10, 17 ], [ 10, 16 ], [ 10, 12 ], [ 12, 19 ], [ 16, 11 ], [ 16, 18 ], [ 17, 13 ], [ 18, 14 ], [ 19, 15 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Delia knows Ainsley. Cora knows Lucy. Tony knows Delia. Georgia knows Alyson. Sandy knows Joyce. Elise knows Fritz. Casey knows Terry. Cecilia knows Kendra. Alyson knows Sandy. Cora knows Cecilia. Sandy knows Cora. Tony knows Elliot. Fritz knows Tony. Ainsley knows Dolores. Tony knows Felicia. Sandy knows Casey. Delia knows Ingrid. Felicia knows Chloe. Which of Tony and Sandy can Georgia reach?", "answer": "Sandy", "steps": [ "Georgia knows Alyson.", "Alyson knows Sandy." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Georgia", "Cecilia", "Joyce", "Cora", "Kendra", "Sandy", "Alyson", "Lucy", "Casey", "Terry", "Elise", "Ainsley", "Elliot", "Delia", "Dolores", "Tony", "Fritz", "Ingrid", "Felicia", "Chloe" ], "edges": [ [ 0, 6 ], [ 1, 4 ], [ 3, 1 ], [ 3, 7 ], [ 5, 2 ], [ 5, 3 ], [ 5, 8 ], [ 6, 5 ], [ 8, 9 ], [ 10, 16 ], [ 11, 14 ], [ 13, 11 ], [ 13, 17 ], [ 15, 12 ], [ 15, 13 ], [ 15, 18 ], [ 16, 15 ], [ 18, 19 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Frida knows Kristina. Virginia knows Frida. Fergus knows Hudson. Lena knows Brock. Kristin knows Ralph. Jocelyn knows Kai. Jeremy knows Jocelyn. Kristina knows Alfonso. Harper knows Jillian. Jackson knows Kristin. Hudson knows Harper. Bryan knows Jeremy. Jeremy knows Sue. Kai knows Fergus. Kristin knows Lena. Ralph knows Virginia. Alfonso knows Brian. Sue knows Frank. Which of Harper and Alfonso can Bryan reach?", "answer": "Harper", "steps": [ "Bryan knows Jeremy.", "Jeremy knows Jocelyn.", "Jocelyn knows Kai.", "Kai knows Fergus.", "Fergus knows Hudson.", "Hudson knows Harper." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Bryan", "Sue", "Jillian", "Harper", "Jocelyn", "Fergus", "Frank", "Hudson", "Jeremy", "Kai", "Jackson", "Lena", "Brian", "Alfonso", "Ralph", "Frida", "Brock", "Kristina", "Kristin", "Virginia" ], "edges": [ [ 0, 8 ], [ 1, 6 ], [ 3, 2 ], [ 4, 9 ], [ 5, 7 ], [ 7, 3 ], [ 8, 1 ], [ 8, 4 ], [ 9, 5 ], [ 10, 18 ], [ 11, 16 ], [ 13, 12 ], [ 14, 19 ], [ 15, 17 ], [ 17, 13 ], [ 18, 11 ], [ 18, 14 ], [ 19, 15 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Marilyn knows Jewel. Aisha knows Martha. Kirsten knows Federico. Lois knows Everett. Winifred knows Sandra. Everett knows Ruby. Miranda knows Winifred. Alvin knows Patrick. Winifred knows Dave. Gwen knows Brett. Martha knows Gwen. Carrie knows Alvin. Julius knows Lois. Brett knows Marilyn. Dave knows Aisha. Lois knows Frances. Ruby knows Carrie. Patrick knows Kirsten. Which of Winifred and Lois can Julius reach?", "answer": "Lois", "steps": [ "Julius knows Lois." ], "difficulty": 1, "original_distance": 8, "idx_to_symbol": [ "Julius", "Carrie", "Kirsten", "Federico", "Ruby", "Everett", "Patrick", "Alvin", "Frances", "Lois", "Miranda", "Martha", "Marilyn", "Jewel", "Aisha", "Dave", "Brett", "Gwen", "Sandra", "Winifred" ], "edges": [ [ 0, 9 ], [ 1, 7 ], [ 2, 3 ], [ 4, 1 ], [ 5, 4 ], [ 6, 2 ], [ 7, 6 ], [ 9, 5 ], [ 9, 8 ], [ 10, 19 ], [ 11, 17 ], [ 12, 13 ], [ 14, 11 ], [ 15, 14 ], [ 16, 12 ], [ 17, 16 ], [ 19, 15 ], [ 19, 18 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Lily knows Effie. Kylie knows Geoffrey. Denver knows Kelsey. Ariana knows Nolan. Jane knows Max. Alicia knows Erma. Max knows Kylie. Effie knows Liam. Lauren knows Devin. Ivy knows Alicia. Denver knows Jane. Shane knows Lauren. Nolan knows Ivy. Clark knows Carson. Effie knows Ariana. Devin knows Denver. Geoffrey knows Marian. Carson knows Lily. Which of Jane and Ariana can Clark reach?", "answer": "Ariana", "steps": [ "Clark knows Carson.", "Carson knows Lily.", "Lily knows Effie.", "Effie knows Ariana." ], "difficulty": 4, "original_distance": 8, "idx_to_symbol": [ "Clark", "Lily", "Erma", "Alicia", "Ivy", "Ariana", "Effie", "Nolan", "Carson", "Liam", "Shane", "Devin", "Marian", "Geoffrey", "Kylie", "Jane", "Denver", "Max", "Lauren", "Kelsey" ], "edges": [ [ 0, 8 ], [ 1, 6 ], [ 3, 2 ], [ 4, 3 ], [ 5, 7 ], [ 6, 5 ], [ 6, 9 ], [ 7, 4 ], [ 8, 1 ], [ 10, 18 ], [ 11, 16 ], [ 13, 12 ], [ 14, 13 ], [ 15, 17 ], [ 16, 15 ], [ 16, 19 ], [ 17, 14 ], [ 18, 11 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Harris knows Ainsley. Franklin knows Raquel. Brian knows Daniella. Larissa knows Milo. Landon knows Susan. Willis knows Charlene. Charlene knows Graham. Clayton knows Brian. Harris knows Hector. Clayton knows Larissa. Hector knows Gwen. Graham knows Bennett. Ainsley knows Freya. Charlene knows Franklin. Gwen knows Clayton. Landon knows Lisette. Lisette knows Lorraine. Susan knows Willis. Which of Willis and Gwen can Harris reach?", "answer": "Gwen", "steps": [ "Harris knows Hector.", "Hector knows Gwen." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Harris", "Brian", "Milo", "Freya", "Daniella", "Hector", "Clayton", "Ainsley", "Larissa", "Gwen", "Landon", "Franklin", "Bennett", "Lorraine", "Raquel", "Susan", "Charlene", "Lisette", "Graham", "Willis" ], "edges": [ [ 0, 7 ], [ 0, 5 ], [ 1, 4 ], [ 5, 9 ], [ 6, 1 ], [ 6, 8 ], [ 7, 3 ], [ 8, 2 ], [ 9, 6 ], [ 10, 17 ], [ 10, 15 ], [ 11, 14 ], [ 15, 19 ], [ 16, 11 ], [ 16, 18 ], [ 17, 13 ], [ 18, 12 ], [ 19, 16 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Donovan knows Neil. Lennox knows Hayley. Dylan knows Guy. Barney knows Nora. Tonya knows Kai. Kai knows Ray. Hank knows Lennox. Dylan knows Donovan. Kai knows Emily. Dylan knows Milo. Lennox knows Carter. Nora knows Tonya. Jocelyn knows Barney. Jocelyn knows Sydney. Jocelyn knows Louis. Curtis knows Hank. Guy knows Curtis. Louis knows Barry. Which of Hank and Tonya can Jocelyn reach?", "answer": "Tonya", "steps": [ "Jocelyn knows Barney.", "Barney knows Nora.", "Nora knows Tonya." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Jocelyn", "Emily", "Kai", "Barry", "Barney", "Tonya", "Sydney", "Nora", "Ray", "Louis", "Dylan", "Carter", "Lennox", "Neil", "Guy", "Hank", "Milo", "Curtis", "Hayley", "Donovan" ], "edges": [ [ 0, 6 ], [ 0, 4 ], [ 0, 9 ], [ 2, 1 ], [ 2, 8 ], [ 4, 7 ], [ 5, 2 ], [ 7, 5 ], [ 9, 3 ], [ 10, 16 ], [ 10, 14 ], [ 10, 19 ], [ 12, 11 ], [ 12, 18 ], [ 14, 17 ], [ 15, 12 ], [ 17, 15 ], [ 19, 13 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Jermaine knows Aurora. Ann knows Gina. Monica knows Ruby. Ann knows Maude. Saul knows Monica. Ruby knows Yolanda. Amelia knows Jules. Eleanor knows Ann. Levi knows Veronica. Eleanor knows Archie. Jules knows Cesar. Jermaine knows Amelia. Yolanda knows Lars. Yolanda knows Kenzie. Lars knows Levi. Monica knows Eugenia. Maude knows Jermaine. Saul knows Lewis. Which of Monica and Ann can Saul reach?", "answer": "Monica", "steps": [ "Saul knows Monica." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Saul", "Veronica", "Monica", "Kenzie", "Eugenia", "Lewis", "Levi", "Lars", "Ruby", "Yolanda", "Eleanor", "Cesar", "Ann", "Aurora", "Gina", "Archie", "Jules", "Amelia", "Maude", "Jermaine" ], "edges": [ [ 0, 5 ], [ 0, 2 ], [ 2, 4 ], [ 2, 8 ], [ 6, 1 ], [ 7, 6 ], [ 8, 9 ], [ 9, 3 ], [ 9, 7 ], [ 10, 15 ], [ 10, 12 ], [ 12, 14 ], [ 12, 18 ], [ 16, 11 ], [ 17, 16 ], [ 18, 19 ], [ 19, 13 ], [ 19, 17 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Kira knows Tina. Curtis knows Hugo. Sybil knows Patricia. Denise knows Fleur. Rita knows Keith. Keith knows Dawn. Rita knows Erma. Joyce knows Marion. Sybil knows Rita. Joyce knows Billy. Fleur knows Kira. Spencer knows Demetrius. Billy knows Yolanda. Alex knows Carter. Curtis knows Sybil. Hugo knows Alex. Denise knows Spencer. Spencer knows Joyce. Which of Yolanda and Dawn can Denise reach?", "answer": "Yolanda", "steps": [ "Denise knows Spencer.", "Spencer knows Joyce.", "Joyce knows Billy.", "Billy knows Yolanda." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Denise", "Fleur", "Marion", "Billy", "Tina", "Joyce", "Kira", "Yolanda", "Demetrius", "Spencer", "Curtis", "Hugo", "Erma", "Keith", "Carter", "Rita", "Alex", "Dawn", "Patricia", "Sybil" ], "edges": [ [ 0, 1 ], [ 0, 9 ], [ 1, 6 ], [ 3, 7 ], [ 5, 2 ], [ 5, 3 ], [ 6, 4 ], [ 9, 5 ], [ 9, 8 ], [ 10, 11 ], [ 10, 19 ], [ 11, 16 ], [ 13, 17 ], [ 15, 12 ], [ 15, 13 ], [ 16, 14 ], [ 19, 15 ], [ 19, 18 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Sadie knows Darla. Frances knows Sadie. Hayes knows Ruby. Mike knows Hayes. Gina knows Mike. Valerie knows Kylie. Colin knows Valerie. Frances knows Iris. Valerie knows Donald. Charlotte knows Callum. Hayes knows Frances. Phoebe knows Gina. Donald knows Olive. Iris knows Isiah. Riley knows Colin. Walt knows Riley. Donald knows Charlotte. Olive knows Ramon. Which of Isiah and Callum can Phoebe reach?", "answer": "Isiah", "steps": [ "Phoebe knows Gina.", "Gina knows Mike.", "Mike knows Hayes.", "Hayes knows Frances.", "Frances knows Iris.", "Iris knows Isiah." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Phoebe", "Ruby", "Isiah", "Darla", "Mike", "Gina", "Sadie", "Iris", "Hayes", "Frances", "Walt", "Kylie", "Callum", "Ramon", "Colin", "Riley", "Olive", "Charlotte", "Valerie", "Donald" ], "edges": [ [ 0, 5 ], [ 4, 8 ], [ 5, 4 ], [ 6, 3 ], [ 7, 2 ], [ 8, 1 ], [ 8, 9 ], [ 9, 6 ], [ 9, 7 ], [ 10, 15 ], [ 14, 18 ], [ 15, 14 ], [ 16, 13 ], [ 17, 12 ], [ 18, 11 ], [ 18, 19 ], [ 19, 16 ], [ 19, 17 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Laura knows Sybil. Esperanza knows Deanna. Tonya knows Irving. Esperanza knows Keith. Jana knows Roland. Hayden knows Esperanza. Hampton knows Lily. Hampton knows Laura. Keith knows Tonya. Dante knows Hampton. Dante knows Jaime. Winifred knows Dante. Deanna knows Anton. Keith knows Jana. Laura knows Darius. Jaime knows Brent. Lily knows Eldon. Jana knows Zachary. Which of Dante and Esperanza can Winifred reach?", "answer": "Dante", "steps": [ "Winifred knows Dante." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Winifred", "Laura", "Lily", "Hampton", "Darius", "Brent", "Sybil", "Jaime", "Dante", "Eldon", "Hayden", "Jana", "Tonya", "Keith", "Zachary", "Anton", "Roland", "Deanna", "Esperanza", "Irving" ], "edges": [ [ 0, 8 ], [ 1, 4 ], [ 1, 6 ], [ 2, 9 ], [ 3, 1 ], [ 3, 2 ], [ 7, 5 ], [ 8, 7 ], [ 8, 3 ], [ 10, 18 ], [ 11, 14 ], [ 11, 16 ], [ 12, 19 ], [ 13, 11 ], [ 13, 12 ], [ 17, 15 ], [ 18, 17 ], [ 18, 13 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Whitney knows Veronica. Landon knows Whitney. Wayne knows Lena. Landon knows Victor. Eileen knows Landon. Eileen knows Richard. Landon knows Maggie. Cecilia knows Angelica. Omar knows Haven. Wayne knows Cecilia. Kevin knows Will. Wayne knows Kobe. Kobe knows Florence. Maggie knows Pat. Lena knows Randy. Omar knows Wayne. Landon knows Kevin. Wayne knows Rita. Which of Wayne and Landon can Eileen reach?", "answer": "Landon", "steps": [ "Eileen knows Landon." ], "difficulty": 1, "original_distance": 3, "idx_to_symbol": [ "Eileen", "Victor", "Pat", "Richard", "Veronica", "Maggie", "Landon", "Whitney", "Kevin", "Will", "Omar", "Rita", "Angelica", "Haven", "Florence", "Cecilia", "Wayne", "Kobe", "Lena", "Randy" ], "edges": [ [ 0, 3 ], [ 0, 6 ], [ 5, 2 ], [ 6, 1 ], [ 6, 5 ], [ 6, 7 ], [ 6, 8 ], [ 7, 4 ], [ 8, 9 ], [ 10, 13 ], [ 10, 16 ], [ 15, 12 ], [ 16, 11 ], [ 16, 15 ], [ 16, 17 ], [ 16, 18 ], [ 17, 14 ], [ 18, 19 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Carol knows Duncan. Ilene knows Federico. Harper knows Elvira. Emily knows Cody. Myra knows Jenna. Jenna knows Ilene. Emily knows Aldo. Duncan knows Ruth. Kingsley knows Carol. Cody knows Kingsley. Emily knows Josie. Harper knows Myra. Jenna knows Edna. Carmela knows Graham. Carol knows Foster. Carmela knows Harper. Carmela knows Carlos. Cody knows Horace. Which of Ruth and Federico can Emily reach?", "answer": "Ruth", "steps": [ "Emily knows Cody.", "Cody knows Kingsley.", "Kingsley knows Carol.", "Carol knows Duncan.", "Duncan knows Ruth." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Emily", "Josie", "Cody", "Carol", "Aldo", "Kingsley", "Horace", "Foster", "Duncan", "Ruth", "Carmela", "Graham", "Harper", "Jenna", "Carlos", "Myra", "Elvira", "Edna", "Ilene", "Federico" ], "edges": [ [ 0, 1 ], [ 0, 4 ], [ 0, 2 ], [ 2, 6 ], [ 2, 5 ], [ 3, 7 ], [ 3, 8 ], [ 5, 3 ], [ 8, 9 ], [ 10, 11 ], [ 10, 14 ], [ 10, 12 ], [ 12, 16 ], [ 12, 15 ], [ 13, 17 ], [ 13, 18 ], [ 15, 13 ], [ 18, 19 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Susan knows Anton. Sidney knows Cesar. Lane knows Fraser. Susan knows Curtis. Conner knows Susan. Lane knows Ava. Hampton knows Destiny. Hampton knows Conner. Jordan knows Sidney. Lane knows Lara. Susan knows Magdalena. Jordan knows Lane. Barry knows Noel. Lewis knows Jordan. Conner knows Barry. Lane knows Daphna. Susan knows Jeff. Lewis knows Frida. Which of Susan and Lane can Lewis reach?", "answer": "Lane", "steps": [ "Lewis knows Jordan.", "Jordan knows Lane." ], "difficulty": 2, "original_distance": 3, "idx_to_symbol": [ "Lewis", "Sidney", "Daphna", "Lane", "Frida", "Cesar", "Jordan", "Fraser", "Lara", "Ava", "Hampton", "Barry", "Anton", "Susan", "Destiny", "Noel", "Conner", "Jeff", "Magdalena", "Curtis" ], "edges": [ [ 0, 4 ], [ 0, 6 ], [ 1, 5 ], [ 3, 2 ], [ 3, 7 ], [ 3, 8 ], [ 3, 9 ], [ 6, 1 ], [ 6, 3 ], [ 10, 14 ], [ 10, 16 ], [ 11, 15 ], [ 13, 12 ], [ 13, 17 ], [ 13, 18 ], [ 13, 19 ], [ 16, 11 ], [ 16, 13 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Joanna knows Earle. Rhonda knows Katherine. Greta knows Rhonda. Jean knows Judy. Katherine knows Daniel. Francesca knows Greta. Daniel knows Scott. Daniel knows Yvonne. Kay knows Joanna. Jack knows Cesar. Yvonne knows Janice. Judy knows Emanuel. Earle knows Cain. Judy knows Axel. Cain knows Tonya. Cesar knows Francesca. Tonya knows Jean. Emanuel knows Ariana. Which of Emanuel and Yvonne can Jack reach?", "answer": "Yvonne", "steps": [ "Jack knows Cesar.", "Cesar knows Francesca.", "Francesca knows Greta.", "Greta knows Rhonda.", "Rhonda knows Katherine.", "Katherine knows Daniel.", "Daniel knows Yvonne." ], "difficulty": 7, "original_distance": 8, "idx_to_symbol": [ "Jack", "Greta", "Cesar", "Scott", "Katherine", "Yvonne", "Janice", "Daniel", "Francesca", "Rhonda", "Kay", "Cain", "Joanna", "Axel", "Jean", "Emanuel", "Ariana", "Judy", "Earle", "Tonya" ], "edges": [ [ 0, 2 ], [ 1, 9 ], [ 2, 8 ], [ 4, 7 ], [ 5, 6 ], [ 7, 3 ], [ 7, 5 ], [ 8, 1 ], [ 9, 4 ], [ 10, 12 ], [ 11, 19 ], [ 12, 18 ], [ 14, 17 ], [ 15, 16 ], [ 17, 13 ], [ 17, 15 ], [ 18, 11 ], [ 19, 14 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Alex knows Elvis. Leigh knows Jeff. Wayne knows Erma. Sidney knows Connor. Earl knows Ira. Alfred knows Catherine. Lorna knows Earl. Leigh knows Alfred. Boris knows Jenna. Wayne knows Martha. Catherine knows Boris. Erma knows Lorna. Jenna knows Vance. Catherine knows Mia. Lorna knows Anton. Lorna knows Carey. Carey knows Sidney. Catherine knows Alex. Which of Catherine and Lorna can Leigh reach?", "answer": "Catherine", "steps": [ "Leigh knows Alfred.", "Alfred knows Catherine." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Leigh", "Jenna", "Jeff", "Boris", "Vance", "Elvis", "Catherine", "Alex", "Alfred", "Mia", "Wayne", "Sidney", "Martha", "Carey", "Connor", "Ira", "Lorna", "Earl", "Erma", "Anton" ], "edges": [ [ 0, 2 ], [ 0, 8 ], [ 1, 4 ], [ 3, 1 ], [ 6, 3 ], [ 6, 7 ], [ 6, 9 ], [ 7, 5 ], [ 8, 6 ], [ 10, 12 ], [ 10, 18 ], [ 11, 14 ], [ 13, 11 ], [ 16, 13 ], [ 16, 17 ], [ 16, 19 ], [ 17, 15 ], [ 18, 16 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Latoya knows Mildred. Margaret knows Nicholas. Veronica knows Saul. Mildred knows Lisa. Kristin knows Eldon. Veronica knows Beverly. Lisa knows Ellis. Barbara knows Cody. Cameron knows Veronica. Aubrey knows Cameron. Ellis knows Cesar. Cesar knows Alison. Nicholas knows Barbara. Cesar knows Betty. Barbara knows Clay. Eldon knows Latoya. Latoya knows Julio. Beverly knows Margaret. Which of Beverly and Mildred can Aubrey reach?", "answer": "Beverly", "steps": [ "Aubrey knows Cameron.", "Cameron knows Veronica.", "Veronica knows Beverly." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Aubrey", "Veronica", "Nicholas", "Barbara", "Margaret", "Cameron", "Saul", "Clay", "Beverly", "Cody", "Kristin", "Latoya", "Ellis", "Cesar", "Lisa", "Eldon", "Julio", "Alison", "Mildred", "Betty" ], "edges": [ [ 0, 5 ], [ 1, 6 ], [ 1, 8 ], [ 2, 3 ], [ 3, 7 ], [ 3, 9 ], [ 4, 2 ], [ 5, 1 ], [ 8, 4 ], [ 10, 15 ], [ 11, 16 ], [ 11, 18 ], [ 12, 13 ], [ 13, 17 ], [ 13, 19 ], [ 14, 12 ], [ 15, 11 ], [ 18, 14 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Gage knows Zara. Virgil knows Billy. Trudy knows Rebecca. Shannon knows Kimberly. Zara knows Lois. Chandler knows Kirk. Jessie knows Lydia. Jessie knows Doris. Shannon knows Chandler. Doris knows Tristan. Ruth knows Arthur. Ruth knows Ingrid. Shannon knows Trudy. Jessie knows Ruth. Billy knows Atlas. Trudy knows Virgil. Ingrid knows Gage. Atlas knows Judith. Which of Billy and Gage can Jessie reach?", "answer": "Gage", "steps": [ "Jessie knows Ruth.", "Ruth knows Ingrid.", "Ingrid knows Gage." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Jessie", "Lydia", "Zara", "Doris", "Gage", "Arthur", "Ingrid", "Ruth", "Tristan", "Lois", "Shannon", "Kimberly", "Atlas", "Chandler", "Billy", "Rebecca", "Virgil", "Trudy", "Kirk", "Judith" ], "edges": [ [ 0, 1 ], [ 0, 3 ], [ 0, 7 ], [ 2, 9 ], [ 3, 8 ], [ 4, 2 ], [ 6, 4 ], [ 7, 5 ], [ 7, 6 ], [ 10, 11 ], [ 10, 13 ], [ 10, 17 ], [ 12, 19 ], [ 13, 18 ], [ 14, 12 ], [ 16, 14 ], [ 17, 15 ], [ 17, 16 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Cassidy knows Jack. Ida knows Kay. Sybil knows Cassidy. Humphrey knows Ida. Ida knows Paige. Hubert knows Jeffery. Ernie knows Francesca. Chad knows Ilene. Kay knows Gideon. Kay knows Knox. Humphrey knows Destiny. Cassidy knows Chad. Humphrey knows Hubert. Sybil knows Kingsley. Gideon knows Arden. Phoebe knows Kenneth. Ernie knows Phoebe. Ernie knows Sybil. Which of Ilene and Arden can Humphrey reach?", "answer": "Arden", "steps": [ "Humphrey knows Ida.", "Ida knows Kay.", "Kay knows Gideon.", "Gideon knows Arden." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Humphrey", "Arden", "Ida", "Hubert", "Gideon", "Destiny", "Kay", "Jeffery", "Knox", "Paige", "Ernie", "Ilene", "Sybil", "Phoebe", "Chad", "Francesca", "Cassidy", "Kenneth", "Jack", "Kingsley" ], "edges": [ [ 0, 5 ], [ 0, 3 ], [ 0, 2 ], [ 2, 6 ], [ 2, 9 ], [ 3, 7 ], [ 4, 1 ], [ 6, 4 ], [ 6, 8 ], [ 10, 15 ], [ 10, 13 ], [ 10, 12 ], [ 12, 16 ], [ 12, 19 ], [ 13, 17 ], [ 14, 11 ], [ 16, 14 ], [ 16, 18 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Enrique knows Earle. Houston knows Nina. Winston knows Mae. Enrique knows Carter. Earle knows Jessie. Earle knows Houston. Maya knows Cesar. Earle knows Janice. Alfred knows Winston. Zach knows Alfred. Alfred knows Carlos. Max knows Arturo. Carlos knows Max. Jessie knows Jeffery. Janice knows Archer. Nina knows Olivia. Alfred knows Maya. Zach knows Rose. Which of Alfred and Earle can Enrique reach?", "answer": "Earle", "steps": [ "Enrique knows Earle." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Enrique", "Carter", "Houston", "Olivia", "Archer", "Earle", "Jeffery", "Nina", "Jessie", "Janice", "Zach", "Rose", "Carlos", "Arturo", "Mae", "Alfred", "Cesar", "Max", "Maya", "Winston" ], "edges": [ [ 0, 1 ], [ 0, 5 ], [ 2, 7 ], [ 5, 2 ], [ 5, 8 ], [ 5, 9 ], [ 7, 3 ], [ 8, 6 ], [ 9, 4 ], [ 10, 11 ], [ 10, 15 ], [ 12, 17 ], [ 15, 12 ], [ 15, 18 ], [ 15, 19 ], [ 17, 13 ], [ 18, 16 ], [ 19, 14 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Justine knows Karen. Justine knows Imogen. Ezra knows Dante. Karen knows Odette. Dave knows Ezra. Justine knows Gemma. Whitney knows Lois. Daniel knows Justine. Karen knows Dave. Ricardo knows Courtney. Courtney knows Gerard. Whitney knows Opal. Opal knows Tanya. Camden knows Ricardo. Whitney knows Camden. Gemma knows Leland. Camden knows Travis. Natalie knows Whitney. Which of Whitney and Justine can Daniel reach?", "answer": "Justine", "steps": [ "Daniel knows Justine." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Daniel", "Dante", "Imogen", "Ezra", "Leland", "Karen", "Justine", "Odette", "Gemma", "Dave", "Natalie", "Gerard", "Lois", "Courtney", "Tanya", "Camden", "Whitney", "Travis", "Opal", "Ricardo" ], "edges": [ [ 0, 6 ], [ 3, 1 ], [ 5, 7 ], [ 5, 9 ], [ 6, 2 ], [ 6, 8 ], [ 6, 5 ], [ 8, 4 ], [ 9, 3 ], [ 10, 16 ], [ 13, 11 ], [ 15, 17 ], [ 15, 19 ], [ 16, 12 ], [ 16, 18 ], [ 16, 15 ], [ 18, 14 ], [ 19, 13 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Perry knows Thea. Garland knows Hayley. Cruz knows Cyrus. Lawrence knows Cliff. Stacy knows Garland. Jameson knows Dewey. Thea knows Ava. Vera knows Dallas. Michelle knows Cruz. Corey knows Xander. Michelle knows Vera. Thea knows Merle. Ava knows Michelle. Dewey knows Lawrence. Elijah knows Perry. Asher knows Stacy. Dewey knows Corey. Garland knows Jameson. Which of Cliff and Cyrus can Elijah reach?", "answer": "Cyrus", "steps": [ "Elijah knows Perry.", "Perry knows Thea.", "Thea knows Ava.", "Ava knows Michelle.", "Michelle knows Cruz.", "Cruz knows Cyrus." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Elijah", "Dallas", "Michelle", "Ava", "Perry", "Cyrus", "Thea", "Merle", "Vera", "Cruz", "Asher", "Xander", "Dewey", "Jameson", "Stacy", "Cliff", "Garland", "Hayley", "Corey", "Lawrence" ], "edges": [ [ 0, 4 ], [ 2, 8 ], [ 2, 9 ], [ 3, 2 ], [ 4, 6 ], [ 6, 7 ], [ 6, 3 ], [ 8, 1 ], [ 9, 5 ], [ 10, 14 ], [ 12, 18 ], [ 12, 19 ], [ 13, 12 ], [ 14, 16 ], [ 16, 17 ], [ 16, 13 ], [ 18, 11 ], [ 19, 15 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Joshua knows Lamont. Harry knows Camden. Joshua knows Harris. Casey knows Lee. Darnell knows Virginia. Darnell knows Nolan. Joshua knows Willard. Joshua knows Corey. Virginia knows Ada. Willard knows Ava. Blake knows Cesar. Casey knows Harry. Ada knows Blake. Blake knows Kristin. Ava knows Casey. Darnell knows Cordelia. Kristin knows Steve. Darnell knows Patricia. Which of Kristin and Harry can Darnell reach?", "answer": "Kristin", "steps": [ "Darnell knows Virginia.", "Virginia knows Ada.", "Ada knows Blake.", "Blake knows Kristin." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Darnell", "Kristin", "Cordelia", "Blake", "Steve", "Cesar", "Nolan", "Ada", "Virginia", "Patricia", "Joshua", "Harry", "Harris", "Casey", "Camden", "Lee", "Lamont", "Ava", "Willard", "Corey" ], "edges": [ [ 0, 2 ], [ 0, 6 ], [ 0, 8 ], [ 0, 9 ], [ 1, 4 ], [ 3, 1 ], [ 3, 5 ], [ 7, 3 ], [ 8, 7 ], [ 10, 12 ], [ 10, 16 ], [ 10, 18 ], [ 10, 19 ], [ 11, 14 ], [ 13, 11 ], [ 13, 15 ], [ 17, 13 ], [ 18, 17 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Asher knows Ramon. Aspen knows Ted. Raquel knows Kirk. Theodore knows Dudley. Dudley knows Raquel. Dexter knows Madeline. Dexter knows Camden. Asher knows Dexter. Ainsley knows Tara. Ted knows Adele. Gina knows Cordelia. Cordelia knows Ainsley. Wallace knows Aspen. Raquel knows Alyssa. Ramon knows Gina. August knows Wallace. Dudley knows August. Hubert knows Asher. Which of Aspen and Cordelia can Theodore reach?", "answer": "Aspen", "steps": [ "Theodore knows Dudley.", "Dudley knows August.", "August knows Wallace.", "Wallace knows Aspen." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Theodore", "Wallace", "Aspen", "Ted", "Dudley", "Adele", "Raquel", "Kirk", "August", "Alyssa", "Hubert", "Gina", "Cordelia", "Ainsley", "Asher", "Tara", "Dexter", "Madeline", "Ramon", "Camden" ], "edges": [ [ 0, 4 ], [ 1, 2 ], [ 2, 3 ], [ 3, 5 ], [ 4, 8 ], [ 4, 6 ], [ 6, 7 ], [ 6, 9 ], [ 8, 1 ], [ 10, 14 ], [ 11, 12 ], [ 12, 13 ], [ 13, 15 ], [ 14, 18 ], [ 14, 16 ], [ 16, 17 ], [ 16, 19 ], [ 18, 11 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Mason knows Jewel. Judy knows Geoffrey. Selena knows Hudson. Jewel knows Saul. Estelle knows Dakota. Judy knows Selena. Joel knows Mason. Judy knows Greer. Jewel knows Belinda. Dean knows Christian. Estelle knows Doris. Blanche knows Dean. Greer knows Jonathan. Jewel knows Estelle. Mason knows Vicki. Selena knows Ethan. Dean knows Judy. Saul knows Gabe. Which of Gabe and Jonathan can Blanche reach?", "answer": "Jonathan", "steps": [ "Blanche knows Dean.", "Dean knows Judy.", "Judy knows Greer.", "Greer knows Jonathan." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Blanche", "Greer", "Ethan", "Jonathan", "Dean", "Selena", "Hudson", "Christian", "Geoffrey", "Judy", "Joel", "Saul", "Doris", "Gabe", "Mason", "Estelle", "Dakota", "Vicki", "Belinda", "Jewel" ], "edges": [ [ 0, 4 ], [ 1, 3 ], [ 4, 7 ], [ 4, 9 ], [ 5, 2 ], [ 5, 6 ], [ 9, 1 ], [ 9, 5 ], [ 9, 8 ], [ 10, 14 ], [ 11, 13 ], [ 14, 17 ], [ 14, 19 ], [ 15, 12 ], [ 15, 16 ], [ 19, 11 ], [ 19, 15 ], [ 19, 18 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Teresa knows Brad. Hal knows Itzel. Roy knows Cain. Roy knows Todd. Teresa knows Beau. Beau knows Veronica. Beau knows Norman. Brad knows Owen. Aurora knows Terrence. Jerry knows Stephen. Brock knows Hal. Brock knows Allan. Chandler knows Elias. Aurora knows Roy. Allan knows Teresa. Terrence knows Lucas. Stephen knows Aurora. Jerry knows Chandler. Which of Todd and Norman can Jerry reach?", "answer": "Todd", "steps": [ "Jerry knows Stephen.", "Stephen knows Aurora.", "Aurora knows Roy.", "Roy knows Todd." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Jerry", "Cain", "Elias", "Roy", "Todd", "Terrence", "Stephen", "Aurora", "Chandler", "Lucas", "Brock", "Veronica", "Itzel", "Beau", "Norman", "Brad", "Allan", "Teresa", "Hal", "Owen" ], "edges": [ [ 0, 8 ], [ 0, 6 ], [ 3, 1 ], [ 3, 4 ], [ 5, 9 ], [ 6, 7 ], [ 7, 3 ], [ 7, 5 ], [ 8, 2 ], [ 10, 18 ], [ 10, 16 ], [ 13, 11 ], [ 13, 14 ], [ 15, 19 ], [ 16, 17 ], [ 17, 13 ], [ 17, 15 ], [ 18, 12 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Ember knows Marc. Marion knows Arturo. Gertrude knows Delia. Arturo knows Sebastian. Harper knows Chantal. Helene knows Hector. Hayden knows Gertrude. Harry knows Kevin. Donald knows Helene. Sue knows Donald. Kennedy knows Stephanie. Stephanie knows Hayden. Ember knows Harper. Marc knows Kennedy. Arturo knows Sue. Hector knows Harry. Sebastian knows Josie. Abby knows Ember. Which of Gertrude and Harry can Marion reach?", "answer": "Harry", "steps": [ "Marion knows Arturo.", "Arturo knows Sue.", "Sue knows Donald.", "Donald knows Helene.", "Helene knows Hector.", "Hector knows Harry." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Marion", "Helene", "Josie", "Harry", "Arturo", "Sue", "Hector", "Sebastian", "Kevin", "Donald", "Abby", "Stephanie", "Chantal", "Gertrude", "Ember", "Marc", "Hayden", "Harper", "Delia", "Kennedy" ], "edges": [ [ 0, 4 ], [ 1, 6 ], [ 3, 8 ], [ 4, 7 ], [ 4, 5 ], [ 5, 9 ], [ 6, 3 ], [ 7, 2 ], [ 9, 1 ], [ 10, 14 ], [ 11, 16 ], [ 13, 18 ], [ 14, 17 ], [ 14, 15 ], [ 15, 19 ], [ 16, 13 ], [ 17, 12 ], [ 19, 11 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Lucy knows Vincent. Colby knows Jakob. Charity knows Colby. Leopold knows Lydia. Charity knows Houston. Lydia knows Byron. Randy knows Irving. August knows Annie. Vincent knows August. Annie knows Zoe. Zoe knows Eric. Kieran knows Charity. Houston knows Leopold. Tabitha knows Lucy. Eric knows Sharon. August knows Randy. Edward knows Tom. Tom knows Kieran. Which of Vincent and Kieran can Tabitha reach?", "answer": "Vincent", "steps": [ "Tabitha knows Lucy.", "Lucy knows Vincent." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Tabitha", "August", "Irving", "Lucy", "Randy", "Vincent", "Annie", "Sharon", "Zoe", "Eric", "Edward", "Charity", "Jakob", "Tom", "Colby", "Kieran", "Houston", "Byron", "Leopold", "Lydia" ], "edges": [ [ 0, 3 ], [ 1, 4 ], [ 1, 6 ], [ 3, 5 ], [ 4, 2 ], [ 5, 1 ], [ 6, 8 ], [ 8, 9 ], [ 9, 7 ], [ 10, 13 ], [ 11, 14 ], [ 11, 16 ], [ 13, 15 ], [ 14, 12 ], [ 15, 11 ], [ 16, 18 ], [ 18, 19 ], [ 19, 17 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Shane knows Molly. Tina knows Shane. Ilene knows Faith. Molly knows Palmer. Cody knows Paul. Ilene knows Eden. Claire knows Mitchell. Roland knows Chantal. Darrell knows Tina. Bert knows Chloe. Cody knows Bert. Eden knows Darrell. Jade knows Claire. Jade knows Martha. Mitchell knows Roland. Molly knows Annie. Chantal knows Cody. Palmer knows Estella. Which of Chloe and Estella can Jade reach?", "answer": "Chloe", "steps": [ "Jade knows Claire.", "Claire knows Mitchell.", "Mitchell knows Roland.", "Roland knows Chantal.", "Chantal knows Cody.", "Cody knows Bert.", "Bert knows Chloe." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Jade", "Claire", "Martha", "Mitchell", "Chloe", "Chantal", "Paul", "Bert", "Cody", "Roland", "Ilene", "Eden", "Faith", "Darrell", "Estella", "Shane", "Annie", "Palmer", "Molly", "Tina" ], "edges": [ [ 0, 2 ], [ 0, 1 ], [ 1, 3 ], [ 3, 9 ], [ 5, 8 ], [ 7, 4 ], [ 8, 6 ], [ 8, 7 ], [ 9, 5 ], [ 10, 12 ], [ 10, 11 ], [ 11, 13 ], [ 13, 19 ], [ 15, 18 ], [ 17, 14 ], [ 18, 16 ], [ 18, 17 ], [ 19, 15 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Will knows Colin. Vance knows Will. Colin knows Kristina. Casey knows Jewel. Sara knows Casey. Hubert knows Douglas. Will knows Ashton. Will knows Parker. Fanny knows Bennett. Fanny knows Elizabeth. Lennox knows Leon. Sara knows Laverne. Parker knows Fanny. Patricia knows Vance. Laverne knows Hubert. Hubert knows Porter. Sara knows Jerome. Leon knows Sara. Which of Hubert and Fanny can Patricia reach?", "answer": "Fanny", "steps": [ "Patricia knows Vance.", "Vance knows Will.", "Will knows Parker.", "Parker knows Fanny." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Patricia", "Vance", "Colin", "Ashton", "Fanny", "Parker", "Kristina", "Elizabeth", "Bennett", "Will", "Lennox", "Leon", "Casey", "Jerome", "Hubert", "Laverne", "Jewel", "Porter", "Douglas", "Sara" ], "edges": [ [ 0, 1 ], [ 1, 9 ], [ 2, 6 ], [ 4, 7 ], [ 4, 8 ], [ 5, 4 ], [ 9, 3 ], [ 9, 2 ], [ 9, 5 ], [ 10, 11 ], [ 11, 19 ], [ 12, 16 ], [ 14, 17 ], [ 14, 18 ], [ 15, 14 ], [ 19, 13 ], [ 19, 12 ], [ 19, 15 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Axel knows Clayton. Clayton knows Max. Clayton knows Wanda. Glenda knows Jackson. Faith knows Dorothy. Faith knows Colleen. Jackson knows Faith. Ivy knows Priscilla. Priscilla knows Elaine. Dana knows Amanda. Ivy knows Eleanor. Dana knows Geoffrey. Geoffrey knows Jennifer. Jennifer knows Madeline. Wanda knows Dana. Elaine knows Crystal. Benjamin knows Axel. Dorothy knows Ivy. Which of Madeline and Crystal can Glenda reach?", "answer": "Crystal", "steps": [ "Glenda knows Jackson.", "Jackson knows Faith.", "Faith knows Dorothy.", "Dorothy knows Ivy.", "Ivy knows Priscilla.", "Priscilla knows Elaine.", "Elaine knows Crystal." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Glenda", "Colleen", "Eleanor", "Ivy", "Elaine", "Dorothy", "Jackson", "Priscilla", "Faith", "Crystal", "Benjamin", "Max", "Amanda", "Dana", "Jennifer", "Wanda", "Axel", "Geoffrey", "Clayton", "Madeline" ], "edges": [ [ 0, 6 ], [ 3, 2 ], [ 3, 7 ], [ 4, 9 ], [ 5, 3 ], [ 6, 8 ], [ 7, 4 ], [ 8, 1 ], [ 8, 5 ], [ 10, 16 ], [ 13, 12 ], [ 13, 17 ], [ 14, 19 ], [ 15, 13 ], [ 16, 18 ], [ 17, 14 ], [ 18, 11 ], [ 18, 15 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Gareth knows Dee. Scott knows Magdalena. Gareth knows Forrest. Judith knows Diego. Teresa knows Monica. Monica knows Scott. Aaron knows Pierce. Aaron knows Allison. Diego knows Evelyn. Magdalena knows Darnell. Dee knows Ivy. Aaron knows Alison. Alison knows Christian. Evelyn knows Gonzalo. Gonzalo knows Fern. Gareth knows Jon. Fern knows Aaron. Darnell knows Gareth. Which of Gareth and Aaron can Teresa reach?", "answer": "Gareth", "steps": [ "Teresa knows Monica.", "Monica knows Scott.", "Scott knows Magdalena.", "Magdalena knows Darnell.", "Darnell knows Gareth." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Teresa", "Dee", "Jon", "Gareth", "Forrest", "Scott", "Ivy", "Darnell", "Magdalena", "Monica", "Judith", "Alison", "Allison", "Aaron", "Pierce", "Evelyn", "Christian", "Fern", "Gonzalo", "Diego" ], "edges": [ [ 0, 9 ], [ 1, 6 ], [ 3, 2 ], [ 3, 4 ], [ 3, 1 ], [ 5, 8 ], [ 7, 3 ], [ 8, 7 ], [ 9, 5 ], [ 10, 19 ], [ 11, 16 ], [ 13, 12 ], [ 13, 14 ], [ 13, 11 ], [ 15, 18 ], [ 17, 13 ], [ 18, 17 ], [ 19, 15 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Darin knows Asher. Stefan knows Geneva. Sandy knows Blanche. Asher knows Flora. Cliff knows Owen. Cliff knows Stefan. Brent knows Malik. Patrick knows Pauline. Flora knows Sandy. Cliff knows Autumn. Flora knows Vanessa. Stella knows Luz. Flora knows Jillian. Pauline knows Cliff. Stefan knows Destiny. Sandy knows Brent. Malik knows Anthony. Destiny knows Stella. Which of Pauline and Asher can Patrick reach?", "answer": "Pauline", "steps": [ "Patrick knows Pauline." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Patrick", "Luz", "Stefan", "Owen", "Cliff", "Pauline", "Stella", "Destiny", "Geneva", "Autumn", "Darin", "Anthony", "Sandy", "Vanessa", "Flora", "Asher", "Malik", "Brent", "Blanche", "Jillian" ], "edges": [ [ 0, 5 ], [ 2, 7 ], [ 2, 8 ], [ 4, 3 ], [ 4, 2 ], [ 4, 9 ], [ 5, 4 ], [ 6, 1 ], [ 7, 6 ], [ 10, 15 ], [ 12, 17 ], [ 12, 18 ], [ 14, 13 ], [ 14, 12 ], [ 14, 19 ], [ 15, 14 ], [ 16, 11 ], [ 17, 16 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Sandy knows Darin. Howard knows Boyd. Felicia knows Wilbur. Glenda knows Sandy. Boyd knows Nell. Audrey knows Mia. Wayne knows Howard. Howard knows Donna. Drake knows Earl. Felicia knows Goldie. Howard knows Jean. Nell knows Dexter. Felicia knows Elijah. Hannah knows Drake. Mia knows Glenda. Dexter knows Hannah. Farrah knows Felicia. Goldie knows Audrey. Which of Sandy and Drake can Farrah reach?", "answer": "Sandy", "steps": [ "Farrah knows Felicia.", "Felicia knows Goldie.", "Goldie knows Audrey.", "Audrey knows Mia.", "Mia knows Glenda.", "Glenda knows Sandy." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Farrah", "Darin", "Audrey", "Elijah", "Goldie", "Wilbur", "Glenda", "Sandy", "Felicia", "Mia", "Wayne", "Earl", "Nell", "Jean", "Boyd", "Donna", "Hannah", "Drake", "Howard", "Dexter" ], "edges": [ [ 0, 8 ], [ 2, 9 ], [ 4, 2 ], [ 6, 7 ], [ 7, 1 ], [ 8, 3 ], [ 8, 5 ], [ 8, 4 ], [ 9, 6 ], [ 10, 18 ], [ 12, 19 ], [ 14, 12 ], [ 16, 17 ], [ 17, 11 ], [ 18, 13 ], [ 18, 15 ], [ 18, 14 ], [ 19, 16 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Ramon knows Harmony. Jessie knows Ramon. Sierra knows Dell. Jessie knows Sierra. Grace knows Gladys. Jessie knows Alyson. Lamont knows Grace. Roland knows Phoebe. Craig knows Kay. Adelaide knows Michelle. Bert knows Lamont. Sierra knows Roland. Adelaide knows Greer. Dell knows Zach. Greer knows Shane. Phoebe knows Luna. Bert knows Craig. Adelaide knows Bert. Which of Lamont and Roland can Jessie reach?", "answer": "Roland", "steps": [ "Jessie knows Sierra.", "Sierra knows Roland." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Jessie", "Ramon", "Phoebe", "Zach", "Harmony", "Sierra", "Dell", "Luna", "Roland", "Alyson", "Adelaide", "Greer", "Grace", "Kay", "Shane", "Bert", "Craig", "Gladys", "Lamont", "Michelle" ], "edges": [ [ 0, 1 ], [ 0, 5 ], [ 0, 9 ], [ 1, 4 ], [ 2, 7 ], [ 5, 6 ], [ 5, 8 ], [ 6, 3 ], [ 8, 2 ], [ 10, 11 ], [ 10, 15 ], [ 10, 19 ], [ 11, 14 ], [ 12, 17 ], [ 15, 16 ], [ 15, 18 ], [ 16, 13 ], [ 18, 12 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Shane knows Molly. Tina knows Shane. Ilene knows Faith. Molly knows Palmer. Cody knows Paul. Ilene knows Eden. Claire knows Mitchell. Roland knows Chantal. Darrell knows Tina. Bert knows Chloe. Cody knows Bert. Eden knows Darrell. Jade knows Claire. Jade knows Martha. Mitchell knows Roland. Molly knows Annie. Chantal knows Cody. Palmer knows Estella. Which of Tina and Roland can Jade reach?", "answer": "Roland", "steps": [ "Jade knows Claire.", "Claire knows Mitchell.", "Mitchell knows Roland." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Jade", "Claire", "Martha", "Mitchell", "Chloe", "Chantal", "Paul", "Bert", "Cody", "Roland", "Ilene", "Eden", "Faith", "Darrell", "Estella", "Shane", "Annie", "Palmer", "Molly", "Tina" ], "edges": [ [ 0, 2 ], [ 0, 1 ], [ 1, 3 ], [ 3, 9 ], [ 5, 8 ], [ 7, 4 ], [ 8, 6 ], [ 8, 7 ], [ 9, 5 ], [ 10, 12 ], [ 10, 11 ], [ 11, 13 ], [ 13, 19 ], [ 15, 18 ], [ 17, 14 ], [ 18, 16 ], [ 18, 17 ], [ 19, 15 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "James knows Daisy. Duke knows Raquel. Griffith knows Hardy. Dakota knows Gordon. Keegan knows Lamont. Lamont knows Griffith. Teresa knows James. Dakota knows Vance. Leah knows Teresa. Alma knows Ramona. Ramona knows Duke. Ariel knows Keegan. Hardy knows Dakota. Adrian knows Ariel. Lamont knows Devin. James knows Alma. Trevor knows Leah. Duke knows Daniella. Which of Lamont and James can Trevor reach?", "answer": "James", "steps": [ "Trevor knows Leah.", "Leah knows Teresa.", "Teresa knows James." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Trevor", "Teresa", "Ramona", "Raquel", "Daisy", "James", "Alma", "Leah", "Duke", "Daniella", "Adrian", "Keegan", "Hardy", "Gordon", "Devin", "Lamont", "Griffith", "Ariel", "Dakota", "Vance" ], "edges": [ [ 0, 7 ], [ 1, 5 ], [ 2, 8 ], [ 5, 4 ], [ 5, 6 ], [ 6, 2 ], [ 7, 1 ], [ 8, 3 ], [ 8, 9 ], [ 10, 17 ], [ 11, 15 ], [ 12, 18 ], [ 15, 14 ], [ 15, 16 ], [ 16, 12 ], [ 17, 11 ], [ 18, 13 ], [ 18, 19 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Doug knows Frank. Geraldine knows Alvin. Elmer knows Reid. Elmer knows Harry. Eugene knows Dell. Alfred knows Elmer. Mindy knows Walter. Adrian knows Aldo. Virgil knows Doug. Geraldine knows Mindy. Eugene knows Goldie. Virgil knows Alfred. Helen knows Eugene. Reid knows Estella. Aldo knows Virgil. Dell knows Geraldine. Goldie knows Garrett. Katherine knows Helen. Which of Helen and Aldo can Katherine reach?", "answer": "Helen", "steps": [ "Katherine knows Helen." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Katherine", "Eugene", "Garrett", "Walter", "Dell", "Geraldine", "Mindy", "Alvin", "Helen", "Goldie", "Adrian", "Virgil", "Frank", "Estella", "Alfred", "Elmer", "Reid", "Harry", "Aldo", "Doug" ], "edges": [ [ 0, 8 ], [ 1, 4 ], [ 1, 9 ], [ 4, 5 ], [ 5, 6 ], [ 5, 7 ], [ 6, 3 ], [ 8, 1 ], [ 9, 2 ], [ 10, 18 ], [ 11, 14 ], [ 11, 19 ], [ 14, 15 ], [ 15, 16 ], [ 15, 17 ], [ 16, 13 ], [ 18, 11 ], [ 19, 12 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Wallace knows Ted. Humphrey knows Brynn. Cristina knows Harold. Wallace knows Effie. George knows Harry. Delilah knows Stuart. Gwen knows Humphrey. Ashley knows Cristina. Daisy knows Wyatt. Humphrey knows Jose. Wyatt knows Gwen. Ted knows Emma. George knows Daisy. Effie knows Vivian. Gwen knows Delilah. Ashley knows Melissa. Ted knows Garrett. Harold knows Wallace. Which of Daisy and Cristina can Ashley reach?", "answer": "Cristina", "steps": [ "Ashley knows Cristina." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Ashley", "Cristina", "Ted", "Wallace", "Vivian", "Emma", "Harold", "Effie", "Garrett", "Melissa", "George", "Daisy", "Humphrey", "Gwen", "Stuart", "Jose", "Wyatt", "Delilah", "Brynn", "Harry" ], "edges": [ [ 0, 1 ], [ 0, 9 ], [ 1, 6 ], [ 2, 5 ], [ 2, 8 ], [ 3, 7 ], [ 3, 2 ], [ 6, 3 ], [ 7, 4 ], [ 10, 11 ], [ 10, 19 ], [ 11, 16 ], [ 12, 15 ], [ 12, 18 ], [ 13, 17 ], [ 13, 12 ], [ 16, 13 ], [ 17, 14 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Percy knows Carrie. Percy knows Joaquin. Lyric knows Eileen. Carrie knows Jade. Jane knows Wayne. Laura knows Julius. Sheila knows Livia. Evelyn knows Florence. Wayne knows Diego. Percy knows Richard. Julius knows Lyric. Lyric knows Randy. Laura knows Jane. Travis knows Jason. Evelyn knows Flora. Joaquin knows Travis. Laura knows Sheila. Richard knows Evelyn. Which of Eileen and Flora can Percy reach?", "answer": "Flora", "steps": [ "Percy knows Richard.", "Richard knows Evelyn.", "Evelyn knows Flora." ], "difficulty": 3, "original_distance": 3, "idx_to_symbol": [ "Percy", "Jade", "Carrie", "Richard", "Florence", "Travis", "Evelyn", "Jason", "Flora", "Joaquin", "Laura", "Livia", "Sheila", "Julius", "Randy", "Wayne", "Lyric", "Diego", "Eileen", "Jane" ], "edges": [ [ 0, 2 ], [ 0, 3 ], [ 0, 9 ], [ 2, 1 ], [ 3, 6 ], [ 5, 7 ], [ 6, 4 ], [ 6, 8 ], [ 9, 5 ], [ 10, 12 ], [ 10, 13 ], [ 10, 19 ], [ 12, 11 ], [ 13, 16 ], [ 15, 17 ], [ 16, 14 ], [ 16, 18 ], [ 19, 15 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Alex knows Elvis. Leigh knows Jeff. Wayne knows Erma. Sidney knows Connor. Earl knows Ira. Alfred knows Catherine. Lorna knows Earl. Leigh knows Alfred. Boris knows Jenna. Wayne knows Martha. Catherine knows Boris. Erma knows Lorna. Jenna knows Vance. Catherine knows Mia. Lorna knows Anton. Lorna knows Carey. Carey knows Sidney. Catherine knows Alex. Which of Jenna and Sidney can Leigh reach?", "answer": "Jenna", "steps": [ "Leigh knows Alfred.", "Alfred knows Catherine.", "Catherine knows Boris.", "Boris knows Jenna." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Leigh", "Jenna", "Jeff", "Boris", "Vance", "Elvis", "Catherine", "Alex", "Alfred", "Mia", "Wayne", "Sidney", "Martha", "Carey", "Connor", "Ira", "Lorna", "Earl", "Erma", "Anton" ], "edges": [ [ 0, 2 ], [ 0, 8 ], [ 1, 4 ], [ 3, 1 ], [ 6, 3 ], [ 6, 7 ], [ 6, 9 ], [ 7, 5 ], [ 8, 6 ], [ 10, 12 ], [ 10, 18 ], [ 11, 14 ], [ 13, 11 ], [ 16, 13 ], [ 16, 17 ], [ 16, 19 ], [ 17, 15 ], [ 18, 16 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Hugh knows Daria. Jane knows Mara. Arden knows Opal. Paige knows Sean. Yuki knows Victor. Colin knows Rhonda. Lars knows Leopold. Victor knows Arden. Archer knows Paige. Fanny knows Ramona. Fanny knows Hugh. Sean knows Carl. Leopold knows Maggie. Maggie knows Jane. Opal knows Fanny. Daria knows Colin. Jane knows Archer. Hayes knows Lars. Which of Jane and Fanny can Yuki reach?", "answer": "Fanny", "steps": [ "Yuki knows Victor.", "Victor knows Arden.", "Arden knows Opal.", "Opal knows Fanny." ], "difficulty": 4, "original_distance": 8, "idx_to_symbol": [ "Yuki", "Victor", "Daria", "Colin", "Fanny", "Opal", "Rhonda", "Arden", "Hugh", "Ramona", "Hayes", "Lars", "Paige", "Sean", "Jane", "Maggie", "Carl", "Leopold", "Archer", "Mara" ], "edges": [ [ 0, 1 ], [ 1, 7 ], [ 2, 3 ], [ 3, 6 ], [ 4, 8 ], [ 4, 9 ], [ 5, 4 ], [ 7, 5 ], [ 8, 2 ], [ 10, 11 ], [ 11, 17 ], [ 12, 13 ], [ 13, 16 ], [ 14, 18 ], [ 14, 19 ], [ 15, 14 ], [ 17, 15 ], [ 18, 12 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Keegan knows Archer. Magdalena knows Mike. Lisette knows Lily. Derrick knows Foster. Jasmine knows Adele. Gabriel knows Kimberly. Gabriel knows Darrell. Naomi knows Khashayar. Gabriel knows Hal. Lily knows Naomi. Lily knows Keegan. Derrick knows Hendrix. Lily knows Matthew. Kimberly knows Gage. Jasmine knows Lisette. Hendrix knows Gabriel. Archer knows Teresa. Darrell knows Magdalena. Which of Darrell and Keegan can Jasmine reach?", "answer": "Keegan", "steps": [ "Jasmine knows Lisette.", "Lisette knows Lily.", "Lily knows Keegan." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Jasmine", "Matthew", "Keegan", "Khashayar", "Lisette", "Teresa", "Naomi", "Archer", "Adele", "Lily", "Derrick", "Hal", "Darrell", "Gage", "Hendrix", "Mike", "Kimberly", "Magdalena", "Foster", "Gabriel" ], "edges": [ [ 0, 8 ], [ 0, 4 ], [ 2, 7 ], [ 4, 9 ], [ 6, 3 ], [ 7, 5 ], [ 9, 1 ], [ 9, 6 ], [ 9, 2 ], [ 10, 18 ], [ 10, 14 ], [ 12, 17 ], [ 14, 19 ], [ 16, 13 ], [ 17, 15 ], [ 19, 11 ], [ 19, 16 ], [ 19, 12 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Lorna knows Louisa. Dudley knows Lorna. Gustavo knows Susan. Darla knows Alyssa. Laurel knows Gustavo. Myrtle knows June. Myrtle knows Dudley. Susan knows Opal. June knows Jeanette. Dudley knows Henrietta. Louisa knows Magdalena. Nicholas knows Darla. Nicholas knows Paige. Nicholas knows Bernard. Bernard knows David. Darla knows Laurel. Myrtle knows Karen. Magdalena knows Herbert. Which of Susan and Magdalena can Myrtle reach?", "answer": "Magdalena", "steps": [ "Myrtle knows Dudley.", "Dudley knows Lorna.", "Lorna knows Louisa.", "Louisa knows Magdalena." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Myrtle", "Henrietta", "Lorna", "Dudley", "Magdalena", "June", "Jeanette", "Louisa", "Karen", "Herbert", "Nicholas", "Alyssa", "Laurel", "Darla", "Susan", "Bernard", "David", "Gustavo", "Paige", "Opal" ], "edges": [ [ 0, 5 ], [ 0, 8 ], [ 0, 3 ], [ 2, 7 ], [ 3, 1 ], [ 3, 2 ], [ 4, 9 ], [ 5, 6 ], [ 7, 4 ], [ 10, 15 ], [ 10, 18 ], [ 10, 13 ], [ 12, 17 ], [ 13, 11 ], [ 13, 12 ], [ 14, 19 ], [ 15, 16 ], [ 17, 14 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Lewis knows Destiny. Harmony knows Audrey. Sebastian knows Effie. Destiny knows Leo. Devon knows Janice. Sarah knows Shannon. Shannon knows Hailey. Vicki knows Harmony. Leo knows Rita. Effie knows Jean. Michelle knows Sebastian. Effie knows Alma. Audrey knows Maria. Harmony knows Arturo. Destiny knows Vicki. Leo knows Wendy. Shannon knows Devon. Sebastian knows Sarah. Which of Sarah and Vicki can Michelle reach?", "answer": "Sarah", "steps": [ "Michelle knows Sebastian.", "Sebastian knows Sarah." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Michelle", "Sebastian", "Shannon", "Sarah", "Effie", "Jean", "Alma", "Hailey", "Janice", "Devon", "Lewis", "Destiny", "Harmony", "Vicki", "Leo", "Wendy", "Rita", "Arturo", "Maria", "Audrey" ], "edges": [ [ 0, 1 ], [ 1, 4 ], [ 1, 3 ], [ 2, 7 ], [ 2, 9 ], [ 3, 2 ], [ 4, 5 ], [ 4, 6 ], [ 9, 8 ], [ 10, 11 ], [ 11, 14 ], [ 11, 13 ], [ 12, 17 ], [ 12, 19 ], [ 13, 12 ], [ 14, 15 ], [ 14, 16 ], [ 19, 18 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Duncan knows Clarence. Hector knows Kenneth. Clarence knows Holly. Elton knows Essie. Holly knows Florence. Conner knows Rufus. Chase knows Heather. Peggy knows Layla. Jermaine knows Chase. Dudley knows Duncan. Essie knows Megan. Duncan knows Tamara. Rufus knows Peggy. Florence knows Jermaine. Kenneth knows Elton. Randy knows Hector. Rufus knows Randy. Tamara knows Alyssa. Which of Kenneth and Florence can Dudley reach?", "answer": "Florence", "steps": [ "Dudley knows Duncan.", "Duncan knows Clarence.", "Clarence knows Holly.", "Holly knows Florence." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Dudley", "Chase", "Alyssa", "Tamara", "Florence", "Holly", "Clarence", "Heather", "Duncan", "Jermaine", "Conner", "Essie", "Layla", "Peggy", "Kenneth", "Hector", "Randy", "Megan", "Rufus", "Elton" ], "edges": [ [ 0, 8 ], [ 1, 7 ], [ 3, 2 ], [ 4, 9 ], [ 5, 4 ], [ 6, 5 ], [ 8, 3 ], [ 8, 6 ], [ 9, 1 ], [ 10, 18 ], [ 11, 17 ], [ 13, 12 ], [ 14, 19 ], [ 15, 14 ], [ 16, 15 ], [ 18, 13 ], [ 18, 16 ], [ 19, 11 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Arden knows Eunice. Austin knows Laura. Constance knows Wayne. Arden knows Simon. Lauren knows Dolly. Alejandro knows Ricardo. Austin knows Kristin. Peter knows Donovan. Alejandro knows Lamont. Lamont knows Austin. Donovan knows Kerry. Wayne knows Lauren. Austin knows Peter. Constance knows Hardy. Constance knows Sean. Ramona knows Arden. Eunice knows Constance. Emery knows Alejandro. Which of Alejandro and Arden can Emery reach?", "answer": "Alejandro", "steps": [ "Emery knows Alejandro." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Emery", "Austin", "Alejandro", "Ricardo", "Peter", "Kristin", "Donovan", "Lamont", "Kerry", "Laura", "Ramona", "Constance", "Arden", "Simon", "Wayne", "Hardy", "Lauren", "Eunice", "Dolly", "Sean" ], "edges": [ [ 0, 2 ], [ 1, 5 ], [ 1, 4 ], [ 1, 9 ], [ 2, 3 ], [ 2, 7 ], [ 4, 6 ], [ 6, 8 ], [ 7, 1 ], [ 10, 12 ], [ 11, 15 ], [ 11, 14 ], [ 11, 19 ], [ 12, 13 ], [ 12, 17 ], [ 14, 16 ], [ 16, 18 ], [ 17, 11 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Harrison knows Yvonne. Yvonne knows Fraser. Lauren knows Maggie. Lorna knows Randall. Laura knows Lauren. Yvonne knows Ainsley. Blake knows Sam. Burt knows Laura. Lola knows Burt. Lauren knows Lewis. Blake knows Aubrey. Lauren knows Darrell. Blake knows Daphna. Fraser knows Dayton. Burt knows Jolena. Burt knows Lorna. Yvonne knows Anton. Ainsley knows Blake. Which of Burt and Yvonne can Harrison reach?", "answer": "Yvonne", "steps": [ "Harrison knows Yvonne." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Harrison", "Ainsley", "Dayton", "Daphna", "Blake", "Aubrey", "Fraser", "Anton", "Yvonne", "Sam", "Lola", "Laura", "Randall", "Maggie", "Lauren", "Lewis", "Lorna", "Jolena", "Burt", "Darrell" ], "edges": [ [ 0, 8 ], [ 1, 4 ], [ 4, 3 ], [ 4, 5 ], [ 4, 9 ], [ 6, 2 ], [ 8, 6 ], [ 8, 7 ], [ 8, 1 ], [ 10, 18 ], [ 11, 14 ], [ 14, 13 ], [ 14, 15 ], [ 14, 19 ], [ 16, 12 ], [ 18, 16 ], [ 18, 17 ], [ 18, 11 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Charlotte knows Celia. Fred knows Brody. Brody knows Jillian. Chester knows Spencer. Brenda knows Alyson. Darnell knows Kim. Celia knows Ross. Gail knows India. Spencer knows Ivan. Sidney knows Archer. Archer knows Gail. Ivan knows Luke. Dorothy knows Darnell. Kim knows Erma. Charlotte knows Fred. India knows Brenda. Ross knows Dorothy. Chester knows Sidney. Which of Celia and Sidney can Chester reach?", "answer": "Sidney", "steps": [ "Chester knows Sidney." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Chester", "Luke", "India", "Spencer", "Archer", "Alyson", "Gail", "Ivan", "Brenda", "Sidney", "Charlotte", "Jillian", "Darnell", "Fred", "Ross", "Erma", "Dorothy", "Brody", "Kim", "Celia" ], "edges": [ [ 0, 3 ], [ 0, 9 ], [ 2, 8 ], [ 3, 7 ], [ 4, 6 ], [ 6, 2 ], [ 7, 1 ], [ 8, 5 ], [ 9, 4 ], [ 10, 13 ], [ 10, 19 ], [ 12, 18 ], [ 13, 17 ], [ 14, 16 ], [ 16, 12 ], [ 17, 11 ], [ 18, 15 ], [ 19, 14 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Patrick knows Brent. Lena knows Edgar. Leon knows Dustin. Shelby knows Xander. Dominic knows Lena. Monica knows Griffith. Edgar knows Pete. Patrick knows Monica. Everett knows Shelby. Monica knows Erin. Rocco knows Eloise. Xander knows Rocco. Shelby knows Kit. Griffith knows Dominic. Everett knows Brooks. Neville knows Patrick. Hazel knows Everett. Eloise knows Leon. Which of Edgar and Leon can Neville reach?", "answer": "Edgar", "steps": [ "Neville knows Patrick.", "Patrick knows Monica.", "Monica knows Griffith.", "Griffith knows Dominic.", "Dominic knows Lena.", "Lena knows Edgar." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Neville", "Pete", "Dominic", "Brent", "Lena", "Griffith", "Monica", "Erin", "Patrick", "Edgar", "Hazel", "Dustin", "Rocco", "Brooks", "Eloise", "Xander", "Shelby", "Kit", "Everett", "Leon" ], "edges": [ [ 0, 8 ], [ 2, 4 ], [ 4, 9 ], [ 5, 2 ], [ 6, 7 ], [ 6, 5 ], [ 8, 3 ], [ 8, 6 ], [ 9, 1 ], [ 10, 18 ], [ 12, 14 ], [ 14, 19 ], [ 15, 12 ], [ 16, 17 ], [ 16, 15 ], [ 18, 13 ], [ 18, 16 ], [ 19, 11 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Leander knows Harlan. Wilson knows Hal. Sally knows Flora. Flora knows Barbara. Chloe knows Janet. Atlas knows Vernon. Chloe knows Nina. Nina knows Dexter. Eva knows Leander. Wilson knows Sally. Wilson knows Vicki. Barbara knows Courtney. Dexter knows Clark. Clark knows Eva. Sally knows Giselle. Courtney knows Atlas. Nina knows Paige. Chloe knows Irving. Which of Leander and Atlas can Wilson reach?", "answer": "Atlas", "steps": [ "Wilson knows Sally.", "Sally knows Flora.", "Flora knows Barbara.", "Barbara knows Courtney.", "Courtney knows Atlas." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Wilson", "Hal", "Sally", "Giselle", "Vernon", "Barbara", "Atlas", "Vicki", "Courtney", "Flora", "Chloe", "Irving", "Nina", "Paige", "Harlan", "Clark", "Leander", "Janet", "Eva", "Dexter" ], "edges": [ [ 0, 1 ], [ 0, 7 ], [ 0, 2 ], [ 2, 3 ], [ 2, 9 ], [ 5, 8 ], [ 6, 4 ], [ 8, 6 ], [ 9, 5 ], [ 10, 11 ], [ 10, 17 ], [ 10, 12 ], [ 12, 13 ], [ 12, 19 ], [ 15, 18 ], [ 16, 14 ], [ 18, 16 ], [ 19, 15 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Leon knows Taylor. Ainsley knows Leon. Eamon knows Michelle. Leon knows Saul. Helene knows Aspen. Taylor knows Kelsey. Ainsley knows Alana. Kelsey knows Douglas. Lillian knows Maya. Celia knows Graham. Helene knows Martha. Taylor knows Larissa. Martha knows Susan. Maya knows Helene. Maya knows Jakob. Douglas knows Celia. Lillian knows Yvonne. Susan knows Eamon. Which of Maya and Leon can Lillian reach?", "answer": "Maya", "steps": [ "Lillian knows Maya." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Lillian", "Michelle", "Yvonne", "Aspen", "Jakob", "Helene", "Susan", "Martha", "Maya", "Eamon", "Ainsley", "Graham", "Alana", "Larissa", "Saul", "Taylor", "Douglas", "Kelsey", "Leon", "Celia" ], "edges": [ [ 0, 2 ], [ 0, 8 ], [ 5, 3 ], [ 5, 7 ], [ 6, 9 ], [ 7, 6 ], [ 8, 4 ], [ 8, 5 ], [ 9, 1 ], [ 10, 12 ], [ 10, 18 ], [ 15, 13 ], [ 15, 17 ], [ 16, 19 ], [ 17, 16 ], [ 18, 14 ], [ 18, 15 ], [ 19, 11 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Ava knows Geneva. Henry knows Christian. Percy knows Faye. Gavin knows Amanda. Earl knows Ava. Earl knows Kieran. Chad knows Gavin. Henry knows Edith. Chad knows Percy. Faye knows Selena. Edith knows Jolene. Christian knows Earl. Selena knows Sydney. Edith knows Ann. Faye knows Jameson. Ann knows Jermaine. Grover knows Jeff. Gavin knows Grover. Which of Geneva and Sydney can Henry reach?", "answer": "Geneva", "steps": [ "Henry knows Christian.", "Christian knows Earl.", "Earl knows Ava.", "Ava knows Geneva." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Henry", "Jolene", "Ann", "Jermaine", "Christian", "Geneva", "Ava", "Kieran", "Earl", "Edith", "Chad", "Amanda", "Grover", "Jeff", "Percy", "Sydney", "Selena", "Jameson", "Faye", "Gavin" ], "edges": [ [ 0, 4 ], [ 0, 9 ], [ 2, 3 ], [ 4, 8 ], [ 6, 5 ], [ 8, 6 ], [ 8, 7 ], [ 9, 1 ], [ 9, 2 ], [ 10, 14 ], [ 10, 19 ], [ 12, 13 ], [ 14, 18 ], [ 16, 15 ], [ 18, 16 ], [ 18, 17 ], [ 19, 11 ], [ 19, 12 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Brooke knows Leonard. Mae knows Aurora. Alex knows Dick. Gavin knows Gus. Geoffrey knows John. Dick knows Desmond. Aurora knows Electra. Barry knows Gavin. Elvira knows Geoffrey. Lark knows Doug. Gus knows Brooke. Louise knows Janet. Brooke knows Elvira. Pauline knows Alex. Pauline knows Lark. Doug knows Fernando. Leonard knows Louise. Electra knows Pauline. Which of Pauline and Brooke can Barry reach?", "answer": "Brooke", "steps": [ "Barry knows Gavin.", "Gavin knows Gus.", "Gus knows Brooke." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Barry", "Gus", "Gavin", "Leonard", "Elvira", "Janet", "Louise", "John", "Geoffrey", "Brooke", "Mae", "Electra", "Aurora", "Lark", "Alex", "Fernando", "Doug", "Desmond", "Dick", "Pauline" ], "edges": [ [ 0, 2 ], [ 1, 9 ], [ 2, 1 ], [ 3, 6 ], [ 4, 8 ], [ 6, 5 ], [ 8, 7 ], [ 9, 3 ], [ 9, 4 ], [ 10, 12 ], [ 11, 19 ], [ 12, 11 ], [ 13, 16 ], [ 14, 18 ], [ 16, 15 ], [ 18, 17 ], [ 19, 13 ], [ 19, 14 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Omar knows Beth. Geraldine knows Scott. Lawrence knows Ralph. Desmond knows Burt. Burt knows Kobe. Burt knows Pierce. Isabel knows Lola. Scott knows Nora. Hayes knows Riley. Rex knows Conner. Scott knows Omar. Ralph knows Isabel. Kobe knows Geraldine. Ralph knows Ramon. Hayes knows Rex. Kobe knows Harry. Isabel knows Helene. Helene knows Hayes. Which of Conner and Beth can Lawrence reach?", "answer": "Conner", "steps": [ "Lawrence knows Ralph.", "Ralph knows Isabel.", "Isabel knows Helene.", "Helene knows Hayes.", "Hayes knows Rex.", "Rex knows Conner." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Lawrence", "Conner", "Isabel", "Rex", "Hayes", "Ramon", "Riley", "Lola", "Helene", "Ralph", "Desmond", "Beth", "Kobe", "Omar", "Scott", "Pierce", "Nora", "Harry", "Geraldine", "Burt" ], "edges": [ [ 0, 9 ], [ 2, 7 ], [ 2, 8 ], [ 3, 1 ], [ 4, 3 ], [ 4, 6 ], [ 8, 4 ], [ 9, 5 ], [ 9, 2 ], [ 10, 19 ], [ 12, 17 ], [ 12, 18 ], [ 13, 11 ], [ 14, 13 ], [ 14, 16 ], [ 18, 14 ], [ 19, 15 ], [ 19, 12 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Keegan knows Archer. Magdalena knows Mike. Lisette knows Lily. Derrick knows Foster. Jasmine knows Adele. Gabriel knows Kimberly. Gabriel knows Darrell. Naomi knows Khashayar. Gabriel knows Hal. Lily knows Naomi. Lily knows Keegan. Derrick knows Hendrix. Lily knows Matthew. Kimberly knows Gage. Jasmine knows Lisette. Hendrix knows Gabriel. Archer knows Teresa. Darrell knows Magdalena. Which of Teresa and Mike can Jasmine reach?", "answer": "Teresa", "steps": [ "Jasmine knows Lisette.", "Lisette knows Lily.", "Lily knows Keegan.", "Keegan knows Archer.", "Archer knows Teresa." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Jasmine", "Matthew", "Keegan", "Khashayar", "Lisette", "Teresa", "Naomi", "Archer", "Adele", "Lily", "Derrick", "Hal", "Darrell", "Gage", "Hendrix", "Mike", "Kimberly", "Magdalena", "Foster", "Gabriel" ], "edges": [ [ 0, 8 ], [ 0, 4 ], [ 2, 7 ], [ 4, 9 ], [ 6, 3 ], [ 7, 5 ], [ 9, 1 ], [ 9, 6 ], [ 9, 2 ], [ 10, 18 ], [ 10, 14 ], [ 12, 17 ], [ 14, 19 ], [ 16, 13 ], [ 17, 15 ], [ 19, 11 ], [ 19, 16 ], [ 19, 12 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Chad knows Tristan. Tristan knows Carlos. Tristan knows Ellis. Damian knows Oliver. Oliver knows Valerie. Flora knows Camille. Leander knows Damian. Ellis knows Ira. Ellis knows Tonya. Quinn knows Jacob. Christopher knows Dwight. Oliver knows Christopher. Alyssa knows Chad. Marlene knows Alyssa. Quinn knows Leander. Christopher knows Flora. Marlene knows Marco. Ira knows Willis. Which of Leander and Alyssa can Marlene reach?", "answer": "Alyssa", "steps": [ "Marlene knows Alyssa." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Marlene", "Chad", "Ellis", "Willis", "Carlos", "Tristan", "Alyssa", "Marco", "Ira", "Tonya", "Quinn", "Damian", "Christopher", "Camille", "Valerie", "Oliver", "Leander", "Jacob", "Flora", "Dwight" ], "edges": [ [ 0, 7 ], [ 0, 6 ], [ 1, 5 ], [ 2, 8 ], [ 2, 9 ], [ 5, 4 ], [ 5, 2 ], [ 6, 1 ], [ 8, 3 ], [ 10, 17 ], [ 10, 16 ], [ 11, 15 ], [ 12, 18 ], [ 12, 19 ], [ 15, 14 ], [ 15, 12 ], [ 16, 11 ], [ 18, 13 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Geraldine knows Isabel. Maria knows Autumn. Cain knows Jared. Floyd knows Willis. Blair knows Cain. Kelsey knows Geraldine. Isabel knows Stefan. Floyd knows Ron. Maria knows Mindy. Geraldine knows Bailey. David knows Floyd. Victor knows Maria. Isabel knows Clyde. Dale knows Forrest. Cain knows Dale. Jared knows Victor. Dale knows Cate. Bailey knows David. Which of Geraldine and Cain can Blair reach?", "answer": "Cain", "steps": [ "Blair knows Cain." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Blair", "Cate", "Cain", "Dale", "Autumn", "Mindy", "Maria", "Jared", "Forrest", "Victor", "Kelsey", "Clyde", "Geraldine", "Isabel", "Ron", "Willis", "Floyd", "Bailey", "Stefan", "David" ], "edges": [ [ 0, 2 ], [ 2, 3 ], [ 2, 7 ], [ 3, 1 ], [ 3, 8 ], [ 6, 4 ], [ 6, 5 ], [ 7, 9 ], [ 9, 6 ], [ 10, 12 ], [ 12, 13 ], [ 12, 17 ], [ 13, 11 ], [ 13, 18 ], [ 16, 14 ], [ 16, 15 ], [ 17, 19 ], [ 19, 16 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Alicia knows Blanche. Alexa knows Jolene. Kay knows Alexa. Jolene knows Dorian. Arturo knows Eunice. Diana knows Angela. Dorian knows Christopher. Alicia knows Christian. Alana knows Diana. Ignacio knows Alana. Ross knows Erma. Alicia knows Lucas. Christian knows Clement. Arturo knows Kay. Alana knows Saul. Dorian knows Ross. Clement knows Ignacio. Arturo knows Oliver. Which of Clement and Alexa can Arturo reach?", "answer": "Alexa", "steps": [ "Arturo knows Kay.", "Kay knows Alexa." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Arturo", "Ross", "Jolene", "Erma", "Oliver", "Kay", "Alexa", "Christopher", "Eunice", "Dorian", "Alicia", "Diana", "Ignacio", "Angela", "Lucas", "Christian", "Clement", "Saul", "Blanche", "Alana" ], "edges": [ [ 0, 4 ], [ 0, 8 ], [ 0, 5 ], [ 1, 3 ], [ 2, 9 ], [ 5, 6 ], [ 6, 2 ], [ 9, 1 ], [ 9, 7 ], [ 10, 14 ], [ 10, 18 ], [ 10, 15 ], [ 11, 13 ], [ 12, 19 ], [ 15, 16 ], [ 16, 12 ], [ 19, 11 ], [ 19, 17 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Leland knows Janice. Langston knows Damian. Langston knows Edmund. Edmund knows Lauren. Andrea knows Todd. Janice knows Lars. Patrick knows Sydney. Cornelius knows Doris. Janice knows Andrea. Cornelius knows Wilbur. Patrick knows Horace. Graeme knows Dana. Doris knows Enid. Sydney knows Leland. Lars knows Marie. Wilbur knows Graeme. Lauren knows Cornelius. Todd knows Hank. Which of Janice and Cornelius can Langston reach?", "answer": "Cornelius", "steps": [ "Langston knows Edmund.", "Edmund knows Lauren.", "Lauren knows Cornelius." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Langston", "Enid", "Dana", "Damian", "Doris", "Wilbur", "Cornelius", "Graeme", "Lauren", "Edmund", "Patrick", "Marie", "Hank", "Horace", "Lars", "Andrea", "Janice", "Todd", "Leland", "Sydney" ], "edges": [ [ 0, 3 ], [ 0, 9 ], [ 4, 1 ], [ 5, 7 ], [ 6, 4 ], [ 6, 5 ], [ 7, 2 ], [ 8, 6 ], [ 9, 8 ], [ 10, 13 ], [ 10, 19 ], [ 14, 11 ], [ 15, 17 ], [ 16, 14 ], [ 16, 15 ], [ 17, 12 ], [ 18, 16 ], [ 19, 18 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Loretta knows Dorothy. Eldon knows Daisy. Kristina knows Marc. Dorothy knows Colleen. Naomi knows Jordan. Gareth knows Farrah. Spencer knows Eldon. Gareth knows Spencer. Dorothy knows Kristina. Renee knows Loretta. Tonya knows Naomi. Spencer knows Lennox. Tonya knows Gareth. Harriet knows Aisha. Loretta knows Gage. Spencer knows Dudley. Dorothy knows Lawrence. Renee knows Harriet. Which of Daisy and Marc can Renee reach?", "answer": "Marc", "steps": [ "Renee knows Loretta.", "Loretta knows Dorothy.", "Dorothy knows Kristina.", "Kristina knows Marc." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Renee", "Aisha", "Loretta", "Lawrence", "Dorothy", "Gage", "Marc", "Kristina", "Colleen", "Harriet", "Tonya", "Jordan", "Gareth", "Dudley", "Spencer", "Farrah", "Daisy", "Eldon", "Lennox", "Naomi" ], "edges": [ [ 0, 2 ], [ 0, 9 ], [ 2, 5 ], [ 2, 4 ], [ 4, 3 ], [ 4, 7 ], [ 4, 8 ], [ 7, 6 ], [ 9, 1 ], [ 10, 12 ], [ 10, 19 ], [ 12, 15 ], [ 12, 14 ], [ 14, 13 ], [ 14, 17 ], [ 14, 18 ], [ 17, 16 ], [ 19, 11 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Eugene knows Raquel. Alyssa knows Anton. Jewel knows Aurora. Anton knows Geoffrey. Rebecca knows Alyssa. Geoffrey knows Saul. Aurora knows Vernon. Stuart knows Jewel. Caroline knows Charles. Brody knows Sally. Sally knows Stuart. Raquel knows Daniel. Sally knows Emanuel. Raquel knows Belinda. Vernon knows Caroline. Aurora knows Lisa. Alyssa knows Clay. Daniel knows Rebecca. Which of Vernon and Anton can Eugene reach?", "answer": "Anton", "steps": [ "Eugene knows Raquel.", "Raquel knows Daniel.", "Daniel knows Rebecca.", "Rebecca knows Alyssa.", "Alyssa knows Anton." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Eugene", "Belinda", "Geoffrey", "Alyssa", "Daniel", "Saul", "Anton", "Raquel", "Rebecca", "Clay", "Brody", "Emanuel", "Caroline", "Aurora", "Stuart", "Charles", "Vernon", "Sally", "Jewel", "Lisa" ], "edges": [ [ 0, 7 ], [ 2, 5 ], [ 3, 6 ], [ 3, 9 ], [ 4, 8 ], [ 6, 2 ], [ 7, 1 ], [ 7, 4 ], [ 8, 3 ], [ 10, 17 ], [ 12, 15 ], [ 13, 16 ], [ 13, 19 ], [ 14, 18 ], [ 16, 12 ], [ 17, 11 ], [ 17, 14 ], [ 18, 13 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Lara knows Hardy. Kathleen knows Oliver. Margaret knows Khashayar. Reid knows Ignacio. Hardy knows Reid. Mitchell knows Ava. Ignacio knows Damien. Margaret knows Pedro. Donna knows Arthur. Oliver knows Ruth. Arthur knows Fritz. Ignacio knows Kieran. Reid knows Valerie. Ruth knows Donna. Ruth knows Margaret. Pedro knows Dean. Damien knows Tabitha. Valerie knows Mitchell. Which of Arthur and Mitchell can Lara reach?", "answer": "Mitchell", "steps": [ "Lara knows Hardy.", "Hardy knows Reid.", "Reid knows Valerie.", "Valerie knows Mitchell." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Lara", "Valerie", "Mitchell", "Hardy", "Kieran", "Ignacio", "Reid", "Damien", "Ava", "Tabitha", "Kathleen", "Donna", "Arthur", "Oliver", "Khashayar", "Margaret", "Ruth", "Pedro", "Fritz", "Dean" ], "edges": [ [ 0, 3 ], [ 1, 2 ], [ 2, 8 ], [ 3, 6 ], [ 5, 4 ], [ 5, 7 ], [ 6, 1 ], [ 6, 5 ], [ 7, 9 ], [ 10, 13 ], [ 11, 12 ], [ 12, 18 ], [ 13, 16 ], [ 15, 14 ], [ 15, 17 ], [ 16, 11 ], [ 16, 15 ], [ 17, 19 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Miriam knows Nancy. Miriam knows Dawn. Miriam knows Chad. Dane knows Brad. Lamont knows Angelica. Darin knows Adelaide. Brad knows Lamont. Dell knows Paige. Adelaide knows Gilbert. Jane knows Gail. Corinne knows Arturo. Ernie knows Miriam. Chad knows Lennox. Dell knows Dane. Brad knows Darin. Brad knows Melissa. Nancy knows Corinne. Jane knows Ernie. Which of Brad and Miriam can Jane reach?", "answer": "Miriam", "steps": [ "Jane knows Ernie.", "Ernie knows Miriam." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Jane", "Miriam", "Arturo", "Dawn", "Lennox", "Gail", "Corinne", "Chad", "Ernie", "Nancy", "Dell", "Brad", "Gilbert", "Melissa", "Angelica", "Paige", "Adelaide", "Lamont", "Dane", "Darin" ], "edges": [ [ 0, 5 ], [ 0, 8 ], [ 1, 3 ], [ 1, 7 ], [ 1, 9 ], [ 6, 2 ], [ 7, 4 ], [ 8, 1 ], [ 9, 6 ], [ 10, 15 ], [ 10, 18 ], [ 11, 13 ], [ 11, 17 ], [ 11, 19 ], [ 16, 12 ], [ 17, 14 ], [ 18, 11 ], [ 19, 16 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Dennis knows Atlas. Ainsley knows Cristina. Hampton knows Dennis. Jacques knows Ross. Rose knows Harlan. Tabitha knows Graham. Rose knows Jacques. Cristina knows Justine. Harlan knows Tabitha. Atlas knows Jean. Graham knows Jennifer. Jacques knows Gerard. Justine knows Susanne. Dennis knows Clayton. Jean knows Linda. Beau knows Erica. Hampton knows Ainsley. Gerard knows Beau. Which of Gerard and Atlas can Rose reach?", "answer": "Gerard", "steps": [ "Rose knows Jacques.", "Jacques knows Gerard." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Rose", "Erica", "Tabitha", "Graham", "Jennifer", "Ross", "Jacques", "Harlan", "Gerard", "Beau", "Hampton", "Linda", "Cristina", "Justine", "Susanne", "Clayton", "Dennis", "Ainsley", "Atlas", "Jean" ], "edges": [ [ 0, 7 ], [ 0, 6 ], [ 2, 3 ], [ 3, 4 ], [ 6, 5 ], [ 6, 8 ], [ 7, 2 ], [ 8, 9 ], [ 9, 1 ], [ 10, 17 ], [ 10, 16 ], [ 12, 13 ], [ 13, 14 ], [ 16, 15 ], [ 16, 18 ], [ 17, 12 ], [ 18, 19 ], [ 19, 11 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Mary knows Kent. Kevin knows Sybil. Sybil knows Frankie. Eric knows Martha. Atlas knows Devon. Sybil knows Mindy. Eric knows Larry. Eric knows Dick. Frankie knows Bart. Bart knows Conner. Cliff knows Alyson. Alyson knows Colleen. Bart knows Elias. Mary knows Tiffany. Kent knows Eric. Cliff knows Mary. Kevin knows Atlas. Bart knows Clay. Which of Kent and Frankie can Kevin reach?", "answer": "Frankie", "steps": [ "Kevin knows Sybil.", "Sybil knows Frankie." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Kevin", "Sybil", "Devon", "Bart", "Clay", "Elias", "Frankie", "Atlas", "Mindy", "Conner", "Cliff", "Mary", "Colleen", "Eric", "Larry", "Martha", "Kent", "Alyson", "Tiffany", "Dick" ], "edges": [ [ 0, 7 ], [ 0, 1 ], [ 1, 8 ], [ 1, 6 ], [ 3, 4 ], [ 3, 5 ], [ 3, 9 ], [ 6, 3 ], [ 7, 2 ], [ 10, 17 ], [ 10, 11 ], [ 11, 18 ], [ 11, 16 ], [ 13, 14 ], [ 13, 15 ], [ 13, 19 ], [ 16, 13 ], [ 17, 12 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Dahlia knows Erin. Gabriel knows Ebony. Erin knows Hudson. Dahlia knows Lucas. Lambert knows Gabriel. Keith knows Bernard. Bernard knows Pete. Gabriel knows Greta. Pete knows Rocco. Sean knows Darren. Lucas knows Keith. Deirdre knows Becky. Charity knows Deirdre. Madeline knows Dahlia. Greta knows Grady. Darren knows Charity. Rocco knows Harper. Ebony knows Sean. Which of Dahlia and Gabriel can Lambert reach?", "answer": "Gabriel", "steps": [ "Lambert knows Gabriel." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Lambert", "Deirdre", "Darren", "Gabriel", "Charity", "Becky", "Grady", "Sean", "Ebony", "Greta", "Madeline", "Rocco", "Bernard", "Dahlia", "Pete", "Harper", "Hudson", "Keith", "Lucas", "Erin" ], "edges": [ [ 0, 3 ], [ 1, 5 ], [ 2, 4 ], [ 3, 8 ], [ 3, 9 ], [ 4, 1 ], [ 7, 2 ], [ 8, 7 ], [ 9, 6 ], [ 10, 13 ], [ 11, 15 ], [ 12, 14 ], [ 13, 18 ], [ 13, 19 ], [ 14, 11 ], [ 17, 12 ], [ 18, 17 ], [ 19, 16 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Owen knows Sylvia. Shannon knows Adele. Ramona knows Jewel. Ramona knows Jim. Louisa knows Karla. Shannon knows Vanessa. Karla knows Neville. Matt knows Ebony. Ebony knows Imogen. Dana knows Owen. Karla knows Martin. Hudson knows Dewey. Louisa knows Karina. Dana knows Ann. Jim knows Dana. Ebony knows Louisa. Owen knows Shannon. Hudson knows Matt. Which of Jim and Matt can Ramona reach?", "answer": "Jim", "steps": [ "Ramona knows Jim." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Ramona", "Vanessa", "Owen", "Shannon", "Jim", "Dana", "Adele", "Ann", "Sylvia", "Jewel", "Hudson", "Neville", "Louisa", "Karla", "Matt", "Ebony", "Martin", "Imogen", "Karina", "Dewey" ], "edges": [ [ 0, 4 ], [ 0, 9 ], [ 2, 3 ], [ 2, 8 ], [ 3, 1 ], [ 3, 6 ], [ 4, 5 ], [ 5, 7 ], [ 5, 2 ], [ 10, 14 ], [ 10, 19 ], [ 12, 13 ], [ 12, 18 ], [ 13, 11 ], [ 13, 16 ], [ 14, 15 ], [ 15, 17 ], [ 15, 12 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Geraldine knows Claudia. Michelle knows Carlos. Geraldine knows Cecilia. Arnold knows Grace. Michelle knows Marlene. Arnold knows Marco. Marco knows Trudy. Michelle knows Roy. Trudy knows Mabel. Houston knows Caroline. Arnold knows Houston. Trudy knows Elliot. Marco knows Edison. Marlene knows Jeremy. Marlene knows Geraldine. Roy knows Greta. Arnold knows Jerome. Michelle knows Denver. Which of Elliot and Cecilia can Arnold reach?", "answer": "Elliot", "steps": [ "Arnold knows Marco.", "Marco knows Trudy.", "Trudy knows Elliot." ], "difficulty": 3, "original_distance": 3, "idx_to_symbol": [ "Arnold", "Houston", "Caroline", "Trudy", "Jerome", "Grace", "Marco", "Edison", "Mabel", "Elliot", "Michelle", "Roy", "Greta", "Geraldine", "Carlos", "Denver", "Marlene", "Jeremy", "Claudia", "Cecilia" ], "edges": [ [ 0, 1 ], [ 0, 4 ], [ 0, 5 ], [ 0, 6 ], [ 1, 2 ], [ 3, 8 ], [ 3, 9 ], [ 6, 7 ], [ 6, 3 ], [ 10, 11 ], [ 10, 14 ], [ 10, 15 ], [ 10, 16 ], [ 11, 12 ], [ 13, 18 ], [ 13, 19 ], [ 16, 17 ], [ 16, 13 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Carol knows Duncan. Ilene knows Federico. Harper knows Elvira. Emily knows Cody. Myra knows Jenna. Jenna knows Ilene. Emily knows Aldo. Duncan knows Ruth. Kingsley knows Carol. Cody knows Kingsley. Emily knows Josie. Harper knows Myra. Jenna knows Edna. Carmela knows Graham. Carol knows Foster. Carmela knows Harper. Carmela knows Carlos. Cody knows Horace. Which of Cody and Harper can Emily reach?", "answer": "Cody", "steps": [ "Emily knows Cody." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Emily", "Josie", "Cody", "Carol", "Aldo", "Kingsley", "Horace", "Foster", "Duncan", "Ruth", "Carmela", "Graham", "Harper", "Jenna", "Carlos", "Myra", "Elvira", "Edna", "Ilene", "Federico" ], "edges": [ [ 0, 1 ], [ 0, 4 ], [ 0, 2 ], [ 2, 6 ], [ 2, 5 ], [ 3, 7 ], [ 3, 8 ], [ 5, 3 ], [ 8, 9 ], [ 10, 11 ], [ 10, 14 ], [ 10, 12 ], [ 12, 16 ], [ 12, 15 ], [ 13, 17 ], [ 13, 18 ], [ 15, 13 ], [ 18, 19 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Crystal knows Victor. Guillermo knows Luella. Bette knows Jewel. Renee knows Darcy. Val knows Guillermo. Darcy knows Perry. Martha knows Val. Rhonda knows Catherine. Luella knows Leah. Catherine knows Lucy. Catherine knows Autumn. Victor knows Alfonso. Lucy knows Martin. Martha knows Cruz. Martin knows Bette. Graeme knows Martha. Renee knows Graeme. Crystal knows Rhonda. Which of Val and Lucy can Crystal reach?", "answer": "Lucy", "steps": [ "Crystal knows Rhonda.", "Rhonda knows Catherine.", "Catherine knows Lucy." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Crystal", "Rhonda", "Martin", "Bette", "Victor", "Lucy", "Jewel", "Catherine", "Autumn", "Alfonso", "Renee", "Graeme", "Guillermo", "Luella", "Darcy", "Val", "Leah", "Martha", "Cruz", "Perry" ], "edges": [ [ 0, 1 ], [ 0, 4 ], [ 1, 7 ], [ 2, 3 ], [ 3, 6 ], [ 4, 9 ], [ 5, 2 ], [ 7, 5 ], [ 7, 8 ], [ 10, 11 ], [ 10, 14 ], [ 11, 17 ], [ 12, 13 ], [ 13, 16 ], [ 14, 19 ], [ 15, 12 ], [ 17, 15 ], [ 17, 18 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Jenna knows Lauren. Regina knows Mae. Hamilton knows Lance. Tessa knows Katherine. Joshua knows Inez. India knows Wilma. Joshua knows Jenna. Mildred knows Elena. Regina knows Mildred. Haven knows Claire. Joy knows Jake. Jenna knows India. Cristina knows Hamilton. Wilma knows Tessa. Mildred knows Callum. Wilma knows Haven. Callum knows Cristina. Cristina knows Joy. Which of Callum and India can Joshua reach?", "answer": "India", "steps": [ "Joshua knows Jenna.", "Jenna knows India." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Joshua", "Haven", "Lauren", "Inez", "Jenna", "India", "Claire", "Katherine", "Tessa", "Wilma", "Regina", "Joy", "Elena", "Mae", "Mildred", "Callum", "Jake", "Lance", "Hamilton", "Cristina" ], "edges": [ [ 0, 3 ], [ 0, 4 ], [ 1, 6 ], [ 4, 2 ], [ 4, 5 ], [ 5, 9 ], [ 8, 7 ], [ 9, 1 ], [ 9, 8 ], [ 10, 13 ], [ 10, 14 ], [ 11, 16 ], [ 14, 12 ], [ 14, 15 ], [ 15, 19 ], [ 18, 17 ], [ 19, 11 ], [ 19, 18 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Elijah knows Yasmin. Val knows Abby. Lloyd knows Estella. Ashton knows Alice. Zach knows Alan. Abby knows Elijah. Ashton knows Laura. Electra knows Fletcher. Don knows Lewis. Abby knows Julius. Jeremy knows Electra. Zelda knows Dante. Elijah knows Zelda. Fabian knows Val. Laura knows Jeremy. Zach knows Ashton. Dante knows Don. Estella knows Zach. Which of Elijah and Ashton can Lloyd reach?", "answer": "Ashton", "steps": [ "Lloyd knows Estella.", "Estella knows Zach.", "Zach knows Ashton." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Lloyd", "Ashton", "Laura", "Alan", "Zach", "Electra", "Alice", "Jeremy", "Fletcher", "Estella", "Fabian", "Elijah", "Zelda", "Julius", "Abby", "Don", "Yasmin", "Dante", "Lewis", "Val" ], "edges": [ [ 0, 9 ], [ 1, 6 ], [ 1, 2 ], [ 2, 7 ], [ 4, 3 ], [ 4, 1 ], [ 5, 8 ], [ 7, 5 ], [ 9, 4 ], [ 10, 19 ], [ 11, 16 ], [ 11, 12 ], [ 12, 17 ], [ 14, 13 ], [ 14, 11 ], [ 15, 18 ], [ 17, 15 ], [ 19, 14 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Lucy knows Vincent. Colby knows Jakob. Charity knows Colby. Leopold knows Lydia. Charity knows Houston. Lydia knows Byron. Randy knows Irving. August knows Annie. Vincent knows August. Annie knows Zoe. Zoe knows Eric. Kieran knows Charity. Houston knows Leopold. Tabitha knows Lucy. Eric knows Sharon. August knows Randy. Edward knows Tom. Tom knows Kieran. Which of Lydia and Eric can Tabitha reach?", "answer": "Eric", "steps": [ "Tabitha knows Lucy.", "Lucy knows Vincent.", "Vincent knows August.", "August knows Annie.", "Annie knows Zoe.", "Zoe knows Eric." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Tabitha", "August", "Irving", "Lucy", "Randy", "Vincent", "Annie", "Sharon", "Zoe", "Eric", "Edward", "Charity", "Jakob", "Tom", "Colby", "Kieran", "Houston", "Byron", "Leopold", "Lydia" ], "edges": [ [ 0, 3 ], [ 1, 4 ], [ 1, 6 ], [ 3, 5 ], [ 4, 2 ], [ 5, 1 ], [ 6, 8 ], [ 8, 9 ], [ 9, 7 ], [ 10, 13 ], [ 11, 14 ], [ 11, 16 ], [ 13, 15 ], [ 14, 12 ], [ 15, 11 ], [ 16, 18 ], [ 18, 19 ], [ 19, 17 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Irene knows Damien. Irene knows Lisa. Damien knows Layla. James knows Cyrus. Blanche knows Irene. Randy knows Frida. Lisa knows Adelaide. Cyrus knows Robin. Frida knows Lucy. Virginia knows Randy. Randy knows James. April knows Blanche. Nadine knows Chantal. Seth knows Lamont. Adelaide knows Grant. Frida knows Nadine. Willis knows Virginia. Damien knows Seth. Which of Chantal and Lamont can April reach?", "answer": "Lamont", "steps": [ "April knows Blanche.", "Blanche knows Irene.", "Irene knows Damien.", "Damien knows Seth.", "Seth knows Lamont." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "April", "Irene", "Lisa", "Layla", "Adelaide", "Blanche", "Lamont", "Seth", "Damien", "Grant", "Willis", "Randy", "James", "Lucy", "Cyrus", "Virginia", "Chantal", "Nadine", "Frida", "Robin" ], "edges": [ [ 0, 5 ], [ 1, 8 ], [ 1, 2 ], [ 2, 4 ], [ 4, 9 ], [ 5, 1 ], [ 7, 6 ], [ 8, 3 ], [ 8, 7 ], [ 10, 15 ], [ 11, 18 ], [ 11, 12 ], [ 12, 14 ], [ 14, 19 ], [ 15, 11 ], [ 17, 16 ], [ 18, 13 ], [ 18, 17 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Kevin knows Harrison. Fabian knows Kira. Finn knows Colin. Lorna knows Jacqueline. Hudson knows Elijah. Fabian knows Renee. Ida knows Hudson. Philip knows Fabian. Fabian knows Lucy. Jasmine knows Catherine. Lucy knows Ida. Colin knows Colleen. Jacqueline knows Kevin. Lucy knows Jasmine. Harrison knows Rachel. Jacqueline knows Joyce. Kevin knows Finn. Jacqueline knows Carson. Which of Kevin and Lucy can Lorna reach?", "answer": "Kevin", "steps": [ "Lorna knows Jacqueline.", "Jacqueline knows Kevin." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Lorna", "Rachel", "Colin", "Colleen", "Joyce", "Jacqueline", "Kevin", "Harrison", "Carson", "Finn", "Philip", "Catherine", "Hudson", "Elijah", "Kira", "Fabian", "Lucy", "Jasmine", "Renee", "Ida" ], "edges": [ [ 0, 5 ], [ 2, 3 ], [ 5, 4 ], [ 5, 8 ], [ 5, 6 ], [ 6, 7 ], [ 6, 9 ], [ 7, 1 ], [ 9, 2 ], [ 10, 15 ], [ 12, 13 ], [ 15, 14 ], [ 15, 18 ], [ 15, 16 ], [ 16, 17 ], [ 16, 19 ], [ 17, 11 ], [ 19, 12 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Virgil knows Chad. Lola knows Lena. Jared knows Ben. Virgil knows Finn. Maria knows Seth. Mildred knows Virgil. Dave knows Dora. Chad knows Chase. Deborah knows Justine. Lola knows Maria. Rocco knows Deborah. Serena knows Mildred. Justine knows Jared. Jared knows Lola. Jocelyn knows Dave. Mildred knows Merle. Dora knows Serena. Ashley knows Rocco. Which of Virgil and Lola can Ashley reach?", "answer": "Lola", "steps": [ "Ashley knows Rocco.", "Rocco knows Deborah.", "Deborah knows Justine.", "Justine knows Jared.", "Jared knows Lola." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Ashley", "Lola", "Ben", "Seth", "Justine", "Deborah", "Rocco", "Lena", "Jared", "Maria", "Jocelyn", "Virgil", "Merle", "Chase", "Serena", "Dora", "Dave", "Finn", "Mildred", "Chad" ], "edges": [ [ 0, 6 ], [ 1, 7 ], [ 1, 9 ], [ 4, 8 ], [ 5, 4 ], [ 6, 5 ], [ 8, 2 ], [ 8, 1 ], [ 9, 3 ], [ 10, 16 ], [ 11, 17 ], [ 11, 19 ], [ 14, 18 ], [ 15, 14 ], [ 16, 15 ], [ 18, 12 ], [ 18, 11 ], [ 19, 13 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Gene knows Peggy. Sidney knows Zach. Dina knows Herbert. Ava knows Iris. Bernice knows Morris. Alfred knows Christian. Todd knows Julia. Sidney knows Ava. Adrian knows Todd. Julia knows Wendell. Peggy knows Deborah. Peggy knows Bernice. Todd knows Dina. Herbert knows Sidney. Evan knows Alfred. Elliot knows Gene. Alfred knows Elliot. Christian knows Inez. Which of Iris and Morris can Evan reach?", "answer": "Morris", "steps": [ "Evan knows Alfred.", "Alfred knows Elliot.", "Elliot knows Gene.", "Gene knows Peggy.", "Peggy knows Bernice.", "Bernice knows Morris." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Evan", "Christian", "Bernice", "Elliot", "Morris", "Deborah", "Inez", "Alfred", "Gene", "Peggy", "Adrian", "Julia", "Ava", "Dina", "Iris", "Zach", "Wendell", "Todd", "Herbert", "Sidney" ], "edges": [ [ 0, 7 ], [ 1, 6 ], [ 2, 4 ], [ 3, 8 ], [ 7, 1 ], [ 7, 3 ], [ 8, 9 ], [ 9, 2 ], [ 9, 5 ], [ 10, 17 ], [ 11, 16 ], [ 12, 14 ], [ 13, 18 ], [ 17, 11 ], [ 17, 13 ], [ 18, 19 ], [ 19, 12 ], [ 19, 15 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Lucy knows Diego. Joaquin knows Hope. Lee knows Coral. Arden knows Lee. Grace knows Jose. Chase knows Dante. Joaquin knows Kennedy. Lucy knows Maria. Dante knows Kerry. Lars knows Bart. Hope knows Lucy. Coral knows Grace. Jerome knows Lars. Lars knows Burt. Grace knows Ibrahim. Dante knows Arden. Burt knows Joaquin. Lee knows Oliver. Which of Burt and Arden can Jerome reach?", "answer": "Burt", "steps": [ "Jerome knows Lars.", "Lars knows Burt." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Jerome", "Bart", "Joaquin", "Kennedy", "Diego", "Hope", "Burt", "Lars", "Maria", "Lucy", "Chase", "Kerry", "Lee", "Oliver", "Ibrahim", "Coral", "Arden", "Dante", "Jose", "Grace" ], "edges": [ [ 0, 7 ], [ 2, 3 ], [ 2, 5 ], [ 5, 9 ], [ 6, 2 ], [ 7, 1 ], [ 7, 6 ], [ 9, 4 ], [ 9, 8 ], [ 10, 17 ], [ 12, 13 ], [ 12, 15 ], [ 15, 19 ], [ 16, 12 ], [ 17, 11 ], [ 17, 16 ], [ 19, 14 ], [ 19, 18 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Mary knows Owen. Owen knows Allen. Allen knows Ernest. Janice knows Alison. Alison knows Jill. Daisy knows Chance. Justin knows Enid. Tina knows Daisy. Ernest knows Josie. Tina knows Joshua. Javier knows Janice. Ernest knows Brittany. Carrie knows Mary. Joshua knows Javier. Harper knows Justin. Carrie knows Harper. Alison knows Nadine. Chance knows Burt. Which of Jill and Brittany can Tina reach?", "answer": "Jill", "steps": [ "Tina knows Joshua.", "Joshua knows Javier.", "Javier knows Janice.", "Janice knows Alison.", "Alison knows Jill." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Tina", "Nadine", "Joshua", "Daisy", "Jill", "Chance", "Javier", "Alison", "Burt", "Janice", "Carrie", "Josie", "Mary", "Harper", "Brittany", "Justin", "Owen", "Ernest", "Enid", "Allen" ], "edges": [ [ 0, 3 ], [ 0, 2 ], [ 2, 6 ], [ 3, 5 ], [ 5, 8 ], [ 6, 9 ], [ 7, 1 ], [ 7, 4 ], [ 9, 7 ], [ 10, 13 ], [ 10, 12 ], [ 12, 16 ], [ 13, 15 ], [ 15, 18 ], [ 16, 19 ], [ 17, 11 ], [ 17, 14 ], [ 19, 17 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Helene knows Glenn. Trina knows Noah. Stuart knows Trina. Kit knows Jake. Martin knows Carlos. Stuart knows Pete. Trina knows Kit. Jake knows Chloe. Doug knows Brooke. Dayton knows William. Chloe knows Jose. Martin knows Iris. Martin knows Kay. Kay knows Taylor. Kendrick knows Helene. Trina knows Dayton. Carlos knows Kendrick. Doug knows Martin. Which of Chloe and Helene can Doug reach?", "answer": "Helene", "steps": [ "Doug knows Martin.", "Martin knows Carlos.", "Carlos knows Kendrick.", "Kendrick knows Helene." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Doug", "Kay", "Martin", "Glenn", "Carlos", "Helene", "Brooke", "Iris", "Kendrick", "Taylor", "Stuart", "Dayton", "Trina", "Jose", "Kit", "Chloe", "Pete", "Noah", "Jake", "William" ], "edges": [ [ 0, 6 ], [ 0, 2 ], [ 1, 9 ], [ 2, 7 ], [ 2, 4 ], [ 2, 1 ], [ 4, 8 ], [ 5, 3 ], [ 8, 5 ], [ 10, 16 ], [ 10, 12 ], [ 11, 19 ], [ 12, 17 ], [ 12, 14 ], [ 12, 11 ], [ 14, 18 ], [ 15, 13 ], [ 18, 15 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Alejandro knows Luna. Inez knows Landon. Gwen knows Carrie. Landon knows Gwen. Cesar knows Frankie. Leroy knows Ethan. Marion knows Tonya. Alejandro knows Morris. Frankie knows Helen. Marion knows Cesar. Arthur knows Aiden. Alejandro knows Lucia. Lucia knows Inez. Marion knows Leroy. Luna knows Joaquin. Helen knows Arthur. Arthur knows Corinne. Gwen knows Ford. Which of Landon and Helen can Marion reach?", "answer": "Helen", "steps": [ "Marion knows Cesar.", "Cesar knows Frankie.", "Frankie knows Helen." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Marion", "Leroy", "Frankie", "Ethan", "Helen", "Aiden", "Cesar", "Tonya", "Arthur", "Corinne", "Alejandro", "Luna", "Inez", "Joaquin", "Landon", "Carrie", "Lucia", "Morris", "Gwen", "Ford" ], "edges": [ [ 0, 1 ], [ 0, 7 ], [ 0, 6 ], [ 1, 3 ], [ 2, 4 ], [ 4, 8 ], [ 6, 2 ], [ 8, 5 ], [ 8, 9 ], [ 10, 11 ], [ 10, 17 ], [ 10, 16 ], [ 11, 13 ], [ 12, 14 ], [ 14, 18 ], [ 16, 12 ], [ 18, 15 ], [ 18, 19 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Shane knows Molly. Tina knows Shane. Ilene knows Faith. Molly knows Palmer. Cody knows Paul. Ilene knows Eden. Claire knows Mitchell. Roland knows Chantal. Darrell knows Tina. Bert knows Chloe. Cody knows Bert. Eden knows Darrell. Jade knows Claire. Jade knows Martha. Mitchell knows Roland. Molly knows Annie. Chantal knows Cody. Palmer knows Estella. Which of Darrell and Mitchell can Jade reach?", "answer": "Mitchell", "steps": [ "Jade knows Claire.", "Claire knows Mitchell." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Jade", "Claire", "Martha", "Mitchell", "Chloe", "Chantal", "Paul", "Bert", "Cody", "Roland", "Ilene", "Eden", "Faith", "Darrell", "Estella", "Shane", "Annie", "Palmer", "Molly", "Tina" ], "edges": [ [ 0, 2 ], [ 0, 1 ], [ 1, 3 ], [ 3, 9 ], [ 5, 8 ], [ 7, 4 ], [ 8, 6 ], [ 8, 7 ], [ 9, 5 ], [ 10, 12 ], [ 10, 11 ], [ 11, 13 ], [ 13, 19 ], [ 15, 18 ], [ 17, 14 ], [ 18, 16 ], [ 18, 17 ], [ 19, 15 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "April knows Lynn. Lynn knows Darrell. Elmer knows Darwin. Virginia knows Khashayar. Nancy knows Charity. Virginia knows Jake. April knows Hendrix. Lynn knows Lillian. Arlene knows Deborah. Charity knows Ray. Charity knows Ember. Enrique knows Nancy. Deborah knows April. Ray knows Lois. Jake knows Enrique. Ray knows Autumn. Elmer knows Eldon. Darwin knows Arlene. Which of Ray and Lynn can Elmer reach?", "answer": "Lynn", "steps": [ "Elmer knows Darwin.", "Darwin knows Arlene.", "Arlene knows Deborah.", "Deborah knows April.", "April knows Lynn." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Elmer", "Deborah", "Lynn", "Arlene", "Darrell", "Lillian", "April", "Hendrix", "Eldon", "Darwin", "Virginia", "Nancy", "Ray", "Enrique", "Autumn", "Lois", "Charity", "Ember", "Khashayar", "Jake" ], "edges": [ [ 0, 8 ], [ 0, 9 ], [ 1, 6 ], [ 2, 4 ], [ 2, 5 ], [ 3, 1 ], [ 6, 2 ], [ 6, 7 ], [ 9, 3 ], [ 10, 18 ], [ 10, 19 ], [ 11, 16 ], [ 12, 14 ], [ 12, 15 ], [ 13, 11 ], [ 16, 12 ], [ 16, 17 ], [ 19, 13 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Gene knows Peggy. Sidney knows Zach. Dina knows Herbert. Ava knows Iris. Bernice knows Morris. Alfred knows Christian. Todd knows Julia. Sidney knows Ava. Adrian knows Todd. Julia knows Wendell. Peggy knows Deborah. Peggy knows Bernice. Todd knows Dina. Herbert knows Sidney. Evan knows Alfred. Elliot knows Gene. Alfred knows Elliot. Christian knows Inez. Which of Sidney and Peggy can Evan reach?", "answer": "Peggy", "steps": [ "Evan knows Alfred.", "Alfred knows Elliot.", "Elliot knows Gene.", "Gene knows Peggy." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Evan", "Christian", "Bernice", "Elliot", "Morris", "Deborah", "Inez", "Alfred", "Gene", "Peggy", "Adrian", "Julia", "Ava", "Dina", "Iris", "Zach", "Wendell", "Todd", "Herbert", "Sidney" ], "edges": [ [ 0, 7 ], [ 1, 6 ], [ 2, 4 ], [ 3, 8 ], [ 7, 1 ], [ 7, 3 ], [ 8, 9 ], [ 9, 2 ], [ 9, 5 ], [ 10, 17 ], [ 11, 16 ], [ 12, 14 ], [ 13, 18 ], [ 17, 11 ], [ 17, 13 ], [ 18, 19 ], [ 19, 12 ], [ 19, 15 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Adam knows Callum. Harper knows Charlene. Callum knows Kurt. Lola knows Emery. Adam knows Harper. Susanne knows Peggy. Bryan knows Keith. Graeme knows Rosa. Pedro knows Kieran. Susanne knows Pedro. Keith knows Maureen. Pedro knows Darrell. Adam knows Lola. Susanne knows Luther. Luther knows Bryan. Harper knows Todd. Peggy knows Don. Kurt knows Graeme. Which of Keith and Graeme can Susanne reach?", "answer": "Keith", "steps": [ "Susanne knows Luther.", "Luther knows Bryan.", "Bryan knows Keith." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Susanne", "Bryan", "Maureen", "Luther", "Pedro", "Kieran", "Keith", "Don", "Darrell", "Peggy", "Adam", "Kurt", "Rosa", "Callum", "Harper", "Charlene", "Graeme", "Emery", "Todd", "Lola" ], "edges": [ [ 0, 3 ], [ 0, 4 ], [ 0, 9 ], [ 1, 6 ], [ 3, 1 ], [ 4, 5 ], [ 4, 8 ], [ 6, 2 ], [ 9, 7 ], [ 10, 13 ], [ 10, 14 ], [ 10, 19 ], [ 11, 16 ], [ 13, 11 ], [ 14, 15 ], [ 14, 18 ], [ 16, 12 ], [ 19, 17 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Eugene knows Inez. Porter knows Philip. Carlton knows Chester. Chester knows Edna. Tristan knows Beverly. Dwight knows Tristan. Inez knows Carlton. Inez knows Elodie. Jackson knows Eugene. Philip knows Quinn. Beverly knows Colby. Chester knows Calvin. Beverly knows Porter. Joan knows Rosa. Lucia knows Aspen. Philip knows Dominic. Carlton knows Joan. Porter knows Lucia. Which of Calvin and Dominic can Jackson reach?", "answer": "Calvin", "steps": [ "Jackson knows Eugene.", "Eugene knows Inez.", "Inez knows Carlton.", "Carlton knows Chester.", "Chester knows Calvin." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Jackson", "Calvin", "Elodie", "Edna", "Joan", "Eugene", "Rosa", "Inez", "Carlton", "Chester", "Dwight", "Dominic", "Colby", "Quinn", "Lucia", "Tristan", "Aspen", "Beverly", "Porter", "Philip" ], "edges": [ [ 0, 5 ], [ 4, 6 ], [ 5, 7 ], [ 7, 2 ], [ 7, 8 ], [ 8, 4 ], [ 8, 9 ], [ 9, 1 ], [ 9, 3 ], [ 10, 15 ], [ 14, 16 ], [ 15, 17 ], [ 17, 12 ], [ 17, 18 ], [ 18, 14 ], [ 18, 19 ], [ 19, 11 ], [ 19, 13 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Gunnar knows Winston. Deborah knows Victor. Laura knows Pam. Celia knows Joel. Victor knows Jack. Dominic knows Susan. Laura knows Julio. Andre knows Corinne. Darren knows Celia. Henrietta knows Deborah. Henrietta knows Candice. Susan knows Terrence. Laura knows Gunnar. Corinne knows Dominic. Winston knows Andre. Joel knows Jaime. Jack knows Darren. Henrietta knows Luis. Which of Joel and Susan can Henrietta reach?", "answer": "Joel", "steps": [ "Henrietta knows Deborah.", "Deborah knows Victor.", "Victor knows Jack.", "Jack knows Darren.", "Darren knows Celia.", "Celia knows Joel." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Henrietta", "Candice", "Deborah", "Jack", "Joel", "Darren", "Jaime", "Luis", "Victor", "Celia", "Laura", "Julio", "Gunnar", "Andre", "Susan", "Corinne", "Terrence", "Pam", "Winston", "Dominic" ], "edges": [ [ 0, 1 ], [ 0, 7 ], [ 0, 2 ], [ 2, 8 ], [ 3, 5 ], [ 4, 6 ], [ 5, 9 ], [ 8, 3 ], [ 9, 4 ], [ 10, 11 ], [ 10, 17 ], [ 10, 12 ], [ 12, 18 ], [ 13, 15 ], [ 14, 16 ], [ 15, 19 ], [ 18, 13 ], [ 19, 14 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Ava knows Rebecca. Rebecca knows Ross. Ian knows Cole. Florence knows Antonio. Livia knows Lloyd. Gemma knows Esther. Gemma knows Ian. Florence knows Ava. Harlan knows Max. Rebecca knows Tristan. Rosemary knows Florence. Cole knows Alyson. Tristan knows Greg. Harlan knows Rosemary. Cole knows Nicole. Louise knows Samantha. Nicole knows Louise. Louise knows Livia. Which of Lloyd and Greg can Gemma reach?", "answer": "Lloyd", "steps": [ "Gemma knows Ian.", "Ian knows Cole.", "Cole knows Nicole.", "Nicole knows Louise.", "Louise knows Livia.", "Livia knows Lloyd." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Gemma", "Samantha", "Ian", "Livia", "Cole", "Louise", "Esther", "Nicole", "Lloyd", "Alyson", "Harlan", "Ross", "Rosemary", "Tristan", "Florence", "Rebecca", "Max", "Ava", "Greg", "Antonio" ], "edges": [ [ 0, 6 ], [ 0, 2 ], [ 2, 4 ], [ 3, 8 ], [ 4, 7 ], [ 4, 9 ], [ 5, 1 ], [ 5, 3 ], [ 7, 5 ], [ 10, 16 ], [ 10, 12 ], [ 12, 14 ], [ 13, 18 ], [ 14, 17 ], [ 14, 19 ], [ 15, 11 ], [ 15, 13 ], [ 17, 15 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Leo knows Clinton. Fletcher knows Cornelius. Fletcher knows Karla. Roy knows Fletcher. Fletcher knows Zara. Neal knows Colin. Zara knows Michelle. Selena knows Leo. Daniella knows Omar. Neal knows Luella. Luella knows Ralph. Gustavo knows Evan. Leo knows Daniella. Fletcher knows Inez. Leo knows Neal. Karla knows Marcus. Karla knows Gustavo. Leo knows Jacqueline. Which of Ralph and Evan can Selena reach?", "answer": "Ralph", "steps": [ "Selena knows Leo.", "Leo knows Neal.", "Neal knows Luella.", "Luella knows Ralph." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Selena", "Luella", "Neal", "Daniella", "Jacqueline", "Ralph", "Omar", "Colin", "Leo", "Clinton", "Roy", "Gustavo", "Karla", "Zara", "Inez", "Evan", "Michelle", "Marcus", "Fletcher", "Cornelius" ], "edges": [ [ 0, 8 ], [ 1, 5 ], [ 2, 1 ], [ 2, 7 ], [ 3, 6 ], [ 8, 4 ], [ 8, 3 ], [ 8, 2 ], [ 8, 9 ], [ 10, 18 ], [ 11, 15 ], [ 12, 11 ], [ 12, 17 ], [ 13, 16 ], [ 18, 14 ], [ 18, 13 ], [ 18, 12 ], [ 18, 19 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Austin knows Molly. Laurel knows Anton. Ellis knows Austin. Karen knows Henrietta. Henrietta knows Kingsley. Austin knows Yara. Grady knows Duke. Dahlia knows Laurel. Ivy knows Yvonne. Nadine knows Shane. Kingsley knows Ivy. Yvonne knows Dahlia. Melanie knows Eamon. Kingsley knows Melanie. Molly knows Lola. Kylie knows Ellis. Yara knows Nadine. Shane knows Grady. Which of Ivy and Yara can Kylie reach?", "answer": "Yara", "steps": [ "Kylie knows Ellis.", "Ellis knows Austin.", "Austin knows Yara." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Kylie", "Molly", "Austin", "Yara", "Grady", "Shane", "Ellis", "Lola", "Duke", "Nadine", "Karen", "Melanie", "Kingsley", "Ivy", "Laurel", "Dahlia", "Henrietta", "Eamon", "Anton", "Yvonne" ], "edges": [ [ 0, 6 ], [ 1, 7 ], [ 2, 1 ], [ 2, 3 ], [ 3, 9 ], [ 4, 8 ], [ 5, 4 ], [ 6, 2 ], [ 9, 5 ], [ 10, 16 ], [ 11, 17 ], [ 12, 11 ], [ 12, 13 ], [ 13, 19 ], [ 14, 18 ], [ 15, 14 ], [ 16, 12 ], [ 19, 15 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Sebastian knows Elvira. Jessica knows Harmony. Whitney knows Riley. Elvira knows Lucia. Sebastian knows Miles. Daphne knows Itzel. Laurel knows Warren. Dakota knows Laurel. Dakota knows Fabian. Laurel knows Whitney. Elvira knows Jessica. Harmony knows Daphne. Riley knows Wayne. Riley knows Antonio. Sebastian knows Logan. Harmony knows Lana. Dakota knows Guy. Antonio knows Barney. Which of Elvira and Laurel can Sebastian reach?", "answer": "Elvira", "steps": [ "Sebastian knows Elvira." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Sebastian", "Lucia", "Logan", "Daphne", "Jessica", "Lana", "Itzel", "Miles", "Harmony", "Elvira", "Dakota", "Warren", "Fabian", "Antonio", "Whitney", "Wayne", "Barney", "Guy", "Riley", "Laurel" ], "edges": [ [ 0, 2 ], [ 0, 7 ], [ 0, 9 ], [ 3, 6 ], [ 4, 8 ], [ 8, 5 ], [ 8, 3 ], [ 9, 1 ], [ 9, 4 ], [ 10, 12 ], [ 10, 17 ], [ 10, 19 ], [ 13, 16 ], [ 14, 18 ], [ 18, 15 ], [ 18, 13 ], [ 19, 11 ], [ 19, 14 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Riley knows Edith. Lawson knows Edison. Alvin knows Andre. Trina knows Riley. Riley knows Lionel. Iris knows Wendell. Jeanne knows Lawson. Lionel knows Elliot. Lawson knows Leroy. Rick knows Gary. Alvin knows Clara. Wendell knows Peter. Peter knows Gareth. Gary knows Jeanne. Peter knows Rick. Benjamin knows Trina. Janet knows Alvin. Elliot knows Janet. Which of Peter and Riley can Benjamin reach?", "answer": "Riley", "steps": [ "Benjamin knows Trina.", "Trina knows Riley." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Benjamin", "Edith", "Janet", "Trina", "Riley", "Andre", "Lionel", "Clara", "Elliot", "Alvin", "Iris", "Gareth", "Jeanne", "Wendell", "Peter", "Edison", "Rick", "Leroy", "Gary", "Lawson" ], "edges": [ [ 0, 3 ], [ 2, 9 ], [ 3, 4 ], [ 4, 1 ], [ 4, 6 ], [ 6, 8 ], [ 8, 2 ], [ 9, 5 ], [ 9, 7 ], [ 10, 13 ], [ 12, 19 ], [ 13, 14 ], [ 14, 11 ], [ 14, 16 ], [ 16, 18 ], [ 18, 12 ], [ 19, 15 ], [ 19, 17 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Harold knows Jules. Houston knows Roland. Kristin knows Fisher. Dick knows Ariel. Valerie knows Jane. Derrick knows Yvonne. Elena knows Harold. Valerie knows Houston. Yvonne knows Elena. Dee knows Maureen. Tyler knows Aurora. Noah knows Fritz. Derrick knows Wesley. Yvonne knows Noah. Maureen knows Valerie. Tyler knows Dee. Harold knows Dick. Dee knows Kristin. Which of Valerie and Harold can Tyler reach?", "answer": "Valerie", "steps": [ "Tyler knows Dee.", "Dee knows Maureen.", "Maureen knows Valerie." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Tyler", "Maureen", "Valerie", "Jane", "Dee", "Houston", "Fisher", "Aurora", "Kristin", "Roland", "Derrick", "Elena", "Harold", "Jules", "Yvonne", "Dick", "Fritz", "Wesley", "Noah", "Ariel" ], "edges": [ [ 0, 7 ], [ 0, 4 ], [ 1, 2 ], [ 2, 3 ], [ 2, 5 ], [ 4, 8 ], [ 4, 1 ], [ 5, 9 ], [ 8, 6 ], [ 10, 17 ], [ 10, 14 ], [ 11, 12 ], [ 12, 13 ], [ 12, 15 ], [ 14, 18 ], [ 14, 11 ], [ 15, 19 ], [ 18, 16 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Abel knows Alyson. Calvin knows Dell. Dave knows Abel. Alyson knows Naomi. Abel knows Axel. Alyson knows Austin. Jill knows Francesca. Edison knows Clifford. Abel knows Gary. Francesca knows Charlene. Roger knows Haven. Roger knows Edison. Roger knows Kelsey. Abel knows Chloe. Dell knows Dave. Edison knows Paige. Charlene knows Roger. Roger knows Elvis. Which of Alyson and Edison can Jill reach?", "answer": "Edison", "steps": [ "Jill knows Francesca.", "Francesca knows Charlene.", "Charlene knows Roger.", "Roger knows Edison." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Jill", "Kelsey", "Edison", "Francesca", "Paige", "Haven", "Clifford", "Roger", "Elvis", "Charlene", "Calvin", "Axel", "Alyson", "Dell", "Naomi", "Gary", "Austin", "Abel", "Chloe", "Dave" ], "edges": [ [ 0, 3 ], [ 2, 4 ], [ 2, 6 ], [ 3, 9 ], [ 7, 1 ], [ 7, 5 ], [ 7, 2 ], [ 7, 8 ], [ 9, 7 ], [ 10, 13 ], [ 12, 14 ], [ 12, 16 ], [ 13, 19 ], [ 17, 11 ], [ 17, 15 ], [ 17, 12 ], [ 17, 18 ], [ 19, 17 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Rose knows Martha. Dirk knows Ursula. Arnold knows Camden. Hendrix knows Della. Leigh knows Curtis. Arnold knows Leigh. Della knows Wilson. Fanny knows Rose. Kerry knows Justin. Arnold knows Myrtle. Della knows Dirk. Carey knows Arnold. Dirk knows Troy. Justin knows Heath. Della knows Roy. Leigh knows Irene. Camden knows Kerry. Wilson knows Fanny. Which of Camden and Wilson can Carey reach?", "answer": "Camden", "steps": [ "Carey knows Arnold.", "Arnold knows Camden." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Carey", "Leigh", "Justin", "Curtis", "Myrtle", "Irene", "Camden", "Kerry", "Heath", "Arnold", "Hendrix", "Dirk", "Rose", "Ursula", "Roy", "Troy", "Wilson", "Fanny", "Martha", "Della" ], "edges": [ [ 0, 9 ], [ 1, 3 ], [ 1, 5 ], [ 2, 8 ], [ 6, 7 ], [ 7, 2 ], [ 9, 4 ], [ 9, 1 ], [ 9, 6 ], [ 10, 19 ], [ 11, 13 ], [ 11, 15 ], [ 12, 18 ], [ 16, 17 ], [ 17, 12 ], [ 19, 14 ], [ 19, 11 ], [ 19, 16 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Gilbert knows Kenzie. Carter knows Lee. Tom knows Leigh. Leon knows Jackson. Carter knows Samuel. Georgia knows Carter. Lucas knows Charlotte. Leigh knows Leon. Leon knows Elodie. Gilbert knows Craig. Rick knows Gilbert. Gilbert knows Angela. Samuel knows Aldo. Angela knows Tom. Carter knows Shane. Mark knows Lucas. Lucas knows Howard. Aldo knows Mark. Which of Tom and Aldo can Georgia reach?", "answer": "Aldo", "steps": [ "Georgia knows Carter.", "Carter knows Samuel.", "Samuel knows Aldo." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Georgia", "Samuel", "Lucas", "Charlotte", "Aldo", "Howard", "Mark", "Carter", "Shane", "Lee", "Rick", "Angela", "Leon", "Jackson", "Tom", "Elodie", "Leigh", "Gilbert", "Kenzie", "Craig" ], "edges": [ [ 0, 7 ], [ 1, 4 ], [ 2, 3 ], [ 2, 5 ], [ 4, 6 ], [ 6, 2 ], [ 7, 1 ], [ 7, 8 ], [ 7, 9 ], [ 10, 17 ], [ 11, 14 ], [ 12, 13 ], [ 12, 15 ], [ 14, 16 ], [ 16, 12 ], [ 17, 11 ], [ 17, 18 ], [ 17, 19 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Fern knows Jacques. Dalton knows Larry. Jacques knows Adrian. Elliot knows Harris. Belinda knows Frances. Belinda knows Noah. Ivan knows Fern. Larry knows Yolanda. Imogen knows Dalton. Frances knows Keira. Fiona knows Kerry. Damian knows Belinda. Zelda knows Imogen. Kerry knows Zelda. Yolanda knows Don. Adrian knows Damian. Larry knows Elliot. Noah knows Joseph. Which of Adrian and Imogen can Fiona reach?", "answer": "Imogen", "steps": [ "Fiona knows Kerry.", "Kerry knows Zelda.", "Zelda knows Imogen." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Fiona", "Larry", "Kerry", "Harris", "Don", "Elliot", "Dalton", "Imogen", "Zelda", "Yolanda", "Ivan", "Belinda", "Fern", "Keira", "Joseph", "Frances", "Damian", "Adrian", "Jacques", "Noah" ], "edges": [ [ 0, 2 ], [ 1, 5 ], [ 1, 9 ], [ 2, 8 ], [ 5, 3 ], [ 6, 1 ], [ 7, 6 ], [ 8, 7 ], [ 9, 4 ], [ 10, 12 ], [ 11, 15 ], [ 11, 19 ], [ 12, 18 ], [ 15, 13 ], [ 16, 11 ], [ 17, 16 ], [ 18, 17 ], [ 19, 14 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "India knows Marc. Brock knows India. Damien knows Wesley. Irving knows Veronica. Vanessa knows Desmond. Irving knows Damien. Joyce knows Gina. Callum knows Luz. Luz knows Malik. Damien knows Brock. India knows Deirdre. Callum knows Ada. Damien knows Joyce. Luz knows Morgan. Vanessa knows Courtney. Malik knows Jade. Amber knows Vanessa. Luz knows Amber. Which of Damien and Luz can Irving reach?", "answer": "Damien", "steps": [ "Irving knows Damien." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Irving", "Deirdre", "Wesley", "Veronica", "Gina", "Damien", "Joyce", "India", "Brock", "Marc", "Callum", "Courtney", "Morgan", "Ada", "Jade", "Luz", "Malik", "Vanessa", "Amber", "Desmond" ], "edges": [ [ 0, 3 ], [ 0, 5 ], [ 5, 2 ], [ 5, 6 ], [ 5, 8 ], [ 6, 4 ], [ 7, 1 ], [ 7, 9 ], [ 8, 7 ], [ 10, 13 ], [ 10, 15 ], [ 15, 12 ], [ 15, 16 ], [ 15, 18 ], [ 16, 14 ], [ 17, 11 ], [ 17, 19 ], [ 18, 17 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Wendy knows Wade. Jamie knows Wendy. Justine knows Jamie. Lamont knows Nell. Wendy knows Owen. Gail knows Helene. Gail knows Anna. Vera knows Jewel. Arthur knows Lamont. Ivy knows Vera. Owen knows Bernadette. Federico knows Gail. Cecilia knows Jacob. Owen knows Arthur. Helene knows Ivy. Jacob knows Federico. Dahlia knows Justine. Helene knows Kristina. Which of Lamont and Vera can Dahlia reach?", "answer": "Lamont", "steps": [ "Dahlia knows Justine.", "Justine knows Jamie.", "Jamie knows Wendy.", "Wendy knows Owen.", "Owen knows Arthur.", "Arthur knows Lamont." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Dahlia", "Justine", "Lamont", "Bernadette", "Owen", "Wade", "Nell", "Wendy", "Jamie", "Arthur", "Cecilia", "Jacob", "Vera", "Kristina", "Helene", "Anna", "Jewel", "Gail", "Federico", "Ivy" ], "edges": [ [ 0, 1 ], [ 1, 8 ], [ 2, 6 ], [ 4, 3 ], [ 4, 9 ], [ 7, 5 ], [ 7, 4 ], [ 8, 7 ], [ 9, 2 ], [ 10, 11 ], [ 11, 18 ], [ 12, 16 ], [ 14, 13 ], [ 14, 19 ], [ 17, 15 ], [ 17, 14 ], [ 18, 17 ], [ 19, 12 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Amber knows Valerie. Dirk knows Jonas. Herman knows Chloe. Chloe knows Amber. Lucille knows Eugenia. Bart knows Dirk. Chloe knows Lucille. Penny knows Bert. Amber knows Janice. Bert knows Fletcher. Fletcher knows Jeff. Gabe knows Josie. Frida knows Julio. Sean knows Penny. Janice knows Bart. Penny knows Frida. Jeff knows Gabe. Bert knows Lisa. Which of Penny and Chloe can Sean reach?", "answer": "Penny", "steps": [ "Sean knows Penny." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Sean", "Lisa", "Frida", "Penny", "Gabe", "Jeff", "Fletcher", "Josie", "Bert", "Julio", "Herman", "Valerie", "Lucille", "Chloe", "Dirk", "Bart", "Janice", "Jonas", "Amber", "Eugenia" ], "edges": [ [ 0, 3 ], [ 2, 9 ], [ 3, 8 ], [ 3, 2 ], [ 4, 7 ], [ 5, 4 ], [ 6, 5 ], [ 8, 1 ], [ 8, 6 ], [ 10, 13 ], [ 12, 19 ], [ 13, 18 ], [ 13, 12 ], [ 14, 17 ], [ 15, 14 ], [ 16, 15 ], [ 18, 11 ], [ 18, 16 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Daniel knows Cora. Kaleb knows Cindy. Cindy knows Jocelyn. Floyd knows Rex. Carmen knows Daniel. Beverly knows Grady. Frankie knows Belinda. Carmen knows Zane. Frankie knows Kaleb. Wanda knows Mack. Belinda knows Wanda. Eunice knows Itzel. Itzel knows Floyd. Kaleb knows Vivian. Itzel knows Dexter. Belinda knows Beverly. Eunice knows Carmen. Dexter knows Sonia. Which of Cindy and Daniel can Eunice reach?", "answer": "Daniel", "steps": [ "Eunice knows Carmen.", "Carmen knows Daniel." ], "difficulty": 2, "original_distance": 3, "idx_to_symbol": [ "Eunice", "Carmen", "Itzel", "Dexter", "Cora", "Floyd", "Sonia", "Zane", "Rex", "Daniel", "Frankie", "Kaleb", "Belinda", "Beverly", "Jocelyn", "Wanda", "Grady", "Vivian", "Mack", "Cindy" ], "edges": [ [ 0, 2 ], [ 0, 1 ], [ 1, 7 ], [ 1, 9 ], [ 2, 3 ], [ 2, 5 ], [ 3, 6 ], [ 5, 8 ], [ 9, 4 ], [ 10, 12 ], [ 10, 11 ], [ 11, 17 ], [ 11, 19 ], [ 12, 13 ], [ 12, 15 ], [ 13, 16 ], [ 15, 18 ], [ 19, 14 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Aspen knows Ian. Marvin knows Walt. Dayton knows Vivian. Winifred knows Lola. Sheryl knows Beth. Vivian knows Sara. Sonia knows Arnold. Sara knows Molly. Molly knows Roman. Roman knows Aiden. Dayton knows Aspen. Stephen knows Sonia. Vivian knows Edmund. Sonia knows Winifred. Ian knows Joanna. Beth knows Wayne. Stephen knows Sheryl. Lola knows Marvin. Which of Molly and Lola can Dayton reach?", "answer": "Molly", "steps": [ "Dayton knows Vivian.", "Vivian knows Sara.", "Sara knows Molly." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Dayton", "Ian", "Aiden", "Sara", "Joanna", "Aspen", "Vivian", "Roman", "Edmund", "Molly", "Stephen", "Beth", "Walt", "Winifred", "Wayne", "Sheryl", "Sonia", "Marvin", "Arnold", "Lola" ], "edges": [ [ 0, 5 ], [ 0, 6 ], [ 1, 4 ], [ 3, 9 ], [ 5, 1 ], [ 6, 8 ], [ 6, 3 ], [ 7, 2 ], [ 9, 7 ], [ 10, 15 ], [ 10, 16 ], [ 11, 14 ], [ 13, 19 ], [ 15, 11 ], [ 16, 18 ], [ 16, 13 ], [ 17, 12 ], [ 19, 17 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Richard knows Erin. Darrell knows Hank. Ainsley knows Darla. Hamilton knows Elliot. Elliot knows Maude. Elliot knows Mack. Darla knows Reed. Richard knows Dean. Elliot knows Shawn. Aurora knows Jason. Dean knows Aurora. Dominic knows Jorge. Aurora knows Ainsley. Aurora knows Enrique. Dominic knows Hamilton. Maude knows Darrell. Darrell knows Connor. Darla knows Joyce. Which of Hamilton and Dean can Richard reach?", "answer": "Dean", "steps": [ "Richard knows Dean." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Richard", "Enrique", "Dean", "Ainsley", "Reed", "Darla", "Jason", "Joyce", "Aurora", "Erin", "Dominic", "Shawn", "Hamilton", "Maude", "Connor", "Darrell", "Mack", "Hank", "Elliot", "Jorge" ], "edges": [ [ 0, 2 ], [ 0, 9 ], [ 2, 8 ], [ 3, 5 ], [ 5, 4 ], [ 5, 7 ], [ 8, 1 ], [ 8, 6 ], [ 8, 3 ], [ 10, 12 ], [ 10, 19 ], [ 12, 18 ], [ 13, 15 ], [ 15, 14 ], [ 15, 17 ], [ 18, 11 ], [ 18, 16 ], [ 18, 13 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Wilson knows Neal. Renee knows Matthew. Morgan knows Isabel. Isabel knows Bonnie. Neal knows Camille. Diane knows Renee. Isabel knows Hugo. Renee knows Chad. Gabriel knows Diane. Neal knows Owen. Isabel knows Tara. Morgan knows Zara. Desmond knows Louise. Tara knows Wilson. Desmond knows Keegan. John knows Desmond. Desmond knows Gabriel. John knows Brynn. Which of Renee and Neal can Morgan reach?", "answer": "Neal", "steps": [ "Morgan knows Isabel.", "Isabel knows Tara.", "Tara knows Wilson.", "Wilson knows Neal." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Morgan", "Hugo", "Camille", "Bonnie", "Wilson", "Owen", "Isabel", "Neal", "Zara", "Tara", "John", "Louise", "Matthew", "Keegan", "Diane", "Chad", "Desmond", "Renee", "Brynn", "Gabriel" ], "edges": [ [ 0, 8 ], [ 0, 6 ], [ 4, 7 ], [ 6, 1 ], [ 6, 3 ], [ 6, 9 ], [ 7, 2 ], [ 7, 5 ], [ 9, 4 ], [ 10, 18 ], [ 10, 16 ], [ 14, 17 ], [ 16, 11 ], [ 16, 13 ], [ 16, 19 ], [ 17, 12 ], [ 17, 15 ], [ 19, 14 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Paula knows Barney. Scott knows Derek. Grover knows Thomas. Saul knows Ruby. Paula knows Wallace. Paula knows Griffith. Saul knows Grover. Clyde knows Scott. Chad knows Harlan. Thomas knows Deirdre. Barney knows Walter. Saul knows Frances. Saul knows Emery. Emery knows Chad. Paula knows Clyde. Walter knows Shelly. Emery knows Faye. Barney knows Hampton. Which of Shelly and Harlan can Saul reach?", "answer": "Harlan", "steps": [ "Saul knows Emery.", "Emery knows Chad.", "Chad knows Harlan." ], "difficulty": 3, "original_distance": 3, "idx_to_symbol": [ "Saul", "Grover", "Deirdre", "Chad", "Ruby", "Faye", "Thomas", "Harlan", "Frances", "Emery", "Paula", "Clyde", "Derek", "Walter", "Griffith", "Hampton", "Scott", "Shelly", "Wallace", "Barney" ], "edges": [ [ 0, 4 ], [ 0, 1 ], [ 0, 8 ], [ 0, 9 ], [ 1, 6 ], [ 3, 7 ], [ 6, 2 ], [ 9, 5 ], [ 9, 3 ], [ 10, 14 ], [ 10, 11 ], [ 10, 18 ], [ 10, 19 ], [ 11, 16 ], [ 13, 17 ], [ 16, 12 ], [ 19, 15 ], [ 19, 13 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Zane knows Electra. Luella knows Hattie. Gerald knows Elodie. Cristina knows Ramona. Jacob knows Tabitha. Zane knows Houston. Luella knows Walt. Maureen knows Eden. Anton knows Jacob. Camille knows Cristina. Levi knows Luella. Elodie knows Maureen. Carmela knows Felicia. Ramona knows Carmela. Carmela knows Melody. Houston knows Levi. Electra knows Anton. Camille knows Gerald. Which of Ramona and Levi can Camille reach?", "answer": "Ramona", "steps": [ "Camille knows Cristina.", "Cristina knows Ramona." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Camille", "Maureen", "Cristina", "Ramona", "Elodie", "Gerald", "Carmela", "Eden", "Melody", "Felicia", "Zane", "Jacob", "Houston", "Levi", "Anton", "Electra", "Luella", "Tabitha", "Walt", "Hattie" ], "edges": [ [ 0, 5 ], [ 0, 2 ], [ 1, 7 ], [ 2, 3 ], [ 3, 6 ], [ 4, 1 ], [ 5, 4 ], [ 6, 8 ], [ 6, 9 ], [ 10, 15 ], [ 10, 12 ], [ 11, 17 ], [ 12, 13 ], [ 13, 16 ], [ 14, 11 ], [ 15, 14 ], [ 16, 18 ], [ 16, 19 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Jackson knows Ivy. Mike knows Sarah. Jolena knows Erica. Fleur knows Reed. Ivy knows Jolena. Priscilla knows Doug. Dixie knows Jose. Jackson knows Sandra. Kylie knows Ron. Jose knows Priscilla. Dixie knows Kylie. Doug knows Rosemary. Mike knows Jackson. Mike knows Fleur. Dixie knows Eunice. Jose knows Noah. Jackson knows Hugh. Jose knows Catherine. Which of Jose and Jackson can Dixie reach?", "answer": "Jose", "steps": [ "Dixie knows Jose." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Dixie", "Jose", "Catherine", "Doug", "Rosemary", "Noah", "Eunice", "Ron", "Priscilla", "Kylie", "Mike", "Jackson", "Sandra", "Jolena", "Erica", "Hugh", "Sarah", "Reed", "Ivy", "Fleur" ], "edges": [ [ 0, 6 ], [ 0, 1 ], [ 0, 9 ], [ 1, 2 ], [ 1, 5 ], [ 1, 8 ], [ 3, 4 ], [ 8, 3 ], [ 9, 7 ], [ 10, 16 ], [ 10, 11 ], [ 10, 19 ], [ 11, 12 ], [ 11, 15 ], [ 11, 18 ], [ 13, 14 ], [ 18, 13 ], [ 19, 17 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "August knows Josie. Zara knows Arthur. Carson knows Saul. Cristina knows August. Karl knows Lorna. Annie knows Troy. Hubert knows Sadie. Ebony knows Aspen. Todd knows Hubert. Arthur knows Malik. Malik knows Ebony. Aspen knows Karl. Chandler knows Todd. Courtney knows Annie. Aspen knows Cristina. Todd knows Carson. Saul knows George. Troy knows Chandler. Which of Josie and George can Zara reach?", "answer": "Josie", "steps": [ "Zara knows Arthur.", "Arthur knows Malik.", "Malik knows Ebony.", "Ebony knows Aspen.", "Aspen knows Cristina.", "Cristina knows August.", "August knows Josie." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Zara", "Malik", "Josie", "Arthur", "Cristina", "Karl", "Ebony", "Lorna", "August", "Aspen", "Courtney", "Troy", "George", "Annie", "Carson", "Hubert", "Chandler", "Sadie", "Saul", "Todd" ], "edges": [ [ 0, 3 ], [ 1, 6 ], [ 3, 1 ], [ 4, 8 ], [ 5, 7 ], [ 6, 9 ], [ 8, 2 ], [ 9, 5 ], [ 9, 4 ], [ 10, 13 ], [ 11, 16 ], [ 13, 11 ], [ 14, 18 ], [ 15, 17 ], [ 16, 19 ], [ 18, 12 ], [ 19, 15 ], [ 19, 14 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Jenny knows Boris. Kenneth knows Garrison. Candice knows Kenneth. Sheryl knows Philip. Gerald knows Sheryl. Hayes knows Lawson. Candice knows Aiden. Sheryl knows Joy. Maria knows Nathan. Boris knows Maria. Logan knows Hayes. Philip knows Candice. Jenny knows Xander. Maria knows Logan. Alana knows Justine. Alana knows Jenny. Garrison knows Craig. Gerald knows Sean. Which of Maria and Candice can Gerald reach?", "answer": "Candice", "steps": [ "Gerald knows Sheryl.", "Sheryl knows Philip.", "Philip knows Candice." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Gerald", "Kenneth", "Sean", "Craig", "Aiden", "Garrison", "Philip", "Sheryl", "Candice", "Joy", "Alana", "Logan", "Justine", "Lawson", "Nathan", "Hayes", "Boris", "Jenny", "Maria", "Xander" ], "edges": [ [ 0, 2 ], [ 0, 7 ], [ 1, 5 ], [ 5, 3 ], [ 6, 8 ], [ 7, 6 ], [ 7, 9 ], [ 8, 4 ], [ 8, 1 ], [ 10, 12 ], [ 10, 17 ], [ 11, 15 ], [ 15, 13 ], [ 16, 18 ], [ 17, 16 ], [ 17, 19 ], [ 18, 14 ], [ 18, 11 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Lewis knows Destiny. Harmony knows Audrey. Sebastian knows Effie. Destiny knows Leo. Devon knows Janice. Sarah knows Shannon. Shannon knows Hailey. Vicki knows Harmony. Leo knows Rita. Effie knows Jean. Michelle knows Sebastian. Effie knows Alma. Audrey knows Maria. Harmony knows Arturo. Destiny knows Vicki. Leo knows Wendy. Shannon knows Devon. Sebastian knows Sarah. Which of Devon and Audrey can Michelle reach?", "answer": "Devon", "steps": [ "Michelle knows Sebastian.", "Sebastian knows Sarah.", "Sarah knows Shannon.", "Shannon knows Devon." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Michelle", "Sebastian", "Shannon", "Sarah", "Effie", "Jean", "Alma", "Hailey", "Janice", "Devon", "Lewis", "Destiny", "Harmony", "Vicki", "Leo", "Wendy", "Rita", "Arturo", "Maria", "Audrey" ], "edges": [ [ 0, 1 ], [ 1, 4 ], [ 1, 3 ], [ 2, 7 ], [ 2, 9 ], [ 3, 2 ], [ 4, 5 ], [ 4, 6 ], [ 9, 8 ], [ 10, 11 ], [ 11, 14 ], [ 11, 13 ], [ 12, 17 ], [ 12, 19 ], [ 13, 12 ], [ 14, 15 ], [ 14, 16 ], [ 19, 18 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Ember knows Marc. Marion knows Arturo. Gertrude knows Delia. Arturo knows Sebastian. Harper knows Chantal. Helene knows Hector. Hayden knows Gertrude. Harry knows Kevin. Donald knows Helene. Sue knows Donald. Kennedy knows Stephanie. Stephanie knows Hayden. Ember knows Harper. Marc knows Kennedy. Arturo knows Sue. Hector knows Harry. Sebastian knows Josie. Abby knows Ember. Which of Kennedy and Donald can Marion reach?", "answer": "Donald", "steps": [ "Marion knows Arturo.", "Arturo knows Sue.", "Sue knows Donald." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Marion", "Helene", "Josie", "Harry", "Arturo", "Sue", "Hector", "Sebastian", "Kevin", "Donald", "Abby", "Stephanie", "Chantal", "Gertrude", "Ember", "Marc", "Hayden", "Harper", "Delia", "Kennedy" ], "edges": [ [ 0, 4 ], [ 1, 6 ], [ 3, 8 ], [ 4, 7 ], [ 4, 5 ], [ 5, 9 ], [ 6, 3 ], [ 7, 2 ], [ 9, 1 ], [ 10, 14 ], [ 11, 16 ], [ 13, 18 ], [ 14, 17 ], [ 14, 15 ], [ 15, 19 ], [ 16, 13 ], [ 17, 12 ], [ 19, 11 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Evan knows Kerry. Kerry knows Guy. Dahlia knows Miriam. Shannon knows Devin. Jason knows Matt. Jason knows Erwin. Guy knows Herbert. Dahlia knows Jason. Evan knows Kaleb. Alfonso knows Magdalena. Dahlia knows Virginia. Alfonso knows Dahlia. Kerry knows Lillian. Kerry knows Atlas. Matt knows Langston. Guy knows Shannon. Erwin knows Barry. Herbert knows Cain. Which of Guy and Jason can Evan reach?", "answer": "Guy", "steps": [ "Evan knows Kerry.", "Kerry knows Guy." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Evan", "Shannon", "Herbert", "Guy", "Lillian", "Cain", "Devin", "Atlas", "Kaleb", "Kerry", "Alfonso", "Erwin", "Matt", "Jason", "Miriam", "Langston", "Barry", "Virginia", "Magdalena", "Dahlia" ], "edges": [ [ 0, 8 ], [ 0, 9 ], [ 1, 6 ], [ 2, 5 ], [ 3, 2 ], [ 3, 1 ], [ 9, 4 ], [ 9, 3 ], [ 9, 7 ], [ 10, 18 ], [ 10, 19 ], [ 11, 16 ], [ 12, 15 ], [ 13, 12 ], [ 13, 11 ], [ 19, 14 ], [ 19, 13 ], [ 19, 17 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Patrick knows Brent. Lena knows Edgar. Leon knows Dustin. Shelby knows Xander. Dominic knows Lena. Monica knows Griffith. Edgar knows Pete. Patrick knows Monica. Everett knows Shelby. Monica knows Erin. Rocco knows Eloise. Xander knows Rocco. Shelby knows Kit. Griffith knows Dominic. Everett knows Brooks. Neville knows Patrick. Hazel knows Everett. Eloise knows Leon. Which of Xander and Griffith can Neville reach?", "answer": "Griffith", "steps": [ "Neville knows Patrick.", "Patrick knows Monica.", "Monica knows Griffith." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Neville", "Pete", "Dominic", "Brent", "Lena", "Griffith", "Monica", "Erin", "Patrick", "Edgar", "Hazel", "Dustin", "Rocco", "Brooks", "Eloise", "Xander", "Shelby", "Kit", "Everett", "Leon" ], "edges": [ [ 0, 8 ], [ 2, 4 ], [ 4, 9 ], [ 5, 2 ], [ 6, 7 ], [ 6, 5 ], [ 8, 3 ], [ 8, 6 ], [ 9, 1 ], [ 10, 18 ], [ 12, 14 ], [ 14, 19 ], [ 15, 12 ], [ 16, 17 ], [ 16, 15 ], [ 18, 13 ], [ 18, 16 ], [ 19, 11 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Mike knows Laura. Ursula knows Jeremy. Laura knows Stefan. Greta knows Faye. Blanche knows Leon. Ann knows Bernadette. Dalton knows Derek. August knows Heather. Lorraine knows Tyler. Ursula knows Lorraine. Faye knows Dalton. Parker knows Ann. Faye knows Parker. Leon knows Greta. Tyler knows Mike. Miles knows August. Blanche knows Basil. Mike knows Miles. Which of Miles and Parker can Blanche reach?", "answer": "Parker", "steps": [ "Blanche knows Leon.", "Leon knows Greta.", "Greta knows Faye.", "Faye knows Parker." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Blanche", "Greta", "Bernadette", "Dalton", "Basil", "Parker", "Leon", "Faye", "Ann", "Derek", "Ursula", "Tyler", "Heather", "Laura", "Jeremy", "Miles", "Lorraine", "Mike", "August", "Stefan" ], "edges": [ [ 0, 4 ], [ 0, 6 ], [ 1, 7 ], [ 3, 9 ], [ 5, 8 ], [ 6, 1 ], [ 7, 5 ], [ 7, 3 ], [ 8, 2 ], [ 10, 14 ], [ 10, 16 ], [ 11, 17 ], [ 13, 19 ], [ 15, 18 ], [ 16, 11 ], [ 17, 15 ], [ 17, 13 ], [ 18, 12 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Jolena knows Hailey. Cyrus knows George. Jennifer knows Kamila. Grady knows Keaton. Regina knows Cyrus. Hardy knows Regina. Virginia knows Marian. Grady knows Jolena. Brian knows Hardy. Brandon knows Virginia. Hailey knows Jennifer. Brandon knows Brian. Cyrus knows Lance. Keaton knows Lena. Kamila knows Clayton. Marian knows Paul. Lena knows Sheryl. Kamila knows Dominic. Which of Regina and Jennifer can Grady reach?", "answer": "Jennifer", "steps": [ "Grady knows Jolena.", "Jolena knows Hailey.", "Hailey knows Jennifer." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Grady", "Jolena", "Jennifer", "Lena", "Sheryl", "Dominic", "Keaton", "Clayton", "Hailey", "Kamila", "Brandon", "Brian", "Regina", "Marian", "Paul", "Lance", "Virginia", "George", "Hardy", "Cyrus" ], "edges": [ [ 0, 6 ], [ 0, 1 ], [ 1, 8 ], [ 2, 9 ], [ 3, 4 ], [ 6, 3 ], [ 8, 2 ], [ 9, 5 ], [ 9, 7 ], [ 10, 16 ], [ 10, 11 ], [ 11, 18 ], [ 12, 19 ], [ 13, 14 ], [ 16, 13 ], [ 18, 12 ], [ 19, 15 ], [ 19, 17 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Laurel knows Zach. Zelda knows Clifford. Celia knows Atlas. Guy knows Celia. Russell knows Grady. Laurel knows Guy. Casey knows Keaton. Laurel knows Franklin. Dwight knows Tom. Keaton knows Daphna. Tom knows Russell. Imogen knows Jenny. Aaron knows Laurel. Daphna knows Aaron. Luna knows Imogen. Grady knows Zelda. Zelda knows Luna. Zelda knows Cornelius. Which of Tom and Keaton can Dwight reach?", "answer": "Tom", "steps": [ "Dwight knows Tom." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Dwight", "Grady", "Jenny", "Zelda", "Clifford", "Luna", "Russell", "Imogen", "Tom", "Cornelius", "Casey", "Aaron", "Atlas", "Laurel", "Zach", "Guy", "Daphna", "Celia", "Keaton", "Franklin" ], "edges": [ [ 0, 8 ], [ 1, 3 ], [ 3, 4 ], [ 3, 5 ], [ 3, 9 ], [ 5, 7 ], [ 6, 1 ], [ 7, 2 ], [ 8, 6 ], [ 10, 18 ], [ 11, 13 ], [ 13, 14 ], [ 13, 15 ], [ 13, 19 ], [ 15, 17 ], [ 16, 11 ], [ 17, 12 ], [ 18, 16 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Joshua knows Erin. Erin knows Ezra. Damian knows Trevor. Carl knows Diego. Carl knows Julio. Erin knows Sheila. Samantha knows Damian. Jackson knows Dominic. Lambert knows Jorge. Patricia knows Lilia. Dolores knows Kate. Jorge knows Carl. Samantha knows Joshua. Lambert knows Jackson. Carl knows Kara. Erin knows Alma. Erin knows Dolores. Carl knows Patricia. Which of Jorge and Joshua can Samantha reach?", "answer": "Joshua", "steps": [ "Samantha knows Joshua." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Samantha", "Ezra", "Kate", "Damian", "Erin", "Trevor", "Joshua", "Alma", "Sheila", "Dolores", "Lambert", "Julio", "Lilia", "Jackson", "Carl", "Dominic", "Jorge", "Diego", "Kara", "Patricia" ], "edges": [ [ 0, 3 ], [ 0, 6 ], [ 3, 5 ], [ 4, 1 ], [ 4, 7 ], [ 4, 8 ], [ 4, 9 ], [ 6, 4 ], [ 9, 2 ], [ 10, 13 ], [ 10, 16 ], [ 13, 15 ], [ 14, 11 ], [ 14, 17 ], [ 14, 18 ], [ 14, 19 ], [ 16, 14 ], [ 19, 12 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Charlene knows Pearl. Maude knows Colby. Karl knows Leon. Maggie knows Ibrahim. Marco knows Walt. Colby knows Marco. June knows Isadora. Isadora knows Ignacio. Walt knows Alan. Ibrahim knows Fernando. Kathleen knows Gage. Anita knows Charlene. Marco knows June. Colby knows Karl. Charlene knows Maggie. Gage knows Ruby. Pearl knows Ivan. Maggie knows Kathleen. Which of June and Kathleen can Maude reach?", "answer": "June", "steps": [ "Maude knows Colby.", "Colby knows Marco.", "Marco knows June." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Maude", "Ignacio", "Karl", "Marco", "Walt", "Isadora", "Leon", "June", "Colby", "Alan", "Anita", "Ruby", "Pearl", "Maggie", "Ibrahim", "Gage", "Ivan", "Kathleen", "Charlene", "Fernando" ], "edges": [ [ 0, 8 ], [ 2, 6 ], [ 3, 7 ], [ 3, 4 ], [ 4, 9 ], [ 5, 1 ], [ 7, 5 ], [ 8, 2 ], [ 8, 3 ], [ 10, 18 ], [ 12, 16 ], [ 13, 17 ], [ 13, 14 ], [ 14, 19 ], [ 15, 11 ], [ 17, 15 ], [ 18, 12 ], [ 18, 13 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Khashayar knows Luis. Anton knows Bob. Darwin knows Anton. Luis knows Valerie. Elsa knows Lacey. Warren knows Desmond. Claudia knows Khashayar. Judith knows Claudia. Luis knows Ruby. Jack knows Elsa. Desmond knows Darwin. Lacey knows Dahlia. Ibrahim knows Asher. Darwin knows Jack. Lacey knows Gertrude. Asher knows Judith. Judith knows Aubrey. Aubrey knows Kate. Which of Judith and Darwin can Warren reach?", "answer": "Darwin", "steps": [ "Warren knows Desmond.", "Desmond knows Darwin." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Warren", "Desmond", "Gertrude", "Elsa", "Anton", "Lacey", "Darwin", "Dahlia", "Bob", "Jack", "Ibrahim", "Asher", "Valerie", "Khashayar", "Aubrey", "Luis", "Judith", "Ruby", "Kate", "Claudia" ], "edges": [ [ 0, 1 ], [ 1, 6 ], [ 3, 5 ], [ 4, 8 ], [ 5, 2 ], [ 5, 7 ], [ 6, 4 ], [ 6, 9 ], [ 9, 3 ], [ 10, 11 ], [ 11, 16 ], [ 13, 15 ], [ 14, 18 ], [ 15, 12 ], [ 15, 17 ], [ 16, 14 ], [ 16, 19 ], [ 19, 13 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Luis knows Michael. Jim knows Lynn. Winston knows Alana. Stella knows Winston. George knows Eve. Michael knows Nell. Andrea knows Carey. Lenora knows Paul. Eve knows Carol. Luis knows Harlan. Michael knows Stella. Alan knows Fraser. Eden knows Jim. Alan knows George. Alana knows Eden. Andrea knows Alan. Magdalena knows Lenora. Carol knows Magdalena. Which of Winston and Eve can Luis reach?", "answer": "Winston", "steps": [ "Luis knows Michael.", "Michael knows Stella.", "Stella knows Winston." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Luis", "Winston", "Stella", "Eden", "Harlan", "Lynn", "Jim", "Alana", "Michael", "Nell", "Andrea", "Eve", "George", "Magdalena", "Carey", "Paul", "Lenora", "Carol", "Alan", "Fraser" ], "edges": [ [ 0, 4 ], [ 0, 8 ], [ 1, 7 ], [ 2, 1 ], [ 3, 6 ], [ 6, 5 ], [ 7, 3 ], [ 8, 2 ], [ 8, 9 ], [ 10, 14 ], [ 10, 18 ], [ 11, 17 ], [ 12, 11 ], [ 13, 16 ], [ 16, 15 ], [ 17, 13 ], [ 18, 12 ], [ 18, 19 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Louise knows Melissa. June knows Kira. Lambert knows Ashton. Rachel knows Kingsley. Kira knows Morgan. Roman knows Rachel. Melissa knows Ian. Ian knows William. Cora knows Robin. Kingsley knows Stefan. Madeline knows Heather. Darwin knows June. Leo knows Ida. Louise knows Lambert. Ida knows Madeline. Melissa knows Roman. Leo knows Cora. Ida knows Darwin. Which of Darwin and Roman can Leo reach?", "answer": "Darwin", "steps": [ "Leo knows Ida.", "Ida knows Darwin." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Leo", "Kira", "Madeline", "June", "Darwin", "Morgan", "Robin", "Cora", "Heather", "Ida", "Louise", "Kingsley", "Ian", "Rachel", "Roman", "Stefan", "Ashton", "Lambert", "William", "Melissa" ], "edges": [ [ 0, 7 ], [ 0, 9 ], [ 1, 5 ], [ 2, 8 ], [ 3, 1 ], [ 4, 3 ], [ 7, 6 ], [ 9, 4 ], [ 9, 2 ], [ 10, 17 ], [ 10, 19 ], [ 11, 15 ], [ 12, 18 ], [ 13, 11 ], [ 14, 13 ], [ 17, 16 ], [ 19, 14 ], [ 19, 12 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Ariel knows Hope. Tyler knows Fritz. Marcia knows Celia. Henry knows Jeffery. Tyler knows Mary. Tyler knows Cruz. Brandon knows Constance. Brandon knows Ariel. Mary knows Leslie. Brandon knows Alvin. Celia knows Frank. Marcia knows Ebony. Chance knows Sonia. Henry knows Pearl. Leslie knows Brandon. Frank knows Henry. Marcia knows Allison. Henry knows Chance. Which of Leslie and Frank can Tyler reach?", "answer": "Leslie", "steps": [ "Tyler knows Mary.", "Mary knows Leslie." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Tyler", "Mary", "Constance", "Hope", "Leslie", "Cruz", "Ariel", "Fritz", "Brandon", "Alvin", "Marcia", "Celia", "Jeffery", "Sonia", "Frank", "Ebony", "Chance", "Allison", "Henry", "Pearl" ], "edges": [ [ 0, 5 ], [ 0, 7 ], [ 0, 1 ], [ 1, 4 ], [ 4, 8 ], [ 6, 3 ], [ 8, 2 ], [ 8, 6 ], [ 8, 9 ], [ 10, 15 ], [ 10, 17 ], [ 10, 11 ], [ 11, 14 ], [ 14, 18 ], [ 16, 13 ], [ 18, 12 ], [ 18, 16 ], [ 18, 19 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Ellen knows Jenna. Essie knows Sybil. Lynn knows Todd. Leopold knows Hugh. Todd knows Dina. Emery knows Ellen. Emery knows Luke. Milton knows Essie. Joan knows Milton. Shelby knows Joan. Milton knows Leopold. Joan knows Travis. Todd knows Fern. Shelby knows Lois. Ellen knows Lynn. Essie knows Pearl. Rufus knows Garrison. Lynn knows Rufus. Which of Milton and Lynn can Shelby reach?", "answer": "Milton", "steps": [ "Shelby knows Joan.", "Joan knows Milton." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Shelby", "Hugh", "Milton", "Joan", "Travis", "Sybil", "Pearl", "Lois", "Essie", "Leopold", "Emery", "Garrison", "Lynn", "Ellen", "Jenna", "Fern", "Dina", "Luke", "Todd", "Rufus" ], "edges": [ [ 0, 7 ], [ 0, 3 ], [ 2, 8 ], [ 2, 9 ], [ 3, 4 ], [ 3, 2 ], [ 8, 5 ], [ 8, 6 ], [ 9, 1 ], [ 10, 17 ], [ 10, 13 ], [ 12, 18 ], [ 12, 19 ], [ 13, 14 ], [ 13, 12 ], [ 18, 15 ], [ 18, 16 ], [ 19, 11 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Emmett knows Darnell. Patrick knows Felicia. Gideon knows Kurt. Emmett knows Tristan. Emmett knows Patrick. Pearl knows Emmett. Davis knows Calvin. Calvin knows Frida. Lorenzo knows Fanny. Calvin knows Sean. Troy knows Davis. Carrie knows Gideon. Carrie knows Samantha. Travis knows Wanda. Lorenzo knows Pearl. Wanda knows Lorenzo. Sean knows Carrie. Carrie knows Benjamin. Which of Gideon and Patrick can Travis reach?", "answer": "Patrick", "steps": [ "Travis knows Wanda.", "Wanda knows Lorenzo.", "Lorenzo knows Pearl.", "Pearl knows Emmett.", "Emmett knows Patrick." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Travis", "Emmett", "Felicia", "Wanda", "Darnell", "Lorenzo", "Pearl", "Patrick", "Fanny", "Tristan", "Troy", "Carrie", "Kurt", "Davis", "Benjamin", "Calvin", "Sean", "Gideon", "Frida", "Samantha" ], "edges": [ [ 0, 3 ], [ 1, 4 ], [ 1, 7 ], [ 1, 9 ], [ 3, 5 ], [ 5, 8 ], [ 5, 6 ], [ 6, 1 ], [ 7, 2 ], [ 10, 13 ], [ 11, 14 ], [ 11, 17 ], [ 11, 19 ], [ 13, 15 ], [ 15, 18 ], [ 15, 16 ], [ 16, 11 ], [ 17, 12 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Melissa knows Ruby. Darin knows Myrtle. Norman knows Melissa. Darin knows Leopold. Ida knows Joyce. Doris knows Malik. Myrtle knows Kamila. Kamila knows Norman. Joyce knows Louis. Jenny knows Leslie. Yvonne knows Wesley. Leslie knows Ida. Malik knows Darin. Malik knows Cain. Louis knows Yvonne. Clement knows Jenny. Jenny knows Forrest. Leslie knows Jolene. Which of Ida and Myrtle can Doris reach?", "answer": "Myrtle", "steps": [ "Doris knows Malik.", "Malik knows Darin.", "Darin knows Myrtle." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Doris", "Kamila", "Myrtle", "Malik", "Leopold", "Darin", "Melissa", "Ruby", "Norman", "Cain", "Clement", "Joyce", "Ida", "Jenny", "Jolene", "Leslie", "Yvonne", "Wesley", "Louis", "Forrest" ], "edges": [ [ 0, 3 ], [ 1, 8 ], [ 2, 1 ], [ 3, 5 ], [ 3, 9 ], [ 5, 4 ], [ 5, 2 ], [ 6, 7 ], [ 8, 6 ], [ 10, 13 ], [ 11, 18 ], [ 12, 11 ], [ 13, 15 ], [ 13, 19 ], [ 15, 14 ], [ 15, 12 ], [ 16, 17 ], [ 18, 16 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Alfonso knows Eric. Shane knows Elton. Katherine knows Hal. Joanna knows David. Carter knows Gustavo. Alfonso knows Shane. Hudson knows Leon. Jordan knows Virginia. Leon knows Dane. Hal knows Alfonso. Alfonso knows Hayes. Hayes knows Lark. Virginia knows Laura. Virginia knows Carter. Laura knows Raquel. Eric knows Joanna. Virginia knows Hudson. Anastasia knows Jordan. Which of Alfonso and Virginia can Katherine reach?", "answer": "Alfonso", "steps": [ "Katherine knows Hal.", "Hal knows Alfonso." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Katherine", "Eric", "Hayes", "Shane", "David", "Hal", "Alfonso", "Joanna", "Elton", "Lark", "Anastasia", "Hudson", "Carter", "Laura", "Dane", "Jordan", "Virginia", "Leon", "Raquel", "Gustavo" ], "edges": [ [ 0, 5 ], [ 1, 7 ], [ 2, 9 ], [ 3, 8 ], [ 5, 6 ], [ 6, 1 ], [ 6, 3 ], [ 6, 2 ], [ 7, 4 ], [ 10, 15 ], [ 11, 17 ], [ 12, 19 ], [ 13, 18 ], [ 15, 16 ], [ 16, 11 ], [ 16, 13 ], [ 16, 12 ], [ 17, 14 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Glenn knows Desmond. Hayes knows Monica. Levi knows Gerard. Xavier knows Helen. Matt knows Destiny. Marvin knows Glenn. Matthew knows Matt. Kylie knows Fabian. Marvin knows Jason. Jason knows Kylie. Jason knows Levi. Gwen knows Matthew. Xavier knows Earle. Gwen knows Xavier. Glenn knows Cesar. Earle knows Sonia. Matthew knows Hayes. Cesar knows Erma. Which of Destiny and Gerard can Gwen reach?", "answer": "Destiny", "steps": [ "Gwen knows Matthew.", "Matthew knows Matt.", "Matt knows Destiny." ], "difficulty": 3, "original_distance": 3, "idx_to_symbol": [ "Gwen", "Helen", "Monica", "Destiny", "Matt", "Hayes", "Xavier", "Matthew", "Earle", "Sonia", "Marvin", "Desmond", "Fabian", "Gerard", "Levi", "Kylie", "Glenn", "Jason", "Cesar", "Erma" ], "edges": [ [ 0, 7 ], [ 0, 6 ], [ 4, 3 ], [ 5, 2 ], [ 6, 1 ], [ 6, 8 ], [ 7, 4 ], [ 7, 5 ], [ 8, 9 ], [ 10, 17 ], [ 10, 16 ], [ 14, 13 ], [ 15, 12 ], [ 16, 11 ], [ 16, 18 ], [ 17, 14 ], [ 17, 15 ], [ 18, 19 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Troy knows Cassidy. Susanne knows Ebony. Harmony knows Jaime. Franklin knows Lacey. Matthew knows Amy. Dina knows Susanne. Franklin knows Clark. Sadie knows Matthew. Cassidy knows Dina. Troy knows Sadie. Frank knows Franklin. Justin knows Rocco. Troy knows Gustavo. Franklin knows Michelle. Jaime knows Tyler. Darcy knows Troy. Clark knows Justin. Michelle knows Harmony. Which of Cassidy and Michelle can Darcy reach?", "answer": "Cassidy", "steps": [ "Darcy knows Troy.", "Troy knows Cassidy." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Darcy", "Matthew", "Troy", "Amy", "Ebony", "Dina", "Cassidy", "Sadie", "Gustavo", "Susanne", "Frank", "Justin", "Franklin", "Rocco", "Tyler", "Harmony", "Michelle", "Clark", "Lacey", "Jaime" ], "edges": [ [ 0, 2 ], [ 1, 3 ], [ 2, 7 ], [ 2, 8 ], [ 2, 6 ], [ 5, 9 ], [ 6, 5 ], [ 7, 1 ], [ 9, 4 ], [ 10, 12 ], [ 11, 13 ], [ 12, 17 ], [ 12, 18 ], [ 12, 16 ], [ 15, 19 ], [ 16, 15 ], [ 17, 11 ], [ 19, 14 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Francis knows Kenneth. Frank knows Emanuel. Brian knows Erik. Mara knows Leah. Seth knows Beatrice. Frank knows Leigh. Allan knows Mabel. Adele knows Frank. Allan knows Tyler. Emanuel knows Francis. Mabel knows Seth. Leigh knows Amy. Tyler knows Brian. Jackson knows Jodi. Sierra knows Jackson. Amy knows Heather. Jodi knows Allan. Leah knows Adele. Which of Allan and Frank can Mara reach?", "answer": "Frank", "steps": [ "Mara knows Leah.", "Leah knows Adele.", "Adele knows Frank." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Mara", "Leigh", "Francis", "Heather", "Emanuel", "Amy", "Leah", "Frank", "Kenneth", "Adele", "Sierra", "Mabel", "Brian", "Beatrice", "Tyler", "Seth", "Jackson", "Allan", "Erik", "Jodi" ], "edges": [ [ 0, 6 ], [ 1, 5 ], [ 2, 8 ], [ 4, 2 ], [ 5, 3 ], [ 6, 9 ], [ 7, 1 ], [ 7, 4 ], [ 9, 7 ], [ 10, 16 ], [ 11, 15 ], [ 12, 18 ], [ 14, 12 ], [ 15, 13 ], [ 16, 19 ], [ 17, 11 ], [ 17, 14 ], [ 19, 17 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Roger knows Lambert. Trevor knows Louis. Henry knows Virginia. Spencer knows Trevor. Louis knows Henry. Henrietta knows Spencer. Lambert knows Enid. Hope knows Heath. Pearl knows Edwin. Edwin knows Callum. Jakob knows Guy. Carla knows Chester. Lambert knows Carla. Chester knows Hope. Hope knows Pearl. Jakob knows Henrietta. Trevor knows Vera. Cindy knows Jakob. Which of Carla and Henrietta can Roger reach?", "answer": "Carla", "steps": [ "Roger knows Lambert.", "Lambert knows Carla." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Roger", "Heath", "Hope", "Enid", "Pearl", "Chester", "Lambert", "Callum", "Carla", "Edwin", "Cindy", "Vera", "Trevor", "Guy", "Louis", "Spencer", "Jakob", "Virginia", "Henrietta", "Henry" ], "edges": [ [ 0, 6 ], [ 2, 1 ], [ 2, 4 ], [ 4, 9 ], [ 5, 2 ], [ 6, 3 ], [ 6, 8 ], [ 8, 5 ], [ 9, 7 ], [ 10, 16 ], [ 12, 11 ], [ 12, 14 ], [ 14, 19 ], [ 15, 12 ], [ 16, 13 ], [ 16, 18 ], [ 18, 15 ], [ 19, 17 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Lawson knows Rhea. Lucas knows Lawson. Chandler knows Herbert. Cornelius knows Sonia. Rhea knows Jenny. Cornelius knows Kenneth. Tessa knows Chandler. Dalton knows Dean. Dave knows Cornelius. Lawson knows Amber. Chandler knows Leland. Leland knows Marcus. Amber knows Cruz. Jenny knows Dave. Herbert knows Leigh. Dalton knows Larry. Joseph knows Dalton. Leigh knows Joseph. Which of Rhea and Herbert can Tessa reach?", "answer": "Herbert", "steps": [ "Tessa knows Chandler.", "Chandler knows Herbert." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Tessa", "Larry", "Marcus", "Leigh", "Dean", "Herbert", "Joseph", "Dalton", "Leland", "Chandler", "Lucas", "Sonia", "Cruz", "Jenny", "Kenneth", "Rhea", "Dave", "Cornelius", "Amber", "Lawson" ], "edges": [ [ 0, 9 ], [ 3, 6 ], [ 5, 3 ], [ 6, 7 ], [ 7, 1 ], [ 7, 4 ], [ 8, 2 ], [ 9, 5 ], [ 9, 8 ], [ 10, 19 ], [ 13, 16 ], [ 15, 13 ], [ 16, 17 ], [ 17, 11 ], [ 17, 14 ], [ 18, 12 ], [ 19, 15 ], [ 19, 18 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Shane knows Molly. Tina knows Shane. Ilene knows Faith. Molly knows Palmer. Cody knows Paul. Ilene knows Eden. Claire knows Mitchell. Roland knows Chantal. Darrell knows Tina. Bert knows Chloe. Cody knows Bert. Eden knows Darrell. Jade knows Claire. Jade knows Martha. Mitchell knows Roland. Molly knows Annie. Chantal knows Cody. Palmer knows Estella. Which of Shane and Chantal can Jade reach?", "answer": "Chantal", "steps": [ "Jade knows Claire.", "Claire knows Mitchell.", "Mitchell knows Roland.", "Roland knows Chantal." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Jade", "Claire", "Martha", "Mitchell", "Chloe", "Chantal", "Paul", "Bert", "Cody", "Roland", "Ilene", "Eden", "Faith", "Darrell", "Estella", "Shane", "Annie", "Palmer", "Molly", "Tina" ], "edges": [ [ 0, 2 ], [ 0, 1 ], [ 1, 3 ], [ 3, 9 ], [ 5, 8 ], [ 7, 4 ], [ 8, 6 ], [ 8, 7 ], [ 9, 5 ], [ 10, 12 ], [ 10, 11 ], [ 11, 13 ], [ 13, 19 ], [ 15, 18 ], [ 17, 14 ], [ 18, 16 ], [ 18, 17 ], [ 19, 15 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Perry knows Thea. Garland knows Hayley. Cruz knows Cyrus. Lawrence knows Cliff. Stacy knows Garland. Jameson knows Dewey. Thea knows Ava. Vera knows Dallas. Michelle knows Cruz. Corey knows Xander. Michelle knows Vera. Thea knows Merle. Ava knows Michelle. Dewey knows Lawrence. Elijah knows Perry. Asher knows Stacy. Dewey knows Corey. Garland knows Jameson. Which of Dewey and Michelle can Elijah reach?", "answer": "Michelle", "steps": [ "Elijah knows Perry.", "Perry knows Thea.", "Thea knows Ava.", "Ava knows Michelle." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Elijah", "Dallas", "Michelle", "Ava", "Perry", "Cyrus", "Thea", "Merle", "Vera", "Cruz", "Asher", "Xander", "Dewey", "Jameson", "Stacy", "Cliff", "Garland", "Hayley", "Corey", "Lawrence" ], "edges": [ [ 0, 4 ], [ 2, 8 ], [ 2, 9 ], [ 3, 2 ], [ 4, 6 ], [ 6, 7 ], [ 6, 3 ], [ 8, 1 ], [ 9, 5 ], [ 10, 14 ], [ 12, 18 ], [ 12, 19 ], [ 13, 12 ], [ 14, 16 ], [ 16, 17 ], [ 16, 13 ], [ 18, 11 ], [ 19, 15 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Dudley knows Milo. Bill knows Fritz. Dudley knows Lara. Fritz knows Leland. Blair knows Mabel. Ross knows Dudley. Elijah knows Seth. Adam knows Blair. Bill knows Anita. Dudley knows Marcia. Quinn knows Hazel. Marcia knows Daniella. Bill knows Boyd. Leland knows Adam. Fraser knows Quinn. Elijah knows Bill. Ross knows Trina. Daniella knows Fraser. Which of Fritz and Marcia can Ross reach?", "answer": "Marcia", "steps": [ "Ross knows Dudley.", "Dudley knows Marcia." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Ross", "Quinn", "Lara", "Fraser", "Daniella", "Marcia", "Hazel", "Trina", "Milo", "Dudley", "Elijah", "Blair", "Anita", "Adam", "Leland", "Fritz", "Mabel", "Seth", "Boyd", "Bill" ], "edges": [ [ 0, 7 ], [ 0, 9 ], [ 1, 6 ], [ 3, 1 ], [ 4, 3 ], [ 5, 4 ], [ 9, 2 ], [ 9, 5 ], [ 9, 8 ], [ 10, 17 ], [ 10, 19 ], [ 11, 16 ], [ 13, 11 ], [ 14, 13 ], [ 15, 14 ], [ 19, 12 ], [ 19, 15 ], [ 19, 18 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Earle knows Sybil. Sierra knows Earle. Sierra knows Lyle. Anita knows Chad. Anita knows Alyson. Sally knows Roman. Priscilla knows Damien. Jacob knows Anita. Sally knows Earl. Priscilla knows Bette. Sally knows Tony. Evelyn knows Calvin. Bert knows Priscilla. Jacob knows Bert. Calvin knows Sierra. Evelyn knows Sally. Bette knows Larissa. Anita knows Mark. Which of Bert and Calvin can Evelyn reach?", "answer": "Calvin", "steps": [ "Evelyn knows Calvin." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Evelyn", "Sierra", "Sally", "Roman", "Sybil", "Calvin", "Earle", "Tony", "Lyle", "Earl", "Jacob", "Priscilla", "Anita", "Alyson", "Larissa", "Bert", "Bette", "Mark", "Damien", "Chad" ], "edges": [ [ 0, 5 ], [ 0, 2 ], [ 1, 6 ], [ 1, 8 ], [ 2, 3 ], [ 2, 7 ], [ 2, 9 ], [ 5, 1 ], [ 6, 4 ], [ 10, 15 ], [ 10, 12 ], [ 11, 16 ], [ 11, 18 ], [ 12, 13 ], [ 12, 17 ], [ 12, 19 ], [ 15, 11 ], [ 16, 14 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Isla knows Caroline. Hattie knows Bruce. Deirdre knows Chance. Bruce knows Chase. Ford knows Xavier. Andrew knows Laura. Chance knows Nicholas. Chris knows Gunnar. Mara knows Chris. Chris knows Hattie. Bruce knows Andrew. Nicholas knows Greg. Deirdre knows Jem. Hattie knows Knox. Ford knows Deirdre. Isla knows Ford. Chance knows Ronald. Mara knows Brody. Which of Greg and Laura can Isla reach?", "answer": "Greg", "steps": [ "Isla knows Ford.", "Ford knows Deirdre.", "Deirdre knows Chance.", "Chance knows Nicholas.", "Nicholas knows Greg." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Isla", "Deirdre", "Ronald", "Jem", "Greg", "Chance", "Caroline", "Nicholas", "Ford", "Xavier", "Mara", "Hattie", "Chase", "Knox", "Laura", "Bruce", "Brody", "Andrew", "Chris", "Gunnar" ], "edges": [ [ 0, 6 ], [ 0, 8 ], [ 1, 3 ], [ 1, 5 ], [ 5, 2 ], [ 5, 7 ], [ 7, 4 ], [ 8, 1 ], [ 8, 9 ], [ 10, 16 ], [ 10, 18 ], [ 11, 13 ], [ 11, 15 ], [ 15, 12 ], [ 15, 17 ], [ 17, 14 ], [ 18, 11 ], [ 18, 19 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Pauline knows Darius. Mindy knows Chandler. Levi knows Malcolm. Robert knows Pauline. Barry knows Samuel. Rick knows Levi. Leland knows Clinton. Mindy knows Margaret. Robert knows Mindy. Malcolm knows Eldon. Rocco knows Chad. Adele knows Lawrence. Samuel knows Vernon. Leland knows Joseph. Adele knows Barry. Rick knows Robert. Lawrence knows Rocco. Barry knows Leland. Which of Eldon and Chad can Adele reach?", "answer": "Chad", "steps": [ "Adele knows Lawrence.", "Lawrence knows Rocco.", "Rocco knows Chad." ], "difficulty": 3, "original_distance": 3, "idx_to_symbol": [ "Adele", "Samuel", "Chad", "Leland", "Rocco", "Vernon", "Barry", "Lawrence", "Joseph", "Clinton", "Rick", "Pauline", "Eldon", "Mindy", "Malcolm", "Darius", "Robert", "Levi", "Margaret", "Chandler" ], "edges": [ [ 0, 7 ], [ 0, 6 ], [ 1, 5 ], [ 3, 8 ], [ 3, 9 ], [ 4, 2 ], [ 6, 1 ], [ 6, 3 ], [ 7, 4 ], [ 10, 17 ], [ 10, 16 ], [ 11, 15 ], [ 13, 18 ], [ 13, 19 ], [ 14, 12 ], [ 16, 11 ], [ 16, 13 ], [ 17, 14 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Geraldine knows Clyde. Mario knows Gideon. Mario knows Jules. Gail knows Foster. Jules knows Chad. Lynn knows Grant. Lynn knows Kirsten. Bill knows Mario. Foster knows Jessica. Geraldine knows Bill. Rhea knows Sidney. Foster knows Lynn. Jessica knows Kira. Rhea knows Gail. Isla knows Logan. Gideon knows Cole. Jules knows Isla. Kirsten knows Justine. Which of Isla and Kirsten can Geraldine reach?", "answer": "Isla", "steps": [ "Geraldine knows Bill.", "Bill knows Mario.", "Mario knows Jules.", "Jules knows Isla." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Geraldine", "Jules", "Chad", "Gideon", "Clyde", "Cole", "Bill", "Logan", "Mario", "Isla", "Rhea", "Lynn", "Grant", "Jessica", "Sidney", "Kira", "Gail", "Justine", "Foster", "Kirsten" ], "edges": [ [ 0, 4 ], [ 0, 6 ], [ 1, 2 ], [ 1, 9 ], [ 3, 5 ], [ 6, 8 ], [ 8, 3 ], [ 8, 1 ], [ 9, 7 ], [ 10, 14 ], [ 10, 16 ], [ 11, 12 ], [ 11, 19 ], [ 13, 15 ], [ 16, 18 ], [ 18, 13 ], [ 18, 11 ], [ 19, 17 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Cora knows Alder. James knows Noel. Carol knows Gonzalo. Donovan knows Cora. Gonzalo knows Tristan. Ian knows Asher. Donovan knows Phoebe. Fritz knows Dakota. Philip knows Ian. Philip knows Ernesto. Philip knows Angela. Noel knows Glenda. Asher knows Xavier. Ian knows Demetrius. Carol knows Donovan. Cora knows Fritz. James knows Philip. Donovan knows Adam. Which of Donovan and Philip can James reach?", "answer": "Philip", "steps": [ "James knows Philip." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "James", "Ian", "Noel", "Asher", "Ernesto", "Demetrius", "Philip", "Angela", "Glenda", "Xavier", "Carol", "Cora", "Gonzalo", "Fritz", "Phoebe", "Alder", "Donovan", "Adam", "Tristan", "Dakota" ], "edges": [ [ 0, 2 ], [ 0, 6 ], [ 1, 5 ], [ 1, 3 ], [ 2, 8 ], [ 3, 9 ], [ 6, 4 ], [ 6, 7 ], [ 6, 1 ], [ 10, 12 ], [ 10, 16 ], [ 11, 15 ], [ 11, 13 ], [ 12, 18 ], [ 13, 19 ], [ 16, 14 ], [ 16, 17 ], [ 16, 11 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Jane knows Monica. April knows Bette. Gina knows Jane. April knows Marcia. Irving knows Candice. Jonathan knows Boyd. April knows Garrett. April knows Claire. Marcia knows Lynn. Dennis knows Ryan. Dennis knows Abigail. Lynn knows Jonathan. Dennis knows Gina. Dennis knows Sonia. Boyd knows Ann. Monica knows Irving. Dennis knows Forrest. April knows Vicki. Which of Ann and Candice can Dennis reach?", "answer": "Candice", "steps": [ "Dennis knows Gina.", "Gina knows Jane.", "Jane knows Monica.", "Monica knows Irving.", "Irving knows Candice." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Dennis", "Candice", "Irving", "Monica", "Forrest", "Abigail", "Jane", "Sonia", "Gina", "Ryan", "April", "Ann", "Boyd", "Jonathan", "Garrett", "Vicki", "Lynn", "Claire", "Marcia", "Bette" ], "edges": [ [ 0, 4 ], [ 0, 5 ], [ 0, 7 ], [ 0, 8 ], [ 0, 9 ], [ 2, 1 ], [ 3, 2 ], [ 6, 3 ], [ 8, 6 ], [ 10, 14 ], [ 10, 15 ], [ 10, 17 ], [ 10, 18 ], [ 10, 19 ], [ 12, 11 ], [ 13, 12 ], [ 16, 13 ], [ 18, 16 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Greg knows Diego. Graham knows Greg. Odette knows Marian. Tony knows Julio. Dave knows Graham. Madeline knows Kevin. Keith knows Dave. Knox knows Yasmin. Joanna knows Jim. Keith knows Daria. Graham knows Joaquin. Knox knows Joanna. Graham knows Odette. Madeline knows Carmela. Carmela knows Knox. Joaquin knows Natalie. Yasmin knows Margaret. Knox knows Tony. Which of Knox and Graham can Keith reach?", "answer": "Graham", "steps": [ "Keith knows Dave.", "Dave knows Graham." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Keith", "Dave", "Greg", "Daria", "Diego", "Odette", "Graham", "Joaquin", "Marian", "Natalie", "Madeline", "Carmela", "Joanna", "Kevin", "Jim", "Yasmin", "Knox", "Tony", "Margaret", "Julio" ], "edges": [ [ 0, 3 ], [ 0, 1 ], [ 1, 6 ], [ 2, 4 ], [ 5, 8 ], [ 6, 2 ], [ 6, 5 ], [ 6, 7 ], [ 7, 9 ], [ 10, 13 ], [ 10, 11 ], [ 11, 16 ], [ 12, 14 ], [ 15, 18 ], [ 16, 12 ], [ 16, 15 ], [ 16, 17 ], [ 17, 19 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Rhonda knows Ruth. Daria knows Christian. Christian knows Renee. Morgan knows Dahlia. Marcia knows Ben. Morgan knows Forrest. Oliver knows Morgan. Graeme knows Louise. August knows Emery. Renee knows Graeme. Morgan knows Marcia. Daria knows Brock. Marcia knows Gustavo. Ruth knows Will. Bette knows August. Gustavo knows Bette. Ruth knows Daria. Ruth knows June. Which of Marcia and Daria can Rhonda reach?", "answer": "Daria", "steps": [ "Rhonda knows Ruth.", "Ruth knows Daria." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Rhonda", "Graeme", "Brock", "Christian", "June", "Ruth", "Daria", "Renee", "Will", "Louise", "Oliver", "August", "Ben", "Gustavo", "Dahlia", "Morgan", "Marcia", "Bette", "Forrest", "Emery" ], "edges": [ [ 0, 5 ], [ 1, 9 ], [ 3, 7 ], [ 5, 4 ], [ 5, 8 ], [ 5, 6 ], [ 6, 2 ], [ 6, 3 ], [ 7, 1 ], [ 10, 15 ], [ 11, 19 ], [ 13, 17 ], [ 15, 14 ], [ 15, 18 ], [ 15, 16 ], [ 16, 12 ], [ 16, 13 ], [ 17, 11 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Ella knows Anita. Emily knows Denver. Luella knows Todd. Lucille knows Flora. Anita knows Luella. Ella knows Harmony. Lucille knows Harris. Harris knows Jerome. Anita knows Leonard. Emily knows Damian. Gideon knows Lucille. Harris knows Everett. Harrison knows Thea. Clay knows Harrison. Denver knows Ella. Damian knows Frida. Clay knows Gideon. Everett knows Julius. Which of Luella and Everett can Emily reach?", "answer": "Luella", "steps": [ "Emily knows Denver.", "Denver knows Ella.", "Ella knows Anita.", "Anita knows Luella." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Emily", "Frida", "Luella", "Anita", "Denver", "Todd", "Ella", "Damian", "Leonard", "Harmony", "Clay", "Thea", "Everett", "Harris", "Gideon", "Julius", "Lucille", "Harrison", "Jerome", "Flora" ], "edges": [ [ 0, 7 ], [ 0, 4 ], [ 2, 5 ], [ 3, 2 ], [ 3, 8 ], [ 4, 6 ], [ 6, 3 ], [ 6, 9 ], [ 7, 1 ], [ 10, 17 ], [ 10, 14 ], [ 12, 15 ], [ 13, 12 ], [ 13, 18 ], [ 14, 16 ], [ 16, 13 ], [ 16, 19 ], [ 17, 11 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Hadley knows Lyric. Evelyn knows Catherine. Hadley knows Oscar. Griffith knows Deanna. Harrison knows Zach. Riley knows Elaine. Rebecca knows Harrison. Deanna knows Riley. Anita knows Zane. Margaret knows Anita. Anita knows Griffith. Riley knows Keith. Riley knows Evelyn. Lyric knows Odette. Zach knows Jeanne. Harrison knows Jorge. Hadley knows Basil. Jeanne knows Hadley. Which of Jeanne and Deanna can Rebecca reach?", "answer": "Jeanne", "steps": [ "Rebecca knows Harrison.", "Harrison knows Zach.", "Zach knows Jeanne." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Rebecca", "Harrison", "Basil", "Jeanne", "Oscar", "Odette", "Lyric", "Zach", "Jorge", "Hadley", "Margaret", "Anita", "Elaine", "Deanna", "Keith", "Catherine", "Evelyn", "Griffith", "Zane", "Riley" ], "edges": [ [ 0, 1 ], [ 1, 8 ], [ 1, 7 ], [ 3, 9 ], [ 6, 5 ], [ 7, 3 ], [ 9, 2 ], [ 9, 4 ], [ 9, 6 ], [ 10, 11 ], [ 11, 18 ], [ 11, 17 ], [ 13, 19 ], [ 16, 15 ], [ 17, 13 ], [ 19, 12 ], [ 19, 14 ], [ 19, 16 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Brooke knows Leonard. Mae knows Aurora. Alex knows Dick. Gavin knows Gus. Geoffrey knows John. Dick knows Desmond. Aurora knows Electra. Barry knows Gavin. Elvira knows Geoffrey. Lark knows Doug. Gus knows Brooke. Louise knows Janet. Brooke knows Elvira. Pauline knows Alex. Pauline knows Lark. Doug knows Fernando. Leonard knows Louise. Electra knows Pauline. Which of Gus and Electra can Barry reach?", "answer": "Gus", "steps": [ "Barry knows Gavin.", "Gavin knows Gus." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Barry", "Gus", "Gavin", "Leonard", "Elvira", "Janet", "Louise", "John", "Geoffrey", "Brooke", "Mae", "Electra", "Aurora", "Lark", "Alex", "Fernando", "Doug", "Desmond", "Dick", "Pauline" ], "edges": [ [ 0, 2 ], [ 1, 9 ], [ 2, 1 ], [ 3, 6 ], [ 4, 8 ], [ 6, 5 ], [ 8, 7 ], [ 9, 3 ], [ 9, 4 ], [ 10, 12 ], [ 11, 19 ], [ 12, 11 ], [ 13, 16 ], [ 14, 18 ], [ 16, 15 ], [ 18, 17 ], [ 19, 13 ], [ 19, 14 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Donovan knows Neil. Lennox knows Hayley. Dylan knows Guy. Barney knows Nora. Tonya knows Kai. Kai knows Ray. Hank knows Lennox. Dylan knows Donovan. Kai knows Emily. Dylan knows Milo. Lennox knows Carter. Nora knows Tonya. Jocelyn knows Barney. Jocelyn knows Sydney. Jocelyn knows Louis. Curtis knows Hank. Guy knows Curtis. Louis knows Barry. Which of Curtis and Nora can Jocelyn reach?", "answer": "Nora", "steps": [ "Jocelyn knows Barney.", "Barney knows Nora." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Jocelyn", "Emily", "Kai", "Barry", "Barney", "Tonya", "Sydney", "Nora", "Ray", "Louis", "Dylan", "Carter", "Lennox", "Neil", "Guy", "Hank", "Milo", "Curtis", "Hayley", "Donovan" ], "edges": [ [ 0, 6 ], [ 0, 4 ], [ 0, 9 ], [ 2, 1 ], [ 2, 8 ], [ 4, 7 ], [ 5, 2 ], [ 7, 5 ], [ 9, 3 ], [ 10, 16 ], [ 10, 14 ], [ 10, 19 ], [ 12, 11 ], [ 12, 18 ], [ 14, 17 ], [ 15, 12 ], [ 17, 15 ], [ 19, 13 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Jane knows Monica. April knows Bette. Gina knows Jane. April knows Marcia. Irving knows Candice. Jonathan knows Boyd. April knows Garrett. April knows Claire. Marcia knows Lynn. Dennis knows Ryan. Dennis knows Abigail. Lynn knows Jonathan. Dennis knows Gina. Dennis knows Sonia. Boyd knows Ann. Monica knows Irving. Dennis knows Forrest. April knows Vicki. Which of Gina and Marcia can Dennis reach?", "answer": "Gina", "steps": [ "Dennis knows Gina." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Dennis", "Candice", "Irving", "Monica", "Forrest", "Abigail", "Jane", "Sonia", "Gina", "Ryan", "April", "Ann", "Boyd", "Jonathan", "Garrett", "Vicki", "Lynn", "Claire", "Marcia", "Bette" ], "edges": [ [ 0, 4 ], [ 0, 5 ], [ 0, 7 ], [ 0, 8 ], [ 0, 9 ], [ 2, 1 ], [ 3, 2 ], [ 6, 3 ], [ 8, 6 ], [ 10, 14 ], [ 10, 15 ], [ 10, 17 ], [ 10, 18 ], [ 10, 19 ], [ 12, 11 ], [ 13, 12 ], [ 16, 13 ], [ 18, 16 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Elijah knows Yasmin. Val knows Abby. Lloyd knows Estella. Ashton knows Alice. Zach knows Alan. Abby knows Elijah. Ashton knows Laura. Electra knows Fletcher. Don knows Lewis. Abby knows Julius. Jeremy knows Electra. Zelda knows Dante. Elijah knows Zelda. Fabian knows Val. Laura knows Jeremy. Zach knows Ashton. Dante knows Don. Estella knows Zach. Which of Laura and Zelda can Lloyd reach?", "answer": "Laura", "steps": [ "Lloyd knows Estella.", "Estella knows Zach.", "Zach knows Ashton.", "Ashton knows Laura." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Lloyd", "Ashton", "Laura", "Alan", "Zach", "Electra", "Alice", "Jeremy", "Fletcher", "Estella", "Fabian", "Elijah", "Zelda", "Julius", "Abby", "Don", "Yasmin", "Dante", "Lewis", "Val" ], "edges": [ [ 0, 9 ], [ 1, 6 ], [ 1, 2 ], [ 2, 7 ], [ 4, 3 ], [ 4, 1 ], [ 5, 8 ], [ 7, 5 ], [ 9, 4 ], [ 10, 19 ], [ 11, 16 ], [ 11, 12 ], [ 12, 17 ], [ 14, 13 ], [ 14, 11 ], [ 15, 18 ], [ 17, 15 ], [ 19, 14 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Brian knows Aldo. Lorraine knows Troy. Winston knows Derek. Jerry knows Harley. Jerry knows Diego. Harry knows Brian. Grant knows Lorraine. Autumn knows Frida. Troy knows Jerry. Aldo knows Jeff. Harley knows Autumn. Jeff knows Doris. Louisa knows Harry. Doris knows Willard. Diego knows Darrell. Aldo knows Winston. Winston knows Cora. Diego knows Dawn. Which of Harley and Jeff can Louisa reach?", "answer": "Jeff", "steps": [ "Louisa knows Harry.", "Harry knows Brian.", "Brian knows Aldo.", "Aldo knows Jeff." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Louisa", "Willard", "Brian", "Derek", "Aldo", "Doris", "Jeff", "Harry", "Cora", "Winston", "Grant", "Frida", "Troy", "Darrell", "Jerry", "Autumn", "Harley", "Lorraine", "Dawn", "Diego" ], "edges": [ [ 0, 7 ], [ 2, 4 ], [ 4, 6 ], [ 4, 9 ], [ 5, 1 ], [ 6, 5 ], [ 7, 2 ], [ 9, 3 ], [ 9, 8 ], [ 10, 17 ], [ 12, 14 ], [ 14, 16 ], [ 14, 19 ], [ 15, 11 ], [ 16, 15 ], [ 17, 12 ], [ 19, 13 ], [ 19, 18 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Kirk knows Lacey. Yvonne knows Cassidy. Fanny knows Alyssa. Belinda knows Jason. Rhea knows Belinda. Jason knows Isaac. Kirk knows Brody. Jason knows Kirk. Benjamin knows Ashton. Isaac knows Yvonne. Belinda knows Blake. Stella knows Fanny. Adelaide knows Scott. Alyssa knows Benjamin. Adelaide knows Diane. Fanny knows Mark. Ashton knows Dolly. Alyssa knows Adelaide. Which of Ashton and Yvonne can Rhea reach?", "answer": "Yvonne", "steps": [ "Rhea knows Belinda.", "Belinda knows Jason.", "Jason knows Isaac.", "Isaac knows Yvonne." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Rhea", "Brody", "Lacey", "Belinda", "Jason", "Yvonne", "Blake", "Isaac", "Kirk", "Cassidy", "Stella", "Scott", "Diane", "Fanny", "Alyssa", "Ashton", "Mark", "Benjamin", "Adelaide", "Dolly" ], "edges": [ [ 0, 3 ], [ 3, 6 ], [ 3, 4 ], [ 4, 8 ], [ 4, 7 ], [ 5, 9 ], [ 7, 5 ], [ 8, 1 ], [ 8, 2 ], [ 10, 13 ], [ 13, 16 ], [ 13, 14 ], [ 14, 18 ], [ 14, 17 ], [ 15, 19 ], [ 17, 15 ], [ 18, 11 ], [ 18, 12 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Chad knows Tristan. Tristan knows Carlos. Tristan knows Ellis. Damian knows Oliver. Oliver knows Valerie. Flora knows Camille. Leander knows Damian. Ellis knows Ira. Ellis knows Tonya. Quinn knows Jacob. Christopher knows Dwight. Oliver knows Christopher. Alyssa knows Chad. Marlene knows Alyssa. Quinn knows Leander. Christopher knows Flora. Marlene knows Marco. Ira knows Willis. Which of Flora and Ira can Marlene reach?", "answer": "Ira", "steps": [ "Marlene knows Alyssa.", "Alyssa knows Chad.", "Chad knows Tristan.", "Tristan knows Ellis.", "Ellis knows Ira." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Marlene", "Chad", "Ellis", "Willis", "Carlos", "Tristan", "Alyssa", "Marco", "Ira", "Tonya", "Quinn", "Damian", "Christopher", "Camille", "Valerie", "Oliver", "Leander", "Jacob", "Flora", "Dwight" ], "edges": [ [ 0, 7 ], [ 0, 6 ], [ 1, 5 ], [ 2, 8 ], [ 2, 9 ], [ 5, 4 ], [ 5, 2 ], [ 6, 1 ], [ 8, 3 ], [ 10, 17 ], [ 10, 16 ], [ 11, 15 ], [ 12, 18 ], [ 12, 19 ], [ 15, 14 ], [ 15, 12 ], [ 16, 11 ], [ 18, 13 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Liam knows Cassidy. Jill knows Clarence. Chester knows Elsa. George knows Guillermo. Israel knows Cornelius. Guillermo knows Enrique. Cassidy knows George. Whitney knows Marlene. George knows Dawn. Chester knows Kent. Chester knows Jana. Marlene knows Elvis. Elvis knows Chester. Clarence knows Kerry. Kent knows Crystal. Jill knows Liam. George knows Becky. Whitney knows Israel. Which of Cassidy and Elvis can Whitney reach?", "answer": "Elvis", "steps": [ "Whitney knows Marlene.", "Marlene knows Elvis." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Whitney", "Kent", "Crystal", "Israel", "Jana", "Chester", "Cornelius", "Elsa", "Elvis", "Marlene", "Jill", "Guillermo", "Enrique", "Clarence", "Dawn", "George", "Kerry", "Becky", "Cassidy", "Liam" ], "edges": [ [ 0, 3 ], [ 0, 9 ], [ 1, 2 ], [ 3, 6 ], [ 5, 1 ], [ 5, 4 ], [ 5, 7 ], [ 8, 5 ], [ 9, 8 ], [ 10, 13 ], [ 10, 19 ], [ 11, 12 ], [ 13, 16 ], [ 15, 11 ], [ 15, 14 ], [ 15, 17 ], [ 18, 15 ], [ 19, 18 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Mary knows Owen. Owen knows Allen. Allen knows Ernest. Janice knows Alison. Alison knows Jill. Daisy knows Chance. Justin knows Enid. Tina knows Daisy. Ernest knows Josie. Tina knows Joshua. Javier knows Janice. Ernest knows Brittany. Carrie knows Mary. Joshua knows Javier. Harper knows Justin. Carrie knows Harper. Alison knows Nadine. Chance knows Burt. Which of Alison and Ernest can Tina reach?", "answer": "Alison", "steps": [ "Tina knows Joshua.", "Joshua knows Javier.", "Javier knows Janice.", "Janice knows Alison." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Tina", "Nadine", "Joshua", "Daisy", "Jill", "Chance", "Javier", "Alison", "Burt", "Janice", "Carrie", "Josie", "Mary", "Harper", "Brittany", "Justin", "Owen", "Ernest", "Enid", "Allen" ], "edges": [ [ 0, 3 ], [ 0, 2 ], [ 2, 6 ], [ 3, 5 ], [ 5, 8 ], [ 6, 9 ], [ 7, 1 ], [ 7, 4 ], [ 9, 7 ], [ 10, 13 ], [ 10, 12 ], [ 12, 16 ], [ 13, 15 ], [ 15, 18 ], [ 16, 19 ], [ 17, 11 ], [ 17, 14 ], [ 19, 17 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Arden knows Frida. Tina knows Clark. Jeff knows Paige. Tina knows Derek. Lenora knows Jillian. Arden knows Kira. Arden knows Lenora. Lenora knows Brenda. Jillian knows Darin. Darin knows Fred. Darin knows Marian. Hubert knows Robert. Jeff knows Claudia. Jeff knows Hubert. Hank knows Tina. Claudia knows Noel. Frida knows Darcy. Hubert knows Hank. Which of Clark and Marian can Jeff reach?", "answer": "Clark", "steps": [ "Jeff knows Hubert.", "Hubert knows Hank.", "Hank knows Tina.", "Tina knows Clark." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Jeff", "Hank", "Tina", "Clark", "Robert", "Paige", "Noel", "Hubert", "Derek", "Claudia", "Arden", "Jillian", "Darin", "Marian", "Brenda", "Kira", "Darcy", "Lenora", "Fred", "Frida" ], "edges": [ [ 0, 5 ], [ 0, 7 ], [ 0, 9 ], [ 1, 2 ], [ 2, 3 ], [ 2, 8 ], [ 7, 4 ], [ 7, 1 ], [ 9, 6 ], [ 10, 15 ], [ 10, 17 ], [ 10, 19 ], [ 11, 12 ], [ 12, 13 ], [ 12, 18 ], [ 17, 14 ], [ 17, 11 ], [ 19, 16 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Rowan knows Becky. Electra knows Mindy. Becky knows Ethan. Laura knows Ronald. Caroline knows Deanna. Caroline knows Ricardo. Max knows Henrietta. Becky knows Jane. Mindy knows Caroline. Ronald knows Chandler. Mindy knows Cameron. Rocco knows Max. Ethan knows Anita. Ethan knows Laura. Darren knows Tara. Deanna knows Bailey. Caroline knows Rocco. Ethan knows Darren. Which of Becky and Mindy can Rowan reach?", "answer": "Becky", "steps": [ "Rowan knows Becky." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Rowan", "Anita", "Darren", "Jane", "Becky", "Tara", "Laura", "Ethan", "Chandler", "Ronald", "Electra", "Ricardo", "Deanna", "Cameron", "Mindy", "Bailey", "Rocco", "Caroline", "Henrietta", "Max" ], "edges": [ [ 0, 4 ], [ 2, 5 ], [ 4, 3 ], [ 4, 7 ], [ 6, 9 ], [ 7, 1 ], [ 7, 2 ], [ 7, 6 ], [ 9, 8 ], [ 10, 14 ], [ 12, 15 ], [ 14, 13 ], [ 14, 17 ], [ 16, 19 ], [ 17, 11 ], [ 17, 12 ], [ 17, 16 ], [ 19, 18 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Anthony knows Dawn. Marco knows Clay. Chad knows Wendell. Wendell knows Samantha. Kaleb knows Sarah. Damian knows Herman. Keith knows Susanne. Susanne knows Marco. Sarah knows Anthony. Brittany knows Knox. Keith knows Chad. Knox knows Keith. Dawn knows Shelby. Helene knows Luna. Pat knows Brittany. Herman knows Arden. Dawn knows Damian. Shelby knows Helene. Which of Helene and Wendell can Kaleb reach?", "answer": "Helene", "steps": [ "Kaleb knows Sarah.", "Sarah knows Anthony.", "Anthony knows Dawn.", "Dawn knows Shelby.", "Shelby knows Helene." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Kaleb", "Herman", "Dawn", "Sarah", "Luna", "Shelby", "Damian", "Arden", "Anthony", "Helene", "Pat", "Marco", "Keith", "Brittany", "Samantha", "Chad", "Susanne", "Clay", "Knox", "Wendell" ], "edges": [ [ 0, 3 ], [ 1, 7 ], [ 2, 6 ], [ 2, 5 ], [ 3, 8 ], [ 5, 9 ], [ 6, 1 ], [ 8, 2 ], [ 9, 4 ], [ 10, 13 ], [ 11, 17 ], [ 12, 16 ], [ 12, 15 ], [ 13, 18 ], [ 15, 19 ], [ 16, 11 ], [ 18, 12 ], [ 19, 14 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Owen knows Zara. Shawn knows Lyric. Shawn knows Gail. Steve knows Tessa. Pedro knows Shawn. Zara knows Shelby. Emanuel knows Dolly. Zara knows Steve. Jem knows Mia. Helen knows Gina. Selena knows Nadine. Ursula knows Merle. Jem knows Selena. Owen knows Emanuel. Emanuel knows Jaime. Helen knows Owen. Ursula knows Pedro. Pedro knows Jem. Which of Nadine and Tessa can Ursula reach?", "answer": "Nadine", "steps": [ "Ursula knows Pedro.", "Pedro knows Jem.", "Jem knows Selena.", "Selena knows Nadine." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Ursula", "Merle", "Lyric", "Pedro", "Mia", "Nadine", "Shawn", "Jem", "Selena", "Gail", "Helen", "Gina", "Dolly", "Owen", "Shelby", "Tessa", "Emanuel", "Zara", "Steve", "Jaime" ], "edges": [ [ 0, 1 ], [ 0, 3 ], [ 3, 7 ], [ 3, 6 ], [ 6, 2 ], [ 6, 9 ], [ 7, 4 ], [ 7, 8 ], [ 8, 5 ], [ 10, 11 ], [ 10, 13 ], [ 13, 17 ], [ 13, 16 ], [ 16, 12 ], [ 16, 19 ], [ 17, 14 ], [ 17, 18 ], [ 18, 15 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Alfonso knows Eric. Shane knows Elton. Katherine knows Hal. Joanna knows David. Carter knows Gustavo. Alfonso knows Shane. Hudson knows Leon. Jordan knows Virginia. Leon knows Dane. Hal knows Alfonso. Alfonso knows Hayes. Hayes knows Lark. Virginia knows Laura. Virginia knows Carter. Laura knows Raquel. Eric knows Joanna. Virginia knows Hudson. Anastasia knows Jordan. Which of Hudson and Eric can Katherine reach?", "answer": "Eric", "steps": [ "Katherine knows Hal.", "Hal knows Alfonso.", "Alfonso knows Eric." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Katherine", "Eric", "Hayes", "Shane", "David", "Hal", "Alfonso", "Joanna", "Elton", "Lark", "Anastasia", "Hudson", "Carter", "Laura", "Dane", "Jordan", "Virginia", "Leon", "Raquel", "Gustavo" ], "edges": [ [ 0, 5 ], [ 1, 7 ], [ 2, 9 ], [ 3, 8 ], [ 5, 6 ], [ 6, 1 ], [ 6, 3 ], [ 6, 2 ], [ 7, 4 ], [ 10, 15 ], [ 11, 17 ], [ 12, 19 ], [ 13, 18 ], [ 15, 16 ], [ 16, 11 ], [ 16, 13 ], [ 16, 12 ], [ 17, 14 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Vicki knows Miranda. Rowan knows Kay. Rowan knows Percy. Jameson knows Lamont. Rachel knows Lennox. Miranda knows Rowan. Lennox knows Fanny. Lennox knows Garrett. Lennox knows Peggy. Rowan knows Ford. Garrett knows Kenneth. Ford knows Margaret. Merle knows Hayley. Autumn knows Rachel. Kenneth knows Jameson. Jameson knows Griffith. Margaret knows Merle. Merle knows Marvin. Which of Rachel and Miranda can Vicki reach?", "answer": "Miranda", "steps": [ "Vicki knows Miranda." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Vicki", "Miranda", "Ford", "Hayley", "Marvin", "Percy", "Rowan", "Kay", "Margaret", "Merle", "Autumn", "Rachel", "Garrett", "Lamont", "Griffith", "Fanny", "Lennox", "Peggy", "Kenneth", "Jameson" ], "edges": [ [ 0, 1 ], [ 1, 6 ], [ 2, 8 ], [ 6, 5 ], [ 6, 7 ], [ 6, 2 ], [ 8, 9 ], [ 9, 3 ], [ 9, 4 ], [ 10, 11 ], [ 11, 16 ], [ 12, 18 ], [ 16, 15 ], [ 16, 17 ], [ 16, 12 ], [ 18, 19 ], [ 19, 13 ], [ 19, 14 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Omar knows Eli. Abel knows Odette. Judith knows Milton. Andre knows Ingrid. Kenzie knows Raymond. Abel knows Christina. Andre knows Trevor. Bernice knows Lillian. Vance knows Alan. Holden knows Kenzie. Judith knows Camille. Ingrid knows Nell. Alan knows Celia. Bernice knows Omar. Nell knows Holden. Eli knows Vance. Bernice knows Judith. Andre knows Abel. Which of Nell and Eli can Bernice reach?", "answer": "Eli", "steps": [ "Bernice knows Omar.", "Omar knows Eli." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Bernice", "Judith", "Vance", "Alan", "Eli", "Lillian", "Camille", "Omar", "Milton", "Celia", "Andre", "Abel", "Holden", "Kenzie", "Nell", "Trevor", "Christina", "Ingrid", "Odette", "Raymond" ], "edges": [ [ 0, 5 ], [ 0, 1 ], [ 0, 7 ], [ 1, 6 ], [ 1, 8 ], [ 2, 3 ], [ 3, 9 ], [ 4, 2 ], [ 7, 4 ], [ 10, 15 ], [ 10, 11 ], [ 10, 17 ], [ 11, 16 ], [ 11, 18 ], [ 12, 13 ], [ 13, 19 ], [ 14, 12 ], [ 17, 14 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Crystal knows Victor. Guillermo knows Luella. Bette knows Jewel. Renee knows Darcy. Val knows Guillermo. Darcy knows Perry. Martha knows Val. Rhonda knows Catherine. Luella knows Leah. Catherine knows Lucy. Catherine knows Autumn. Victor knows Alfonso. Lucy knows Martin. Martha knows Cruz. Martin knows Bette. Graeme knows Martha. Renee knows Graeme. Crystal knows Rhonda. Which of Jewel and Leah can Crystal reach?", "answer": "Jewel", "steps": [ "Crystal knows Rhonda.", "Rhonda knows Catherine.", "Catherine knows Lucy.", "Lucy knows Martin.", "Martin knows Bette.", "Bette knows Jewel." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Crystal", "Rhonda", "Martin", "Bette", "Victor", "Lucy", "Jewel", "Catherine", "Autumn", "Alfonso", "Renee", "Graeme", "Guillermo", "Luella", "Darcy", "Val", "Leah", "Martha", "Cruz", "Perry" ], "edges": [ [ 0, 1 ], [ 0, 4 ], [ 1, 7 ], [ 2, 3 ], [ 3, 6 ], [ 4, 9 ], [ 5, 2 ], [ 7, 5 ], [ 7, 8 ], [ 10, 11 ], [ 10, 14 ], [ 11, 17 ], [ 12, 13 ], [ 13, 16 ], [ 14, 19 ], [ 15, 12 ], [ 17, 15 ], [ 17, 18 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Keaton knows Elizabeth. Morris knows Maude. Constance knows Michelle. Morris knows Leopold. Michelle knows Keaton. Wade knows Celeste. Constance knows Carey. Celeste knows Isadora. Celeste knows Daniel. Celeste knows Lucille. Keaton knows Morris. Daniel knows Katrina. Katrina knows Victor. Katrina knows Farrah. Constance knows Patrick. Victor knows Elena. Bernadette knows Constance. Victor knows Seth. Which of Michelle and Daniel can Bernadette reach?", "answer": "Michelle", "steps": [ "Bernadette knows Constance.", "Constance knows Michelle." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Bernadette", "Morris", "Keaton", "Constance", "Leopold", "Michelle", "Patrick", "Maude", "Carey", "Elizabeth", "Wade", "Victor", "Katrina", "Celeste", "Elena", "Daniel", "Isadora", "Seth", "Lucille", "Farrah" ], "edges": [ [ 0, 3 ], [ 1, 4 ], [ 1, 7 ], [ 2, 1 ], [ 2, 9 ], [ 3, 6 ], [ 3, 8 ], [ 3, 5 ], [ 5, 2 ], [ 10, 13 ], [ 11, 14 ], [ 11, 17 ], [ 12, 11 ], [ 12, 19 ], [ 13, 16 ], [ 13, 18 ], [ 13, 15 ], [ 15, 12 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Alison knows Caleb. Dean knows Atlas. Dean knows Lenora. Zachary knows Joanna. Ibrahim knows Alison. Zachary knows Kerry. Martha knows Ibrahim. Rick knows Malik. Atlas knows Byron. Darius knows Edith. Atlas knows Rick. Darius knows Dean. Joanna knows Carl. Carl knows Sharon. Serena knows Haley. Alison knows Zachary. Joanna knows Victoria. Haley knows Darius. Which of Rick and Carl can Serena reach?", "answer": "Rick", "steps": [ "Serena knows Haley.", "Haley knows Darius.", "Darius knows Dean.", "Dean knows Atlas.", "Atlas knows Rick." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Serena", "Edith", "Rick", "Dean", "Lenora", "Darius", "Byron", "Malik", "Atlas", "Haley", "Martha", "Caleb", "Carl", "Zachary", "Kerry", "Alison", "Victoria", "Sharon", "Joanna", "Ibrahim" ], "edges": [ [ 0, 9 ], [ 2, 7 ], [ 3, 4 ], [ 3, 8 ], [ 5, 1 ], [ 5, 3 ], [ 8, 6 ], [ 8, 2 ], [ 9, 5 ], [ 10, 19 ], [ 12, 17 ], [ 13, 14 ], [ 13, 18 ], [ 15, 11 ], [ 15, 13 ], [ 18, 16 ], [ 18, 12 ], [ 19, 15 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Gunnar knows Winston. Deborah knows Victor. Laura knows Pam. Celia knows Joel. Victor knows Jack. Dominic knows Susan. Laura knows Julio. Andre knows Corinne. Darren knows Celia. Henrietta knows Deborah. Henrietta knows Candice. Susan knows Terrence. Laura knows Gunnar. Corinne knows Dominic. Winston knows Andre. Joel knows Jaime. Jack knows Darren. Henrietta knows Luis. Which of Andre and Jack can Henrietta reach?", "answer": "Jack", "steps": [ "Henrietta knows Deborah.", "Deborah knows Victor.", "Victor knows Jack." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Henrietta", "Candice", "Deborah", "Jack", "Joel", "Darren", "Jaime", "Luis", "Victor", "Celia", "Laura", "Julio", "Gunnar", "Andre", "Susan", "Corinne", "Terrence", "Pam", "Winston", "Dominic" ], "edges": [ [ 0, 1 ], [ 0, 7 ], [ 0, 2 ], [ 2, 8 ], [ 3, 5 ], [ 4, 6 ], [ 5, 9 ], [ 8, 3 ], [ 9, 4 ], [ 10, 11 ], [ 10, 17 ], [ 10, 12 ], [ 12, 18 ], [ 13, 15 ], [ 14, 16 ], [ 15, 19 ], [ 18, 13 ], [ 19, 14 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Harry knows Joaquin. Boris knows Eric. Lois knows Dina. Eric knows Winifred. Hattie knows Milo. Roger knows Lark. Luna knows Boris. Lark knows Keaton. Keaton knows Zelda. Joaquin knows Vance. Milo knows Julian. Luna knows Fleur. Lois knows Roger. Luna knows Ruth. Zelda knows Hattie. Lois knows Dallas. Elaine knows Harry. Winifred knows Elaine. Which of Winifred and Keaton can Luna reach?", "answer": "Winifred", "steps": [ "Luna knows Boris.", "Boris knows Eric.", "Eric knows Winifred." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Luna", "Vance", "Winifred", "Fleur", "Boris", "Joaquin", "Eric", "Elaine", "Ruth", "Harry", "Lois", "Julian", "Keaton", "Dallas", "Roger", "Milo", "Lark", "Zelda", "Dina", "Hattie" ], "edges": [ [ 0, 3 ], [ 0, 8 ], [ 0, 4 ], [ 2, 7 ], [ 4, 6 ], [ 5, 1 ], [ 6, 2 ], [ 7, 9 ], [ 9, 5 ], [ 10, 13 ], [ 10, 18 ], [ 10, 14 ], [ 12, 17 ], [ 14, 16 ], [ 15, 11 ], [ 16, 12 ], [ 17, 19 ], [ 19, 15 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Tracy knows Chris. Angela knows Joan. Julia knows Rose. Kennedy knows Aldo. Tracy knows Damien. Antonio knows Angela. Joan knows Kennedy. Rose knows Jonathan. Cornelius knows Janice. Kennedy knows Lance. Kennedy knows Cornelius. Tracy knows Donald. Rose knows Gloria. Antonio knows Lenora. Gloria knows Guillermo. Guillermo knows Tracy. Chris knows Langston. Bert knows Antonio. Which of Chris and Cornelius can Julia reach?", "answer": "Chris", "steps": [ "Julia knows Rose.", "Rose knows Gloria.", "Gloria knows Guillermo.", "Guillermo knows Tracy.", "Tracy knows Chris." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Julia", "Guillermo", "Jonathan", "Tracy", "Donald", "Langston", "Rose", "Chris", "Damien", "Gloria", "Bert", "Joan", "Lenora", "Kennedy", "Aldo", "Janice", "Antonio", "Cornelius", "Lance", "Angela" ], "edges": [ [ 0, 6 ], [ 1, 3 ], [ 3, 4 ], [ 3, 7 ], [ 3, 8 ], [ 6, 2 ], [ 6, 9 ], [ 7, 5 ], [ 9, 1 ], [ 10, 16 ], [ 11, 13 ], [ 13, 14 ], [ 13, 17 ], [ 13, 18 ], [ 16, 12 ], [ 16, 19 ], [ 17, 15 ], [ 19, 11 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Omar knows Eli. Abel knows Odette. Judith knows Milton. Andre knows Ingrid. Kenzie knows Raymond. Abel knows Christina. Andre knows Trevor. Bernice knows Lillian. Vance knows Alan. Holden knows Kenzie. Judith knows Camille. Ingrid knows Nell. Alan knows Celia. Bernice knows Omar. Nell knows Holden. Eli knows Vance. Bernice knows Judith. Andre knows Abel. Which of Omar and Ingrid can Bernice reach?", "answer": "Omar", "steps": [ "Bernice knows Omar." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Bernice", "Judith", "Vance", "Alan", "Eli", "Lillian", "Camille", "Omar", "Milton", "Celia", "Andre", "Abel", "Holden", "Kenzie", "Nell", "Trevor", "Christina", "Ingrid", "Odette", "Raymond" ], "edges": [ [ 0, 5 ], [ 0, 1 ], [ 0, 7 ], [ 1, 6 ], [ 1, 8 ], [ 2, 3 ], [ 3, 9 ], [ 4, 2 ], [ 7, 4 ], [ 10, 15 ], [ 10, 11 ], [ 10, 17 ], [ 11, 16 ], [ 11, 18 ], [ 12, 13 ], [ 13, 19 ], [ 14, 12 ], [ 17, 14 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Emmett knows Esperanza. Nadine knows Chase. Cameron knows Sidney. Isiah knows Gene. Emmett knows Nicole. Nadine knows Brad. Declan knows Nadine. Albert knows Isiah. Albert knows Darius. Brad knows Zane. Emmett knows Eileen. Declan knows Cameron. Brad knows Colette. Brad knows Karl. Nicole knows Pablo. Darius knows Emmett. Colette knows Derrick. Darius knows Grant. Which of Emmett and Brad can Declan reach?", "answer": "Brad", "steps": [ "Declan knows Nadine.", "Nadine knows Brad." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Declan", "Brad", "Karl", "Cameron", "Derrick", "Zane", "Colette", "Nadine", "Chase", "Sidney", "Albert", "Emmett", "Esperanza", "Isiah", "Pablo", "Eileen", "Nicole", "Darius", "Grant", "Gene" ], "edges": [ [ 0, 7 ], [ 0, 3 ], [ 1, 2 ], [ 1, 5 ], [ 1, 6 ], [ 3, 9 ], [ 6, 4 ], [ 7, 1 ], [ 7, 8 ], [ 10, 17 ], [ 10, 13 ], [ 11, 12 ], [ 11, 15 ], [ 11, 16 ], [ 13, 19 ], [ 16, 14 ], [ 17, 11 ], [ 17, 18 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Brian knows Aldo. Lorraine knows Troy. Winston knows Derek. Jerry knows Harley. Jerry knows Diego. Harry knows Brian. Grant knows Lorraine. Autumn knows Frida. Troy knows Jerry. Aldo knows Jeff. Harley knows Autumn. Jeff knows Doris. Louisa knows Harry. Doris knows Willard. Diego knows Darrell. Aldo knows Winston. Winston knows Cora. Diego knows Dawn. Which of Lorraine and Harry can Louisa reach?", "answer": "Harry", "steps": [ "Louisa knows Harry." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Louisa", "Willard", "Brian", "Derek", "Aldo", "Doris", "Jeff", "Harry", "Cora", "Winston", "Grant", "Frida", "Troy", "Darrell", "Jerry", "Autumn", "Harley", "Lorraine", "Dawn", "Diego" ], "edges": [ [ 0, 7 ], [ 2, 4 ], [ 4, 6 ], [ 4, 9 ], [ 5, 1 ], [ 6, 5 ], [ 7, 2 ], [ 9, 3 ], [ 9, 8 ], [ 10, 17 ], [ 12, 14 ], [ 14, 16 ], [ 14, 19 ], [ 15, 11 ], [ 16, 15 ], [ 17, 12 ], [ 19, 13 ], [ 19, 18 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Austin knows Molly. Laurel knows Anton. Ellis knows Austin. Karen knows Henrietta. Henrietta knows Kingsley. Austin knows Yara. Grady knows Duke. Dahlia knows Laurel. Ivy knows Yvonne. Nadine knows Shane. Kingsley knows Ivy. Yvonne knows Dahlia. Melanie knows Eamon. Kingsley knows Melanie. Molly knows Lola. Kylie knows Ellis. Yara knows Nadine. Shane knows Grady. Which of Shane and Dahlia can Kylie reach?", "answer": "Shane", "steps": [ "Kylie knows Ellis.", "Ellis knows Austin.", "Austin knows Yara.", "Yara knows Nadine.", "Nadine knows Shane." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Kylie", "Molly", "Austin", "Yara", "Grady", "Shane", "Ellis", "Lola", "Duke", "Nadine", "Karen", "Melanie", "Kingsley", "Ivy", "Laurel", "Dahlia", "Henrietta", "Eamon", "Anton", "Yvonne" ], "edges": [ [ 0, 6 ], [ 1, 7 ], [ 2, 1 ], [ 2, 3 ], [ 3, 9 ], [ 4, 8 ], [ 5, 4 ], [ 6, 2 ], [ 9, 5 ], [ 10, 16 ], [ 11, 17 ], [ 12, 11 ], [ 12, 13 ], [ 13, 19 ], [ 14, 18 ], [ 15, 14 ], [ 16, 12 ], [ 19, 15 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Gonzalo knows Luella. Linda knows Tyler. Ted knows Kimberly. Joshua knows Ian. Rena knows Kate. Autumn knows Kenneth. Ted knows Zelda. Kimberly knows Esme. Tyler knows Rena. Gonzalo knows Joshua. Tyler knows Hayden. Esme knows Winifred. Allison knows Cecilia. Alma knows Sally. Kenneth knows Alma. Winifred knows Linda. Sally knows Gonzalo. Allison knows Autumn. Which of Gonzalo and Tyler can Ted reach?", "answer": "Tyler", "steps": [ "Ted knows Kimberly.", "Kimberly knows Esme.", "Esme knows Winifred.", "Winifred knows Linda.", "Linda knows Tyler." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Ted", "Hayden", "Tyler", "Kimberly", "Kate", "Esme", "Linda", "Rena", "Zelda", "Winifred", "Allison", "Luella", "Gonzalo", "Autumn", "Ian", "Kenneth", "Sally", "Joshua", "Cecilia", "Alma" ], "edges": [ [ 0, 8 ], [ 0, 3 ], [ 2, 1 ], [ 2, 7 ], [ 3, 5 ], [ 5, 9 ], [ 6, 2 ], [ 7, 4 ], [ 9, 6 ], [ 10, 18 ], [ 10, 13 ], [ 12, 11 ], [ 12, 17 ], [ 13, 15 ], [ 15, 19 ], [ 16, 12 ], [ 17, 14 ], [ 19, 16 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "April knows Diane. Damian knows Xavier. Fergus knows April. Clyde knows Pauline. Andrea knows Desmond. Coral knows Damian. Desmond knows Fergus. Andrea knows Graham. Diane knows Tracy. Damian knows Miriam. Diane knows Blair. Elodie knows Sally. Xavier knows Elodie. Justine knows Andrea. Fergus knows Faith. Pauline knows Coral. Elodie knows Monica. Pauline knows Declan. Which of Andrea and Pauline can Justine reach?", "answer": "Andrea", "steps": [ "Justine knows Andrea." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Justine", "Blair", "Andrea", "April", "Desmond", "Faith", "Tracy", "Graham", "Diane", "Fergus", "Clyde", "Monica", "Pauline", "Xavier", "Coral", "Miriam", "Sally", "Declan", "Elodie", "Damian" ], "edges": [ [ 0, 2 ], [ 2, 7 ], [ 2, 4 ], [ 3, 8 ], [ 4, 9 ], [ 8, 1 ], [ 8, 6 ], [ 9, 5 ], [ 9, 3 ], [ 10, 12 ], [ 12, 17 ], [ 12, 14 ], [ 13, 18 ], [ 14, 19 ], [ 18, 11 ], [ 18, 16 ], [ 19, 15 ], [ 19, 13 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Melissa knows Ruby. Darin knows Myrtle. Norman knows Melissa. Darin knows Leopold. Ida knows Joyce. Doris knows Malik. Myrtle knows Kamila. Kamila knows Norman. Joyce knows Louis. Jenny knows Leslie. Yvonne knows Wesley. Leslie knows Ida. Malik knows Darin. Malik knows Cain. Louis knows Yvonne. Clement knows Jenny. Jenny knows Forrest. Leslie knows Jolene. Which of Ruby and Wesley can Doris reach?", "answer": "Ruby", "steps": [ "Doris knows Malik.", "Malik knows Darin.", "Darin knows Myrtle.", "Myrtle knows Kamila.", "Kamila knows Norman.", "Norman knows Melissa.", "Melissa knows Ruby." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Doris", "Kamila", "Myrtle", "Malik", "Leopold", "Darin", "Melissa", "Ruby", "Norman", "Cain", "Clement", "Joyce", "Ida", "Jenny", "Jolene", "Leslie", "Yvonne", "Wesley", "Louis", "Forrest" ], "edges": [ [ 0, 3 ], [ 1, 8 ], [ 2, 1 ], [ 3, 5 ], [ 3, 9 ], [ 5, 4 ], [ 5, 2 ], [ 6, 7 ], [ 8, 6 ], [ 10, 13 ], [ 11, 18 ], [ 12, 11 ], [ 13, 15 ], [ 13, 19 ], [ 15, 14 ], [ 15, 12 ], [ 16, 17 ], [ 18, 16 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Nicholas knows Elsa. Joaquin knows Allen. Fiona knows Joyce. Fiona knows Pablo. Kathleen knows Claudia. Claudia knows Hilda. Peter knows Ashley. Lana knows Alfonso. Yvonne knows Nicholas. Dwight knows Greg. Kathleen knows Lana. Joyce knows Dwight. Yvonne knows Kathleen. Hilda knows Marshall. Claudia knows Jerry. Pablo knows Vicki. Joyce knows Peter. Dwight knows Joaquin. Which of Dwight and Claudia can Fiona reach?", "answer": "Dwight", "steps": [ "Fiona knows Joyce.", "Joyce knows Dwight." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Fiona", "Ashley", "Dwight", "Pablo", "Vicki", "Joyce", "Joaquin", "Greg", "Peter", "Allen", "Yvonne", "Alfonso", "Claudia", "Nicholas", "Elsa", "Kathleen", "Hilda", "Jerry", "Lana", "Marshall" ], "edges": [ [ 0, 3 ], [ 0, 5 ], [ 2, 7 ], [ 2, 6 ], [ 3, 4 ], [ 5, 8 ], [ 5, 2 ], [ 6, 9 ], [ 8, 1 ], [ 10, 13 ], [ 10, 15 ], [ 12, 17 ], [ 12, 16 ], [ 13, 14 ], [ 15, 18 ], [ 15, 12 ], [ 16, 19 ], [ 18, 11 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Yara knows Andre. Irene knows Shelly. Ilene knows Barry. Kent knows Ivy. Brenda knows Sean. Andre knows Heidi. Shelly knows June. Felicia knows Tanya. Heidi knows Ilene. Jameson knows Angelica. Sean knows Jameson. Tanya knows Irene. Felicia knows Hamilton. June knows Brad. Ilene knows Ezra. June knows Jude. Jameson knows Yara. Ivy knows Felicia. Which of Jameson and Felicia can Kent reach?", "answer": "Felicia", "steps": [ "Kent knows Ivy.", "Ivy knows Felicia." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Kent", "Shelly", "Irene", "Ivy", "Brad", "Tanya", "June", "Jude", "Felicia", "Hamilton", "Brenda", "Heidi", "Andre", "Sean", "Ezra", "Yara", "Ilene", "Barry", "Jameson", "Angelica" ], "edges": [ [ 0, 3 ], [ 1, 6 ], [ 2, 1 ], [ 3, 8 ], [ 5, 2 ], [ 6, 4 ], [ 6, 7 ], [ 8, 5 ], [ 8, 9 ], [ 10, 13 ], [ 11, 16 ], [ 12, 11 ], [ 13, 18 ], [ 15, 12 ], [ 16, 14 ], [ 16, 17 ], [ 18, 15 ], [ 18, 19 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Kendrick knows Glenda. Aspen knows Adam. Hattie knows Kendrick. Bernard knows Hattie. Adam knows Karen. David knows Stella. Frida knows Latoya. Hattie knows Bernice. Daphna knows Jorge. Frida knows Aspen. Aspen knows Chantal. Bernard knows Quinn. Frida knows Peggy. Jorge knows Bernard. Stella knows Frida. Karen knows Keira. Bernard knows Teresa. Glenda knows Abby. Which of Jorge and Stella can Daphna reach?", "answer": "Jorge", "steps": [ "Daphna knows Jorge." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Daphna", "Abby", "Kendrick", "Glenda", "Jorge", "Hattie", "Quinn", "Bernard", "Teresa", "Bernice", "David", "Keira", "Adam", "Karen", "Stella", "Aspen", "Latoya", "Frida", "Peggy", "Chantal" ], "edges": [ [ 0, 4 ], [ 2, 3 ], [ 3, 1 ], [ 4, 7 ], [ 5, 2 ], [ 5, 9 ], [ 7, 6 ], [ 7, 8 ], [ 7, 5 ], [ 10, 14 ], [ 12, 13 ], [ 13, 11 ], [ 14, 17 ], [ 15, 12 ], [ 15, 19 ], [ 17, 16 ], [ 17, 18 ], [ 17, 15 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Estella knows Caroline. Stanley knows Susan. Emery knows Estella. Neville knows Emery. Neville knows Julian. Emery knows Dave. Caroline knows Aurora. Wade knows Axel. Charity knows Roger. Wade knows Charity. Kim knows Colette. Wade knows Rosemary. Neville knows Kim. Rosemary knows Lance. Daniella knows Neville. Rosemary knows Stanley. Heidi knows Wade. Susan knows Francesca. Which of Aurora and Francesca can Heidi reach?", "answer": "Francesca", "steps": [ "Heidi knows Wade.", "Wade knows Rosemary.", "Rosemary knows Stanley.", "Stanley knows Susan.", "Susan knows Francesca." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Heidi", "Stanley", "Francesca", "Lance", "Charity", "Rosemary", "Axel", "Susan", "Wade", "Roger", "Daniella", "Estella", "Aurora", "Dave", "Kim", "Emery", "Julian", "Caroline", "Neville", "Colette" ], "edges": [ [ 0, 8 ], [ 1, 7 ], [ 4, 9 ], [ 5, 3 ], [ 5, 1 ], [ 7, 2 ], [ 8, 6 ], [ 8, 5 ], [ 8, 4 ], [ 10, 18 ], [ 11, 17 ], [ 14, 19 ], [ 15, 13 ], [ 15, 11 ], [ 17, 12 ], [ 18, 16 ], [ 18, 15 ], [ 18, 14 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Martin knows Karla. Diego knows Carrie. Conner knows Bella. Judith knows Fletcher. Lennox knows Della. Alyssa knows Juan. Conner knows Michelle. Fletcher knows Hope. Lennox knows Martin. Della knows Kendra. Alyssa knows Conner. Karla knows Gemma. Karla knows Tina. Fletcher knows Diego. Della knows Jeremy. Judith knows Alyssa. Martin knows Dallas. Jeremy knows Flora. Which of Della and Fletcher can Lennox reach?", "answer": "Della", "steps": [ "Lennox knows Della." ], "difficulty": 1, "original_distance": 3, "idx_to_symbol": [ "Lennox", "Gemma", "Flora", "Karla", "Jeremy", "Della", "Tina", "Dallas", "Martin", "Kendra", "Judith", "Bella", "Carrie", "Conner", "Diego", "Fletcher", "Michelle", "Juan", "Alyssa", "Hope" ], "edges": [ [ 0, 8 ], [ 0, 5 ], [ 3, 1 ], [ 3, 6 ], [ 4, 2 ], [ 5, 4 ], [ 5, 9 ], [ 8, 3 ], [ 8, 7 ], [ 10, 18 ], [ 10, 15 ], [ 13, 11 ], [ 13, 16 ], [ 14, 12 ], [ 15, 14 ], [ 15, 19 ], [ 18, 13 ], [ 18, 17 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Jade knows Mara. Garrett knows Logan. Larry knows Desmond. Mara knows Roy. Marie knows Kira. Keegan knows Gail. Keegan knows Hunter. Laverne knows Keegan. Gail knows Neal. Jeffery knows Annie. Hattie knows Marie. Jeffery knows Larry. Drew knows Laverne. Logan knows Susanne. Drew knows Garrett. Marie knows Jade. Kira knows Jeffery. Sharon knows Drew. Which of Marie and Drew can Sharon reach?", "answer": "Drew", "steps": [ "Sharon knows Drew." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Sharon", "Drew", "Laverne", "Hunter", "Gail", "Neal", "Garrett", "Keegan", "Susanne", "Logan", "Hattie", "Marie", "Kira", "Annie", "Larry", "Desmond", "Jade", "Jeffery", "Roy", "Mara" ], "edges": [ [ 0, 1 ], [ 1, 2 ], [ 1, 6 ], [ 2, 7 ], [ 4, 5 ], [ 6, 9 ], [ 7, 3 ], [ 7, 4 ], [ 9, 8 ], [ 10, 11 ], [ 11, 12 ], [ 11, 16 ], [ 12, 17 ], [ 14, 15 ], [ 16, 19 ], [ 17, 13 ], [ 17, 14 ], [ 19, 18 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Arturo knows Antonio. Tom knows Garrison. Daria knows Etta. Etta knows Ted. Antonio knows Tom. Antonio knows Darren. Ryan knows Eamon. Ryan knows Cara. Alyson knows Arturo. Dexter knows Tanya. Frances knows Ryan. Cara knows Dick. Dexter knows Alyson. Lloyd knows Dexter. Daria knows Celia. Daria knows Dean. Dick knows Daria. Antonio knows Willard. Which of Dick and Arturo can Lloyd reach?", "answer": "Arturo", "steps": [ "Lloyd knows Dexter.", "Dexter knows Alyson.", "Alyson knows Arturo." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Lloyd", "Darren", "Dexter", "Tom", "Willard", "Antonio", "Garrison", "Tanya", "Arturo", "Alyson", "Frances", "Celia", "Ryan", "Etta", "Dean", "Daria", "Ted", "Eamon", "Dick", "Cara" ], "edges": [ [ 0, 2 ], [ 2, 7 ], [ 2, 9 ], [ 3, 6 ], [ 5, 1 ], [ 5, 4 ], [ 5, 3 ], [ 8, 5 ], [ 9, 8 ], [ 10, 12 ], [ 12, 17 ], [ 12, 19 ], [ 13, 16 ], [ 15, 11 ], [ 15, 14 ], [ 15, 13 ], [ 18, 15 ], [ 19, 18 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Darwin knows Stella. Sebastian knows Michael. Donna knows Shannon. Lenora knows Brynn. Kit knows Alejandro. Kit knows Lenora. Bailey knows Jewel. Lenora knows Esther. Donna knows Fisher. Bailey knows Ernesto. Donna knows Duncan. Darwin knows Maude. Lenora knows Tina. Sebastian knows Darwin. Bailey knows Ray. Ernesto knows Sebastian. Shannon knows Kit. Darwin knows Foster. Which of Foster and Brynn can Donna reach?", "answer": "Brynn", "steps": [ "Donna knows Shannon.", "Shannon knows Kit.", "Kit knows Lenora.", "Lenora knows Brynn." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Donna", "Fisher", "Lenora", "Tina", "Esther", "Brynn", "Shannon", "Alejandro", "Kit", "Duncan", "Bailey", "Ray", "Darwin", "Stella", "Maude", "Foster", "Ernesto", "Michael", "Sebastian", "Jewel" ], "edges": [ [ 0, 1 ], [ 0, 6 ], [ 0, 9 ], [ 2, 3 ], [ 2, 4 ], [ 2, 5 ], [ 6, 8 ], [ 8, 2 ], [ 8, 7 ], [ 10, 11 ], [ 10, 16 ], [ 10, 19 ], [ 12, 13 ], [ 12, 14 ], [ 12, 15 ], [ 16, 18 ], [ 18, 12 ], [ 18, 17 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Frida knows Kristina. Virginia knows Frida. Fergus knows Hudson. Lena knows Brock. Kristin knows Ralph. Jocelyn knows Kai. Jeremy knows Jocelyn. Kristina knows Alfonso. Harper knows Jillian. Jackson knows Kristin. Hudson knows Harper. Bryan knows Jeremy. Jeremy knows Sue. Kai knows Fergus. Kristin knows Lena. Ralph knows Virginia. Alfonso knows Brian. Sue knows Frank. Which of Kristin and Jeremy can Bryan reach?", "answer": "Jeremy", "steps": [ "Bryan knows Jeremy." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Bryan", "Sue", "Jillian", "Harper", "Jocelyn", "Fergus", "Frank", "Hudson", "Jeremy", "Kai", "Jackson", "Lena", "Brian", "Alfonso", "Ralph", "Frida", "Brock", "Kristina", "Kristin", "Virginia" ], "edges": [ [ 0, 8 ], [ 1, 6 ], [ 3, 2 ], [ 4, 9 ], [ 5, 7 ], [ 7, 3 ], [ 8, 1 ], [ 8, 4 ], [ 9, 5 ], [ 10, 18 ], [ 11, 16 ], [ 13, 12 ], [ 14, 19 ], [ 15, 17 ], [ 17, 13 ], [ 18, 11 ], [ 18, 14 ], [ 19, 15 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Rhonda knows Ruth. Daria knows Christian. Christian knows Renee. Morgan knows Dahlia. Marcia knows Ben. Morgan knows Forrest. Oliver knows Morgan. Graeme knows Louise. August knows Emery. Renee knows Graeme. Morgan knows Marcia. Daria knows Brock. Marcia knows Gustavo. Ruth knows Will. Bette knows August. Gustavo knows Bette. Ruth knows Daria. Ruth knows June. Which of Morgan and Ruth can Rhonda reach?", "answer": "Ruth", "steps": [ "Rhonda knows Ruth." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Rhonda", "Graeme", "Brock", "Christian", "June", "Ruth", "Daria", "Renee", "Will", "Louise", "Oliver", "August", "Ben", "Gustavo", "Dahlia", "Morgan", "Marcia", "Bette", "Forrest", "Emery" ], "edges": [ [ 0, 5 ], [ 1, 9 ], [ 3, 7 ], [ 5, 4 ], [ 5, 8 ], [ 5, 6 ], [ 6, 2 ], [ 6, 3 ], [ 7, 1 ], [ 10, 15 ], [ 11, 19 ], [ 13, 17 ], [ 15, 14 ], [ 15, 18 ], [ 15, 16 ], [ 16, 12 ], [ 16, 13 ], [ 17, 11 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Gareth knows Dee. Scott knows Magdalena. Gareth knows Forrest. Judith knows Diego. Teresa knows Monica. Monica knows Scott. Aaron knows Pierce. Aaron knows Allison. Diego knows Evelyn. Magdalena knows Darnell. Dee knows Ivy. Aaron knows Alison. Alison knows Christian. Evelyn knows Gonzalo. Gonzalo knows Fern. Gareth knows Jon. Fern knows Aaron. Darnell knows Gareth. Which of Darnell and Fern can Teresa reach?", "answer": "Darnell", "steps": [ "Teresa knows Monica.", "Monica knows Scott.", "Scott knows Magdalena.", "Magdalena knows Darnell." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Teresa", "Dee", "Jon", "Gareth", "Forrest", "Scott", "Ivy", "Darnell", "Magdalena", "Monica", "Judith", "Alison", "Allison", "Aaron", "Pierce", "Evelyn", "Christian", "Fern", "Gonzalo", "Diego" ], "edges": [ [ 0, 9 ], [ 1, 6 ], [ 3, 2 ], [ 3, 4 ], [ 3, 1 ], [ 5, 8 ], [ 7, 3 ], [ 8, 7 ], [ 9, 5 ], [ 10, 19 ], [ 11, 16 ], [ 13, 12 ], [ 13, 14 ], [ 13, 11 ], [ 15, 18 ], [ 17, 13 ], [ 18, 17 ], [ 19, 15 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Felicia knows Nell. Yara knows Gilbert. Luella knows Edwin. Dora knows Ellis. Luella knows Catherine. Felicia knows Rachel. Gilbert knows Sadie. Hannah knows Dora. Crystal knows Luella. Catherine knows Marcus. Catherine knows Hannah. Cordelia knows Joel. Marcus knows Edmund. Nell knows Miriam. Crystal knows Kristina. Cordelia knows Felicia. Nell knows Yara. Miriam knows Eleanor. Which of Felicia and Luella can Cordelia reach?", "answer": "Felicia", "steps": [ "Cordelia knows Felicia." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Cordelia", "Eleanor", "Gilbert", "Joel", "Sadie", "Felicia", "Yara", "Nell", "Rachel", "Miriam", "Crystal", "Edmund", "Dora", "Kristina", "Ellis", "Luella", "Hannah", "Catherine", "Edwin", "Marcus" ], "edges": [ [ 0, 3 ], [ 0, 5 ], [ 2, 4 ], [ 5, 8 ], [ 5, 7 ], [ 6, 2 ], [ 7, 6 ], [ 7, 9 ], [ 9, 1 ], [ 10, 13 ], [ 10, 15 ], [ 12, 14 ], [ 15, 18 ], [ 15, 17 ], [ 16, 12 ], [ 17, 16 ], [ 17, 19 ], [ 19, 11 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Candice knows Levi. Ariel knows Candice. Devon knows Todd. Devon knows Marshall. Alexa knows Jasmine. Albert knows Kingsley. Erin knows Faye. Sadie knows Kyle. Sadie knows Kira. Sadie knows Alexa. Alexa knows April. Lorenzo knows Reed. Faye knows Chance. Ariel knows Devon. Devon knows Lorenzo. Lorenzo knows Albert. Erin knows Sadie. Jasmine knows Clarissa. Which of Albert and Jasmine can Ariel reach?", "answer": "Albert", "steps": [ "Ariel knows Devon.", "Devon knows Lorenzo.", "Lorenzo knows Albert." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Ariel", "Kingsley", "Lorenzo", "Candice", "Levi", "Albert", "Todd", "Reed", "Marshall", "Devon", "Erin", "Clarissa", "Alexa", "Faye", "Chance", "Jasmine", "Kyle", "April", "Kira", "Sadie" ], "edges": [ [ 0, 3 ], [ 0, 9 ], [ 2, 5 ], [ 2, 7 ], [ 3, 4 ], [ 5, 1 ], [ 9, 6 ], [ 9, 2 ], [ 9, 8 ], [ 10, 13 ], [ 10, 19 ], [ 12, 15 ], [ 12, 17 ], [ 13, 14 ], [ 15, 11 ], [ 19, 16 ], [ 19, 12 ], [ 19, 18 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Harris knows Ainsley. Franklin knows Raquel. Brian knows Daniella. Larissa knows Milo. Landon knows Susan. Willis knows Charlene. Charlene knows Graham. Clayton knows Brian. Harris knows Hector. Clayton knows Larissa. Hector knows Gwen. Graham knows Bennett. Ainsley knows Freya. Charlene knows Franklin. Gwen knows Clayton. Landon knows Lisette. Lisette knows Lorraine. Susan knows Willis. Which of Clayton and Charlene can Harris reach?", "answer": "Clayton", "steps": [ "Harris knows Hector.", "Hector knows Gwen.", "Gwen knows Clayton." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Harris", "Brian", "Milo", "Freya", "Daniella", "Hector", "Clayton", "Ainsley", "Larissa", "Gwen", "Landon", "Franklin", "Bennett", "Lorraine", "Raquel", "Susan", "Charlene", "Lisette", "Graham", "Willis" ], "edges": [ [ 0, 7 ], [ 0, 5 ], [ 1, 4 ], [ 5, 9 ], [ 6, 1 ], [ 6, 8 ], [ 7, 3 ], [ 8, 2 ], [ 9, 6 ], [ 10, 17 ], [ 10, 15 ], [ 11, 14 ], [ 15, 19 ], [ 16, 11 ], [ 16, 18 ], [ 17, 13 ], [ 18, 12 ], [ 19, 16 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Sue knows Leticia. Russell knows Xavier. Sue knows Yolanda. Xavier knows Hazel. Mae knows Brent. Yolanda knows Zoe. Brent knows Neville. Sue knows Jerry. Fleur knows Jocelyn. Sue knows Daphna. Brent knows Tara. Tara knows Anita. Nathan knows Sue. Yolanda knows Fleur. Daphna knows Chandler. Brent knows Russell. Russell knows Virginia. Brent knows Janet. Which of Hazel and Jocelyn can Mae reach?", "answer": "Hazel", "steps": [ "Mae knows Brent.", "Brent knows Russell.", "Russell knows Xavier.", "Xavier knows Hazel." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Mae", "Neville", "Janet", "Anita", "Russell", "Hazel", "Xavier", "Brent", "Tara", "Virginia", "Nathan", "Leticia", "Jerry", "Chandler", "Yolanda", "Jocelyn", "Fleur", "Sue", "Daphna", "Zoe" ], "edges": [ [ 0, 7 ], [ 4, 6 ], [ 4, 9 ], [ 6, 5 ], [ 7, 1 ], [ 7, 2 ], [ 7, 8 ], [ 7, 4 ], [ 8, 3 ], [ 10, 17 ], [ 14, 16 ], [ 14, 19 ], [ 16, 15 ], [ 17, 11 ], [ 17, 12 ], [ 17, 18 ], [ 17, 14 ], [ 18, 13 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Hazel knows Robert. Ellen knows Martin. Lars knows Charles. Robert knows Hope. Esme knows Bernice. Charles knows Cesar. Heidi knows Ellen. Charles knows Tina. Douglas knows Alfred. Alfred knows Nell. Heidi knows Darcy. Alfred knows Lars. Tina knows Esme. Martin knows Barney. Ellen knows Ricardo. Barney knows Brett. Douglas knows Flora. Barney knows Hazel. Which of Hazel and Tina can Douglas reach?", "answer": "Tina", "steps": [ "Douglas knows Alfred.", "Alfred knows Lars.", "Lars knows Charles.", "Charles knows Tina." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Douglas", "Tina", "Flora", "Lars", "Charles", "Alfred", "Cesar", "Nell", "Bernice", "Esme", "Heidi", "Hazel", "Darcy", "Martin", "Barney", "Ellen", "Brett", "Ricardo", "Hope", "Robert" ], "edges": [ [ 0, 2 ], [ 0, 5 ], [ 1, 9 ], [ 3, 4 ], [ 4, 6 ], [ 4, 1 ], [ 5, 7 ], [ 5, 3 ], [ 9, 8 ], [ 10, 12 ], [ 10, 15 ], [ 11, 19 ], [ 13, 14 ], [ 14, 16 ], [ 14, 11 ], [ 15, 17 ], [ 15, 13 ], [ 19, 18 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Quinn knows Kristina. Ava knows Rufus. Bette knows Raymond. Ava knows Anita. Fanny knows Nicole. Janice knows Vivian. Janice knows Enid. Janice knows Quinn. Rufus knows Fanny. Nicole knows Enrique. Madeline knows Griffith. Kristina knows Edith. Ava knows Bette. Enid knows Anton. Glenda knows Madeline. Edith knows Glenda. Enrique knows Jonathan. Jonathan knows Dahlia. Which of Dahlia and Griffith can Ava reach?", "answer": "Dahlia", "steps": [ "Ava knows Rufus.", "Rufus knows Fanny.", "Fanny knows Nicole.", "Nicole knows Enrique.", "Enrique knows Jonathan.", "Jonathan knows Dahlia." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Ava", "Raymond", "Dahlia", "Jonathan", "Enrique", "Rufus", "Bette", "Nicole", "Anita", "Fanny", "Janice", "Anton", "Griffith", "Madeline", "Glenda", "Quinn", "Enid", "Edith", "Vivian", "Kristina" ], "edges": [ [ 0, 6 ], [ 0, 8 ], [ 0, 5 ], [ 3, 2 ], [ 4, 3 ], [ 5, 9 ], [ 6, 1 ], [ 7, 4 ], [ 9, 7 ], [ 10, 16 ], [ 10, 18 ], [ 10, 15 ], [ 13, 12 ], [ 14, 13 ], [ 15, 19 ], [ 16, 11 ], [ 17, 14 ], [ 19, 17 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Hudson knows Nash. Cruz knows Mara. Dudley knows Douglas. Deirdre knows Kobe. Monroe knows Palmer. Kobe knows Andrew. Farrah knows Hudson. Sandra knows Monroe. Nash knows Dudley. Douglas knows Damian. Hudson knows Rhea. Rhea knows Kendra. Mara knows Burt. Andrew knows Norma. Cruz knows Deirdre. Wendy knows Farrah. Zane knows Wendy. Palmer knows Cruz. Which of Norma and Damian can Sandra reach?", "answer": "Norma", "steps": [ "Sandra knows Monroe.", "Monroe knows Palmer.", "Palmer knows Cruz.", "Cruz knows Deirdre.", "Deirdre knows Kobe.", "Kobe knows Andrew.", "Andrew knows Norma." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Sandra", "Cruz", "Mara", "Burt", "Andrew", "Deirdre", "Norma", "Kobe", "Monroe", "Palmer", "Zane", "Hudson", "Rhea", "Kendra", "Douglas", "Nash", "Damian", "Dudley", "Wendy", "Farrah" ], "edges": [ [ 0, 8 ], [ 1, 2 ], [ 1, 5 ], [ 2, 3 ], [ 4, 6 ], [ 5, 7 ], [ 7, 4 ], [ 8, 9 ], [ 9, 1 ], [ 10, 18 ], [ 11, 12 ], [ 11, 15 ], [ 12, 13 ], [ 14, 16 ], [ 15, 17 ], [ 17, 14 ], [ 18, 19 ], [ 19, 11 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Darin knows Asher. Stefan knows Geneva. Sandy knows Blanche. Asher knows Flora. Cliff knows Owen. Cliff knows Stefan. Brent knows Malik. Patrick knows Pauline. Flora knows Sandy. Cliff knows Autumn. Flora knows Vanessa. Stella knows Luz. Flora knows Jillian. Pauline knows Cliff. Stefan knows Destiny. Sandy knows Brent. Malik knows Anthony. Destiny knows Stella. Which of Stella and Malik can Patrick reach?", "answer": "Stella", "steps": [ "Patrick knows Pauline.", "Pauline knows Cliff.", "Cliff knows Stefan.", "Stefan knows Destiny.", "Destiny knows Stella." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Patrick", "Luz", "Stefan", "Owen", "Cliff", "Pauline", "Stella", "Destiny", "Geneva", "Autumn", "Darin", "Anthony", "Sandy", "Vanessa", "Flora", "Asher", "Malik", "Brent", "Blanche", "Jillian" ], "edges": [ [ 0, 5 ], [ 2, 7 ], [ 2, 8 ], [ 4, 3 ], [ 4, 2 ], [ 4, 9 ], [ 5, 4 ], [ 6, 1 ], [ 7, 6 ], [ 10, 15 ], [ 12, 17 ], [ 12, 18 ], [ 14, 13 ], [ 14, 12 ], [ 14, 19 ], [ 15, 14 ], [ 16, 11 ], [ 17, 16 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Dennis knows Atlas. Ainsley knows Cristina. Hampton knows Dennis. Jacques knows Ross. Rose knows Harlan. Tabitha knows Graham. Rose knows Jacques. Cristina knows Justine. Harlan knows Tabitha. Atlas knows Jean. Graham knows Jennifer. Jacques knows Gerard. Justine knows Susanne. Dennis knows Clayton. Jean knows Linda. Beau knows Erica. Hampton knows Ainsley. Gerard knows Beau. Which of Erica and Linda can Rose reach?", "answer": "Erica", "steps": [ "Rose knows Jacques.", "Jacques knows Gerard.", "Gerard knows Beau.", "Beau knows Erica." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Rose", "Erica", "Tabitha", "Graham", "Jennifer", "Ross", "Jacques", "Harlan", "Gerard", "Beau", "Hampton", "Linda", "Cristina", "Justine", "Susanne", "Clayton", "Dennis", "Ainsley", "Atlas", "Jean" ], "edges": [ [ 0, 7 ], [ 0, 6 ], [ 2, 3 ], [ 3, 4 ], [ 6, 5 ], [ 6, 8 ], [ 7, 2 ], [ 8, 9 ], [ 9, 1 ], [ 10, 17 ], [ 10, 16 ], [ 12, 13 ], [ 13, 14 ], [ 16, 15 ], [ 16, 18 ], [ 17, 12 ], [ 18, 19 ], [ 19, 11 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Wendy knows Wade. Jamie knows Wendy. Justine knows Jamie. Lamont knows Nell. Wendy knows Owen. Gail knows Helene. Gail knows Anna. Vera knows Jewel. Arthur knows Lamont. Ivy knows Vera. Owen knows Bernadette. Federico knows Gail. Cecilia knows Jacob. Owen knows Arthur. Helene knows Ivy. Jacob knows Federico. Dahlia knows Justine. Helene knows Kristina. Which of Owen and Helene can Dahlia reach?", "answer": "Owen", "steps": [ "Dahlia knows Justine.", "Justine knows Jamie.", "Jamie knows Wendy.", "Wendy knows Owen." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Dahlia", "Justine", "Lamont", "Bernadette", "Owen", "Wade", "Nell", "Wendy", "Jamie", "Arthur", "Cecilia", "Jacob", "Vera", "Kristina", "Helene", "Anna", "Jewel", "Gail", "Federico", "Ivy" ], "edges": [ [ 0, 1 ], [ 1, 8 ], [ 2, 6 ], [ 4, 3 ], [ 4, 9 ], [ 7, 5 ], [ 7, 4 ], [ 8, 7 ], [ 9, 2 ], [ 10, 11 ], [ 11, 18 ], [ 12, 16 ], [ 14, 13 ], [ 14, 19 ], [ 17, 15 ], [ 17, 14 ], [ 18, 17 ], [ 19, 12 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Yara knows Andre. Irene knows Shelly. Ilene knows Barry. Kent knows Ivy. Brenda knows Sean. Andre knows Heidi. Shelly knows June. Felicia knows Tanya. Heidi knows Ilene. Jameson knows Angelica. Sean knows Jameson. Tanya knows Irene. Felicia knows Hamilton. June knows Brad. Ilene knows Ezra. June knows Jude. Jameson knows Yara. Ivy knows Felicia. Which of Yara and Tanya can Kent reach?", "answer": "Tanya", "steps": [ "Kent knows Ivy.", "Ivy knows Felicia.", "Felicia knows Tanya." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Kent", "Shelly", "Irene", "Ivy", "Brad", "Tanya", "June", "Jude", "Felicia", "Hamilton", "Brenda", "Heidi", "Andre", "Sean", "Ezra", "Yara", "Ilene", "Barry", "Jameson", "Angelica" ], "edges": [ [ 0, 3 ], [ 1, 6 ], [ 2, 1 ], [ 3, 8 ], [ 5, 2 ], [ 6, 4 ], [ 6, 7 ], [ 8, 5 ], [ 8, 9 ], [ 10, 13 ], [ 11, 16 ], [ 12, 11 ], [ 13, 18 ], [ 15, 12 ], [ 16, 14 ], [ 16, 17 ], [ 18, 15 ], [ 18, 19 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Rena knows Lola. Federico knows Flora. Sheryl knows Bart. Flora knows Eldon. Flora knows Keaton. April knows Ralph. Beau knows Jacob. April knows Beau. Elvis knows April. Flora knows Carlos. Keaton knows Rena. April knows Sheryl. Julius knows Gerald. Eldon knows Erma. Carlos knows Burt. Ralph knows Rose. Lola knows Kingsley. Bart knows Julius. Which of Keaton and Sheryl can Federico reach?", "answer": "Keaton", "steps": [ "Federico knows Flora.", "Flora knows Keaton." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Federico", "Erma", "Rena", "Keaton", "Carlos", "Burt", "Eldon", "Lola", "Kingsley", "Flora", "Elvis", "Rose", "Bart", "Sheryl", "Beau", "Jacob", "Ralph", "Julius", "Gerald", "April" ], "edges": [ [ 0, 9 ], [ 2, 7 ], [ 3, 2 ], [ 4, 5 ], [ 6, 1 ], [ 7, 8 ], [ 9, 4 ], [ 9, 6 ], [ 9, 3 ], [ 10, 19 ], [ 12, 17 ], [ 13, 12 ], [ 14, 15 ], [ 16, 11 ], [ 17, 18 ], [ 19, 14 ], [ 19, 16 ], [ 19, 13 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Lawson knows Rhea. Lucas knows Lawson. Chandler knows Herbert. Cornelius knows Sonia. Rhea knows Jenny. Cornelius knows Kenneth. Tessa knows Chandler. Dalton knows Dean. Dave knows Cornelius. Lawson knows Amber. Chandler knows Leland. Leland knows Marcus. Amber knows Cruz. Jenny knows Dave. Herbert knows Leigh. Dalton knows Larry. Joseph knows Dalton. Leigh knows Joseph. Which of Leigh and Jenny can Tessa reach?", "answer": "Leigh", "steps": [ "Tessa knows Chandler.", "Chandler knows Herbert.", "Herbert knows Leigh." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Tessa", "Larry", "Marcus", "Leigh", "Dean", "Herbert", "Joseph", "Dalton", "Leland", "Chandler", "Lucas", "Sonia", "Cruz", "Jenny", "Kenneth", "Rhea", "Dave", "Cornelius", "Amber", "Lawson" ], "edges": [ [ 0, 9 ], [ 3, 6 ], [ 5, 3 ], [ 6, 7 ], [ 7, 1 ], [ 7, 4 ], [ 8, 2 ], [ 9, 5 ], [ 9, 8 ], [ 10, 19 ], [ 13, 16 ], [ 15, 13 ], [ 16, 17 ], [ 17, 11 ], [ 17, 14 ], [ 18, 12 ], [ 19, 15 ], [ 19, 18 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Ariana knows Fletcher. Harley knows Federico. Ariana knows Lisa. Ariana knows Henrietta. Erica knows Fisher. Erica knows Gage. Joyce knows Leon. Javier knows Sandy. Dexter knows Joyce. Javier knows Herbert. Henrietta knows Dexter. Dexter knows Garrison. Dexter knows Natalie. Erica knows Jeanne. Gage knows Javier. Javier knows Harley. Harley knows Bella. Joyce knows Enid. Which of Joyce and Harley can Ariana reach?", "answer": "Joyce", "steps": [ "Ariana knows Henrietta.", "Henrietta knows Dexter.", "Dexter knows Joyce." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Ariana", "Enid", "Fletcher", "Lisa", "Henrietta", "Garrison", "Leon", "Natalie", "Joyce", "Dexter", "Erica", "Bella", "Jeanne", "Fisher", "Gage", "Sandy", "Federico", "Herbert", "Harley", "Javier" ], "edges": [ [ 0, 2 ], [ 0, 3 ], [ 0, 4 ], [ 4, 9 ], [ 8, 1 ], [ 8, 6 ], [ 9, 5 ], [ 9, 7 ], [ 9, 8 ], [ 10, 12 ], [ 10, 13 ], [ 10, 14 ], [ 14, 19 ], [ 18, 11 ], [ 18, 16 ], [ 19, 15 ], [ 19, 17 ], [ 19, 18 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Fred knows Darrell. Hayes knows Beverly. Agnes knows Mike. Oliver knows Roman. Yvonne knows Larry. Larry knows Daisy. Daisy knows Darnell. Julia knows Lucia. Gabriel knows Oliver. Hayes knows Walter. April knows Gabriel. Jamie knows Yvonne. Gabriel knows Troy. Gabriel knows Craig. Lucia knows Agnes. Mike knows April. Darnell knows Hayes. Hayes knows Fred. Which of Yvonne and Lucia can Jamie reach?", "answer": "Yvonne", "steps": [ "Jamie knows Yvonne." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Jamie", "Larry", "Darrell", "Hayes", "Fred", "Walter", "Yvonne", "Daisy", "Darnell", "Beverly", "Julia", "Agnes", "Roman", "Gabriel", "Oliver", "Craig", "Lucia", "Mike", "April", "Troy" ], "edges": [ [ 0, 6 ], [ 1, 7 ], [ 3, 4 ], [ 3, 5 ], [ 3, 9 ], [ 4, 2 ], [ 6, 1 ], [ 7, 8 ], [ 8, 3 ], [ 10, 16 ], [ 11, 17 ], [ 13, 14 ], [ 13, 15 ], [ 13, 19 ], [ 14, 12 ], [ 16, 11 ], [ 17, 18 ], [ 18, 13 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Amelia knows Pearl. Amelia knows Chloe. Chloe knows Aisha. Dustin knows Olivia. Lacey knows Dustin. Walt knows Paul. Theodore knows Esme. Walt knows Inez. Aisha knows Clifford. Aisha knows Dakota. Aisha knows Fleur. Ken knows Clayton. Olivia knows Walt. Dakota knows Theodore. Trudy knows Amelia. Grady knows Ken. Dustin knows Val. Walt knows Grady. Which of Theodore and Ken can Lacey reach?", "answer": "Ken", "steps": [ "Lacey knows Dustin.", "Dustin knows Olivia.", "Olivia knows Walt.", "Walt knows Grady.", "Grady knows Ken." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Lacey", "Inez", "Olivia", "Walt", "Val", "Ken", "Clayton", "Grady", "Dustin", "Paul", "Trudy", "Fleur", "Chloe", "Aisha", "Pearl", "Theodore", "Esme", "Dakota", "Amelia", "Clifford" ], "edges": [ [ 0, 8 ], [ 2, 3 ], [ 3, 1 ], [ 3, 7 ], [ 3, 9 ], [ 5, 6 ], [ 7, 5 ], [ 8, 4 ], [ 8, 2 ], [ 10, 18 ], [ 12, 13 ], [ 13, 11 ], [ 13, 17 ], [ 13, 19 ], [ 15, 16 ], [ 17, 15 ], [ 18, 14 ], [ 18, 12 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Stacy knows Eden. Jasmine knows Morris. Christopher knows Lisette. Heather knows Louisa. Dylan knows Heather. Evan knows Sheila. Stacy knows Joaquin. Leopold knows Jasmine. Joaquin knows Stephen. Dylan knows Ella. Christopher knows Stacy. Heather knows Duke. Marian knows Evan. Louisa knows Marvin. Louisa knows Colin. Joaquin knows Edison. Edison knows Marian. Colin knows Leopold. Which of Colin and Edison can Christopher reach?", "answer": "Edison", "steps": [ "Christopher knows Stacy.", "Stacy knows Joaquin.", "Joaquin knows Edison." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Christopher", "Stacy", "Sheila", "Joaquin", "Edison", "Marian", "Lisette", "Eden", "Evan", "Stephen", "Dylan", "Heather", "Morris", "Louisa", "Colin", "Leopold", "Ella", "Duke", "Jasmine", "Marvin" ], "edges": [ [ 0, 6 ], [ 0, 1 ], [ 1, 7 ], [ 1, 3 ], [ 3, 4 ], [ 3, 9 ], [ 4, 5 ], [ 5, 8 ], [ 8, 2 ], [ 10, 16 ], [ 10, 11 ], [ 11, 17 ], [ 11, 13 ], [ 13, 14 ], [ 13, 19 ], [ 14, 15 ], [ 15, 18 ], [ 18, 12 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Priscilla knows Katherine. Gemma knows Linda. Jay knows Willard. Annette knows Fergus. Myrtle knows Cesar. Eleanor knows Finn. Katherine knows Annette. Annette knows Myrtle. Veronica knows Tim. Tim knows Gemma. Veronica knows Kenneth. Luis knows Priscilla. Linda knows Eleanor. Kenneth knows Dolores. Luis knows Jay. India knows Angelica. Linda knows India. Fergus knows Charles. Which of Finn and Cesar can Veronica reach?", "answer": "Finn", "steps": [ "Veronica knows Tim.", "Tim knows Gemma.", "Gemma knows Linda.", "Linda knows Eleanor.", "Eleanor knows Finn." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Veronica", "Tim", "Gemma", "India", "Linda", "Eleanor", "Angelica", "Kenneth", "Finn", "Dolores", "Luis", "Priscilla", "Katherine", "Fergus", "Annette", "Myrtle", "Charles", "Jay", "Cesar", "Willard" ], "edges": [ [ 0, 1 ], [ 0, 7 ], [ 1, 2 ], [ 2, 4 ], [ 3, 6 ], [ 4, 3 ], [ 4, 5 ], [ 5, 8 ], [ 7, 9 ], [ 10, 11 ], [ 10, 17 ], [ 11, 12 ], [ 12, 14 ], [ 13, 16 ], [ 14, 13 ], [ 14, 15 ], [ 15, 18 ], [ 17, 19 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Marcus knows Gene. Stephanie knows Ernie. Jane knows Brody. Wendell knows Effie. Perry knows Lauren. Lauren knows Marcus. Ernie knows Colette. Wendell knows Milton. Zoe knows Stephanie. Riley knows Jane. Lyric knows Simon. Milton knows Rocco. Colette knows Wendell. Lauren knows Arturo. Arturo knows Hector. Stephanie knows Lyric. Riley knows Jon. Gene knows Riley. Which of Wendell and Riley can Zoe reach?", "answer": "Wendell", "steps": [ "Zoe knows Stephanie.", "Stephanie knows Ernie.", "Ernie knows Colette.", "Colette knows Wendell." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Zoe", "Stephanie", "Lyric", "Colette", "Effie", "Ernie", "Simon", "Wendell", "Rocco", "Milton", "Perry", "Lauren", "Arturo", "Gene", "Jon", "Marcus", "Hector", "Riley", "Brody", "Jane" ], "edges": [ [ 0, 1 ], [ 1, 2 ], [ 1, 5 ], [ 2, 6 ], [ 3, 7 ], [ 5, 3 ], [ 7, 4 ], [ 7, 9 ], [ 9, 8 ], [ 10, 11 ], [ 11, 12 ], [ 11, 15 ], [ 12, 16 ], [ 13, 17 ], [ 15, 13 ], [ 17, 14 ], [ 17, 19 ], [ 19, 18 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Sheila knows August. Lars knows Henrietta. Allan knows Gladys. Jared knows Jasmine. Tim knows Ernie. Ernie knows Sheila. Jared knows Troy. Glenda knows Harper. Ian knows Glenda. Lars knows Samantha. Henrietta knows Ian. August knows Celia. Eloise knows Erica. Erica knows Aubrey. Jasmine knows Allan. Ian knows Bert. Allan knows Tim. Harper knows Eloise. Which of Eloise and Sheila can Lars reach?", "answer": "Eloise", "steps": [ "Lars knows Henrietta.", "Henrietta knows Ian.", "Ian knows Glenda.", "Glenda knows Harper.", "Harper knows Eloise." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Lars", "Harper", "Glenda", "Ian", "Erica", "Samantha", "Henrietta", "Aubrey", "Eloise", "Bert", "Jared", "Ernie", "Tim", "Allan", "August", "Troy", "Jasmine", "Celia", "Sheila", "Gladys" ], "edges": [ [ 0, 5 ], [ 0, 6 ], [ 1, 8 ], [ 2, 1 ], [ 3, 2 ], [ 3, 9 ], [ 4, 7 ], [ 6, 3 ], [ 8, 4 ], [ 10, 15 ], [ 10, 16 ], [ 11, 18 ], [ 12, 11 ], [ 13, 12 ], [ 13, 19 ], [ 14, 17 ], [ 16, 13 ], [ 18, 14 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Lara knows Hardy. Kathleen knows Oliver. Margaret knows Khashayar. Reid knows Ignacio. Hardy knows Reid. Mitchell knows Ava. Ignacio knows Damien. Margaret knows Pedro. Donna knows Arthur. Oliver knows Ruth. Arthur knows Fritz. Ignacio knows Kieran. Reid knows Valerie. Ruth knows Donna. Ruth knows Margaret. Pedro knows Dean. Damien knows Tabitha. Valerie knows Mitchell. Which of Valerie and Donna can Lara reach?", "answer": "Valerie", "steps": [ "Lara knows Hardy.", "Hardy knows Reid.", "Reid knows Valerie." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Lara", "Valerie", "Mitchell", "Hardy", "Kieran", "Ignacio", "Reid", "Damien", "Ava", "Tabitha", "Kathleen", "Donna", "Arthur", "Oliver", "Khashayar", "Margaret", "Ruth", "Pedro", "Fritz", "Dean" ], "edges": [ [ 0, 3 ], [ 1, 2 ], [ 2, 8 ], [ 3, 6 ], [ 5, 4 ], [ 5, 7 ], [ 6, 1 ], [ 6, 5 ], [ 7, 9 ], [ 10, 13 ], [ 11, 12 ], [ 12, 18 ], [ 13, 16 ], [ 15, 14 ], [ 15, 17 ], [ 16, 11 ], [ 16, 15 ], [ 17, 19 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Erin knows Brock. Isabel knows Terry. Trudy knows Gwen. Jameson knows Trudy. Terry knows Mabel. Yolanda knows Hadley. Jacqueline knows Zach. Jacqueline knows Yolanda. Hadley knows Isabel. Russ knows Cody. Hadley knows Erin. Jacqueline knows Rex. Gwen knows Judith. Victor knows Lee. Victor knows Fabian. Jameson knows Russ. Victor knows Brandon. Lee knows Jameson. Which of Jameson and Hadley can Jacqueline reach?", "answer": "Hadley", "steps": [ "Jacqueline knows Yolanda.", "Yolanda knows Hadley." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Jacqueline", "Mabel", "Terry", "Hadley", "Yolanda", "Rex", "Erin", "Brock", "Zach", "Isabel", "Victor", "Judith", "Gwen", "Jameson", "Lee", "Brandon", "Russ", "Cody", "Fabian", "Trudy" ], "edges": [ [ 0, 5 ], [ 0, 8 ], [ 0, 4 ], [ 2, 1 ], [ 3, 6 ], [ 3, 9 ], [ 4, 3 ], [ 6, 7 ], [ 9, 2 ], [ 10, 15 ], [ 10, 18 ], [ 10, 14 ], [ 12, 11 ], [ 13, 16 ], [ 13, 19 ], [ 14, 13 ], [ 16, 17 ], [ 19, 12 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Dahlia knows Erin. Gabriel knows Ebony. Erin knows Hudson. Dahlia knows Lucas. Lambert knows Gabriel. Keith knows Bernard. Bernard knows Pete. Gabriel knows Greta. Pete knows Rocco. Sean knows Darren. Lucas knows Keith. Deirdre knows Becky. Charity knows Deirdre. Madeline knows Dahlia. Greta knows Grady. Darren knows Charity. Rocco knows Harper. Ebony knows Sean. Which of Charity and Pete can Lambert reach?", "answer": "Charity", "steps": [ "Lambert knows Gabriel.", "Gabriel knows Ebony.", "Ebony knows Sean.", "Sean knows Darren.", "Darren knows Charity." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Lambert", "Deirdre", "Darren", "Gabriel", "Charity", "Becky", "Grady", "Sean", "Ebony", "Greta", "Madeline", "Rocco", "Bernard", "Dahlia", "Pete", "Harper", "Hudson", "Keith", "Lucas", "Erin" ], "edges": [ [ 0, 3 ], [ 1, 5 ], [ 2, 4 ], [ 3, 8 ], [ 3, 9 ], [ 4, 1 ], [ 7, 2 ], [ 8, 7 ], [ 9, 6 ], [ 10, 13 ], [ 11, 15 ], [ 12, 14 ], [ 13, 18 ], [ 13, 19 ], [ 14, 11 ], [ 17, 12 ], [ 18, 17 ], [ 19, 16 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Diana knows Brenda. Joan knows Harmony. Holly knows Lorna. Kurt knows Olivia. Yasmin knows Joan. Harmony knows Kurt. Kurt knows Iris. Diana knows Dylan. Holly knows Frances. Alejandro knows Carrie. Yuki knows Sally. Alejandro knows Alma. Dayton knows Yuki. Olivia knows Alejandro. Alma knows Kieran. Frances knows Gordon. Sally knows Diana. Dylan knows Holly. Which of Yuki and Joan can Dayton reach?", "answer": "Yuki", "steps": [ "Dayton knows Yuki." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Dayton", "Holly", "Yuki", "Brenda", "Diana", "Frances", "Sally", "Lorna", "Gordon", "Dylan", "Yasmin", "Alejandro", "Joan", "Iris", "Kurt", "Alma", "Harmony", "Carrie", "Kieran", "Olivia" ], "edges": [ [ 0, 2 ], [ 1, 7 ], [ 1, 5 ], [ 2, 6 ], [ 4, 3 ], [ 4, 9 ], [ 5, 8 ], [ 6, 4 ], [ 9, 1 ], [ 10, 12 ], [ 11, 17 ], [ 11, 15 ], [ 12, 16 ], [ 14, 13 ], [ 14, 19 ], [ 15, 18 ], [ 16, 14 ], [ 19, 11 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Langston knows Robert. Frida knows Clark. Belinda knows Dora. Bella knows Frida. Kelsey knows Ebony. Devon knows Trudy. Gail knows Ira. Dora knows Langston. Rachel knows Alyssa. Robert knows Autumn. Hampton knows Rachel. Rachel knows Janet. Alyssa knows Erwin. Kelsey knows Devon. Langston knows Hampton. Layla knows Bella. Frida knows Gail. Clark knows Kelsey. Which of Alyssa and Devon can Belinda reach?", "answer": "Alyssa", "steps": [ "Belinda knows Dora.", "Dora knows Langston.", "Langston knows Hampton.", "Hampton knows Rachel.", "Rachel knows Alyssa." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Belinda", "Hampton", "Autumn", "Rachel", "Alyssa", "Janet", "Langston", "Dora", "Robert", "Erwin", "Layla", "Clark", "Ira", "Kelsey", "Devon", "Ebony", "Frida", "Bella", "Gail", "Trudy" ], "edges": [ [ 0, 7 ], [ 1, 3 ], [ 3, 5 ], [ 3, 4 ], [ 4, 9 ], [ 6, 8 ], [ 6, 1 ], [ 7, 6 ], [ 8, 2 ], [ 10, 17 ], [ 11, 13 ], [ 13, 15 ], [ 13, 14 ], [ 14, 19 ], [ 16, 18 ], [ 16, 11 ], [ 17, 16 ], [ 18, 12 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Kieran knows Walter. Hugh knows Skyler. Damien knows Julio. Edith knows Crystal. Jocelyn knows Jolena. Luz knows Brooke. Jocelyn knows Hugh. Kieran knows Fergus. Damien knows Ursula. Ursula knows Jocelyn. Sydney knows Damien. Jolena knows Kaleb. Tony knows Vance. Vance knows Luz. Kingsley knows Edith. Edith knows Tony. Hugh knows Dustin. Vance knows Kieran. Which of Jocelyn and Vance can Sydney reach?", "answer": "Jocelyn", "steps": [ "Sydney knows Damien.", "Damien knows Ursula.", "Ursula knows Jocelyn." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Sydney", "Jolena", "Damien", "Ursula", "Hugh", "Skyler", "Kaleb", "Julio", "Dustin", "Jocelyn", "Kingsley", "Luz", "Edith", "Tony", "Kieran", "Fergus", "Brooke", "Crystal", "Walter", "Vance" ], "edges": [ [ 0, 2 ], [ 1, 6 ], [ 2, 7 ], [ 2, 3 ], [ 3, 9 ], [ 4, 5 ], [ 4, 8 ], [ 9, 1 ], [ 9, 4 ], [ 10, 12 ], [ 11, 16 ], [ 12, 17 ], [ 12, 13 ], [ 13, 19 ], [ 14, 15 ], [ 14, 18 ], [ 19, 11 ], [ 19, 14 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Leon knows Taylor. Ainsley knows Leon. Eamon knows Michelle. Leon knows Saul. Helene knows Aspen. Taylor knows Kelsey. Ainsley knows Alana. Kelsey knows Douglas. Lillian knows Maya. Celia knows Graham. Helene knows Martha. Taylor knows Larissa. Martha knows Susan. Maya knows Helene. Maya knows Jakob. Douglas knows Celia. Lillian knows Yvonne. Susan knows Eamon. Which of Graham and Michelle can Lillian reach?", "answer": "Michelle", "steps": [ "Lillian knows Maya.", "Maya knows Helene.", "Helene knows Martha.", "Martha knows Susan.", "Susan knows Eamon.", "Eamon knows Michelle." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Lillian", "Michelle", "Yvonne", "Aspen", "Jakob", "Helene", "Susan", "Martha", "Maya", "Eamon", "Ainsley", "Graham", "Alana", "Larissa", "Saul", "Taylor", "Douglas", "Kelsey", "Leon", "Celia" ], "edges": [ [ 0, 2 ], [ 0, 8 ], [ 5, 3 ], [ 5, 7 ], [ 6, 9 ], [ 7, 6 ], [ 8, 4 ], [ 8, 5 ], [ 9, 1 ], [ 10, 12 ], [ 10, 18 ], [ 15, 13 ], [ 15, 17 ], [ 16, 19 ], [ 17, 16 ], [ 18, 14 ], [ 18, 15 ], [ 19, 11 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Arturo knows Antonio. Tom knows Garrison. Daria knows Etta. Etta knows Ted. Antonio knows Tom. Antonio knows Darren. Ryan knows Eamon. Ryan knows Cara. Alyson knows Arturo. Dexter knows Tanya. Frances knows Ryan. Cara knows Dick. Dexter knows Alyson. Lloyd knows Dexter. Daria knows Celia. Daria knows Dean. Dick knows Daria. Antonio knows Willard. Which of Tom and Etta can Lloyd reach?", "answer": "Tom", "steps": [ "Lloyd knows Dexter.", "Dexter knows Alyson.", "Alyson knows Arturo.", "Arturo knows Antonio.", "Antonio knows Tom." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Lloyd", "Darren", "Dexter", "Tom", "Willard", "Antonio", "Garrison", "Tanya", "Arturo", "Alyson", "Frances", "Celia", "Ryan", "Etta", "Dean", "Daria", "Ted", "Eamon", "Dick", "Cara" ], "edges": [ [ 0, 2 ], [ 2, 7 ], [ 2, 9 ], [ 3, 6 ], [ 5, 1 ], [ 5, 4 ], [ 5, 3 ], [ 8, 5 ], [ 9, 8 ], [ 10, 12 ], [ 12, 17 ], [ 12, 19 ], [ 13, 16 ], [ 15, 11 ], [ 15, 14 ], [ 15, 13 ], [ 18, 15 ], [ 19, 18 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Helen knows Palmer. Clifford knows Helen. Lacey knows Adelaide. Yasmin knows Louis. Kristin knows Yasmin. Yasmin knows Coral. Dante knows Eli. Yasmin knows Dante. Clifford knows Jaime. Vicki knows Jill. Louis knows Vicki. Clifford knows Etta. Louis knows Camille. Jaime knows Reed. Vicki knows Edgar. Jaime knows Lacey. Josie knows Clifford. Lacey knows Colin. Which of Jill and Adelaide can Josie reach?", "answer": "Adelaide", "steps": [ "Josie knows Clifford.", "Clifford knows Jaime.", "Jaime knows Lacey.", "Lacey knows Adelaide." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Josie", "Clifford", "Etta", "Helen", "Palmer", "Jaime", "Adelaide", "Colin", "Reed", "Lacey", "Kristin", "Yasmin", "Coral", "Dante", "Eli", "Louis", "Jill", "Edgar", "Camille", "Vicki" ], "edges": [ [ 0, 1 ], [ 1, 2 ], [ 1, 3 ], [ 1, 5 ], [ 3, 4 ], [ 5, 8 ], [ 5, 9 ], [ 9, 6 ], [ 9, 7 ], [ 10, 11 ], [ 11, 12 ], [ 11, 13 ], [ 11, 15 ], [ 13, 14 ], [ 15, 18 ], [ 15, 19 ], [ 19, 16 ], [ 19, 17 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Mark knows Etta. Hannah knows Garland. Jacqueline knows Kenzie. Myrtle knows Alex. Alex knows Aria. Julian knows Marcus. Nicholas knows Ramon. Garland knows Mark. Erik knows Hannah. Ramon knows Wanda. Alex knows Jacqueline. Jana knows Floyd. Marcus knows Myrtle. Mark knows Jana. Mike knows Giselle. Giselle knows Roman. Wanda knows Julian. Roman knows Erik. Which of Wanda and Roman can Mike reach?", "answer": "Roman", "steps": [ "Mike knows Giselle.", "Giselle knows Roman." ], "difficulty": 2, "original_distance": 8, "idx_to_symbol": [ "Mike", "Etta", "Jana", "Mark", "Floyd", "Hannah", "Erik", "Giselle", "Garland", "Roman", "Nicholas", "Aria", "Jacqueline", "Alex", "Kenzie", "Marcus", "Julian", "Ramon", "Myrtle", "Wanda" ], "edges": [ [ 0, 7 ], [ 2, 4 ], [ 3, 1 ], [ 3, 2 ], [ 5, 8 ], [ 6, 5 ], [ 7, 9 ], [ 8, 3 ], [ 9, 6 ], [ 10, 17 ], [ 12, 14 ], [ 13, 11 ], [ 13, 12 ], [ 15, 18 ], [ 16, 15 ], [ 17, 19 ], [ 18, 13 ], [ 19, 16 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Effie knows Irving. Pierce knows Myrtle. Pat knows Luis. Howard knows Daphne. Blanche knows Lance. Pierce knows Howard. Daphne knows Dustin. Pat knows Effie. Irving knows Colby. Greg knows Jarvis. Lance knows Sierra. Irving knows Avery. Daphne knows Greg. Howard knows Leticia. Myrtle knows Elvis. Greg knows Willis. Effie knows June. Blanche knows Pat. Which of Howard and Pat can Blanche reach?", "answer": "Pat", "steps": [ "Blanche knows Pat." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Blanche", "Luis", "Sierra", "Lance", "Colby", "Effie", "Irving", "June", "Avery", "Pat", "Pierce", "Leticia", "Elvis", "Myrtle", "Willis", "Daphne", "Greg", "Dustin", "Jarvis", "Howard" ], "edges": [ [ 0, 3 ], [ 0, 9 ], [ 3, 2 ], [ 5, 7 ], [ 5, 6 ], [ 6, 4 ], [ 6, 8 ], [ 9, 1 ], [ 9, 5 ], [ 10, 13 ], [ 10, 19 ], [ 13, 12 ], [ 15, 17 ], [ 15, 16 ], [ 16, 14 ], [ 16, 18 ], [ 19, 11 ], [ 19, 15 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Tessa knows Patricia. Tessa knows Camille. Cody knows Declan. Frida knows Joseph. Grant knows Samuel. Itzel knows Grant. Frida knows Travis. Declan knows Lamont. Clifford knows Kara. Joseph knows Ernesto. Samuel knows Cody. Frida knows Lyle. Travis knows Matt. Kara knows Frida. Yvette knows Clifford. Cody knows Demetrius. Cody knows Tessa. Joseph knows Dawn. Which of Cody and Frida can Yvette reach?", "answer": "Frida", "steps": [ "Yvette knows Clifford.", "Clifford knows Kara.", "Kara knows Frida." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Yvette", "Clifford", "Joseph", "Matt", "Dawn", "Ernesto", "Frida", "Kara", "Lyle", "Travis", "Itzel", "Grant", "Tessa", "Lamont", "Patricia", "Camille", "Cody", "Samuel", "Demetrius", "Declan" ], "edges": [ [ 0, 1 ], [ 1, 7 ], [ 2, 4 ], [ 2, 5 ], [ 6, 2 ], [ 6, 8 ], [ 6, 9 ], [ 7, 6 ], [ 9, 3 ], [ 10, 11 ], [ 11, 17 ], [ 12, 14 ], [ 12, 15 ], [ 16, 12 ], [ 16, 18 ], [ 16, 19 ], [ 17, 16 ], [ 19, 13 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "James knows Boyd. Adelaide knows Clinton. Drew knows Dorothy. Jakob knows James. Adelaide knows Kurt. Brody knows Kai. Russ knows Renee. Aaron knows Adelaide. Drew knows Pete. Cynthia knows Jakob. Renee knows Lisette. Nora knows Brody. Rex knows Chelsea. Kai knows Cynthia. Chelsea knows Aaron. Lisette knows Rhonda. Rhonda knows Rex. Boyd knows Drew. Which of Boyd and Aaron can Nora reach?", "answer": "Boyd", "steps": [ "Nora knows Brody.", "Brody knows Kai.", "Kai knows Cynthia.", "Cynthia knows Jakob.", "Jakob knows James.", "James knows Boyd." ], "difficulty": 6, "original_distance": 8, "idx_to_symbol": [ "Nora", "James", "Drew", "Dorothy", "Jakob", "Kai", "Brody", "Boyd", "Pete", "Cynthia", "Russ", "Chelsea", "Adelaide", "Kurt", "Rex", "Lisette", "Renee", "Aaron", "Clinton", "Rhonda" ], "edges": [ [ 0, 6 ], [ 1, 7 ], [ 2, 3 ], [ 2, 8 ], [ 4, 1 ], [ 5, 9 ], [ 6, 5 ], [ 7, 2 ], [ 9, 4 ], [ 10, 16 ], [ 11, 17 ], [ 12, 13 ], [ 12, 18 ], [ 14, 11 ], [ 15, 19 ], [ 16, 15 ], [ 17, 12 ], [ 19, 14 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Vicki knows Miranda. Rowan knows Kay. Rowan knows Percy. Jameson knows Lamont. Rachel knows Lennox. Miranda knows Rowan. Lennox knows Fanny. Lennox knows Garrett. Lennox knows Peggy. Rowan knows Ford. Garrett knows Kenneth. Ford knows Margaret. Merle knows Hayley. Autumn knows Rachel. Kenneth knows Jameson. Jameson knows Griffith. Margaret knows Merle. Merle knows Marvin. Which of Kenneth and Margaret can Vicki reach?", "answer": "Margaret", "steps": [ "Vicki knows Miranda.", "Miranda knows Rowan.", "Rowan knows Ford.", "Ford knows Margaret." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Vicki", "Miranda", "Ford", "Hayley", "Marvin", "Percy", "Rowan", "Kay", "Margaret", "Merle", "Autumn", "Rachel", "Garrett", "Lamont", "Griffith", "Fanny", "Lennox", "Peggy", "Kenneth", "Jameson" ], "edges": [ [ 0, 1 ], [ 1, 6 ], [ 2, 8 ], [ 6, 5 ], [ 6, 7 ], [ 6, 2 ], [ 8, 9 ], [ 9, 3 ], [ 9, 4 ], [ 10, 11 ], [ 11, 16 ], [ 12, 18 ], [ 16, 15 ], [ 16, 17 ], [ 16, 12 ], [ 18, 19 ], [ 19, 13 ], [ 19, 14 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Ainsley knows Brody. Dean knows Anna. Fergus knows Cliff. Kelly knows Fergus. Stefan knows Dean. Archer knows Dirk. Clinton knows Kathleen. Kirk knows Ainsley. Percy knows Clinton. Brody knows Archer. Brody knows Dawn. Ramon knows Marilyn. Dirk knows Cara. Clinton knows Stefan. Miranda knows Percy. Kathleen knows Beth. Dawn knows Kelly. Beth knows Ramon. Which of Marilyn and Cliff can Kirk reach?", "answer": "Cliff", "steps": [ "Kirk knows Ainsley.", "Ainsley knows Brody.", "Brody knows Dawn.", "Dawn knows Kelly.", "Kelly knows Fergus.", "Fergus knows Cliff." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Kirk", "Archer", "Cara", "Brody", "Fergus", "Dirk", "Cliff", "Ainsley", "Kelly", "Dawn", "Miranda", "Stefan", "Anna", "Clinton", "Ramon", "Dean", "Marilyn", "Percy", "Beth", "Kathleen" ], "edges": [ [ 0, 7 ], [ 1, 5 ], [ 3, 1 ], [ 3, 9 ], [ 4, 6 ], [ 5, 2 ], [ 7, 3 ], [ 8, 4 ], [ 9, 8 ], [ 10, 17 ], [ 11, 15 ], [ 13, 11 ], [ 13, 19 ], [ 14, 16 ], [ 15, 12 ], [ 17, 13 ], [ 18, 14 ], [ 19, 18 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Brooke knows Jonah. Todd knows Teresa. Heidi knows Gareth. Gloria knows Philip. Teresa knows Francis. Luke knows Estelle. Todd knows Gloria. Jonah knows Jerry. Gareth knows Betty. Dana knows Lee. Michelle knows Dana. Estelle knows Yuki. Francis knows Bailey. Michelle knows Todd. Heidi knows Brooke. Luke knows Heidi. Jonah knows Kara. Francis knows Elton. Which of Jerry and Elton can Michelle reach?", "answer": "Elton", "steps": [ "Michelle knows Todd.", "Todd knows Teresa.", "Teresa knows Francis.", "Francis knows Elton." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Michelle", "Gloria", "Teresa", "Todd", "Lee", "Philip", "Bailey", "Elton", "Dana", "Francis", "Luke", "Gareth", "Brooke", "Heidi", "Yuki", "Betty", "Kara", "Jerry", "Estelle", "Jonah" ], "edges": [ [ 0, 8 ], [ 0, 3 ], [ 1, 5 ], [ 2, 9 ], [ 3, 1 ], [ 3, 2 ], [ 8, 4 ], [ 9, 6 ], [ 9, 7 ], [ 10, 18 ], [ 10, 13 ], [ 11, 15 ], [ 12, 19 ], [ 13, 11 ], [ 13, 12 ], [ 18, 14 ], [ 19, 16 ], [ 19, 17 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Axel knows Clayton. Clayton knows Max. Clayton knows Wanda. Glenda knows Jackson. Faith knows Dorothy. Faith knows Colleen. Jackson knows Faith. Ivy knows Priscilla. Priscilla knows Elaine. Dana knows Amanda. Ivy knows Eleanor. Dana knows Geoffrey. Geoffrey knows Jennifer. Jennifer knows Madeline. Wanda knows Dana. Elaine knows Crystal. Benjamin knows Axel. Dorothy knows Ivy. Which of Elaine and Jennifer can Glenda reach?", "answer": "Elaine", "steps": [ "Glenda knows Jackson.", "Jackson knows Faith.", "Faith knows Dorothy.", "Dorothy knows Ivy.", "Ivy knows Priscilla.", "Priscilla knows Elaine." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Glenda", "Colleen", "Eleanor", "Ivy", "Elaine", "Dorothy", "Jackson", "Priscilla", "Faith", "Crystal", "Benjamin", "Max", "Amanda", "Dana", "Jennifer", "Wanda", "Axel", "Geoffrey", "Clayton", "Madeline" ], "edges": [ [ 0, 6 ], [ 3, 2 ], [ 3, 7 ], [ 4, 9 ], [ 5, 3 ], [ 6, 8 ], [ 7, 4 ], [ 8, 1 ], [ 8, 5 ], [ 10, 16 ], [ 13, 12 ], [ 13, 17 ], [ 14, 19 ], [ 15, 13 ], [ 16, 18 ], [ 17, 14 ], [ 18, 11 ], [ 18, 15 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Dorothy knows Chad. Joan knows Ken. Alan knows Arlene. Ken knows Cordelia. Aurora knows Dorothy. Elvira knows Kylie. Elvira knows Guillermo. Alan knows Cameron. Brooks knows Elvira. Leah knows Kobe. Cordelia knows Keith. Alan knows Brooks. Guillermo knows Leah. Ken knows Jesse. Kara knows Alan. Dorothy knows Cruz. Dorothy knows Joan. Keith knows Dee. Which of Kobe and Dee can Kara reach?", "answer": "Kobe", "steps": [ "Kara knows Alan.", "Alan knows Brooks.", "Brooks knows Elvira.", "Elvira knows Guillermo.", "Guillermo knows Leah.", "Leah knows Kobe." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Kara", "Arlene", "Guillermo", "Cameron", "Kobe", "Elvira", "Brooks", "Leah", "Alan", "Kylie", "Aurora", "Cruz", "Cordelia", "Chad", "Dee", "Ken", "Joan", "Keith", "Dorothy", "Jesse" ], "edges": [ [ 0, 8 ], [ 2, 7 ], [ 5, 2 ], [ 5, 9 ], [ 6, 5 ], [ 7, 4 ], [ 8, 1 ], [ 8, 3 ], [ 8, 6 ], [ 10, 18 ], [ 12, 17 ], [ 15, 12 ], [ 15, 19 ], [ 16, 15 ], [ 17, 14 ], [ 18, 11 ], [ 18, 13 ], [ 18, 16 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Stacy knows Blair. Leland knows Homer. Blair knows Maggie. Arnold knows Eugene. Abigail knows Russ. Jon knows Grace. Stacy knows Gwen. Gwen knows Dee. Gwen knows Zoe. Leland knows India. Gwen knows Ariana. Dee knows Arnold. Russ knows Leland. Perry knows Barry. Lorna knows Stacy. Russ knows Perry. Gage knows Jon. Leland knows Gage. Which of Dee and Gage can Abigail reach?", "answer": "Gage", "steps": [ "Abigail knows Russ.", "Russ knows Leland.", "Leland knows Gage." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Abigail", "India", "Barry", "Homer", "Perry", "Leland", "Grace", "Gage", "Jon", "Russ", "Lorna", "Zoe", "Maggie", "Ariana", "Blair", "Gwen", "Eugene", "Dee", "Arnold", "Stacy" ], "edges": [ [ 0, 9 ], [ 4, 2 ], [ 5, 1 ], [ 5, 3 ], [ 5, 7 ], [ 7, 8 ], [ 8, 6 ], [ 9, 4 ], [ 9, 5 ], [ 10, 19 ], [ 14, 12 ], [ 15, 11 ], [ 15, 13 ], [ 15, 17 ], [ 17, 18 ], [ 18, 16 ], [ 19, 14 ], [ 19, 15 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Fleur knows Hailey. Samantha knows Archer. Loretta knows Charlotte. Hadley knows Burt. Harriet knows Asher. Burt knows Samantha. Fritz knows Hunter. Teresa knows Norman. Harriet knows Allan. Harriet knows Loretta. Hailey knows Lottie. Burt knows Teresa. Amanda knows Hayes. Burt knows Ross. Hayes knows Fritz. Hunter knows Harriet. Lottie knows Hadley. Asher knows Hank. Which of Hayes and Hailey can Amanda reach?", "answer": "Hayes", "steps": [ "Amanda knows Hayes." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Amanda", "Allan", "Hank", "Hunter", "Harriet", "Loretta", "Asher", "Fritz", "Hayes", "Charlotte", "Fleur", "Ross", "Archer", "Hadley", "Burt", "Teresa", "Samantha", "Lottie", "Hailey", "Norman" ], "edges": [ [ 0, 8 ], [ 3, 4 ], [ 4, 1 ], [ 4, 6 ], [ 4, 5 ], [ 5, 9 ], [ 6, 2 ], [ 7, 3 ], [ 8, 7 ], [ 10, 18 ], [ 13, 14 ], [ 14, 11 ], [ 14, 16 ], [ 14, 15 ], [ 15, 19 ], [ 16, 12 ], [ 17, 13 ], [ 18, 17 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Jennifer knows Gerald. Amber knows Leah. Amber knows Jennifer. Fleur knows Lee. Anita knows Amanda. Laurel knows Tonya. Sydney knows Erwin. Max knows Amber. Bonnie knows Wilson. Anita knows Sydney. Leah knows Fleur. Arden knows Laurel. Lee knows Joaquin. Gerald knows Cody. Max knows Kristin. Sydney knows Dominic. Erwin knows Bonnie. Dominic knows Arden. Which of Sydney and Amber can Max reach?", "answer": "Amber", "steps": [ "Max knows Amber." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Max", "Cody", "Jennifer", "Joaquin", "Lee", "Kristin", "Fleur", "Gerald", "Amber", "Leah", "Anita", "Wilson", "Erwin", "Tonya", "Laurel", "Amanda", "Arden", "Bonnie", "Sydney", "Dominic" ], "edges": [ [ 0, 5 ], [ 0, 8 ], [ 2, 7 ], [ 4, 3 ], [ 6, 4 ], [ 7, 1 ], [ 8, 2 ], [ 8, 9 ], [ 9, 6 ], [ 10, 15 ], [ 10, 18 ], [ 12, 17 ], [ 14, 13 ], [ 16, 14 ], [ 17, 11 ], [ 18, 12 ], [ 18, 19 ], [ 19, 16 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Frank knows Lucas. Estella knows Delilah. Aubrey knows Jarvis. Aubrey knows Stella. Lucas knows Maya. Eugene knows Agnes. Roland knows Estella. Wendell knows Conrad. Wendell knows Aria. Aubrey knows Tiffany. Wendell knows Leopold. Jarvis knows Giselle. Jarvis knows Alyson. Jarvis knows Diana. Lucas knows Wendell. Frank knows Eugene. Lucas knows Colby. Roland knows Aubrey. Which of Alyson and Leopold can Roland reach?", "answer": "Alyson", "steps": [ "Roland knows Aubrey.", "Aubrey knows Jarvis.", "Jarvis knows Alyson." ], "difficulty": 3, "original_distance": 3, "idx_to_symbol": [ "Roland", "Estella", "Tiffany", "Aubrey", "Jarvis", "Delilah", "Stella", "Diana", "Alyson", "Giselle", "Frank", "Eugene", "Colby", "Lucas", "Wendell", "Agnes", "Maya", "Conrad", "Leopold", "Aria" ], "edges": [ [ 0, 1 ], [ 0, 3 ], [ 1, 5 ], [ 3, 2 ], [ 3, 6 ], [ 3, 4 ], [ 4, 7 ], [ 4, 8 ], [ 4, 9 ], [ 10, 11 ], [ 10, 13 ], [ 11, 15 ], [ 13, 12 ], [ 13, 16 ], [ 13, 14 ], [ 14, 17 ], [ 14, 18 ], [ 14, 19 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Devon knows Ava. Earl knows Clifford. Serena knows Malik. Devon knows Verna. Cody knows Carlos. Austin knows Raquel. Earl knows Eunice. Carlos knows Joyce. Cody knows Edna. Devon knows Morgan. Malik knows Marshall. Jules knows Cody. Edna knows Jennifer. Eunice knows Serena. Earl knows Dick. Serena knows Austin. Earl knows Theodore. Devon knows Jules. Which of Cody and Serena can Earl reach?", "answer": "Serena", "steps": [ "Earl knows Eunice.", "Eunice knows Serena." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Earl", "Clifford", "Malik", "Austin", "Marshall", "Serena", "Theodore", "Eunice", "Raquel", "Dick", "Devon", "Verna", "Carlos", "Edna", "Joyce", "Cody", "Ava", "Jules", "Jennifer", "Morgan" ], "edges": [ [ 0, 1 ], [ 0, 6 ], [ 0, 7 ], [ 0, 9 ], [ 2, 4 ], [ 3, 8 ], [ 5, 2 ], [ 5, 3 ], [ 7, 5 ], [ 10, 11 ], [ 10, 16 ], [ 10, 17 ], [ 10, 19 ], [ 12, 14 ], [ 13, 18 ], [ 15, 12 ], [ 15, 13 ], [ 17, 15 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Gertrude knows Jem. Ada knows David. Devon knows Horace. Luz knows Harris. Horace knows Ainsley. Lawrence knows Lambert. Dolores knows Elvira. Ainsley knows Mason. Jem knows Luz. David knows Audrey. Colleen knows Ken. Audrey knows Lawrence. Elvira knows Colleen. David knows Devon. Gertrude knows Dolores. Harris knows Dee. Dwight knows Gertrude. Lambert knows Ernie. Which of Colleen and Ainsley can Dwight reach?", "answer": "Colleen", "steps": [ "Dwight knows Gertrude.", "Gertrude knows Dolores.", "Dolores knows Elvira.", "Elvira knows Colleen." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Dwight", "Jem", "Dolores", "Luz", "Harris", "Dee", "Gertrude", "Ken", "Elvira", "Colleen", "Ada", "Audrey", "Devon", "Lawrence", "Lambert", "Ernie", "David", "Mason", "Horace", "Ainsley" ], "edges": [ [ 0, 6 ], [ 1, 3 ], [ 2, 8 ], [ 3, 4 ], [ 4, 5 ], [ 6, 1 ], [ 6, 2 ], [ 8, 9 ], [ 9, 7 ], [ 10, 16 ], [ 11, 13 ], [ 12, 18 ], [ 13, 14 ], [ 14, 15 ], [ 16, 11 ], [ 16, 12 ], [ 18, 19 ], [ 19, 17 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Rowan knows Becky. Electra knows Mindy. Becky knows Ethan. Laura knows Ronald. Caroline knows Deanna. Caroline knows Ricardo. Max knows Henrietta. Becky knows Jane. Mindy knows Caroline. Ronald knows Chandler. Mindy knows Cameron. Rocco knows Max. Ethan knows Anita. Ethan knows Laura. Darren knows Tara. Deanna knows Bailey. Caroline knows Rocco. Ethan knows Darren. Which of Ronald and Max can Rowan reach?", "answer": "Ronald", "steps": [ "Rowan knows Becky.", "Becky knows Ethan.", "Ethan knows Laura.", "Laura knows Ronald." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Rowan", "Anita", "Darren", "Jane", "Becky", "Tara", "Laura", "Ethan", "Chandler", "Ronald", "Electra", "Ricardo", "Deanna", "Cameron", "Mindy", "Bailey", "Rocco", "Caroline", "Henrietta", "Max" ], "edges": [ [ 0, 4 ], [ 2, 5 ], [ 4, 3 ], [ 4, 7 ], [ 6, 9 ], [ 7, 1 ], [ 7, 2 ], [ 7, 6 ], [ 9, 8 ], [ 10, 14 ], [ 12, 15 ], [ 14, 13 ], [ 14, 17 ], [ 16, 19 ], [ 17, 11 ], [ 17, 12 ], [ 17, 16 ], [ 19, 18 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Deborah knows Pierce. Brett knows Ivan. Walter knows Selena. Darcy knows Deborah. Brett knows Walter. Darrell knows Jolene. Jermaine knows Colin. Brett knows Jermaine. Kay knows Ralph. Ralph knows Andrew. Ralph knows Clay. Ralph knows Camden. Laverne knows Brett. Andrew knows Sheryl. Selena knows Liam. Clay knows Darcy. Pierce knows Ignacio. Liam knows Darrell. Which of Jolene and Ignacio can Kay reach?", "answer": "Ignacio", "steps": [ "Kay knows Ralph.", "Ralph knows Clay.", "Clay knows Darcy.", "Darcy knows Deborah.", "Deborah knows Pierce.", "Pierce knows Ignacio." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Kay", "Darcy", "Sheryl", "Camden", "Andrew", "Clay", "Deborah", "Ralph", "Pierce", "Ignacio", "Laverne", "Selena", "Colin", "Ivan", "Jermaine", "Walter", "Liam", "Brett", "Darrell", "Jolene" ], "edges": [ [ 0, 7 ], [ 1, 6 ], [ 4, 2 ], [ 5, 1 ], [ 6, 8 ], [ 7, 3 ], [ 7, 4 ], [ 7, 5 ], [ 8, 9 ], [ 10, 17 ], [ 11, 16 ], [ 14, 12 ], [ 15, 11 ], [ 16, 18 ], [ 17, 13 ], [ 17, 14 ], [ 17, 15 ], [ 18, 19 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Elijah knows Yasmin. Val knows Abby. Lloyd knows Estella. Ashton knows Alice. Zach knows Alan. Abby knows Elijah. Ashton knows Laura. Electra knows Fletcher. Don knows Lewis. Abby knows Julius. Jeremy knows Electra. Zelda knows Dante. Elijah knows Zelda. Fabian knows Val. Laura knows Jeremy. Zach knows Ashton. Dante knows Don. Estella knows Zach. Which of Abby and Zach can Lloyd reach?", "answer": "Zach", "steps": [ "Lloyd knows Estella.", "Estella knows Zach." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Lloyd", "Ashton", "Laura", "Alan", "Zach", "Electra", "Alice", "Jeremy", "Fletcher", "Estella", "Fabian", "Elijah", "Zelda", "Julius", "Abby", "Don", "Yasmin", "Dante", "Lewis", "Val" ], "edges": [ [ 0, 9 ], [ 1, 6 ], [ 1, 2 ], [ 2, 7 ], [ 4, 3 ], [ 4, 1 ], [ 5, 8 ], [ 7, 5 ], [ 9, 4 ], [ 10, 19 ], [ 11, 16 ], [ 11, 12 ], [ 12, 17 ], [ 14, 13 ], [ 14, 11 ], [ 15, 18 ], [ 17, 15 ], [ 19, 14 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Greer knows Darin. Brody knows Angelica. Maureen knows Kira. Jordan knows Hope. Saul knows Ariana. Greer knows Francesca. Jillian knows Enrique. Opal knows Brody. Darin knows Rebecca. Darin knows Betty. Opal knows Dwight. Dudley knows Jillian. Ariana knows Maureen. Ariana knows Jordan. Betty knows Jocelyn. Jillian knows Greer. Maureen knows Opal. Enrique knows Latoya. Which of Ariana and Jillian can Saul reach?", "answer": "Ariana", "steps": [ "Saul knows Ariana." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Saul", "Jordan", "Angelica", "Hope", "Dwight", "Opal", "Ariana", "Maureen", "Brody", "Kira", "Dudley", "Enrique", "Jocelyn", "Latoya", "Rebecca", "Darin", "Jillian", "Greer", "Betty", "Francesca" ], "edges": [ [ 0, 6 ], [ 1, 3 ], [ 5, 4 ], [ 5, 8 ], [ 6, 1 ], [ 6, 7 ], [ 7, 5 ], [ 7, 9 ], [ 8, 2 ], [ 10, 16 ], [ 11, 13 ], [ 15, 14 ], [ 15, 18 ], [ 16, 11 ], [ 16, 17 ], [ 17, 15 ], [ 17, 19 ], [ 18, 12 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Isla knows Caroline. Hattie knows Bruce. Deirdre knows Chance. Bruce knows Chase. Ford knows Xavier. Andrew knows Laura. Chance knows Nicholas. Chris knows Gunnar. Mara knows Chris. Chris knows Hattie. Bruce knows Andrew. Nicholas knows Greg. Deirdre knows Jem. Hattie knows Knox. Ford knows Deirdre. Isla knows Ford. Chance knows Ronald. Mara knows Brody. Which of Chance and Bruce can Isla reach?", "answer": "Chance", "steps": [ "Isla knows Ford.", "Ford knows Deirdre.", "Deirdre knows Chance." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Isla", "Deirdre", "Ronald", "Jem", "Greg", "Chance", "Caroline", "Nicholas", "Ford", "Xavier", "Mara", "Hattie", "Chase", "Knox", "Laura", "Bruce", "Brody", "Andrew", "Chris", "Gunnar" ], "edges": [ [ 0, 6 ], [ 0, 8 ], [ 1, 3 ], [ 1, 5 ], [ 5, 2 ], [ 5, 7 ], [ 7, 4 ], [ 8, 1 ], [ 8, 9 ], [ 10, 16 ], [ 10, 18 ], [ 11, 13 ], [ 11, 15 ], [ 15, 12 ], [ 15, 17 ], [ 17, 14 ], [ 18, 11 ], [ 18, 19 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Aspen knows Carla. Garrison knows Aspen. Aspen knows Greg. Aspen knows Callum. Clinton knows Darla. Darla knows Peter. Bennett knows Celia. Heather knows Garrison. Celia knows Jesse. Federico knows Anton. Callum knows Barry. Federico knows Glenn. Glenn knows Eli. Jesse knows Federico. Donald knows Aiden. Federico knows Raquel. Bennett knows Donald. Clinton knows Heather. Which of Garrison and Jesse can Bennett reach?", "answer": "Jesse", "steps": [ "Bennett knows Celia.", "Celia knows Jesse." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Bennett", "Anton", "Eli", "Federico", "Aiden", "Celia", "Donald", "Glenn", "Raquel", "Jesse", "Clinton", "Carla", "Barry", "Aspen", "Peter", "Heather", "Darla", "Callum", "Greg", "Garrison" ], "edges": [ [ 0, 6 ], [ 0, 5 ], [ 3, 1 ], [ 3, 7 ], [ 3, 8 ], [ 5, 9 ], [ 6, 4 ], [ 7, 2 ], [ 9, 3 ], [ 10, 16 ], [ 10, 15 ], [ 13, 11 ], [ 13, 17 ], [ 13, 18 ], [ 15, 19 ], [ 16, 14 ], [ 17, 12 ], [ 19, 13 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Magdalena knows Duncan. Paul knows Claire. Anton knows Frankie. Darla knows Chantal. Conrad knows Dana. Tony knows Leo. Drake knows Anton. Magdalena knows Logan. Chantal knows Jacques. Joshua knows Kara. Nicholas knows Paul. Duncan knows Joshua. Dana knows Darla. Leo knows Drake. Nicholas knows Charlene. Kara knows Conrad. Shelly knows Tony. Claire knows Shelly. Which of Paul and Duncan can Nicholas reach?", "answer": "Paul", "steps": [ "Nicholas knows Paul." ], "difficulty": 1, "original_distance": 8, "idx_to_symbol": [ "Nicholas", "Leo", "Charlene", "Frankie", "Paul", "Shelly", "Tony", "Claire", "Drake", "Anton", "Magdalena", "Dana", "Logan", "Jacques", "Duncan", "Kara", "Conrad", "Joshua", "Darla", "Chantal" ], "edges": [ [ 0, 2 ], [ 0, 4 ], [ 1, 8 ], [ 4, 7 ], [ 5, 6 ], [ 6, 1 ], [ 7, 5 ], [ 8, 9 ], [ 9, 3 ], [ 10, 12 ], [ 10, 14 ], [ 11, 18 ], [ 14, 17 ], [ 15, 16 ], [ 16, 11 ], [ 17, 15 ], [ 18, 19 ], [ 19, 13 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Dean knows Drake. Chandler knows Fernando. Jarvis knows Skyler. Keegan knows Jarvis. Cody knows Walter. Walter knows Opal. Ernesto knows Seth. Fisher knows Ibrahim. Mia knows Heath. Cody knows Bart. Bart knows Chandler. Keegan knows Alice. Odette knows Cody. Seth knows Mia. Skyler knows Ernesto. Fernando knows Fisher. Jarvis knows Dean. Odette knows Curtis. Which of Skyler and Bart can Odette reach?", "answer": "Bart", "steps": [ "Odette knows Cody.", "Cody knows Bart." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Odette", "Chandler", "Ibrahim", "Fisher", "Bart", "Opal", "Cody", "Curtis", "Fernando", "Walter", "Keegan", "Ernesto", "Heath", "Mia", "Skyler", "Drake", "Jarvis", "Alice", "Seth", "Dean" ], "edges": [ [ 0, 7 ], [ 0, 6 ], [ 1, 8 ], [ 3, 2 ], [ 4, 1 ], [ 6, 4 ], [ 6, 9 ], [ 8, 3 ], [ 9, 5 ], [ 10, 17 ], [ 10, 16 ], [ 11, 18 ], [ 13, 12 ], [ 14, 11 ], [ 16, 14 ], [ 16, 19 ], [ 18, 13 ], [ 19, 15 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Dean knows Horace. Dean knows Tamara. Kane knows Joy. India knows Emanuel. Jeanne knows Nadine. Hannah knows Dora. Kit knows Morgan. Jeanne knows Harris. Jeanne knows Chandler. Morgan knows Ariel. Riley knows Jeanne. Chandler knows Elvis. Joy knows India. Jeanne knows Elaine. Kane knows Dean. Dean knows Harold. Riley knows Kit. Dean knows Hannah. Which of Dora and Elvis can Riley reach?", "answer": "Elvis", "steps": [ "Riley knows Jeanne.", "Jeanne knows Chandler.", "Chandler knows Elvis." ], "difficulty": 3, "original_distance": 3, "idx_to_symbol": [ "Riley", "Ariel", "Morgan", "Kit", "Elvis", "Nadine", "Chandler", "Elaine", "Harris", "Jeanne", "Kane", "Emanuel", "India", "Joy", "Dora", "Harold", "Hannah", "Horace", "Tamara", "Dean" ], "edges": [ [ 0, 3 ], [ 0, 9 ], [ 2, 1 ], [ 3, 2 ], [ 6, 4 ], [ 9, 5 ], [ 9, 6 ], [ 9, 7 ], [ 9, 8 ], [ 10, 13 ], [ 10, 19 ], [ 12, 11 ], [ 13, 12 ], [ 16, 14 ], [ 19, 15 ], [ 19, 16 ], [ 19, 17 ], [ 19, 18 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Ford knows Sidney. Yvonne knows Winifred. Jeffery knows Alice. Diane knows Ford. Ainsley knows Rocco. Harry knows Ashley. Rocco knows Yvonne. Cordelia knows Vance. Effie knows Harry. Cordelia knows Latoya. Ainsley knows Jeffery. Vance knows Effie. Harry knows Janice. Wendy knows Roy. Latoya knows Bryan. Janice knows Wendy. Winifred knows Heath. Winifred knows Diane. Which of Janice and Diane can Cordelia reach?", "answer": "Janice", "steps": [ "Cordelia knows Vance.", "Vance knows Effie.", "Effie knows Harry.", "Harry knows Janice." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Cordelia", "Bryan", "Ashley", "Latoya", "Effie", "Roy", "Harry", "Vance", "Wendy", "Janice", "Ainsley", "Alice", "Heath", "Jeffery", "Yvonne", "Sidney", "Winifred", "Rocco", "Ford", "Diane" ], "edges": [ [ 0, 3 ], [ 0, 7 ], [ 3, 1 ], [ 4, 6 ], [ 6, 2 ], [ 6, 9 ], [ 7, 4 ], [ 8, 5 ], [ 9, 8 ], [ 10, 13 ], [ 10, 17 ], [ 13, 11 ], [ 14, 16 ], [ 16, 12 ], [ 16, 19 ], [ 17, 14 ], [ 18, 15 ], [ 19, 18 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Magdalena knows Duncan. Paul knows Claire. Anton knows Frankie. Darla knows Chantal. Conrad knows Dana. Tony knows Leo. Drake knows Anton. Magdalena knows Logan. Chantal knows Jacques. Joshua knows Kara. Nicholas knows Paul. Duncan knows Joshua. Dana knows Darla. Leo knows Drake. Nicholas knows Charlene. Kara knows Conrad. Shelly knows Tony. Claire knows Shelly. Which of Anton and Chantal can Nicholas reach?", "answer": "Anton", "steps": [ "Nicholas knows Paul.", "Paul knows Claire.", "Claire knows Shelly.", "Shelly knows Tony.", "Tony knows Leo.", "Leo knows Drake.", "Drake knows Anton." ], "difficulty": 7, "original_distance": 8, "idx_to_symbol": [ "Nicholas", "Leo", "Charlene", "Frankie", "Paul", "Shelly", "Tony", "Claire", "Drake", "Anton", "Magdalena", "Dana", "Logan", "Jacques", "Duncan", "Kara", "Conrad", "Joshua", "Darla", "Chantal" ], "edges": [ [ 0, 2 ], [ 0, 4 ], [ 1, 8 ], [ 4, 7 ], [ 5, 6 ], [ 6, 1 ], [ 7, 5 ], [ 8, 9 ], [ 9, 3 ], [ 10, 12 ], [ 10, 14 ], [ 11, 18 ], [ 14, 17 ], [ 15, 16 ], [ 16, 11 ], [ 17, 15 ], [ 18, 19 ], [ 19, 13 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Brian knows Alvin. Daphna knows Jenny. Alvin knows Morris. Kylie knows Clay. Clay knows Heidi. Joyce knows Tristan. Louise knows William. Heidi knows Brandon. Randall knows Kylie. Noel knows Winston. Jenny knows Randall. Fisher knows Finn. Heidi knows Jonathan. Finn knows Noel. Joyce knows Brian. Winston knows Dolores. Jonathan knows Louise. Dolores knows Joyce. Which of Randall and Noel can Fisher reach?", "answer": "Noel", "steps": [ "Fisher knows Finn.", "Finn knows Noel." ], "difficulty": 2, "original_distance": 8, "idx_to_symbol": [ "Fisher", "Winston", "Tristan", "Finn", "Noel", "Morris", "Joyce", "Alvin", "Dolores", "Brian", "Daphna", "Kylie", "Brandon", "Jenny", "Randall", "William", "Heidi", "Louise", "Clay", "Jonathan" ], "edges": [ [ 0, 3 ], [ 1, 8 ], [ 3, 4 ], [ 4, 1 ], [ 6, 2 ], [ 6, 9 ], [ 7, 5 ], [ 8, 6 ], [ 9, 7 ], [ 10, 13 ], [ 11, 18 ], [ 13, 14 ], [ 14, 11 ], [ 16, 12 ], [ 16, 19 ], [ 17, 15 ], [ 18, 16 ], [ 19, 17 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Hadley knows Wendell. Noel knows Coral. Louisa knows Hadley. Colin knows Edward. Pauline knows Tristan. Noel knows Alder. Coral knows Fisher. Wendell knows Amanda. Wendell knows Colin. Marcia knows Kim. Alder knows Randall. Hadley knows Pauline. Fisher knows Albert. Coral knows Dale. Edward knows Samantha. Marcia knows Noel. Albert knows Atlas. Louisa knows Dakota. Which of Colin and Fisher can Marcia reach?", "answer": "Fisher", "steps": [ "Marcia knows Noel.", "Noel knows Coral.", "Coral knows Fisher." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Marcia", "Alder", "Atlas", "Coral", "Kim", "Noel", "Fisher", "Randall", "Dale", "Albert", "Louisa", "Pauline", "Samantha", "Wendell", "Dakota", "Hadley", "Colin", "Tristan", "Amanda", "Edward" ], "edges": [ [ 0, 4 ], [ 0, 5 ], [ 1, 7 ], [ 3, 8 ], [ 3, 6 ], [ 5, 1 ], [ 5, 3 ], [ 6, 9 ], [ 9, 2 ], [ 10, 14 ], [ 10, 15 ], [ 11, 17 ], [ 13, 18 ], [ 13, 16 ], [ 15, 11 ], [ 15, 13 ], [ 16, 19 ], [ 19, 12 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Leander knows Harlan. Wilson knows Hal. Sally knows Flora. Flora knows Barbara. Chloe knows Janet. Atlas knows Vernon. Chloe knows Nina. Nina knows Dexter. Eva knows Leander. Wilson knows Sally. Wilson knows Vicki. Barbara knows Courtney. Dexter knows Clark. Clark knows Eva. Sally knows Giselle. Courtney knows Atlas. Nina knows Paige. Chloe knows Irving. Which of Flora and Dexter can Wilson reach?", "answer": "Flora", "steps": [ "Wilson knows Sally.", "Sally knows Flora." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Wilson", "Hal", "Sally", "Giselle", "Vernon", "Barbara", "Atlas", "Vicki", "Courtney", "Flora", "Chloe", "Irving", "Nina", "Paige", "Harlan", "Clark", "Leander", "Janet", "Eva", "Dexter" ], "edges": [ [ 0, 1 ], [ 0, 7 ], [ 0, 2 ], [ 2, 3 ], [ 2, 9 ], [ 5, 8 ], [ 6, 4 ], [ 8, 6 ], [ 9, 5 ], [ 10, 11 ], [ 10, 17 ], [ 10, 12 ], [ 12, 13 ], [ 12, 19 ], [ 15, 18 ], [ 16, 14 ], [ 18, 16 ], [ 19, 15 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Ibrahim knows Byron. Frank knows Walter. Edward knows Ibrahim. Larry knows Norman. Edward knows Louisa. Kristina knows Tabitha. Fraser knows Frank. Dylan knows Kristina. Frank knows Chad. Chad knows Dylan. Fernando knows Gail. Louisa knows Irma. Larry knows Jeanette. Ross knows Larry. Kristina knows Janelle. Hayley knows Ross. Ibrahim knows Hayley. Fraser knows Fernando. Which of Dylan and Ross can Fraser reach?", "answer": "Dylan", "steps": [ "Fraser knows Frank.", "Frank knows Chad.", "Chad knows Dylan." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Fraser", "Kristina", "Janelle", "Chad", "Gail", "Frank", "Tabitha", "Walter", "Dylan", "Fernando", "Edward", "Larry", "Jeanette", "Hayley", "Irma", "Ibrahim", "Norman", "Byron", "Ross", "Louisa" ], "edges": [ [ 0, 5 ], [ 0, 9 ], [ 1, 2 ], [ 1, 6 ], [ 3, 8 ], [ 5, 7 ], [ 5, 3 ], [ 8, 1 ], [ 9, 4 ], [ 10, 15 ], [ 10, 19 ], [ 11, 12 ], [ 11, 16 ], [ 13, 18 ], [ 15, 17 ], [ 15, 13 ], [ 18, 11 ], [ 19, 14 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Felicia knows Nell. Yara knows Gilbert. Luella knows Edwin. Dora knows Ellis. Luella knows Catherine. Felicia knows Rachel. Gilbert knows Sadie. Hannah knows Dora. Crystal knows Luella. Catherine knows Marcus. Catherine knows Hannah. Cordelia knows Joel. Marcus knows Edmund. Nell knows Miriam. Crystal knows Kristina. Cordelia knows Felicia. Nell knows Yara. Miriam knows Eleanor. Which of Catherine and Nell can Cordelia reach?", "answer": "Nell", "steps": [ "Cordelia knows Felicia.", "Felicia knows Nell." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Cordelia", "Eleanor", "Gilbert", "Joel", "Sadie", "Felicia", "Yara", "Nell", "Rachel", "Miriam", "Crystal", "Edmund", "Dora", "Kristina", "Ellis", "Luella", "Hannah", "Catherine", "Edwin", "Marcus" ], "edges": [ [ 0, 3 ], [ 0, 5 ], [ 2, 4 ], [ 5, 8 ], [ 5, 7 ], [ 6, 2 ], [ 7, 6 ], [ 7, 9 ], [ 9, 1 ], [ 10, 13 ], [ 10, 15 ], [ 12, 14 ], [ 15, 18 ], [ 15, 17 ], [ 16, 12 ], [ 17, 16 ], [ 17, 19 ], [ 19, 11 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Lee knows Beau. Tabitha knows Verna. Randall knows Lawrence. Randall knows Vance. Beau knows Hannah. Noel knows Randall. Aspen knows Tabitha. Tabitha knows Noel. Lawrence knows Lisa. Essie knows Hugo. Hilda knows Lee. Hilda knows Warren. Lee knows Essie. Essie knows Arthur. Noel knows Allen. Arthur knows Stephen. Ronald knows Hilda. Allen knows Troy. Which of Essie and Randall can Aspen reach?", "answer": "Randall", "steps": [ "Aspen knows Tabitha.", "Tabitha knows Noel.", "Noel knows Randall." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Aspen", "Randall", "Tabitha", "Lawrence", "Verna", "Lisa", "Noel", "Troy", "Allen", "Vance", "Ronald", "Essie", "Hilda", "Arthur", "Warren", "Stephen", "Lee", "Hannah", "Beau", "Hugo" ], "edges": [ [ 0, 2 ], [ 1, 3 ], [ 1, 9 ], [ 2, 4 ], [ 2, 6 ], [ 3, 5 ], [ 6, 8 ], [ 6, 1 ], [ 8, 7 ], [ 10, 12 ], [ 11, 13 ], [ 11, 19 ], [ 12, 14 ], [ 12, 16 ], [ 13, 15 ], [ 16, 18 ], [ 16, 11 ], [ 18, 17 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Doug knows Frank. Geraldine knows Alvin. Elmer knows Reid. Elmer knows Harry. Eugene knows Dell. Alfred knows Elmer. Mindy knows Walter. Adrian knows Aldo. Virgil knows Doug. Geraldine knows Mindy. Eugene knows Goldie. Virgil knows Alfred. Helen knows Eugene. Reid knows Estella. Aldo knows Virgil. Dell knows Geraldine. Goldie knows Garrett. Katherine knows Helen. Which of Dell and Alfred can Katherine reach?", "answer": "Dell", "steps": [ "Katherine knows Helen.", "Helen knows Eugene.", "Eugene knows Dell." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Katherine", "Eugene", "Garrett", "Walter", "Dell", "Geraldine", "Mindy", "Alvin", "Helen", "Goldie", "Adrian", "Virgil", "Frank", "Estella", "Alfred", "Elmer", "Reid", "Harry", "Aldo", "Doug" ], "edges": [ [ 0, 8 ], [ 1, 4 ], [ 1, 9 ], [ 4, 5 ], [ 5, 6 ], [ 5, 7 ], [ 6, 3 ], [ 8, 1 ], [ 9, 2 ], [ 10, 18 ], [ 11, 14 ], [ 11, 19 ], [ 14, 15 ], [ 15, 16 ], [ 15, 17 ], [ 16, 13 ], [ 18, 11 ], [ 19, 12 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Dolores knows Walter. Theodore knows Crystal. Yvette knows Verna. Dolores knows Daisy. Hope knows Theodore. Tessa knows Carson. Theodore knows Dolores. Helene knows Willis. Carson knows Gary. Yvette knows Jesse. Tessa knows Cassidy. Randall knows Deborah. Carson knows Jill. Jem knows Tessa. Dolores knows Randall. Carson knows Yvette. Jesse knows Hannah. Randall knows Helene. Which of Hannah and Willis can Jem reach?", "answer": "Hannah", "steps": [ "Jem knows Tessa.", "Tessa knows Carson.", "Carson knows Yvette.", "Yvette knows Jesse.", "Jesse knows Hannah." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Jem", "Jesse", "Jill", "Hannah", "Tessa", "Carson", "Verna", "Gary", "Cassidy", "Yvette", "Hope", "Helene", "Walter", "Willis", "Theodore", "Dolores", "Deborah", "Daisy", "Crystal", "Randall" ], "edges": [ [ 0, 4 ], [ 1, 3 ], [ 4, 8 ], [ 4, 5 ], [ 5, 2 ], [ 5, 7 ], [ 5, 9 ], [ 9, 1 ], [ 9, 6 ], [ 10, 14 ], [ 11, 13 ], [ 14, 18 ], [ 14, 15 ], [ 15, 12 ], [ 15, 17 ], [ 15, 19 ], [ 19, 11 ], [ 19, 16 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Alison knows Caleb. Dean knows Atlas. Dean knows Lenora. Zachary knows Joanna. Ibrahim knows Alison. Zachary knows Kerry. Martha knows Ibrahim. Rick knows Malik. Atlas knows Byron. Darius knows Edith. Atlas knows Rick. Darius knows Dean. Joanna knows Carl. Carl knows Sharon. Serena knows Haley. Alison knows Zachary. Joanna knows Victoria. Haley knows Darius. Which of Zachary and Dean can Serena reach?", "answer": "Dean", "steps": [ "Serena knows Haley.", "Haley knows Darius.", "Darius knows Dean." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Serena", "Edith", "Rick", "Dean", "Lenora", "Darius", "Byron", "Malik", "Atlas", "Haley", "Martha", "Caleb", "Carl", "Zachary", "Kerry", "Alison", "Victoria", "Sharon", "Joanna", "Ibrahim" ], "edges": [ [ 0, 9 ], [ 2, 7 ], [ 3, 4 ], [ 3, 8 ], [ 5, 1 ], [ 5, 3 ], [ 8, 6 ], [ 8, 2 ], [ 9, 5 ], [ 10, 19 ], [ 12, 17 ], [ 13, 14 ], [ 13, 18 ], [ 15, 11 ], [ 15, 13 ], [ 18, 16 ], [ 18, 12 ], [ 19, 15 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Latoya knows Mildred. Margaret knows Nicholas. Veronica knows Saul. Mildred knows Lisa. Kristin knows Eldon. Veronica knows Beverly. Lisa knows Ellis. Barbara knows Cody. Cameron knows Veronica. Aubrey knows Cameron. Ellis knows Cesar. Cesar knows Alison. Nicholas knows Barbara. Cesar knows Betty. Barbara knows Clay. Eldon knows Latoya. Latoya knows Julio. Beverly knows Margaret. Which of Cesar and Barbara can Aubrey reach?", "answer": "Barbara", "steps": [ "Aubrey knows Cameron.", "Cameron knows Veronica.", "Veronica knows Beverly.", "Beverly knows Margaret.", "Margaret knows Nicholas.", "Nicholas knows Barbara." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Aubrey", "Veronica", "Nicholas", "Barbara", "Margaret", "Cameron", "Saul", "Clay", "Beverly", "Cody", "Kristin", "Latoya", "Ellis", "Cesar", "Lisa", "Eldon", "Julio", "Alison", "Mildred", "Betty" ], "edges": [ [ 0, 5 ], [ 1, 6 ], [ 1, 8 ], [ 2, 3 ], [ 3, 7 ], [ 3, 9 ], [ 4, 2 ], [ 5, 1 ], [ 8, 4 ], [ 10, 15 ], [ 11, 16 ], [ 11, 18 ], [ 12, 13 ], [ 13, 17 ], [ 13, 19 ], [ 14, 12 ], [ 15, 11 ], [ 18, 14 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Ivy knows Seth. Denver knows Regina. Saul knows Kelly. Eamon knows Sam. Regina knows Ivy. Nina knows Otto. Alan knows Mara. Jeanette knows Ezra. Regina knows Eamon. Nina knows Jesse. Mara knows Jeanette. Jodi knows Billy. Mara knows Nina. Ivy knows Gabe. Jodi knows Alan. Jeanette knows Ruby. Saul knows Denver. Eamon knows Tyler. Which of Alan and Denver can Saul reach?", "answer": "Denver", "steps": [ "Saul knows Denver." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Saul", "Regina", "Seth", "Gabe", "Eamon", "Tyler", "Denver", "Sam", "Kelly", "Ivy", "Jodi", "Mara", "Ruby", "Ezra", "Nina", "Jesse", "Alan", "Otto", "Billy", "Jeanette" ], "edges": [ [ 0, 8 ], [ 0, 6 ], [ 1, 4 ], [ 1, 9 ], [ 4, 5 ], [ 4, 7 ], [ 6, 1 ], [ 9, 2 ], [ 9, 3 ], [ 10, 18 ], [ 10, 16 ], [ 11, 14 ], [ 11, 19 ], [ 14, 15 ], [ 14, 17 ], [ 16, 11 ], [ 19, 12 ], [ 19, 13 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Ramon knows Harmony. Jessie knows Ramon. Sierra knows Dell. Jessie knows Sierra. Grace knows Gladys. Jessie knows Alyson. Lamont knows Grace. Roland knows Phoebe. Craig knows Kay. Adelaide knows Michelle. Bert knows Lamont. Sierra knows Roland. Adelaide knows Greer. Dell knows Zach. Greer knows Shane. Phoebe knows Luna. Bert knows Craig. Adelaide knows Bert. Which of Sierra and Bert can Jessie reach?", "answer": "Sierra", "steps": [ "Jessie knows Sierra." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Jessie", "Ramon", "Phoebe", "Zach", "Harmony", "Sierra", "Dell", "Luna", "Roland", "Alyson", "Adelaide", "Greer", "Grace", "Kay", "Shane", "Bert", "Craig", "Gladys", "Lamont", "Michelle" ], "edges": [ [ 0, 1 ], [ 0, 5 ], [ 0, 9 ], [ 1, 4 ], [ 2, 7 ], [ 5, 6 ], [ 5, 8 ], [ 6, 3 ], [ 8, 2 ], [ 10, 11 ], [ 10, 15 ], [ 10, 19 ], [ 11, 14 ], [ 12, 17 ], [ 15, 16 ], [ 15, 18 ], [ 16, 13 ], [ 18, 12 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Winifred knows Casey. Linda knows Neil. Enrique knows Trudy. Lacey knows Linda. Casey knows Dustin. Ashton knows Mario. Graham knows Kevin. Trudy knows Kendrick. Kendrick knows Corinne. Kendrick knows Della. Christina knows Ashton. Melanie knows Enrique. Kaleb knows Graham. Enrique knows Henrietta. Casey knows Rowan. Lacey knows Christina. Ashton knows Winifred. Kaleb knows Melanie. Which of Rowan and Corinne can Lacey reach?", "answer": "Rowan", "steps": [ "Lacey knows Christina.", "Christina knows Ashton.", "Ashton knows Winifred.", "Winifred knows Casey.", "Casey knows Rowan." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Lacey", "Christina", "Casey", "Ashton", "Rowan", "Dustin", "Neil", "Mario", "Winifred", "Linda", "Kaleb", "Melanie", "Kendrick", "Enrique", "Corinne", "Della", "Kevin", "Henrietta", "Trudy", "Graham" ], "edges": [ [ 0, 1 ], [ 0, 9 ], [ 1, 3 ], [ 2, 4 ], [ 2, 5 ], [ 3, 7 ], [ 3, 8 ], [ 8, 2 ], [ 9, 6 ], [ 10, 11 ], [ 10, 19 ], [ 11, 13 ], [ 12, 14 ], [ 12, 15 ], [ 13, 17 ], [ 13, 18 ], [ 18, 12 ], [ 19, 16 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Leah knows Judith. Ernesto knows Diana. Judith knows Cody. Eamon knows Leah. Don knows Ariana. Diana knows Lacey. Wyatt knows Lisette. Maude knows Brian. Fernando knows Edmund. Eamon knows Jason. Marion knows Don. Leah knows Maude. Lacey knows Eamon. Fernando knows Jenna. Ariana knows Fernando. Edmund knows Wyatt. Bernadette knows Dudley. Edmund knows Bernadette. Which of Lisette and Cody can Ernesto reach?", "answer": "Cody", "steps": [ "Ernesto knows Diana.", "Diana knows Lacey.", "Lacey knows Eamon.", "Eamon knows Leah.", "Leah knows Judith.", "Judith knows Cody." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Ernesto", "Leah", "Diana", "Cody", "Jason", "Maude", "Lacey", "Brian", "Judith", "Eamon", "Marion", "Edmund", "Don", "Lisette", "Jenna", "Bernadette", "Ariana", "Dudley", "Wyatt", "Fernando" ], "edges": [ [ 0, 2 ], [ 1, 5 ], [ 1, 8 ], [ 2, 6 ], [ 5, 7 ], [ 6, 9 ], [ 8, 3 ], [ 9, 4 ], [ 9, 1 ], [ 10, 12 ], [ 11, 15 ], [ 11, 18 ], [ 12, 16 ], [ 15, 17 ], [ 16, 19 ], [ 18, 13 ], [ 19, 14 ], [ 19, 11 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Guy knows Hilda. Joanna knows Arthur. Hilda knows Zach. Roland knows Will. Chance knows Joanna. Will knows Ramona. Erwin knows Brittany. Erwin knows Derrick. Connor knows Melody. Elise knows Kendra. Connor knows Kurt. Kendra knows Chance. Guy knows Roland. Elise knows Irving. Zach knows Connor. Irving knows Arnold. Arnold knows Erwin. Ramona knows Deanna. Which of Zach and Arnold can Elise reach?", "answer": "Arnold", "steps": [ "Elise knows Irving.", "Irving knows Arnold." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Elise", "Erwin", "Kendra", "Arnold", "Chance", "Brittany", "Irving", "Joanna", "Arthur", "Derrick", "Guy", "Connor", "Roland", "Zach", "Will", "Kurt", "Hilda", "Ramona", "Deanna", "Melody" ], "edges": [ [ 0, 2 ], [ 0, 6 ], [ 1, 5 ], [ 1, 9 ], [ 2, 4 ], [ 3, 1 ], [ 4, 7 ], [ 6, 3 ], [ 7, 8 ], [ 10, 12 ], [ 10, 16 ], [ 11, 15 ], [ 11, 19 ], [ 12, 14 ], [ 13, 11 ], [ 14, 17 ], [ 16, 13 ], [ 17, 18 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Omar knows Eli. Abel knows Odette. Judith knows Milton. Andre knows Ingrid. Kenzie knows Raymond. Abel knows Christina. Andre knows Trevor. Bernice knows Lillian. Vance knows Alan. Holden knows Kenzie. Judith knows Camille. Ingrid knows Nell. Alan knows Celia. Bernice knows Omar. Nell knows Holden. Eli knows Vance. Bernice knows Judith. Andre knows Abel. Which of Vance and Holden can Bernice reach?", "answer": "Vance", "steps": [ "Bernice knows Omar.", "Omar knows Eli.", "Eli knows Vance." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Bernice", "Judith", "Vance", "Alan", "Eli", "Lillian", "Camille", "Omar", "Milton", "Celia", "Andre", "Abel", "Holden", "Kenzie", "Nell", "Trevor", "Christina", "Ingrid", "Odette", "Raymond" ], "edges": [ [ 0, 5 ], [ 0, 1 ], [ 0, 7 ], [ 1, 6 ], [ 1, 8 ], [ 2, 3 ], [ 3, 9 ], [ 4, 2 ], [ 7, 4 ], [ 10, 15 ], [ 10, 11 ], [ 10, 17 ], [ 11, 16 ], [ 11, 18 ], [ 12, 13 ], [ 13, 19 ], [ 14, 12 ], [ 17, 14 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Lucia knows Melody. Celia knows Willard. Melody knows Kareem. Eunice knows Edmund. Jeff knows Winston. Eunice knows Marilyn. Eunice knows Conrad. Cordelia knows Celia. Conrad knows Lucia. Kareem knows Alex. Malcolm knows Chance. Winston knows Charlotte. Edmund knows Malcolm. Leah knows Jeff. Judy knows Cordelia. Willard knows Arden. Leah knows Marcus. Leah knows Judy. Which of Melody and Celia can Leah reach?", "answer": "Celia", "steps": [ "Leah knows Judy.", "Judy knows Cordelia.", "Cordelia knows Celia." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Leah", "Jeff", "Winston", "Charlotte", "Marcus", "Judy", "Willard", "Cordelia", "Arden", "Celia", "Eunice", "Edmund", "Malcolm", "Chance", "Marilyn", "Conrad", "Kareem", "Lucia", "Alex", "Melody" ], "edges": [ [ 0, 1 ], [ 0, 4 ], [ 0, 5 ], [ 1, 2 ], [ 2, 3 ], [ 5, 7 ], [ 6, 8 ], [ 7, 9 ], [ 9, 6 ], [ 10, 11 ], [ 10, 14 ], [ 10, 15 ], [ 11, 12 ], [ 12, 13 ], [ 15, 17 ], [ 16, 18 ], [ 17, 19 ], [ 19, 16 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Emmett knows Gwen. Abel knows Arlene. Glen knows Essie. Emmett knows Abel. Carla knows Dewey. Reid knows Hardy. April knows Kirsten. Essie knows Frank. Helene knows Carla. Essie knows Mae. Guy knows Reid. Hardy knows Finn. Harry knows Helene. Helene knows James. Reid knows Emanuel. Reid knows Harry. Essie knows April. Frank knows Emmett. Which of Carla and Abel can Glen reach?", "answer": "Abel", "steps": [ "Glen knows Essie.", "Essie knows Frank.", "Frank knows Emmett.", "Emmett knows Abel." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Glen", "Mae", "Essie", "Arlene", "April", "Frank", "Gwen", "Emmett", "Abel", "Kirsten", "Guy", "Emanuel", "Reid", "Dewey", "Hardy", "Harry", "James", "Helene", "Carla", "Finn" ], "edges": [ [ 0, 2 ], [ 2, 1 ], [ 2, 5 ], [ 2, 4 ], [ 4, 9 ], [ 5, 7 ], [ 7, 6 ], [ 7, 8 ], [ 8, 3 ], [ 10, 12 ], [ 12, 11 ], [ 12, 15 ], [ 12, 14 ], [ 14, 19 ], [ 15, 17 ], [ 17, 16 ], [ 17, 18 ], [ 18, 13 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Hector knows Nash. Edmund knows Darin. Carrie knows Edmund. Asher knows Lyric. Fred knows Fern. Nash knows Asher. Nadine knows Alison. Zoe knows Hector. Zoe knows Corinne. Carrie knows Elsa. Zoe knows Boris. Darin knows Haven. Asher knows Eugene. Alison knows Dane. Lyric knows Fred. Carrie knows Parker. Haven knows Nadine. Haven knows Jules. Which of Lyric and Nadine can Carrie reach?", "answer": "Nadine", "steps": [ "Carrie knows Edmund.", "Edmund knows Darin.", "Darin knows Haven.", "Haven knows Nadine." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Carrie", "Haven", "Dane", "Alison", "Edmund", "Nadine", "Jules", "Elsa", "Parker", "Darin", "Zoe", "Asher", "Fern", "Fred", "Hector", "Lyric", "Eugene", "Corinne", "Boris", "Nash" ], "edges": [ [ 0, 7 ], [ 0, 8 ], [ 0, 4 ], [ 1, 5 ], [ 1, 6 ], [ 3, 2 ], [ 4, 9 ], [ 5, 3 ], [ 9, 1 ], [ 10, 17 ], [ 10, 18 ], [ 10, 14 ], [ 11, 15 ], [ 11, 16 ], [ 13, 12 ], [ 14, 19 ], [ 15, 13 ], [ 19, 11 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Carol knows Leticia. Julia knows Deborah. Gerald knows Lambert. Lambert knows Cain. Uma knows Gerald. Reid knows Edgar. Uma knows Katrina. Carol knows Marcia. Reid knows Rita. Deborah knows Byron. Leticia knows Corinne. Uma knows Julia. Leticia knows Monroe. Julia knows Fred. Alison knows Reid. Monroe knows Jenny. Carol knows Alison. Lambert knows Declan. Which of Gerald and Alison can Carol reach?", "answer": "Alison", "steps": [ "Carol knows Alison." ], "difficulty": 1, "original_distance": 3, "idx_to_symbol": [ "Carol", "Monroe", "Rita", "Corinne", "Edgar", "Alison", "Jenny", "Marcia", "Reid", "Leticia", "Uma", "Deborah", "Declan", "Fred", "Cain", "Gerald", "Byron", "Katrina", "Lambert", "Julia" ], "edges": [ [ 0, 7 ], [ 0, 5 ], [ 0, 9 ], [ 1, 6 ], [ 5, 8 ], [ 8, 2 ], [ 8, 4 ], [ 9, 3 ], [ 9, 1 ], [ 10, 17 ], [ 10, 15 ], [ 10, 19 ], [ 11, 16 ], [ 15, 18 ], [ 18, 12 ], [ 18, 14 ], [ 19, 13 ], [ 19, 11 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Coral knows Axel. Roman knows Houston. Carey knows Gertrude. Dick knows Roy. Carey knows Imogen. Axel knows Effie. Julio knows Roman. Julio knows Hugh. Imogen knows Sandra. Houston knows Coral. Jeanne knows Laurel. Julio knows Mike. Melanie knows Mark. Roy knows Leah. Sandra knows Teresa. Mike knows Jeanne. Carey knows Melanie. Mark knows Dick. Which of Roman and Melanie can Carey reach?", "answer": "Melanie", "steps": [ "Carey knows Melanie." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Carey", "Mark", "Roy", "Teresa", "Melanie", "Dick", "Sandra", "Leah", "Gertrude", "Imogen", "Julio", "Houston", "Axel", "Laurel", "Roman", "Coral", "Jeanne", "Effie", "Hugh", "Mike" ], "edges": [ [ 0, 4 ], [ 0, 8 ], [ 0, 9 ], [ 1, 5 ], [ 2, 7 ], [ 4, 1 ], [ 5, 2 ], [ 6, 3 ], [ 9, 6 ], [ 10, 14 ], [ 10, 18 ], [ 10, 19 ], [ 11, 15 ], [ 12, 17 ], [ 14, 11 ], [ 15, 12 ], [ 16, 13 ], [ 19, 16 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Xavier knows Ben. Lorna knows Sandra. Patricia knows Carlos. Yuki knows Patricia. Maude knows Allan. Tyler knows Xavier. Lamont knows Kai. Hannah knows Laverne. Xavier knows Lamont. Patricia knows Wade. Xavier knows Lorna. Rick knows Tyler. Laverne knows Rick. Sadie knows Maude. Wade knows Hector. Patricia knows Skyler. Skyler knows Arden. Allan knows Yuki. Which of Rick and Allan can Sadie reach?", "answer": "Allan", "steps": [ "Sadie knows Maude.", "Maude knows Allan." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Sadie", "Hector", "Yuki", "Patricia", "Allan", "Carlos", "Maude", "Arden", "Skyler", "Wade", "Hannah", "Kai", "Tyler", "Xavier", "Rick", "Ben", "Laverne", "Sandra", "Lorna", "Lamont" ], "edges": [ [ 0, 6 ], [ 2, 3 ], [ 3, 5 ], [ 3, 8 ], [ 3, 9 ], [ 4, 2 ], [ 6, 4 ], [ 8, 7 ], [ 9, 1 ], [ 10, 16 ], [ 12, 13 ], [ 13, 15 ], [ 13, 18 ], [ 13, 19 ], [ 14, 12 ], [ 16, 14 ], [ 18, 17 ], [ 19, 11 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Zelda knows Diego. Ira knows Gunnar. Mack knows Essie. Landon knows Elsa. Landon knows Walt. Landon knows Randy. Mack knows Conrad. Emma knows Isiah. Howard knows Roland. Emma knows Lawson. Ashton knows Esme. Diego knows Ira. Howard knows Becky. Walt knows Emma. Zelda knows Mack. Walt knows Ashton. Esme knows Geoffrey. Howard knows Zelda. Which of Zelda and Walt can Howard reach?", "answer": "Zelda", "steps": [ "Howard knows Zelda." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Howard", "Mack", "Roland", "Becky", "Ira", "Diego", "Zelda", "Gunnar", "Essie", "Conrad", "Landon", "Emma", "Randy", "Elsa", "Esme", "Ashton", "Walt", "Geoffrey", "Lawson", "Isiah" ], "edges": [ [ 0, 2 ], [ 0, 3 ], [ 0, 6 ], [ 1, 8 ], [ 1, 9 ], [ 4, 7 ], [ 5, 4 ], [ 6, 5 ], [ 6, 1 ], [ 10, 12 ], [ 10, 13 ], [ 10, 16 ], [ 11, 18 ], [ 11, 19 ], [ 14, 17 ], [ 15, 14 ], [ 16, 15 ], [ 16, 11 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Gina knows Philip. Cora knows Rhonda. Bart knows Rebecca. Elaine knows Gina. Douglas knows Bart. Tom knows Ted. Randall knows Byron. Philip knows Aspen. Ted knows Elaine. Holden knows Claude. Aspen knows Trevor. Rebecca knows Ivy. Kane knows Tom. Rhonda knows Samantha. Claude knows Kane. Ivy knows Horace. Horace knows Cora. Samantha knows Randall. Which of Rhonda and Gina can Douglas reach?", "answer": "Rhonda", "steps": [ "Douglas knows Bart.", "Bart knows Rebecca.", "Rebecca knows Ivy.", "Ivy knows Horace.", "Horace knows Cora.", "Cora knows Rhonda." ], "difficulty": 6, "original_distance": 9, "idx_to_symbol": [ "Douglas", "Bart", "Randall", "Cora", "Ivy", "Rhonda", "Byron", "Rebecca", "Samantha", "Horace", "Holden", "Claude", "Aspen", "Elaine", "Tom", "Gina", "Trevor", "Kane", "Philip", "Ted" ], "edges": [ [ 0, 1 ], [ 1, 7 ], [ 2, 6 ], [ 3, 5 ], [ 4, 9 ], [ 5, 8 ], [ 7, 4 ], [ 8, 2 ], [ 9, 3 ], [ 10, 11 ], [ 11, 17 ], [ 12, 16 ], [ 13, 15 ], [ 14, 19 ], [ 15, 18 ], [ 17, 14 ], [ 18, 12 ], [ 19, 13 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Carter knows Byron. Elise knows Sidney. Karina knows Jasmine. Byron knows Peggy. Uma knows Bruno. Carter knows Carl. Austin knows Elise. Angela knows Harvey. Jasmine knows Amelia. Harvey knows Amy. Amy knows Austin. Angela knows Arlene. Amelia knows Viola. Derrick knows Justin. Sidney knows Hal. Sidney knows Uma. Amelia knows Derrick. Peggy knows Karina. Which of Harvey and Byron can Carter reach?", "answer": "Byron", "steps": [ "Carter knows Byron." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Carter", "Jasmine", "Byron", "Derrick", "Amelia", "Viola", "Karina", "Justin", "Peggy", "Carl", "Angela", "Elise", "Harvey", "Uma", "Sidney", "Hal", "Austin", "Bruno", "Amy", "Arlene" ], "edges": [ [ 0, 2 ], [ 0, 9 ], [ 1, 4 ], [ 2, 8 ], [ 3, 7 ], [ 4, 5 ], [ 4, 3 ], [ 6, 1 ], [ 8, 6 ], [ 10, 12 ], [ 10, 19 ], [ 11, 14 ], [ 12, 18 ], [ 13, 17 ], [ 14, 15 ], [ 14, 13 ], [ 16, 11 ], [ 18, 16 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Chantal knows Curtis. Vivian knows James. Sydney knows Don. Don knows Benjamin. Lars knows Sydney. Calvin knows Heidi. Wanda knows Enid. Clinton knows Bruno. Clarissa knows Violet. Kenzie knows Calvin. Violet knows Wanda. Benjamin knows Kenzie. Marcia knows Clarissa. James knows Marcia. Benjamin knows Kent. Bruno knows Vivian. Curtis knows Lars. Clarissa knows Destiny. Which of Sydney and James can Chantal reach?", "answer": "Sydney", "steps": [ "Chantal knows Curtis.", "Curtis knows Lars.", "Lars knows Sydney." ], "difficulty": 3, "original_distance": 8, "idx_to_symbol": [ "Chantal", "Curtis", "Don", "Kent", "Lars", "Benjamin", "Kenzie", "Sydney", "Calvin", "Heidi", "Clinton", "Bruno", "Marcia", "Destiny", "Vivian", "Clarissa", "Violet", "James", "Wanda", "Enid" ], "edges": [ [ 0, 1 ], [ 1, 4 ], [ 2, 5 ], [ 4, 7 ], [ 5, 3 ], [ 5, 6 ], [ 6, 8 ], [ 7, 2 ], [ 8, 9 ], [ 10, 11 ], [ 11, 14 ], [ 12, 15 ], [ 14, 17 ], [ 15, 13 ], [ 15, 16 ], [ 16, 18 ], [ 17, 12 ], [ 18, 19 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Colby knows Colette. Erica knows Sam. Hilda knows Colby. Kendra knows Porter. Hilda knows Bruce. Anita knows Hilda. Kendra knows Dudley. Aaron knows Anita. Otto knows India. India knows June. Bruce knows Houston. India knows Kendra. Sam knows Otto. Monroe knows Aaron. June knows Daniel. June knows Owen. Bruce knows Arturo. Colby knows Noel. Which of Aaron and Sam can Monroe reach?", "answer": "Aaron", "steps": [ "Monroe knows Aaron." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Monroe", "Bruce", "Colby", "Anita", "Colette", "Aaron", "Hilda", "Houston", "Noel", "Arturo", "Erica", "June", "Kendra", "Otto", "Dudley", "Sam", "India", "Owen", "Porter", "Daniel" ], "edges": [ [ 0, 5 ], [ 1, 7 ], [ 1, 9 ], [ 2, 4 ], [ 2, 8 ], [ 3, 6 ], [ 5, 3 ], [ 6, 2 ], [ 6, 1 ], [ 10, 15 ], [ 11, 17 ], [ 11, 19 ], [ 12, 14 ], [ 12, 18 ], [ 13, 16 ], [ 15, 13 ], [ 16, 12 ], [ 16, 11 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Lyric knows Cate. Josie knows Greer. Lillian knows Lyric. Lillian knows Josie. Erica knows Herman. Dustin knows Kendra. Jamie knows Laura. Hazel knows Estella. Dustin knows Lewis. Lewis knows Erica. Hazel knows Penny. Erica knows Hazel. Josie knows Mary. Greer knows Cliff. Estella knows Jana. Herman knows Lorraine. Jamie knows Melody. Melody knows Lillian. Which of Hazel and Josie can Dustin reach?", "answer": "Hazel", "steps": [ "Dustin knows Lewis.", "Lewis knows Erica.", "Erica knows Hazel." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Dustin", "Lewis", "Hazel", "Penny", "Kendra", "Herman", "Erica", "Jana", "Lorraine", "Estella", "Jamie", "Melody", "Josie", "Mary", "Laura", "Lyric", "Lillian", "Cliff", "Cate", "Greer" ], "edges": [ [ 0, 4 ], [ 0, 1 ], [ 1, 6 ], [ 2, 3 ], [ 2, 9 ], [ 5, 8 ], [ 6, 5 ], [ 6, 2 ], [ 9, 7 ], [ 10, 14 ], [ 10, 11 ], [ 11, 16 ], [ 12, 13 ], [ 12, 19 ], [ 15, 18 ], [ 16, 15 ], [ 16, 12 ], [ 19, 17 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Mason knows Jewel. Judy knows Geoffrey. Selena knows Hudson. Jewel knows Saul. Estelle knows Dakota. Judy knows Selena. Joel knows Mason. Judy knows Greer. Jewel knows Belinda. Dean knows Christian. Estelle knows Doris. Blanche knows Dean. Greer knows Jonathan. Jewel knows Estelle. Mason knows Vicki. Selena knows Ethan. Dean knows Judy. Saul knows Gabe. Which of Dean and Mason can Blanche reach?", "answer": "Dean", "steps": [ "Blanche knows Dean." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Blanche", "Greer", "Ethan", "Jonathan", "Dean", "Selena", "Hudson", "Christian", "Geoffrey", "Judy", "Joel", "Saul", "Doris", "Gabe", "Mason", "Estelle", "Dakota", "Vicki", "Belinda", "Jewel" ], "edges": [ [ 0, 4 ], [ 1, 3 ], [ 4, 7 ], [ 4, 9 ], [ 5, 2 ], [ 5, 6 ], [ 9, 1 ], [ 9, 5 ], [ 9, 8 ], [ 10, 14 ], [ 11, 13 ], [ 14, 17 ], [ 14, 19 ], [ 15, 12 ], [ 15, 16 ], [ 19, 11 ], [ 19, 15 ], [ 19, 18 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Lena knows Atlas. Lena knows Reed. Taylor knows Erwin. Lena knows Alana. Alexa knows Arnold. Drake knows Keaton. Geoffrey knows Stephanie. Keaton knows Wade. Ezra knows Drake. Lena knows Ezra. Atlas knows Rosemary. Arnold knows Tiffany. Stacy knows Taylor. Reed knows Corey. Stacy knows Geoffrey. Stacy knows Calvin. Jerome knows Alexa. Stacy knows Jerome. Which of Arnold and Keaton can Lena reach?", "answer": "Keaton", "steps": [ "Lena knows Ezra.", "Ezra knows Drake.", "Drake knows Keaton." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Lena", "Alana", "Corey", "Atlas", "Keaton", "Wade", "Drake", "Rosemary", "Reed", "Ezra", "Stacy", "Calvin", "Stephanie", "Taylor", "Arnold", "Tiffany", "Alexa", "Erwin", "Geoffrey", "Jerome" ], "edges": [ [ 0, 1 ], [ 0, 3 ], [ 0, 8 ], [ 0, 9 ], [ 3, 7 ], [ 4, 5 ], [ 6, 4 ], [ 8, 2 ], [ 9, 6 ], [ 10, 11 ], [ 10, 13 ], [ 10, 18 ], [ 10, 19 ], [ 13, 17 ], [ 14, 15 ], [ 16, 14 ], [ 18, 12 ], [ 19, 16 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Caroline knows Adam. Ember knows Lilia. Eamon knows Ember. Max knows Connor. Myrtle knows Devin. Lilia knows Esther. Myrtle knows Xander. Leslie knows Myrtle. Adam knows Pedro. Priscilla knows Eamon. Jared knows Jill. Eamon knows Jenna. Myrtle knows Caroline. Eamon knows Doris. Jared knows Priscilla. Max knows Jermaine. Jared knows Yvonne. Max knows Leslie. Which of Esther and Pedro can Jared reach?", "answer": "Esther", "steps": [ "Jared knows Priscilla.", "Priscilla knows Eamon.", "Eamon knows Ember.", "Ember knows Lilia.", "Lilia knows Esther." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Jared", "Lilia", "Priscilla", "Jill", "Doris", "Ember", "Yvonne", "Esther", "Jenna", "Eamon", "Max", "Adam", "Leslie", "Connor", "Devin", "Caroline", "Jermaine", "Pedro", "Xander", "Myrtle" ], "edges": [ [ 0, 3 ], [ 0, 6 ], [ 0, 2 ], [ 1, 7 ], [ 2, 9 ], [ 5, 1 ], [ 9, 4 ], [ 9, 5 ], [ 9, 8 ], [ 10, 13 ], [ 10, 16 ], [ 10, 12 ], [ 11, 17 ], [ 12, 19 ], [ 15, 11 ], [ 19, 14 ], [ 19, 15 ], [ 19, 18 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Fanny knows Damian. Stacy knows Natalie. Becky knows Parker. Ashton knows Stacy. Parker knows Frances. Edwin knows Gonzalo. Gus knows Fanny. Parker knows Tanya. Edwin knows Ashton. Harper knows Celeste. Marco knows Marc. Gonzalo knows Milo. Frances knows India. Gus knows Becky. Agnes knows Whitney. Stacy knows Harper. Parker knows Agnes. Stacy knows Marco. Which of Whitney and Marc can Edwin reach?", "answer": "Marc", "steps": [ "Edwin knows Ashton.", "Ashton knows Stacy.", "Stacy knows Marco.", "Marco knows Marc." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Edwin", "Milo", "Ashton", "Natalie", "Stacy", "Gonzalo", "Marco", "Harper", "Marc", "Celeste", "Gus", "Damian", "Becky", "Tanya", "Parker", "Fanny", "Agnes", "Frances", "Whitney", "India" ], "edges": [ [ 0, 5 ], [ 0, 2 ], [ 2, 4 ], [ 4, 3 ], [ 4, 6 ], [ 4, 7 ], [ 5, 1 ], [ 6, 8 ], [ 7, 9 ], [ 10, 15 ], [ 10, 12 ], [ 12, 14 ], [ 14, 13 ], [ 14, 16 ], [ 14, 17 ], [ 15, 11 ], [ 16, 18 ], [ 17, 19 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Lily knows Effie. Kylie knows Geoffrey. Denver knows Kelsey. Ariana knows Nolan. Jane knows Max. Alicia knows Erma. Max knows Kylie. Effie knows Liam. Lauren knows Devin. Ivy knows Alicia. Denver knows Jane. Shane knows Lauren. Nolan knows Ivy. Clark knows Carson. Effie knows Ariana. Devin knows Denver. Geoffrey knows Marian. Carson knows Lily. Which of Kylie and Ivy can Clark reach?", "answer": "Ivy", "steps": [ "Clark knows Carson.", "Carson knows Lily.", "Lily knows Effie.", "Effie knows Ariana.", "Ariana knows Nolan.", "Nolan knows Ivy." ], "difficulty": 6, "original_distance": 8, "idx_to_symbol": [ "Clark", "Lily", "Erma", "Alicia", "Ivy", "Ariana", "Effie", "Nolan", "Carson", "Liam", "Shane", "Devin", "Marian", "Geoffrey", "Kylie", "Jane", "Denver", "Max", "Lauren", "Kelsey" ], "edges": [ [ 0, 8 ], [ 1, 6 ], [ 3, 2 ], [ 4, 3 ], [ 5, 7 ], [ 6, 5 ], [ 6, 9 ], [ 7, 4 ], [ 8, 1 ], [ 10, 18 ], [ 11, 16 ], [ 13, 12 ], [ 14, 13 ], [ 15, 17 ], [ 16, 15 ], [ 16, 19 ], [ 17, 14 ], [ 18, 11 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Catherine knows Julie. Catherine knows Sybil. Denver knows Catherine. Carlos knows Eunice. Faith knows Robin. Robin knows Iris. Denver knows Carey. Sybil knows Homer. Lucy knows Dick. Faith knows Wayne. Clarence knows Charity. Eunice knows Lana. Kenzie knows Allan. Robin knows Clarence. Allan knows Lucy. Kenzie knows Faith. Elena knows Denver. Elena knows Carlos. Which of Denver and Faith can Elena reach?", "answer": "Denver", "steps": [ "Elena knows Denver." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Elena", "Homer", "Carlos", "Lana", "Carey", "Eunice", "Denver", "Sybil", "Julie", "Catherine", "Kenzie", "Charity", "Allan", "Dick", "Wayne", "Lucy", "Faith", "Clarence", "Iris", "Robin" ], "edges": [ [ 0, 2 ], [ 0, 6 ], [ 2, 5 ], [ 5, 3 ], [ 6, 4 ], [ 6, 9 ], [ 7, 1 ], [ 9, 7 ], [ 9, 8 ], [ 10, 12 ], [ 10, 16 ], [ 12, 15 ], [ 15, 13 ], [ 16, 14 ], [ 16, 19 ], [ 17, 11 ], [ 19, 17 ], [ 19, 18 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Carmen knows Wilson. Myrtle knows Carlos. Leonard knows Norma. Pauline knows Leonard. Chad knows Pauline. Chad knows Myrtle. Sean knows Marilyn. Pablo knows Hannah. Norma knows Kai. Wilson knows Celia. Marilyn knows Bill. Leonard knows Daphna. Pablo knows Chad. Audrey knows Geraldine. Marilyn knows Dave. Bill knows Winifred. Carmen knows Sean. Audrey knows Carmen. Which of Pauline and Sean can Audrey reach?", "answer": "Sean", "steps": [ "Audrey knows Carmen.", "Carmen knows Sean." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Audrey", "Sean", "Geraldine", "Marilyn", "Celia", "Carmen", "Wilson", "Dave", "Winifred", "Bill", "Pablo", "Pauline", "Hannah", "Leonard", "Carlos", "Chad", "Myrtle", "Daphna", "Kai", "Norma" ], "edges": [ [ 0, 2 ], [ 0, 5 ], [ 1, 3 ], [ 3, 7 ], [ 3, 9 ], [ 5, 6 ], [ 5, 1 ], [ 6, 4 ], [ 9, 8 ], [ 10, 12 ], [ 10, 15 ], [ 11, 13 ], [ 13, 17 ], [ 13, 19 ], [ 15, 16 ], [ 15, 11 ], [ 16, 14 ], [ 19, 18 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Winifred knows Casey. Linda knows Neil. Enrique knows Trudy. Lacey knows Linda. Casey knows Dustin. Ashton knows Mario. Graham knows Kevin. Trudy knows Kendrick. Kendrick knows Corinne. Kendrick knows Della. Christina knows Ashton. Melanie knows Enrique. Kaleb knows Graham. Enrique knows Henrietta. Casey knows Rowan. Lacey knows Christina. Ashton knows Winifred. Kaleb knows Melanie. Which of Enrique and Ashton can Lacey reach?", "answer": "Ashton", "steps": [ "Lacey knows Christina.", "Christina knows Ashton." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Lacey", "Christina", "Casey", "Ashton", "Rowan", "Dustin", "Neil", "Mario", "Winifred", "Linda", "Kaleb", "Melanie", "Kendrick", "Enrique", "Corinne", "Della", "Kevin", "Henrietta", "Trudy", "Graham" ], "edges": [ [ 0, 1 ], [ 0, 9 ], [ 1, 3 ], [ 2, 4 ], [ 2, 5 ], [ 3, 7 ], [ 3, 8 ], [ 8, 2 ], [ 9, 6 ], [ 10, 11 ], [ 10, 19 ], [ 11, 13 ], [ 12, 14 ], [ 12, 15 ], [ 13, 17 ], [ 13, 18 ], [ 18, 12 ], [ 19, 16 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Yvette knows Regina. Christina knows Celeste. Joanna knows Sue. Patrick knows Electra. Sue knows Yvette. Patrick knows Georgia. Joanna knows Christina. Alison knows Stephanie. Georgia knows Glen. Patrick knows Declan. Sue knows Isla. Georgia knows Alison. Joanna knows Frank. Joanna knows Barbara. Yvette knows Kennedy. Declan knows Gustavo. Alison knows Chance. Patrick knows India. Which of Georgia and Sue can Joanna reach?", "answer": "Sue", "steps": [ "Joanna knows Sue." ], "difficulty": 1, "original_distance": 3, "idx_to_symbol": [ "Joanna", "Yvette", "Christina", "Isla", "Sue", "Frank", "Kennedy", "Barbara", "Celeste", "Regina", "Patrick", "Alison", "Declan", "Glen", "Georgia", "India", "Stephanie", "Electra", "Gustavo", "Chance" ], "edges": [ [ 0, 5 ], [ 0, 7 ], [ 0, 2 ], [ 0, 4 ], [ 1, 6 ], [ 1, 9 ], [ 2, 8 ], [ 4, 3 ], [ 4, 1 ], [ 10, 15 ], [ 10, 17 ], [ 10, 12 ], [ 10, 14 ], [ 11, 16 ], [ 11, 19 ], [ 12, 18 ], [ 14, 13 ], [ 14, 11 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Chloe knows Chester. Benjamin knows Claude. Otto knows Kieran. Sue knows Dayton. Lily knows Otto. Benjamin knows Charles. Otto knows Wendy. Chloe knows Laura. Noel knows Chloe. Chloe knows Devin. Otto knows Boyd. Lily knows Jacqueline. Kieran knows Benjamin. Noel knows Isabel. Sue knows Gareth. Noel knows Grady. Laura knows Sue. Lily knows Margaret. Which of Sue and Benjamin can Noel reach?", "answer": "Sue", "steps": [ "Noel knows Chloe.", "Chloe knows Laura.", "Laura knows Sue." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Noel", "Chester", "Chloe", "Gareth", "Dayton", "Devin", "Grady", "Sue", "Isabel", "Laura", "Lily", "Boyd", "Otto", "Charles", "Claude", "Wendy", "Margaret", "Benjamin", "Jacqueline", "Kieran" ], "edges": [ [ 0, 6 ], [ 0, 8 ], [ 0, 2 ], [ 2, 1 ], [ 2, 5 ], [ 2, 9 ], [ 7, 3 ], [ 7, 4 ], [ 9, 7 ], [ 10, 16 ], [ 10, 18 ], [ 10, 12 ], [ 12, 11 ], [ 12, 15 ], [ 12, 19 ], [ 17, 13 ], [ 17, 14 ], [ 19, 17 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Fern knows Darla. Greta knows Virgil. Ann knows Leroy. Keaton knows Barry. Greta knows Ann. Ann knows Eamon. Leroy knows Jose. Eli knows Kate. Edison knows Harper. Lars knows Fern. Harper knows Roland. Kate knows Edison. Ann knows Justin. Keaton knows Eli. Eli knows Daphne. Justin knows Lars. Daphne knows Taylor. Eli knows Reed. Which of Harper and Fern can Greta reach?", "answer": "Fern", "steps": [ "Greta knows Ann.", "Ann knows Justin.", "Justin knows Lars.", "Lars knows Fern." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Greta", "Lars", "Ann", "Virgil", "Jose", "Eamon", "Leroy", "Justin", "Fern", "Darla", "Keaton", "Edison", "Eli", "Barry", "Taylor", "Reed", "Daphne", "Kate", "Harper", "Roland" ], "edges": [ [ 0, 3 ], [ 0, 2 ], [ 1, 8 ], [ 2, 5 ], [ 2, 6 ], [ 2, 7 ], [ 6, 4 ], [ 7, 1 ], [ 8, 9 ], [ 10, 13 ], [ 10, 12 ], [ 11, 18 ], [ 12, 15 ], [ 12, 16 ], [ 12, 17 ], [ 16, 14 ], [ 17, 11 ], [ 18, 19 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Brian knows Alvin. Daphna knows Jenny. Alvin knows Morris. Kylie knows Clay. Clay knows Heidi. Joyce knows Tristan. Louise knows William. Heidi knows Brandon. Randall knows Kylie. Noel knows Winston. Jenny knows Randall. Fisher knows Finn. Heidi knows Jonathan. Finn knows Noel. Joyce knows Brian. Winston knows Dolores. Jonathan knows Louise. Dolores knows Joyce. Which of Brian and Jonathan can Fisher reach?", "answer": "Brian", "steps": [ "Fisher knows Finn.", "Finn knows Noel.", "Noel knows Winston.", "Winston knows Dolores.", "Dolores knows Joyce.", "Joyce knows Brian." ], "difficulty": 6, "original_distance": 8, "idx_to_symbol": [ "Fisher", "Winston", "Tristan", "Finn", "Noel", "Morris", "Joyce", "Alvin", "Dolores", "Brian", "Daphna", "Kylie", "Brandon", "Jenny", "Randall", "William", "Heidi", "Louise", "Clay", "Jonathan" ], "edges": [ [ 0, 3 ], [ 1, 8 ], [ 3, 4 ], [ 4, 1 ], [ 6, 2 ], [ 6, 9 ], [ 7, 5 ], [ 8, 6 ], [ 9, 7 ], [ 10, 13 ], [ 11, 18 ], [ 13, 14 ], [ 14, 11 ], [ 16, 12 ], [ 16, 19 ], [ 17, 15 ], [ 18, 16 ], [ 19, 17 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Earle knows Laura. Roland knows Darcy. Lucy knows Betty. Kevin knows Dixie. Yolanda knows Mae. Betty knows Kevin. Greer knows Earle. George knows Thea. Joy knows Lucy. Kevin knows Yolanda. Edna knows Wallace. Laura knows George. Dirk knows Agnes. Thea knows Roland. Ivan knows Joy. Darcy knows Dirk. Darcy knows Cecilia. Wallace knows Ivan. Which of Betty and Roland can Edna reach?", "answer": "Betty", "steps": [ "Edna knows Wallace.", "Wallace knows Ivan.", "Ivan knows Joy.", "Joy knows Lucy.", "Lucy knows Betty." ], "difficulty": 5, "original_distance": 8, "idx_to_symbol": [ "Edna", "Mae", "Kevin", "Wallace", "Joy", "Lucy", "Betty", "Yolanda", "Dixie", "Ivan", "Greer", "Agnes", "Darcy", "Earle", "George", "Thea", "Roland", "Dirk", "Cecilia", "Laura" ], "edges": [ [ 0, 3 ], [ 2, 7 ], [ 2, 8 ], [ 3, 9 ], [ 4, 5 ], [ 5, 6 ], [ 6, 2 ], [ 7, 1 ], [ 9, 4 ], [ 10, 13 ], [ 12, 17 ], [ 12, 18 ], [ 13, 19 ], [ 14, 15 ], [ 15, 16 ], [ 16, 12 ], [ 17, 11 ], [ 19, 14 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Leah knows Darius. Pam knows Ethan. Ethan knows Russell. Brock knows Maria. Frances knows Brock. Paula knows Garland. Darius knows Frances. Darius knows Anthony. Anthony knows Abby. Ethan knows Miranda. Ethan knows Sandy. Brock knows Riley. Garland knows Ray. Brock knows Chad. Garland knows Pam. Ray knows Dolores. Darius knows Miles. Garland knows Jude. Which of Maria and Russell can Leah reach?", "answer": "Maria", "steps": [ "Leah knows Darius.", "Darius knows Frances.", "Frances knows Brock.", "Brock knows Maria." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Leah", "Darius", "Chad", "Riley", "Anthony", "Frances", "Abby", "Maria", "Miles", "Brock", "Paula", "Garland", "Sandy", "Miranda", "Ray", "Pam", "Dolores", "Russell", "Jude", "Ethan" ], "edges": [ [ 0, 1 ], [ 1, 4 ], [ 1, 8 ], [ 1, 5 ], [ 4, 6 ], [ 5, 9 ], [ 9, 2 ], [ 9, 3 ], [ 9, 7 ], [ 10, 11 ], [ 11, 14 ], [ 11, 18 ], [ 11, 15 ], [ 14, 16 ], [ 15, 19 ], [ 19, 12 ], [ 19, 13 ], [ 19, 17 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Greg knows Diego. Graham knows Greg. Odette knows Marian. Tony knows Julio. Dave knows Graham. Madeline knows Kevin. Keith knows Dave. Knox knows Yasmin. Joanna knows Jim. Keith knows Daria. Graham knows Joaquin. Knox knows Joanna. Graham knows Odette. Madeline knows Carmela. Carmela knows Knox. Joaquin knows Natalie. Yasmin knows Margaret. Knox knows Tony. Which of Dave and Carmela can Keith reach?", "answer": "Dave", "steps": [ "Keith knows Dave." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Keith", "Dave", "Greg", "Daria", "Diego", "Odette", "Graham", "Joaquin", "Marian", "Natalie", "Madeline", "Carmela", "Joanna", "Kevin", "Jim", "Yasmin", "Knox", "Tony", "Margaret", "Julio" ], "edges": [ [ 0, 3 ], [ 0, 1 ], [ 1, 6 ], [ 2, 4 ], [ 5, 8 ], [ 6, 2 ], [ 6, 5 ], [ 6, 7 ], [ 7, 9 ], [ 10, 13 ], [ 10, 11 ], [ 11, 16 ], [ 12, 14 ], [ 15, 18 ], [ 16, 12 ], [ 16, 15 ], [ 16, 17 ], [ 17, 19 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Dave knows Oliver. Claudia knows Hubert. Dave knows Samuel. Viola knows Dave. Samuel knows Jon. Jarvis knows Liam. Oliver knows Jarvis. Ilene knows Claudia. Jon knows Keegan. Jarvis knows Myra. Dina knows Darren. Claudia knows Dina. Hubert knows Lillian. Darren knows Walt. Ilene knows Max. Darren knows Verna. Lillian knows Arden. Viola knows Sharon. Which of Jarvis and Darren can Ilene reach?", "answer": "Darren", "steps": [ "Ilene knows Claudia.", "Claudia knows Dina.", "Dina knows Darren." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Ilene", "Walt", "Dina", "Claudia", "Arden", "Hubert", "Lillian", "Darren", "Verna", "Max", "Viola", "Myra", "Oliver", "Dave", "Keegan", "Samuel", "Jon", "Jarvis", "Liam", "Sharon" ], "edges": [ [ 0, 3 ], [ 0, 9 ], [ 2, 7 ], [ 3, 5 ], [ 3, 2 ], [ 5, 6 ], [ 6, 4 ], [ 7, 1 ], [ 7, 8 ], [ 10, 13 ], [ 10, 19 ], [ 12, 17 ], [ 13, 15 ], [ 13, 12 ], [ 15, 16 ], [ 16, 14 ], [ 17, 11 ], [ 17, 18 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Joshua knows Vicki. Arlene knows Kendrick. Clifford knows Belinda. Elliot knows Brody. Hope knows Faith. Devon knows Farrah. Michelle knows Elliot. Trevor knows Hope. Farrah knows Joshua. Kendrick knows Randall. Dennis knows Gary. Henry knows Trevor. Tabitha knows Arlene. Michelle knows Tabitha. Dennis knows Devon. Belinda knows Michelle. Clifford knows Hal. Farrah knows Henry. Which of Arlene and Trevor can Clifford reach?", "answer": "Arlene", "steps": [ "Clifford knows Belinda.", "Belinda knows Michelle.", "Michelle knows Tabitha.", "Tabitha knows Arlene." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Clifford", "Tabitha", "Kendrick", "Hal", "Belinda", "Elliot", "Michelle", "Randall", "Arlene", "Brody", "Dennis", "Henry", "Hope", "Gary", "Devon", "Joshua", "Farrah", "Faith", "Trevor", "Vicki" ], "edges": [ [ 0, 3 ], [ 0, 4 ], [ 1, 8 ], [ 2, 7 ], [ 4, 6 ], [ 5, 9 ], [ 6, 1 ], [ 6, 5 ], [ 8, 2 ], [ 10, 13 ], [ 10, 14 ], [ 11, 18 ], [ 12, 17 ], [ 14, 16 ], [ 15, 19 ], [ 16, 11 ], [ 16, 15 ], [ 18, 12 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Omar knows Eli. Abel knows Odette. Judith knows Milton. Andre knows Ingrid. Kenzie knows Raymond. Abel knows Christina. Andre knows Trevor. Bernice knows Lillian. Vance knows Alan. Holden knows Kenzie. Judith knows Camille. Ingrid knows Nell. Alan knows Celia. Bernice knows Omar. Nell knows Holden. Eli knows Vance. Bernice knows Judith. Andre knows Abel. Which of Raymond and Celia can Bernice reach?", "answer": "Celia", "steps": [ "Bernice knows Omar.", "Omar knows Eli.", "Eli knows Vance.", "Vance knows Alan.", "Alan knows Celia." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Bernice", "Judith", "Vance", "Alan", "Eli", "Lillian", "Camille", "Omar", "Milton", "Celia", "Andre", "Abel", "Holden", "Kenzie", "Nell", "Trevor", "Christina", "Ingrid", "Odette", "Raymond" ], "edges": [ [ 0, 5 ], [ 0, 1 ], [ 0, 7 ], [ 1, 6 ], [ 1, 8 ], [ 2, 3 ], [ 3, 9 ], [ 4, 2 ], [ 7, 4 ], [ 10, 15 ], [ 10, 11 ], [ 10, 17 ], [ 11, 16 ], [ 11, 18 ], [ 12, 13 ], [ 13, 19 ], [ 14, 12 ], [ 17, 14 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Carla knows Jem. Guillermo knows Devon. Guillermo knows Darla. Esme knows Milo. Jeanne knows Matthew. Carla knows Amanda. Lark knows Darius. Darius knows Duncan. Guillermo knows Diego. Rocco knows Cain. Guillermo knows Troy. Duncan knows Guillermo. Katrina knows Carla. Carla knows Rocco. Troy knows Jeanne. Milo knows Katrina. Carla knows Rosa. Cain knows Travis. Which of Katrina and Duncan can Esme reach?", "answer": "Katrina", "steps": [ "Esme knows Milo.", "Milo knows Katrina." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Esme", "Rosa", "Katrina", "Amanda", "Carla", "Travis", "Milo", "Jem", "Rocco", "Cain", "Lark", "Darla", "Duncan", "Diego", "Guillermo", "Matthew", "Darius", "Devon", "Troy", "Jeanne" ], "edges": [ [ 0, 6 ], [ 2, 4 ], [ 4, 1 ], [ 4, 3 ], [ 4, 7 ], [ 4, 8 ], [ 6, 2 ], [ 8, 9 ], [ 9, 5 ], [ 10, 16 ], [ 12, 14 ], [ 14, 11 ], [ 14, 13 ], [ 14, 17 ], [ 14, 18 ], [ 16, 12 ], [ 18, 19 ], [ 19, 15 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Carol knows Duncan. Ilene knows Federico. Harper knows Elvira. Emily knows Cody. Myra knows Jenna. Jenna knows Ilene. Emily knows Aldo. Duncan knows Ruth. Kingsley knows Carol. Cody knows Kingsley. Emily knows Josie. Harper knows Myra. Jenna knows Edna. Carmela knows Graham. Carol knows Foster. Carmela knows Harper. Carmela knows Carlos. Cody knows Horace. Which of Jenna and Carol can Emily reach?", "answer": "Carol", "steps": [ "Emily knows Cody.", "Cody knows Kingsley.", "Kingsley knows Carol." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Emily", "Josie", "Cody", "Carol", "Aldo", "Kingsley", "Horace", "Foster", "Duncan", "Ruth", "Carmela", "Graham", "Harper", "Jenna", "Carlos", "Myra", "Elvira", "Edna", "Ilene", "Federico" ], "edges": [ [ 0, 1 ], [ 0, 4 ], [ 0, 2 ], [ 2, 6 ], [ 2, 5 ], [ 3, 7 ], [ 3, 8 ], [ 5, 3 ], [ 8, 9 ], [ 10, 11 ], [ 10, 14 ], [ 10, 12 ], [ 12, 16 ], [ 12, 15 ], [ 13, 17 ], [ 13, 18 ], [ 15, 13 ], [ 18, 19 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Ariana knows Rhea. Destiny knows Peggy. Keith knows Gideon. Will knows Lyric. Heath knows Virginia. Ember knows Jerome. Viola knows Heath. Heath knows Will. Destiny knows Margaret. Destiny knows Blair. Blaine knows Ariana. Gideon knows Destiny. Rhea knows Viola. Heath knows Abigail. Jerome knows Keith. Peggy knows Erwin. Peggy knows Tony. Will knows Nicole. Which of Keith and Rhea can Ember reach?", "answer": "Keith", "steps": [ "Ember knows Jerome.", "Jerome knows Keith." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Ember", "Erwin", "Tony", "Blair", "Jerome", "Gideon", "Peggy", "Destiny", "Keith", "Margaret", "Blaine", "Nicole", "Lyric", "Abigail", "Ariana", "Viola", "Will", "Heath", "Rhea", "Virginia" ], "edges": [ [ 0, 4 ], [ 4, 8 ], [ 5, 7 ], [ 6, 1 ], [ 6, 2 ], [ 7, 3 ], [ 7, 6 ], [ 7, 9 ], [ 8, 5 ], [ 10, 14 ], [ 14, 18 ], [ 15, 17 ], [ 16, 11 ], [ 16, 12 ], [ 17, 13 ], [ 17, 16 ], [ 17, 19 ], [ 18, 15 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Stacy knows Eden. Jasmine knows Morris. Christopher knows Lisette. Heather knows Louisa. Dylan knows Heather. Evan knows Sheila. Stacy knows Joaquin. Leopold knows Jasmine. Joaquin knows Stephen. Dylan knows Ella. Christopher knows Stacy. Heather knows Duke. Marian knows Evan. Louisa knows Marvin. Louisa knows Colin. Joaquin knows Edison. Edison knows Marian. Colin knows Leopold. Which of Joaquin and Louisa can Christopher reach?", "answer": "Joaquin", "steps": [ "Christopher knows Stacy.", "Stacy knows Joaquin." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Christopher", "Stacy", "Sheila", "Joaquin", "Edison", "Marian", "Lisette", "Eden", "Evan", "Stephen", "Dylan", "Heather", "Morris", "Louisa", "Colin", "Leopold", "Ella", "Duke", "Jasmine", "Marvin" ], "edges": [ [ 0, 6 ], [ 0, 1 ], [ 1, 7 ], [ 1, 3 ], [ 3, 4 ], [ 3, 9 ], [ 4, 5 ], [ 5, 8 ], [ 8, 2 ], [ 10, 16 ], [ 10, 11 ], [ 11, 17 ], [ 11, 13 ], [ 13, 14 ], [ 13, 19 ], [ 14, 15 ], [ 15, 18 ], [ 18, 12 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Karina knows Virgil. June knows Jaime. Karina knows Devon. Brooke knows Eduardo. Demetrius knows Israel. Israel knows Melody. Brooke knows Lars. Vanessa knows June. Lars knows Vanessa. Archie knows Ilene. Fanny knows Brett. June knows Elias. Devon knows Trevor. Israel knows Elliot. Virgil knows Demetrius. Eduardo knows Ben. Ben knows Fanny. Trevor knows Archie. Which of Virgil and Lars can Karina reach?", "answer": "Virgil", "steps": [ "Karina knows Virgil." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Karina", "Israel", "Trevor", "Demetrius", "Devon", "Archie", "Elliot", "Virgil", "Melody", "Ilene", "Brooke", "June", "Ben", "Vanessa", "Eduardo", "Fanny", "Elias", "Lars", "Jaime", "Brett" ], "edges": [ [ 0, 7 ], [ 0, 4 ], [ 1, 6 ], [ 1, 8 ], [ 2, 5 ], [ 3, 1 ], [ 4, 2 ], [ 5, 9 ], [ 7, 3 ], [ 10, 17 ], [ 10, 14 ], [ 11, 16 ], [ 11, 18 ], [ 12, 15 ], [ 13, 11 ], [ 14, 12 ], [ 15, 19 ], [ 17, 13 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Pauline knows Eunice. Abigail knows Dolly. Carson knows Maya. Keira knows Joshua. Gwen knows Keira. Natalie knows Greer. Sally knows Carson. Eunice knows Natalie. Dolly knows Dorian. Joshua knows Janet. Gwen knows Harlan. Caroline knows Ilene. Brad knows Warren. Janet knows Caroline. Pauline knows Amelia. Ilene knows Sally. Warren knows Abigail. Greer knows Brad. Which of Abigail and Sally can Gwen reach?", "answer": "Sally", "steps": [ "Gwen knows Keira.", "Keira knows Joshua.", "Joshua knows Janet.", "Janet knows Caroline.", "Caroline knows Ilene.", "Ilene knows Sally." ], "difficulty": 6, "original_distance": 8, "idx_to_symbol": [ "Gwen", "Joshua", "Harlan", "Carson", "Maya", "Keira", "Caroline", "Janet", "Ilene", "Sally", "Pauline", "Natalie", "Amelia", "Dolly", "Dorian", "Eunice", "Brad", "Greer", "Warren", "Abigail" ], "edges": [ [ 0, 2 ], [ 0, 5 ], [ 1, 7 ], [ 3, 4 ], [ 5, 1 ], [ 6, 8 ], [ 7, 6 ], [ 8, 9 ], [ 9, 3 ], [ 10, 12 ], [ 10, 15 ], [ 11, 17 ], [ 13, 14 ], [ 15, 11 ], [ 16, 18 ], [ 17, 16 ], [ 18, 19 ], [ 19, 13 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Gina knows Philip. Cora knows Rhonda. Bart knows Rebecca. Elaine knows Gina. Douglas knows Bart. Tom knows Ted. Randall knows Byron. Philip knows Aspen. Ted knows Elaine. Holden knows Claude. Aspen knows Trevor. Rebecca knows Ivy. Kane knows Tom. Rhonda knows Samantha. Claude knows Kane. Ivy knows Horace. Horace knows Cora. Samantha knows Randall. Which of Cora and Elaine can Douglas reach?", "answer": "Cora", "steps": [ "Douglas knows Bart.", "Bart knows Rebecca.", "Rebecca knows Ivy.", "Ivy knows Horace.", "Horace knows Cora." ], "difficulty": 5, "original_distance": 9, "idx_to_symbol": [ "Douglas", "Bart", "Randall", "Cora", "Ivy", "Rhonda", "Byron", "Rebecca", "Samantha", "Horace", "Holden", "Claude", "Aspen", "Elaine", "Tom", "Gina", "Trevor", "Kane", "Philip", "Ted" ], "edges": [ [ 0, 1 ], [ 1, 7 ], [ 2, 6 ], [ 3, 5 ], [ 4, 9 ], [ 5, 8 ], [ 7, 4 ], [ 8, 2 ], [ 9, 3 ], [ 10, 11 ], [ 11, 17 ], [ 12, 16 ], [ 13, 15 ], [ 14, 19 ], [ 15, 18 ], [ 17, 14 ], [ 18, 12 ], [ 19, 13 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Greer knows Darin. Brody knows Angelica. Maureen knows Kira. Jordan knows Hope. Saul knows Ariana. Greer knows Francesca. Jillian knows Enrique. Opal knows Brody. Darin knows Rebecca. Darin knows Betty. Opal knows Dwight. Dudley knows Jillian. Ariana knows Maureen. Ariana knows Jordan. Betty knows Jocelyn. Jillian knows Greer. Maureen knows Opal. Enrique knows Latoya. Which of Brody and Betty can Saul reach?", "answer": "Brody", "steps": [ "Saul knows Ariana.", "Ariana knows Maureen.", "Maureen knows Opal.", "Opal knows Brody." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Saul", "Jordan", "Angelica", "Hope", "Dwight", "Opal", "Ariana", "Maureen", "Brody", "Kira", "Dudley", "Enrique", "Jocelyn", "Latoya", "Rebecca", "Darin", "Jillian", "Greer", "Betty", "Francesca" ], "edges": [ [ 0, 6 ], [ 1, 3 ], [ 5, 4 ], [ 5, 8 ], [ 6, 1 ], [ 6, 7 ], [ 7, 5 ], [ 7, 9 ], [ 8, 2 ], [ 10, 16 ], [ 11, 13 ], [ 15, 14 ], [ 15, 18 ], [ 16, 11 ], [ 16, 17 ], [ 17, 15 ], [ 17, 19 ], [ 18, 12 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Hugh knows Daria. Jane knows Mara. Arden knows Opal. Paige knows Sean. Yuki knows Victor. Colin knows Rhonda. Lars knows Leopold. Victor knows Arden. Archer knows Paige. Fanny knows Ramona. Fanny knows Hugh. Sean knows Carl. Leopold knows Maggie. Maggie knows Jane. Opal knows Fanny. Daria knows Colin. Jane knows Archer. Hayes knows Lars. Which of Opal and Maggie can Yuki reach?", "answer": "Opal", "steps": [ "Yuki knows Victor.", "Victor knows Arden.", "Arden knows Opal." ], "difficulty": 3, "original_distance": 8, "idx_to_symbol": [ "Yuki", "Victor", "Daria", "Colin", "Fanny", "Opal", "Rhonda", "Arden", "Hugh", "Ramona", "Hayes", "Lars", "Paige", "Sean", "Jane", "Maggie", "Carl", "Leopold", "Archer", "Mara" ], "edges": [ [ 0, 1 ], [ 1, 7 ], [ 2, 3 ], [ 3, 6 ], [ 4, 8 ], [ 4, 9 ], [ 5, 4 ], [ 7, 5 ], [ 8, 2 ], [ 10, 11 ], [ 11, 17 ], [ 12, 13 ], [ 13, 16 ], [ 14, 18 ], [ 14, 19 ], [ 15, 14 ], [ 17, 15 ], [ 18, 12 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Maureen knows Hattie. Isadora knows Daphne. Daphne knows Jordan. Dalton knows Jennifer. Mara knows Isla. Isla knows Isadora. Maureen knows Dirk. Dirk knows Brooks. Jordan knows Otto. Kane knows Jay. Carla knows Penny. Jennifer knows Ford. Brody knows Lucille. Jay knows Eden. Jay knows Carla. Jordan knows Maureen. Ford knows Kane. Carla knows Brody. Which of Brooks and Lucille can Mara reach?", "answer": "Brooks", "steps": [ "Mara knows Isla.", "Isla knows Isadora.", "Isadora knows Daphne.", "Daphne knows Jordan.", "Jordan knows Maureen.", "Maureen knows Dirk.", "Dirk knows Brooks." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Mara", "Brooks", "Daphne", "Hattie", "Isla", "Maureen", "Dirk", "Otto", "Isadora", "Jordan", "Dalton", "Lucille", "Kane", "Penny", "Jennifer", "Carla", "Brody", "Eden", "Ford", "Jay" ], "edges": [ [ 0, 4 ], [ 2, 9 ], [ 4, 8 ], [ 5, 3 ], [ 5, 6 ], [ 6, 1 ], [ 8, 2 ], [ 9, 5 ], [ 9, 7 ], [ 10, 14 ], [ 12, 19 ], [ 14, 18 ], [ 15, 13 ], [ 15, 16 ], [ 16, 11 ], [ 18, 12 ], [ 19, 15 ], [ 19, 17 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Mark knows Etta. Hannah knows Garland. Jacqueline knows Kenzie. Myrtle knows Alex. Alex knows Aria. Julian knows Marcus. Nicholas knows Ramon. Garland knows Mark. Erik knows Hannah. Ramon knows Wanda. Alex knows Jacqueline. Jana knows Floyd. Marcus knows Myrtle. Mark knows Jana. Mike knows Giselle. Giselle knows Roman. Wanda knows Julian. Roman knows Erik. Which of Jacqueline and Jana can Mike reach?", "answer": "Jana", "steps": [ "Mike knows Giselle.", "Giselle knows Roman.", "Roman knows Erik.", "Erik knows Hannah.", "Hannah knows Garland.", "Garland knows Mark.", "Mark knows Jana." ], "difficulty": 7, "original_distance": 8, "idx_to_symbol": [ "Mike", "Etta", "Jana", "Mark", "Floyd", "Hannah", "Erik", "Giselle", "Garland", "Roman", "Nicholas", "Aria", "Jacqueline", "Alex", "Kenzie", "Marcus", "Julian", "Ramon", "Myrtle", "Wanda" ], "edges": [ [ 0, 7 ], [ 2, 4 ], [ 3, 1 ], [ 3, 2 ], [ 5, 8 ], [ 6, 5 ], [ 7, 9 ], [ 8, 3 ], [ 9, 6 ], [ 10, 17 ], [ 12, 14 ], [ 13, 11 ], [ 13, 12 ], [ 15, 18 ], [ 16, 15 ], [ 17, 19 ], [ 18, 13 ], [ 19, 16 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Sierra knows Lana. Judith knows Ezra. Landon knows Sara. Lana knows Fred. Emanuel knows Giselle. Judith knows Chase. Bette knows Judith. Ezra knows Cate. Vivian knows Wesley. Cruz knows Landon. Hunter knows Vivian. Landon knows Jeanne. Cate knows Wanda. Wanda knows Hunter. Fred knows Emanuel. Landon knows Jordan. Jeanne knows Sierra. Judith knows Chloe. Which of Sierra and Cate can Bette reach?", "answer": "Cate", "steps": [ "Bette knows Judith.", "Judith knows Ezra.", "Ezra knows Cate." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Bette", "Wesley", "Judith", "Ezra", "Chase", "Hunter", "Cate", "Chloe", "Vivian", "Wanda", "Cruz", "Giselle", "Landon", "Jeanne", "Sara", "Fred", "Sierra", "Jordan", "Emanuel", "Lana" ], "edges": [ [ 0, 2 ], [ 2, 4 ], [ 2, 7 ], [ 2, 3 ], [ 3, 6 ], [ 5, 8 ], [ 6, 9 ], [ 8, 1 ], [ 9, 5 ], [ 10, 12 ], [ 12, 14 ], [ 12, 17 ], [ 12, 13 ], [ 13, 16 ], [ 15, 18 ], [ 16, 19 ], [ 18, 11 ], [ 19, 15 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Opal knows Harris. Opal knows Lee. Jon knows Austin. April knows Ralph. Aurora knows Jenny. Jon knows Kamila. Della knows Jon. Kendrick knows Aurora. Kendrick knows Dylan. Harris knows Shannon. Jon knows Cornelius. Gwen knows Damian. Damian knows April. Damian knows Giselle. Opal knows Gwen. Cornelius knows Isadora. Austin knows Kendrick. Dorian knows Opal. Which of Jenny and Ralph can Della reach?", "answer": "Jenny", "steps": [ "Della knows Jon.", "Jon knows Austin.", "Austin knows Kendrick.", "Kendrick knows Aurora.", "Aurora knows Jenny." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Della", "Dylan", "Isadora", "Kamila", "Kendrick", "Jenny", "Aurora", "Cornelius", "Austin", "Jon", "Dorian", "Giselle", "Shannon", "Lee", "Damian", "Ralph", "April", "Harris", "Gwen", "Opal" ], "edges": [ [ 0, 9 ], [ 4, 1 ], [ 4, 6 ], [ 6, 5 ], [ 7, 2 ], [ 8, 4 ], [ 9, 3 ], [ 9, 7 ], [ 9, 8 ], [ 10, 19 ], [ 14, 11 ], [ 14, 16 ], [ 16, 15 ], [ 17, 12 ], [ 18, 14 ], [ 19, 13 ], [ 19, 17 ], [ 19, 18 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Brian knows Aldo. Lorraine knows Troy. Winston knows Derek. Jerry knows Harley. Jerry knows Diego. Harry knows Brian. Grant knows Lorraine. Autumn knows Frida. Troy knows Jerry. Aldo knows Jeff. Harley knows Autumn. Jeff knows Doris. Louisa knows Harry. Doris knows Willard. Diego knows Darrell. Aldo knows Winston. Winston knows Cora. Diego knows Dawn. Which of Autumn and Doris can Louisa reach?", "answer": "Doris", "steps": [ "Louisa knows Harry.", "Harry knows Brian.", "Brian knows Aldo.", "Aldo knows Jeff.", "Jeff knows Doris." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Louisa", "Willard", "Brian", "Derek", "Aldo", "Doris", "Jeff", "Harry", "Cora", "Winston", "Grant", "Frida", "Troy", "Darrell", "Jerry", "Autumn", "Harley", "Lorraine", "Dawn", "Diego" ], "edges": [ [ 0, 7 ], [ 2, 4 ], [ 4, 6 ], [ 4, 9 ], [ 5, 1 ], [ 6, 5 ], [ 7, 2 ], [ 9, 3 ], [ 9, 8 ], [ 10, 17 ], [ 12, 14 ], [ 14, 16 ], [ 14, 19 ], [ 15, 11 ], [ 16, 15 ], [ 17, 12 ], [ 19, 13 ], [ 19, 18 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Dalton knows Joel. Joanna knows Livia. Clay knows Myra. Yuki knows Penny. Joanna knows Yuki. Yuki knows Harvey. Celia knows Isadora. Lorenzo knows Dalton. Dalton knows Ava. Ava knows Celia. Harvey knows Eldon. Myra knows Lorenzo. Judy knows Abel. Ava knows Sandra. Celia knows Khashayar. Louis knows Joanna. Harvey knows Edison. Abel knows Louis. Which of Abel and Myra can Judy reach?", "answer": "Abel", "steps": [ "Judy knows Abel." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Judy", "Harvey", "Joanna", "Louis", "Edison", "Livia", "Eldon", "Yuki", "Abel", "Penny", "Clay", "Celia", "Dalton", "Lorenzo", "Isadora", "Joel", "Khashayar", "Ava", "Myra", "Sandra" ], "edges": [ [ 0, 8 ], [ 1, 4 ], [ 1, 6 ], [ 2, 5 ], [ 2, 7 ], [ 3, 2 ], [ 7, 1 ], [ 7, 9 ], [ 8, 3 ], [ 10, 18 ], [ 11, 14 ], [ 11, 16 ], [ 12, 15 ], [ 12, 17 ], [ 13, 12 ], [ 17, 11 ], [ 17, 19 ], [ 18, 13 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Leah knows Luz. Clara knows Michelle. Norma knows Corey. Maude knows Estelle. Norma knows Elijah. Nicole knows Leah. Darren knows Rose. Ariel knows Sebastian. Theodore knows Cameron. Ariel knows Clara. Maude knows Norma. Clark knows Adam. Michelle knows Nicole. Clara knows Theodore. Clara knows Trina. Rose knows Clark. Elijah knows Alexa. Norma knows Darren. Which of Leah and Clark can Ariel reach?", "answer": "Leah", "steps": [ "Ariel knows Clara.", "Clara knows Michelle.", "Michelle knows Nicole.", "Nicole knows Leah." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Ariel", "Michelle", "Trina", "Cameron", "Sebastian", "Luz", "Clara", "Theodore", "Nicole", "Leah", "Maude", "Darren", "Corey", "Alexa", "Estelle", "Adam", "Norma", "Elijah", "Rose", "Clark" ], "edges": [ [ 0, 4 ], [ 0, 6 ], [ 1, 8 ], [ 6, 2 ], [ 6, 7 ], [ 6, 1 ], [ 7, 3 ], [ 8, 9 ], [ 9, 5 ], [ 10, 14 ], [ 10, 16 ], [ 11, 18 ], [ 16, 12 ], [ 16, 17 ], [ 16, 11 ], [ 17, 13 ], [ 18, 19 ], [ 19, 15 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Kurt knows Lynn. Jorge knows Michael. Kelly knows Erma. Nolan knows Elizabeth. Kelly knows Shawn. Yvette knows Nolan. Kristina knows Yvette. Michael knows Paula. Lynn knows Kelly. Shawn knows Rick. Kristina knows Dominic. Brody knows Camille. Rick knows April. Lynn knows Dana. Yvette knows Jorge. Viola knows Kristina. Erma knows Brody. Elizabeth knows Ben. Which of Lynn and Kristina can Viola reach?", "answer": "Kristina", "steps": [ "Viola knows Kristina." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Viola", "Kristina", "Elizabeth", "Nolan", "Paula", "Yvette", "Jorge", "Ben", "Dominic", "Michael", "Kurt", "Lynn", "Rick", "Shawn", "Camille", "Kelly", "Erma", "April", "Dana", "Brody" ], "edges": [ [ 0, 1 ], [ 1, 8 ], [ 1, 5 ], [ 2, 7 ], [ 3, 2 ], [ 5, 3 ], [ 5, 6 ], [ 6, 9 ], [ 9, 4 ], [ 10, 11 ], [ 11, 18 ], [ 11, 15 ], [ 12, 17 ], [ 13, 12 ], [ 15, 13 ], [ 15, 16 ], [ 16, 19 ], [ 19, 14 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Gilbert knows Kenzie. Carter knows Lee. Tom knows Leigh. Leon knows Jackson. Carter knows Samuel. Georgia knows Carter. Lucas knows Charlotte. Leigh knows Leon. Leon knows Elodie. Gilbert knows Craig. Rick knows Gilbert. Gilbert knows Angela. Samuel knows Aldo. Angela knows Tom. Carter knows Shane. Mark knows Lucas. Lucas knows Howard. Aldo knows Mark. Which of Angela and Samuel can Georgia reach?", "answer": "Samuel", "steps": [ "Georgia knows Carter.", "Carter knows Samuel." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Georgia", "Samuel", "Lucas", "Charlotte", "Aldo", "Howard", "Mark", "Carter", "Shane", "Lee", "Rick", "Angela", "Leon", "Jackson", "Tom", "Elodie", "Leigh", "Gilbert", "Kenzie", "Craig" ], "edges": [ [ 0, 7 ], [ 1, 4 ], [ 2, 3 ], [ 2, 5 ], [ 4, 6 ], [ 6, 2 ], [ 7, 1 ], [ 7, 8 ], [ 7, 9 ], [ 10, 17 ], [ 11, 14 ], [ 12, 13 ], [ 12, 15 ], [ 14, 16 ], [ 16, 12 ], [ 17, 11 ], [ 17, 18 ], [ 17, 19 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Lorna knows Louisa. Dudley knows Lorna. Gustavo knows Susan. Darla knows Alyssa. Laurel knows Gustavo. Myrtle knows June. Myrtle knows Dudley. Susan knows Opal. June knows Jeanette. Dudley knows Henrietta. Louisa knows Magdalena. Nicholas knows Darla. Nicholas knows Paige. Nicholas knows Bernard. Bernard knows David. Darla knows Laurel. Myrtle knows Karen. Magdalena knows Herbert. Which of Lorna and Laurel can Myrtle reach?", "answer": "Lorna", "steps": [ "Myrtle knows Dudley.", "Dudley knows Lorna." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Myrtle", "Henrietta", "Lorna", "Dudley", "Magdalena", "June", "Jeanette", "Louisa", "Karen", "Herbert", "Nicholas", "Alyssa", "Laurel", "Darla", "Susan", "Bernard", "David", "Gustavo", "Paige", "Opal" ], "edges": [ [ 0, 5 ], [ 0, 8 ], [ 0, 3 ], [ 2, 7 ], [ 3, 1 ], [ 3, 2 ], [ 4, 9 ], [ 5, 6 ], [ 7, 4 ], [ 10, 15 ], [ 10, 18 ], [ 10, 13 ], [ 12, 17 ], [ 13, 11 ], [ 13, 12 ], [ 14, 19 ], [ 15, 16 ], [ 17, 14 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Maureen knows Hattie. Isadora knows Daphne. Daphne knows Jordan. Dalton knows Jennifer. Mara knows Isla. Isla knows Isadora. Maureen knows Dirk. Dirk knows Brooks. Jordan knows Otto. Kane knows Jay. Carla knows Penny. Jennifer knows Ford. Brody knows Lucille. Jay knows Eden. Jay knows Carla. Jordan knows Maureen. Ford knows Kane. Carla knows Brody. Which of Brody and Dirk can Mara reach?", "answer": "Dirk", "steps": [ "Mara knows Isla.", "Isla knows Isadora.", "Isadora knows Daphne.", "Daphne knows Jordan.", "Jordan knows Maureen.", "Maureen knows Dirk." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Mara", "Brooks", "Daphne", "Hattie", "Isla", "Maureen", "Dirk", "Otto", "Isadora", "Jordan", "Dalton", "Lucille", "Kane", "Penny", "Jennifer", "Carla", "Brody", "Eden", "Ford", "Jay" ], "edges": [ [ 0, 4 ], [ 2, 9 ], [ 4, 8 ], [ 5, 3 ], [ 5, 6 ], [ 6, 1 ], [ 8, 2 ], [ 9, 5 ], [ 9, 7 ], [ 10, 14 ], [ 12, 19 ], [ 14, 18 ], [ 15, 13 ], [ 15, 16 ], [ 16, 11 ], [ 18, 12 ], [ 19, 15 ], [ 19, 17 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Sierra knows Lucille. Lucille knows Troy. Iris knows Jackson. Jose knows Kit. Sierra knows Clyde. Eli knows Sierra. Iris knows Harriet. Ken knows Xavier. Ken knows Marlene. Jose knows Trevor. Chris knows Iris. Julian knows Jose. Julian knows Cesar. Felicia knows Julian. Lucille knows Amelia. Clay knows Ken. Ken knows Felicia. Iris knows Eli. Which of Troy and Trevor can Clay reach?", "answer": "Trevor", "steps": [ "Clay knows Ken.", "Ken knows Felicia.", "Felicia knows Julian.", "Julian knows Jose.", "Jose knows Trevor." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Clay", "Xavier", "Trevor", "Kit", "Marlene", "Jose", "Ken", "Julian", "Felicia", "Cesar", "Chris", "Harriet", "Troy", "Amelia", "Jackson", "Lucille", "Iris", "Sierra", "Eli", "Clyde" ], "edges": [ [ 0, 6 ], [ 5, 2 ], [ 5, 3 ], [ 6, 1 ], [ 6, 4 ], [ 6, 8 ], [ 7, 5 ], [ 7, 9 ], [ 8, 7 ], [ 10, 16 ], [ 15, 12 ], [ 15, 13 ], [ 16, 11 ], [ 16, 14 ], [ 16, 18 ], [ 17, 15 ], [ 17, 19 ], [ 18, 17 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Warren knows Nancy. John knows Austin. Atlas knows John. Constance knows Claude. John knows Zara. Austin knows Daphne. Bart knows Hunter. Alma knows Ray. Bart knows Warren. Hunter knows Henrietta. Ray knows Hannah. Don knows Atlas. Bart knows Clyde. Hannah knows Bart. John knows Constance. Hunter knows Celia. Allison knows Don. Austin knows Carla. Which of Don and Ray can Allison reach?", "answer": "Don", "steps": [ "Allison knows Don." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Allison", "Constance", "Austin", "Don", "Zara", "Atlas", "Carla", "Claude", "John", "Daphne", "Alma", "Warren", "Hunter", "Ray", "Clyde", "Hannah", "Celia", "Nancy", "Bart", "Henrietta" ], "edges": [ [ 0, 3 ], [ 1, 7 ], [ 2, 6 ], [ 2, 9 ], [ 3, 5 ], [ 5, 8 ], [ 8, 4 ], [ 8, 1 ], [ 8, 2 ], [ 10, 13 ], [ 11, 17 ], [ 12, 16 ], [ 12, 19 ], [ 13, 15 ], [ 15, 18 ], [ 18, 14 ], [ 18, 11 ], [ 18, 12 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Wilbur knows Xavier. Landon knows Wilbur. Holly knows Vanessa. Abigail knows Arden. Arden knows Edison. Vanessa knows Leonard. Lyle knows Devin. Abigail knows Holly. Beatrice knows Theodore. Lennox knows Conrad. Rowan knows Abigail. Theodore knows Landon. Theodore knows Lennox. Colin knows Ryan. Edison knows Luz. Conrad knows Louis. Devin knows Rowan. Ryan knows Beatrice. Which of Devin and Ryan can Colin reach?", "answer": "Ryan", "steps": [ "Colin knows Ryan." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Colin", "Landon", "Conrad", "Louis", "Theodore", "Beatrice", "Wilbur", "Xavier", "Lennox", "Ryan", "Lyle", "Holly", "Edison", "Luz", "Abigail", "Rowan", "Vanessa", "Leonard", "Arden", "Devin" ], "edges": [ [ 0, 9 ], [ 1, 6 ], [ 2, 3 ], [ 4, 1 ], [ 4, 8 ], [ 5, 4 ], [ 6, 7 ], [ 8, 2 ], [ 9, 5 ], [ 10, 19 ], [ 11, 16 ], [ 12, 13 ], [ 14, 11 ], [ 14, 18 ], [ 15, 14 ], [ 16, 17 ], [ 18, 12 ], [ 19, 15 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Langston knows Kara. Aspen knows Grover. Eunice knows Langston. Edwin knows Eunice. Grover knows Norman. Adam knows Dolores. Langston knows Nora. Eunice knows Caleb. Sierra knows Parker. Adam knows Gary. Eunice knows Courtney. Dolores knows Emery. Edwin knows Sierra. Freya knows Edwin. Adam knows Miriam. Grover knows Adam. Dolores knows Dawn. Norman knows Jordan. Which of Dolores and Langston can Freya reach?", "answer": "Langston", "steps": [ "Freya knows Edwin.", "Edwin knows Eunice.", "Eunice knows Langston." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Freya", "Sierra", "Langston", "Caleb", "Courtney", "Nora", "Parker", "Kara", "Edwin", "Eunice", "Aspen", "Norman", "Dolores", "Gary", "Miriam", "Emery", "Jordan", "Dawn", "Grover", "Adam" ], "edges": [ [ 0, 8 ], [ 1, 6 ], [ 2, 5 ], [ 2, 7 ], [ 8, 1 ], [ 8, 9 ], [ 9, 3 ], [ 9, 4 ], [ 9, 2 ], [ 10, 18 ], [ 11, 16 ], [ 12, 15 ], [ 12, 17 ], [ 18, 11 ], [ 18, 19 ], [ 19, 13 ], [ 19, 14 ], [ 19, 12 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Mike knows Laura. Ursula knows Jeremy. Laura knows Stefan. Greta knows Faye. Blanche knows Leon. Ann knows Bernadette. Dalton knows Derek. August knows Heather. Lorraine knows Tyler. Ursula knows Lorraine. Faye knows Dalton. Parker knows Ann. Faye knows Parker. Leon knows Greta. Tyler knows Mike. Miles knows August. Blanche knows Basil. Mike knows Miles. Which of August and Ann can Blanche reach?", "answer": "Ann", "steps": [ "Blanche knows Leon.", "Leon knows Greta.", "Greta knows Faye.", "Faye knows Parker.", "Parker knows Ann." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Blanche", "Greta", "Bernadette", "Dalton", "Basil", "Parker", "Leon", "Faye", "Ann", "Derek", "Ursula", "Tyler", "Heather", "Laura", "Jeremy", "Miles", "Lorraine", "Mike", "August", "Stefan" ], "edges": [ [ 0, 4 ], [ 0, 6 ], [ 1, 7 ], [ 3, 9 ], [ 5, 8 ], [ 6, 1 ], [ 7, 5 ], [ 7, 3 ], [ 8, 2 ], [ 10, 14 ], [ 10, 16 ], [ 11, 17 ], [ 13, 19 ], [ 15, 18 ], [ 16, 11 ], [ 17, 15 ], [ 17, 13 ], [ 18, 12 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Earl knows Jose. Kirsten knows Justin. Harper knows Francesca. Israel knows Layla. Luella knows Diego. Jude knows Chandler. Logan knows Emmett. Earl knows Harper. Logan knows Jude. Logan knows Ross. Logan knows Kirsten. Harper knows Mary. Israel knows Earl. Israel knows Luella. Angelica knows Sonia. Jude knows Angelica. Angelica knows Oliver. Israel knows Hannah. Which of Sonia and Mary can Israel reach?", "answer": "Mary", "steps": [ "Israel knows Earl.", "Earl knows Harper.", "Harper knows Mary." ], "difficulty": 3, "original_distance": 3, "idx_to_symbol": [ "Israel", "Harper", "Francesca", "Hannah", "Layla", "Earl", "Diego", "Luella", "Jose", "Mary", "Logan", "Angelica", "Oliver", "Emmett", "Ross", "Jude", "Justin", "Kirsten", "Chandler", "Sonia" ], "edges": [ [ 0, 3 ], [ 0, 4 ], [ 0, 7 ], [ 0, 5 ], [ 1, 2 ], [ 1, 9 ], [ 5, 8 ], [ 5, 1 ], [ 7, 6 ], [ 10, 13 ], [ 10, 14 ], [ 10, 17 ], [ 10, 15 ], [ 11, 12 ], [ 11, 19 ], [ 15, 18 ], [ 15, 11 ], [ 17, 16 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Felix knows Mike. Alma knows Harry. Grace knows Enrique. Emily knows Grace. Harry knows Howard. Mike knows Ray. Jerome knows Jakob. Ray knows Todd. Jakob knows Ellis. Kara knows Brody. Mike knows Yasmin. Todd knows Jerome. Lorenzo knows Kara. Brody knows Cruz. Ellis knows Jessica. Enrique knows Lorenzo. Harry knows Emily. Jessica knows Blanche. Which of Ray and Emily can Felix reach?", "answer": "Ray", "steps": [ "Felix knows Mike.", "Mike knows Ray." ], "difficulty": 2, "original_distance": 8, "idx_to_symbol": [ "Felix", "Blanche", "Mike", "Ray", "Jakob", "Yasmin", "Todd", "Jessica", "Ellis", "Jerome", "Alma", "Cruz", "Harry", "Emily", "Lorenzo", "Howard", "Grace", "Brody", "Kara", "Enrique" ], "edges": [ [ 0, 2 ], [ 2, 5 ], [ 2, 3 ], [ 3, 6 ], [ 4, 8 ], [ 6, 9 ], [ 7, 1 ], [ 8, 7 ], [ 9, 4 ], [ 10, 12 ], [ 12, 15 ], [ 12, 13 ], [ 13, 16 ], [ 14, 18 ], [ 16, 19 ], [ 17, 11 ], [ 18, 17 ], [ 19, 14 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Jermaine knows Aurora. Ann knows Gina. Monica knows Ruby. Ann knows Maude. Saul knows Monica. Ruby knows Yolanda. Amelia knows Jules. Eleanor knows Ann. Levi knows Veronica. Eleanor knows Archie. Jules knows Cesar. Jermaine knows Amelia. Yolanda knows Lars. Yolanda knows Kenzie. Lars knows Levi. Monica knows Eugenia. Maude knows Jermaine. Saul knows Lewis. Which of Veronica and Cesar can Saul reach?", "answer": "Veronica", "steps": [ "Saul knows Monica.", "Monica knows Ruby.", "Ruby knows Yolanda.", "Yolanda knows Lars.", "Lars knows Levi.", "Levi knows Veronica." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Saul", "Veronica", "Monica", "Kenzie", "Eugenia", "Lewis", "Levi", "Lars", "Ruby", "Yolanda", "Eleanor", "Cesar", "Ann", "Aurora", "Gina", "Archie", "Jules", "Amelia", "Maude", "Jermaine" ], "edges": [ [ 0, 5 ], [ 0, 2 ], [ 2, 4 ], [ 2, 8 ], [ 6, 1 ], [ 7, 6 ], [ 8, 9 ], [ 9, 3 ], [ 9, 7 ], [ 10, 15 ], [ 10, 12 ], [ 12, 14 ], [ 12, 18 ], [ 16, 11 ], [ 17, 16 ], [ 18, 19 ], [ 19, 13 ], [ 19, 17 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Catherine knows Clinton. Jessie knows Mindy. Jonathan knows Catherine. Heather knows Leo. Eric knows Dolores. Diane knows Desmond. Rhea knows Stacy. Gloria knows Laverne. Jonathan knows Griffith. Clyde knows Porter. Rhea knows Clyde. Jenna knows Heather. Gloria knows Diane. Gloria knows Jonathan. Stacy knows Eric. Stacy knows Jenna. Griffith knows Jessie. Rhea knows Perry. Which of Jenna and Griffith can Gloria reach?", "answer": "Griffith", "steps": [ "Gloria knows Jonathan.", "Jonathan knows Griffith." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Gloria", "Laverne", "Griffith", "Desmond", "Catherine", "Mindy", "Clinton", "Jessie", "Diane", "Jonathan", "Rhea", "Perry", "Jenna", "Porter", "Eric", "Leo", "Dolores", "Heather", "Clyde", "Stacy" ], "edges": [ [ 0, 1 ], [ 0, 8 ], [ 0, 9 ], [ 2, 7 ], [ 4, 6 ], [ 7, 5 ], [ 8, 3 ], [ 9, 4 ], [ 9, 2 ], [ 10, 11 ], [ 10, 18 ], [ 10, 19 ], [ 12, 17 ], [ 14, 16 ], [ 17, 15 ], [ 18, 13 ], [ 19, 14 ], [ 19, 12 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Shelly knows Brett. Justine knows Benjamin. Brett knows Parker. Benjamin knows Aiden. Jeanette knows Justine. Carol knows Helene. Carol knows Georgia. Alyssa knows Lionel. Alejandro knows Edmund. Parker knows Alyssa. Benjamin knows Chester. Dean knows Jeanette. Justine knows Hadley. Edmund knows Dean. Dean knows August. Alyssa knows Carol. Wallace knows Shelly. Brett knows Kendra. Which of Jeanette and Parker can Wallace reach?", "answer": "Parker", "steps": [ "Wallace knows Shelly.", "Shelly knows Brett.", "Brett knows Parker." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Wallace", "Alyssa", "Georgia", "Lionel", "Carol", "Parker", "Helene", "Kendra", "Brett", "Shelly", "Alejandro", "Justine", "Aiden", "Hadley", "Benjamin", "Jeanette", "Chester", "August", "Dean", "Edmund" ], "edges": [ [ 0, 9 ], [ 1, 3 ], [ 1, 4 ], [ 4, 2 ], [ 4, 6 ], [ 5, 1 ], [ 8, 5 ], [ 8, 7 ], [ 9, 8 ], [ 10, 19 ], [ 11, 13 ], [ 11, 14 ], [ 14, 12 ], [ 14, 16 ], [ 15, 11 ], [ 18, 15 ], [ 18, 17 ], [ 19, 18 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Dalton knows Lara. Dalton knows Simon. Leland knows Jeremy. Autumn knows Rick. Jeremy knows Esperanza. Lara knows Geneva. Adele knows Isla. Geneva knows Darla. Isla knows Helene. Fletcher knows Ivy. Helene knows Dalton. Dalton knows Daphna. Daphna knows Federico. Jeremy knows Kai. Yuki knows Leland. Jeremy knows Autumn. Sue knows Yuki. Esperanza knows Fletcher. Which of Helene and Leland can Sue reach?", "answer": "Leland", "steps": [ "Sue knows Yuki.", "Yuki knows Leland." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Sue", "Leland", "Esperanza", "Kai", "Fletcher", "Yuki", "Rick", "Jeremy", "Ivy", "Autumn", "Adele", "Helene", "Lara", "Simon", "Geneva", "Isla", "Federico", "Dalton", "Darla", "Daphna" ], "edges": [ [ 0, 5 ], [ 1, 7 ], [ 2, 4 ], [ 4, 8 ], [ 5, 1 ], [ 7, 3 ], [ 7, 2 ], [ 7, 9 ], [ 9, 6 ], [ 10, 15 ], [ 11, 17 ], [ 12, 14 ], [ 14, 18 ], [ 15, 11 ], [ 17, 13 ], [ 17, 12 ], [ 17, 19 ], [ 19, 16 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Kirk knows Lacey. Yvonne knows Cassidy. Fanny knows Alyssa. Belinda knows Jason. Rhea knows Belinda. Jason knows Isaac. Kirk knows Brody. Jason knows Kirk. Benjamin knows Ashton. Isaac knows Yvonne. Belinda knows Blake. Stella knows Fanny. Adelaide knows Scott. Alyssa knows Benjamin. Adelaide knows Diane. Fanny knows Mark. Ashton knows Dolly. Alyssa knows Adelaide. Which of Cassidy and Dolly can Rhea reach?", "answer": "Cassidy", "steps": [ "Rhea knows Belinda.", "Belinda knows Jason.", "Jason knows Isaac.", "Isaac knows Yvonne.", "Yvonne knows Cassidy." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Rhea", "Brody", "Lacey", "Belinda", "Jason", "Yvonne", "Blake", "Isaac", "Kirk", "Cassidy", "Stella", "Scott", "Diane", "Fanny", "Alyssa", "Ashton", "Mark", "Benjamin", "Adelaide", "Dolly" ], "edges": [ [ 0, 3 ], [ 3, 6 ], [ 3, 4 ], [ 4, 8 ], [ 4, 7 ], [ 5, 9 ], [ 7, 5 ], [ 8, 1 ], [ 8, 2 ], [ 10, 13 ], [ 13, 16 ], [ 13, 14 ], [ 14, 18 ], [ 14, 17 ], [ 15, 19 ], [ 17, 15 ], [ 18, 11 ], [ 18, 12 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Kirk knows Lacey. Yvonne knows Cassidy. Fanny knows Alyssa. Belinda knows Jason. Rhea knows Belinda. Jason knows Isaac. Kirk knows Brody. Jason knows Kirk. Benjamin knows Ashton. Isaac knows Yvonne. Belinda knows Blake. Stella knows Fanny. Adelaide knows Scott. Alyssa knows Benjamin. Adelaide knows Diane. Fanny knows Mark. Ashton knows Dolly. Alyssa knows Adelaide. Which of Alyssa and Jason can Rhea reach?", "answer": "Jason", "steps": [ "Rhea knows Belinda.", "Belinda knows Jason." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Rhea", "Brody", "Lacey", "Belinda", "Jason", "Yvonne", "Blake", "Isaac", "Kirk", "Cassidy", "Stella", "Scott", "Diane", "Fanny", "Alyssa", "Ashton", "Mark", "Benjamin", "Adelaide", "Dolly" ], "edges": [ [ 0, 3 ], [ 3, 6 ], [ 3, 4 ], [ 4, 8 ], [ 4, 7 ], [ 5, 9 ], [ 7, 5 ], [ 8, 1 ], [ 8, 2 ], [ 10, 13 ], [ 13, 16 ], [ 13, 14 ], [ 14, 18 ], [ 14, 17 ], [ 15, 19 ], [ 17, 15 ], [ 18, 11 ], [ 18, 12 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Adam knows Fern. Adam knows Richard. Alejandro knows April. Justin knows Alejandro. Leah knows Justin. Flora knows Griffith. Justin knows Taylor. Kristina knows Adam. April knows Karen. Katrina knows Kristina. Richard knows Flora. Belinda knows Keith. Justin knows Layla. Adam knows Ashton. Dallas knows Chris. Rachel knows Leah. Kristina knows Belinda. Leah knows Dallas. Which of April and Flora can Rachel reach?", "answer": "April", "steps": [ "Rachel knows Leah.", "Leah knows Justin.", "Justin knows Alejandro.", "Alejandro knows April." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Rachel", "Karen", "Taylor", "Alejandro", "Layla", "Justin", "Chris", "Leah", "Dallas", "April", "Katrina", "Griffith", "Ashton", "Richard", "Fern", "Adam", "Keith", "Kristina", "Belinda", "Flora" ], "edges": [ [ 0, 7 ], [ 3, 9 ], [ 5, 2 ], [ 5, 4 ], [ 5, 3 ], [ 7, 8 ], [ 7, 5 ], [ 8, 6 ], [ 9, 1 ], [ 10, 17 ], [ 13, 19 ], [ 15, 12 ], [ 15, 14 ], [ 15, 13 ], [ 17, 18 ], [ 17, 15 ], [ 18, 16 ], [ 19, 11 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Fernando knows Marcia. Fraser knows Doris. Donovan knows Hailey. Hailey knows Marie. Howard knows Gwen. Roy knows Peggy. Hailey knows John. Doris knows Lyle. Marcia knows Howard. John knows Roy. Peggy knows Larissa. Marie knows Atlas. Peggy knows Carmen. Fraser knows Fernando. Howard knows Patricia. Peggy knows Elizabeth. Howard knows Kay. Sam knows Fraser. Which of Fraser and Hailey can Sam reach?", "answer": "Fraser", "steps": [ "Sam knows Fraser." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Sam", "Fernando", "Lyle", "Fraser", "Doris", "Marcia", "Gwen", "Patricia", "Kay", "Howard", "Donovan", "John", "Atlas", "Hailey", "Marie", "Roy", "Elizabeth", "Larissa", "Carmen", "Peggy" ], "edges": [ [ 0, 3 ], [ 1, 5 ], [ 3, 4 ], [ 3, 1 ], [ 4, 2 ], [ 5, 9 ], [ 9, 6 ], [ 9, 7 ], [ 9, 8 ], [ 10, 13 ], [ 11, 15 ], [ 13, 14 ], [ 13, 11 ], [ 14, 12 ], [ 15, 19 ], [ 19, 16 ], [ 19, 17 ], [ 19, 18 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Caroline knows Adam. Ember knows Lilia. Eamon knows Ember. Max knows Connor. Myrtle knows Devin. Lilia knows Esther. Myrtle knows Xander. Leslie knows Myrtle. Adam knows Pedro. Priscilla knows Eamon. Jared knows Jill. Eamon knows Jenna. Myrtle knows Caroline. Eamon knows Doris. Jared knows Priscilla. Max knows Jermaine. Jared knows Yvonne. Max knows Leslie. Which of Eamon and Myrtle can Jared reach?", "answer": "Eamon", "steps": [ "Jared knows Priscilla.", "Priscilla knows Eamon." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Jared", "Lilia", "Priscilla", "Jill", "Doris", "Ember", "Yvonne", "Esther", "Jenna", "Eamon", "Max", "Adam", "Leslie", "Connor", "Devin", "Caroline", "Jermaine", "Pedro", "Xander", "Myrtle" ], "edges": [ [ 0, 3 ], [ 0, 6 ], [ 0, 2 ], [ 1, 7 ], [ 2, 9 ], [ 5, 1 ], [ 9, 4 ], [ 9, 5 ], [ 9, 8 ], [ 10, 13 ], [ 10, 16 ], [ 10, 12 ], [ 11, 17 ], [ 12, 19 ], [ 15, 11 ], [ 19, 14 ], [ 19, 15 ], [ 19, 18 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Omar knows Floyd. Karl knows Lucia. Floyd knows Arden. Troy knows Kurt. Natalie knows Jana. Natalie knows Jared. Zack knows Louisa. Adelaide knows Casey. Victoria knows Earl. Floyd knows Julian. Lucia knows Dawn. Kevin knows Karl. Adelaide knows Zack. Omar knows Adelaide. Earl knows Logan. Casey knows Troy. Kevin knows Natalie. Karl knows Victoria. Which of Victoria and Casey can Kevin reach?", "answer": "Victoria", "steps": [ "Kevin knows Karl.", "Karl knows Victoria." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Kevin", "Jared", "Natalie", "Lucia", "Logan", "Victoria", "Jana", "Dawn", "Karl", "Earl", "Omar", "Julian", "Floyd", "Zack", "Kurt", "Casey", "Arden", "Louisa", "Adelaide", "Troy" ], "edges": [ [ 0, 2 ], [ 0, 8 ], [ 2, 1 ], [ 2, 6 ], [ 3, 7 ], [ 5, 9 ], [ 8, 3 ], [ 8, 5 ], [ 9, 4 ], [ 10, 12 ], [ 10, 18 ], [ 12, 11 ], [ 12, 16 ], [ 13, 17 ], [ 15, 19 ], [ 18, 13 ], [ 18, 15 ], [ 19, 14 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Wilson knows Neal. Renee knows Matthew. Morgan knows Isabel. Isabel knows Bonnie. Neal knows Camille. Diane knows Renee. Isabel knows Hugo. Renee knows Chad. Gabriel knows Diane. Neal knows Owen. Isabel knows Tara. Morgan knows Zara. Desmond knows Louise. Tara knows Wilson. Desmond knows Keegan. John knows Desmond. Desmond knows Gabriel. John knows Brynn. Which of Isabel and Desmond can Morgan reach?", "answer": "Isabel", "steps": [ "Morgan knows Isabel." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Morgan", "Hugo", "Camille", "Bonnie", "Wilson", "Owen", "Isabel", "Neal", "Zara", "Tara", "John", "Louise", "Matthew", "Keegan", "Diane", "Chad", "Desmond", "Renee", "Brynn", "Gabriel" ], "edges": [ [ 0, 8 ], [ 0, 6 ], [ 4, 7 ], [ 6, 1 ], [ 6, 3 ], [ 6, 9 ], [ 7, 2 ], [ 7, 5 ], [ 9, 4 ], [ 10, 18 ], [ 10, 16 ], [ 14, 17 ], [ 16, 11 ], [ 16, 13 ], [ 16, 19 ], [ 17, 12 ], [ 17, 15 ], [ 19, 14 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Axel knows Clayton. Clayton knows Max. Clayton knows Wanda. Glenda knows Jackson. Faith knows Dorothy. Faith knows Colleen. Jackson knows Faith. Ivy knows Priscilla. Priscilla knows Elaine. Dana knows Amanda. Ivy knows Eleanor. Dana knows Geoffrey. Geoffrey knows Jennifer. Jennifer knows Madeline. Wanda knows Dana. Elaine knows Crystal. Benjamin knows Axel. Dorothy knows Ivy. Which of Axel and Jackson can Glenda reach?", "answer": "Jackson", "steps": [ "Glenda knows Jackson." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Glenda", "Colleen", "Eleanor", "Ivy", "Elaine", "Dorothy", "Jackson", "Priscilla", "Faith", "Crystal", "Benjamin", "Max", "Amanda", "Dana", "Jennifer", "Wanda", "Axel", "Geoffrey", "Clayton", "Madeline" ], "edges": [ [ 0, 6 ], [ 3, 2 ], [ 3, 7 ], [ 4, 9 ], [ 5, 3 ], [ 6, 8 ], [ 7, 4 ], [ 8, 1 ], [ 8, 5 ], [ 10, 16 ], [ 13, 12 ], [ 13, 17 ], [ 14, 19 ], [ 15, 13 ], [ 16, 18 ], [ 17, 14 ], [ 18, 11 ], [ 18, 15 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Lisette knows Holly. Erma knows Ernesto. Andre knows Ursula. Ernesto knows Harmony. Shannon knows Amber. Eunice knows Andre. Randy knows Eunice. Duke knows Randy. Luis knows Martin. Amber knows Erma. Shannon knows Esperanza. Randy knows Luis. Hardy knows Duke. Norma knows Lisette. Martin knows Troy. Amber knows Norma. Rena knows Shannon. Duke knows Kyle. Which of Martin and Lisette can Rena reach?", "answer": "Lisette", "steps": [ "Rena knows Shannon.", "Shannon knows Amber.", "Amber knows Norma.", "Norma knows Lisette." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Rena", "Holly", "Lisette", "Erma", "Shannon", "Esperanza", "Amber", "Norma", "Ernesto", "Harmony", "Hardy", "Troy", "Martin", "Eunice", "Duke", "Kyle", "Randy", "Luis", "Andre", "Ursula" ], "edges": [ [ 0, 4 ], [ 2, 1 ], [ 3, 8 ], [ 4, 5 ], [ 4, 6 ], [ 6, 7 ], [ 6, 3 ], [ 7, 2 ], [ 8, 9 ], [ 10, 14 ], [ 12, 11 ], [ 13, 18 ], [ 14, 15 ], [ 14, 16 ], [ 16, 17 ], [ 16, 13 ], [ 17, 12 ], [ 18, 19 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Dorothy knows Chad. Joan knows Ken. Alan knows Arlene. Ken knows Cordelia. Aurora knows Dorothy. Elvira knows Kylie. Elvira knows Guillermo. Alan knows Cameron. Brooks knows Elvira. Leah knows Kobe. Cordelia knows Keith. Alan knows Brooks. Guillermo knows Leah. Ken knows Jesse. Kara knows Alan. Dorothy knows Cruz. Dorothy knows Joan. Keith knows Dee. Which of Dorothy and Alan can Kara reach?", "answer": "Alan", "steps": [ "Kara knows Alan." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Kara", "Arlene", "Guillermo", "Cameron", "Kobe", "Elvira", "Brooks", "Leah", "Alan", "Kylie", "Aurora", "Cruz", "Cordelia", "Chad", "Dee", "Ken", "Joan", "Keith", "Dorothy", "Jesse" ], "edges": [ [ 0, 8 ], [ 2, 7 ], [ 5, 2 ], [ 5, 9 ], [ 6, 5 ], [ 7, 4 ], [ 8, 1 ], [ 8, 3 ], [ 8, 6 ], [ 10, 18 ], [ 12, 17 ], [ 15, 12 ], [ 15, 19 ], [ 16, 15 ], [ 17, 14 ], [ 18, 11 ], [ 18, 13 ], [ 18, 16 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Susanne knows Brock. Ebony knows Giselle. Kate knows Bart. Bart knows Ebony. Randall knows Arnold. Trina knows Dana. Arnold knows Camden. Bailey knows Jeff. Dana knows Carmen. Bart knows Cassidy. Ernest knows Shelly. Arnold knows Jordan. Shelly knows Bailey. Jordan knows Kenneth. Shelly knows Daphne. Cassidy knows Randall. Dana knows Susanne. Carmen knows Ernest. Which of Shelly and Arnold can Kate reach?", "answer": "Arnold", "steps": [ "Kate knows Bart.", "Bart knows Cassidy.", "Cassidy knows Randall.", "Randall knows Arnold." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Kate", "Kenneth", "Arnold", "Cassidy", "Randall", "Ebony", "Giselle", "Bart", "Camden", "Jordan", "Trina", "Jeff", "Shelly", "Carmen", "Ernest", "Susanne", "Brock", "Dana", "Daphne", "Bailey" ], "edges": [ [ 0, 7 ], [ 2, 8 ], [ 2, 9 ], [ 3, 4 ], [ 4, 2 ], [ 5, 6 ], [ 7, 5 ], [ 7, 3 ], [ 9, 1 ], [ 10, 17 ], [ 12, 18 ], [ 12, 19 ], [ 13, 14 ], [ 14, 12 ], [ 15, 16 ], [ 17, 15 ], [ 17, 13 ], [ 19, 11 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Hector knows Nash. Edmund knows Darin. Carrie knows Edmund. Asher knows Lyric. Fred knows Fern. Nash knows Asher. Nadine knows Alison. Zoe knows Hector. Zoe knows Corinne. Carrie knows Elsa. Zoe knows Boris. Darin knows Haven. Asher knows Eugene. Alison knows Dane. Lyric knows Fred. Carrie knows Parker. Haven knows Nadine. Haven knows Jules. Which of Hector and Edmund can Carrie reach?", "answer": "Edmund", "steps": [ "Carrie knows Edmund." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Carrie", "Haven", "Dane", "Alison", "Edmund", "Nadine", "Jules", "Elsa", "Parker", "Darin", "Zoe", "Asher", "Fern", "Fred", "Hector", "Lyric", "Eugene", "Corinne", "Boris", "Nash" ], "edges": [ [ 0, 7 ], [ 0, 8 ], [ 0, 4 ], [ 1, 5 ], [ 1, 6 ], [ 3, 2 ], [ 4, 9 ], [ 5, 3 ], [ 9, 1 ], [ 10, 17 ], [ 10, 18 ], [ 10, 14 ], [ 11, 15 ], [ 11, 16 ], [ 13, 12 ], [ 14, 19 ], [ 15, 13 ], [ 19, 11 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Roger knows Lambert. Trevor knows Louis. Henry knows Virginia. Spencer knows Trevor. Louis knows Henry. Henrietta knows Spencer. Lambert knows Enid. Hope knows Heath. Pearl knows Edwin. Edwin knows Callum. Jakob knows Guy. Carla knows Chester. Lambert knows Carla. Chester knows Hope. Hope knows Pearl. Jakob knows Henrietta. Trevor knows Vera. Cindy knows Jakob. Which of Callum and Virginia can Roger reach?", "answer": "Callum", "steps": [ "Roger knows Lambert.", "Lambert knows Carla.", "Carla knows Chester.", "Chester knows Hope.", "Hope knows Pearl.", "Pearl knows Edwin.", "Edwin knows Callum." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Roger", "Heath", "Hope", "Enid", "Pearl", "Chester", "Lambert", "Callum", "Carla", "Edwin", "Cindy", "Vera", "Trevor", "Guy", "Louis", "Spencer", "Jakob", "Virginia", "Henrietta", "Henry" ], "edges": [ [ 0, 6 ], [ 2, 1 ], [ 2, 4 ], [ 4, 9 ], [ 5, 2 ], [ 6, 3 ], [ 6, 8 ], [ 8, 5 ], [ 9, 7 ], [ 10, 16 ], [ 12, 11 ], [ 12, 14 ], [ 14, 19 ], [ 15, 12 ], [ 16, 13 ], [ 16, 18 ], [ 18, 15 ], [ 19, 17 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Marilyn knows Jewel. Aisha knows Martha. Kirsten knows Federico. Lois knows Everett. Winifred knows Sandra. Everett knows Ruby. Miranda knows Winifred. Alvin knows Patrick. Winifred knows Dave. Gwen knows Brett. Martha knows Gwen. Carrie knows Alvin. Julius knows Lois. Brett knows Marilyn. Dave knows Aisha. Lois knows Frances. Ruby knows Carrie. Patrick knows Kirsten. Which of Ruby and Aisha can Julius reach?", "answer": "Ruby", "steps": [ "Julius knows Lois.", "Lois knows Everett.", "Everett knows Ruby." ], "difficulty": 3, "original_distance": 8, "idx_to_symbol": [ "Julius", "Carrie", "Kirsten", "Federico", "Ruby", "Everett", "Patrick", "Alvin", "Frances", "Lois", "Miranda", "Martha", "Marilyn", "Jewel", "Aisha", "Dave", "Brett", "Gwen", "Sandra", "Winifred" ], "edges": [ [ 0, 9 ], [ 1, 7 ], [ 2, 3 ], [ 4, 1 ], [ 5, 4 ], [ 6, 2 ], [ 7, 6 ], [ 9, 5 ], [ 9, 8 ], [ 10, 19 ], [ 11, 17 ], [ 12, 13 ], [ 14, 11 ], [ 15, 14 ], [ 16, 12 ], [ 17, 16 ], [ 19, 15 ], [ 19, 18 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Harold knows Jules. Houston knows Roland. Kristin knows Fisher. Dick knows Ariel. Valerie knows Jane. Derrick knows Yvonne. Elena knows Harold. Valerie knows Houston. Yvonne knows Elena. Dee knows Maureen. Tyler knows Aurora. Noah knows Fritz. Derrick knows Wesley. Yvonne knows Noah. Maureen knows Valerie. Tyler knows Dee. Harold knows Dick. Dee knows Kristin. Which of Houston and Dick can Tyler reach?", "answer": "Houston", "steps": [ "Tyler knows Dee.", "Dee knows Maureen.", "Maureen knows Valerie.", "Valerie knows Houston." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Tyler", "Maureen", "Valerie", "Jane", "Dee", "Houston", "Fisher", "Aurora", "Kristin", "Roland", "Derrick", "Elena", "Harold", "Jules", "Yvonne", "Dick", "Fritz", "Wesley", "Noah", "Ariel" ], "edges": [ [ 0, 7 ], [ 0, 4 ], [ 1, 2 ], [ 2, 3 ], [ 2, 5 ], [ 4, 8 ], [ 4, 1 ], [ 5, 9 ], [ 8, 6 ], [ 10, 17 ], [ 10, 14 ], [ 11, 12 ], [ 12, 13 ], [ 12, 15 ], [ 14, 18 ], [ 14, 11 ], [ 15, 19 ], [ 18, 16 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Veronica knows Hayley. Hayley knows Rose. Holly knows Terry. Glenn knows Wilson. Nolan knows Kennedy. Glenn knows Blair. Alice knows Nolan. Janice knows Edith. Hayley knows Dolores. Tim knows Glenn. Sandra knows Winston. Glenn knows Veronica. Winston knows Tim. Nolan knows Gene. Holly knows Alice. Edith knows Lenora. Holly knows Sheryl. Lenora knows Holly. Which of Alice and Veronica can Sandra reach?", "answer": "Veronica", "steps": [ "Sandra knows Winston.", "Winston knows Tim.", "Tim knows Glenn.", "Glenn knows Veronica." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Sandra", "Blair", "Veronica", "Winston", "Wilson", "Hayley", "Dolores", "Rose", "Glenn", "Tim", "Janice", "Sheryl", "Alice", "Edith", "Terry", "Nolan", "Kennedy", "Gene", "Holly", "Lenora" ], "edges": [ [ 0, 3 ], [ 2, 5 ], [ 3, 9 ], [ 5, 6 ], [ 5, 7 ], [ 8, 1 ], [ 8, 4 ], [ 8, 2 ], [ 9, 8 ], [ 10, 13 ], [ 12, 15 ], [ 13, 19 ], [ 15, 16 ], [ 15, 17 ], [ 18, 11 ], [ 18, 14 ], [ 18, 12 ], [ 19, 18 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Lamont knows Dakota. Arturo knows Lamont. Herman knows Deanna. Herman knows Kieran. Hattie knows Selena. Seth knows Kelsey. Alfonso knows Hattie. Virginia knows Keith. Arturo knows Seth. Virginia knows Edison. Hattie knows Jacqueline. Jacqueline knows Violet. Lamont knows Virginia. Selena knows Gertrude. Lena knows Hamilton. Jacqueline knows Herman. Hamilton knows Arturo. Stacy knows Alfonso. Which of Edison and Deanna can Stacy reach?", "answer": "Deanna", "steps": [ "Stacy knows Alfonso.", "Alfonso knows Hattie.", "Hattie knows Jacqueline.", "Jacqueline knows Herman.", "Herman knows Deanna." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Stacy", "Herman", "Selena", "Jacqueline", "Violet", "Deanna", "Alfonso", "Kieran", "Hattie", "Gertrude", "Lena", "Virginia", "Seth", "Lamont", "Dakota", "Edison", "Hamilton", "Keith", "Arturo", "Kelsey" ], "edges": [ [ 0, 6 ], [ 1, 5 ], [ 1, 7 ], [ 2, 9 ], [ 3, 4 ], [ 3, 1 ], [ 6, 8 ], [ 8, 3 ], [ 8, 2 ], [ 10, 16 ], [ 11, 15 ], [ 11, 17 ], [ 12, 19 ], [ 13, 14 ], [ 13, 11 ], [ 16, 18 ], [ 18, 13 ], [ 18, 12 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Courtney knows Jean. Eileen knows Rosa. Fred knows Courtney. Fraser knows Nelson. Courtney knows Julio. Iris knows Eve. Anita knows Erin. Iris knows Anita. Courtney knows Fraser. Iris knows Lambert. Iris knows Francis. Iris knows Eileen. Fred knows Trudy. Courtney knows Essie. Lyric knows Iris. Courtney knows Corey. Lyric knows Hope. Jean knows Nancy. Which of Nancy and Rosa can Lyric reach?", "answer": "Rosa", "steps": [ "Lyric knows Iris.", "Iris knows Eileen.", "Eileen knows Rosa." ], "difficulty": 3, "original_distance": 3, "idx_to_symbol": [ "Lyric", "Francis", "Rosa", "Anita", "Eve", "Eileen", "Erin", "Iris", "Hope", "Lambert", "Fred", "Essie", "Nancy", "Fraser", "Julio", "Jean", "Nelson", "Courtney", "Trudy", "Corey" ], "edges": [ [ 0, 8 ], [ 0, 7 ], [ 3, 6 ], [ 5, 2 ], [ 7, 1 ], [ 7, 4 ], [ 7, 5 ], [ 7, 3 ], [ 7, 9 ], [ 10, 18 ], [ 10, 17 ], [ 13, 16 ], [ 15, 12 ], [ 17, 11 ], [ 17, 14 ], [ 17, 15 ], [ 17, 13 ], [ 17, 19 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Xavier knows Gus. Teresa knows Abel. Bruce knows Louisa. Darla knows Atlas. Lily knows William. Dell knows Emma. Eugenia knows Teresa. Luz knows Rod. Atlas knows Lily. Nolan knows Howard. Donovan knows Nolan. Nolan knows Darla. Bruce knows Hattie. Dante knows Eugenia. Hattie knows Donovan. Rod knows Xavier. Xavier knows Dante. Dell knows Luz. Which of Donovan and Rod can Dell reach?", "answer": "Rod", "steps": [ "Dell knows Luz.", "Luz knows Rod." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Dell", "Teresa", "Abel", "Emma", "Rod", "Luz", "Dante", "Eugenia", "Xavier", "Gus", "Bruce", "Lily", "William", "Louisa", "Donovan", "Hattie", "Darla", "Atlas", "Nolan", "Howard" ], "edges": [ [ 0, 3 ], [ 0, 5 ], [ 1, 2 ], [ 4, 8 ], [ 5, 4 ], [ 6, 7 ], [ 7, 1 ], [ 8, 6 ], [ 8, 9 ], [ 10, 13 ], [ 10, 15 ], [ 11, 12 ], [ 14, 18 ], [ 15, 14 ], [ 16, 17 ], [ 17, 11 ], [ 18, 16 ], [ 18, 19 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Harold knows Joyce. Miles knows Joaquin. Saul knows Harold. Sonia knows Gregory. Dane knows Coral. Clara knows Eugene. Joaquin knows George. Saul knows Clayton. Joyce knows Howard. Joaquin knows Clara. Eugene knows Serena. Howard knows Arden. Howard knows Charles. Howard knows Federico. Federico knows Dane. Sonia knows Harper. Gregory knows Miles. Joaquin knows Natalie. Which of Howard and Joaquin can Saul reach?", "answer": "Howard", "steps": [ "Saul knows Harold.", "Harold knows Joyce.", "Joyce knows Howard." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Saul", "Howard", "Federico", "Arden", "Coral", "Dane", "Clayton", "Joyce", "Charles", "Harold", "Sonia", "Joaquin", "Clara", "George", "Serena", "Eugene", "Harper", "Miles", "Natalie", "Gregory" ], "edges": [ [ 0, 6 ], [ 0, 9 ], [ 1, 3 ], [ 1, 2 ], [ 1, 8 ], [ 2, 5 ], [ 5, 4 ], [ 7, 1 ], [ 9, 7 ], [ 10, 16 ], [ 10, 19 ], [ 11, 13 ], [ 11, 12 ], [ 11, 18 ], [ 12, 15 ], [ 15, 14 ], [ 17, 11 ], [ 19, 17 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Ella knows Anita. Emily knows Denver. Luella knows Todd. Lucille knows Flora. Anita knows Luella. Ella knows Harmony. Lucille knows Harris. Harris knows Jerome. Anita knows Leonard. Emily knows Damian. Gideon knows Lucille. Harris knows Everett. Harrison knows Thea. Clay knows Harrison. Denver knows Ella. Damian knows Frida. Clay knows Gideon. Everett knows Julius. Which of Denver and Gideon can Emily reach?", "answer": "Denver", "steps": [ "Emily knows Denver." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Emily", "Frida", "Luella", "Anita", "Denver", "Todd", "Ella", "Damian", "Leonard", "Harmony", "Clay", "Thea", "Everett", "Harris", "Gideon", "Julius", "Lucille", "Harrison", "Jerome", "Flora" ], "edges": [ [ 0, 7 ], [ 0, 4 ], [ 2, 5 ], [ 3, 2 ], [ 3, 8 ], [ 4, 6 ], [ 6, 3 ], [ 6, 9 ], [ 7, 1 ], [ 10, 17 ], [ 10, 14 ], [ 12, 15 ], [ 13, 12 ], [ 13, 18 ], [ 14, 16 ], [ 16, 13 ], [ 16, 19 ], [ 17, 11 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Keaton knows Elizabeth. Morris knows Maude. Constance knows Michelle. Morris knows Leopold. Michelle knows Keaton. Wade knows Celeste. Constance knows Carey. Celeste knows Isadora. Celeste knows Daniel. Celeste knows Lucille. Keaton knows Morris. Daniel knows Katrina. Katrina knows Victor. Katrina knows Farrah. Constance knows Patrick. Victor knows Elena. Bernadette knows Constance. Victor knows Seth. Which of Keaton and Katrina can Bernadette reach?", "answer": "Keaton", "steps": [ "Bernadette knows Constance.", "Constance knows Michelle.", "Michelle knows Keaton." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Bernadette", "Morris", "Keaton", "Constance", "Leopold", "Michelle", "Patrick", "Maude", "Carey", "Elizabeth", "Wade", "Victor", "Katrina", "Celeste", "Elena", "Daniel", "Isadora", "Seth", "Lucille", "Farrah" ], "edges": [ [ 0, 3 ], [ 1, 4 ], [ 1, 7 ], [ 2, 1 ], [ 2, 9 ], [ 3, 6 ], [ 3, 8 ], [ 3, 5 ], [ 5, 2 ], [ 10, 13 ], [ 11, 14 ], [ 11, 17 ], [ 12, 11 ], [ 12, 19 ], [ 13, 16 ], [ 13, 18 ], [ 13, 15 ], [ 15, 12 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Ross knows Sybil. David knows Darnell. Fergus knows Roland. Stacy knows Lyle. Kelsey knows Giselle. Roland knows Richard. Hugh knows Terrence. Terrence knows Grady. Sybil knows Parsa. Sybil knows Michelle. Hugh knows Ross. Richard knows Kelsey. Parsa knows Ernest. Roland knows Derrick. Fergus knows Yara. Kelsey knows Stacy. Derrick knows Livia. David knows Hugh. Which of Hugh and Roland can David reach?", "answer": "Hugh", "steps": [ "David knows Hugh." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "David", "Ross", "Sybil", "Ernest", "Darnell", "Michelle", "Hugh", "Terrence", "Grady", "Parsa", "Fergus", "Richard", "Kelsey", "Lyle", "Yara", "Giselle", "Roland", "Derrick", "Livia", "Stacy" ], "edges": [ [ 0, 4 ], [ 0, 6 ], [ 1, 2 ], [ 2, 5 ], [ 2, 9 ], [ 6, 7 ], [ 6, 1 ], [ 7, 8 ], [ 9, 3 ], [ 10, 14 ], [ 10, 16 ], [ 11, 12 ], [ 12, 15 ], [ 12, 19 ], [ 16, 17 ], [ 16, 11 ], [ 17, 18 ], [ 19, 13 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Mia knows Cara. Wesley knows Elvis. Vera knows Byron. Bailey knows Kay. Elvis knows Drew. Deborah knows Brian. Vera knows Andrea. Elena knows Vera. Byron knows Jason. Elvis knows Jerry. Kay knows Wesley. Leonard knows Axel. Deborah knows Elena. Byron knows Bernadette. Wesley knows Celeste. Bailey knows Vance. Byron knows Leonard. Elvis knows Mia. Which of Elvis and Byron can Deborah reach?", "answer": "Byron", "steps": [ "Deborah knows Elena.", "Elena knows Vera.", "Vera knows Byron." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Deborah", "Vera", "Axel", "Andrea", "Leonard", "Bernadette", "Byron", "Elena", "Jason", "Brian", "Bailey", "Wesley", "Cara", "Celeste", "Mia", "Drew", "Elvis", "Kay", "Jerry", "Vance" ], "edges": [ [ 0, 7 ], [ 0, 9 ], [ 1, 3 ], [ 1, 6 ], [ 4, 2 ], [ 6, 4 ], [ 6, 5 ], [ 6, 8 ], [ 7, 1 ], [ 10, 17 ], [ 10, 19 ], [ 11, 13 ], [ 11, 16 ], [ 14, 12 ], [ 16, 14 ], [ 16, 15 ], [ 16, 18 ], [ 17, 11 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Jocelyn knows Gregory. Ron knows Leticia. Luella knows Foster. Irene knows Ron. Yara knows Bernadette. Viola knows Imogen. Jeff knows Norma. Ron knows Yasmin. Ron knows Luella. Gregory knows Yara. Tara knows Irene. Viola knows Jeff. Parsa knows Tara. Ford knows Parsa. Darrell knows Ford. Viola knows Phoebe. Gladys knows Jocelyn. Bernadette knows Viola. Which of Ron and Viola can Gladys reach?", "answer": "Viola", "steps": [ "Gladys knows Jocelyn.", "Jocelyn knows Gregory.", "Gregory knows Yara.", "Yara knows Bernadette.", "Bernadette knows Viola." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Gladys", "Phoebe", "Imogen", "Norma", "Bernadette", "Viola", "Gregory", "Yara", "Jeff", "Jocelyn", "Darrell", "Leticia", "Yasmin", "Foster", "Irene", "Ron", "Parsa", "Tara", "Luella", "Ford" ], "edges": [ [ 0, 9 ], [ 4, 5 ], [ 5, 1 ], [ 5, 2 ], [ 5, 8 ], [ 6, 7 ], [ 7, 4 ], [ 8, 3 ], [ 9, 6 ], [ 10, 19 ], [ 14, 15 ], [ 15, 11 ], [ 15, 12 ], [ 15, 18 ], [ 16, 17 ], [ 17, 14 ], [ 18, 13 ], [ 19, 16 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Keith knows Russ. Vera knows Zelda. Malik knows Marc. Isadora knows Vera. Horace knows Kathleen. Jolene knows Tessa. Keith knows Leo. Leo knows Kieran. Zelda knows Jolene. Horace knows Brett. Keith knows Billy. Vera knows Emanuel. Vera knows Geoffrey. Brett knows Keith. Russ knows Malik. Finn knows Adrian. Geoffrey knows Palmer. Finn knows Isadora. Which of Brett and Isadora can Horace reach?", "answer": "Brett", "steps": [ "Horace knows Brett." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Horace", "Keith", "Marc", "Kieran", "Malik", "Kathleen", "Billy", "Leo", "Russ", "Brett", "Finn", "Vera", "Tessa", "Palmer", "Jolene", "Adrian", "Emanuel", "Geoffrey", "Zelda", "Isadora" ], "edges": [ [ 0, 5 ], [ 0, 9 ], [ 1, 6 ], [ 1, 7 ], [ 1, 8 ], [ 4, 2 ], [ 7, 3 ], [ 8, 4 ], [ 9, 1 ], [ 10, 15 ], [ 10, 19 ], [ 11, 16 ], [ 11, 17 ], [ 11, 18 ], [ 14, 12 ], [ 17, 13 ], [ 18, 14 ], [ 19, 11 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Latoya knows Mildred. Margaret knows Nicholas. Veronica knows Saul. Mildred knows Lisa. Kristin knows Eldon. Veronica knows Beverly. Lisa knows Ellis. Barbara knows Cody. Cameron knows Veronica. Aubrey knows Cameron. Ellis knows Cesar. Cesar knows Alison. Nicholas knows Barbara. Cesar knows Betty. Barbara knows Clay. Eldon knows Latoya. Latoya knows Julio. Beverly knows Margaret. Which of Nicholas and Ellis can Aubrey reach?", "answer": "Nicholas", "steps": [ "Aubrey knows Cameron.", "Cameron knows Veronica.", "Veronica knows Beverly.", "Beverly knows Margaret.", "Margaret knows Nicholas." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Aubrey", "Veronica", "Nicholas", "Barbara", "Margaret", "Cameron", "Saul", "Clay", "Beverly", "Cody", "Kristin", "Latoya", "Ellis", "Cesar", "Lisa", "Eldon", "Julio", "Alison", "Mildred", "Betty" ], "edges": [ [ 0, 5 ], [ 1, 6 ], [ 1, 8 ], [ 2, 3 ], [ 3, 7 ], [ 3, 9 ], [ 4, 2 ], [ 5, 1 ], [ 8, 4 ], [ 10, 15 ], [ 11, 16 ], [ 11, 18 ], [ 12, 13 ], [ 13, 17 ], [ 13, 19 ], [ 14, 12 ], [ 15, 11 ], [ 18, 14 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Archer knows Duncan. Eduardo knows Ramon. Rex knows Conrad. Rex knows Archer. Jessie knows Lydia. Lydia knows Wilbur. Lydia knows Tara. Gareth knows Forrest. Sean knows Janice. Ross knows Jessie. Forrest knows Eduardo. Rena knows Sean. Tara knows Rena. Grace knows Rex. Archer knows Gareth. Jessie knows Ramona. Ramon knows Amelia. Janice knows Sam. Which of Rena and Forrest can Grace reach?", "answer": "Forrest", "steps": [ "Grace knows Rex.", "Rex knows Archer.", "Archer knows Gareth.", "Gareth knows Forrest." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Grace", "Ramon", "Duncan", "Gareth", "Amelia", "Archer", "Eduardo", "Rex", "Forrest", "Conrad", "Ross", "Janice", "Wilbur", "Tara", "Sam", "Lydia", "Sean", "Jessie", "Rena", "Ramona" ], "edges": [ [ 0, 7 ], [ 1, 4 ], [ 3, 8 ], [ 5, 2 ], [ 5, 3 ], [ 6, 1 ], [ 7, 5 ], [ 7, 9 ], [ 8, 6 ], [ 10, 17 ], [ 11, 14 ], [ 13, 18 ], [ 15, 12 ], [ 15, 13 ], [ 16, 11 ], [ 17, 15 ], [ 17, 19 ], [ 18, 16 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Keira knows Lamont. Jorge knows Lyle. Ryan knows Jorge. Doug knows Emma. Lambert knows Keira. Lyle knows Ilene. Devin knows Mario. Lambert knows Ryan. Clara knows Devin. Clara knows Doug. Lambert knows Dahlia. Ronald knows Lance. Lyle knows Quinn. Ronald knows Adam. Jude knows Wanda. Clara knows Jude. Wanda knows Ronald. Dahlia knows Hendrix. Which of Jude and Ryan can Clara reach?", "answer": "Jude", "steps": [ "Clara knows Jude." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Clara", "Jude", "Lance", "Adam", "Wanda", "Devin", "Doug", "Emma", "Mario", "Ronald", "Lambert", "Ryan", "Ilene", "Quinn", "Jorge", "Dahlia", "Keira", "Lamont", "Hendrix", "Lyle" ], "edges": [ [ 0, 6 ], [ 0, 5 ], [ 0, 1 ], [ 1, 4 ], [ 4, 9 ], [ 5, 8 ], [ 6, 7 ], [ 9, 2 ], [ 9, 3 ], [ 10, 16 ], [ 10, 15 ], [ 10, 11 ], [ 11, 14 ], [ 14, 19 ], [ 15, 18 ], [ 16, 17 ], [ 19, 12 ], [ 19, 13 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Fernando knows Marcia. Fraser knows Doris. Donovan knows Hailey. Hailey knows Marie. Howard knows Gwen. Roy knows Peggy. Hailey knows John. Doris knows Lyle. Marcia knows Howard. John knows Roy. Peggy knows Larissa. Marie knows Atlas. Peggy knows Carmen. Fraser knows Fernando. Howard knows Patricia. Peggy knows Elizabeth. Howard knows Kay. Sam knows Fraser. Which of John and Fernando can Sam reach?", "answer": "Fernando", "steps": [ "Sam knows Fraser.", "Fraser knows Fernando." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Sam", "Fernando", "Lyle", "Fraser", "Doris", "Marcia", "Gwen", "Patricia", "Kay", "Howard", "Donovan", "John", "Atlas", "Hailey", "Marie", "Roy", "Elizabeth", "Larissa", "Carmen", "Peggy" ], "edges": [ [ 0, 3 ], [ 1, 5 ], [ 3, 4 ], [ 3, 1 ], [ 4, 2 ], [ 5, 9 ], [ 9, 6 ], [ 9, 7 ], [ 9, 8 ], [ 10, 13 ], [ 11, 15 ], [ 13, 14 ], [ 13, 11 ], [ 14, 12 ], [ 15, 19 ], [ 19, 16 ], [ 19, 17 ], [ 19, 18 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Vera knows Cassidy. Florence knows Tina. Dean knows Blanche. Celeste knows Magdalena. Kai knows Leo. Brandon knows Faith. Celeste knows Vera. Faith knows Samantha. Dean knows Drake. Virgil knows Brandon. Florence knows Dean. Greg knows Kai. Greg knows Jamie. Kirsten knows Celeste. Brandon knows Sheryl. Blanche knows Greg. Vera knows Virgil. Leigh knows Florence. Which of Celeste and Florence can Leigh reach?", "answer": "Florence", "steps": [ "Leigh knows Florence." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Leigh", "Blanche", "Kai", "Greg", "Jamie", "Dean", "Leo", "Drake", "Florence", "Tina", "Kirsten", "Virgil", "Faith", "Brandon", "Sheryl", "Vera", "Samantha", "Cassidy", "Celeste", "Magdalena" ], "edges": [ [ 0, 8 ], [ 1, 3 ], [ 2, 6 ], [ 3, 4 ], [ 3, 2 ], [ 5, 1 ], [ 5, 7 ], [ 8, 5 ], [ 8, 9 ], [ 10, 18 ], [ 11, 13 ], [ 12, 16 ], [ 13, 14 ], [ 13, 12 ], [ 15, 11 ], [ 15, 17 ], [ 18, 15 ], [ 18, 19 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Adam knows Fern. Adam knows Richard. Alejandro knows April. Justin knows Alejandro. Leah knows Justin. Flora knows Griffith. Justin knows Taylor. Kristina knows Adam. April knows Karen. Katrina knows Kristina. Richard knows Flora. Belinda knows Keith. Justin knows Layla. Adam knows Ashton. Dallas knows Chris. Rachel knows Leah. Kristina knows Belinda. Leah knows Dallas. Which of Adam and Justin can Rachel reach?", "answer": "Justin", "steps": [ "Rachel knows Leah.", "Leah knows Justin." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Rachel", "Karen", "Taylor", "Alejandro", "Layla", "Justin", "Chris", "Leah", "Dallas", "April", "Katrina", "Griffith", "Ashton", "Richard", "Fern", "Adam", "Keith", "Kristina", "Belinda", "Flora" ], "edges": [ [ 0, 7 ], [ 3, 9 ], [ 5, 2 ], [ 5, 4 ], [ 5, 3 ], [ 7, 8 ], [ 7, 5 ], [ 8, 6 ], [ 9, 1 ], [ 10, 17 ], [ 13, 19 ], [ 15, 12 ], [ 15, 14 ], [ 15, 13 ], [ 17, 18 ], [ 17, 15 ], [ 18, 16 ], [ 19, 11 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Mary knows Owen. Owen knows Allen. Allen knows Ernest. Janice knows Alison. Alison knows Jill. Daisy knows Chance. Justin knows Enid. Tina knows Daisy. Ernest knows Josie. Tina knows Joshua. Javier knows Janice. Ernest knows Brittany. Carrie knows Mary. Joshua knows Javier. Harper knows Justin. Carrie knows Harper. Alison knows Nadine. Chance knows Burt. Which of Allen and Janice can Tina reach?", "answer": "Janice", "steps": [ "Tina knows Joshua.", "Joshua knows Javier.", "Javier knows Janice." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Tina", "Nadine", "Joshua", "Daisy", "Jill", "Chance", "Javier", "Alison", "Burt", "Janice", "Carrie", "Josie", "Mary", "Harper", "Brittany", "Justin", "Owen", "Ernest", "Enid", "Allen" ], "edges": [ [ 0, 3 ], [ 0, 2 ], [ 2, 6 ], [ 3, 5 ], [ 5, 8 ], [ 6, 9 ], [ 7, 1 ], [ 7, 4 ], [ 9, 7 ], [ 10, 13 ], [ 10, 12 ], [ 12, 16 ], [ 13, 15 ], [ 15, 18 ], [ 16, 19 ], [ 17, 11 ], [ 17, 14 ], [ 19, 17 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Duncan knows Clarence. Hector knows Kenneth. Clarence knows Holly. Elton knows Essie. Holly knows Florence. Conner knows Rufus. Chase knows Heather. Peggy knows Layla. Jermaine knows Chase. Dudley knows Duncan. Essie knows Megan. Duncan knows Tamara. Rufus knows Peggy. Florence knows Jermaine. Kenneth knows Elton. Randy knows Hector. Rufus knows Randy. Tamara knows Alyssa. Which of Holly and Hector can Dudley reach?", "answer": "Holly", "steps": [ "Dudley knows Duncan.", "Duncan knows Clarence.", "Clarence knows Holly." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Dudley", "Chase", "Alyssa", "Tamara", "Florence", "Holly", "Clarence", "Heather", "Duncan", "Jermaine", "Conner", "Essie", "Layla", "Peggy", "Kenneth", "Hector", "Randy", "Megan", "Rufus", "Elton" ], "edges": [ [ 0, 8 ], [ 1, 7 ], [ 3, 2 ], [ 4, 9 ], [ 5, 4 ], [ 6, 5 ], [ 8, 3 ], [ 8, 6 ], [ 9, 1 ], [ 10, 18 ], [ 11, 17 ], [ 13, 12 ], [ 14, 19 ], [ 15, 14 ], [ 16, 15 ], [ 18, 13 ], [ 18, 16 ], [ 19, 11 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Fern knows Jacques. Dalton knows Larry. Jacques knows Adrian. Elliot knows Harris. Belinda knows Frances. Belinda knows Noah. Ivan knows Fern. Larry knows Yolanda. Imogen knows Dalton. Frances knows Keira. Fiona knows Kerry. Damian knows Belinda. Zelda knows Imogen. Kerry knows Zelda. Yolanda knows Don. Adrian knows Damian. Larry knows Elliot. Noah knows Joseph. Which of Noah and Yolanda can Fiona reach?", "answer": "Yolanda", "steps": [ "Fiona knows Kerry.", "Kerry knows Zelda.", "Zelda knows Imogen.", "Imogen knows Dalton.", "Dalton knows Larry.", "Larry knows Yolanda." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Fiona", "Larry", "Kerry", "Harris", "Don", "Elliot", "Dalton", "Imogen", "Zelda", "Yolanda", "Ivan", "Belinda", "Fern", "Keira", "Joseph", "Frances", "Damian", "Adrian", "Jacques", "Noah" ], "edges": [ [ 0, 2 ], [ 1, 5 ], [ 1, 9 ], [ 2, 8 ], [ 5, 3 ], [ 6, 1 ], [ 7, 6 ], [ 8, 7 ], [ 9, 4 ], [ 10, 12 ], [ 11, 15 ], [ 11, 19 ], [ 12, 18 ], [ 15, 13 ], [ 16, 11 ], [ 17, 16 ], [ 18, 17 ], [ 19, 14 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Emanuel knows Carol. Andrew knows Ruby. Kennedy knows Fiona. Leroy knows Willis. Carol knows Kirsten. Martin knows Amelia. Saul knows Khashayar. Ruby knows Jamie. Willis knows Earle. Kirsten knows Leroy. Kirsten knows Kennedy. Willis knows Corey. Corey knows Uma. Jamie knows Keith. Khashayar knows Vivian. Amelia knows Saul. Ruby knows Liam. Saul knows Andrew. Which of Saul and Kirsten can Martin reach?", "answer": "Saul", "steps": [ "Martin knows Amelia.", "Amelia knows Saul." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Martin", "Jamie", "Khashayar", "Amelia", "Saul", "Ruby", "Liam", "Andrew", "Keith", "Vivian", "Emanuel", "Corey", "Kennedy", "Carol", "Kirsten", "Willis", "Earle", "Leroy", "Uma", "Fiona" ], "edges": [ [ 0, 3 ], [ 1, 8 ], [ 2, 9 ], [ 3, 4 ], [ 4, 7 ], [ 4, 2 ], [ 5, 6 ], [ 5, 1 ], [ 7, 5 ], [ 10, 13 ], [ 11, 18 ], [ 12, 19 ], [ 13, 14 ], [ 14, 17 ], [ 14, 12 ], [ 15, 16 ], [ 15, 11 ], [ 17, 15 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Grady knows Dora. Clement knows Darcy. Daphna knows Kendra. Donovan knows Luz. Patrick knows Susan. Jude knows Patrick. Kristin knows Julius. Darcy knows Kane. Kendra knows Luther. Susan knows Sandra. Luz knows Rhonda. Sandra knows Clement. Eldon knows Kirsten. Rhonda knows Kristin. Luther knows Donovan. Rhonda knows Grady. Darcy knows Eldon. Kane knows Riley. Which of Rhonda and Darcy can Daphna reach?", "answer": "Rhonda", "steps": [ "Daphna knows Kendra.", "Kendra knows Luther.", "Luther knows Donovan.", "Donovan knows Luz.", "Luz knows Rhonda." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Daphna", "Julius", "Kristin", "Dora", "Grady", "Donovan", "Rhonda", "Luther", "Luz", "Kendra", "Jude", "Kirsten", "Eldon", "Riley", "Kane", "Sandra", "Darcy", "Susan", "Clement", "Patrick" ], "edges": [ [ 0, 9 ], [ 2, 1 ], [ 4, 3 ], [ 5, 8 ], [ 6, 2 ], [ 6, 4 ], [ 7, 5 ], [ 8, 6 ], [ 9, 7 ], [ 10, 19 ], [ 12, 11 ], [ 14, 13 ], [ 15, 18 ], [ 16, 12 ], [ 16, 14 ], [ 17, 15 ], [ 18, 16 ], [ 19, 17 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Joanna knows Earle. Rhonda knows Katherine. Greta knows Rhonda. Jean knows Judy. Katherine knows Daniel. Francesca knows Greta. Daniel knows Scott. Daniel knows Yvonne. Kay knows Joanna. Jack knows Cesar. Yvonne knows Janice. Judy knows Emanuel. Earle knows Cain. Judy knows Axel. Cain knows Tonya. Cesar knows Francesca. Tonya knows Jean. Emanuel knows Ariana. Which of Jean and Katherine can Jack reach?", "answer": "Katherine", "steps": [ "Jack knows Cesar.", "Cesar knows Francesca.", "Francesca knows Greta.", "Greta knows Rhonda.", "Rhonda knows Katherine." ], "difficulty": 5, "original_distance": 8, "idx_to_symbol": [ "Jack", "Greta", "Cesar", "Scott", "Katherine", "Yvonne", "Janice", "Daniel", "Francesca", "Rhonda", "Kay", "Cain", "Joanna", "Axel", "Jean", "Emanuel", "Ariana", "Judy", "Earle", "Tonya" ], "edges": [ [ 0, 2 ], [ 1, 9 ], [ 2, 8 ], [ 4, 7 ], [ 5, 6 ], [ 7, 3 ], [ 7, 5 ], [ 8, 1 ], [ 9, 4 ], [ 10, 12 ], [ 11, 19 ], [ 12, 18 ], [ 14, 17 ], [ 15, 16 ], [ 17, 13 ], [ 17, 15 ], [ 18, 11 ], [ 19, 14 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Rena knows Lola. Federico knows Flora. Sheryl knows Bart. Flora knows Eldon. Flora knows Keaton. April knows Ralph. Beau knows Jacob. April knows Beau. Elvis knows April. Flora knows Carlos. Keaton knows Rena. April knows Sheryl. Julius knows Gerald. Eldon knows Erma. Carlos knows Burt. Ralph knows Rose. Lola knows Kingsley. Bart knows Julius. Which of April and Flora can Federico reach?", "answer": "Flora", "steps": [ "Federico knows Flora." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Federico", "Erma", "Rena", "Keaton", "Carlos", "Burt", "Eldon", "Lola", "Kingsley", "Flora", "Elvis", "Rose", "Bart", "Sheryl", "Beau", "Jacob", "Ralph", "Julius", "Gerald", "April" ], "edges": [ [ 0, 9 ], [ 2, 7 ], [ 3, 2 ], [ 4, 5 ], [ 6, 1 ], [ 7, 8 ], [ 9, 4 ], [ 9, 6 ], [ 9, 3 ], [ 10, 19 ], [ 12, 17 ], [ 13, 12 ], [ 14, 15 ], [ 16, 11 ], [ 17, 18 ], [ 19, 14 ], [ 19, 16 ], [ 19, 13 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Clifford knows Jared. Sally knows Effie. Adam knows Shannon. Jane knows Wilson. Clayton knows Ignacio. Adam knows Jane. Clifford knows Jillian. Jake knows Adam. Wilson knows Pam. Ignacio knows Miles. Sally knows Juan. Clayton knows Edward. Kate knows Ray. Wilson knows Ada. Juan knows Clifford. Miles knows Sally. Simon knows Jake. Kate knows Simon. Which of Ada and Jillian can Clayton reach?", "answer": "Jillian", "steps": [ "Clayton knows Ignacio.", "Ignacio knows Miles.", "Miles knows Sally.", "Sally knows Juan.", "Juan knows Clifford.", "Clifford knows Jillian." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Clayton", "Sally", "Edward", "Clifford", "Jared", "Effie", "Jillian", "Juan", "Ignacio", "Miles", "Kate", "Adam", "Ray", "Wilson", "Pam", "Shannon", "Ada", "Jane", "Simon", "Jake" ], "edges": [ [ 0, 2 ], [ 0, 8 ], [ 1, 5 ], [ 1, 7 ], [ 3, 4 ], [ 3, 6 ], [ 7, 3 ], [ 8, 9 ], [ 9, 1 ], [ 10, 12 ], [ 10, 18 ], [ 11, 15 ], [ 11, 17 ], [ 13, 14 ], [ 13, 16 ], [ 17, 13 ], [ 18, 19 ], [ 19, 11 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Delia knows Ainsley. Cora knows Lucy. Tony knows Delia. Georgia knows Alyson. Sandy knows Joyce. Elise knows Fritz. Casey knows Terry. Cecilia knows Kendra. Alyson knows Sandy. Cora knows Cecilia. Sandy knows Cora. Tony knows Elliot. Fritz knows Tony. Ainsley knows Dolores. Tony knows Felicia. Sandy knows Casey. Delia knows Ingrid. Felicia knows Chloe. Which of Cora and Delia can Georgia reach?", "answer": "Cora", "steps": [ "Georgia knows Alyson.", "Alyson knows Sandy.", "Sandy knows Cora." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Georgia", "Cecilia", "Joyce", "Cora", "Kendra", "Sandy", "Alyson", "Lucy", "Casey", "Terry", "Elise", "Ainsley", "Elliot", "Delia", "Dolores", "Tony", "Fritz", "Ingrid", "Felicia", "Chloe" ], "edges": [ [ 0, 6 ], [ 1, 4 ], [ 3, 1 ], [ 3, 7 ], [ 5, 2 ], [ 5, 3 ], [ 5, 8 ], [ 6, 5 ], [ 8, 9 ], [ 10, 16 ], [ 11, 14 ], [ 13, 11 ], [ 13, 17 ], [ 15, 12 ], [ 15, 13 ], [ 15, 18 ], [ 16, 15 ], [ 18, 19 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Verna knows August. Ben knows Cristina. Warren knows Celia. Jacqueline knows Keira. Sara knows Byron. Jacqueline knows Daphne. Byron knows Verna. Ben knows Dewey. Byron knows Jacqueline. Emery knows Warren. Emery knows Ben. Aisha knows Tara. Lucille knows Aisha. Jacqueline knows Marie. Marie knows Itzel. Itzel knows Rebecca. Ben knows Lucille. Calvin knows Emery. Which of Marie and Lucille can Calvin reach?", "answer": "Lucille", "steps": [ "Calvin knows Emery.", "Emery knows Ben.", "Ben knows Lucille." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Calvin", "Dewey", "Celia", "Cristina", "Aisha", "Warren", "Emery", "Tara", "Lucille", "Ben", "Sara", "Keira", "August", "Daphne", "Itzel", "Verna", "Byron", "Rebecca", "Marie", "Jacqueline" ], "edges": [ [ 0, 6 ], [ 4, 7 ], [ 5, 2 ], [ 6, 5 ], [ 6, 9 ], [ 8, 4 ], [ 9, 1 ], [ 9, 3 ], [ 9, 8 ], [ 10, 16 ], [ 14, 17 ], [ 15, 12 ], [ 16, 15 ], [ 16, 19 ], [ 18, 14 ], [ 19, 11 ], [ 19, 13 ], [ 19, 18 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Denise knows Guillermo. Effie knows Dina. Dina knows Mara. Haven knows Aspen. Cesar knows Haven. Mara knows Marc. Haven knows Rena. Haven knows Samuel. Dina knows Stella. Rena knows Brian. Haven knows Denise. Ralph knows Helene. Helene knows Caroline. Aspen knows Daphne. Dina knows Leigh. Guillermo knows Marcus. Dina knows Ralph. Stella knows Ramon. Which of Dina and Haven can Cesar reach?", "answer": "Haven", "steps": [ "Cesar knows Haven." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Cesar", "Samuel", "Brian", "Guillermo", "Aspen", "Rena", "Marcus", "Haven", "Daphne", "Denise", "Effie", "Leigh", "Ramon", "Helene", "Mara", "Stella", "Caroline", "Dina", "Marc", "Ralph" ], "edges": [ [ 0, 7 ], [ 3, 6 ], [ 4, 8 ], [ 5, 2 ], [ 7, 1 ], [ 7, 5 ], [ 7, 4 ], [ 7, 9 ], [ 9, 3 ], [ 10, 17 ], [ 13, 16 ], [ 14, 18 ], [ 15, 12 ], [ 17, 11 ], [ 17, 15 ], [ 17, 14 ], [ 17, 19 ], [ 19, 13 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Willard knows Arturo. Marcus knows Ariana. Conrad knows Isadora. Dee knows Conrad. Dee knows Edna. Miranda knows Raymond. Darwin knows Marcus. Kobe knows Jeremiah. Mildred knows Angela. Raymond knows Willard. Ruth knows Spencer. Lacey knows Mildred. Jeremiah knows Dee. Esther knows Darwin. Angela knows Geneva. Marcus knows Ruth. Esther knows Miranda. Kobe knows Lacey. Which of Jeremiah and Darwin can Esther reach?", "answer": "Darwin", "steps": [ "Esther knows Darwin." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Esther", "Raymond", "Ariana", "Miranda", "Arturo", "Willard", "Spencer", "Ruth", "Darwin", "Marcus", "Kobe", "Mildred", "Edna", "Lacey", "Geneva", "Angela", "Isadora", "Conrad", "Jeremiah", "Dee" ], "edges": [ [ 0, 3 ], [ 0, 8 ], [ 1, 5 ], [ 3, 1 ], [ 5, 4 ], [ 7, 6 ], [ 8, 9 ], [ 9, 2 ], [ 9, 7 ], [ 10, 13 ], [ 10, 18 ], [ 11, 15 ], [ 13, 11 ], [ 15, 14 ], [ 17, 16 ], [ 18, 19 ], [ 19, 12 ], [ 19, 17 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Wilbur knows Xavier. Landon knows Wilbur. Holly knows Vanessa. Abigail knows Arden. Arden knows Edison. Vanessa knows Leonard. Lyle knows Devin. Abigail knows Holly. Beatrice knows Theodore. Lennox knows Conrad. Rowan knows Abigail. Theodore knows Landon. Theodore knows Lennox. Colin knows Ryan. Edison knows Luz. Conrad knows Louis. Devin knows Rowan. Ryan knows Beatrice. Which of Theodore and Abigail can Colin reach?", "answer": "Theodore", "steps": [ "Colin knows Ryan.", "Ryan knows Beatrice.", "Beatrice knows Theodore." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Colin", "Landon", "Conrad", "Louis", "Theodore", "Beatrice", "Wilbur", "Xavier", "Lennox", "Ryan", "Lyle", "Holly", "Edison", "Luz", "Abigail", "Rowan", "Vanessa", "Leonard", "Arden", "Devin" ], "edges": [ [ 0, 9 ], [ 1, 6 ], [ 2, 3 ], [ 4, 1 ], [ 4, 8 ], [ 5, 4 ], [ 6, 7 ], [ 8, 2 ], [ 9, 5 ], [ 10, 19 ], [ 11, 16 ], [ 12, 13 ], [ 14, 11 ], [ 14, 18 ], [ 15, 14 ], [ 16, 17 ], [ 18, 12 ], [ 19, 15 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Lyric knows Cate. Josie knows Greer. Lillian knows Lyric. Lillian knows Josie. Erica knows Herman. Dustin knows Kendra. Jamie knows Laura. Hazel knows Estella. Dustin knows Lewis. Lewis knows Erica. Hazel knows Penny. Erica knows Hazel. Josie knows Mary. Greer knows Cliff. Estella knows Jana. Herman knows Lorraine. Jamie knows Melody. Melody knows Lillian. Which of Estella and Greer can Dustin reach?", "answer": "Estella", "steps": [ "Dustin knows Lewis.", "Lewis knows Erica.", "Erica knows Hazel.", "Hazel knows Estella." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Dustin", "Lewis", "Hazel", "Penny", "Kendra", "Herman", "Erica", "Jana", "Lorraine", "Estella", "Jamie", "Melody", "Josie", "Mary", "Laura", "Lyric", "Lillian", "Cliff", "Cate", "Greer" ], "edges": [ [ 0, 4 ], [ 0, 1 ], [ 1, 6 ], [ 2, 3 ], [ 2, 9 ], [ 5, 8 ], [ 6, 5 ], [ 6, 2 ], [ 9, 7 ], [ 10, 14 ], [ 10, 11 ], [ 11, 16 ], [ 12, 13 ], [ 12, 19 ], [ 15, 18 ], [ 16, 15 ], [ 16, 12 ], [ 19, 17 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Emanuel knows Chance. Marshall knows Cooper. Gonzalo knows Jewel. Cooper knows Peggy. Chance knows Landon. Belinda knows Gonzalo. Devin knows Ted. Marshall knows Cornelius. Emanuel knows Wade. Landon knows Robin. Ted knows Edmund. Gonzalo knows Emanuel. Ted knows Teresa. Gonzalo knows Noah. Cooper knows Devin. Landon knows Blanche. Mildred knows Marshall. Marshall knows Dante. Which of Chance and Devin can Mildred reach?", "answer": "Devin", "steps": [ "Mildred knows Marshall.", "Marshall knows Cooper.", "Cooper knows Devin." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Mildred", "Ted", "Peggy", "Edmund", "Dante", "Teresa", "Marshall", "Cooper", "Devin", "Cornelius", "Belinda", "Landon", "Wade", "Blanche", "Noah", "Robin", "Gonzalo", "Emanuel", "Chance", "Jewel" ], "edges": [ [ 0, 6 ], [ 1, 3 ], [ 1, 5 ], [ 6, 4 ], [ 6, 7 ], [ 6, 9 ], [ 7, 2 ], [ 7, 8 ], [ 8, 1 ], [ 10, 16 ], [ 11, 13 ], [ 11, 15 ], [ 16, 14 ], [ 16, 17 ], [ 16, 19 ], [ 17, 12 ], [ 17, 18 ], [ 18, 11 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Joshua knows Lamont. Harry knows Camden. Joshua knows Harris. Casey knows Lee. Darnell knows Virginia. Darnell knows Nolan. Joshua knows Willard. Joshua knows Corey. Virginia knows Ada. Willard knows Ava. Blake knows Cesar. Casey knows Harry. Ada knows Blake. Blake knows Kristin. Ava knows Casey. Darnell knows Cordelia. Kristin knows Steve. Darnell knows Patricia. Which of Camden and Steve can Darnell reach?", "answer": "Steve", "steps": [ "Darnell knows Virginia.", "Virginia knows Ada.", "Ada knows Blake.", "Blake knows Kristin.", "Kristin knows Steve." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Darnell", "Kristin", "Cordelia", "Blake", "Steve", "Cesar", "Nolan", "Ada", "Virginia", "Patricia", "Joshua", "Harry", "Harris", "Casey", "Camden", "Lee", "Lamont", "Ava", "Willard", "Corey" ], "edges": [ [ 0, 2 ], [ 0, 6 ], [ 0, 8 ], [ 0, 9 ], [ 1, 4 ], [ 3, 1 ], [ 3, 5 ], [ 7, 3 ], [ 8, 7 ], [ 10, 12 ], [ 10, 16 ], [ 10, 18 ], [ 10, 19 ], [ 11, 14 ], [ 13, 11 ], [ 13, 15 ], [ 17, 13 ], [ 18, 17 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Loretta knows Dorothy. Eldon knows Daisy. Kristina knows Marc. Dorothy knows Colleen. Naomi knows Jordan. Gareth knows Farrah. Spencer knows Eldon. Gareth knows Spencer. Dorothy knows Kristina. Renee knows Loretta. Tonya knows Naomi. Spencer knows Lennox. Tonya knows Gareth. Harriet knows Aisha. Loretta knows Gage. Spencer knows Dudley. Dorothy knows Lawrence. Renee knows Harriet. Which of Gareth and Loretta can Renee reach?", "answer": "Loretta", "steps": [ "Renee knows Loretta." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Renee", "Aisha", "Loretta", "Lawrence", "Dorothy", "Gage", "Marc", "Kristina", "Colleen", "Harriet", "Tonya", "Jordan", "Gareth", "Dudley", "Spencer", "Farrah", "Daisy", "Eldon", "Lennox", "Naomi" ], "edges": [ [ 0, 2 ], [ 0, 9 ], [ 2, 5 ], [ 2, 4 ], [ 4, 3 ], [ 4, 7 ], [ 4, 8 ], [ 7, 6 ], [ 9, 1 ], [ 10, 12 ], [ 10, 19 ], [ 12, 15 ], [ 12, 14 ], [ 14, 13 ], [ 14, 17 ], [ 14, 18 ], [ 17, 16 ], [ 19, 11 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Sadie knows Brynn. Marco knows Eve. Haley knows Sadie. Stefan knows Dee. Valerie knows Bonnie. Morris knows Susanne. Bonnie knows Elvira. Amy knows Jodi. Cameron knows Amy. Cordelia knows Haley. Dee knows Eli. Sadie knows Deborah. Fergus knows Zachary. Amy knows Stefan. Marco knows Cameron. Deborah knows Morris. Zachary knows Marco. Morris knows Valerie. Which of Amy and Morris can Cordelia reach?", "answer": "Morris", "steps": [ "Cordelia knows Haley.", "Haley knows Sadie.", "Sadie knows Deborah.", "Deborah knows Morris." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Cordelia", "Elvira", "Brynn", "Susanne", "Sadie", "Valerie", "Morris", "Bonnie", "Haley", "Deborah", "Fergus", "Eli", "Eve", "Jodi", "Marco", "Stefan", "Amy", "Dee", "Zachary", "Cameron" ], "edges": [ [ 0, 8 ], [ 4, 2 ], [ 4, 9 ], [ 5, 7 ], [ 6, 3 ], [ 6, 5 ], [ 7, 1 ], [ 8, 4 ], [ 9, 6 ], [ 10, 18 ], [ 14, 12 ], [ 14, 19 ], [ 15, 17 ], [ 16, 13 ], [ 16, 15 ], [ 17, 11 ], [ 18, 14 ], [ 19, 16 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Lucy knows Vincent. Colby knows Jakob. Charity knows Colby. Leopold knows Lydia. Charity knows Houston. Lydia knows Byron. Randy knows Irving. August knows Annie. Vincent knows August. Annie knows Zoe. Zoe knows Eric. Kieran knows Charity. Houston knows Leopold. Tabitha knows Lucy. Eric knows Sharon. August knows Randy. Edward knows Tom. Tom knows Kieran. Which of Charity and August can Tabitha reach?", "answer": "August", "steps": [ "Tabitha knows Lucy.", "Lucy knows Vincent.", "Vincent knows August." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Tabitha", "August", "Irving", "Lucy", "Randy", "Vincent", "Annie", "Sharon", "Zoe", "Eric", "Edward", "Charity", "Jakob", "Tom", "Colby", "Kieran", "Houston", "Byron", "Leopold", "Lydia" ], "edges": [ [ 0, 3 ], [ 1, 4 ], [ 1, 6 ], [ 3, 5 ], [ 4, 2 ], [ 5, 1 ], [ 6, 8 ], [ 8, 9 ], [ 9, 7 ], [ 10, 13 ], [ 11, 14 ], [ 11, 16 ], [ 13, 15 ], [ 14, 12 ], [ 15, 11 ], [ 16, 18 ], [ 18, 19 ], [ 19, 17 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Beau knows Amber. Rosemary knows Jordan. Camille knows Kimberly. Camille knows Sharon. Faith knows Samantha. Rick knows Faith. Vera knows Jolene. Vera knows Etta. Gemma knows Effie. Etta knows Beau. Jordan knows Michelle. Rick knows Hilda. Rick knows Vera. Gemma knows Cameron. Cameron knows Tina. Cameron knows Rosemary. Faith knows Louis. Gemma knows Camille. Which of Amber and Michelle can Rick reach?", "answer": "Amber", "steps": [ "Rick knows Vera.", "Vera knows Etta.", "Etta knows Beau.", "Beau knows Amber." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Rick", "Beau", "Vera", "Amber", "Louis", "Hilda", "Jolene", "Faith", "Etta", "Samantha", "Gemma", "Jordan", "Cameron", "Michelle", "Kimberly", "Effie", "Tina", "Camille", "Rosemary", "Sharon" ], "edges": [ [ 0, 5 ], [ 0, 2 ], [ 0, 7 ], [ 1, 3 ], [ 2, 6 ], [ 2, 8 ], [ 7, 4 ], [ 7, 9 ], [ 8, 1 ], [ 10, 15 ], [ 10, 12 ], [ 10, 17 ], [ 11, 13 ], [ 12, 16 ], [ 12, 18 ], [ 17, 14 ], [ 17, 19 ], [ 18, 11 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Will knows Colin. Vance knows Will. Colin knows Kristina. Casey knows Jewel. Sara knows Casey. Hubert knows Douglas. Will knows Ashton. Will knows Parker. Fanny knows Bennett. Fanny knows Elizabeth. Lennox knows Leon. Sara knows Laverne. Parker knows Fanny. Patricia knows Vance. Laverne knows Hubert. Hubert knows Porter. Sara knows Jerome. Leon knows Sara. Which of Laverne and Parker can Patricia reach?", "answer": "Parker", "steps": [ "Patricia knows Vance.", "Vance knows Will.", "Will knows Parker." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Patricia", "Vance", "Colin", "Ashton", "Fanny", "Parker", "Kristina", "Elizabeth", "Bennett", "Will", "Lennox", "Leon", "Casey", "Jerome", "Hubert", "Laverne", "Jewel", "Porter", "Douglas", "Sara" ], "edges": [ [ 0, 1 ], [ 1, 9 ], [ 2, 6 ], [ 4, 7 ], [ 4, 8 ], [ 5, 4 ], [ 9, 3 ], [ 9, 2 ], [ 9, 5 ], [ 10, 11 ], [ 11, 19 ], [ 12, 16 ], [ 14, 17 ], [ 14, 18 ], [ 15, 14 ], [ 19, 13 ], [ 19, 12 ], [ 19, 15 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Leah knows Judith. Ernesto knows Diana. Judith knows Cody. Eamon knows Leah. Don knows Ariana. Diana knows Lacey. Wyatt knows Lisette. Maude knows Brian. Fernando knows Edmund. Eamon knows Jason. Marion knows Don. Leah knows Maude. Lacey knows Eamon. Fernando knows Jenna. Ariana knows Fernando. Edmund knows Wyatt. Bernadette knows Dudley. Edmund knows Bernadette. Which of Leah and Edmund can Ernesto reach?", "answer": "Leah", "steps": [ "Ernesto knows Diana.", "Diana knows Lacey.", "Lacey knows Eamon.", "Eamon knows Leah." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Ernesto", "Leah", "Diana", "Cody", "Jason", "Maude", "Lacey", "Brian", "Judith", "Eamon", "Marion", "Edmund", "Don", "Lisette", "Jenna", "Bernadette", "Ariana", "Dudley", "Wyatt", "Fernando" ], "edges": [ [ 0, 2 ], [ 1, 5 ], [ 1, 8 ], [ 2, 6 ], [ 5, 7 ], [ 6, 9 ], [ 8, 3 ], [ 9, 4 ], [ 9, 1 ], [ 10, 12 ], [ 11, 15 ], [ 11, 18 ], [ 12, 16 ], [ 15, 17 ], [ 16, 19 ], [ 18, 13 ], [ 19, 14 ], [ 19, 11 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Coral knows Axel. Roman knows Houston. Carey knows Gertrude. Dick knows Roy. Carey knows Imogen. Axel knows Effie. Julio knows Roman. Julio knows Hugh. Imogen knows Sandra. Houston knows Coral. Jeanne knows Laurel. Julio knows Mike. Melanie knows Mark. Roy knows Leah. Sandra knows Teresa. Mike knows Jeanne. Carey knows Melanie. Mark knows Dick. Which of Dick and Coral can Carey reach?", "answer": "Dick", "steps": [ "Carey knows Melanie.", "Melanie knows Mark.", "Mark knows Dick." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Carey", "Mark", "Roy", "Teresa", "Melanie", "Dick", "Sandra", "Leah", "Gertrude", "Imogen", "Julio", "Houston", "Axel", "Laurel", "Roman", "Coral", "Jeanne", "Effie", "Hugh", "Mike" ], "edges": [ [ 0, 4 ], [ 0, 8 ], [ 0, 9 ], [ 1, 5 ], [ 2, 7 ], [ 4, 1 ], [ 5, 2 ], [ 6, 3 ], [ 9, 6 ], [ 10, 14 ], [ 10, 18 ], [ 10, 19 ], [ 11, 15 ], [ 12, 17 ], [ 14, 11 ], [ 15, 12 ], [ 16, 13 ], [ 19, 16 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Winifred knows Kara. Yara knows Jeanne. Miriam knows Coral. Wilson knows Cynthia. Dana knows Declan. Jeanne knows Dennis. Hank knows Elijah. Elijah knows Winifred. Louise knows Dana. Roger knows Miriam. Winifred knows Louise. Kara knows Joseph. Cynthia knows Freya. Joseph knows Philip. Dennis knows Regina. Freya knows Roger. Freya knows Yara. Declan knows Sierra. Which of Dennis and Declan can Wilson reach?", "answer": "Dennis", "steps": [ "Wilson knows Cynthia.", "Cynthia knows Freya.", "Freya knows Yara.", "Yara knows Jeanne.", "Jeanne knows Dennis." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Wilson", "Regina", "Roger", "Jeanne", "Coral", "Yara", "Dennis", "Cynthia", "Miriam", "Freya", "Hank", "Sierra", "Kara", "Dana", "Philip", "Louise", "Declan", "Elijah", "Joseph", "Winifred" ], "edges": [ [ 0, 7 ], [ 2, 8 ], [ 3, 6 ], [ 5, 3 ], [ 6, 1 ], [ 7, 9 ], [ 8, 4 ], [ 9, 5 ], [ 9, 2 ], [ 10, 17 ], [ 12, 18 ], [ 13, 16 ], [ 15, 13 ], [ 16, 11 ], [ 17, 19 ], [ 18, 14 ], [ 19, 15 ], [ 19, 12 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Fergus knows Jonas. Sydney knows Erik. Russ knows Faith. Carter knows Bennett. Leigh knows Ashton. Desmond knows Steve. Bennett knows Dave. Desmond knows Edgar. Bennett knows Sydney. Colette knows Russ. Leigh knows Lena. Fergus knows Colette. Carter knows Hope. Sydney knows Desmond. Russ knows Leigh. Hope knows Tom. Colette knows Stephen. Jonas knows Arlene. Which of Desmond and Leigh can Fergus reach?", "answer": "Leigh", "steps": [ "Fergus knows Colette.", "Colette knows Russ.", "Russ knows Leigh." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Fergus", "Jonas", "Stephen", "Faith", "Colette", "Lena", "Arlene", "Russ", "Ashton", "Leigh", "Carter", "Hope", "Dave", "Erik", "Bennett", "Edgar", "Tom", "Sydney", "Steve", "Desmond" ], "edges": [ [ 0, 1 ], [ 0, 4 ], [ 1, 6 ], [ 4, 2 ], [ 4, 7 ], [ 7, 3 ], [ 7, 9 ], [ 9, 5 ], [ 9, 8 ], [ 10, 11 ], [ 10, 14 ], [ 11, 16 ], [ 14, 12 ], [ 14, 17 ], [ 17, 13 ], [ 17, 19 ], [ 19, 15 ], [ 19, 18 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Hadley knows Melanie. Alma knows Ignacio. Tabitha knows Chance. Gwen knows Abigail. Luke knows Chloe. Luz knows Henrietta. Gerard knows Levi. Ignacio knows Horace. Levi knows Alma. Mason knows Bernard. Gerard knows Tracy. Melanie knows Gwen. Levi knows Tabitha. Bernard knows Victor. Luke knows Hadley. Hadley knows Adelaide. Melanie knows Mason. Luz knows Gerard. Which of Alma and Mason can Luke reach?", "answer": "Mason", "steps": [ "Luke knows Hadley.", "Hadley knows Melanie.", "Melanie knows Mason." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Luke", "Mason", "Hadley", "Gwen", "Bernard", "Chloe", "Victor", "Adelaide", "Melanie", "Abigail", "Luz", "Alma", "Gerard", "Tabitha", "Ignacio", "Henrietta", "Horace", "Tracy", "Levi", "Chance" ], "edges": [ [ 0, 5 ], [ 0, 2 ], [ 1, 4 ], [ 2, 7 ], [ 2, 8 ], [ 3, 9 ], [ 4, 6 ], [ 8, 1 ], [ 8, 3 ], [ 10, 15 ], [ 10, 12 ], [ 11, 14 ], [ 12, 17 ], [ 12, 18 ], [ 13, 19 ], [ 14, 16 ], [ 18, 11 ], [ 18, 13 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Kane knows Luz. Skyler knows Clay. Luz knows Lana. Clay knows Parsa. Parsa knows Nash. Marc knows Selena. Parsa knows Kendra. Hendrix knows Graeme. Yolanda knows Dina. Parsa knows Hudson. Skyler knows Norma. Skyler knows Elvira. Eden knows Marc. Nash knows Hendrix. Marc knows Kane. Yolanda knows Dudley. Yolanda knows Eden. Marc knows Elaine. Which of Clay and Eden can Skyler reach?", "answer": "Clay", "steps": [ "Skyler knows Clay." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Skyler", "Elvira", "Parsa", "Hendrix", "Clay", "Norma", "Hudson", "Graeme", "Kendra", "Nash", "Yolanda", "Dudley", "Marc", "Luz", "Eden", "Dina", "Elaine", "Lana", "Selena", "Kane" ], "edges": [ [ 0, 1 ], [ 0, 5 ], [ 0, 4 ], [ 2, 6 ], [ 2, 8 ], [ 2, 9 ], [ 3, 7 ], [ 4, 2 ], [ 9, 3 ], [ 10, 11 ], [ 10, 15 ], [ 10, 14 ], [ 12, 16 ], [ 12, 18 ], [ 12, 19 ], [ 13, 17 ], [ 14, 12 ], [ 19, 13 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Abel knows Morris. Kay knows Ruby. Carey knows Dolores. Celia knows Franklin. Latoya knows Linda. Ember knows Abel. Latoya knows Jared. Nina knows Latoya. Franklin knows Sally. Ralph knows Kay. Chester knows Flora. Dolores knows Nina. Chester knows Ellis. Carey knows Skyler. Dolores knows Celia. Ember knows Marlene. Abel knows Ralph. Morris knows Chester. Which of Nina and Morris can Ember reach?", "answer": "Morris", "steps": [ "Ember knows Abel.", "Abel knows Morris." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Ember", "Kay", "Ralph", "Morris", "Abel", "Chester", "Flora", "Ellis", "Ruby", "Marlene", "Carey", "Franklin", "Celia", "Nina", "Dolores", "Latoya", "Linda", "Jared", "Sally", "Skyler" ], "edges": [ [ 0, 4 ], [ 0, 9 ], [ 1, 8 ], [ 2, 1 ], [ 3, 5 ], [ 4, 3 ], [ 4, 2 ], [ 5, 6 ], [ 5, 7 ], [ 10, 14 ], [ 10, 19 ], [ 11, 18 ], [ 12, 11 ], [ 13, 15 ], [ 14, 13 ], [ 14, 12 ], [ 15, 16 ], [ 15, 17 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Jocelyn knows George. Lawrence knows Hal. Hal knows Dee. Richard knows Mark. Ian knows Jonah. Richard knows Harry. Hal knows Eldon. Lawrence knows Jason. Lawrence knows Jocelyn. Richard knows Ian. Jacques knows Logan. Dennis knows Yara. Jocelyn knows Boyd. Jacques knows Tara. Ian knows Dennis. Richard knows Jacques. Boyd knows Janice. Lawrence knows Dexter. Which of Ian and Jocelyn can Lawrence reach?", "answer": "Jocelyn", "steps": [ "Lawrence knows Jocelyn." ], "difficulty": 1, "original_distance": 3, "idx_to_symbol": [ "Lawrence", "George", "Jocelyn", "Jason", "Hal", "Dee", "Janice", "Eldon", "Dexter", "Boyd", "Richard", "Jonah", "Ian", "Mark", "Jacques", "Tara", "Yara", "Logan", "Harry", "Dennis" ], "edges": [ [ 0, 3 ], [ 0, 4 ], [ 0, 8 ], [ 0, 2 ], [ 2, 1 ], [ 2, 9 ], [ 4, 5 ], [ 4, 7 ], [ 9, 6 ], [ 10, 13 ], [ 10, 14 ], [ 10, 18 ], [ 10, 12 ], [ 12, 11 ], [ 12, 19 ], [ 14, 15 ], [ 14, 17 ], [ 19, 16 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Alexa knows Knox. Randall knows Nolan. Blaine knows Barbara. Allen knows Terry. Felicia knows Blaine. Randall knows Alana. Felicia knows Jarvis. Lily knows Elliot. Lily knows Teresa. Elliot knows Margaret. Edna knows Lily. Lamar knows Felicia. Nolan knows Palmer. Allen knows Lawson. Lawson knows Alexa. Elliot knows Randall. Palmer knows Paul. Blaine knows Allen. Which of Elliot and Blaine can Lamar reach?", "answer": "Blaine", "steps": [ "Lamar knows Felicia.", "Felicia knows Blaine." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Lamar", "Knox", "Alexa", "Blaine", "Felicia", "Terry", "Allen", "Lawson", "Jarvis", "Barbara", "Edna", "Paul", "Palmer", "Elliot", "Lily", "Alana", "Randall", "Nolan", "Teresa", "Margaret" ], "edges": [ [ 0, 4 ], [ 2, 1 ], [ 3, 6 ], [ 3, 9 ], [ 4, 8 ], [ 4, 3 ], [ 6, 5 ], [ 6, 7 ], [ 7, 2 ], [ 10, 14 ], [ 12, 11 ], [ 13, 16 ], [ 13, 19 ], [ 14, 18 ], [ 14, 13 ], [ 16, 15 ], [ 16, 17 ], [ 17, 12 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Dora knows Erma. Aria knows Lane. Eden knows Fraser. Anthony knows Ron. Byron knows Eden. Davis knows Aria. Eden knows Kerry. Ron knows Molly. Kerry knows Clifford. Lane knows Jenna. Erma knows Taylor. Rod knows Ava. Molly knows Byron. Gunnar knows Dora. Ron knows Harley. Archie knows Anthony. Lane knows Gunnar. Erma knows Rod. Which of Lane and Ron can Archie reach?", "answer": "Ron", "steps": [ "Archie knows Anthony.", "Anthony knows Ron." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Archie", "Kerry", "Harley", "Byron", "Anthony", "Ron", "Molly", "Fraser", "Clifford", "Eden", "Davis", "Rod", "Jenna", "Dora", "Aria", "Lane", "Gunnar", "Taylor", "Ava", "Erma" ], "edges": [ [ 0, 4 ], [ 1, 8 ], [ 3, 9 ], [ 4, 5 ], [ 5, 2 ], [ 5, 6 ], [ 6, 3 ], [ 9, 7 ], [ 9, 1 ], [ 10, 14 ], [ 11, 18 ], [ 13, 19 ], [ 14, 15 ], [ 15, 12 ], [ 15, 16 ], [ 16, 13 ], [ 19, 17 ], [ 19, 11 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Iris knows Gene. Harriet knows Kevin. Eric knows Larissa. Byron knows Rocco. Emmett knows Jarvis. Lambert knows Lewis. Harriet knows Geoffrey. Lewis knows Byron. Iris knows Rosa. Desmond knows Lambert. Emmett knows Harriet. Byron knows Bella. Desmond knows Isadora. Florence knows Desmond. Lambert knows Lorenzo. Kevin knows Iris. Eric knows Emmett. Florence knows Chance. Which of Rosa and Bella can Florence reach?", "answer": "Bella", "steps": [ "Florence knows Desmond.", "Desmond knows Lambert.", "Lambert knows Lewis.", "Lewis knows Byron.", "Byron knows Bella." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Florence", "Lewis", "Chance", "Lorenzo", "Rocco", "Lambert", "Bella", "Byron", "Desmond", "Isadora", "Eric", "Kevin", "Larissa", "Geoffrey", "Gene", "Harriet", "Rosa", "Iris", "Emmett", "Jarvis" ], "edges": [ [ 0, 2 ], [ 0, 8 ], [ 1, 7 ], [ 5, 3 ], [ 5, 1 ], [ 7, 4 ], [ 7, 6 ], [ 8, 5 ], [ 8, 9 ], [ 10, 12 ], [ 10, 18 ], [ 11, 17 ], [ 15, 13 ], [ 15, 11 ], [ 17, 14 ], [ 17, 16 ], [ 18, 15 ], [ 18, 19 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Tonya knows Austin. Geneva knows Caroline. Haley knows Jeanne. Henry knows Geneva. Geneva knows Langston. Byron knows Cruz. Levi knows Sandra. Edna knows Tonya. Levi knows Byron. Jeanne knows Glenda. Langston knows Lorraine. Cruz knows Henry. Byron knows Denver. Tonya knows Malcolm. Malcolm knows Judy. Jeanne knows Gina. Haley knows Kingsley. Glenda knows Edna. Which of Judy and Lorraine can Haley reach?", "answer": "Judy", "steps": [ "Haley knows Jeanne.", "Jeanne knows Glenda.", "Glenda knows Edna.", "Edna knows Tonya.", "Tonya knows Malcolm.", "Malcolm knows Judy." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Haley", "Austin", "Tonya", "Kingsley", "Judy", "Glenda", "Gina", "Edna", "Jeanne", "Malcolm", "Levi", "Caroline", "Geneva", "Sandra", "Lorraine", "Cruz", "Denver", "Henry", "Byron", "Langston" ], "edges": [ [ 0, 3 ], [ 0, 8 ], [ 2, 1 ], [ 2, 9 ], [ 5, 7 ], [ 7, 2 ], [ 8, 6 ], [ 8, 5 ], [ 9, 4 ], [ 10, 13 ], [ 10, 18 ], [ 12, 11 ], [ 12, 19 ], [ 15, 17 ], [ 17, 12 ], [ 18, 16 ], [ 18, 15 ], [ 19, 14 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Hank knows William. Lenora knows Davis. Hank knows Doug. Boyd knows Gwen. Eleanor knows Boyd. Gerald knows Dennis. Davis knows Christian. Gerald knows Eleanor. Reid knows Bernadette. Doug knows Isadora. Hank knows Jonah. William knows Thomas. Hugo knows Katherine. Reid knows Hugo. William knows Rod. William knows Lenora. Gerald knows Jem. Reid knows Gerald. Which of Christian and Gwen can Hank reach?", "answer": "Christian", "steps": [ "Hank knows William.", "William knows Lenora.", "Lenora knows Davis.", "Davis knows Christian." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Hank", "Jonah", "Doug", "William", "Christian", "Rod", "Isadora", "Thomas", "Davis", "Lenora", "Reid", "Bernadette", "Hugo", "Gerald", "Gwen", "Dennis", "Katherine", "Jem", "Boyd", "Eleanor" ], "edges": [ [ 0, 1 ], [ 0, 2 ], [ 0, 3 ], [ 2, 6 ], [ 3, 5 ], [ 3, 7 ], [ 3, 9 ], [ 8, 4 ], [ 9, 8 ], [ 10, 11 ], [ 10, 12 ], [ 10, 13 ], [ 12, 16 ], [ 13, 15 ], [ 13, 17 ], [ 13, 19 ], [ 18, 14 ], [ 19, 18 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Duncan knows Jeffery. Jacques knows Gideon. Aldo knows Zach. Keira knows Colin. Neil knows Wesley. Jacques knows Aldo. Kit knows Jacques. Zach knows Warren. Madeline knows Paul. Gideon knows Brooks. Matt knows Dakota. Madeline knows Matt. Kit knows Neil. Paul knows Sebastian. Sebastian knows Ellis. Aldo knows Shelly. Sebastian knows Keira. Paul knows Duncan. Which of Colin and Warren can Madeline reach?", "answer": "Colin", "steps": [ "Madeline knows Paul.", "Paul knows Sebastian.", "Sebastian knows Keira.", "Keira knows Colin." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Madeline", "Colin", "Paul", "Matt", "Ellis", "Sebastian", "Keira", "Duncan", "Jeffery", "Dakota", "Kit", "Warren", "Jacques", "Neil", "Shelly", "Aldo", "Zach", "Gideon", "Brooks", "Wesley" ], "edges": [ [ 0, 2 ], [ 0, 3 ], [ 2, 5 ], [ 2, 7 ], [ 3, 9 ], [ 5, 4 ], [ 5, 6 ], [ 6, 1 ], [ 7, 8 ], [ 10, 12 ], [ 10, 13 ], [ 12, 15 ], [ 12, 17 ], [ 13, 19 ], [ 15, 14 ], [ 15, 16 ], [ 16, 11 ], [ 17, 18 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Anthony knows Dawn. Marco knows Clay. Chad knows Wendell. Wendell knows Samantha. Kaleb knows Sarah. Damian knows Herman. Keith knows Susanne. Susanne knows Marco. Sarah knows Anthony. Brittany knows Knox. Keith knows Chad. Knox knows Keith. Dawn knows Shelby. Helene knows Luna. Pat knows Brittany. Herman knows Arden. Dawn knows Damian. Shelby knows Helene. Which of Luna and Samantha can Kaleb reach?", "answer": "Luna", "steps": [ "Kaleb knows Sarah.", "Sarah knows Anthony.", "Anthony knows Dawn.", "Dawn knows Shelby.", "Shelby knows Helene.", "Helene knows Luna." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Kaleb", "Herman", "Dawn", "Sarah", "Luna", "Shelby", "Damian", "Arden", "Anthony", "Helene", "Pat", "Marco", "Keith", "Brittany", "Samantha", "Chad", "Susanne", "Clay", "Knox", "Wendell" ], "edges": [ [ 0, 3 ], [ 1, 7 ], [ 2, 6 ], [ 2, 5 ], [ 3, 8 ], [ 5, 9 ], [ 6, 1 ], [ 8, 2 ], [ 9, 4 ], [ 10, 13 ], [ 11, 17 ], [ 12, 16 ], [ 12, 15 ], [ 13, 18 ], [ 15, 19 ], [ 16, 11 ], [ 18, 12 ], [ 19, 14 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Chloe knows Frida. Leander knows Wilson. Frida knows Hope. Imogen knows Yolanda. Katherine knows Leander. Leander knows Imogen. Alison knows Ada. Janet knows Seth. Frida knows Chantal. Dale knows Janet. Frida knows Javier. Lilia knows Ann. Joyce knows Lilia. Chantal knows Alison. Leander knows Keith. Katherine knows Dale. Yolanda knows Preston. Chloe knows Joyce. Which of Frida and Leander can Katherine reach?", "answer": "Leander", "steps": [ "Katherine knows Leander." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Katherine", "Keith", "Imogen", "Preston", "Dale", "Wilson", "Leander", "Janet", "Seth", "Yolanda", "Chloe", "Javier", "Chantal", "Ada", "Joyce", "Hope", "Frida", "Lilia", "Ann", "Alison" ], "edges": [ [ 0, 4 ], [ 0, 6 ], [ 2, 9 ], [ 4, 7 ], [ 6, 1 ], [ 6, 5 ], [ 6, 2 ], [ 7, 8 ], [ 9, 3 ], [ 10, 14 ], [ 10, 16 ], [ 12, 19 ], [ 14, 17 ], [ 16, 11 ], [ 16, 15 ], [ 16, 12 ], [ 17, 18 ], [ 19, 13 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Zara knows Donna. Preston knows Albert. Erica knows Claudia. Preston knows Leon. Darla knows Randall. Glenn knows Erica. Barbara knows Zara. Emma knows Jared. Earle knows Emma. Leon knows Glenn. Jared knows Rena. Randall knows Earle. Claudia knows Blaine. Randall knows Lana. Kieran knows Kirsten. Rena knows Kieran. Earle knows Adam. Zara knows Preston. Which of Leon and Emma can Barbara reach?", "answer": "Leon", "steps": [ "Barbara knows Zara.", "Zara knows Preston.", "Preston knows Leon." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Barbara", "Blaine", "Albert", "Claudia", "Erica", "Donna", "Leon", "Glenn", "Preston", "Zara", "Darla", "Kirsten", "Adam", "Kieran", "Rena", "Lana", "Emma", "Jared", "Earle", "Randall" ], "edges": [ [ 0, 9 ], [ 3, 1 ], [ 4, 3 ], [ 6, 7 ], [ 7, 4 ], [ 8, 2 ], [ 8, 6 ], [ 9, 5 ], [ 9, 8 ], [ 10, 19 ], [ 13, 11 ], [ 14, 13 ], [ 16, 17 ], [ 17, 14 ], [ 18, 12 ], [ 18, 16 ], [ 19, 15 ], [ 19, 18 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Tracy knows Chris. Angela knows Joan. Julia knows Rose. Kennedy knows Aldo. Tracy knows Damien. Antonio knows Angela. Joan knows Kennedy. Rose knows Jonathan. Cornelius knows Janice. Kennedy knows Lance. Kennedy knows Cornelius. Tracy knows Donald. Rose knows Gloria. Antonio knows Lenora. Gloria knows Guillermo. Guillermo knows Tracy. Chris knows Langston. Bert knows Antonio. Which of Kennedy and Tracy can Julia reach?", "answer": "Tracy", "steps": [ "Julia knows Rose.", "Rose knows Gloria.", "Gloria knows Guillermo.", "Guillermo knows Tracy." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Julia", "Guillermo", "Jonathan", "Tracy", "Donald", "Langston", "Rose", "Chris", "Damien", "Gloria", "Bert", "Joan", "Lenora", "Kennedy", "Aldo", "Janice", "Antonio", "Cornelius", "Lance", "Angela" ], "edges": [ [ 0, 6 ], [ 1, 3 ], [ 3, 4 ], [ 3, 7 ], [ 3, 8 ], [ 6, 2 ], [ 6, 9 ], [ 7, 5 ], [ 9, 1 ], [ 10, 16 ], [ 11, 13 ], [ 13, 14 ], [ 13, 17 ], [ 13, 18 ], [ 16, 12 ], [ 16, 19 ], [ 17, 15 ], [ 19, 11 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Carter knows Byron. Elise knows Sidney. Karina knows Jasmine. Byron knows Peggy. Uma knows Bruno. Carter knows Carl. Austin knows Elise. Angela knows Harvey. Jasmine knows Amelia. Harvey knows Amy. Amy knows Austin. Angela knows Arlene. Amelia knows Viola. Derrick knows Justin. Sidney knows Hal. Sidney knows Uma. Amelia knows Derrick. Peggy knows Karina. Which of Austin and Karina can Carter reach?", "answer": "Karina", "steps": [ "Carter knows Byron.", "Byron knows Peggy.", "Peggy knows Karina." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Carter", "Jasmine", "Byron", "Derrick", "Amelia", "Viola", "Karina", "Justin", "Peggy", "Carl", "Angela", "Elise", "Harvey", "Uma", "Sidney", "Hal", "Austin", "Bruno", "Amy", "Arlene" ], "edges": [ [ 0, 2 ], [ 0, 9 ], [ 1, 4 ], [ 2, 8 ], [ 3, 7 ], [ 4, 5 ], [ 4, 3 ], [ 6, 1 ], [ 8, 6 ], [ 10, 12 ], [ 10, 19 ], [ 11, 14 ], [ 12, 18 ], [ 13, 17 ], [ 14, 15 ], [ 14, 13 ], [ 16, 11 ], [ 18, 16 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Jeffery knows Israel. Terry knows Levi. Jeffery knows Russell. Becky knows Daphne. Jay knows Adelaide. Russell knows Marie. Jill knows Ignacio. Ignacio knows Terry. Becky knows Belinda. Daphne knows Dudley. Levi knows Francesca. Marie knows Dee. Jeffery knows Leigh. Daphne knows Jill. Bennett knows Jeffery. Bennett knows Eric. Daphne knows Camille. Dee knows Jay. Which of Francesca and Adelaide can Becky reach?", "answer": "Francesca", "steps": [ "Becky knows Daphne.", "Daphne knows Jill.", "Jill knows Ignacio.", "Ignacio knows Terry.", "Terry knows Levi.", "Levi knows Francesca." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Becky", "Levi", "Belinda", "Daphne", "Dudley", "Terry", "Ignacio", "Francesca", "Jill", "Camille", "Bennett", "Jay", "Eric", "Jeffery", "Leigh", "Dee", "Marie", "Adelaide", "Russell", "Israel" ], "edges": [ [ 0, 2 ], [ 0, 3 ], [ 1, 7 ], [ 3, 4 ], [ 3, 8 ], [ 3, 9 ], [ 5, 1 ], [ 6, 5 ], [ 8, 6 ], [ 10, 12 ], [ 10, 13 ], [ 11, 17 ], [ 13, 14 ], [ 13, 18 ], [ 13, 19 ], [ 15, 11 ], [ 16, 15 ], [ 18, 16 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Valerie knows Malcolm. Virgil knows Ava. Vincent knows Nora. Valerie knows Alicia. Nora knows Jacques. Alicia knows Vincent. Alicia knows Eugenia. Ava knows Lauren. Malcolm knows Tyler. Virgil knows Ember. Cameron knows Ivan. Warren knows Cameron. Malcolm knows Caleb. Cameron knows Peggy. Lauren knows Forrest. Warren knows Virgil. Jacques knows Leah. Forrest knows Gerard. Which of Jacques and Forrest can Warren reach?", "answer": "Forrest", "steps": [ "Warren knows Virgil.", "Virgil knows Ava.", "Ava knows Lauren.", "Lauren knows Forrest." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Warren", "Ember", "Ava", "Peggy", "Gerard", "Lauren", "Cameron", "Forrest", "Ivan", "Virgil", "Valerie", "Eugenia", "Vincent", "Caleb", "Leah", "Nora", "Malcolm", "Jacques", "Tyler", "Alicia" ], "edges": [ [ 0, 6 ], [ 0, 9 ], [ 2, 5 ], [ 5, 7 ], [ 6, 3 ], [ 6, 8 ], [ 7, 4 ], [ 9, 1 ], [ 9, 2 ], [ 10, 16 ], [ 10, 19 ], [ 12, 15 ], [ 15, 17 ], [ 16, 13 ], [ 16, 18 ], [ 17, 14 ], [ 19, 11 ], [ 19, 12 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Bennett knows Jeff. Aspen knows Israel. Aspen knows Gerald. Israel knows Everett. Jeff knows Della. Leland knows Saul. Leland knows Geoffrey. Grace knows Zane. Dora knows Bennett. Saul knows Lara. Geoffrey knows Gordon. Reid knows Dora. Yvette knows Fabian. Saul knows Malik. Malik knows Yvette. Everett knows Cesar. Zane knows Leland. Bennett knows Aspen. Which of Dora and Zane can Reid reach?", "answer": "Dora", "steps": [ "Reid knows Dora." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Reid", "Jeff", "Gerald", "Aspen", "Israel", "Della", "Bennett", "Cesar", "Dora", "Everett", "Grace", "Geoffrey", "Lara", "Saul", "Malik", "Gordon", "Leland", "Fabian", "Zane", "Yvette" ], "edges": [ [ 0, 8 ], [ 1, 5 ], [ 3, 2 ], [ 3, 4 ], [ 4, 9 ], [ 6, 1 ], [ 6, 3 ], [ 8, 6 ], [ 9, 7 ], [ 10, 18 ], [ 11, 15 ], [ 13, 12 ], [ 13, 14 ], [ 14, 19 ], [ 16, 11 ], [ 16, 13 ], [ 18, 16 ], [ 19, 17 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Patrick knows Brent. Lena knows Edgar. Leon knows Dustin. Shelby knows Xander. Dominic knows Lena. Monica knows Griffith. Edgar knows Pete. Patrick knows Monica. Everett knows Shelby. Monica knows Erin. Rocco knows Eloise. Xander knows Rocco. Shelby knows Kit. Griffith knows Dominic. Everett knows Brooks. Neville knows Patrick. Hazel knows Everett. Eloise knows Leon. Which of Shelby and Monica can Neville reach?", "answer": "Monica", "steps": [ "Neville knows Patrick.", "Patrick knows Monica." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Neville", "Pete", "Dominic", "Brent", "Lena", "Griffith", "Monica", "Erin", "Patrick", "Edgar", "Hazel", "Dustin", "Rocco", "Brooks", "Eloise", "Xander", "Shelby", "Kit", "Everett", "Leon" ], "edges": [ [ 0, 8 ], [ 2, 4 ], [ 4, 9 ], [ 5, 2 ], [ 6, 7 ], [ 6, 5 ], [ 8, 3 ], [ 8, 6 ], [ 9, 1 ], [ 10, 18 ], [ 12, 14 ], [ 14, 19 ], [ 15, 12 ], [ 16, 17 ], [ 16, 15 ], [ 18, 13 ], [ 18, 16 ], [ 19, 11 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Erin knows Brock. Isabel knows Terry. Trudy knows Gwen. Jameson knows Trudy. Terry knows Mabel. Yolanda knows Hadley. Jacqueline knows Zach. Jacqueline knows Yolanda. Hadley knows Isabel. Russ knows Cody. Hadley knows Erin. Jacqueline knows Rex. Gwen knows Judith. Victor knows Lee. Victor knows Fabian. Jameson knows Russ. Victor knows Brandon. Lee knows Jameson. Which of Yolanda and Lee can Jacqueline reach?", "answer": "Yolanda", "steps": [ "Jacqueline knows Yolanda." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Jacqueline", "Mabel", "Terry", "Hadley", "Yolanda", "Rex", "Erin", "Brock", "Zach", "Isabel", "Victor", "Judith", "Gwen", "Jameson", "Lee", "Brandon", "Russ", "Cody", "Fabian", "Trudy" ], "edges": [ [ 0, 5 ], [ 0, 8 ], [ 0, 4 ], [ 2, 1 ], [ 3, 6 ], [ 3, 9 ], [ 4, 3 ], [ 6, 7 ], [ 9, 2 ], [ 10, 15 ], [ 10, 18 ], [ 10, 14 ], [ 12, 11 ], [ 13, 16 ], [ 13, 19 ], [ 14, 13 ], [ 16, 17 ], [ 19, 12 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Brooks knows Laura. Jon knows Bonnie. James knows Emery. Brad knows Geraldine. Jon knows Brad. Geraldine knows Wyatt. Brad knows Reed. Laura knows Katrina. Reed knows Harlan. Candice knows Aiden. Wyatt knows Brooks. Chad knows Jasmine. Terrence knows Keegan. Keegan knows Chad. Terrence knows Dayton. Keegan knows Candice. Emery knows Helen. Jasmine knows James. Which of Brooks and James can Terrence reach?", "answer": "James", "steps": [ "Terrence knows Keegan.", "Keegan knows Chad.", "Chad knows Jasmine.", "Jasmine knows James." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Terrence", "Keegan", "Chad", "James", "Jasmine", "Dayton", "Aiden", "Candice", "Emery", "Helen", "Jon", "Brad", "Geraldine", "Brooks", "Wyatt", "Bonnie", "Harlan", "Reed", "Laura", "Katrina" ], "edges": [ [ 0, 5 ], [ 0, 1 ], [ 1, 7 ], [ 1, 2 ], [ 2, 4 ], [ 3, 8 ], [ 4, 3 ], [ 7, 6 ], [ 8, 9 ], [ 10, 15 ], [ 10, 11 ], [ 11, 17 ], [ 11, 12 ], [ 12, 14 ], [ 13, 18 ], [ 14, 13 ], [ 17, 16 ], [ 18, 19 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Trevor knows Lewis. Elodie knows Alfonso. Peggy knows Beth. Emery knows Pauline. Beth knows Landon. Alfonso knows Barney. Bert knows Arden. Emery knows Aubrey. Gail knows Peggy. Landon knows Lark. Alfonso knows Magdalena. Barney knows Trevor. Trevor knows Houston. Emery knows Gail. Houston knows Bert. Alfonso knows Mindy. Hannah knows Emery. Peggy knows Graham. Which of Alfonso and Emery can Elodie reach?", "answer": "Alfonso", "steps": [ "Elodie knows Alfonso." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Elodie", "Lewis", "Houston", "Mindy", "Alfonso", "Trevor", "Bert", "Magdalena", "Arden", "Barney", "Hannah", "Graham", "Beth", "Pauline", "Emery", "Peggy", "Landon", "Aubrey", "Lark", "Gail" ], "edges": [ [ 0, 4 ], [ 2, 6 ], [ 4, 3 ], [ 4, 7 ], [ 4, 9 ], [ 5, 1 ], [ 5, 2 ], [ 6, 8 ], [ 9, 5 ], [ 10, 14 ], [ 12, 16 ], [ 14, 13 ], [ 14, 17 ], [ 14, 19 ], [ 15, 11 ], [ 15, 12 ], [ 16, 18 ], [ 19, 15 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Fern knows Alma. Constance knows Sarah. Alma knows Ryan. Mack knows Fern. Alex knows Lisa. Steve knows Estelle. Estelle knows Alex. Jules knows Mack. Alex knows Constance. Steve knows Lisette. Ryan knows Sheila. Ryan knows Jolene. Haley knows Steve. Mack knows Chantal. Mack knows Wilbur. Constance knows Jewel. Steve knows Enid. Alma knows Bernard. Which of Alma and Alex can Haley reach?", "answer": "Alex", "steps": [ "Haley knows Steve.", "Steve knows Estelle.", "Estelle knows Alex." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Haley", "Sarah", "Constance", "Jewel", "Steve", "Alex", "Enid", "Lisa", "Lisette", "Estelle", "Jules", "Jolene", "Ryan", "Sheila", "Mack", "Alma", "Wilbur", "Bernard", "Chantal", "Fern" ], "edges": [ [ 0, 4 ], [ 2, 1 ], [ 2, 3 ], [ 4, 6 ], [ 4, 8 ], [ 4, 9 ], [ 5, 2 ], [ 5, 7 ], [ 9, 5 ], [ 10, 14 ], [ 12, 11 ], [ 12, 13 ], [ 14, 16 ], [ 14, 18 ], [ 14, 19 ], [ 15, 12 ], [ 15, 17 ], [ 19, 15 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Grady knows Dora. Clement knows Darcy. Daphna knows Kendra. Donovan knows Luz. Patrick knows Susan. Jude knows Patrick. Kristin knows Julius. Darcy knows Kane. Kendra knows Luther. Susan knows Sandra. Luz knows Rhonda. Sandra knows Clement. Eldon knows Kirsten. Rhonda knows Kristin. Luther knows Donovan. Rhonda knows Grady. Darcy knows Eldon. Kane knows Riley. Which of Kane and Grady can Daphna reach?", "answer": "Grady", "steps": [ "Daphna knows Kendra.", "Kendra knows Luther.", "Luther knows Donovan.", "Donovan knows Luz.", "Luz knows Rhonda.", "Rhonda knows Grady." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Daphna", "Julius", "Kristin", "Dora", "Grady", "Donovan", "Rhonda", "Luther", "Luz", "Kendra", "Jude", "Kirsten", "Eldon", "Riley", "Kane", "Sandra", "Darcy", "Susan", "Clement", "Patrick" ], "edges": [ [ 0, 9 ], [ 2, 1 ], [ 4, 3 ], [ 5, 8 ], [ 6, 2 ], [ 6, 4 ], [ 7, 5 ], [ 8, 6 ], [ 9, 7 ], [ 10, 19 ], [ 12, 11 ], [ 14, 13 ], [ 15, 18 ], [ 16, 12 ], [ 16, 14 ], [ 17, 15 ], [ 18, 16 ], [ 19, 17 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Zara knows Donna. Preston knows Albert. Erica knows Claudia. Preston knows Leon. Darla knows Randall. Glenn knows Erica. Barbara knows Zara. Emma knows Jared. Earle knows Emma. Leon knows Glenn. Jared knows Rena. Randall knows Earle. Claudia knows Blaine. Randall knows Lana. Kieran knows Kirsten. Rena knows Kieran. Earle knows Adam. Zara knows Preston. Which of Jared and Glenn can Barbara reach?", "answer": "Glenn", "steps": [ "Barbara knows Zara.", "Zara knows Preston.", "Preston knows Leon.", "Leon knows Glenn." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Barbara", "Blaine", "Albert", "Claudia", "Erica", "Donna", "Leon", "Glenn", "Preston", "Zara", "Darla", "Kirsten", "Adam", "Kieran", "Rena", "Lana", "Emma", "Jared", "Earle", "Randall" ], "edges": [ [ 0, 9 ], [ 3, 1 ], [ 4, 3 ], [ 6, 7 ], [ 7, 4 ], [ 8, 2 ], [ 8, 6 ], [ 9, 5 ], [ 9, 8 ], [ 10, 19 ], [ 13, 11 ], [ 14, 13 ], [ 16, 17 ], [ 17, 14 ], [ 18, 12 ], [ 18, 16 ], [ 19, 15 ], [ 19, 18 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Denver knows Cornelius. Damian knows Dewey. Destiny knows Lorraine. Pablo knows Molly. Denver knows Jack. Jordan knows Karina. Reed knows Owen. Destiny knows Jordan. Jordan knows Pablo. Denver knows Haley. Jordan knows Reed. Denver knows Damian. Jack knows Clyde. Keaton knows Shane. Keaton knows Denver. Luella knows Destiny. Paul knows Keaton. Jordan knows Flora. Which of Keaton and Destiny can Luella reach?", "answer": "Destiny", "steps": [ "Luella knows Destiny." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Luella", "Lorraine", "Destiny", "Molly", "Karina", "Jordan", "Reed", "Pablo", "Owen", "Flora", "Paul", "Shane", "Keaton", "Dewey", "Haley", "Denver", "Jack", "Damian", "Clyde", "Cornelius" ], "edges": [ [ 0, 2 ], [ 2, 1 ], [ 2, 5 ], [ 5, 4 ], [ 5, 7 ], [ 5, 6 ], [ 5, 9 ], [ 6, 8 ], [ 7, 3 ], [ 10, 12 ], [ 12, 11 ], [ 12, 15 ], [ 15, 14 ], [ 15, 17 ], [ 15, 16 ], [ 15, 19 ], [ 16, 18 ], [ 17, 13 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Rhonda knows Ruth. Daria knows Christian. Christian knows Renee. Morgan knows Dahlia. Marcia knows Ben. Morgan knows Forrest. Oliver knows Morgan. Graeme knows Louise. August knows Emery. Renee knows Graeme. Morgan knows Marcia. Daria knows Brock. Marcia knows Gustavo. Ruth knows Will. Bette knows August. Gustavo knows Bette. Ruth knows Daria. Ruth knows June. Which of Emery and Louise can Rhonda reach?", "answer": "Louise", "steps": [ "Rhonda knows Ruth.", "Ruth knows Daria.", "Daria knows Christian.", "Christian knows Renee.", "Renee knows Graeme.", "Graeme knows Louise." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Rhonda", "Graeme", "Brock", "Christian", "June", "Ruth", "Daria", "Renee", "Will", "Louise", "Oliver", "August", "Ben", "Gustavo", "Dahlia", "Morgan", "Marcia", "Bette", "Forrest", "Emery" ], "edges": [ [ 0, 5 ], [ 1, 9 ], [ 3, 7 ], [ 5, 4 ], [ 5, 8 ], [ 5, 6 ], [ 6, 2 ], [ 6, 3 ], [ 7, 1 ], [ 10, 15 ], [ 11, 19 ], [ 13, 17 ], [ 15, 14 ], [ 15, 18 ], [ 15, 16 ], [ 16, 12 ], [ 16, 13 ], [ 17, 11 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Blaine knows Rebecca. Rebecca knows Marc. Blaine knows Donovan. Marion knows Ross. Doris knows Bridget. Doris knows Inez. Rebecca knows Saul. Chester knows Haven. Tamara knows Lee. Jane knows Marion. Diego knows Lottie. Inez knows Chester. Keaton knows Blaine. Marc knows Tamara. Diego knows Doris. Lee knows Davis. Marc knows Rosa. Marion knows Diego. Which of Davis and Haven can Keaton reach?", "answer": "Davis", "steps": [ "Keaton knows Blaine.", "Blaine knows Rebecca.", "Rebecca knows Marc.", "Marc knows Tamara.", "Tamara knows Lee.", "Lee knows Davis." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Keaton", "Lee", "Tamara", "Marc", "Saul", "Davis", "Rebecca", "Rosa", "Donovan", "Blaine", "Jane", "Chester", "Inez", "Doris", "Lottie", "Haven", "Diego", "Bridget", "Ross", "Marion" ], "edges": [ [ 0, 9 ], [ 1, 5 ], [ 2, 1 ], [ 3, 2 ], [ 3, 7 ], [ 6, 4 ], [ 6, 3 ], [ 9, 6 ], [ 9, 8 ], [ 10, 19 ], [ 11, 15 ], [ 12, 11 ], [ 13, 12 ], [ 13, 17 ], [ 16, 14 ], [ 16, 13 ], [ 19, 16 ], [ 19, 18 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Hattie knows Archie. Freya knows Larry. Freya knows Nell. Georgia knows Keegan. Hattie knows June. Edward knows Barbara. Wallace knows Dallas. Jamie knows Kurt. Fanny knows Edward. Wallace knows Fanny. Larry knows Jamie. Wallace knows Olivia. Hattie knows Beau. Sonia knows Georgia. Georgia knows Rod. Jamie knows Theodore. Archie knows Freya. Edward knows Sonia. Which of Fanny and Archie can Hattie reach?", "answer": "Archie", "steps": [ "Hattie knows Archie." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Hattie", "Nell", "Archie", "Theodore", "June", "Larry", "Jamie", "Kurt", "Beau", "Freya", "Wallace", "Barbara", "Fanny", "Keegan", "Olivia", "Sonia", "Georgia", "Rod", "Dallas", "Edward" ], "edges": [ [ 0, 4 ], [ 0, 8 ], [ 0, 2 ], [ 2, 9 ], [ 5, 6 ], [ 6, 3 ], [ 6, 7 ], [ 9, 1 ], [ 9, 5 ], [ 10, 14 ], [ 10, 18 ], [ 10, 12 ], [ 12, 19 ], [ 15, 16 ], [ 16, 13 ], [ 16, 17 ], [ 19, 11 ], [ 19, 15 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Melody knows Adam. Gerald knows Landon. Darwin knows Evan. Gwen knows Gavin. Ariana knows Wanda. Jameson knows Tabitha. Fraser knows Ariana. Gavin knows Melody. Gavin knows Jameson. Darwin knows Omar. Darwin knows Fraser. Wendy knows Julia. Mario knows Darwin. Gavin knows Nadine. Melody knows Wendy. Adam knows Olive. Omar knows Greg. Fraser knows Gerald. Which of Fraser and Melody can Mario reach?", "answer": "Fraser", "steps": [ "Mario knows Darwin.", "Darwin knows Fraser." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Mario", "Ariana", "Darwin", "Landon", "Greg", "Omar", "Gerald", "Wanda", "Fraser", "Evan", "Gwen", "Wendy", "Gavin", "Olive", "Tabitha", "Jameson", "Adam", "Julia", "Melody", "Nadine" ], "edges": [ [ 0, 2 ], [ 1, 7 ], [ 2, 5 ], [ 2, 8 ], [ 2, 9 ], [ 5, 4 ], [ 6, 3 ], [ 8, 6 ], [ 8, 1 ], [ 10, 12 ], [ 11, 17 ], [ 12, 15 ], [ 12, 18 ], [ 12, 19 ], [ 15, 14 ], [ 16, 13 ], [ 18, 16 ], [ 18, 11 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Lisa knows Ruby. Marshall knows Iris. Barney knows Marshall. Ruby knows Aisha. Connor knows Shane. Eamon knows Denise. Marshall knows Justine. Shane knows Andre. Eugene knows Barney. Emily knows Kelsey. Justine knows Eamon. Ruby knows Emily. Holly knows Leland. Andre knows Camden. Willis knows Eugene. Aisha knows Connor. Eugene knows Holly. Connor knows Marcia. Which of Justine and Shane can Willis reach?", "answer": "Justine", "steps": [ "Willis knows Eugene.", "Eugene knows Barney.", "Barney knows Marshall.", "Marshall knows Justine." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Willis", "Denise", "Justine", "Barney", "Eamon", "Holly", "Iris", "Marshall", "Eugene", "Leland", "Lisa", "Camden", "Shane", "Aisha", "Andre", "Emily", "Marcia", "Connor", "Ruby", "Kelsey" ], "edges": [ [ 0, 8 ], [ 2, 4 ], [ 3, 7 ], [ 4, 1 ], [ 5, 9 ], [ 7, 2 ], [ 7, 6 ], [ 8, 3 ], [ 8, 5 ], [ 10, 18 ], [ 12, 14 ], [ 13, 17 ], [ 14, 11 ], [ 15, 19 ], [ 17, 12 ], [ 17, 16 ], [ 18, 13 ], [ 18, 15 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Emanuel knows Chance. Marshall knows Cooper. Gonzalo knows Jewel. Cooper knows Peggy. Chance knows Landon. Belinda knows Gonzalo. Devin knows Ted. Marshall knows Cornelius. Emanuel knows Wade. Landon knows Robin. Ted knows Edmund. Gonzalo knows Emanuel. Ted knows Teresa. Gonzalo knows Noah. Cooper knows Devin. Landon knows Blanche. Mildred knows Marshall. Marshall knows Dante. Which of Landon and Ted can Mildred reach?", "answer": "Ted", "steps": [ "Mildred knows Marshall.", "Marshall knows Cooper.", "Cooper knows Devin.", "Devin knows Ted." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Mildred", "Ted", "Peggy", "Edmund", "Dante", "Teresa", "Marshall", "Cooper", "Devin", "Cornelius", "Belinda", "Landon", "Wade", "Blanche", "Noah", "Robin", "Gonzalo", "Emanuel", "Chance", "Jewel" ], "edges": [ [ 0, 6 ], [ 1, 3 ], [ 1, 5 ], [ 6, 4 ], [ 6, 7 ], [ 6, 9 ], [ 7, 2 ], [ 7, 8 ], [ 8, 1 ], [ 10, 16 ], [ 11, 13 ], [ 11, 15 ], [ 16, 14 ], [ 16, 17 ], [ 16, 19 ], [ 17, 12 ], [ 17, 18 ], [ 18, 11 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Abel knows Fiona. Rosemary knows Annette. Trevor knows Archie. Geraldine knows Aubrey. Fiona knows Jamie. Archie knows Abel. Ken knows Trevor. Jamie knows Jorge. Thea knows Stefan. Dell knows Valerie. Archie knows Geraldine. Valerie knows Ford. Rosemary knows Porter. Stefan knows Rosemary. Annette knows Bernadette. Bernadette knows Edith. Porter knows Dell. Aubrey knows Fern. Which of Stefan and Trevor can Thea reach?", "answer": "Stefan", "steps": [ "Thea knows Stefan." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Thea", "Valerie", "Edith", "Porter", "Bernadette", "Rosemary", "Stefan", "Dell", "Annette", "Ford", "Ken", "Jamie", "Fern", "Abel", "Aubrey", "Archie", "Trevor", "Fiona", "Geraldine", "Jorge" ], "edges": [ [ 0, 6 ], [ 1, 9 ], [ 3, 7 ], [ 4, 2 ], [ 5, 8 ], [ 5, 3 ], [ 6, 5 ], [ 7, 1 ], [ 8, 4 ], [ 10, 16 ], [ 11, 19 ], [ 13, 17 ], [ 14, 12 ], [ 15, 18 ], [ 15, 13 ], [ 16, 15 ], [ 17, 11 ], [ 18, 14 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Zara knows Electra. Pearl knows Todd. Whitney knows Victoria. Pearl knows Morris. Zara knows Kirk. Morris knows Donald. Whitney knows Fabian. Pearl knows Dalton. Julian knows Pearl. Victoria knows Bella. Whitney knows Zara. Harold knows Whitney. Todd knows Beatrice. Todd knows Cody. Whitney knows Nicholas. Pearl knows Darrell. Donald knows Julio. Bella knows Betty. Which of Betty and Julio can Harold reach?", "answer": "Betty", "steps": [ "Harold knows Whitney.", "Whitney knows Victoria.", "Victoria knows Bella.", "Bella knows Betty." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Harold", "Whitney", "Zara", "Bella", "Betty", "Victoria", "Nicholas", "Fabian", "Electra", "Kirk", "Julian", "Pearl", "Todd", "Donald", "Julio", "Morris", "Dalton", "Darrell", "Cody", "Beatrice" ], "edges": [ [ 0, 1 ], [ 1, 5 ], [ 1, 6 ], [ 1, 7 ], [ 1, 2 ], [ 2, 8 ], [ 2, 9 ], [ 3, 4 ], [ 5, 3 ], [ 10, 11 ], [ 11, 15 ], [ 11, 16 ], [ 11, 17 ], [ 11, 12 ], [ 12, 18 ], [ 12, 19 ], [ 13, 14 ], [ 15, 13 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Marshall knows Hardy. Francesca knows Blair. Fred knows Goldie. Marshall knows Francesca. Julio knows Kaleb. Eugenia knows Claudia. Pedro knows Julio. Fred knows Noah. Claudia knows Marilyn. Eugenia knows Marshall. Blair knows Tony. Noah knows Geneva. Pedro knows Fred. Tony knows Vanessa. Goldie knows Parker. Parker knows Valerie. Hardy knows Beverly. Valerie knows Jessie. Which of Parker and Blair can Pedro reach?", "answer": "Parker", "steps": [ "Pedro knows Fred.", "Fred knows Goldie.", "Goldie knows Parker." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Pedro", "Kaleb", "Noah", "Julio", "Valerie", "Goldie", "Geneva", "Parker", "Jessie", "Fred", "Eugenia", "Marilyn", "Hardy", "Claudia", "Tony", "Francesca", "Beverly", "Blair", "Vanessa", "Marshall" ], "edges": [ [ 0, 3 ], [ 0, 9 ], [ 2, 6 ], [ 3, 1 ], [ 4, 8 ], [ 5, 7 ], [ 7, 4 ], [ 9, 2 ], [ 9, 5 ], [ 10, 13 ], [ 10, 19 ], [ 12, 16 ], [ 13, 11 ], [ 14, 18 ], [ 15, 17 ], [ 17, 14 ], [ 19, 12 ], [ 19, 15 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Dolores knows Walter. Theodore knows Crystal. Yvette knows Verna. Dolores knows Daisy. Hope knows Theodore. Tessa knows Carson. Theodore knows Dolores. Helene knows Willis. Carson knows Gary. Yvette knows Jesse. Tessa knows Cassidy. Randall knows Deborah. Carson knows Jill. Jem knows Tessa. Dolores knows Randall. Carson knows Yvette. Jesse knows Hannah. Randall knows Helene. Which of Jesse and Helene can Jem reach?", "answer": "Jesse", "steps": [ "Jem knows Tessa.", "Tessa knows Carson.", "Carson knows Yvette.", "Yvette knows Jesse." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Jem", "Jesse", "Jill", "Hannah", "Tessa", "Carson", "Verna", "Gary", "Cassidy", "Yvette", "Hope", "Helene", "Walter", "Willis", "Theodore", "Dolores", "Deborah", "Daisy", "Crystal", "Randall" ], "edges": [ [ 0, 4 ], [ 1, 3 ], [ 4, 8 ], [ 4, 5 ], [ 5, 2 ], [ 5, 7 ], [ 5, 9 ], [ 9, 1 ], [ 9, 6 ], [ 10, 14 ], [ 11, 13 ], [ 14, 18 ], [ 14, 15 ], [ 15, 12 ], [ 15, 17 ], [ 15, 19 ], [ 19, 11 ], [ 19, 16 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Clifford knows Jared. Sally knows Effie. Adam knows Shannon. Jane knows Wilson. Clayton knows Ignacio. Adam knows Jane. Clifford knows Jillian. Jake knows Adam. Wilson knows Pam. Ignacio knows Miles. Sally knows Juan. Clayton knows Edward. Kate knows Ray. Wilson knows Ada. Juan knows Clifford. Miles knows Sally. Simon knows Jake. Kate knows Simon. Which of Ignacio and Simon can Clayton reach?", "answer": "Ignacio", "steps": [ "Clayton knows Ignacio." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Clayton", "Sally", "Edward", "Clifford", "Jared", "Effie", "Jillian", "Juan", "Ignacio", "Miles", "Kate", "Adam", "Ray", "Wilson", "Pam", "Shannon", "Ada", "Jane", "Simon", "Jake" ], "edges": [ [ 0, 2 ], [ 0, 8 ], [ 1, 5 ], [ 1, 7 ], [ 3, 4 ], [ 3, 6 ], [ 7, 3 ], [ 8, 9 ], [ 9, 1 ], [ 10, 12 ], [ 10, 18 ], [ 11, 15 ], [ 11, 17 ], [ 13, 14 ], [ 13, 16 ], [ 17, 13 ], [ 18, 19 ], [ 19, 11 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Jolena knows Hailey. Cyrus knows George. Jennifer knows Kamila. Grady knows Keaton. Regina knows Cyrus. Hardy knows Regina. Virginia knows Marian. Grady knows Jolena. Brian knows Hardy. Brandon knows Virginia. Hailey knows Jennifer. Brandon knows Brian. Cyrus knows Lance. Keaton knows Lena. Kamila knows Clayton. Marian knows Paul. Lena knows Sheryl. Kamila knows Dominic. Which of Lance and Dominic can Grady reach?", "answer": "Dominic", "steps": [ "Grady knows Jolena.", "Jolena knows Hailey.", "Hailey knows Jennifer.", "Jennifer knows Kamila.", "Kamila knows Dominic." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Grady", "Jolena", "Jennifer", "Lena", "Sheryl", "Dominic", "Keaton", "Clayton", "Hailey", "Kamila", "Brandon", "Brian", "Regina", "Marian", "Paul", "Lance", "Virginia", "George", "Hardy", "Cyrus" ], "edges": [ [ 0, 6 ], [ 0, 1 ], [ 1, 8 ], [ 2, 9 ], [ 3, 4 ], [ 6, 3 ], [ 8, 2 ], [ 9, 5 ], [ 9, 7 ], [ 10, 16 ], [ 10, 11 ], [ 11, 18 ], [ 12, 19 ], [ 13, 14 ], [ 16, 13 ], [ 18, 12 ], [ 19, 15 ], [ 19, 17 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "James knows Boyd. Adelaide knows Clinton. Drew knows Dorothy. Jakob knows James. Adelaide knows Kurt. Brody knows Kai. Russ knows Renee. Aaron knows Adelaide. Drew knows Pete. Cynthia knows Jakob. Renee knows Lisette. Nora knows Brody. Rex knows Chelsea. Kai knows Cynthia. Chelsea knows Aaron. Lisette knows Rhonda. Rhonda knows Rex. Boyd knows Drew. Which of Drew and Adelaide can Nora reach?", "answer": "Drew", "steps": [ "Nora knows Brody.", "Brody knows Kai.", "Kai knows Cynthia.", "Cynthia knows Jakob.", "Jakob knows James.", "James knows Boyd.", "Boyd knows Drew." ], "difficulty": 7, "original_distance": 8, "idx_to_symbol": [ "Nora", "James", "Drew", "Dorothy", "Jakob", "Kai", "Brody", "Boyd", "Pete", "Cynthia", "Russ", "Chelsea", "Adelaide", "Kurt", "Rex", "Lisette", "Renee", "Aaron", "Clinton", "Rhonda" ], "edges": [ [ 0, 6 ], [ 1, 7 ], [ 2, 3 ], [ 2, 8 ], [ 4, 1 ], [ 5, 9 ], [ 6, 5 ], [ 7, 2 ], [ 9, 4 ], [ 10, 16 ], [ 11, 17 ], [ 12, 13 ], [ 12, 18 ], [ 14, 11 ], [ 15, 19 ], [ 16, 15 ], [ 17, 12 ], [ 19, 14 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Catherine knows Julie. Catherine knows Sybil. Denver knows Catherine. Carlos knows Eunice. Faith knows Robin. Robin knows Iris. Denver knows Carey. Sybil knows Homer. Lucy knows Dick. Faith knows Wayne. Clarence knows Charity. Eunice knows Lana. Kenzie knows Allan. Robin knows Clarence. Allan knows Lucy. Kenzie knows Faith. Elena knows Denver. Elena knows Carlos. Which of Charity and Homer can Elena reach?", "answer": "Homer", "steps": [ "Elena knows Denver.", "Denver knows Catherine.", "Catherine knows Sybil.", "Sybil knows Homer." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Elena", "Homer", "Carlos", "Lana", "Carey", "Eunice", "Denver", "Sybil", "Julie", "Catherine", "Kenzie", "Charity", "Allan", "Dick", "Wayne", "Lucy", "Faith", "Clarence", "Iris", "Robin" ], "edges": [ [ 0, 2 ], [ 0, 6 ], [ 2, 5 ], [ 5, 3 ], [ 6, 4 ], [ 6, 9 ], [ 7, 1 ], [ 9, 7 ], [ 9, 8 ], [ 10, 12 ], [ 10, 16 ], [ 12, 15 ], [ 15, 13 ], [ 16, 14 ], [ 16, 19 ], [ 17, 11 ], [ 19, 17 ], [ 19, 18 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Brynn knows Reid. Reid knows Chandler. Mindy knows Dell. Alyson knows Gonzalo. Dorian knows Alyson. Tracy knows Virgil. Margaret knows Brynn. Jim knows Dina. Hayes knows Dorian. Elena knows Julio. Dudley knows Diana. Diana knows Mindy. Virgil knows Margaret. Chandler knows Hayes. Simon knows Jim. Sean knows Simon. Julio knows Dudley. Dell knows Sean. Which of Dell and Chandler can Elena reach?", "answer": "Dell", "steps": [ "Elena knows Julio.", "Julio knows Dudley.", "Dudley knows Diana.", "Diana knows Mindy.", "Mindy knows Dell." ], "difficulty": 5, "original_distance": 9, "idx_to_symbol": [ "Elena", "Jim", "Simon", "Dudley", "Dina", "Dell", "Julio", "Diana", "Sean", "Mindy", "Tracy", "Alyson", "Dorian", "Margaret", "Gonzalo", "Chandler", "Virgil", "Brynn", "Hayes", "Reid" ], "edges": [ [ 0, 6 ], [ 1, 4 ], [ 2, 1 ], [ 3, 7 ], [ 5, 8 ], [ 6, 3 ], [ 7, 9 ], [ 8, 2 ], [ 9, 5 ], [ 10, 16 ], [ 11, 14 ], [ 12, 11 ], [ 13, 17 ], [ 15, 18 ], [ 16, 13 ], [ 17, 19 ], [ 18, 12 ], [ 19, 15 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Omar knows Floyd. Karl knows Lucia. Floyd knows Arden. Troy knows Kurt. Natalie knows Jana. Natalie knows Jared. Zack knows Louisa. Adelaide knows Casey. Victoria knows Earl. Floyd knows Julian. Lucia knows Dawn. Kevin knows Karl. Adelaide knows Zack. Omar knows Adelaide. Earl knows Logan. Casey knows Troy. Kevin knows Natalie. Karl knows Victoria. Which of Kurt and Logan can Kevin reach?", "answer": "Logan", "steps": [ "Kevin knows Karl.", "Karl knows Victoria.", "Victoria knows Earl.", "Earl knows Logan." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Kevin", "Jared", "Natalie", "Lucia", "Logan", "Victoria", "Jana", "Dawn", "Karl", "Earl", "Omar", "Julian", "Floyd", "Zack", "Kurt", "Casey", "Arden", "Louisa", "Adelaide", "Troy" ], "edges": [ [ 0, 2 ], [ 0, 8 ], [ 2, 1 ], [ 2, 6 ], [ 3, 7 ], [ 5, 9 ], [ 8, 3 ], [ 8, 5 ], [ 9, 4 ], [ 10, 12 ], [ 10, 18 ], [ 12, 11 ], [ 12, 16 ], [ 13, 17 ], [ 15, 19 ], [ 18, 13 ], [ 18, 15 ], [ 19, 14 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Sybil knows Bernadette. Finn knows India. India knows Faith. Sybil knows Hardy. Jose knows Sue. Finn knows Jose. Larry knows Arturo. Alyssa knows Logan. Pierce knows Larry. Arturo knows Sybil. Geraldine knows Lara. Sue knows Camille. Bernadette knows Elvira. Hardy knows Alyssa. Fern knows Geraldine. Bernadette knows Bella. Lara knows Finn. India knows Forrest. Which of Logan and Camille can Pierce reach?", "answer": "Logan", "steps": [ "Pierce knows Larry.", "Larry knows Arturo.", "Arturo knows Sybil.", "Sybil knows Hardy.", "Hardy knows Alyssa.", "Alyssa knows Logan." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Pierce", "Alyssa", "Hardy", "Logan", "Arturo", "Elvira", "Bella", "Sybil", "Bernadette", "Larry", "Fern", "Sue", "Jose", "Camille", "Lara", "Faith", "Forrest", "Finn", "India", "Geraldine" ], "edges": [ [ 0, 9 ], [ 1, 3 ], [ 2, 1 ], [ 4, 7 ], [ 7, 2 ], [ 7, 8 ], [ 8, 5 ], [ 8, 6 ], [ 9, 4 ], [ 10, 19 ], [ 11, 13 ], [ 12, 11 ], [ 14, 17 ], [ 17, 12 ], [ 17, 18 ], [ 18, 15 ], [ 18, 16 ], [ 19, 14 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Eden knows Viola. Marilyn knows Val. Eden knows Wanda. William knows Gwen. Hope knows Estella. Ella knows Dora. Colin knows Demetrius. Dora knows Marilyn. Hope knows Eden. Earle knows Hope. Jonah knows Colin. Marilyn knows Porter. Demetrius knows Ella. Pearl knows Earle. Harris knows Pearl. Dora knows William. Estella knows Cameron. Corinne knows Harris. Which of Marilyn and Eden can Corinne reach?", "answer": "Eden", "steps": [ "Corinne knows Harris.", "Harris knows Pearl.", "Pearl knows Earle.", "Earle knows Hope.", "Hope knows Eden." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Corinne", "Harris", "Hope", "Eden", "Estella", "Cameron", "Pearl", "Viola", "Earle", "Wanda", "Jonah", "Colin", "Dora", "Marilyn", "William", "Gwen", "Demetrius", "Val", "Ella", "Porter" ], "edges": [ [ 0, 1 ], [ 1, 6 ], [ 2, 4 ], [ 2, 3 ], [ 3, 7 ], [ 3, 9 ], [ 4, 5 ], [ 6, 8 ], [ 8, 2 ], [ 10, 11 ], [ 11, 16 ], [ 12, 14 ], [ 12, 13 ], [ 13, 17 ], [ 13, 19 ], [ 14, 15 ], [ 16, 18 ], [ 18, 12 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Marie knows Patrick. Mabel knows Donald. Clyde knows Marie. Carmen knows Mabel. Allison knows Carmen. Harmony knows Allison. Harriet knows Giselle. Kara knows Harriet. Yvette knows Kara. Kara knows Dawn. Carmen knows Keaton. Evan knows Yvette. Sierra knows Harmony. Harriet knows Clyde. Carmen knows Kamila. Allison knows Jill. Donald knows Jillian. Harriet knows Derrick. Which of Harriet and Carmen can Sierra reach?", "answer": "Carmen", "steps": [ "Sierra knows Harmony.", "Harmony knows Allison.", "Allison knows Carmen." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Sierra", "Keaton", "Donald", "Jill", "Mabel", "Carmen", "Kamila", "Allison", "Jillian", "Harmony", "Evan", "Giselle", "Marie", "Dawn", "Clyde", "Harriet", "Derrick", "Kara", "Patrick", "Yvette" ], "edges": [ [ 0, 9 ], [ 2, 8 ], [ 4, 2 ], [ 5, 1 ], [ 5, 6 ], [ 5, 4 ], [ 7, 3 ], [ 7, 5 ], [ 9, 7 ], [ 10, 19 ], [ 12, 18 ], [ 14, 12 ], [ 15, 11 ], [ 15, 16 ], [ 15, 14 ], [ 17, 13 ], [ 17, 15 ], [ 19, 17 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Doug knows Frank. Geraldine knows Alvin. Elmer knows Reid. Elmer knows Harry. Eugene knows Dell. Alfred knows Elmer. Mindy knows Walter. Adrian knows Aldo. Virgil knows Doug. Geraldine knows Mindy. Eugene knows Goldie. Virgil knows Alfred. Helen knows Eugene. Reid knows Estella. Aldo knows Virgil. Dell knows Geraldine. Goldie knows Garrett. Katherine knows Helen. Which of Walter and Estella can Katherine reach?", "answer": "Walter", "steps": [ "Katherine knows Helen.", "Helen knows Eugene.", "Eugene knows Dell.", "Dell knows Geraldine.", "Geraldine knows Mindy.", "Mindy knows Walter." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Katherine", "Eugene", "Garrett", "Walter", "Dell", "Geraldine", "Mindy", "Alvin", "Helen", "Goldie", "Adrian", "Virgil", "Frank", "Estella", "Alfred", "Elmer", "Reid", "Harry", "Aldo", "Doug" ], "edges": [ [ 0, 8 ], [ 1, 4 ], [ 1, 9 ], [ 4, 5 ], [ 5, 6 ], [ 5, 7 ], [ 6, 3 ], [ 8, 1 ], [ 9, 2 ], [ 10, 18 ], [ 11, 14 ], [ 11, 19 ], [ 14, 15 ], [ 15, 16 ], [ 15, 17 ], [ 16, 13 ], [ 18, 11 ], [ 19, 12 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" } ]