[ { "question": "Carol knows Hector. Dustin knows Kirsten. Regina knows Holly. Hadley knows Fisher. Holly knows Darrell. Darrell knows Hendrix. Russell knows Simon. Kirsten knows Morris. Regina knows Hailey. Hailey knows Hadley. Jocelyn knows Russell. Dana knows Julia. Kirsten knows Layla. Hendrix knows Dana. Morris knows Melanie. Dustin knows Jocelyn. Holly knows Diego. Melanie knows Carol. Which of Melanie and Hendrix can Dustin reach?", "answer": "Melanie", "steps": [ "Dustin knows Kirsten.", "Kirsten knows Morris.", "Morris knows Melanie." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Dustin", "Layla", "Melanie", "Simon", "Carol", "Kirsten", "Russell", "Morris", "Jocelyn", "Hector", "Regina", "Diego", "Hendrix", "Fisher", "Dana", "Holly", "Hadley", "Darrell", "Hailey", "Julia" ], "edges": [ [ 0, 8 ], [ 0, 5 ], [ 2, 4 ], [ 4, 9 ], [ 5, 1 ], [ 5, 7 ], [ 6, 3 ], [ 7, 2 ], [ 8, 6 ], [ 10, 18 ], [ 10, 15 ], [ 12, 14 ], [ 14, 19 ], [ 15, 11 ], [ 15, 17 ], [ 16, 13 ], [ 17, 12 ], [ 18, 16 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Alma knows Melody. Haley knows Gina. Tanya knows Kane. Yara knows Evan. Greer knows Zara. Kane knows Aaron. David knows Jenny. Tanya knows Maggie. Zara knows Tanya. Amanda knows Haley. Melody knows David. Maggie knows Bruce. Aaron knows Monroe. Greer knows Selena. Kane knows Uma. Yara knows Alma. Amanda knows Abby. Melody knows Amanda. Which of Aaron and Haley can Greer reach?", "answer": "Aaron", "steps": [ "Greer knows Zara.", "Zara knows Tanya.", "Tanya knows Kane.", "Kane knows Aaron." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Greer", "Zara", "Tanya", "Uma", "Kane", "Maggie", "Monroe", "Bruce", "Selena", "Aaron", "Yara", "Alma", "Melody", "Abby", "Amanda", "David", "Gina", "Jenny", "Evan", "Haley" ], "edges": [ [ 0, 8 ], [ 0, 1 ], [ 1, 2 ], [ 2, 5 ], [ 2, 4 ], [ 4, 3 ], [ 4, 9 ], [ 5, 7 ], [ 9, 6 ], [ 10, 18 ], [ 10, 11 ], [ 11, 12 ], [ 12, 15 ], [ 12, 14 ], [ 14, 13 ], [ 14, 19 ], [ 15, 17 ], [ 19, 16 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Karen knows Doris. Clinton knows Troy. Troy knows Luke. Elizabeth knows Paige. Faye knows Uma. Paige knows Alex. Faye knows Harold. Karen knows Julian. Harold knows Angelica. Alex knows Clinton. Clinton knows Karen. Wilma knows Bart. Bart knows Harlan. Uma knows Jermaine. Marvin knows Catherine. Doris knows Marlene. Uma knows Marvin. Harlan knows Faye. Which of Faye and Clinton can Elizabeth reach?", "answer": "Clinton", "steps": [ "Elizabeth knows Paige.", "Paige knows Alex.", "Alex knows Clinton." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Elizabeth", "Clinton", "Marlene", "Julian", "Alex", "Doris", "Karen", "Paige", "Luke", "Troy", "Wilma", "Faye", "Catherine", "Jermaine", "Harlan", "Marvin", "Uma", "Bart", "Angelica", "Harold" ], "edges": [ [ 0, 7 ], [ 1, 6 ], [ 1, 9 ], [ 4, 1 ], [ 5, 2 ], [ 6, 3 ], [ 6, 5 ], [ 7, 4 ], [ 9, 8 ], [ 10, 17 ], [ 11, 16 ], [ 11, 19 ], [ 14, 11 ], [ 15, 12 ], [ 16, 13 ], [ 16, 15 ], [ 17, 14 ], [ 19, 18 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Lottie knows Aisha. Harlan knows Jermaine. Conrad knows Francesca. Jim knows Alyson. Lisette knows Don. Lisette knows Lewis. Gail knows Benjamin. Lottie knows Janice. Rebecca knows Gail. Harlan knows Conrad. Jim knows Lottie. Alyson knows Bailey. Jermaine knows Donovan. Rebecca knows Elizabeth. Conrad knows Rebecca. Janice knows Lisette. Gail knows Jeremiah. Janice knows Carmen. Which of Lisette and Gail can Harlan reach?", "answer": "Gail", "steps": [ "Harlan knows Conrad.", "Conrad knows Rebecca.", "Rebecca knows Gail." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Harlan", "Conrad", "Jermaine", "Francesca", "Elizabeth", "Jeremiah", "Rebecca", "Donovan", "Benjamin", "Gail", "Jim", "Lottie", "Alyson", "Aisha", "Carmen", "Don", "Janice", "Bailey", "Lewis", "Lisette" ], "edges": [ [ 0, 2 ], [ 0, 1 ], [ 1, 3 ], [ 1, 6 ], [ 2, 7 ], [ 6, 4 ], [ 6, 9 ], [ 9, 5 ], [ 9, 8 ], [ 10, 12 ], [ 10, 11 ], [ 11, 13 ], [ 11, 16 ], [ 12, 17 ], [ 16, 14 ], [ 16, 19 ], [ 19, 15 ], [ 19, 18 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Hank knows Reed. Elmer knows Mindy. Zachary knows Langston. Blaine knows Finn. Finn knows Geoffrey. Xander knows Elmer. Reed knows Davis. Mindy knows Miriam. Davis knows Fanny. Xander knows Allen. Geoffrey knows Dolores. Zachary knows Val. Glen knows Essie. Celia knows Zachary. Carmen knows Xander. Dolores knows Carmen. Val knows Glen. Fanny knows Celia. Which of Geoffrey and Davis can Blaine reach?", "answer": "Geoffrey", "steps": [ "Blaine knows Finn.", "Finn knows Geoffrey." ], "difficulty": 2, "original_distance": 8, "idx_to_symbol": [ "Blaine", "Geoffrey", "Carmen", "Dolores", "Allen", "Miriam", "Elmer", "Xander", "Finn", "Mindy", "Hank", "Davis", "Celia", "Fanny", "Langston", "Essie", "Val", "Zachary", "Reed", "Glen" ], "edges": [ [ 0, 8 ], [ 1, 3 ], [ 2, 7 ], [ 3, 2 ], [ 6, 9 ], [ 7, 4 ], [ 7, 6 ], [ 8, 1 ], [ 9, 5 ], [ 10, 18 ], [ 11, 13 ], [ 12, 17 ], [ 13, 12 ], [ 16, 19 ], [ 17, 14 ], [ 17, 16 ], [ 18, 11 ], [ 19, 15 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Alma knows Melody. Haley knows Gina. Tanya knows Kane. Yara knows Evan. Greer knows Zara. Kane knows Aaron. David knows Jenny. Tanya knows Maggie. Zara knows Tanya. Amanda knows Haley. Melody knows David. Maggie knows Bruce. Aaron knows Monroe. Greer knows Selena. Kane knows Uma. Yara knows Alma. Amanda knows Abby. Melody knows Amanda. Which of Amanda and Kane can Greer reach?", "answer": "Kane", "steps": [ "Greer knows Zara.", "Zara knows Tanya.", "Tanya knows Kane." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Greer", "Zara", "Tanya", "Uma", "Kane", "Maggie", "Monroe", "Bruce", "Selena", "Aaron", "Yara", "Alma", "Melody", "Abby", "Amanda", "David", "Gina", "Jenny", "Evan", "Haley" ], "edges": [ [ 0, 8 ], [ 0, 1 ], [ 1, 2 ], [ 2, 5 ], [ 2, 4 ], [ 4, 3 ], [ 4, 9 ], [ 5, 7 ], [ 9, 6 ], [ 10, 18 ], [ 10, 11 ], [ 11, 12 ], [ 12, 15 ], [ 12, 14 ], [ 14, 13 ], [ 14, 19 ], [ 15, 17 ], [ 19, 16 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Vernon knows Paula. Electra knows Don. Greer knows Iris. Kate knows Seth. Electra knows Jakob. Gus knows Electra. April knows Greer. Paula knows Nolan. Electra knows Harry. Kate knows Milton. James knows Peggy. Kate knows Travis. Electra knows Ann. Corey knows Kate. April knows Corey. Kate knows James. Vernon knows Gus. Don knows Thomas. Which of Don and James can April reach?", "answer": "James", "steps": [ "April knows Corey.", "Corey knows Kate.", "Kate knows James." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "April", "Kate", "Milton", "Seth", "Corey", "Iris", "Greer", "Travis", "James", "Peggy", "Vernon", "Electra", "Harry", "Ann", "Gus", "Nolan", "Paula", "Jakob", "Don", "Thomas" ], "edges": [ [ 0, 6 ], [ 0, 4 ], [ 1, 2 ], [ 1, 3 ], [ 1, 7 ], [ 1, 8 ], [ 4, 1 ], [ 6, 5 ], [ 8, 9 ], [ 10, 16 ], [ 10, 14 ], [ 11, 12 ], [ 11, 13 ], [ 11, 17 ], [ 11, 18 ], [ 14, 11 ], [ 16, 15 ], [ 18, 19 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Myrtle knows Malcolm. Gladys knows John. Courtney knows Mindy. Rosemary knows Sylvia. Geraldine knows Neil. Lacey knows Edwin. Geraldine knows Gladys. Juan knows Rosemary. Gladys knows Kendrick. Neil knows Luna. Kendrick knows Zane. Gladys knows Eric. Kendrick knows Courtney. Myrtle knows Juan. Juan knows Gary. Juan knows Kay. Rosemary knows Lacey. Malcolm knows Elton. Which of Mindy and Edwin can Geraldine reach?", "answer": "Mindy", "steps": [ "Geraldine knows Gladys.", "Gladys knows Kendrick.", "Kendrick knows Courtney.", "Courtney knows Mindy." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Geraldine", "Gladys", "Kendrick", "John", "Mindy", "Eric", "Neil", "Zane", "Luna", "Courtney", "Myrtle", "Juan", "Rosemary", "Gary", "Edwin", "Kay", "Malcolm", "Sylvia", "Elton", "Lacey" ], "edges": [ [ 0, 6 ], [ 0, 1 ], [ 1, 3 ], [ 1, 5 ], [ 1, 2 ], [ 2, 7 ], [ 2, 9 ], [ 6, 8 ], [ 9, 4 ], [ 10, 16 ], [ 10, 11 ], [ 11, 13 ], [ 11, 15 ], [ 11, 12 ], [ 12, 17 ], [ 12, 19 ], [ 16, 18 ], [ 19, 14 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Veronica knows Dell. Forrest knows Keegan. Barney knows Claudia. Lara knows Chloe. Dell knows Yvette. Chloe knows Paige. Yvette knows Margaret. Keegan knows Barney. Claudia knows Nina. Hope knows Mason. Courtney knows Hope. Claudia knows Courtney. Forrest knows Lamar. Eva knows Jeff. Jeff knows Veronica. Jeff knows Winston. Yvette knows Lara. Dale knows Forrest. Which of Claudia and Yvette can Dale reach?", "answer": "Claudia", "steps": [ "Dale knows Forrest.", "Forrest knows Keegan.", "Keegan knows Barney.", "Barney knows Claudia." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Dale", "Courtney", "Lamar", "Claudia", "Mason", "Keegan", "Barney", "Hope", "Nina", "Forrest", "Eva", "Lara", "Winston", "Yvette", "Paige", "Veronica", "Dell", "Chloe", "Margaret", "Jeff" ], "edges": [ [ 0, 9 ], [ 1, 7 ], [ 3, 1 ], [ 3, 8 ], [ 5, 6 ], [ 6, 3 ], [ 7, 4 ], [ 9, 2 ], [ 9, 5 ], [ 10, 19 ], [ 11, 17 ], [ 13, 11 ], [ 13, 18 ], [ 15, 16 ], [ 16, 13 ], [ 17, 14 ], [ 19, 12 ], [ 19, 15 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Russ knows Bennett. Walt knows Harley. Russ knows Aria. Ramona knows Serena. Ford knows Selena. Serena knows Andrew. Harris knows Ramona. Jewel knows Chantal. Humphrey knows Carson. Ford knows Walt. Jose knows Russ. Selena knows Humphrey. Alison knows Jewel. Jewel knows Harris. Bennett knows Ford. Goldie knows Lewis. Hank knows Goldie. Ramona knows Hank. Which of Harris and Bennett can Alison reach?", "answer": "Harris", "steps": [ "Alison knows Jewel.", "Jewel knows Harris." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Alison", "Harris", "Jewel", "Serena", "Lewis", "Chantal", "Ramona", "Andrew", "Hank", "Goldie", "Jose", "Bennett", "Russ", "Walt", "Carson", "Aria", "Ford", "Harley", "Selena", "Humphrey" ], "edges": [ [ 0, 2 ], [ 1, 6 ], [ 2, 5 ], [ 2, 1 ], [ 3, 7 ], [ 6, 3 ], [ 6, 8 ], [ 8, 9 ], [ 9, 4 ], [ 10, 12 ], [ 11, 16 ], [ 12, 15 ], [ 12, 11 ], [ 13, 17 ], [ 16, 13 ], [ 16, 18 ], [ 18, 19 ], [ 19, 14 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Julie knows Ted. Terry knows Sharon. Terry knows Julius. Jamie knows Judy. Leah knows Charity. Felicia knows Terry. Gerald knows Barney. Ted knows Gerald. Jamie knows Bridget. Jamie knows James. Gerald knows Hendrix. Gerald knows Felicia. Harriet knows Leah. Leah knows Basil. Terry knows Ashton. Stefan knows Jamie. Leah knows Stefan. Keegan knows Harriet. Which of Harriet and Ted can Julie reach?", "answer": "Ted", "steps": [ "Julie knows Ted." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Julie", "Barney", "Julius", "Terry", "Ashton", "Sharon", "Felicia", "Hendrix", "Gerald", "Ted", "Keegan", "Charity", "James", "Jamie", "Judy", "Bridget", "Stefan", "Basil", "Leah", "Harriet" ], "edges": [ [ 0, 9 ], [ 3, 2 ], [ 3, 4 ], [ 3, 5 ], [ 6, 3 ], [ 8, 1 ], [ 8, 6 ], [ 8, 7 ], [ 9, 8 ], [ 10, 19 ], [ 13, 12 ], [ 13, 14 ], [ 13, 15 ], [ 16, 13 ], [ 18, 11 ], [ 18, 16 ], [ 18, 17 ], [ 19, 18 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Frida knows Gonzalo. Nadine knows Greta. Shannon knows Harley. George knows Raymond. Carlton knows Celia. Carol knows Carlton. Nadine knows Kenzie. Gonzalo knows George. Joel knows Riley. Carlton knows Bryan. Robert knows Kennedy. Gonzalo knows Shannon. Shannon knows Jorge. Celia knows Jessica. Carol knows Nadine. Riley knows Carol. Gemma knows Frida. George knows Robert. Which of George and Carlton can Gemma reach?", "answer": "George", "steps": [ "Gemma knows Frida.", "Frida knows Gonzalo.", "Gonzalo knows George." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Gemma", "Raymond", "Frida", "Harley", "George", "Shannon", "Robert", "Kennedy", "Jorge", "Gonzalo", "Joel", "Bryan", "Riley", "Kenzie", "Carlton", "Nadine", "Celia", "Jessica", "Greta", "Carol" ], "edges": [ [ 0, 2 ], [ 2, 9 ], [ 4, 1 ], [ 4, 6 ], [ 5, 3 ], [ 5, 8 ], [ 6, 7 ], [ 9, 4 ], [ 9, 5 ], [ 10, 12 ], [ 12, 19 ], [ 14, 11 ], [ 14, 16 ], [ 15, 13 ], [ 15, 18 ], [ 16, 17 ], [ 19, 14 ], [ 19, 15 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Maggie knows Darrell. Willis knows India. Clara knows Joseph. Cassidy knows Clara. India knows Cassidy. Joseph knows Juan. Megan knows Mabel. Mabel knows Carrie. Megan knows Marshall. Joseph knows Alvin. Theodore knows Megan. Theodore knows Jules. Clarissa knows Theodore. Mabel knows Leroy. Cassidy knows Charlene. Clara knows Maggie. Marshall knows Dirk. Riley knows Clarissa. Which of Cassidy and Theodore can Riley reach?", "answer": "Theodore", "steps": [ "Riley knows Clarissa.", "Clarissa knows Theodore." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Riley", "Marshall", "Mabel", "Dirk", "Clarissa", "Leroy", "Jules", "Megan", "Carrie", "Theodore", "Willis", "Maggie", "Joseph", "Darrell", "India", "Juan", "Charlene", "Clara", "Alvin", "Cassidy" ], "edges": [ [ 0, 4 ], [ 1, 3 ], [ 2, 5 ], [ 2, 8 ], [ 4, 9 ], [ 7, 1 ], [ 7, 2 ], [ 9, 6 ], [ 9, 7 ], [ 10, 14 ], [ 11, 13 ], [ 12, 15 ], [ 12, 18 ], [ 14, 19 ], [ 17, 11 ], [ 17, 12 ], [ 19, 16 ], [ 19, 17 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Cynthia knows Fisher. Zane knows Milo. Blanche knows Zane. Ernest knows Jewel. Shane knows Ernest. Dawn knows Shelly. Dawn knows Shane. Fisher knows Pedro. Pedro knows Joseph. Shelly knows Troy. Ariana knows Lloyd. Fisher knows Fern. Joseph knows Ruth. Lance knows Ariana. Lloyd knows Molly. Jewel knows Hector. Pedro knows Lance. Zane knows Dawn. Which of Shane and Lance can Cynthia reach?", "answer": "Lance", "steps": [ "Cynthia knows Fisher.", "Fisher knows Pedro.", "Pedro knows Lance." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Cynthia", "Pedro", "Joseph", "Fisher", "Lance", "Ruth", "Lloyd", "Fern", "Ariana", "Molly", "Blanche", "Dawn", "Shelly", "Zane", "Shane", "Troy", "Jewel", "Milo", "Ernest", "Hector" ], "edges": [ [ 0, 3 ], [ 1, 2 ], [ 1, 4 ], [ 2, 5 ], [ 3, 7 ], [ 3, 1 ], [ 4, 8 ], [ 6, 9 ], [ 8, 6 ], [ 10, 13 ], [ 11, 12 ], [ 11, 14 ], [ 12, 15 ], [ 13, 17 ], [ 13, 11 ], [ 14, 18 ], [ 16, 19 ], [ 18, 16 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Holly knows Mara. Luz knows Sandy. Clara knows Gail. Wallace knows Chelsea. Terrence knows Dewey. Chelsea knows Christopher. Grady knows Chester. Humphrey knows Luz. Chelsea knows Dina. Chester knows Terrence. Sandy knows Clara. Grady knows Humphrey. Pam knows Wallace. Clara knows Shaun. Yolanda knows Ellis. Francis knows Pam. Ellis knows Holly. Yolanda knows Francis. Which of Wallace and Sandy can Yolanda reach?", "answer": "Wallace", "steps": [ "Yolanda knows Francis.", "Francis knows Pam.", "Pam knows Wallace." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Yolanda", "Pam", "Wallace", "Mara", "Christopher", "Holly", "Chelsea", "Ellis", "Dina", "Francis", "Grady", "Luz", "Sandy", "Dewey", "Shaun", "Terrence", "Clara", "Chester", "Gail", "Humphrey" ], "edges": [ [ 0, 7 ], [ 0, 9 ], [ 1, 2 ], [ 2, 6 ], [ 5, 3 ], [ 6, 4 ], [ 6, 8 ], [ 7, 5 ], [ 9, 1 ], [ 10, 17 ], [ 10, 19 ], [ 11, 12 ], [ 12, 16 ], [ 15, 13 ], [ 16, 14 ], [ 16, 18 ], [ 17, 15 ], [ 19, 11 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Cole knows Deanna. Heather knows Anthony. Lawrence knows Cole. Odette knows Harry. Rachel knows Valerie. Harry knows Rachel. Valerie knows Brittany. Carl knows Ramon. Cole knows Carl. Anthony knows Lawrence. Dewey knows Ebony. Ebony knows Odette. Rachel knows Jodi. Valerie knows Kate. Valerie knows Annette. Taylor knows Heather. Carl knows Madeline. Carl knows Marlene. Which of Anthony and Odette can Dewey reach?", "answer": "Odette", "steps": [ "Dewey knows Ebony.", "Ebony knows Odette." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Dewey", "Odette", "Annette", "Valerie", "Harry", "Rachel", "Ebony", "Jodi", "Brittany", "Kate", "Taylor", "Anthony", "Madeline", "Carl", "Lawrence", "Cole", "Heather", "Deanna", "Ramon", "Marlene" ], "edges": [ [ 0, 6 ], [ 1, 4 ], [ 3, 2 ], [ 3, 8 ], [ 3, 9 ], [ 4, 5 ], [ 5, 7 ], [ 5, 3 ], [ 6, 1 ], [ 10, 16 ], [ 11, 14 ], [ 13, 12 ], [ 13, 18 ], [ 13, 19 ], [ 14, 15 ], [ 15, 17 ], [ 15, 13 ], [ 16, 11 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Clay knows Colleen. Carla knows Atlas. Tim knows Curtis. Colleen knows Agnes. Bart knows Carla. Jessie knows Xavier. Martha knows Emmett. Carla knows Walter. Colleen knows Eldon. Atlas knows Tim. Agnes knows Eleanor. Atlas knows Basil. Lewis knows Devon. Colleen knows Lewis. Marvin knows Clay. Carla knows Jessie. Nash knows Bart. Lewis knows Martha. Which of Colleen and Carla can Nash reach?", "answer": "Carla", "steps": [ "Nash knows Bart.", "Bart knows Carla." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Nash", "Basil", "Xavier", "Carla", "Atlas", "Walter", "Bart", "Tim", "Jessie", "Curtis", "Marvin", "Devon", "Eleanor", "Colleen", "Lewis", "Eldon", "Clay", "Martha", "Agnes", "Emmett" ], "edges": [ [ 0, 6 ], [ 3, 5 ], [ 3, 8 ], [ 3, 4 ], [ 4, 1 ], [ 4, 7 ], [ 6, 3 ], [ 7, 9 ], [ 8, 2 ], [ 10, 16 ], [ 13, 15 ], [ 13, 18 ], [ 13, 14 ], [ 14, 11 ], [ 14, 17 ], [ 16, 13 ], [ 17, 19 ], [ 18, 12 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "April knows Rick. Gemma knows Fred. Fred knows Agnes. Vernon knows Cassidy. Val knows Lamont. Vernon knows Crystal. Val knows Nicole. Barry knows Eva. Gemma knows Verna. Agnes knows Val. Thomas knows Barry. Barry knows Vernon. April knows Sydney. Gemma knows Victor. Lyric knows Gemma. Fred knows Gustavo. Barry knows Lorna. Crystal knows April. Which of Fred and Vernon can Thomas reach?", "answer": "Vernon", "steps": [ "Thomas knows Barry.", "Barry knows Vernon." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Thomas", "Eva", "Rick", "Sydney", "April", "Lorna", "Barry", "Crystal", "Cassidy", "Vernon", "Lyric", "Verna", "Nicole", "Lamont", "Val", "Victor", "Gemma", "Agnes", "Gustavo", "Fred" ], "edges": [ [ 0, 6 ], [ 4, 2 ], [ 4, 3 ], [ 6, 1 ], [ 6, 5 ], [ 6, 9 ], [ 7, 4 ], [ 9, 7 ], [ 9, 8 ], [ 10, 16 ], [ 14, 12 ], [ 14, 13 ], [ 16, 11 ], [ 16, 15 ], [ 16, 19 ], [ 17, 14 ], [ 19, 17 ], [ 19, 18 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Hannah knows Clarissa. Terrence knows Amelia. Dawn knows Norma. Estella knows Eldon. Amelia knows Livia. Livia knows Daphna. Will knows Elise. Clarissa knows Estella. Hannah knows Arnold. Norma knows Jennifer. Jennifer knows Hannah. Jennifer knows Bernard. Amelia knows Marco. Livia knows Olivia. Olivia knows Marion. Olivia knows Karla. Marion knows Will. Norma knows Marvin. Which of Will and Estella can Terrence reach?", "answer": "Will", "steps": [ "Terrence knows Amelia.", "Amelia knows Livia.", "Livia knows Olivia.", "Olivia knows Marion.", "Marion knows Will." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Terrence", "Marion", "Olivia", "Will", "Marco", "Amelia", "Daphna", "Karla", "Elise", "Livia", "Dawn", "Clarissa", "Hannah", "Estella", "Marvin", "Norma", "Bernard", "Arnold", "Eldon", "Jennifer" ], "edges": [ [ 0, 5 ], [ 1, 3 ], [ 2, 7 ], [ 2, 1 ], [ 3, 8 ], [ 5, 4 ], [ 5, 9 ], [ 9, 6 ], [ 9, 2 ], [ 10, 15 ], [ 11, 13 ], [ 12, 17 ], [ 12, 11 ], [ 13, 18 ], [ 15, 14 ], [ 15, 19 ], [ 19, 16 ], [ 19, 12 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Aaron knows Robert. Keira knows Bonnie. Doug knows Kim. Aubrey knows Roy. Aaron knows Doug. Hector knows Blake. Robert knows Keith. Lydia knows George. Evan knows Aaron. Roy knows Hector. Blake knows Keira. Doug knows Kirk. Chance knows Evan. Blake knows Luz. Kim knows Russ. Luz knows Percy. Joyce knows Chance. Luz knows Lydia. Which of Luz and Doug can Joyce reach?", "answer": "Doug", "steps": [ "Joyce knows Chance.", "Chance knows Evan.", "Evan knows Aaron.", "Aaron knows Doug." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Joyce", "Keith", "Kirk", "Robert", "Doug", "Russ", "Aaron", "Chance", "Evan", "Kim", "Aubrey", "Bonnie", "Percy", "Keira", "Luz", "George", "Blake", "Roy", "Hector", "Lydia" ], "edges": [ [ 0, 7 ], [ 3, 1 ], [ 4, 2 ], [ 4, 9 ], [ 6, 3 ], [ 6, 4 ], [ 7, 8 ], [ 8, 6 ], [ 9, 5 ], [ 10, 17 ], [ 13, 11 ], [ 14, 12 ], [ 14, 19 ], [ 16, 13 ], [ 16, 14 ], [ 17, 18 ], [ 18, 16 ], [ 19, 15 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Liam knows Eleanor. Gilbert knows Milton. Xander knows India. Tracy knows Liam. Gilbert knows Harvey. Jesse knows Brooke. Evan knows Carlton. Nolan knows Sheryl. Harvey knows Chance. Evan knows Noah. Brooke knows Nolan. Liam knows Fisher. Milton knows Tracy. Evan knows Arden. Alejandro knows Gilbert. Sheryl knows Evan. Liam knows Pat. Brooke knows Xander. Which of Tracy and Sheryl can Alejandro reach?", "answer": "Tracy", "steps": [ "Alejandro knows Gilbert.", "Gilbert knows Milton.", "Milton knows Tracy." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Alejandro", "Gilbert", "Liam", "Pat", "Eleanor", "Chance", "Milton", "Harvey", "Tracy", "Fisher", "Jesse", "Brooke", "Evan", "Noah", "Arden", "India", "Nolan", "Xander", "Sheryl", "Carlton" ], "edges": [ [ 0, 1 ], [ 1, 7 ], [ 1, 6 ], [ 2, 3 ], [ 2, 4 ], [ 2, 9 ], [ 6, 8 ], [ 7, 5 ], [ 8, 2 ], [ 10, 11 ], [ 11, 17 ], [ 11, 16 ], [ 12, 13 ], [ 12, 14 ], [ 12, 19 ], [ 16, 18 ], [ 17, 15 ], [ 18, 12 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Emery knows Megan. Elvis knows Dayton. Lyric knows Jon. Nadine knows Lyric. Kerry knows Ainsley. Callum knows Nadine. Judith knows Carter. Lyric knows Andre. Elvis knows Leroy. Elvis knows Kerry. Megan knows Nelson. Andre knows Keira. Callum knows Bridget. Dayton knows Alex. Bridget knows Yolanda. Leroy knows Emery. Callum knows Judith. Emery knows Grover. Which of Lyric and Emery can Elvis reach?", "answer": "Emery", "steps": [ "Elvis knows Leroy.", "Leroy knows Emery." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Elvis", "Leroy", "Grover", "Kerry", "Emery", "Dayton", "Nelson", "Ainsley", "Megan", "Alex", "Callum", "Nadine", "Jon", "Bridget", "Lyric", "Judith", "Keira", "Yolanda", "Andre", "Carter" ], "edges": [ [ 0, 3 ], [ 0, 1 ], [ 0, 5 ], [ 1, 4 ], [ 3, 7 ], [ 4, 2 ], [ 4, 8 ], [ 5, 9 ], [ 8, 6 ], [ 10, 13 ], [ 10, 11 ], [ 10, 15 ], [ 11, 14 ], [ 13, 17 ], [ 14, 12 ], [ 14, 18 ], [ 15, 19 ], [ 18, 16 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Lara knows Livia. Cliff knows Alicia. Flora knows Lillian. Corey knows Alvin. Bailey knows Brenda. Flora knows Fabian. Lillian knows Noel. Faith knows Curtis. Noel knows Jasper. Bailey knows Brynn. Livia knows Rocco. Corey knows Faith. Cliff knows Lara. Brynn knows Sue. Corey knows Cliff. Brynn knows James. Bailey knows Flora. Faith knows Valerie. Which of Cliff and Flora can Corey reach?", "answer": "Cliff", "steps": [ "Corey knows Cliff." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Corey", "Cliff", "Rocco", "Alicia", "Lara", "Curtis", "Faith", "Valerie", "Alvin", "Livia", "Bailey", "Flora", "Jasper", "Fabian", "Lillian", "James", "Brynn", "Sue", "Brenda", "Noel" ], "edges": [ [ 0, 6 ], [ 0, 8 ], [ 0, 1 ], [ 1, 3 ], [ 1, 4 ], [ 4, 9 ], [ 6, 5 ], [ 6, 7 ], [ 9, 2 ], [ 10, 16 ], [ 10, 18 ], [ 10, 11 ], [ 11, 13 ], [ 11, 14 ], [ 14, 19 ], [ 16, 15 ], [ 16, 17 ], [ 19, 12 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Courtney knows Selena. Stacy knows Vance. Marlene knows Colette. Ernie knows Peggy. Louis knows Edna. Selena knows Hector. Colette knows Marian. Peggy knows Stacy. Yasmin knows Enid. Dewey knows Courtney. Vance knows Hugh. Daphne knows Iris. Hector knows Audrey. Edna knows Ted. Audrey knows Marlene. Peggy knows Daphne. Ted knows Ernie. Audrey knows Yasmin. Which of Selena and Ted can Dewey reach?", "answer": "Selena", "steps": [ "Dewey knows Courtney.", "Courtney knows Selena." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Dewey", "Hector", "Marian", "Yasmin", "Selena", "Colette", "Enid", "Audrey", "Courtney", "Marlene", "Louis", "Ernie", "Hugh", "Daphne", "Ted", "Vance", "Iris", "Peggy", "Edna", "Stacy" ], "edges": [ [ 0, 8 ], [ 1, 7 ], [ 3, 6 ], [ 4, 1 ], [ 5, 2 ], [ 7, 3 ], [ 7, 9 ], [ 8, 4 ], [ 9, 5 ], [ 10, 18 ], [ 11, 17 ], [ 13, 16 ], [ 14, 11 ], [ 15, 12 ], [ 17, 13 ], [ 17, 19 ], [ 18, 14 ], [ 19, 15 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Denise knows Eldon. Gene knows Denise. Chad knows Shelby. Chad knows Erwin. Gertrude knows Hank. Reed knows Lottie. Gertrude knows James. Jane knows Claire. Chad knows Gene. James knows Nelson. Nelson knows Enrique. Claire knows Gordon. Kimberly knows Chad. Kimberly knows Reed. Gertrude knows Kendra. Lottie knows Alexa. Jane knows Gertrude. Gordon knows Kane. Which of Gertrude and Chad can Jane reach?", "answer": "Gertrude", "steps": [ "Jane knows Gertrude." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Jane", "Gertrude", "Kane", "Enrique", "Claire", "Hank", "Kendra", "James", "Nelson", "Gordon", "Kimberly", "Chad", "Alexa", "Eldon", "Reed", "Erwin", "Shelby", "Gene", "Denise", "Lottie" ], "edges": [ [ 0, 1 ], [ 0, 4 ], [ 1, 5 ], [ 1, 6 ], [ 1, 7 ], [ 4, 9 ], [ 7, 8 ], [ 8, 3 ], [ 9, 2 ], [ 10, 11 ], [ 10, 14 ], [ 11, 15 ], [ 11, 16 ], [ 11, 17 ], [ 14, 19 ], [ 17, 18 ], [ 18, 13 ], [ 19, 12 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Jakob knows Wilma. Darren knows Marcia. Foster knows Yara. Julio knows Jakob. Elvis knows Dora. Ruth knows Darren. Julius knows Enrique. Abel knows Ingrid. Elvis knows Abel. Darren knows Elvis. Bernadette knows Ruth. Blaine knows Bernadette. Jeremiah knows Julius. Dora knows Jolene. Yara knows Jeremiah. Julio knows Glenn. Julius knows Julio. Glenn knows Clement. Which of Julio and Elvis can Foster reach?", "answer": "Julio", "steps": [ "Foster knows Yara.", "Yara knows Jeremiah.", "Jeremiah knows Julius.", "Julius knows Julio." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Foster", "Wilma", "Enrique", "Jakob", "Clement", "Julio", "Glenn", "Yara", "Jeremiah", "Julius", "Blaine", "Ingrid", "Marcia", "Abel", "Jolene", "Elvis", "Dora", "Bernadette", "Ruth", "Darren" ], "edges": [ [ 0, 7 ], [ 3, 1 ], [ 5, 3 ], [ 5, 6 ], [ 6, 4 ], [ 7, 8 ], [ 8, 9 ], [ 9, 2 ], [ 9, 5 ], [ 10, 17 ], [ 13, 11 ], [ 15, 13 ], [ 15, 16 ], [ 16, 14 ], [ 17, 18 ], [ 18, 19 ], [ 19, 12 ], [ 19, 15 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Elodie knows June. Ellis knows Alan. Kelly knows Stanley. Sheila knows Henry. Mason knows Kelly. Elliot knows Ellis. Kelly knows Hailey. Hugh knows Graeme. Elvira knows Sheila. Mason knows Boyd. Kelly knows Stephanie. Denver knows Leah. Boyd knows Hugh. Bert knows Denver. Denver knows Elliot. Bert knows Elvira. Stephanie knows Elodie. Denver knows Cruz. Which of Alan and June can Bert reach?", "answer": "Alan", "steps": [ "Bert knows Denver.", "Denver knows Elliot.", "Elliot knows Ellis.", "Ellis knows Alan." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Bert", "Alan", "Henry", "Sheila", "Cruz", "Ellis", "Elliot", "Elvira", "Leah", "Denver", "Mason", "June", "Graeme", "Hugh", "Stanley", "Elodie", "Stephanie", "Boyd", "Hailey", "Kelly" ], "edges": [ [ 0, 7 ], [ 0, 9 ], [ 3, 2 ], [ 5, 1 ], [ 6, 5 ], [ 7, 3 ], [ 9, 4 ], [ 9, 6 ], [ 9, 8 ], [ 10, 17 ], [ 10, 19 ], [ 13, 12 ], [ 15, 11 ], [ 16, 15 ], [ 17, 13 ], [ 19, 14 ], [ 19, 16 ], [ 19, 18 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Fred knows Chase. Karla knows Peggy. Kobe knows Hayes. Luke knows Karla. Dylan knows Patrick. Dylan knows Melody. Clay knows Dylan. Melody knows Ernest. Elijah knows Christopher. Dylan knows Kobe. Kobe knows Luke. Ernesto knows Ashley. Elijah knows Fred. Alder knows Pete. Irma knows Ernesto. Elijah knows Alder. Andrea knows Elijah. Fred knows Irma. Which of Peggy and Ashley can Andrea reach?", "answer": "Ashley", "steps": [ "Andrea knows Elijah.", "Elijah knows Fred.", "Fred knows Irma.", "Irma knows Ernesto.", "Ernesto knows Ashley." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Andrea", "Fred", "Ernesto", "Irma", "Chase", "Elijah", "Christopher", "Alder", "Pete", "Ashley", "Clay", "Kobe", "Karla", "Luke", "Hayes", "Dylan", "Patrick", "Melody", "Ernest", "Peggy" ], "edges": [ [ 0, 5 ], [ 1, 4 ], [ 1, 3 ], [ 2, 9 ], [ 3, 2 ], [ 5, 6 ], [ 5, 7 ], [ 5, 1 ], [ 7, 8 ], [ 10, 15 ], [ 11, 14 ], [ 11, 13 ], [ 12, 19 ], [ 13, 12 ], [ 15, 16 ], [ 15, 17 ], [ 15, 11 ], [ 17, 18 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Hannah knows Clarissa. Terrence knows Amelia. Dawn knows Norma. Estella knows Eldon. Amelia knows Livia. Livia knows Daphna. Will knows Elise. Clarissa knows Estella. Hannah knows Arnold. Norma knows Jennifer. Jennifer knows Hannah. Jennifer knows Bernard. Amelia knows Marco. Livia knows Olivia. Olivia knows Marion. Olivia knows Karla. Marion knows Will. Norma knows Marvin. Which of Jennifer and Livia can Terrence reach?", "answer": "Livia", "steps": [ "Terrence knows Amelia.", "Amelia knows Livia." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Terrence", "Marion", "Olivia", "Will", "Marco", "Amelia", "Daphna", "Karla", "Elise", "Livia", "Dawn", "Clarissa", "Hannah", "Estella", "Marvin", "Norma", "Bernard", "Arnold", "Eldon", "Jennifer" ], "edges": [ [ 0, 5 ], [ 1, 3 ], [ 2, 7 ], [ 2, 1 ], [ 3, 8 ], [ 5, 4 ], [ 5, 9 ], [ 9, 6 ], [ 9, 2 ], [ 10, 15 ], [ 11, 13 ], [ 12, 17 ], [ 12, 11 ], [ 13, 18 ], [ 15, 14 ], [ 15, 19 ], [ 19, 16 ], [ 19, 12 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Raymond knows Florence. Esperanza knows Cliff. Dolores knows David. Cliff knows Harley. Esperanza knows Carla. Porter knows Raymond. Kevin knows Spencer. Porter knows Penny. Cliff knows Gerard. Cliff knows Gertrude. Carla knows Kevin. Raymond knows Vera. Vera knows Jeff. Jeff knows Kyle. Brent knows Trevor. Penny knows Dolores. Harley knows Brent. Raymond knows Larissa. Which of Brent and Jeff can Porter reach?", "answer": "Jeff", "steps": [ "Porter knows Raymond.", "Raymond knows Vera.", "Vera knows Jeff." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Porter", "Jeff", "Raymond", "Vera", "Larissa", "Dolores", "David", "Florence", "Penny", "Kyle", "Esperanza", "Brent", "Cliff", "Harley", "Gertrude", "Kevin", "Spencer", "Gerard", "Carla", "Trevor" ], "edges": [ [ 0, 8 ], [ 0, 2 ], [ 1, 9 ], [ 2, 4 ], [ 2, 7 ], [ 2, 3 ], [ 3, 1 ], [ 5, 6 ], [ 8, 5 ], [ 10, 18 ], [ 10, 12 ], [ 11, 19 ], [ 12, 14 ], [ 12, 17 ], [ 12, 13 ], [ 13, 11 ], [ 15, 16 ], [ 18, 15 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Tyler knows Regina. Alfonso knows Greg. Patrick knows Tyler. Regina knows Etta. Russell knows Seth. Deirdre knows Hayley. Etta knows Raquel. Frances knows Alfonso. Regina knows Russell. Alfonso knows Bob. Axel knows Lars. Deirdre knows Frances. Patrick knows Blair. Hayley knows Miranda. Raquel knows Cara. Raquel knows Winifred. Lars knows Deirdre. Axel knows Jordan. Which of Etta and Frances can Patrick reach?", "answer": "Etta", "steps": [ "Patrick knows Tyler.", "Tyler knows Regina.", "Regina knows Etta." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Patrick", "Russell", "Tyler", "Cara", "Seth", "Regina", "Etta", "Raquel", "Winifred", "Blair", "Axel", "Hayley", "Lars", "Bob", "Miranda", "Deirdre", "Frances", "Alfonso", "Greg", "Jordan" ], "edges": [ [ 0, 2 ], [ 0, 9 ], [ 1, 4 ], [ 2, 5 ], [ 5, 1 ], [ 5, 6 ], [ 6, 7 ], [ 7, 3 ], [ 7, 8 ], [ 10, 12 ], [ 10, 19 ], [ 11, 14 ], [ 12, 15 ], [ 15, 11 ], [ 15, 16 ], [ 16, 17 ], [ 17, 13 ], [ 17, 18 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Lara knows Lucia. Philip knows Clement. Clement knows Karla. Caleb knows Laverne. Clement knows Lenora. Lucia knows Travis. Jane knows Lara. Colleen knows Jane. Philip knows Caleb. Lucia knows Monroe. Dora knows Emily. Laverne knows Joel. Lara knows Mack. Taylor knows Abel. Laverne knows Riley. Taylor knows Lee. Emily knows Philip. Mack knows Taylor. Which of Mack and Caleb can Colleen reach?", "answer": "Mack", "steps": [ "Colleen knows Jane.", "Jane knows Lara.", "Lara knows Mack." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Colleen", "Lee", "Mack", "Monroe", "Travis", "Jane", "Abel", "Lucia", "Lara", "Taylor", "Dora", "Riley", "Caleb", "Karla", "Lenora", "Emily", "Joel", "Clement", "Philip", "Laverne" ], "edges": [ [ 0, 5 ], [ 2, 9 ], [ 5, 8 ], [ 7, 3 ], [ 7, 4 ], [ 8, 7 ], [ 8, 2 ], [ 9, 1 ], [ 9, 6 ], [ 10, 15 ], [ 12, 19 ], [ 15, 18 ], [ 17, 13 ], [ 17, 14 ], [ 18, 17 ], [ 18, 12 ], [ 19, 11 ], [ 19, 16 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Burt knows Beth. Langston knows Jamie. Ford knows Kelly. Enrique knows Langston. Langston knows Whitney. Jamie knows Anita. Eunice knows Robin. Langston knows Dakota. Enrique knows Adelaide. Anita knows Burt. Kelly knows Eunice. Jamie knows Belinda. Eunice knows Ilene. Ilene knows Sue. Ford knows Bob. Sue knows Harold. Kelly knows Jem. Kelly knows Nora. Which of Beth and Harold can Ford reach?", "answer": "Harold", "steps": [ "Ford knows Kelly.", "Kelly knows Eunice.", "Eunice knows Ilene.", "Ilene knows Sue.", "Sue knows Harold." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Ford", "Harold", "Eunice", "Nora", "Jem", "Kelly", "Bob", "Ilene", "Robin", "Sue", "Enrique", "Beth", "Jamie", "Whitney", "Dakota", "Langston", "Adelaide", "Anita", "Belinda", "Burt" ], "edges": [ [ 0, 6 ], [ 0, 5 ], [ 2, 8 ], [ 2, 7 ], [ 5, 3 ], [ 5, 4 ], [ 5, 2 ], [ 7, 9 ], [ 9, 1 ], [ 10, 16 ], [ 10, 15 ], [ 12, 18 ], [ 12, 17 ], [ 15, 13 ], [ 15, 14 ], [ 15, 12 ], [ 17, 19 ], [ 19, 11 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Zack knows Jesse. Ezra knows Veronica. Diane knows Vivian. Malik knows Paige. Elijah knows Elliot. Jenny knows Corinne. Malik knows Hope. Charlene knows Joseph. Corinne knows Jane. Diane knows Charlene. Vivian knows Erwin. Jenny knows Ezra. Zack knows Malik. Elijah knows Keira. Joseph knows Elijah. Elliot knows Sarah. Elliot knows Opal. Jane knows Zack. Which of Corinne and Charlene can Jenny reach?", "answer": "Corinne", "steps": [ "Jenny knows Corinne." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Jenny", "Corinne", "Paige", "Hope", "Veronica", "Malik", "Ezra", "Zack", "Jane", "Jesse", "Diane", "Charlene", "Sarah", "Opal", "Erwin", "Elliot", "Vivian", "Elijah", "Joseph", "Keira" ], "edges": [ [ 0, 6 ], [ 0, 1 ], [ 1, 8 ], [ 5, 2 ], [ 5, 3 ], [ 6, 4 ], [ 7, 5 ], [ 7, 9 ], [ 8, 7 ], [ 10, 16 ], [ 10, 11 ], [ 11, 18 ], [ 15, 12 ], [ 15, 13 ], [ 16, 14 ], [ 17, 15 ], [ 17, 19 ], [ 18, 17 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Jorge knows Willis. Willis knows Gonzalo. Dolores knows Barry. Jorge knows Jocelyn. Grace knows Dane. Dane knows Aurora. Deirdre knows Grace. Lacey knows Jorge. Dolores knows Deirdre. Jeanne knows Iris. Jeanne knows Georgia. Willis knows Jeanne. Grace knows Harris. Deirdre knows Boris. Lacey knows Leah. Dane knows Geoffrey. Barry knows Agnes. Leah knows Donald. Which of Dane and Jeanne can Dolores reach?", "answer": "Dane", "steps": [ "Dolores knows Deirdre.", "Deirdre knows Grace.", "Grace knows Dane." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Dolores", "Dane", "Grace", "Agnes", "Geoffrey", "Barry", "Boris", "Aurora", "Harris", "Deirdre", "Lacey", "Jeanne", "Willis", "Donald", "Georgia", "Leah", "Jocelyn", "Iris", "Gonzalo", "Jorge" ], "edges": [ [ 0, 5 ], [ 0, 9 ], [ 1, 4 ], [ 1, 7 ], [ 2, 1 ], [ 2, 8 ], [ 5, 3 ], [ 9, 6 ], [ 9, 2 ], [ 10, 15 ], [ 10, 19 ], [ 11, 14 ], [ 11, 17 ], [ 12, 11 ], [ 12, 18 ], [ 15, 13 ], [ 19, 16 ], [ 19, 12 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Freya knows Everett. Gonzalo knows Hardy. Freya knows Kay. Morgan knows Houston. Hannah knows Elton. Will knows Evelyn. Everett knows Hannah. Hardy knows Morgan. Beverly knows Harper. Zach knows Preston. Morgan knows Beth. Kay knows Beverly. Walt knows Katherine. Gonzalo knows Zach. Preston knows Will. Elton knows Diana. Beverly knows Walt. Houston knows Herbert. Which of Herbert and Katherine can Freya reach?", "answer": "Katherine", "steps": [ "Freya knows Kay.", "Kay knows Beverly.", "Beverly knows Walt.", "Walt knows Katherine." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Freya", "Beverly", "Kay", "Diana", "Everett", "Harper", "Walt", "Elton", "Katherine", "Hannah", "Gonzalo", "Morgan", "Hardy", "Evelyn", "Zach", "Beth", "Houston", "Will", "Herbert", "Preston" ], "edges": [ [ 0, 2 ], [ 0, 4 ], [ 1, 5 ], [ 1, 6 ], [ 2, 1 ], [ 4, 9 ], [ 6, 8 ], [ 7, 3 ], [ 9, 7 ], [ 10, 12 ], [ 10, 14 ], [ 11, 15 ], [ 11, 16 ], [ 12, 11 ], [ 14, 19 ], [ 16, 18 ], [ 17, 13 ], [ 19, 17 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Jonathan knows Keira. Loretta knows Finn. Loretta knows Cody. Kara knows Duke. Regina knows Elijah. Regina knows Essie. Wallace knows Kara. Lamar knows Loretta. Kara knows Lamar. Jocelyn knows Chance. Barney knows Mae. Lamar knows Burt. Jocelyn knows Cliff. Essie knows Jocelyn. Essie knows Nancy. Regina knows Jonathan. Elvira knows Regina. Kara knows Barney. Which of Regina and Kara can Wallace reach?", "answer": "Kara", "steps": [ "Wallace knows Kara." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Wallace", "Duke", "Finn", "Mae", "Lamar", "Loretta", "Burt", "Kara", "Cody", "Barney", "Elvira", "Elijah", "Cliff", "Keira", "Essie", "Jocelyn", "Nancy", "Regina", "Chance", "Jonathan" ], "edges": [ [ 0, 7 ], [ 4, 6 ], [ 4, 5 ], [ 5, 2 ], [ 5, 8 ], [ 7, 1 ], [ 7, 4 ], [ 7, 9 ], [ 9, 3 ], [ 10, 17 ], [ 14, 16 ], [ 14, 15 ], [ 15, 12 ], [ 15, 18 ], [ 17, 11 ], [ 17, 14 ], [ 17, 19 ], [ 19, 13 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Jeff knows Harrison. Deirdre knows Camille. Joanna knows Marvin. Fergus knows Virginia. Molly knows Melody. Dayton knows Jennifer. Jonathan knows Dayton. Molly knows Dina. Joanna knows Molly. Patrick knows Naomi. Melody knows Ainsley. Naomi knows Pablo. Jeff knows Fergus. Corey knows Deirdre. Molly knows Patrick. Ainsley knows Tina. Fergus knows Corey. Fergus knows Jonathan. Which of Fergus and Molly can Jeff reach?", "answer": "Fergus", "steps": [ "Jeff knows Fergus." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Jeff", "Corey", "Virginia", "Jennifer", "Deirdre", "Camille", "Harrison", "Jonathan", "Fergus", "Dayton", "Joanna", "Melody", "Dina", "Pablo", "Ainsley", "Tina", "Marvin", "Patrick", "Molly", "Naomi" ], "edges": [ [ 0, 6 ], [ 0, 8 ], [ 1, 4 ], [ 4, 5 ], [ 7, 9 ], [ 8, 2 ], [ 8, 1 ], [ 8, 7 ], [ 9, 3 ], [ 10, 16 ], [ 10, 18 ], [ 11, 14 ], [ 14, 15 ], [ 17, 19 ], [ 18, 12 ], [ 18, 11 ], [ 18, 17 ], [ 19, 13 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Alfonso knows Florence. Ben knows Charlene. Dexter knows Ingrid. Garrett knows Hank. Florence knows Norman. Oliver knows Vance. Vance knows Victoria. Vance knows Dexter. George knows Deirdre. Jake knows Garrett. George knows Ivy. Garrett knows Cole. Ivy knows Ben. Jake knows Fisher. Eva knows Jake. Dexter knows George. Cole knows Gordon. Cole knows Alfonso. Which of Ben and Florence can Eva reach?", "answer": "Florence", "steps": [ "Eva knows Jake.", "Jake knows Garrett.", "Garrett knows Cole.", "Cole knows Alfonso.", "Alfonso knows Florence." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Eva", "Cole", "Gordon", "Alfonso", "Norman", "Fisher", "Florence", "Jake", "Hank", "Garrett", "Oliver", "George", "Deirdre", "Ivy", "Charlene", "Victoria", "Ben", "Vance", "Ingrid", "Dexter" ], "edges": [ [ 0, 7 ], [ 1, 2 ], [ 1, 3 ], [ 3, 6 ], [ 6, 4 ], [ 7, 5 ], [ 7, 9 ], [ 9, 1 ], [ 9, 8 ], [ 10, 17 ], [ 11, 12 ], [ 11, 13 ], [ 13, 16 ], [ 16, 14 ], [ 17, 15 ], [ 17, 19 ], [ 19, 11 ], [ 19, 18 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Ira knows Hayes. Farrah knows Perry. Hayes knows Gareth. Paula knows Jude. Allison knows Jolena. Dell knows Xavier. Gareth knows Esme. August knows Lily. Jolena knows Avery. Jude knows August. Rick knows Farrah. Kurt knows Essie. Perry knows Allison. Jude knows Leopold. Kurt knows Rick. Rick knows Dell. Leopold knows Ira. Paula knows Priscilla. Which of Farrah and Leopold can Kurt reach?", "answer": "Farrah", "steps": [ "Kurt knows Rick.", "Rick knows Farrah." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Kurt", "Jolena", "Rick", "Xavier", "Dell", "Allison", "Perry", "Farrah", "Essie", "Avery", "Paula", "Gareth", "Jude", "Lily", "August", "Hayes", "Ira", "Leopold", "Priscilla", "Esme" ], "edges": [ [ 0, 8 ], [ 0, 2 ], [ 1, 9 ], [ 2, 4 ], [ 2, 7 ], [ 4, 3 ], [ 5, 1 ], [ 6, 5 ], [ 7, 6 ], [ 10, 18 ], [ 10, 12 ], [ 11, 19 ], [ 12, 14 ], [ 12, 17 ], [ 14, 13 ], [ 15, 11 ], [ 16, 15 ], [ 17, 16 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Holly knows Mara. Luz knows Sandy. Clara knows Gail. Wallace knows Chelsea. Terrence knows Dewey. Chelsea knows Christopher. Grady knows Chester. Humphrey knows Luz. Chelsea knows Dina. Chester knows Terrence. Sandy knows Clara. Grady knows Humphrey. Pam knows Wallace. Clara knows Shaun. Yolanda knows Ellis. Francis knows Pam. Ellis knows Holly. Yolanda knows Francis. Which of Chelsea and Clara can Yolanda reach?", "answer": "Chelsea", "steps": [ "Yolanda knows Francis.", "Francis knows Pam.", "Pam knows Wallace.", "Wallace knows Chelsea." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Yolanda", "Pam", "Wallace", "Mara", "Christopher", "Holly", "Chelsea", "Ellis", "Dina", "Francis", "Grady", "Luz", "Sandy", "Dewey", "Shaun", "Terrence", "Clara", "Chester", "Gail", "Humphrey" ], "edges": [ [ 0, 7 ], [ 0, 9 ], [ 1, 2 ], [ 2, 6 ], [ 5, 3 ], [ 6, 4 ], [ 6, 8 ], [ 7, 5 ], [ 9, 1 ], [ 10, 17 ], [ 10, 19 ], [ 11, 12 ], [ 12, 16 ], [ 15, 13 ], [ 16, 14 ], [ 16, 18 ], [ 17, 15 ], [ 19, 11 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Susanne knows Knox. Jana knows Jamie. Thea knows Sydney. Sydney knows Larissa. Kobe knows Percy. Knox knows Irene. Percy knows Jeanette. Thea knows Whitney. Shane knows Kobe. Knox knows Jem. Percy knows Howard. Jem knows Thea. Ethan knows Shane. Shane knows Clay. Ashley knows Kelly. Jeanette knows Jack. Jana knows Susanne. Ashley knows Ethan. Which of Percy and Thea can Jana reach?", "answer": "Thea", "steps": [ "Jana knows Susanne.", "Susanne knows Knox.", "Knox knows Jem.", "Jem knows Thea." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Jana", "Jamie", "Thea", "Irene", "Larissa", "Whitney", "Sydney", "Jem", "Knox", "Susanne", "Ashley", "Kelly", "Percy", "Clay", "Jack", "Howard", "Jeanette", "Kobe", "Shane", "Ethan" ], "edges": [ [ 0, 1 ], [ 0, 9 ], [ 2, 5 ], [ 2, 6 ], [ 6, 4 ], [ 7, 2 ], [ 8, 3 ], [ 8, 7 ], [ 9, 8 ], [ 10, 11 ], [ 10, 19 ], [ 12, 15 ], [ 12, 16 ], [ 16, 14 ], [ 17, 12 ], [ 18, 13 ], [ 18, 17 ], [ 19, 18 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Nolan knows Keaton. Jim knows Fraser. Jim knows Davis. Davis knows Kara. Hayden knows Alvin. Hayden knows Archie. Nolan knows Lee. Nolan knows Tonya. Hayden knows Effie. Brody knows Nolan. Beth knows Hardy. Beth knows Loretta. Davis knows Homer. Effie knows Norma. Fraser knows Hayden. Karina knows Brody. Tonya knows Kenneth. Karina knows Beth. Which of Tonya and Effie can Karina reach?", "answer": "Tonya", "steps": [ "Karina knows Brody.", "Brody knows Nolan.", "Nolan knows Tonya." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Karina", "Lee", "Loretta", "Kenneth", "Keaton", "Brody", "Beth", "Nolan", "Tonya", "Hardy", "Jim", "Alvin", "Kara", "Norma", "Archie", "Fraser", "Davis", "Hayden", "Effie", "Homer" ], "edges": [ [ 0, 5 ], [ 0, 6 ], [ 5, 7 ], [ 6, 2 ], [ 6, 9 ], [ 7, 1 ], [ 7, 4 ], [ 7, 8 ], [ 8, 3 ], [ 10, 15 ], [ 10, 16 ], [ 15, 17 ], [ 16, 12 ], [ 16, 19 ], [ 17, 11 ], [ 17, 14 ], [ 17, 18 ], [ 18, 13 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Courtney knows Selena. Stacy knows Vance. Marlene knows Colette. Ernie knows Peggy. Louis knows Edna. Selena knows Hector. Colette knows Marian. Peggy knows Stacy. Yasmin knows Enid. Dewey knows Courtney. Vance knows Hugh. Daphne knows Iris. Hector knows Audrey. Edna knows Ted. Audrey knows Marlene. Peggy knows Daphne. Ted knows Ernie. Audrey knows Yasmin. Which of Stacy and Marlene can Dewey reach?", "answer": "Marlene", "steps": [ "Dewey knows Courtney.", "Courtney knows Selena.", "Selena knows Hector.", "Hector knows Audrey.", "Audrey knows Marlene." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Dewey", "Hector", "Marian", "Yasmin", "Selena", "Colette", "Enid", "Audrey", "Courtney", "Marlene", "Louis", "Ernie", "Hugh", "Daphne", "Ted", "Vance", "Iris", "Peggy", "Edna", "Stacy" ], "edges": [ [ 0, 8 ], [ 1, 7 ], [ 3, 6 ], [ 4, 1 ], [ 5, 2 ], [ 7, 3 ], [ 7, 9 ], [ 8, 4 ], [ 9, 5 ], [ 10, 18 ], [ 11, 17 ], [ 13, 16 ], [ 14, 11 ], [ 15, 12 ], [ 17, 13 ], [ 17, 19 ], [ 18, 14 ], [ 19, 15 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Jonathan knows Keira. Loretta knows Finn. Loretta knows Cody. Kara knows Duke. Regina knows Elijah. Regina knows Essie. Wallace knows Kara. Lamar knows Loretta. Kara knows Lamar. Jocelyn knows Chance. Barney knows Mae. Lamar knows Burt. Jocelyn knows Cliff. Essie knows Jocelyn. Essie knows Nancy. Regina knows Jonathan. Elvira knows Regina. Kara knows Barney. Which of Essie and Lamar can Wallace reach?", "answer": "Lamar", "steps": [ "Wallace knows Kara.", "Kara knows Lamar." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Wallace", "Duke", "Finn", "Mae", "Lamar", "Loretta", "Burt", "Kara", "Cody", "Barney", "Elvira", "Elijah", "Cliff", "Keira", "Essie", "Jocelyn", "Nancy", "Regina", "Chance", "Jonathan" ], "edges": [ [ 0, 7 ], [ 4, 6 ], [ 4, 5 ], [ 5, 2 ], [ 5, 8 ], [ 7, 1 ], [ 7, 4 ], [ 7, 9 ], [ 9, 3 ], [ 10, 17 ], [ 14, 16 ], [ 14, 15 ], [ 15, 12 ], [ 15, 18 ], [ 17, 11 ], [ 17, 14 ], [ 17, 19 ], [ 19, 13 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Jordan knows Emma. Duncan knows Jacqueline. Gina knows Jerome. Russ knows Gina. Emma knows Pat. Gina knows Griffith. Emma knows Conrad. Paula knows Homer. Pat knows Mabel. Mabel knows Russ. Jacqueline knows Cyrus. Daniella knows Fergus. Daniella knows Gabe. Lillian knows Daniella. Jacqueline knows Paula. Gina knows Mae. Homer knows Lillian. Daniella knows Elvira. Which of Russ and Lillian can Duncan reach?", "answer": "Lillian", "steps": [ "Duncan knows Jacqueline.", "Jacqueline knows Paula.", "Paula knows Homer.", "Homer knows Lillian." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Duncan", "Daniella", "Paula", "Homer", "Jacqueline", "Gabe", "Fergus", "Elvira", "Lillian", "Cyrus", "Jordan", "Gina", "Pat", "Mabel", "Emma", "Mae", "Griffith", "Jerome", "Russ", "Conrad" ], "edges": [ [ 0, 4 ], [ 1, 5 ], [ 1, 6 ], [ 1, 7 ], [ 2, 3 ], [ 3, 8 ], [ 4, 2 ], [ 4, 9 ], [ 8, 1 ], [ 10, 14 ], [ 11, 15 ], [ 11, 16 ], [ 11, 17 ], [ 12, 13 ], [ 13, 18 ], [ 14, 12 ], [ 14, 19 ], [ 18, 11 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Darren knows Hunter. Lee knows Dick. Howard knows Cordelia. Howard knows Lee. Diana knows Inez. Herman knows Lorenzo. Howard knows Conrad. Lorenzo knows Paula. Dick knows Janet. Conrad knows Uma. Howard knows Cody. Herman knows Rebecca. Dick knows Emmett. Paula knows Hampton. Emmett knows Duncan. Herman knows Louis. Paula knows Diana. Herman knows Darren. Which of Lee and Lorenzo can Herman reach?", "answer": "Lorenzo", "steps": [ "Herman knows Lorenzo." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Herman", "Paula", "Inez", "Louis", "Rebecca", "Hampton", "Diana", "Darren", "Lorenzo", "Hunter", "Howard", "Dick", "Duncan", "Cody", "Cordelia", "Janet", "Emmett", "Conrad", "Lee", "Uma" ], "edges": [ [ 0, 3 ], [ 0, 4 ], [ 0, 8 ], [ 0, 7 ], [ 1, 5 ], [ 1, 6 ], [ 6, 2 ], [ 7, 9 ], [ 8, 1 ], [ 10, 13 ], [ 10, 14 ], [ 10, 18 ], [ 10, 17 ], [ 11, 15 ], [ 11, 16 ], [ 16, 12 ], [ 17, 19 ], [ 18, 11 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Federico knows Heath. Dennis knows Frida. Federico knows Gordon. Alan knows Earl. Cynthia knows Gene. Frida knows Joaquin. Hilda knows Kai. Joaquin knows Tyler. Elise knows Cooper. Kai knows Gina. Cooper knows Cynthia. Kai knows Dennis. Heath knows Elise. Gordon knows Wilson. Wilson knows Fergus. Gina knows Alan. Max knows Federico. Tyler knows Cain. Which of Gene and Cain can Hilda reach?", "answer": "Cain", "steps": [ "Hilda knows Kai.", "Kai knows Dennis.", "Dennis knows Frida.", "Frida knows Joaquin.", "Joaquin knows Tyler.", "Tyler knows Cain." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Hilda", "Alan", "Dennis", "Cain", "Frida", "Kai", "Tyler", "Joaquin", "Gina", "Earl", "Max", "Wilson", "Heath", "Gene", "Elise", "Federico", "Cynthia", "Cooper", "Gordon", "Fergus" ], "edges": [ [ 0, 5 ], [ 1, 9 ], [ 2, 4 ], [ 4, 7 ], [ 5, 2 ], [ 5, 8 ], [ 6, 3 ], [ 7, 6 ], [ 8, 1 ], [ 10, 15 ], [ 11, 19 ], [ 12, 14 ], [ 14, 17 ], [ 15, 12 ], [ 15, 18 ], [ 16, 13 ], [ 17, 16 ], [ 18, 11 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Dennis knows Florence. Holly knows Andrea. Celeste knows Cliff. Aubrey knows Dennis. Cliff knows Dustin. Florence knows Jean. Jordan knows Devin. Vivian knows Gavin. Esther knows Celeste. Vivian knows Norman. Kerry knows Annette. Cara knows Esther. Jean knows Vivian. Dennis knows Jordan. Jean knows Joan. Esther knows Holly. Cliff knows Kerry. Kerry knows Latoya. Which of Latoya and Gavin can Aubrey reach?", "answer": "Gavin", "steps": [ "Aubrey knows Dennis.", "Dennis knows Florence.", "Florence knows Jean.", "Jean knows Vivian.", "Vivian knows Gavin." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Aubrey", "Florence", "Devin", "Joan", "Dennis", "Jordan", "Norman", "Vivian", "Jean", "Gavin", "Cara", "Celeste", "Andrea", "Dustin", "Esther", "Holly", "Annette", "Kerry", "Cliff", "Latoya" ], "edges": [ [ 0, 4 ], [ 1, 8 ], [ 4, 5 ], [ 4, 1 ], [ 5, 2 ], [ 7, 6 ], [ 7, 9 ], [ 8, 3 ], [ 8, 7 ], [ 10, 14 ], [ 11, 18 ], [ 14, 15 ], [ 14, 11 ], [ 15, 12 ], [ 17, 16 ], [ 17, 19 ], [ 18, 13 ], [ 18, 17 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Opal knows Victor. Norman knows Nash. Opal knows Clark. Linda knows India. Tristan knows Fern. India knows Janelle. Davis knows Shelby. Harriet knows Cruz. India knows Lee. Fern knows Sybil. Janelle knows Ricardo. Davis knows Harriet. Shaun knows Linda. Shaun knows Conner. Davis knows Tristan. Shaun knows Norman. Fern knows Opal. Janelle knows Miriam. Which of Fern and India can Shaun reach?", "answer": "India", "steps": [ "Shaun knows Linda.", "Linda knows India." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Shaun", "Ricardo", "Miriam", "India", "Nash", "Lee", "Linda", "Conner", "Janelle", "Norman", "Davis", "Clark", "Victor", "Fern", "Cruz", "Sybil", "Tristan", "Shelby", "Opal", "Harriet" ], "edges": [ [ 0, 7 ], [ 0, 6 ], [ 0, 9 ], [ 3, 5 ], [ 3, 8 ], [ 6, 3 ], [ 8, 1 ], [ 8, 2 ], [ 9, 4 ], [ 10, 17 ], [ 10, 16 ], [ 10, 19 ], [ 13, 15 ], [ 13, 18 ], [ 16, 13 ], [ 18, 11 ], [ 18, 12 ], [ 19, 14 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Arden knows Wendy. Herman knows Andre. Dawn knows Jacob. Bert knows Clarissa. Damien knows Faith. Elise knows Dawn. Dawn knows Selena. Clarissa knows Harper. Bert knows Arden. Justine knows Darwin. Trevor knows Justine. Wendy knows Claudia. Elise knows Hector. Trevor knows Damien. Faith knows Elise. Claudia knows Ernie. Claudia knows Herman. Herman knows Priscilla. Which of Elise and Claudia can Bert reach?", "answer": "Claudia", "steps": [ "Bert knows Arden.", "Arden knows Wendy.", "Wendy knows Claudia." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Bert", "Clarissa", "Claudia", "Wendy", "Ernie", "Andre", "Priscilla", "Harper", "Herman", "Arden", "Trevor", "Justine", "Elise", "Faith", "Hector", "Selena", "Jacob", "Darwin", "Dawn", "Damien" ], "edges": [ [ 0, 1 ], [ 0, 9 ], [ 1, 7 ], [ 2, 4 ], [ 2, 8 ], [ 3, 2 ], [ 8, 5 ], [ 8, 6 ], [ 9, 3 ], [ 10, 11 ], [ 10, 19 ], [ 11, 17 ], [ 12, 14 ], [ 12, 18 ], [ 13, 12 ], [ 18, 15 ], [ 18, 16 ], [ 19, 13 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Nathan knows Noel. Judy knows Karl. Adam knows Holden. Abigail knows Hope. Karl knows Rick. Nathan knows Madeline. Brynn knows Michelle. Raymond knows Anthony. Judy knows Abigail. Anthony knows Harry. Karl knows Connor. Nathan knows Darius. Adam knows Enid. Karl knows Colin. Harry knows Nathan. Harry knows Brynn. Raymond knows Emmett. Enid knows Judy. Which of Michelle and Hope can Adam reach?", "answer": "Hope", "steps": [ "Adam knows Enid.", "Enid knows Judy.", "Judy knows Abigail.", "Abigail knows Hope." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Adam", "Abigail", "Colin", "Judy", "Connor", "Karl", "Rick", "Holden", "Hope", "Enid", "Raymond", "Brynn", "Darius", "Harry", "Madeline", "Nathan", "Noel", "Emmett", "Michelle", "Anthony" ], "edges": [ [ 0, 7 ], [ 0, 9 ], [ 1, 8 ], [ 3, 5 ], [ 3, 1 ], [ 5, 2 ], [ 5, 4 ], [ 5, 6 ], [ 9, 3 ], [ 10, 17 ], [ 10, 19 ], [ 11, 18 ], [ 13, 15 ], [ 13, 11 ], [ 15, 12 ], [ 15, 14 ], [ 15, 16 ], [ 19, 13 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Nora knows Cindy. Reed knows Caleb. Conner knows Lucy. Curtis knows Natalie. Eamon knows Reed. Conner knows Gerard. Curtis knows Max. Richard knows Jose. Eamon knows Hamilton. Perry knows Nora. Dell knows Randall. Nora knows Mabel. Natalie knows Ruby. Cindy knows Curtis. Randall knows Conner. Arnold knows Dell. Lucy knows Eamon. Jose knows Perry. Which of Lucy and Cindy can Richard reach?", "answer": "Cindy", "steps": [ "Richard knows Jose.", "Jose knows Perry.", "Perry knows Nora.", "Nora knows Cindy." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Richard", "Ruby", "Mabel", "Cindy", "Max", "Natalie", "Jose", "Curtis", "Perry", "Nora", "Arnold", "Caleb", "Gerard", "Lucy", "Hamilton", "Reed", "Dell", "Eamon", "Randall", "Conner" ], "edges": [ [ 0, 6 ], [ 3, 7 ], [ 5, 1 ], [ 6, 8 ], [ 7, 4 ], [ 7, 5 ], [ 8, 9 ], [ 9, 2 ], [ 9, 3 ], [ 10, 16 ], [ 13, 17 ], [ 15, 11 ], [ 16, 18 ], [ 17, 14 ], [ 17, 15 ], [ 18, 19 ], [ 19, 12 ], [ 19, 13 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Foster knows Mindy. Lois knows Foster. Livia knows Erik. Cooper knows Opal. Rick knows Ilene. Wyatt knows Tracy. Ilene knows Chris. Chris knows Lois. Tracy knows Dirk. Alan knows Heidi. Heidi knows Wyatt. Wyatt knows Livia. Erik knows Sara. Opal knows Shaun. Dirk knows Homer. Foster knows Audrey. Erik knows Jennifer. Chris knows Cooper. Which of Heidi and Ilene can Rick reach?", "answer": "Ilene", "steps": [ "Rick knows Ilene." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Rick", "Audrey", "Foster", "Ilene", "Mindy", "Shaun", "Lois", "Chris", "Opal", "Cooper", "Alan", "Sara", "Erik", "Heidi", "Jennifer", "Homer", "Livia", "Wyatt", "Dirk", "Tracy" ], "edges": [ [ 0, 3 ], [ 2, 1 ], [ 2, 4 ], [ 3, 7 ], [ 6, 2 ], [ 7, 6 ], [ 7, 9 ], [ 8, 5 ], [ 9, 8 ], [ 10, 13 ], [ 12, 11 ], [ 12, 14 ], [ 13, 17 ], [ 16, 12 ], [ 17, 16 ], [ 17, 19 ], [ 18, 15 ], [ 19, 18 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Nolan knows Keaton. Jim knows Fraser. Jim knows Davis. Davis knows Kara. Hayden knows Alvin. Hayden knows Archie. Nolan knows Lee. Nolan knows Tonya. Hayden knows Effie. Brody knows Nolan. Beth knows Hardy. Beth knows Loretta. Davis knows Homer. Effie knows Norma. Fraser knows Hayden. Karina knows Brody. Tonya knows Kenneth. Karina knows Beth. Which of Fraser and Brody can Karina reach?", "answer": "Brody", "steps": [ "Karina knows Brody." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Karina", "Lee", "Loretta", "Kenneth", "Keaton", "Brody", "Beth", "Nolan", "Tonya", "Hardy", "Jim", "Alvin", "Kara", "Norma", "Archie", "Fraser", "Davis", "Hayden", "Effie", "Homer" ], "edges": [ [ 0, 5 ], [ 0, 6 ], [ 5, 7 ], [ 6, 2 ], [ 6, 9 ], [ 7, 1 ], [ 7, 4 ], [ 7, 8 ], [ 8, 3 ], [ 10, 15 ], [ 10, 16 ], [ 15, 17 ], [ 16, 12 ], [ 16, 19 ], [ 17, 11 ], [ 17, 14 ], [ 17, 18 ], [ 18, 13 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Tyler knows Evan. Naomi knows Elvis. Humphrey knows Mike. Chris knows Stefan. Chris knows Hal. Brittany knows Javier. Laura knows Tyler. Jacob knows Laura. Laura knows Jim. Brittany knows Mara. Laura knows Charity. Brittany knows Kay. Tyler knows Emery. Humphrey knows Brittany. Mara knows Clarissa. Laura knows Naomi. Jacob knows Claire. Brittany knows Chris. Which of Emery and Hal can Humphrey reach?", "answer": "Hal", "steps": [ "Humphrey knows Brittany.", "Brittany knows Chris.", "Chris knows Hal." ], "difficulty": 3, "original_distance": 3, "idx_to_symbol": [ "Humphrey", "Mara", "Stefan", "Kay", "Brittany", "Clarissa", "Mike", "Chris", "Javier", "Hal", "Jacob", "Naomi", "Evan", "Charity", "Laura", "Elvis", "Claire", "Tyler", "Jim", "Emery" ], "edges": [ [ 0, 6 ], [ 0, 4 ], [ 1, 5 ], [ 4, 3 ], [ 4, 1 ], [ 4, 8 ], [ 4, 7 ], [ 7, 2 ], [ 7, 9 ], [ 10, 16 ], [ 10, 14 ], [ 11, 15 ], [ 14, 13 ], [ 14, 11 ], [ 14, 18 ], [ 14, 17 ], [ 17, 12 ], [ 17, 19 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Mario knows Victor. Lorna knows Zach. Jacqueline knows Marc. Jacqueline knows Ellis. Daniella knows Mario. Jacob knows Graham. Teresa knows Bonnie. Devin knows Dahlia. Lucas knows Teresa. Marc knows Daniel. Gordon knows Lucille. Daniella knows Lucas. Teresa knows Gordon. Devin knows Lorna. Daniel knows Jacob. Victor knows Lark. Ellis knows Devin. Lark knows Cesar. Which of Devin and Teresa can Daniella reach?", "answer": "Teresa", "steps": [ "Daniella knows Lucas.", "Lucas knows Teresa." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Daniella", "Cesar", "Teresa", "Bonnie", "Lucille", "Gordon", "Victor", "Lark", "Mario", "Lucas", "Jacqueline", "Graham", "Devin", "Dahlia", "Zach", "Lorna", "Daniel", "Jacob", "Marc", "Ellis" ], "edges": [ [ 0, 8 ], [ 0, 9 ], [ 2, 3 ], [ 2, 5 ], [ 5, 4 ], [ 6, 7 ], [ 7, 1 ], [ 8, 6 ], [ 9, 2 ], [ 10, 18 ], [ 10, 19 ], [ 12, 13 ], [ 12, 15 ], [ 15, 14 ], [ 16, 17 ], [ 17, 11 ], [ 18, 16 ], [ 19, 12 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Barbara knows Norma. Burt knows Lawrence. Louis knows Fernando. Karl knows Patricia. Dale knows Sheryl. Dale knows Eric. Barbara knows Louis. Karl knows Laura. Burt knows Ralph. Lawrence knows Ellen. Barbara knows Claude. Barbara knows Betty. Karl knows Kamila. Kamila knows Burt. Sheryl knows Lyric. Kamila knows Beverly. Louis knows Dale. Karl knows Vivian. Which of Louis and Kamila can Barbara reach?", "answer": "Louis", "steps": [ "Barbara knows Louis." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Barbara", "Dale", "Claude", "Lyric", "Betty", "Eric", "Fernando", "Louis", "Sheryl", "Norma", "Karl", "Burt", "Patricia", "Ellen", "Laura", "Ralph", "Beverly", "Kamila", "Lawrence", "Vivian" ], "edges": [ [ 0, 2 ], [ 0, 4 ], [ 0, 7 ], [ 0, 9 ], [ 1, 5 ], [ 1, 8 ], [ 7, 6 ], [ 7, 1 ], [ 8, 3 ], [ 10, 12 ], [ 10, 14 ], [ 10, 17 ], [ 10, 19 ], [ 11, 15 ], [ 11, 18 ], [ 17, 16 ], [ 17, 11 ], [ 18, 13 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Linda knows Malcolm. Linda knows Levi. Estelle knows Isadora. Winston knows Merle. Omar knows Neville. Samantha knows Flora. Eugene knows Damian. Omar knows Dixie. Flora knows Eugene. Damian knows Noel. Levi knows Omar. Lucille knows Winston. Dixie knows Isaac. Noel knows Julio. Isaac knows Estelle. Flora knows Tara. Lucille knows Samantha. Malcolm knows Brent. Which of Samantha and Levi can Lucille reach?", "answer": "Samantha", "steps": [ "Lucille knows Samantha." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Lucille", "Tara", "Merle", "Julio", "Winston", "Flora", "Damian", "Eugene", "Samantha", "Noel", "Linda", "Neville", "Brent", "Isadora", "Malcolm", "Omar", "Isaac", "Dixie", "Levi", "Estelle" ], "edges": [ [ 0, 4 ], [ 0, 8 ], [ 4, 2 ], [ 5, 1 ], [ 5, 7 ], [ 6, 9 ], [ 7, 6 ], [ 8, 5 ], [ 9, 3 ], [ 10, 14 ], [ 10, 18 ], [ 14, 12 ], [ 15, 11 ], [ 15, 17 ], [ 16, 19 ], [ 17, 16 ], [ 18, 15 ], [ 19, 13 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Myra knows Dalton. Jeremiah knows Ted. Georgia knows Elena. Aubrey knows Drake. Aria knows August. Georgia knows Mark. Drake knows Kenneth. Madeline knows Aria. Leigh knows Kaleb. Drake knows Humphrey. Ted knows Georgia. Kaleb knows Aubrey. Myra knows Deborah. August knows Jon. Kenneth knows Myra. Jeremiah knows Emanuel. Fabian knows Leigh. Jon knows Jeremiah. Which of Ted and Kenneth can Fabian reach?", "answer": "Kenneth", "steps": [ "Fabian knows Leigh.", "Leigh knows Kaleb.", "Kaleb knows Aubrey.", "Aubrey knows Drake.", "Drake knows Kenneth." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Fabian", "Leigh", "Myra", "Aubrey", "Humphrey", "Drake", "Kenneth", "Deborah", "Dalton", "Kaleb", "Madeline", "Aria", "Georgia", "Jon", "Emanuel", "Jeremiah", "Ted", "Elena", "Mark", "August" ], "edges": [ [ 0, 1 ], [ 1, 9 ], [ 2, 7 ], [ 2, 8 ], [ 3, 5 ], [ 5, 4 ], [ 5, 6 ], [ 6, 2 ], [ 9, 3 ], [ 10, 11 ], [ 11, 19 ], [ 12, 17 ], [ 12, 18 ], [ 13, 15 ], [ 15, 14 ], [ 15, 16 ], [ 16, 12 ], [ 19, 13 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Darren knows Grant. Tanya knows Mindy. Carl knows Hayden. Dewey knows Hayley. Finn knows Elsa. Finn knows Maggie. Mindy knows Dewey. Elsa knows Joyce. Elsa knows Jorge. Grant knows Kendrick. Alvin knows Adrian. Rosa knows Darren. Dewey knows Finn. Carl knows Rufus. Carl knows Mary. Grant knows Alvin. Alvin knows Carl. Elsa knows Gus. Which of Dewey and Grant can Tanya reach?", "answer": "Dewey", "steps": [ "Tanya knows Mindy.", "Mindy knows Dewey." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Tanya", "Gus", "Elsa", "Hayley", "Joyce", "Dewey", "Finn", "Maggie", "Jorge", "Mindy", "Rosa", "Mary", "Carl", "Kendrick", "Hayden", "Grant", "Alvin", "Adrian", "Rufus", "Darren" ], "edges": [ [ 0, 9 ], [ 2, 1 ], [ 2, 4 ], [ 2, 8 ], [ 5, 3 ], [ 5, 6 ], [ 6, 7 ], [ 6, 2 ], [ 9, 5 ], [ 10, 19 ], [ 12, 11 ], [ 12, 14 ], [ 12, 18 ], [ 15, 13 ], [ 15, 16 ], [ 16, 17 ], [ 16, 12 ], [ 19, 15 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Hannah knows Leroy. Ronald knows Graeme. Ray knows Terry. Hannah knows Daisy. Troy knows Ronald. Graeme knows Rose. Terry knows Yvonne. Anna knows Ray. Ethan knows Archer. Rose knows Ethan. Candice knows Anna. Archer knows Chris. Candice knows Clarence. Yvonne knows Nelson. Hannah knows Troy. Nelson knows Skyler. Candice knows Patricia. Skyler knows Billy. Which of Billy and Chris can Hannah reach?", "answer": "Chris", "steps": [ "Hannah knows Troy.", "Troy knows Ronald.", "Ronald knows Graeme.", "Graeme knows Rose.", "Rose knows Ethan.", "Ethan knows Archer.", "Archer knows Chris." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Hannah", "Ethan", "Troy", "Rose", "Ronald", "Archer", "Chris", "Daisy", "Graeme", "Leroy", "Candice", "Nelson", "Anna", "Yvonne", "Ray", "Skyler", "Billy", "Patricia", "Terry", "Clarence" ], "edges": [ [ 0, 7 ], [ 0, 2 ], [ 0, 9 ], [ 1, 5 ], [ 2, 4 ], [ 3, 1 ], [ 4, 8 ], [ 5, 6 ], [ 8, 3 ], [ 10, 17 ], [ 10, 12 ], [ 10, 19 ], [ 11, 15 ], [ 12, 14 ], [ 13, 11 ], [ 14, 18 ], [ 15, 16 ], [ 18, 13 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Ellen knows Marcia. Greta knows Amelia. Kurt knows Greta. Ellen knows Austin. Burt knows Fisher. Austin knows Neville. Margaret knows Burt. Hailey knows Jesse. Hailey knows Nelson. Nelson knows Ellen. Kathleen knows Kurt. Jesse knows Jordan. Burt knows Randy. Hendrix knows Dorian. Kurt knows Margaret. Randy knows Keegan. Dorian knows Hailey. Garrison knows Kathleen. Which of Burt and Ellen can Hendrix reach?", "answer": "Ellen", "steps": [ "Hendrix knows Dorian.", "Dorian knows Hailey.", "Hailey knows Nelson.", "Nelson knows Ellen." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Hendrix", "Ellen", "Jesse", "Austin", "Nelson", "Dorian", "Jordan", "Hailey", "Neville", "Marcia", "Garrison", "Burt", "Greta", "Randy", "Margaret", "Kathleen", "Amelia", "Kurt", "Keegan", "Fisher" ], "edges": [ [ 0, 5 ], [ 1, 3 ], [ 1, 9 ], [ 2, 6 ], [ 3, 8 ], [ 4, 1 ], [ 5, 7 ], [ 7, 2 ], [ 7, 4 ], [ 10, 15 ], [ 11, 13 ], [ 11, 19 ], [ 12, 16 ], [ 13, 18 ], [ 14, 11 ], [ 15, 17 ], [ 17, 12 ], [ 17, 14 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Opal knows Bart. Duncan knows June. Dina knows Linda. Bart knows Samantha. Linda knows Ava. Gloria knows Stacy. Cecilia knows Natalie. Tristan knows Jacqueline. Duncan knows Lana. Stephen knows Opal. Stephen knows Gina. June knows Sharon. Opal knows Cecilia. Ava knows Garrison. Bart knows Gloria. Dina knows Duncan. Natalie knows Colby. Tristan knows Dina. Which of Bart and Duncan can Stephen reach?", "answer": "Bart", "steps": [ "Stephen knows Opal.", "Opal knows Bart." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Stephen", "Colby", "Gloria", "Natalie", "Opal", "Bart", "Stacy", "Cecilia", "Gina", "Samantha", "Tristan", "Garrison", "June", "Ava", "Dina", "Duncan", "Sharon", "Linda", "Jacqueline", "Lana" ], "edges": [ [ 0, 8 ], [ 0, 4 ], [ 2, 6 ], [ 3, 1 ], [ 4, 7 ], [ 4, 5 ], [ 5, 2 ], [ 5, 9 ], [ 7, 3 ], [ 10, 18 ], [ 10, 14 ], [ 12, 16 ], [ 13, 11 ], [ 14, 17 ], [ 14, 15 ], [ 15, 12 ], [ 15, 19 ], [ 17, 13 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Emery knows Megan. Elvis knows Dayton. Lyric knows Jon. Nadine knows Lyric. Kerry knows Ainsley. Callum knows Nadine. Judith knows Carter. Lyric knows Andre. Elvis knows Leroy. Elvis knows Kerry. Megan knows Nelson. Andre knows Keira. Callum knows Bridget. Dayton knows Alex. Bridget knows Yolanda. Leroy knows Emery. Callum knows Judith. Emery knows Grover. Which of Keira and Nelson can Elvis reach?", "answer": "Nelson", "steps": [ "Elvis knows Leroy.", "Leroy knows Emery.", "Emery knows Megan.", "Megan knows Nelson." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Elvis", "Leroy", "Grover", "Kerry", "Emery", "Dayton", "Nelson", "Ainsley", "Megan", "Alex", "Callum", "Nadine", "Jon", "Bridget", "Lyric", "Judith", "Keira", "Yolanda", "Andre", "Carter" ], "edges": [ [ 0, 3 ], [ 0, 1 ], [ 0, 5 ], [ 1, 4 ], [ 3, 7 ], [ 4, 2 ], [ 4, 8 ], [ 5, 9 ], [ 8, 6 ], [ 10, 13 ], [ 10, 11 ], [ 10, 15 ], [ 11, 14 ], [ 13, 17 ], [ 14, 12 ], [ 14, 18 ], [ 15, 19 ], [ 18, 16 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Stephanie knows Cooper. Karl knows Fraser. Colleen knows Wilson. Katherine knows Cindy. Blake knows Leon. Dawn knows Stephanie. Colleen knows Jessie. Dawn knows Rose. Cooper knows Jacob. Dawn knows Colleen. Kenzie knows Bonnie. Jacob knows Kay. Blake knows Kenzie. Kenzie knows Ainsley. Colleen knows Amelia. Cindy knows Karl. Blake knows Katherine. Kenzie knows Holden. Which of Cindy and Cooper can Dawn reach?", "answer": "Cooper", "steps": [ "Dawn knows Stephanie.", "Stephanie knows Cooper." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Dawn", "Jessie", "Stephanie", "Cooper", "Wilson", "Jacob", "Amelia", "Colleen", "Rose", "Kay", "Blake", "Holden", "Katherine", "Cindy", "Ainsley", "Karl", "Bonnie", "Kenzie", "Leon", "Fraser" ], "edges": [ [ 0, 7 ], [ 0, 8 ], [ 0, 2 ], [ 2, 3 ], [ 3, 5 ], [ 5, 9 ], [ 7, 1 ], [ 7, 4 ], [ 7, 6 ], [ 10, 17 ], [ 10, 18 ], [ 10, 12 ], [ 12, 13 ], [ 13, 15 ], [ 15, 19 ], [ 17, 11 ], [ 17, 14 ], [ 17, 16 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Lucy knows Dennis. Wendy knows Myrtle. Charlotte knows Bette. Charlotte knows Becky. Jay knows April. Dennis knows Jay. Wendy knows Edgar. Merle knows Chester. Merle knows Jeremiah. Edgar knows Rachel. Ashton knows Charlotte. Myrtle knows Clarence. Charlotte knows Wanda. Rachel knows Ashton. Jeremiah knows Brock. Jay knows Edmund. Chester knows Lucy. Jay knows Fernando. Which of Ashton and Dennis can Merle reach?", "answer": "Dennis", "steps": [ "Merle knows Chester.", "Chester knows Lucy.", "Lucy knows Dennis." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Merle", "Lucy", "Fernando", "Brock", "April", "Chester", "Jay", "Jeremiah", "Edmund", "Dennis", "Wendy", "Rachel", "Bette", "Clarence", "Wanda", "Edgar", "Charlotte", "Myrtle", "Becky", "Ashton" ], "edges": [ [ 0, 7 ], [ 0, 5 ], [ 1, 9 ], [ 5, 1 ], [ 6, 2 ], [ 6, 4 ], [ 6, 8 ], [ 7, 3 ], [ 9, 6 ], [ 10, 17 ], [ 10, 15 ], [ 11, 19 ], [ 15, 11 ], [ 16, 12 ], [ 16, 14 ], [ 16, 18 ], [ 17, 13 ], [ 19, 16 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Bernadette knows Darren. Annette knows Colby. Bernadette knows Marlene. Hayes knows Maya. Ilene knows Nadine. Joel knows Amanda. Hayes knows Annette. Roy knows Stefan. Mabel knows Randall. Joel knows Mabel. Hayes knows Wesley. Ilene knows Trevor. Joel knows Roy. Maya knows Reid. Ilene knows Joel. Bernadette knows Hayes. Joel knows Glenda. Hayes knows Jason. Which of Mabel and Maya can Bernadette reach?", "answer": "Maya", "steps": [ "Bernadette knows Hayes.", "Hayes knows Maya." ], "difficulty": 2, "original_distance": 3, "idx_to_symbol": [ "Bernadette", "Darren", "Annette", "Colby", "Jason", "Wesley", "Maya", "Reid", "Hayes", "Marlene", "Ilene", "Nadine", "Roy", "Stefan", "Amanda", "Glenda", "Mabel", "Randall", "Joel", "Trevor" ], "edges": [ [ 0, 1 ], [ 0, 8 ], [ 0, 9 ], [ 2, 3 ], [ 6, 7 ], [ 8, 2 ], [ 8, 4 ], [ 8, 5 ], [ 8, 6 ], [ 10, 11 ], [ 10, 18 ], [ 10, 19 ], [ 12, 13 ], [ 16, 17 ], [ 18, 12 ], [ 18, 14 ], [ 18, 15 ], [ 18, 16 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Helene knows Constance. Lorraine knows Annette. Lorraine knows Donna. Helene knows Harrison. Helene knows Kristina. Helene knows Harmony. Harrison knows Winifred. Lorraine knows Humphrey. Annette knows Yara. Donna knows Eleanor. Humphrey knows Nathan. Nathan knows Gideon. Winifred knows Franklin. Harrison knows Belinda. Constance knows Dell. Harmony knows Esperanza. Lorraine knows Clay. Humphrey knows Wayne. Which of Nathan and Winifred can Lorraine reach?", "answer": "Nathan", "steps": [ "Lorraine knows Humphrey.", "Humphrey knows Nathan." ], "difficulty": 2, "original_distance": 3, "idx_to_symbol": [ "Lorraine", "Gideon", "Donna", "Wayne", "Clay", "Yara", "Annette", "Eleanor", "Humphrey", "Nathan", "Helene", "Franklin", "Harmony", "Belinda", "Kristina", "Dell", "Constance", "Esperanza", "Harrison", "Winifred" ], "edges": [ [ 0, 4 ], [ 0, 6 ], [ 0, 2 ], [ 0, 8 ], [ 2, 7 ], [ 6, 5 ], [ 8, 3 ], [ 8, 9 ], [ 9, 1 ], [ 10, 14 ], [ 10, 16 ], [ 10, 12 ], [ 10, 18 ], [ 12, 17 ], [ 16, 15 ], [ 18, 13 ], [ 18, 19 ], [ 19, 11 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Phoebe knows Esperanza. Roger knows Vivian. Esperanza knows Archie. Esperanza knows Harris. Gavin knows Humphrey. Olive knows Abigail. Archie knows Gavin. Lyric knows Walter. Virgil knows Mindy. Imogen knows Lucy. Lucy knows Olive. Harris knows Robert. Mindy knows Lyric. Mindy knows Imogen. Roger knows Phoebe. Jim knows Atlas. Jim knows Virgil. Humphrey knows Jonathan. Which of Jonathan and Abigail can Roger reach?", "answer": "Jonathan", "steps": [ "Roger knows Phoebe.", "Phoebe knows Esperanza.", "Esperanza knows Archie.", "Archie knows Gavin.", "Gavin knows Humphrey.", "Humphrey knows Jonathan." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Roger", "Vivian", "Gavin", "Jonathan", "Archie", "Esperanza", "Phoebe", "Harris", "Humphrey", "Robert", "Jim", "Atlas", "Lucy", "Abigail", "Imogen", "Mindy", "Virgil", "Lyric", "Olive", "Walter" ], "edges": [ [ 0, 1 ], [ 0, 6 ], [ 2, 8 ], [ 4, 2 ], [ 5, 4 ], [ 5, 7 ], [ 6, 5 ], [ 7, 9 ], [ 8, 3 ], [ 10, 11 ], [ 10, 16 ], [ 12, 18 ], [ 14, 12 ], [ 15, 14 ], [ 15, 17 ], [ 16, 15 ], [ 17, 19 ], [ 18, 13 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Dennis knows Colin. Dennis knows Kareem. Ruby knows Janice. Ruby knows Duke. Hank knows Edmund. Hank knows Arthur. Dennis knows Amber. Marlene knows Camille. Marlene knows Kevin. Hailey knows Hank. Duke knows Eden. Ruby knows Hector. Clark knows Hailey. Arthur knows Emery. Amber knows Bryan. Bryan knows Ruby. Hank knows Aiden. Marlene knows Clark. Which of Clark and Amber can Marlene reach?", "answer": "Clark", "steps": [ "Marlene knows Clark." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Marlene", "Emery", "Camille", "Clark", "Aiden", "Arthur", "Hank", "Edmund", "Kevin", "Hailey", "Dennis", "Eden", "Colin", "Amber", "Janice", "Duke", "Ruby", "Hector", "Kareem", "Bryan" ], "edges": [ [ 0, 2 ], [ 0, 8 ], [ 0, 3 ], [ 3, 9 ], [ 5, 1 ], [ 6, 4 ], [ 6, 5 ], [ 6, 7 ], [ 9, 6 ], [ 10, 12 ], [ 10, 18 ], [ 10, 13 ], [ 13, 19 ], [ 15, 11 ], [ 16, 14 ], [ 16, 15 ], [ 16, 17 ], [ 19, 16 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Elodie knows June. Ellis knows Alan. Kelly knows Stanley. Sheila knows Henry. Mason knows Kelly. Elliot knows Ellis. Kelly knows Hailey. Hugh knows Graeme. Elvira knows Sheila. Mason knows Boyd. Kelly knows Stephanie. Denver knows Leah. Boyd knows Hugh. Bert knows Denver. Denver knows Elliot. Bert knows Elvira. Stephanie knows Elodie. Denver knows Cruz. Which of Denver and Kelly can Bert reach?", "answer": "Denver", "steps": [ "Bert knows Denver." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Bert", "Alan", "Henry", "Sheila", "Cruz", "Ellis", "Elliot", "Elvira", "Leah", "Denver", "Mason", "June", "Graeme", "Hugh", "Stanley", "Elodie", "Stephanie", "Boyd", "Hailey", "Kelly" ], "edges": [ [ 0, 7 ], [ 0, 9 ], [ 3, 2 ], [ 5, 1 ], [ 6, 5 ], [ 7, 3 ], [ 9, 4 ], [ 9, 6 ], [ 9, 8 ], [ 10, 17 ], [ 10, 19 ], [ 13, 12 ], [ 15, 11 ], [ 16, 15 ], [ 17, 13 ], [ 19, 14 ], [ 19, 16 ], [ 19, 18 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Shannon knows Della. Faith knows Dallas. Lola knows Faith. Faith knows Margaret. Jay knows Carson. Shannon knows Latoya. Shannon knows Andrew. Rose knows Shannon. Margaret knows Jay. Reid knows Karina. Demetrius knows Reid. Shannon knows Tina. Faith knows Christopher. Myra knows Virginia. Dawn knows Cooper. Della knows Dawn. Latoya knows Myra. Faith knows Demetrius. Which of Karina and Cooper can Lola reach?", "answer": "Karina", "steps": [ "Lola knows Faith.", "Faith knows Demetrius.", "Demetrius knows Reid.", "Reid knows Karina." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Lola", "Faith", "Margaret", "Reid", "Dallas", "Karina", "Demetrius", "Christopher", "Carson", "Jay", "Rose", "Shannon", "Latoya", "Dawn", "Andrew", "Cooper", "Della", "Tina", "Virginia", "Myra" ], "edges": [ [ 0, 1 ], [ 1, 4 ], [ 1, 6 ], [ 1, 7 ], [ 1, 2 ], [ 2, 9 ], [ 3, 5 ], [ 6, 3 ], [ 9, 8 ], [ 10, 11 ], [ 11, 14 ], [ 11, 16 ], [ 11, 17 ], [ 11, 12 ], [ 12, 19 ], [ 13, 15 ], [ 16, 13 ], [ 19, 18 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Dell knows Hope. Veronica knows Gage. Gage knows Kelsey. Langston knows Devon. Ricardo knows Samuel. Dell knows Ricardo. Sebastian knows Alder. Sebastian knows Nicole. Hope knows Emery. Gage knows Logan. Devon knows Demetrius. Demetrius knows Sybil. Elena knows Sebastian. Emery knows Elena. Sybil knows Veronica. Denver knows Leo. Devon knows Denver. Hannah knows Dell. Which of Veronica and Elena can Hannah reach?", "answer": "Elena", "steps": [ "Hannah knows Dell.", "Dell knows Hope.", "Hope knows Emery.", "Emery knows Elena." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Hannah", "Ricardo", "Dell", "Hope", "Sebastian", "Elena", "Alder", "Emery", "Nicole", "Samuel", "Langston", "Denver", "Devon", "Demetrius", "Gage", "Veronica", "Kelsey", "Sybil", "Logan", "Leo" ], "edges": [ [ 0, 2 ], [ 1, 9 ], [ 2, 3 ], [ 2, 1 ], [ 3, 7 ], [ 4, 6 ], [ 4, 8 ], [ 5, 4 ], [ 7, 5 ], [ 10, 12 ], [ 11, 19 ], [ 12, 13 ], [ 12, 11 ], [ 13, 17 ], [ 14, 16 ], [ 14, 18 ], [ 15, 14 ], [ 17, 15 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Dane knows Calvin. Cora knows Gus. Dane knows Erica. Wyatt knows Stanley. Duncan knows Lynn. Erica knows Keegan. Lynn knows Quinn. Cora knows Dane. Keegan knows Georgia. Stanley knows Dale. Stanley knows Garrison. Stanley knows Hugo. Keegan knows Nicholas. Duncan knows Duke. Keegan knows Lilia. Lynn knows Wyatt. Garrison knows Rhonda. Georgia knows Dakota. Which of Wyatt and Erica can Duncan reach?", "answer": "Wyatt", "steps": [ "Duncan knows Lynn.", "Lynn knows Wyatt." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Duncan", "Stanley", "Lynn", "Rhonda", "Dale", "Hugo", "Duke", "Wyatt", "Quinn", "Garrison", "Cora", "Keegan", "Dane", "Dakota", "Nicholas", "Lilia", "Gus", "Erica", "Calvin", "Georgia" ], "edges": [ [ 0, 6 ], [ 0, 2 ], [ 1, 4 ], [ 1, 5 ], [ 1, 9 ], [ 2, 8 ], [ 2, 7 ], [ 7, 1 ], [ 9, 3 ], [ 10, 16 ], [ 10, 12 ], [ 11, 14 ], [ 11, 15 ], [ 11, 19 ], [ 12, 18 ], [ 12, 17 ], [ 17, 11 ], [ 19, 13 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Luke knows Javier. Zoe knows Greg. Kylie knows Cecilia. Daniella knows Kylie. Tristan knows Daniella. Javier knows Zoe. Keaton knows Emily. Keaton knows Gavin. Rosa knows Tristan. Emily knows Luke. Luke knows Eunice. Leopold knows Michael. Cecilia knows Leopold. Kylie knows Devon. Luke knows Damien. Tristan knows Caleb. Ken knows Keaton. Kylie knows Lottie. Which of Michael and Greg can Rosa reach?", "answer": "Michael", "steps": [ "Rosa knows Tristan.", "Tristan knows Daniella.", "Daniella knows Kylie.", "Kylie knows Cecilia.", "Cecilia knows Leopold.", "Leopold knows Michael." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Rosa", "Lottie", "Tristan", "Leopold", "Kylie", "Daniella", "Michael", "Cecilia", "Caleb", "Devon", "Ken", "Eunice", "Keaton", "Zoe", "Luke", "Emily", "Greg", "Javier", "Gavin", "Damien" ], "edges": [ [ 0, 2 ], [ 2, 8 ], [ 2, 5 ], [ 3, 6 ], [ 4, 1 ], [ 4, 7 ], [ 4, 9 ], [ 5, 4 ], [ 7, 3 ], [ 10, 12 ], [ 12, 18 ], [ 12, 15 ], [ 13, 16 ], [ 14, 11 ], [ 14, 17 ], [ 14, 19 ], [ 15, 14 ], [ 17, 13 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Jill knows Mae. Kerry knows Jamie. Mae knows Randy. Elise knows Garrett. Jill knows Philip. Randy knows Daniella. Nicholas knows Kerry. Kerry knows Louise. Samantha knows Shawn. Mae knows Mindy. Lane knows Nicholas. Lane knows Samantha. Philip knows Max. Jamie knows Joseph. Daniella knows Elise. Joseph knows Oliver. Nicholas knows Jasper. Randy knows Willis. Which of Nicholas and Mae can Lane reach?", "answer": "Nicholas", "steps": [ "Lane knows Nicholas." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Lane", "Louise", "Kerry", "Nicholas", "Shawn", "Joseph", "Jasper", "Oliver", "Samantha", "Jamie", "Jill", "Willis", "Randy", "Mae", "Max", "Elise", "Mindy", "Garrett", "Philip", "Daniella" ], "edges": [ [ 0, 8 ], [ 0, 3 ], [ 2, 1 ], [ 2, 9 ], [ 3, 6 ], [ 3, 2 ], [ 5, 7 ], [ 8, 4 ], [ 9, 5 ], [ 10, 18 ], [ 10, 13 ], [ 12, 11 ], [ 12, 19 ], [ 13, 16 ], [ 13, 12 ], [ 15, 17 ], [ 18, 14 ], [ 19, 15 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Duncan knows Ford. Bart knows Ashley. Mae knows Lara. Amber knows Bart. Bart knows Frankie. Frankie knows Myra. Mae knows Taylor. Hendrix knows Hampton. Duncan knows Jessica. Ashley knows Nolan. Amber knows Audrey. Duncan knows June. Jessica knows Mae. Ashley knows Aaron. Hampton knows Harlan. Myra knows Kyle. Amber knows Julia. Jessica knows Hendrix. Which of Hendrix and Frankie can Amber reach?", "answer": "Frankie", "steps": [ "Amber knows Bart.", "Bart knows Frankie." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Amber", "Myra", "Frankie", "Nolan", "Julia", "Bart", "Audrey", "Ashley", "Aaron", "Kyle", "Duncan", "Hampton", "Hendrix", "Taylor", "Ford", "Jessica", "June", "Mae", "Lara", "Harlan" ], "edges": [ [ 0, 4 ], [ 0, 6 ], [ 0, 5 ], [ 1, 9 ], [ 2, 1 ], [ 5, 7 ], [ 5, 2 ], [ 7, 3 ], [ 7, 8 ], [ 10, 14 ], [ 10, 16 ], [ 10, 15 ], [ 11, 19 ], [ 12, 11 ], [ 15, 17 ], [ 15, 12 ], [ 17, 13 ], [ 17, 18 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Heidi knows Lucia. Marcus knows Joy. Mark knows Rita. Keaton knows Lyle. Lyle knows Ross. Ida knows Fletcher. Erwin knows Dolores. Brittany knows Irving. Leigh knows Oliver. Garland knows Brittany. Erwin knows Leigh. Dolores knows Milo. Milo knows Marcus. Lucia knows Keaton. Keaton knows Ida. Irving knows Erwin. Milton knows Heidi. Ross knows Mark. Which of Mark and Marcus can Milton reach?", "answer": "Mark", "steps": [ "Milton knows Heidi.", "Heidi knows Lucia.", "Lucia knows Keaton.", "Keaton knows Lyle.", "Lyle knows Ross.", "Ross knows Mark." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Milton", "Heidi", "Ross", "Mark", "Fletcher", "Lyle", "Rita", "Lucia", "Keaton", "Ida", "Garland", "Brittany", "Milo", "Marcus", "Oliver", "Dolores", "Joy", "Irving", "Erwin", "Leigh" ], "edges": [ [ 0, 1 ], [ 1, 7 ], [ 2, 3 ], [ 3, 6 ], [ 5, 2 ], [ 7, 8 ], [ 8, 5 ], [ 8, 9 ], [ 9, 4 ], [ 10, 11 ], [ 11, 17 ], [ 12, 13 ], [ 13, 16 ], [ 15, 12 ], [ 17, 18 ], [ 18, 15 ], [ 18, 19 ], [ 19, 14 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Terry knows Blake. Haven knows Penny. Jolene knows Ira. Jolene knows Edison. Fritz knows Terry. Brittany knows Fritz. Bruce knows Kaleb. Haven knows Shannon. Hunter knows Brittany. Riley knows Terrence. Penny knows Livia. Blake knows Jolene. Marie knows Haven. Edison knows Elvira. Hunter knows Hannah. Terrence knows Isla. Isla knows Marie. Bruce knows Riley. Which of Riley and Brittany can Hunter reach?", "answer": "Brittany", "steps": [ "Hunter knows Brittany." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Hunter", "Hannah", "Brittany", "Fritz", "Jolene", "Edison", "Terry", "Blake", "Elvira", "Ira", "Bruce", "Kaleb", "Riley", "Terrence", "Haven", "Penny", "Isla", "Marie", "Livia", "Shannon" ], "edges": [ [ 0, 1 ], [ 0, 2 ], [ 2, 3 ], [ 3, 6 ], [ 4, 5 ], [ 4, 9 ], [ 5, 8 ], [ 6, 7 ], [ 7, 4 ], [ 10, 11 ], [ 10, 12 ], [ 12, 13 ], [ 13, 16 ], [ 14, 15 ], [ 14, 19 ], [ 15, 18 ], [ 16, 17 ], [ 17, 14 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Dwight knows Wendy. Neal knows Caleb. Isla knows Antonio. Katherine knows Colin. Dwight knows Edmund. Edmund knows Ursula. Neal knows Natalie. Annette knows Neal. Desmond knows Dwight. Colin knows Desmond. Lara knows Max. Edmund knows Vanessa. Dwight knows Irving. Antonio knows Annette. Neal knows Lara. Lara knows Tina. Max knows Lewis. Vanessa knows Jonathan. Which of Max and Vanessa can Isla reach?", "answer": "Max", "steps": [ "Isla knows Antonio.", "Antonio knows Annette.", "Annette knows Neal.", "Neal knows Lara.", "Lara knows Max." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Isla", "Lara", "Caleb", "Annette", "Neal", "Natalie", "Lewis", "Tina", "Max", "Antonio", "Katherine", "Edmund", "Irving", "Desmond", "Dwight", "Wendy", "Jonathan", "Ursula", "Vanessa", "Colin" ], "edges": [ [ 0, 9 ], [ 1, 7 ], [ 1, 8 ], [ 3, 4 ], [ 4, 2 ], [ 4, 5 ], [ 4, 1 ], [ 8, 6 ], [ 9, 3 ], [ 10, 19 ], [ 11, 17 ], [ 11, 18 ], [ 13, 14 ], [ 14, 12 ], [ 14, 15 ], [ 14, 11 ], [ 18, 16 ], [ 19, 13 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Paige knows Franklin. Ebony knows Eleanor. Marcia knows Beau. Marcia knows Maya. Walter knows Louis. Marcia knows Bonnie. Kristina knows Nicole. Beau knows Clark. Walter knows Marcia. Eleanor knows Eli. Ebony knows Rosa. Ebony knows Chantal. Rosa knows Lucy. Walter knows Hannah. Bonnie knows Ellen. Hannah knows Myra. Paige knows Ebony. Paige knows Kristina. Which of Marcia and Ebony can Walter reach?", "answer": "Marcia", "steps": [ "Walter knows Marcia." ], "difficulty": 1, "original_distance": 3, "idx_to_symbol": [ "Walter", "Ellen", "Bonnie", "Myra", "Beau", "Maya", "Marcia", "Clark", "Louis", "Hannah", "Paige", "Lucy", "Rosa", "Nicole", "Eleanor", "Chantal", "Ebony", "Eli", "Franklin", "Kristina" ], "edges": [ [ 0, 6 ], [ 0, 8 ], [ 0, 9 ], [ 2, 1 ], [ 4, 7 ], [ 6, 2 ], [ 6, 5 ], [ 6, 4 ], [ 9, 3 ], [ 10, 16 ], [ 10, 18 ], [ 10, 19 ], [ 12, 11 ], [ 14, 17 ], [ 16, 12 ], [ 16, 15 ], [ 16, 14 ], [ 19, 13 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Lucy knows Dennis. Wendy knows Myrtle. Charlotte knows Bette. Charlotte knows Becky. Jay knows April. Dennis knows Jay. Wendy knows Edgar. Merle knows Chester. Merle knows Jeremiah. Edgar knows Rachel. Ashton knows Charlotte. Myrtle knows Clarence. Charlotte knows Wanda. Rachel knows Ashton. Jeremiah knows Brock. Jay knows Edmund. Chester knows Lucy. Jay knows Fernando. Which of Chester and Edgar can Merle reach?", "answer": "Chester", "steps": [ "Merle knows Chester." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Merle", "Lucy", "Fernando", "Brock", "April", "Chester", "Jay", "Jeremiah", "Edmund", "Dennis", "Wendy", "Rachel", "Bette", "Clarence", "Wanda", "Edgar", "Charlotte", "Myrtle", "Becky", "Ashton" ], "edges": [ [ 0, 7 ], [ 0, 5 ], [ 1, 9 ], [ 5, 1 ], [ 6, 2 ], [ 6, 4 ], [ 6, 8 ], [ 7, 3 ], [ 9, 6 ], [ 10, 17 ], [ 10, 15 ], [ 11, 19 ], [ 15, 11 ], [ 16, 12 ], [ 16, 14 ], [ 16, 18 ], [ 17, 13 ], [ 19, 16 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Wanda knows Rufus. Clement knows Wanda. Hayes knows Freya. Vera knows Maureen. Vicki knows Miranda. Vera knows Doug. Patricia knows Otto. Wanda knows Vera. Leigh knows Colette. Vicki knows William. Clement knows Alexa. Leigh knows Lambert. Colette knows Mike. Clement knows Vicki. Hayes knows Leigh. Colette knows Eloise. Patricia knows Holly. Hayes knows Patricia. Which of Mike and Maureen can Hayes reach?", "answer": "Mike", "steps": [ "Hayes knows Leigh.", "Leigh knows Colette.", "Colette knows Mike." ], "difficulty": 3, "original_distance": 3, "idx_to_symbol": [ "Hayes", "Eloise", "Mike", "Patricia", "Lambert", "Freya", "Holly", "Leigh", "Otto", "Colette", "Clement", "Doug", "Maureen", "Vicki", "Rufus", "Alexa", "William", "Wanda", "Miranda", "Vera" ], "edges": [ [ 0, 5 ], [ 0, 3 ], [ 0, 7 ], [ 3, 6 ], [ 3, 8 ], [ 7, 4 ], [ 7, 9 ], [ 9, 1 ], [ 9, 2 ], [ 10, 15 ], [ 10, 13 ], [ 10, 17 ], [ 13, 16 ], [ 13, 18 ], [ 17, 14 ], [ 17, 19 ], [ 19, 11 ], [ 19, 12 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Frida knows Gonzalo. Nadine knows Greta. Shannon knows Harley. George knows Raymond. Carlton knows Celia. Carol knows Carlton. Nadine knows Kenzie. Gonzalo knows George. Joel knows Riley. Carlton knows Bryan. Robert knows Kennedy. Gonzalo knows Shannon. Shannon knows Jorge. Celia knows Jessica. Carol knows Nadine. Riley knows Carol. Gemma knows Frida. George knows Robert. Which of Carol and Gonzalo can Gemma reach?", "answer": "Gonzalo", "steps": [ "Gemma knows Frida.", "Frida knows Gonzalo." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Gemma", "Raymond", "Frida", "Harley", "George", "Shannon", "Robert", "Kennedy", "Jorge", "Gonzalo", "Joel", "Bryan", "Riley", "Kenzie", "Carlton", "Nadine", "Celia", "Jessica", "Greta", "Carol" ], "edges": [ [ 0, 2 ], [ 2, 9 ], [ 4, 1 ], [ 4, 6 ], [ 5, 3 ], [ 5, 8 ], [ 6, 7 ], [ 9, 4 ], [ 9, 5 ], [ 10, 12 ], [ 12, 19 ], [ 14, 11 ], [ 14, 16 ], [ 15, 13 ], [ 15, 18 ], [ 16, 17 ], [ 19, 14 ], [ 19, 15 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Arden knows Wendy. Herman knows Andre. Dawn knows Jacob. Bert knows Clarissa. Damien knows Faith. Elise knows Dawn. Dawn knows Selena. Clarissa knows Harper. Bert knows Arden. Justine knows Darwin. Trevor knows Justine. Wendy knows Claudia. Elise knows Hector. Trevor knows Damien. Faith knows Elise. Claudia knows Ernie. Claudia knows Herman. Herman knows Priscilla. Which of Faith and Wendy can Bert reach?", "answer": "Wendy", "steps": [ "Bert knows Arden.", "Arden knows Wendy." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Bert", "Clarissa", "Claudia", "Wendy", "Ernie", "Andre", "Priscilla", "Harper", "Herman", "Arden", "Trevor", "Justine", "Elise", "Faith", "Hector", "Selena", "Jacob", "Darwin", "Dawn", "Damien" ], "edges": [ [ 0, 1 ], [ 0, 9 ], [ 1, 7 ], [ 2, 4 ], [ 2, 8 ], [ 3, 2 ], [ 8, 5 ], [ 8, 6 ], [ 9, 3 ], [ 10, 11 ], [ 10, 19 ], [ 11, 17 ], [ 12, 14 ], [ 12, 18 ], [ 13, 12 ], [ 18, 15 ], [ 18, 16 ], [ 19, 13 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Hope knows Edison. Leon knows Eloise. Hope knows Dina. Horace knows Harrison. Zoe knows Alana. Julius knows Nancy. Randy knows Horace. Axel knows Julius. Zoe knows Kennedy. Harrison knows Esperanza. Dina knows Randy. Leon knows Haven. Shelly knows Opal. Dina knows Leon. Alana knows Shelly. Tracy knows Axel. Shelly knows Dustin. Alana knows Tracy. Which of Julius and Harrison can Zoe reach?", "answer": "Julius", "steps": [ "Zoe knows Alana.", "Alana knows Tracy.", "Tracy knows Axel.", "Axel knows Julius." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Zoe", "Alana", "Julius", "Shelly", "Tracy", "Dustin", "Kennedy", "Nancy", "Axel", "Opal", "Hope", "Dina", "Harrison", "Leon", "Randy", "Haven", "Edison", "Esperanza", "Horace", "Eloise" ], "edges": [ [ 0, 6 ], [ 0, 1 ], [ 1, 4 ], [ 1, 3 ], [ 2, 7 ], [ 3, 5 ], [ 3, 9 ], [ 4, 8 ], [ 8, 2 ], [ 10, 16 ], [ 10, 11 ], [ 11, 14 ], [ 11, 13 ], [ 12, 17 ], [ 13, 15 ], [ 13, 19 ], [ 14, 18 ], [ 18, 12 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "James knows Allen. Houston knows Garrett. James knows Brett. Robert knows Della. Wendy knows Houston. Gemma knows Phoebe. Houston knows Francesca. Darnell knows Spencer. Spencer knows Gemma. Gemma knows Quinn. Robert knows Martin. Darnell knows Claude. Robert knows James. Quinn knows Morgan. Gemma knows Jerry. Garrett knows Robert. Amelia knows Darnell. Quinn knows Jeremiah. Which of Gemma and Robert can Amelia reach?", "answer": "Gemma", "steps": [ "Amelia knows Darnell.", "Darnell knows Spencer.", "Spencer knows Gemma." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Amelia", "Claude", "Phoebe", "Spencer", "Jerry", "Darnell", "Quinn", "Gemma", "Morgan", "Jeremiah", "Wendy", "Francesca", "Della", "Garrett", "Martin", "Houston", "James", "Robert", "Allen", "Brett" ], "edges": [ [ 0, 5 ], [ 3, 7 ], [ 5, 1 ], [ 5, 3 ], [ 6, 8 ], [ 6, 9 ], [ 7, 2 ], [ 7, 4 ], [ 7, 6 ], [ 10, 15 ], [ 13, 17 ], [ 15, 11 ], [ 15, 13 ], [ 16, 18 ], [ 16, 19 ], [ 17, 12 ], [ 17, 14 ], [ 17, 16 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Marshall knows Heather. Ida knows Deanna. Edgar knows Edward. Scott knows Darius. Darius knows Ida. Cole knows Felicia. Samantha knows Cole. Robin knows Scott. Julian knows Blanche. Darius knows Samantha. Felicia knows Morris. Heather knows Luther. Marshall knows Edgar. Aurora knows Marshall. Blanche knows Aurora. Luther knows Fleur. Fleur knows Hilda. Joy knows Robin. Which of Cole and Luther can Julian reach?", "answer": "Luther", "steps": [ "Julian knows Blanche.", "Blanche knows Aurora.", "Aurora knows Marshall.", "Marshall knows Heather.", "Heather knows Luther." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Julian", "Fleur", "Edward", "Marshall", "Luther", "Hilda", "Blanche", "Aurora", "Edgar", "Heather", "Joy", "Felicia", "Deanna", "Darius", "Cole", "Morris", "Robin", "Scott", "Ida", "Samantha" ], "edges": [ [ 0, 6 ], [ 1, 5 ], [ 3, 8 ], [ 3, 9 ], [ 4, 1 ], [ 6, 7 ], [ 7, 3 ], [ 8, 2 ], [ 9, 4 ], [ 10, 16 ], [ 11, 15 ], [ 13, 18 ], [ 13, 19 ], [ 14, 11 ], [ 16, 17 ], [ 17, 13 ], [ 18, 12 ], [ 19, 14 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Phoebe knows Esperanza. Roger knows Vivian. Esperanza knows Archie. Esperanza knows Harris. Gavin knows Humphrey. Olive knows Abigail. Archie knows Gavin. Lyric knows Walter. Virgil knows Mindy. Imogen knows Lucy. Lucy knows Olive. Harris knows Robert. Mindy knows Lyric. Mindy knows Imogen. Roger knows Phoebe. Jim knows Atlas. Jim knows Virgil. Humphrey knows Jonathan. Which of Imogen and Archie can Roger reach?", "answer": "Archie", "steps": [ "Roger knows Phoebe.", "Phoebe knows Esperanza.", "Esperanza knows Archie." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Roger", "Vivian", "Gavin", "Jonathan", "Archie", "Esperanza", "Phoebe", "Harris", "Humphrey", "Robert", "Jim", "Atlas", "Lucy", "Abigail", "Imogen", "Mindy", "Virgil", "Lyric", "Olive", "Walter" ], "edges": [ [ 0, 1 ], [ 0, 6 ], [ 2, 8 ], [ 4, 2 ], [ 5, 4 ], [ 5, 7 ], [ 6, 5 ], [ 7, 9 ], [ 8, 3 ], [ 10, 11 ], [ 10, 16 ], [ 12, 18 ], [ 14, 12 ], [ 15, 14 ], [ 15, 17 ], [ 16, 15 ], [ 17, 19 ], [ 18, 13 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Courtney knows Selena. Stacy knows Vance. Marlene knows Colette. Ernie knows Peggy. Louis knows Edna. Selena knows Hector. Colette knows Marian. Peggy knows Stacy. Yasmin knows Enid. Dewey knows Courtney. Vance knows Hugh. Daphne knows Iris. Hector knows Audrey. Edna knows Ted. Audrey knows Marlene. Peggy knows Daphne. Ted knows Ernie. Audrey knows Yasmin. Which of Marian and Hugh can Dewey reach?", "answer": "Marian", "steps": [ "Dewey knows Courtney.", "Courtney knows Selena.", "Selena knows Hector.", "Hector knows Audrey.", "Audrey knows Marlene.", "Marlene knows Colette.", "Colette knows Marian." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Dewey", "Hector", "Marian", "Yasmin", "Selena", "Colette", "Enid", "Audrey", "Courtney", "Marlene", "Louis", "Ernie", "Hugh", "Daphne", "Ted", "Vance", "Iris", "Peggy", "Edna", "Stacy" ], "edges": [ [ 0, 8 ], [ 1, 7 ], [ 3, 6 ], [ 4, 1 ], [ 5, 2 ], [ 7, 3 ], [ 7, 9 ], [ 8, 4 ], [ 9, 5 ], [ 10, 18 ], [ 11, 17 ], [ 13, 16 ], [ 14, 11 ], [ 15, 12 ], [ 17, 13 ], [ 17, 19 ], [ 18, 14 ], [ 19, 15 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Joshua knows Ariel. Liam knows Monroe. Elvira knows Frida. Otto knows Goldie. Ariel knows Liam. Anton knows Otto. Ilene knows Carla. Monroe knows Hunter. Anton knows Norma. Anton knows Hardy. Liam knows Gregory. Ilene knows Anton. Ray knows Jeremiah. Monroe knows Lawson. Monroe knows Elvira. Norma knows Harrison. Hunter knows Dustin. Jeremiah knows Ilene. Which of Liam and Ilene can Ray reach?", "answer": "Ilene", "steps": [ "Ray knows Jeremiah.", "Jeremiah knows Ilene." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Ray", "Norma", "Carla", "Jeremiah", "Ilene", "Hardy", "Anton", "Harrison", "Otto", "Goldie", "Joshua", "Elvira", "Gregory", "Ariel", "Liam", "Lawson", "Monroe", "Frida", "Hunter", "Dustin" ], "edges": [ [ 0, 3 ], [ 1, 7 ], [ 3, 4 ], [ 4, 2 ], [ 4, 6 ], [ 6, 5 ], [ 6, 1 ], [ 6, 8 ], [ 8, 9 ], [ 10, 13 ], [ 11, 17 ], [ 13, 14 ], [ 14, 12 ], [ 14, 16 ], [ 16, 15 ], [ 16, 11 ], [ 16, 18 ], [ 18, 19 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Bernadette knows Darren. Annette knows Colby. Bernadette knows Marlene. Hayes knows Maya. Ilene knows Nadine. Joel knows Amanda. Hayes knows Annette. Roy knows Stefan. Mabel knows Randall. Joel knows Mabel. Hayes knows Wesley. Ilene knows Trevor. Joel knows Roy. Maya knows Reid. Ilene knows Joel. Bernadette knows Hayes. Joel knows Glenda. Hayes knows Jason. Which of Randall and Reid can Bernadette reach?", "answer": "Reid", "steps": [ "Bernadette knows Hayes.", "Hayes knows Maya.", "Maya knows Reid." ], "difficulty": 3, "original_distance": 3, "idx_to_symbol": [ "Bernadette", "Darren", "Annette", "Colby", "Jason", "Wesley", "Maya", "Reid", "Hayes", "Marlene", "Ilene", "Nadine", "Roy", "Stefan", "Amanda", "Glenda", "Mabel", "Randall", "Joel", "Trevor" ], "edges": [ [ 0, 1 ], [ 0, 8 ], [ 0, 9 ], [ 2, 3 ], [ 6, 7 ], [ 8, 2 ], [ 8, 4 ], [ 8, 5 ], [ 8, 6 ], [ 10, 11 ], [ 10, 18 ], [ 10, 19 ], [ 12, 13 ], [ 16, 17 ], [ 18, 12 ], [ 18, 14 ], [ 18, 15 ], [ 18, 16 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Ilene knows Crystal. Charlene knows Darnell. Jackson knows Lucille. Fred knows Fraser. Nathan knows Joaquin. Dominic knows Dirk. Fraser knows Milton. Coral knows Nathan. Fred knows Ilene. Harrison knows Vera. Ilene knows Charlene. Jackson knows Mildred. Milton knows Dominic. Harrison knows Estella. Harrison knows Jackson. Lucille knows Justine. Fred knows Elizabeth. Estella knows Coral. Which of Joaquin and Dirk can Fred reach?", "answer": "Dirk", "steps": [ "Fred knows Fraser.", "Fraser knows Milton.", "Milton knows Dominic.", "Dominic knows Dirk." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Fred", "Dirk", "Darnell", "Charlene", "Crystal", "Ilene", "Elizabeth", "Fraser", "Dominic", "Milton", "Harrison", "Joaquin", "Justine", "Lucille", "Mildred", "Jackson", "Vera", "Estella", "Nathan", "Coral" ], "edges": [ [ 0, 5 ], [ 0, 6 ], [ 0, 7 ], [ 3, 2 ], [ 5, 3 ], [ 5, 4 ], [ 7, 9 ], [ 8, 1 ], [ 9, 8 ], [ 10, 15 ], [ 10, 16 ], [ 10, 17 ], [ 13, 12 ], [ 15, 13 ], [ 15, 14 ], [ 17, 19 ], [ 18, 11 ], [ 19, 18 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Veronica knows Dell. Forrest knows Keegan. Barney knows Claudia. Lara knows Chloe. Dell knows Yvette. Chloe knows Paige. Yvette knows Margaret. Keegan knows Barney. Claudia knows Nina. Hope knows Mason. Courtney knows Hope. Claudia knows Courtney. Forrest knows Lamar. Eva knows Jeff. Jeff knows Veronica. Jeff knows Winston. Yvette knows Lara. Dale knows Forrest. Which of Barney and Dell can Dale reach?", "answer": "Barney", "steps": [ "Dale knows Forrest.", "Forrest knows Keegan.", "Keegan knows Barney." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Dale", "Courtney", "Lamar", "Claudia", "Mason", "Keegan", "Barney", "Hope", "Nina", "Forrest", "Eva", "Lara", "Winston", "Yvette", "Paige", "Veronica", "Dell", "Chloe", "Margaret", "Jeff" ], "edges": [ [ 0, 9 ], [ 1, 7 ], [ 3, 1 ], [ 3, 8 ], [ 5, 6 ], [ 6, 3 ], [ 7, 4 ], [ 9, 2 ], [ 9, 5 ], [ 10, 19 ], [ 11, 17 ], [ 13, 11 ], [ 13, 18 ], [ 15, 16 ], [ 16, 13 ], [ 17, 14 ], [ 19, 12 ], [ 19, 15 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Quinn knows Jonah. Bonnie knows Gail. Desmond knows Rhonda. Dudley knows Iris. Bonnie knows Joseph. Joseph knows Geneva. Gail knows Lance. Iris knows Michelle. Candice knows Cyrus. Dudley knows Lane. Hamilton knows Livia. Dudley knows Desmond. Jonah knows Hamilton. Hamilton knows Dudley. Demetrius knows Bonnie. Cyrus knows Demetrius. Demetrius knows Eloise. Bonnie knows Cordelia. Which of Jonah and Cyrus can Candice reach?", "answer": "Cyrus", "steps": [ "Candice knows Cyrus." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Candice", "Lance", "Geneva", "Bonnie", "Eloise", "Cordelia", "Demetrius", "Cyrus", "Gail", "Joseph", "Quinn", "Rhonda", "Michelle", "Dudley", "Livia", "Lane", "Hamilton", "Jonah", "Desmond", "Iris" ], "edges": [ [ 0, 7 ], [ 3, 5 ], [ 3, 8 ], [ 3, 9 ], [ 6, 4 ], [ 6, 3 ], [ 7, 6 ], [ 8, 1 ], [ 9, 2 ], [ 10, 17 ], [ 13, 15 ], [ 13, 18 ], [ 13, 19 ], [ 16, 14 ], [ 16, 13 ], [ 17, 16 ], [ 18, 11 ], [ 19, 12 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Myrtle knows Elijah. Jacob knows Alfred. Alfred knows Forrest. Alfred knows Anna. Elijah knows Mara. Logan knows Jacob. Yvonne knows Heather. Jennifer knows Hugh. Heather knows Clement. Mara knows Erik. Forrest knows Abel. Walt knows Sheila. Clement knows Callum. Callum knows Jocelyn. Clement knows Hadley. Jocelyn knows Jennifer. Hugh knows Walt. Abel knows Myrtle. Which of Callum and Forrest can Yvonne reach?", "answer": "Callum", "steps": [ "Yvonne knows Heather.", "Heather knows Clement.", "Clement knows Callum." ], "difficulty": 3, "original_distance": 8, "idx_to_symbol": [ "Yvonne", "Jennifer", "Hadley", "Sheila", "Clement", "Callum", "Hugh", "Jocelyn", "Heather", "Walt", "Logan", "Myrtle", "Anna", "Erik", "Alfred", "Forrest", "Elijah", "Abel", "Jacob", "Mara" ], "edges": [ [ 0, 8 ], [ 1, 6 ], [ 4, 2 ], [ 4, 5 ], [ 5, 7 ], [ 6, 9 ], [ 7, 1 ], [ 8, 4 ], [ 9, 3 ], [ 10, 18 ], [ 11, 16 ], [ 14, 12 ], [ 14, 15 ], [ 15, 17 ], [ 16, 19 ], [ 17, 11 ], [ 18, 14 ], [ 19, 13 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Quinn knows Jonah. Bonnie knows Gail. Desmond knows Rhonda. Dudley knows Iris. Bonnie knows Joseph. Joseph knows Geneva. Gail knows Lance. Iris knows Michelle. Candice knows Cyrus. Dudley knows Lane. Hamilton knows Livia. Dudley knows Desmond. Jonah knows Hamilton. Hamilton knows Dudley. Demetrius knows Bonnie. Cyrus knows Demetrius. Demetrius knows Eloise. Bonnie knows Cordelia. Which of Hamilton and Demetrius can Candice reach?", "answer": "Demetrius", "steps": [ "Candice knows Cyrus.", "Cyrus knows Demetrius." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Candice", "Lance", "Geneva", "Bonnie", "Eloise", "Cordelia", "Demetrius", "Cyrus", "Gail", "Joseph", "Quinn", "Rhonda", "Michelle", "Dudley", "Livia", "Lane", "Hamilton", "Jonah", "Desmond", "Iris" ], "edges": [ [ 0, 7 ], [ 3, 5 ], [ 3, 8 ], [ 3, 9 ], [ 6, 4 ], [ 6, 3 ], [ 7, 6 ], [ 8, 1 ], [ 9, 2 ], [ 10, 17 ], [ 13, 15 ], [ 13, 18 ], [ 13, 19 ], [ 16, 14 ], [ 16, 13 ], [ 17, 16 ], [ 18, 11 ], [ 19, 12 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Elena knows Jessica. Rosa knows Jeanne. Lawrence knows Celia. Maude knows Elena. Angela knows Maude. Faye knows Florence. Ebony knows Faye. Celia knows Brooke. Angela knows Rosa. Travis knows Robin. Brooke knows Aaron. Florence knows Chad. Jenny knows August. Jeanne knows Travis. Kevin knows Angela. Leroy knows Kevin. August knows Lawrence. Lawrence knows Ebony. Which of Florence and Travis can Jenny reach?", "answer": "Florence", "steps": [ "Jenny knows August.", "August knows Lawrence.", "Lawrence knows Ebony.", "Ebony knows Faye.", "Faye knows Florence." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Jenny", "Florence", "Lawrence", "Brooke", "Faye", "Ebony", "Chad", "Celia", "Aaron", "August", "Leroy", "Travis", "Angela", "Elena", "Jeanne", "Rosa", "Robin", "Maude", "Jessica", "Kevin" ], "edges": [ [ 0, 9 ], [ 1, 6 ], [ 2, 5 ], [ 2, 7 ], [ 3, 8 ], [ 4, 1 ], [ 5, 4 ], [ 7, 3 ], [ 9, 2 ], [ 10, 19 ], [ 11, 16 ], [ 12, 15 ], [ 12, 17 ], [ 13, 18 ], [ 14, 11 ], [ 15, 14 ], [ 17, 13 ], [ 19, 12 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Luther knows Jim. Jessie knows Julius. Norma knows Clay. Jasper knows Mae. Jim knows Virginia. Zoe knows Evan. Dakota knows Zach. Clay knows Fisher. Julius knows Dexter. Dakota knows Zoe. Mae knows Dakota. Virginia knows Brooke. Fisher knows Garland. Brooke knows Jessie. Daisy knows Luther. Rowan knows Daisy. Luther knows Hope. Evan knows Norma. Which of Zoe and Jim can Rowan reach?", "answer": "Jim", "steps": [ "Rowan knows Daisy.", "Daisy knows Luther.", "Luther knows Jim." ], "difficulty": 3, "original_distance": 8, "idx_to_symbol": [ "Rowan", "Jessie", "Julius", "Brooke", "Jim", "Dexter", "Luther", "Virginia", "Daisy", "Hope", "Jasper", "Clay", "Fisher", "Norma", "Zoe", "Garland", "Dakota", "Evan", "Mae", "Zach" ], "edges": [ [ 0, 8 ], [ 1, 2 ], [ 2, 5 ], [ 3, 1 ], [ 4, 7 ], [ 6, 4 ], [ 6, 9 ], [ 7, 3 ], [ 8, 6 ], [ 10, 18 ], [ 11, 12 ], [ 12, 15 ], [ 13, 11 ], [ 14, 17 ], [ 16, 14 ], [ 16, 19 ], [ 17, 13 ], [ 18, 16 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Flora knows Lucia. Russell knows Owen. Neal knows Desmond. Zara knows Bonnie. Bonnie knows Dana. Maria knows Flora. Livia knows Katrina. Martin knows Maria. Knox knows Charles. Owen knows Livia. Bonnie knows Allan. Livia knows Peggy. Katrina knows Neal. Knox knows Zara. Desmond knows Will. Dana knows Martin. Russell knows Chelsea. Will knows Colin. Which of Lucia and Colin can Knox reach?", "answer": "Lucia", "steps": [ "Knox knows Zara.", "Zara knows Bonnie.", "Bonnie knows Dana.", "Dana knows Martin.", "Martin knows Maria.", "Maria knows Flora.", "Flora knows Lucia." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Knox", "Flora", "Allan", "Dana", "Bonnie", "Zara", "Maria", "Lucia", "Charles", "Martin", "Russell", "Will", "Peggy", "Katrina", "Livia", "Owen", "Desmond", "Colin", "Chelsea", "Neal" ], "edges": [ [ 0, 8 ], [ 0, 5 ], [ 1, 7 ], [ 3, 9 ], [ 4, 2 ], [ 4, 3 ], [ 5, 4 ], [ 6, 1 ], [ 9, 6 ], [ 10, 18 ], [ 10, 15 ], [ 11, 17 ], [ 13, 19 ], [ 14, 12 ], [ 14, 13 ], [ 15, 14 ], [ 16, 11 ], [ 19, 16 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Will knows Thea. Thea knows Knox. Corinne knows Brooks. Jerome knows Eloise. Corinne knows Boyd. Sharon knows Vicki. Thea knows Kingsley. Lola knows Morgan. Jerome knows Lola. Will knows Carrie. Eloise knows Marcia. Lola knows Corinne. Marcia knows Harlan. Vicki knows Franklin. Kingsley knows Leticia. Jerome knows Alfred. Kingsley knows Desmond. Will knows Sharon. Which of Thea and Lola can Will reach?", "answer": "Thea", "steps": [ "Will knows Thea." ], "difficulty": 1, "original_distance": 3, "idx_to_symbol": [ "Will", "Sharon", "Vicki", "Kingsley", "Knox", "Desmond", "Franklin", "Thea", "Carrie", "Leticia", "Jerome", "Eloise", "Marcia", "Corinne", "Morgan", "Boyd", "Harlan", "Lola", "Alfred", "Brooks" ], "edges": [ [ 0, 1 ], [ 0, 8 ], [ 0, 7 ], [ 1, 2 ], [ 2, 6 ], [ 3, 5 ], [ 3, 9 ], [ 7, 4 ], [ 7, 3 ], [ 10, 11 ], [ 10, 18 ], [ 10, 17 ], [ 11, 12 ], [ 12, 16 ], [ 13, 15 ], [ 13, 19 ], [ 17, 14 ], [ 17, 13 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Foster knows Mindy. Lois knows Foster. Livia knows Erik. Cooper knows Opal. Rick knows Ilene. Wyatt knows Tracy. Ilene knows Chris. Chris knows Lois. Tracy knows Dirk. Alan knows Heidi. Heidi knows Wyatt. Wyatt knows Livia. Erik knows Sara. Opal knows Shaun. Dirk knows Homer. Foster knows Audrey. Erik knows Jennifer. Chris knows Cooper. Which of Wyatt and Chris can Rick reach?", "answer": "Chris", "steps": [ "Rick knows Ilene.", "Ilene knows Chris." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Rick", "Audrey", "Foster", "Ilene", "Mindy", "Shaun", "Lois", "Chris", "Opal", "Cooper", "Alan", "Sara", "Erik", "Heidi", "Jennifer", "Homer", "Livia", "Wyatt", "Dirk", "Tracy" ], "edges": [ [ 0, 3 ], [ 2, 1 ], [ 2, 4 ], [ 3, 7 ], [ 6, 2 ], [ 7, 6 ], [ 7, 9 ], [ 8, 5 ], [ 9, 8 ], [ 10, 13 ], [ 12, 11 ], [ 12, 14 ], [ 13, 17 ], [ 16, 12 ], [ 17, 16 ], [ 17, 19 ], [ 18, 15 ], [ 19, 18 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Cara knows Mark. Keaton knows Melody. Nelson knows Cristina. Keaton knows Adrian. Adrian knows Latoya. Herbert knows Dale. Kristina knows Aurora. Aurora knows Cara. Herbert knows Morris. Lauren knows Bennett. Dustin knows Grant. Morris knows Dustin. Miles knows Lauren. Nelson knows Jameson. Jameson knows Keaton. Kristina knows Leticia. Cara knows Herbert. Adrian knows Miles. Which of Jameson and Aurora can Nelson reach?", "answer": "Jameson", "steps": [ "Nelson knows Jameson." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Nelson", "Melody", "Latoya", "Miles", "Bennett", "Adrian", "Jameson", "Cristina", "Keaton", "Lauren", "Kristina", "Mark", "Dale", "Morris", "Grant", "Herbert", "Aurora", "Leticia", "Cara", "Dustin" ], "edges": [ [ 0, 7 ], [ 0, 6 ], [ 3, 9 ], [ 5, 2 ], [ 5, 3 ], [ 6, 8 ], [ 8, 1 ], [ 8, 5 ], [ 9, 4 ], [ 10, 17 ], [ 10, 16 ], [ 13, 19 ], [ 15, 12 ], [ 15, 13 ], [ 16, 18 ], [ 18, 11 ], [ 18, 15 ], [ 19, 14 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Clarence knows Sam. Ibrahim knows Alfred. Devon knows Fleur. Joy knows Corey. Corey knows Boris. Langston knows Ingrid. Boris knows Dexter. Trina knows Joy. James knows Ibrahim. Corey knows Devon. Joy knows Lisette. Kimberly knows Spencer. Gavin knows Trina. Dexter knows Virgil. Ibrahim knows Kimberly. Sam knows James. James knows Gus. Alfred knows Langston. Which of Corey and Ibrahim can Clarence reach?", "answer": "Ibrahim", "steps": [ "Clarence knows Sam.", "Sam knows James.", "James knows Ibrahim." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Clarence", "James", "Alfred", "Ingrid", "Sam", "Gus", "Kimberly", "Langston", "Ibrahim", "Spencer", "Gavin", "Joy", "Boris", "Virgil", "Trina", "Lisette", "Devon", "Dexter", "Corey", "Fleur" ], "edges": [ [ 0, 4 ], [ 1, 5 ], [ 1, 8 ], [ 2, 7 ], [ 4, 1 ], [ 6, 9 ], [ 7, 3 ], [ 8, 2 ], [ 8, 6 ], [ 10, 14 ], [ 11, 15 ], [ 11, 18 ], [ 12, 17 ], [ 14, 11 ], [ 16, 19 ], [ 17, 13 ], [ 18, 12 ], [ 18, 16 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Nicole knows Daniel. Franklin knows Lewis. Lewis knows Adam. Grady knows Willard. Laura knows Bennett. Willard knows Henry. Jacques knows Trevor. Adam knows Laura. Henry knows Ramona. Archer knows Karina. Laura knows Vernon. Cruz knows Nicole. Vernon knows Archer. Franklin knows Ingrid. Henry knows Jacques. Nicole knows Grady. Ethan knows Franklin. Trevor knows Dana. Which of Henry and Laura can Cruz reach?", "answer": "Henry", "steps": [ "Cruz knows Nicole.", "Nicole knows Grady.", "Grady knows Willard.", "Willard knows Henry." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Cruz", "Dana", "Daniel", "Henry", "Trevor", "Ramona", "Grady", "Willard", "Nicole", "Jacques", "Ethan", "Karina", "Ingrid", "Laura", "Archer", "Bennett", "Lewis", "Adam", "Franklin", "Vernon" ], "edges": [ [ 0, 8 ], [ 3, 5 ], [ 3, 9 ], [ 4, 1 ], [ 6, 7 ], [ 7, 3 ], [ 8, 2 ], [ 8, 6 ], [ 9, 4 ], [ 10, 18 ], [ 13, 15 ], [ 13, 19 ], [ 14, 11 ], [ 16, 17 ], [ 17, 13 ], [ 18, 12 ], [ 18, 16 ], [ 19, 14 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Jorge knows Willis. Willis knows Gonzalo. Dolores knows Barry. Jorge knows Jocelyn. Grace knows Dane. Dane knows Aurora. Deirdre knows Grace. Lacey knows Jorge. Dolores knows Deirdre. Jeanne knows Iris. Jeanne knows Georgia. Willis knows Jeanne. Grace knows Harris. Deirdre knows Boris. Lacey knows Leah. Dane knows Geoffrey. Barry knows Agnes. Leah knows Donald. Which of Iris and Aurora can Dolores reach?", "answer": "Aurora", "steps": [ "Dolores knows Deirdre.", "Deirdre knows Grace.", "Grace knows Dane.", "Dane knows Aurora." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Dolores", "Dane", "Grace", "Agnes", "Geoffrey", "Barry", "Boris", "Aurora", "Harris", "Deirdre", "Lacey", "Jeanne", "Willis", "Donald", "Georgia", "Leah", "Jocelyn", "Iris", "Gonzalo", "Jorge" ], "edges": [ [ 0, 5 ], [ 0, 9 ], [ 1, 4 ], [ 1, 7 ], [ 2, 1 ], [ 2, 8 ], [ 5, 3 ], [ 9, 6 ], [ 9, 2 ], [ 10, 15 ], [ 10, 19 ], [ 11, 14 ], [ 11, 17 ], [ 12, 11 ], [ 12, 18 ], [ 15, 13 ], [ 19, 16 ], [ 19, 12 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Henrietta knows Janet. Brad knows Harvey. Abel knows Alan. Cole knows Brad. Emily knows Henrietta. Kamila knows Clement. Clement knows Rick. Tim knows Connor. Hailey knows Carter. Trudy knows Emily. Janet knows Jay. Carter knows Tim. Tim knows Trudy. Alan knows Shaun. Clement knows Abel. Stephanie knows Kamila. Jay knows Earle. Shaun knows Cole. Which of Earle and Harvey can Hailey reach?", "answer": "Earle", "steps": [ "Hailey knows Carter.", "Carter knows Tim.", "Tim knows Trudy.", "Trudy knows Emily.", "Emily knows Henrietta.", "Henrietta knows Janet.", "Janet knows Jay.", "Jay knows Earle." ], "difficulty": 8, "original_distance": 8, "idx_to_symbol": [ "Hailey", "Connor", "Janet", "Tim", "Emily", "Earle", "Henrietta", "Trudy", "Carter", "Jay", "Stephanie", "Rick", "Cole", "Clement", "Alan", "Harvey", "Shaun", "Abel", "Kamila", "Brad" ], "edges": [ [ 0, 8 ], [ 2, 9 ], [ 3, 1 ], [ 3, 7 ], [ 4, 6 ], [ 6, 2 ], [ 7, 4 ], [ 8, 3 ], [ 9, 5 ], [ 10, 18 ], [ 12, 19 ], [ 13, 11 ], [ 13, 17 ], [ 14, 16 ], [ 16, 12 ], [ 17, 14 ], [ 18, 13 ], [ 19, 15 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Cara knows Mark. Keaton knows Melody. Nelson knows Cristina. Keaton knows Adrian. Adrian knows Latoya. Herbert knows Dale. Kristina knows Aurora. Aurora knows Cara. Herbert knows Morris. Lauren knows Bennett. Dustin knows Grant. Morris knows Dustin. Miles knows Lauren. Nelson knows Jameson. Jameson knows Keaton. Kristina knows Leticia. Cara knows Herbert. Adrian knows Miles. Which of Cara and Keaton can Nelson reach?", "answer": "Keaton", "steps": [ "Nelson knows Jameson.", "Jameson knows Keaton." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Nelson", "Melody", "Latoya", "Miles", "Bennett", "Adrian", "Jameson", "Cristina", "Keaton", "Lauren", "Kristina", "Mark", "Dale", "Morris", "Grant", "Herbert", "Aurora", "Leticia", "Cara", "Dustin" ], "edges": [ [ 0, 7 ], [ 0, 6 ], [ 3, 9 ], [ 5, 2 ], [ 5, 3 ], [ 6, 8 ], [ 8, 1 ], [ 8, 5 ], [ 9, 4 ], [ 10, 17 ], [ 10, 16 ], [ 13, 19 ], [ 15, 12 ], [ 15, 13 ], [ 16, 18 ], [ 18, 11 ], [ 18, 15 ], [ 19, 14 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Lorenzo knows Wilma. Sheryl knows Phoebe. Aubrey knows Alvin. Alyssa knows Celia. Wilma knows Irene. Chandler knows Ezra. Phoebe knows Zara. Ida knows Nelson. Alvin knows Ida. Agnes knows Lorenzo. Dirk knows Kai. Ezra knows Sheryl. Nelson knows Agnes. Adele knows Chandler. Etta knows Winston. Sheryl knows Dirk. Nelson knows Alyssa. Zara knows Etta. Which of Etta and Wilma can Aubrey reach?", "answer": "Wilma", "steps": [ "Aubrey knows Alvin.", "Alvin knows Ida.", "Ida knows Nelson.", "Nelson knows Agnes.", "Agnes knows Lorenzo.", "Lorenzo knows Wilma." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Aubrey", "Nelson", "Wilma", "Lorenzo", "Irene", "Alvin", "Alyssa", "Celia", "Agnes", "Ida", "Adele", "Sheryl", "Etta", "Zara", "Winston", "Chandler", "Dirk", "Kai", "Phoebe", "Ezra" ], "edges": [ [ 0, 5 ], [ 1, 6 ], [ 1, 8 ], [ 2, 4 ], [ 3, 2 ], [ 5, 9 ], [ 6, 7 ], [ 8, 3 ], [ 9, 1 ], [ 10, 15 ], [ 11, 16 ], [ 11, 18 ], [ 12, 14 ], [ 13, 12 ], [ 15, 19 ], [ 16, 17 ], [ 18, 13 ], [ 19, 11 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Barbara knows Holden. Miranda knows Drew. Peggy knows Gail. Barbara knows Peggy. Gwen knows Demetrius. Elsa knows Steve. Kathleen knows Barbara. Jude knows Kathleen. Riley knows Travis. Demetrius knows Riley. Andrew knows Tamara. Alejandro knows Andrew. Elsa knows Miranda. Tamara knows Elsa. Peggy knows Gwen. Hazel knows Hayes. Tamara knows Brody. Drew knows Hazel. Which of Peggy and Elsa can Alejandro reach?", "answer": "Elsa", "steps": [ "Alejandro knows Andrew.", "Andrew knows Tamara.", "Tamara knows Elsa." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Alejandro", "Drew", "Tamara", "Hayes", "Andrew", "Brody", "Steve", "Elsa", "Miranda", "Hazel", "Jude", "Demetrius", "Barbara", "Travis", "Kathleen", "Holden", "Gail", "Peggy", "Gwen", "Riley" ], "edges": [ [ 0, 4 ], [ 1, 9 ], [ 2, 5 ], [ 2, 7 ], [ 4, 2 ], [ 7, 6 ], [ 7, 8 ], [ 8, 1 ], [ 9, 3 ], [ 10, 14 ], [ 11, 19 ], [ 12, 15 ], [ 12, 17 ], [ 14, 12 ], [ 17, 16 ], [ 17, 18 ], [ 18, 11 ], [ 19, 13 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Maude knows Amelia. Will knows Louisa. Abby knows Gerald. Valerie knows Charles. Cain knows Florence. Ezra knows Elsa. Lars knows Will. Ingrid knows Jolena. Pat knows Cain. Maude knows Abby. Louisa knows Julius. Abby knows Ingrid. Abby knows Lawson. Celeste knows Luz. Lawson knows Pat. Celeste knows Ezra. Celeste knows Lars. Valerie knows Celeste. Which of Florence and Julius can Valerie reach?", "answer": "Julius", "steps": [ "Valerie knows Celeste.", "Celeste knows Lars.", "Lars knows Will.", "Will knows Louisa.", "Louisa knows Julius." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Valerie", "Lars", "Julius", "Luz", "Elsa", "Charles", "Will", "Louisa", "Ezra", "Celeste", "Maude", "Lawson", "Florence", "Gerald", "Jolena", "Amelia", "Pat", "Cain", "Ingrid", "Abby" ], "edges": [ [ 0, 5 ], [ 0, 9 ], [ 1, 6 ], [ 6, 7 ], [ 7, 2 ], [ 8, 4 ], [ 9, 3 ], [ 9, 1 ], [ 9, 8 ], [ 10, 15 ], [ 10, 19 ], [ 11, 16 ], [ 16, 17 ], [ 17, 12 ], [ 18, 14 ], [ 19, 13 ], [ 19, 11 ], [ 19, 18 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Gemma knows Greta. Annette knows Logan. Bruce knows Gemma. Stephanie knows Dale. Mark knows Myrtle. Greta knows Jacqueline. Erica knows Bruce. Annette knows Sam. Haley knows Audrey. Audrey knows Alicia. Sam knows Stephanie. Wade knows Opal. Wade knows Veronica. Alicia knows Erica. Veronica knows Mark. Dale knows Wade. Bruce knows Ford. Haley knows Andrea. Which of Myrtle and Jacqueline can Haley reach?", "answer": "Jacqueline", "steps": [ "Haley knows Audrey.", "Audrey knows Alicia.", "Alicia knows Erica.", "Erica knows Bruce.", "Bruce knows Gemma.", "Gemma knows Greta.", "Greta knows Jacqueline." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Haley", "Audrey", "Greta", "Andrea", "Gemma", "Ford", "Bruce", "Jacqueline", "Alicia", "Erica", "Annette", "Sam", "Mark", "Logan", "Veronica", "Opal", "Wade", "Myrtle", "Stephanie", "Dale" ], "edges": [ [ 0, 3 ], [ 0, 1 ], [ 1, 8 ], [ 2, 7 ], [ 4, 2 ], [ 6, 5 ], [ 6, 4 ], [ 8, 9 ], [ 9, 6 ], [ 10, 13 ], [ 10, 11 ], [ 11, 18 ], [ 12, 17 ], [ 14, 12 ], [ 16, 15 ], [ 16, 14 ], [ 18, 19 ], [ 19, 16 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Imogen knows William. Daisy knows Cameron. Cameron knows Tina. Nelson knows Winston. Lorenzo knows Fabian. Leigh knows Daisy. Ibrahim knows Lucy. Imogen knows Declan. Fabian knows Imogen. Cameron knows Christopher. Cameron knows Lorenzo. Rosemary knows Ibrahim. Winston knows Molly. Molly knows Damien. Ibrahim knows Ted. Ibrahim knows Nelson. Damian knows Rosemary. Molly knows Scott. Which of Daisy and Rosemary can Damian reach?", "answer": "Rosemary", "steps": [ "Damian knows Rosemary." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Damian", "Ibrahim", "Scott", "Ted", "Winston", "Nelson", "Molly", "Rosemary", "Damien", "Lucy", "Leigh", "Cameron", "Declan", "Tina", "Fabian", "Lorenzo", "Imogen", "Daisy", "William", "Christopher" ], "edges": [ [ 0, 7 ], [ 1, 3 ], [ 1, 5 ], [ 1, 9 ], [ 4, 6 ], [ 5, 4 ], [ 6, 2 ], [ 6, 8 ], [ 7, 1 ], [ 10, 17 ], [ 11, 13 ], [ 11, 15 ], [ 11, 19 ], [ 14, 16 ], [ 15, 14 ], [ 16, 12 ], [ 16, 18 ], [ 17, 11 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Kennedy knows Curtis. Jason knows Stefan. Dave knows Kennedy. Zara knows Quinn. Malcolm knows Malik. Ann knows Malcolm. Iris knows Brett. Malik knows Zara. Malik knows Olivia. Stefan knows Anna. Roger knows Jason. Brett knows Roger. Preston knows Crystal. Erik knows Iris. Sybil knows Preston. Brett knows Sybil. Quinn knows Alfonso. Olivia knows Dave. Which of Brett and Malik can Ann reach?", "answer": "Malik", "steps": [ "Ann knows Malcolm.", "Malcolm knows Malik." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Ann", "Malik", "Olivia", "Curtis", "Zara", "Alfonso", "Malcolm", "Quinn", "Dave", "Kennedy", "Erik", "Brett", "Roger", "Anna", "Sybil", "Crystal", "Iris", "Preston", "Jason", "Stefan" ], "edges": [ [ 0, 6 ], [ 1, 4 ], [ 1, 2 ], [ 2, 8 ], [ 4, 7 ], [ 6, 1 ], [ 7, 5 ], [ 8, 9 ], [ 9, 3 ], [ 10, 16 ], [ 11, 14 ], [ 11, 12 ], [ 12, 18 ], [ 14, 17 ], [ 16, 11 ], [ 17, 15 ], [ 18, 19 ], [ 19, 13 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Ira knows Christina. Fiona knows Tiffany. Camille knows Coral. Janice knows Ira. Barry knows Robert. Tessa knows Madeline. Grace knows Jeanne. Madeline knows Alyssa. Robert knows Grace. Tessa knows Lana. Coral knows Tristan. Alyssa knows Fiona. Christina knows Diane. Camille knows Antonio. Camille knows Janice. Tessa knows Barry. Jonah knows Ramon. Tristan knows Jonah. Which of Ramon and Jeanne can Camille reach?", "answer": "Ramon", "steps": [ "Camille knows Coral.", "Coral knows Tristan.", "Tristan knows Jonah.", "Jonah knows Ramon." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Camille", "Coral", "Christina", "Jonah", "Ramon", "Diane", "Antonio", "Ira", "Janice", "Tristan", "Tessa", "Barry", "Fiona", "Grace", "Jeanne", "Tiffany", "Lana", "Alyssa", "Madeline", "Robert" ], "edges": [ [ 0, 6 ], [ 0, 8 ], [ 0, 1 ], [ 1, 9 ], [ 2, 5 ], [ 3, 4 ], [ 7, 2 ], [ 8, 7 ], [ 9, 3 ], [ 10, 16 ], [ 10, 18 ], [ 10, 11 ], [ 11, 19 ], [ 12, 15 ], [ 13, 14 ], [ 17, 12 ], [ 18, 17 ], [ 19, 13 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Tamara knows Palmer. Earle knows Odette. Brenda knows Jack. Loretta knows Shaun. Jocelyn knows Tamara. Odette knows Amelia. Amelia knows Dahlia. Riley knows Saul. Caleb knows Rhonda. Odette knows Brenda. Laurel knows Julius. Tamara knows Laurel. Jeremy knows Loretta. Dahlia knows Whitney. Palmer knows Caleb. Dahlia knows Riley. Saul knows Esme. Caleb knows Jeremy. Which of Jeremy and Riley can Earle reach?", "answer": "Riley", "steps": [ "Earle knows Odette.", "Odette knows Amelia.", "Amelia knows Dahlia.", "Dahlia knows Riley." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Earle", "Amelia", "Odette", "Dahlia", "Riley", "Esme", "Saul", "Brenda", "Jack", "Whitney", "Jocelyn", "Palmer", "Tamara", "Caleb", "Jeremy", "Shaun", "Loretta", "Laurel", "Julius", "Rhonda" ], "edges": [ [ 0, 2 ], [ 1, 3 ], [ 2, 7 ], [ 2, 1 ], [ 3, 4 ], [ 3, 9 ], [ 4, 6 ], [ 6, 5 ], [ 7, 8 ], [ 10, 12 ], [ 11, 13 ], [ 12, 17 ], [ 12, 11 ], [ 13, 14 ], [ 13, 19 ], [ 14, 16 ], [ 16, 15 ], [ 17, 18 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Veronica knows Dell. Forrest knows Keegan. Barney knows Claudia. Lara knows Chloe. Dell knows Yvette. Chloe knows Paige. Yvette knows Margaret. Keegan knows Barney. Claudia knows Nina. Hope knows Mason. Courtney knows Hope. Claudia knows Courtney. Forrest knows Lamar. Eva knows Jeff. Jeff knows Veronica. Jeff knows Winston. Yvette knows Lara. Dale knows Forrest. Which of Hope and Chloe can Dale reach?", "answer": "Hope", "steps": [ "Dale knows Forrest.", "Forrest knows Keegan.", "Keegan knows Barney.", "Barney knows Claudia.", "Claudia knows Courtney.", "Courtney knows Hope." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Dale", "Courtney", "Lamar", "Claudia", "Mason", "Keegan", "Barney", "Hope", "Nina", "Forrest", "Eva", "Lara", "Winston", "Yvette", "Paige", "Veronica", "Dell", "Chloe", "Margaret", "Jeff" ], "edges": [ [ 0, 9 ], [ 1, 7 ], [ 3, 1 ], [ 3, 8 ], [ 5, 6 ], [ 6, 3 ], [ 7, 4 ], [ 9, 2 ], [ 9, 5 ], [ 10, 19 ], [ 11, 17 ], [ 13, 11 ], [ 13, 18 ], [ 15, 16 ], [ 16, 13 ], [ 17, 14 ], [ 19, 12 ], [ 19, 15 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Mildred knows Gabriel. Louise knows Nash. Sharon knows Gustavo. Boris knows Angela. Louise knows Kobe. Corey knows Horace. Boris knows Selena. Gail knows Bryan. Gail knows Gavin. Corey knows Wilbur. Corey knows John. Boris knows Lois. Lars knows Boris. Nash knows Gail. Sharon knows Emmett. Mildred knows Lars. Nash knows Corey. Lars knows Sharon. Which of Gustavo and Gavin can Mildred reach?", "answer": "Gustavo", "steps": [ "Mildred knows Lars.", "Lars knows Sharon.", "Sharon knows Gustavo." ], "difficulty": 3, "original_distance": 3, "idx_to_symbol": [ "Mildred", "Angela", "Sharon", "Lars", "Emmett", "Gustavo", "Lois", "Selena", "Boris", "Gabriel", "Louise", "Wilbur", "Gail", "Nash", "Bryan", "Gavin", "John", "Horace", "Corey", "Kobe" ], "edges": [ [ 0, 3 ], [ 0, 9 ], [ 2, 4 ], [ 2, 5 ], [ 3, 2 ], [ 3, 8 ], [ 8, 1 ], [ 8, 6 ], [ 8, 7 ], [ 10, 13 ], [ 10, 19 ], [ 12, 14 ], [ 12, 15 ], [ 13, 12 ], [ 13, 18 ], [ 18, 11 ], [ 18, 16 ], [ 18, 17 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Bruno knows Jackson. Lionel knows Cecilia. Ramona knows Bruno. Jackson knows Veronica. Richard knows Todd. Gregory knows Ramona. Veronica knows Eric. Todd knows Chelsea. Eric knows Haven. Erica knows Lionel. Kareem knows Caleb. Lionel knows Dick. Ramona knows Norman. Bruno knows Haley. Dick knows Kareem. Erica knows Delilah. Todd knows Erica. Jackson knows Alyson. Which of Haven and Caleb can Richard reach?", "answer": "Caleb", "steps": [ "Richard knows Todd.", "Todd knows Erica.", "Erica knows Lionel.", "Lionel knows Dick.", "Dick knows Kareem.", "Kareem knows Caleb." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Richard", "Cecilia", "Todd", "Delilah", "Lionel", "Erica", "Dick", "Chelsea", "Kareem", "Caleb", "Gregory", "Alyson", "Ramona", "Haley", "Jackson", "Bruno", "Veronica", "Norman", "Eric", "Haven" ], "edges": [ [ 0, 2 ], [ 2, 7 ], [ 2, 5 ], [ 4, 1 ], [ 4, 6 ], [ 5, 3 ], [ 5, 4 ], [ 6, 8 ], [ 8, 9 ], [ 10, 12 ], [ 12, 17 ], [ 12, 15 ], [ 14, 11 ], [ 14, 16 ], [ 15, 13 ], [ 15, 14 ], [ 16, 18 ], [ 18, 19 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Ilene knows Crystal. Charlene knows Darnell. Jackson knows Lucille. Fred knows Fraser. Nathan knows Joaquin. Dominic knows Dirk. Fraser knows Milton. Coral knows Nathan. Fred knows Ilene. Harrison knows Vera. Ilene knows Charlene. Jackson knows Mildred. Milton knows Dominic. Harrison knows Estella. Harrison knows Jackson. Lucille knows Justine. Fred knows Elizabeth. Estella knows Coral. Which of Coral and Milton can Fred reach?", "answer": "Milton", "steps": [ "Fred knows Fraser.", "Fraser knows Milton." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Fred", "Dirk", "Darnell", "Charlene", "Crystal", "Ilene", "Elizabeth", "Fraser", "Dominic", "Milton", "Harrison", "Joaquin", "Justine", "Lucille", "Mildred", "Jackson", "Vera", "Estella", "Nathan", "Coral" ], "edges": [ [ 0, 5 ], [ 0, 6 ], [ 0, 7 ], [ 3, 2 ], [ 5, 3 ], [ 5, 4 ], [ 7, 9 ], [ 8, 1 ], [ 9, 8 ], [ 10, 15 ], [ 10, 16 ], [ 10, 17 ], [ 13, 12 ], [ 15, 13 ], [ 15, 14 ], [ 17, 19 ], [ 18, 11 ], [ 19, 18 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Fergus knows Guillermo. Fergus knows Aiden. Ivan knows Israel. Ivan knows Fergus. Duke knows Ilene. Camden knows Val. Renee knows Fleur. Duke knows Gabriel. Fleur knows Jude. Israel knows Duke. Fergus knows Katrina. Renee knows Camden. Val knows Eileen. Fleur knows Latoya. Gabriel knows Miles. Jem knows Dora. Fleur knows Cindy. Val knows Jem. Which of Val and Duke can Ivan reach?", "answer": "Duke", "steps": [ "Ivan knows Israel.", "Israel knows Duke." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Ivan", "Duke", "Gabriel", "Fergus", "Miles", "Ilene", "Katrina", "Aiden", "Israel", "Guillermo", "Renee", "Val", "Jem", "Fleur", "Dora", "Eileen", "Latoya", "Jude", "Camden", "Cindy" ], "edges": [ [ 0, 8 ], [ 0, 3 ], [ 1, 2 ], [ 1, 5 ], [ 2, 4 ], [ 3, 6 ], [ 3, 7 ], [ 3, 9 ], [ 8, 1 ], [ 10, 18 ], [ 10, 13 ], [ 11, 12 ], [ 11, 15 ], [ 12, 14 ], [ 13, 16 ], [ 13, 17 ], [ 13, 19 ], [ 18, 11 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Burt knows Beth. Langston knows Jamie. Ford knows Kelly. Enrique knows Langston. Langston knows Whitney. Jamie knows Anita. Eunice knows Robin. Langston knows Dakota. Enrique knows Adelaide. Anita knows Burt. Kelly knows Eunice. Jamie knows Belinda. Eunice knows Ilene. Ilene knows Sue. Ford knows Bob. Sue knows Harold. Kelly knows Jem. Kelly knows Nora. Which of Burt and Sue can Ford reach?", "answer": "Sue", "steps": [ "Ford knows Kelly.", "Kelly knows Eunice.", "Eunice knows Ilene.", "Ilene knows Sue." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Ford", "Harold", "Eunice", "Nora", "Jem", "Kelly", "Bob", "Ilene", "Robin", "Sue", "Enrique", "Beth", "Jamie", "Whitney", "Dakota", "Langston", "Adelaide", "Anita", "Belinda", "Burt" ], "edges": [ [ 0, 6 ], [ 0, 5 ], [ 2, 8 ], [ 2, 7 ], [ 5, 3 ], [ 5, 4 ], [ 5, 2 ], [ 7, 9 ], [ 9, 1 ], [ 10, 16 ], [ 10, 15 ], [ 12, 18 ], [ 12, 17 ], [ 15, 13 ], [ 15, 14 ], [ 15, 12 ], [ 17, 19 ], [ 19, 11 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Duncan knows Ford. Bart knows Ashley. Mae knows Lara. Amber knows Bart. Bart knows Frankie. Frankie knows Myra. Mae knows Taylor. Hendrix knows Hampton. Duncan knows Jessica. Ashley knows Nolan. Amber knows Audrey. Duncan knows June. Jessica knows Mae. Ashley knows Aaron. Hampton knows Harlan. Myra knows Kyle. Amber knows Julia. Jessica knows Hendrix. Which of Kyle and Harlan can Amber reach?", "answer": "Kyle", "steps": [ "Amber knows Bart.", "Bart knows Frankie.", "Frankie knows Myra.", "Myra knows Kyle." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Amber", "Myra", "Frankie", "Nolan", "Julia", "Bart", "Audrey", "Ashley", "Aaron", "Kyle", "Duncan", "Hampton", "Hendrix", "Taylor", "Ford", "Jessica", "June", "Mae", "Lara", "Harlan" ], "edges": [ [ 0, 4 ], [ 0, 6 ], [ 0, 5 ], [ 1, 9 ], [ 2, 1 ], [ 5, 7 ], [ 5, 2 ], [ 7, 3 ], [ 7, 8 ], [ 10, 14 ], [ 10, 16 ], [ 10, 15 ], [ 11, 19 ], [ 12, 11 ], [ 15, 17 ], [ 15, 12 ], [ 17, 13 ], [ 17, 18 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Jade knows Oscar. Abby knows Clifford. Jade knows Isaac. Jenny knows Monica. Jenny knows Dewey. Homer knows Ernesto. Conner knows Abby. Dewey knows Homer. Abby knows Valerie. Sue knows Conner. Isaac knows Jenny. Clifford knows Kimberly. Essie knows Jonathan. Dewey knows Donald. Clifford knows Essie. Monica knows Rex. Sue knows Yara. Valerie knows Maureen. Which of Homer and Essie can Jade reach?", "answer": "Homer", "steps": [ "Jade knows Isaac.", "Isaac knows Jenny.", "Jenny knows Dewey.", "Dewey knows Homer." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Jade", "Jenny", "Donald", "Isaac", "Homer", "Monica", "Dewey", "Oscar", "Rex", "Ernesto", "Sue", "Abby", "Kimberly", "Conner", "Essie", "Valerie", "Clifford", "Yara", "Maureen", "Jonathan" ], "edges": [ [ 0, 7 ], [ 0, 3 ], [ 1, 5 ], [ 1, 6 ], [ 3, 1 ], [ 4, 9 ], [ 5, 8 ], [ 6, 2 ], [ 6, 4 ], [ 10, 17 ], [ 10, 13 ], [ 11, 15 ], [ 11, 16 ], [ 13, 11 ], [ 14, 19 ], [ 15, 18 ], [ 16, 12 ], [ 16, 14 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Skyler knows Annie. Skyler knows Rod. Skyler knows Daphna. Esther knows Isaac. Austin knows Dana. Esther knows Chester. Annie knows Spencer. Skyler knows Rowan. Arthur knows Russell. Marvin knows Edison. Chester knows Doris. Chester knows Elise. Austin knows Marvin. Marvin knows Skyler. Chester knows Kim. Arthur knows Esther. Chester knows Terry. Kim knows Gustavo. Which of Annie and Kim can Austin reach?", "answer": "Annie", "steps": [ "Austin knows Marvin.", "Marvin knows Skyler.", "Skyler knows Annie." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Austin", "Dana", "Spencer", "Rod", "Marvin", "Skyler", "Daphna", "Rowan", "Annie", "Edison", "Arthur", "Russell", "Gustavo", "Terry", "Esther", "Chester", "Elise", "Doris", "Kim", "Isaac" ], "edges": [ [ 0, 1 ], [ 0, 4 ], [ 4, 5 ], [ 4, 9 ], [ 5, 3 ], [ 5, 6 ], [ 5, 7 ], [ 5, 8 ], [ 8, 2 ], [ 10, 11 ], [ 10, 14 ], [ 14, 15 ], [ 14, 19 ], [ 15, 13 ], [ 15, 16 ], [ 15, 17 ], [ 15, 18 ], [ 18, 12 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Tina knows Gene. Jonah knows Tina. Dale knows Shannon. Tina knows Dale. Hannah knows June. Corey knows Courtney. Cesar knows Hannah. Gene knows Archie. Miranda knows Jonah. June knows Cooper. Jenna knows Jorge. Miranda knows Jameson. Gene knows Dexter. Cesar knows Glen. Cooper knows Connor. Jenna knows Corey. Dexter knows Audrey. June knows Jenna. Which of Jonah and Hannah can Miranda reach?", "answer": "Jonah", "steps": [ "Miranda knows Jonah." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Miranda", "Tina", "Shannon", "Jonah", "Dexter", "Audrey", "Gene", "Dale", "Jameson", "Archie", "Cesar", "June", "Connor", "Hannah", "Corey", "Courtney", "Jenna", "Cooper", "Glen", "Jorge" ], "edges": [ [ 0, 8 ], [ 0, 3 ], [ 1, 7 ], [ 1, 6 ], [ 3, 1 ], [ 4, 5 ], [ 6, 4 ], [ 6, 9 ], [ 7, 2 ], [ 10, 18 ], [ 10, 13 ], [ 11, 17 ], [ 11, 16 ], [ 13, 11 ], [ 14, 15 ], [ 16, 14 ], [ 16, 19 ], [ 17, 12 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Heidi knows Lucia. Marcus knows Joy. Mark knows Rita. Keaton knows Lyle. Lyle knows Ross. Ida knows Fletcher. Erwin knows Dolores. Brittany knows Irving. Leigh knows Oliver. Garland knows Brittany. Erwin knows Leigh. Dolores knows Milo. Milo knows Marcus. Lucia knows Keaton. Keaton knows Ida. Irving knows Erwin. Milton knows Heidi. Ross knows Mark. Which of Keaton and Erwin can Milton reach?", "answer": "Keaton", "steps": [ "Milton knows Heidi.", "Heidi knows Lucia.", "Lucia knows Keaton." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Milton", "Heidi", "Ross", "Mark", "Fletcher", "Lyle", "Rita", "Lucia", "Keaton", "Ida", "Garland", "Brittany", "Milo", "Marcus", "Oliver", "Dolores", "Joy", "Irving", "Erwin", "Leigh" ], "edges": [ [ 0, 1 ], [ 1, 7 ], [ 2, 3 ], [ 3, 6 ], [ 5, 2 ], [ 7, 8 ], [ 8, 5 ], [ 8, 9 ], [ 9, 4 ], [ 10, 11 ], [ 11, 17 ], [ 12, 13 ], [ 13, 16 ], [ 15, 12 ], [ 17, 18 ], [ 18, 15 ], [ 18, 19 ], [ 19, 14 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Trina knows Martin. Ruby knows Christina. Christina knows Ariel. Enrique knows Celia. Enrique knows Arnold. Jermaine knows Andre. Arnold knows Tonya. Malik knows Enrique. Eric knows Edwin. Christina knows Tara. Ariel knows Eric. Kenneth knows Lynn. Tonya knows Cornelius. Dolly knows Pat. Tara knows Jermaine. Cornelius knows Trina. Celia knows Kenneth. Andre knows Dolly. Which of Jermaine and Tonya can Malik reach?", "answer": "Tonya", "steps": [ "Malik knows Enrique.", "Enrique knows Arnold.", "Arnold knows Tonya." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Malik", "Lynn", "Celia", "Kenneth", "Cornelius", "Arnold", "Enrique", "Trina", "Martin", "Tonya", "Ruby", "Edwin", "Ariel", "Eric", "Andre", "Tara", "Christina", "Dolly", "Pat", "Jermaine" ], "edges": [ [ 0, 6 ], [ 2, 3 ], [ 3, 1 ], [ 4, 7 ], [ 5, 9 ], [ 6, 2 ], [ 6, 5 ], [ 7, 8 ], [ 9, 4 ], [ 10, 16 ], [ 12, 13 ], [ 13, 11 ], [ 14, 17 ], [ 15, 19 ], [ 16, 12 ], [ 16, 15 ], [ 17, 18 ], [ 19, 14 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Marshall knows Heather. Ida knows Deanna. Edgar knows Edward. Scott knows Darius. Darius knows Ida. Cole knows Felicia. Samantha knows Cole. Robin knows Scott. Julian knows Blanche. Darius knows Samantha. Felicia knows Morris. Heather knows Luther. Marshall knows Edgar. Aurora knows Marshall. Blanche knows Aurora. Luther knows Fleur. Fleur knows Hilda. Joy knows Robin. Which of Morris and Hilda can Julian reach?", "answer": "Hilda", "steps": [ "Julian knows Blanche.", "Blanche knows Aurora.", "Aurora knows Marshall.", "Marshall knows Heather.", "Heather knows Luther.", "Luther knows Fleur.", "Fleur knows Hilda." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Julian", "Fleur", "Edward", "Marshall", "Luther", "Hilda", "Blanche", "Aurora", "Edgar", "Heather", "Joy", "Felicia", "Deanna", "Darius", "Cole", "Morris", "Robin", "Scott", "Ida", "Samantha" ], "edges": [ [ 0, 6 ], [ 1, 5 ], [ 3, 8 ], [ 3, 9 ], [ 4, 1 ], [ 6, 7 ], [ 7, 3 ], [ 8, 2 ], [ 9, 4 ], [ 10, 16 ], [ 11, 15 ], [ 13, 18 ], [ 13, 19 ], [ 14, 11 ], [ 16, 17 ], [ 17, 13 ], [ 18, 12 ], [ 19, 14 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Hubert knows Vivian. Victoria knows Becky. Cornelius knows Lark. Alyssa knows Caroline. Dana knows Lorraine. Lark knows Ruth. Allen knows Hendrix. Sebastian knows Victoria. Vivian knows Tabitha. Harris knows Dana. Becky knows Eamon. Eamon knows Alyssa. Lorraine knows Lawrence. Caroline knows Chloe. Lorraine knows Cornelius. Lawrence knows Randy. Alyssa knows Hubert. Hendrix knows Harris. Which of Harris and Becky can Allen reach?", "answer": "Harris", "steps": [ "Allen knows Hendrix.", "Hendrix knows Harris." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Allen", "Lawrence", "Cornelius", "Harris", "Lark", "Dana", "Ruth", "Lorraine", "Hendrix", "Randy", "Sebastian", "Caroline", "Hubert", "Becky", "Vivian", "Eamon", "Tabitha", "Alyssa", "Victoria", "Chloe" ], "edges": [ [ 0, 8 ], [ 1, 9 ], [ 2, 4 ], [ 3, 5 ], [ 4, 6 ], [ 5, 7 ], [ 7, 2 ], [ 7, 1 ], [ 8, 3 ], [ 10, 18 ], [ 11, 19 ], [ 12, 14 ], [ 13, 15 ], [ 14, 16 ], [ 15, 17 ], [ 17, 12 ], [ 17, 11 ], [ 18, 13 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Henrietta knows Janet. Brad knows Harvey. Abel knows Alan. Cole knows Brad. Emily knows Henrietta. Kamila knows Clement. Clement knows Rick. Tim knows Connor. Hailey knows Carter. Trudy knows Emily. Janet knows Jay. Carter knows Tim. Tim knows Trudy. Alan knows Shaun. Clement knows Abel. Stephanie knows Kamila. Jay knows Earle. Shaun knows Cole. Which of Jay and Brad can Hailey reach?", "answer": "Jay", "steps": [ "Hailey knows Carter.", "Carter knows Tim.", "Tim knows Trudy.", "Trudy knows Emily.", "Emily knows Henrietta.", "Henrietta knows Janet.", "Janet knows Jay." ], "difficulty": 7, "original_distance": 8, "idx_to_symbol": [ "Hailey", "Connor", "Janet", "Tim", "Emily", "Earle", "Henrietta", "Trudy", "Carter", "Jay", "Stephanie", "Rick", "Cole", "Clement", "Alan", "Harvey", "Shaun", "Abel", "Kamila", "Brad" ], "edges": [ [ 0, 8 ], [ 2, 9 ], [ 3, 1 ], [ 3, 7 ], [ 4, 6 ], [ 6, 2 ], [ 7, 4 ], [ 8, 3 ], [ 9, 5 ], [ 10, 18 ], [ 12, 19 ], [ 13, 11 ], [ 13, 17 ], [ 14, 16 ], [ 16, 12 ], [ 17, 14 ], [ 18, 13 ], [ 19, 15 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Lamar knows Pete. Darcy knows Hayes. Aaron knows Teresa. Grace knows Hazel. Kara knows Mack. Pete knows Ada. June knows Aaron. Nina knows Israel. Myra knows June. Israel knows Darcy. Myra knows Grace. Mack knows Joshua. Hazel knows Lamar. Kara knows Kamila. Joshua knows Clyde. Joshua knows Serena. Aaron knows Audrey. Kamila knows Nina. Which of Israel and Lamar can Myra reach?", "answer": "Lamar", "steps": [ "Myra knows Grace.", "Grace knows Hazel.", "Hazel knows Lamar." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Myra", "Hazel", "Teresa", "Ada", "Grace", "Lamar", "Audrey", "June", "Pete", "Aaron", "Kara", "Nina", "Serena", "Hayes", "Kamila", "Israel", "Clyde", "Mack", "Darcy", "Joshua" ], "edges": [ [ 0, 4 ], [ 0, 7 ], [ 1, 5 ], [ 4, 1 ], [ 5, 8 ], [ 7, 9 ], [ 8, 3 ], [ 9, 2 ], [ 9, 6 ], [ 10, 14 ], [ 10, 17 ], [ 11, 15 ], [ 14, 11 ], [ 15, 18 ], [ 17, 19 ], [ 18, 13 ], [ 19, 12 ], [ 19, 16 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Kay knows Ava. Asher knows Francesca. Randall knows Judith. Irving knows Daria. Asher knows Joyce. Francesca knows Destiny. Daria knows Randall. Randall knows Drew. Garland knows Shaun. Drew knows Aria. Drew knows Caroline. Francesca knows Garland. Drew knows Clinton. Shaun knows Gina. Francesca knows Isabel. Cynthia knows Jenny. Ava knows Asher. Clinton knows Cynthia. Which of Randall and Asher can Kay reach?", "answer": "Asher", "steps": [ "Kay knows Ava.", "Ava knows Asher." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Kay", "Joyce", "Shaun", "Garland", "Asher", "Gina", "Destiny", "Francesca", "Ava", "Isabel", "Irving", "Judith", "Cynthia", "Clinton", "Randall", "Jenny", "Aria", "Drew", "Daria", "Caroline" ], "edges": [ [ 0, 8 ], [ 2, 5 ], [ 3, 2 ], [ 4, 1 ], [ 4, 7 ], [ 7, 3 ], [ 7, 6 ], [ 7, 9 ], [ 8, 4 ], [ 10, 18 ], [ 12, 15 ], [ 13, 12 ], [ 14, 11 ], [ 14, 17 ], [ 17, 13 ], [ 17, 16 ], [ 17, 19 ], [ 18, 14 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Jenna knows Teresa. Brittany knows Daisy. Lucia knows Brittany. Brittany knows Alice. Brittany knows Hamilton. Hampton knows Mike. Teresa knows Kaleb. Teresa knows Drew. Brittany knows Jeremiah. Kaleb knows Ernesto. Kaleb knows Angela. Raquel knows Wendy. Teresa knows Ariel. Hamilton knows Raquel. Teresa knows Hampton. Mike knows Cornelius. Alice knows Blanche. Alice knows Karen. Which of Hamilton and Hampton can Jenna reach?", "answer": "Hampton", "steps": [ "Jenna knows Teresa.", "Teresa knows Hampton." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Jenna", "Ariel", "Ernesto", "Hampton", "Drew", "Cornelius", "Angela", "Mike", "Teresa", "Kaleb", "Lucia", "Jeremiah", "Karen", "Hamilton", "Daisy", "Wendy", "Blanche", "Raquel", "Brittany", "Alice" ], "edges": [ [ 0, 8 ], [ 3, 7 ], [ 7, 5 ], [ 8, 1 ], [ 8, 4 ], [ 8, 3 ], [ 8, 9 ], [ 9, 2 ], [ 9, 6 ], [ 10, 18 ], [ 13, 17 ], [ 17, 15 ], [ 18, 11 ], [ 18, 14 ], [ 18, 13 ], [ 18, 19 ], [ 19, 12 ], [ 19, 16 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Erik knows Nicole. Kerry knows Martin. Lyle knows Jacqueline. Pablo knows Eugenia. Hayden knows Carlton. Bart knows Alan. Kerry knows Darius. Zane knows Nadine. Richard knows Shelly. Zane knows Pablo. Martin knows Wanda. Stefan knows Zane. Kerry knows Bart. Stefan knows Erik. Zane knows Richard. Lyle knows Hayden. Lyle knows Kerry. Stefan knows Liam. Which of Kerry and Zane can Lyle reach?", "answer": "Kerry", "steps": [ "Lyle knows Kerry." ], "difficulty": 1, "original_distance": 3, "idx_to_symbol": [ "Lyle", "Carlton", "Bart", "Hayden", "Kerry", "Alan", "Martin", "Darius", "Jacqueline", "Wanda", "Stefan", "Nicole", "Richard", "Erik", "Zane", "Shelly", "Pablo", "Nadine", "Liam", "Eugenia" ], "edges": [ [ 0, 3 ], [ 0, 8 ], [ 0, 4 ], [ 2, 5 ], [ 3, 1 ], [ 4, 2 ], [ 4, 7 ], [ 4, 6 ], [ 6, 9 ], [ 10, 13 ], [ 10, 18 ], [ 10, 14 ], [ 12, 15 ], [ 13, 11 ], [ 14, 12 ], [ 14, 17 ], [ 14, 16 ], [ 16, 19 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Arturo knows Herbert. Randy knows Ray. Mark knows Arturo. Herbert knows Oliver. Madeline knows Kim. Vivian knows Harry. Herbert knows Arnold. Randy knows Deanna. Eden knows Anna. Deanna knows Madeline. Arturo knows Isaac. Anna knows Isabel. Vivian knows Zane. Zane knows Courtney. Madeline knows Vivian. Eden knows Mark. Oliver knows Clement. Ray knows Paula. Which of Herbert and Vivian can Randy reach?", "answer": "Vivian", "steps": [ "Randy knows Deanna.", "Deanna knows Madeline.", "Madeline knows Vivian." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Randy", "Harry", "Ray", "Paula", "Deanna", "Courtney", "Zane", "Madeline", "Vivian", "Kim", "Eden", "Arnold", "Anna", "Isabel", "Mark", "Clement", "Oliver", "Arturo", "Herbert", "Isaac" ], "edges": [ [ 0, 2 ], [ 0, 4 ], [ 2, 3 ], [ 4, 7 ], [ 6, 5 ], [ 7, 8 ], [ 7, 9 ], [ 8, 1 ], [ 8, 6 ], [ 10, 12 ], [ 10, 14 ], [ 12, 13 ], [ 14, 17 ], [ 16, 15 ], [ 17, 18 ], [ 17, 19 ], [ 18, 11 ], [ 18, 16 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Rosemary knows Maria. William knows Tiffany. Georgia knows Ricardo. Ricardo knows Sadie. Mitchell knows Rosemary. Zack knows William. Sadie knows Colby. Ricardo knows Leigh. Rosemary knows Zack. William knows Miles. Victoria knows Dallas. Duncan knows Victoria. Victoria knows Georgia. Victoria knows Clarissa. Olivia knows Mitchell. Paula knows Duncan. Rosemary knows Garrison. Miles knows Anna. Which of William and Ricardo can Olivia reach?", "answer": "William", "steps": [ "Olivia knows Mitchell.", "Mitchell knows Rosemary.", "Rosemary knows Zack.", "Zack knows William." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Olivia", "Mitchell", "Anna", "Zack", "William", "Rosemary", "Tiffany", "Miles", "Maria", "Garrison", "Paula", "Duncan", "Colby", "Georgia", "Ricardo", "Victoria", "Leigh", "Sadie", "Clarissa", "Dallas" ], "edges": [ [ 0, 1 ], [ 1, 5 ], [ 3, 4 ], [ 4, 6 ], [ 4, 7 ], [ 5, 3 ], [ 5, 8 ], [ 5, 9 ], [ 7, 2 ], [ 10, 11 ], [ 11, 15 ], [ 13, 14 ], [ 14, 16 ], [ 14, 17 ], [ 15, 13 ], [ 15, 18 ], [ 15, 19 ], [ 17, 12 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Lamar knows Pete. Darcy knows Hayes. Aaron knows Teresa. Grace knows Hazel. Kara knows Mack. Pete knows Ada. June knows Aaron. Nina knows Israel. Myra knows June. Israel knows Darcy. Myra knows Grace. Mack knows Joshua. Hazel knows Lamar. Kara knows Kamila. Joshua knows Clyde. Joshua knows Serena. Aaron knows Audrey. Kamila knows Nina. Which of Ada and Hayes can Myra reach?", "answer": "Ada", "steps": [ "Myra knows Grace.", "Grace knows Hazel.", "Hazel knows Lamar.", "Lamar knows Pete.", "Pete knows Ada." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Myra", "Hazel", "Teresa", "Ada", "Grace", "Lamar", "Audrey", "June", "Pete", "Aaron", "Kara", "Nina", "Serena", "Hayes", "Kamila", "Israel", "Clyde", "Mack", "Darcy", "Joshua" ], "edges": [ [ 0, 4 ], [ 0, 7 ], [ 1, 5 ], [ 4, 1 ], [ 5, 8 ], [ 7, 9 ], [ 8, 3 ], [ 9, 2 ], [ 9, 6 ], [ 10, 14 ], [ 10, 17 ], [ 11, 15 ], [ 14, 11 ], [ 15, 18 ], [ 17, 19 ], [ 18, 13 ], [ 19, 12 ], [ 19, 16 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Sarah knows Natalie. Blake knows Yasmin. Lottie knows Dave. Jenna knows Mildred. Yasmin knows Judith. Declan knows Martha. August knows Patrick. Laura knows Sarah. Dave knows Geraldine. Sarah knows Carson. Patrick knows Lottie. Dean knows Lucia. Kylie knows Laura. Carson knows Declan. Martha knows Dean. Dave knows Blake. Curtis knows Kylie. Judith knows Jenna. Which of Sarah and Dave can August reach?", "answer": "Dave", "steps": [ "August knows Patrick.", "Patrick knows Lottie.", "Lottie knows Dave." ], "difficulty": 3, "original_distance": 8, "idx_to_symbol": [ "August", "Blake", "Judith", "Geraldine", "Dave", "Lottie", "Mildred", "Jenna", "Yasmin", "Patrick", "Curtis", "Carson", "Martha", "Natalie", "Sarah", "Laura", "Lucia", "Dean", "Declan", "Kylie" ], "edges": [ [ 0, 9 ], [ 1, 8 ], [ 2, 7 ], [ 4, 3 ], [ 4, 1 ], [ 5, 4 ], [ 7, 6 ], [ 8, 2 ], [ 9, 5 ], [ 10, 19 ], [ 11, 18 ], [ 12, 17 ], [ 14, 13 ], [ 14, 11 ], [ 15, 14 ], [ 17, 16 ], [ 18, 12 ], [ 19, 15 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Susanne knows Knox. Jana knows Jamie. Thea knows Sydney. Sydney knows Larissa. Kobe knows Percy. Knox knows Irene. Percy knows Jeanette. Thea knows Whitney. Shane knows Kobe. Knox knows Jem. Percy knows Howard. Jem knows Thea. Ethan knows Shane. Shane knows Clay. Ashley knows Kelly. Jeanette knows Jack. Jana knows Susanne. Ashley knows Ethan. Which of Knox and Shane can Jana reach?", "answer": "Knox", "steps": [ "Jana knows Susanne.", "Susanne knows Knox." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Jana", "Jamie", "Thea", "Irene", "Larissa", "Whitney", "Sydney", "Jem", "Knox", "Susanne", "Ashley", "Kelly", "Percy", "Clay", "Jack", "Howard", "Jeanette", "Kobe", "Shane", "Ethan" ], "edges": [ [ 0, 1 ], [ 0, 9 ], [ 2, 5 ], [ 2, 6 ], [ 6, 4 ], [ 7, 2 ], [ 8, 3 ], [ 8, 7 ], [ 9, 8 ], [ 10, 11 ], [ 10, 19 ], [ 12, 15 ], [ 12, 16 ], [ 16, 14 ], [ 17, 12 ], [ 18, 13 ], [ 18, 17 ], [ 19, 18 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Sandy knows Cristina. Cristina knows Eleanor. Arlene knows Alder. Eleanor knows Opal. Arlene knows Dewey. Tamara knows Louis. Eleanor knows Gene. Adelaide knows Ellis. Opal knows Adelaide. Stella knows Judy. Dewey knows Tamara. Brenda knows Darcy. Judy knows Arlene. Alder knows Brenda. Peggy knows Abel. Brenda knows Lola. Adelaide knows Allen. Gene knows Peggy. Which of Cristina and Judy can Stella reach?", "answer": "Judy", "steps": [ "Stella knows Judy." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Stella", "Louis", "Arlene", "Lola", "Darcy", "Dewey", "Alder", "Judy", "Tamara", "Brenda", "Sandy", "Abel", "Eleanor", "Ellis", "Allen", "Gene", "Opal", "Cristina", "Peggy", "Adelaide" ], "edges": [ [ 0, 7 ], [ 2, 5 ], [ 2, 6 ], [ 5, 8 ], [ 6, 9 ], [ 7, 2 ], [ 8, 1 ], [ 9, 3 ], [ 9, 4 ], [ 10, 17 ], [ 12, 15 ], [ 12, 16 ], [ 15, 18 ], [ 16, 19 ], [ 17, 12 ], [ 18, 11 ], [ 19, 13 ], [ 19, 14 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Ethan knows Odette. Trevor knows Francesca. Ethan knows Fisher. Trevor knows Miranda. Ian knows Kirk. Russ knows Ethan. Emma knows Heidi. Francesca knows Barney. Ethan knows Daisy. Emma knows Livia. Emma knows Ian. Lars knows Russ. Dale knows Emma. Javier knows Fritz. Lars knows Bart. Odette knows Antonio. Trevor knows Dale. Lars knows Javier. Which of Ethan and Emma can Lars reach?", "answer": "Ethan", "steps": [ "Lars knows Russ.", "Russ knows Ethan." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Lars", "Fritz", "Antonio", "Bart", "Odette", "Javier", "Russ", "Fisher", "Daisy", "Ethan", "Trevor", "Barney", "Kirk", "Miranda", "Ian", "Francesca", "Dale", "Livia", "Heidi", "Emma" ], "edges": [ [ 0, 3 ], [ 0, 5 ], [ 0, 6 ], [ 4, 2 ], [ 5, 1 ], [ 6, 9 ], [ 9, 4 ], [ 9, 7 ], [ 9, 8 ], [ 10, 13 ], [ 10, 15 ], [ 10, 16 ], [ 14, 12 ], [ 15, 11 ], [ 16, 19 ], [ 19, 14 ], [ 19, 17 ], [ 19, 18 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Holly knows Mara. Luz knows Sandy. Clara knows Gail. Wallace knows Chelsea. Terrence knows Dewey. Chelsea knows Christopher. Grady knows Chester. Humphrey knows Luz. Chelsea knows Dina. Chester knows Terrence. Sandy knows Clara. Grady knows Humphrey. Pam knows Wallace. Clara knows Shaun. Yolanda knows Ellis. Francis knows Pam. Ellis knows Holly. Yolanda knows Francis. Which of Francis and Humphrey can Yolanda reach?", "answer": "Francis", "steps": [ "Yolanda knows Francis." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Yolanda", "Pam", "Wallace", "Mara", "Christopher", "Holly", "Chelsea", "Ellis", "Dina", "Francis", "Grady", "Luz", "Sandy", "Dewey", "Shaun", "Terrence", "Clara", "Chester", "Gail", "Humphrey" ], "edges": [ [ 0, 7 ], [ 0, 9 ], [ 1, 2 ], [ 2, 6 ], [ 5, 3 ], [ 6, 4 ], [ 6, 8 ], [ 7, 5 ], [ 9, 1 ], [ 10, 17 ], [ 10, 19 ], [ 11, 12 ], [ 12, 16 ], [ 15, 13 ], [ 16, 14 ], [ 16, 18 ], [ 17, 15 ], [ 19, 11 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Kent knows Spencer. Virginia knows Stanley. Desmond knows Seth. Erwin knows Stuart. Stuart knows Clarissa. Kira knows Harlan. Virginia knows Pierce. Virginia knows Douglas. Douglas knows Amanda. Erwin knows Kent. Kent knows Quinn. Tony knows Erwin. Gage knows Dalton. Seth knows Gage. Kent knows Kira. Virginia knows Chad. Seth knows Virginia. Kent knows Darnell. Which of Douglas and Kira can Tony reach?", "answer": "Kira", "steps": [ "Tony knows Erwin.", "Erwin knows Kent.", "Kent knows Kira." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Tony", "Spencer", "Erwin", "Clarissa", "Stuart", "Kent", "Kira", "Harlan", "Darnell", "Quinn", "Desmond", "Pierce", "Seth", "Dalton", "Gage", "Virginia", "Douglas", "Amanda", "Chad", "Stanley" ], "edges": [ [ 0, 2 ], [ 2, 4 ], [ 2, 5 ], [ 4, 3 ], [ 5, 1 ], [ 5, 6 ], [ 5, 8 ], [ 5, 9 ], [ 6, 7 ], [ 10, 12 ], [ 12, 14 ], [ 12, 15 ], [ 14, 13 ], [ 15, 11 ], [ 15, 16 ], [ 15, 18 ], [ 15, 19 ], [ 16, 17 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Heidi knows Lucia. Marcus knows Joy. Mark knows Rita. Keaton knows Lyle. Lyle knows Ross. Ida knows Fletcher. Erwin knows Dolores. Brittany knows Irving. Leigh knows Oliver. Garland knows Brittany. Erwin knows Leigh. Dolores knows Milo. Milo knows Marcus. Lucia knows Keaton. Keaton knows Ida. Irving knows Erwin. Milton knows Heidi. Ross knows Mark. Which of Ross and Milo can Milton reach?", "answer": "Ross", "steps": [ "Milton knows Heidi.", "Heidi knows Lucia.", "Lucia knows Keaton.", "Keaton knows Lyle.", "Lyle knows Ross." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Milton", "Heidi", "Ross", "Mark", "Fletcher", "Lyle", "Rita", "Lucia", "Keaton", "Ida", "Garland", "Brittany", "Milo", "Marcus", "Oliver", "Dolores", "Joy", "Irving", "Erwin", "Leigh" ], "edges": [ [ 0, 1 ], [ 1, 7 ], [ 2, 3 ], [ 3, 6 ], [ 5, 2 ], [ 7, 8 ], [ 8, 5 ], [ 8, 9 ], [ 9, 4 ], [ 10, 11 ], [ 11, 17 ], [ 12, 13 ], [ 13, 16 ], [ 15, 12 ], [ 17, 18 ], [ 18, 15 ], [ 18, 19 ], [ 19, 14 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Jarvis knows Clay. Will knows Kendrick. Philip knows Dirk. June knows Brooks. Marshall knows Loretta. Tony knows Lyle. Milton knows Jarvis. Kendrick knows Marshall. Marco knows Will. Israel knows Marco. Kendrick knows Gene. Milton knows Seth. Will knows Lola. Laverne knows Jorge. June knows Milton. Clay knows Laverne. Dirk knows June. Loretta knows Tony. Which of Laverne and Tony can Israel reach?", "answer": "Tony", "steps": [ "Israel knows Marco.", "Marco knows Will.", "Will knows Kendrick.", "Kendrick knows Marshall.", "Marshall knows Loretta.", "Loretta knows Tony." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Israel", "Lyle", "Will", "Gene", "Tony", "Kendrick", "Marshall", "Marco", "Lola", "Loretta", "Philip", "Jorge", "June", "Seth", "Laverne", "Milton", "Jarvis", "Dirk", "Brooks", "Clay" ], "edges": [ [ 0, 7 ], [ 2, 8 ], [ 2, 5 ], [ 4, 1 ], [ 5, 3 ], [ 5, 6 ], [ 6, 9 ], [ 7, 2 ], [ 9, 4 ], [ 10, 17 ], [ 12, 18 ], [ 12, 15 ], [ 14, 11 ], [ 15, 13 ], [ 15, 16 ], [ 16, 19 ], [ 17, 12 ], [ 19, 14 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Leander knows Henry. Arthur knows India. Joseph knows Delilah. Lewis knows Daniel. Martin knows Leander. Alison knows Arthur. Kendra knows Joseph. Leander knows Susan. Lewis knows Gerard. Christian knows Kieran. Delilah knows Heath. Boyd knows Christian. Arthur knows Lewis. Susan knows Fabian. Daniel knows Boyd. Joseph knows Chloe. Boyd knows Walt. Susan knows Kendra. Which of Delilah and Christian can Alison reach?", "answer": "Christian", "steps": [ "Alison knows Arthur.", "Arthur knows Lewis.", "Lewis knows Daniel.", "Daniel knows Boyd.", "Boyd knows Christian." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Alison", "India", "Gerard", "Arthur", "Daniel", "Kieran", "Lewis", "Christian", "Walt", "Boyd", "Martin", "Henry", "Fabian", "Leander", "Kendra", "Heath", "Susan", "Delilah", "Chloe", "Joseph" ], "edges": [ [ 0, 3 ], [ 3, 1 ], [ 3, 6 ], [ 4, 9 ], [ 6, 2 ], [ 6, 4 ], [ 7, 5 ], [ 9, 7 ], [ 9, 8 ], [ 10, 13 ], [ 13, 11 ], [ 13, 16 ], [ 14, 19 ], [ 16, 12 ], [ 16, 14 ], [ 17, 15 ], [ 19, 17 ], [ 19, 18 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Coral knows Olive. Eldon knows Amy. Clayton knows Kamila. Estelle knows Bernadette. Bernadette knows Jorge. Adele knows Fabian. Guillermo knows Eldon. Dora knows Becky. Burt knows Dora. Becky knows Adele. Archer knows Clayton. Clayton knows Coral. Nancy knows Annie. Kamila knows Nancy. Ariana knows Burt. Fabian knows Paul. Jorge knows Archer. Adele knows Guillermo. Which of Bernadette and Burt can Estelle reach?", "answer": "Bernadette", "steps": [ "Estelle knows Bernadette." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Estelle", "Kamila", "Bernadette", "Olive", "Annie", "Nancy", "Jorge", "Coral", "Clayton", "Archer", "Ariana", "Guillermo", "Burt", "Paul", "Amy", "Eldon", "Dora", "Fabian", "Adele", "Becky" ], "edges": [ [ 0, 2 ], [ 1, 5 ], [ 2, 6 ], [ 5, 4 ], [ 6, 9 ], [ 7, 3 ], [ 8, 1 ], [ 8, 7 ], [ 9, 8 ], [ 10, 12 ], [ 11, 15 ], [ 12, 16 ], [ 15, 14 ], [ 16, 19 ], [ 17, 13 ], [ 18, 11 ], [ 18, 17 ], [ 19, 18 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Raymond knows Marlene. Dylan knows Howard. Sydney knows Demetrius. Lisa knows Dylan. Fisher knows Nadine. Bruce knows Lisa. Cooper knows Jerry. Craig knows Monroe. Marlene knows Fisher. Craig knows Maggie. Lisa knows Sydney. Jerry knows Stephanie. Monroe knows Kent. Maggie knows Khashayar. Malik knows Craig. Stephanie knows Elaine. Howard knows Cooper. Khashayar knows Raymond. Which of Stephanie and Fisher can Bruce reach?", "answer": "Stephanie", "steps": [ "Bruce knows Lisa.", "Lisa knows Dylan.", "Dylan knows Howard.", "Howard knows Cooper.", "Cooper knows Jerry.", "Jerry knows Stephanie." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Bruce", "Jerry", "Lisa", "Sydney", "Elaine", "Howard", "Stephanie", "Demetrius", "Cooper", "Dylan", "Malik", "Marlene", "Craig", "Monroe", "Nadine", "Khashayar", "Fisher", "Kent", "Raymond", "Maggie" ], "edges": [ [ 0, 2 ], [ 1, 6 ], [ 2, 3 ], [ 2, 9 ], [ 3, 7 ], [ 5, 8 ], [ 6, 4 ], [ 8, 1 ], [ 9, 5 ], [ 10, 12 ], [ 11, 16 ], [ 12, 13 ], [ 12, 19 ], [ 13, 17 ], [ 15, 18 ], [ 16, 14 ], [ 18, 11 ], [ 19, 15 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Arden knows Jason. Fritz knows Carlton. Fritz knows Clarence. Chad knows Virginia. Jason knows Chad. Dwight knows Dustin. Hugo knows Colby. Clarence knows Eleanor. Dustin knows Vincent. Carlton knows Kingsley. Colby knows Brock. Hugo knows Devon. Vincent knows Arturo. Vincent knows Hugo. Vincent knows Eve. Chad knows Fritz. Devon knows Jasmine. Chad knows Caroline. Which of Dustin and Jason can Arden reach?", "answer": "Jason", "steps": [ "Arden knows Jason." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Arden", "Carlton", "Jason", "Caroline", "Eleanor", "Clarence", "Virginia", "Chad", "Kingsley", "Fritz", "Dwight", "Colby", "Dustin", "Eve", "Jasmine", "Devon", "Arturo", "Vincent", "Brock", "Hugo" ], "edges": [ [ 0, 2 ], [ 1, 8 ], [ 2, 7 ], [ 5, 4 ], [ 7, 3 ], [ 7, 6 ], [ 7, 9 ], [ 9, 5 ], [ 9, 1 ], [ 10, 12 ], [ 11, 18 ], [ 12, 17 ], [ 15, 14 ], [ 17, 13 ], [ 17, 16 ], [ 17, 19 ], [ 19, 15 ], [ 19, 11 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Robin knows Bridget. Darla knows Garrison. Kennedy knows Elsa. Darla knows Roland. Louis knows Robin. Mindy knows Kennedy. Garrett knows Glenda. Emma knows Mae. Kennedy knows Garrett. Garrett knows Jenna. Garrison knows Emma. Emma knows Janet. Marcus knows Kane. Mason knows Marcus. Garrett knows Mason. Marcus knows Iris. Darla knows Nelson. Robin knows Darla. Which of Garrison and Mason can Louis reach?", "answer": "Garrison", "steps": [ "Louis knows Robin.", "Robin knows Darla.", "Darla knows Garrison." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Louis", "Emma", "Janet", "Mae", "Bridget", "Nelson", "Roland", "Darla", "Robin", "Garrison", "Mindy", "Marcus", "Iris", "Kane", "Elsa", "Jenna", "Glenda", "Garrett", "Kennedy", "Mason" ], "edges": [ [ 0, 8 ], [ 1, 2 ], [ 1, 3 ], [ 7, 5 ], [ 7, 6 ], [ 7, 9 ], [ 8, 4 ], [ 8, 7 ], [ 9, 1 ], [ 10, 18 ], [ 11, 12 ], [ 11, 13 ], [ 17, 15 ], [ 17, 16 ], [ 17, 19 ], [ 18, 14 ], [ 18, 17 ], [ 19, 11 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Lambert knows Hailey. Hattie knows Zach. Hattie knows Jay. Anton knows Perry. Lillian knows Aaron. Aaron knows Hayley. Martha knows Lillian. Anton knows Gordon. Wanda knows Alexa. Laverne knows Lambert. Elizabeth knows Hattie. Jay knows Laverne. Gordon knows Lenora. Laverne knows Bart. Aaron knows Wanda. Jay knows Shaun. Rosa knows Elizabeth. Wanda knows Anton. Which of Elizabeth and Lillian can Rosa reach?", "answer": "Elizabeth", "steps": [ "Rosa knows Elizabeth." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Rosa", "Jay", "Lambert", "Laverne", "Hattie", "Hailey", "Shaun", "Bart", "Elizabeth", "Zach", "Martha", "Wanda", "Gordon", "Anton", "Aaron", "Lenora", "Alexa", "Perry", "Lillian", "Hayley" ], "edges": [ [ 0, 8 ], [ 1, 6 ], [ 1, 3 ], [ 2, 5 ], [ 3, 2 ], [ 3, 7 ], [ 4, 1 ], [ 4, 9 ], [ 8, 4 ], [ 10, 18 ], [ 11, 16 ], [ 11, 13 ], [ 12, 15 ], [ 13, 12 ], [ 13, 17 ], [ 14, 11 ], [ 14, 19 ], [ 18, 14 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Eldon knows Yvonne. Chris knows Mara. Yvonne knows Imogen. Jessica knows Fraser. Vicki knows Veronica. Alma knows Duke. Zack knows Alma. Elvira knows Anita. Mara knows Celeste. Mara knows Jessica. Yvonne knows Luz. Mara knows Eileen. Mara knows Diane. Veronica knows Gene. Alma knows Chris. Yvonne knows Helen. Veronica knows Eldon. Yvonne knows Elvira. Which of Alma and Veronica can Vicki reach?", "answer": "Veronica", "steps": [ "Vicki knows Veronica." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Vicki", "Gene", "Luz", "Elvira", "Helen", "Veronica", "Yvonne", "Eldon", "Anita", "Imogen", "Zack", "Duke", "Diane", "Jessica", "Eileen", "Alma", "Mara", "Chris", "Fraser", "Celeste" ], "edges": [ [ 0, 5 ], [ 3, 8 ], [ 5, 1 ], [ 5, 7 ], [ 6, 2 ], [ 6, 4 ], [ 6, 3 ], [ 6, 9 ], [ 7, 6 ], [ 10, 15 ], [ 13, 18 ], [ 15, 11 ], [ 15, 17 ], [ 16, 12 ], [ 16, 14 ], [ 16, 13 ], [ 16, 19 ], [ 17, 16 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Jose knows Ross. Layla knows Clyde. Corinne knows Julia. Lars knows Jose. Dahlia knows Melissa. Yuki knows Lars. Tessa knows Dahlia. Lars knows Layla. Curtis knows Isla. Amelia knows Tessa. Julia knows Yolanda. Ross knows Carlos. Carlos knows Corinne. Isla knows Amanda. Lamar knows Curtis. Brandon knows Clement. Melissa knows Brandon. Curtis knows Amelia. Which of Yolanda and Clement can Yuki reach?", "answer": "Yolanda", "steps": [ "Yuki knows Lars.", "Lars knows Jose.", "Jose knows Ross.", "Ross knows Carlos.", "Carlos knows Corinne.", "Corinne knows Julia.", "Julia knows Yolanda." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Yuki", "Carlos", "Julia", "Ross", "Lars", "Yolanda", "Corinne", "Jose", "Clyde", "Layla", "Lamar", "Dahlia", "Brandon", "Tessa", "Curtis", "Clement", "Melissa", "Amelia", "Amanda", "Isla" ], "edges": [ [ 0, 4 ], [ 1, 6 ], [ 2, 5 ], [ 3, 1 ], [ 4, 7 ], [ 4, 9 ], [ 6, 2 ], [ 7, 3 ], [ 9, 8 ], [ 10, 14 ], [ 11, 16 ], [ 12, 15 ], [ 13, 11 ], [ 14, 17 ], [ 14, 19 ], [ 16, 12 ], [ 17, 13 ], [ 19, 18 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Robin knows Bridget. Darla knows Garrison. Kennedy knows Elsa. Darla knows Roland. Louis knows Robin. Mindy knows Kennedy. Garrett knows Glenda. Emma knows Mae. Kennedy knows Garrett. Garrett knows Jenna. Garrison knows Emma. Emma knows Janet. Marcus knows Kane. Mason knows Marcus. Garrett knows Mason. Marcus knows Iris. Darla knows Nelson. Robin knows Darla. Which of Mae and Kane can Louis reach?", "answer": "Mae", "steps": [ "Louis knows Robin.", "Robin knows Darla.", "Darla knows Garrison.", "Garrison knows Emma.", "Emma knows Mae." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Louis", "Emma", "Janet", "Mae", "Bridget", "Nelson", "Roland", "Darla", "Robin", "Garrison", "Mindy", "Marcus", "Iris", "Kane", "Elsa", "Jenna", "Glenda", "Garrett", "Kennedy", "Mason" ], "edges": [ [ 0, 8 ], [ 1, 2 ], [ 1, 3 ], [ 7, 5 ], [ 7, 6 ], [ 7, 9 ], [ 8, 4 ], [ 8, 7 ], [ 9, 1 ], [ 10, 18 ], [ 11, 12 ], [ 11, 13 ], [ 17, 15 ], [ 17, 16 ], [ 17, 19 ], [ 18, 14 ], [ 18, 17 ], [ 19, 11 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Luther knows Jim. Jessie knows Julius. Norma knows Clay. Jasper knows Mae. Jim knows Virginia. Zoe knows Evan. Dakota knows Zach. Clay knows Fisher. Julius knows Dexter. Dakota knows Zoe. Mae knows Dakota. Virginia knows Brooke. Fisher knows Garland. Brooke knows Jessie. Daisy knows Luther. Rowan knows Daisy. Luther knows Hope. Evan knows Norma. Which of Brooke and Norma can Rowan reach?", "answer": "Brooke", "steps": [ "Rowan knows Daisy.", "Daisy knows Luther.", "Luther knows Jim.", "Jim knows Virginia.", "Virginia knows Brooke." ], "difficulty": 5, "original_distance": 8, "idx_to_symbol": [ "Rowan", "Jessie", "Julius", "Brooke", "Jim", "Dexter", "Luther", "Virginia", "Daisy", "Hope", "Jasper", "Clay", "Fisher", "Norma", "Zoe", "Garland", "Dakota", "Evan", "Mae", "Zach" ], "edges": [ [ 0, 8 ], [ 1, 2 ], [ 2, 5 ], [ 3, 1 ], [ 4, 7 ], [ 6, 4 ], [ 6, 9 ], [ 7, 3 ], [ 8, 6 ], [ 10, 18 ], [ 11, 12 ], [ 12, 15 ], [ 13, 11 ], [ 14, 17 ], [ 16, 14 ], [ 16, 19 ], [ 17, 13 ], [ 18, 16 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Maria knows Irma. Alma knows Maria. Irma knows Sylvia. Jolene knows Tanya. Belinda knows Gordon. Irma knows Allen. Harmony knows Dean. Riley knows Tony. Esperanza knows Jolene. Dominic knows Esperanza. Tanya knows Blanche. Harmony knows Belinda. Dominic knows Luna. Esperanza knows Luke. Tanya knows Elias. Riley knows Dominic. Alma knows Taylor. Belinda knows Alma. Which of Jolene and Maria can Harmony reach?", "answer": "Maria", "steps": [ "Harmony knows Belinda.", "Belinda knows Alma.", "Alma knows Maria." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Harmony", "Allen", "Alma", "Maria", "Belinda", "Taylor", "Irma", "Dean", "Gordon", "Sylvia", "Riley", "Blanche", "Esperanza", "Jolene", "Dominic", "Luke", "Tanya", "Tony", "Luna", "Elias" ], "edges": [ [ 0, 7 ], [ 0, 4 ], [ 2, 5 ], [ 2, 3 ], [ 3, 6 ], [ 4, 8 ], [ 4, 2 ], [ 6, 1 ], [ 6, 9 ], [ 10, 17 ], [ 10, 14 ], [ 12, 15 ], [ 12, 13 ], [ 13, 16 ], [ 14, 18 ], [ 14, 12 ], [ 16, 11 ], [ 16, 19 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Alma knows Melody. Haley knows Gina. Tanya knows Kane. Yara knows Evan. Greer knows Zara. Kane knows Aaron. David knows Jenny. Tanya knows Maggie. Zara knows Tanya. Amanda knows Haley. Melody knows David. Maggie knows Bruce. Aaron knows Monroe. Greer knows Selena. Kane knows Uma. Yara knows Alma. Amanda knows Abby. Melody knows Amanda. Which of Alma and Zara can Greer reach?", "answer": "Zara", "steps": [ "Greer knows Zara." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Greer", "Zara", "Tanya", "Uma", "Kane", "Maggie", "Monroe", "Bruce", "Selena", "Aaron", "Yara", "Alma", "Melody", "Abby", "Amanda", "David", "Gina", "Jenny", "Evan", "Haley" ], "edges": [ [ 0, 8 ], [ 0, 1 ], [ 1, 2 ], [ 2, 5 ], [ 2, 4 ], [ 4, 3 ], [ 4, 9 ], [ 5, 7 ], [ 9, 6 ], [ 10, 18 ], [ 10, 11 ], [ 11, 12 ], [ 12, 15 ], [ 12, 14 ], [ 14, 13 ], [ 14, 19 ], [ 15, 17 ], [ 19, 16 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Jarvis knows Marshall. Brandon knows Lambert. Charlene knows Kirk. Owen knows Amelia. Edison knows Derek. Charlene knows William. Jackson knows Owen. Jarvis knows Eli. Marshall knows Preston. Finn knows Ella. Virginia knows Edison. Finn knows Virginia. Finn knows Carrie. William knows Jarvis. Carrie knows Brandon. Edison knows Doug. Charlene knows Jackson. Doug knows Kathleen. Which of Marshall and Doug can Finn reach?", "answer": "Doug", "steps": [ "Finn knows Virginia.", "Virginia knows Edison.", "Edison knows Doug." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Finn", "Derek", "Virginia", "Brandon", "Kathleen", "Carrie", "Lambert", "Ella", "Doug", "Edison", "Charlene", "Eli", "William", "Owen", "Preston", "Jackson", "Amelia", "Kirk", "Marshall", "Jarvis" ], "edges": [ [ 0, 5 ], [ 0, 7 ], [ 0, 2 ], [ 2, 9 ], [ 3, 6 ], [ 5, 3 ], [ 8, 4 ], [ 9, 1 ], [ 9, 8 ], [ 10, 15 ], [ 10, 17 ], [ 10, 12 ], [ 12, 19 ], [ 13, 16 ], [ 15, 13 ], [ 18, 14 ], [ 19, 11 ], [ 19, 18 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Dell knows Hope. Veronica knows Gage. Gage knows Kelsey. Langston knows Devon. Ricardo knows Samuel. Dell knows Ricardo. Sebastian knows Alder. Sebastian knows Nicole. Hope knows Emery. Gage knows Logan. Devon knows Demetrius. Demetrius knows Sybil. Elena knows Sebastian. Emery knows Elena. Sybil knows Veronica. Denver knows Leo. Devon knows Denver. Hannah knows Dell. Which of Demetrius and Hope can Hannah reach?", "answer": "Hope", "steps": [ "Hannah knows Dell.", "Dell knows Hope." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Hannah", "Ricardo", "Dell", "Hope", "Sebastian", "Elena", "Alder", "Emery", "Nicole", "Samuel", "Langston", "Denver", "Devon", "Demetrius", "Gage", "Veronica", "Kelsey", "Sybil", "Logan", "Leo" ], "edges": [ [ 0, 2 ], [ 1, 9 ], [ 2, 3 ], [ 2, 1 ], [ 3, 7 ], [ 4, 6 ], [ 4, 8 ], [ 5, 4 ], [ 7, 5 ], [ 10, 12 ], [ 11, 19 ], [ 12, 13 ], [ 12, 11 ], [ 13, 17 ], [ 14, 16 ], [ 14, 18 ], [ 15, 14 ], [ 17, 15 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Sandy knows Cristina. Cristina knows Eleanor. Arlene knows Alder. Eleanor knows Opal. Arlene knows Dewey. Tamara knows Louis. Eleanor knows Gene. Adelaide knows Ellis. Opal knows Adelaide. Stella knows Judy. Dewey knows Tamara. Brenda knows Darcy. Judy knows Arlene. Alder knows Brenda. Peggy knows Abel. Brenda knows Lola. Adelaide knows Allen. Gene knows Peggy. Which of Arlene and Eleanor can Stella reach?", "answer": "Arlene", "steps": [ "Stella knows Judy.", "Judy knows Arlene." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Stella", "Louis", "Arlene", "Lola", "Darcy", "Dewey", "Alder", "Judy", "Tamara", "Brenda", "Sandy", "Abel", "Eleanor", "Ellis", "Allen", "Gene", "Opal", "Cristina", "Peggy", "Adelaide" ], "edges": [ [ 0, 7 ], [ 2, 5 ], [ 2, 6 ], [ 5, 8 ], [ 6, 9 ], [ 7, 2 ], [ 8, 1 ], [ 9, 3 ], [ 9, 4 ], [ 10, 17 ], [ 12, 15 ], [ 12, 16 ], [ 15, 18 ], [ 16, 19 ], [ 17, 12 ], [ 18, 11 ], [ 19, 13 ], [ 19, 14 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Duncan knows Ford. Bart knows Ashley. Mae knows Lara. Amber knows Bart. Bart knows Frankie. Frankie knows Myra. Mae knows Taylor. Hendrix knows Hampton. Duncan knows Jessica. Ashley knows Nolan. Amber knows Audrey. Duncan knows June. Jessica knows Mae. Ashley knows Aaron. Hampton knows Harlan. Myra knows Kyle. Amber knows Julia. Jessica knows Hendrix. Which of Myra and Hampton can Amber reach?", "answer": "Myra", "steps": [ "Amber knows Bart.", "Bart knows Frankie.", "Frankie knows Myra." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Amber", "Myra", "Frankie", "Nolan", "Julia", "Bart", "Audrey", "Ashley", "Aaron", "Kyle", "Duncan", "Hampton", "Hendrix", "Taylor", "Ford", "Jessica", "June", "Mae", "Lara", "Harlan" ], "edges": [ [ 0, 4 ], [ 0, 6 ], [ 0, 5 ], [ 1, 9 ], [ 2, 1 ], [ 5, 7 ], [ 5, 2 ], [ 7, 3 ], [ 7, 8 ], [ 10, 14 ], [ 10, 16 ], [ 10, 15 ], [ 11, 19 ], [ 12, 11 ], [ 15, 17 ], [ 15, 12 ], [ 17, 13 ], [ 17, 18 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Lara knows Livia. Cliff knows Alicia. Flora knows Lillian. Corey knows Alvin. Bailey knows Brenda. Flora knows Fabian. Lillian knows Noel. Faith knows Curtis. Noel knows Jasper. Bailey knows Brynn. Livia knows Rocco. Corey knows Faith. Cliff knows Lara. Brynn knows Sue. Corey knows Cliff. Brynn knows James. Bailey knows Flora. Faith knows Valerie. Which of Rocco and Jasper can Corey reach?", "answer": "Rocco", "steps": [ "Corey knows Cliff.", "Cliff knows Lara.", "Lara knows Livia.", "Livia knows Rocco." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Corey", "Cliff", "Rocco", "Alicia", "Lara", "Curtis", "Faith", "Valerie", "Alvin", "Livia", "Bailey", "Flora", "Jasper", "Fabian", "Lillian", "James", "Brynn", "Sue", "Brenda", "Noel" ], "edges": [ [ 0, 6 ], [ 0, 8 ], [ 0, 1 ], [ 1, 3 ], [ 1, 4 ], [ 4, 9 ], [ 6, 5 ], [ 6, 7 ], [ 9, 2 ], [ 10, 16 ], [ 10, 18 ], [ 10, 11 ], [ 11, 13 ], [ 11, 14 ], [ 14, 19 ], [ 16, 15 ], [ 16, 17 ], [ 19, 12 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Kennedy knows Curtis. Jason knows Stefan. Dave knows Kennedy. Zara knows Quinn. Malcolm knows Malik. Ann knows Malcolm. Iris knows Brett. Malik knows Zara. Malik knows Olivia. Stefan knows Anna. Roger knows Jason. Brett knows Roger. Preston knows Crystal. Erik knows Iris. Sybil knows Preston. Brett knows Sybil. Quinn knows Alfonso. Olivia knows Dave. Which of Kennedy and Stefan can Ann reach?", "answer": "Kennedy", "steps": [ "Ann knows Malcolm.", "Malcolm knows Malik.", "Malik knows Olivia.", "Olivia knows Dave.", "Dave knows Kennedy." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Ann", "Malik", "Olivia", "Curtis", "Zara", "Alfonso", "Malcolm", "Quinn", "Dave", "Kennedy", "Erik", "Brett", "Roger", "Anna", "Sybil", "Crystal", "Iris", "Preston", "Jason", "Stefan" ], "edges": [ [ 0, 6 ], [ 1, 4 ], [ 1, 2 ], [ 2, 8 ], [ 4, 7 ], [ 6, 1 ], [ 7, 5 ], [ 8, 9 ], [ 9, 3 ], [ 10, 16 ], [ 11, 14 ], [ 11, 12 ], [ 12, 18 ], [ 14, 17 ], [ 16, 11 ], [ 17, 15 ], [ 18, 19 ], [ 19, 13 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Liam knows Eleanor. Gilbert knows Milton. Xander knows India. Tracy knows Liam. Gilbert knows Harvey. Jesse knows Brooke. Evan knows Carlton. Nolan knows Sheryl. Harvey knows Chance. Evan knows Noah. Brooke knows Nolan. Liam knows Fisher. Milton knows Tracy. Evan knows Arden. Alejandro knows Gilbert. Sheryl knows Evan. Liam knows Pat. Brooke knows Xander. Which of Gilbert and Brooke can Alejandro reach?", "answer": "Gilbert", "steps": [ "Alejandro knows Gilbert." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Alejandro", "Gilbert", "Liam", "Pat", "Eleanor", "Chance", "Milton", "Harvey", "Tracy", "Fisher", "Jesse", "Brooke", "Evan", "Noah", "Arden", "India", "Nolan", "Xander", "Sheryl", "Carlton" ], "edges": [ [ 0, 1 ], [ 1, 7 ], [ 1, 6 ], [ 2, 3 ], [ 2, 4 ], [ 2, 9 ], [ 6, 8 ], [ 7, 5 ], [ 8, 2 ], [ 10, 11 ], [ 11, 17 ], [ 11, 16 ], [ 12, 13 ], [ 12, 14 ], [ 12, 19 ], [ 16, 18 ], [ 17, 15 ], [ 18, 12 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Joshua knows Ariel. Liam knows Monroe. Elvira knows Frida. Otto knows Goldie. Ariel knows Liam. Anton knows Otto. Ilene knows Carla. Monroe knows Hunter. Anton knows Norma. Anton knows Hardy. Liam knows Gregory. Ilene knows Anton. Ray knows Jeremiah. Monroe knows Lawson. Monroe knows Elvira. Norma knows Harrison. Hunter knows Dustin. Jeremiah knows Ilene. Which of Ariel and Jeremiah can Ray reach?", "answer": "Jeremiah", "steps": [ "Ray knows Jeremiah." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Ray", "Norma", "Carla", "Jeremiah", "Ilene", "Hardy", "Anton", "Harrison", "Otto", "Goldie", "Joshua", "Elvira", "Gregory", "Ariel", "Liam", "Lawson", "Monroe", "Frida", "Hunter", "Dustin" ], "edges": [ [ 0, 3 ], [ 1, 7 ], [ 3, 4 ], [ 4, 2 ], [ 4, 6 ], [ 6, 5 ], [ 6, 1 ], [ 6, 8 ], [ 8, 9 ], [ 10, 13 ], [ 11, 17 ], [ 13, 14 ], [ 14, 12 ], [ 14, 16 ], [ 16, 15 ], [ 16, 11 ], [ 16, 18 ], [ 18, 19 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Ruth knows Cole. Dakota knows Ruth. Harriet knows Pat. Harriet knows Bryan. Bryan knows Leo. Ruth knows Dolores. Chloe knows Ella. Jean knows Dakota. Jean knows Kylie. Jean knows Ray. Ray knows Chloe. Abby knows Joyce. Pat knows Abby. Bryan knows India. Abby knows Jermaine. India knows Rena. Ray knows Mindy. Harriet knows Sadie. Which of Joyce and Cole can Jean reach?", "answer": "Cole", "steps": [ "Jean knows Dakota.", "Dakota knows Ruth.", "Ruth knows Cole." ], "difficulty": 3, "original_distance": 3, "idx_to_symbol": [ "Jean", "Mindy", "Kylie", "Ella", "Dolores", "Ruth", "Ray", "Chloe", "Dakota", "Cole", "Harriet", "Leo", "Sadie", "Rena", "Jermaine", "Abby", "Bryan", "India", "Pat", "Joyce" ], "edges": [ [ 0, 2 ], [ 0, 6 ], [ 0, 8 ], [ 5, 4 ], [ 5, 9 ], [ 6, 1 ], [ 6, 7 ], [ 7, 3 ], [ 8, 5 ], [ 10, 12 ], [ 10, 16 ], [ 10, 18 ], [ 15, 14 ], [ 15, 19 ], [ 16, 11 ], [ 16, 17 ], [ 17, 13 ], [ 18, 15 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Fabian knows Joel. Iris knows Joshua. Iris knows Kareem. Hunter knows Kingsley. Kingsley knows Belinda. Joel knows Tamara. Gina knows Edison. Kingsley knows Dalton. Eleanor knows Antonio. Iris knows Zack. Belinda knows Iris. Joel knows Earl. Alder knows Hunter. Gina knows Eleanor. Alder knows Jamie. Antonio knows Edgar. Joel knows Jack. Antonio knows Fabian. Which of Antonio and Kingsley can Gina reach?", "answer": "Antonio", "steps": [ "Gina knows Eleanor.", "Eleanor knows Antonio." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Gina", "Tamara", "Edison", "Fabian", "Antonio", "Jack", "Edgar", "Joel", "Eleanor", "Earl", "Alder", "Kareem", "Jamie", "Belinda", "Kingsley", "Joshua", "Dalton", "Iris", "Hunter", "Zack" ], "edges": [ [ 0, 2 ], [ 0, 8 ], [ 3, 7 ], [ 4, 6 ], [ 4, 3 ], [ 7, 1 ], [ 7, 5 ], [ 7, 9 ], [ 8, 4 ], [ 10, 12 ], [ 10, 18 ], [ 13, 17 ], [ 14, 16 ], [ 14, 13 ], [ 17, 11 ], [ 17, 15 ], [ 17, 19 ], [ 18, 14 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Charlotte knows Archie. Abby knows Callum. Derrick knows Claire. Rose knows Virginia. Callum knows Linda. Ralph knows Abby. Joseph knows Ronald. Linda knows Irving. Rita knows Lucille. Ronald knows Derrick. Charlotte knows Henry. Derrick knows Rose. Irving knows Charlotte. Irving knows Brandon. Rose knows Connor. Charlotte knows Ainsley. Lucille knows Joseph. Rose knows Lilia. Which of Ronald and Linda can Ralph reach?", "answer": "Linda", "steps": [ "Ralph knows Abby.", "Abby knows Callum.", "Callum knows Linda." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Ralph", "Ainsley", "Charlotte", "Callum", "Irving", "Archie", "Henry", "Linda", "Abby", "Brandon", "Rita", "Virginia", "Rose", "Joseph", "Derrick", "Connor", "Lilia", "Ronald", "Lucille", "Claire" ], "edges": [ [ 0, 8 ], [ 2, 1 ], [ 2, 5 ], [ 2, 6 ], [ 3, 7 ], [ 4, 2 ], [ 4, 9 ], [ 7, 4 ], [ 8, 3 ], [ 10, 18 ], [ 12, 11 ], [ 12, 15 ], [ 12, 16 ], [ 13, 17 ], [ 14, 12 ], [ 14, 19 ], [ 17, 14 ], [ 18, 13 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Lambert knows Hailey. Hattie knows Zach. Hattie knows Jay. Anton knows Perry. Lillian knows Aaron. Aaron knows Hayley. Martha knows Lillian. Anton knows Gordon. Wanda knows Alexa. Laverne knows Lambert. Elizabeth knows Hattie. Jay knows Laverne. Gordon knows Lenora. Laverne knows Bart. Aaron knows Wanda. Jay knows Shaun. Rosa knows Elizabeth. Wanda knows Anton. Which of Wanda and Jay can Rosa reach?", "answer": "Jay", "steps": [ "Rosa knows Elizabeth.", "Elizabeth knows Hattie.", "Hattie knows Jay." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Rosa", "Jay", "Lambert", "Laverne", "Hattie", "Hailey", "Shaun", "Bart", "Elizabeth", "Zach", "Martha", "Wanda", "Gordon", "Anton", "Aaron", "Lenora", "Alexa", "Perry", "Lillian", "Hayley" ], "edges": [ [ 0, 8 ], [ 1, 6 ], [ 1, 3 ], [ 2, 5 ], [ 3, 2 ], [ 3, 7 ], [ 4, 1 ], [ 4, 9 ], [ 8, 4 ], [ 10, 18 ], [ 11, 16 ], [ 11, 13 ], [ 12, 15 ], [ 13, 12 ], [ 13, 17 ], [ 14, 11 ], [ 14, 19 ], [ 18, 14 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Cruz knows Harris. Harris knows Jenny. Mason knows Cruz. Morgan knows Kit. Mason knows Kenneth. Jacob knows Joaquin. Harris knows Dorian. Clement knows Beau. Constance knows Esme. Darius knows Max. Joaquin knows Greer. Esme knows Jose. Darius knows Jacob. Dorian knows Morgan. Gage knows Craig. Jose knows Clement. Joaquin knows Constance. Kit knows Gage. Which of Dorian and Constance can Darius reach?", "answer": "Constance", "steps": [ "Darius knows Jacob.", "Jacob knows Joaquin.", "Joaquin knows Constance." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Darius", "Greer", "Jose", "Jacob", "Max", "Constance", "Clement", "Esme", "Beau", "Joaquin", "Mason", "Jenny", "Kit", "Cruz", "Kenneth", "Dorian", "Gage", "Morgan", "Craig", "Harris" ], "edges": [ [ 0, 4 ], [ 0, 3 ], [ 2, 6 ], [ 3, 9 ], [ 5, 7 ], [ 6, 8 ], [ 7, 2 ], [ 9, 1 ], [ 9, 5 ], [ 10, 14 ], [ 10, 13 ], [ 12, 16 ], [ 13, 19 ], [ 15, 17 ], [ 16, 18 ], [ 17, 12 ], [ 19, 11 ], [ 19, 15 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Cynthia knows Fisher. Zane knows Milo. Blanche knows Zane. Ernest knows Jewel. Shane knows Ernest. Dawn knows Shelly. Dawn knows Shane. Fisher knows Pedro. Pedro knows Joseph. Shelly knows Troy. Ariana knows Lloyd. Fisher knows Fern. Joseph knows Ruth. Lance knows Ariana. Lloyd knows Molly. Jewel knows Hector. Pedro knows Lance. Zane knows Dawn. Which of Fisher and Zane can Cynthia reach?", "answer": "Fisher", "steps": [ "Cynthia knows Fisher." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Cynthia", "Pedro", "Joseph", "Fisher", "Lance", "Ruth", "Lloyd", "Fern", "Ariana", "Molly", "Blanche", "Dawn", "Shelly", "Zane", "Shane", "Troy", "Jewel", "Milo", "Ernest", "Hector" ], "edges": [ [ 0, 3 ], [ 1, 2 ], [ 1, 4 ], [ 2, 5 ], [ 3, 7 ], [ 3, 1 ], [ 4, 8 ], [ 6, 9 ], [ 8, 6 ], [ 10, 13 ], [ 11, 12 ], [ 11, 14 ], [ 12, 15 ], [ 13, 17 ], [ 13, 11 ], [ 14, 18 ], [ 16, 19 ], [ 18, 16 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Rhea knows Declan. Declan knows Lydia. Enid knows Lyle. Alejandro knows Amelia. Lyle knows Dean. Rhea knows Alejandro. Lillian knows Abigail. Maggie knows Rhea. Maggie knows Valerie. Ira knows Lillian. Amelia knows Jillian. Lyle knows Colby. Dean knows Eunice. Enid knows Jared. Lyle knows Ira. Amelia knows Victor. Rhea knows June. Lillian knows Maria. Which of Lyle and Rhea can Maggie reach?", "answer": "Rhea", "steps": [ "Maggie knows Rhea." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Maggie", "Lydia", "Jillian", "Amelia", "June", "Alejandro", "Declan", "Victor", "Rhea", "Valerie", "Enid", "Eunice", "Maria", "Lillian", "Colby", "Ira", "Dean", "Abigail", "Lyle", "Jared" ], "edges": [ [ 0, 8 ], [ 0, 9 ], [ 3, 2 ], [ 3, 7 ], [ 5, 3 ], [ 6, 1 ], [ 8, 4 ], [ 8, 6 ], [ 8, 5 ], [ 10, 18 ], [ 10, 19 ], [ 13, 12 ], [ 13, 17 ], [ 15, 13 ], [ 16, 11 ], [ 18, 14 ], [ 18, 16 ], [ 18, 15 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Ellen knows Marcia. Greta knows Amelia. Kurt knows Greta. Ellen knows Austin. Burt knows Fisher. Austin knows Neville. Margaret knows Burt. Hailey knows Jesse. Hailey knows Nelson. Nelson knows Ellen. Kathleen knows Kurt. Jesse knows Jordan. Burt knows Randy. Hendrix knows Dorian. Kurt knows Margaret. Randy knows Keegan. Dorian knows Hailey. Garrison knows Kathleen. Which of Dorian and Kathleen can Hendrix reach?", "answer": "Dorian", "steps": [ "Hendrix knows Dorian." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Hendrix", "Ellen", "Jesse", "Austin", "Nelson", "Dorian", "Jordan", "Hailey", "Neville", "Marcia", "Garrison", "Burt", "Greta", "Randy", "Margaret", "Kathleen", "Amelia", "Kurt", "Keegan", "Fisher" ], "edges": [ [ 0, 5 ], [ 1, 3 ], [ 1, 9 ], [ 2, 6 ], [ 3, 8 ], [ 4, 1 ], [ 5, 7 ], [ 7, 2 ], [ 7, 4 ], [ 10, 15 ], [ 11, 13 ], [ 11, 19 ], [ 12, 16 ], [ 13, 18 ], [ 14, 11 ], [ 15, 17 ], [ 17, 12 ], [ 17, 14 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Tony knows Kamila. Kamila knows Lamar. Brynn knows Zach. Ralph knows Edison. Sybil knows Joanna. Olive knows Tony. Kamila knows Wayne. Zach knows Cliff. Dalton knows Carrie. Edison knows Mae. Zach knows Dalton. Pam knows Gloria. Mae knows Brynn. Arlene knows Olive. Jason knows Pam. Lamar knows Jason. Fabian knows Arlene. Carrie knows Sybil. Which of Olive and Mae can Ralph reach?", "answer": "Mae", "steps": [ "Ralph knows Edison.", "Edison knows Mae." ], "difficulty": 2, "original_distance": 8, "idx_to_symbol": [ "Ralph", "Joanna", "Zach", "Cliff", "Sybil", "Mae", "Carrie", "Dalton", "Brynn", "Edison", "Fabian", "Gloria", "Kamila", "Wayne", "Pam", "Olive", "Jason", "Lamar", "Tony", "Arlene" ], "edges": [ [ 0, 9 ], [ 2, 3 ], [ 2, 7 ], [ 4, 1 ], [ 5, 8 ], [ 6, 4 ], [ 7, 6 ], [ 8, 2 ], [ 9, 5 ], [ 10, 19 ], [ 12, 13 ], [ 12, 17 ], [ 14, 11 ], [ 15, 18 ], [ 16, 14 ], [ 17, 16 ], [ 18, 12 ], [ 19, 15 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Fabian knows Joel. Iris knows Joshua. Iris knows Kareem. Hunter knows Kingsley. Kingsley knows Belinda. Joel knows Tamara. Gina knows Edison. Kingsley knows Dalton. Eleanor knows Antonio. Iris knows Zack. Belinda knows Iris. Joel knows Earl. Alder knows Hunter. Gina knows Eleanor. Alder knows Jamie. Antonio knows Edgar. Joel knows Jack. Antonio knows Fabian. Which of Eleanor and Hunter can Gina reach?", "answer": "Eleanor", "steps": [ "Gina knows Eleanor." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Gina", "Tamara", "Edison", "Fabian", "Antonio", "Jack", "Edgar", "Joel", "Eleanor", "Earl", "Alder", "Kareem", "Jamie", "Belinda", "Kingsley", "Joshua", "Dalton", "Iris", "Hunter", "Zack" ], "edges": [ [ 0, 2 ], [ 0, 8 ], [ 3, 7 ], [ 4, 6 ], [ 4, 3 ], [ 7, 1 ], [ 7, 5 ], [ 7, 9 ], [ 8, 4 ], [ 10, 12 ], [ 10, 18 ], [ 13, 17 ], [ 14, 16 ], [ 14, 13 ], [ 17, 11 ], [ 17, 15 ], [ 17, 19 ], [ 18, 14 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Kelsey knows Kristin. Gwen knows Christian. Ted knows Kelsey. Stacy knows Donovan. Christian knows Larissa. Veronica knows Knox. Jude knows Stacy. Bruno knows Maya. Stacy knows Ted. Julius knows Bruno. Chance knows Dick. Larissa knows Greta. Kristin knows Veronica. Stacy knows Chance. Greta knows Fiona. Wanda knows Julius. Julius knows Gwen. Julius knows Hardy. Which of Kristin and Larissa can Wanda reach?", "answer": "Larissa", "steps": [ "Wanda knows Julius.", "Julius knows Gwen.", "Gwen knows Christian.", "Christian knows Larissa." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Wanda", "Fiona", "Greta", "Maya", "Hardy", "Julius", "Gwen", "Larissa", "Christian", "Bruno", "Jude", "Knox", "Veronica", "Dick", "Donovan", "Stacy", "Ted", "Kristin", "Kelsey", "Chance" ], "edges": [ [ 0, 5 ], [ 2, 1 ], [ 5, 4 ], [ 5, 6 ], [ 5, 9 ], [ 6, 8 ], [ 7, 2 ], [ 8, 7 ], [ 9, 3 ], [ 10, 15 ], [ 12, 11 ], [ 15, 14 ], [ 15, 16 ], [ 15, 19 ], [ 16, 18 ], [ 17, 12 ], [ 18, 17 ], [ 19, 13 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Monica knows Malcolm. Kristina knows Ebony. Jackson knows Logan. Lance knows Matt. Matt knows Brooks. Ebony knows Geneva. Jacob knows Jackson. Brad knows Rena. Lance knows Kristina. Dane knows Nadine. Logan knows Monica. Brad knows Dane. Pearl knows Mindy. Jacob knows Enrique. Rena knows Jacob. Ebony knows Virgil. Virgil knows Alyson. Alyson knows Pearl. Which of Malcolm and Mindy can Lance reach?", "answer": "Mindy", "steps": [ "Lance knows Kristina.", "Kristina knows Ebony.", "Ebony knows Virgil.", "Virgil knows Alyson.", "Alyson knows Pearl.", "Pearl knows Mindy." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Lance", "Alyson", "Brooks", "Mindy", "Matt", "Kristina", "Virgil", "Pearl", "Ebony", "Geneva", "Brad", "Logan", "Nadine", "Malcolm", "Dane", "Rena", "Jackson", "Monica", "Jacob", "Enrique" ], "edges": [ [ 0, 4 ], [ 0, 5 ], [ 1, 7 ], [ 4, 2 ], [ 5, 8 ], [ 6, 1 ], [ 7, 3 ], [ 8, 6 ], [ 8, 9 ], [ 10, 14 ], [ 10, 15 ], [ 11, 17 ], [ 14, 12 ], [ 15, 18 ], [ 16, 11 ], [ 17, 13 ], [ 18, 16 ], [ 18, 19 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Stuart knows Ryan. Clark knows Colby. Adam knows Jarvis. Stuart knows Herbert. Rosemary knows Jameson. Zane knows Stuart. Zane knows Ian. Felix knows Adam. Jarvis knows Irene. Irene knows Clark. Zane knows Alyssa. Ryan knows Oscar. Colby knows Clay. Jarvis knows Damian. Jameson knows Zane. Jarvis knows Simon. Oscar knows Livia. Irene knows Alison. Which of Oscar and Colby can Felix reach?", "answer": "Colby", "steps": [ "Felix knows Adam.", "Adam knows Jarvis.", "Jarvis knows Irene.", "Irene knows Clark.", "Clark knows Colby." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Felix", "Colby", "Simon", "Clark", "Alison", "Adam", "Irene", "Damian", "Clay", "Jarvis", "Rosemary", "Oscar", "Ian", "Ryan", "Herbert", "Jameson", "Stuart", "Alyssa", "Livia", "Zane" ], "edges": [ [ 0, 5 ], [ 1, 8 ], [ 3, 1 ], [ 5, 9 ], [ 6, 4 ], [ 6, 3 ], [ 9, 2 ], [ 9, 7 ], [ 9, 6 ], [ 10, 15 ], [ 11, 18 ], [ 13, 11 ], [ 15, 19 ], [ 16, 14 ], [ 16, 13 ], [ 19, 12 ], [ 19, 17 ], [ 19, 16 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Darren knows Grant. Tanya knows Mindy. Carl knows Hayden. Dewey knows Hayley. Finn knows Elsa. Finn knows Maggie. Mindy knows Dewey. Elsa knows Joyce. Elsa knows Jorge. Grant knows Kendrick. Alvin knows Adrian. Rosa knows Darren. Dewey knows Finn. Carl knows Rufus. Carl knows Mary. Grant knows Alvin. Alvin knows Carl. Elsa knows Gus. Which of Alvin and Finn can Tanya reach?", "answer": "Finn", "steps": [ "Tanya knows Mindy.", "Mindy knows Dewey.", "Dewey knows Finn." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Tanya", "Gus", "Elsa", "Hayley", "Joyce", "Dewey", "Finn", "Maggie", "Jorge", "Mindy", "Rosa", "Mary", "Carl", "Kendrick", "Hayden", "Grant", "Alvin", "Adrian", "Rufus", "Darren" ], "edges": [ [ 0, 9 ], [ 2, 1 ], [ 2, 4 ], [ 2, 8 ], [ 5, 3 ], [ 5, 6 ], [ 6, 7 ], [ 6, 2 ], [ 9, 5 ], [ 10, 19 ], [ 12, 11 ], [ 12, 14 ], [ 12, 18 ], [ 15, 13 ], [ 15, 16 ], [ 16, 17 ], [ 16, 12 ], [ 19, 15 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Liam knows Eleanor. Gilbert knows Milton. Xander knows India. Tracy knows Liam. Gilbert knows Harvey. Jesse knows Brooke. Evan knows Carlton. Nolan knows Sheryl. Harvey knows Chance. Evan knows Noah. Brooke knows Nolan. Liam knows Fisher. Milton knows Tracy. Evan knows Arden. Alejandro knows Gilbert. Sheryl knows Evan. Liam knows Pat. Brooke knows Xander. Which of Noah and Pat can Alejandro reach?", "answer": "Pat", "steps": [ "Alejandro knows Gilbert.", "Gilbert knows Milton.", "Milton knows Tracy.", "Tracy knows Liam.", "Liam knows Pat." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Alejandro", "Gilbert", "Liam", "Pat", "Eleanor", "Chance", "Milton", "Harvey", "Tracy", "Fisher", "Jesse", "Brooke", "Evan", "Noah", "Arden", "India", "Nolan", "Xander", "Sheryl", "Carlton" ], "edges": [ [ 0, 1 ], [ 1, 7 ], [ 1, 6 ], [ 2, 3 ], [ 2, 4 ], [ 2, 9 ], [ 6, 8 ], [ 7, 5 ], [ 8, 2 ], [ 10, 11 ], [ 11, 17 ], [ 11, 16 ], [ 12, 13 ], [ 12, 14 ], [ 12, 19 ], [ 16, 18 ], [ 17, 15 ], [ 18, 12 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Inez knows Yolanda. Demetrius knows Eve. Demetrius knows Linda. Latoya knows Graeme. Linda knows Crystal. Matthew knows Annie. Penny knows Jarvis. Linda knows Laura. Maya knows Penny. Annie knows Jeffery. Yolanda knows Erma. Leticia knows Kylie. Eve knows Leticia. Penny knows Julian. Wilbur knows Latoya. Laura knows Inez. Jarvis knows Matthew. Maya knows Wilbur. Which of Jeffery and Erma can Maya reach?", "answer": "Jeffery", "steps": [ "Maya knows Penny.", "Penny knows Jarvis.", "Jarvis knows Matthew.", "Matthew knows Annie.", "Annie knows Jeffery." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Maya", "Jarvis", "Wilbur", "Matthew", "Penny", "Jeffery", "Annie", "Graeme", "Julian", "Latoya", "Demetrius", "Laura", "Eve", "Inez", "Linda", "Erma", "Yolanda", "Kylie", "Crystal", "Leticia" ], "edges": [ [ 0, 4 ], [ 0, 2 ], [ 1, 3 ], [ 2, 9 ], [ 3, 6 ], [ 4, 1 ], [ 4, 8 ], [ 6, 5 ], [ 9, 7 ], [ 10, 14 ], [ 10, 12 ], [ 11, 13 ], [ 12, 19 ], [ 13, 16 ], [ 14, 11 ], [ 14, 18 ], [ 16, 15 ], [ 19, 17 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Susan knows Cooper. Bennett knows Jeremiah. Cliff knows Jessie. Jessie knows Bernice. Jessie knows Howard. Fritz knows Susan. Jeremiah knows Lane. Barbara knows Pedro. Lane knows Skyler. Barbara knows Bennett. Barbara knows Jolene. Jessie knows Fritz. Pedro knows Fabian. Bernice knows Hudson. Cooper knows Herbert. Hudson knows Keegan. Fabian knows Jarvis. Aurora knows Barbara. Which of Jessie and Barbara can Aurora reach?", "answer": "Barbara", "steps": [ "Aurora knows Barbara." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Aurora", "Fabian", "Barbara", "Pedro", "Skyler", "Lane", "Bennett", "Jeremiah", "Jolene", "Jarvis", "Cliff", "Hudson", "Jessie", "Bernice", "Herbert", "Cooper", "Fritz", "Susan", "Howard", "Keegan" ], "edges": [ [ 0, 2 ], [ 1, 9 ], [ 2, 6 ], [ 2, 8 ], [ 2, 3 ], [ 3, 1 ], [ 5, 4 ], [ 6, 7 ], [ 7, 5 ], [ 10, 12 ], [ 11, 19 ], [ 12, 16 ], [ 12, 18 ], [ 12, 13 ], [ 13, 11 ], [ 15, 14 ], [ 16, 17 ], [ 17, 15 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Miranda knows Stella. Keaton knows Lena. Wilson knows Estella. Francesca knows Hank. Marion knows Miranda. Lena knows Wilson. Gary knows Ben. Marion knows Joyce. Francesca knows Leroy. Gary knows Atlas. Ben knows Evan. Wilson knows Marion. Joyce knows Iris. Hank knows Samuel. Keaton knows Jenna. Samuel knows Gary. Atlas knows Cara. Samuel knows Luz. Which of Gary and Marion can Francesca reach?", "answer": "Gary", "steps": [ "Francesca knows Hank.", "Hank knows Samuel.", "Samuel knows Gary." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Francesca", "Cara", "Ben", "Evan", "Hank", "Luz", "Atlas", "Samuel", "Leroy", "Gary", "Keaton", "Iris", "Miranda", "Stella", "Lena", "Estella", "Joyce", "Wilson", "Jenna", "Marion" ], "edges": [ [ 0, 8 ], [ 0, 4 ], [ 2, 3 ], [ 4, 7 ], [ 6, 1 ], [ 7, 5 ], [ 7, 9 ], [ 9, 2 ], [ 9, 6 ], [ 10, 18 ], [ 10, 14 ], [ 12, 13 ], [ 14, 17 ], [ 16, 11 ], [ 17, 15 ], [ 17, 19 ], [ 19, 12 ], [ 19, 16 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Ernesto knows Gerald. Sadie knows Jenna. Bernard knows Theodore. Karen knows Gloria. Steve knows Daisy. Yvonne knows Eloise. Bernard knows Steve. Gertrude knows Dorothy. Sadie knows Allison. Jenna knows Ernesto. Jenna knows Irene. Erin knows Yvonne. Allison knows Karen. Jenna knows Gus. Theodore knows Gertrude. Steve knows Erin. Steve knows Leander. Gerald knows Kaleb. Which of Eloise and Kaleb can Sadie reach?", "answer": "Kaleb", "steps": [ "Sadie knows Jenna.", "Jenna knows Ernesto.", "Ernesto knows Gerald.", "Gerald knows Kaleb." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Sadie", "Gloria", "Gus", "Jenna", "Irene", "Allison", "Gerald", "Ernesto", "Kaleb", "Karen", "Bernard", "Dorothy", "Leander", "Steve", "Daisy", "Theodore", "Yvonne", "Erin", "Eloise", "Gertrude" ], "edges": [ [ 0, 3 ], [ 0, 5 ], [ 3, 2 ], [ 3, 4 ], [ 3, 7 ], [ 5, 9 ], [ 6, 8 ], [ 7, 6 ], [ 9, 1 ], [ 10, 13 ], [ 10, 15 ], [ 13, 12 ], [ 13, 14 ], [ 13, 17 ], [ 15, 19 ], [ 16, 18 ], [ 17, 16 ], [ 19, 11 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Mario knows Victor. Lorna knows Zach. Jacqueline knows Marc. Jacqueline knows Ellis. Daniella knows Mario. Jacob knows Graham. Teresa knows Bonnie. Devin knows Dahlia. Lucas knows Teresa. Marc knows Daniel. Gordon knows Lucille. Daniella knows Lucas. Teresa knows Gordon. Devin knows Lorna. Daniel knows Jacob. Victor knows Lark. Ellis knows Devin. Lark knows Cesar. Which of Lorna and Gordon can Daniella reach?", "answer": "Gordon", "steps": [ "Daniella knows Lucas.", "Lucas knows Teresa.", "Teresa knows Gordon." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Daniella", "Cesar", "Teresa", "Bonnie", "Lucille", "Gordon", "Victor", "Lark", "Mario", "Lucas", "Jacqueline", "Graham", "Devin", "Dahlia", "Zach", "Lorna", "Daniel", "Jacob", "Marc", "Ellis" ], "edges": [ [ 0, 8 ], [ 0, 9 ], [ 2, 3 ], [ 2, 5 ], [ 5, 4 ], [ 6, 7 ], [ 7, 1 ], [ 8, 6 ], [ 9, 2 ], [ 10, 18 ], [ 10, 19 ], [ 12, 13 ], [ 12, 15 ], [ 15, 14 ], [ 16, 17 ], [ 17, 11 ], [ 18, 16 ], [ 19, 12 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Beau knows Kane. Greta knows Cornelius. Garrison knows Aiden. Greta knows Isadora. Constance knows Xander. Kane knows Constance. Garrison knows Knox. Irma knows Antonio. Knox knows Marco. Jim knows Cyrus. Cornelius knows Irma. Jim knows Cristina. Marco knows Beau. Antonio knows Jim. Kane knows Archie. Greta knows Lamont. Cristina knows Parker. Garrison knows Karina. Which of Knox and Cornelius can Garrison reach?", "answer": "Knox", "steps": [ "Garrison knows Knox." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Garrison", "Constance", "Karina", "Knox", "Kane", "Xander", "Aiden", "Marco", "Beau", "Archie", "Greta", "Cristina", "Isadora", "Cornelius", "Jim", "Parker", "Lamont", "Irma", "Antonio", "Cyrus" ], "edges": [ [ 0, 2 ], [ 0, 6 ], [ 0, 3 ], [ 1, 5 ], [ 3, 7 ], [ 4, 1 ], [ 4, 9 ], [ 7, 8 ], [ 8, 4 ], [ 10, 12 ], [ 10, 16 ], [ 10, 13 ], [ 11, 15 ], [ 13, 17 ], [ 14, 11 ], [ 14, 19 ], [ 17, 18 ], [ 18, 14 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Myra knows Dalton. Jeremiah knows Ted. Georgia knows Elena. Aubrey knows Drake. Aria knows August. Georgia knows Mark. Drake knows Kenneth. Madeline knows Aria. Leigh knows Kaleb. Drake knows Humphrey. Ted knows Georgia. Kaleb knows Aubrey. Myra knows Deborah. August knows Jon. Kenneth knows Myra. Jeremiah knows Emanuel. Fabian knows Leigh. Jon knows Jeremiah. Which of Myra and Georgia can Fabian reach?", "answer": "Myra", "steps": [ "Fabian knows Leigh.", "Leigh knows Kaleb.", "Kaleb knows Aubrey.", "Aubrey knows Drake.", "Drake knows Kenneth.", "Kenneth knows Myra." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Fabian", "Leigh", "Myra", "Aubrey", "Humphrey", "Drake", "Kenneth", "Deborah", "Dalton", "Kaleb", "Madeline", "Aria", "Georgia", "Jon", "Emanuel", "Jeremiah", "Ted", "Elena", "Mark", "August" ], "edges": [ [ 0, 1 ], [ 1, 9 ], [ 2, 7 ], [ 2, 8 ], [ 3, 5 ], [ 5, 4 ], [ 5, 6 ], [ 6, 2 ], [ 9, 3 ], [ 10, 11 ], [ 11, 19 ], [ 12, 17 ], [ 12, 18 ], [ 13, 15 ], [ 15, 14 ], [ 15, 16 ], [ 16, 12 ], [ 19, 13 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Dawn knows Adam. Gene knows Connor. Adam knows Finn. Finn knows Megan. Fanny knows Dawn. Avery knows Dell. Wilson knows Avery. Marilyn knows Gideon. Megan knows Gene. Gideon knows Lorraine. Etta knows Wilson. Curtis knows James. Lars knows Etta. Connor knows Bonnie. Gene knows Lawson. Francesca knows Fanny. Avery knows Curtis. Lorraine knows Lars. Which of Adam and Lars can Marilyn reach?", "answer": "Lars", "steps": [ "Marilyn knows Gideon.", "Gideon knows Lorraine.", "Lorraine knows Lars." ], "difficulty": 3, "original_distance": 8, "idx_to_symbol": [ "Marilyn", "Lorraine", "Etta", "Curtis", "Wilson", "Gideon", "Dell", "James", "Avery", "Lars", "Francesca", "Dawn", "Finn", "Connor", "Megan", "Fanny", "Lawson", "Bonnie", "Gene", "Adam" ], "edges": [ [ 0, 5 ], [ 1, 9 ], [ 2, 4 ], [ 3, 7 ], [ 4, 8 ], [ 5, 1 ], [ 8, 6 ], [ 8, 3 ], [ 9, 2 ], [ 10, 15 ], [ 11, 19 ], [ 12, 14 ], [ 13, 17 ], [ 14, 18 ], [ 15, 11 ], [ 18, 16 ], [ 18, 13 ], [ 19, 12 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Dwight knows Wendy. Neal knows Caleb. Isla knows Antonio. Katherine knows Colin. Dwight knows Edmund. Edmund knows Ursula. Neal knows Natalie. Annette knows Neal. Desmond knows Dwight. Colin knows Desmond. Lara knows Max. Edmund knows Vanessa. Dwight knows Irving. Antonio knows Annette. Neal knows Lara. Lara knows Tina. Max knows Lewis. Vanessa knows Jonathan. Which of Edmund and Lara can Isla reach?", "answer": "Lara", "steps": [ "Isla knows Antonio.", "Antonio knows Annette.", "Annette knows Neal.", "Neal knows Lara." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Isla", "Lara", "Caleb", "Annette", "Neal", "Natalie", "Lewis", "Tina", "Max", "Antonio", "Katherine", "Edmund", "Irving", "Desmond", "Dwight", "Wendy", "Jonathan", "Ursula", "Vanessa", "Colin" ], "edges": [ [ 0, 9 ], [ 1, 7 ], [ 1, 8 ], [ 3, 4 ], [ 4, 2 ], [ 4, 5 ], [ 4, 1 ], [ 8, 6 ], [ 9, 3 ], [ 10, 19 ], [ 11, 17 ], [ 11, 18 ], [ 13, 14 ], [ 14, 12 ], [ 14, 15 ], [ 14, 11 ], [ 18, 16 ], [ 19, 13 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Darren knows Grant. Tanya knows Mindy. Carl knows Hayden. Dewey knows Hayley. Finn knows Elsa. Finn knows Maggie. Mindy knows Dewey. Elsa knows Joyce. Elsa knows Jorge. Grant knows Kendrick. Alvin knows Adrian. Rosa knows Darren. Dewey knows Finn. Carl knows Rufus. Carl knows Mary. Grant knows Alvin. Alvin knows Carl. Elsa knows Gus. Which of Rufus and Jorge can Tanya reach?", "answer": "Jorge", "steps": [ "Tanya knows Mindy.", "Mindy knows Dewey.", "Dewey knows Finn.", "Finn knows Elsa.", "Elsa knows Jorge." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Tanya", "Gus", "Elsa", "Hayley", "Joyce", "Dewey", "Finn", "Maggie", "Jorge", "Mindy", "Rosa", "Mary", "Carl", "Kendrick", "Hayden", "Grant", "Alvin", "Adrian", "Rufus", "Darren" ], "edges": [ [ 0, 9 ], [ 2, 1 ], [ 2, 4 ], [ 2, 8 ], [ 5, 3 ], [ 5, 6 ], [ 6, 7 ], [ 6, 2 ], [ 9, 5 ], [ 10, 19 ], [ 12, 11 ], [ 12, 14 ], [ 12, 18 ], [ 15, 13 ], [ 15, 16 ], [ 16, 17 ], [ 16, 12 ], [ 19, 15 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Faith knows Charles. Isadora knows Yasmin. Tony knows Theodore. Bella knows Thea. Faith knows Vance. Yasmin knows Faith. Fraser knows Basil. Yasmin knows Lola. Basil knows Vincent. Thea knows Bonnie. Fraser knows Whitney. Bonnie knows Fraser. Isadora knows Will. Faith knows Tony. Fraser knows Jeremiah. Bonnie knows Jack. Anastasia knows Isadora. Thea knows Hank. Which of Basil and Tony can Bella reach?", "answer": "Basil", "steps": [ "Bella knows Thea.", "Thea knows Bonnie.", "Bonnie knows Fraser.", "Fraser knows Basil." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Bella", "Hank", "Fraser", "Thea", "Basil", "Whitney", "Vincent", "Jack", "Jeremiah", "Bonnie", "Anastasia", "Will", "Faith", "Isadora", "Tony", "Charles", "Theodore", "Lola", "Vance", "Yasmin" ], "edges": [ [ 0, 3 ], [ 2, 5 ], [ 2, 4 ], [ 2, 8 ], [ 3, 1 ], [ 3, 9 ], [ 4, 6 ], [ 9, 7 ], [ 9, 2 ], [ 10, 13 ], [ 12, 15 ], [ 12, 14 ], [ 12, 18 ], [ 13, 11 ], [ 13, 19 ], [ 14, 16 ], [ 19, 17 ], [ 19, 12 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Cynthia knows Fisher. Zane knows Milo. Blanche knows Zane. Ernest knows Jewel. Shane knows Ernest. Dawn knows Shelly. Dawn knows Shane. Fisher knows Pedro. Pedro knows Joseph. Shelly knows Troy. Ariana knows Lloyd. Fisher knows Fern. Joseph knows Ruth. Lance knows Ariana. Lloyd knows Molly. Jewel knows Hector. Pedro knows Lance. Zane knows Dawn. Which of Hector and Molly can Cynthia reach?", "answer": "Molly", "steps": [ "Cynthia knows Fisher.", "Fisher knows Pedro.", "Pedro knows Lance.", "Lance knows Ariana.", "Ariana knows Lloyd.", "Lloyd knows Molly." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Cynthia", "Pedro", "Joseph", "Fisher", "Lance", "Ruth", "Lloyd", "Fern", "Ariana", "Molly", "Blanche", "Dawn", "Shelly", "Zane", "Shane", "Troy", "Jewel", "Milo", "Ernest", "Hector" ], "edges": [ [ 0, 3 ], [ 1, 2 ], [ 1, 4 ], [ 2, 5 ], [ 3, 7 ], [ 3, 1 ], [ 4, 8 ], [ 6, 9 ], [ 8, 6 ], [ 10, 13 ], [ 11, 12 ], [ 11, 14 ], [ 12, 15 ], [ 13, 17 ], [ 13, 11 ], [ 14, 18 ], [ 16, 19 ], [ 18, 16 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Raymond knows Marlene. Dylan knows Howard. Sydney knows Demetrius. Lisa knows Dylan. Fisher knows Nadine. Bruce knows Lisa. Cooper knows Jerry. Craig knows Monroe. Marlene knows Fisher. Craig knows Maggie. Lisa knows Sydney. Jerry knows Stephanie. Monroe knows Kent. Maggie knows Khashayar. Malik knows Craig. Stephanie knows Elaine. Howard knows Cooper. Khashayar knows Raymond. Which of Craig and Lisa can Bruce reach?", "answer": "Lisa", "steps": [ "Bruce knows Lisa." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Bruce", "Jerry", "Lisa", "Sydney", "Elaine", "Howard", "Stephanie", "Demetrius", "Cooper", "Dylan", "Malik", "Marlene", "Craig", "Monroe", "Nadine", "Khashayar", "Fisher", "Kent", "Raymond", "Maggie" ], "edges": [ [ 0, 2 ], [ 1, 6 ], [ 2, 3 ], [ 2, 9 ], [ 3, 7 ], [ 5, 8 ], [ 6, 4 ], [ 8, 1 ], [ 9, 5 ], [ 10, 12 ], [ 11, 16 ], [ 12, 13 ], [ 12, 19 ], [ 13, 17 ], [ 15, 18 ], [ 16, 14 ], [ 18, 11 ], [ 19, 15 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Stella knows Chandler. Bridget knows Laura. Antonio knows Kit. Stella knows Heath. Hampton knows Jade. Heath knows Daniella. Laura knows Hampton. Shannon knows Stella. Heath knows Saul. Tonya knows Bridget. Reed knows Bart. Kit knows Sara. Farrah knows Shannon. Laura knows Antonio. Chandler knows Reed. Jade knows Zoe. Antonio knows Eunice. Daniella knows Jose. Which of Laura and Stella can Farrah reach?", "answer": "Stella", "steps": [ "Farrah knows Shannon.", "Shannon knows Stella." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Farrah", "Chandler", "Bart", "Jose", "Shannon", "Heath", "Reed", "Daniella", "Saul", "Stella", "Tonya", "Hampton", "Zoe", "Sara", "Bridget", "Antonio", "Jade", "Kit", "Eunice", "Laura" ], "edges": [ [ 0, 4 ], [ 1, 6 ], [ 4, 9 ], [ 5, 7 ], [ 5, 8 ], [ 6, 2 ], [ 7, 3 ], [ 9, 1 ], [ 9, 5 ], [ 10, 14 ], [ 11, 16 ], [ 14, 19 ], [ 15, 17 ], [ 15, 18 ], [ 16, 12 ], [ 17, 13 ], [ 19, 11 ], [ 19, 15 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Hayden knows Louisa. Louisa knows Kelsey. Milton knows Bart. Peter knows Seth. Layla knows Keaton. Lottie knows Kerry. Amber knows Milton. Jesse knows Sally. Layla knows Joshua. Esperanza knows Darla. Lottie knows Robin. Sally knows Estella. Luella knows Jesse. Darla knows Layla. Seth knows Esperanza. Bart knows Lottie. Estella knows Amber. Kelsey knows Peter. Which of Amber and Seth can Hayden reach?", "answer": "Seth", "steps": [ "Hayden knows Louisa.", "Louisa knows Kelsey.", "Kelsey knows Peter.", "Peter knows Seth." ], "difficulty": 4, "original_distance": 8, "idx_to_symbol": [ "Hayden", "Esperanza", "Louisa", "Peter", "Kelsey", "Joshua", "Keaton", "Darla", "Layla", "Seth", "Luella", "Milton", "Jesse", "Estella", "Sally", "Robin", "Kerry", "Bart", "Lottie", "Amber" ], "edges": [ [ 0, 2 ], [ 1, 7 ], [ 2, 4 ], [ 3, 9 ], [ 4, 3 ], [ 7, 8 ], [ 8, 5 ], [ 8, 6 ], [ 9, 1 ], [ 10, 12 ], [ 11, 17 ], [ 12, 14 ], [ 13, 19 ], [ 14, 13 ], [ 17, 18 ], [ 18, 15 ], [ 18, 16 ], [ 19, 11 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Myra knows Dalton. Jeremiah knows Ted. Georgia knows Elena. Aubrey knows Drake. Aria knows August. Georgia knows Mark. Drake knows Kenneth. Madeline knows Aria. Leigh knows Kaleb. Drake knows Humphrey. Ted knows Georgia. Kaleb knows Aubrey. Myra knows Deborah. August knows Jon. Kenneth knows Myra. Jeremiah knows Emanuel. Fabian knows Leigh. Jon knows Jeremiah. Which of Mark and Dalton can Fabian reach?", "answer": "Dalton", "steps": [ "Fabian knows Leigh.", "Leigh knows Kaleb.", "Kaleb knows Aubrey.", "Aubrey knows Drake.", "Drake knows Kenneth.", "Kenneth knows Myra.", "Myra knows Dalton." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Fabian", "Leigh", "Myra", "Aubrey", "Humphrey", "Drake", "Kenneth", "Deborah", "Dalton", "Kaleb", "Madeline", "Aria", "Georgia", "Jon", "Emanuel", "Jeremiah", "Ted", "Elena", "Mark", "August" ], "edges": [ [ 0, 1 ], [ 1, 9 ], [ 2, 7 ], [ 2, 8 ], [ 3, 5 ], [ 5, 4 ], [ 5, 6 ], [ 6, 2 ], [ 9, 3 ], [ 10, 11 ], [ 11, 19 ], [ 12, 17 ], [ 12, 18 ], [ 13, 15 ], [ 15, 14 ], [ 15, 16 ], [ 16, 12 ], [ 19, 13 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Harry knows Ben. Daphna knows Keira. Daphna knows Axel. Ezra knows Justine. Lambert knows James. James knows Vicki. Keira knows Edison. Wilbur knows Carey. Gwen knows Ezra. Ben knows Gene. Selena knows Dominic. Carey knows Harry. Wilbur knows Barry. Wilbur knows Eve. Barry knows Gwen. Vicki knows Ramona. Edison knows Selena. Daphna knows Lambert. Which of Justine and Ramona can Wilbur reach?", "answer": "Justine", "steps": [ "Wilbur knows Barry.", "Barry knows Gwen.", "Gwen knows Ezra.", "Ezra knows Justine." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Wilbur", "Justine", "Eve", "Gene", "Barry", "Gwen", "Harry", "Ezra", "Ben", "Carey", "Daphna", "Ramona", "Axel", "Dominic", "Lambert", "James", "Edison", "Vicki", "Selena", "Keira" ], "edges": [ [ 0, 2 ], [ 0, 4 ], [ 0, 9 ], [ 4, 5 ], [ 5, 7 ], [ 6, 8 ], [ 7, 1 ], [ 8, 3 ], [ 9, 6 ], [ 10, 12 ], [ 10, 14 ], [ 10, 19 ], [ 14, 15 ], [ 15, 17 ], [ 16, 18 ], [ 17, 11 ], [ 18, 13 ], [ 19, 16 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Fred knows Chase. Karla knows Peggy. Kobe knows Hayes. Luke knows Karla. Dylan knows Patrick. Dylan knows Melody. Clay knows Dylan. Melody knows Ernest. Elijah knows Christopher. Dylan knows Kobe. Kobe knows Luke. Ernesto knows Ashley. Elijah knows Fred. Alder knows Pete. Irma knows Ernesto. Elijah knows Alder. Andrea knows Elijah. Fred knows Irma. Which of Kobe and Fred can Andrea reach?", "answer": "Fred", "steps": [ "Andrea knows Elijah.", "Elijah knows Fred." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Andrea", "Fred", "Ernesto", "Irma", "Chase", "Elijah", "Christopher", "Alder", "Pete", "Ashley", "Clay", "Kobe", "Karla", "Luke", "Hayes", "Dylan", "Patrick", "Melody", "Ernest", "Peggy" ], "edges": [ [ 0, 5 ], [ 1, 4 ], [ 1, 3 ], [ 2, 9 ], [ 3, 2 ], [ 5, 6 ], [ 5, 7 ], [ 5, 1 ], [ 7, 8 ], [ 10, 15 ], [ 11, 14 ], [ 11, 13 ], [ 12, 19 ], [ 13, 12 ], [ 15, 16 ], [ 15, 17 ], [ 15, 11 ], [ 17, 18 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Guy knows Emmett. Cooper knows Erik. Xander knows Ava. Cliff knows Devon. Fiona knows Arturo. Celia knows Edward. Edward knows Xander. Cliff knows Damien. Damien knows Israel. Devon knows Billy. Alyson knows Harry. Arturo knows Celia. Celia knows Alyson. Edward knows Samuel. Erik knows Guy. Guy knows Cliff. Emmett knows Mae. Samuel knows Kevin. Which of Damien and Samuel can Cooper reach?", "answer": "Damien", "steps": [ "Cooper knows Erik.", "Erik knows Guy.", "Guy knows Cliff.", "Cliff knows Damien." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Cooper", "Guy", "Billy", "Erik", "Devon", "Cliff", "Damien", "Emmett", "Israel", "Mae", "Fiona", "Celia", "Ava", "Arturo", "Xander", "Edward", "Samuel", "Alyson", "Kevin", "Harry" ], "edges": [ [ 0, 3 ], [ 1, 5 ], [ 1, 7 ], [ 3, 1 ], [ 4, 2 ], [ 5, 4 ], [ 5, 6 ], [ 6, 8 ], [ 7, 9 ], [ 10, 13 ], [ 11, 15 ], [ 11, 17 ], [ 13, 11 ], [ 14, 12 ], [ 15, 14 ], [ 15, 16 ], [ 16, 18 ], [ 17, 19 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Josie knows Gideon. Benjamin knows Chris. Fletcher knows Peter. Lloyd knows Hadley. Lark knows Bruno. Gideon knows Reed. Chris knows Archie. Tabitha knows Zara. Benjamin knows Tabitha. Gideon knows Fletcher. Peter knows Cara. Bruno knows Benjamin. Lloyd knows Ariel. Fletcher knows Lloyd. Tabitha knows Chad. Bruno knows Troy. Lloyd knows Rose. Tabitha knows Anita. Which of Zara and Ariel can Lark reach?", "answer": "Zara", "steps": [ "Lark knows Bruno.", "Bruno knows Benjamin.", "Benjamin knows Tabitha.", "Tabitha knows Zara." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Lark", "Troy", "Archie", "Chad", "Anita", "Zara", "Tabitha", "Benjamin", "Chris", "Bruno", "Josie", "Reed", "Cara", "Hadley", "Rose", "Ariel", "Lloyd", "Fletcher", "Peter", "Gideon" ], "edges": [ [ 0, 9 ], [ 6, 3 ], [ 6, 4 ], [ 6, 5 ], [ 7, 6 ], [ 7, 8 ], [ 8, 2 ], [ 9, 1 ], [ 9, 7 ], [ 10, 19 ], [ 16, 13 ], [ 16, 14 ], [ 16, 15 ], [ 17, 16 ], [ 17, 18 ], [ 18, 12 ], [ 19, 11 ], [ 19, 17 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Russ knows Bennett. Walt knows Harley. Russ knows Aria. Ramona knows Serena. Ford knows Selena. Serena knows Andrew. Harris knows Ramona. Jewel knows Chantal. Humphrey knows Carson. Ford knows Walt. Jose knows Russ. Selena knows Humphrey. Alison knows Jewel. Jewel knows Harris. Bennett knows Ford. Goldie knows Lewis. Hank knows Goldie. Ramona knows Hank. Which of Ford and Ramona can Alison reach?", "answer": "Ramona", "steps": [ "Alison knows Jewel.", "Jewel knows Harris.", "Harris knows Ramona." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Alison", "Harris", "Jewel", "Serena", "Lewis", "Chantal", "Ramona", "Andrew", "Hank", "Goldie", "Jose", "Bennett", "Russ", "Walt", "Carson", "Aria", "Ford", "Harley", "Selena", "Humphrey" ], "edges": [ [ 0, 2 ], [ 1, 6 ], [ 2, 5 ], [ 2, 1 ], [ 3, 7 ], [ 6, 3 ], [ 6, 8 ], [ 8, 9 ], [ 9, 4 ], [ 10, 12 ], [ 11, 16 ], [ 12, 15 ], [ 12, 11 ], [ 13, 17 ], [ 16, 13 ], [ 16, 18 ], [ 18, 19 ], [ 19, 14 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Janice knows Ainsley. Graeme knows Blake. Destiny knows Maria. Herbert knows Alice. Carmela knows Janice. Vicki knows Carmela. Elmer knows Estella. Janice knows Graeme. Alice knows Vicki. Wallace knows Elmer. Stefan knows Jennifer. Maria knows Stefan. Elmer knows Scott. Jules knows Glenn. Cate knows Herbert. Stefan knows Jules. Estella knows Destiny. Herbert knows Charity. Which of Herbert and Elmer can Cate reach?", "answer": "Herbert", "steps": [ "Cate knows Herbert." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Cate", "Ainsley", "Alice", "Vicki", "Herbert", "Charity", "Carmela", "Graeme", "Janice", "Blake", "Wallace", "Jennifer", "Estella", "Destiny", "Elmer", "Scott", "Maria", "Jules", "Stefan", "Glenn" ], "edges": [ [ 0, 4 ], [ 2, 3 ], [ 3, 6 ], [ 4, 5 ], [ 4, 2 ], [ 6, 8 ], [ 7, 9 ], [ 8, 1 ], [ 8, 7 ], [ 10, 14 ], [ 12, 13 ], [ 13, 16 ], [ 14, 15 ], [ 14, 12 ], [ 16, 18 ], [ 17, 19 ], [ 18, 11 ], [ 18, 17 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Charlene knows Owen. Mack knows Bruno. Charlene knows Melissa. Charlene knows Jerome. Melissa knows Mack. Mack knows Ariel. Ebony knows Estelle. Donald knows Heidi. Donald knows Haley. Ebony knows Odette. Ebony knows Carmen. Melissa knows Norma. Conner knows Donald. Mack knows Sadie. Conner knows Lorenzo. Conner knows Francis. Melissa knows Gunnar. Donald knows Ebony. Which of Ebony and Mack can Conner reach?", "answer": "Ebony", "steps": [ "Conner knows Donald.", "Donald knows Ebony." ], "difficulty": 2, "original_distance": 3, "idx_to_symbol": [ "Conner", "Ebony", "Donald", "Lorenzo", "Heidi", "Carmen", "Haley", "Odette", "Francis", "Estelle", "Charlene", "Mack", "Melissa", "Jerome", "Gunnar", "Bruno", "Norma", "Sadie", "Owen", "Ariel" ], "edges": [ [ 0, 3 ], [ 0, 8 ], [ 0, 2 ], [ 1, 5 ], [ 1, 7 ], [ 1, 9 ], [ 2, 4 ], [ 2, 6 ], [ 2, 1 ], [ 10, 13 ], [ 10, 18 ], [ 10, 12 ], [ 11, 15 ], [ 11, 17 ], [ 11, 19 ], [ 12, 14 ], [ 12, 16 ], [ 12, 11 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Wade knows Preston. Lee knows Allan. Lee knows Fabian. Kent knows Ida. Preston knows Clement. Jacques knows Kim. Fabian knows Tessa. Ben knows Billy. Nell knows Jacques. Ida knows Alfonso. Jacques knows Wade. Nell knows Ben. Allan knows Darcy. Ursula knows Kent. Billy knows Gail. Ursula knows Lee. Tessa knows Chance. Kim knows Bernadette. Which of Chance and Clement can Ursula reach?", "answer": "Chance", "steps": [ "Ursula knows Lee.", "Lee knows Fabian.", "Fabian knows Tessa.", "Tessa knows Chance." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Ursula", "Ida", "Fabian", "Chance", "Kent", "Lee", "Alfonso", "Tessa", "Darcy", "Allan", "Nell", "Billy", "Wade", "Clement", "Ben", "Jacques", "Gail", "Preston", "Bernadette", "Kim" ], "edges": [ [ 0, 4 ], [ 0, 5 ], [ 1, 6 ], [ 2, 7 ], [ 4, 1 ], [ 5, 2 ], [ 5, 9 ], [ 7, 3 ], [ 9, 8 ], [ 10, 14 ], [ 10, 15 ], [ 11, 16 ], [ 12, 17 ], [ 14, 11 ], [ 15, 12 ], [ 15, 19 ], [ 17, 13 ], [ 19, 18 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Desmond knows Darwin. Joanna knows Delia. Brett knows Lawson. Joyce knows Annette. Horace knows Joyce. Trudy knows Rosa. Joanna knows Hardy. Delia knows Desmond. Hardy knows Horace. Connor knows Jim. Lawson knows Bob. Jim knows Gabriel. Delia knows Kieran. Brett knows Trudy. Kieran knows Clay. Gabriel knows Bart. Connor knows Brett. Bart knows Terrence. Which of Jim and Hardy can Joanna reach?", "answer": "Hardy", "steps": [ "Joanna knows Hardy." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Joanna", "Horace", "Darwin", "Hardy", "Joyce", "Annette", "Kieran", "Clay", "Delia", "Desmond", "Connor", "Gabriel", "Rosa", "Jim", "Bart", "Terrence", "Lawson", "Bob", "Brett", "Trudy" ], "edges": [ [ 0, 3 ], [ 0, 8 ], [ 1, 4 ], [ 3, 1 ], [ 4, 5 ], [ 6, 7 ], [ 8, 6 ], [ 8, 9 ], [ 9, 2 ], [ 10, 13 ], [ 10, 18 ], [ 11, 14 ], [ 13, 11 ], [ 14, 15 ], [ 16, 17 ], [ 18, 16 ], [ 18, 19 ], [ 19, 12 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Maude knows Elmer. Brittany knows Zara. Bonnie knows Julian. Zara knows Bonnie. Lena knows Brittany. Larissa knows Fred. Louisa knows Dolores. Bonnie knows Jerome. Louisa knows Sam. Julian knows Elias. Larissa knows Barney. Barney knows Jon. Brittany knows Odette. Brittany knows Maude. Audrey knows Larissa. Louisa knows Audrey. Henrietta knows Louisa. Sam knows Gary. Which of Barney and Julian can Henrietta reach?", "answer": "Barney", "steps": [ "Henrietta knows Louisa.", "Louisa knows Audrey.", "Audrey knows Larissa.", "Larissa knows Barney." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Henrietta", "Larissa", "Louisa", "Dolores", "Barney", "Fred", "Sam", "Gary", "Audrey", "Jon", "Lena", "Bonnie", "Brittany", "Odette", "Julian", "Jerome", "Maude", "Elmer", "Zara", "Elias" ], "edges": [ [ 0, 2 ], [ 1, 5 ], [ 1, 4 ], [ 2, 3 ], [ 2, 6 ], [ 2, 8 ], [ 4, 9 ], [ 6, 7 ], [ 8, 1 ], [ 10, 12 ], [ 11, 15 ], [ 11, 14 ], [ 12, 13 ], [ 12, 16 ], [ 12, 18 ], [ 14, 19 ], [ 16, 17 ], [ 18, 11 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Curtis knows Kenneth. Benjamin knows Larry. Jared knows Chance. Richard knows Marcia. Juan knows Benjamin. Hayley knows Kent. Jacob knows Curtis. Chance knows Abigail. Kenneth knows Shawn. Juan knows Horace. Shawn knows Richard. Kenneth knows Zoe. Catherine knows Joan. Juan knows Hayley. Curtis knows Marian. Curtis knows Catherine. Hayley knows Jared. Julie knows Juan. Which of Juan and Curtis can Jacob reach?", "answer": "Curtis", "steps": [ "Jacob knows Curtis." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Jacob", "Marian", "Shawn", "Richard", "Curtis", "Marcia", "Kenneth", "Catherine", "Zoe", "Joan", "Julie", "Horace", "Jared", "Chance", "Juan", "Abigail", "Hayley", "Benjamin", "Kent", "Larry" ], "edges": [ [ 0, 4 ], [ 2, 3 ], [ 3, 5 ], [ 4, 1 ], [ 4, 6 ], [ 4, 7 ], [ 6, 2 ], [ 6, 8 ], [ 7, 9 ], [ 10, 14 ], [ 12, 13 ], [ 13, 15 ], [ 14, 11 ], [ 14, 16 ], [ 14, 17 ], [ 16, 12 ], [ 16, 18 ], [ 17, 19 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Daniel knows Haley. Kelly knows Vance. Axel knows Bryan. Nina knows Wayne. Axel knows Sheila. Sheila knows Richard. Electra knows Jon. Kelly knows Edward. Wayne knows Dana. Vance knows Nina. Hailey knows Tyler. Gemma knows Naomi. Daniel knows Kate. Electra knows Hailey. Haley knows Fisher. Fisher knows Axel. Wayne knows Electra. Sheila knows Gemma. Which of Sheila and Electra can Daniel reach?", "answer": "Sheila", "steps": [ "Daniel knows Haley.", "Haley knows Fisher.", "Fisher knows Axel.", "Axel knows Sheila." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Daniel", "Sheila", "Naomi", "Richard", "Haley", "Bryan", "Fisher", "Gemma", "Axel", "Kate", "Kelly", "Electra", "Tyler", "Jon", "Vance", "Dana", "Nina", "Hailey", "Wayne", "Edward" ], "edges": [ [ 0, 4 ], [ 0, 9 ], [ 1, 3 ], [ 1, 7 ], [ 4, 6 ], [ 6, 8 ], [ 7, 2 ], [ 8, 5 ], [ 8, 1 ], [ 10, 14 ], [ 10, 19 ], [ 11, 13 ], [ 11, 17 ], [ 14, 16 ], [ 16, 18 ], [ 17, 12 ], [ 18, 15 ], [ 18, 11 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Dick knows Kirsten. Wendell knows Darren. Darren knows Isiah. Dolores knows Teresa. Dolores knows Bernadette. Alyson knows Nicholas. Clark knows Malcolm. Nicholas knows Ignacio. Christopher knows Clark. Teresa knows Carrie. Malcolm knows Lars. Clark knows Perry. Kirsten knows Wendell. Ignacio knows Dick. Wendell knows Nash. Lamar knows Dolores. Lars knows Lamar. Nicholas knows Layla. Which of Lamar and Kirsten can Christopher reach?", "answer": "Lamar", "steps": [ "Christopher knows Clark.", "Clark knows Malcolm.", "Malcolm knows Lars.", "Lars knows Lamar." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Christopher", "Malcolm", "Lamar", "Dolores", "Bernadette", "Teresa", "Clark", "Perry", "Lars", "Carrie", "Alyson", "Ignacio", "Kirsten", "Wendell", "Nash", "Darren", "Nicholas", "Layla", "Dick", "Isiah" ], "edges": [ [ 0, 6 ], [ 1, 8 ], [ 2, 3 ], [ 3, 4 ], [ 3, 5 ], [ 5, 9 ], [ 6, 7 ], [ 6, 1 ], [ 8, 2 ], [ 10, 16 ], [ 11, 18 ], [ 12, 13 ], [ 13, 14 ], [ 13, 15 ], [ 15, 19 ], [ 16, 17 ], [ 16, 11 ], [ 18, 12 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Kelsey knows Kristin. Gwen knows Christian. Ted knows Kelsey. Stacy knows Donovan. Christian knows Larissa. Veronica knows Knox. Jude knows Stacy. Bruno knows Maya. Stacy knows Ted. Julius knows Bruno. Chance knows Dick. Larissa knows Greta. Kristin knows Veronica. Stacy knows Chance. Greta knows Fiona. Wanda knows Julius. Julius knows Gwen. Julius knows Hardy. Which of Knox and Fiona can Wanda reach?", "answer": "Fiona", "steps": [ "Wanda knows Julius.", "Julius knows Gwen.", "Gwen knows Christian.", "Christian knows Larissa.", "Larissa knows Greta.", "Greta knows Fiona." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Wanda", "Fiona", "Greta", "Maya", "Hardy", "Julius", "Gwen", "Larissa", "Christian", "Bruno", "Jude", "Knox", "Veronica", "Dick", "Donovan", "Stacy", "Ted", "Kristin", "Kelsey", "Chance" ], "edges": [ [ 0, 5 ], [ 2, 1 ], [ 5, 4 ], [ 5, 6 ], [ 5, 9 ], [ 6, 8 ], [ 7, 2 ], [ 8, 7 ], [ 9, 3 ], [ 10, 15 ], [ 12, 11 ], [ 15, 14 ], [ 15, 16 ], [ 15, 19 ], [ 16, 18 ], [ 17, 12 ], [ 18, 17 ], [ 19, 13 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Terry knows Blake. Haven knows Penny. Jolene knows Ira. Jolene knows Edison. Fritz knows Terry. Brittany knows Fritz. Bruce knows Kaleb. Haven knows Shannon. Hunter knows Brittany. Riley knows Terrence. Penny knows Livia. Blake knows Jolene. Marie knows Haven. Edison knows Elvira. Hunter knows Hannah. Terrence knows Isla. Isla knows Marie. Bruce knows Riley. Which of Isla and Terry can Hunter reach?", "answer": "Terry", "steps": [ "Hunter knows Brittany.", "Brittany knows Fritz.", "Fritz knows Terry." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Hunter", "Hannah", "Brittany", "Fritz", "Jolene", "Edison", "Terry", "Blake", "Elvira", "Ira", "Bruce", "Kaleb", "Riley", "Terrence", "Haven", "Penny", "Isla", "Marie", "Livia", "Shannon" ], "edges": [ [ 0, 1 ], [ 0, 2 ], [ 2, 3 ], [ 3, 6 ], [ 4, 5 ], [ 4, 9 ], [ 5, 8 ], [ 6, 7 ], [ 7, 4 ], [ 10, 11 ], [ 10, 12 ], [ 12, 13 ], [ 13, 16 ], [ 14, 15 ], [ 14, 19 ], [ 15, 18 ], [ 16, 17 ], [ 17, 14 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Susanne knows Knox. Jana knows Jamie. Thea knows Sydney. Sydney knows Larissa. Kobe knows Percy. Knox knows Irene. Percy knows Jeanette. Thea knows Whitney. Shane knows Kobe. Knox knows Jem. Percy knows Howard. Jem knows Thea. Ethan knows Shane. Shane knows Clay. Ashley knows Kelly. Jeanette knows Jack. Jana knows Susanne. Ashley knows Ethan. Which of Susanne and Ethan can Jana reach?", "answer": "Susanne", "steps": [ "Jana knows Susanne." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Jana", "Jamie", "Thea", "Irene", "Larissa", "Whitney", "Sydney", "Jem", "Knox", "Susanne", "Ashley", "Kelly", "Percy", "Clay", "Jack", "Howard", "Jeanette", "Kobe", "Shane", "Ethan" ], "edges": [ [ 0, 1 ], [ 0, 9 ], [ 2, 5 ], [ 2, 6 ], [ 6, 4 ], [ 7, 2 ], [ 8, 3 ], [ 8, 7 ], [ 9, 8 ], [ 10, 11 ], [ 10, 19 ], [ 12, 15 ], [ 12, 16 ], [ 16, 14 ], [ 17, 12 ], [ 18, 13 ], [ 18, 17 ], [ 19, 18 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Kate knows Archer. Zoe knows Eva. Joel knows Annie. Yara knows Iris. Imogen knows Katrina. Archer knows Penny. Joyce knows Della. Joel knows Yara. Joyce knows Alejandro. Della knows Mary. Katrina knows Ada. Holden knows Imogen. Holly knows Ernie. Eva knows Joyce. Imogen knows Holly. Knox knows Kate. Kate knows Zoe. Ada knows Joel. Which of Zoe and Katrina can Holden reach?", "answer": "Katrina", "steps": [ "Holden knows Imogen.", "Imogen knows Katrina." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Holden", "Annie", "Ada", "Ernie", "Iris", "Imogen", "Yara", "Joel", "Holly", "Katrina", "Knox", "Alejandro", "Eva", "Penny", "Mary", "Kate", "Della", "Joyce", "Archer", "Zoe" ], "edges": [ [ 0, 5 ], [ 2, 7 ], [ 5, 8 ], [ 5, 9 ], [ 6, 4 ], [ 7, 1 ], [ 7, 6 ], [ 8, 3 ], [ 9, 2 ], [ 10, 15 ], [ 12, 17 ], [ 15, 18 ], [ 15, 19 ], [ 16, 14 ], [ 17, 11 ], [ 17, 16 ], [ 18, 13 ], [ 19, 12 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Whitney knows Giselle. Preston knows Bonnie. Laura knows Jakob. Whitney knows Rick. Zara knows Benjamin. William knows Kirsten. Hilda knows Whitney. Benjamin knows Dixie. Bailey knows Hilda. Laura knows Erica. William knows Maureen. Griffith knows Zara. Laura knows Lorenzo. Zara knows Laura. Hilda knows William. Jakob knows Alice. Benjamin knows Elizabeth. Whitney knows Preston. Which of Alice and Bonnie can Bailey reach?", "answer": "Bonnie", "steps": [ "Bailey knows Hilda.", "Hilda knows Whitney.", "Whitney knows Preston.", "Preston knows Bonnie." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Bailey", "William", "Maureen", "Whitney", "Kirsten", "Bonnie", "Giselle", "Rick", "Hilda", "Preston", "Griffith", "Benjamin", "Elizabeth", "Laura", "Dixie", "Alice", "Lorenzo", "Erica", "Zara", "Jakob" ], "edges": [ [ 0, 8 ], [ 1, 2 ], [ 1, 4 ], [ 3, 6 ], [ 3, 7 ], [ 3, 9 ], [ 8, 1 ], [ 8, 3 ], [ 9, 5 ], [ 10, 18 ], [ 11, 12 ], [ 11, 14 ], [ 13, 16 ], [ 13, 17 ], [ 13, 19 ], [ 18, 11 ], [ 18, 13 ], [ 19, 15 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Stephanie knows Cooper. Karl knows Fraser. Colleen knows Wilson. Katherine knows Cindy. Blake knows Leon. Dawn knows Stephanie. Colleen knows Jessie. Dawn knows Rose. Cooper knows Jacob. Dawn knows Colleen. Kenzie knows Bonnie. Jacob knows Kay. Blake knows Kenzie. Kenzie knows Ainsley. Colleen knows Amelia. Cindy knows Karl. Blake knows Katherine. Kenzie knows Holden. Which of Fraser and Kay can Dawn reach?", "answer": "Kay", "steps": [ "Dawn knows Stephanie.", "Stephanie knows Cooper.", "Cooper knows Jacob.", "Jacob knows Kay." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Dawn", "Jessie", "Stephanie", "Cooper", "Wilson", "Jacob", "Amelia", "Colleen", "Rose", "Kay", "Blake", "Holden", "Katherine", "Cindy", "Ainsley", "Karl", "Bonnie", "Kenzie", "Leon", "Fraser" ], "edges": [ [ 0, 7 ], [ 0, 8 ], [ 0, 2 ], [ 2, 3 ], [ 3, 5 ], [ 5, 9 ], [ 7, 1 ], [ 7, 4 ], [ 7, 6 ], [ 10, 17 ], [ 10, 18 ], [ 10, 12 ], [ 12, 13 ], [ 13, 15 ], [ 15, 19 ], [ 17, 11 ], [ 17, 14 ], [ 17, 16 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Veronica knows Dell. Forrest knows Keegan. Barney knows Claudia. Lara knows Chloe. Dell knows Yvette. Chloe knows Paige. Yvette knows Margaret. Keegan knows Barney. Claudia knows Nina. Hope knows Mason. Courtney knows Hope. Claudia knows Courtney. Forrest knows Lamar. Eva knows Jeff. Jeff knows Veronica. Jeff knows Winston. Yvette knows Lara. Dale knows Forrest. Which of Lara and Courtney can Dale reach?", "answer": "Courtney", "steps": [ "Dale knows Forrest.", "Forrest knows Keegan.", "Keegan knows Barney.", "Barney knows Claudia.", "Claudia knows Courtney." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Dale", "Courtney", "Lamar", "Claudia", "Mason", "Keegan", "Barney", "Hope", "Nina", "Forrest", "Eva", "Lara", "Winston", "Yvette", "Paige", "Veronica", "Dell", "Chloe", "Margaret", "Jeff" ], "edges": [ [ 0, 9 ], [ 1, 7 ], [ 3, 1 ], [ 3, 8 ], [ 5, 6 ], [ 6, 3 ], [ 7, 4 ], [ 9, 2 ], [ 9, 5 ], [ 10, 19 ], [ 11, 17 ], [ 13, 11 ], [ 13, 18 ], [ 15, 16 ], [ 16, 13 ], [ 17, 14 ], [ 19, 12 ], [ 19, 15 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Drake knows Kai. Dante knows Tessa. Lennox knows Christian. Wendell knows Dante. Sylvia knows Drake. Drake knows Felicia. Sylvia knows Hayley. Christina knows Stephen. Wendell knows Barbara. Louise knows Fraser. Drake knows Rebecca. Wendell knows Ellis. Barbara knows Christina. Victor knows Wendell. Wendell knows Gary. Kai knows Lennox. Drake knows Louise. Victor knows Jim. Which of Christina and Lennox can Sylvia reach?", "answer": "Lennox", "steps": [ "Sylvia knows Drake.", "Drake knows Kai.", "Kai knows Lennox." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Sylvia", "Louise", "Drake", "Kai", "Hayley", "Christian", "Lennox", "Felicia", "Fraser", "Rebecca", "Victor", "Dante", "Wendell", "Barbara", "Jim", "Stephen", "Christina", "Gary", "Tessa", "Ellis" ], "edges": [ [ 0, 4 ], [ 0, 2 ], [ 1, 8 ], [ 2, 3 ], [ 2, 7 ], [ 2, 1 ], [ 2, 9 ], [ 3, 6 ], [ 6, 5 ], [ 10, 14 ], [ 10, 12 ], [ 11, 18 ], [ 12, 13 ], [ 12, 17 ], [ 12, 11 ], [ 12, 19 ], [ 13, 16 ], [ 16, 15 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Alyssa knows Ariana. Barbara knows Houston. Violet knows Gertrude. Gertrude knows Garrett. Dakota knows Raymond. Barbara knows Violet. Garrett knows Isla. Ariana knows Fabian. Xavier knows Porter. Xavier knows Colby. Violet knows Dorothy. Garrett knows Melody. Dorothy knows Rita. Rita knows Anita. Colby knows Alyssa. Cassidy knows Dakota. Dakota knows Abby. Colby knows Cassidy. Which of Gertrude and Cassidy can Barbara reach?", "answer": "Gertrude", "steps": [ "Barbara knows Violet.", "Violet knows Gertrude." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Barbara", "Anita", "Garrett", "Houston", "Gertrude", "Rita", "Melody", "Isla", "Violet", "Dorothy", "Xavier", "Fabian", "Dakota", "Porter", "Cassidy", "Ariana", "Raymond", "Abby", "Colby", "Alyssa" ], "edges": [ [ 0, 3 ], [ 0, 8 ], [ 2, 6 ], [ 2, 7 ], [ 4, 2 ], [ 5, 1 ], [ 8, 4 ], [ 8, 9 ], [ 9, 5 ], [ 10, 13 ], [ 10, 18 ], [ 12, 16 ], [ 12, 17 ], [ 14, 12 ], [ 15, 11 ], [ 18, 14 ], [ 18, 19 ], [ 19, 15 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Cole knows Deanna. Heather knows Anthony. Lawrence knows Cole. Odette knows Harry. Rachel knows Valerie. Harry knows Rachel. Valerie knows Brittany. Carl knows Ramon. Cole knows Carl. Anthony knows Lawrence. Dewey knows Ebony. Ebony knows Odette. Rachel knows Jodi. Valerie knows Kate. Valerie knows Annette. Taylor knows Heather. Carl knows Madeline. Carl knows Marlene. Which of Rachel and Cole can Dewey reach?", "answer": "Rachel", "steps": [ "Dewey knows Ebony.", "Ebony knows Odette.", "Odette knows Harry.", "Harry knows Rachel." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Dewey", "Odette", "Annette", "Valerie", "Harry", "Rachel", "Ebony", "Jodi", "Brittany", "Kate", "Taylor", "Anthony", "Madeline", "Carl", "Lawrence", "Cole", "Heather", "Deanna", "Ramon", "Marlene" ], "edges": [ [ 0, 6 ], [ 1, 4 ], [ 3, 2 ], [ 3, 8 ], [ 3, 9 ], [ 4, 5 ], [ 5, 7 ], [ 5, 3 ], [ 6, 1 ], [ 10, 16 ], [ 11, 14 ], [ 13, 12 ], [ 13, 18 ], [ 13, 19 ], [ 14, 15 ], [ 15, 17 ], [ 15, 13 ], [ 16, 11 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Lucy knows Dennis. Wendy knows Myrtle. Charlotte knows Bette. Charlotte knows Becky. Jay knows April. Dennis knows Jay. Wendy knows Edgar. Merle knows Chester. Merle knows Jeremiah. Edgar knows Rachel. Ashton knows Charlotte. Myrtle knows Clarence. Charlotte knows Wanda. Rachel knows Ashton. Jeremiah knows Brock. Jay knows Edmund. Chester knows Lucy. Jay knows Fernando. Which of Wanda and April can Merle reach?", "answer": "April", "steps": [ "Merle knows Chester.", "Chester knows Lucy.", "Lucy knows Dennis.", "Dennis knows Jay.", "Jay knows April." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Merle", "Lucy", "Fernando", "Brock", "April", "Chester", "Jay", "Jeremiah", "Edmund", "Dennis", "Wendy", "Rachel", "Bette", "Clarence", "Wanda", "Edgar", "Charlotte", "Myrtle", "Becky", "Ashton" ], "edges": [ [ 0, 7 ], [ 0, 5 ], [ 1, 9 ], [ 5, 1 ], [ 6, 2 ], [ 6, 4 ], [ 6, 8 ], [ 7, 3 ], [ 9, 6 ], [ 10, 17 ], [ 10, 15 ], [ 11, 19 ], [ 15, 11 ], [ 16, 12 ], [ 16, 14 ], [ 16, 18 ], [ 17, 13 ], [ 19, 16 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Ira knows Hayes. Farrah knows Perry. Hayes knows Gareth. Paula knows Jude. Allison knows Jolena. Dell knows Xavier. Gareth knows Esme. August knows Lily. Jolena knows Avery. Jude knows August. Rick knows Farrah. Kurt knows Essie. Perry knows Allison. Jude knows Leopold. Kurt knows Rick. Rick knows Dell. Leopold knows Ira. Paula knows Priscilla. Which of Hayes and Allison can Kurt reach?", "answer": "Allison", "steps": [ "Kurt knows Rick.", "Rick knows Farrah.", "Farrah knows Perry.", "Perry knows Allison." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Kurt", "Jolena", "Rick", "Xavier", "Dell", "Allison", "Perry", "Farrah", "Essie", "Avery", "Paula", "Gareth", "Jude", "Lily", "August", "Hayes", "Ira", "Leopold", "Priscilla", "Esme" ], "edges": [ [ 0, 8 ], [ 0, 2 ], [ 1, 9 ], [ 2, 4 ], [ 2, 7 ], [ 4, 3 ], [ 5, 1 ], [ 6, 5 ], [ 7, 6 ], [ 10, 18 ], [ 10, 12 ], [ 11, 19 ], [ 12, 14 ], [ 12, 17 ], [ 14, 13 ], [ 15, 11 ], [ 16, 15 ], [ 17, 16 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Barbara knows Holden. Miranda knows Drew. Peggy knows Gail. Barbara knows Peggy. Gwen knows Demetrius. Elsa knows Steve. Kathleen knows Barbara. Jude knows Kathleen. Riley knows Travis. Demetrius knows Riley. Andrew knows Tamara. Alejandro knows Andrew. Elsa knows Miranda. Tamara knows Elsa. Peggy knows Gwen. Hazel knows Hayes. Tamara knows Brody. Drew knows Hazel. Which of Drew and Demetrius can Alejandro reach?", "answer": "Drew", "steps": [ "Alejandro knows Andrew.", "Andrew knows Tamara.", "Tamara knows Elsa.", "Elsa knows Miranda.", "Miranda knows Drew." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Alejandro", "Drew", "Tamara", "Hayes", "Andrew", "Brody", "Steve", "Elsa", "Miranda", "Hazel", "Jude", "Demetrius", "Barbara", "Travis", "Kathleen", "Holden", "Gail", "Peggy", "Gwen", "Riley" ], "edges": [ [ 0, 4 ], [ 1, 9 ], [ 2, 5 ], [ 2, 7 ], [ 4, 2 ], [ 7, 6 ], [ 7, 8 ], [ 8, 1 ], [ 9, 3 ], [ 10, 14 ], [ 11, 19 ], [ 12, 15 ], [ 12, 17 ], [ 14, 12 ], [ 17, 16 ], [ 17, 18 ], [ 18, 11 ], [ 19, 13 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Henrietta knows Janet. Brad knows Harvey. Abel knows Alan. Cole knows Brad. Emily knows Henrietta. Kamila knows Clement. Clement knows Rick. Tim knows Connor. Hailey knows Carter. Trudy knows Emily. Janet knows Jay. Carter knows Tim. Tim knows Trudy. Alan knows Shaun. Clement knows Abel. Stephanie knows Kamila. Jay knows Earle. Shaun knows Cole. Which of Alan and Emily can Hailey reach?", "answer": "Emily", "steps": [ "Hailey knows Carter.", "Carter knows Tim.", "Tim knows Trudy.", "Trudy knows Emily." ], "difficulty": 4, "original_distance": 8, "idx_to_symbol": [ "Hailey", "Connor", "Janet", "Tim", "Emily", "Earle", "Henrietta", "Trudy", "Carter", "Jay", "Stephanie", "Rick", "Cole", "Clement", "Alan", "Harvey", "Shaun", "Abel", "Kamila", "Brad" ], "edges": [ [ 0, 8 ], [ 2, 9 ], [ 3, 1 ], [ 3, 7 ], [ 4, 6 ], [ 6, 2 ], [ 7, 4 ], [ 8, 3 ], [ 9, 5 ], [ 10, 18 ], [ 12, 19 ], [ 13, 11 ], [ 13, 17 ], [ 14, 16 ], [ 16, 12 ], [ 17, 14 ], [ 18, 13 ], [ 19, 15 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Monica knows Malcolm. Kristina knows Ebony. Jackson knows Logan. Lance knows Matt. Matt knows Brooks. Ebony knows Geneva. Jacob knows Jackson. Brad knows Rena. Lance knows Kristina. Dane knows Nadine. Logan knows Monica. Brad knows Dane. Pearl knows Mindy. Jacob knows Enrique. Rena knows Jacob. Ebony knows Virgil. Virgil knows Alyson. Alyson knows Pearl. Which of Logan and Alyson can Lance reach?", "answer": "Alyson", "steps": [ "Lance knows Kristina.", "Kristina knows Ebony.", "Ebony knows Virgil.", "Virgil knows Alyson." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Lance", "Alyson", "Brooks", "Mindy", "Matt", "Kristina", "Virgil", "Pearl", "Ebony", "Geneva", "Brad", "Logan", "Nadine", "Malcolm", "Dane", "Rena", "Jackson", "Monica", "Jacob", "Enrique" ], "edges": [ [ 0, 4 ], [ 0, 5 ], [ 1, 7 ], [ 4, 2 ], [ 5, 8 ], [ 6, 1 ], [ 7, 3 ], [ 8, 6 ], [ 8, 9 ], [ 10, 14 ], [ 10, 15 ], [ 11, 17 ], [ 14, 12 ], [ 15, 18 ], [ 16, 11 ], [ 17, 13 ], [ 18, 16 ], [ 18, 19 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Miranda knows Stella. Keaton knows Lena. Wilson knows Estella. Francesca knows Hank. Marion knows Miranda. Lena knows Wilson. Gary knows Ben. Marion knows Joyce. Francesca knows Leroy. Gary knows Atlas. Ben knows Evan. Wilson knows Marion. Joyce knows Iris. Hank knows Samuel. Keaton knows Jenna. Samuel knows Gary. Atlas knows Cara. Samuel knows Luz. Which of Wilson and Samuel can Francesca reach?", "answer": "Samuel", "steps": [ "Francesca knows Hank.", "Hank knows Samuel." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Francesca", "Cara", "Ben", "Evan", "Hank", "Luz", "Atlas", "Samuel", "Leroy", "Gary", "Keaton", "Iris", "Miranda", "Stella", "Lena", "Estella", "Joyce", "Wilson", "Jenna", "Marion" ], "edges": [ [ 0, 8 ], [ 0, 4 ], [ 2, 3 ], [ 4, 7 ], [ 6, 1 ], [ 7, 5 ], [ 7, 9 ], [ 9, 2 ], [ 9, 6 ], [ 10, 18 ], [ 10, 14 ], [ 12, 13 ], [ 14, 17 ], [ 16, 11 ], [ 17, 15 ], [ 17, 19 ], [ 19, 12 ], [ 19, 16 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Luther knows Jim. Jessie knows Julius. Norma knows Clay. Jasper knows Mae. Jim knows Virginia. Zoe knows Evan. Dakota knows Zach. Clay knows Fisher. Julius knows Dexter. Dakota knows Zoe. Mae knows Dakota. Virginia knows Brooke. Fisher knows Garland. Brooke knows Jessie. Daisy knows Luther. Rowan knows Daisy. Luther knows Hope. Evan knows Norma. Which of Luther and Dakota can Rowan reach?", "answer": "Luther", "steps": [ "Rowan knows Daisy.", "Daisy knows Luther." ], "difficulty": 2, "original_distance": 8, "idx_to_symbol": [ "Rowan", "Jessie", "Julius", "Brooke", "Jim", "Dexter", "Luther", "Virginia", "Daisy", "Hope", "Jasper", "Clay", "Fisher", "Norma", "Zoe", "Garland", "Dakota", "Evan", "Mae", "Zach" ], "edges": [ [ 0, 8 ], [ 1, 2 ], [ 2, 5 ], [ 3, 1 ], [ 4, 7 ], [ 6, 4 ], [ 6, 9 ], [ 7, 3 ], [ 8, 6 ], [ 10, 18 ], [ 11, 12 ], [ 12, 15 ], [ 13, 11 ], [ 14, 17 ], [ 16, 14 ], [ 16, 19 ], [ 17, 13 ], [ 18, 16 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Alma knows Melody. Haley knows Gina. Tanya knows Kane. Yara knows Evan. Greer knows Zara. Kane knows Aaron. David knows Jenny. Tanya knows Maggie. Zara knows Tanya. Amanda knows Haley. Melody knows David. Maggie knows Bruce. Aaron knows Monroe. Greer knows Selena. Kane knows Uma. Yara knows Alma. Amanda knows Abby. Melody knows Amanda. Which of Melody and Tanya can Greer reach?", "answer": "Tanya", "steps": [ "Greer knows Zara.", "Zara knows Tanya." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Greer", "Zara", "Tanya", "Uma", "Kane", "Maggie", "Monroe", "Bruce", "Selena", "Aaron", "Yara", "Alma", "Melody", "Abby", "Amanda", "David", "Gina", "Jenny", "Evan", "Haley" ], "edges": [ [ 0, 8 ], [ 0, 1 ], [ 1, 2 ], [ 2, 5 ], [ 2, 4 ], [ 4, 3 ], [ 4, 9 ], [ 5, 7 ], [ 9, 6 ], [ 10, 18 ], [ 10, 11 ], [ 11, 12 ], [ 12, 15 ], [ 12, 14 ], [ 14, 13 ], [ 14, 19 ], [ 15, 17 ], [ 19, 16 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Phoebe knows Esperanza. Roger knows Vivian. Esperanza knows Archie. Esperanza knows Harris. Gavin knows Humphrey. Olive knows Abigail. Archie knows Gavin. Lyric knows Walter. Virgil knows Mindy. Imogen knows Lucy. Lucy knows Olive. Harris knows Robert. Mindy knows Lyric. Mindy knows Imogen. Roger knows Phoebe. Jim knows Atlas. Jim knows Virgil. Humphrey knows Jonathan. Which of Humphrey and Olive can Roger reach?", "answer": "Humphrey", "steps": [ "Roger knows Phoebe.", "Phoebe knows Esperanza.", "Esperanza knows Archie.", "Archie knows Gavin.", "Gavin knows Humphrey." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Roger", "Vivian", "Gavin", "Jonathan", "Archie", "Esperanza", "Phoebe", "Harris", "Humphrey", "Robert", "Jim", "Atlas", "Lucy", "Abigail", "Imogen", "Mindy", "Virgil", "Lyric", "Olive", "Walter" ], "edges": [ [ 0, 1 ], [ 0, 6 ], [ 2, 8 ], [ 4, 2 ], [ 5, 4 ], [ 5, 7 ], [ 6, 5 ], [ 7, 9 ], [ 8, 3 ], [ 10, 11 ], [ 10, 16 ], [ 12, 18 ], [ 14, 12 ], [ 15, 14 ], [ 15, 17 ], [ 16, 15 ], [ 17, 19 ], [ 18, 13 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Perry knows Evan. Perry knows Bette. Cooper knows Perry. Charles knows Steve. Rosa knows Carmela. Cooper knows Vera. Vera knows Lyric. Logan knows Janice. Logan knows Lucia. Rosa knows Daniella. Lucia knows Cooper. Hayes knows Charles. Janice knows Claude. Tonya knows Haven. Hayes knows Francesca. Steve knows Tonya. Francesca knows Kelly. Steve knows Rosa. Which of Cooper and Steve can Hayes reach?", "answer": "Steve", "steps": [ "Hayes knows Charles.", "Charles knows Steve." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Hayes", "Charles", "Tonya", "Carmela", "Haven", "Francesca", "Steve", "Rosa", "Daniella", "Kelly", "Logan", "Lucia", "Vera", "Evan", "Lyric", "Janice", "Cooper", "Perry", "Bette", "Claude" ], "edges": [ [ 0, 1 ], [ 0, 5 ], [ 1, 6 ], [ 2, 4 ], [ 5, 9 ], [ 6, 2 ], [ 6, 7 ], [ 7, 3 ], [ 7, 8 ], [ 10, 11 ], [ 10, 15 ], [ 11, 16 ], [ 12, 14 ], [ 15, 19 ], [ 16, 12 ], [ 16, 17 ], [ 17, 13 ], [ 17, 18 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Jodi knows Daniella. Archer knows Trina. Gustavo knows Emma. Archie knows Isadora. Gustavo knows Khashayar. Gustavo knows Archer. Trina knows Harmony. Trina knows Vance. Emma knows Clement. Harmony knows Charles. Isadora knows Haley. Jennifer knows Gavin. Jennifer knows Herman. Isadora knows Arden. Haley knows Skyler. Jennifer knows Archie. Jennifer knows Jodi. Gustavo knows Scott. Which of Archie and Archer can Gustavo reach?", "answer": "Archer", "steps": [ "Gustavo knows Archer." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Gustavo", "Emma", "Khashayar", "Clement", "Trina", "Charles", "Scott", "Archer", "Harmony", "Vance", "Jennifer", "Jodi", "Gavin", "Daniella", "Isadora", "Skyler", "Herman", "Archie", "Haley", "Arden" ], "edges": [ [ 0, 2 ], [ 0, 1 ], [ 0, 6 ], [ 0, 7 ], [ 1, 3 ], [ 4, 8 ], [ 4, 9 ], [ 7, 4 ], [ 8, 5 ], [ 10, 12 ], [ 10, 11 ], [ 10, 16 ], [ 10, 17 ], [ 11, 13 ], [ 14, 18 ], [ 14, 19 ], [ 17, 14 ], [ 18, 15 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Rosemary knows Maria. William knows Tiffany. Georgia knows Ricardo. Ricardo knows Sadie. Mitchell knows Rosemary. Zack knows William. Sadie knows Colby. Ricardo knows Leigh. Rosemary knows Zack. William knows Miles. Victoria knows Dallas. Duncan knows Victoria. Victoria knows Georgia. Victoria knows Clarissa. Olivia knows Mitchell. Paula knows Duncan. Rosemary knows Garrison. Miles knows Anna. Which of Georgia and Zack can Olivia reach?", "answer": "Zack", "steps": [ "Olivia knows Mitchell.", "Mitchell knows Rosemary.", "Rosemary knows Zack." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Olivia", "Mitchell", "Anna", "Zack", "William", "Rosemary", "Tiffany", "Miles", "Maria", "Garrison", "Paula", "Duncan", "Colby", "Georgia", "Ricardo", "Victoria", "Leigh", "Sadie", "Clarissa", "Dallas" ], "edges": [ [ 0, 1 ], [ 1, 5 ], [ 3, 4 ], [ 4, 6 ], [ 4, 7 ], [ 5, 3 ], [ 5, 8 ], [ 5, 9 ], [ 7, 2 ], [ 10, 11 ], [ 11, 15 ], [ 13, 14 ], [ 14, 16 ], [ 14, 17 ], [ 15, 13 ], [ 15, 18 ], [ 15, 19 ], [ 17, 12 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Maria knows Irma. Alma knows Maria. Irma knows Sylvia. Jolene knows Tanya. Belinda knows Gordon. Irma knows Allen. Harmony knows Dean. Riley knows Tony. Esperanza knows Jolene. Dominic knows Esperanza. Tanya knows Blanche. Harmony knows Belinda. Dominic knows Luna. Esperanza knows Luke. Tanya knows Elias. Riley knows Dominic. Alma knows Taylor. Belinda knows Alma. Which of Irma and Tanya can Harmony reach?", "answer": "Irma", "steps": [ "Harmony knows Belinda.", "Belinda knows Alma.", "Alma knows Maria.", "Maria knows Irma." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Harmony", "Allen", "Alma", "Maria", "Belinda", "Taylor", "Irma", "Dean", "Gordon", "Sylvia", "Riley", "Blanche", "Esperanza", "Jolene", "Dominic", "Luke", "Tanya", "Tony", "Luna", "Elias" ], "edges": [ [ 0, 7 ], [ 0, 4 ], [ 2, 5 ], [ 2, 3 ], [ 3, 6 ], [ 4, 8 ], [ 4, 2 ], [ 6, 1 ], [ 6, 9 ], [ 10, 17 ], [ 10, 14 ], [ 12, 15 ], [ 12, 13 ], [ 13, 16 ], [ 14, 18 ], [ 14, 12 ], [ 16, 11 ], [ 16, 19 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Allan knows Franklin. Ada knows Hal. Lily knows Daniella. Franklin knows Ada. Chantal knows Lily. Henrietta knows Heath. Henrietta knows Pearl. Etta knows Chantal. Aurora knows Henrietta. Chantal knows Allan. Aurora knows Cornelius. Alana knows Dahlia. Allan knows Carter. Carter knows Valerie. Cornelius knows Calvin. Heath knows Haley. Alyssa knows Aurora. Pearl knows Alana. Which of Chantal and Aurora can Alyssa reach?", "answer": "Aurora", "steps": [ "Alyssa knows Aurora." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Alyssa", "Aurora", "Haley", "Heath", "Alana", "Pearl", "Henrietta", "Dahlia", "Cornelius", "Calvin", "Etta", "Chantal", "Valerie", "Carter", "Ada", "Franklin", "Allan", "Hal", "Lily", "Daniella" ], "edges": [ [ 0, 1 ], [ 1, 6 ], [ 1, 8 ], [ 3, 2 ], [ 4, 7 ], [ 5, 4 ], [ 6, 3 ], [ 6, 5 ], [ 8, 9 ], [ 10, 11 ], [ 11, 16 ], [ 11, 18 ], [ 13, 12 ], [ 14, 17 ], [ 15, 14 ], [ 16, 13 ], [ 16, 15 ], [ 18, 19 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Janice knows Ainsley. Graeme knows Blake. Destiny knows Maria. Herbert knows Alice. Carmela knows Janice. Vicki knows Carmela. Elmer knows Estella. Janice knows Graeme. Alice knows Vicki. Wallace knows Elmer. Stefan knows Jennifer. Maria knows Stefan. Elmer knows Scott. Jules knows Glenn. Cate knows Herbert. Stefan knows Jules. Estella knows Destiny. Herbert knows Charity. Which of Carmela and Maria can Cate reach?", "answer": "Carmela", "steps": [ "Cate knows Herbert.", "Herbert knows Alice.", "Alice knows Vicki.", "Vicki knows Carmela." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Cate", "Ainsley", "Alice", "Vicki", "Herbert", "Charity", "Carmela", "Graeme", "Janice", "Blake", "Wallace", "Jennifer", "Estella", "Destiny", "Elmer", "Scott", "Maria", "Jules", "Stefan", "Glenn" ], "edges": [ [ 0, 4 ], [ 2, 3 ], [ 3, 6 ], [ 4, 5 ], [ 4, 2 ], [ 6, 8 ], [ 7, 9 ], [ 8, 1 ], [ 8, 7 ], [ 10, 14 ], [ 12, 13 ], [ 13, 16 ], [ 14, 15 ], [ 14, 12 ], [ 16, 18 ], [ 17, 19 ], [ 18, 11 ], [ 18, 17 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Faye knows Mack. Ramona knows Eamon. Aisha knows Frankie. Hampton knows Jonathan. Frankie knows Roman. Olive knows Kirk. Kirk knows Ramona. Ted knows Sebastian. Olive knows Jerry. Frankie knows Hampton. Aisha knows Val. Faye knows Olive. Sebastian knows Aisha. Katrina knows Faye. Jonathan knows Ford. Ramona knows Rosa. Jonathan knows Percy. Emanuel knows Katrina. Which of Olive and Frankie can Emanuel reach?", "answer": "Olive", "steps": [ "Emanuel knows Katrina.", "Katrina knows Faye.", "Faye knows Olive." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Emanuel", "Katrina", "Ramona", "Jerry", "Mack", "Kirk", "Rosa", "Eamon", "Olive", "Faye", "Ted", "Sebastian", "Jonathan", "Roman", "Val", "Hampton", "Ford", "Percy", "Frankie", "Aisha" ], "edges": [ [ 0, 1 ], [ 1, 9 ], [ 2, 6 ], [ 2, 7 ], [ 5, 2 ], [ 8, 3 ], [ 8, 5 ], [ 9, 4 ], [ 9, 8 ], [ 10, 11 ], [ 11, 19 ], [ 12, 16 ], [ 12, 17 ], [ 15, 12 ], [ 18, 13 ], [ 18, 15 ], [ 19, 14 ], [ 19, 18 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Livia knows Aisha. Jim knows Liam. Dana knows Thomas. Tabitha knows Karl. Frida knows Pete. Dana knows Tabitha. Liam knows Gonzalo. Joyce knows Dana. Aisha knows Jeremiah. Livia knows Isla. Gonzalo knows Julio. Jim knows Leopold. Asher knows Joyce. Arden knows Jolene. Joyce knows Frida. Gonzalo knows Livia. Arden knows Asher. Julio knows Devin. Which of Aisha and Tabitha can Arden reach?", "answer": "Tabitha", "steps": [ "Arden knows Asher.", "Asher knows Joyce.", "Joyce knows Dana.", "Dana knows Tabitha." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Arden", "Asher", "Frida", "Tabitha", "Dana", "Joyce", "Jolene", "Pete", "Karl", "Thomas", "Jim", "Liam", "Julio", "Aisha", "Livia", "Gonzalo", "Leopold", "Devin", "Jeremiah", "Isla" ], "edges": [ [ 0, 6 ], [ 0, 1 ], [ 1, 5 ], [ 2, 7 ], [ 3, 8 ], [ 4, 3 ], [ 4, 9 ], [ 5, 2 ], [ 5, 4 ], [ 10, 16 ], [ 10, 11 ], [ 11, 15 ], [ 12, 17 ], [ 13, 18 ], [ 14, 13 ], [ 14, 19 ], [ 15, 12 ], [ 15, 14 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Eleanor knows Annie. Irma knows Dewey. Kingsley knows Otto. Dewey knows Lola. Lola knows Jenna. Effie knows Keegan. Kingsley knows Garrison. Otto knows Shannon. Garrison knows Jolene. Eleanor knows Irma. Irma knows Garland. Garrison knows Esther. Sadie knows Kingsley. Jolene knows Kirsten. Kirsten knows Jasmine. Shannon knows Sierra. Tiffany knows Eleanor. Annie knows Effie. Which of Dewey and Jolene can Sadie reach?", "answer": "Jolene", "steps": [ "Sadie knows Kingsley.", "Kingsley knows Garrison.", "Garrison knows Jolene." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Sadie", "Kirsten", "Shannon", "Kingsley", "Otto", "Sierra", "Jolene", "Jasmine", "Garrison", "Esther", "Tiffany", "Lola", "Effie", "Eleanor", "Annie", "Keegan", "Dewey", "Jenna", "Irma", "Garland" ], "edges": [ [ 0, 3 ], [ 1, 7 ], [ 2, 5 ], [ 3, 4 ], [ 3, 8 ], [ 4, 2 ], [ 6, 1 ], [ 8, 6 ], [ 8, 9 ], [ 10, 13 ], [ 11, 17 ], [ 12, 15 ], [ 13, 14 ], [ 13, 18 ], [ 14, 12 ], [ 16, 11 ], [ 18, 16 ], [ 18, 19 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Stella knows Chandler. Bridget knows Laura. Antonio knows Kit. Stella knows Heath. Hampton knows Jade. Heath knows Daniella. Laura knows Hampton. Shannon knows Stella. Heath knows Saul. Tonya knows Bridget. Reed knows Bart. Kit knows Sara. Farrah knows Shannon. Laura knows Antonio. Chandler knows Reed. Jade knows Zoe. Antonio knows Eunice. Daniella knows Jose. Which of Reed and Jade can Farrah reach?", "answer": "Reed", "steps": [ "Farrah knows Shannon.", "Shannon knows Stella.", "Stella knows Chandler.", "Chandler knows Reed." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Farrah", "Chandler", "Bart", "Jose", "Shannon", "Heath", "Reed", "Daniella", "Saul", "Stella", "Tonya", "Hampton", "Zoe", "Sara", "Bridget", "Antonio", "Jade", "Kit", "Eunice", "Laura" ], "edges": [ [ 0, 4 ], [ 1, 6 ], [ 4, 9 ], [ 5, 7 ], [ 5, 8 ], [ 6, 2 ], [ 7, 3 ], [ 9, 1 ], [ 9, 5 ], [ 10, 14 ], [ 11, 16 ], [ 14, 19 ], [ 15, 17 ], [ 15, 18 ], [ 16, 12 ], [ 17, 13 ], [ 19, 11 ], [ 19, 15 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Sandy knows Cristina. Cristina knows Eleanor. Arlene knows Alder. Eleanor knows Opal. Arlene knows Dewey. Tamara knows Louis. Eleanor knows Gene. Adelaide knows Ellis. Opal knows Adelaide. Stella knows Judy. Dewey knows Tamara. Brenda knows Darcy. Judy knows Arlene. Alder knows Brenda. Peggy knows Abel. Brenda knows Lola. Adelaide knows Allen. Gene knows Peggy. Which of Opal and Alder can Stella reach?", "answer": "Alder", "steps": [ "Stella knows Judy.", "Judy knows Arlene.", "Arlene knows Alder." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Stella", "Louis", "Arlene", "Lola", "Darcy", "Dewey", "Alder", "Judy", "Tamara", "Brenda", "Sandy", "Abel", "Eleanor", "Ellis", "Allen", "Gene", "Opal", "Cristina", "Peggy", "Adelaide" ], "edges": [ [ 0, 7 ], [ 2, 5 ], [ 2, 6 ], [ 5, 8 ], [ 6, 9 ], [ 7, 2 ], [ 8, 1 ], [ 9, 3 ], [ 9, 4 ], [ 10, 17 ], [ 12, 15 ], [ 12, 16 ], [ 15, 18 ], [ 16, 19 ], [ 17, 12 ], [ 18, 11 ], [ 19, 13 ], [ 19, 14 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Adele knows Erwin. Pearl knows Paula. Florence knows Kent. Calvin knows Billy. Casey knows Tabitha. Darla knows Peggy. Peter knows Florence. Billy knows Maude. Paula knows Casey. Erwin knows Marvin. Kent knows Angela. Marvin knows Calvin. Angela knows Julius. Shelby knows Ivy. Peggy knows Adele. Rex knows Pearl. Tabitha knows Peter. Maude knows Shelby. Which of Billy and Florence can Darla reach?", "answer": "Billy", "steps": [ "Darla knows Peggy.", "Peggy knows Adele.", "Adele knows Erwin.", "Erwin knows Marvin.", "Marvin knows Calvin.", "Calvin knows Billy." ], "difficulty": 6, "original_distance": 9, "idx_to_symbol": [ "Darla", "Adele", "Calvin", "Peggy", "Maude", "Marvin", "Shelby", "Erwin", "Ivy", "Billy", "Rex", "Paula", "Peter", "Pearl", "Kent", "Tabitha", "Angela", "Casey", "Julius", "Florence" ], "edges": [ [ 0, 3 ], [ 1, 7 ], [ 2, 9 ], [ 3, 1 ], [ 4, 6 ], [ 5, 2 ], [ 6, 8 ], [ 7, 5 ], [ 9, 4 ], [ 10, 13 ], [ 11, 17 ], [ 12, 19 ], [ 13, 11 ], [ 14, 16 ], [ 15, 12 ], [ 16, 18 ], [ 17, 15 ], [ 19, 14 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Kelly knows Alison. Preston knows Drake. Wade knows Preston. Samantha knows Jana. Preston knows Sylvia. Kelly knows Selena. Jana knows Margaret. Catherine knows Evelyn. Drake knows Dwight. Drake knows Catherine. Drake knows Paula. Preston knows Conner. Kelly knows Grover. Sylvia knows Ralph. Samantha knows Jorge. Alison knows Caleb. Samantha knows Kelly. Todd knows Samantha. Which of Preston and Samantha can Wade reach?", "answer": "Preston", "steps": [ "Wade knows Preston." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Wade", "Catherine", "Sylvia", "Drake", "Conner", "Paula", "Preston", "Dwight", "Ralph", "Evelyn", "Todd", "Alison", "Jana", "Kelly", "Jorge", "Selena", "Samantha", "Grover", "Margaret", "Caleb" ], "edges": [ [ 0, 6 ], [ 1, 9 ], [ 2, 8 ], [ 3, 5 ], [ 3, 7 ], [ 3, 1 ], [ 6, 4 ], [ 6, 2 ], [ 6, 3 ], [ 10, 16 ], [ 11, 19 ], [ 12, 18 ], [ 13, 15 ], [ 13, 17 ], [ 13, 11 ], [ 16, 14 ], [ 16, 12 ], [ 16, 13 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Raymond knows Florence. Esperanza knows Cliff. Dolores knows David. Cliff knows Harley. Esperanza knows Carla. Porter knows Raymond. Kevin knows Spencer. Porter knows Penny. Cliff knows Gerard. Cliff knows Gertrude. Carla knows Kevin. Raymond knows Vera. Vera knows Jeff. Jeff knows Kyle. Brent knows Trevor. Penny knows Dolores. Harley knows Brent. Raymond knows Larissa. Which of Vera and Harley can Porter reach?", "answer": "Vera", "steps": [ "Porter knows Raymond.", "Raymond knows Vera." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Porter", "Jeff", "Raymond", "Vera", "Larissa", "Dolores", "David", "Florence", "Penny", "Kyle", "Esperanza", "Brent", "Cliff", "Harley", "Gertrude", "Kevin", "Spencer", "Gerard", "Carla", "Trevor" ], "edges": [ [ 0, 8 ], [ 0, 2 ], [ 1, 9 ], [ 2, 4 ], [ 2, 7 ], [ 2, 3 ], [ 3, 1 ], [ 5, 6 ], [ 8, 5 ], [ 10, 18 ], [ 10, 12 ], [ 11, 19 ], [ 12, 14 ], [ 12, 17 ], [ 12, 13 ], [ 13, 11 ], [ 15, 16 ], [ 18, 15 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Lucy knows Dennis. Wendy knows Myrtle. Charlotte knows Bette. Charlotte knows Becky. Jay knows April. Dennis knows Jay. Wendy knows Edgar. Merle knows Chester. Merle knows Jeremiah. Edgar knows Rachel. Ashton knows Charlotte. Myrtle knows Clarence. Charlotte knows Wanda. Rachel knows Ashton. Jeremiah knows Brock. Jay knows Edmund. Chester knows Lucy. Jay knows Fernando. Which of Jay and Charlotte can Merle reach?", "answer": "Jay", "steps": [ "Merle knows Chester.", "Chester knows Lucy.", "Lucy knows Dennis.", "Dennis knows Jay." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Merle", "Lucy", "Fernando", "Brock", "April", "Chester", "Jay", "Jeremiah", "Edmund", "Dennis", "Wendy", "Rachel", "Bette", "Clarence", "Wanda", "Edgar", "Charlotte", "Myrtle", "Becky", "Ashton" ], "edges": [ [ 0, 7 ], [ 0, 5 ], [ 1, 9 ], [ 5, 1 ], [ 6, 2 ], [ 6, 4 ], [ 6, 8 ], [ 7, 3 ], [ 9, 6 ], [ 10, 17 ], [ 10, 15 ], [ 11, 19 ], [ 15, 11 ], [ 16, 12 ], [ 16, 14 ], [ 16, 18 ], [ 17, 13 ], [ 19, 16 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Sylvia knows June. Gerard knows Luke. Carl knows Eve. Drew knows Brody. Luke knows Rufus. Sarah knows Sylvia. Brody knows Tonya. Miles knows Drew. Lark knows Carl. Sylvia knows Bert. Drew knows Austin. Rocco knows Colby. Sarah knows Lark. Brody knows Garrison. Drew knows Joy. Miles knows Gerard. Sylvia knows Rocco. Rocco knows Fern. Which of Carl and Luke can Sarah reach?", "answer": "Carl", "steps": [ "Sarah knows Lark.", "Lark knows Carl." ], "difficulty": 2, "original_distance": 3, "idx_to_symbol": [ "Sarah", "Lark", "Fern", "Rocco", "Eve", "Sylvia", "Bert", "Colby", "June", "Carl", "Miles", "Gerard", "Garrison", "Brody", "Rufus", "Drew", "Austin", "Tonya", "Joy", "Luke" ], "edges": [ [ 0, 5 ], [ 0, 1 ], [ 1, 9 ], [ 3, 2 ], [ 3, 7 ], [ 5, 6 ], [ 5, 3 ], [ 5, 8 ], [ 9, 4 ], [ 10, 15 ], [ 10, 11 ], [ 11, 19 ], [ 13, 12 ], [ 13, 17 ], [ 15, 16 ], [ 15, 13 ], [ 15, 18 ], [ 19, 14 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Adele knows Erwin. Pearl knows Paula. Florence knows Kent. Calvin knows Billy. Casey knows Tabitha. Darla knows Peggy. Peter knows Florence. Billy knows Maude. Paula knows Casey. Erwin knows Marvin. Kent knows Angela. Marvin knows Calvin. Angela knows Julius. Shelby knows Ivy. Peggy knows Adele. Rex knows Pearl. Tabitha knows Peter. Maude knows Shelby. Which of Angela and Shelby can Darla reach?", "answer": "Shelby", "steps": [ "Darla knows Peggy.", "Peggy knows Adele.", "Adele knows Erwin.", "Erwin knows Marvin.", "Marvin knows Calvin.", "Calvin knows Billy.", "Billy knows Maude.", "Maude knows Shelby." ], "difficulty": 8, "original_distance": 9, "idx_to_symbol": [ "Darla", "Adele", "Calvin", "Peggy", "Maude", "Marvin", "Shelby", "Erwin", "Ivy", "Billy", "Rex", "Paula", "Peter", "Pearl", "Kent", "Tabitha", "Angela", "Casey", "Julius", "Florence" ], "edges": [ [ 0, 3 ], [ 1, 7 ], [ 2, 9 ], [ 3, 1 ], [ 4, 6 ], [ 5, 2 ], [ 6, 8 ], [ 7, 5 ], [ 9, 4 ], [ 10, 13 ], [ 11, 17 ], [ 12, 19 ], [ 13, 11 ], [ 14, 16 ], [ 15, 12 ], [ 16, 18 ], [ 17, 15 ], [ 19, 14 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Delia knows Dylan. Megan knows Denise. Sharon knows Nadine. Nadine knows Myrtle. Denise knows Herbert. Sharon knows Edward. Edward knows Cesar. Matt knows Alyssa. Denise knows Matt. Edward knows Carter. Dylan knows Hope. Flora knows Darius. Megan knows Delia. Myrtle knows Zack. Alyssa knows Hayley. Cesar knows Flora. Lois knows Megan. Parker knows Sharon. Which of Denise and Edward can Parker reach?", "answer": "Edward", "steps": [ "Parker knows Sharon.", "Sharon knows Edward." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Parker", "Sharon", "Carter", "Edward", "Darius", "Cesar", "Nadine", "Flora", "Zack", "Myrtle", "Lois", "Megan", "Herbert", "Denise", "Hayley", "Matt", "Delia", "Alyssa", "Hope", "Dylan" ], "edges": [ [ 0, 1 ], [ 1, 3 ], [ 1, 6 ], [ 3, 2 ], [ 3, 5 ], [ 5, 7 ], [ 6, 9 ], [ 7, 4 ], [ 9, 8 ], [ 10, 11 ], [ 11, 13 ], [ 11, 16 ], [ 13, 12 ], [ 13, 15 ], [ 15, 17 ], [ 16, 19 ], [ 17, 14 ], [ 19, 18 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Dick knows Kirsten. Wendell knows Darren. Darren knows Isiah. Dolores knows Teresa. Dolores knows Bernadette. Alyson knows Nicholas. Clark knows Malcolm. Nicholas knows Ignacio. Christopher knows Clark. Teresa knows Carrie. Malcolm knows Lars. Clark knows Perry. Kirsten knows Wendell. Ignacio knows Dick. Wendell knows Nash. Lamar knows Dolores. Lars knows Lamar. Nicholas knows Layla. Which of Isiah and Carrie can Christopher reach?", "answer": "Carrie", "steps": [ "Christopher knows Clark.", "Clark knows Malcolm.", "Malcolm knows Lars.", "Lars knows Lamar.", "Lamar knows Dolores.", "Dolores knows Teresa.", "Teresa knows Carrie." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Christopher", "Malcolm", "Lamar", "Dolores", "Bernadette", "Teresa", "Clark", "Perry", "Lars", "Carrie", "Alyson", "Ignacio", "Kirsten", "Wendell", "Nash", "Darren", "Nicholas", "Layla", "Dick", "Isiah" ], "edges": [ [ 0, 6 ], [ 1, 8 ], [ 2, 3 ], [ 3, 4 ], [ 3, 5 ], [ 5, 9 ], [ 6, 7 ], [ 6, 1 ], [ 8, 2 ], [ 10, 16 ], [ 11, 18 ], [ 12, 13 ], [ 13, 14 ], [ 13, 15 ], [ 15, 19 ], [ 16, 17 ], [ 16, 11 ], [ 18, 12 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Freya knows Jarvis. Coral knows Anton. Cynthia knows Tanya. Shaun knows Freya. Tanya knows Nelson. Conner knows Brooks. Livia knows Jasmine. Lydia knows Curtis. Nelson knows Kara. Livia knows Rocco. Shaun knows Dahlia. Fabian knows Roger. Jasmine knows Lydia. Shaun knows Cynthia. Coral knows Livia. Cynthia knows Conner. Rocco knows Lorenzo. Coral knows Fabian. Which of Jasmine and Tanya can Shaun reach?", "answer": "Tanya", "steps": [ "Shaun knows Cynthia.", "Cynthia knows Tanya." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Shaun", "Jarvis", "Conner", "Brooks", "Cynthia", "Freya", "Dahlia", "Kara", "Nelson", "Tanya", "Coral", "Roger", "Rocco", "Lorenzo", "Livia", "Fabian", "Anton", "Curtis", "Lydia", "Jasmine" ], "edges": [ [ 0, 5 ], [ 0, 6 ], [ 0, 4 ], [ 2, 3 ], [ 4, 2 ], [ 4, 9 ], [ 5, 1 ], [ 8, 7 ], [ 9, 8 ], [ 10, 15 ], [ 10, 16 ], [ 10, 14 ], [ 12, 13 ], [ 14, 12 ], [ 14, 19 ], [ 15, 11 ], [ 18, 17 ], [ 19, 18 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Delia knows Dylan. Megan knows Denise. Sharon knows Nadine. Nadine knows Myrtle. Denise knows Herbert. Sharon knows Edward. Edward knows Cesar. Matt knows Alyssa. Denise knows Matt. Edward knows Carter. Dylan knows Hope. Flora knows Darius. Megan knows Delia. Myrtle knows Zack. Alyssa knows Hayley. Cesar knows Flora. Lois knows Megan. Parker knows Sharon. Which of Alyssa and Flora can Parker reach?", "answer": "Flora", "steps": [ "Parker knows Sharon.", "Sharon knows Edward.", "Edward knows Cesar.", "Cesar knows Flora." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Parker", "Sharon", "Carter", "Edward", "Darius", "Cesar", "Nadine", "Flora", "Zack", "Myrtle", "Lois", "Megan", "Herbert", "Denise", "Hayley", "Matt", "Delia", "Alyssa", "Hope", "Dylan" ], "edges": [ [ 0, 1 ], [ 1, 3 ], [ 1, 6 ], [ 3, 2 ], [ 3, 5 ], [ 5, 7 ], [ 6, 9 ], [ 7, 4 ], [ 9, 8 ], [ 10, 11 ], [ 11, 13 ], [ 11, 16 ], [ 13, 12 ], [ 13, 15 ], [ 15, 17 ], [ 16, 19 ], [ 17, 14 ], [ 19, 18 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Freya knows Arnold. Dorothy knows Jeanne. Lillian knows Max. Arnold knows Anthony. Max knows Val. Aaron knows Megan. Megan knows Rose. Renee knows Valerie. Trudy knows Renee. Eric knows Norman. Angela knows Allan. Norman knows Marion. Val knows Otto. Anthony knows Dorothy. Arnold knows Angela. Dorothy knows Eric. Max knows Aaron. Megan knows Trudy. Which of Norman and Renee can Freya reach?", "answer": "Norman", "steps": [ "Freya knows Arnold.", "Arnold knows Anthony.", "Anthony knows Dorothy.", "Dorothy knows Eric.", "Eric knows Norman." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Freya", "Arnold", "Eric", "Allan", "Angela", "Jeanne", "Dorothy", "Anthony", "Norman", "Marion", "Lillian", "Max", "Trudy", "Otto", "Val", "Rose", "Megan", "Aaron", "Renee", "Valerie" ], "edges": [ [ 0, 1 ], [ 1, 4 ], [ 1, 7 ], [ 2, 8 ], [ 4, 3 ], [ 6, 5 ], [ 6, 2 ], [ 7, 6 ], [ 8, 9 ], [ 10, 11 ], [ 11, 14 ], [ 11, 17 ], [ 12, 18 ], [ 14, 13 ], [ 16, 15 ], [ 16, 12 ], [ 17, 16 ], [ 18, 19 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Curtis knows Kenneth. Benjamin knows Larry. Jared knows Chance. Richard knows Marcia. Juan knows Benjamin. Hayley knows Kent. Jacob knows Curtis. Chance knows Abigail. Kenneth knows Shawn. Juan knows Horace. Shawn knows Richard. Kenneth knows Zoe. Catherine knows Joan. Juan knows Hayley. Curtis knows Marian. Curtis knows Catherine. Hayley knows Jared. Julie knows Juan. Which of Chance and Richard can Jacob reach?", "answer": "Richard", "steps": [ "Jacob knows Curtis.", "Curtis knows Kenneth.", "Kenneth knows Shawn.", "Shawn knows Richard." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Jacob", "Marian", "Shawn", "Richard", "Curtis", "Marcia", "Kenneth", "Catherine", "Zoe", "Joan", "Julie", "Horace", "Jared", "Chance", "Juan", "Abigail", "Hayley", "Benjamin", "Kent", "Larry" ], "edges": [ [ 0, 4 ], [ 2, 3 ], [ 3, 5 ], [ 4, 1 ], [ 4, 6 ], [ 4, 7 ], [ 6, 2 ], [ 6, 8 ], [ 7, 9 ], [ 10, 14 ], [ 12, 13 ], [ 13, 15 ], [ 14, 11 ], [ 14, 16 ], [ 14, 17 ], [ 16, 12 ], [ 16, 18 ], [ 17, 19 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Neil knows Jessie. Jessie knows Val. Carol knows Eileen. Neil knows Jack. Yuki knows Owen. Ron knows Carmela. Jack knows Carol. Carmela knows Katrina. Arlene knows Ricardo. Colin knows Ron. Beth knows Jem. Ron knows Arlene. Jack knows Beth. Carmela knows Samantha. Carmela knows Yuki. Jack knows Cora. Darwin knows Neil. Katrina knows Bernard. Which of Neil and Ron can Darwin reach?", "answer": "Neil", "steps": [ "Darwin knows Neil." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Darwin", "Val", "Jack", "Neil", "Jem", "Carol", "Beth", "Eileen", "Cora", "Jessie", "Colin", "Ricardo", "Carmela", "Ron", "Bernard", "Yuki", "Katrina", "Owen", "Samantha", "Arlene" ], "edges": [ [ 0, 3 ], [ 2, 6 ], [ 2, 5 ], [ 2, 8 ], [ 3, 2 ], [ 3, 9 ], [ 5, 7 ], [ 6, 4 ], [ 9, 1 ], [ 10, 13 ], [ 12, 16 ], [ 12, 15 ], [ 12, 18 ], [ 13, 12 ], [ 13, 19 ], [ 15, 17 ], [ 16, 14 ], [ 19, 11 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Chase knows Eve. Gloria knows Fern. Elodie knows Loretta. Clifford knows Holden. Elodie knows Clifford. Jasper knows Eduardo. Lynn knows Alice. Holden knows Owen. Eduardo knows Rufus. Eve knows Elodie. Rufus knows Gloria. Dave knows Lynn. Chase knows Jacques. Rufus knows Vance. Kurt knows Chase. Lynn knows Jasper. Eduardo knows Heath. Clifford knows Kareem. Which of Clifford and Rufus can Kurt reach?", "answer": "Clifford", "steps": [ "Kurt knows Chase.", "Chase knows Eve.", "Eve knows Elodie.", "Elodie knows Clifford." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Kurt", "Chase", "Clifford", "Jacques", "Elodie", "Owen", "Holden", "Kareem", "Eve", "Loretta", "Dave", "Lynn", "Rufus", "Alice", "Eduardo", "Fern", "Gloria", "Vance", "Jasper", "Heath" ], "edges": [ [ 0, 1 ], [ 1, 3 ], [ 1, 8 ], [ 2, 6 ], [ 2, 7 ], [ 4, 2 ], [ 4, 9 ], [ 6, 5 ], [ 8, 4 ], [ 10, 11 ], [ 11, 13 ], [ 11, 18 ], [ 12, 16 ], [ 12, 17 ], [ 14, 12 ], [ 14, 19 ], [ 16, 15 ], [ 18, 14 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Sylvia knows June. Gerard knows Luke. Carl knows Eve. Drew knows Brody. Luke knows Rufus. Sarah knows Sylvia. Brody knows Tonya. Miles knows Drew. Lark knows Carl. Sylvia knows Bert. Drew knows Austin. Rocco knows Colby. Sarah knows Lark. Brody knows Garrison. Drew knows Joy. Miles knows Gerard. Sylvia knows Rocco. Rocco knows Fern. Which of Gerard and Lark can Sarah reach?", "answer": "Lark", "steps": [ "Sarah knows Lark." ], "difficulty": 1, "original_distance": 3, "idx_to_symbol": [ "Sarah", "Lark", "Fern", "Rocco", "Eve", "Sylvia", "Bert", "Colby", "June", "Carl", "Miles", "Gerard", "Garrison", "Brody", "Rufus", "Drew", "Austin", "Tonya", "Joy", "Luke" ], "edges": [ [ 0, 5 ], [ 0, 1 ], [ 1, 9 ], [ 3, 2 ], [ 3, 7 ], [ 5, 6 ], [ 5, 3 ], [ 5, 8 ], [ 9, 4 ], [ 10, 15 ], [ 10, 11 ], [ 11, 19 ], [ 13, 12 ], [ 13, 17 ], [ 15, 16 ], [ 15, 13 ], [ 15, 18 ], [ 19, 14 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Etta knows Todd. Dean knows Jillian. Denise knows Harrison. Fern knows Lance. Fern knows Arturo. Lance knows Gustavo. Gustavo knows Trina. Jack knows Denise. Denise knows Kate. Fern knows Glenda. Etta knows Fern. Dean knows Cooper. Harrison knows Dean. Kate knows Darcy. Glenda knows Trevor. Gustavo knows Tina. Denise knows Keegan. Jack knows Gerald. Which of Gustavo and Dean can Jack reach?", "answer": "Dean", "steps": [ "Jack knows Denise.", "Denise knows Harrison.", "Harrison knows Dean." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Jack", "Darcy", "Keegan", "Denise", "Harrison", "Dean", "Jillian", "Cooper", "Gerald", "Kate", "Etta", "Trevor", "Arturo", "Fern", "Lance", "Gustavo", "Trina", "Tina", "Todd", "Glenda" ], "edges": [ [ 0, 8 ], [ 0, 3 ], [ 3, 2 ], [ 3, 4 ], [ 3, 9 ], [ 4, 5 ], [ 5, 6 ], [ 5, 7 ], [ 9, 1 ], [ 10, 18 ], [ 10, 13 ], [ 13, 12 ], [ 13, 14 ], [ 13, 19 ], [ 14, 15 ], [ 15, 16 ], [ 15, 17 ], [ 19, 11 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Federico knows Heath. Dennis knows Frida. Federico knows Gordon. Alan knows Earl. Cynthia knows Gene. Frida knows Joaquin. Hilda knows Kai. Joaquin knows Tyler. Elise knows Cooper. Kai knows Gina. Cooper knows Cynthia. Kai knows Dennis. Heath knows Elise. Gordon knows Wilson. Wilson knows Fergus. Gina knows Alan. Max knows Federico. Tyler knows Cain. Which of Cynthia and Tyler can Hilda reach?", "answer": "Tyler", "steps": [ "Hilda knows Kai.", "Kai knows Dennis.", "Dennis knows Frida.", "Frida knows Joaquin.", "Joaquin knows Tyler." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Hilda", "Alan", "Dennis", "Cain", "Frida", "Kai", "Tyler", "Joaquin", "Gina", "Earl", "Max", "Wilson", "Heath", "Gene", "Elise", "Federico", "Cynthia", "Cooper", "Gordon", "Fergus" ], "edges": [ [ 0, 5 ], [ 1, 9 ], [ 2, 4 ], [ 4, 7 ], [ 5, 2 ], [ 5, 8 ], [ 6, 3 ], [ 7, 6 ], [ 8, 1 ], [ 10, 15 ], [ 11, 19 ], [ 12, 14 ], [ 14, 17 ], [ 15, 12 ], [ 15, 18 ], [ 16, 13 ], [ 17, 16 ], [ 18, 11 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Jade knows Oscar. Abby knows Clifford. Jade knows Isaac. Jenny knows Monica. Jenny knows Dewey. Homer knows Ernesto. Conner knows Abby. Dewey knows Homer. Abby knows Valerie. Sue knows Conner. Isaac knows Jenny. Clifford knows Kimberly. Essie knows Jonathan. Dewey knows Donald. Clifford knows Essie. Monica knows Rex. Sue knows Yara. Valerie knows Maureen. Which of Abby and Jenny can Jade reach?", "answer": "Jenny", "steps": [ "Jade knows Isaac.", "Isaac knows Jenny." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Jade", "Jenny", "Donald", "Isaac", "Homer", "Monica", "Dewey", "Oscar", "Rex", "Ernesto", "Sue", "Abby", "Kimberly", "Conner", "Essie", "Valerie", "Clifford", "Yara", "Maureen", "Jonathan" ], "edges": [ [ 0, 7 ], [ 0, 3 ], [ 1, 5 ], [ 1, 6 ], [ 3, 1 ], [ 4, 9 ], [ 5, 8 ], [ 6, 2 ], [ 6, 4 ], [ 10, 17 ], [ 10, 13 ], [ 11, 15 ], [ 11, 16 ], [ 13, 11 ], [ 14, 19 ], [ 15, 18 ], [ 16, 12 ], [ 16, 14 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Neal knows Dante. Vera knows Harmony. Betty knows Israel. Colby knows Alvin. Betty knows Dolly. Alex knows Imogen. Joy knows Colby. Vera knows Gene. Thomas knows Jewel. Colby knows Carlos. Natalie knows Joy. Molly knows Alex. Dolly knows Neal. Jewel knows Vera. Molly knows Bob. Gene knows Betty. Carlos knows Molly. Imogen knows Grant. Which of Alex and Dolly can Thomas reach?", "answer": "Dolly", "steps": [ "Thomas knows Jewel.", "Jewel knows Vera.", "Vera knows Gene.", "Gene knows Betty.", "Betty knows Dolly." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Thomas", "Israel", "Dolly", "Vera", "Dante", "Jewel", "Neal", "Betty", "Harmony", "Gene", "Natalie", "Bob", "Alex", "Colby", "Grant", "Joy", "Imogen", "Molly", "Alvin", "Carlos" ], "edges": [ [ 0, 5 ], [ 2, 6 ], [ 3, 8 ], [ 3, 9 ], [ 5, 3 ], [ 6, 4 ], [ 7, 1 ], [ 7, 2 ], [ 9, 7 ], [ 10, 15 ], [ 12, 16 ], [ 13, 18 ], [ 13, 19 ], [ 15, 13 ], [ 16, 14 ], [ 17, 11 ], [ 17, 12 ], [ 19, 17 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Carrie knows Knox. John knows Bailey. Kane knows Sarah. Gerard knows Vera. Heath knows John. Marion knows Noel. Kane knows Carrie. Bailey knows Kane. John knows Aiden. Bailey knows Blanche. Gerard knows Ira. Ira knows Mary. Noel knows Esme. Esme knows Gerard. Noel knows Lark. Aiden knows Taylor. Lark knows Elise. Esme knows Heather. Which of Esme and Bailey can Heath reach?", "answer": "Bailey", "steps": [ "Heath knows John.", "John knows Bailey." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Heath", "Blanche", "Carrie", "John", "Aiden", "Knox", "Bailey", "Sarah", "Kane", "Taylor", "Marion", "Heather", "Ira", "Noel", "Lark", "Mary", "Esme", "Vera", "Gerard", "Elise" ], "edges": [ [ 0, 3 ], [ 2, 5 ], [ 3, 6 ], [ 3, 4 ], [ 4, 9 ], [ 6, 1 ], [ 6, 8 ], [ 8, 2 ], [ 8, 7 ], [ 10, 13 ], [ 12, 15 ], [ 13, 16 ], [ 13, 14 ], [ 14, 19 ], [ 16, 11 ], [ 16, 18 ], [ 18, 12 ], [ 18, 17 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Tonya knows Della. Hope knows Winston. Taylor knows Tim. Cora knows Ida. Byron knows Evan. Tonya knows Taylor. Paige knows Shannon. Lewis knows Paige. Tim knows Josie. Daisy knows Marvin. Lucy knows Virgil. Cora knows Dudley. Evan knows Janice. Daisy knows Lewis. Daisy knows Hope. Ida knows Lucy. Hope knows Byron. Cora knows Tonya. Which of Byron and Taylor can Cora reach?", "answer": "Taylor", "steps": [ "Cora knows Tonya.", "Tonya knows Taylor." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Cora", "Josie", "Taylor", "Tim", "Lucy", "Virgil", "Della", "Ida", "Tonya", "Dudley", "Daisy", "Janice", "Byron", "Evan", "Paige", "Shannon", "Winston", "Lewis", "Hope", "Marvin" ], "edges": [ [ 0, 7 ], [ 0, 8 ], [ 0, 9 ], [ 2, 3 ], [ 3, 1 ], [ 4, 5 ], [ 7, 4 ], [ 8, 2 ], [ 8, 6 ], [ 10, 17 ], [ 10, 18 ], [ 10, 19 ], [ 12, 13 ], [ 13, 11 ], [ 14, 15 ], [ 17, 14 ], [ 18, 12 ], [ 18, 16 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Teresa knows Justine. Gavin knows Patrick. Eunice knows Demetrius. Aisha knows Becky. Justine knows Joaquin. Dylan knows Darla. Gavin knows Teresa. Demetrius knows Tristan. Aisha knows Dylan. Joaquin knows Franklin. Eunice knows Aisha. Teresa knows Belinda. Belinda knows Clayton. Patrick knows Colette. Becky knows Aspen. Teresa knows Percy. Darla knows Otto. Aisha knows Alana. Which of Justine and Dylan can Eunice reach?", "answer": "Dylan", "steps": [ "Eunice knows Aisha.", "Aisha knows Dylan." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Eunice", "Dylan", "Darla", "Otto", "Aisha", "Tristan", "Aspen", "Becky", "Alana", "Demetrius", "Gavin", "Justine", "Joaquin", "Franklin", "Teresa", "Colette", "Clayton", "Belinda", "Percy", "Patrick" ], "edges": [ [ 0, 4 ], [ 0, 9 ], [ 1, 2 ], [ 2, 3 ], [ 4, 1 ], [ 4, 7 ], [ 4, 8 ], [ 7, 6 ], [ 9, 5 ], [ 10, 14 ], [ 10, 19 ], [ 11, 12 ], [ 12, 13 ], [ 14, 11 ], [ 14, 17 ], [ 14, 18 ], [ 17, 16 ], [ 19, 15 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Clark knows Diego. Gunnar knows Joanna. Jeremy knows Raquel. Kara knows Rufus. Clark knows Aria. Kara knows Ricardo. Rufus knows Dakota. Joanna knows Jermaine. Aria knows Cliff. Ricardo knows Deirdre. Diego knows Jamie. Gunnar knows Jerome. Rufus knows Brian. Jeremy knows Brad. Raquel knows Clark. Brad knows Fred. Jerome knows Kara. Aria knows Howard. Which of Jerome and Raquel can Gunnar reach?", "answer": "Jerome", "steps": [ "Gunnar knows Jerome." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Gunnar", "Rufus", "Ricardo", "Jermaine", "Joanna", "Deirdre", "Dakota", "Jerome", "Brian", "Kara", "Jeremy", "Aria", "Diego", "Fred", "Brad", "Jamie", "Howard", "Raquel", "Cliff", "Clark" ], "edges": [ [ 0, 4 ], [ 0, 7 ], [ 1, 6 ], [ 1, 8 ], [ 2, 5 ], [ 4, 3 ], [ 7, 9 ], [ 9, 2 ], [ 9, 1 ], [ 10, 14 ], [ 10, 17 ], [ 11, 16 ], [ 11, 18 ], [ 12, 15 ], [ 14, 13 ], [ 17, 19 ], [ 19, 12 ], [ 19, 11 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Nathan knows Louisa. Helene knows Anthony. Carl knows Priscilla. Foster knows Darnell. Priscilla knows Humphrey. Foster knows Merle. Jermaine knows Foster. Carl knows Malcolm. Zach knows Ruby. Merle knows Zach. Ruby knows Glenn. Humphrey knows Kane. Jermaine knows Ida. Priscilla knows Wendy. Kane knows Helene. Priscilla knows Fergus. Wendy knows Cliff. Foster knows Nathan. Which of Foster and Priscilla can Jermaine reach?", "answer": "Foster", "steps": [ "Jermaine knows Foster." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Jermaine", "Ruby", "Foster", "Glenn", "Nathan", "Merle", "Darnell", "Ida", "Zach", "Louisa", "Carl", "Helene", "Priscilla", "Anthony", "Wendy", "Humphrey", "Fergus", "Malcolm", "Kane", "Cliff" ], "edges": [ [ 0, 7 ], [ 0, 2 ], [ 1, 3 ], [ 2, 6 ], [ 2, 5 ], [ 2, 4 ], [ 4, 9 ], [ 5, 8 ], [ 8, 1 ], [ 10, 17 ], [ 10, 12 ], [ 11, 13 ], [ 12, 16 ], [ 12, 15 ], [ 12, 14 ], [ 14, 19 ], [ 15, 18 ], [ 18, 11 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Dennis knows Colin. Dennis knows Kareem. Ruby knows Janice. Ruby knows Duke. Hank knows Edmund. Hank knows Arthur. Dennis knows Amber. Marlene knows Camille. Marlene knows Kevin. Hailey knows Hank. Duke knows Eden. Ruby knows Hector. Clark knows Hailey. Arthur knows Emery. Amber knows Bryan. Bryan knows Ruby. Hank knows Aiden. Marlene knows Clark. Which of Ruby and Hank can Marlene reach?", "answer": "Hank", "steps": [ "Marlene knows Clark.", "Clark knows Hailey.", "Hailey knows Hank." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Marlene", "Emery", "Camille", "Clark", "Aiden", "Arthur", "Hank", "Edmund", "Kevin", "Hailey", "Dennis", "Eden", "Colin", "Amber", "Janice", "Duke", "Ruby", "Hector", "Kareem", "Bryan" ], "edges": [ [ 0, 2 ], [ 0, 8 ], [ 0, 3 ], [ 3, 9 ], [ 5, 1 ], [ 6, 4 ], [ 6, 5 ], [ 6, 7 ], [ 9, 6 ], [ 10, 12 ], [ 10, 18 ], [ 10, 13 ], [ 13, 19 ], [ 15, 11 ], [ 16, 14 ], [ 16, 15 ], [ 16, 17 ], [ 19, 16 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Coral knows Olive. Eldon knows Amy. Clayton knows Kamila. Estelle knows Bernadette. Bernadette knows Jorge. Adele knows Fabian. Guillermo knows Eldon. Dora knows Becky. Burt knows Dora. Becky knows Adele. Archer knows Clayton. Clayton knows Coral. Nancy knows Annie. Kamila knows Nancy. Ariana knows Burt. Fabian knows Paul. Jorge knows Archer. Adele knows Guillermo. Which of Archer and Becky can Estelle reach?", "answer": "Archer", "steps": [ "Estelle knows Bernadette.", "Bernadette knows Jorge.", "Jorge knows Archer." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Estelle", "Kamila", "Bernadette", "Olive", "Annie", "Nancy", "Jorge", "Coral", "Clayton", "Archer", "Ariana", "Guillermo", "Burt", "Paul", "Amy", "Eldon", "Dora", "Fabian", "Adele", "Becky" ], "edges": [ [ 0, 2 ], [ 1, 5 ], [ 2, 6 ], [ 5, 4 ], [ 6, 9 ], [ 7, 3 ], [ 8, 1 ], [ 8, 7 ], [ 9, 8 ], [ 10, 12 ], [ 11, 15 ], [ 12, 16 ], [ 15, 14 ], [ 16, 19 ], [ 17, 13 ], [ 18, 11 ], [ 18, 17 ], [ 19, 18 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Dane knows Calvin. Cora knows Gus. Dane knows Erica. Wyatt knows Stanley. Duncan knows Lynn. Erica knows Keegan. Lynn knows Quinn. Cora knows Dane. Keegan knows Georgia. Stanley knows Dale. Stanley knows Garrison. Stanley knows Hugo. Keegan knows Nicholas. Duncan knows Duke. Keegan knows Lilia. Lynn knows Wyatt. Garrison knows Rhonda. Georgia knows Dakota. Which of Stanley and Keegan can Duncan reach?", "answer": "Stanley", "steps": [ "Duncan knows Lynn.", "Lynn knows Wyatt.", "Wyatt knows Stanley." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Duncan", "Stanley", "Lynn", "Rhonda", "Dale", "Hugo", "Duke", "Wyatt", "Quinn", "Garrison", "Cora", "Keegan", "Dane", "Dakota", "Nicholas", "Lilia", "Gus", "Erica", "Calvin", "Georgia" ], "edges": [ [ 0, 6 ], [ 0, 2 ], [ 1, 4 ], [ 1, 5 ], [ 1, 9 ], [ 2, 8 ], [ 2, 7 ], [ 7, 1 ], [ 9, 3 ], [ 10, 16 ], [ 10, 12 ], [ 11, 14 ], [ 11, 15 ], [ 11, 19 ], [ 12, 18 ], [ 12, 17 ], [ 17, 11 ], [ 19, 13 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Elena knows Jessica. Rosa knows Jeanne. Lawrence knows Celia. Maude knows Elena. Angela knows Maude. Faye knows Florence. Ebony knows Faye. Celia knows Brooke. Angela knows Rosa. Travis knows Robin. Brooke knows Aaron. Florence knows Chad. Jenny knows August. Jeanne knows Travis. Kevin knows Angela. Leroy knows Kevin. August knows Lawrence. Lawrence knows Ebony. Which of Ebony and Rosa can Jenny reach?", "answer": "Ebony", "steps": [ "Jenny knows August.", "August knows Lawrence.", "Lawrence knows Ebony." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Jenny", "Florence", "Lawrence", "Brooke", "Faye", "Ebony", "Chad", "Celia", "Aaron", "August", "Leroy", "Travis", "Angela", "Elena", "Jeanne", "Rosa", "Robin", "Maude", "Jessica", "Kevin" ], "edges": [ [ 0, 9 ], [ 1, 6 ], [ 2, 5 ], [ 2, 7 ], [ 3, 8 ], [ 4, 1 ], [ 5, 4 ], [ 7, 3 ], [ 9, 2 ], [ 10, 19 ], [ 11, 16 ], [ 12, 15 ], [ 12, 17 ], [ 13, 18 ], [ 14, 11 ], [ 15, 14 ], [ 17, 13 ], [ 19, 12 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Norma knows Virgil. Nash knows Brandon. Iris knows Clayton. Maggie knows Pablo. Sandy knows Maggie. Jameson knows Flora. Leah knows Julio. Ezra knows Jameson. Iris knows Ezra. Clayton knows Karl. Justine knows Norma. Nash knows Leah. Justine knows Grace. Maggie knows Nash. Norma knows Iris. Julio knows Jessica. Sandy knows Colin. Brandon knows Reed. Which of Julio and Jameson can Justine reach?", "answer": "Jameson", "steps": [ "Justine knows Norma.", "Norma knows Iris.", "Iris knows Ezra.", "Ezra knows Jameson." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Justine", "Norma", "Ezra", "Karl", "Clayton", "Grace", "Jameson", "Flora", "Iris", "Virgil", "Sandy", "Maggie", "Leah", "Reed", "Brandon", "Colin", "Julio", "Jessica", "Nash", "Pablo" ], "edges": [ [ 0, 5 ], [ 0, 1 ], [ 1, 8 ], [ 1, 9 ], [ 2, 6 ], [ 4, 3 ], [ 6, 7 ], [ 8, 4 ], [ 8, 2 ], [ 10, 15 ], [ 10, 11 ], [ 11, 18 ], [ 11, 19 ], [ 12, 16 ], [ 14, 13 ], [ 16, 17 ], [ 18, 14 ], [ 18, 12 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Jodi knows Daniella. Archer knows Trina. Gustavo knows Emma. Archie knows Isadora. Gustavo knows Khashayar. Gustavo knows Archer. Trina knows Harmony. Trina knows Vance. Emma knows Clement. Harmony knows Charles. Isadora knows Haley. Jennifer knows Gavin. Jennifer knows Herman. Isadora knows Arden. Haley knows Skyler. Jennifer knows Archie. Jennifer knows Jodi. Gustavo knows Scott. Which of Skyler and Charles can Gustavo reach?", "answer": "Charles", "steps": [ "Gustavo knows Archer.", "Archer knows Trina.", "Trina knows Harmony.", "Harmony knows Charles." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Gustavo", "Emma", "Khashayar", "Clement", "Trina", "Charles", "Scott", "Archer", "Harmony", "Vance", "Jennifer", "Jodi", "Gavin", "Daniella", "Isadora", "Skyler", "Herman", "Archie", "Haley", "Arden" ], "edges": [ [ 0, 2 ], [ 0, 1 ], [ 0, 6 ], [ 0, 7 ], [ 1, 3 ], [ 4, 8 ], [ 4, 9 ], [ 7, 4 ], [ 8, 5 ], [ 10, 12 ], [ 10, 11 ], [ 10, 16 ], [ 10, 17 ], [ 11, 13 ], [ 14, 18 ], [ 14, 19 ], [ 17, 14 ], [ 18, 15 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Cassidy knows Benjamin. Frank knows Cindy. Yasmin knows Pearl. Boyd knows Colby. Cordelia knows Jewel. Pearl knows Jake. Boyd knows Lola. Lola knows Glen. Roy knows Darla. Davis knows Frank. Gerald knows Cordelia. Benjamin knows Boyd. Darla knows Gerald. Benjamin knows Davis. Gerald knows Yasmin. Jewel knows Fred. Cordelia knows Kai. Desmond knows Cassidy. Which of Glen and Fred can Desmond reach?", "answer": "Glen", "steps": [ "Desmond knows Cassidy.", "Cassidy knows Benjamin.", "Benjamin knows Boyd.", "Boyd knows Lola.", "Lola knows Glen." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Desmond", "Lola", "Colby", "Benjamin", "Glen", "Frank", "Cassidy", "Davis", "Cindy", "Boyd", "Roy", "Jewel", "Kai", "Gerald", "Fred", "Pearl", "Darla", "Yasmin", "Jake", "Cordelia" ], "edges": [ [ 0, 6 ], [ 1, 4 ], [ 3, 7 ], [ 3, 9 ], [ 5, 8 ], [ 6, 3 ], [ 7, 5 ], [ 9, 2 ], [ 9, 1 ], [ 10, 16 ], [ 11, 14 ], [ 13, 17 ], [ 13, 19 ], [ 15, 18 ], [ 16, 13 ], [ 17, 15 ], [ 19, 12 ], [ 19, 11 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Cassidy knows Benjamin. Frank knows Cindy. Yasmin knows Pearl. Boyd knows Colby. Cordelia knows Jewel. Pearl knows Jake. Boyd knows Lola. Lola knows Glen. Roy knows Darla. Davis knows Frank. Gerald knows Cordelia. Benjamin knows Boyd. Darla knows Gerald. Benjamin knows Davis. Gerald knows Yasmin. Jewel knows Fred. Cordelia knows Kai. Desmond knows Cassidy. Which of Jewel and Lola can Desmond reach?", "answer": "Lola", "steps": [ "Desmond knows Cassidy.", "Cassidy knows Benjamin.", "Benjamin knows Boyd.", "Boyd knows Lola." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Desmond", "Lola", "Colby", "Benjamin", "Glen", "Frank", "Cassidy", "Davis", "Cindy", "Boyd", "Roy", "Jewel", "Kai", "Gerald", "Fred", "Pearl", "Darla", "Yasmin", "Jake", "Cordelia" ], "edges": [ [ 0, 6 ], [ 1, 4 ], [ 3, 7 ], [ 3, 9 ], [ 5, 8 ], [ 6, 3 ], [ 7, 5 ], [ 9, 2 ], [ 9, 1 ], [ 10, 16 ], [ 11, 14 ], [ 13, 17 ], [ 13, 19 ], [ 15, 18 ], [ 16, 13 ], [ 17, 15 ], [ 19, 12 ], [ 19, 11 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Jarvis knows Clay. Will knows Kendrick. Philip knows Dirk. June knows Brooks. Marshall knows Loretta. Tony knows Lyle. Milton knows Jarvis. Kendrick knows Marshall. Marco knows Will. Israel knows Marco. Kendrick knows Gene. Milton knows Seth. Will knows Lola. Laverne knows Jorge. June knows Milton. Clay knows Laverne. Dirk knows June. Loretta knows Tony. Which of Will and June can Israel reach?", "answer": "Will", "steps": [ "Israel knows Marco.", "Marco knows Will." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Israel", "Lyle", "Will", "Gene", "Tony", "Kendrick", "Marshall", "Marco", "Lola", "Loretta", "Philip", "Jorge", "June", "Seth", "Laverne", "Milton", "Jarvis", "Dirk", "Brooks", "Clay" ], "edges": [ [ 0, 7 ], [ 2, 8 ], [ 2, 5 ], [ 4, 1 ], [ 5, 3 ], [ 5, 6 ], [ 6, 9 ], [ 7, 2 ], [ 9, 4 ], [ 10, 17 ], [ 12, 18 ], [ 12, 15 ], [ 14, 11 ], [ 15, 13 ], [ 15, 16 ], [ 16, 19 ], [ 17, 12 ], [ 19, 14 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Vivian knows June. Gareth knows Burt. Glen knows Aisha. Gilbert knows Glen. Karl knows Henry. Layla knows Alice. June knows Caleb. Blair knows Cate. Blair knows Mitchell. Jackson knows Karl. Mitchell knows Vivian. Cate knows Layla. Aisha knows Gareth. Jack knows Rowan. Burt knows Hudson. Rowan knows Blair. Glen knows Jackson. Jolena knows Gilbert. Which of June and Burt can Jack reach?", "answer": "June", "steps": [ "Jack knows Rowan.", "Rowan knows Blair.", "Blair knows Mitchell.", "Mitchell knows Vivian.", "Vivian knows June." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Jack", "Vivian", "Layla", "Rowan", "Blair", "Cate", "Caleb", "June", "Alice", "Mitchell", "Jolena", "Gareth", "Karl", "Gilbert", "Glen", "Jackson", "Hudson", "Burt", "Henry", "Aisha" ], "edges": [ [ 0, 3 ], [ 1, 7 ], [ 2, 8 ], [ 3, 4 ], [ 4, 5 ], [ 4, 9 ], [ 5, 2 ], [ 7, 6 ], [ 9, 1 ], [ 10, 13 ], [ 11, 17 ], [ 12, 18 ], [ 13, 14 ], [ 14, 15 ], [ 14, 19 ], [ 15, 12 ], [ 17, 16 ], [ 19, 11 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Lambert knows Hailey. Hattie knows Zach. Hattie knows Jay. Anton knows Perry. Lillian knows Aaron. Aaron knows Hayley. Martha knows Lillian. Anton knows Gordon. Wanda knows Alexa. Laverne knows Lambert. Elizabeth knows Hattie. Jay knows Laverne. Gordon knows Lenora. Laverne knows Bart. Aaron knows Wanda. Jay knows Shaun. Rosa knows Elizabeth. Wanda knows Anton. Which of Anton and Laverne can Rosa reach?", "answer": "Laverne", "steps": [ "Rosa knows Elizabeth.", "Elizabeth knows Hattie.", "Hattie knows Jay.", "Jay knows Laverne." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Rosa", "Jay", "Lambert", "Laverne", "Hattie", "Hailey", "Shaun", "Bart", "Elizabeth", "Zach", "Martha", "Wanda", "Gordon", "Anton", "Aaron", "Lenora", "Alexa", "Perry", "Lillian", "Hayley" ], "edges": [ [ 0, 8 ], [ 1, 6 ], [ 1, 3 ], [ 2, 5 ], [ 3, 2 ], [ 3, 7 ], [ 4, 1 ], [ 4, 9 ], [ 8, 4 ], [ 10, 18 ], [ 11, 16 ], [ 11, 13 ], [ 12, 15 ], [ 13, 12 ], [ 13, 17 ], [ 14, 11 ], [ 14, 19 ], [ 18, 14 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Rosemary knows Maria. William knows Tiffany. Georgia knows Ricardo. Ricardo knows Sadie. Mitchell knows Rosemary. Zack knows William. Sadie knows Colby. Ricardo knows Leigh. Rosemary knows Zack. William knows Miles. Victoria knows Dallas. Duncan knows Victoria. Victoria knows Georgia. Victoria knows Clarissa. Olivia knows Mitchell. Paula knows Duncan. Rosemary knows Garrison. Miles knows Anna. Which of Duncan and Mitchell can Olivia reach?", "answer": "Mitchell", "steps": [ "Olivia knows Mitchell." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Olivia", "Mitchell", "Anna", "Zack", "William", "Rosemary", "Tiffany", "Miles", "Maria", "Garrison", "Paula", "Duncan", "Colby", "Georgia", "Ricardo", "Victoria", "Leigh", "Sadie", "Clarissa", "Dallas" ], "edges": [ [ 0, 1 ], [ 1, 5 ], [ 3, 4 ], [ 4, 6 ], [ 4, 7 ], [ 5, 3 ], [ 5, 8 ], [ 5, 9 ], [ 7, 2 ], [ 10, 11 ], [ 11, 15 ], [ 13, 14 ], [ 14, 16 ], [ 14, 17 ], [ 15, 13 ], [ 15, 18 ], [ 15, 19 ], [ 17, 12 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Veronica knows Dell. Forrest knows Keegan. Barney knows Claudia. Lara knows Chloe. Dell knows Yvette. Chloe knows Paige. Yvette knows Margaret. Keegan knows Barney. Claudia knows Nina. Hope knows Mason. Courtney knows Hope. Claudia knows Courtney. Forrest knows Lamar. Eva knows Jeff. Jeff knows Veronica. Jeff knows Winston. Yvette knows Lara. Dale knows Forrest. Which of Jeff and Forrest can Dale reach?", "answer": "Forrest", "steps": [ "Dale knows Forrest." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Dale", "Courtney", "Lamar", "Claudia", "Mason", "Keegan", "Barney", "Hope", "Nina", "Forrest", "Eva", "Lara", "Winston", "Yvette", "Paige", "Veronica", "Dell", "Chloe", "Margaret", "Jeff" ], "edges": [ [ 0, 9 ], [ 1, 7 ], [ 3, 1 ], [ 3, 8 ], [ 5, 6 ], [ 6, 3 ], [ 7, 4 ], [ 9, 2 ], [ 9, 5 ], [ 10, 19 ], [ 11, 17 ], [ 13, 11 ], [ 13, 18 ], [ 15, 16 ], [ 16, 13 ], [ 17, 14 ], [ 19, 12 ], [ 19, 15 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Josie knows Gideon. Benjamin knows Chris. Fletcher knows Peter. Lloyd knows Hadley. Lark knows Bruno. Gideon knows Reed. Chris knows Archie. Tabitha knows Zara. Benjamin knows Tabitha. Gideon knows Fletcher. Peter knows Cara. Bruno knows Benjamin. Lloyd knows Ariel. Fletcher knows Lloyd. Tabitha knows Chad. Bruno knows Troy. Lloyd knows Rose. Tabitha knows Anita. Which of Lloyd and Tabitha can Lark reach?", "answer": "Tabitha", "steps": [ "Lark knows Bruno.", "Bruno knows Benjamin.", "Benjamin knows Tabitha." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Lark", "Troy", "Archie", "Chad", "Anita", "Zara", "Tabitha", "Benjamin", "Chris", "Bruno", "Josie", "Reed", "Cara", "Hadley", "Rose", "Ariel", "Lloyd", "Fletcher", "Peter", "Gideon" ], "edges": [ [ 0, 9 ], [ 6, 3 ], [ 6, 4 ], [ 6, 5 ], [ 7, 6 ], [ 7, 8 ], [ 8, 2 ], [ 9, 1 ], [ 9, 7 ], [ 10, 19 ], [ 16, 13 ], [ 16, 14 ], [ 16, 15 ], [ 17, 16 ], [ 17, 18 ], [ 18, 12 ], [ 19, 11 ], [ 19, 17 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Josie knows Matt. Darrell knows Clark. Erma knows Kira. Gary knows Dorothy. Jem knows Gary. Harmony knows Josie. Dorothy knows Kristina. Harriet knows Norman. Clark knows Malcolm. Harmony knows Louisa. Matt knows Erma. Norman knows Dorian. Harriet knows Riley. Dorothy knows Vance. Vance knows Darrell. Dorian knows Harmony. Harlan knows Jem. Harlan knows Kelly. Which of Harmony and Dorothy can Harlan reach?", "answer": "Dorothy", "steps": [ "Harlan knows Jem.", "Jem knows Gary.", "Gary knows Dorothy." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Harlan", "Clark", "Kelly", "Gary", "Jem", "Vance", "Dorothy", "Malcolm", "Kristina", "Darrell", "Harriet", "Erma", "Riley", "Dorian", "Norman", "Josie", "Harmony", "Kira", "Louisa", "Matt" ], "edges": [ [ 0, 2 ], [ 0, 4 ], [ 1, 7 ], [ 3, 6 ], [ 4, 3 ], [ 5, 9 ], [ 6, 8 ], [ 6, 5 ], [ 9, 1 ], [ 10, 12 ], [ 10, 14 ], [ 11, 17 ], [ 13, 16 ], [ 14, 13 ], [ 15, 19 ], [ 16, 18 ], [ 16, 15 ], [ 19, 11 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Freya knows Arnold. Dorothy knows Jeanne. Lillian knows Max. Arnold knows Anthony. Max knows Val. Aaron knows Megan. Megan knows Rose. Renee knows Valerie. Trudy knows Renee. Eric knows Norman. Angela knows Allan. Norman knows Marion. Val knows Otto. Anthony knows Dorothy. Arnold knows Angela. Dorothy knows Eric. Max knows Aaron. Megan knows Trudy. Which of Trudy and Eric can Freya reach?", "answer": "Eric", "steps": [ "Freya knows Arnold.", "Arnold knows Anthony.", "Anthony knows Dorothy.", "Dorothy knows Eric." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Freya", "Arnold", "Eric", "Allan", "Angela", "Jeanne", "Dorothy", "Anthony", "Norman", "Marion", "Lillian", "Max", "Trudy", "Otto", "Val", "Rose", "Megan", "Aaron", "Renee", "Valerie" ], "edges": [ [ 0, 1 ], [ 1, 4 ], [ 1, 7 ], [ 2, 8 ], [ 4, 3 ], [ 6, 5 ], [ 6, 2 ], [ 7, 6 ], [ 8, 9 ], [ 10, 11 ], [ 11, 14 ], [ 11, 17 ], [ 12, 18 ], [ 14, 13 ], [ 16, 15 ], [ 16, 12 ], [ 17, 16 ], [ 18, 19 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Ross knows Leah. Wilson knows Alma. Cynthia knows Edgar. Riley knows Cynthia. Helene knows Donovan. Edwin knows Frankie. Donovan knows Donald. Blanche knows Autumn. Alma knows Riley. Edgar knows Keira. Kara knows Blanche. Susanne knows Elmer. Edgar knows Archer. Elmer knows Hope. Hope knows Helene. Leah knows Edwin. Donovan knows Ross. Archer knows Kara. Which of Elmer and Alma can Wilson reach?", "answer": "Alma", "steps": [ "Wilson knows Alma." ], "difficulty": 1, "original_distance": 8, "idx_to_symbol": [ "Wilson", "Riley", "Alma", "Blanche", "Archer", "Kara", "Cynthia", "Keira", "Autumn", "Edgar", "Susanne", "Hope", "Elmer", "Edwin", "Ross", "Leah", "Helene", "Donald", "Frankie", "Donovan" ], "edges": [ [ 0, 2 ], [ 1, 6 ], [ 2, 1 ], [ 3, 8 ], [ 4, 5 ], [ 5, 3 ], [ 6, 9 ], [ 9, 7 ], [ 9, 4 ], [ 10, 12 ], [ 11, 16 ], [ 12, 11 ], [ 13, 18 ], [ 14, 15 ], [ 15, 13 ], [ 16, 19 ], [ 19, 17 ], [ 19, 14 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Zack knows Jesse. Ezra knows Veronica. Diane knows Vivian. Malik knows Paige. Elijah knows Elliot. Jenny knows Corinne. Malik knows Hope. Charlene knows Joseph. Corinne knows Jane. Diane knows Charlene. Vivian knows Erwin. Jenny knows Ezra. Zack knows Malik. Elijah knows Keira. Joseph knows Elijah. Elliot knows Sarah. Elliot knows Opal. Jane knows Zack. Which of Malik and Elliot can Jenny reach?", "answer": "Malik", "steps": [ "Jenny knows Corinne.", "Corinne knows Jane.", "Jane knows Zack.", "Zack knows Malik." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Jenny", "Corinne", "Paige", "Hope", "Veronica", "Malik", "Ezra", "Zack", "Jane", "Jesse", "Diane", "Charlene", "Sarah", "Opal", "Erwin", "Elliot", "Vivian", "Elijah", "Joseph", "Keira" ], "edges": [ [ 0, 6 ], [ 0, 1 ], [ 1, 8 ], [ 5, 2 ], [ 5, 3 ], [ 6, 4 ], [ 7, 5 ], [ 7, 9 ], [ 8, 7 ], [ 10, 16 ], [ 10, 11 ], [ 11, 18 ], [ 15, 12 ], [ 15, 13 ], [ 16, 14 ], [ 17, 15 ], [ 17, 19 ], [ 18, 17 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Tyler knows Evan. Naomi knows Elvis. Humphrey knows Mike. Chris knows Stefan. Chris knows Hal. Brittany knows Javier. Laura knows Tyler. Jacob knows Laura. Laura knows Jim. Brittany knows Mara. Laura knows Charity. Brittany knows Kay. Tyler knows Emery. Humphrey knows Brittany. Mara knows Clarissa. Laura knows Naomi. Jacob knows Claire. Brittany knows Chris. Which of Laura and Brittany can Humphrey reach?", "answer": "Brittany", "steps": [ "Humphrey knows Brittany." ], "difficulty": 1, "original_distance": 3, "idx_to_symbol": [ "Humphrey", "Mara", "Stefan", "Kay", "Brittany", "Clarissa", "Mike", "Chris", "Javier", "Hal", "Jacob", "Naomi", "Evan", "Charity", "Laura", "Elvis", "Claire", "Tyler", "Jim", "Emery" ], "edges": [ [ 0, 6 ], [ 0, 4 ], [ 1, 5 ], [ 4, 3 ], [ 4, 1 ], [ 4, 8 ], [ 4, 7 ], [ 7, 2 ], [ 7, 9 ], [ 10, 16 ], [ 10, 14 ], [ 11, 15 ], [ 14, 13 ], [ 14, 11 ], [ 14, 18 ], [ 14, 17 ], [ 17, 12 ], [ 17, 19 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Fern knows Pierce. Adelaide knows Freya. Lisa knows Pablo. Lisa knows Dylan. Priscilla knows Eric. Fern knows Homer. Eric knows Basil. Brynn knows Jodi. Basil knows Brynn. Christian knows Adelaide. Holly knows Kelsey. Jodi knows Hubert. Brynn knows Doris. Holly knows Maureen. Brynn knows Holly. Freya knows Fern. Pierce knows Kathleen. Fern knows Lisa. Which of Brynn and Fern can Priscilla reach?", "answer": "Brynn", "steps": [ "Priscilla knows Eric.", "Eric knows Basil.", "Basil knows Brynn." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Priscilla", "Hubert", "Jodi", "Brynn", "Holly", "Doris", "Eric", "Kelsey", "Maureen", "Basil", "Christian", "Kathleen", "Pierce", "Fern", "Lisa", "Homer", "Adelaide", "Dylan", "Pablo", "Freya" ], "edges": [ [ 0, 6 ], [ 2, 1 ], [ 3, 2 ], [ 3, 5 ], [ 3, 4 ], [ 4, 7 ], [ 4, 8 ], [ 6, 9 ], [ 9, 3 ], [ 10, 16 ], [ 12, 11 ], [ 13, 12 ], [ 13, 15 ], [ 13, 14 ], [ 14, 17 ], [ 14, 18 ], [ 16, 19 ], [ 19, 13 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Nathan knows Louisa. Helene knows Anthony. Carl knows Priscilla. Foster knows Darnell. Priscilla knows Humphrey. Foster knows Merle. Jermaine knows Foster. Carl knows Malcolm. Zach knows Ruby. Merle knows Zach. Ruby knows Glenn. Humphrey knows Kane. Jermaine knows Ida. Priscilla knows Wendy. Kane knows Helene. Priscilla knows Fergus. Wendy knows Cliff. Foster knows Nathan. Which of Anthony and Glenn can Jermaine reach?", "answer": "Glenn", "steps": [ "Jermaine knows Foster.", "Foster knows Merle.", "Merle knows Zach.", "Zach knows Ruby.", "Ruby knows Glenn." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Jermaine", "Ruby", "Foster", "Glenn", "Nathan", "Merle", "Darnell", "Ida", "Zach", "Louisa", "Carl", "Helene", "Priscilla", "Anthony", "Wendy", "Humphrey", "Fergus", "Malcolm", "Kane", "Cliff" ], "edges": [ [ 0, 7 ], [ 0, 2 ], [ 1, 3 ], [ 2, 6 ], [ 2, 5 ], [ 2, 4 ], [ 4, 9 ], [ 5, 8 ], [ 8, 1 ], [ 10, 17 ], [ 10, 12 ], [ 11, 13 ], [ 12, 16 ], [ 12, 15 ], [ 12, 14 ], [ 14, 19 ], [ 15, 18 ], [ 18, 11 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Barbara knows Holden. Miranda knows Drew. Peggy knows Gail. Barbara knows Peggy. Gwen knows Demetrius. Elsa knows Steve. Kathleen knows Barbara. Jude knows Kathleen. Riley knows Travis. Demetrius knows Riley. Andrew knows Tamara. Alejandro knows Andrew. Elsa knows Miranda. Tamara knows Elsa. Peggy knows Gwen. Hazel knows Hayes. Tamara knows Brody. Drew knows Hazel. Which of Hazel and Riley can Alejandro reach?", "answer": "Hazel", "steps": [ "Alejandro knows Andrew.", "Andrew knows Tamara.", "Tamara knows Elsa.", "Elsa knows Miranda.", "Miranda knows Drew.", "Drew knows Hazel." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Alejandro", "Drew", "Tamara", "Hayes", "Andrew", "Brody", "Steve", "Elsa", "Miranda", "Hazel", "Jude", "Demetrius", "Barbara", "Travis", "Kathleen", "Holden", "Gail", "Peggy", "Gwen", "Riley" ], "edges": [ [ 0, 4 ], [ 1, 9 ], [ 2, 5 ], [ 2, 7 ], [ 4, 2 ], [ 7, 6 ], [ 7, 8 ], [ 8, 1 ], [ 9, 3 ], [ 10, 14 ], [ 11, 19 ], [ 12, 15 ], [ 12, 17 ], [ 14, 12 ], [ 17, 16 ], [ 17, 18 ], [ 18, 11 ], [ 19, 13 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Sarah knows Natalie. Blake knows Yasmin. Lottie knows Dave. Jenna knows Mildred. Yasmin knows Judith. Declan knows Martha. August knows Patrick. Laura knows Sarah. Dave knows Geraldine. Sarah knows Carson. Patrick knows Lottie. Dean knows Lucia. Kylie knows Laura. Carson knows Declan. Martha knows Dean. Dave knows Blake. Curtis knows Kylie. Judith knows Jenna. Which of Kylie and Patrick can August reach?", "answer": "Patrick", "steps": [ "August knows Patrick." ], "difficulty": 1, "original_distance": 8, "idx_to_symbol": [ "August", "Blake", "Judith", "Geraldine", "Dave", "Lottie", "Mildred", "Jenna", "Yasmin", "Patrick", "Curtis", "Carson", "Martha", "Natalie", "Sarah", "Laura", "Lucia", "Dean", "Declan", "Kylie" ], "edges": [ [ 0, 9 ], [ 1, 8 ], [ 2, 7 ], [ 4, 3 ], [ 4, 1 ], [ 5, 4 ], [ 7, 6 ], [ 8, 2 ], [ 9, 5 ], [ 10, 19 ], [ 11, 18 ], [ 12, 17 ], [ 14, 13 ], [ 14, 11 ], [ 15, 14 ], [ 17, 16 ], [ 18, 12 ], [ 19, 15 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Harris knows Jon. Lark knows Ian. Sharon knows Kelly. Phoebe knows Valerie. Mark knows Drake. Phoebe knows Lark. Lola knows Sharon. Andre knows Damien. Kelly knows Lyric. Jon knows Anastasia. Lola knows Mark. Jon knows Boyd. Lark knows Julie. Andre knows Eloise. Ian knows Winston. Julie knows Andre. Sharon knows Harris. Valerie knows Wayne. Which of Damien and Anastasia can Phoebe reach?", "answer": "Damien", "steps": [ "Phoebe knows Lark.", "Lark knows Julie.", "Julie knows Andre.", "Andre knows Damien." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Phoebe", "Wayne", "Lark", "Ian", "Winston", "Eloise", "Julie", "Damien", "Valerie", "Andre", "Lola", "Drake", "Sharon", "Kelly", "Lyric", "Boyd", "Harris", "Anastasia", "Mark", "Jon" ], "edges": [ [ 0, 8 ], [ 0, 2 ], [ 2, 3 ], [ 2, 6 ], [ 3, 4 ], [ 6, 9 ], [ 8, 1 ], [ 9, 5 ], [ 9, 7 ], [ 10, 18 ], [ 10, 12 ], [ 12, 13 ], [ 12, 16 ], [ 13, 14 ], [ 16, 19 ], [ 18, 11 ], [ 19, 15 ], [ 19, 17 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Joel knows Nadine. Hubert knows Wayne. Deirdre knows Jill. Darius knows Joseph. Wayne knows Darius. Nadine knows Tracy. Darius knows Julius. Jill knows Omar. Deirdre knows Dale. Ronald knows Colin. Colin knows Lisette. Justin knows Ronald. Omar knows Maude. Tracy knows Riley. Deirdre knows Justin. Joel knows Aspen. Joel knows Hubert. Colin knows Dallas. Which of Colin and Darius can Joel reach?", "answer": "Darius", "steps": [ "Joel knows Hubert.", "Hubert knows Wayne.", "Wayne knows Darius." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Joel", "Aspen", "Hubert", "Nadine", "Tracy", "Riley", "Julius", "Darius", "Joseph", "Wayne", "Deirdre", "Dale", "Justin", "Jill", "Omar", "Maude", "Lisette", "Colin", "Dallas", "Ronald" ], "edges": [ [ 0, 1 ], [ 0, 3 ], [ 0, 2 ], [ 2, 9 ], [ 3, 4 ], [ 4, 5 ], [ 7, 6 ], [ 7, 8 ], [ 9, 7 ], [ 10, 11 ], [ 10, 13 ], [ 10, 12 ], [ 12, 19 ], [ 13, 14 ], [ 14, 15 ], [ 17, 16 ], [ 17, 18 ], [ 19, 17 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Kendrick knows Mitchell. Todd knows Lance. Todd knows Melody. Rena knows Abby. Rena knows Hector. Ariana knows Milton. Todd knows Dorian. Katherine knows Neville. Cameron knows Brian. Ariana knows Katherine. Humphrey knows Ariana. Kendrick knows Todd. Katherine knows Livia. Humphrey knows Kate. Ariana knows Cameron. Ariana knows Frida. Todd knows Rena. Dorian knows Trina. Which of Todd and Ariana can Humphrey reach?", "answer": "Ariana", "steps": [ "Humphrey knows Ariana." ], "difficulty": 1, "original_distance": 3, "idx_to_symbol": [ "Humphrey", "Cameron", "Kate", "Brian", "Neville", "Milton", "Livia", "Frida", "Katherine", "Ariana", "Kendrick", "Dorian", "Mitchell", "Trina", "Abby", "Lance", "Hector", "Melody", "Rena", "Todd" ], "edges": [ [ 0, 2 ], [ 0, 9 ], [ 1, 3 ], [ 8, 4 ], [ 8, 6 ], [ 9, 1 ], [ 9, 5 ], [ 9, 7 ], [ 9, 8 ], [ 10, 12 ], [ 10, 19 ], [ 11, 13 ], [ 18, 14 ], [ 18, 16 ], [ 19, 11 ], [ 19, 15 ], [ 19, 17 ], [ 19, 18 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Linda knows Malcolm. Linda knows Levi. Estelle knows Isadora. Winston knows Merle. Omar knows Neville. Samantha knows Flora. Eugene knows Damian. Omar knows Dixie. Flora knows Eugene. Damian knows Noel. Levi knows Omar. Lucille knows Winston. Dixie knows Isaac. Noel knows Julio. Isaac knows Estelle. Flora knows Tara. Lucille knows Samantha. Malcolm knows Brent. Which of Isadora and Julio can Lucille reach?", "answer": "Julio", "steps": [ "Lucille knows Samantha.", "Samantha knows Flora.", "Flora knows Eugene.", "Eugene knows Damian.", "Damian knows Noel.", "Noel knows Julio." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Lucille", "Tara", "Merle", "Julio", "Winston", "Flora", "Damian", "Eugene", "Samantha", "Noel", "Linda", "Neville", "Brent", "Isadora", "Malcolm", "Omar", "Isaac", "Dixie", "Levi", "Estelle" ], "edges": [ [ 0, 4 ], [ 0, 8 ], [ 4, 2 ], [ 5, 1 ], [ 5, 7 ], [ 6, 9 ], [ 7, 6 ], [ 8, 5 ], [ 9, 3 ], [ 10, 14 ], [ 10, 18 ], [ 14, 12 ], [ 15, 11 ], [ 15, 17 ], [ 16, 19 ], [ 17, 16 ], [ 18, 15 ], [ 19, 13 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Heidi knows Lucia. Marcus knows Joy. Mark knows Rita. Keaton knows Lyle. Lyle knows Ross. Ida knows Fletcher. Erwin knows Dolores. Brittany knows Irving. Leigh knows Oliver. Garland knows Brittany. Erwin knows Leigh. Dolores knows Milo. Milo knows Marcus. Lucia knows Keaton. Keaton knows Ida. Irving knows Erwin. Milton knows Heidi. Ross knows Mark. Which of Joy and Rita can Milton reach?", "answer": "Rita", "steps": [ "Milton knows Heidi.", "Heidi knows Lucia.", "Lucia knows Keaton.", "Keaton knows Lyle.", "Lyle knows Ross.", "Ross knows Mark.", "Mark knows Rita." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Milton", "Heidi", "Ross", "Mark", "Fletcher", "Lyle", "Rita", "Lucia", "Keaton", "Ida", "Garland", "Brittany", "Milo", "Marcus", "Oliver", "Dolores", "Joy", "Irving", "Erwin", "Leigh" ], "edges": [ [ 0, 1 ], [ 1, 7 ], [ 2, 3 ], [ 3, 6 ], [ 5, 2 ], [ 7, 8 ], [ 8, 5 ], [ 8, 9 ], [ 9, 4 ], [ 10, 11 ], [ 11, 17 ], [ 12, 13 ], [ 13, 16 ], [ 15, 12 ], [ 17, 18 ], [ 18, 15 ], [ 18, 19 ], [ 19, 14 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Desmond knows Darwin. Joanna knows Delia. Brett knows Lawson. Joyce knows Annette. Horace knows Joyce. Trudy knows Rosa. Joanna knows Hardy. Delia knows Desmond. Hardy knows Horace. Connor knows Jim. Lawson knows Bob. Jim knows Gabriel. Delia knows Kieran. Brett knows Trudy. Kieran knows Clay. Gabriel knows Bart. Connor knows Brett. Bart knows Terrence. Which of Terrence and Annette can Joanna reach?", "answer": "Annette", "steps": [ "Joanna knows Hardy.", "Hardy knows Horace.", "Horace knows Joyce.", "Joyce knows Annette." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Joanna", "Horace", "Darwin", "Hardy", "Joyce", "Annette", "Kieran", "Clay", "Delia", "Desmond", "Connor", "Gabriel", "Rosa", "Jim", "Bart", "Terrence", "Lawson", "Bob", "Brett", "Trudy" ], "edges": [ [ 0, 3 ], [ 0, 8 ], [ 1, 4 ], [ 3, 1 ], [ 4, 5 ], [ 6, 7 ], [ 8, 6 ], [ 8, 9 ], [ 9, 2 ], [ 10, 13 ], [ 10, 18 ], [ 11, 14 ], [ 13, 11 ], [ 14, 15 ], [ 16, 17 ], [ 18, 16 ], [ 18, 19 ], [ 19, 12 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Foster knows Mindy. Lois knows Foster. Livia knows Erik. Cooper knows Opal. Rick knows Ilene. Wyatt knows Tracy. Ilene knows Chris. Chris knows Lois. Tracy knows Dirk. Alan knows Heidi. Heidi knows Wyatt. Wyatt knows Livia. Erik knows Sara. Opal knows Shaun. Dirk knows Homer. Foster knows Audrey. Erik knows Jennifer. Chris knows Cooper. Which of Audrey and Sara can Rick reach?", "answer": "Audrey", "steps": [ "Rick knows Ilene.", "Ilene knows Chris.", "Chris knows Lois.", "Lois knows Foster.", "Foster knows Audrey." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Rick", "Audrey", "Foster", "Ilene", "Mindy", "Shaun", "Lois", "Chris", "Opal", "Cooper", "Alan", "Sara", "Erik", "Heidi", "Jennifer", "Homer", "Livia", "Wyatt", "Dirk", "Tracy" ], "edges": [ [ 0, 3 ], [ 2, 1 ], [ 2, 4 ], [ 3, 7 ], [ 6, 2 ], [ 7, 6 ], [ 7, 9 ], [ 8, 5 ], [ 9, 8 ], [ 10, 13 ], [ 12, 11 ], [ 12, 14 ], [ 13, 17 ], [ 16, 12 ], [ 17, 16 ], [ 17, 19 ], [ 18, 15 ], [ 19, 18 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Faye knows Mack. Ramona knows Eamon. Aisha knows Frankie. Hampton knows Jonathan. Frankie knows Roman. Olive knows Kirk. Kirk knows Ramona. Ted knows Sebastian. Olive knows Jerry. Frankie knows Hampton. Aisha knows Val. Faye knows Olive. Sebastian knows Aisha. Katrina knows Faye. Jonathan knows Ford. Ramona knows Rosa. Jonathan knows Percy. Emanuel knows Katrina. Which of Rosa and Ford can Emanuel reach?", "answer": "Rosa", "steps": [ "Emanuel knows Katrina.", "Katrina knows Faye.", "Faye knows Olive.", "Olive knows Kirk.", "Kirk knows Ramona.", "Ramona knows Rosa." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Emanuel", "Katrina", "Ramona", "Jerry", "Mack", "Kirk", "Rosa", "Eamon", "Olive", "Faye", "Ted", "Sebastian", "Jonathan", "Roman", "Val", "Hampton", "Ford", "Percy", "Frankie", "Aisha" ], "edges": [ [ 0, 1 ], [ 1, 9 ], [ 2, 6 ], [ 2, 7 ], [ 5, 2 ], [ 8, 3 ], [ 8, 5 ], [ 9, 4 ], [ 9, 8 ], [ 10, 11 ], [ 11, 19 ], [ 12, 16 ], [ 12, 17 ], [ 15, 12 ], [ 18, 13 ], [ 18, 15 ], [ 19, 14 ], [ 19, 18 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Tamara knows Palmer. Earle knows Odette. Brenda knows Jack. Loretta knows Shaun. Jocelyn knows Tamara. Odette knows Amelia. Amelia knows Dahlia. Riley knows Saul. Caleb knows Rhonda. Odette knows Brenda. Laurel knows Julius. Tamara knows Laurel. Jeremy knows Loretta. Dahlia knows Whitney. Palmer knows Caleb. Dahlia knows Riley. Saul knows Esme. Caleb knows Jeremy. Which of Loretta and Saul can Earle reach?", "answer": "Saul", "steps": [ "Earle knows Odette.", "Odette knows Amelia.", "Amelia knows Dahlia.", "Dahlia knows Riley.", "Riley knows Saul." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Earle", "Amelia", "Odette", "Dahlia", "Riley", "Esme", "Saul", "Brenda", "Jack", "Whitney", "Jocelyn", "Palmer", "Tamara", "Caleb", "Jeremy", "Shaun", "Loretta", "Laurel", "Julius", "Rhonda" ], "edges": [ [ 0, 2 ], [ 1, 3 ], [ 2, 7 ], [ 2, 1 ], [ 3, 4 ], [ 3, 9 ], [ 4, 6 ], [ 6, 5 ], [ 7, 8 ], [ 10, 12 ], [ 11, 13 ], [ 12, 17 ], [ 12, 11 ], [ 13, 14 ], [ 13, 19 ], [ 14, 16 ], [ 16, 15 ], [ 17, 18 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Gemma knows Greta. Annette knows Logan. Bruce knows Gemma. Stephanie knows Dale. Mark knows Myrtle. Greta knows Jacqueline. Erica knows Bruce. Annette knows Sam. Haley knows Audrey. Audrey knows Alicia. Sam knows Stephanie. Wade knows Opal. Wade knows Veronica. Alicia knows Erica. Veronica knows Mark. Dale knows Wade. Bruce knows Ford. Haley knows Andrea. Which of Mark and Greta can Haley reach?", "answer": "Greta", "steps": [ "Haley knows Audrey.", "Audrey knows Alicia.", "Alicia knows Erica.", "Erica knows Bruce.", "Bruce knows Gemma.", "Gemma knows Greta." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Haley", "Audrey", "Greta", "Andrea", "Gemma", "Ford", "Bruce", "Jacqueline", "Alicia", "Erica", "Annette", "Sam", "Mark", "Logan", "Veronica", "Opal", "Wade", "Myrtle", "Stephanie", "Dale" ], "edges": [ [ 0, 3 ], [ 0, 1 ], [ 1, 8 ], [ 2, 7 ], [ 4, 2 ], [ 6, 5 ], [ 6, 4 ], [ 8, 9 ], [ 9, 6 ], [ 10, 13 ], [ 10, 11 ], [ 11, 18 ], [ 12, 17 ], [ 14, 12 ], [ 16, 15 ], [ 16, 14 ], [ 18, 19 ], [ 19, 16 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Charlotte knows Archie. Abby knows Callum. Derrick knows Claire. Rose knows Virginia. Callum knows Linda. Ralph knows Abby. Joseph knows Ronald. Linda knows Irving. Rita knows Lucille. Ronald knows Derrick. Charlotte knows Henry. Derrick knows Rose. Irving knows Charlotte. Irving knows Brandon. Rose knows Connor. Charlotte knows Ainsley. Lucille knows Joseph. Rose knows Lilia. Which of Irving and Derrick can Ralph reach?", "answer": "Irving", "steps": [ "Ralph knows Abby.", "Abby knows Callum.", "Callum knows Linda.", "Linda knows Irving." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Ralph", "Ainsley", "Charlotte", "Callum", "Irving", "Archie", "Henry", "Linda", "Abby", "Brandon", "Rita", "Virginia", "Rose", "Joseph", "Derrick", "Connor", "Lilia", "Ronald", "Lucille", "Claire" ], "edges": [ [ 0, 8 ], [ 2, 1 ], [ 2, 5 ], [ 2, 6 ], [ 3, 7 ], [ 4, 2 ], [ 4, 9 ], [ 7, 4 ], [ 8, 3 ], [ 10, 18 ], [ 12, 11 ], [ 12, 15 ], [ 12, 16 ], [ 13, 17 ], [ 14, 12 ], [ 14, 19 ], [ 17, 14 ], [ 18, 13 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Kennedy knows Curtis. Jason knows Stefan. Dave knows Kennedy. Zara knows Quinn. Malcolm knows Malik. Ann knows Malcolm. Iris knows Brett. Malik knows Zara. Malik knows Olivia. Stefan knows Anna. Roger knows Jason. Brett knows Roger. Preston knows Crystal. Erik knows Iris. Sybil knows Preston. Brett knows Sybil. Quinn knows Alfonso. Olivia knows Dave. Which of Olivia and Roger can Ann reach?", "answer": "Olivia", "steps": [ "Ann knows Malcolm.", "Malcolm knows Malik.", "Malik knows Olivia." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Ann", "Malik", "Olivia", "Curtis", "Zara", "Alfonso", "Malcolm", "Quinn", "Dave", "Kennedy", "Erik", "Brett", "Roger", "Anna", "Sybil", "Crystal", "Iris", "Preston", "Jason", "Stefan" ], "edges": [ [ 0, 6 ], [ 1, 4 ], [ 1, 2 ], [ 2, 8 ], [ 4, 7 ], [ 6, 1 ], [ 7, 5 ], [ 8, 9 ], [ 9, 3 ], [ 10, 16 ], [ 11, 14 ], [ 11, 12 ], [ 12, 18 ], [ 14, 17 ], [ 16, 11 ], [ 17, 15 ], [ 18, 19 ], [ 19, 13 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Janice knows Ainsley. Graeme knows Blake. Destiny knows Maria. Herbert knows Alice. Carmela knows Janice. Vicki knows Carmela. Elmer knows Estella. Janice knows Graeme. Alice knows Vicki. Wallace knows Elmer. Stefan knows Jennifer. Maria knows Stefan. Elmer knows Scott. Jules knows Glenn. Cate knows Herbert. Stefan knows Jules. Estella knows Destiny. Herbert knows Charity. Which of Alice and Estella can Cate reach?", "answer": "Alice", "steps": [ "Cate knows Herbert.", "Herbert knows Alice." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Cate", "Ainsley", "Alice", "Vicki", "Herbert", "Charity", "Carmela", "Graeme", "Janice", "Blake", "Wallace", "Jennifer", "Estella", "Destiny", "Elmer", "Scott", "Maria", "Jules", "Stefan", "Glenn" ], "edges": [ [ 0, 4 ], [ 2, 3 ], [ 3, 6 ], [ 4, 5 ], [ 4, 2 ], [ 6, 8 ], [ 7, 9 ], [ 8, 1 ], [ 8, 7 ], [ 10, 14 ], [ 12, 13 ], [ 13, 16 ], [ 14, 15 ], [ 14, 12 ], [ 16, 18 ], [ 17, 19 ], [ 18, 11 ], [ 18, 17 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Lara knows Lucia. Philip knows Clement. Clement knows Karla. Caleb knows Laverne. Clement knows Lenora. Lucia knows Travis. Jane knows Lara. Colleen knows Jane. Philip knows Caleb. Lucia knows Monroe. Dora knows Emily. Laverne knows Joel. Lara knows Mack. Taylor knows Abel. Laverne knows Riley. Taylor knows Lee. Emily knows Philip. Mack knows Taylor. Which of Lara and Philip can Colleen reach?", "answer": "Lara", "steps": [ "Colleen knows Jane.", "Jane knows Lara." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Colleen", "Lee", "Mack", "Monroe", "Travis", "Jane", "Abel", "Lucia", "Lara", "Taylor", "Dora", "Riley", "Caleb", "Karla", "Lenora", "Emily", "Joel", "Clement", "Philip", "Laverne" ], "edges": [ [ 0, 5 ], [ 2, 9 ], [ 5, 8 ], [ 7, 3 ], [ 7, 4 ], [ 8, 7 ], [ 8, 2 ], [ 9, 1 ], [ 9, 6 ], [ 10, 15 ], [ 12, 19 ], [ 15, 18 ], [ 17, 13 ], [ 17, 14 ], [ 18, 17 ], [ 18, 12 ], [ 19, 11 ], [ 19, 16 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Wade knows Preston. Lee knows Allan. Lee knows Fabian. Kent knows Ida. Preston knows Clement. Jacques knows Kim. Fabian knows Tessa. Ben knows Billy. Nell knows Jacques. Ida knows Alfonso. Jacques knows Wade. Nell knows Ben. Allan knows Darcy. Ursula knows Kent. Billy knows Gail. Ursula knows Lee. Tessa knows Chance. Kim knows Bernadette. Which of Wade and Fabian can Ursula reach?", "answer": "Fabian", "steps": [ "Ursula knows Lee.", "Lee knows Fabian." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Ursula", "Ida", "Fabian", "Chance", "Kent", "Lee", "Alfonso", "Tessa", "Darcy", "Allan", "Nell", "Billy", "Wade", "Clement", "Ben", "Jacques", "Gail", "Preston", "Bernadette", "Kim" ], "edges": [ [ 0, 4 ], [ 0, 5 ], [ 1, 6 ], [ 2, 7 ], [ 4, 1 ], [ 5, 2 ], [ 5, 9 ], [ 7, 3 ], [ 9, 8 ], [ 10, 14 ], [ 10, 15 ], [ 11, 16 ], [ 12, 17 ], [ 14, 11 ], [ 15, 12 ], [ 15, 19 ], [ 17, 13 ], [ 19, 18 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Fern knows Pierce. Adelaide knows Freya. Lisa knows Pablo. Lisa knows Dylan. Priscilla knows Eric. Fern knows Homer. Eric knows Basil. Brynn knows Jodi. Basil knows Brynn. Christian knows Adelaide. Holly knows Kelsey. Jodi knows Hubert. Brynn knows Doris. Holly knows Maureen. Brynn knows Holly. Freya knows Fern. Pierce knows Kathleen. Fern knows Lisa. Which of Kathleen and Hubert can Priscilla reach?", "answer": "Hubert", "steps": [ "Priscilla knows Eric.", "Eric knows Basil.", "Basil knows Brynn.", "Brynn knows Jodi.", "Jodi knows Hubert." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Priscilla", "Hubert", "Jodi", "Brynn", "Holly", "Doris", "Eric", "Kelsey", "Maureen", "Basil", "Christian", "Kathleen", "Pierce", "Fern", "Lisa", "Homer", "Adelaide", "Dylan", "Pablo", "Freya" ], "edges": [ [ 0, 6 ], [ 2, 1 ], [ 3, 2 ], [ 3, 5 ], [ 3, 4 ], [ 4, 7 ], [ 4, 8 ], [ 6, 9 ], [ 9, 3 ], [ 10, 16 ], [ 12, 11 ], [ 13, 12 ], [ 13, 15 ], [ 13, 14 ], [ 14, 17 ], [ 14, 18 ], [ 16, 19 ], [ 19, 13 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Aiden knows Mildred. Raquel knows Regina. Bonnie knows Lyle. Lana knows Aiden. Lyle knows Calvin. Lana knows Kelly. Lyle knows Elton. Bonnie knows Marvin. Jackson knows Sidney. Mildred knows Clinton. Luz knows Raquel. Lana knows Luz. Luz knows Jackson. Bonnie knows Cindy. Marvin knows Juan. Calvin knows Malik. Elton knows Marlene. Juan knows Paula. Which of Mildred and Juan can Lana reach?", "answer": "Mildred", "steps": [ "Lana knows Aiden.", "Aiden knows Mildred." ], "difficulty": 2, "original_distance": 3, "idx_to_symbol": [ "Lana", "Jackson", "Aiden", "Kelly", "Sidney", "Regina", "Mildred", "Luz", "Clinton", "Raquel", "Bonnie", "Elton", "Marvin", "Cindy", "Marlene", "Malik", "Juan", "Lyle", "Paula", "Calvin" ], "edges": [ [ 0, 3 ], [ 0, 2 ], [ 0, 7 ], [ 1, 4 ], [ 2, 6 ], [ 6, 8 ], [ 7, 1 ], [ 7, 9 ], [ 9, 5 ], [ 10, 13 ], [ 10, 12 ], [ 10, 17 ], [ 11, 14 ], [ 12, 16 ], [ 16, 18 ], [ 17, 11 ], [ 17, 19 ], [ 19, 15 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Vivian knows June. Gareth knows Burt. Glen knows Aisha. Gilbert knows Glen. Karl knows Henry. Layla knows Alice. June knows Caleb. Blair knows Cate. Blair knows Mitchell. Jackson knows Karl. Mitchell knows Vivian. Cate knows Layla. Aisha knows Gareth. Jack knows Rowan. Burt knows Hudson. Rowan knows Blair. Glen knows Jackson. Jolena knows Gilbert. Which of Hudson and Caleb can Jack reach?", "answer": "Caleb", "steps": [ "Jack knows Rowan.", "Rowan knows Blair.", "Blair knows Mitchell.", "Mitchell knows Vivian.", "Vivian knows June.", "June knows Caleb." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Jack", "Vivian", "Layla", "Rowan", "Blair", "Cate", "Caleb", "June", "Alice", "Mitchell", "Jolena", "Gareth", "Karl", "Gilbert", "Glen", "Jackson", "Hudson", "Burt", "Henry", "Aisha" ], "edges": [ [ 0, 3 ], [ 1, 7 ], [ 2, 8 ], [ 3, 4 ], [ 4, 5 ], [ 4, 9 ], [ 5, 2 ], [ 7, 6 ], [ 9, 1 ], [ 10, 13 ], [ 11, 17 ], [ 12, 18 ], [ 13, 14 ], [ 14, 15 ], [ 14, 19 ], [ 15, 12 ], [ 17, 16 ], [ 19, 11 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Vanessa knows Lacey. Yuki knows Ashton. Randall knows Nora. Ivan knows Dorian. Emma knows Ivan. Ella knows Ernie. Nora knows Ella. Alfonso knows Vanessa. Yuki knows Reed. Ivan knows Alfonso. Bob knows Yuki. Randall knows Emma. Desmond knows Alder. Ashton knows Aspen. Renee knows Quinn. Aspen knows Irma. Alder knows Renee. Desmond knows Bob. Which of Bob and Emma can Desmond reach?", "answer": "Bob", "steps": [ "Desmond knows Bob." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Desmond", "Alder", "Aspen", "Ashton", "Irma", "Renee", "Yuki", "Reed", "Quinn", "Bob", "Randall", "Nora", "Vanessa", "Alfonso", "Lacey", "Ella", "Ivan", "Dorian", "Ernie", "Emma" ], "edges": [ [ 0, 1 ], [ 0, 9 ], [ 1, 5 ], [ 2, 4 ], [ 3, 2 ], [ 5, 8 ], [ 6, 3 ], [ 6, 7 ], [ 9, 6 ], [ 10, 11 ], [ 10, 19 ], [ 11, 15 ], [ 12, 14 ], [ 13, 12 ], [ 15, 18 ], [ 16, 13 ], [ 16, 17 ], [ 19, 16 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Robin knows Bridget. Darla knows Garrison. Kennedy knows Elsa. Darla knows Roland. Louis knows Robin. Mindy knows Kennedy. Garrett knows Glenda. Emma knows Mae. Kennedy knows Garrett. Garrett knows Jenna. Garrison knows Emma. Emma knows Janet. Marcus knows Kane. Mason knows Marcus. Garrett knows Mason. Marcus knows Iris. Darla knows Nelson. Robin knows Darla. Which of Emma and Marcus can Louis reach?", "answer": "Emma", "steps": [ "Louis knows Robin.", "Robin knows Darla.", "Darla knows Garrison.", "Garrison knows Emma." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Louis", "Emma", "Janet", "Mae", "Bridget", "Nelson", "Roland", "Darla", "Robin", "Garrison", "Mindy", "Marcus", "Iris", "Kane", "Elsa", "Jenna", "Glenda", "Garrett", "Kennedy", "Mason" ], "edges": [ [ 0, 8 ], [ 1, 2 ], [ 1, 3 ], [ 7, 5 ], [ 7, 6 ], [ 7, 9 ], [ 8, 4 ], [ 8, 7 ], [ 9, 1 ], [ 10, 18 ], [ 11, 12 ], [ 11, 13 ], [ 17, 15 ], [ 17, 16 ], [ 17, 19 ], [ 18, 14 ], [ 18, 17 ], [ 19, 11 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Tamara knows Palmer. Earle knows Odette. Brenda knows Jack. Loretta knows Shaun. Jocelyn knows Tamara. Odette knows Amelia. Amelia knows Dahlia. Riley knows Saul. Caleb knows Rhonda. Odette knows Brenda. Laurel knows Julius. Tamara knows Laurel. Jeremy knows Loretta. Dahlia knows Whitney. Palmer knows Caleb. Dahlia knows Riley. Saul knows Esme. Caleb knows Jeremy. Which of Dahlia and Caleb can Earle reach?", "answer": "Dahlia", "steps": [ "Earle knows Odette.", "Odette knows Amelia.", "Amelia knows Dahlia." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Earle", "Amelia", "Odette", "Dahlia", "Riley", "Esme", "Saul", "Brenda", "Jack", "Whitney", "Jocelyn", "Palmer", "Tamara", "Caleb", "Jeremy", "Shaun", "Loretta", "Laurel", "Julius", "Rhonda" ], "edges": [ [ 0, 2 ], [ 1, 3 ], [ 2, 7 ], [ 2, 1 ], [ 3, 4 ], [ 3, 9 ], [ 4, 6 ], [ 6, 5 ], [ 7, 8 ], [ 10, 12 ], [ 11, 13 ], [ 12, 17 ], [ 12, 11 ], [ 13, 14 ], [ 13, 19 ], [ 14, 16 ], [ 16, 15 ], [ 17, 18 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Jordan knows Emma. Duncan knows Jacqueline. Gina knows Jerome. Russ knows Gina. Emma knows Pat. Gina knows Griffith. Emma knows Conrad. Paula knows Homer. Pat knows Mabel. Mabel knows Russ. Jacqueline knows Cyrus. Daniella knows Fergus. Daniella knows Gabe. Lillian knows Daniella. Jacqueline knows Paula. Gina knows Mae. Homer knows Lillian. Daniella knows Elvira. Which of Jacqueline and Emma can Duncan reach?", "answer": "Jacqueline", "steps": [ "Duncan knows Jacqueline." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Duncan", "Daniella", "Paula", "Homer", "Jacqueline", "Gabe", "Fergus", "Elvira", "Lillian", "Cyrus", "Jordan", "Gina", "Pat", "Mabel", "Emma", "Mae", "Griffith", "Jerome", "Russ", "Conrad" ], "edges": [ [ 0, 4 ], [ 1, 5 ], [ 1, 6 ], [ 1, 7 ], [ 2, 3 ], [ 3, 8 ], [ 4, 2 ], [ 4, 9 ], [ 8, 1 ], [ 10, 14 ], [ 11, 15 ], [ 11, 16 ], [ 11, 17 ], [ 12, 13 ], [ 13, 18 ], [ 14, 12 ], [ 14, 19 ], [ 18, 11 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Cynthia knows Fisher. Zane knows Milo. Blanche knows Zane. Ernest knows Jewel. Shane knows Ernest. Dawn knows Shelly. Dawn knows Shane. Fisher knows Pedro. Pedro knows Joseph. Shelly knows Troy. Ariana knows Lloyd. Fisher knows Fern. Joseph knows Ruth. Lance knows Ariana. Lloyd knows Molly. Jewel knows Hector. Pedro knows Lance. Zane knows Dawn. Which of Lloyd and Jewel can Cynthia reach?", "answer": "Lloyd", "steps": [ "Cynthia knows Fisher.", "Fisher knows Pedro.", "Pedro knows Lance.", "Lance knows Ariana.", "Ariana knows Lloyd." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Cynthia", "Pedro", "Joseph", "Fisher", "Lance", "Ruth", "Lloyd", "Fern", "Ariana", "Molly", "Blanche", "Dawn", "Shelly", "Zane", "Shane", "Troy", "Jewel", "Milo", "Ernest", "Hector" ], "edges": [ [ 0, 3 ], [ 1, 2 ], [ 1, 4 ], [ 2, 5 ], [ 3, 7 ], [ 3, 1 ], [ 4, 8 ], [ 6, 9 ], [ 8, 6 ], [ 10, 13 ], [ 11, 12 ], [ 11, 14 ], [ 12, 15 ], [ 13, 17 ], [ 13, 11 ], [ 14, 18 ], [ 16, 19 ], [ 18, 16 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Alfonso knows Florence. Ben knows Charlene. Dexter knows Ingrid. Garrett knows Hank. Florence knows Norman. Oliver knows Vance. Vance knows Victoria. Vance knows Dexter. George knows Deirdre. Jake knows Garrett. George knows Ivy. Garrett knows Cole. Ivy knows Ben. Jake knows Fisher. Eva knows Jake. Dexter knows George. Cole knows Gordon. Cole knows Alfonso. Which of Cole and George can Eva reach?", "answer": "Cole", "steps": [ "Eva knows Jake.", "Jake knows Garrett.", "Garrett knows Cole." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Eva", "Cole", "Gordon", "Alfonso", "Norman", "Fisher", "Florence", "Jake", "Hank", "Garrett", "Oliver", "George", "Deirdre", "Ivy", "Charlene", "Victoria", "Ben", "Vance", "Ingrid", "Dexter" ], "edges": [ [ 0, 7 ], [ 1, 2 ], [ 1, 3 ], [ 3, 6 ], [ 6, 4 ], [ 7, 5 ], [ 7, 9 ], [ 9, 1 ], [ 9, 8 ], [ 10, 17 ], [ 11, 12 ], [ 11, 13 ], [ 13, 16 ], [ 16, 14 ], [ 17, 15 ], [ 17, 19 ], [ 19, 11 ], [ 19, 18 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Calvin knows Harvey. Brynn knows Frankie. Harvey knows Ira. Regina knows Dolores. Nell knows Sarah. Monroe knows Regina. Sarah knows Jeff. Vivian knows Nell. Frankie knows Alana. Jackson knows Monroe. Sarah knows Magdalena. Hamilton knows Brynn. Carey knows Hamilton. Clement knows Calvin. Carey knows Clement. Jackson knows Vivian. Frankie knows Gloria. Dolores knows Kurt. Which of Brynn and Nell can Carey reach?", "answer": "Brynn", "steps": [ "Carey knows Hamilton.", "Hamilton knows Brynn." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Carey", "Calvin", "Hamilton", "Gloria", "Ira", "Alana", "Brynn", "Clement", "Harvey", "Frankie", "Jackson", "Regina", "Vivian", "Jeff", "Kurt", "Magdalena", "Nell", "Monroe", "Dolores", "Sarah" ], "edges": [ [ 0, 7 ], [ 0, 2 ], [ 1, 8 ], [ 2, 6 ], [ 6, 9 ], [ 7, 1 ], [ 8, 4 ], [ 9, 3 ], [ 9, 5 ], [ 10, 17 ], [ 10, 12 ], [ 11, 18 ], [ 12, 16 ], [ 16, 19 ], [ 17, 11 ], [ 18, 14 ], [ 19, 13 ], [ 19, 15 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Frankie knows Gertrude. Jodi knows Emily. Scott knows Austin. Yvette knows Greer. Austin knows Kim. Bob knows Eve. Lloyd knows Jerry. Jerry knows Chantal. Porter knows Bob. Frankie knows Tanya. Clay knows Lloyd. Eve knows Carmen. Clay knows Yvette. Kim knows Clay. Carmen knows Lionel. Tanya knows Porter. Bob knows Jodi. Scott knows Belinda. Which of Tanya and Austin can Scott reach?", "answer": "Austin", "steps": [ "Scott knows Austin." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Scott", "Kim", "Yvette", "Lloyd", "Chantal", "Belinda", "Jerry", "Greer", "Austin", "Clay", "Frankie", "Porter", "Jodi", "Eve", "Lionel", "Gertrude", "Carmen", "Emily", "Tanya", "Bob" ], "edges": [ [ 0, 5 ], [ 0, 8 ], [ 1, 9 ], [ 2, 7 ], [ 3, 6 ], [ 6, 4 ], [ 8, 1 ], [ 9, 3 ], [ 9, 2 ], [ 10, 15 ], [ 10, 18 ], [ 11, 19 ], [ 12, 17 ], [ 13, 16 ], [ 16, 14 ], [ 18, 11 ], [ 19, 13 ], [ 19, 12 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Leander knows Henry. Arthur knows India. Joseph knows Delilah. Lewis knows Daniel. Martin knows Leander. Alison knows Arthur. Kendra knows Joseph. Leander knows Susan. Lewis knows Gerard. Christian knows Kieran. Delilah knows Heath. Boyd knows Christian. Arthur knows Lewis. Susan knows Fabian. Daniel knows Boyd. Joseph knows Chloe. Boyd knows Walt. Susan knows Kendra. Which of Susan and Lewis can Alison reach?", "answer": "Lewis", "steps": [ "Alison knows Arthur.", "Arthur knows Lewis." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Alison", "India", "Gerard", "Arthur", "Daniel", "Kieran", "Lewis", "Christian", "Walt", "Boyd", "Martin", "Henry", "Fabian", "Leander", "Kendra", "Heath", "Susan", "Delilah", "Chloe", "Joseph" ], "edges": [ [ 0, 3 ], [ 3, 1 ], [ 3, 6 ], [ 4, 9 ], [ 6, 2 ], [ 6, 4 ], [ 7, 5 ], [ 9, 7 ], [ 9, 8 ], [ 10, 13 ], [ 13, 11 ], [ 13, 16 ], [ 14, 19 ], [ 16, 12 ], [ 16, 14 ], [ 17, 15 ], [ 19, 17 ], [ 19, 18 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Naomi knows Joyce. Dennis knows Rocco. Joyce knows Andre. Paul knows Eldon. Candice knows Milo. Sadie knows Fleur. Desmond knows Chester. Joyce knows Kent. Sadie knows Desmond. Clark knows Dennis. Rocco knows Sadie. Milo knows Naomi. Fleur knows Diego. Sadie knows Lionel. Lionel knows Yasmin. Kent knows Darren. Joyce knows Paul. Andre knows Holly. Which of Rocco and Naomi can Candice reach?", "answer": "Naomi", "steps": [ "Candice knows Milo.", "Milo knows Naomi." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Candice", "Naomi", "Darren", "Joyce", "Milo", "Kent", "Andre", "Eldon", "Holly", "Paul", "Clark", "Rocco", "Yasmin", "Sadie", "Dennis", "Lionel", "Desmond", "Diego", "Chester", "Fleur" ], "edges": [ [ 0, 4 ], [ 1, 3 ], [ 3, 5 ], [ 3, 6 ], [ 3, 9 ], [ 4, 1 ], [ 5, 2 ], [ 6, 8 ], [ 9, 7 ], [ 10, 14 ], [ 11, 13 ], [ 13, 15 ], [ 13, 16 ], [ 13, 19 ], [ 14, 11 ], [ 15, 12 ], [ 16, 18 ], [ 19, 17 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Mary knows Callum. Joanna knows Eve. Lane knows Anastasia. Lennox knows Gladys. Burt knows Karen. Cordelia knows Lennox. Anastasia knows Burt. Callum knows Hamilton. Joanna knows Antonio. Lennox knows Cristina. Anastasia knows Jeremiah. Karen knows Leander. Annie knows Lisa. Annie knows Guillermo. Karen knows Jewel. Callum knows Cordelia. Cristina knows Joanna. Leander knows Annie. Which of Anastasia and Callum can Mary reach?", "answer": "Callum", "steps": [ "Mary knows Callum." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Mary", "Lennox", "Antonio", "Eve", "Cristina", "Hamilton", "Joanna", "Gladys", "Cordelia", "Callum", "Lane", "Karen", "Lisa", "Guillermo", "Leander", "Jeremiah", "Annie", "Jewel", "Burt", "Anastasia" ], "edges": [ [ 0, 9 ], [ 1, 4 ], [ 1, 7 ], [ 4, 6 ], [ 6, 2 ], [ 6, 3 ], [ 8, 1 ], [ 9, 5 ], [ 9, 8 ], [ 10, 19 ], [ 11, 14 ], [ 11, 17 ], [ 14, 16 ], [ 16, 12 ], [ 16, 13 ], [ 18, 11 ], [ 19, 15 ], [ 19, 18 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "James knows Allen. Houston knows Garrett. James knows Brett. Robert knows Della. Wendy knows Houston. Gemma knows Phoebe. Houston knows Francesca. Darnell knows Spencer. Spencer knows Gemma. Gemma knows Quinn. Robert knows Martin. Darnell knows Claude. Robert knows James. Quinn knows Morgan. Gemma knows Jerry. Garrett knows Robert. Amelia knows Darnell. Quinn knows Jeremiah. Which of Darnell and Houston can Amelia reach?", "answer": "Darnell", "steps": [ "Amelia knows Darnell." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Amelia", "Claude", "Phoebe", "Spencer", "Jerry", "Darnell", "Quinn", "Gemma", "Morgan", "Jeremiah", "Wendy", "Francesca", "Della", "Garrett", "Martin", "Houston", "James", "Robert", "Allen", "Brett" ], "edges": [ [ 0, 5 ], [ 3, 7 ], [ 5, 1 ], [ 5, 3 ], [ 6, 8 ], [ 6, 9 ], [ 7, 2 ], [ 7, 4 ], [ 7, 6 ], [ 10, 15 ], [ 13, 17 ], [ 15, 11 ], [ 15, 13 ], [ 16, 18 ], [ 16, 19 ], [ 17, 12 ], [ 17, 14 ], [ 17, 16 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Luther knows Jim. Jessie knows Julius. Norma knows Clay. Jasper knows Mae. Jim knows Virginia. Zoe knows Evan. Dakota knows Zach. Clay knows Fisher. Julius knows Dexter. Dakota knows Zoe. Mae knows Dakota. Virginia knows Brooke. Fisher knows Garland. Brooke knows Jessie. Daisy knows Luther. Rowan knows Daisy. Luther knows Hope. Evan knows Norma. Which of Julius and Fisher can Rowan reach?", "answer": "Julius", "steps": [ "Rowan knows Daisy.", "Daisy knows Luther.", "Luther knows Jim.", "Jim knows Virginia.", "Virginia knows Brooke.", "Brooke knows Jessie.", "Jessie knows Julius." ], "difficulty": 7, "original_distance": 8, "idx_to_symbol": [ "Rowan", "Jessie", "Julius", "Brooke", "Jim", "Dexter", "Luther", "Virginia", "Daisy", "Hope", "Jasper", "Clay", "Fisher", "Norma", "Zoe", "Garland", "Dakota", "Evan", "Mae", "Zach" ], "edges": [ [ 0, 8 ], [ 1, 2 ], [ 2, 5 ], [ 3, 1 ], [ 4, 7 ], [ 6, 4 ], [ 6, 9 ], [ 7, 3 ], [ 8, 6 ], [ 10, 18 ], [ 11, 12 ], [ 12, 15 ], [ 13, 11 ], [ 14, 17 ], [ 16, 14 ], [ 16, 19 ], [ 17, 13 ], [ 18, 16 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Nora knows Roman. Bruce knows Dick. Louisa knows Jewel. Dick knows Leah. Beverly knows Gene. Michael knows Boris. Jewel knows Wilson. Michael knows Bruce. Glen knows Beverly. Vera knows Glen. Bruce knows Nora. Aspen knows Willard. Vera knows Kara. Glen knows Eugenia. Eugenia knows Benjamin. Eugenia knows Louisa. Dawn knows Aspen. Dick knows Dawn. Which of Glen and Bruce can Vera reach?", "answer": "Glen", "steps": [ "Vera knows Glen." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Vera", "Glen", "Jewel", "Eugenia", "Beverly", "Kara", "Benjamin", "Gene", "Wilson", "Louisa", "Michael", "Bruce", "Aspen", "Dick", "Nora", "Boris", "Leah", "Roman", "Willard", "Dawn" ], "edges": [ [ 0, 5 ], [ 0, 1 ], [ 1, 4 ], [ 1, 3 ], [ 2, 8 ], [ 3, 6 ], [ 3, 9 ], [ 4, 7 ], [ 9, 2 ], [ 10, 15 ], [ 10, 11 ], [ 11, 14 ], [ 11, 13 ], [ 12, 18 ], [ 13, 16 ], [ 13, 19 ], [ 14, 17 ], [ 19, 12 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Jakob knows Wilma. Darren knows Marcia. Foster knows Yara. Julio knows Jakob. Elvis knows Dora. Ruth knows Darren. Julius knows Enrique. Abel knows Ingrid. Elvis knows Abel. Darren knows Elvis. Bernadette knows Ruth. Blaine knows Bernadette. Jeremiah knows Julius. Dora knows Jolene. Yara knows Jeremiah. Julio knows Glenn. Julius knows Julio. Glenn knows Clement. Which of Wilma and Ingrid can Foster reach?", "answer": "Wilma", "steps": [ "Foster knows Yara.", "Yara knows Jeremiah.", "Jeremiah knows Julius.", "Julius knows Julio.", "Julio knows Jakob.", "Jakob knows Wilma." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Foster", "Wilma", "Enrique", "Jakob", "Clement", "Julio", "Glenn", "Yara", "Jeremiah", "Julius", "Blaine", "Ingrid", "Marcia", "Abel", "Jolene", "Elvis", "Dora", "Bernadette", "Ruth", "Darren" ], "edges": [ [ 0, 7 ], [ 3, 1 ], [ 5, 3 ], [ 5, 6 ], [ 6, 4 ], [ 7, 8 ], [ 8, 9 ], [ 9, 2 ], [ 9, 5 ], [ 10, 17 ], [ 13, 11 ], [ 15, 13 ], [ 15, 16 ], [ 16, 14 ], [ 17, 18 ], [ 18, 19 ], [ 19, 12 ], [ 19, 15 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Nathan knows Noel. Judy knows Karl. Adam knows Holden. Abigail knows Hope. Karl knows Rick. Nathan knows Madeline. Brynn knows Michelle. Raymond knows Anthony. Judy knows Abigail. Anthony knows Harry. Karl knows Connor. Nathan knows Darius. Adam knows Enid. Karl knows Colin. Harry knows Nathan. Harry knows Brynn. Raymond knows Emmett. Enid knows Judy. Which of Enid and Anthony can Adam reach?", "answer": "Enid", "steps": [ "Adam knows Enid." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Adam", "Abigail", "Colin", "Judy", "Connor", "Karl", "Rick", "Holden", "Hope", "Enid", "Raymond", "Brynn", "Darius", "Harry", "Madeline", "Nathan", "Noel", "Emmett", "Michelle", "Anthony" ], "edges": [ [ 0, 7 ], [ 0, 9 ], [ 1, 8 ], [ 3, 5 ], [ 3, 1 ], [ 5, 2 ], [ 5, 4 ], [ 5, 6 ], [ 9, 3 ], [ 10, 17 ], [ 10, 19 ], [ 11, 18 ], [ 13, 15 ], [ 13, 11 ], [ 15, 12 ], [ 15, 14 ], [ 15, 16 ], [ 19, 13 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Inez knows Yolanda. Demetrius knows Eve. Demetrius knows Linda. Latoya knows Graeme. Linda knows Crystal. Matthew knows Annie. Penny knows Jarvis. Linda knows Laura. Maya knows Penny. Annie knows Jeffery. Yolanda knows Erma. Leticia knows Kylie. Eve knows Leticia. Penny knows Julian. Wilbur knows Latoya. Laura knows Inez. Jarvis knows Matthew. Maya knows Wilbur. Which of Inez and Matthew can Maya reach?", "answer": "Matthew", "steps": [ "Maya knows Penny.", "Penny knows Jarvis.", "Jarvis knows Matthew." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Maya", "Jarvis", "Wilbur", "Matthew", "Penny", "Jeffery", "Annie", "Graeme", "Julian", "Latoya", "Demetrius", "Laura", "Eve", "Inez", "Linda", "Erma", "Yolanda", "Kylie", "Crystal", "Leticia" ], "edges": [ [ 0, 4 ], [ 0, 2 ], [ 1, 3 ], [ 2, 9 ], [ 3, 6 ], [ 4, 1 ], [ 4, 8 ], [ 6, 5 ], [ 9, 7 ], [ 10, 14 ], [ 10, 12 ], [ 11, 13 ], [ 12, 19 ], [ 13, 16 ], [ 14, 11 ], [ 14, 18 ], [ 16, 15 ], [ 19, 17 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Kelsey knows Kristin. Gwen knows Christian. Ted knows Kelsey. Stacy knows Donovan. Christian knows Larissa. Veronica knows Knox. Jude knows Stacy. Bruno knows Maya. Stacy knows Ted. Julius knows Bruno. Chance knows Dick. Larissa knows Greta. Kristin knows Veronica. Stacy knows Chance. Greta knows Fiona. Wanda knows Julius. Julius knows Gwen. Julius knows Hardy. Which of Gwen and Ted can Wanda reach?", "answer": "Gwen", "steps": [ "Wanda knows Julius.", "Julius knows Gwen." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Wanda", "Fiona", "Greta", "Maya", "Hardy", "Julius", "Gwen", "Larissa", "Christian", "Bruno", "Jude", "Knox", "Veronica", "Dick", "Donovan", "Stacy", "Ted", "Kristin", "Kelsey", "Chance" ], "edges": [ [ 0, 5 ], [ 2, 1 ], [ 5, 4 ], [ 5, 6 ], [ 5, 9 ], [ 6, 8 ], [ 7, 2 ], [ 8, 7 ], [ 9, 3 ], [ 10, 15 ], [ 12, 11 ], [ 15, 14 ], [ 15, 16 ], [ 15, 19 ], [ 16, 18 ], [ 17, 12 ], [ 18, 17 ], [ 19, 13 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Tony knows Kamila. Kamila knows Lamar. Brynn knows Zach. Ralph knows Edison. Sybil knows Joanna. Olive knows Tony. Kamila knows Wayne. Zach knows Cliff. Dalton knows Carrie. Edison knows Mae. Zach knows Dalton. Pam knows Gloria. Mae knows Brynn. Arlene knows Olive. Jason knows Pam. Lamar knows Jason. Fabian knows Arlene. Carrie knows Sybil. Which of Tony and Brynn can Ralph reach?", "answer": "Brynn", "steps": [ "Ralph knows Edison.", "Edison knows Mae.", "Mae knows Brynn." ], "difficulty": 3, "original_distance": 8, "idx_to_symbol": [ "Ralph", "Joanna", "Zach", "Cliff", "Sybil", "Mae", "Carrie", "Dalton", "Brynn", "Edison", "Fabian", "Gloria", "Kamila", "Wayne", "Pam", "Olive", "Jason", "Lamar", "Tony", "Arlene" ], "edges": [ [ 0, 9 ], [ 2, 3 ], [ 2, 7 ], [ 4, 1 ], [ 5, 8 ], [ 6, 4 ], [ 7, 6 ], [ 8, 2 ], [ 9, 5 ], [ 10, 19 ], [ 12, 13 ], [ 12, 17 ], [ 14, 11 ], [ 15, 18 ], [ 16, 14 ], [ 17, 16 ], [ 18, 12 ], [ 19, 15 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Dean knows Geneva. Grant knows Tanya. Destiny knows Alyson. Annie knows Dustin. Tanya knows Ford. Paula knows Rachel. Randy knows Delilah. Destiny knows Melody. Ford knows Paul. Dina knows Grant. Luis knows Annie. Rachel knows Randy. Dina knows Gregory. Randy knows Christopher. Ford knows Norma. Annie knows Paula. Melody knows Dina. Dean knows Luis. Which of Paula and Grant can Destiny reach?", "answer": "Grant", "steps": [ "Destiny knows Melody.", "Melody knows Dina.", "Dina knows Grant." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Destiny", "Ford", "Melody", "Gregory", "Norma", "Paul", "Grant", "Dina", "Alyson", "Tanya", "Dean", "Randy", "Luis", "Dustin", "Delilah", "Christopher", "Paula", "Annie", "Geneva", "Rachel" ], "edges": [ [ 0, 8 ], [ 0, 2 ], [ 1, 4 ], [ 1, 5 ], [ 2, 7 ], [ 6, 9 ], [ 7, 3 ], [ 7, 6 ], [ 9, 1 ], [ 10, 18 ], [ 10, 12 ], [ 11, 14 ], [ 11, 15 ], [ 12, 17 ], [ 16, 19 ], [ 17, 13 ], [ 17, 16 ], [ 19, 11 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Estella knows James. Cain knows Corey. Percy knows Hugh. Irving knows Maureen. Cody knows Melissa. Lara knows Patricia. Yvette knows Irving. Maureen knows Cole. Lara knows Percy. Irving knows Forrest. Maureen knows Estella. Percy knows Karl. Hugh knows Cody. Luz knows Lara. Melissa knows Karina. Maureen knows Hazel. Percy knows Dante. James knows Cain. Which of Corey and Karina can Luz reach?", "answer": "Karina", "steps": [ "Luz knows Lara.", "Lara knows Percy.", "Percy knows Hugh.", "Hugh knows Cody.", "Cody knows Melissa.", "Melissa knows Karina." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Luz", "Hugh", "Lara", "Cody", "Melissa", "Patricia", "Percy", "Karl", "Dante", "Karina", "Yvette", "Estella", "Irving", "James", "Cain", "Forrest", "Maureen", "Cole", "Hazel", "Corey" ], "edges": [ [ 0, 2 ], [ 1, 3 ], [ 2, 5 ], [ 2, 6 ], [ 3, 4 ], [ 4, 9 ], [ 6, 7 ], [ 6, 8 ], [ 6, 1 ], [ 10, 12 ], [ 11, 13 ], [ 12, 15 ], [ 12, 16 ], [ 13, 14 ], [ 14, 19 ], [ 16, 17 ], [ 16, 18 ], [ 16, 11 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Harris knows Jon. Lark knows Ian. Sharon knows Kelly. Phoebe knows Valerie. Mark knows Drake. Phoebe knows Lark. Lola knows Sharon. Andre knows Damien. Kelly knows Lyric. Jon knows Anastasia. Lola knows Mark. Jon knows Boyd. Lark knows Julie. Andre knows Eloise. Ian knows Winston. Julie knows Andre. Sharon knows Harris. Valerie knows Wayne. Which of Harris and Julie can Phoebe reach?", "answer": "Julie", "steps": [ "Phoebe knows Lark.", "Lark knows Julie." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Phoebe", "Wayne", "Lark", "Ian", "Winston", "Eloise", "Julie", "Damien", "Valerie", "Andre", "Lola", "Drake", "Sharon", "Kelly", "Lyric", "Boyd", "Harris", "Anastasia", "Mark", "Jon" ], "edges": [ [ 0, 8 ], [ 0, 2 ], [ 2, 3 ], [ 2, 6 ], [ 3, 4 ], [ 6, 9 ], [ 8, 1 ], [ 9, 5 ], [ 9, 7 ], [ 10, 18 ], [ 10, 12 ], [ 12, 13 ], [ 12, 16 ], [ 13, 14 ], [ 16, 19 ], [ 18, 11 ], [ 19, 15 ], [ 19, 17 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Angelica knows Judy. Howard knows Elton. Langston knows Simon. Dick knows Emery. Taylor knows Howard. Monroe knows Angelica. Judy knows Imogen. Howard knows Darwin. Dick knows Neal. Simon knows June. Dick knows Pablo. Warren knows Leah. Emery knows Warren. Imogen knows Tonya. Monroe knows Taylor. Neal knows Langston. Warren knows Laurel. Monroe knows Tina. Which of Imogen and Simon can Dick reach?", "answer": "Simon", "steps": [ "Dick knows Neal.", "Neal knows Langston.", "Langston knows Simon." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Dick", "Neal", "Laurel", "Emery", "June", "Langston", "Leah", "Simon", "Warren", "Pablo", "Monroe", "Angelica", "Darwin", "Taylor", "Tonya", "Judy", "Elton", "Imogen", "Howard", "Tina" ], "edges": [ [ 0, 1 ], [ 0, 3 ], [ 0, 9 ], [ 1, 5 ], [ 3, 8 ], [ 5, 7 ], [ 7, 4 ], [ 8, 2 ], [ 8, 6 ], [ 10, 11 ], [ 10, 13 ], [ 10, 19 ], [ 11, 15 ], [ 13, 18 ], [ 15, 17 ], [ 17, 14 ], [ 18, 12 ], [ 18, 16 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Jenna knows Teresa. Brittany knows Daisy. Lucia knows Brittany. Brittany knows Alice. Brittany knows Hamilton. Hampton knows Mike. Teresa knows Kaleb. Teresa knows Drew. Brittany knows Jeremiah. Kaleb knows Ernesto. Kaleb knows Angela. Raquel knows Wendy. Teresa knows Ariel. Hamilton knows Raquel. Teresa knows Hampton. Mike knows Cornelius. Alice knows Blanche. Alice knows Karen. Which of Mike and Raquel can Jenna reach?", "answer": "Mike", "steps": [ "Jenna knows Teresa.", "Teresa knows Hampton.", "Hampton knows Mike." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Jenna", "Ariel", "Ernesto", "Hampton", "Drew", "Cornelius", "Angela", "Mike", "Teresa", "Kaleb", "Lucia", "Jeremiah", "Karen", "Hamilton", "Daisy", "Wendy", "Blanche", "Raquel", "Brittany", "Alice" ], "edges": [ [ 0, 8 ], [ 3, 7 ], [ 7, 5 ], [ 8, 1 ], [ 8, 4 ], [ 8, 3 ], [ 8, 9 ], [ 9, 2 ], [ 9, 6 ], [ 10, 18 ], [ 13, 17 ], [ 17, 15 ], [ 18, 11 ], [ 18, 14 ], [ 18, 13 ], [ 18, 19 ], [ 19, 12 ], [ 19, 16 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Arturo knows Herbert. Randy knows Ray. Mark knows Arturo. Herbert knows Oliver. Madeline knows Kim. Vivian knows Harry. Herbert knows Arnold. Randy knows Deanna. Eden knows Anna. Deanna knows Madeline. Arturo knows Isaac. Anna knows Isabel. Vivian knows Zane. Zane knows Courtney. Madeline knows Vivian. Eden knows Mark. Oliver knows Clement. Ray knows Paula. Which of Oliver and Zane can Randy reach?", "answer": "Zane", "steps": [ "Randy knows Deanna.", "Deanna knows Madeline.", "Madeline knows Vivian.", "Vivian knows Zane." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Randy", "Harry", "Ray", "Paula", "Deanna", "Courtney", "Zane", "Madeline", "Vivian", "Kim", "Eden", "Arnold", "Anna", "Isabel", "Mark", "Clement", "Oliver", "Arturo", "Herbert", "Isaac" ], "edges": [ [ 0, 2 ], [ 0, 4 ], [ 2, 3 ], [ 4, 7 ], [ 6, 5 ], [ 7, 8 ], [ 7, 9 ], [ 8, 1 ], [ 8, 6 ], [ 10, 12 ], [ 10, 14 ], [ 12, 13 ], [ 14, 17 ], [ 16, 15 ], [ 17, 18 ], [ 17, 19 ], [ 18, 11 ], [ 18, 16 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Emery knows Megan. Elvis knows Dayton. Lyric knows Jon. Nadine knows Lyric. Kerry knows Ainsley. Callum knows Nadine. Judith knows Carter. Lyric knows Andre. Elvis knows Leroy. Elvis knows Kerry. Megan knows Nelson. Andre knows Keira. Callum knows Bridget. Dayton knows Alex. Bridget knows Yolanda. Leroy knows Emery. Callum knows Judith. Emery knows Grover. Which of Andre and Megan can Elvis reach?", "answer": "Megan", "steps": [ "Elvis knows Leroy.", "Leroy knows Emery.", "Emery knows Megan." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Elvis", "Leroy", "Grover", "Kerry", "Emery", "Dayton", "Nelson", "Ainsley", "Megan", "Alex", "Callum", "Nadine", "Jon", "Bridget", "Lyric", "Judith", "Keira", "Yolanda", "Andre", "Carter" ], "edges": [ [ 0, 3 ], [ 0, 1 ], [ 0, 5 ], [ 1, 4 ], [ 3, 7 ], [ 4, 2 ], [ 4, 8 ], [ 5, 9 ], [ 8, 6 ], [ 10, 13 ], [ 10, 11 ], [ 10, 15 ], [ 11, 14 ], [ 13, 17 ], [ 14, 12 ], [ 14, 18 ], [ 15, 19 ], [ 18, 16 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Judith knows Lillian. Kendra knows Dora. Dudley knows Judith. Darcy knows Hector. Lance knows Kendra. Declan knows Jem. Ford knows Giselle. Chelsea knows Ford. Mike knows Kim. Kendra knows Chelsea. Kim knows Lance. Russell knows Mike. Declan knows Dudley. Jon knows Darcy. Kim knows Patricia. Judith knows Jon. Paula knows Elias. Elias knows Declan. Which of Darcy and Ford can Russell reach?", "answer": "Ford", "steps": [ "Russell knows Mike.", "Mike knows Kim.", "Kim knows Lance.", "Lance knows Kendra.", "Kendra knows Chelsea.", "Chelsea knows Ford." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Russell", "Lance", "Kendra", "Ford", "Patricia", "Dora", "Mike", "Kim", "Giselle", "Chelsea", "Paula", "Dudley", "Judith", "Darcy", "Jem", "Lillian", "Elias", "Declan", "Hector", "Jon" ], "edges": [ [ 0, 6 ], [ 1, 2 ], [ 2, 5 ], [ 2, 9 ], [ 3, 8 ], [ 6, 7 ], [ 7, 4 ], [ 7, 1 ], [ 9, 3 ], [ 10, 16 ], [ 11, 12 ], [ 12, 15 ], [ 12, 19 ], [ 13, 18 ], [ 16, 17 ], [ 17, 14 ], [ 17, 11 ], [ 19, 13 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Delia knows Dylan. Megan knows Denise. Sharon knows Nadine. Nadine knows Myrtle. Denise knows Herbert. Sharon knows Edward. Edward knows Cesar. Matt knows Alyssa. Denise knows Matt. Edward knows Carter. Dylan knows Hope. Flora knows Darius. Megan knows Delia. Myrtle knows Zack. Alyssa knows Hayley. Cesar knows Flora. Lois knows Megan. Parker knows Sharon. Which of Sharon and Megan can Parker reach?", "answer": "Sharon", "steps": [ "Parker knows Sharon." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Parker", "Sharon", "Carter", "Edward", "Darius", "Cesar", "Nadine", "Flora", "Zack", "Myrtle", "Lois", "Megan", "Herbert", "Denise", "Hayley", "Matt", "Delia", "Alyssa", "Hope", "Dylan" ], "edges": [ [ 0, 1 ], [ 1, 3 ], [ 1, 6 ], [ 3, 2 ], [ 3, 5 ], [ 5, 7 ], [ 6, 9 ], [ 7, 4 ], [ 9, 8 ], [ 10, 11 ], [ 11, 13 ], [ 11, 16 ], [ 13, 12 ], [ 13, 15 ], [ 15, 17 ], [ 16, 19 ], [ 17, 14 ], [ 19, 18 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Jeff knows Harrison. Deirdre knows Camille. Joanna knows Marvin. Fergus knows Virginia. Molly knows Melody. Dayton knows Jennifer. Jonathan knows Dayton. Molly knows Dina. Joanna knows Molly. Patrick knows Naomi. Melody knows Ainsley. Naomi knows Pablo. Jeff knows Fergus. Corey knows Deirdre. Molly knows Patrick. Ainsley knows Tina. Fergus knows Corey. Fergus knows Jonathan. Which of Camille and Tina can Jeff reach?", "answer": "Camille", "steps": [ "Jeff knows Fergus.", "Fergus knows Corey.", "Corey knows Deirdre.", "Deirdre knows Camille." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Jeff", "Corey", "Virginia", "Jennifer", "Deirdre", "Camille", "Harrison", "Jonathan", "Fergus", "Dayton", "Joanna", "Melody", "Dina", "Pablo", "Ainsley", "Tina", "Marvin", "Patrick", "Molly", "Naomi" ], "edges": [ [ 0, 6 ], [ 0, 8 ], [ 1, 4 ], [ 4, 5 ], [ 7, 9 ], [ 8, 2 ], [ 8, 1 ], [ 8, 7 ], [ 9, 3 ], [ 10, 16 ], [ 10, 18 ], [ 11, 14 ], [ 14, 15 ], [ 17, 19 ], [ 18, 12 ], [ 18, 11 ], [ 18, 17 ], [ 19, 13 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Joyce knows Sara. Harris knows Wendell. Bernard knows Marion. Donna knows Merle. Harris knows Ray. Wendell knows Estella. Leonard knows Lorraine. Geoffrey knows Jerry. Harris knows Floyd. Merle knows Geoffrey. Ray knows Fabian. Merle knows Joyce. Fabian knows Marilyn. Floyd knows Derek. Bernard knows Harris. Lorraine knows Israel. Donna knows Beau. Merle knows Leonard. Which of Lorraine and Fabian can Donna reach?", "answer": "Lorraine", "steps": [ "Donna knows Merle.", "Merle knows Leonard.", "Leonard knows Lorraine." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Donna", "Geoffrey", "Sara", "Beau", "Jerry", "Leonard", "Israel", "Lorraine", "Merle", "Joyce", "Bernard", "Floyd", "Estella", "Marion", "Derek", "Ray", "Marilyn", "Fabian", "Harris", "Wendell" ], "edges": [ [ 0, 3 ], [ 0, 8 ], [ 1, 4 ], [ 5, 7 ], [ 7, 6 ], [ 8, 1 ], [ 8, 5 ], [ 8, 9 ], [ 9, 2 ], [ 10, 13 ], [ 10, 18 ], [ 11, 14 ], [ 15, 17 ], [ 17, 16 ], [ 18, 11 ], [ 18, 15 ], [ 18, 19 ], [ 19, 12 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Jim knows Ronald. Elsa knows Jeff. Carmela knows Thomas. Anastasia knows Tara. Jeff knows Olivia. Scott knows Cyrus. Anastasia knows Amanda. Lawson knows Fabian. Jeff knows Scott. Michael knows Luke. Jeff knows Carmela. Amanda knows Enid. Carmela knows Louise. Isla knows Jim. Amanda knows Chase. Ronald knows Anastasia. Anastasia knows Michael. Fabian knows Elsa. Which of Anastasia and Jeff can Lawson reach?", "answer": "Jeff", "steps": [ "Lawson knows Fabian.", "Fabian knows Elsa.", "Elsa knows Jeff." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Lawson", "Elsa", "Thomas", "Fabian", "Jeff", "Cyrus", "Louise", "Carmela", "Scott", "Olivia", "Isla", "Ronald", "Chase", "Jim", "Anastasia", "Luke", "Enid", "Amanda", "Michael", "Tara" ], "edges": [ [ 0, 3 ], [ 1, 4 ], [ 3, 1 ], [ 4, 7 ], [ 4, 8 ], [ 4, 9 ], [ 7, 2 ], [ 7, 6 ], [ 8, 5 ], [ 10, 13 ], [ 11, 14 ], [ 13, 11 ], [ 14, 17 ], [ 14, 18 ], [ 14, 19 ], [ 17, 12 ], [ 17, 16 ], [ 18, 15 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Joy knows Nora. Elizabeth knows Isiah. Gabriel knows Desmond. Joshua knows Jonas. Norma knows Gabriel. Gabriel knows Mitchell. Eugene knows Lenora. Eugene knows Elizabeth. Yolanda knows Noel. Lenora knows Joshua. Desmond knows Dakota. Eugene knows Jon. Eugene knows Yolanda. Nicole knows Lamont. Vance knows Eugene. Gabriel knows Elaine. Elaine knows Nicole. Gabriel knows Joy. Which of Gabriel and Eugene can Norma reach?", "answer": "Gabriel", "steps": [ "Norma knows Gabriel." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Norma", "Dakota", "Joy", "Lamont", "Elaine", "Mitchell", "Desmond", "Gabriel", "Nicole", "Nora", "Vance", "Noel", "Elizabeth", "Jonas", "Lenora", "Jon", "Yolanda", "Eugene", "Joshua", "Isiah" ], "edges": [ [ 0, 7 ], [ 2, 9 ], [ 4, 8 ], [ 6, 1 ], [ 7, 5 ], [ 7, 6 ], [ 7, 4 ], [ 7, 2 ], [ 8, 3 ], [ 10, 17 ], [ 12, 19 ], [ 14, 18 ], [ 16, 11 ], [ 17, 15 ], [ 17, 16 ], [ 17, 14 ], [ 17, 12 ], [ 18, 13 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Joel knows Nadine. Hubert knows Wayne. Deirdre knows Jill. Darius knows Joseph. Wayne knows Darius. Nadine knows Tracy. Darius knows Julius. Jill knows Omar. Deirdre knows Dale. Ronald knows Colin. Colin knows Lisette. Justin knows Ronald. Omar knows Maude. Tracy knows Riley. Deirdre knows Justin. Joel knows Aspen. Joel knows Hubert. Colin knows Dallas. Which of Hubert and Justin can Joel reach?", "answer": "Hubert", "steps": [ "Joel knows Hubert." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Joel", "Aspen", "Hubert", "Nadine", "Tracy", "Riley", "Julius", "Darius", "Joseph", "Wayne", "Deirdre", "Dale", "Justin", "Jill", "Omar", "Maude", "Lisette", "Colin", "Dallas", "Ronald" ], "edges": [ [ 0, 1 ], [ 0, 3 ], [ 0, 2 ], [ 2, 9 ], [ 3, 4 ], [ 4, 5 ], [ 7, 6 ], [ 7, 8 ], [ 9, 7 ], [ 10, 11 ], [ 10, 13 ], [ 10, 12 ], [ 12, 19 ], [ 13, 14 ], [ 14, 15 ], [ 17, 16 ], [ 17, 18 ], [ 19, 17 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Stuart knows Ryan. Clark knows Colby. Adam knows Jarvis. Stuart knows Herbert. Rosemary knows Jameson. Zane knows Stuart. Zane knows Ian. Felix knows Adam. Jarvis knows Irene. Irene knows Clark. Zane knows Alyssa. Ryan knows Oscar. Colby knows Clay. Jarvis knows Damian. Jameson knows Zane. Jarvis knows Simon. Oscar knows Livia. Irene knows Alison. Which of Adam and Jameson can Felix reach?", "answer": "Adam", "steps": [ "Felix knows Adam." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Felix", "Colby", "Simon", "Clark", "Alison", "Adam", "Irene", "Damian", "Clay", "Jarvis", "Rosemary", "Oscar", "Ian", "Ryan", "Herbert", "Jameson", "Stuart", "Alyssa", "Livia", "Zane" ], "edges": [ [ 0, 5 ], [ 1, 8 ], [ 3, 1 ], [ 5, 9 ], [ 6, 4 ], [ 6, 3 ], [ 9, 2 ], [ 9, 7 ], [ 9, 6 ], [ 10, 15 ], [ 11, 18 ], [ 13, 11 ], [ 15, 19 ], [ 16, 14 ], [ 16, 13 ], [ 19, 12 ], [ 19, 17 ], [ 19, 16 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Naomi knows Joyce. Dennis knows Rocco. Joyce knows Andre. Paul knows Eldon. Candice knows Milo. Sadie knows Fleur. Desmond knows Chester. Joyce knows Kent. Sadie knows Desmond. Clark knows Dennis. Rocco knows Sadie. Milo knows Naomi. Fleur knows Diego. Sadie knows Lionel. Lionel knows Yasmin. Kent knows Darren. Joyce knows Paul. Andre knows Holly. Which of Yasmin and Darren can Candice reach?", "answer": "Darren", "steps": [ "Candice knows Milo.", "Milo knows Naomi.", "Naomi knows Joyce.", "Joyce knows Kent.", "Kent knows Darren." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Candice", "Naomi", "Darren", "Joyce", "Milo", "Kent", "Andre", "Eldon", "Holly", "Paul", "Clark", "Rocco", "Yasmin", "Sadie", "Dennis", "Lionel", "Desmond", "Diego", "Chester", "Fleur" ], "edges": [ [ 0, 4 ], [ 1, 3 ], [ 3, 5 ], [ 3, 6 ], [ 3, 9 ], [ 4, 1 ], [ 5, 2 ], [ 6, 8 ], [ 9, 7 ], [ 10, 14 ], [ 11, 13 ], [ 13, 15 ], [ 13, 16 ], [ 13, 19 ], [ 14, 11 ], [ 15, 12 ], [ 16, 18 ], [ 19, 17 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Lorenzo knows Wilma. Sheryl knows Phoebe. Aubrey knows Alvin. Alyssa knows Celia. Wilma knows Irene. Chandler knows Ezra. Phoebe knows Zara. Ida knows Nelson. Alvin knows Ida. Agnes knows Lorenzo. Dirk knows Kai. Ezra knows Sheryl. Nelson knows Agnes. Adele knows Chandler. Etta knows Winston. Sheryl knows Dirk. Nelson knows Alyssa. Zara knows Etta. Which of Ezra and Ida can Aubrey reach?", "answer": "Ida", "steps": [ "Aubrey knows Alvin.", "Alvin knows Ida." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Aubrey", "Nelson", "Wilma", "Lorenzo", "Irene", "Alvin", "Alyssa", "Celia", "Agnes", "Ida", "Adele", "Sheryl", "Etta", "Zara", "Winston", "Chandler", "Dirk", "Kai", "Phoebe", "Ezra" ], "edges": [ [ 0, 5 ], [ 1, 6 ], [ 1, 8 ], [ 2, 4 ], [ 3, 2 ], [ 5, 9 ], [ 6, 7 ], [ 8, 3 ], [ 9, 1 ], [ 10, 15 ], [ 11, 16 ], [ 11, 18 ], [ 12, 14 ], [ 13, 12 ], [ 15, 19 ], [ 16, 17 ], [ 18, 13 ], [ 19, 11 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Josie knows Matt. Darrell knows Clark. Erma knows Kira. Gary knows Dorothy. Jem knows Gary. Harmony knows Josie. Dorothy knows Kristina. Harriet knows Norman. Clark knows Malcolm. Harmony knows Louisa. Matt knows Erma. Norman knows Dorian. Harriet knows Riley. Dorothy knows Vance. Vance knows Darrell. Dorian knows Harmony. Harlan knows Jem. Harlan knows Kelly. Which of Darrell and Matt can Harlan reach?", "answer": "Darrell", "steps": [ "Harlan knows Jem.", "Jem knows Gary.", "Gary knows Dorothy.", "Dorothy knows Vance.", "Vance knows Darrell." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Harlan", "Clark", "Kelly", "Gary", "Jem", "Vance", "Dorothy", "Malcolm", "Kristina", "Darrell", "Harriet", "Erma", "Riley", "Dorian", "Norman", "Josie", "Harmony", "Kira", "Louisa", "Matt" ], "edges": [ [ 0, 2 ], [ 0, 4 ], [ 1, 7 ], [ 3, 6 ], [ 4, 3 ], [ 5, 9 ], [ 6, 8 ], [ 6, 5 ], [ 9, 1 ], [ 10, 12 ], [ 10, 14 ], [ 11, 17 ], [ 13, 16 ], [ 14, 13 ], [ 15, 19 ], [ 16, 18 ], [ 16, 15 ], [ 19, 11 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Maude knows Amelia. Will knows Louisa. Abby knows Gerald. Valerie knows Charles. Cain knows Florence. Ezra knows Elsa. Lars knows Will. Ingrid knows Jolena. Pat knows Cain. Maude knows Abby. Louisa knows Julius. Abby knows Ingrid. Abby knows Lawson. Celeste knows Luz. Lawson knows Pat. Celeste knows Ezra. Celeste knows Lars. Valerie knows Celeste. Which of Abby and Celeste can Valerie reach?", "answer": "Celeste", "steps": [ "Valerie knows Celeste." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Valerie", "Lars", "Julius", "Luz", "Elsa", "Charles", "Will", "Louisa", "Ezra", "Celeste", "Maude", "Lawson", "Florence", "Gerald", "Jolena", "Amelia", "Pat", "Cain", "Ingrid", "Abby" ], "edges": [ [ 0, 5 ], [ 0, 9 ], [ 1, 6 ], [ 6, 7 ], [ 7, 2 ], [ 8, 4 ], [ 9, 3 ], [ 9, 1 ], [ 9, 8 ], [ 10, 15 ], [ 10, 19 ], [ 11, 16 ], [ 16, 17 ], [ 17, 12 ], [ 18, 14 ], [ 19, 13 ], [ 19, 11 ], [ 19, 18 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Clarence knows Sam. Ibrahim knows Alfred. Devon knows Fleur. Joy knows Corey. Corey knows Boris. Langston knows Ingrid. Boris knows Dexter. Trina knows Joy. James knows Ibrahim. Corey knows Devon. Joy knows Lisette. Kimberly knows Spencer. Gavin knows Trina. Dexter knows Virgil. Ibrahim knows Kimberly. Sam knows James. James knows Gus. Alfred knows Langston. Which of Trina and Sam can Clarence reach?", "answer": "Sam", "steps": [ "Clarence knows Sam." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Clarence", "James", "Alfred", "Ingrid", "Sam", "Gus", "Kimberly", "Langston", "Ibrahim", "Spencer", "Gavin", "Joy", "Boris", "Virgil", "Trina", "Lisette", "Devon", "Dexter", "Corey", "Fleur" ], "edges": [ [ 0, 4 ], [ 1, 5 ], [ 1, 8 ], [ 2, 7 ], [ 4, 1 ], [ 6, 9 ], [ 7, 3 ], [ 8, 2 ], [ 8, 6 ], [ 10, 14 ], [ 11, 15 ], [ 11, 18 ], [ 12, 17 ], [ 14, 11 ], [ 16, 19 ], [ 17, 13 ], [ 18, 12 ], [ 18, 16 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Monica knows Malcolm. Kristina knows Ebony. Jackson knows Logan. Lance knows Matt. Matt knows Brooks. Ebony knows Geneva. Jacob knows Jackson. Brad knows Rena. Lance knows Kristina. Dane knows Nadine. Logan knows Monica. Brad knows Dane. Pearl knows Mindy. Jacob knows Enrique. Rena knows Jacob. Ebony knows Virgil. Virgil knows Alyson. Alyson knows Pearl. Which of Monica and Pearl can Lance reach?", "answer": "Pearl", "steps": [ "Lance knows Kristina.", "Kristina knows Ebony.", "Ebony knows Virgil.", "Virgil knows Alyson.", "Alyson knows Pearl." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Lance", "Alyson", "Brooks", "Mindy", "Matt", "Kristina", "Virgil", "Pearl", "Ebony", "Geneva", "Brad", "Logan", "Nadine", "Malcolm", "Dane", "Rena", "Jackson", "Monica", "Jacob", "Enrique" ], "edges": [ [ 0, 4 ], [ 0, 5 ], [ 1, 7 ], [ 4, 2 ], [ 5, 8 ], [ 6, 1 ], [ 7, 3 ], [ 8, 6 ], [ 8, 9 ], [ 10, 14 ], [ 10, 15 ], [ 11, 17 ], [ 14, 12 ], [ 15, 18 ], [ 16, 11 ], [ 17, 13 ], [ 18, 16 ], [ 18, 19 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Jesse knows Aria. Wendy knows Austin. Viola knows Sandy. Miranda knows Perry. Drew knows Carmela. Matthew knows Fritz. Mario knows Camden. Perry knows Jordan. Perry knows Craig. Jesse knows Daisy. Drew knows Wendy. Daisy knows Viola. Essie knows Matthew. Carmela knows Miranda. Carmela knows Mario. Aria knows Trudy. Matthew knows Cooper. Daisy knows Essie. Which of Essie and Miranda can Jesse reach?", "answer": "Essie", "steps": [ "Jesse knows Daisy.", "Daisy knows Essie." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Jesse", "Essie", "Sandy", "Viola", "Daisy", "Trudy", "Fritz", "Matthew", "Cooper", "Aria", "Drew", "Miranda", "Camden", "Mario", "Carmela", "Austin", "Craig", "Perry", "Jordan", "Wendy" ], "edges": [ [ 0, 4 ], [ 0, 9 ], [ 1, 7 ], [ 3, 2 ], [ 4, 3 ], [ 4, 1 ], [ 7, 6 ], [ 7, 8 ], [ 9, 5 ], [ 10, 14 ], [ 10, 19 ], [ 11, 17 ], [ 13, 12 ], [ 14, 13 ], [ 14, 11 ], [ 17, 16 ], [ 17, 18 ], [ 19, 15 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Daisy knows Alison. Matthew knows Darrell. Alice knows Carla. Maude knows Marilyn. Daisy knows Demetrius. Drew knows Daisy. Marilyn knows Autumn. Matthew knows Lana. Arthur knows Alice. Lawson knows Iris. Marilyn knows Noah. Bert knows Maude. Lana knows Lawson. Maude knows Hugh. Matthew knows Stuart. Marilyn knows Arthur. Maude knows Zach. Daisy knows Matthew. Which of Arthur and Lana can Drew reach?", "answer": "Lana", "steps": [ "Drew knows Daisy.", "Daisy knows Matthew.", "Matthew knows Lana." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Drew", "Lana", "Demetrius", "Lawson", "Darrell", "Daisy", "Iris", "Alison", "Matthew", "Stuart", "Bert", "Arthur", "Hugh", "Alice", "Noah", "Maude", "Carla", "Zach", "Marilyn", "Autumn" ], "edges": [ [ 0, 5 ], [ 1, 3 ], [ 3, 6 ], [ 5, 2 ], [ 5, 7 ], [ 5, 8 ], [ 8, 4 ], [ 8, 1 ], [ 8, 9 ], [ 10, 15 ], [ 11, 13 ], [ 13, 16 ], [ 15, 12 ], [ 15, 17 ], [ 15, 18 ], [ 18, 14 ], [ 18, 11 ], [ 18, 19 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Ellen knows Marcia. Greta knows Amelia. Kurt knows Greta. Ellen knows Austin. Burt knows Fisher. Austin knows Neville. Margaret knows Burt. Hailey knows Jesse. Hailey knows Nelson. Nelson knows Ellen. Kathleen knows Kurt. Jesse knows Jordan. Burt knows Randy. Hendrix knows Dorian. Kurt knows Margaret. Randy knows Keegan. Dorian knows Hailey. Garrison knows Kathleen. Which of Hailey and Kurt can Hendrix reach?", "answer": "Hailey", "steps": [ "Hendrix knows Dorian.", "Dorian knows Hailey." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Hendrix", "Ellen", "Jesse", "Austin", "Nelson", "Dorian", "Jordan", "Hailey", "Neville", "Marcia", "Garrison", "Burt", "Greta", "Randy", "Margaret", "Kathleen", "Amelia", "Kurt", "Keegan", "Fisher" ], "edges": [ [ 0, 5 ], [ 1, 3 ], [ 1, 9 ], [ 2, 6 ], [ 3, 8 ], [ 4, 1 ], [ 5, 7 ], [ 7, 2 ], [ 7, 4 ], [ 10, 15 ], [ 11, 13 ], [ 11, 19 ], [ 12, 16 ], [ 13, 18 ], [ 14, 11 ], [ 15, 17 ], [ 17, 12 ], [ 17, 14 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Daria knows Amanda. Joel knows Kevin. Otto knows Ibrahim. Jeffery knows Adelaide. Latoya knows Shaun. Amanda knows Esperanza. Brad knows Vera. Tiffany knows Crystal. Ava knows Latoya. Kevin knows Otto. Otto knows Ava. Esperanza knows Jeffery. Vera knows Tiffany. Esperanza knows Donna. Shaun knows Jenny. Dixie knows Conner. Tiffany knows Daria. Shaun knows Dixie. Which of Dixie and Jeffery can Joel reach?", "answer": "Dixie", "steps": [ "Joel knows Kevin.", "Kevin knows Otto.", "Otto knows Ava.", "Ava knows Latoya.", "Latoya knows Shaun.", "Shaun knows Dixie." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Joel", "Otto", "Dixie", "Kevin", "Shaun", "Latoya", "Conner", "Jenny", "Ibrahim", "Ava", "Brad", "Tiffany", "Jeffery", "Vera", "Esperanza", "Amanda", "Adelaide", "Donna", "Crystal", "Daria" ], "edges": [ [ 0, 3 ], [ 1, 8 ], [ 1, 9 ], [ 2, 6 ], [ 3, 1 ], [ 4, 2 ], [ 4, 7 ], [ 5, 4 ], [ 9, 5 ], [ 10, 13 ], [ 11, 18 ], [ 11, 19 ], [ 12, 16 ], [ 13, 11 ], [ 14, 12 ], [ 14, 17 ], [ 15, 14 ], [ 19, 15 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Vernon knows Paula. Electra knows Don. Greer knows Iris. Kate knows Seth. Electra knows Jakob. Gus knows Electra. April knows Greer. Paula knows Nolan. Electra knows Harry. Kate knows Milton. James knows Peggy. Kate knows Travis. Electra knows Ann. Corey knows Kate. April knows Corey. Kate knows James. Vernon knows Gus. Don knows Thomas. Which of Kate and Electra can April reach?", "answer": "Kate", "steps": [ "April knows Corey.", "Corey knows Kate." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "April", "Kate", "Milton", "Seth", "Corey", "Iris", "Greer", "Travis", "James", "Peggy", "Vernon", "Electra", "Harry", "Ann", "Gus", "Nolan", "Paula", "Jakob", "Don", "Thomas" ], "edges": [ [ 0, 6 ], [ 0, 4 ], [ 1, 2 ], [ 1, 3 ], [ 1, 7 ], [ 1, 8 ], [ 4, 1 ], [ 6, 5 ], [ 8, 9 ], [ 10, 16 ], [ 10, 14 ], [ 11, 12 ], [ 11, 13 ], [ 11, 17 ], [ 11, 18 ], [ 14, 11 ], [ 16, 15 ], [ 18, 19 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Stephanie knows Cooper. Karl knows Fraser. Colleen knows Wilson. Katherine knows Cindy. Blake knows Leon. Dawn knows Stephanie. Colleen knows Jessie. Dawn knows Rose. Cooper knows Jacob. Dawn knows Colleen. Kenzie knows Bonnie. Jacob knows Kay. Blake knows Kenzie. Kenzie knows Ainsley. Colleen knows Amelia. Cindy knows Karl. Blake knows Katherine. Kenzie knows Holden. Which of Karl and Jacob can Dawn reach?", "answer": "Jacob", "steps": [ "Dawn knows Stephanie.", "Stephanie knows Cooper.", "Cooper knows Jacob." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Dawn", "Jessie", "Stephanie", "Cooper", "Wilson", "Jacob", "Amelia", "Colleen", "Rose", "Kay", "Blake", "Holden", "Katherine", "Cindy", "Ainsley", "Karl", "Bonnie", "Kenzie", "Leon", "Fraser" ], "edges": [ [ 0, 7 ], [ 0, 8 ], [ 0, 2 ], [ 2, 3 ], [ 3, 5 ], [ 5, 9 ], [ 7, 1 ], [ 7, 4 ], [ 7, 6 ], [ 10, 17 ], [ 10, 18 ], [ 10, 12 ], [ 12, 13 ], [ 13, 15 ], [ 15, 19 ], [ 17, 11 ], [ 17, 14 ], [ 17, 16 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Sarah knows Natalie. Blake knows Yasmin. Lottie knows Dave. Jenna knows Mildred. Yasmin knows Judith. Declan knows Martha. August knows Patrick. Laura knows Sarah. Dave knows Geraldine. Sarah knows Carson. Patrick knows Lottie. Dean knows Lucia. Kylie knows Laura. Carson knows Declan. Martha knows Dean. Dave knows Blake. Curtis knows Kylie. Judith knows Jenna. Which of Martha and Judith can August reach?", "answer": "Judith", "steps": [ "August knows Patrick.", "Patrick knows Lottie.", "Lottie knows Dave.", "Dave knows Blake.", "Blake knows Yasmin.", "Yasmin knows Judith." ], "difficulty": 6, "original_distance": 8, "idx_to_symbol": [ "August", "Blake", "Judith", "Geraldine", "Dave", "Lottie", "Mildred", "Jenna", "Yasmin", "Patrick", "Curtis", "Carson", "Martha", "Natalie", "Sarah", "Laura", "Lucia", "Dean", "Declan", "Kylie" ], "edges": [ [ 0, 9 ], [ 1, 8 ], [ 2, 7 ], [ 4, 3 ], [ 4, 1 ], [ 5, 4 ], [ 7, 6 ], [ 8, 2 ], [ 9, 5 ], [ 10, 19 ], [ 11, 18 ], [ 12, 17 ], [ 14, 13 ], [ 14, 11 ], [ 15, 14 ], [ 17, 16 ], [ 18, 12 ], [ 19, 15 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Rosa knows Ava. Bert knows Albert. Albert knows Felicia. Ira knows Priscilla. Gina knows Bert. Brooke knows Itzel. Felicia knows Lana. Aaron knows Tina. Ira knows Carla. Brooke knows Preston. Ira knows Brooke. Bert knows Dina. Albert knows Kenneth. Aaron knows Ira. Brooke knows Rosa. Bert knows Barney. Albert knows Janice. Gina knows Viola. Which of Felicia and Rosa can Aaron reach?", "answer": "Rosa", "steps": [ "Aaron knows Ira.", "Ira knows Brooke.", "Brooke knows Rosa." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Aaron", "Ira", "Brooke", "Itzel", "Preston", "Ava", "Carla", "Priscilla", "Rosa", "Tina", "Gina", "Bert", "Albert", "Kenneth", "Janice", "Lana", "Dina", "Barney", "Felicia", "Viola" ], "edges": [ [ 0, 1 ], [ 0, 9 ], [ 1, 6 ], [ 1, 7 ], [ 1, 2 ], [ 2, 3 ], [ 2, 4 ], [ 2, 8 ], [ 8, 5 ], [ 10, 11 ], [ 10, 19 ], [ 11, 16 ], [ 11, 17 ], [ 11, 12 ], [ 12, 13 ], [ 12, 14 ], [ 12, 18 ], [ 18, 15 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Barbara knows Norma. Burt knows Lawrence. Louis knows Fernando. Karl knows Patricia. Dale knows Sheryl. Dale knows Eric. Barbara knows Louis. Karl knows Laura. Burt knows Ralph. Lawrence knows Ellen. Barbara knows Claude. Barbara knows Betty. Karl knows Kamila. Kamila knows Burt. Sheryl knows Lyric. Kamila knows Beverly. Louis knows Dale. Karl knows Vivian. Which of Lawrence and Sheryl can Barbara reach?", "answer": "Sheryl", "steps": [ "Barbara knows Louis.", "Louis knows Dale.", "Dale knows Sheryl." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Barbara", "Dale", "Claude", "Lyric", "Betty", "Eric", "Fernando", "Louis", "Sheryl", "Norma", "Karl", "Burt", "Patricia", "Ellen", "Laura", "Ralph", "Beverly", "Kamila", "Lawrence", "Vivian" ], "edges": [ [ 0, 2 ], [ 0, 4 ], [ 0, 7 ], [ 0, 9 ], [ 1, 5 ], [ 1, 8 ], [ 7, 6 ], [ 7, 1 ], [ 8, 3 ], [ 10, 12 ], [ 10, 14 ], [ 10, 17 ], [ 10, 19 ], [ 11, 15 ], [ 11, 18 ], [ 17, 16 ], [ 17, 11 ], [ 18, 13 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Dane knows Calvin. Cora knows Gus. Dane knows Erica. Wyatt knows Stanley. Duncan knows Lynn. Erica knows Keegan. Lynn knows Quinn. Cora knows Dane. Keegan knows Georgia. Stanley knows Dale. Stanley knows Garrison. Stanley knows Hugo. Keegan knows Nicholas. Duncan knows Duke. Keegan knows Lilia. Lynn knows Wyatt. Garrison knows Rhonda. Georgia knows Dakota. Which of Garrison and Georgia can Duncan reach?", "answer": "Garrison", "steps": [ "Duncan knows Lynn.", "Lynn knows Wyatt.", "Wyatt knows Stanley.", "Stanley knows Garrison." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Duncan", "Stanley", "Lynn", "Rhonda", "Dale", "Hugo", "Duke", "Wyatt", "Quinn", "Garrison", "Cora", "Keegan", "Dane", "Dakota", "Nicholas", "Lilia", "Gus", "Erica", "Calvin", "Georgia" ], "edges": [ [ 0, 6 ], [ 0, 2 ], [ 1, 4 ], [ 1, 5 ], [ 1, 9 ], [ 2, 8 ], [ 2, 7 ], [ 7, 1 ], [ 9, 3 ], [ 10, 16 ], [ 10, 12 ], [ 11, 14 ], [ 11, 15 ], [ 11, 19 ], [ 12, 18 ], [ 12, 17 ], [ 17, 11 ], [ 19, 13 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Emma knows Diana. Arthur knows Kieran. Leo knows Boyd. Kieran knows Harlan. Diana knows Hadley. Alfred knows Stefan. Keaton knows Olive. Keaton knows Dick. Harlan knows Charles. Gage knows Kyle. Aria knows Marilyn. Gage knows Aria. Keaton knows Arthur. Megan knows Emma. Kyle knows Alfred. Dick knows Leo. Gage knows Megan. Olive knows Annette. Which of Hadley and Charles can Keaton reach?", "answer": "Charles", "steps": [ "Keaton knows Arthur.", "Arthur knows Kieran.", "Kieran knows Harlan.", "Harlan knows Charles." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Keaton", "Arthur", "Harlan", "Boyd", "Charles", "Dick", "Annette", "Kieran", "Olive", "Leo", "Gage", "Megan", "Diana", "Stefan", "Hadley", "Kyle", "Marilyn", "Emma", "Aria", "Alfred" ], "edges": [ [ 0, 1 ], [ 0, 8 ], [ 0, 5 ], [ 1, 7 ], [ 2, 4 ], [ 5, 9 ], [ 7, 2 ], [ 8, 6 ], [ 9, 3 ], [ 10, 11 ], [ 10, 18 ], [ 10, 15 ], [ 11, 17 ], [ 12, 14 ], [ 15, 19 ], [ 17, 12 ], [ 18, 16 ], [ 19, 13 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Dawn knows Adam. Gene knows Connor. Adam knows Finn. Finn knows Megan. Fanny knows Dawn. Avery knows Dell. Wilson knows Avery. Marilyn knows Gideon. Megan knows Gene. Gideon knows Lorraine. Etta knows Wilson. Curtis knows James. Lars knows Etta. Connor knows Bonnie. Gene knows Lawson. Francesca knows Fanny. Avery knows Curtis. Lorraine knows Lars. Which of Megan and Wilson can Marilyn reach?", "answer": "Wilson", "steps": [ "Marilyn knows Gideon.", "Gideon knows Lorraine.", "Lorraine knows Lars.", "Lars knows Etta.", "Etta knows Wilson." ], "difficulty": 5, "original_distance": 8, "idx_to_symbol": [ "Marilyn", "Lorraine", "Etta", "Curtis", "Wilson", "Gideon", "Dell", "James", "Avery", "Lars", "Francesca", "Dawn", "Finn", "Connor", "Megan", "Fanny", "Lawson", "Bonnie", "Gene", "Adam" ], "edges": [ [ 0, 5 ], [ 1, 9 ], [ 2, 4 ], [ 3, 7 ], [ 4, 8 ], [ 5, 1 ], [ 8, 6 ], [ 8, 3 ], [ 9, 2 ], [ 10, 15 ], [ 11, 19 ], [ 12, 14 ], [ 13, 17 ], [ 14, 18 ], [ 15, 11 ], [ 18, 16 ], [ 18, 13 ], [ 19, 12 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Nora knows Roman. Bruce knows Dick. Louisa knows Jewel. Dick knows Leah. Beverly knows Gene. Michael knows Boris. Jewel knows Wilson. Michael knows Bruce. Glen knows Beverly. Vera knows Glen. Bruce knows Nora. Aspen knows Willard. Vera knows Kara. Glen knows Eugenia. Eugenia knows Benjamin. Eugenia knows Louisa. Dawn knows Aspen. Dick knows Dawn. Which of Wilson and Willard can Vera reach?", "answer": "Wilson", "steps": [ "Vera knows Glen.", "Glen knows Eugenia.", "Eugenia knows Louisa.", "Louisa knows Jewel.", "Jewel knows Wilson." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Vera", "Glen", "Jewel", "Eugenia", "Beverly", "Kara", "Benjamin", "Gene", "Wilson", "Louisa", "Michael", "Bruce", "Aspen", "Dick", "Nora", "Boris", "Leah", "Roman", "Willard", "Dawn" ], "edges": [ [ 0, 5 ], [ 0, 1 ], [ 1, 4 ], [ 1, 3 ], [ 2, 8 ], [ 3, 6 ], [ 3, 9 ], [ 4, 7 ], [ 9, 2 ], [ 10, 15 ], [ 10, 11 ], [ 11, 14 ], [ 11, 13 ], [ 12, 18 ], [ 13, 16 ], [ 13, 19 ], [ 14, 17 ], [ 19, 12 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Dane knows Calvin. Cora knows Gus. Dane knows Erica. Wyatt knows Stanley. Duncan knows Lynn. Erica knows Keegan. Lynn knows Quinn. Cora knows Dane. Keegan knows Georgia. Stanley knows Dale. Stanley knows Garrison. Stanley knows Hugo. Keegan knows Nicholas. Duncan knows Duke. Keegan knows Lilia. Lynn knows Wyatt. Garrison knows Rhonda. Georgia knows Dakota. Which of Rhonda and Dakota can Duncan reach?", "answer": "Rhonda", "steps": [ "Duncan knows Lynn.", "Lynn knows Wyatt.", "Wyatt knows Stanley.", "Stanley knows Garrison.", "Garrison knows Rhonda." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Duncan", "Stanley", "Lynn", "Rhonda", "Dale", "Hugo", "Duke", "Wyatt", "Quinn", "Garrison", "Cora", "Keegan", "Dane", "Dakota", "Nicholas", "Lilia", "Gus", "Erica", "Calvin", "Georgia" ], "edges": [ [ 0, 6 ], [ 0, 2 ], [ 1, 4 ], [ 1, 5 ], [ 1, 9 ], [ 2, 8 ], [ 2, 7 ], [ 7, 1 ], [ 9, 3 ], [ 10, 16 ], [ 10, 12 ], [ 11, 14 ], [ 11, 15 ], [ 11, 19 ], [ 12, 18 ], [ 12, 17 ], [ 17, 11 ], [ 19, 13 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Dean knows Geneva. Grant knows Tanya. Destiny knows Alyson. Annie knows Dustin. Tanya knows Ford. Paula knows Rachel. Randy knows Delilah. Destiny knows Melody. Ford knows Paul. Dina knows Grant. Luis knows Annie. Rachel knows Randy. Dina knows Gregory. Randy knows Christopher. Ford knows Norma. Annie knows Paula. Melody knows Dina. Dean knows Luis. Which of Annie and Dina can Destiny reach?", "answer": "Dina", "steps": [ "Destiny knows Melody.", "Melody knows Dina." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Destiny", "Ford", "Melody", "Gregory", "Norma", "Paul", "Grant", "Dina", "Alyson", "Tanya", "Dean", "Randy", "Luis", "Dustin", "Delilah", "Christopher", "Paula", "Annie", "Geneva", "Rachel" ], "edges": [ [ 0, 8 ], [ 0, 2 ], [ 1, 4 ], [ 1, 5 ], [ 2, 7 ], [ 6, 9 ], [ 7, 3 ], [ 7, 6 ], [ 9, 1 ], [ 10, 18 ], [ 10, 12 ], [ 11, 14 ], [ 11, 15 ], [ 12, 17 ], [ 16, 19 ], [ 17, 13 ], [ 17, 16 ], [ 19, 11 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Karl knows Dallas. Marvin knows Rosemary. Gabriel knows Adrian. Lennox knows Ramona. Gabriel knows Pam. Kara knows Alvin. Lenora knows Loretta. Pam knows Mary. Marvin knows Chandler. Chandler knows Ted. Ramona knows Evan. Karl knows Jonah. Chandler knows Lenora. Evan knows Marvin. Evan knows Nancy. Alvin knows Karl. Jonah knows Blake. Jonah knows Gabriel. Which of Alvin and Ramona can Kara reach?", "answer": "Alvin", "steps": [ "Kara knows Alvin." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Kara", "Pam", "Karl", "Jonah", "Gabriel", "Dallas", "Blake", "Alvin", "Adrian", "Mary", "Lennox", "Lenora", "Evan", "Marvin", "Chandler", "Nancy", "Rosemary", "Ramona", "Ted", "Loretta" ], "edges": [ [ 0, 7 ], [ 1, 9 ], [ 2, 5 ], [ 2, 3 ], [ 3, 6 ], [ 3, 4 ], [ 4, 8 ], [ 4, 1 ], [ 7, 2 ], [ 10, 17 ], [ 11, 19 ], [ 12, 15 ], [ 12, 13 ], [ 13, 16 ], [ 13, 14 ], [ 14, 18 ], [ 14, 11 ], [ 17, 12 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Greer knows Wade. Zack knows Rufus. Bette knows Tyler. Atlas knows Karl. Gerald knows Livia. Linda knows Zack. Catherine knows Emanuel. Lottie knows Julie. Karl knows Greer. Dewey knows Lottie. Livia knows Catherine. Livia knows Aldo. Zane knows Neil. Greer knows Dewey. Atlas knows Bette. Dewey knows Mildred. Catherine knows Zane. Linda knows Gerald. Which of Lottie and Zane can Atlas reach?", "answer": "Lottie", "steps": [ "Atlas knows Karl.", "Karl knows Greer.", "Greer knows Dewey.", "Dewey knows Lottie." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Atlas", "Dewey", "Julie", "Tyler", "Mildred", "Greer", "Karl", "Bette", "Wade", "Lottie", "Linda", "Catherine", "Neil", "Rufus", "Emanuel", "Livia", "Gerald", "Zack", "Aldo", "Zane" ], "edges": [ [ 0, 7 ], [ 0, 6 ], [ 1, 4 ], [ 1, 9 ], [ 5, 8 ], [ 5, 1 ], [ 6, 5 ], [ 7, 3 ], [ 9, 2 ], [ 10, 17 ], [ 10, 16 ], [ 11, 14 ], [ 11, 19 ], [ 15, 18 ], [ 15, 11 ], [ 16, 15 ], [ 17, 13 ], [ 19, 12 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Heidi knows Lucia. Marcus knows Joy. Mark knows Rita. Keaton knows Lyle. Lyle knows Ross. Ida knows Fletcher. Erwin knows Dolores. Brittany knows Irving. Leigh knows Oliver. Garland knows Brittany. Erwin knows Leigh. Dolores knows Milo. Milo knows Marcus. Lucia knows Keaton. Keaton knows Ida. Irving knows Erwin. Milton knows Heidi. Ross knows Mark. Which of Irving and Lucia can Milton reach?", "answer": "Lucia", "steps": [ "Milton knows Heidi.", "Heidi knows Lucia." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Milton", "Heidi", "Ross", "Mark", "Fletcher", "Lyle", "Rita", "Lucia", "Keaton", "Ida", "Garland", "Brittany", "Milo", "Marcus", "Oliver", "Dolores", "Joy", "Irving", "Erwin", "Leigh" ], "edges": [ [ 0, 1 ], [ 1, 7 ], [ 2, 3 ], [ 3, 6 ], [ 5, 2 ], [ 7, 8 ], [ 8, 5 ], [ 8, 9 ], [ 9, 4 ], [ 10, 11 ], [ 11, 17 ], [ 12, 13 ], [ 13, 16 ], [ 15, 12 ], [ 17, 18 ], [ 18, 15 ], [ 18, 19 ], [ 19, 14 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Roger knows Pierce. Jude knows Barney. Clyde knows Simon. Pierce knows Dewey. Marco knows Clyde. Ibrahim knows Doug. Jude knows Lars. Cyrus knows Roger. Marco knows Elodie. Ibrahim knows Holden. Pierce knows Megan. Cyrus knows Esperanza. Marco knows Jerry. Marco knows Jaime. Clyde knows Will. Pierce knows Gareth. Doug knows Marco. Pierce knows Jude. Which of Marco and Pierce can Cyrus reach?", "answer": "Pierce", "steps": [ "Cyrus knows Roger.", "Roger knows Pierce." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Cyrus", "Roger", "Esperanza", "Pierce", "Dewey", "Gareth", "Jude", "Barney", "Lars", "Megan", "Ibrahim", "Doug", "Holden", "Marco", "Jaime", "Jerry", "Clyde", "Simon", "Will", "Elodie" ], "edges": [ [ 0, 2 ], [ 0, 1 ], [ 1, 3 ], [ 3, 4 ], [ 3, 5 ], [ 3, 6 ], [ 3, 9 ], [ 6, 7 ], [ 6, 8 ], [ 10, 12 ], [ 10, 11 ], [ 11, 13 ], [ 13, 14 ], [ 13, 15 ], [ 13, 16 ], [ 13, 19 ], [ 16, 17 ], [ 16, 18 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Boris knows Corinne. Irving knows Gus. Roland knows Riley. Lionel knows Craig. Corinne knows Winifred. Clarence knows Juan. Peter knows Devon. Roland knows Gwen. Devon knows Owen. Willard knows Ariel. Clarence knows Courtney. Roland knows Boris. Irving knows Lionel. Craig knows Jodi. Courtney knows Constance. Craig knows Willard. Irving knows Peter. Riley knows Clarence. Which of Lionel and Riley can Roland reach?", "answer": "Riley", "steps": [ "Roland knows Riley." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Roland", "Constance", "Boris", "Riley", "Winifred", "Corinne", "Juan", "Clarence", "Courtney", "Gwen", "Irving", "Ariel", "Peter", "Lionel", "Owen", "Devon", "Jodi", "Craig", "Willard", "Gus" ], "edges": [ [ 0, 2 ], [ 0, 3 ], [ 0, 9 ], [ 2, 5 ], [ 3, 7 ], [ 5, 4 ], [ 7, 6 ], [ 7, 8 ], [ 8, 1 ], [ 10, 12 ], [ 10, 13 ], [ 10, 19 ], [ 12, 15 ], [ 13, 17 ], [ 15, 14 ], [ 17, 16 ], [ 17, 18 ], [ 18, 11 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Cara knows Mark. Keaton knows Melody. Nelson knows Cristina. Keaton knows Adrian. Adrian knows Latoya. Herbert knows Dale. Kristina knows Aurora. Aurora knows Cara. Herbert knows Morris. Lauren knows Bennett. Dustin knows Grant. Morris knows Dustin. Miles knows Lauren. Nelson knows Jameson. Jameson knows Keaton. Kristina knows Leticia. Cara knows Herbert. Adrian knows Miles. Which of Grant and Bennett can Nelson reach?", "answer": "Bennett", "steps": [ "Nelson knows Jameson.", "Jameson knows Keaton.", "Keaton knows Adrian.", "Adrian knows Miles.", "Miles knows Lauren.", "Lauren knows Bennett." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Nelson", "Melody", "Latoya", "Miles", "Bennett", "Adrian", "Jameson", "Cristina", "Keaton", "Lauren", "Kristina", "Mark", "Dale", "Morris", "Grant", "Herbert", "Aurora", "Leticia", "Cara", "Dustin" ], "edges": [ [ 0, 7 ], [ 0, 6 ], [ 3, 9 ], [ 5, 2 ], [ 5, 3 ], [ 6, 8 ], [ 8, 1 ], [ 8, 5 ], [ 9, 4 ], [ 10, 17 ], [ 10, 16 ], [ 13, 19 ], [ 15, 12 ], [ 15, 13 ], [ 16, 18 ], [ 18, 11 ], [ 18, 15 ], [ 19, 14 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Carrie knows Colin. Lucy knows Federico. Carrie knows Willard. Erik knows Claude. Garrett knows Carla. Sydney knows Horace. Sydney knows Carrie. Leon knows Matt. Lucy knows Jill. Lorenzo knows Sydney. Leon knows Rose. Garrett knows Ava. Julia knows Leon. Leon knows Lucy. Erik knows Gemma. Leon knows Erik. Sydney knows Garrett. Sydney knows Raymond. Which of Colin and Claude can Julia reach?", "answer": "Claude", "steps": [ "Julia knows Leon.", "Leon knows Erik.", "Erik knows Claude." ], "difficulty": 3, "original_distance": 3, "idx_to_symbol": [ "Julia", "Leon", "Claude", "Erik", "Federico", "Rose", "Matt", "Lucy", "Jill", "Gemma", "Lorenzo", "Sydney", "Colin", "Carrie", "Ava", "Horace", "Raymond", "Garrett", "Carla", "Willard" ], "edges": [ [ 0, 1 ], [ 1, 5 ], [ 1, 6 ], [ 1, 7 ], [ 1, 3 ], [ 3, 2 ], [ 3, 9 ], [ 7, 4 ], [ 7, 8 ], [ 10, 11 ], [ 11, 15 ], [ 11, 16 ], [ 11, 17 ], [ 11, 13 ], [ 13, 12 ], [ 13, 19 ], [ 17, 14 ], [ 17, 18 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Neil knows Jessie. Jessie knows Val. Carol knows Eileen. Neil knows Jack. Yuki knows Owen. Ron knows Carmela. Jack knows Carol. Carmela knows Katrina. Arlene knows Ricardo. Colin knows Ron. Beth knows Jem. Ron knows Arlene. Jack knows Beth. Carmela knows Samantha. Carmela knows Yuki. Jack knows Cora. Darwin knows Neil. Katrina knows Bernard. Which of Jem and Bernard can Darwin reach?", "answer": "Jem", "steps": [ "Darwin knows Neil.", "Neil knows Jack.", "Jack knows Beth.", "Beth knows Jem." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Darwin", "Val", "Jack", "Neil", "Jem", "Carol", "Beth", "Eileen", "Cora", "Jessie", "Colin", "Ricardo", "Carmela", "Ron", "Bernard", "Yuki", "Katrina", "Owen", "Samantha", "Arlene" ], "edges": [ [ 0, 3 ], [ 2, 6 ], [ 2, 5 ], [ 2, 8 ], [ 3, 2 ], [ 3, 9 ], [ 5, 7 ], [ 6, 4 ], [ 9, 1 ], [ 10, 13 ], [ 12, 16 ], [ 12, 15 ], [ 12, 18 ], [ 13, 12 ], [ 13, 19 ], [ 15, 17 ], [ 16, 14 ], [ 19, 11 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Daniel knows Haley. Kelly knows Vance. Axel knows Bryan. Nina knows Wayne. Axel knows Sheila. Sheila knows Richard. Electra knows Jon. Kelly knows Edward. Wayne knows Dana. Vance knows Nina. Hailey knows Tyler. Gemma knows Naomi. Daniel knows Kate. Electra knows Hailey. Haley knows Fisher. Fisher knows Axel. Wayne knows Electra. Sheila knows Gemma. Which of Nina and Fisher can Daniel reach?", "answer": "Fisher", "steps": [ "Daniel knows Haley.", "Haley knows Fisher." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Daniel", "Sheila", "Naomi", "Richard", "Haley", "Bryan", "Fisher", "Gemma", "Axel", "Kate", "Kelly", "Electra", "Tyler", "Jon", "Vance", "Dana", "Nina", "Hailey", "Wayne", "Edward" ], "edges": [ [ 0, 4 ], [ 0, 9 ], [ 1, 3 ], [ 1, 7 ], [ 4, 6 ], [ 6, 8 ], [ 7, 2 ], [ 8, 5 ], [ 8, 1 ], [ 10, 14 ], [ 10, 19 ], [ 11, 13 ], [ 11, 17 ], [ 14, 16 ], [ 16, 18 ], [ 17, 12 ], [ 18, 15 ], [ 18, 11 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Ross knows Leah. Wilson knows Alma. Cynthia knows Edgar. Riley knows Cynthia. Helene knows Donovan. Edwin knows Frankie. Donovan knows Donald. Blanche knows Autumn. Alma knows Riley. Edgar knows Keira. Kara knows Blanche. Susanne knows Elmer. Edgar knows Archer. Elmer knows Hope. Hope knows Helene. Leah knows Edwin. Donovan knows Ross. Archer knows Kara. Which of Blanche and Edwin can Wilson reach?", "answer": "Blanche", "steps": [ "Wilson knows Alma.", "Alma knows Riley.", "Riley knows Cynthia.", "Cynthia knows Edgar.", "Edgar knows Archer.", "Archer knows Kara.", "Kara knows Blanche." ], "difficulty": 7, "original_distance": 8, "idx_to_symbol": [ "Wilson", "Riley", "Alma", "Blanche", "Archer", "Kara", "Cynthia", "Keira", "Autumn", "Edgar", "Susanne", "Hope", "Elmer", "Edwin", "Ross", "Leah", "Helene", "Donald", "Frankie", "Donovan" ], "edges": [ [ 0, 2 ], [ 1, 6 ], [ 2, 1 ], [ 3, 8 ], [ 4, 5 ], [ 5, 3 ], [ 6, 9 ], [ 9, 7 ], [ 9, 4 ], [ 10, 12 ], [ 11, 16 ], [ 12, 11 ], [ 13, 18 ], [ 14, 15 ], [ 15, 13 ], [ 16, 19 ], [ 19, 17 ], [ 19, 14 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Vanessa knows Lacey. Yuki knows Ashton. Randall knows Nora. Ivan knows Dorian. Emma knows Ivan. Ella knows Ernie. Nora knows Ella. Alfonso knows Vanessa. Yuki knows Reed. Ivan knows Alfonso. Bob knows Yuki. Randall knows Emma. Desmond knows Alder. Ashton knows Aspen. Renee knows Quinn. Aspen knows Irma. Alder knows Renee. Desmond knows Bob. Which of Alfonso and Ashton can Desmond reach?", "answer": "Ashton", "steps": [ "Desmond knows Bob.", "Bob knows Yuki.", "Yuki knows Ashton." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Desmond", "Alder", "Aspen", "Ashton", "Irma", "Renee", "Yuki", "Reed", "Quinn", "Bob", "Randall", "Nora", "Vanessa", "Alfonso", "Lacey", "Ella", "Ivan", "Dorian", "Ernie", "Emma" ], "edges": [ [ 0, 1 ], [ 0, 9 ], [ 1, 5 ], [ 2, 4 ], [ 3, 2 ], [ 5, 8 ], [ 6, 3 ], [ 6, 7 ], [ 9, 6 ], [ 10, 11 ], [ 10, 19 ], [ 11, 15 ], [ 12, 14 ], [ 13, 12 ], [ 15, 18 ], [ 16, 13 ], [ 16, 17 ], [ 19, 16 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Kennedy knows Curtis. Jason knows Stefan. Dave knows Kennedy. Zara knows Quinn. Malcolm knows Malik. Ann knows Malcolm. Iris knows Brett. Malik knows Zara. Malik knows Olivia. Stefan knows Anna. Roger knows Jason. Brett knows Roger. Preston knows Crystal. Erik knows Iris. Sybil knows Preston. Brett knows Sybil. Quinn knows Alfonso. Olivia knows Dave. Which of Jason and Dave can Ann reach?", "answer": "Dave", "steps": [ "Ann knows Malcolm.", "Malcolm knows Malik.", "Malik knows Olivia.", "Olivia knows Dave." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Ann", "Malik", "Olivia", "Curtis", "Zara", "Alfonso", "Malcolm", "Quinn", "Dave", "Kennedy", "Erik", "Brett", "Roger", "Anna", "Sybil", "Crystal", "Iris", "Preston", "Jason", "Stefan" ], "edges": [ [ 0, 6 ], [ 1, 4 ], [ 1, 2 ], [ 2, 8 ], [ 4, 7 ], [ 6, 1 ], [ 7, 5 ], [ 8, 9 ], [ 9, 3 ], [ 10, 16 ], [ 11, 14 ], [ 11, 12 ], [ 12, 18 ], [ 14, 17 ], [ 16, 11 ], [ 17, 15 ], [ 18, 19 ], [ 19, 13 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Neal knows Dante. Vera knows Harmony. Betty knows Israel. Colby knows Alvin. Betty knows Dolly. Alex knows Imogen. Joy knows Colby. Vera knows Gene. Thomas knows Jewel. Colby knows Carlos. Natalie knows Joy. Molly knows Alex. Dolly knows Neal. Jewel knows Vera. Molly knows Bob. Gene knows Betty. Carlos knows Molly. Imogen knows Grant. Which of Vera and Colby can Thomas reach?", "answer": "Vera", "steps": [ "Thomas knows Jewel.", "Jewel knows Vera." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Thomas", "Israel", "Dolly", "Vera", "Dante", "Jewel", "Neal", "Betty", "Harmony", "Gene", "Natalie", "Bob", "Alex", "Colby", "Grant", "Joy", "Imogen", "Molly", "Alvin", "Carlos" ], "edges": [ [ 0, 5 ], [ 2, 6 ], [ 3, 8 ], [ 3, 9 ], [ 5, 3 ], [ 6, 4 ], [ 7, 1 ], [ 7, 2 ], [ 9, 7 ], [ 10, 15 ], [ 12, 16 ], [ 13, 18 ], [ 13, 19 ], [ 15, 13 ], [ 16, 14 ], [ 17, 11 ], [ 17, 12 ], [ 19, 17 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Jordan knows Emma. Duncan knows Jacqueline. Gina knows Jerome. Russ knows Gina. Emma knows Pat. Gina knows Griffith. Emma knows Conrad. Paula knows Homer. Pat knows Mabel. Mabel knows Russ. Jacqueline knows Cyrus. Daniella knows Fergus. Daniella knows Gabe. Lillian knows Daniella. Jacqueline knows Paula. Gina knows Mae. Homer knows Lillian. Daniella knows Elvira. Which of Mabel and Homer can Duncan reach?", "answer": "Homer", "steps": [ "Duncan knows Jacqueline.", "Jacqueline knows Paula.", "Paula knows Homer." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Duncan", "Daniella", "Paula", "Homer", "Jacqueline", "Gabe", "Fergus", "Elvira", "Lillian", "Cyrus", "Jordan", "Gina", "Pat", "Mabel", "Emma", "Mae", "Griffith", "Jerome", "Russ", "Conrad" ], "edges": [ [ 0, 4 ], [ 1, 5 ], [ 1, 6 ], [ 1, 7 ], [ 2, 3 ], [ 3, 8 ], [ 4, 2 ], [ 4, 9 ], [ 8, 1 ], [ 10, 14 ], [ 11, 15 ], [ 11, 16 ], [ 11, 17 ], [ 12, 13 ], [ 13, 18 ], [ 14, 12 ], [ 14, 19 ], [ 18, 11 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Floyd knows Gloria. Gloria knows Gabriel. Jenny knows Bruce. Jorge knows Dahlia. Anastasia knows Tessa. Bruce knows Damian. Justin knows Jeffery. Gabriel knows Virginia. Floyd knows Marc. Bruce knows Dawn. Yvonne knows Jenny. Marc knows Pierce. Gabriel knows Hope. Kate knows Floyd. Yvonne knows Justin. Anastasia knows Yvonne. Tessa knows Duke. Kate knows Jorge. Which of Gabriel and Bruce can Anastasia reach?", "answer": "Bruce", "steps": [ "Anastasia knows Yvonne.", "Yvonne knows Jenny.", "Jenny knows Bruce." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Anastasia", "Yvonne", "Damian", "Tessa", "Duke", "Bruce", "Justin", "Jenny", "Jeffery", "Dawn", "Kate", "Floyd", "Hope", "Jorge", "Dahlia", "Gabriel", "Marc", "Gloria", "Pierce", "Virginia" ], "edges": [ [ 0, 3 ], [ 0, 1 ], [ 1, 6 ], [ 1, 7 ], [ 3, 4 ], [ 5, 2 ], [ 5, 9 ], [ 6, 8 ], [ 7, 5 ], [ 10, 13 ], [ 10, 11 ], [ 11, 16 ], [ 11, 17 ], [ 13, 14 ], [ 15, 12 ], [ 15, 19 ], [ 16, 18 ], [ 17, 15 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Dane knows Calvin. Cora knows Gus. Dane knows Erica. Wyatt knows Stanley. Duncan knows Lynn. Erica knows Keegan. Lynn knows Quinn. Cora knows Dane. Keegan knows Georgia. Stanley knows Dale. Stanley knows Garrison. Stanley knows Hugo. Keegan knows Nicholas. Duncan knows Duke. Keegan knows Lilia. Lynn knows Wyatt. Garrison knows Rhonda. Georgia knows Dakota. Which of Dane and Lynn can Duncan reach?", "answer": "Lynn", "steps": [ "Duncan knows Lynn." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Duncan", "Stanley", "Lynn", "Rhonda", "Dale", "Hugo", "Duke", "Wyatt", "Quinn", "Garrison", "Cora", "Keegan", "Dane", "Dakota", "Nicholas", "Lilia", "Gus", "Erica", "Calvin", "Georgia" ], "edges": [ [ 0, 6 ], [ 0, 2 ], [ 1, 4 ], [ 1, 5 ], [ 1, 9 ], [ 2, 8 ], [ 2, 7 ], [ 7, 1 ], [ 9, 3 ], [ 10, 16 ], [ 10, 12 ], [ 11, 14 ], [ 11, 15 ], [ 11, 19 ], [ 12, 18 ], [ 12, 17 ], [ 17, 11 ], [ 19, 13 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Fred knows Chase. Karla knows Peggy. Kobe knows Hayes. Luke knows Karla. Dylan knows Patrick. Dylan knows Melody. Clay knows Dylan. Melody knows Ernest. Elijah knows Christopher. Dylan knows Kobe. Kobe knows Luke. Ernesto knows Ashley. Elijah knows Fred. Alder knows Pete. Irma knows Ernesto. Elijah knows Alder. Andrea knows Elijah. Fred knows Irma. Which of Dylan and Elijah can Andrea reach?", "answer": "Elijah", "steps": [ "Andrea knows Elijah." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Andrea", "Fred", "Ernesto", "Irma", "Chase", "Elijah", "Christopher", "Alder", "Pete", "Ashley", "Clay", "Kobe", "Karla", "Luke", "Hayes", "Dylan", "Patrick", "Melody", "Ernest", "Peggy" ], "edges": [ [ 0, 5 ], [ 1, 4 ], [ 1, 3 ], [ 2, 9 ], [ 3, 2 ], [ 5, 6 ], [ 5, 7 ], [ 5, 1 ], [ 7, 8 ], [ 10, 15 ], [ 11, 14 ], [ 11, 13 ], [ 12, 19 ], [ 13, 12 ], [ 15, 16 ], [ 15, 17 ], [ 15, 11 ], [ 17, 18 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Jonathan knows Keira. Loretta knows Finn. Loretta knows Cody. Kara knows Duke. Regina knows Elijah. Regina knows Essie. Wallace knows Kara. Lamar knows Loretta. Kara knows Lamar. Jocelyn knows Chance. Barney knows Mae. Lamar knows Burt. Jocelyn knows Cliff. Essie knows Jocelyn. Essie knows Nancy. Regina knows Jonathan. Elvira knows Regina. Kara knows Barney. Which of Cody and Chance can Wallace reach?", "answer": "Cody", "steps": [ "Wallace knows Kara.", "Kara knows Lamar.", "Lamar knows Loretta.", "Loretta knows Cody." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Wallace", "Duke", "Finn", "Mae", "Lamar", "Loretta", "Burt", "Kara", "Cody", "Barney", "Elvira", "Elijah", "Cliff", "Keira", "Essie", "Jocelyn", "Nancy", "Regina", "Chance", "Jonathan" ], "edges": [ [ 0, 7 ], [ 4, 6 ], [ 4, 5 ], [ 5, 2 ], [ 5, 8 ], [ 7, 1 ], [ 7, 4 ], [ 7, 9 ], [ 9, 3 ], [ 10, 17 ], [ 14, 16 ], [ 14, 15 ], [ 15, 12 ], [ 15, 18 ], [ 17, 11 ], [ 17, 14 ], [ 17, 19 ], [ 19, 13 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Luna knows Beatrice. Sadie knows Axel. Javier knows Julius. Ivy knows Loretta. Julia knows Louise. Olive knows Morris. Cornelius knows Curtis. Cornelius knows Ivy. Donald knows Cornelius. Nora knows Donald. Rita knows Javier. Nora knows Sadie. Beatrice knows Olive. Curtis knows Willis. Julius knows Max. Beatrice knows Rita. Cindy knows Nora. Javier knows Julia. Which of Javier and Cornelius can Cindy reach?", "answer": "Cornelius", "steps": [ "Cindy knows Nora.", "Nora knows Donald.", "Donald knows Cornelius." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Cindy", "Nora", "Donald", "Ivy", "Loretta", "Willis", "Cornelius", "Sadie", "Axel", "Curtis", "Luna", "Beatrice", "Rita", "Julia", "Louise", "Max", "Javier", "Olive", "Morris", "Julius" ], "edges": [ [ 0, 1 ], [ 1, 7 ], [ 1, 2 ], [ 2, 6 ], [ 3, 4 ], [ 6, 3 ], [ 6, 9 ], [ 7, 8 ], [ 9, 5 ], [ 10, 11 ], [ 11, 17 ], [ 11, 12 ], [ 12, 16 ], [ 13, 14 ], [ 16, 13 ], [ 16, 19 ], [ 17, 18 ], [ 19, 15 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Greta knows Derrick. Fleur knows Jana. Alan knows Leah. Leah knows Beau. Lucia knows Greta. Clayton knows Lucia. Alan knows Irma. Rebecca knows Celeste. Tina knows Yvonne. Greta knows Tina. Celeste knows Hayden. Yvonne knows Bella. Tina knows Emily. Hayden knows Alan. Derrick knows Lambert. Irma knows Mae. Irma knows Fleur. Teresa knows Clayton. Which of Lucia and Hayden can Teresa reach?", "answer": "Lucia", "steps": [ "Teresa knows Clayton.", "Clayton knows Lucia." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Teresa", "Lucia", "Clayton", "Derrick", "Tina", "Bella", "Greta", "Emily", "Lambert", "Yvonne", "Rebecca", "Hayden", "Celeste", "Leah", "Irma", "Jana", "Alan", "Mae", "Beau", "Fleur" ], "edges": [ [ 0, 2 ], [ 1, 6 ], [ 2, 1 ], [ 3, 8 ], [ 4, 7 ], [ 4, 9 ], [ 6, 3 ], [ 6, 4 ], [ 9, 5 ], [ 10, 12 ], [ 11, 16 ], [ 12, 11 ], [ 13, 18 ], [ 14, 17 ], [ 14, 19 ], [ 16, 13 ], [ 16, 14 ], [ 19, 15 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Mildred knows Annie. Allen knows Daphna. Mildred knows Aspen. Chris knows Jack. Daphna knows Blaine. Sidney knows Faye. Cara knows Allen. Annie knows Cara. Rhonda knows Ella. Alvin knows Mildred. Chantal knows Alejandro. Alejandro knows Sidney. Rhonda knows Rosemary. Della knows Esperanza. Jack knows Rhonda. Bella knows Chris. Esperanza knows Alvin. Ella knows Chantal. Which of Esperanza and Chris can Della reach?", "answer": "Esperanza", "steps": [ "Della knows Esperanza." ], "difficulty": 1, "original_distance": 8, "idx_to_symbol": [ "Della", "Blaine", "Daphna", "Mildred", "Aspen", "Esperanza", "Annie", "Cara", "Allen", "Alvin", "Bella", "Faye", "Sidney", "Rhonda", "Rosemary", "Chris", "Ella", "Chantal", "Alejandro", "Jack" ], "edges": [ [ 0, 5 ], [ 2, 1 ], [ 3, 4 ], [ 3, 6 ], [ 5, 9 ], [ 6, 7 ], [ 7, 8 ], [ 8, 2 ], [ 9, 3 ], [ 10, 15 ], [ 12, 11 ], [ 13, 14 ], [ 13, 16 ], [ 15, 19 ], [ 16, 17 ], [ 17, 18 ], [ 18, 12 ], [ 19, 13 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Jordan knows Emma. Duncan knows Jacqueline. Gina knows Jerome. Russ knows Gina. Emma knows Pat. Gina knows Griffith. Emma knows Conrad. Paula knows Homer. Pat knows Mabel. Mabel knows Russ. Jacqueline knows Cyrus. Daniella knows Fergus. Daniella knows Gabe. Lillian knows Daniella. Jacqueline knows Paula. Gina knows Mae. Homer knows Lillian. Daniella knows Elvira. Which of Griffith and Fergus can Duncan reach?", "answer": "Fergus", "steps": [ "Duncan knows Jacqueline.", "Jacqueline knows Paula.", "Paula knows Homer.", "Homer knows Lillian.", "Lillian knows Daniella.", "Daniella knows Fergus." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Duncan", "Daniella", "Paula", "Homer", "Jacqueline", "Gabe", "Fergus", "Elvira", "Lillian", "Cyrus", "Jordan", "Gina", "Pat", "Mabel", "Emma", "Mae", "Griffith", "Jerome", "Russ", "Conrad" ], "edges": [ [ 0, 4 ], [ 1, 5 ], [ 1, 6 ], [ 1, 7 ], [ 2, 3 ], [ 3, 8 ], [ 4, 2 ], [ 4, 9 ], [ 8, 1 ], [ 10, 14 ], [ 11, 15 ], [ 11, 16 ], [ 11, 17 ], [ 12, 13 ], [ 13, 18 ], [ 14, 12 ], [ 14, 19 ], [ 18, 11 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Samuel knows Walt. Dolly knows Sidney. Wilma knows Drake. Samuel knows Quinn. Drake knows Earl. Milton knows Dolly. Earl knows Milton. Samuel knows Albert. Eleanor knows Joyce. Samuel knows Eleanor. George knows Della. Earl knows Elias. Earl knows George. Arden knows Samuel. Joyce knows Jem. Earl knows Eli. Quinn knows Jaime. Stacy knows Arden. Which of Arden and Drake can Wilma reach?", "answer": "Drake", "steps": [ "Wilma knows Drake." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Wilma", "Della", "Dolly", "George", "Milton", "Earl", "Elias", "Drake", "Eli", "Sidney", "Stacy", "Jaime", "Joyce", "Quinn", "Eleanor", "Samuel", "Albert", "Arden", "Walt", "Jem" ], "edges": [ [ 0, 7 ], [ 2, 9 ], [ 3, 1 ], [ 4, 2 ], [ 5, 3 ], [ 5, 6 ], [ 5, 8 ], [ 5, 4 ], [ 7, 5 ], [ 10, 17 ], [ 12, 19 ], [ 13, 11 ], [ 14, 12 ], [ 15, 13 ], [ 15, 16 ], [ 15, 18 ], [ 15, 14 ], [ 17, 15 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Billy knows Renee. Wyatt knows Ernest. Evan knows Edison. Wyatt knows Linda. Erwin knows Andre. Hampton knows Evan. Maya knows Hampton. Ryan knows Carlton. Maya knows Leigh. Leigh knows Bernice. Leigh knows Kieran. Renee knows Erwin. Leigh knows Sonia. Wyatt knows Alvin. Renee knows Estelle. Billy knows Wyatt. Estelle knows Marc. Hampton knows Ryan. Which of Edison and Andre can Billy reach?", "answer": "Andre", "steps": [ "Billy knows Renee.", "Renee knows Erwin.", "Erwin knows Andre." ], "difficulty": 3, "original_distance": 3, "idx_to_symbol": [ "Billy", "Estelle", "Renee", "Marc", "Erwin", "Andre", "Ernest", "Wyatt", "Alvin", "Linda", "Maya", "Ryan", "Hampton", "Carlton", "Evan", "Edison", "Sonia", "Leigh", "Bernice", "Kieran" ], "edges": [ [ 0, 2 ], [ 0, 7 ], [ 1, 3 ], [ 2, 1 ], [ 2, 4 ], [ 4, 5 ], [ 7, 6 ], [ 7, 8 ], [ 7, 9 ], [ 10, 12 ], [ 10, 17 ], [ 11, 13 ], [ 12, 11 ], [ 12, 14 ], [ 14, 15 ], [ 17, 16 ], [ 17, 18 ], [ 17, 19 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Ernest knows Delilah. Ernest knows Abel. Eunice knows Frances. Sara knows Larry. Reid knows Oscar. Reid knows Loretta. Reid knows Edward. Parker knows Reid. Ernest knows Lawson. Lola knows Parker. Ernest knows Adrian. Graeme knows Gage. Frances knows Laura. Loretta knows William. Lawson knows Sara. Gage knows Ernest. Reid knows Eunice. Abel knows Tara. Which of Eunice and Lawson can Lola reach?", "answer": "Eunice", "steps": [ "Lola knows Parker.", "Parker knows Reid.", "Reid knows Eunice." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Lola", "Frances", "Reid", "Laura", "Loretta", "Parker", "Eunice", "Edward", "William", "Oscar", "Graeme", "Sara", "Ernest", "Larry", "Abel", "Gage", "Lawson", "Adrian", "Tara", "Delilah" ], "edges": [ [ 0, 5 ], [ 1, 3 ], [ 2, 6 ], [ 2, 7 ], [ 2, 4 ], [ 2, 9 ], [ 4, 8 ], [ 5, 2 ], [ 6, 1 ], [ 10, 15 ], [ 11, 13 ], [ 12, 16 ], [ 12, 17 ], [ 12, 14 ], [ 12, 19 ], [ 14, 18 ], [ 15, 12 ], [ 16, 11 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Eldon knows Yvonne. Chris knows Mara. Yvonne knows Imogen. Jessica knows Fraser. Vicki knows Veronica. Alma knows Duke. Zack knows Alma. Elvira knows Anita. Mara knows Celeste. Mara knows Jessica. Yvonne knows Luz. Mara knows Eileen. Mara knows Diane. Veronica knows Gene. Alma knows Chris. Yvonne knows Helen. Veronica knows Eldon. Yvonne knows Elvira. Which of Eldon and Chris can Vicki reach?", "answer": "Eldon", "steps": [ "Vicki knows Veronica.", "Veronica knows Eldon." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Vicki", "Gene", "Luz", "Elvira", "Helen", "Veronica", "Yvonne", "Eldon", "Anita", "Imogen", "Zack", "Duke", "Diane", "Jessica", "Eileen", "Alma", "Mara", "Chris", "Fraser", "Celeste" ], "edges": [ [ 0, 5 ], [ 3, 8 ], [ 5, 1 ], [ 5, 7 ], [ 6, 2 ], [ 6, 4 ], [ 6, 3 ], [ 6, 9 ], [ 7, 6 ], [ 10, 15 ], [ 13, 18 ], [ 15, 11 ], [ 15, 17 ], [ 16, 12 ], [ 16, 14 ], [ 16, 13 ], [ 16, 19 ], [ 17, 16 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Desmond knows Darwin. Joanna knows Delia. Brett knows Lawson. Joyce knows Annette. Horace knows Joyce. Trudy knows Rosa. Joanna knows Hardy. Delia knows Desmond. Hardy knows Horace. Connor knows Jim. Lawson knows Bob. Jim knows Gabriel. Delia knows Kieran. Brett knows Trudy. Kieran knows Clay. Gabriel knows Bart. Connor knows Brett. Bart knows Terrence. Which of Bart and Joyce can Joanna reach?", "answer": "Joyce", "steps": [ "Joanna knows Hardy.", "Hardy knows Horace.", "Horace knows Joyce." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Joanna", "Horace", "Darwin", "Hardy", "Joyce", "Annette", "Kieran", "Clay", "Delia", "Desmond", "Connor", "Gabriel", "Rosa", "Jim", "Bart", "Terrence", "Lawson", "Bob", "Brett", "Trudy" ], "edges": [ [ 0, 3 ], [ 0, 8 ], [ 1, 4 ], [ 3, 1 ], [ 4, 5 ], [ 6, 7 ], [ 8, 6 ], [ 8, 9 ], [ 9, 2 ], [ 10, 13 ], [ 10, 18 ], [ 11, 14 ], [ 13, 11 ], [ 14, 15 ], [ 16, 17 ], [ 18, 16 ], [ 18, 19 ], [ 19, 12 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Elton knows Keira. Gregory knows Fritz. Glen knows Austin. Shaun knows Elton. Keira knows Rocco. Hazel knows Shaun. Blake knows August. Shaun knows Emily. Celeste knows Houston. Barry knows Israel. Rosa knows Celeste. Bennett knows Bob. Gregory knows Blake. Fritz knows Drake. Houston knows Bennett. Bennett knows Gregory. Elton knows Barry. Austin knows Hazel. Which of Celeste and Austin can Glen reach?", "answer": "Austin", "steps": [ "Glen knows Austin." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Glen", "Hazel", "Austin", "Israel", "Rocco", "Elton", "Shaun", "Barry", "Emily", "Keira", "Rosa", "Houston", "Celeste", "Drake", "August", "Gregory", "Bennett", "Fritz", "Bob", "Blake" ], "edges": [ [ 0, 2 ], [ 1, 6 ], [ 2, 1 ], [ 5, 7 ], [ 5, 9 ], [ 6, 8 ], [ 6, 5 ], [ 7, 3 ], [ 9, 4 ], [ 10, 12 ], [ 11, 16 ], [ 12, 11 ], [ 15, 17 ], [ 15, 19 ], [ 16, 18 ], [ 16, 15 ], [ 17, 13 ], [ 19, 14 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Tyler knows Regina. Alfonso knows Greg. Patrick knows Tyler. Regina knows Etta. Russell knows Seth. Deirdre knows Hayley. Etta knows Raquel. Frances knows Alfonso. Regina knows Russell. Alfonso knows Bob. Axel knows Lars. Deirdre knows Frances. Patrick knows Blair. Hayley knows Miranda. Raquel knows Cara. Raquel knows Winifred. Lars knows Deirdre. Axel knows Jordan. Which of Deirdre and Regina can Patrick reach?", "answer": "Regina", "steps": [ "Patrick knows Tyler.", "Tyler knows Regina." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Patrick", "Russell", "Tyler", "Cara", "Seth", "Regina", "Etta", "Raquel", "Winifred", "Blair", "Axel", "Hayley", "Lars", "Bob", "Miranda", "Deirdre", "Frances", "Alfonso", "Greg", "Jordan" ], "edges": [ [ 0, 2 ], [ 0, 9 ], [ 1, 4 ], [ 2, 5 ], [ 5, 1 ], [ 5, 6 ], [ 6, 7 ], [ 7, 3 ], [ 7, 8 ], [ 10, 12 ], [ 10, 19 ], [ 11, 14 ], [ 12, 15 ], [ 15, 11 ], [ 15, 16 ], [ 16, 17 ], [ 17, 13 ], [ 17, 18 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Claudia knows Esperanza. Annette knows Janelle. Eden knows Elias. Felicia knows Annette. Rachel knows Eden. Clayton knows Rachel. Elias knows Wyatt. Esperanza knows Felicia. Annette knows Darren. Langston knows Clayton. Rachel knows Emma. Felicia knows Verna. Rachel knows Chance. Felicia knows Vincent. Darren knows Guy. Clarissa knows Etta. Eden knows Clarissa. Janelle knows Beth. Which of Esperanza and Clayton can Langston reach?", "answer": "Clayton", "steps": [ "Langston knows Clayton." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Langston", "Elias", "Etta", "Chance", "Wyatt", "Emma", "Eden", "Rachel", "Clarissa", "Clayton", "Claudia", "Darren", "Beth", "Verna", "Guy", "Vincent", "Annette", "Felicia", "Janelle", "Esperanza" ], "edges": [ [ 0, 9 ], [ 1, 4 ], [ 6, 1 ], [ 6, 8 ], [ 7, 3 ], [ 7, 5 ], [ 7, 6 ], [ 8, 2 ], [ 9, 7 ], [ 10, 19 ], [ 11, 14 ], [ 16, 11 ], [ 16, 18 ], [ 17, 13 ], [ 17, 15 ], [ 17, 16 ], [ 18, 12 ], [ 19, 17 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Hannah knows Leroy. Ronald knows Graeme. Ray knows Terry. Hannah knows Daisy. Troy knows Ronald. Graeme knows Rose. Terry knows Yvonne. Anna knows Ray. Ethan knows Archer. Rose knows Ethan. Candice knows Anna. Archer knows Chris. Candice knows Clarence. Yvonne knows Nelson. Hannah knows Troy. Nelson knows Skyler. Candice knows Patricia. Skyler knows Billy. Which of Graeme and Terry can Hannah reach?", "answer": "Graeme", "steps": [ "Hannah knows Troy.", "Troy knows Ronald.", "Ronald knows Graeme." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Hannah", "Ethan", "Troy", "Rose", "Ronald", "Archer", "Chris", "Daisy", "Graeme", "Leroy", "Candice", "Nelson", "Anna", "Yvonne", "Ray", "Skyler", "Billy", "Patricia", "Terry", "Clarence" ], "edges": [ [ 0, 7 ], [ 0, 2 ], [ 0, 9 ], [ 1, 5 ], [ 2, 4 ], [ 3, 1 ], [ 4, 8 ], [ 5, 6 ], [ 8, 3 ], [ 10, 17 ], [ 10, 12 ], [ 10, 19 ], [ 11, 15 ], [ 12, 14 ], [ 13, 11 ], [ 14, 18 ], [ 15, 16 ], [ 18, 13 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Daria knows Amanda. Joel knows Kevin. Otto knows Ibrahim. Jeffery knows Adelaide. Latoya knows Shaun. Amanda knows Esperanza. Brad knows Vera. Tiffany knows Crystal. Ava knows Latoya. Kevin knows Otto. Otto knows Ava. Esperanza knows Jeffery. Vera knows Tiffany. Esperanza knows Donna. Shaun knows Jenny. Dixie knows Conner. Tiffany knows Daria. Shaun knows Dixie. Which of Vera and Kevin can Joel reach?", "answer": "Kevin", "steps": [ "Joel knows Kevin." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Joel", "Otto", "Dixie", "Kevin", "Shaun", "Latoya", "Conner", "Jenny", "Ibrahim", "Ava", "Brad", "Tiffany", "Jeffery", "Vera", "Esperanza", "Amanda", "Adelaide", "Donna", "Crystal", "Daria" ], "edges": [ [ 0, 3 ], [ 1, 8 ], [ 1, 9 ], [ 2, 6 ], [ 3, 1 ], [ 4, 2 ], [ 4, 7 ], [ 5, 4 ], [ 9, 5 ], [ 10, 13 ], [ 11, 18 ], [ 11, 19 ], [ 12, 16 ], [ 13, 11 ], [ 14, 12 ], [ 14, 17 ], [ 15, 14 ], [ 19, 15 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Priscilla knows Julius. Brooks knows Ted. Daisy knows Haven. Viola knows Guy. Davis knows Reed. Guy knows Jamie. Bruce knows Lacey. Grant knows Grace. Julia knows Ibrahim. Lara knows Julia. Viola knows Dakota. Grace knows Daisy. Brooks knows Priscilla. Ted knows Cecilia. Priscilla knows Davis. Ibrahim knows Brooks. Lacey knows Grant. Grace knows Viola. Which of Brooks and Grace can Lara reach?", "answer": "Brooks", "steps": [ "Lara knows Julia.", "Julia knows Ibrahim.", "Ibrahim knows Brooks." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Lara", "Ted", "Julia", "Brooks", "Reed", "Priscilla", "Julius", "Cecilia", "Ibrahim", "Davis", "Bruce", "Daisy", "Lacey", "Grace", "Jamie", "Viola", "Dakota", "Haven", "Grant", "Guy" ], "edges": [ [ 0, 2 ], [ 1, 7 ], [ 2, 8 ], [ 3, 1 ], [ 3, 5 ], [ 5, 6 ], [ 5, 9 ], [ 8, 3 ], [ 9, 4 ], [ 10, 12 ], [ 11, 17 ], [ 12, 18 ], [ 13, 11 ], [ 13, 15 ], [ 15, 16 ], [ 15, 19 ], [ 18, 13 ], [ 19, 14 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Carol knows Hector. Dustin knows Kirsten. Regina knows Holly. Hadley knows Fisher. Holly knows Darrell. Darrell knows Hendrix. Russell knows Simon. Kirsten knows Morris. Regina knows Hailey. Hailey knows Hadley. Jocelyn knows Russell. Dana knows Julia. Kirsten knows Layla. Hendrix knows Dana. Morris knows Melanie. Dustin knows Jocelyn. Holly knows Diego. Melanie knows Carol. Which of Julia and Hector can Dustin reach?", "answer": "Hector", "steps": [ "Dustin knows Kirsten.", "Kirsten knows Morris.", "Morris knows Melanie.", "Melanie knows Carol.", "Carol knows Hector." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Dustin", "Layla", "Melanie", "Simon", "Carol", "Kirsten", "Russell", "Morris", "Jocelyn", "Hector", "Regina", "Diego", "Hendrix", "Fisher", "Dana", "Holly", "Hadley", "Darrell", "Hailey", "Julia" ], "edges": [ [ 0, 8 ], [ 0, 5 ], [ 2, 4 ], [ 4, 9 ], [ 5, 1 ], [ 5, 7 ], [ 6, 3 ], [ 7, 2 ], [ 8, 6 ], [ 10, 18 ], [ 10, 15 ], [ 12, 14 ], [ 14, 19 ], [ 15, 11 ], [ 15, 17 ], [ 16, 13 ], [ 17, 12 ], [ 18, 16 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Estella knows James. Cain knows Corey. Percy knows Hugh. Irving knows Maureen. Cody knows Melissa. Lara knows Patricia. Yvette knows Irving. Maureen knows Cole. Lara knows Percy. Irving knows Forrest. Maureen knows Estella. Percy knows Karl. Hugh knows Cody. Luz knows Lara. Melissa knows Karina. Maureen knows Hazel. Percy knows Dante. James knows Cain. Which of Percy and Maureen can Luz reach?", "answer": "Percy", "steps": [ "Luz knows Lara.", "Lara knows Percy." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Luz", "Hugh", "Lara", "Cody", "Melissa", "Patricia", "Percy", "Karl", "Dante", "Karina", "Yvette", "Estella", "Irving", "James", "Cain", "Forrest", "Maureen", "Cole", "Hazel", "Corey" ], "edges": [ [ 0, 2 ], [ 1, 3 ], [ 2, 5 ], [ 2, 6 ], [ 3, 4 ], [ 4, 9 ], [ 6, 7 ], [ 6, 8 ], [ 6, 1 ], [ 10, 12 ], [ 11, 13 ], [ 12, 15 ], [ 12, 16 ], [ 13, 14 ], [ 14, 19 ], [ 16, 17 ], [ 16, 18 ], [ 16, 11 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Frida knows Jewel. Morgan knows Frida. Blanche knows Bert. Angela knows Horace. Bert knows Morgan. Clement knows Blanche. Bernadette knows Lloyd. Jewel knows Magdalena. Amber knows Rita. Archer knows Angela. Lloyd knows Juan. Angela knows Lilia. Lilia knows Melody. Melody knows Jeffery. Yvette knows Amber. Horace knows Violet. Violet knows Bernadette. Blanche knows Yvette. Which of Frida and Bernadette can Archer reach?", "answer": "Bernadette", "steps": [ "Archer knows Angela.", "Angela knows Horace.", "Horace knows Violet.", "Violet knows Bernadette." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Archer", "Angela", "Juan", "Bernadette", "Violet", "Melody", "Jeffery", "Horace", "Lloyd", "Lilia", "Clement", "Blanche", "Magdalena", "Frida", "Morgan", "Amber", "Rita", "Bert", "Jewel", "Yvette" ], "edges": [ [ 0, 1 ], [ 1, 7 ], [ 1, 9 ], [ 3, 8 ], [ 4, 3 ], [ 5, 6 ], [ 7, 4 ], [ 8, 2 ], [ 9, 5 ], [ 10, 11 ], [ 11, 17 ], [ 11, 19 ], [ 13, 18 ], [ 14, 13 ], [ 15, 16 ], [ 17, 14 ], [ 18, 12 ], [ 19, 15 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Mildred knows Gabriel. Louise knows Nash. Sharon knows Gustavo. Boris knows Angela. Louise knows Kobe. Corey knows Horace. Boris knows Selena. Gail knows Bryan. Gail knows Gavin. Corey knows Wilbur. Corey knows John. Boris knows Lois. Lars knows Boris. Nash knows Gail. Sharon knows Emmett. Mildred knows Lars. Nash knows Corey. Lars knows Sharon. Which of Sharon and Gail can Mildred reach?", "answer": "Sharon", "steps": [ "Mildred knows Lars.", "Lars knows Sharon." ], "difficulty": 2, "original_distance": 3, "idx_to_symbol": [ "Mildred", "Angela", "Sharon", "Lars", "Emmett", "Gustavo", "Lois", "Selena", "Boris", "Gabriel", "Louise", "Wilbur", "Gail", "Nash", "Bryan", "Gavin", "John", "Horace", "Corey", "Kobe" ], "edges": [ [ 0, 3 ], [ 0, 9 ], [ 2, 4 ], [ 2, 5 ], [ 3, 2 ], [ 3, 8 ], [ 8, 1 ], [ 8, 6 ], [ 8, 7 ], [ 10, 13 ], [ 10, 19 ], [ 12, 14 ], [ 12, 15 ], [ 13, 12 ], [ 13, 18 ], [ 18, 11 ], [ 18, 16 ], [ 18, 17 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Catherine knows Cameron. Gunnar knows Walt. Gunnar knows Fraser. Gunnar knows Wade. Beatrice knows Catherine. Brody knows Wesley. Ronald knows Brody. Clark knows Maria. Beatrice knows Dennis. Ronald knows Arthur. Lillian knows Tonya. Dennis knows Harley. Fraser knows Clarissa. Ronald knows Gunnar. Catherine knows Lillian. Beatrice knows Clark. Catherine knows Adrian. Arthur knows Todd. Which of Tonya and Clarissa can Ronald reach?", "answer": "Clarissa", "steps": [ "Ronald knows Gunnar.", "Gunnar knows Fraser.", "Fraser knows Clarissa." ], "difficulty": 3, "original_distance": 3, "idx_to_symbol": [ "Ronald", "Gunnar", "Clarissa", "Brody", "Wade", "Wesley", "Todd", "Arthur", "Fraser", "Walt", "Beatrice", "Catherine", "Tonya", "Clark", "Adrian", "Maria", "Harley", "Dennis", "Lillian", "Cameron" ], "edges": [ [ 0, 3 ], [ 0, 7 ], [ 0, 1 ], [ 1, 4 ], [ 1, 8 ], [ 1, 9 ], [ 3, 5 ], [ 7, 6 ], [ 8, 2 ], [ 10, 13 ], [ 10, 17 ], [ 10, 11 ], [ 11, 14 ], [ 11, 18 ], [ 11, 19 ], [ 13, 15 ], [ 17, 16 ], [ 18, 12 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Chase knows Eve. Gloria knows Fern. Elodie knows Loretta. Clifford knows Holden. Elodie knows Clifford. Jasper knows Eduardo. Lynn knows Alice. Holden knows Owen. Eduardo knows Rufus. Eve knows Elodie. Rufus knows Gloria. Dave knows Lynn. Chase knows Jacques. Rufus knows Vance. Kurt knows Chase. Lynn knows Jasper. Eduardo knows Heath. Clifford knows Kareem. Which of Holden and Gloria can Kurt reach?", "answer": "Holden", "steps": [ "Kurt knows Chase.", "Chase knows Eve.", "Eve knows Elodie.", "Elodie knows Clifford.", "Clifford knows Holden." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Kurt", "Chase", "Clifford", "Jacques", "Elodie", "Owen", "Holden", "Kareem", "Eve", "Loretta", "Dave", "Lynn", "Rufus", "Alice", "Eduardo", "Fern", "Gloria", "Vance", "Jasper", "Heath" ], "edges": [ [ 0, 1 ], [ 1, 3 ], [ 1, 8 ], [ 2, 6 ], [ 2, 7 ], [ 4, 2 ], [ 4, 9 ], [ 6, 5 ], [ 8, 4 ], [ 10, 11 ], [ 11, 13 ], [ 11, 18 ], [ 12, 16 ], [ 12, 17 ], [ 14, 12 ], [ 14, 19 ], [ 16, 15 ], [ 18, 14 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Jeffery knows Enrique. Aubrey knows Benjamin. Dane knows Aubrey. Keith knows Abel. Abel knows Louisa. Wendy knows Freya. Devon knows Dane. Keith knows Graeme. Aubrey knows Wendy. Benjamin knows Sheila. Aubrey knows Simon. Kylie knows Albert. Wendy knows Julian. Abel knows Karina. Sheila knows Kira. Albert knows Marlene. Enrique knows Keith. Keith knows Kylie. Which of Keith and Aubrey can Jeffery reach?", "answer": "Keith", "steps": [ "Jeffery knows Enrique.", "Enrique knows Keith." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Jeffery", "Graeme", "Enrique", "Abel", "Albert", "Kylie", "Karina", "Marlene", "Louisa", "Keith", "Devon", "Simon", "Dane", "Wendy", "Sheila", "Benjamin", "Freya", "Kira", "Julian", "Aubrey" ], "edges": [ [ 0, 2 ], [ 2, 9 ], [ 3, 6 ], [ 3, 8 ], [ 4, 7 ], [ 5, 4 ], [ 9, 1 ], [ 9, 5 ], [ 9, 3 ], [ 10, 12 ], [ 12, 19 ], [ 13, 16 ], [ 13, 18 ], [ 14, 17 ], [ 15, 14 ], [ 19, 11 ], [ 19, 15 ], [ 19, 13 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Jillian knows Martin. Esme knows Amy. Tina knows Hayes. Jodi knows Hubert. Hayes knows Anthony. Donald knows Jodi. Houston knows Cornelius. Tina knows Emery. Hubert knows Janelle. Donald knows Alejandro. Donald knows Ember. Ember knows Arturo. Cornelius knows Nina. Tina knows Houston. Ember knows Mildred. Hayes knows Eduardo. Anthony knows Esme. Arturo knows Jillian. Which of Ember and Hayes can Tina reach?", "answer": "Hayes", "steps": [ "Tina knows Hayes." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Tina", "Esme", "Hayes", "Houston", "Emery", "Amy", "Eduardo", "Anthony", "Cornelius", "Nina", "Donald", "Jillian", "Ember", "Jodi", "Alejandro", "Martin", "Mildred", "Arturo", "Hubert", "Janelle" ], "edges": [ [ 0, 4 ], [ 0, 2 ], [ 0, 3 ], [ 1, 5 ], [ 2, 6 ], [ 2, 7 ], [ 3, 8 ], [ 7, 1 ], [ 8, 9 ], [ 10, 14 ], [ 10, 12 ], [ 10, 13 ], [ 11, 15 ], [ 12, 16 ], [ 12, 17 ], [ 13, 18 ], [ 17, 11 ], [ 18, 19 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Fergus knows Annie. Edith knows Caroline. Ramona knows Preston. Esther knows Dayton. Caroline knows Fergus. Preston knows Duncan. Darwin knows Frank. Frank knows Andrew. Duncan knows Garrett. Hugo knows Isaac. Preston knows Effie. Duncan knows Edith. Frank knows Lamont. Isaac knows Everett. Lamont knows Esther. Edith knows Morgan. Lamont knows Kelsey. Esther knows Hugo. Which of Hugo and Caroline can Ramona reach?", "answer": "Caroline", "steps": [ "Ramona knows Preston.", "Preston knows Duncan.", "Duncan knows Edith.", "Edith knows Caroline." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Ramona", "Caroline", "Edith", "Fergus", "Garrett", "Effie", "Annie", "Morgan", "Duncan", "Preston", "Darwin", "Hugo", "Esther", "Isaac", "Kelsey", "Andrew", "Everett", "Dayton", "Lamont", "Frank" ], "edges": [ [ 0, 9 ], [ 1, 3 ], [ 2, 1 ], [ 2, 7 ], [ 3, 6 ], [ 8, 4 ], [ 8, 2 ], [ 9, 5 ], [ 9, 8 ], [ 10, 19 ], [ 11, 13 ], [ 12, 11 ], [ 12, 17 ], [ 13, 16 ], [ 18, 14 ], [ 18, 12 ], [ 19, 15 ], [ 19, 18 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Mildred knows Annie. Allen knows Daphna. Mildred knows Aspen. Chris knows Jack. Daphna knows Blaine. Sidney knows Faye. Cara knows Allen. Annie knows Cara. Rhonda knows Ella. Alvin knows Mildred. Chantal knows Alejandro. Alejandro knows Sidney. Rhonda knows Rosemary. Della knows Esperanza. Jack knows Rhonda. Bella knows Chris. Esperanza knows Alvin. Ella knows Chantal. Which of Daphna and Sidney can Della reach?", "answer": "Daphna", "steps": [ "Della knows Esperanza.", "Esperanza knows Alvin.", "Alvin knows Mildred.", "Mildred knows Annie.", "Annie knows Cara.", "Cara knows Allen.", "Allen knows Daphna." ], "difficulty": 7, "original_distance": 8, "idx_to_symbol": [ "Della", "Blaine", "Daphna", "Mildred", "Aspen", "Esperanza", "Annie", "Cara", "Allen", "Alvin", "Bella", "Faye", "Sidney", "Rhonda", "Rosemary", "Chris", "Ella", "Chantal", "Alejandro", "Jack" ], "edges": [ [ 0, 5 ], [ 2, 1 ], [ 3, 4 ], [ 3, 6 ], [ 5, 9 ], [ 6, 7 ], [ 7, 8 ], [ 8, 2 ], [ 9, 3 ], [ 10, 15 ], [ 12, 11 ], [ 13, 14 ], [ 13, 16 ], [ 15, 19 ], [ 16, 17 ], [ 17, 18 ], [ 18, 12 ], [ 19, 13 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Trina knows Martin. Ruby knows Christina. Christina knows Ariel. Enrique knows Celia. Enrique knows Arnold. Jermaine knows Andre. Arnold knows Tonya. Malik knows Enrique. Eric knows Edwin. Christina knows Tara. Ariel knows Eric. Kenneth knows Lynn. Tonya knows Cornelius. Dolly knows Pat. Tara knows Jermaine. Cornelius knows Trina. Celia knows Kenneth. Andre knows Dolly. Which of Andre and Cornelius can Malik reach?", "answer": "Cornelius", "steps": [ "Malik knows Enrique.", "Enrique knows Arnold.", "Arnold knows Tonya.", "Tonya knows Cornelius." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Malik", "Lynn", "Celia", "Kenneth", "Cornelius", "Arnold", "Enrique", "Trina", "Martin", "Tonya", "Ruby", "Edwin", "Ariel", "Eric", "Andre", "Tara", "Christina", "Dolly", "Pat", "Jermaine" ], "edges": [ [ 0, 6 ], [ 2, 3 ], [ 3, 1 ], [ 4, 7 ], [ 5, 9 ], [ 6, 2 ], [ 6, 5 ], [ 7, 8 ], [ 9, 4 ], [ 10, 16 ], [ 12, 13 ], [ 13, 11 ], [ 14, 17 ], [ 15, 19 ], [ 16, 12 ], [ 16, 15 ], [ 17, 18 ], [ 19, 14 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Erik knows Nicole. Kerry knows Martin. Lyle knows Jacqueline. Pablo knows Eugenia. Hayden knows Carlton. Bart knows Alan. Kerry knows Darius. Zane knows Nadine. Richard knows Shelly. Zane knows Pablo. Martin knows Wanda. Stefan knows Zane. Kerry knows Bart. Stefan knows Erik. Zane knows Richard. Lyle knows Hayden. Lyle knows Kerry. Stefan knows Liam. Which of Bart and Richard can Lyle reach?", "answer": "Bart", "steps": [ "Lyle knows Kerry.", "Kerry knows Bart." ], "difficulty": 2, "original_distance": 3, "idx_to_symbol": [ "Lyle", "Carlton", "Bart", "Hayden", "Kerry", "Alan", "Martin", "Darius", "Jacqueline", "Wanda", "Stefan", "Nicole", "Richard", "Erik", "Zane", "Shelly", "Pablo", "Nadine", "Liam", "Eugenia" ], "edges": [ [ 0, 3 ], [ 0, 8 ], [ 0, 4 ], [ 2, 5 ], [ 3, 1 ], [ 4, 2 ], [ 4, 7 ], [ 4, 6 ], [ 6, 9 ], [ 10, 13 ], [ 10, 18 ], [ 10, 14 ], [ 12, 15 ], [ 13, 11 ], [ 14, 12 ], [ 14, 17 ], [ 14, 16 ], [ 16, 19 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Kent knows Spencer. Virginia knows Stanley. Desmond knows Seth. Erwin knows Stuart. Stuart knows Clarissa. Kira knows Harlan. Virginia knows Pierce. Virginia knows Douglas. Douglas knows Amanda. Erwin knows Kent. Kent knows Quinn. Tony knows Erwin. Gage knows Dalton. Seth knows Gage. Kent knows Kira. Virginia knows Chad. Seth knows Virginia. Kent knows Darnell. Which of Virginia and Kent can Tony reach?", "answer": "Kent", "steps": [ "Tony knows Erwin.", "Erwin knows Kent." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Tony", "Spencer", "Erwin", "Clarissa", "Stuart", "Kent", "Kira", "Harlan", "Darnell", "Quinn", "Desmond", "Pierce", "Seth", "Dalton", "Gage", "Virginia", "Douglas", "Amanda", "Chad", "Stanley" ], "edges": [ [ 0, 2 ], [ 2, 4 ], [ 2, 5 ], [ 4, 3 ], [ 5, 1 ], [ 5, 6 ], [ 5, 8 ], [ 5, 9 ], [ 6, 7 ], [ 10, 12 ], [ 12, 14 ], [ 12, 15 ], [ 14, 13 ], [ 15, 11 ], [ 15, 16 ], [ 15, 18 ], [ 15, 19 ], [ 16, 17 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Kate knows Archer. Zoe knows Eva. Joel knows Annie. Yara knows Iris. Imogen knows Katrina. Archer knows Penny. Joyce knows Della. Joel knows Yara. Joyce knows Alejandro. Della knows Mary. Katrina knows Ada. Holden knows Imogen. Holly knows Ernie. Eva knows Joyce. Imogen knows Holly. Knox knows Kate. Kate knows Zoe. Ada knows Joel. Which of Yara and Della can Holden reach?", "answer": "Yara", "steps": [ "Holden knows Imogen.", "Imogen knows Katrina.", "Katrina knows Ada.", "Ada knows Joel.", "Joel knows Yara." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Holden", "Annie", "Ada", "Ernie", "Iris", "Imogen", "Yara", "Joel", "Holly", "Katrina", "Knox", "Alejandro", "Eva", "Penny", "Mary", "Kate", "Della", "Joyce", "Archer", "Zoe" ], "edges": [ [ 0, 5 ], [ 2, 7 ], [ 5, 8 ], [ 5, 9 ], [ 6, 4 ], [ 7, 1 ], [ 7, 6 ], [ 8, 3 ], [ 9, 2 ], [ 10, 15 ], [ 12, 17 ], [ 15, 18 ], [ 15, 19 ], [ 16, 14 ], [ 17, 11 ], [ 17, 16 ], [ 18, 13 ], [ 19, 12 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Lola knows Tristan. Tristan knows Arthur. Hal knows Sandra. Eleanor knows Hal. Marcus knows Greg. Regina knows Marcus. Aisha knows Chloe. Greg knows Sally. Beth knows Eleanor. Arthur knows Aisha. Ben knows Grace. Sandra knows Peter. Tristan knows Brandon. Peter knows Ray. Grace knows Beth. Sally knows Lola. Ray knows Edwin. Sandra knows Leo. Which of Hal and Lola can Ben reach?", "answer": "Hal", "steps": [ "Ben knows Grace.", "Grace knows Beth.", "Beth knows Eleanor.", "Eleanor knows Hal." ], "difficulty": 4, "original_distance": 8, "idx_to_symbol": [ "Ben", "Peter", "Edwin", "Ray", "Sandra", "Hal", "Grace", "Eleanor", "Beth", "Leo", "Regina", "Arthur", "Chloe", "Aisha", "Tristan", "Lola", "Marcus", "Sally", "Greg", "Brandon" ], "edges": [ [ 0, 6 ], [ 1, 3 ], [ 3, 2 ], [ 4, 1 ], [ 4, 9 ], [ 5, 4 ], [ 6, 8 ], [ 7, 5 ], [ 8, 7 ], [ 10, 16 ], [ 11, 13 ], [ 13, 12 ], [ 14, 11 ], [ 14, 19 ], [ 15, 14 ], [ 16, 18 ], [ 17, 15 ], [ 18, 17 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Eve knows Glen. Jolena knows Florence. Frank knows Spencer. Milton knows Lucia. Milton knows Carlos. Beth knows Ursula. Winifred knows Frank. Carlos knows Nicholas. Edmund knows Vanessa. Aisha knows Lucas. Lucas knows Harmony. Edmund knows Eve. Jolena knows Aisha. Beth knows Winifred. Edmund knows Jolena. Edmund knows Darwin. Milton knows Beth. Milton knows Marvin. Which of Beth and Jolena can Milton reach?", "answer": "Beth", "steps": [ "Milton knows Beth." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Milton", "Frank", "Carlos", "Spencer", "Nicholas", "Beth", "Ursula", "Marvin", "Winifred", "Lucia", "Edmund", "Lucas", "Eve", "Harmony", "Glen", "Jolena", "Florence", "Vanessa", "Aisha", "Darwin" ], "edges": [ [ 0, 2 ], [ 0, 7 ], [ 0, 5 ], [ 0, 9 ], [ 1, 3 ], [ 2, 4 ], [ 5, 6 ], [ 5, 8 ], [ 8, 1 ], [ 10, 12 ], [ 10, 17 ], [ 10, 15 ], [ 10, 19 ], [ 11, 13 ], [ 12, 14 ], [ 15, 16 ], [ 15, 18 ], [ 18, 11 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Natalie knows Trina. Philip knows Kelsey. Xander knows Lawson. Charles knows Harmony. Harris knows Gareth. Kelsey knows Natalie. Antonio knows Gonzalo. Veronica knows Daria. Philip knows Veronica. Kelsey knows Blake. Charles knows Joaquin. Lawson knows Alice. Trina knows Michelle. Harris knows Philip. Harmony knows Antonio. Alice knows Perry. Xander knows Heath. Lawson knows Charles. Which of Philip and Lawson can Harris reach?", "answer": "Philip", "steps": [ "Harris knows Philip." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Harris", "Philip", "Daria", "Veronica", "Trina", "Blake", "Gareth", "Kelsey", "Natalie", "Michelle", "Xander", "Lawson", "Perry", "Alice", "Antonio", "Joaquin", "Heath", "Charles", "Harmony", "Gonzalo" ], "edges": [ [ 0, 6 ], [ 0, 1 ], [ 1, 3 ], [ 1, 7 ], [ 3, 2 ], [ 4, 9 ], [ 7, 5 ], [ 7, 8 ], [ 8, 4 ], [ 10, 16 ], [ 10, 11 ], [ 11, 13 ], [ 11, 17 ], [ 13, 12 ], [ 14, 19 ], [ 17, 15 ], [ 17, 18 ], [ 18, 14 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Freya knows Everett. Gonzalo knows Hardy. Freya knows Kay. Morgan knows Houston. Hannah knows Elton. Will knows Evelyn. Everett knows Hannah. Hardy knows Morgan. Beverly knows Harper. Zach knows Preston. Morgan knows Beth. Kay knows Beverly. Walt knows Katherine. Gonzalo knows Zach. Preston knows Will. Elton knows Diana. Beverly knows Walt. Houston knows Herbert. Which of Hardy and Kay can Freya reach?", "answer": "Kay", "steps": [ "Freya knows Kay." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Freya", "Beverly", "Kay", "Diana", "Everett", "Harper", "Walt", "Elton", "Katherine", "Hannah", "Gonzalo", "Morgan", "Hardy", "Evelyn", "Zach", "Beth", "Houston", "Will", "Herbert", "Preston" ], "edges": [ [ 0, 2 ], [ 0, 4 ], [ 1, 5 ], [ 1, 6 ], [ 2, 1 ], [ 4, 9 ], [ 6, 8 ], [ 7, 3 ], [ 9, 7 ], [ 10, 12 ], [ 10, 14 ], [ 11, 15 ], [ 11, 16 ], [ 12, 11 ], [ 14, 19 ], [ 16, 18 ], [ 17, 13 ], [ 19, 17 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Leon knows Richard. Carrie knows Eldon. Carrie knows Freya. Conrad knows Zoe. Eldon knows Marian. Inez knows Leon. Dahlia knows Beatrice. Kieran knows Erma. Emery knows Vincent. Beatrice knows Kieran. Frankie knows Emery. Erma knows Goldie. Richard knows Bailey. Dahlia knows Conrad. Marian knows Neal. Freya knows Yolanda. Goldie knows Frankie. Neal knows Inez. Which of Frankie and Leon can Dahlia reach?", "answer": "Frankie", "steps": [ "Dahlia knows Beatrice.", "Beatrice knows Kieran.", "Kieran knows Erma.", "Erma knows Goldie.", "Goldie knows Frankie." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Dahlia", "Erma", "Conrad", "Goldie", "Kieran", "Beatrice", "Emery", "Vincent", "Zoe", "Frankie", "Carrie", "Neal", "Freya", "Inez", "Marian", "Eldon", "Richard", "Bailey", "Yolanda", "Leon" ], "edges": [ [ 0, 2 ], [ 0, 5 ], [ 1, 3 ], [ 2, 8 ], [ 3, 9 ], [ 4, 1 ], [ 5, 4 ], [ 6, 7 ], [ 9, 6 ], [ 10, 12 ], [ 10, 15 ], [ 11, 13 ], [ 12, 18 ], [ 13, 19 ], [ 14, 11 ], [ 15, 14 ], [ 16, 17 ], [ 19, 16 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Hayden knows Louisa. Louisa knows Kelsey. Milton knows Bart. Peter knows Seth. Layla knows Keaton. Lottie knows Kerry. Amber knows Milton. Jesse knows Sally. Layla knows Joshua. Esperanza knows Darla. Lottie knows Robin. Sally knows Estella. Luella knows Jesse. Darla knows Layla. Seth knows Esperanza. Bart knows Lottie. Estella knows Amber. Kelsey knows Peter. Which of Jesse and Louisa can Hayden reach?", "answer": "Louisa", "steps": [ "Hayden knows Louisa." ], "difficulty": 1, "original_distance": 8, "idx_to_symbol": [ "Hayden", "Esperanza", "Louisa", "Peter", "Kelsey", "Joshua", "Keaton", "Darla", "Layla", "Seth", "Luella", "Milton", "Jesse", "Estella", "Sally", "Robin", "Kerry", "Bart", "Lottie", "Amber" ], "edges": [ [ 0, 2 ], [ 1, 7 ], [ 2, 4 ], [ 3, 9 ], [ 4, 3 ], [ 7, 8 ], [ 8, 5 ], [ 8, 6 ], [ 9, 1 ], [ 10, 12 ], [ 11, 17 ], [ 12, 14 ], [ 13, 19 ], [ 14, 13 ], [ 17, 18 ], [ 18, 15 ], [ 18, 16 ], [ 19, 11 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Arden knows Wendy. Herman knows Andre. Dawn knows Jacob. Bert knows Clarissa. Damien knows Faith. Elise knows Dawn. Dawn knows Selena. Clarissa knows Harper. Bert knows Arden. Justine knows Darwin. Trevor knows Justine. Wendy knows Claudia. Elise knows Hector. Trevor knows Damien. Faith knows Elise. Claudia knows Ernie. Claudia knows Herman. Herman knows Priscilla. Which of Andre and Selena can Bert reach?", "answer": "Andre", "steps": [ "Bert knows Arden.", "Arden knows Wendy.", "Wendy knows Claudia.", "Claudia knows Herman.", "Herman knows Andre." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Bert", "Clarissa", "Claudia", "Wendy", "Ernie", "Andre", "Priscilla", "Harper", "Herman", "Arden", "Trevor", "Justine", "Elise", "Faith", "Hector", "Selena", "Jacob", "Darwin", "Dawn", "Damien" ], "edges": [ [ 0, 1 ], [ 0, 9 ], [ 1, 7 ], [ 2, 4 ], [ 2, 8 ], [ 3, 2 ], [ 8, 5 ], [ 8, 6 ], [ 9, 3 ], [ 10, 11 ], [ 10, 19 ], [ 11, 17 ], [ 12, 14 ], [ 12, 18 ], [ 13, 12 ], [ 18, 15 ], [ 18, 16 ], [ 19, 13 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Lucy knows Dennis. Wendy knows Myrtle. Charlotte knows Bette. Charlotte knows Becky. Jay knows April. Dennis knows Jay. Wendy knows Edgar. Merle knows Chester. Merle knows Jeremiah. Edgar knows Rachel. Ashton knows Charlotte. Myrtle knows Clarence. Charlotte knows Wanda. Rachel knows Ashton. Jeremiah knows Brock. Jay knows Edmund. Chester knows Lucy. Jay knows Fernando. Which of Rachel and Lucy can Merle reach?", "answer": "Lucy", "steps": [ "Merle knows Chester.", "Chester knows Lucy." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Merle", "Lucy", "Fernando", "Brock", "April", "Chester", "Jay", "Jeremiah", "Edmund", "Dennis", "Wendy", "Rachel", "Bette", "Clarence", "Wanda", "Edgar", "Charlotte", "Myrtle", "Becky", "Ashton" ], "edges": [ [ 0, 7 ], [ 0, 5 ], [ 1, 9 ], [ 5, 1 ], [ 6, 2 ], [ 6, 4 ], [ 6, 8 ], [ 7, 3 ], [ 9, 6 ], [ 10, 17 ], [ 10, 15 ], [ 11, 19 ], [ 15, 11 ], [ 16, 12 ], [ 16, 14 ], [ 16, 18 ], [ 17, 13 ], [ 19, 16 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Whitney knows Giselle. Preston knows Bonnie. Laura knows Jakob. Whitney knows Rick. Zara knows Benjamin. William knows Kirsten. Hilda knows Whitney. Benjamin knows Dixie. Bailey knows Hilda. Laura knows Erica. William knows Maureen. Griffith knows Zara. Laura knows Lorenzo. Zara knows Laura. Hilda knows William. Jakob knows Alice. Benjamin knows Elizabeth. Whitney knows Preston. Which of Zara and Hilda can Bailey reach?", "answer": "Hilda", "steps": [ "Bailey knows Hilda." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Bailey", "William", "Maureen", "Whitney", "Kirsten", "Bonnie", "Giselle", "Rick", "Hilda", "Preston", "Griffith", "Benjamin", "Elizabeth", "Laura", "Dixie", "Alice", "Lorenzo", "Erica", "Zara", "Jakob" ], "edges": [ [ 0, 8 ], [ 1, 2 ], [ 1, 4 ], [ 3, 6 ], [ 3, 7 ], [ 3, 9 ], [ 8, 1 ], [ 8, 3 ], [ 9, 5 ], [ 10, 18 ], [ 11, 12 ], [ 11, 14 ], [ 13, 16 ], [ 13, 17 ], [ 13, 19 ], [ 18, 11 ], [ 18, 13 ], [ 19, 15 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Marshall knows Heather. Ida knows Deanna. Edgar knows Edward. Scott knows Darius. Darius knows Ida. Cole knows Felicia. Samantha knows Cole. Robin knows Scott. Julian knows Blanche. Darius knows Samantha. Felicia knows Morris. Heather knows Luther. Marshall knows Edgar. Aurora knows Marshall. Blanche knows Aurora. Luther knows Fleur. Fleur knows Hilda. Joy knows Robin. Which of Aurora and Scott can Julian reach?", "answer": "Aurora", "steps": [ "Julian knows Blanche.", "Blanche knows Aurora." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Julian", "Fleur", "Edward", "Marshall", "Luther", "Hilda", "Blanche", "Aurora", "Edgar", "Heather", "Joy", "Felicia", "Deanna", "Darius", "Cole", "Morris", "Robin", "Scott", "Ida", "Samantha" ], "edges": [ [ 0, 6 ], [ 1, 5 ], [ 3, 8 ], [ 3, 9 ], [ 4, 1 ], [ 6, 7 ], [ 7, 3 ], [ 8, 2 ], [ 9, 4 ], [ 10, 16 ], [ 11, 15 ], [ 13, 18 ], [ 13, 19 ], [ 14, 11 ], [ 16, 17 ], [ 17, 13 ], [ 18, 12 ], [ 19, 14 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Ernesto knows Gerald. Sadie knows Jenna. Bernard knows Theodore. Karen knows Gloria. Steve knows Daisy. Yvonne knows Eloise. Bernard knows Steve. Gertrude knows Dorothy. Sadie knows Allison. Jenna knows Ernesto. Jenna knows Irene. Erin knows Yvonne. Allison knows Karen. Jenna knows Gus. Theodore knows Gertrude. Steve knows Erin. Steve knows Leander. Gerald knows Kaleb. Which of Erin and Ernesto can Sadie reach?", "answer": "Ernesto", "steps": [ "Sadie knows Jenna.", "Jenna knows Ernesto." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Sadie", "Gloria", "Gus", "Jenna", "Irene", "Allison", "Gerald", "Ernesto", "Kaleb", "Karen", "Bernard", "Dorothy", "Leander", "Steve", "Daisy", "Theodore", "Yvonne", "Erin", "Eloise", "Gertrude" ], "edges": [ [ 0, 3 ], [ 0, 5 ], [ 3, 2 ], [ 3, 4 ], [ 3, 7 ], [ 5, 9 ], [ 6, 8 ], [ 7, 6 ], [ 9, 1 ], [ 10, 13 ], [ 10, 15 ], [ 13, 12 ], [ 13, 14 ], [ 13, 17 ], [ 15, 19 ], [ 16, 18 ], [ 17, 16 ], [ 19, 11 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Maude knows Amelia. Will knows Louisa. Abby knows Gerald. Valerie knows Charles. Cain knows Florence. Ezra knows Elsa. Lars knows Will. Ingrid knows Jolena. Pat knows Cain. Maude knows Abby. Louisa knows Julius. Abby knows Ingrid. Abby knows Lawson. Celeste knows Luz. Lawson knows Pat. Celeste knows Ezra. Celeste knows Lars. Valerie knows Celeste. Which of Louisa and Cain can Valerie reach?", "answer": "Louisa", "steps": [ "Valerie knows Celeste.", "Celeste knows Lars.", "Lars knows Will.", "Will knows Louisa." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Valerie", "Lars", "Julius", "Luz", "Elsa", "Charles", "Will", "Louisa", "Ezra", "Celeste", "Maude", "Lawson", "Florence", "Gerald", "Jolena", "Amelia", "Pat", "Cain", "Ingrid", "Abby" ], "edges": [ [ 0, 5 ], [ 0, 9 ], [ 1, 6 ], [ 6, 7 ], [ 7, 2 ], [ 8, 4 ], [ 9, 3 ], [ 9, 1 ], [ 9, 8 ], [ 10, 15 ], [ 10, 19 ], [ 11, 16 ], [ 16, 17 ], [ 17, 12 ], [ 18, 14 ], [ 19, 13 ], [ 19, 11 ], [ 19, 18 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Mary knows Callum. Joanna knows Eve. Lane knows Anastasia. Lennox knows Gladys. Burt knows Karen. Cordelia knows Lennox. Anastasia knows Burt. Callum knows Hamilton. Joanna knows Antonio. Lennox knows Cristina. Anastasia knows Jeremiah. Karen knows Leander. Annie knows Lisa. Annie knows Guillermo. Karen knows Jewel. Callum knows Cordelia. Cristina knows Joanna. Leander knows Annie. Which of Lennox and Karen can Mary reach?", "answer": "Lennox", "steps": [ "Mary knows Callum.", "Callum knows Cordelia.", "Cordelia knows Lennox." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Mary", "Lennox", "Antonio", "Eve", "Cristina", "Hamilton", "Joanna", "Gladys", "Cordelia", "Callum", "Lane", "Karen", "Lisa", "Guillermo", "Leander", "Jeremiah", "Annie", "Jewel", "Burt", "Anastasia" ], "edges": [ [ 0, 9 ], [ 1, 4 ], [ 1, 7 ], [ 4, 6 ], [ 6, 2 ], [ 6, 3 ], [ 8, 1 ], [ 9, 5 ], [ 9, 8 ], [ 10, 19 ], [ 11, 14 ], [ 11, 17 ], [ 14, 16 ], [ 16, 12 ], [ 16, 13 ], [ 18, 11 ], [ 19, 15 ], [ 19, 18 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Brent knows Cruz. Bella knows Pat. Darla knows Brent. Shaun knows Eleanor. Eleanor knows Parker. Parker knows Vera. Mitchell knows Marion. Boyd knows Todd. Cruz knows Rose. Marion knows Leonard. Darla knows Sam. Rose knows Garland. Todd knows Neil. Bella knows Boyd. Shaun knows Katherine. Garland knows Mitchell. Neil knows Shaun. Garland knows Brian. Which of Brent and Boyd can Darla reach?", "answer": "Brent", "steps": [ "Darla knows Brent." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Darla", "Mitchell", "Leonard", "Marion", "Brian", "Cruz", "Brent", "Rose", "Garland", "Sam", "Bella", "Eleanor", "Vera", "Parker", "Katherine", "Todd", "Boyd", "Neil", "Shaun", "Pat" ], "edges": [ [ 0, 6 ], [ 0, 9 ], [ 1, 3 ], [ 3, 2 ], [ 5, 7 ], [ 6, 5 ], [ 7, 8 ], [ 8, 1 ], [ 8, 4 ], [ 10, 16 ], [ 10, 19 ], [ 11, 13 ], [ 13, 12 ], [ 15, 17 ], [ 16, 15 ], [ 17, 18 ], [ 18, 11 ], [ 18, 14 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Ira knows Christina. Fiona knows Tiffany. Camille knows Coral. Janice knows Ira. Barry knows Robert. Tessa knows Madeline. Grace knows Jeanne. Madeline knows Alyssa. Robert knows Grace. Tessa knows Lana. Coral knows Tristan. Alyssa knows Fiona. Christina knows Diane. Camille knows Antonio. Camille knows Janice. Tessa knows Barry. Jonah knows Ramon. Tristan knows Jonah. Which of Coral and Barry can Camille reach?", "answer": "Coral", "steps": [ "Camille knows Coral." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Camille", "Coral", "Christina", "Jonah", "Ramon", "Diane", "Antonio", "Ira", "Janice", "Tristan", "Tessa", "Barry", "Fiona", "Grace", "Jeanne", "Tiffany", "Lana", "Alyssa", "Madeline", "Robert" ], "edges": [ [ 0, 6 ], [ 0, 8 ], [ 0, 1 ], [ 1, 9 ], [ 2, 5 ], [ 3, 4 ], [ 7, 2 ], [ 8, 7 ], [ 9, 3 ], [ 10, 16 ], [ 10, 18 ], [ 10, 11 ], [ 11, 19 ], [ 12, 15 ], [ 13, 14 ], [ 17, 12 ], [ 18, 17 ], [ 19, 13 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Quinn knows Jonah. Bonnie knows Gail. Desmond knows Rhonda. Dudley knows Iris. Bonnie knows Joseph. Joseph knows Geneva. Gail knows Lance. Iris knows Michelle. Candice knows Cyrus. Dudley knows Lane. Hamilton knows Livia. Dudley knows Desmond. Jonah knows Hamilton. Hamilton knows Dudley. Demetrius knows Bonnie. Cyrus knows Demetrius. Demetrius knows Eloise. Bonnie knows Cordelia. Which of Bonnie and Dudley can Candice reach?", "answer": "Bonnie", "steps": [ "Candice knows Cyrus.", "Cyrus knows Demetrius.", "Demetrius knows Bonnie." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Candice", "Lance", "Geneva", "Bonnie", "Eloise", "Cordelia", "Demetrius", "Cyrus", "Gail", "Joseph", "Quinn", "Rhonda", "Michelle", "Dudley", "Livia", "Lane", "Hamilton", "Jonah", "Desmond", "Iris" ], "edges": [ [ 0, 7 ], [ 3, 5 ], [ 3, 8 ], [ 3, 9 ], [ 6, 4 ], [ 6, 3 ], [ 7, 6 ], [ 8, 1 ], [ 9, 2 ], [ 10, 17 ], [ 13, 15 ], [ 13, 18 ], [ 13, 19 ], [ 16, 14 ], [ 16, 13 ], [ 17, 16 ], [ 18, 11 ], [ 19, 12 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Maude knows Elmer. Brittany knows Zara. Bonnie knows Julian. Zara knows Bonnie. Lena knows Brittany. Larissa knows Fred. Louisa knows Dolores. Bonnie knows Jerome. Louisa knows Sam. Julian knows Elias. Larissa knows Barney. Barney knows Jon. Brittany knows Odette. Brittany knows Maude. Audrey knows Larissa. Louisa knows Audrey. Henrietta knows Louisa. Sam knows Gary. Which of Louisa and Brittany can Henrietta reach?", "answer": "Louisa", "steps": [ "Henrietta knows Louisa." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Henrietta", "Larissa", "Louisa", "Dolores", "Barney", "Fred", "Sam", "Gary", "Audrey", "Jon", "Lena", "Bonnie", "Brittany", "Odette", "Julian", "Jerome", "Maude", "Elmer", "Zara", "Elias" ], "edges": [ [ 0, 2 ], [ 1, 5 ], [ 1, 4 ], [ 2, 3 ], [ 2, 6 ], [ 2, 8 ], [ 4, 9 ], [ 6, 7 ], [ 8, 1 ], [ 10, 12 ], [ 11, 15 ], [ 11, 14 ], [ 12, 13 ], [ 12, 16 ], [ 12, 18 ], [ 14, 19 ], [ 16, 17 ], [ 18, 11 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Fergus knows Guillermo. Fergus knows Aiden. Ivan knows Israel. Ivan knows Fergus. Duke knows Ilene. Camden knows Val. Renee knows Fleur. Duke knows Gabriel. Fleur knows Jude. Israel knows Duke. Fergus knows Katrina. Renee knows Camden. Val knows Eileen. Fleur knows Latoya. Gabriel knows Miles. Jem knows Dora. Fleur knows Cindy. Val knows Jem. Which of Israel and Camden can Ivan reach?", "answer": "Israel", "steps": [ "Ivan knows Israel." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Ivan", "Duke", "Gabriel", "Fergus", "Miles", "Ilene", "Katrina", "Aiden", "Israel", "Guillermo", "Renee", "Val", "Jem", "Fleur", "Dora", "Eileen", "Latoya", "Jude", "Camden", "Cindy" ], "edges": [ [ 0, 8 ], [ 0, 3 ], [ 1, 2 ], [ 1, 5 ], [ 2, 4 ], [ 3, 6 ], [ 3, 7 ], [ 3, 9 ], [ 8, 1 ], [ 10, 18 ], [ 10, 13 ], [ 11, 12 ], [ 11, 15 ], [ 12, 14 ], [ 13, 16 ], [ 13, 17 ], [ 13, 19 ], [ 18, 11 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Jakob knows Wilma. Darren knows Marcia. Foster knows Yara. Julio knows Jakob. Elvis knows Dora. Ruth knows Darren. Julius knows Enrique. Abel knows Ingrid. Elvis knows Abel. Darren knows Elvis. Bernadette knows Ruth. Blaine knows Bernadette. Jeremiah knows Julius. Dora knows Jolene. Yara knows Jeremiah. Julio knows Glenn. Julius knows Julio. Glenn knows Clement. Which of Jakob and Abel can Foster reach?", "answer": "Jakob", "steps": [ "Foster knows Yara.", "Yara knows Jeremiah.", "Jeremiah knows Julius.", "Julius knows Julio.", "Julio knows Jakob." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Foster", "Wilma", "Enrique", "Jakob", "Clement", "Julio", "Glenn", "Yara", "Jeremiah", "Julius", "Blaine", "Ingrid", "Marcia", "Abel", "Jolene", "Elvis", "Dora", "Bernadette", "Ruth", "Darren" ], "edges": [ [ 0, 7 ], [ 3, 1 ], [ 5, 3 ], [ 5, 6 ], [ 6, 4 ], [ 7, 8 ], [ 8, 9 ], [ 9, 2 ], [ 9, 5 ], [ 10, 17 ], [ 13, 11 ], [ 15, 13 ], [ 15, 16 ], [ 16, 14 ], [ 17, 18 ], [ 18, 19 ], [ 19, 12 ], [ 19, 15 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Ira knows Christina. Fiona knows Tiffany. Camille knows Coral. Janice knows Ira. Barry knows Robert. Tessa knows Madeline. Grace knows Jeanne. Madeline knows Alyssa. Robert knows Grace. Tessa knows Lana. Coral knows Tristan. Alyssa knows Fiona. Christina knows Diane. Camille knows Antonio. Camille knows Janice. Tessa knows Barry. Jonah knows Ramon. Tristan knows Jonah. Which of Jonah and Grace can Camille reach?", "answer": "Jonah", "steps": [ "Camille knows Coral.", "Coral knows Tristan.", "Tristan knows Jonah." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Camille", "Coral", "Christina", "Jonah", "Ramon", "Diane", "Antonio", "Ira", "Janice", "Tristan", "Tessa", "Barry", "Fiona", "Grace", "Jeanne", "Tiffany", "Lana", "Alyssa", "Madeline", "Robert" ], "edges": [ [ 0, 6 ], [ 0, 8 ], [ 0, 1 ], [ 1, 9 ], [ 2, 5 ], [ 3, 4 ], [ 7, 2 ], [ 8, 7 ], [ 9, 3 ], [ 10, 16 ], [ 10, 18 ], [ 10, 11 ], [ 11, 19 ], [ 12, 15 ], [ 13, 14 ], [ 17, 12 ], [ 18, 17 ], [ 19, 13 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Hannah knows Clarissa. Terrence knows Amelia. Dawn knows Norma. Estella knows Eldon. Amelia knows Livia. Livia knows Daphna. Will knows Elise. Clarissa knows Estella. Hannah knows Arnold. Norma knows Jennifer. Jennifer knows Hannah. Jennifer knows Bernard. Amelia knows Marco. Livia knows Olivia. Olivia knows Marion. Olivia knows Karla. Marion knows Will. Norma knows Marvin. Which of Hannah and Olivia can Terrence reach?", "answer": "Olivia", "steps": [ "Terrence knows Amelia.", "Amelia knows Livia.", "Livia knows Olivia." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Terrence", "Marion", "Olivia", "Will", "Marco", "Amelia", "Daphna", "Karla", "Elise", "Livia", "Dawn", "Clarissa", "Hannah", "Estella", "Marvin", "Norma", "Bernard", "Arnold", "Eldon", "Jennifer" ], "edges": [ [ 0, 5 ], [ 1, 3 ], [ 2, 7 ], [ 2, 1 ], [ 3, 8 ], [ 5, 4 ], [ 5, 9 ], [ 9, 6 ], [ 9, 2 ], [ 10, 15 ], [ 11, 13 ], [ 12, 17 ], [ 12, 11 ], [ 13, 18 ], [ 15, 14 ], [ 15, 19 ], [ 19, 16 ], [ 19, 12 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Terry knows Blake. Haven knows Penny. Jolene knows Ira. Jolene knows Edison. Fritz knows Terry. Brittany knows Fritz. Bruce knows Kaleb. Haven knows Shannon. Hunter knows Brittany. Riley knows Terrence. Penny knows Livia. Blake knows Jolene. Marie knows Haven. Edison knows Elvira. Hunter knows Hannah. Terrence knows Isla. Isla knows Marie. Bruce knows Riley. Which of Terrence and Fritz can Hunter reach?", "answer": "Fritz", "steps": [ "Hunter knows Brittany.", "Brittany knows Fritz." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Hunter", "Hannah", "Brittany", "Fritz", "Jolene", "Edison", "Terry", "Blake", "Elvira", "Ira", "Bruce", "Kaleb", "Riley", "Terrence", "Haven", "Penny", "Isla", "Marie", "Livia", "Shannon" ], "edges": [ [ 0, 1 ], [ 0, 2 ], [ 2, 3 ], [ 3, 6 ], [ 4, 5 ], [ 4, 9 ], [ 5, 8 ], [ 6, 7 ], [ 7, 4 ], [ 10, 11 ], [ 10, 12 ], [ 12, 13 ], [ 13, 16 ], [ 14, 15 ], [ 14, 19 ], [ 15, 18 ], [ 16, 17 ], [ 17, 14 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Edgar knows Julio. Marshall knows Leon. Gonzalo knows Blaine. Alex knows Will. Blaine knows Alex. Leon knows Sally. Dora knows Myra. Andrea knows Paige. Myra knows Kara. Drew knows Edgar. Kara knows Greg. Sally knows Andrea. Terry knows Dora. Andrea knows Gonzalo. Jocelyn knows Edna. Edgar knows Jocelyn. Blaine knows Peter. Kara knows Drew. Which of Leon and Dora can Terry reach?", "answer": "Dora", "steps": [ "Terry knows Dora." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Terry", "Edgar", "Kara", "Edna", "Julio", "Drew", "Jocelyn", "Myra", "Dora", "Greg", "Marshall", "Blaine", "Andrea", "Will", "Peter", "Gonzalo", "Alex", "Sally", "Leon", "Paige" ], "edges": [ [ 0, 8 ], [ 1, 4 ], [ 1, 6 ], [ 2, 5 ], [ 2, 9 ], [ 5, 1 ], [ 6, 3 ], [ 7, 2 ], [ 8, 7 ], [ 10, 18 ], [ 11, 14 ], [ 11, 16 ], [ 12, 15 ], [ 12, 19 ], [ 15, 11 ], [ 16, 13 ], [ 17, 12 ], [ 18, 17 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Fabian knows Joel. Iris knows Joshua. Iris knows Kareem. Hunter knows Kingsley. Kingsley knows Belinda. Joel knows Tamara. Gina knows Edison. Kingsley knows Dalton. Eleanor knows Antonio. Iris knows Zack. Belinda knows Iris. Joel knows Earl. Alder knows Hunter. Gina knows Eleanor. Alder knows Jamie. Antonio knows Edgar. Joel knows Jack. Antonio knows Fabian. Which of Fabian and Belinda can Gina reach?", "answer": "Fabian", "steps": [ "Gina knows Eleanor.", "Eleanor knows Antonio.", "Antonio knows Fabian." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Gina", "Tamara", "Edison", "Fabian", "Antonio", "Jack", "Edgar", "Joel", "Eleanor", "Earl", "Alder", "Kareem", "Jamie", "Belinda", "Kingsley", "Joshua", "Dalton", "Iris", "Hunter", "Zack" ], "edges": [ [ 0, 2 ], [ 0, 8 ], [ 3, 7 ], [ 4, 6 ], [ 4, 3 ], [ 7, 1 ], [ 7, 5 ], [ 7, 9 ], [ 8, 4 ], [ 10, 12 ], [ 10, 18 ], [ 13, 17 ], [ 14, 16 ], [ 14, 13 ], [ 17, 11 ], [ 17, 15 ], [ 17, 19 ], [ 18, 14 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Basil knows Trina. Gregory knows Maria. Janelle knows Zach. Zach knows Penny. Selena knows Elvis. Cora knows Daria. Hattie knows Janelle. Kimberly knows Kane. Cora knows Kareem. Alvin knows Hattie. Trina knows Kimberly. Penny knows Gregory. Kimberly knows Coral. Aldo knows Donald. Elvis knows Lambert. Hattie knows Cora. Lambert knows Aldo. Trina knows Selena. Which of Selena and Janelle can Alvin reach?", "answer": "Janelle", "steps": [ "Alvin knows Hattie.", "Hattie knows Janelle." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Alvin", "Daria", "Cora", "Hattie", "Zach", "Maria", "Kareem", "Janelle", "Gregory", "Penny", "Basil", "Kane", "Kimberly", "Trina", "Elvis", "Donald", "Coral", "Selena", "Aldo", "Lambert" ], "edges": [ [ 0, 3 ], [ 2, 1 ], [ 2, 6 ], [ 3, 2 ], [ 3, 7 ], [ 4, 9 ], [ 7, 4 ], [ 8, 5 ], [ 9, 8 ], [ 10, 13 ], [ 12, 11 ], [ 12, 16 ], [ 13, 12 ], [ 13, 17 ], [ 14, 19 ], [ 17, 14 ], [ 18, 15 ], [ 19, 18 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Courtney knows Selena. Stacy knows Vance. Marlene knows Colette. Ernie knows Peggy. Louis knows Edna. Selena knows Hector. Colette knows Marian. Peggy knows Stacy. Yasmin knows Enid. Dewey knows Courtney. Vance knows Hugh. Daphne knows Iris. Hector knows Audrey. Edna knows Ted. Audrey knows Marlene. Peggy knows Daphne. Ted knows Ernie. Audrey knows Yasmin. Which of Ernie and Hector can Dewey reach?", "answer": "Hector", "steps": [ "Dewey knows Courtney.", "Courtney knows Selena.", "Selena knows Hector." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Dewey", "Hector", "Marian", "Yasmin", "Selena", "Colette", "Enid", "Audrey", "Courtney", "Marlene", "Louis", "Ernie", "Hugh", "Daphne", "Ted", "Vance", "Iris", "Peggy", "Edna", "Stacy" ], "edges": [ [ 0, 8 ], [ 1, 7 ], [ 3, 6 ], [ 4, 1 ], [ 5, 2 ], [ 7, 3 ], [ 7, 9 ], [ 8, 4 ], [ 9, 5 ], [ 10, 18 ], [ 11, 17 ], [ 13, 16 ], [ 14, 11 ], [ 15, 12 ], [ 17, 13 ], [ 17, 19 ], [ 18, 14 ], [ 19, 15 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Fergus knows Annie. Edith knows Caroline. Ramona knows Preston. Esther knows Dayton. Caroline knows Fergus. Preston knows Duncan. Darwin knows Frank. Frank knows Andrew. Duncan knows Garrett. Hugo knows Isaac. Preston knows Effie. Duncan knows Edith. Frank knows Lamont. Isaac knows Everett. Lamont knows Esther. Edith knows Morgan. Lamont knows Kelsey. Esther knows Hugo. Which of Lamont and Duncan can Ramona reach?", "answer": "Duncan", "steps": [ "Ramona knows Preston.", "Preston knows Duncan." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Ramona", "Caroline", "Edith", "Fergus", "Garrett", "Effie", "Annie", "Morgan", "Duncan", "Preston", "Darwin", "Hugo", "Esther", "Isaac", "Kelsey", "Andrew", "Everett", "Dayton", "Lamont", "Frank" ], "edges": [ [ 0, 9 ], [ 1, 3 ], [ 2, 1 ], [ 2, 7 ], [ 3, 6 ], [ 8, 4 ], [ 8, 2 ], [ 9, 5 ], [ 9, 8 ], [ 10, 19 ], [ 11, 13 ], [ 12, 11 ], [ 12, 17 ], [ 13, 16 ], [ 18, 14 ], [ 18, 12 ], [ 19, 15 ], [ 19, 18 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Herbert knows Colin. Sebastian knows Terry. Herbert knows Samantha. Samantha knows Corinne. Eldon knows Max. Yolanda knows Guy. Randy knows Yolanda. Randy knows Chelsea. Terry knows Wilson. Jim knows Jesse. April knows Skyler. Guy knows April. Jim knows Herbert. Yolanda knows Luna. Samantha knows Virginia. Skyler knows Vernon. Virginia knows Sebastian. Eldon knows Randy. Which of Vernon and Wilson can Jim reach?", "answer": "Wilson", "steps": [ "Jim knows Herbert.", "Herbert knows Samantha.", "Samantha knows Virginia.", "Virginia knows Sebastian.", "Sebastian knows Terry.", "Terry knows Wilson." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Jim", "Wilson", "Jesse", "Colin", "Samantha", "Terry", "Corinne", "Virginia", "Herbert", "Sebastian", "Eldon", "Vernon", "Max", "Chelsea", "Yolanda", "Skyler", "Luna", "Guy", "Randy", "April" ], "edges": [ [ 0, 2 ], [ 0, 8 ], [ 4, 6 ], [ 4, 7 ], [ 5, 1 ], [ 7, 9 ], [ 8, 3 ], [ 8, 4 ], [ 9, 5 ], [ 10, 12 ], [ 10, 18 ], [ 14, 16 ], [ 14, 17 ], [ 15, 11 ], [ 17, 19 ], [ 18, 13 ], [ 18, 14 ], [ 19, 15 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Randy knows Tim. Carmen knows Jean. Tim knows Jeanette. Carl knows Randy. Judy knows Ariel. Jeanette knows Carmen. Ariel knows Cristina. Randy knows Miriam. Lee knows Tristan. Lee knows Ronald. Judy knows Wendy. Carl knows Hampton. Carmen knows Francis. Hampton knows Rosemary. Joshua knows Judy. Joshua knows Cesar. Cesar knows Thea. Cristina knows Lee. Which of Jeanette and Cristina can Joshua reach?", "answer": "Cristina", "steps": [ "Joshua knows Judy.", "Judy knows Ariel.", "Ariel knows Cristina." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Joshua", "Judy", "Cristina", "Tristan", "Wendy", "Ronald", "Cesar", "Ariel", "Lee", "Thea", "Carl", "Randy", "Jeanette", "Francis", "Miriam", "Jean", "Hampton", "Tim", "Carmen", "Rosemary" ], "edges": [ [ 0, 1 ], [ 0, 6 ], [ 1, 4 ], [ 1, 7 ], [ 2, 8 ], [ 6, 9 ], [ 7, 2 ], [ 8, 3 ], [ 8, 5 ], [ 10, 11 ], [ 10, 16 ], [ 11, 14 ], [ 11, 17 ], [ 12, 18 ], [ 16, 19 ], [ 17, 12 ], [ 18, 13 ], [ 18, 15 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Arthur knows Elvira. Karen knows Earl. Kennedy knows Arthur. Zachary knows India. Karen knows Derrick. Electra knows Ruth. Derrick knows Liam. Karen knows Mildred. Leslie knows Jonah. Camille knows Taylor. Earl knows Clay. Clay knows Electra. Leslie knows Kennedy. Leslie knows Zachary. India knows Cole. Jonah knows Alison. Mildred knows Camille. Cole knows Claude. Which of Claude and Ruth can Leslie reach?", "answer": "Claude", "steps": [ "Leslie knows Zachary.", "Zachary knows India.", "India knows Cole.", "Cole knows Claude." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Leslie", "Alison", "Zachary", "Elvira", "India", "Cole", "Kennedy", "Claude", "Jonah", "Arthur", "Karen", "Liam", "Earl", "Taylor", "Clay", "Electra", "Mildred", "Ruth", "Derrick", "Camille" ], "edges": [ [ 0, 2 ], [ 0, 8 ], [ 0, 6 ], [ 2, 4 ], [ 4, 5 ], [ 5, 7 ], [ 6, 9 ], [ 8, 1 ], [ 9, 3 ], [ 10, 12 ], [ 10, 18 ], [ 10, 16 ], [ 12, 14 ], [ 14, 15 ], [ 15, 17 ], [ 16, 19 ], [ 18, 11 ], [ 19, 13 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Liam knows Shelby. Harlan knows Esther. Zoe knows Tabitha. Whitney knows Kent. Zoe knows Liam. Whitney knows Joyce. Dale knows Ethan. Kent knows Zoe. Harlan knows Carey. Zoe knows Rocco. Shaun knows Audrey. Carey knows Shaun. Ethan knows Harlan. Harlan knows Spencer. Spencer knows Andrea. Dale knows Celia. Tabitha knows Carrie. Shelby knows Caleb. Which of Ethan and Kent can Whitney reach?", "answer": "Kent", "steps": [ "Whitney knows Kent." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Whitney", "Shelby", "Carrie", "Joyce", "Liam", "Caleb", "Rocco", "Tabitha", "Zoe", "Kent", "Dale", "Shaun", "Andrea", "Celia", "Carey", "Audrey", "Esther", "Spencer", "Harlan", "Ethan" ], "edges": [ [ 0, 3 ], [ 0, 9 ], [ 1, 5 ], [ 4, 1 ], [ 7, 2 ], [ 8, 4 ], [ 8, 6 ], [ 8, 7 ], [ 9, 8 ], [ 10, 13 ], [ 10, 19 ], [ 11, 15 ], [ 14, 11 ], [ 17, 12 ], [ 18, 14 ], [ 18, 16 ], [ 18, 17 ], [ 19, 18 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Kristina knows Elena. Keegan knows Gloria. Howard knows Grover. Elena knows Esther. Zane knows Agnes. Kristina knows Patrick. Gloria knows Chance. Howard knows George. Asher knows Ramona. Grover knows Lorenzo. Emanuel knows Keegan. Lorenzo knows Zane. Elena knows Emanuel. Holden knows Abel. Lorenzo knows Luke. Keegan knows Asher. Luke knows Porter. Holden knows Howard. Which of Grover and Emanuel can Holden reach?", "answer": "Grover", "steps": [ "Holden knows Howard.", "Howard knows Grover." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Holden", "Luke", "George", "Howard", "Zane", "Porter", "Lorenzo", "Abel", "Agnes", "Grover", "Kristina", "Gloria", "Esther", "Elena", "Asher", "Chance", "Keegan", "Patrick", "Ramona", "Emanuel" ], "edges": [ [ 0, 7 ], [ 0, 3 ], [ 1, 5 ], [ 3, 2 ], [ 3, 9 ], [ 4, 8 ], [ 6, 1 ], [ 6, 4 ], [ 9, 6 ], [ 10, 17 ], [ 10, 13 ], [ 11, 15 ], [ 13, 12 ], [ 13, 19 ], [ 14, 18 ], [ 16, 11 ], [ 16, 14 ], [ 19, 16 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Tanya knows Winston. Nolan knows Byron. Winston knows Daisy. Winston knows Clyde. Adele knows Tanya. Stuart knows Regina. Fritz knows Yara. Isiah knows Christian. Christian knows Samantha. Isiah knows Frank. Fritz knows Matt. Clyde knows Janice. Tara knows Abigail. Tanya knows Stuart. Matt knows Nolan. Byron knows Jean. Nolan knows Isiah. Tara knows Adele. Which of Winston and Isiah can Fritz reach?", "answer": "Isiah", "steps": [ "Fritz knows Matt.", "Matt knows Nolan.", "Nolan knows Isiah." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Fritz", "Yara", "Frank", "Samantha", "Isiah", "Jean", "Nolan", "Matt", "Byron", "Christian", "Tara", "Abigail", "Daisy", "Janice", "Winston", "Regina", "Tanya", "Adele", "Stuart", "Clyde" ], "edges": [ [ 0, 1 ], [ 0, 7 ], [ 4, 2 ], [ 4, 9 ], [ 6, 8 ], [ 6, 4 ], [ 7, 6 ], [ 8, 5 ], [ 9, 3 ], [ 10, 11 ], [ 10, 17 ], [ 14, 12 ], [ 14, 19 ], [ 16, 18 ], [ 16, 14 ], [ 17, 16 ], [ 18, 15 ], [ 19, 13 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Goldie knows Faye. Arturo knows Kendrick. Faye knows Victoria. Samantha knows Charlene. Faye knows Gus. Gus knows Cordelia. Knox knows Geneva. Faye knows Colby. Geneva knows Warren. Garrett knows Zach. Victoria knows Hazel. Zach knows Samantha. Samantha knows Knox. Cordelia knows Leander. Samantha knows Arturo. Denise knows Goldie. Samantha knows Dylan. Faye knows Spencer. Which of Geneva and Cordelia can Denise reach?", "answer": "Cordelia", "steps": [ "Denise knows Goldie.", "Goldie knows Faye.", "Faye knows Gus.", "Gus knows Cordelia." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Denise", "Cordelia", "Spencer", "Victoria", "Gus", "Faye", "Leander", "Goldie", "Hazel", "Colby", "Garrett", "Geneva", "Dylan", "Arturo", "Knox", "Samantha", "Warren", "Zach", "Kendrick", "Charlene" ], "edges": [ [ 0, 7 ], [ 1, 6 ], [ 3, 8 ], [ 4, 1 ], [ 5, 2 ], [ 5, 4 ], [ 5, 3 ], [ 5, 9 ], [ 7, 5 ], [ 10, 17 ], [ 11, 16 ], [ 13, 18 ], [ 14, 11 ], [ 15, 12 ], [ 15, 14 ], [ 15, 13 ], [ 15, 19 ], [ 17, 15 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Jeffery knows Enrique. Aubrey knows Benjamin. Dane knows Aubrey. Keith knows Abel. Abel knows Louisa. Wendy knows Freya. Devon knows Dane. Keith knows Graeme. Aubrey knows Wendy. Benjamin knows Sheila. Aubrey knows Simon. Kylie knows Albert. Wendy knows Julian. Abel knows Karina. Sheila knows Kira. Albert knows Marlene. Enrique knows Keith. Keith knows Kylie. Which of Kira and Marlene can Jeffery reach?", "answer": "Marlene", "steps": [ "Jeffery knows Enrique.", "Enrique knows Keith.", "Keith knows Kylie.", "Kylie knows Albert.", "Albert knows Marlene." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Jeffery", "Graeme", "Enrique", "Abel", "Albert", "Kylie", "Karina", "Marlene", "Louisa", "Keith", "Devon", "Simon", "Dane", "Wendy", "Sheila", "Benjamin", "Freya", "Kira", "Julian", "Aubrey" ], "edges": [ [ 0, 2 ], [ 2, 9 ], [ 3, 6 ], [ 3, 8 ], [ 4, 7 ], [ 5, 4 ], [ 9, 1 ], [ 9, 5 ], [ 9, 3 ], [ 10, 12 ], [ 12, 19 ], [ 13, 16 ], [ 13, 18 ], [ 14, 17 ], [ 15, 14 ], [ 19, 11 ], [ 19, 15 ], [ 19, 13 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Justine knows Cristina. Morgan knows Rita. Claude knows Carter. Zachary knows Agnes. Brenda knows Zachary. Zachary knows Lacey. Farrah knows Rowan. Cristina knows Robin. Agnes knows Earl. Justine knows Sebastian. Gail knows Farrah. Charles knows Edwin. Farrah knows Charles. Lacey knows Aldo. Rowan knows Pierce. Brenda knows Justine. Gail knows Morgan. Morgan knows Claude. Which of Agnes and Rowan can Brenda reach?", "answer": "Agnes", "steps": [ "Brenda knows Zachary.", "Zachary knows Agnes." ], "difficulty": 2, "original_distance": 3, "idx_to_symbol": [ "Brenda", "Earl", "Robin", "Justine", "Aldo", "Zachary", "Agnes", "Sebastian", "Cristina", "Lacey", "Gail", "Pierce", "Carter", "Morgan", "Edwin", "Farrah", "Rowan", "Rita", "Claude", "Charles" ], "edges": [ [ 0, 3 ], [ 0, 5 ], [ 3, 7 ], [ 3, 8 ], [ 5, 6 ], [ 5, 9 ], [ 6, 1 ], [ 8, 2 ], [ 9, 4 ], [ 10, 13 ], [ 10, 15 ], [ 13, 17 ], [ 13, 18 ], [ 15, 16 ], [ 15, 19 ], [ 16, 11 ], [ 18, 12 ], [ 19, 14 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Livia knows Aisha. Jim knows Liam. Dana knows Thomas. Tabitha knows Karl. Frida knows Pete. Dana knows Tabitha. Liam knows Gonzalo. Joyce knows Dana. Aisha knows Jeremiah. Livia knows Isla. Gonzalo knows Julio. Jim knows Leopold. Asher knows Joyce. Arden knows Jolene. Joyce knows Frida. Gonzalo knows Livia. Arden knows Asher. Julio knows Devin. Which of Joyce and Gonzalo can Arden reach?", "answer": "Joyce", "steps": [ "Arden knows Asher.", "Asher knows Joyce." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Arden", "Asher", "Frida", "Tabitha", "Dana", "Joyce", "Jolene", "Pete", "Karl", "Thomas", "Jim", "Liam", "Julio", "Aisha", "Livia", "Gonzalo", "Leopold", "Devin", "Jeremiah", "Isla" ], "edges": [ [ 0, 6 ], [ 0, 1 ], [ 1, 5 ], [ 2, 7 ], [ 3, 8 ], [ 4, 3 ], [ 4, 9 ], [ 5, 2 ], [ 5, 4 ], [ 10, 16 ], [ 10, 11 ], [ 11, 15 ], [ 12, 17 ], [ 13, 18 ], [ 14, 13 ], [ 14, 19 ], [ 15, 12 ], [ 15, 14 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Kennedy knows Curtis. Jason knows Stefan. Dave knows Kennedy. Zara knows Quinn. Malcolm knows Malik. Ann knows Malcolm. Iris knows Brett. Malik knows Zara. Malik knows Olivia. Stefan knows Anna. Roger knows Jason. Brett knows Roger. Preston knows Crystal. Erik knows Iris. Sybil knows Preston. Brett knows Sybil. Quinn knows Alfonso. Olivia knows Dave. Which of Anna and Curtis can Ann reach?", "answer": "Curtis", "steps": [ "Ann knows Malcolm.", "Malcolm knows Malik.", "Malik knows Olivia.", "Olivia knows Dave.", "Dave knows Kennedy.", "Kennedy knows Curtis." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Ann", "Malik", "Olivia", "Curtis", "Zara", "Alfonso", "Malcolm", "Quinn", "Dave", "Kennedy", "Erik", "Brett", "Roger", "Anna", "Sybil", "Crystal", "Iris", "Preston", "Jason", "Stefan" ], "edges": [ [ 0, 6 ], [ 1, 4 ], [ 1, 2 ], [ 2, 8 ], [ 4, 7 ], [ 6, 1 ], [ 7, 5 ], [ 8, 9 ], [ 9, 3 ], [ 10, 16 ], [ 11, 14 ], [ 11, 12 ], [ 12, 18 ], [ 14, 17 ], [ 16, 11 ], [ 17, 15 ], [ 18, 19 ], [ 19, 13 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Clark knows Arlene. Lambert knows Isadora. Hayes knows Deanna. Trudy knows Monica. Livia knows Lamont. Alan knows Livia. Trudy knows Hayes. Lamont knows Lionel. William knows Lambert. Lionel knows Trudy. William knows Liam. Sebastian knows William. Kendrick knows Sebastian. Lambert knows Hudson. Alan knows Phoebe. Arlene knows Kendrick. Hayes knows Brandon. Clark knows India. Which of Hudson and Brandon can Clark reach?", "answer": "Hudson", "steps": [ "Clark knows Arlene.", "Arlene knows Kendrick.", "Kendrick knows Sebastian.", "Sebastian knows William.", "William knows Lambert.", "Lambert knows Hudson." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Clark", "Liam", "India", "Lambert", "Isadora", "Kendrick", "William", "Hudson", "Arlene", "Sebastian", "Alan", "Monica", "Phoebe", "Hayes", "Deanna", "Lamont", "Trudy", "Brandon", "Livia", "Lionel" ], "edges": [ [ 0, 2 ], [ 0, 8 ], [ 3, 4 ], [ 3, 7 ], [ 5, 9 ], [ 6, 1 ], [ 6, 3 ], [ 8, 5 ], [ 9, 6 ], [ 10, 12 ], [ 10, 18 ], [ 13, 14 ], [ 13, 17 ], [ 15, 19 ], [ 16, 11 ], [ 16, 13 ], [ 18, 15 ], [ 19, 16 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Marilyn knows Mabel. Judith knows Graeme. Caleb knows Marilyn. Parsa knows Daisy. Sandra knows Derek. Derek knows Sue. Caleb knows Spencer. Sandra knows Caleb. Derek knows Alder. Judith knows Susan. Sally knows Bernice. Burt knows Sally. Caleb knows Rex. Bernice knows Sylvia. Sally knows Parsa. Sally knows Wesley. Spencer knows Jaime. Burt knows Judith. Which of Sally and Caleb can Sandra reach?", "answer": "Caleb", "steps": [ "Sandra knows Caleb." ], "difficulty": 1, "original_distance": 3, "idx_to_symbol": [ "Sandra", "Sue", "Alder", "Jaime", "Rex", "Caleb", "Mabel", "Spencer", "Marilyn", "Derek", "Burt", "Susan", "Graeme", "Daisy", "Wesley", "Sally", "Sylvia", "Parsa", "Bernice", "Judith" ], "edges": [ [ 0, 5 ], [ 0, 9 ], [ 5, 4 ], [ 5, 7 ], [ 5, 8 ], [ 7, 3 ], [ 8, 6 ], [ 9, 1 ], [ 9, 2 ], [ 10, 15 ], [ 10, 19 ], [ 15, 14 ], [ 15, 17 ], [ 15, 18 ], [ 17, 13 ], [ 18, 16 ], [ 19, 11 ], [ 19, 12 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Luke knows Javier. Zoe knows Greg. Kylie knows Cecilia. Daniella knows Kylie. Tristan knows Daniella. Javier knows Zoe. Keaton knows Emily. Keaton knows Gavin. Rosa knows Tristan. Emily knows Luke. Luke knows Eunice. Leopold knows Michael. Cecilia knows Leopold. Kylie knows Devon. Luke knows Damien. Tristan knows Caleb. Ken knows Keaton. Kylie knows Lottie. Which of Kylie and Luke can Rosa reach?", "answer": "Kylie", "steps": [ "Rosa knows Tristan.", "Tristan knows Daniella.", "Daniella knows Kylie." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Rosa", "Lottie", "Tristan", "Leopold", "Kylie", "Daniella", "Michael", "Cecilia", "Caleb", "Devon", "Ken", "Eunice", "Keaton", "Zoe", "Luke", "Emily", "Greg", "Javier", "Gavin", "Damien" ], "edges": [ [ 0, 2 ], [ 2, 8 ], [ 2, 5 ], [ 3, 6 ], [ 4, 1 ], [ 4, 7 ], [ 4, 9 ], [ 5, 4 ], [ 7, 3 ], [ 10, 12 ], [ 12, 18 ], [ 12, 15 ], [ 13, 16 ], [ 14, 11 ], [ 14, 17 ], [ 14, 19 ], [ 15, 14 ], [ 17, 13 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Adele knows Erwin. Pearl knows Paula. Florence knows Kent. Calvin knows Billy. Casey knows Tabitha. Darla knows Peggy. Peter knows Florence. Billy knows Maude. Paula knows Casey. Erwin knows Marvin. Kent knows Angela. Marvin knows Calvin. Angela knows Julius. Shelby knows Ivy. Peggy knows Adele. Rex knows Pearl. Tabitha knows Peter. Maude knows Shelby. Which of Tabitha and Marvin can Darla reach?", "answer": "Marvin", "steps": [ "Darla knows Peggy.", "Peggy knows Adele.", "Adele knows Erwin.", "Erwin knows Marvin." ], "difficulty": 4, "original_distance": 9, "idx_to_symbol": [ "Darla", "Adele", "Calvin", "Peggy", "Maude", "Marvin", "Shelby", "Erwin", "Ivy", "Billy", "Rex", "Paula", "Peter", "Pearl", "Kent", "Tabitha", "Angela", "Casey", "Julius", "Florence" ], "edges": [ [ 0, 3 ], [ 1, 7 ], [ 2, 9 ], [ 3, 1 ], [ 4, 6 ], [ 5, 2 ], [ 6, 8 ], [ 7, 5 ], [ 9, 4 ], [ 10, 13 ], [ 11, 17 ], [ 12, 19 ], [ 13, 11 ], [ 14, 16 ], [ 15, 12 ], [ 16, 18 ], [ 17, 15 ], [ 19, 14 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Raymond knows Marlene. Dylan knows Howard. Sydney knows Demetrius. Lisa knows Dylan. Fisher knows Nadine. Bruce knows Lisa. Cooper knows Jerry. Craig knows Monroe. Marlene knows Fisher. Craig knows Maggie. Lisa knows Sydney. Jerry knows Stephanie. Monroe knows Kent. Maggie knows Khashayar. Malik knows Craig. Stephanie knows Elaine. Howard knows Cooper. Khashayar knows Raymond. Which of Elaine and Nadine can Bruce reach?", "answer": "Elaine", "steps": [ "Bruce knows Lisa.", "Lisa knows Dylan.", "Dylan knows Howard.", "Howard knows Cooper.", "Cooper knows Jerry.", "Jerry knows Stephanie.", "Stephanie knows Elaine." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Bruce", "Jerry", "Lisa", "Sydney", "Elaine", "Howard", "Stephanie", "Demetrius", "Cooper", "Dylan", "Malik", "Marlene", "Craig", "Monroe", "Nadine", "Khashayar", "Fisher", "Kent", "Raymond", "Maggie" ], "edges": [ [ 0, 2 ], [ 1, 6 ], [ 2, 3 ], [ 2, 9 ], [ 3, 7 ], [ 5, 8 ], [ 6, 4 ], [ 8, 1 ], [ 9, 5 ], [ 10, 12 ], [ 11, 16 ], [ 12, 13 ], [ 12, 19 ], [ 13, 17 ], [ 15, 18 ], [ 16, 14 ], [ 18, 11 ], [ 19, 15 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Vernon knows Paula. Electra knows Don. Greer knows Iris. Kate knows Seth. Electra knows Jakob. Gus knows Electra. April knows Greer. Paula knows Nolan. Electra knows Harry. Kate knows Milton. James knows Peggy. Kate knows Travis. Electra knows Ann. Corey knows Kate. April knows Corey. Kate knows James. Vernon knows Gus. Don knows Thomas. Which of Corey and Gus can April reach?", "answer": "Corey", "steps": [ "April knows Corey." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "April", "Kate", "Milton", "Seth", "Corey", "Iris", "Greer", "Travis", "James", "Peggy", "Vernon", "Electra", "Harry", "Ann", "Gus", "Nolan", "Paula", "Jakob", "Don", "Thomas" ], "edges": [ [ 0, 6 ], [ 0, 4 ], [ 1, 2 ], [ 1, 3 ], [ 1, 7 ], [ 1, 8 ], [ 4, 1 ], [ 6, 5 ], [ 8, 9 ], [ 10, 16 ], [ 10, 14 ], [ 11, 12 ], [ 11, 13 ], [ 11, 17 ], [ 11, 18 ], [ 14, 11 ], [ 16, 15 ], [ 18, 19 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Claudia knows Esperanza. Annette knows Janelle. Eden knows Elias. Felicia knows Annette. Rachel knows Eden. Clayton knows Rachel. Elias knows Wyatt. Esperanza knows Felicia. Annette knows Darren. Langston knows Clayton. Rachel knows Emma. Felicia knows Verna. Rachel knows Chance. Felicia knows Vincent. Darren knows Guy. Clarissa knows Etta. Eden knows Clarissa. Janelle knows Beth. Which of Elias and Darren can Langston reach?", "answer": "Elias", "steps": [ "Langston knows Clayton.", "Clayton knows Rachel.", "Rachel knows Eden.", "Eden knows Elias." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Langston", "Elias", "Etta", "Chance", "Wyatt", "Emma", "Eden", "Rachel", "Clarissa", "Clayton", "Claudia", "Darren", "Beth", "Verna", "Guy", "Vincent", "Annette", "Felicia", "Janelle", "Esperanza" ], "edges": [ [ 0, 9 ], [ 1, 4 ], [ 6, 1 ], [ 6, 8 ], [ 7, 3 ], [ 7, 5 ], [ 7, 6 ], [ 8, 2 ], [ 9, 7 ], [ 10, 19 ], [ 11, 14 ], [ 16, 11 ], [ 16, 18 ], [ 17, 13 ], [ 17, 15 ], [ 17, 16 ], [ 18, 12 ], [ 19, 17 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Federico knows Heath. Dennis knows Frida. Federico knows Gordon. Alan knows Earl. Cynthia knows Gene. Frida knows Joaquin. Hilda knows Kai. Joaquin knows Tyler. Elise knows Cooper. Kai knows Gina. Cooper knows Cynthia. Kai knows Dennis. Heath knows Elise. Gordon knows Wilson. Wilson knows Fergus. Gina knows Alan. Max knows Federico. Tyler knows Cain. Which of Federico and Kai can Hilda reach?", "answer": "Kai", "steps": [ "Hilda knows Kai." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Hilda", "Alan", "Dennis", "Cain", "Frida", "Kai", "Tyler", "Joaquin", "Gina", "Earl", "Max", "Wilson", "Heath", "Gene", "Elise", "Federico", "Cynthia", "Cooper", "Gordon", "Fergus" ], "edges": [ [ 0, 5 ], [ 1, 9 ], [ 2, 4 ], [ 4, 7 ], [ 5, 2 ], [ 5, 8 ], [ 6, 3 ], [ 7, 6 ], [ 8, 1 ], [ 10, 15 ], [ 11, 19 ], [ 12, 14 ], [ 14, 17 ], [ 15, 12 ], [ 15, 18 ], [ 16, 13 ], [ 17, 16 ], [ 18, 11 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Arden knows Wendy. Herman knows Andre. Dawn knows Jacob. Bert knows Clarissa. Damien knows Faith. Elise knows Dawn. Dawn knows Selena. Clarissa knows Harper. Bert knows Arden. Justine knows Darwin. Trevor knows Justine. Wendy knows Claudia. Elise knows Hector. Trevor knows Damien. Faith knows Elise. Claudia knows Ernie. Claudia knows Herman. Herman knows Priscilla. Which of Damien and Arden can Bert reach?", "answer": "Arden", "steps": [ "Bert knows Arden." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Bert", "Clarissa", "Claudia", "Wendy", "Ernie", "Andre", "Priscilla", "Harper", "Herman", "Arden", "Trevor", "Justine", "Elise", "Faith", "Hector", "Selena", "Jacob", "Darwin", "Dawn", "Damien" ], "edges": [ [ 0, 1 ], [ 0, 9 ], [ 1, 7 ], [ 2, 4 ], [ 2, 8 ], [ 3, 2 ], [ 8, 5 ], [ 8, 6 ], [ 9, 3 ], [ 10, 11 ], [ 10, 19 ], [ 11, 17 ], [ 12, 14 ], [ 12, 18 ], [ 13, 12 ], [ 18, 15 ], [ 18, 16 ], [ 19, 13 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Rosa knows Ava. Bert knows Albert. Albert knows Felicia. Ira knows Priscilla. Gina knows Bert. Brooke knows Itzel. Felicia knows Lana. Aaron knows Tina. Ira knows Carla. Brooke knows Preston. Ira knows Brooke. Bert knows Dina. Albert knows Kenneth. Aaron knows Ira. Brooke knows Rosa. Bert knows Barney. Albert knows Janice. Gina knows Viola. Which of Brooke and Albert can Aaron reach?", "answer": "Brooke", "steps": [ "Aaron knows Ira.", "Ira knows Brooke." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Aaron", "Ira", "Brooke", "Itzel", "Preston", "Ava", "Carla", "Priscilla", "Rosa", "Tina", "Gina", "Bert", "Albert", "Kenneth", "Janice", "Lana", "Dina", "Barney", "Felicia", "Viola" ], "edges": [ [ 0, 1 ], [ 0, 9 ], [ 1, 6 ], [ 1, 7 ], [ 1, 2 ], [ 2, 3 ], [ 2, 4 ], [ 2, 8 ], [ 8, 5 ], [ 10, 11 ], [ 10, 19 ], [ 11, 16 ], [ 11, 17 ], [ 11, 12 ], [ 12, 13 ], [ 12, 14 ], [ 12, 18 ], [ 18, 15 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Kelly knows Alison. Preston knows Drake. Wade knows Preston. Samantha knows Jana. Preston knows Sylvia. Kelly knows Selena. Jana knows Margaret. Catherine knows Evelyn. Drake knows Dwight. Drake knows Catherine. Drake knows Paula. Preston knows Conner. Kelly knows Grover. Sylvia knows Ralph. Samantha knows Jorge. Alison knows Caleb. Samantha knows Kelly. Todd knows Samantha. Which of Catherine and Alison can Wade reach?", "answer": "Catherine", "steps": [ "Wade knows Preston.", "Preston knows Drake.", "Drake knows Catherine." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Wade", "Catherine", "Sylvia", "Drake", "Conner", "Paula", "Preston", "Dwight", "Ralph", "Evelyn", "Todd", "Alison", "Jana", "Kelly", "Jorge", "Selena", "Samantha", "Grover", "Margaret", "Caleb" ], "edges": [ [ 0, 6 ], [ 1, 9 ], [ 2, 8 ], [ 3, 5 ], [ 3, 7 ], [ 3, 1 ], [ 6, 4 ], [ 6, 2 ], [ 6, 3 ], [ 10, 16 ], [ 11, 19 ], [ 12, 18 ], [ 13, 15 ], [ 13, 17 ], [ 13, 11 ], [ 16, 14 ], [ 16, 12 ], [ 16, 13 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Lara knows Livia. Cliff knows Alicia. Flora knows Lillian. Corey knows Alvin. Bailey knows Brenda. Flora knows Fabian. Lillian knows Noel. Faith knows Curtis. Noel knows Jasper. Bailey knows Brynn. Livia knows Rocco. Corey knows Faith. Cliff knows Lara. Brynn knows Sue. Corey knows Cliff. Brynn knows James. Bailey knows Flora. Faith knows Valerie. Which of Livia and Noel can Corey reach?", "answer": "Livia", "steps": [ "Corey knows Cliff.", "Cliff knows Lara.", "Lara knows Livia." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Corey", "Cliff", "Rocco", "Alicia", "Lara", "Curtis", "Faith", "Valerie", "Alvin", "Livia", "Bailey", "Flora", "Jasper", "Fabian", "Lillian", "James", "Brynn", "Sue", "Brenda", "Noel" ], "edges": [ [ 0, 6 ], [ 0, 8 ], [ 0, 1 ], [ 1, 3 ], [ 1, 4 ], [ 4, 9 ], [ 6, 5 ], [ 6, 7 ], [ 9, 2 ], [ 10, 16 ], [ 10, 18 ], [ 10, 11 ], [ 11, 13 ], [ 11, 14 ], [ 14, 19 ], [ 16, 15 ], [ 16, 17 ], [ 19, 12 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Julie knows Ted. Terry knows Sharon. Terry knows Julius. Jamie knows Judy. Leah knows Charity. Felicia knows Terry. Gerald knows Barney. Ted knows Gerald. Jamie knows Bridget. Jamie knows James. Gerald knows Hendrix. Gerald knows Felicia. Harriet knows Leah. Leah knows Basil. Terry knows Ashton. Stefan knows Jamie. Leah knows Stefan. Keegan knows Harriet. Which of Sharon and Bridget can Julie reach?", "answer": "Sharon", "steps": [ "Julie knows Ted.", "Ted knows Gerald.", "Gerald knows Felicia.", "Felicia knows Terry.", "Terry knows Sharon." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Julie", "Barney", "Julius", "Terry", "Ashton", "Sharon", "Felicia", "Hendrix", "Gerald", "Ted", "Keegan", "Charity", "James", "Jamie", "Judy", "Bridget", "Stefan", "Basil", "Leah", "Harriet" ], "edges": [ [ 0, 9 ], [ 3, 2 ], [ 3, 4 ], [ 3, 5 ], [ 6, 3 ], [ 8, 1 ], [ 8, 6 ], [ 8, 7 ], [ 9, 8 ], [ 10, 19 ], [ 13, 12 ], [ 13, 14 ], [ 13, 15 ], [ 16, 13 ], [ 18, 11 ], [ 18, 16 ], [ 18, 17 ], [ 19, 18 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Gemma knows Greta. Annette knows Logan. Bruce knows Gemma. Stephanie knows Dale. Mark knows Myrtle. Greta knows Jacqueline. Erica knows Bruce. Annette knows Sam. Haley knows Audrey. Audrey knows Alicia. Sam knows Stephanie. Wade knows Opal. Wade knows Veronica. Alicia knows Erica. Veronica knows Mark. Dale knows Wade. Bruce knows Ford. Haley knows Andrea. Which of Alicia and Stephanie can Haley reach?", "answer": "Alicia", "steps": [ "Haley knows Audrey.", "Audrey knows Alicia." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Haley", "Audrey", "Greta", "Andrea", "Gemma", "Ford", "Bruce", "Jacqueline", "Alicia", "Erica", "Annette", "Sam", "Mark", "Logan", "Veronica", "Opal", "Wade", "Myrtle", "Stephanie", "Dale" ], "edges": [ [ 0, 3 ], [ 0, 1 ], [ 1, 8 ], [ 2, 7 ], [ 4, 2 ], [ 6, 5 ], [ 6, 4 ], [ 8, 9 ], [ 9, 6 ], [ 10, 13 ], [ 10, 11 ], [ 11, 18 ], [ 12, 17 ], [ 14, 12 ], [ 16, 15 ], [ 16, 14 ], [ 18, 19 ], [ 19, 16 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Leon knows Richard. Carrie knows Eldon. Carrie knows Freya. Conrad knows Zoe. Eldon knows Marian. Inez knows Leon. Dahlia knows Beatrice. Kieran knows Erma. Emery knows Vincent. Beatrice knows Kieran. Frankie knows Emery. Erma knows Goldie. Richard knows Bailey. Dahlia knows Conrad. Marian knows Neal. Freya knows Yolanda. Goldie knows Frankie. Neal knows Inez. Which of Vincent and Bailey can Dahlia reach?", "answer": "Vincent", "steps": [ "Dahlia knows Beatrice.", "Beatrice knows Kieran.", "Kieran knows Erma.", "Erma knows Goldie.", "Goldie knows Frankie.", "Frankie knows Emery.", "Emery knows Vincent." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Dahlia", "Erma", "Conrad", "Goldie", "Kieran", "Beatrice", "Emery", "Vincent", "Zoe", "Frankie", "Carrie", "Neal", "Freya", "Inez", "Marian", "Eldon", "Richard", "Bailey", "Yolanda", "Leon" ], "edges": [ [ 0, 2 ], [ 0, 5 ], [ 1, 3 ], [ 2, 8 ], [ 3, 9 ], [ 4, 1 ], [ 5, 4 ], [ 6, 7 ], [ 9, 6 ], [ 10, 12 ], [ 10, 15 ], [ 11, 13 ], [ 12, 18 ], [ 13, 19 ], [ 14, 11 ], [ 15, 14 ], [ 16, 17 ], [ 19, 16 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Holly knows Mara. Luz knows Sandy. Clara knows Gail. Wallace knows Chelsea. Terrence knows Dewey. Chelsea knows Christopher. Grady knows Chester. Humphrey knows Luz. Chelsea knows Dina. Chester knows Terrence. Sandy knows Clara. Grady knows Humphrey. Pam knows Wallace. Clara knows Shaun. Yolanda knows Ellis. Francis knows Pam. Ellis knows Holly. Yolanda knows Francis. Which of Dina and Gail can Yolanda reach?", "answer": "Dina", "steps": [ "Yolanda knows Francis.", "Francis knows Pam.", "Pam knows Wallace.", "Wallace knows Chelsea.", "Chelsea knows Dina." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Yolanda", "Pam", "Wallace", "Mara", "Christopher", "Holly", "Chelsea", "Ellis", "Dina", "Francis", "Grady", "Luz", "Sandy", "Dewey", "Shaun", "Terrence", "Clara", "Chester", "Gail", "Humphrey" ], "edges": [ [ 0, 7 ], [ 0, 9 ], [ 1, 2 ], [ 2, 6 ], [ 5, 3 ], [ 6, 4 ], [ 6, 8 ], [ 7, 5 ], [ 9, 1 ], [ 10, 17 ], [ 10, 19 ], [ 11, 12 ], [ 12, 16 ], [ 15, 13 ], [ 16, 14 ], [ 16, 18 ], [ 17, 15 ], [ 19, 11 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Marshall knows Heather. Ida knows Deanna. Edgar knows Edward. Scott knows Darius. Darius knows Ida. Cole knows Felicia. Samantha knows Cole. Robin knows Scott. Julian knows Blanche. Darius knows Samantha. Felicia knows Morris. Heather knows Luther. Marshall knows Edgar. Aurora knows Marshall. Blanche knows Aurora. Luther knows Fleur. Fleur knows Hilda. Joy knows Robin. Which of Darius and Marshall can Julian reach?", "answer": "Marshall", "steps": [ "Julian knows Blanche.", "Blanche knows Aurora.", "Aurora knows Marshall." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Julian", "Fleur", "Edward", "Marshall", "Luther", "Hilda", "Blanche", "Aurora", "Edgar", "Heather", "Joy", "Felicia", "Deanna", "Darius", "Cole", "Morris", "Robin", "Scott", "Ida", "Samantha" ], "edges": [ [ 0, 6 ], [ 1, 5 ], [ 3, 8 ], [ 3, 9 ], [ 4, 1 ], [ 6, 7 ], [ 7, 3 ], [ 8, 2 ], [ 9, 4 ], [ 10, 16 ], [ 11, 15 ], [ 13, 18 ], [ 13, 19 ], [ 14, 11 ], [ 16, 17 ], [ 17, 13 ], [ 18, 12 ], [ 19, 14 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Amber knows Hayes. Rosemary knows Amber. Pablo knows Rosemary. Henry knows Rhea. Elodie knows Austin. Henry knows Elodie. Helene knows Claude. Ian knows Joseph. Frances knows Monica. Pablo knows Carl. Henry knows Helene. Carl knows Daphne. Daphne knows Ian. Austin knows Frances. Pablo knows Ellen. Pablo knows Alice. Claude knows Aaron. Henry knows Derek. Which of Joseph and Monica can Pablo reach?", "answer": "Joseph", "steps": [ "Pablo knows Carl.", "Carl knows Daphne.", "Daphne knows Ian.", "Ian knows Joseph." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Pablo", "Alice", "Joseph", "Ian", "Daphne", "Rosemary", "Ellen", "Carl", "Amber", "Hayes", "Henry", "Rhea", "Monica", "Frances", "Austin", "Helene", "Derek", "Elodie", "Claude", "Aaron" ], "edges": [ [ 0, 1 ], [ 0, 6 ], [ 0, 7 ], [ 0, 5 ], [ 3, 2 ], [ 4, 3 ], [ 5, 8 ], [ 7, 4 ], [ 8, 9 ], [ 10, 11 ], [ 10, 16 ], [ 10, 17 ], [ 10, 15 ], [ 13, 12 ], [ 14, 13 ], [ 15, 18 ], [ 17, 14 ], [ 18, 19 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Louis knows Clara. Kenzie knows Joy. Ibrahim knows Jeremiah. Trina knows Flora. Joyce knows Enid. Joyce knows Troy. Ibrahim knows Kamila. Natalie knows Louis. Ibrahim knows Donovan. Louis knows Gladys. Vernon knows Lawson. Vernon knows Cruz. Trina knows Joyce. Louis knows Patrick. Kenzie knows Ibrahim. Vernon knows Jeanne. Jeremiah knows Vernon. Joyce knows Natalie. Which of Joyce and Ibrahim can Kenzie reach?", "answer": "Ibrahim", "steps": [ "Kenzie knows Ibrahim." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Kenzie", "Joy", "Kamila", "Lawson", "Vernon", "Jeremiah", "Cruz", "Jeanne", "Donovan", "Ibrahim", "Trina", "Flora", "Enid", "Patrick", "Louis", "Natalie", "Gladys", "Clara", "Troy", "Joyce" ], "edges": [ [ 0, 1 ], [ 0, 9 ], [ 4, 3 ], [ 4, 6 ], [ 4, 7 ], [ 5, 4 ], [ 9, 2 ], [ 9, 5 ], [ 9, 8 ], [ 10, 11 ], [ 10, 19 ], [ 14, 13 ], [ 14, 16 ], [ 14, 17 ], [ 15, 14 ], [ 19, 12 ], [ 19, 15 ], [ 19, 18 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Mara knows Heath. Emmett knows Doris. Gregory knows Michelle. Gemma knows Vicki. Gregory knows Darren. Luke knows Mae. Vicki knows Isaac. Mia knows Elaine. Heath knows Mia. Mae knows Autumn. Isaac knows Ira. Luke knows Hadley. Autumn knows Gregory. Doris knows Luke. Doris knows Edward. Isaac knows Mara. Vicki knows Leonard. Mia knows Della. Which of Mae and Mara can Gemma reach?", "answer": "Mara", "steps": [ "Gemma knows Vicki.", "Vicki knows Isaac.", "Isaac knows Mara." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Gemma", "Ira", "Leonard", "Mara", "Vicki", "Elaine", "Isaac", "Mia", "Heath", "Della", "Emmett", "Hadley", "Edward", "Mae", "Doris", "Darren", "Luke", "Gregory", "Autumn", "Michelle" ], "edges": [ [ 0, 4 ], [ 3, 8 ], [ 4, 2 ], [ 4, 6 ], [ 6, 1 ], [ 6, 3 ], [ 7, 5 ], [ 7, 9 ], [ 8, 7 ], [ 10, 14 ], [ 13, 18 ], [ 14, 12 ], [ 14, 16 ], [ 16, 11 ], [ 16, 13 ], [ 17, 15 ], [ 17, 19 ], [ 18, 17 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Palmer knows Victoria. Clyde knows George. Vincent knows Teresa. Roy knows Hugh. Palmer knows Ethan. Jeffery knows Nadine. Peggy knows Finn. Brooks knows Jenny. Jack knows Jeffery. Roy knows Palmer. Jeffery knows Jesse. Jack knows Neville. Jack knows Alex. Roy knows Mike. Teresa knows Roy. Jenny knows Peggy. George knows Vincent. Finn knows Jack. Which of Teresa and Finn can Clyde reach?", "answer": "Teresa", "steps": [ "Clyde knows George.", "George knows Vincent.", "Vincent knows Teresa." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Clyde", "Palmer", "Ethan", "Hugh", "Teresa", "George", "Vincent", "Victoria", "Roy", "Mike", "Brooks", "Jeffery", "Nadine", "Neville", "Finn", "Jenny", "Peggy", "Jesse", "Jack", "Alex" ], "edges": [ [ 0, 5 ], [ 1, 2 ], [ 1, 7 ], [ 4, 8 ], [ 5, 6 ], [ 6, 4 ], [ 8, 3 ], [ 8, 1 ], [ 8, 9 ], [ 10, 15 ], [ 11, 12 ], [ 11, 17 ], [ 14, 18 ], [ 15, 16 ], [ 16, 14 ], [ 18, 13 ], [ 18, 11 ], [ 18, 19 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Billy knows Renee. Wyatt knows Ernest. Evan knows Edison. Wyatt knows Linda. Erwin knows Andre. Hampton knows Evan. Maya knows Hampton. Ryan knows Carlton. Maya knows Leigh. Leigh knows Bernice. Leigh knows Kieran. Renee knows Erwin. Leigh knows Sonia. Wyatt knows Alvin. Renee knows Estelle. Billy knows Wyatt. Estelle knows Marc. Hampton knows Ryan. Which of Renee and Hampton can Billy reach?", "answer": "Renee", "steps": [ "Billy knows Renee." ], "difficulty": 1, "original_distance": 3, "idx_to_symbol": [ "Billy", "Estelle", "Renee", "Marc", "Erwin", "Andre", "Ernest", "Wyatt", "Alvin", "Linda", "Maya", "Ryan", "Hampton", "Carlton", "Evan", "Edison", "Sonia", "Leigh", "Bernice", "Kieran" ], "edges": [ [ 0, 2 ], [ 0, 7 ], [ 1, 3 ], [ 2, 1 ], [ 2, 4 ], [ 4, 5 ], [ 7, 6 ], [ 7, 8 ], [ 7, 9 ], [ 10, 12 ], [ 10, 17 ], [ 11, 13 ], [ 12, 11 ], [ 12, 14 ], [ 14, 15 ], [ 17, 16 ], [ 17, 18 ], [ 17, 19 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Cecilia knows Miriam. Leopold knows Violet. Elvis knows Ariana. Cecilia knows Wendell. Violet knows Katherine. Marie knows Luz. Destiny knows Kristina. Miriam knows Destiny. Yvette knows Kieran. Kieran knows Alder. Katherine knows Dirk. Elvis knows Loretta. Yvette knows Elvis. Marie knows Yasmin. Isabel knows Marie. Isabel knows Cecilia. Kieran knows Leopold. Kristina knows Katrina. Which of Kieran and Cecilia can Yvette reach?", "answer": "Kieran", "steps": [ "Yvette knows Kieran." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Yvette", "Violet", "Alder", "Kieran", "Loretta", "Ariana", "Katherine", "Leopold", "Dirk", "Elvis", "Isabel", "Destiny", "Wendell", "Cecilia", "Yasmin", "Luz", "Kristina", "Miriam", "Katrina", "Marie" ], "edges": [ [ 0, 3 ], [ 0, 9 ], [ 1, 6 ], [ 3, 2 ], [ 3, 7 ], [ 6, 8 ], [ 7, 1 ], [ 9, 4 ], [ 9, 5 ], [ 10, 13 ], [ 10, 19 ], [ 11, 16 ], [ 13, 12 ], [ 13, 17 ], [ 16, 18 ], [ 17, 11 ], [ 19, 14 ], [ 19, 15 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Magdalena knows Daphne. Alma knows Jeremiah. Lois knows Alma. Brian knows Lois. Dee knows Jodi. Marcus knows Ernest. Jennifer knows Marcus. Mildred knows Dee. Brian knows Jennifer. Roland knows Langston. Jodi knows Magdalena. Eli knows Palmer. Kara knows Brian. Mindy knows Roland. Lois knows Eli. Dee knows Mindy. Scott knows Dina. Jodi knows Scott. Which of Jodi and Lois can Kara reach?", "answer": "Lois", "steps": [ "Kara knows Brian.", "Brian knows Lois." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Kara", "Brian", "Eli", "Marcus", "Alma", "Jennifer", "Lois", "Jeremiah", "Ernest", "Palmer", "Mildred", "Dee", "Magdalena", "Roland", "Scott", "Mindy", "Jodi", "Dina", "Langston", "Daphne" ], "edges": [ [ 0, 1 ], [ 1, 5 ], [ 1, 6 ], [ 2, 9 ], [ 3, 8 ], [ 4, 7 ], [ 5, 3 ], [ 6, 4 ], [ 6, 2 ], [ 10, 11 ], [ 11, 15 ], [ 11, 16 ], [ 12, 19 ], [ 13, 18 ], [ 14, 17 ], [ 15, 13 ], [ 16, 14 ], [ 16, 12 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Duncan knows Ford. Bart knows Ashley. Mae knows Lara. Amber knows Bart. Bart knows Frankie. Frankie knows Myra. Mae knows Taylor. Hendrix knows Hampton. Duncan knows Jessica. Ashley knows Nolan. Amber knows Audrey. Duncan knows June. Jessica knows Mae. Ashley knows Aaron. Hampton knows Harlan. Myra knows Kyle. Amber knows Julia. Jessica knows Hendrix. Which of Jessica and Bart can Amber reach?", "answer": "Bart", "steps": [ "Amber knows Bart." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Amber", "Myra", "Frankie", "Nolan", "Julia", "Bart", "Audrey", "Ashley", "Aaron", "Kyle", "Duncan", "Hampton", "Hendrix", "Taylor", "Ford", "Jessica", "June", "Mae", "Lara", "Harlan" ], "edges": [ [ 0, 4 ], [ 0, 6 ], [ 0, 5 ], [ 1, 9 ], [ 2, 1 ], [ 5, 7 ], [ 5, 2 ], [ 7, 3 ], [ 7, 8 ], [ 10, 14 ], [ 10, 16 ], [ 10, 15 ], [ 11, 19 ], [ 12, 11 ], [ 15, 17 ], [ 15, 12 ], [ 17, 13 ], [ 17, 18 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Kim knows Tanya. Pearl knows Darcy. Helene knows Larissa. Larissa knows Rhea. Darcy knows Dorothy. Kim knows Ariana. Javier knows Lana. Dante knows Edna. Yasmin knows Jaime. Cristina knows Charity. Charity knows Dante. Dante knows Yasmin. Ramon knows Pearl. Lana knows Kim. Jermaine knows Javier. Ramon knows Cristina. Tanya knows Nancy. Jermaine knows Helene. Which of Cristina and Javier can Jermaine reach?", "answer": "Javier", "steps": [ "Jermaine knows Javier." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Jermaine", "Ariana", "Larissa", "Tanya", "Javier", "Lana", "Nancy", "Helene", "Rhea", "Kim", "Ramon", "Edna", "Darcy", "Yasmin", "Cristina", "Charity", "Jaime", "Pearl", "Dorothy", "Dante" ], "edges": [ [ 0, 7 ], [ 0, 4 ], [ 2, 8 ], [ 3, 6 ], [ 4, 5 ], [ 5, 9 ], [ 7, 2 ], [ 9, 1 ], [ 9, 3 ], [ 10, 17 ], [ 10, 14 ], [ 12, 18 ], [ 13, 16 ], [ 14, 15 ], [ 15, 19 ], [ 17, 12 ], [ 19, 11 ], [ 19, 13 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Neal knows Dante. Vera knows Harmony. Betty knows Israel. Colby knows Alvin. Betty knows Dolly. Alex knows Imogen. Joy knows Colby. Vera knows Gene. Thomas knows Jewel. Colby knows Carlos. Natalie knows Joy. Molly knows Alex. Dolly knows Neal. Jewel knows Vera. Molly knows Bob. Gene knows Betty. Carlos knows Molly. Imogen knows Grant. Which of Joy and Jewel can Thomas reach?", "answer": "Jewel", "steps": [ "Thomas knows Jewel." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Thomas", "Israel", "Dolly", "Vera", "Dante", "Jewel", "Neal", "Betty", "Harmony", "Gene", "Natalie", "Bob", "Alex", "Colby", "Grant", "Joy", "Imogen", "Molly", "Alvin", "Carlos" ], "edges": [ [ 0, 5 ], [ 2, 6 ], [ 3, 8 ], [ 3, 9 ], [ 5, 3 ], [ 6, 4 ], [ 7, 1 ], [ 7, 2 ], [ 9, 7 ], [ 10, 15 ], [ 12, 16 ], [ 13, 18 ], [ 13, 19 ], [ 15, 13 ], [ 16, 14 ], [ 17, 11 ], [ 17, 12 ], [ 19, 17 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Cassidy knows Xavier. Brett knows Flora. Axel knows Yvonne. Yvonne knows Ingrid. Luther knows Julie. James knows George. George knows Axel. Rocco knows Cassidy. Miranda knows Teresa. Flora knows Darcy. Itzel knows Rocco. Darcy knows Autumn. Itzel knows Brett. Merle knows Miranda. Bella knows James. Bella knows Merle. Teresa knows Holden. Xavier knows Luther. Which of Rocco and James can Itzel reach?", "answer": "Rocco", "steps": [ "Itzel knows Rocco." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Itzel", "Brett", "Luther", "Julie", "Cassidy", "Autumn", "Darcy", "Rocco", "Xavier", "Flora", "Bella", "Merle", "Yvonne", "Ingrid", "George", "Holden", "Teresa", "James", "Axel", "Miranda" ], "edges": [ [ 0, 7 ], [ 0, 1 ], [ 1, 9 ], [ 2, 3 ], [ 4, 8 ], [ 6, 5 ], [ 7, 4 ], [ 8, 2 ], [ 9, 6 ], [ 10, 17 ], [ 10, 11 ], [ 11, 19 ], [ 12, 13 ], [ 14, 18 ], [ 16, 15 ], [ 17, 14 ], [ 18, 12 ], [ 19, 16 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Rita knows Olive. Malik knows Reid. Emma knows Theodore. Tara knows Marie. Marie knows Rita. Reid knows Damien. Corey knows Samantha. Samantha knows Malik. Tara knows Nolan. Rita knows Troy. Reid knows Edgar. Samantha knows Emma. Howard knows Tara. Troy knows Kennedy. Nolan knows Vanessa. Edgar knows Elijah. Emma knows Ezra. Nolan knows Adele. Which of Malik and Marie can Howard reach?", "answer": "Marie", "steps": [ "Howard knows Tara.", "Tara knows Marie." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Howard", "Rita", "Tara", "Nolan", "Marie", "Vanessa", "Adele", "Olive", "Kennedy", "Troy", "Corey", "Reid", "Samantha", "Emma", "Malik", "Theodore", "Ezra", "Damien", "Elijah", "Edgar" ], "edges": [ [ 0, 2 ], [ 1, 7 ], [ 1, 9 ], [ 2, 3 ], [ 2, 4 ], [ 3, 5 ], [ 3, 6 ], [ 4, 1 ], [ 9, 8 ], [ 10, 12 ], [ 11, 17 ], [ 11, 19 ], [ 12, 13 ], [ 12, 14 ], [ 13, 15 ], [ 13, 16 ], [ 14, 11 ], [ 19, 18 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Floyd knows Gloria. Gloria knows Gabriel. Jenny knows Bruce. Jorge knows Dahlia. Anastasia knows Tessa. Bruce knows Damian. Justin knows Jeffery. Gabriel knows Virginia. Floyd knows Marc. Bruce knows Dawn. Yvonne knows Jenny. Marc knows Pierce. Gabriel knows Hope. Kate knows Floyd. Yvonne knows Justin. Anastasia knows Yvonne. Tessa knows Duke. Kate knows Jorge. Which of Floyd and Yvonne can Anastasia reach?", "answer": "Yvonne", "steps": [ "Anastasia knows Yvonne." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Anastasia", "Yvonne", "Damian", "Tessa", "Duke", "Bruce", "Justin", "Jenny", "Jeffery", "Dawn", "Kate", "Floyd", "Hope", "Jorge", "Dahlia", "Gabriel", "Marc", "Gloria", "Pierce", "Virginia" ], "edges": [ [ 0, 3 ], [ 0, 1 ], [ 1, 6 ], [ 1, 7 ], [ 3, 4 ], [ 5, 2 ], [ 5, 9 ], [ 6, 8 ], [ 7, 5 ], [ 10, 13 ], [ 10, 11 ], [ 11, 16 ], [ 11, 17 ], [ 13, 14 ], [ 15, 12 ], [ 15, 19 ], [ 16, 18 ], [ 17, 15 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Mara knows Heath. Emmett knows Doris. Gregory knows Michelle. Gemma knows Vicki. Gregory knows Darren. Luke knows Mae. Vicki knows Isaac. Mia knows Elaine. Heath knows Mia. Mae knows Autumn. Isaac knows Ira. Luke knows Hadley. Autumn knows Gregory. Doris knows Luke. Doris knows Edward. Isaac knows Mara. Vicki knows Leonard. Mia knows Della. Which of Heath and Autumn can Gemma reach?", "answer": "Heath", "steps": [ "Gemma knows Vicki.", "Vicki knows Isaac.", "Isaac knows Mara.", "Mara knows Heath." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Gemma", "Ira", "Leonard", "Mara", "Vicki", "Elaine", "Isaac", "Mia", "Heath", "Della", "Emmett", "Hadley", "Edward", "Mae", "Doris", "Darren", "Luke", "Gregory", "Autumn", "Michelle" ], "edges": [ [ 0, 4 ], [ 3, 8 ], [ 4, 2 ], [ 4, 6 ], [ 6, 1 ], [ 6, 3 ], [ 7, 5 ], [ 7, 9 ], [ 8, 7 ], [ 10, 14 ], [ 13, 18 ], [ 14, 12 ], [ 14, 16 ], [ 16, 11 ], [ 16, 13 ], [ 17, 15 ], [ 17, 19 ], [ 18, 17 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Susan knows Cooper. Bennett knows Jeremiah. Cliff knows Jessie. Jessie knows Bernice. Jessie knows Howard. Fritz knows Susan. Jeremiah knows Lane. Barbara knows Pedro. Lane knows Skyler. Barbara knows Bennett. Barbara knows Jolene. Jessie knows Fritz. Pedro knows Fabian. Bernice knows Hudson. Cooper knows Herbert. Hudson knows Keegan. Fabian knows Jarvis. Aurora knows Barbara. Which of Lane and Cooper can Aurora reach?", "answer": "Lane", "steps": [ "Aurora knows Barbara.", "Barbara knows Bennett.", "Bennett knows Jeremiah.", "Jeremiah knows Lane." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Aurora", "Fabian", "Barbara", "Pedro", "Skyler", "Lane", "Bennett", "Jeremiah", "Jolene", "Jarvis", "Cliff", "Hudson", "Jessie", "Bernice", "Herbert", "Cooper", "Fritz", "Susan", "Howard", "Keegan" ], "edges": [ [ 0, 2 ], [ 1, 9 ], [ 2, 6 ], [ 2, 8 ], [ 2, 3 ], [ 3, 1 ], [ 5, 4 ], [ 6, 7 ], [ 7, 5 ], [ 10, 12 ], [ 11, 19 ], [ 12, 16 ], [ 12, 18 ], [ 12, 13 ], [ 13, 11 ], [ 15, 14 ], [ 16, 17 ], [ 17, 15 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Bryan knows Alyson. Elise knows Pete. Dennis knows Nancy. Sierra knows Clinton. Elise knows Charlotte. Pete knows Dennis. Inez knows Aspen. Irene knows Holly. Joan knows Irene. Joan knows Alder. Bryan knows Neville. Irene knows Elaine. Jackson knows Sierra. Jackson knows Josie. Clinton knows Erica. Holly knows Inez. Dennis knows Jackson. Alyson knows Joan. Which of Joan and Dennis can Elise reach?", "answer": "Dennis", "steps": [ "Elise knows Pete.", "Pete knows Dennis." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Elise", "Erica", "Nancy", "Josie", "Sierra", "Pete", "Charlotte", "Clinton", "Dennis", "Jackson", "Bryan", "Aspen", "Alder", "Elaine", "Holly", "Alyson", "Neville", "Inez", "Joan", "Irene" ], "edges": [ [ 0, 6 ], [ 0, 5 ], [ 4, 7 ], [ 5, 8 ], [ 7, 1 ], [ 8, 2 ], [ 8, 9 ], [ 9, 3 ], [ 9, 4 ], [ 10, 16 ], [ 10, 15 ], [ 14, 17 ], [ 15, 18 ], [ 17, 11 ], [ 18, 12 ], [ 18, 19 ], [ 19, 13 ], [ 19, 14 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Joy knows Edwin. Ada knows Spencer. Gloria knows Kelly. Darius knows Joy. Allan knows Henrietta. Reid knows Camden. Reid knows Dominic. Lorraine knows Reid. Lillian knows Darius. Lillian knows Pam. Blanche knows Gloria. Joy knows Carter. Allan knows Drew. Spencer knows Lorraine. Henrietta knows Lillian. Spencer knows Caroline. Blanche knows Ada. Drew knows Shelly. Which of Dominic and Carter can Blanche reach?", "answer": "Dominic", "steps": [ "Blanche knows Ada.", "Ada knows Spencer.", "Spencer knows Lorraine.", "Lorraine knows Reid.", "Reid knows Dominic." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Blanche", "Lorraine", "Ada", "Spencer", "Gloria", "Dominic", "Camden", "Kelly", "Caroline", "Reid", "Allan", "Darius", "Henrietta", "Lillian", "Drew", "Carter", "Edwin", "Shelly", "Pam", "Joy" ], "edges": [ [ 0, 4 ], [ 0, 2 ], [ 1, 9 ], [ 2, 3 ], [ 3, 8 ], [ 3, 1 ], [ 4, 7 ], [ 9, 5 ], [ 9, 6 ], [ 10, 14 ], [ 10, 12 ], [ 11, 19 ], [ 12, 13 ], [ 13, 18 ], [ 13, 11 ], [ 14, 17 ], [ 19, 15 ], [ 19, 16 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Tim knows Lucille. Lucille knows Lucy. Jermaine knows Gerald. Kim knows Jermaine. Morgan knows Earl. Randall knows Tim. Jermaine knows Cain. Randall knows Parker. Erwin knows Serena. Cynthia knows Davis. Lucy knows Fraser. Cynthia knows Barney. Erwin knows Kim. Karl knows Audrey. Earl knows Erwin. Lucy knows Electra. Karl knows Morgan. Fraser knows Cynthia. Which of Fraser and Kim can Randall reach?", "answer": "Fraser", "steps": [ "Randall knows Tim.", "Tim knows Lucille.", "Lucille knows Lucy.", "Lucy knows Fraser." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Randall", "Lucille", "Parker", "Lucy", "Tim", "Cynthia", "Barney", "Electra", "Fraser", "Davis", "Karl", "Earl", "Audrey", "Erwin", "Morgan", "Jermaine", "Gerald", "Serena", "Kim", "Cain" ], "edges": [ [ 0, 2 ], [ 0, 4 ], [ 1, 3 ], [ 3, 7 ], [ 3, 8 ], [ 4, 1 ], [ 5, 6 ], [ 5, 9 ], [ 8, 5 ], [ 10, 12 ], [ 10, 14 ], [ 11, 13 ], [ 13, 17 ], [ 13, 18 ], [ 14, 11 ], [ 15, 16 ], [ 15, 19 ], [ 18, 15 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Will knows Thea. Thea knows Knox. Corinne knows Brooks. Jerome knows Eloise. Corinne knows Boyd. Sharon knows Vicki. Thea knows Kingsley. Lola knows Morgan. Jerome knows Lola. Will knows Carrie. Eloise knows Marcia. Lola knows Corinne. Marcia knows Harlan. Vicki knows Franklin. Kingsley knows Leticia. Jerome knows Alfred. Kingsley knows Desmond. Will knows Sharon. Which of Boyd and Desmond can Will reach?", "answer": "Desmond", "steps": [ "Will knows Thea.", "Thea knows Kingsley.", "Kingsley knows Desmond." ], "difficulty": 3, "original_distance": 3, "idx_to_symbol": [ "Will", "Sharon", "Vicki", "Kingsley", "Knox", "Desmond", "Franklin", "Thea", "Carrie", "Leticia", "Jerome", "Eloise", "Marcia", "Corinne", "Morgan", "Boyd", "Harlan", "Lola", "Alfred", "Brooks" ], "edges": [ [ 0, 1 ], [ 0, 8 ], [ 0, 7 ], [ 1, 2 ], [ 2, 6 ], [ 3, 5 ], [ 3, 9 ], [ 7, 4 ], [ 7, 3 ], [ 10, 11 ], [ 10, 18 ], [ 10, 17 ], [ 11, 12 ], [ 12, 16 ], [ 13, 15 ], [ 13, 19 ], [ 17, 14 ], [ 17, 13 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Judith knows Lillian. Kendra knows Dora. Dudley knows Judith. Darcy knows Hector. Lance knows Kendra. Declan knows Jem. Ford knows Giselle. Chelsea knows Ford. Mike knows Kim. Kendra knows Chelsea. Kim knows Lance. Russell knows Mike. Declan knows Dudley. Jon knows Darcy. Kim knows Patricia. Judith knows Jon. Paula knows Elias. Elias knows Declan. Which of Chelsea and Jon can Russell reach?", "answer": "Chelsea", "steps": [ "Russell knows Mike.", "Mike knows Kim.", "Kim knows Lance.", "Lance knows Kendra.", "Kendra knows Chelsea." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Russell", "Lance", "Kendra", "Ford", "Patricia", "Dora", "Mike", "Kim", "Giselle", "Chelsea", "Paula", "Dudley", "Judith", "Darcy", "Jem", "Lillian", "Elias", "Declan", "Hector", "Jon" ], "edges": [ [ 0, 6 ], [ 1, 2 ], [ 2, 5 ], [ 2, 9 ], [ 3, 8 ], [ 6, 7 ], [ 7, 4 ], [ 7, 1 ], [ 9, 3 ], [ 10, 16 ], [ 11, 12 ], [ 12, 15 ], [ 12, 19 ], [ 13, 18 ], [ 16, 17 ], [ 17, 14 ], [ 17, 11 ], [ 19, 13 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Tina knows Gene. Jonah knows Tina. Dale knows Shannon. Tina knows Dale. Hannah knows June. Corey knows Courtney. Cesar knows Hannah. Gene knows Archie. Miranda knows Jonah. June knows Cooper. Jenna knows Jorge. Miranda knows Jameson. Gene knows Dexter. Cesar knows Glen. Cooper knows Connor. Jenna knows Corey. Dexter knows Audrey. June knows Jenna. Which of Jenna and Gene can Miranda reach?", "answer": "Gene", "steps": [ "Miranda knows Jonah.", "Jonah knows Tina.", "Tina knows Gene." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Miranda", "Tina", "Shannon", "Jonah", "Dexter", "Audrey", "Gene", "Dale", "Jameson", "Archie", "Cesar", "June", "Connor", "Hannah", "Corey", "Courtney", "Jenna", "Cooper", "Glen", "Jorge" ], "edges": [ [ 0, 8 ], [ 0, 3 ], [ 1, 7 ], [ 1, 6 ], [ 3, 1 ], [ 4, 5 ], [ 6, 4 ], [ 6, 9 ], [ 7, 2 ], [ 10, 18 ], [ 10, 13 ], [ 11, 17 ], [ 11, 16 ], [ 13, 11 ], [ 14, 15 ], [ 16, 14 ], [ 16, 19 ], [ 17, 12 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Ira knows Hayes. Farrah knows Perry. Hayes knows Gareth. Paula knows Jude. Allison knows Jolena. Dell knows Xavier. Gareth knows Esme. August knows Lily. Jolena knows Avery. Jude knows August. Rick knows Farrah. Kurt knows Essie. Perry knows Allison. Jude knows Leopold. Kurt knows Rick. Rick knows Dell. Leopold knows Ira. Paula knows Priscilla. Which of Ira and Perry can Kurt reach?", "answer": "Perry", "steps": [ "Kurt knows Rick.", "Rick knows Farrah.", "Farrah knows Perry." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Kurt", "Jolena", "Rick", "Xavier", "Dell", "Allison", "Perry", "Farrah", "Essie", "Avery", "Paula", "Gareth", "Jude", "Lily", "August", "Hayes", "Ira", "Leopold", "Priscilla", "Esme" ], "edges": [ [ 0, 8 ], [ 0, 2 ], [ 1, 9 ], [ 2, 4 ], [ 2, 7 ], [ 4, 3 ], [ 5, 1 ], [ 6, 5 ], [ 7, 6 ], [ 10, 18 ], [ 10, 12 ], [ 11, 19 ], [ 12, 14 ], [ 12, 17 ], [ 14, 13 ], [ 15, 11 ], [ 16, 15 ], [ 17, 16 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Tim knows Lucille. Lucille knows Lucy. Jermaine knows Gerald. Kim knows Jermaine. Morgan knows Earl. Randall knows Tim. Jermaine knows Cain. Randall knows Parker. Erwin knows Serena. Cynthia knows Davis. Lucy knows Fraser. Cynthia knows Barney. Erwin knows Kim. Karl knows Audrey. Earl knows Erwin. Lucy knows Electra. Karl knows Morgan. Fraser knows Cynthia. Which of Erwin and Lucy can Randall reach?", "answer": "Lucy", "steps": [ "Randall knows Tim.", "Tim knows Lucille.", "Lucille knows Lucy." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Randall", "Lucille", "Parker", "Lucy", "Tim", "Cynthia", "Barney", "Electra", "Fraser", "Davis", "Karl", "Earl", "Audrey", "Erwin", "Morgan", "Jermaine", "Gerald", "Serena", "Kim", "Cain" ], "edges": [ [ 0, 2 ], [ 0, 4 ], [ 1, 3 ], [ 3, 7 ], [ 3, 8 ], [ 4, 1 ], [ 5, 6 ], [ 5, 9 ], [ 8, 5 ], [ 10, 12 ], [ 10, 14 ], [ 11, 13 ], [ 13, 17 ], [ 13, 18 ], [ 14, 11 ], [ 15, 16 ], [ 15, 19 ], [ 18, 15 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Shannon knows Della. Faith knows Dallas. Lola knows Faith. Faith knows Margaret. Jay knows Carson. Shannon knows Latoya. Shannon knows Andrew. Rose knows Shannon. Margaret knows Jay. Reid knows Karina. Demetrius knows Reid. Shannon knows Tina. Faith knows Christopher. Myra knows Virginia. Dawn knows Cooper. Della knows Dawn. Latoya knows Myra. Faith knows Demetrius. Which of Reid and Dawn can Lola reach?", "answer": "Reid", "steps": [ "Lola knows Faith.", "Faith knows Demetrius.", "Demetrius knows Reid." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Lola", "Faith", "Margaret", "Reid", "Dallas", "Karina", "Demetrius", "Christopher", "Carson", "Jay", "Rose", "Shannon", "Latoya", "Dawn", "Andrew", "Cooper", "Della", "Tina", "Virginia", "Myra" ], "edges": [ [ 0, 1 ], [ 1, 4 ], [ 1, 6 ], [ 1, 7 ], [ 1, 2 ], [ 2, 9 ], [ 3, 5 ], [ 6, 3 ], [ 9, 8 ], [ 10, 11 ], [ 11, 14 ], [ 11, 16 ], [ 11, 17 ], [ 11, 12 ], [ 12, 19 ], [ 13, 15 ], [ 16, 13 ], [ 19, 18 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Hank knows Reed. Elmer knows Mindy. Zachary knows Langston. Blaine knows Finn. Finn knows Geoffrey. Xander knows Elmer. Reed knows Davis. Mindy knows Miriam. Davis knows Fanny. Xander knows Allen. Geoffrey knows Dolores. Zachary knows Val. Glen knows Essie. Celia knows Zachary. Carmen knows Xander. Dolores knows Carmen. Val knows Glen. Fanny knows Celia. Which of Carmen and Celia can Blaine reach?", "answer": "Carmen", "steps": [ "Blaine knows Finn.", "Finn knows Geoffrey.", "Geoffrey knows Dolores.", "Dolores knows Carmen." ], "difficulty": 4, "original_distance": 8, "idx_to_symbol": [ "Blaine", "Geoffrey", "Carmen", "Dolores", "Allen", "Miriam", "Elmer", "Xander", "Finn", "Mindy", "Hank", "Davis", "Celia", "Fanny", "Langston", "Essie", "Val", "Zachary", "Reed", "Glen" ], "edges": [ [ 0, 8 ], [ 1, 3 ], [ 2, 7 ], [ 3, 2 ], [ 6, 9 ], [ 7, 4 ], [ 7, 6 ], [ 8, 1 ], [ 9, 5 ], [ 10, 18 ], [ 11, 13 ], [ 12, 17 ], [ 13, 12 ], [ 16, 19 ], [ 17, 14 ], [ 17, 16 ], [ 18, 11 ], [ 19, 15 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Lionel knows Miranda. Lionel knows Ivan. Brent knows Clifford. Kristina knows Skyler. Daphna knows Brent. Miranda knows Elmer. Denver knows Dolly. Homer knows Dixie. Denver knows India. Lionel knows Bella. Allan knows Loretta. Allan knows Homer. Dolly knows Daphna. Allan knows Denver. Miranda knows Bette. Bette knows Fern. Fern knows Kristina. Bella knows Violet. Which of Bette and Dolly can Allan reach?", "answer": "Dolly", "steps": [ "Allan knows Denver.", "Denver knows Dolly." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Allan", "Daphna", "Dolly", "Brent", "Clifford", "Denver", "Dixie", "Homer", "Loretta", "India", "Lionel", "Fern", "Bette", "Kristina", "Skyler", "Miranda", "Violet", "Bella", "Ivan", "Elmer" ], "edges": [ [ 0, 7 ], [ 0, 8 ], [ 0, 5 ], [ 1, 3 ], [ 2, 1 ], [ 3, 4 ], [ 5, 2 ], [ 5, 9 ], [ 7, 6 ], [ 10, 17 ], [ 10, 18 ], [ 10, 15 ], [ 11, 13 ], [ 12, 11 ], [ 13, 14 ], [ 15, 12 ], [ 15, 19 ], [ 17, 16 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Cassidy knows Benjamin. Frank knows Cindy. Yasmin knows Pearl. Boyd knows Colby. Cordelia knows Jewel. Pearl knows Jake. Boyd knows Lola. Lola knows Glen. Roy knows Darla. Davis knows Frank. Gerald knows Cordelia. Benjamin knows Boyd. Darla knows Gerald. Benjamin knows Davis. Gerald knows Yasmin. Jewel knows Fred. Cordelia knows Kai. Desmond knows Cassidy. Which of Boyd and Cordelia can Desmond reach?", "answer": "Boyd", "steps": [ "Desmond knows Cassidy.", "Cassidy knows Benjamin.", "Benjamin knows Boyd." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Desmond", "Lola", "Colby", "Benjamin", "Glen", "Frank", "Cassidy", "Davis", "Cindy", "Boyd", "Roy", "Jewel", "Kai", "Gerald", "Fred", "Pearl", "Darla", "Yasmin", "Jake", "Cordelia" ], "edges": [ [ 0, 6 ], [ 1, 4 ], [ 3, 7 ], [ 3, 9 ], [ 5, 8 ], [ 6, 3 ], [ 7, 5 ], [ 9, 2 ], [ 9, 1 ], [ 10, 16 ], [ 11, 14 ], [ 13, 17 ], [ 13, 19 ], [ 15, 18 ], [ 16, 13 ], [ 17, 15 ], [ 19, 12 ], [ 19, 11 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Jim knows Jeffery. Darren knows Chloe. Vernon knows Miriam. Vernon knows Ernesto. Vernon knows Marco. Leticia knows Colleen. Leticia knows Kai. Jim knows Alfonso. Abby knows Darren. Abby knows Effie. Belinda knows Frank. Jeffery knows Belinda. Abby knows Marian. Effie knows Vernon. Jim knows Leticia. Belinda knows Megan. Darren knows Jeanne. Belinda knows Ember. Which of Miriam and Frank can Jim reach?", "answer": "Frank", "steps": [ "Jim knows Jeffery.", "Jeffery knows Belinda.", "Belinda knows Frank." ], "difficulty": 3, "original_distance": 3, "idx_to_symbol": [ "Jim", "Belinda", "Alfonso", "Megan", "Ember", "Kai", "Colleen", "Jeffery", "Frank", "Leticia", "Abby", "Vernon", "Marian", "Marco", "Ernesto", "Jeanne", "Chloe", "Effie", "Miriam", "Darren" ], "edges": [ [ 0, 2 ], [ 0, 7 ], [ 0, 9 ], [ 1, 3 ], [ 1, 4 ], [ 1, 8 ], [ 7, 1 ], [ 9, 5 ], [ 9, 6 ], [ 10, 12 ], [ 10, 17 ], [ 10, 19 ], [ 11, 13 ], [ 11, 14 ], [ 11, 18 ], [ 17, 11 ], [ 19, 15 ], [ 19, 16 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Zack knows Jesse. Ezra knows Veronica. Diane knows Vivian. Malik knows Paige. Elijah knows Elliot. Jenny knows Corinne. Malik knows Hope. Charlene knows Joseph. Corinne knows Jane. Diane knows Charlene. Vivian knows Erwin. Jenny knows Ezra. Zack knows Malik. Elijah knows Keira. Joseph knows Elijah. Elliot knows Sarah. Elliot knows Opal. Jane knows Zack. Which of Zack and Elijah can Jenny reach?", "answer": "Zack", "steps": [ "Jenny knows Corinne.", "Corinne knows Jane.", "Jane knows Zack." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Jenny", "Corinne", "Paige", "Hope", "Veronica", "Malik", "Ezra", "Zack", "Jane", "Jesse", "Diane", "Charlene", "Sarah", "Opal", "Erwin", "Elliot", "Vivian", "Elijah", "Joseph", "Keira" ], "edges": [ [ 0, 6 ], [ 0, 1 ], [ 1, 8 ], [ 5, 2 ], [ 5, 3 ], [ 6, 4 ], [ 7, 5 ], [ 7, 9 ], [ 8, 7 ], [ 10, 16 ], [ 10, 11 ], [ 11, 18 ], [ 15, 12 ], [ 15, 13 ], [ 16, 14 ], [ 17, 15 ], [ 17, 19 ], [ 18, 17 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Hannah knows Leroy. Ronald knows Graeme. Ray knows Terry. Hannah knows Daisy. Troy knows Ronald. Graeme knows Rose. Terry knows Yvonne. Anna knows Ray. Ethan knows Archer. Rose knows Ethan. Candice knows Anna. Archer knows Chris. Candice knows Clarence. Yvonne knows Nelson. Hannah knows Troy. Nelson knows Skyler. Candice knows Patricia. Skyler knows Billy. Which of Nelson and Ethan can Hannah reach?", "answer": "Ethan", "steps": [ "Hannah knows Troy.", "Troy knows Ronald.", "Ronald knows Graeme.", "Graeme knows Rose.", "Rose knows Ethan." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Hannah", "Ethan", "Troy", "Rose", "Ronald", "Archer", "Chris", "Daisy", "Graeme", "Leroy", "Candice", "Nelson", "Anna", "Yvonne", "Ray", "Skyler", "Billy", "Patricia", "Terry", "Clarence" ], "edges": [ [ 0, 7 ], [ 0, 2 ], [ 0, 9 ], [ 1, 5 ], [ 2, 4 ], [ 3, 1 ], [ 4, 8 ], [ 5, 6 ], [ 8, 3 ], [ 10, 17 ], [ 10, 12 ], [ 10, 19 ], [ 11, 15 ], [ 12, 14 ], [ 13, 11 ], [ 14, 18 ], [ 15, 16 ], [ 18, 13 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Jarvis knows Clay. Will knows Kendrick. Philip knows Dirk. June knows Brooks. Marshall knows Loretta. Tony knows Lyle. Milton knows Jarvis. Kendrick knows Marshall. Marco knows Will. Israel knows Marco. Kendrick knows Gene. Milton knows Seth. Will knows Lola. Laverne knows Jorge. June knows Milton. Clay knows Laverne. Dirk knows June. Loretta knows Tony. Which of Marshall and Jarvis can Israel reach?", "answer": "Marshall", "steps": [ "Israel knows Marco.", "Marco knows Will.", "Will knows Kendrick.", "Kendrick knows Marshall." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Israel", "Lyle", "Will", "Gene", "Tony", "Kendrick", "Marshall", "Marco", "Lola", "Loretta", "Philip", "Jorge", "June", "Seth", "Laverne", "Milton", "Jarvis", "Dirk", "Brooks", "Clay" ], "edges": [ [ 0, 7 ], [ 2, 8 ], [ 2, 5 ], [ 4, 1 ], [ 5, 3 ], [ 5, 6 ], [ 6, 9 ], [ 7, 2 ], [ 9, 4 ], [ 10, 17 ], [ 12, 18 ], [ 12, 15 ], [ 14, 11 ], [ 15, 13 ], [ 15, 16 ], [ 16, 19 ], [ 17, 12 ], [ 19, 14 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Jodi knows Daniella. Archer knows Trina. Gustavo knows Emma. Archie knows Isadora. Gustavo knows Khashayar. Gustavo knows Archer. Trina knows Harmony. Trina knows Vance. Emma knows Clement. Harmony knows Charles. Isadora knows Haley. Jennifer knows Gavin. Jennifer knows Herman. Isadora knows Arden. Haley knows Skyler. Jennifer knows Archie. Jennifer knows Jodi. Gustavo knows Scott. Which of Haley and Harmony can Gustavo reach?", "answer": "Harmony", "steps": [ "Gustavo knows Archer.", "Archer knows Trina.", "Trina knows Harmony." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Gustavo", "Emma", "Khashayar", "Clement", "Trina", "Charles", "Scott", "Archer", "Harmony", "Vance", "Jennifer", "Jodi", "Gavin", "Daniella", "Isadora", "Skyler", "Herman", "Archie", "Haley", "Arden" ], "edges": [ [ 0, 2 ], [ 0, 1 ], [ 0, 6 ], [ 0, 7 ], [ 1, 3 ], [ 4, 8 ], [ 4, 9 ], [ 7, 4 ], [ 8, 5 ], [ 10, 12 ], [ 10, 11 ], [ 10, 16 ], [ 10, 17 ], [ 11, 13 ], [ 14, 18 ], [ 14, 19 ], [ 17, 14 ], [ 18, 15 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Janice knows Ainsley. Graeme knows Blake. Destiny knows Maria. Herbert knows Alice. Carmela knows Janice. Vicki knows Carmela. Elmer knows Estella. Janice knows Graeme. Alice knows Vicki. Wallace knows Elmer. Stefan knows Jennifer. Maria knows Stefan. Elmer knows Scott. Jules knows Glenn. Cate knows Herbert. Stefan knows Jules. Estella knows Destiny. Herbert knows Charity. Which of Jules and Graeme can Cate reach?", "answer": "Graeme", "steps": [ "Cate knows Herbert.", "Herbert knows Alice.", "Alice knows Vicki.", "Vicki knows Carmela.", "Carmela knows Janice.", "Janice knows Graeme." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Cate", "Ainsley", "Alice", "Vicki", "Herbert", "Charity", "Carmela", "Graeme", "Janice", "Blake", "Wallace", "Jennifer", "Estella", "Destiny", "Elmer", "Scott", "Maria", "Jules", "Stefan", "Glenn" ], "edges": [ [ 0, 4 ], [ 2, 3 ], [ 3, 6 ], [ 4, 5 ], [ 4, 2 ], [ 6, 8 ], [ 7, 9 ], [ 8, 1 ], [ 8, 7 ], [ 10, 14 ], [ 12, 13 ], [ 13, 16 ], [ 14, 15 ], [ 14, 12 ], [ 16, 18 ], [ 17, 19 ], [ 18, 11 ], [ 18, 17 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Magdalena knows Daphne. Alma knows Jeremiah. Lois knows Alma. Brian knows Lois. Dee knows Jodi. Marcus knows Ernest. Jennifer knows Marcus. Mildred knows Dee. Brian knows Jennifer. Roland knows Langston. Jodi knows Magdalena. Eli knows Palmer. Kara knows Brian. Mindy knows Roland. Lois knows Eli. Dee knows Mindy. Scott knows Dina. Jodi knows Scott. Which of Dee and Brian can Kara reach?", "answer": "Brian", "steps": [ "Kara knows Brian." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Kara", "Brian", "Eli", "Marcus", "Alma", "Jennifer", "Lois", "Jeremiah", "Ernest", "Palmer", "Mildred", "Dee", "Magdalena", "Roland", "Scott", "Mindy", "Jodi", "Dina", "Langston", "Daphne" ], "edges": [ [ 0, 1 ], [ 1, 5 ], [ 1, 6 ], [ 2, 9 ], [ 3, 8 ], [ 4, 7 ], [ 5, 3 ], [ 6, 4 ], [ 6, 2 ], [ 10, 11 ], [ 11, 15 ], [ 11, 16 ], [ 12, 19 ], [ 13, 18 ], [ 14, 17 ], [ 15, 13 ], [ 16, 14 ], [ 16, 12 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Kim knows Tanya. Pearl knows Darcy. Helene knows Larissa. Larissa knows Rhea. Darcy knows Dorothy. Kim knows Ariana. Javier knows Lana. Dante knows Edna. Yasmin knows Jaime. Cristina knows Charity. Charity knows Dante. Dante knows Yasmin. Ramon knows Pearl. Lana knows Kim. Jermaine knows Javier. Ramon knows Cristina. Tanya knows Nancy. Jermaine knows Helene. Which of Jaime and Nancy can Jermaine reach?", "answer": "Nancy", "steps": [ "Jermaine knows Javier.", "Javier knows Lana.", "Lana knows Kim.", "Kim knows Tanya.", "Tanya knows Nancy." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Jermaine", "Ariana", "Larissa", "Tanya", "Javier", "Lana", "Nancy", "Helene", "Rhea", "Kim", "Ramon", "Edna", "Darcy", "Yasmin", "Cristina", "Charity", "Jaime", "Pearl", "Dorothy", "Dante" ], "edges": [ [ 0, 7 ], [ 0, 4 ], [ 2, 8 ], [ 3, 6 ], [ 4, 5 ], [ 5, 9 ], [ 7, 2 ], [ 9, 1 ], [ 9, 3 ], [ 10, 17 ], [ 10, 14 ], [ 12, 18 ], [ 13, 16 ], [ 14, 15 ], [ 15, 19 ], [ 17, 12 ], [ 19, 11 ], [ 19, 13 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Catherine knows Cameron. Gunnar knows Walt. Gunnar knows Fraser. Gunnar knows Wade. Beatrice knows Catherine. Brody knows Wesley. Ronald knows Brody. Clark knows Maria. Beatrice knows Dennis. Ronald knows Arthur. Lillian knows Tonya. Dennis knows Harley. Fraser knows Clarissa. Ronald knows Gunnar. Catherine knows Lillian. Beatrice knows Clark. Catherine knows Adrian. Arthur knows Todd. Which of Catherine and Gunnar can Ronald reach?", "answer": "Gunnar", "steps": [ "Ronald knows Gunnar." ], "difficulty": 1, "original_distance": 3, "idx_to_symbol": [ "Ronald", "Gunnar", "Clarissa", "Brody", "Wade", "Wesley", "Todd", "Arthur", "Fraser", "Walt", "Beatrice", "Catherine", "Tonya", "Clark", "Adrian", "Maria", "Harley", "Dennis", "Lillian", "Cameron" ], "edges": [ [ 0, 3 ], [ 0, 7 ], [ 0, 1 ], [ 1, 4 ], [ 1, 8 ], [ 1, 9 ], [ 3, 5 ], [ 7, 6 ], [ 8, 2 ], [ 10, 13 ], [ 10, 17 ], [ 10, 11 ], [ 11, 14 ], [ 11, 18 ], [ 11, 19 ], [ 13, 15 ], [ 17, 16 ], [ 18, 12 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Guy knows Emmett. Cooper knows Erik. Xander knows Ava. Cliff knows Devon. Fiona knows Arturo. Celia knows Edward. Edward knows Xander. Cliff knows Damien. Damien knows Israel. Devon knows Billy. Alyson knows Harry. Arturo knows Celia. Celia knows Alyson. Edward knows Samuel. Erik knows Guy. Guy knows Cliff. Emmett knows Mae. Samuel knows Kevin. Which of Arturo and Erik can Cooper reach?", "answer": "Erik", "steps": [ "Cooper knows Erik." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Cooper", "Guy", "Billy", "Erik", "Devon", "Cliff", "Damien", "Emmett", "Israel", "Mae", "Fiona", "Celia", "Ava", "Arturo", "Xander", "Edward", "Samuel", "Alyson", "Kevin", "Harry" ], "edges": [ [ 0, 3 ], [ 1, 5 ], [ 1, 7 ], [ 3, 1 ], [ 4, 2 ], [ 5, 4 ], [ 5, 6 ], [ 6, 8 ], [ 7, 9 ], [ 10, 13 ], [ 11, 15 ], [ 11, 17 ], [ 13, 11 ], [ 14, 12 ], [ 15, 14 ], [ 15, 16 ], [ 16, 18 ], [ 17, 19 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Gideon knows Alma. Yolanda knows Harmony. Tony knows Harlan. Yolanda knows Tony. Clarence knows Denise. Hampton knows Jessie. Kenzie knows Cain. Vance knows Yolanda. Vance knows Hampton. Gideon knows Inez. Inez knows Wanda. Harlan knows Basil. Clarence knows Kenzie. Denise knows Anna. Tony knows Olive. Gideon knows Elvis. Denise knows Gideon. Tony knows Dakota. Which of Tony and Gideon can Clarence reach?", "answer": "Gideon", "steps": [ "Clarence knows Denise.", "Denise knows Gideon." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Clarence", "Wanda", "Denise", "Elvis", "Inez", "Alma", "Kenzie", "Cain", "Anna", "Gideon", "Vance", "Basil", "Yolanda", "Olive", "Harlan", "Dakota", "Hampton", "Jessie", "Harmony", "Tony" ], "edges": [ [ 0, 6 ], [ 0, 2 ], [ 2, 8 ], [ 2, 9 ], [ 4, 1 ], [ 6, 7 ], [ 9, 3 ], [ 9, 4 ], [ 9, 5 ], [ 10, 16 ], [ 10, 12 ], [ 12, 18 ], [ 12, 19 ], [ 14, 11 ], [ 16, 17 ], [ 19, 13 ], [ 19, 14 ], [ 19, 15 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Ronald knows Colleen. Hubert knows Willis. Ronald knows Jim. Willis knows Alyssa. Wesley knows Elmer. Lamont knows Elsa. Colleen knows Hubert. Colleen knows Eduardo. Eli knows Gage. Harper knows Cole. Alvin knows Cruz. Lamont knows Alvin. Alyssa knows Wesley. Esme knows Ronald. Cruz knows Eli. Gage knows Harper. Alvin knows Cornelius. Madeline knows Lamont. Which of Cruz and Hubert can Madeline reach?", "answer": "Cruz", "steps": [ "Madeline knows Lamont.", "Lamont knows Alvin.", "Alvin knows Cruz." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Madeline", "Elsa", "Eli", "Cruz", "Harper", "Lamont", "Cornelius", "Alvin", "Gage", "Cole", "Esme", "Jim", "Willis", "Hubert", "Wesley", "Ronald", "Eduardo", "Colleen", "Alyssa", "Elmer" ], "edges": [ [ 0, 5 ], [ 2, 8 ], [ 3, 2 ], [ 4, 9 ], [ 5, 1 ], [ 5, 7 ], [ 7, 6 ], [ 7, 3 ], [ 8, 4 ], [ 10, 15 ], [ 12, 18 ], [ 13, 12 ], [ 14, 19 ], [ 15, 11 ], [ 15, 17 ], [ 17, 16 ], [ 17, 13 ], [ 18, 14 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Jolene knows Hunter. Rocco knows Dylan. Hunter knows Scott. Kate knows Molly. Jolene knows Kathleen. Lucille knows Erica. Lars knows Elodie. Lars knows Jolene. Victor knows Kate. Kate knows Charles. Charles knows Rocco. Elodie knows Hubert. Victor knows Lucille. Kathleen knows Graeme. Molly knows Fiona. Scott knows Karla. Graeme knows Jerry. Fiona knows Edwin. Which of Jolene and Kate can Victor reach?", "answer": "Kate", "steps": [ "Victor knows Kate." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Victor", "Fiona", "Edwin", "Lucille", "Kate", "Rocco", "Erica", "Charles", "Molly", "Dylan", "Lars", "Scott", "Karla", "Elodie", "Jolene", "Graeme", "Hubert", "Kathleen", "Hunter", "Jerry" ], "edges": [ [ 0, 3 ], [ 0, 4 ], [ 1, 2 ], [ 3, 6 ], [ 4, 8 ], [ 4, 7 ], [ 5, 9 ], [ 7, 5 ], [ 8, 1 ], [ 10, 13 ], [ 10, 14 ], [ 11, 12 ], [ 13, 16 ], [ 14, 18 ], [ 14, 17 ], [ 15, 19 ], [ 17, 15 ], [ 18, 11 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Rosa knows Ava. Bert knows Albert. Albert knows Felicia. Ira knows Priscilla. Gina knows Bert. Brooke knows Itzel. Felicia knows Lana. Aaron knows Tina. Ira knows Carla. Brooke knows Preston. Ira knows Brooke. Bert knows Dina. Albert knows Kenneth. Aaron knows Ira. Brooke knows Rosa. Bert knows Barney. Albert knows Janice. Gina knows Viola. Which of Lana and Ava can Aaron reach?", "answer": "Ava", "steps": [ "Aaron knows Ira.", "Ira knows Brooke.", "Brooke knows Rosa.", "Rosa knows Ava." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Aaron", "Ira", "Brooke", "Itzel", "Preston", "Ava", "Carla", "Priscilla", "Rosa", "Tina", "Gina", "Bert", "Albert", "Kenneth", "Janice", "Lana", "Dina", "Barney", "Felicia", "Viola" ], "edges": [ [ 0, 1 ], [ 0, 9 ], [ 1, 6 ], [ 1, 7 ], [ 1, 2 ], [ 2, 3 ], [ 2, 4 ], [ 2, 8 ], [ 8, 5 ], [ 10, 11 ], [ 10, 19 ], [ 11, 16 ], [ 11, 17 ], [ 11, 12 ], [ 12, 13 ], [ 12, 14 ], [ 12, 18 ], [ 18, 15 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Jolene knows Hunter. Rocco knows Dylan. Hunter knows Scott. Kate knows Molly. Jolene knows Kathleen. Lucille knows Erica. Lars knows Elodie. Lars knows Jolene. Victor knows Kate. Kate knows Charles. Charles knows Rocco. Elodie knows Hubert. Victor knows Lucille. Kathleen knows Graeme. Molly knows Fiona. Scott knows Karla. Graeme knows Jerry. Fiona knows Edwin. Which of Charles and Kathleen can Victor reach?", "answer": "Charles", "steps": [ "Victor knows Kate.", "Kate knows Charles." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Victor", "Fiona", "Edwin", "Lucille", "Kate", "Rocco", "Erica", "Charles", "Molly", "Dylan", "Lars", "Scott", "Karla", "Elodie", "Jolene", "Graeme", "Hubert", "Kathleen", "Hunter", "Jerry" ], "edges": [ [ 0, 3 ], [ 0, 4 ], [ 1, 2 ], [ 3, 6 ], [ 4, 8 ], [ 4, 7 ], [ 5, 9 ], [ 7, 5 ], [ 8, 1 ], [ 10, 13 ], [ 10, 14 ], [ 11, 12 ], [ 13, 16 ], [ 14, 18 ], [ 14, 17 ], [ 15, 19 ], [ 17, 15 ], [ 18, 11 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Clement knows Isla. Zane knows Pat. Kira knows Lillian. Cassidy knows Edna. Cassidy knows Phoebe. Ebony knows Clement. Isaac knows Gemma. Brittany knows Kira. Gemma knows Ebony. Pat knows Cassidy. Isla knows Kirsten. Kirsten knows Carter. Kira knows Kenneth. Kirsten knows Max. Gemma knows Mark. Phoebe knows Brittany. Ebony knows Gerald. Pat knows Kylie. Which of Clement and Phoebe can Isaac reach?", "answer": "Clement", "steps": [ "Isaac knows Gemma.", "Gemma knows Ebony.", "Ebony knows Clement." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Isaac", "Kirsten", "Ebony", "Max", "Mark", "Gemma", "Isla", "Gerald", "Clement", "Carter", "Zane", "Kira", "Cassidy", "Kenneth", "Kylie", "Pat", "Brittany", "Edna", "Phoebe", "Lillian" ], "edges": [ [ 0, 5 ], [ 1, 3 ], [ 1, 9 ], [ 2, 7 ], [ 2, 8 ], [ 5, 4 ], [ 5, 2 ], [ 6, 1 ], [ 8, 6 ], [ 10, 15 ], [ 11, 13 ], [ 11, 19 ], [ 12, 17 ], [ 12, 18 ], [ 15, 14 ], [ 15, 12 ], [ 16, 11 ], [ 18, 16 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Emma knows Diana. Arthur knows Kieran. Leo knows Boyd. Kieran knows Harlan. Diana knows Hadley. Alfred knows Stefan. Keaton knows Olive. Keaton knows Dick. Harlan knows Charles. Gage knows Kyle. Aria knows Marilyn. Gage knows Aria. Keaton knows Arthur. Megan knows Emma. Kyle knows Alfred. Dick knows Leo. Gage knows Megan. Olive knows Annette. Which of Kieran and Emma can Keaton reach?", "answer": "Kieran", "steps": [ "Keaton knows Arthur.", "Arthur knows Kieran." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Keaton", "Arthur", "Harlan", "Boyd", "Charles", "Dick", "Annette", "Kieran", "Olive", "Leo", "Gage", "Megan", "Diana", "Stefan", "Hadley", "Kyle", "Marilyn", "Emma", "Aria", "Alfred" ], "edges": [ [ 0, 1 ], [ 0, 8 ], [ 0, 5 ], [ 1, 7 ], [ 2, 4 ], [ 5, 9 ], [ 7, 2 ], [ 8, 6 ], [ 9, 3 ], [ 10, 11 ], [ 10, 18 ], [ 10, 15 ], [ 11, 17 ], [ 12, 14 ], [ 15, 19 ], [ 17, 12 ], [ 18, 16 ], [ 19, 13 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Willis knows Kay. Virginia knows Elliot. Isaac knows Alex. Houston knows Marvin. Carson knows Houston. Alex knows Willis. Constance knows Axel. Kay knows Malcolm. Constance knows Teresa. Willis knows Clara. Marvin knows Electra. Axel knows Isaac. Marvin knows Virginia. Mitchell knows Curtis. Virginia knows Leticia. Mitchell knows Mae. Kay knows Eve. Curtis knows Carson. Which of Virginia and Kay can Constance reach?", "answer": "Kay", "steps": [ "Constance knows Axel.", "Axel knows Isaac.", "Isaac knows Alex.", "Alex knows Willis.", "Willis knows Kay." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Constance", "Clara", "Kay", "Isaac", "Teresa", "Axel", "Alex", "Eve", "Malcolm", "Willis", "Mitchell", "Electra", "Virginia", "Carson", "Mae", "Curtis", "Houston", "Elliot", "Leticia", "Marvin" ], "edges": [ [ 0, 4 ], [ 0, 5 ], [ 2, 7 ], [ 2, 8 ], [ 3, 6 ], [ 5, 3 ], [ 6, 9 ], [ 9, 1 ], [ 9, 2 ], [ 10, 14 ], [ 10, 15 ], [ 12, 17 ], [ 12, 18 ], [ 13, 16 ], [ 15, 13 ], [ 16, 19 ], [ 19, 11 ], [ 19, 12 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Whitney knows Giselle. Preston knows Bonnie. Laura knows Jakob. Whitney knows Rick. Zara knows Benjamin. William knows Kirsten. Hilda knows Whitney. Benjamin knows Dixie. Bailey knows Hilda. Laura knows Erica. William knows Maureen. Griffith knows Zara. Laura knows Lorenzo. Zara knows Laura. Hilda knows William. Jakob knows Alice. Benjamin knows Elizabeth. Whitney knows Preston. Which of Laura and Whitney can Bailey reach?", "answer": "Whitney", "steps": [ "Bailey knows Hilda.", "Hilda knows Whitney." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Bailey", "William", "Maureen", "Whitney", "Kirsten", "Bonnie", "Giselle", "Rick", "Hilda", "Preston", "Griffith", "Benjamin", "Elizabeth", "Laura", "Dixie", "Alice", "Lorenzo", "Erica", "Zara", "Jakob" ], "edges": [ [ 0, 8 ], [ 1, 2 ], [ 1, 4 ], [ 3, 6 ], [ 3, 7 ], [ 3, 9 ], [ 8, 1 ], [ 8, 3 ], [ 9, 5 ], [ 10, 18 ], [ 11, 12 ], [ 11, 14 ], [ 13, 16 ], [ 13, 17 ], [ 13, 19 ], [ 18, 11 ], [ 18, 13 ], [ 19, 15 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Elena knows Jessica. Rosa knows Jeanne. Lawrence knows Celia. Maude knows Elena. Angela knows Maude. Faye knows Florence. Ebony knows Faye. Celia knows Brooke. Angela knows Rosa. Travis knows Robin. Brooke knows Aaron. Florence knows Chad. Jenny knows August. Jeanne knows Travis. Kevin knows Angela. Leroy knows Kevin. August knows Lawrence. Lawrence knows Ebony. Which of Jeanne and Faye can Jenny reach?", "answer": "Faye", "steps": [ "Jenny knows August.", "August knows Lawrence.", "Lawrence knows Ebony.", "Ebony knows Faye." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Jenny", "Florence", "Lawrence", "Brooke", "Faye", "Ebony", "Chad", "Celia", "Aaron", "August", "Leroy", "Travis", "Angela", "Elena", "Jeanne", "Rosa", "Robin", "Maude", "Jessica", "Kevin" ], "edges": [ [ 0, 9 ], [ 1, 6 ], [ 2, 5 ], [ 2, 7 ], [ 3, 8 ], [ 4, 1 ], [ 5, 4 ], [ 7, 3 ], [ 9, 2 ], [ 10, 19 ], [ 11, 16 ], [ 12, 15 ], [ 12, 17 ], [ 13, 18 ], [ 14, 11 ], [ 15, 14 ], [ 17, 13 ], [ 19, 12 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Delia knows Dylan. Megan knows Denise. Sharon knows Nadine. Nadine knows Myrtle. Denise knows Herbert. Sharon knows Edward. Edward knows Cesar. Matt knows Alyssa. Denise knows Matt. Edward knows Carter. Dylan knows Hope. Flora knows Darius. Megan knows Delia. Myrtle knows Zack. Alyssa knows Hayley. Cesar knows Flora. Lois knows Megan. Parker knows Sharon. Which of Matt and Cesar can Parker reach?", "answer": "Cesar", "steps": [ "Parker knows Sharon.", "Sharon knows Edward.", "Edward knows Cesar." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Parker", "Sharon", "Carter", "Edward", "Darius", "Cesar", "Nadine", "Flora", "Zack", "Myrtle", "Lois", "Megan", "Herbert", "Denise", "Hayley", "Matt", "Delia", "Alyssa", "Hope", "Dylan" ], "edges": [ [ 0, 1 ], [ 1, 3 ], [ 1, 6 ], [ 3, 2 ], [ 3, 5 ], [ 5, 7 ], [ 6, 9 ], [ 7, 4 ], [ 9, 8 ], [ 10, 11 ], [ 11, 13 ], [ 11, 16 ], [ 13, 12 ], [ 13, 15 ], [ 15, 17 ], [ 16, 19 ], [ 17, 14 ], [ 19, 18 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "April knows Rick. Gemma knows Fred. Fred knows Agnes. Vernon knows Cassidy. Val knows Lamont. Vernon knows Crystal. Val knows Nicole. Barry knows Eva. Gemma knows Verna. Agnes knows Val. Thomas knows Barry. Barry knows Vernon. April knows Sydney. Gemma knows Victor. Lyric knows Gemma. Fred knows Gustavo. Barry knows Lorna. Crystal knows April. Which of Gemma and Barry can Thomas reach?", "answer": "Barry", "steps": [ "Thomas knows Barry." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Thomas", "Eva", "Rick", "Sydney", "April", "Lorna", "Barry", "Crystal", "Cassidy", "Vernon", "Lyric", "Verna", "Nicole", "Lamont", "Val", "Victor", "Gemma", "Agnes", "Gustavo", "Fred" ], "edges": [ [ 0, 6 ], [ 4, 2 ], [ 4, 3 ], [ 6, 1 ], [ 6, 5 ], [ 6, 9 ], [ 7, 4 ], [ 9, 7 ], [ 9, 8 ], [ 10, 16 ], [ 14, 12 ], [ 14, 13 ], [ 16, 11 ], [ 16, 15 ], [ 16, 19 ], [ 17, 14 ], [ 19, 17 ], [ 19, 18 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Priscilla knows Julius. Brooks knows Ted. Daisy knows Haven. Viola knows Guy. Davis knows Reed. Guy knows Jamie. Bruce knows Lacey. Grant knows Grace. Julia knows Ibrahim. Lara knows Julia. Viola knows Dakota. Grace knows Daisy. Brooks knows Priscilla. Ted knows Cecilia. Priscilla knows Davis. Ibrahim knows Brooks. Lacey knows Grant. Grace knows Viola. Which of Jamie and Reed can Lara reach?", "answer": "Reed", "steps": [ "Lara knows Julia.", "Julia knows Ibrahim.", "Ibrahim knows Brooks.", "Brooks knows Priscilla.", "Priscilla knows Davis.", "Davis knows Reed." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Lara", "Ted", "Julia", "Brooks", "Reed", "Priscilla", "Julius", "Cecilia", "Ibrahim", "Davis", "Bruce", "Daisy", "Lacey", "Grace", "Jamie", "Viola", "Dakota", "Haven", "Grant", "Guy" ], "edges": [ [ 0, 2 ], [ 1, 7 ], [ 2, 8 ], [ 3, 1 ], [ 3, 5 ], [ 5, 6 ], [ 5, 9 ], [ 8, 3 ], [ 9, 4 ], [ 10, 12 ], [ 11, 17 ], [ 12, 18 ], [ 13, 11 ], [ 13, 15 ], [ 15, 16 ], [ 15, 19 ], [ 18, 13 ], [ 19, 14 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Justine knows Cristina. Morgan knows Rita. Claude knows Carter. Zachary knows Agnes. Brenda knows Zachary. Zachary knows Lacey. Farrah knows Rowan. Cristina knows Robin. Agnes knows Earl. Justine knows Sebastian. Gail knows Farrah. Charles knows Edwin. Farrah knows Charles. Lacey knows Aldo. Rowan knows Pierce. Brenda knows Justine. Gail knows Morgan. Morgan knows Claude. Which of Pierce and Earl can Brenda reach?", "answer": "Earl", "steps": [ "Brenda knows Zachary.", "Zachary knows Agnes.", "Agnes knows Earl." ], "difficulty": 3, "original_distance": 3, "idx_to_symbol": [ "Brenda", "Earl", "Robin", "Justine", "Aldo", "Zachary", "Agnes", "Sebastian", "Cristina", "Lacey", "Gail", "Pierce", "Carter", "Morgan", "Edwin", "Farrah", "Rowan", "Rita", "Claude", "Charles" ], "edges": [ [ 0, 3 ], [ 0, 5 ], [ 3, 7 ], [ 3, 8 ], [ 5, 6 ], [ 5, 9 ], [ 6, 1 ], [ 8, 2 ], [ 9, 4 ], [ 10, 13 ], [ 10, 15 ], [ 13, 17 ], [ 13, 18 ], [ 15, 16 ], [ 15, 19 ], [ 16, 11 ], [ 18, 12 ], [ 19, 14 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Priscilla knows Julius. Brooks knows Ted. Daisy knows Haven. Viola knows Guy. Davis knows Reed. Guy knows Jamie. Bruce knows Lacey. Grant knows Grace. Julia knows Ibrahim. Lara knows Julia. Viola knows Dakota. Grace knows Daisy. Brooks knows Priscilla. Ted knows Cecilia. Priscilla knows Davis. Ibrahim knows Brooks. Lacey knows Grant. Grace knows Viola. Which of Viola and Priscilla can Lara reach?", "answer": "Priscilla", "steps": [ "Lara knows Julia.", "Julia knows Ibrahim.", "Ibrahim knows Brooks.", "Brooks knows Priscilla." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Lara", "Ted", "Julia", "Brooks", "Reed", "Priscilla", "Julius", "Cecilia", "Ibrahim", "Davis", "Bruce", "Daisy", "Lacey", "Grace", "Jamie", "Viola", "Dakota", "Haven", "Grant", "Guy" ], "edges": [ [ 0, 2 ], [ 1, 7 ], [ 2, 8 ], [ 3, 1 ], [ 3, 5 ], [ 5, 6 ], [ 5, 9 ], [ 8, 3 ], [ 9, 4 ], [ 10, 12 ], [ 11, 17 ], [ 12, 18 ], [ 13, 11 ], [ 13, 15 ], [ 15, 16 ], [ 15, 19 ], [ 18, 13 ], [ 19, 14 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Palmer knows Victoria. Clyde knows George. Vincent knows Teresa. Roy knows Hugh. Palmer knows Ethan. Jeffery knows Nadine. Peggy knows Finn. Brooks knows Jenny. Jack knows Jeffery. Roy knows Palmer. Jeffery knows Jesse. Jack knows Neville. Jack knows Alex. Roy knows Mike. Teresa knows Roy. Jenny knows Peggy. George knows Vincent. Finn knows Jack. Which of Jeffery and Palmer can Clyde reach?", "answer": "Palmer", "steps": [ "Clyde knows George.", "George knows Vincent.", "Vincent knows Teresa.", "Teresa knows Roy.", "Roy knows Palmer." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Clyde", "Palmer", "Ethan", "Hugh", "Teresa", "George", "Vincent", "Victoria", "Roy", "Mike", "Brooks", "Jeffery", "Nadine", "Neville", "Finn", "Jenny", "Peggy", "Jesse", "Jack", "Alex" ], "edges": [ [ 0, 5 ], [ 1, 2 ], [ 1, 7 ], [ 4, 8 ], [ 5, 6 ], [ 6, 4 ], [ 8, 3 ], [ 8, 1 ], [ 8, 9 ], [ 10, 15 ], [ 11, 12 ], [ 11, 17 ], [ 14, 18 ], [ 15, 16 ], [ 16, 14 ], [ 18, 13 ], [ 18, 11 ], [ 18, 19 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Hayden knows Louisa. Louisa knows Kelsey. Milton knows Bart. Peter knows Seth. Layla knows Keaton. Lottie knows Kerry. Amber knows Milton. Jesse knows Sally. Layla knows Joshua. Esperanza knows Darla. Lottie knows Robin. Sally knows Estella. Luella knows Jesse. Darla knows Layla. Seth knows Esperanza. Bart knows Lottie. Estella knows Amber. Kelsey knows Peter. Which of Esperanza and Milton can Hayden reach?", "answer": "Esperanza", "steps": [ "Hayden knows Louisa.", "Louisa knows Kelsey.", "Kelsey knows Peter.", "Peter knows Seth.", "Seth knows Esperanza." ], "difficulty": 5, "original_distance": 8, "idx_to_symbol": [ "Hayden", "Esperanza", "Louisa", "Peter", "Kelsey", "Joshua", "Keaton", "Darla", "Layla", "Seth", "Luella", "Milton", "Jesse", "Estella", "Sally", "Robin", "Kerry", "Bart", "Lottie", "Amber" ], "edges": [ [ 0, 2 ], [ 1, 7 ], [ 2, 4 ], [ 3, 9 ], [ 4, 3 ], [ 7, 8 ], [ 8, 5 ], [ 8, 6 ], [ 9, 1 ], [ 10, 12 ], [ 11, 17 ], [ 12, 14 ], [ 13, 19 ], [ 14, 13 ], [ 17, 18 ], [ 18, 15 ], [ 18, 16 ], [ 19, 11 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Samuel knows Walt. Dolly knows Sidney. Wilma knows Drake. Samuel knows Quinn. Drake knows Earl. Milton knows Dolly. Earl knows Milton. Samuel knows Albert. Eleanor knows Joyce. Samuel knows Eleanor. George knows Della. Earl knows Elias. Earl knows George. Arden knows Samuel. Joyce knows Jem. Earl knows Eli. Quinn knows Jaime. Stacy knows Arden. Which of Eleanor and Milton can Wilma reach?", "answer": "Milton", "steps": [ "Wilma knows Drake.", "Drake knows Earl.", "Earl knows Milton." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Wilma", "Della", "Dolly", "George", "Milton", "Earl", "Elias", "Drake", "Eli", "Sidney", "Stacy", "Jaime", "Joyce", "Quinn", "Eleanor", "Samuel", "Albert", "Arden", "Walt", "Jem" ], "edges": [ [ 0, 7 ], [ 2, 9 ], [ 3, 1 ], [ 4, 2 ], [ 5, 3 ], [ 5, 6 ], [ 5, 8 ], [ 5, 4 ], [ 7, 5 ], [ 10, 17 ], [ 12, 19 ], [ 13, 11 ], [ 14, 12 ], [ 15, 13 ], [ 15, 16 ], [ 15, 18 ], [ 15, 14 ], [ 17, 15 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Tony knows Kamila. Kamila knows Lamar. Brynn knows Zach. Ralph knows Edison. Sybil knows Joanna. Olive knows Tony. Kamila knows Wayne. Zach knows Cliff. Dalton knows Carrie. Edison knows Mae. Zach knows Dalton. Pam knows Gloria. Mae knows Brynn. Arlene knows Olive. Jason knows Pam. Lamar knows Jason. Fabian knows Arlene. Carrie knows Sybil. Which of Jason and Carrie can Ralph reach?", "answer": "Carrie", "steps": [ "Ralph knows Edison.", "Edison knows Mae.", "Mae knows Brynn.", "Brynn knows Zach.", "Zach knows Dalton.", "Dalton knows Carrie." ], "difficulty": 6, "original_distance": 8, "idx_to_symbol": [ "Ralph", "Joanna", "Zach", "Cliff", "Sybil", "Mae", "Carrie", "Dalton", "Brynn", "Edison", "Fabian", "Gloria", "Kamila", "Wayne", "Pam", "Olive", "Jason", "Lamar", "Tony", "Arlene" ], "edges": [ [ 0, 9 ], [ 2, 3 ], [ 2, 7 ], [ 4, 1 ], [ 5, 8 ], [ 6, 4 ], [ 7, 6 ], [ 8, 2 ], [ 9, 5 ], [ 10, 19 ], [ 12, 13 ], [ 12, 17 ], [ 14, 11 ], [ 15, 18 ], [ 16, 14 ], [ 17, 16 ], [ 18, 12 ], [ 19, 15 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Maggie knows Darrell. Willis knows India. Clara knows Joseph. Cassidy knows Clara. India knows Cassidy. Joseph knows Juan. Megan knows Mabel. Mabel knows Carrie. Megan knows Marshall. Joseph knows Alvin. Theodore knows Megan. Theodore knows Jules. Clarissa knows Theodore. Mabel knows Leroy. Cassidy knows Charlene. Clara knows Maggie. Marshall knows Dirk. Riley knows Clarissa. Which of Dirk and Darrell can Riley reach?", "answer": "Dirk", "steps": [ "Riley knows Clarissa.", "Clarissa knows Theodore.", "Theodore knows Megan.", "Megan knows Marshall.", "Marshall knows Dirk." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Riley", "Marshall", "Mabel", "Dirk", "Clarissa", "Leroy", "Jules", "Megan", "Carrie", "Theodore", "Willis", "Maggie", "Joseph", "Darrell", "India", "Juan", "Charlene", "Clara", "Alvin", "Cassidy" ], "edges": [ [ 0, 4 ], [ 1, 3 ], [ 2, 5 ], [ 2, 8 ], [ 4, 9 ], [ 7, 1 ], [ 7, 2 ], [ 9, 6 ], [ 9, 7 ], [ 10, 14 ], [ 11, 13 ], [ 12, 15 ], [ 12, 18 ], [ 14, 19 ], [ 17, 11 ], [ 17, 12 ], [ 19, 16 ], [ 19, 17 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Aaron knows Robert. Keira knows Bonnie. Doug knows Kim. Aubrey knows Roy. Aaron knows Doug. Hector knows Blake. Robert knows Keith. Lydia knows George. Evan knows Aaron. Roy knows Hector. Blake knows Keira. Doug knows Kirk. Chance knows Evan. Blake knows Luz. Kim knows Russ. Luz knows Percy. Joyce knows Chance. Luz knows Lydia. Which of Kim and Lydia can Joyce reach?", "answer": "Kim", "steps": [ "Joyce knows Chance.", "Chance knows Evan.", "Evan knows Aaron.", "Aaron knows Doug.", "Doug knows Kim." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Joyce", "Keith", "Kirk", "Robert", "Doug", "Russ", "Aaron", "Chance", "Evan", "Kim", "Aubrey", "Bonnie", "Percy", "Keira", "Luz", "George", "Blake", "Roy", "Hector", "Lydia" ], "edges": [ [ 0, 7 ], [ 3, 1 ], [ 4, 2 ], [ 4, 9 ], [ 6, 3 ], [ 6, 4 ], [ 7, 8 ], [ 8, 6 ], [ 9, 5 ], [ 10, 17 ], [ 13, 11 ], [ 14, 12 ], [ 14, 19 ], [ 16, 13 ], [ 16, 14 ], [ 17, 18 ], [ 18, 16 ], [ 19, 15 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Jarvis knows Clay. Will knows Kendrick. Philip knows Dirk. June knows Brooks. Marshall knows Loretta. Tony knows Lyle. Milton knows Jarvis. Kendrick knows Marshall. Marco knows Will. Israel knows Marco. Kendrick knows Gene. Milton knows Seth. Will knows Lola. Laverne knows Jorge. June knows Milton. Clay knows Laverne. Dirk knows June. Loretta knows Tony. Which of Clay and Loretta can Israel reach?", "answer": "Loretta", "steps": [ "Israel knows Marco.", "Marco knows Will.", "Will knows Kendrick.", "Kendrick knows Marshall.", "Marshall knows Loretta." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Israel", "Lyle", "Will", "Gene", "Tony", "Kendrick", "Marshall", "Marco", "Lola", "Loretta", "Philip", "Jorge", "June", "Seth", "Laverne", "Milton", "Jarvis", "Dirk", "Brooks", "Clay" ], "edges": [ [ 0, 7 ], [ 2, 8 ], [ 2, 5 ], [ 4, 1 ], [ 5, 3 ], [ 5, 6 ], [ 6, 9 ], [ 7, 2 ], [ 9, 4 ], [ 10, 17 ], [ 12, 18 ], [ 12, 15 ], [ 14, 11 ], [ 15, 13 ], [ 15, 16 ], [ 16, 19 ], [ 17, 12 ], [ 19, 14 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Myrtle knows Elijah. Jacob knows Alfred. Alfred knows Forrest. Alfred knows Anna. Elijah knows Mara. Logan knows Jacob. Yvonne knows Heather. Jennifer knows Hugh. Heather knows Clement. Mara knows Erik. Forrest knows Abel. Walt knows Sheila. Clement knows Callum. Callum knows Jocelyn. Clement knows Hadley. Jocelyn knows Jennifer. Hugh knows Walt. Abel knows Myrtle. Which of Walt and Mara can Yvonne reach?", "answer": "Walt", "steps": [ "Yvonne knows Heather.", "Heather knows Clement.", "Clement knows Callum.", "Callum knows Jocelyn.", "Jocelyn knows Jennifer.", "Jennifer knows Hugh.", "Hugh knows Walt." ], "difficulty": 7, "original_distance": 8, "idx_to_symbol": [ "Yvonne", "Jennifer", "Hadley", "Sheila", "Clement", "Callum", "Hugh", "Jocelyn", "Heather", "Walt", "Logan", "Myrtle", "Anna", "Erik", "Alfred", "Forrest", "Elijah", "Abel", "Jacob", "Mara" ], "edges": [ [ 0, 8 ], [ 1, 6 ], [ 4, 2 ], [ 4, 5 ], [ 5, 7 ], [ 6, 9 ], [ 7, 1 ], [ 8, 4 ], [ 9, 3 ], [ 10, 18 ], [ 11, 16 ], [ 14, 12 ], [ 14, 15 ], [ 15, 17 ], [ 16, 19 ], [ 17, 11 ], [ 18, 14 ], [ 19, 13 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Carrie knows Knox. John knows Bailey. Kane knows Sarah. Gerard knows Vera. Heath knows John. Marion knows Noel. Kane knows Carrie. Bailey knows Kane. John knows Aiden. Bailey knows Blanche. Gerard knows Ira. Ira knows Mary. Noel knows Esme. Esme knows Gerard. Noel knows Lark. Aiden knows Taylor. Lark knows Elise. Esme knows Heather. Which of Knox and Mary can Heath reach?", "answer": "Knox", "steps": [ "Heath knows John.", "John knows Bailey.", "Bailey knows Kane.", "Kane knows Carrie.", "Carrie knows Knox." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Heath", "Blanche", "Carrie", "John", "Aiden", "Knox", "Bailey", "Sarah", "Kane", "Taylor", "Marion", "Heather", "Ira", "Noel", "Lark", "Mary", "Esme", "Vera", "Gerard", "Elise" ], "edges": [ [ 0, 3 ], [ 2, 5 ], [ 3, 6 ], [ 3, 4 ], [ 4, 9 ], [ 6, 1 ], [ 6, 8 ], [ 8, 2 ], [ 8, 7 ], [ 10, 13 ], [ 12, 15 ], [ 13, 16 ], [ 13, 14 ], [ 14, 19 ], [ 16, 11 ], [ 16, 18 ], [ 18, 12 ], [ 18, 17 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Norma knows Virgil. Nash knows Brandon. Iris knows Clayton. Maggie knows Pablo. Sandy knows Maggie. Jameson knows Flora. Leah knows Julio. Ezra knows Jameson. Iris knows Ezra. Clayton knows Karl. Justine knows Norma. Nash knows Leah. Justine knows Grace. Maggie knows Nash. Norma knows Iris. Julio knows Jessica. Sandy knows Colin. Brandon knows Reed. Which of Jessica and Flora can Justine reach?", "answer": "Flora", "steps": [ "Justine knows Norma.", "Norma knows Iris.", "Iris knows Ezra.", "Ezra knows Jameson.", "Jameson knows Flora." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Justine", "Norma", "Ezra", "Karl", "Clayton", "Grace", "Jameson", "Flora", "Iris", "Virgil", "Sandy", "Maggie", "Leah", "Reed", "Brandon", "Colin", "Julio", "Jessica", "Nash", "Pablo" ], "edges": [ [ 0, 5 ], [ 0, 1 ], [ 1, 8 ], [ 1, 9 ], [ 2, 6 ], [ 4, 3 ], [ 6, 7 ], [ 8, 4 ], [ 8, 2 ], [ 10, 15 ], [ 10, 11 ], [ 11, 18 ], [ 11, 19 ], [ 12, 16 ], [ 14, 13 ], [ 16, 17 ], [ 18, 14 ], [ 18, 12 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Opal knows Victor. Norman knows Nash. Opal knows Clark. Linda knows India. Tristan knows Fern. India knows Janelle. Davis knows Shelby. Harriet knows Cruz. India knows Lee. Fern knows Sybil. Janelle knows Ricardo. Davis knows Harriet. Shaun knows Linda. Shaun knows Conner. Davis knows Tristan. Shaun knows Norman. Fern knows Opal. Janelle knows Miriam. Which of Tristan and Linda can Shaun reach?", "answer": "Linda", "steps": [ "Shaun knows Linda." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Shaun", "Ricardo", "Miriam", "India", "Nash", "Lee", "Linda", "Conner", "Janelle", "Norman", "Davis", "Clark", "Victor", "Fern", "Cruz", "Sybil", "Tristan", "Shelby", "Opal", "Harriet" ], "edges": [ [ 0, 7 ], [ 0, 6 ], [ 0, 9 ], [ 3, 5 ], [ 3, 8 ], [ 6, 3 ], [ 8, 1 ], [ 8, 2 ], [ 9, 4 ], [ 10, 17 ], [ 10, 16 ], [ 10, 19 ], [ 13, 15 ], [ 13, 18 ], [ 16, 13 ], [ 18, 11 ], [ 18, 12 ], [ 19, 14 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Greta knows Derrick. Fleur knows Jana. Alan knows Leah. Leah knows Beau. Lucia knows Greta. Clayton knows Lucia. Alan knows Irma. Rebecca knows Celeste. Tina knows Yvonne. Greta knows Tina. Celeste knows Hayden. Yvonne knows Bella. Tina knows Emily. Hayden knows Alan. Derrick knows Lambert. Irma knows Mae. Irma knows Fleur. Teresa knows Clayton. Which of Celeste and Clayton can Teresa reach?", "answer": "Clayton", "steps": [ "Teresa knows Clayton." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Teresa", "Lucia", "Clayton", "Derrick", "Tina", "Bella", "Greta", "Emily", "Lambert", "Yvonne", "Rebecca", "Hayden", "Celeste", "Leah", "Irma", "Jana", "Alan", "Mae", "Beau", "Fleur" ], "edges": [ [ 0, 2 ], [ 1, 6 ], [ 2, 1 ], [ 3, 8 ], [ 4, 7 ], [ 4, 9 ], [ 6, 3 ], [ 6, 4 ], [ 9, 5 ], [ 10, 12 ], [ 11, 16 ], [ 12, 11 ], [ 13, 18 ], [ 14, 17 ], [ 14, 19 ], [ 16, 13 ], [ 16, 14 ], [ 19, 15 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Mary knows Callum. Joanna knows Eve. Lane knows Anastasia. Lennox knows Gladys. Burt knows Karen. Cordelia knows Lennox. Anastasia knows Burt. Callum knows Hamilton. Joanna knows Antonio. Lennox knows Cristina. Anastasia knows Jeremiah. Karen knows Leander. Annie knows Lisa. Annie knows Guillermo. Karen knows Jewel. Callum knows Cordelia. Cristina knows Joanna. Leander knows Annie. Which of Joanna and Annie can Mary reach?", "answer": "Joanna", "steps": [ "Mary knows Callum.", "Callum knows Cordelia.", "Cordelia knows Lennox.", "Lennox knows Cristina.", "Cristina knows Joanna." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Mary", "Lennox", "Antonio", "Eve", "Cristina", "Hamilton", "Joanna", "Gladys", "Cordelia", "Callum", "Lane", "Karen", "Lisa", "Guillermo", "Leander", "Jeremiah", "Annie", "Jewel", "Burt", "Anastasia" ], "edges": [ [ 0, 9 ], [ 1, 4 ], [ 1, 7 ], [ 4, 6 ], [ 6, 2 ], [ 6, 3 ], [ 8, 1 ], [ 9, 5 ], [ 9, 8 ], [ 10, 19 ], [ 11, 14 ], [ 11, 17 ], [ 14, 16 ], [ 16, 12 ], [ 16, 13 ], [ 18, 11 ], [ 19, 15 ], [ 19, 18 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Burt knows Beth. Langston knows Jamie. Ford knows Kelly. Enrique knows Langston. Langston knows Whitney. Jamie knows Anita. Eunice knows Robin. Langston knows Dakota. Enrique knows Adelaide. Anita knows Burt. Kelly knows Eunice. Jamie knows Belinda. Eunice knows Ilene. Ilene knows Sue. Ford knows Bob. Sue knows Harold. Kelly knows Jem. Kelly knows Nora. Which of Jamie and Eunice can Ford reach?", "answer": "Eunice", "steps": [ "Ford knows Kelly.", "Kelly knows Eunice." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Ford", "Harold", "Eunice", "Nora", "Jem", "Kelly", "Bob", "Ilene", "Robin", "Sue", "Enrique", "Beth", "Jamie", "Whitney", "Dakota", "Langston", "Adelaide", "Anita", "Belinda", "Burt" ], "edges": [ [ 0, 6 ], [ 0, 5 ], [ 2, 8 ], [ 2, 7 ], [ 5, 3 ], [ 5, 4 ], [ 5, 2 ], [ 7, 9 ], [ 9, 1 ], [ 10, 16 ], [ 10, 15 ], [ 12, 18 ], [ 12, 17 ], [ 15, 13 ], [ 15, 14 ], [ 15, 12 ], [ 17, 19 ], [ 19, 11 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Ernest knows Delilah. Ernest knows Abel. Eunice knows Frances. Sara knows Larry. Reid knows Oscar. Reid knows Loretta. Reid knows Edward. Parker knows Reid. Ernest knows Lawson. Lola knows Parker. Ernest knows Adrian. Graeme knows Gage. Frances knows Laura. Loretta knows William. Lawson knows Sara. Gage knows Ernest. Reid knows Eunice. Abel knows Tara. Which of Ernest and Reid can Lola reach?", "answer": "Reid", "steps": [ "Lola knows Parker.", "Parker knows Reid." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Lola", "Frances", "Reid", "Laura", "Loretta", "Parker", "Eunice", "Edward", "William", "Oscar", "Graeme", "Sara", "Ernest", "Larry", "Abel", "Gage", "Lawson", "Adrian", "Tara", "Delilah" ], "edges": [ [ 0, 5 ], [ 1, 3 ], [ 2, 6 ], [ 2, 7 ], [ 2, 4 ], [ 2, 9 ], [ 4, 8 ], [ 5, 2 ], [ 6, 1 ], [ 10, 15 ], [ 11, 13 ], [ 12, 16 ], [ 12, 17 ], [ 12, 14 ], [ 12, 19 ], [ 14, 18 ], [ 15, 12 ], [ 16, 11 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Delia knows Dylan. Megan knows Denise. Sharon knows Nadine. Nadine knows Myrtle. Denise knows Herbert. Sharon knows Edward. Edward knows Cesar. Matt knows Alyssa. Denise knows Matt. Edward knows Carter. Dylan knows Hope. Flora knows Darius. Megan knows Delia. Myrtle knows Zack. Alyssa knows Hayley. Cesar knows Flora. Lois knows Megan. Parker knows Sharon. Which of Darius and Hayley can Parker reach?", "answer": "Darius", "steps": [ "Parker knows Sharon.", "Sharon knows Edward.", "Edward knows Cesar.", "Cesar knows Flora.", "Flora knows Darius." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Parker", "Sharon", "Carter", "Edward", "Darius", "Cesar", "Nadine", "Flora", "Zack", "Myrtle", "Lois", "Megan", "Herbert", "Denise", "Hayley", "Matt", "Delia", "Alyssa", "Hope", "Dylan" ], "edges": [ [ 0, 1 ], [ 1, 3 ], [ 1, 6 ], [ 3, 2 ], [ 3, 5 ], [ 5, 7 ], [ 6, 9 ], [ 7, 4 ], [ 9, 8 ], [ 10, 11 ], [ 11, 13 ], [ 11, 16 ], [ 13, 12 ], [ 13, 15 ], [ 15, 17 ], [ 16, 19 ], [ 17, 14 ], [ 19, 18 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Maude knows Elmer. Brittany knows Zara. Bonnie knows Julian. Zara knows Bonnie. Lena knows Brittany. Larissa knows Fred. Louisa knows Dolores. Bonnie knows Jerome. Louisa knows Sam. Julian knows Elias. Larissa knows Barney. Barney knows Jon. Brittany knows Odette. Brittany knows Maude. Audrey knows Larissa. Louisa knows Audrey. Henrietta knows Louisa. Sam knows Gary. Which of Zara and Audrey can Henrietta reach?", "answer": "Audrey", "steps": [ "Henrietta knows Louisa.", "Louisa knows Audrey." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Henrietta", "Larissa", "Louisa", "Dolores", "Barney", "Fred", "Sam", "Gary", "Audrey", "Jon", "Lena", "Bonnie", "Brittany", "Odette", "Julian", "Jerome", "Maude", "Elmer", "Zara", "Elias" ], "edges": [ [ 0, 2 ], [ 1, 5 ], [ 1, 4 ], [ 2, 3 ], [ 2, 6 ], [ 2, 8 ], [ 4, 9 ], [ 6, 7 ], [ 8, 1 ], [ 10, 12 ], [ 11, 15 ], [ 11, 14 ], [ 12, 13 ], [ 12, 16 ], [ 12, 18 ], [ 14, 19 ], [ 16, 17 ], [ 18, 11 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Nicole knows Daniel. Franklin knows Lewis. Lewis knows Adam. Grady knows Willard. Laura knows Bennett. Willard knows Henry. Jacques knows Trevor. Adam knows Laura. Henry knows Ramona. Archer knows Karina. Laura knows Vernon. Cruz knows Nicole. Vernon knows Archer. Franklin knows Ingrid. Henry knows Jacques. Nicole knows Grady. Ethan knows Franklin. Trevor knows Dana. Which of Franklin and Nicole can Cruz reach?", "answer": "Nicole", "steps": [ "Cruz knows Nicole." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Cruz", "Dana", "Daniel", "Henry", "Trevor", "Ramona", "Grady", "Willard", "Nicole", "Jacques", "Ethan", "Karina", "Ingrid", "Laura", "Archer", "Bennett", "Lewis", "Adam", "Franklin", "Vernon" ], "edges": [ [ 0, 8 ], [ 3, 5 ], [ 3, 9 ], [ 4, 1 ], [ 6, 7 ], [ 7, 3 ], [ 8, 2 ], [ 8, 6 ], [ 9, 4 ], [ 10, 18 ], [ 13, 15 ], [ 13, 19 ], [ 14, 11 ], [ 16, 17 ], [ 17, 13 ], [ 18, 12 ], [ 18, 16 ], [ 19, 14 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Adele knows Erwin. Pearl knows Paula. Florence knows Kent. Calvin knows Billy. Casey knows Tabitha. Darla knows Peggy. Peter knows Florence. Billy knows Maude. Paula knows Casey. Erwin knows Marvin. Kent knows Angela. Marvin knows Calvin. Angela knows Julius. Shelby knows Ivy. Peggy knows Adele. Rex knows Pearl. Tabitha knows Peter. Maude knows Shelby. Which of Peter and Calvin can Darla reach?", "answer": "Calvin", "steps": [ "Darla knows Peggy.", "Peggy knows Adele.", "Adele knows Erwin.", "Erwin knows Marvin.", "Marvin knows Calvin." ], "difficulty": 5, "original_distance": 9, "idx_to_symbol": [ "Darla", "Adele", "Calvin", "Peggy", "Maude", "Marvin", "Shelby", "Erwin", "Ivy", "Billy", "Rex", "Paula", "Peter", "Pearl", "Kent", "Tabitha", "Angela", "Casey", "Julius", "Florence" ], "edges": [ [ 0, 3 ], [ 1, 7 ], [ 2, 9 ], [ 3, 1 ], [ 4, 6 ], [ 5, 2 ], [ 6, 8 ], [ 7, 5 ], [ 9, 4 ], [ 10, 13 ], [ 11, 17 ], [ 12, 19 ], [ 13, 11 ], [ 14, 16 ], [ 15, 12 ], [ 16, 18 ], [ 17, 15 ], [ 19, 14 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Garrison knows Dallas. Wyatt knows Darcy. Fabian knows Wyatt. Leroy knows Quinn. Fabian knows Patrick. Kay knows Garrison. Harriet knows Doug. Garrison knows Denver. Zach knows Leroy. Harriet knows Kirk. Darcy knows Zach. Denver knows Nelson. Doug knows Saul. Kaleb knows Luis. Kirk knows Kay. Zach knows Kaleb. Dallas knows Reed. Patrick knows Luther. Which of Zach and Garrison can Harriet reach?", "answer": "Garrison", "steps": [ "Harriet knows Kirk.", "Kirk knows Kay.", "Kay knows Garrison." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Harriet", "Nelson", "Dallas", "Reed", "Garrison", "Denver", "Saul", "Kirk", "Doug", "Kay", "Fabian", "Quinn", "Kaleb", "Luis", "Zach", "Leroy", "Luther", "Wyatt", "Patrick", "Darcy" ], "edges": [ [ 0, 8 ], [ 0, 7 ], [ 2, 3 ], [ 4, 2 ], [ 4, 5 ], [ 5, 1 ], [ 7, 9 ], [ 8, 6 ], [ 9, 4 ], [ 10, 18 ], [ 10, 17 ], [ 12, 13 ], [ 14, 12 ], [ 14, 15 ], [ 15, 11 ], [ 17, 19 ], [ 18, 16 ], [ 19, 14 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Clark knows Arlene. Lambert knows Isadora. Hayes knows Deanna. Trudy knows Monica. Livia knows Lamont. Alan knows Livia. Trudy knows Hayes. Lamont knows Lionel. William knows Lambert. Lionel knows Trudy. William knows Liam. Sebastian knows William. Kendrick knows Sebastian. Lambert knows Hudson. Alan knows Phoebe. Arlene knows Kendrick. Hayes knows Brandon. Clark knows India. Which of Livia and Arlene can Clark reach?", "answer": "Arlene", "steps": [ "Clark knows Arlene." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Clark", "Liam", "India", "Lambert", "Isadora", "Kendrick", "William", "Hudson", "Arlene", "Sebastian", "Alan", "Monica", "Phoebe", "Hayes", "Deanna", "Lamont", "Trudy", "Brandon", "Livia", "Lionel" ], "edges": [ [ 0, 2 ], [ 0, 8 ], [ 3, 4 ], [ 3, 7 ], [ 5, 9 ], [ 6, 1 ], [ 6, 3 ], [ 8, 5 ], [ 9, 6 ], [ 10, 12 ], [ 10, 18 ], [ 13, 14 ], [ 13, 17 ], [ 15, 19 ], [ 16, 11 ], [ 16, 13 ], [ 18, 15 ], [ 19, 16 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Cecilia knows Miriam. Leopold knows Violet. Elvis knows Ariana. Cecilia knows Wendell. Violet knows Katherine. Marie knows Luz. Destiny knows Kristina. Miriam knows Destiny. Yvette knows Kieran. Kieran knows Alder. Katherine knows Dirk. Elvis knows Loretta. Yvette knows Elvis. Marie knows Yasmin. Isabel knows Marie. Isabel knows Cecilia. Kieran knows Leopold. Kristina knows Katrina. Which of Miriam and Leopold can Yvette reach?", "answer": "Leopold", "steps": [ "Yvette knows Kieran.", "Kieran knows Leopold." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Yvette", "Violet", "Alder", "Kieran", "Loretta", "Ariana", "Katherine", "Leopold", "Dirk", "Elvis", "Isabel", "Destiny", "Wendell", "Cecilia", "Yasmin", "Luz", "Kristina", "Miriam", "Katrina", "Marie" ], "edges": [ [ 0, 3 ], [ 0, 9 ], [ 1, 6 ], [ 3, 2 ], [ 3, 7 ], [ 6, 8 ], [ 7, 1 ], [ 9, 4 ], [ 9, 5 ], [ 10, 13 ], [ 10, 19 ], [ 11, 16 ], [ 13, 12 ], [ 13, 17 ], [ 16, 18 ], [ 17, 11 ], [ 19, 14 ], [ 19, 15 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Marilyn knows Mabel. Judith knows Graeme. Caleb knows Marilyn. Parsa knows Daisy. Sandra knows Derek. Derek knows Sue. Caleb knows Spencer. Sandra knows Caleb. Derek knows Alder. Judith knows Susan. Sally knows Bernice. Burt knows Sally. Caleb knows Rex. Bernice knows Sylvia. Sally knows Parsa. Sally knows Wesley. Spencer knows Jaime. Burt knows Judith. Which of Daisy and Jaime can Sandra reach?", "answer": "Jaime", "steps": [ "Sandra knows Caleb.", "Caleb knows Spencer.", "Spencer knows Jaime." ], "difficulty": 3, "original_distance": 3, "idx_to_symbol": [ "Sandra", "Sue", "Alder", "Jaime", "Rex", "Caleb", "Mabel", "Spencer", "Marilyn", "Derek", "Burt", "Susan", "Graeme", "Daisy", "Wesley", "Sally", "Sylvia", "Parsa", "Bernice", "Judith" ], "edges": [ [ 0, 5 ], [ 0, 9 ], [ 5, 4 ], [ 5, 7 ], [ 5, 8 ], [ 7, 3 ], [ 8, 6 ], [ 9, 1 ], [ 9, 2 ], [ 10, 15 ], [ 10, 19 ], [ 15, 14 ], [ 15, 17 ], [ 15, 18 ], [ 17, 13 ], [ 18, 16 ], [ 19, 11 ], [ 19, 12 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Jill knows Mae. Kerry knows Jamie. Mae knows Randy. Elise knows Garrett. Jill knows Philip. Randy knows Daniella. Nicholas knows Kerry. Kerry knows Louise. Samantha knows Shawn. Mae knows Mindy. Lane knows Nicholas. Lane knows Samantha. Philip knows Max. Jamie knows Joseph. Daniella knows Elise. Joseph knows Oliver. Nicholas knows Jasper. Randy knows Willis. Which of Daniella and Jamie can Lane reach?", "answer": "Jamie", "steps": [ "Lane knows Nicholas.", "Nicholas knows Kerry.", "Kerry knows Jamie." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Lane", "Louise", "Kerry", "Nicholas", "Shawn", "Joseph", "Jasper", "Oliver", "Samantha", "Jamie", "Jill", "Willis", "Randy", "Mae", "Max", "Elise", "Mindy", "Garrett", "Philip", "Daniella" ], "edges": [ [ 0, 8 ], [ 0, 3 ], [ 2, 1 ], [ 2, 9 ], [ 3, 6 ], [ 3, 2 ], [ 5, 7 ], [ 8, 4 ], [ 9, 5 ], [ 10, 18 ], [ 10, 13 ], [ 12, 11 ], [ 12, 19 ], [ 13, 16 ], [ 13, 12 ], [ 15, 17 ], [ 18, 14 ], [ 19, 15 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Estella knows James. Cain knows Corey. Percy knows Hugh. Irving knows Maureen. Cody knows Melissa. Lara knows Patricia. Yvette knows Irving. Maureen knows Cole. Lara knows Percy. Irving knows Forrest. Maureen knows Estella. Percy knows Karl. Hugh knows Cody. Luz knows Lara. Melissa knows Karina. Maureen knows Hazel. Percy knows Dante. James knows Cain. Which of Melissa and Cain can Luz reach?", "answer": "Melissa", "steps": [ "Luz knows Lara.", "Lara knows Percy.", "Percy knows Hugh.", "Hugh knows Cody.", "Cody knows Melissa." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Luz", "Hugh", "Lara", "Cody", "Melissa", "Patricia", "Percy", "Karl", "Dante", "Karina", "Yvette", "Estella", "Irving", "James", "Cain", "Forrest", "Maureen", "Cole", "Hazel", "Corey" ], "edges": [ [ 0, 2 ], [ 1, 3 ], [ 2, 5 ], [ 2, 6 ], [ 3, 4 ], [ 4, 9 ], [ 6, 7 ], [ 6, 8 ], [ 6, 1 ], [ 10, 12 ], [ 11, 13 ], [ 12, 15 ], [ 12, 16 ], [ 13, 14 ], [ 14, 19 ], [ 16, 17 ], [ 16, 18 ], [ 16, 11 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Stuart knows Ryan. Clark knows Colby. Adam knows Jarvis. Stuart knows Herbert. Rosemary knows Jameson. Zane knows Stuart. Zane knows Ian. Felix knows Adam. Jarvis knows Irene. Irene knows Clark. Zane knows Alyssa. Ryan knows Oscar. Colby knows Clay. Jarvis knows Damian. Jameson knows Zane. Jarvis knows Simon. Oscar knows Livia. Irene knows Alison. Which of Ryan and Clark can Felix reach?", "answer": "Clark", "steps": [ "Felix knows Adam.", "Adam knows Jarvis.", "Jarvis knows Irene.", "Irene knows Clark." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Felix", "Colby", "Simon", "Clark", "Alison", "Adam", "Irene", "Damian", "Clay", "Jarvis", "Rosemary", "Oscar", "Ian", "Ryan", "Herbert", "Jameson", "Stuart", "Alyssa", "Livia", "Zane" ], "edges": [ [ 0, 5 ], [ 1, 8 ], [ 3, 1 ], [ 5, 9 ], [ 6, 4 ], [ 6, 3 ], [ 9, 2 ], [ 9, 7 ], [ 9, 6 ], [ 10, 15 ], [ 11, 18 ], [ 13, 11 ], [ 15, 19 ], [ 16, 14 ], [ 16, 13 ], [ 19, 12 ], [ 19, 17 ], [ 19, 16 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Luna knows Beatrice. Sadie knows Axel. Javier knows Julius. Ivy knows Loretta. Julia knows Louise. Olive knows Morris. Cornelius knows Curtis. Cornelius knows Ivy. Donald knows Cornelius. Nora knows Donald. Rita knows Javier. Nora knows Sadie. Beatrice knows Olive. Curtis knows Willis. Julius knows Max. Beatrice knows Rita. Cindy knows Nora. Javier knows Julia. Which of Ivy and Julia can Cindy reach?", "answer": "Ivy", "steps": [ "Cindy knows Nora.", "Nora knows Donald.", "Donald knows Cornelius.", "Cornelius knows Ivy." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Cindy", "Nora", "Donald", "Ivy", "Loretta", "Willis", "Cornelius", "Sadie", "Axel", "Curtis", "Luna", "Beatrice", "Rita", "Julia", "Louise", "Max", "Javier", "Olive", "Morris", "Julius" ], "edges": [ [ 0, 1 ], [ 1, 7 ], [ 1, 2 ], [ 2, 6 ], [ 3, 4 ], [ 6, 3 ], [ 6, 9 ], [ 7, 8 ], [ 9, 5 ], [ 10, 11 ], [ 11, 17 ], [ 11, 12 ], [ 12, 16 ], [ 13, 14 ], [ 16, 13 ], [ 16, 19 ], [ 17, 18 ], [ 19, 15 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Ira knows Hayes. Farrah knows Perry. Hayes knows Gareth. Paula knows Jude. Allison knows Jolena. Dell knows Xavier. Gareth knows Esme. August knows Lily. Jolena knows Avery. Jude knows August. Rick knows Farrah. Kurt knows Essie. Perry knows Allison. Jude knows Leopold. Kurt knows Rick. Rick knows Dell. Leopold knows Ira. Paula knows Priscilla. Which of Rick and Jude can Kurt reach?", "answer": "Rick", "steps": [ "Kurt knows Rick." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Kurt", "Jolena", "Rick", "Xavier", "Dell", "Allison", "Perry", "Farrah", "Essie", "Avery", "Paula", "Gareth", "Jude", "Lily", "August", "Hayes", "Ira", "Leopold", "Priscilla", "Esme" ], "edges": [ [ 0, 8 ], [ 0, 2 ], [ 1, 9 ], [ 2, 4 ], [ 2, 7 ], [ 4, 3 ], [ 5, 1 ], [ 6, 5 ], [ 7, 6 ], [ 10, 18 ], [ 10, 12 ], [ 11, 19 ], [ 12, 14 ], [ 12, 17 ], [ 14, 13 ], [ 15, 11 ], [ 16, 15 ], [ 17, 16 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Beau knows Kane. Greta knows Cornelius. Garrison knows Aiden. Greta knows Isadora. Constance knows Xander. Kane knows Constance. Garrison knows Knox. Irma knows Antonio. Knox knows Marco. Jim knows Cyrus. Cornelius knows Irma. Jim knows Cristina. Marco knows Beau. Antonio knows Jim. Kane knows Archie. Greta knows Lamont. Cristina knows Parker. Garrison knows Karina. Which of Xander and Parker can Garrison reach?", "answer": "Xander", "steps": [ "Garrison knows Knox.", "Knox knows Marco.", "Marco knows Beau.", "Beau knows Kane.", "Kane knows Constance.", "Constance knows Xander." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Garrison", "Constance", "Karina", "Knox", "Kane", "Xander", "Aiden", "Marco", "Beau", "Archie", "Greta", "Cristina", "Isadora", "Cornelius", "Jim", "Parker", "Lamont", "Irma", "Antonio", "Cyrus" ], "edges": [ [ 0, 2 ], [ 0, 6 ], [ 0, 3 ], [ 1, 5 ], [ 3, 7 ], [ 4, 1 ], [ 4, 9 ], [ 7, 8 ], [ 8, 4 ], [ 10, 12 ], [ 10, 16 ], [ 10, 13 ], [ 11, 15 ], [ 13, 17 ], [ 14, 11 ], [ 14, 19 ], [ 17, 18 ], [ 18, 14 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Daria knows Amanda. Joel knows Kevin. Otto knows Ibrahim. Jeffery knows Adelaide. Latoya knows Shaun. Amanda knows Esperanza. Brad knows Vera. Tiffany knows Crystal. Ava knows Latoya. Kevin knows Otto. Otto knows Ava. Esperanza knows Jeffery. Vera knows Tiffany. Esperanza knows Donna. Shaun knows Jenny. Dixie knows Conner. Tiffany knows Daria. Shaun knows Dixie. Which of Tiffany and Otto can Joel reach?", "answer": "Otto", "steps": [ "Joel knows Kevin.", "Kevin knows Otto." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Joel", "Otto", "Dixie", "Kevin", "Shaun", "Latoya", "Conner", "Jenny", "Ibrahim", "Ava", "Brad", "Tiffany", "Jeffery", "Vera", "Esperanza", "Amanda", "Adelaide", "Donna", "Crystal", "Daria" ], "edges": [ [ 0, 3 ], [ 1, 8 ], [ 1, 9 ], [ 2, 6 ], [ 3, 1 ], [ 4, 2 ], [ 4, 7 ], [ 5, 4 ], [ 9, 5 ], [ 10, 13 ], [ 11, 18 ], [ 11, 19 ], [ 12, 16 ], [ 13, 11 ], [ 14, 12 ], [ 14, 17 ], [ 15, 14 ], [ 19, 15 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Tim knows Susanne. Emery knows Dawn. Susanne knows Franklin. Susanne knows Odette. Electra knows Philip. Arlene knows Carmen. Jasper knows Emery. Barbara knows Emanuel. Gladys knows Nelson. Electra knows Bart. Arlene knows Jasper. Odette knows Barbara. Carmen knows Electra. Franklin knows Steve. Steve knows Mia. Ivy knows Tim. Nelson knows Arlene. Barbara knows Jakob. Which of Arlene and Susanne can Gladys reach?", "answer": "Arlene", "steps": [ "Gladys knows Nelson.", "Nelson knows Arlene." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Gladys", "Philip", "Carmen", "Electra", "Dawn", "Arlene", "Emery", "Bart", "Nelson", "Jasper", "Ivy", "Jakob", "Odette", "Barbara", "Mia", "Susanne", "Steve", "Emanuel", "Tim", "Franklin" ], "edges": [ [ 0, 8 ], [ 2, 3 ], [ 3, 1 ], [ 3, 7 ], [ 5, 2 ], [ 5, 9 ], [ 6, 4 ], [ 8, 5 ], [ 9, 6 ], [ 10, 18 ], [ 12, 13 ], [ 13, 11 ], [ 13, 17 ], [ 15, 12 ], [ 15, 19 ], [ 16, 14 ], [ 18, 15 ], [ 19, 16 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Livia knows Aisha. Jim knows Liam. Dana knows Thomas. Tabitha knows Karl. Frida knows Pete. Dana knows Tabitha. Liam knows Gonzalo. Joyce knows Dana. Aisha knows Jeremiah. Livia knows Isla. Gonzalo knows Julio. Jim knows Leopold. Asher knows Joyce. Arden knows Jolene. Joyce knows Frida. Gonzalo knows Livia. Arden knows Asher. Julio knows Devin. Which of Livia and Dana can Arden reach?", "answer": "Dana", "steps": [ "Arden knows Asher.", "Asher knows Joyce.", "Joyce knows Dana." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Arden", "Asher", "Frida", "Tabitha", "Dana", "Joyce", "Jolene", "Pete", "Karl", "Thomas", "Jim", "Liam", "Julio", "Aisha", "Livia", "Gonzalo", "Leopold", "Devin", "Jeremiah", "Isla" ], "edges": [ [ 0, 6 ], [ 0, 1 ], [ 1, 5 ], [ 2, 7 ], [ 3, 8 ], [ 4, 3 ], [ 4, 9 ], [ 5, 2 ], [ 5, 4 ], [ 10, 16 ], [ 10, 11 ], [ 11, 15 ], [ 12, 17 ], [ 13, 18 ], [ 14, 13 ], [ 14, 19 ], [ 15, 12 ], [ 15, 14 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Coral knows Olive. Eldon knows Amy. Clayton knows Kamila. Estelle knows Bernadette. Bernadette knows Jorge. Adele knows Fabian. Guillermo knows Eldon. Dora knows Becky. Burt knows Dora. Becky knows Adele. Archer knows Clayton. Clayton knows Coral. Nancy knows Annie. Kamila knows Nancy. Ariana knows Burt. Fabian knows Paul. Jorge knows Archer. Adele knows Guillermo. Which of Adele and Clayton can Estelle reach?", "answer": "Clayton", "steps": [ "Estelle knows Bernadette.", "Bernadette knows Jorge.", "Jorge knows Archer.", "Archer knows Clayton." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Estelle", "Kamila", "Bernadette", "Olive", "Annie", "Nancy", "Jorge", "Coral", "Clayton", "Archer", "Ariana", "Guillermo", "Burt", "Paul", "Amy", "Eldon", "Dora", "Fabian", "Adele", "Becky" ], "edges": [ [ 0, 2 ], [ 1, 5 ], [ 2, 6 ], [ 5, 4 ], [ 6, 9 ], [ 7, 3 ], [ 8, 1 ], [ 8, 7 ], [ 9, 8 ], [ 10, 12 ], [ 11, 15 ], [ 12, 16 ], [ 15, 14 ], [ 16, 19 ], [ 17, 13 ], [ 18, 11 ], [ 18, 17 ], [ 19, 18 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Claudia knows Esperanza. Annette knows Janelle. Eden knows Elias. Felicia knows Annette. Rachel knows Eden. Clayton knows Rachel. Elias knows Wyatt. Esperanza knows Felicia. Annette knows Darren. Langston knows Clayton. Rachel knows Emma. Felicia knows Verna. Rachel knows Chance. Felicia knows Vincent. Darren knows Guy. Clarissa knows Etta. Eden knows Clarissa. Janelle knows Beth. Which of Guy and Wyatt can Langston reach?", "answer": "Wyatt", "steps": [ "Langston knows Clayton.", "Clayton knows Rachel.", "Rachel knows Eden.", "Eden knows Elias.", "Elias knows Wyatt." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Langston", "Elias", "Etta", "Chance", "Wyatt", "Emma", "Eden", "Rachel", "Clarissa", "Clayton", "Claudia", "Darren", "Beth", "Verna", "Guy", "Vincent", "Annette", "Felicia", "Janelle", "Esperanza" ], "edges": [ [ 0, 9 ], [ 1, 4 ], [ 6, 1 ], [ 6, 8 ], [ 7, 3 ], [ 7, 5 ], [ 7, 6 ], [ 8, 2 ], [ 9, 7 ], [ 10, 19 ], [ 11, 14 ], [ 16, 11 ], [ 16, 18 ], [ 17, 13 ], [ 17, 15 ], [ 17, 16 ], [ 18, 12 ], [ 19, 17 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Herbert knows Colin. Sebastian knows Terry. Herbert knows Samantha. Samantha knows Corinne. Eldon knows Max. Yolanda knows Guy. Randy knows Yolanda. Randy knows Chelsea. Terry knows Wilson. Jim knows Jesse. April knows Skyler. Guy knows April. Jim knows Herbert. Yolanda knows Luna. Samantha knows Virginia. Skyler knows Vernon. Virginia knows Sebastian. Eldon knows Randy. Which of Sebastian and April can Jim reach?", "answer": "Sebastian", "steps": [ "Jim knows Herbert.", "Herbert knows Samantha.", "Samantha knows Virginia.", "Virginia knows Sebastian." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Jim", "Wilson", "Jesse", "Colin", "Samantha", "Terry", "Corinne", "Virginia", "Herbert", "Sebastian", "Eldon", "Vernon", "Max", "Chelsea", "Yolanda", "Skyler", "Luna", "Guy", "Randy", "April" ], "edges": [ [ 0, 2 ], [ 0, 8 ], [ 4, 6 ], [ 4, 7 ], [ 5, 1 ], [ 7, 9 ], [ 8, 3 ], [ 8, 4 ], [ 9, 5 ], [ 10, 12 ], [ 10, 18 ], [ 14, 16 ], [ 14, 17 ], [ 15, 11 ], [ 17, 19 ], [ 18, 13 ], [ 18, 14 ], [ 19, 15 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Dawn knows Adam. Gene knows Connor. Adam knows Finn. Finn knows Megan. Fanny knows Dawn. Avery knows Dell. Wilson knows Avery. Marilyn knows Gideon. Megan knows Gene. Gideon knows Lorraine. Etta knows Wilson. Curtis knows James. Lars knows Etta. Connor knows Bonnie. Gene knows Lawson. Francesca knows Fanny. Avery knows Curtis. Lorraine knows Lars. Which of Gene and Avery can Marilyn reach?", "answer": "Avery", "steps": [ "Marilyn knows Gideon.", "Gideon knows Lorraine.", "Lorraine knows Lars.", "Lars knows Etta.", "Etta knows Wilson.", "Wilson knows Avery." ], "difficulty": 6, "original_distance": 8, "idx_to_symbol": [ "Marilyn", "Lorraine", "Etta", "Curtis", "Wilson", "Gideon", "Dell", "James", "Avery", "Lars", "Francesca", "Dawn", "Finn", "Connor", "Megan", "Fanny", "Lawson", "Bonnie", "Gene", "Adam" ], "edges": [ [ 0, 5 ], [ 1, 9 ], [ 2, 4 ], [ 3, 7 ], [ 4, 8 ], [ 5, 1 ], [ 8, 6 ], [ 8, 3 ], [ 9, 2 ], [ 10, 15 ], [ 11, 19 ], [ 12, 14 ], [ 13, 17 ], [ 14, 18 ], [ 15, 11 ], [ 18, 16 ], [ 18, 13 ], [ 19, 12 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Luke knows Javier. Zoe knows Greg. Kylie knows Cecilia. Daniella knows Kylie. Tristan knows Daniella. Javier knows Zoe. Keaton knows Emily. Keaton knows Gavin. Rosa knows Tristan. Emily knows Luke. Luke knows Eunice. Leopold knows Michael. Cecilia knows Leopold. Kylie knows Devon. Luke knows Damien. Tristan knows Caleb. Ken knows Keaton. Kylie knows Lottie. Which of Tristan and Keaton can Rosa reach?", "answer": "Tristan", "steps": [ "Rosa knows Tristan." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Rosa", "Lottie", "Tristan", "Leopold", "Kylie", "Daniella", "Michael", "Cecilia", "Caleb", "Devon", "Ken", "Eunice", "Keaton", "Zoe", "Luke", "Emily", "Greg", "Javier", "Gavin", "Damien" ], "edges": [ [ 0, 2 ], [ 2, 8 ], [ 2, 5 ], [ 3, 6 ], [ 4, 1 ], [ 4, 7 ], [ 4, 9 ], [ 5, 4 ], [ 7, 3 ], [ 10, 12 ], [ 12, 18 ], [ 12, 15 ], [ 13, 16 ], [ 14, 11 ], [ 14, 17 ], [ 14, 19 ], [ 15, 14 ], [ 17, 13 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Brent knows Cruz. Bella knows Pat. Darla knows Brent. Shaun knows Eleanor. Eleanor knows Parker. Parker knows Vera. Mitchell knows Marion. Boyd knows Todd. Cruz knows Rose. Marion knows Leonard. Darla knows Sam. Rose knows Garland. Todd knows Neil. Bella knows Boyd. Shaun knows Katherine. Garland knows Mitchell. Neil knows Shaun. Garland knows Brian. Which of Mitchell and Eleanor can Darla reach?", "answer": "Mitchell", "steps": [ "Darla knows Brent.", "Brent knows Cruz.", "Cruz knows Rose.", "Rose knows Garland.", "Garland knows Mitchell." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Darla", "Mitchell", "Leonard", "Marion", "Brian", "Cruz", "Brent", "Rose", "Garland", "Sam", "Bella", "Eleanor", "Vera", "Parker", "Katherine", "Todd", "Boyd", "Neil", "Shaun", "Pat" ], "edges": [ [ 0, 6 ], [ 0, 9 ], [ 1, 3 ], [ 3, 2 ], [ 5, 7 ], [ 6, 5 ], [ 7, 8 ], [ 8, 1 ], [ 8, 4 ], [ 10, 16 ], [ 10, 19 ], [ 11, 13 ], [ 13, 12 ], [ 15, 17 ], [ 16, 15 ], [ 17, 18 ], [ 18, 11 ], [ 18, 14 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Amber knows Hayes. Rosemary knows Amber. Pablo knows Rosemary. Henry knows Rhea. Elodie knows Austin. Henry knows Elodie. Helene knows Claude. Ian knows Joseph. Frances knows Monica. Pablo knows Carl. Henry knows Helene. Carl knows Daphne. Daphne knows Ian. Austin knows Frances. Pablo knows Ellen. Pablo knows Alice. Claude knows Aaron. Henry knows Derek. Which of Frances and Ian can Pablo reach?", "answer": "Ian", "steps": [ "Pablo knows Carl.", "Carl knows Daphne.", "Daphne knows Ian." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Pablo", "Alice", "Joseph", "Ian", "Daphne", "Rosemary", "Ellen", "Carl", "Amber", "Hayes", "Henry", "Rhea", "Monica", "Frances", "Austin", "Helene", "Derek", "Elodie", "Claude", "Aaron" ], "edges": [ [ 0, 1 ], [ 0, 6 ], [ 0, 7 ], [ 0, 5 ], [ 3, 2 ], [ 4, 3 ], [ 5, 8 ], [ 7, 4 ], [ 8, 9 ], [ 10, 11 ], [ 10, 16 ], [ 10, 17 ], [ 10, 15 ], [ 13, 12 ], [ 14, 13 ], [ 15, 18 ], [ 17, 14 ], [ 18, 19 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Calvin knows Harvey. Brynn knows Frankie. Harvey knows Ira. Regina knows Dolores. Nell knows Sarah. Monroe knows Regina. Sarah knows Jeff. Vivian knows Nell. Frankie knows Alana. Jackson knows Monroe. Sarah knows Magdalena. Hamilton knows Brynn. Carey knows Hamilton. Clement knows Calvin. Carey knows Clement. Jackson knows Vivian. Frankie knows Gloria. Dolores knows Kurt. Which of Sarah and Frankie can Carey reach?", "answer": "Frankie", "steps": [ "Carey knows Hamilton.", "Hamilton knows Brynn.", "Brynn knows Frankie." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Carey", "Calvin", "Hamilton", "Gloria", "Ira", "Alana", "Brynn", "Clement", "Harvey", "Frankie", "Jackson", "Regina", "Vivian", "Jeff", "Kurt", "Magdalena", "Nell", "Monroe", "Dolores", "Sarah" ], "edges": [ [ 0, 7 ], [ 0, 2 ], [ 1, 8 ], [ 2, 6 ], [ 6, 9 ], [ 7, 1 ], [ 8, 4 ], [ 9, 3 ], [ 9, 5 ], [ 10, 17 ], [ 10, 12 ], [ 11, 18 ], [ 12, 16 ], [ 16, 19 ], [ 17, 11 ], [ 18, 14 ], [ 19, 13 ], [ 19, 15 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Flora knows Lucia. Russell knows Owen. Neal knows Desmond. Zara knows Bonnie. Bonnie knows Dana. Maria knows Flora. Livia knows Katrina. Martin knows Maria. Knox knows Charles. Owen knows Livia. Bonnie knows Allan. Livia knows Peggy. Katrina knows Neal. Knox knows Zara. Desmond knows Will. Dana knows Martin. Russell knows Chelsea. Will knows Colin. Which of Livia and Bonnie can Knox reach?", "answer": "Bonnie", "steps": [ "Knox knows Zara.", "Zara knows Bonnie." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Knox", "Flora", "Allan", "Dana", "Bonnie", "Zara", "Maria", "Lucia", "Charles", "Martin", "Russell", "Will", "Peggy", "Katrina", "Livia", "Owen", "Desmond", "Colin", "Chelsea", "Neal" ], "edges": [ [ 0, 8 ], [ 0, 5 ], [ 1, 7 ], [ 3, 9 ], [ 4, 2 ], [ 4, 3 ], [ 5, 4 ], [ 6, 1 ], [ 9, 6 ], [ 10, 18 ], [ 10, 15 ], [ 11, 17 ], [ 13, 19 ], [ 14, 12 ], [ 14, 13 ], [ 15, 14 ], [ 16, 11 ], [ 19, 16 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Guy knows Emmett. Cooper knows Erik. Xander knows Ava. Cliff knows Devon. Fiona knows Arturo. Celia knows Edward. Edward knows Xander. Cliff knows Damien. Damien knows Israel. Devon knows Billy. Alyson knows Harry. Arturo knows Celia. Celia knows Alyson. Edward knows Samuel. Erik knows Guy. Guy knows Cliff. Emmett knows Mae. Samuel knows Kevin. Which of Israel and Kevin can Cooper reach?", "answer": "Israel", "steps": [ "Cooper knows Erik.", "Erik knows Guy.", "Guy knows Cliff.", "Cliff knows Damien.", "Damien knows Israel." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Cooper", "Guy", "Billy", "Erik", "Devon", "Cliff", "Damien", "Emmett", "Israel", "Mae", "Fiona", "Celia", "Ava", "Arturo", "Xander", "Edward", "Samuel", "Alyson", "Kevin", "Harry" ], "edges": [ [ 0, 3 ], [ 1, 5 ], [ 1, 7 ], [ 3, 1 ], [ 4, 2 ], [ 5, 4 ], [ 5, 6 ], [ 6, 8 ], [ 7, 9 ], [ 10, 13 ], [ 11, 15 ], [ 11, 17 ], [ 13, 11 ], [ 14, 12 ], [ 15, 14 ], [ 15, 16 ], [ 16, 18 ], [ 17, 19 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Dwight knows Wendy. Neal knows Caleb. Isla knows Antonio. Katherine knows Colin. Dwight knows Edmund. Edmund knows Ursula. Neal knows Natalie. Annette knows Neal. Desmond knows Dwight. Colin knows Desmond. Lara knows Max. Edmund knows Vanessa. Dwight knows Irving. Antonio knows Annette. Neal knows Lara. Lara knows Tina. Max knows Lewis. Vanessa knows Jonathan. Which of Colin and Antonio can Isla reach?", "answer": "Antonio", "steps": [ "Isla knows Antonio." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Isla", "Lara", "Caleb", "Annette", "Neal", "Natalie", "Lewis", "Tina", "Max", "Antonio", "Katherine", "Edmund", "Irving", "Desmond", "Dwight", "Wendy", "Jonathan", "Ursula", "Vanessa", "Colin" ], "edges": [ [ 0, 9 ], [ 1, 7 ], [ 1, 8 ], [ 3, 4 ], [ 4, 2 ], [ 4, 5 ], [ 4, 1 ], [ 8, 6 ], [ 9, 3 ], [ 10, 19 ], [ 11, 17 ], [ 11, 18 ], [ 13, 14 ], [ 14, 12 ], [ 14, 15 ], [ 14, 11 ], [ 18, 16 ], [ 19, 13 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Jordan knows Emma. Duncan knows Jacqueline. Gina knows Jerome. Russ knows Gina. Emma knows Pat. Gina knows Griffith. Emma knows Conrad. Paula knows Homer. Pat knows Mabel. Mabel knows Russ. Jacqueline knows Cyrus. Daniella knows Fergus. Daniella knows Gabe. Lillian knows Daniella. Jacqueline knows Paula. Gina knows Mae. Homer knows Lillian. Daniella knows Elvira. Which of Pat and Paula can Duncan reach?", "answer": "Paula", "steps": [ "Duncan knows Jacqueline.", "Jacqueline knows Paula." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Duncan", "Daniella", "Paula", "Homer", "Jacqueline", "Gabe", "Fergus", "Elvira", "Lillian", "Cyrus", "Jordan", "Gina", "Pat", "Mabel", "Emma", "Mae", "Griffith", "Jerome", "Russ", "Conrad" ], "edges": [ [ 0, 4 ], [ 1, 5 ], [ 1, 6 ], [ 1, 7 ], [ 2, 3 ], [ 3, 8 ], [ 4, 2 ], [ 4, 9 ], [ 8, 1 ], [ 10, 14 ], [ 11, 15 ], [ 11, 16 ], [ 11, 17 ], [ 12, 13 ], [ 13, 18 ], [ 14, 12 ], [ 14, 19 ], [ 18, 11 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Luke knows Javier. Zoe knows Greg. Kylie knows Cecilia. Daniella knows Kylie. Tristan knows Daniella. Javier knows Zoe. Keaton knows Emily. Keaton knows Gavin. Rosa knows Tristan. Emily knows Luke. Luke knows Eunice. Leopold knows Michael. Cecilia knows Leopold. Kylie knows Devon. Luke knows Damien. Tristan knows Caleb. Ken knows Keaton. Kylie knows Lottie. Which of Cecilia and Javier can Rosa reach?", "answer": "Cecilia", "steps": [ "Rosa knows Tristan.", "Tristan knows Daniella.", "Daniella knows Kylie.", "Kylie knows Cecilia." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Rosa", "Lottie", "Tristan", "Leopold", "Kylie", "Daniella", "Michael", "Cecilia", "Caleb", "Devon", "Ken", "Eunice", "Keaton", "Zoe", "Luke", "Emily", "Greg", "Javier", "Gavin", "Damien" ], "edges": [ [ 0, 2 ], [ 2, 8 ], [ 2, 5 ], [ 3, 6 ], [ 4, 1 ], [ 4, 7 ], [ 4, 9 ], [ 5, 4 ], [ 7, 3 ], [ 10, 12 ], [ 12, 18 ], [ 12, 15 ], [ 13, 16 ], [ 14, 11 ], [ 14, 17 ], [ 14, 19 ], [ 15, 14 ], [ 17, 13 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Neal knows Dante. Vera knows Harmony. Betty knows Israel. Colby knows Alvin. Betty knows Dolly. Alex knows Imogen. Joy knows Colby. Vera knows Gene. Thomas knows Jewel. Colby knows Carlos. Natalie knows Joy. Molly knows Alex. Dolly knows Neal. Jewel knows Vera. Molly knows Bob. Gene knows Betty. Carlos knows Molly. Imogen knows Grant. Which of Dante and Grant can Thomas reach?", "answer": "Dante", "steps": [ "Thomas knows Jewel.", "Jewel knows Vera.", "Vera knows Gene.", "Gene knows Betty.", "Betty knows Dolly.", "Dolly knows Neal.", "Neal knows Dante." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Thomas", "Israel", "Dolly", "Vera", "Dante", "Jewel", "Neal", "Betty", "Harmony", "Gene", "Natalie", "Bob", "Alex", "Colby", "Grant", "Joy", "Imogen", "Molly", "Alvin", "Carlos" ], "edges": [ [ 0, 5 ], [ 2, 6 ], [ 3, 8 ], [ 3, 9 ], [ 5, 3 ], [ 6, 4 ], [ 7, 1 ], [ 7, 2 ], [ 9, 7 ], [ 10, 15 ], [ 12, 16 ], [ 13, 18 ], [ 13, 19 ], [ 15, 13 ], [ 16, 14 ], [ 17, 11 ], [ 17, 12 ], [ 19, 17 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Kara knows Jewel. Clyde knows Devin. Effie knows Kara. Jack knows Dudley. Joan knows Carlton. Dakota knows Lloyd. Dudley knows Effie. Carey knows Nelson. Shelby knows Carey. Troy knows Jana. Shelby knows Dakota. Ashley knows Troy. Nelson knows Robin. Kristin knows Shelby. Kristin knows Clyde. Dudley knows Joan. Effie knows Ashley. Donald knows Kristin. Which of Nelson and Troy can Donald reach?", "answer": "Nelson", "steps": [ "Donald knows Kristin.", "Kristin knows Shelby.", "Shelby knows Carey.", "Carey knows Nelson." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Donald", "Carey", "Lloyd", "Robin", "Devin", "Clyde", "Kristin", "Dakota", "Nelson", "Shelby", "Jack", "Ashley", "Jewel", "Jana", "Carlton", "Joan", "Dudley", "Kara", "Troy", "Effie" ], "edges": [ [ 0, 6 ], [ 1, 8 ], [ 5, 4 ], [ 6, 5 ], [ 6, 9 ], [ 7, 2 ], [ 8, 3 ], [ 9, 7 ], [ 9, 1 ], [ 10, 16 ], [ 11, 18 ], [ 15, 14 ], [ 16, 15 ], [ 16, 19 ], [ 17, 12 ], [ 18, 13 ], [ 19, 17 ], [ 19, 11 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Reid knows Autumn. Selena knows Duke. Autumn knows Emanuel. Goldie knows Kenneth. Goldie knows Farrah. Thea knows Grover. Kendra knows Thea. Jean knows Doug. Kendra knows Amanda. Kenneth knows Stefan. Autumn knows Harold. Kendra knows Reid. Goldie knows Selena. Jean knows Palmer. Amanda knows Catherine. Jean knows Ursula. Farrah knows Jean. Autumn knows Winifred. Which of Ursula and Emanuel can Goldie reach?", "answer": "Ursula", "steps": [ "Goldie knows Farrah.", "Farrah knows Jean.", "Jean knows Ursula." ], "difficulty": 3, "original_distance": 3, "idx_to_symbol": [ "Goldie", "Palmer", "Duke", "Jean", "Stefan", "Kenneth", "Selena", "Doug", "Farrah", "Ursula", "Kendra", "Harold", "Grover", "Autumn", "Catherine", "Amanda", "Thea", "Winifred", "Reid", "Emanuel" ], "edges": [ [ 0, 5 ], [ 0, 6 ], [ 0, 8 ], [ 3, 1 ], [ 3, 7 ], [ 3, 9 ], [ 5, 4 ], [ 6, 2 ], [ 8, 3 ], [ 10, 15 ], [ 10, 16 ], [ 10, 18 ], [ 13, 11 ], [ 13, 17 ], [ 13, 19 ], [ 15, 14 ], [ 16, 12 ], [ 18, 13 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Kim knows Tanya. Pearl knows Darcy. Helene knows Larissa. Larissa knows Rhea. Darcy knows Dorothy. Kim knows Ariana. Javier knows Lana. Dante knows Edna. Yasmin knows Jaime. Cristina knows Charity. Charity knows Dante. Dante knows Yasmin. Ramon knows Pearl. Lana knows Kim. Jermaine knows Javier. Ramon knows Cristina. Tanya knows Nancy. Jermaine knows Helene. Which of Kim and Dante can Jermaine reach?", "answer": "Kim", "steps": [ "Jermaine knows Javier.", "Javier knows Lana.", "Lana knows Kim." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Jermaine", "Ariana", "Larissa", "Tanya", "Javier", "Lana", "Nancy", "Helene", "Rhea", "Kim", "Ramon", "Edna", "Darcy", "Yasmin", "Cristina", "Charity", "Jaime", "Pearl", "Dorothy", "Dante" ], "edges": [ [ 0, 7 ], [ 0, 4 ], [ 2, 8 ], [ 3, 6 ], [ 4, 5 ], [ 5, 9 ], [ 7, 2 ], [ 9, 1 ], [ 9, 3 ], [ 10, 17 ], [ 10, 14 ], [ 12, 18 ], [ 13, 16 ], [ 14, 15 ], [ 15, 19 ], [ 17, 12 ], [ 19, 11 ], [ 19, 13 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Heath knows Duke. Jacques knows Marshall. Devin knows Jodi. Jacques knows Heath. Marshall knows Harvey. Jorge knows Val. Jean knows Greta. Jean knows Thea. Jacques knows Rhonda. Greta knows Kamila. Jorge knows Devin. Heath knows Rod. Marshall knows Daria. Jean knows Jorge. Greta knows Darla. Heath knows Ebony. Daria knows Kenneth. Greta knows Eric. Which of Devin and Daria can Jean reach?", "answer": "Devin", "steps": [ "Jean knows Jorge.", "Jorge knows Devin." ], "difficulty": 2, "original_distance": 3, "idx_to_symbol": [ "Jean", "Devin", "Val", "Darla", "Eric", "Kamila", "Greta", "Thea", "Jodi", "Jorge", "Jacques", "Daria", "Harvey", "Duke", "Rod", "Ebony", "Heath", "Rhonda", "Kenneth", "Marshall" ], "edges": [ [ 0, 6 ], [ 0, 7 ], [ 0, 9 ], [ 1, 8 ], [ 6, 3 ], [ 6, 4 ], [ 6, 5 ], [ 9, 2 ], [ 9, 1 ], [ 10, 16 ], [ 10, 17 ], [ 10, 19 ], [ 11, 18 ], [ 16, 13 ], [ 16, 14 ], [ 16, 15 ], [ 19, 12 ], [ 19, 11 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Jolene knows Hunter. Rocco knows Dylan. Hunter knows Scott. Kate knows Molly. Jolene knows Kathleen. Lucille knows Erica. Lars knows Elodie. Lars knows Jolene. Victor knows Kate. Kate knows Charles. Charles knows Rocco. Elodie knows Hubert. Victor knows Lucille. Kathleen knows Graeme. Molly knows Fiona. Scott knows Karla. Graeme knows Jerry. Fiona knows Edwin. Which of Jerry and Dylan can Victor reach?", "answer": "Dylan", "steps": [ "Victor knows Kate.", "Kate knows Charles.", "Charles knows Rocco.", "Rocco knows Dylan." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Victor", "Fiona", "Edwin", "Lucille", "Kate", "Rocco", "Erica", "Charles", "Molly", "Dylan", "Lars", "Scott", "Karla", "Elodie", "Jolene", "Graeme", "Hubert", "Kathleen", "Hunter", "Jerry" ], "edges": [ [ 0, 3 ], [ 0, 4 ], [ 1, 2 ], [ 3, 6 ], [ 4, 8 ], [ 4, 7 ], [ 5, 9 ], [ 7, 5 ], [ 8, 1 ], [ 10, 13 ], [ 10, 14 ], [ 11, 12 ], [ 13, 16 ], [ 14, 18 ], [ 14, 17 ], [ 15, 19 ], [ 17, 15 ], [ 18, 11 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Ernesto knows Gerald. Sadie knows Jenna. Bernard knows Theodore. Karen knows Gloria. Steve knows Daisy. Yvonne knows Eloise. Bernard knows Steve. Gertrude knows Dorothy. Sadie knows Allison. Jenna knows Ernesto. Jenna knows Irene. Erin knows Yvonne. Allison knows Karen. Jenna knows Gus. Theodore knows Gertrude. Steve knows Erin. Steve knows Leander. Gerald knows Kaleb. Which of Gerald and Yvonne can Sadie reach?", "answer": "Gerald", "steps": [ "Sadie knows Jenna.", "Jenna knows Ernesto.", "Ernesto knows Gerald." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Sadie", "Gloria", "Gus", "Jenna", "Irene", "Allison", "Gerald", "Ernesto", "Kaleb", "Karen", "Bernard", "Dorothy", "Leander", "Steve", "Daisy", "Theodore", "Yvonne", "Erin", "Eloise", "Gertrude" ], "edges": [ [ 0, 3 ], [ 0, 5 ], [ 3, 2 ], [ 3, 4 ], [ 3, 7 ], [ 5, 9 ], [ 6, 8 ], [ 7, 6 ], [ 9, 1 ], [ 10, 13 ], [ 10, 15 ], [ 13, 12 ], [ 13, 14 ], [ 13, 17 ], [ 15, 19 ], [ 16, 18 ], [ 17, 16 ], [ 19, 11 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Courtney knows Selena. Stacy knows Vance. Marlene knows Colette. Ernie knows Peggy. Louis knows Edna. Selena knows Hector. Colette knows Marian. Peggy knows Stacy. Yasmin knows Enid. Dewey knows Courtney. Vance knows Hugh. Daphne knows Iris. Hector knows Audrey. Edna knows Ted. Audrey knows Marlene. Peggy knows Daphne. Ted knows Ernie. Audrey knows Yasmin. Which of Peggy and Audrey can Dewey reach?", "answer": "Audrey", "steps": [ "Dewey knows Courtney.", "Courtney knows Selena.", "Selena knows Hector.", "Hector knows Audrey." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Dewey", "Hector", "Marian", "Yasmin", "Selena", "Colette", "Enid", "Audrey", "Courtney", "Marlene", "Louis", "Ernie", "Hugh", "Daphne", "Ted", "Vance", "Iris", "Peggy", "Edna", "Stacy" ], "edges": [ [ 0, 8 ], [ 1, 7 ], [ 3, 6 ], [ 4, 1 ], [ 5, 2 ], [ 7, 3 ], [ 7, 9 ], [ 8, 4 ], [ 9, 5 ], [ 10, 18 ], [ 11, 17 ], [ 13, 16 ], [ 14, 11 ], [ 15, 12 ], [ 17, 13 ], [ 17, 19 ], [ 18, 14 ], [ 19, 15 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Virginia knows Bonnie. Anton knows Wilson. Eloise knows Sara. Percy knows Amy. Glenn knows Virginia. Eloise knows Doris. Josie knows Eloise. Daria knows Erma. Anton knows Evelyn. Percy knows Jill. Sara knows Langston. Virginia knows Preston. Daria knows Percy. Daria knows Brenda. Langston knows Hope. Preston knows Daria. Langston knows Anton. Langston knows Trevor. Which of Daria and Langston can Josie reach?", "answer": "Langston", "steps": [ "Josie knows Eloise.", "Eloise knows Sara.", "Sara knows Langston." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Josie", "Doris", "Trevor", "Eloise", "Wilson", "Langston", "Anton", "Hope", "Sara", "Evelyn", "Glenn", "Bonnie", "Erma", "Virginia", "Amy", "Daria", "Percy", "Brenda", "Preston", "Jill" ], "edges": [ [ 0, 3 ], [ 3, 1 ], [ 3, 8 ], [ 5, 2 ], [ 5, 7 ], [ 5, 6 ], [ 6, 4 ], [ 6, 9 ], [ 8, 5 ], [ 10, 13 ], [ 13, 11 ], [ 13, 18 ], [ 15, 12 ], [ 15, 17 ], [ 15, 16 ], [ 16, 14 ], [ 16, 19 ], [ 18, 15 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Jakob knows Wilma. Darren knows Marcia. Foster knows Yara. Julio knows Jakob. Elvis knows Dora. Ruth knows Darren. Julius knows Enrique. Abel knows Ingrid. Elvis knows Abel. Darren knows Elvis. Bernadette knows Ruth. Blaine knows Bernadette. Jeremiah knows Julius. Dora knows Jolene. Yara knows Jeremiah. Julio knows Glenn. Julius knows Julio. Glenn knows Clement. Which of Ruth and Jeremiah can Foster reach?", "answer": "Jeremiah", "steps": [ "Foster knows Yara.", "Yara knows Jeremiah." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Foster", "Wilma", "Enrique", "Jakob", "Clement", "Julio", "Glenn", "Yara", "Jeremiah", "Julius", "Blaine", "Ingrid", "Marcia", "Abel", "Jolene", "Elvis", "Dora", "Bernadette", "Ruth", "Darren" ], "edges": [ [ 0, 7 ], [ 3, 1 ], [ 5, 3 ], [ 5, 6 ], [ 6, 4 ], [ 7, 8 ], [ 8, 9 ], [ 9, 2 ], [ 9, 5 ], [ 10, 17 ], [ 13, 11 ], [ 15, 13 ], [ 15, 16 ], [ 16, 14 ], [ 17, 18 ], [ 18, 19 ], [ 19, 12 ], [ 19, 15 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Doris knows Hayley. Jacob knows Jonah. Belinda knows Nadine. Jacob knows Aspen. Keith knows Theodore. Aspen knows Haven. Haven knows Edison. Belinda knows Hadley. Don knows Elodie. Theodore knows Zara. Doris knows Raymond. Theodore knows Belinda. Haven knows Chester. Jana knows Don. Don knows Jacob. Theodore knows Alyson. Don knows Elias. Nadine knows Doris. Which of Theodore and Don can Keith reach?", "answer": "Theodore", "steps": [ "Keith knows Theodore." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Keith", "Nadine", "Zara", "Theodore", "Alyson", "Hadley", "Hayley", "Doris", "Belinda", "Raymond", "Jana", "Aspen", "Elodie", "Don", "Elias", "Jonah", "Chester", "Haven", "Jacob", "Edison" ], "edges": [ [ 0, 3 ], [ 1, 7 ], [ 3, 2 ], [ 3, 4 ], [ 3, 8 ], [ 7, 6 ], [ 7, 9 ], [ 8, 5 ], [ 8, 1 ], [ 10, 13 ], [ 11, 17 ], [ 13, 12 ], [ 13, 14 ], [ 13, 18 ], [ 17, 16 ], [ 17, 19 ], [ 18, 15 ], [ 18, 11 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Stuart knows Ryan. Clark knows Colby. Adam knows Jarvis. Stuart knows Herbert. Rosemary knows Jameson. Zane knows Stuart. Zane knows Ian. Felix knows Adam. Jarvis knows Irene. Irene knows Clark. Zane knows Alyssa. Ryan knows Oscar. Colby knows Clay. Jarvis knows Damian. Jameson knows Zane. Jarvis knows Simon. Oscar knows Livia. Irene knows Alison. Which of Irene and Stuart can Felix reach?", "answer": "Irene", "steps": [ "Felix knows Adam.", "Adam knows Jarvis.", "Jarvis knows Irene." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Felix", "Colby", "Simon", "Clark", "Alison", "Adam", "Irene", "Damian", "Clay", "Jarvis", "Rosemary", "Oscar", "Ian", "Ryan", "Herbert", "Jameson", "Stuart", "Alyssa", "Livia", "Zane" ], "edges": [ [ 0, 5 ], [ 1, 8 ], [ 3, 1 ], [ 5, 9 ], [ 6, 4 ], [ 6, 3 ], [ 9, 2 ], [ 9, 7 ], [ 9, 6 ], [ 10, 15 ], [ 11, 18 ], [ 13, 11 ], [ 15, 19 ], [ 16, 14 ], [ 16, 13 ], [ 19, 12 ], [ 19, 17 ], [ 19, 16 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Tyler knows Evan. Naomi knows Elvis. Humphrey knows Mike. Chris knows Stefan. Chris knows Hal. Brittany knows Javier. Laura knows Tyler. Jacob knows Laura. Laura knows Jim. Brittany knows Mara. Laura knows Charity. Brittany knows Kay. Tyler knows Emery. Humphrey knows Brittany. Mara knows Clarissa. Laura knows Naomi. Jacob knows Claire. Brittany knows Chris. Which of Chris and Tyler can Humphrey reach?", "answer": "Chris", "steps": [ "Humphrey knows Brittany.", "Brittany knows Chris." ], "difficulty": 2, "original_distance": 3, "idx_to_symbol": [ "Humphrey", "Mara", "Stefan", "Kay", "Brittany", "Clarissa", "Mike", "Chris", "Javier", "Hal", "Jacob", "Naomi", "Evan", "Charity", "Laura", "Elvis", "Claire", "Tyler", "Jim", "Emery" ], "edges": [ [ 0, 6 ], [ 0, 4 ], [ 1, 5 ], [ 4, 3 ], [ 4, 1 ], [ 4, 8 ], [ 4, 7 ], [ 7, 2 ], [ 7, 9 ], [ 10, 16 ], [ 10, 14 ], [ 11, 15 ], [ 14, 13 ], [ 14, 11 ], [ 14, 18 ], [ 14, 17 ], [ 17, 12 ], [ 17, 19 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Inez knows Yolanda. Demetrius knows Eve. Demetrius knows Linda. Latoya knows Graeme. Linda knows Crystal. Matthew knows Annie. Penny knows Jarvis. Linda knows Laura. Maya knows Penny. Annie knows Jeffery. Yolanda knows Erma. Leticia knows Kylie. Eve knows Leticia. Penny knows Julian. Wilbur knows Latoya. Laura knows Inez. Jarvis knows Matthew. Maya knows Wilbur. Which of Linda and Penny can Maya reach?", "answer": "Penny", "steps": [ "Maya knows Penny." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Maya", "Jarvis", "Wilbur", "Matthew", "Penny", "Jeffery", "Annie", "Graeme", "Julian", "Latoya", "Demetrius", "Laura", "Eve", "Inez", "Linda", "Erma", "Yolanda", "Kylie", "Crystal", "Leticia" ], "edges": [ [ 0, 4 ], [ 0, 2 ], [ 1, 3 ], [ 2, 9 ], [ 3, 6 ], [ 4, 1 ], [ 4, 8 ], [ 6, 5 ], [ 9, 7 ], [ 10, 14 ], [ 10, 12 ], [ 11, 13 ], [ 12, 19 ], [ 13, 16 ], [ 14, 11 ], [ 14, 18 ], [ 16, 15 ], [ 19, 17 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Phoebe knows Esperanza. Roger knows Vivian. Esperanza knows Archie. Esperanza knows Harris. Gavin knows Humphrey. Olive knows Abigail. Archie knows Gavin. Lyric knows Walter. Virgil knows Mindy. Imogen knows Lucy. Lucy knows Olive. Harris knows Robert. Mindy knows Lyric. Mindy knows Imogen. Roger knows Phoebe. Jim knows Atlas. Jim knows Virgil. Humphrey knows Jonathan. Which of Gavin and Lucy can Roger reach?", "answer": "Gavin", "steps": [ "Roger knows Phoebe.", "Phoebe knows Esperanza.", "Esperanza knows Archie.", "Archie knows Gavin." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Roger", "Vivian", "Gavin", "Jonathan", "Archie", "Esperanza", "Phoebe", "Harris", "Humphrey", "Robert", "Jim", "Atlas", "Lucy", "Abigail", "Imogen", "Mindy", "Virgil", "Lyric", "Olive", "Walter" ], "edges": [ [ 0, 1 ], [ 0, 6 ], [ 2, 8 ], [ 4, 2 ], [ 5, 4 ], [ 5, 7 ], [ 6, 5 ], [ 7, 9 ], [ 8, 3 ], [ 10, 11 ], [ 10, 16 ], [ 12, 18 ], [ 14, 12 ], [ 15, 14 ], [ 15, 17 ], [ 16, 15 ], [ 17, 19 ], [ 18, 13 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Nathan knows Louisa. Helene knows Anthony. Carl knows Priscilla. Foster knows Darnell. Priscilla knows Humphrey. Foster knows Merle. Jermaine knows Foster. Carl knows Malcolm. Zach knows Ruby. Merle knows Zach. Ruby knows Glenn. Humphrey knows Kane. Jermaine knows Ida. Priscilla knows Wendy. Kane knows Helene. Priscilla knows Fergus. Wendy knows Cliff. Foster knows Nathan. Which of Zach and Kane can Jermaine reach?", "answer": "Zach", "steps": [ "Jermaine knows Foster.", "Foster knows Merle.", "Merle knows Zach." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Jermaine", "Ruby", "Foster", "Glenn", "Nathan", "Merle", "Darnell", "Ida", "Zach", "Louisa", "Carl", "Helene", "Priscilla", "Anthony", "Wendy", "Humphrey", "Fergus", "Malcolm", "Kane", "Cliff" ], "edges": [ [ 0, 7 ], [ 0, 2 ], [ 1, 3 ], [ 2, 6 ], [ 2, 5 ], [ 2, 4 ], [ 4, 9 ], [ 5, 8 ], [ 8, 1 ], [ 10, 17 ], [ 10, 12 ], [ 11, 13 ], [ 12, 16 ], [ 12, 15 ], [ 12, 14 ], [ 14, 19 ], [ 15, 18 ], [ 18, 11 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Alfonso knows Florence. Ben knows Charlene. Dexter knows Ingrid. Garrett knows Hank. Florence knows Norman. Oliver knows Vance. Vance knows Victoria. Vance knows Dexter. George knows Deirdre. Jake knows Garrett. George knows Ivy. Garrett knows Cole. Ivy knows Ben. Jake knows Fisher. Eva knows Jake. Dexter knows George. Cole knows Gordon. Cole knows Alfonso. Which of Jake and Vance can Eva reach?", "answer": "Jake", "steps": [ "Eva knows Jake." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Eva", "Cole", "Gordon", "Alfonso", "Norman", "Fisher", "Florence", "Jake", "Hank", "Garrett", "Oliver", "George", "Deirdre", "Ivy", "Charlene", "Victoria", "Ben", "Vance", "Ingrid", "Dexter" ], "edges": [ [ 0, 7 ], [ 1, 2 ], [ 1, 3 ], [ 3, 6 ], [ 6, 4 ], [ 7, 5 ], [ 7, 9 ], [ 9, 1 ], [ 9, 8 ], [ 10, 17 ], [ 11, 12 ], [ 11, 13 ], [ 13, 16 ], [ 16, 14 ], [ 17, 15 ], [ 17, 19 ], [ 19, 11 ], [ 19, 18 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Nicole knows Daniel. Franklin knows Lewis. Lewis knows Adam. Grady knows Willard. Laura knows Bennett. Willard knows Henry. Jacques knows Trevor. Adam knows Laura. Henry knows Ramona. Archer knows Karina. Laura knows Vernon. Cruz knows Nicole. Vernon knows Archer. Franklin knows Ingrid. Henry knows Jacques. Nicole knows Grady. Ethan knows Franklin. Trevor knows Dana. Which of Dana and Karina can Cruz reach?", "answer": "Dana", "steps": [ "Cruz knows Nicole.", "Nicole knows Grady.", "Grady knows Willard.", "Willard knows Henry.", "Henry knows Jacques.", "Jacques knows Trevor.", "Trevor knows Dana." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Cruz", "Dana", "Daniel", "Henry", "Trevor", "Ramona", "Grady", "Willard", "Nicole", "Jacques", "Ethan", "Karina", "Ingrid", "Laura", "Archer", "Bennett", "Lewis", "Adam", "Franklin", "Vernon" ], "edges": [ [ 0, 8 ], [ 3, 5 ], [ 3, 9 ], [ 4, 1 ], [ 6, 7 ], [ 7, 3 ], [ 8, 2 ], [ 8, 6 ], [ 9, 4 ], [ 10, 18 ], [ 13, 15 ], [ 13, 19 ], [ 14, 11 ], [ 16, 17 ], [ 17, 13 ], [ 18, 12 ], [ 18, 16 ], [ 19, 14 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Clark knows Arlene. Lambert knows Isadora. Hayes knows Deanna. Trudy knows Monica. Livia knows Lamont. Alan knows Livia. Trudy knows Hayes. Lamont knows Lionel. William knows Lambert. Lionel knows Trudy. William knows Liam. Sebastian knows William. Kendrick knows Sebastian. Lambert knows Hudson. Alan knows Phoebe. Arlene knows Kendrick. Hayes knows Brandon. Clark knows India. Which of Lambert and Hayes can Clark reach?", "answer": "Lambert", "steps": [ "Clark knows Arlene.", "Arlene knows Kendrick.", "Kendrick knows Sebastian.", "Sebastian knows William.", "William knows Lambert." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Clark", "Liam", "India", "Lambert", "Isadora", "Kendrick", "William", "Hudson", "Arlene", "Sebastian", "Alan", "Monica", "Phoebe", "Hayes", "Deanna", "Lamont", "Trudy", "Brandon", "Livia", "Lionel" ], "edges": [ [ 0, 2 ], [ 0, 8 ], [ 3, 4 ], [ 3, 7 ], [ 5, 9 ], [ 6, 1 ], [ 6, 3 ], [ 8, 5 ], [ 9, 6 ], [ 10, 12 ], [ 10, 18 ], [ 13, 14 ], [ 13, 17 ], [ 15, 19 ], [ 16, 11 ], [ 16, 13 ], [ 18, 15 ], [ 19, 16 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Hayden knows Louisa. Louisa knows Kelsey. Milton knows Bart. Peter knows Seth. Layla knows Keaton. Lottie knows Kerry. Amber knows Milton. Jesse knows Sally. Layla knows Joshua. Esperanza knows Darla. Lottie knows Robin. Sally knows Estella. Luella knows Jesse. Darla knows Layla. Seth knows Esperanza. Bart knows Lottie. Estella knows Amber. Kelsey knows Peter. Which of Estella and Peter can Hayden reach?", "answer": "Peter", "steps": [ "Hayden knows Louisa.", "Louisa knows Kelsey.", "Kelsey knows Peter." ], "difficulty": 3, "original_distance": 8, "idx_to_symbol": [ "Hayden", "Esperanza", "Louisa", "Peter", "Kelsey", "Joshua", "Keaton", "Darla", "Layla", "Seth", "Luella", "Milton", "Jesse", "Estella", "Sally", "Robin", "Kerry", "Bart", "Lottie", "Amber" ], "edges": [ [ 0, 2 ], [ 1, 7 ], [ 2, 4 ], [ 3, 9 ], [ 4, 3 ], [ 7, 8 ], [ 8, 5 ], [ 8, 6 ], [ 9, 1 ], [ 10, 12 ], [ 11, 17 ], [ 12, 14 ], [ 13, 19 ], [ 14, 13 ], [ 17, 18 ], [ 18, 15 ], [ 18, 16 ], [ 19, 11 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Fern knows Pierce. Adelaide knows Freya. Lisa knows Pablo. Lisa knows Dylan. Priscilla knows Eric. Fern knows Homer. Eric knows Basil. Brynn knows Jodi. Basil knows Brynn. Christian knows Adelaide. Holly knows Kelsey. Jodi knows Hubert. Brynn knows Doris. Holly knows Maureen. Brynn knows Holly. Freya knows Fern. Pierce knows Kathleen. Fern knows Lisa. Which of Eric and Adelaide can Priscilla reach?", "answer": "Eric", "steps": [ "Priscilla knows Eric." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Priscilla", "Hubert", "Jodi", "Brynn", "Holly", "Doris", "Eric", "Kelsey", "Maureen", "Basil", "Christian", "Kathleen", "Pierce", "Fern", "Lisa", "Homer", "Adelaide", "Dylan", "Pablo", "Freya" ], "edges": [ [ 0, 6 ], [ 2, 1 ], [ 3, 2 ], [ 3, 5 ], [ 3, 4 ], [ 4, 7 ], [ 4, 8 ], [ 6, 9 ], [ 9, 3 ], [ 10, 16 ], [ 12, 11 ], [ 13, 12 ], [ 13, 15 ], [ 13, 14 ], [ 14, 17 ], [ 14, 18 ], [ 16, 19 ], [ 19, 13 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Terry knows Blake. Haven knows Penny. Jolene knows Ira. Jolene knows Edison. Fritz knows Terry. Brittany knows Fritz. Bruce knows Kaleb. Haven knows Shannon. Hunter knows Brittany. Riley knows Terrence. Penny knows Livia. Blake knows Jolene. Marie knows Haven. Edison knows Elvira. Hunter knows Hannah. Terrence knows Isla. Isla knows Marie. Bruce knows Riley. Which of Blake and Marie can Hunter reach?", "answer": "Blake", "steps": [ "Hunter knows Brittany.", "Brittany knows Fritz.", "Fritz knows Terry.", "Terry knows Blake." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Hunter", "Hannah", "Brittany", "Fritz", "Jolene", "Edison", "Terry", "Blake", "Elvira", "Ira", "Bruce", "Kaleb", "Riley", "Terrence", "Haven", "Penny", "Isla", "Marie", "Livia", "Shannon" ], "edges": [ [ 0, 1 ], [ 0, 2 ], [ 2, 3 ], [ 3, 6 ], [ 4, 5 ], [ 4, 9 ], [ 5, 8 ], [ 6, 7 ], [ 7, 4 ], [ 10, 11 ], [ 10, 12 ], [ 12, 13 ], [ 13, 16 ], [ 14, 15 ], [ 14, 19 ], [ 15, 18 ], [ 16, 17 ], [ 17, 14 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Hardy knows Jeff. Sandy knows Hardy. Eleanor knows Austin. Hilda knows Aisha. Hardy knows Judy. June knows Eleanor. Allen knows Kane. Jeff knows Fergus. Judy knows Allen. Hardy knows Demetrius. Eleanor knows Louisa. Austin knows Keegan. Finn knows June. Hilda knows Sandy. Keegan knows Ronald. Finn knows Jolena. Eleanor knows Susan. Louisa knows Layla. Which of Hardy and Eleanor can Finn reach?", "answer": "Eleanor", "steps": [ "Finn knows June.", "June knows Eleanor." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Finn", "Louisa", "June", "Eleanor", "Keegan", "Susan", "Layla", "Jolena", "Ronald", "Austin", "Hilda", "Jeff", "Sandy", "Hardy", "Allen", "Demetrius", "Fergus", "Aisha", "Kane", "Judy" ], "edges": [ [ 0, 7 ], [ 0, 2 ], [ 1, 6 ], [ 2, 3 ], [ 3, 5 ], [ 3, 1 ], [ 3, 9 ], [ 4, 8 ], [ 9, 4 ], [ 10, 17 ], [ 10, 12 ], [ 11, 16 ], [ 12, 13 ], [ 13, 15 ], [ 13, 11 ], [ 13, 19 ], [ 14, 18 ], [ 19, 14 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Darren knows Grant. Tanya knows Mindy. Carl knows Hayden. Dewey knows Hayley. Finn knows Elsa. Finn knows Maggie. Mindy knows Dewey. Elsa knows Joyce. Elsa knows Jorge. Grant knows Kendrick. Alvin knows Adrian. Rosa knows Darren. Dewey knows Finn. Carl knows Rufus. Carl knows Mary. Grant knows Alvin. Alvin knows Carl. Elsa knows Gus. Which of Darren and Mindy can Tanya reach?", "answer": "Mindy", "steps": [ "Tanya knows Mindy." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Tanya", "Gus", "Elsa", "Hayley", "Joyce", "Dewey", "Finn", "Maggie", "Jorge", "Mindy", "Rosa", "Mary", "Carl", "Kendrick", "Hayden", "Grant", "Alvin", "Adrian", "Rufus", "Darren" ], "edges": [ [ 0, 9 ], [ 2, 1 ], [ 2, 4 ], [ 2, 8 ], [ 5, 3 ], [ 5, 6 ], [ 6, 7 ], [ 6, 2 ], [ 9, 5 ], [ 10, 19 ], [ 12, 11 ], [ 12, 14 ], [ 12, 18 ], [ 15, 13 ], [ 15, 16 ], [ 16, 17 ], [ 16, 12 ], [ 19, 15 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Hubert knows Vivian. Victoria knows Becky. Cornelius knows Lark. Alyssa knows Caroline. Dana knows Lorraine. Lark knows Ruth. Allen knows Hendrix. Sebastian knows Victoria. Vivian knows Tabitha. Harris knows Dana. Becky knows Eamon. Eamon knows Alyssa. Lorraine knows Lawrence. Caroline knows Chloe. Lorraine knows Cornelius. Lawrence knows Randy. Alyssa knows Hubert. Hendrix knows Harris. Which of Tabitha and Ruth can Allen reach?", "answer": "Ruth", "steps": [ "Allen knows Hendrix.", "Hendrix knows Harris.", "Harris knows Dana.", "Dana knows Lorraine.", "Lorraine knows Cornelius.", "Cornelius knows Lark.", "Lark knows Ruth." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Allen", "Lawrence", "Cornelius", "Harris", "Lark", "Dana", "Ruth", "Lorraine", "Hendrix", "Randy", "Sebastian", "Caroline", "Hubert", "Becky", "Vivian", "Eamon", "Tabitha", "Alyssa", "Victoria", "Chloe" ], "edges": [ [ 0, 8 ], [ 1, 9 ], [ 2, 4 ], [ 3, 5 ], [ 4, 6 ], [ 5, 7 ], [ 7, 2 ], [ 7, 1 ], [ 8, 3 ], [ 10, 18 ], [ 11, 19 ], [ 12, 14 ], [ 13, 15 ], [ 14, 16 ], [ 15, 17 ], [ 17, 12 ], [ 17, 11 ], [ 18, 13 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Perry knows Evan. Perry knows Bette. Cooper knows Perry. Charles knows Steve. Rosa knows Carmela. Cooper knows Vera. Vera knows Lyric. Logan knows Janice. Logan knows Lucia. Rosa knows Daniella. Lucia knows Cooper. Hayes knows Charles. Janice knows Claude. Tonya knows Haven. Hayes knows Francesca. Steve knows Tonya. Francesca knows Kelly. Steve knows Rosa. Which of Perry and Rosa can Hayes reach?", "answer": "Rosa", "steps": [ "Hayes knows Charles.", "Charles knows Steve.", "Steve knows Rosa." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Hayes", "Charles", "Tonya", "Carmela", "Haven", "Francesca", "Steve", "Rosa", "Daniella", "Kelly", "Logan", "Lucia", "Vera", "Evan", "Lyric", "Janice", "Cooper", "Perry", "Bette", "Claude" ], "edges": [ [ 0, 1 ], [ 0, 5 ], [ 1, 6 ], [ 2, 4 ], [ 5, 9 ], [ 6, 2 ], [ 6, 7 ], [ 7, 3 ], [ 7, 8 ], [ 10, 11 ], [ 10, 15 ], [ 11, 16 ], [ 12, 14 ], [ 15, 19 ], [ 16, 12 ], [ 16, 17 ], [ 17, 13 ], [ 17, 18 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Henrietta knows Janet. Brad knows Harvey. Abel knows Alan. Cole knows Brad. Emily knows Henrietta. Kamila knows Clement. Clement knows Rick. Tim knows Connor. Hailey knows Carter. Trudy knows Emily. Janet knows Jay. Carter knows Tim. Tim knows Trudy. Alan knows Shaun. Clement knows Abel. Stephanie knows Kamila. Jay knows Earle. Shaun knows Cole. Which of Tim and Clement can Hailey reach?", "answer": "Tim", "steps": [ "Hailey knows Carter.", "Carter knows Tim." ], "difficulty": 2, "original_distance": 8, "idx_to_symbol": [ "Hailey", "Connor", "Janet", "Tim", "Emily", "Earle", "Henrietta", "Trudy", "Carter", "Jay", "Stephanie", "Rick", "Cole", "Clement", "Alan", "Harvey", "Shaun", "Abel", "Kamila", "Brad" ], "edges": [ [ 0, 8 ], [ 2, 9 ], [ 3, 1 ], [ 3, 7 ], [ 4, 6 ], [ 6, 2 ], [ 7, 4 ], [ 8, 3 ], [ 9, 5 ], [ 10, 18 ], [ 12, 19 ], [ 13, 11 ], [ 13, 17 ], [ 14, 16 ], [ 16, 12 ], [ 17, 14 ], [ 18, 13 ], [ 19, 15 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Clay knows Colleen. Carla knows Atlas. Tim knows Curtis. Colleen knows Agnes. Bart knows Carla. Jessie knows Xavier. Martha knows Emmett. Carla knows Walter. Colleen knows Eldon. Atlas knows Tim. Agnes knows Eleanor. Atlas knows Basil. Lewis knows Devon. Colleen knows Lewis. Marvin knows Clay. Carla knows Jessie. Nash knows Bart. Lewis knows Martha. Which of Emmett and Curtis can Nash reach?", "answer": "Curtis", "steps": [ "Nash knows Bart.", "Bart knows Carla.", "Carla knows Atlas.", "Atlas knows Tim.", "Tim knows Curtis." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Nash", "Basil", "Xavier", "Carla", "Atlas", "Walter", "Bart", "Tim", "Jessie", "Curtis", "Marvin", "Devon", "Eleanor", "Colleen", "Lewis", "Eldon", "Clay", "Martha", "Agnes", "Emmett" ], "edges": [ [ 0, 6 ], [ 3, 5 ], [ 3, 8 ], [ 3, 4 ], [ 4, 1 ], [ 4, 7 ], [ 6, 3 ], [ 7, 9 ], [ 8, 2 ], [ 10, 16 ], [ 13, 15 ], [ 13, 18 ], [ 13, 14 ], [ 14, 11 ], [ 14, 17 ], [ 16, 13 ], [ 17, 19 ], [ 18, 12 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Jonathan knows Keira. Loretta knows Finn. Loretta knows Cody. Kara knows Duke. Regina knows Elijah. Regina knows Essie. Wallace knows Kara. Lamar knows Loretta. Kara knows Lamar. Jocelyn knows Chance. Barney knows Mae. Lamar knows Burt. Jocelyn knows Cliff. Essie knows Jocelyn. Essie knows Nancy. Regina knows Jonathan. Elvira knows Regina. Kara knows Barney. Which of Loretta and Jocelyn can Wallace reach?", "answer": "Loretta", "steps": [ "Wallace knows Kara.", "Kara knows Lamar.", "Lamar knows Loretta." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Wallace", "Duke", "Finn", "Mae", "Lamar", "Loretta", "Burt", "Kara", "Cody", "Barney", "Elvira", "Elijah", "Cliff", "Keira", "Essie", "Jocelyn", "Nancy", "Regina", "Chance", "Jonathan" ], "edges": [ [ 0, 7 ], [ 4, 6 ], [ 4, 5 ], [ 5, 2 ], [ 5, 8 ], [ 7, 1 ], [ 7, 4 ], [ 7, 9 ], [ 9, 3 ], [ 10, 17 ], [ 14, 16 ], [ 14, 15 ], [ 15, 12 ], [ 15, 18 ], [ 17, 11 ], [ 17, 14 ], [ 17, 19 ], [ 19, 13 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Maggie knows Darrell. Willis knows India. Clara knows Joseph. Cassidy knows Clara. India knows Cassidy. Joseph knows Juan. Megan knows Mabel. Mabel knows Carrie. Megan knows Marshall. Joseph knows Alvin. Theodore knows Megan. Theodore knows Jules. Clarissa knows Theodore. Mabel knows Leroy. Cassidy knows Charlene. Clara knows Maggie. Marshall knows Dirk. Riley knows Clarissa. Which of Maggie and Marshall can Riley reach?", "answer": "Marshall", "steps": [ "Riley knows Clarissa.", "Clarissa knows Theodore.", "Theodore knows Megan.", "Megan knows Marshall." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Riley", "Marshall", "Mabel", "Dirk", "Clarissa", "Leroy", "Jules", "Megan", "Carrie", "Theodore", "Willis", "Maggie", "Joseph", "Darrell", "India", "Juan", "Charlene", "Clara", "Alvin", "Cassidy" ], "edges": [ [ 0, 4 ], [ 1, 3 ], [ 2, 5 ], [ 2, 8 ], [ 4, 9 ], [ 7, 1 ], [ 7, 2 ], [ 9, 6 ], [ 9, 7 ], [ 10, 14 ], [ 11, 13 ], [ 12, 15 ], [ 12, 18 ], [ 14, 19 ], [ 17, 11 ], [ 17, 12 ], [ 19, 16 ], [ 19, 17 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Ross knows Leah. Wilson knows Alma. Cynthia knows Edgar. Riley knows Cynthia. Helene knows Donovan. Edwin knows Frankie. Donovan knows Donald. Blanche knows Autumn. Alma knows Riley. Edgar knows Keira. Kara knows Blanche. Susanne knows Elmer. Edgar knows Archer. Elmer knows Hope. Hope knows Helene. Leah knows Edwin. Donovan knows Ross. Archer knows Kara. Which of Autumn and Frankie can Wilson reach?", "answer": "Autumn", "steps": [ "Wilson knows Alma.", "Alma knows Riley.", "Riley knows Cynthia.", "Cynthia knows Edgar.", "Edgar knows Archer.", "Archer knows Kara.", "Kara knows Blanche.", "Blanche knows Autumn." ], "difficulty": 8, "original_distance": 8, "idx_to_symbol": [ "Wilson", "Riley", "Alma", "Blanche", "Archer", "Kara", "Cynthia", "Keira", "Autumn", "Edgar", "Susanne", "Hope", "Elmer", "Edwin", "Ross", "Leah", "Helene", "Donald", "Frankie", "Donovan" ], "edges": [ [ 0, 2 ], [ 1, 6 ], [ 2, 1 ], [ 3, 8 ], [ 4, 5 ], [ 5, 3 ], [ 6, 9 ], [ 9, 7 ], [ 9, 4 ], [ 10, 12 ], [ 11, 16 ], [ 12, 11 ], [ 13, 18 ], [ 14, 15 ], [ 15, 13 ], [ 16, 19 ], [ 19, 17 ], [ 19, 14 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Dennis knows Colin. Dennis knows Kareem. Ruby knows Janice. Ruby knows Duke. Hank knows Edmund. Hank knows Arthur. Dennis knows Amber. Marlene knows Camille. Marlene knows Kevin. Hailey knows Hank. Duke knows Eden. Ruby knows Hector. Clark knows Hailey. Arthur knows Emery. Amber knows Bryan. Bryan knows Ruby. Hank knows Aiden. Marlene knows Clark. Which of Arthur and Duke can Marlene reach?", "answer": "Arthur", "steps": [ "Marlene knows Clark.", "Clark knows Hailey.", "Hailey knows Hank.", "Hank knows Arthur." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Marlene", "Emery", "Camille", "Clark", "Aiden", "Arthur", "Hank", "Edmund", "Kevin", "Hailey", "Dennis", "Eden", "Colin", "Amber", "Janice", "Duke", "Ruby", "Hector", "Kareem", "Bryan" ], "edges": [ [ 0, 2 ], [ 0, 8 ], [ 0, 3 ], [ 3, 9 ], [ 5, 1 ], [ 6, 4 ], [ 6, 5 ], [ 6, 7 ], [ 9, 6 ], [ 10, 12 ], [ 10, 18 ], [ 10, 13 ], [ 13, 19 ], [ 15, 11 ], [ 16, 14 ], [ 16, 15 ], [ 16, 17 ], [ 19, 16 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Leander knows Henry. Arthur knows India. Joseph knows Delilah. Lewis knows Daniel. Martin knows Leander. Alison knows Arthur. Kendra knows Joseph. Leander knows Susan. Lewis knows Gerard. Christian knows Kieran. Delilah knows Heath. Boyd knows Christian. Arthur knows Lewis. Susan knows Fabian. Daniel knows Boyd. Joseph knows Chloe. Boyd knows Walt. Susan knows Kendra. Which of Kendra and Daniel can Alison reach?", "answer": "Daniel", "steps": [ "Alison knows Arthur.", "Arthur knows Lewis.", "Lewis knows Daniel." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Alison", "India", "Gerard", "Arthur", "Daniel", "Kieran", "Lewis", "Christian", "Walt", "Boyd", "Martin", "Henry", "Fabian", "Leander", "Kendra", "Heath", "Susan", "Delilah", "Chloe", "Joseph" ], "edges": [ [ 0, 3 ], [ 3, 1 ], [ 3, 6 ], [ 4, 9 ], [ 6, 2 ], [ 6, 4 ], [ 7, 5 ], [ 9, 7 ], [ 9, 8 ], [ 10, 13 ], [ 13, 11 ], [ 13, 16 ], [ 14, 19 ], [ 16, 12 ], [ 16, 14 ], [ 17, 15 ], [ 19, 17 ], [ 19, 18 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Cruz knows Harris. Harris knows Jenny. Mason knows Cruz. Morgan knows Kit. Mason knows Kenneth. Jacob knows Joaquin. Harris knows Dorian. Clement knows Beau. Constance knows Esme. Darius knows Max. Joaquin knows Greer. Esme knows Jose. Darius knows Jacob. Dorian knows Morgan. Gage knows Craig. Jose knows Clement. Joaquin knows Constance. Kit knows Gage. Which of Kit and Jose can Darius reach?", "answer": "Jose", "steps": [ "Darius knows Jacob.", "Jacob knows Joaquin.", "Joaquin knows Constance.", "Constance knows Esme.", "Esme knows Jose." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Darius", "Greer", "Jose", "Jacob", "Max", "Constance", "Clement", "Esme", "Beau", "Joaquin", "Mason", "Jenny", "Kit", "Cruz", "Kenneth", "Dorian", "Gage", "Morgan", "Craig", "Harris" ], "edges": [ [ 0, 4 ], [ 0, 3 ], [ 2, 6 ], [ 3, 9 ], [ 5, 7 ], [ 6, 8 ], [ 7, 2 ], [ 9, 1 ], [ 9, 5 ], [ 10, 14 ], [ 10, 13 ], [ 12, 16 ], [ 13, 19 ], [ 15, 17 ], [ 16, 18 ], [ 17, 12 ], [ 19, 11 ], [ 19, 15 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Samuel knows Rachel. Judith knows David. Zachary knows Harlan. David knows Lark. Zachary knows Desmond. Jerry knows Kylie. Jerry knows Isaac. Kylie knows Austin. David knows Samuel. Lark knows Ramona. Susan knows Cindy. Harlan knows Jerry. Judith knows Winston. Eli knows Candice. Jerry knows Susan. Harlan knows Melody. David knows Lucy. Eli knows Judith. Which of Cindy and Ramona can Zachary reach?", "answer": "Cindy", "steps": [ "Zachary knows Harlan.", "Harlan knows Jerry.", "Jerry knows Susan.", "Susan knows Cindy." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Zachary", "Desmond", "Kylie", "Austin", "Melody", "Isaac", "Jerry", "Harlan", "Susan", "Cindy", "Eli", "Candice", "Samuel", "Rachel", "Winston", "Lucy", "David", "Judith", "Lark", "Ramona" ], "edges": [ [ 0, 1 ], [ 0, 7 ], [ 2, 3 ], [ 6, 2 ], [ 6, 5 ], [ 6, 8 ], [ 7, 4 ], [ 7, 6 ], [ 8, 9 ], [ 10, 11 ], [ 10, 17 ], [ 12, 13 ], [ 16, 12 ], [ 16, 15 ], [ 16, 18 ], [ 17, 14 ], [ 17, 16 ], [ 18, 19 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Jesse knows Aria. Wendy knows Austin. Viola knows Sandy. Miranda knows Perry. Drew knows Carmela. Matthew knows Fritz. Mario knows Camden. Perry knows Jordan. Perry knows Craig. Jesse knows Daisy. Drew knows Wendy. Daisy knows Viola. Essie knows Matthew. Carmela knows Miranda. Carmela knows Mario. Aria knows Trudy. Matthew knows Cooper. Daisy knows Essie. Which of Craig and Fritz can Jesse reach?", "answer": "Fritz", "steps": [ "Jesse knows Daisy.", "Daisy knows Essie.", "Essie knows Matthew.", "Matthew knows Fritz." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Jesse", "Essie", "Sandy", "Viola", "Daisy", "Trudy", "Fritz", "Matthew", "Cooper", "Aria", "Drew", "Miranda", "Camden", "Mario", "Carmela", "Austin", "Craig", "Perry", "Jordan", "Wendy" ], "edges": [ [ 0, 4 ], [ 0, 9 ], [ 1, 7 ], [ 3, 2 ], [ 4, 3 ], [ 4, 1 ], [ 7, 6 ], [ 7, 8 ], [ 9, 5 ], [ 10, 14 ], [ 10, 19 ], [ 11, 17 ], [ 13, 12 ], [ 14, 13 ], [ 14, 11 ], [ 17, 16 ], [ 17, 18 ], [ 19, 15 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Sarah knows Natalie. Blake knows Yasmin. Lottie knows Dave. Jenna knows Mildred. Yasmin knows Judith. Declan knows Martha. August knows Patrick. Laura knows Sarah. Dave knows Geraldine. Sarah knows Carson. Patrick knows Lottie. Dean knows Lucia. Kylie knows Laura. Carson knows Declan. Martha knows Dean. Dave knows Blake. Curtis knows Kylie. Judith knows Jenna. Which of Jenna and Dean can August reach?", "answer": "Jenna", "steps": [ "August knows Patrick.", "Patrick knows Lottie.", "Lottie knows Dave.", "Dave knows Blake.", "Blake knows Yasmin.", "Yasmin knows Judith.", "Judith knows Jenna." ], "difficulty": 7, "original_distance": 8, "idx_to_symbol": [ "August", "Blake", "Judith", "Geraldine", "Dave", "Lottie", "Mildred", "Jenna", "Yasmin", "Patrick", "Curtis", "Carson", "Martha", "Natalie", "Sarah", "Laura", "Lucia", "Dean", "Declan", "Kylie" ], "edges": [ [ 0, 9 ], [ 1, 8 ], [ 2, 7 ], [ 4, 3 ], [ 4, 1 ], [ 5, 4 ], [ 7, 6 ], [ 8, 2 ], [ 9, 5 ], [ 10, 19 ], [ 11, 18 ], [ 12, 17 ], [ 14, 13 ], [ 14, 11 ], [ 15, 14 ], [ 17, 16 ], [ 18, 12 ], [ 19, 15 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Rita knows Olive. Malik knows Reid. Emma knows Theodore. Tara knows Marie. Marie knows Rita. Reid knows Damien. Corey knows Samantha. Samantha knows Malik. Tara knows Nolan. Rita knows Troy. Reid knows Edgar. Samantha knows Emma. Howard knows Tara. Troy knows Kennedy. Nolan knows Vanessa. Edgar knows Elijah. Emma knows Ezra. Nolan knows Adele. Which of Reid and Rita can Howard reach?", "answer": "Rita", "steps": [ "Howard knows Tara.", "Tara knows Marie.", "Marie knows Rita." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Howard", "Rita", "Tara", "Nolan", "Marie", "Vanessa", "Adele", "Olive", "Kennedy", "Troy", "Corey", "Reid", "Samantha", "Emma", "Malik", "Theodore", "Ezra", "Damien", "Elijah", "Edgar" ], "edges": [ [ 0, 2 ], [ 1, 7 ], [ 1, 9 ], [ 2, 3 ], [ 2, 4 ], [ 3, 5 ], [ 3, 6 ], [ 4, 1 ], [ 9, 8 ], [ 10, 12 ], [ 11, 17 ], [ 11, 19 ], [ 12, 13 ], [ 12, 14 ], [ 13, 15 ], [ 13, 16 ], [ 14, 11 ], [ 19, 18 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Tyler knows Regina. Alfonso knows Greg. Patrick knows Tyler. Regina knows Etta. Russell knows Seth. Deirdre knows Hayley. Etta knows Raquel. Frances knows Alfonso. Regina knows Russell. Alfonso knows Bob. Axel knows Lars. Deirdre knows Frances. Patrick knows Blair. Hayley knows Miranda. Raquel knows Cara. Raquel knows Winifred. Lars knows Deirdre. Axel knows Jordan. Which of Lars and Tyler can Patrick reach?", "answer": "Tyler", "steps": [ "Patrick knows Tyler." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Patrick", "Russell", "Tyler", "Cara", "Seth", "Regina", "Etta", "Raquel", "Winifred", "Blair", "Axel", "Hayley", "Lars", "Bob", "Miranda", "Deirdre", "Frances", "Alfonso", "Greg", "Jordan" ], "edges": [ [ 0, 2 ], [ 0, 9 ], [ 1, 4 ], [ 2, 5 ], [ 5, 1 ], [ 5, 6 ], [ 6, 7 ], [ 7, 3 ], [ 7, 8 ], [ 10, 12 ], [ 10, 19 ], [ 11, 14 ], [ 12, 15 ], [ 15, 11 ], [ 15, 16 ], [ 16, 17 ], [ 17, 13 ], [ 17, 18 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Mary knows Callum. Joanna knows Eve. Lane knows Anastasia. Lennox knows Gladys. Burt knows Karen. Cordelia knows Lennox. Anastasia knows Burt. Callum knows Hamilton. Joanna knows Antonio. Lennox knows Cristina. Anastasia knows Jeremiah. Karen knows Leander. Annie knows Lisa. Annie knows Guillermo. Karen knows Jewel. Callum knows Cordelia. Cristina knows Joanna. Leander knows Annie. Which of Lisa and Antonio can Mary reach?", "answer": "Antonio", "steps": [ "Mary knows Callum.", "Callum knows Cordelia.", "Cordelia knows Lennox.", "Lennox knows Cristina.", "Cristina knows Joanna.", "Joanna knows Antonio." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Mary", "Lennox", "Antonio", "Eve", "Cristina", "Hamilton", "Joanna", "Gladys", "Cordelia", "Callum", "Lane", "Karen", "Lisa", "Guillermo", "Leander", "Jeremiah", "Annie", "Jewel", "Burt", "Anastasia" ], "edges": [ [ 0, 9 ], [ 1, 4 ], [ 1, 7 ], [ 4, 6 ], [ 6, 2 ], [ 6, 3 ], [ 8, 1 ], [ 9, 5 ], [ 9, 8 ], [ 10, 19 ], [ 11, 14 ], [ 11, 17 ], [ 14, 16 ], [ 16, 12 ], [ 16, 13 ], [ 18, 11 ], [ 19, 15 ], [ 19, 18 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Faith knows Charles. Isadora knows Yasmin. Tony knows Theodore. Bella knows Thea. Faith knows Vance. Yasmin knows Faith. Fraser knows Basil. Yasmin knows Lola. Basil knows Vincent. Thea knows Bonnie. Fraser knows Whitney. Bonnie knows Fraser. Isadora knows Will. Faith knows Tony. Fraser knows Jeremiah. Bonnie knows Jack. Anastasia knows Isadora. Thea knows Hank. Which of Thea and Isadora can Bella reach?", "answer": "Thea", "steps": [ "Bella knows Thea." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Bella", "Hank", "Fraser", "Thea", "Basil", "Whitney", "Vincent", "Jack", "Jeremiah", "Bonnie", "Anastasia", "Will", "Faith", "Isadora", "Tony", "Charles", "Theodore", "Lola", "Vance", "Yasmin" ], "edges": [ [ 0, 3 ], [ 2, 5 ], [ 2, 4 ], [ 2, 8 ], [ 3, 1 ], [ 3, 9 ], [ 4, 6 ], [ 9, 7 ], [ 9, 2 ], [ 10, 13 ], [ 12, 15 ], [ 12, 14 ], [ 12, 18 ], [ 13, 11 ], [ 13, 19 ], [ 14, 16 ], [ 19, 17 ], [ 19, 12 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Flora knows Lucia. Russell knows Owen. Neal knows Desmond. Zara knows Bonnie. Bonnie knows Dana. Maria knows Flora. Livia knows Katrina. Martin knows Maria. Knox knows Charles. Owen knows Livia. Bonnie knows Allan. Livia knows Peggy. Katrina knows Neal. Knox knows Zara. Desmond knows Will. Dana knows Martin. Russell knows Chelsea. Will knows Colin. Which of Zara and Owen can Knox reach?", "answer": "Zara", "steps": [ "Knox knows Zara." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Knox", "Flora", "Allan", "Dana", "Bonnie", "Zara", "Maria", "Lucia", "Charles", "Martin", "Russell", "Will", "Peggy", "Katrina", "Livia", "Owen", "Desmond", "Colin", "Chelsea", "Neal" ], "edges": [ [ 0, 8 ], [ 0, 5 ], [ 1, 7 ], [ 3, 9 ], [ 4, 2 ], [ 4, 3 ], [ 5, 4 ], [ 6, 1 ], [ 9, 6 ], [ 10, 18 ], [ 10, 15 ], [ 11, 17 ], [ 13, 19 ], [ 14, 12 ], [ 14, 13 ], [ 15, 14 ], [ 16, 11 ], [ 19, 16 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Fergus knows Guillermo. Fergus knows Aiden. Ivan knows Israel. Ivan knows Fergus. Duke knows Ilene. Camden knows Val. Renee knows Fleur. Duke knows Gabriel. Fleur knows Jude. Israel knows Duke. Fergus knows Katrina. Renee knows Camden. Val knows Eileen. Fleur knows Latoya. Gabriel knows Miles. Jem knows Dora. Fleur knows Cindy. Val knows Jem. Which of Miles and Dora can Ivan reach?", "answer": "Miles", "steps": [ "Ivan knows Israel.", "Israel knows Duke.", "Duke knows Gabriel.", "Gabriel knows Miles." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Ivan", "Duke", "Gabriel", "Fergus", "Miles", "Ilene", "Katrina", "Aiden", "Israel", "Guillermo", "Renee", "Val", "Jem", "Fleur", "Dora", "Eileen", "Latoya", "Jude", "Camden", "Cindy" ], "edges": [ [ 0, 8 ], [ 0, 3 ], [ 1, 2 ], [ 1, 5 ], [ 2, 4 ], [ 3, 6 ], [ 3, 7 ], [ 3, 9 ], [ 8, 1 ], [ 10, 18 ], [ 10, 13 ], [ 11, 12 ], [ 11, 15 ], [ 12, 14 ], [ 13, 16 ], [ 13, 17 ], [ 13, 19 ], [ 18, 11 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Opal knows Victor. Norman knows Nash. Opal knows Clark. Linda knows India. Tristan knows Fern. India knows Janelle. Davis knows Shelby. Harriet knows Cruz. India knows Lee. Fern knows Sybil. Janelle knows Ricardo. Davis knows Harriet. Shaun knows Linda. Shaun knows Conner. Davis knows Tristan. Shaun knows Norman. Fern knows Opal. Janelle knows Miriam. Which of Clark and Ricardo can Shaun reach?", "answer": "Ricardo", "steps": [ "Shaun knows Linda.", "Linda knows India.", "India knows Janelle.", "Janelle knows Ricardo." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Shaun", "Ricardo", "Miriam", "India", "Nash", "Lee", "Linda", "Conner", "Janelle", "Norman", "Davis", "Clark", "Victor", "Fern", "Cruz", "Sybil", "Tristan", "Shelby", "Opal", "Harriet" ], "edges": [ [ 0, 7 ], [ 0, 6 ], [ 0, 9 ], [ 3, 5 ], [ 3, 8 ], [ 6, 3 ], [ 8, 1 ], [ 8, 2 ], [ 9, 4 ], [ 10, 17 ], [ 10, 16 ], [ 10, 19 ], [ 13, 15 ], [ 13, 18 ], [ 16, 13 ], [ 18, 11 ], [ 18, 12 ], [ 19, 14 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Etta knows Todd. Dean knows Jillian. Denise knows Harrison. Fern knows Lance. Fern knows Arturo. Lance knows Gustavo. Gustavo knows Trina. Jack knows Denise. Denise knows Kate. Fern knows Glenda. Etta knows Fern. Dean knows Cooper. Harrison knows Dean. Kate knows Darcy. Glenda knows Trevor. Gustavo knows Tina. Denise knows Keegan. Jack knows Gerald. Which of Lance and Harrison can Jack reach?", "answer": "Harrison", "steps": [ "Jack knows Denise.", "Denise knows Harrison." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Jack", "Darcy", "Keegan", "Denise", "Harrison", "Dean", "Jillian", "Cooper", "Gerald", "Kate", "Etta", "Trevor", "Arturo", "Fern", "Lance", "Gustavo", "Trina", "Tina", "Todd", "Glenda" ], "edges": [ [ 0, 8 ], [ 0, 3 ], [ 3, 2 ], [ 3, 4 ], [ 3, 9 ], [ 4, 5 ], [ 5, 6 ], [ 5, 7 ], [ 9, 1 ], [ 10, 18 ], [ 10, 13 ], [ 13, 12 ], [ 13, 14 ], [ 13, 19 ], [ 14, 15 ], [ 15, 16 ], [ 15, 17 ], [ 19, 11 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Brent knows Cruz. Bella knows Pat. Darla knows Brent. Shaun knows Eleanor. Eleanor knows Parker. Parker knows Vera. Mitchell knows Marion. Boyd knows Todd. Cruz knows Rose. Marion knows Leonard. Darla knows Sam. Rose knows Garland. Todd knows Neil. Bella knows Boyd. Shaun knows Katherine. Garland knows Mitchell. Neil knows Shaun. Garland knows Brian. Which of Parker and Marion can Darla reach?", "answer": "Marion", "steps": [ "Darla knows Brent.", "Brent knows Cruz.", "Cruz knows Rose.", "Rose knows Garland.", "Garland knows Mitchell.", "Mitchell knows Marion." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Darla", "Mitchell", "Leonard", "Marion", "Brian", "Cruz", "Brent", "Rose", "Garland", "Sam", "Bella", "Eleanor", "Vera", "Parker", "Katherine", "Todd", "Boyd", "Neil", "Shaun", "Pat" ], "edges": [ [ 0, 6 ], [ 0, 9 ], [ 1, 3 ], [ 3, 2 ], [ 5, 7 ], [ 6, 5 ], [ 7, 8 ], [ 8, 1 ], [ 8, 4 ], [ 10, 16 ], [ 10, 19 ], [ 11, 13 ], [ 13, 12 ], [ 15, 17 ], [ 16, 15 ], [ 17, 18 ], [ 18, 11 ], [ 18, 14 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Neil knows Jessie. Jessie knows Val. Carol knows Eileen. Neil knows Jack. Yuki knows Owen. Ron knows Carmela. Jack knows Carol. Carmela knows Katrina. Arlene knows Ricardo. Colin knows Ron. Beth knows Jem. Ron knows Arlene. Jack knows Beth. Carmela knows Samantha. Carmela knows Yuki. Jack knows Cora. Darwin knows Neil. Katrina knows Bernard. Which of Beth and Katrina can Darwin reach?", "answer": "Beth", "steps": [ "Darwin knows Neil.", "Neil knows Jack.", "Jack knows Beth." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Darwin", "Val", "Jack", "Neil", "Jem", "Carol", "Beth", "Eileen", "Cora", "Jessie", "Colin", "Ricardo", "Carmela", "Ron", "Bernard", "Yuki", "Katrina", "Owen", "Samantha", "Arlene" ], "edges": [ [ 0, 3 ], [ 2, 6 ], [ 2, 5 ], [ 2, 8 ], [ 3, 2 ], [ 3, 9 ], [ 5, 7 ], [ 6, 4 ], [ 9, 1 ], [ 10, 13 ], [ 12, 16 ], [ 12, 15 ], [ 12, 18 ], [ 13, 12 ], [ 13, 19 ], [ 15, 17 ], [ 16, 14 ], [ 19, 11 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Oscar knows Marcia. Judy knows Otto. Julie knows Fraser. Lorraine knows Colette. Gunnar knows Oscar. Derek knows Nora. Gunnar knows Derek. Lorraine knows Morgan. Julie knows Brooke. Electra knows Blake. Monica knows Lorraine. Derek knows Sydney. Judy knows Cooper. Blake knows Porter. Electra knows Julie. Sydney knows Monica. Brooke knows Joan. Joan knows Judy. Which of Brooke and Sydney can Electra reach?", "answer": "Brooke", "steps": [ "Electra knows Julie.", "Julie knows Brooke." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Electra", "Fraser", "Brooke", "Judy", "Blake", "Porter", "Otto", "Julie", "Joan", "Cooper", "Gunnar", "Nora", "Sydney", "Lorraine", "Oscar", "Marcia", "Colette", "Derek", "Monica", "Morgan" ], "edges": [ [ 0, 4 ], [ 0, 7 ], [ 2, 8 ], [ 3, 6 ], [ 3, 9 ], [ 4, 5 ], [ 7, 1 ], [ 7, 2 ], [ 8, 3 ], [ 10, 14 ], [ 10, 17 ], [ 12, 18 ], [ 13, 16 ], [ 13, 19 ], [ 14, 15 ], [ 17, 11 ], [ 17, 12 ], [ 18, 13 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Tina knows Gene. Jonah knows Tina. Dale knows Shannon. Tina knows Dale. Hannah knows June. Corey knows Courtney. Cesar knows Hannah. Gene knows Archie. Miranda knows Jonah. June knows Cooper. Jenna knows Jorge. Miranda knows Jameson. Gene knows Dexter. Cesar knows Glen. Cooper knows Connor. Jenna knows Corey. Dexter knows Audrey. June knows Jenna. Which of Tina and June can Miranda reach?", "answer": "Tina", "steps": [ "Miranda knows Jonah.", "Jonah knows Tina." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Miranda", "Tina", "Shannon", "Jonah", "Dexter", "Audrey", "Gene", "Dale", "Jameson", "Archie", "Cesar", "June", "Connor", "Hannah", "Corey", "Courtney", "Jenna", "Cooper", "Glen", "Jorge" ], "edges": [ [ 0, 8 ], [ 0, 3 ], [ 1, 7 ], [ 1, 6 ], [ 3, 1 ], [ 4, 5 ], [ 6, 4 ], [ 6, 9 ], [ 7, 2 ], [ 10, 18 ], [ 10, 13 ], [ 11, 17 ], [ 11, 16 ], [ 13, 11 ], [ 14, 15 ], [ 16, 14 ], [ 16, 19 ], [ 17, 12 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Adele knows Erwin. Pearl knows Paula. Florence knows Kent. Calvin knows Billy. Casey knows Tabitha. Darla knows Peggy. Peter knows Florence. Billy knows Maude. Paula knows Casey. Erwin knows Marvin. Kent knows Angela. Marvin knows Calvin. Angela knows Julius. Shelby knows Ivy. Peggy knows Adele. Rex knows Pearl. Tabitha knows Peter. Maude knows Shelby. Which of Ivy and Julius can Darla reach?", "answer": "Ivy", "steps": [ "Darla knows Peggy.", "Peggy knows Adele.", "Adele knows Erwin.", "Erwin knows Marvin.", "Marvin knows Calvin.", "Calvin knows Billy.", "Billy knows Maude.", "Maude knows Shelby.", "Shelby knows Ivy." ], "difficulty": 9, "original_distance": 9, "idx_to_symbol": [ "Darla", "Adele", "Calvin", "Peggy", "Maude", "Marvin", "Shelby", "Erwin", "Ivy", "Billy", "Rex", "Paula", "Peter", "Pearl", "Kent", "Tabitha", "Angela", "Casey", "Julius", "Florence" ], "edges": [ [ 0, 3 ], [ 1, 7 ], [ 2, 9 ], [ 3, 1 ], [ 4, 6 ], [ 5, 2 ], [ 6, 8 ], [ 7, 5 ], [ 9, 4 ], [ 10, 13 ], [ 11, 17 ], [ 12, 19 ], [ 13, 11 ], [ 14, 16 ], [ 15, 12 ], [ 16, 18 ], [ 17, 15 ], [ 19, 14 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Leon knows Richard. Carrie knows Eldon. Carrie knows Freya. Conrad knows Zoe. Eldon knows Marian. Inez knows Leon. Dahlia knows Beatrice. Kieran knows Erma. Emery knows Vincent. Beatrice knows Kieran. Frankie knows Emery. Erma knows Goldie. Richard knows Bailey. Dahlia knows Conrad. Marian knows Neal. Freya knows Yolanda. Goldie knows Frankie. Neal knows Inez. Which of Goldie and Inez can Dahlia reach?", "answer": "Goldie", "steps": [ "Dahlia knows Beatrice.", "Beatrice knows Kieran.", "Kieran knows Erma.", "Erma knows Goldie." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Dahlia", "Erma", "Conrad", "Goldie", "Kieran", "Beatrice", "Emery", "Vincent", "Zoe", "Frankie", "Carrie", "Neal", "Freya", "Inez", "Marian", "Eldon", "Richard", "Bailey", "Yolanda", "Leon" ], "edges": [ [ 0, 2 ], [ 0, 5 ], [ 1, 3 ], [ 2, 8 ], [ 3, 9 ], [ 4, 1 ], [ 5, 4 ], [ 6, 7 ], [ 9, 6 ], [ 10, 12 ], [ 10, 15 ], [ 11, 13 ], [ 12, 18 ], [ 13, 19 ], [ 14, 11 ], [ 15, 14 ], [ 16, 17 ], [ 19, 16 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Ethan knows Odette. Trevor knows Francesca. Ethan knows Fisher. Trevor knows Miranda. Ian knows Kirk. Russ knows Ethan. Emma knows Heidi. Francesca knows Barney. Ethan knows Daisy. Emma knows Livia. Emma knows Ian. Lars knows Russ. Dale knows Emma. Javier knows Fritz. Lars knows Bart. Odette knows Antonio. Trevor knows Dale. Lars knows Javier. Which of Antonio and Kirk can Lars reach?", "answer": "Antonio", "steps": [ "Lars knows Russ.", "Russ knows Ethan.", "Ethan knows Odette.", "Odette knows Antonio." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Lars", "Fritz", "Antonio", "Bart", "Odette", "Javier", "Russ", "Fisher", "Daisy", "Ethan", "Trevor", "Barney", "Kirk", "Miranda", "Ian", "Francesca", "Dale", "Livia", "Heidi", "Emma" ], "edges": [ [ 0, 3 ], [ 0, 5 ], [ 0, 6 ], [ 4, 2 ], [ 5, 1 ], [ 6, 9 ], [ 9, 4 ], [ 9, 7 ], [ 9, 8 ], [ 10, 13 ], [ 10, 15 ], [ 10, 16 ], [ 14, 12 ], [ 15, 11 ], [ 16, 19 ], [ 19, 14 ], [ 19, 17 ], [ 19, 18 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Lambert knows Hailey. Hattie knows Zach. Hattie knows Jay. Anton knows Perry. Lillian knows Aaron. Aaron knows Hayley. Martha knows Lillian. Anton knows Gordon. Wanda knows Alexa. Laverne knows Lambert. Elizabeth knows Hattie. Jay knows Laverne. Gordon knows Lenora. Laverne knows Bart. Aaron knows Wanda. Jay knows Shaun. Rosa knows Elizabeth. Wanda knows Anton. Which of Hailey and Lenora can Rosa reach?", "answer": "Hailey", "steps": [ "Rosa knows Elizabeth.", "Elizabeth knows Hattie.", "Hattie knows Jay.", "Jay knows Laverne.", "Laverne knows Lambert.", "Lambert knows Hailey." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Rosa", "Jay", "Lambert", "Laverne", "Hattie", "Hailey", "Shaun", "Bart", "Elizabeth", "Zach", "Martha", "Wanda", "Gordon", "Anton", "Aaron", "Lenora", "Alexa", "Perry", "Lillian", "Hayley" ], "edges": [ [ 0, 8 ], [ 1, 6 ], [ 1, 3 ], [ 2, 5 ], [ 3, 2 ], [ 3, 7 ], [ 4, 1 ], [ 4, 9 ], [ 8, 4 ], [ 10, 18 ], [ 11, 16 ], [ 11, 13 ], [ 12, 15 ], [ 13, 12 ], [ 13, 17 ], [ 14, 11 ], [ 14, 19 ], [ 18, 14 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Freya knows Everett. Gonzalo knows Hardy. Freya knows Kay. Morgan knows Houston. Hannah knows Elton. Will knows Evelyn. Everett knows Hannah. Hardy knows Morgan. Beverly knows Harper. Zach knows Preston. Morgan knows Beth. Kay knows Beverly. Walt knows Katherine. Gonzalo knows Zach. Preston knows Will. Elton knows Diana. Beverly knows Walt. Houston knows Herbert. Which of Houston and Walt can Freya reach?", "answer": "Walt", "steps": [ "Freya knows Kay.", "Kay knows Beverly.", "Beverly knows Walt." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Freya", "Beverly", "Kay", "Diana", "Everett", "Harper", "Walt", "Elton", "Katherine", "Hannah", "Gonzalo", "Morgan", "Hardy", "Evelyn", "Zach", "Beth", "Houston", "Will", "Herbert", "Preston" ], "edges": [ [ 0, 2 ], [ 0, 4 ], [ 1, 5 ], [ 1, 6 ], [ 2, 1 ], [ 4, 9 ], [ 6, 8 ], [ 7, 3 ], [ 9, 7 ], [ 10, 12 ], [ 10, 14 ], [ 11, 15 ], [ 11, 16 ], [ 12, 11 ], [ 14, 19 ], [ 16, 18 ], [ 17, 13 ], [ 19, 17 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Freya knows Arnold. Dorothy knows Jeanne. Lillian knows Max. Arnold knows Anthony. Max knows Val. Aaron knows Megan. Megan knows Rose. Renee knows Valerie. Trudy knows Renee. Eric knows Norman. Angela knows Allan. Norman knows Marion. Val knows Otto. Anthony knows Dorothy. Arnold knows Angela. Dorothy knows Eric. Max knows Aaron. Megan knows Trudy. Which of Valerie and Marion can Freya reach?", "answer": "Marion", "steps": [ "Freya knows Arnold.", "Arnold knows Anthony.", "Anthony knows Dorothy.", "Dorothy knows Eric.", "Eric knows Norman.", "Norman knows Marion." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Freya", "Arnold", "Eric", "Allan", "Angela", "Jeanne", "Dorothy", "Anthony", "Norman", "Marion", "Lillian", "Max", "Trudy", "Otto", "Val", "Rose", "Megan", "Aaron", "Renee", "Valerie" ], "edges": [ [ 0, 1 ], [ 1, 4 ], [ 1, 7 ], [ 2, 8 ], [ 4, 3 ], [ 6, 5 ], [ 6, 2 ], [ 7, 6 ], [ 8, 9 ], [ 10, 11 ], [ 11, 14 ], [ 11, 17 ], [ 12, 18 ], [ 14, 13 ], [ 16, 15 ], [ 16, 12 ], [ 17, 16 ], [ 18, 19 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Felicia knows Clinton. Carmen knows Felicia. Elliot knows Clifford. Stefan knows Elliot. Monica knows Destiny. Darwin knows Monica. Destiny knows Chase. Fraser knows Kara. Kara knows Alfonso. Lena knows Colette. Fraser knows Yara. Yara knows Florence. Florence knows Dolores. Wilma knows Lena. Yara knows Darwin. Colette knows Howard. Stefan knows Carmen. Carmen knows Wilma. Which of Chase and Howard can Stefan reach?", "answer": "Howard", "steps": [ "Stefan knows Carmen.", "Carmen knows Wilma.", "Wilma knows Lena.", "Lena knows Colette.", "Colette knows Howard." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Stefan", "Carmen", "Colette", "Felicia", "Clifford", "Wilma", "Lena", "Howard", "Elliot", "Clinton", "Fraser", "Yara", "Destiny", "Florence", "Alfonso", "Darwin", "Monica", "Chase", "Kara", "Dolores" ], "edges": [ [ 0, 8 ], [ 0, 1 ], [ 1, 5 ], [ 1, 3 ], [ 2, 7 ], [ 3, 9 ], [ 5, 6 ], [ 6, 2 ], [ 8, 4 ], [ 10, 18 ], [ 10, 11 ], [ 11, 15 ], [ 11, 13 ], [ 12, 17 ], [ 13, 19 ], [ 15, 16 ], [ 16, 12 ], [ 18, 14 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Alejandro knows Verna. Emery knows Delilah. Gary knows Arthur. Emery knows Sue. Arthur knows Louise. Verna knows Essie. Edith knows Sonia. Sue knows Gary. Drake knows Alejandro. Alejandro knows Edith. Hilda knows Julio. Delilah knows Bernice. Arthur knows Graeme. Sonia knows Hilda. Donald knows Emery. Hilda knows Jonas. Hilda knows Hal. Arthur knows David. Which of Hilda and Arthur can Donald reach?", "answer": "Arthur", "steps": [ "Donald knows Emery.", "Emery knows Sue.", "Sue knows Gary.", "Gary knows Arthur." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Donald", "Arthur", "Sue", "David", "Bernice", "Gary", "Graeme", "Louise", "Delilah", "Emery", "Drake", "Hilda", "Edith", "Jonas", "Essie", "Sonia", "Hal", "Julio", "Verna", "Alejandro" ], "edges": [ [ 0, 9 ], [ 1, 3 ], [ 1, 6 ], [ 1, 7 ], [ 2, 5 ], [ 5, 1 ], [ 8, 4 ], [ 9, 2 ], [ 9, 8 ], [ 10, 19 ], [ 11, 13 ], [ 11, 16 ], [ 11, 17 ], [ 12, 15 ], [ 15, 11 ], [ 18, 14 ], [ 19, 12 ], [ 19, 18 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Louis knows Andrea. Doug knows Louis. Chris knows Noah. Noah knows Duncan. Trevor knows Morris. Hardy knows Dina. Hardy knows Tamara. Aspen knows Duke. Trevor knows Geoffrey. Chandler knows Dorothy. Louis knows Hardy. Chris knows Trevor. Virgil knows Doug. Duke knows Cordelia. Andrea knows Miriam. Cordelia knows Chris. Chandler knows Virgil. Aspen knows Delia. Which of Louis and Chris can Chandler reach?", "answer": "Louis", "steps": [ "Chandler knows Virgil.", "Virgil knows Doug.", "Doug knows Louis." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Chandler", "Dina", "Doug", "Tamara", "Andrea", "Miriam", "Virgil", "Louis", "Hardy", "Dorothy", "Aspen", "Morris", "Cordelia", "Geoffrey", "Noah", "Duncan", "Duke", "Chris", "Trevor", "Delia" ], "edges": [ [ 0, 6 ], [ 0, 9 ], [ 2, 7 ], [ 4, 5 ], [ 6, 2 ], [ 7, 4 ], [ 7, 8 ], [ 8, 1 ], [ 8, 3 ], [ 10, 16 ], [ 10, 19 ], [ 12, 17 ], [ 14, 15 ], [ 16, 12 ], [ 17, 14 ], [ 17, 18 ], [ 18, 11 ], [ 18, 13 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Luke knows Javier. Zoe knows Greg. Kylie knows Cecilia. Daniella knows Kylie. Tristan knows Daniella. Javier knows Zoe. Keaton knows Emily. Keaton knows Gavin. Rosa knows Tristan. Emily knows Luke. Luke knows Eunice. Leopold knows Michael. Cecilia knows Leopold. Kylie knows Devon. Luke knows Damien. Tristan knows Caleb. Ken knows Keaton. Kylie knows Lottie. Which of Emily and Daniella can Rosa reach?", "answer": "Daniella", "steps": [ "Rosa knows Tristan.", "Tristan knows Daniella." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Rosa", "Lottie", "Tristan", "Leopold", "Kylie", "Daniella", "Michael", "Cecilia", "Caleb", "Devon", "Ken", "Eunice", "Keaton", "Zoe", "Luke", "Emily", "Greg", "Javier", "Gavin", "Damien" ], "edges": [ [ 0, 2 ], [ 2, 8 ], [ 2, 5 ], [ 3, 6 ], [ 4, 1 ], [ 4, 7 ], [ 4, 9 ], [ 5, 4 ], [ 7, 3 ], [ 10, 12 ], [ 12, 18 ], [ 12, 15 ], [ 13, 16 ], [ 14, 11 ], [ 14, 17 ], [ 14, 19 ], [ 15, 14 ], [ 17, 13 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Darren knows Grant. Tanya knows Mindy. Carl knows Hayden. Dewey knows Hayley. Finn knows Elsa. Finn knows Maggie. Mindy knows Dewey. Elsa knows Joyce. Elsa knows Jorge. Grant knows Kendrick. Alvin knows Adrian. Rosa knows Darren. Dewey knows Finn. Carl knows Rufus. Carl knows Mary. Grant knows Alvin. Alvin knows Carl. Elsa knows Gus. Which of Elsa and Carl can Tanya reach?", "answer": "Elsa", "steps": [ "Tanya knows Mindy.", "Mindy knows Dewey.", "Dewey knows Finn.", "Finn knows Elsa." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Tanya", "Gus", "Elsa", "Hayley", "Joyce", "Dewey", "Finn", "Maggie", "Jorge", "Mindy", "Rosa", "Mary", "Carl", "Kendrick", "Hayden", "Grant", "Alvin", "Adrian", "Rufus", "Darren" ], "edges": [ [ 0, 9 ], [ 2, 1 ], [ 2, 4 ], [ 2, 8 ], [ 5, 3 ], [ 5, 6 ], [ 6, 7 ], [ 6, 2 ], [ 9, 5 ], [ 10, 19 ], [ 12, 11 ], [ 12, 14 ], [ 12, 18 ], [ 15, 13 ], [ 15, 16 ], [ 16, 17 ], [ 16, 12 ], [ 19, 15 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Jeffery knows Enrique. Aubrey knows Benjamin. Dane knows Aubrey. Keith knows Abel. Abel knows Louisa. Wendy knows Freya. Devon knows Dane. Keith knows Graeme. Aubrey knows Wendy. Benjamin knows Sheila. Aubrey knows Simon. Kylie knows Albert. Wendy knows Julian. Abel knows Karina. Sheila knows Kira. Albert knows Marlene. Enrique knows Keith. Keith knows Kylie. Which of Albert and Sheila can Jeffery reach?", "answer": "Albert", "steps": [ "Jeffery knows Enrique.", "Enrique knows Keith.", "Keith knows Kylie.", "Kylie knows Albert." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Jeffery", "Graeme", "Enrique", "Abel", "Albert", "Kylie", "Karina", "Marlene", "Louisa", "Keith", "Devon", "Simon", "Dane", "Wendy", "Sheila", "Benjamin", "Freya", "Kira", "Julian", "Aubrey" ], "edges": [ [ 0, 2 ], [ 2, 9 ], [ 3, 6 ], [ 3, 8 ], [ 4, 7 ], [ 5, 4 ], [ 9, 1 ], [ 9, 5 ], [ 9, 3 ], [ 10, 12 ], [ 12, 19 ], [ 13, 16 ], [ 13, 18 ], [ 14, 17 ], [ 15, 14 ], [ 19, 11 ], [ 19, 15 ], [ 19, 13 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Jerry knows Heath. Annie knows Mary. Edwin knows Erma. Hampton knows Lennox. Bonnie knows Nathan. Nicole knows Tanya. Nathan knows Lucy. Bonnie knows Jacqueline. Nicole knows Elton. Heath knows Edwin. Hampton knows Edna. Jacqueline knows Ibrahim. Tanya knows Bonnie. Edwin knows Hampton. Elton knows Mason. Jerry knows Annie. Erma knows April. Nathan knows Hunter. Which of Bonnie and Edwin can Nicole reach?", "answer": "Bonnie", "steps": [ "Nicole knows Tanya.", "Tanya knows Bonnie." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Nicole", "Ibrahim", "Bonnie", "Hunter", "Tanya", "Jacqueline", "Nathan", "Mason", "Elton", "Lucy", "Jerry", "April", "Edwin", "Edna", "Heath", "Erma", "Hampton", "Mary", "Annie", "Lennox" ], "edges": [ [ 0, 8 ], [ 0, 4 ], [ 2, 5 ], [ 2, 6 ], [ 4, 2 ], [ 5, 1 ], [ 6, 3 ], [ 6, 9 ], [ 8, 7 ], [ 10, 18 ], [ 10, 14 ], [ 12, 15 ], [ 12, 16 ], [ 14, 12 ], [ 15, 11 ], [ 16, 13 ], [ 16, 19 ], [ 18, 17 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Veronica knows Dell. Forrest knows Keegan. Barney knows Claudia. Lara knows Chloe. Dell knows Yvette. Chloe knows Paige. Yvette knows Margaret. Keegan knows Barney. Claudia knows Nina. Hope knows Mason. Courtney knows Hope. Claudia knows Courtney. Forrest knows Lamar. Eva knows Jeff. Jeff knows Veronica. Jeff knows Winston. Yvette knows Lara. Dale knows Forrest. Which of Keegan and Veronica can Dale reach?", "answer": "Keegan", "steps": [ "Dale knows Forrest.", "Forrest knows Keegan." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Dale", "Courtney", "Lamar", "Claudia", "Mason", "Keegan", "Barney", "Hope", "Nina", "Forrest", "Eva", "Lara", "Winston", "Yvette", "Paige", "Veronica", "Dell", "Chloe", "Margaret", "Jeff" ], "edges": [ [ 0, 9 ], [ 1, 7 ], [ 3, 1 ], [ 3, 8 ], [ 5, 6 ], [ 6, 3 ], [ 7, 4 ], [ 9, 2 ], [ 9, 5 ], [ 10, 19 ], [ 11, 17 ], [ 13, 11 ], [ 13, 18 ], [ 15, 16 ], [ 16, 13 ], [ 17, 14 ], [ 19, 12 ], [ 19, 15 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Hayden knows Lorraine. Gabe knows Wesley. Felix knows Juan. Harris knows Robert. Brooke knows Ellen. Sydney knows Herman. Wesley knows Felix. Sydney knows Gabe. Lara knows Lydia. Ellen knows Clayton. Herman knows Lara. Harley knows Brooke. Harris knows Harley. Lydia knows Otto. Ellen knows Glenda. Felix knows Simon. Arturo knows Hayden. Robert knows Arturo. Which of Ellen and Felix can Sydney reach?", "answer": "Felix", "steps": [ "Sydney knows Gabe.", "Gabe knows Wesley.", "Wesley knows Felix." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Sydney", "Lara", "Juan", "Lydia", "Wesley", "Herman", "Simon", "Felix", "Gabe", "Otto", "Harris", "Arturo", "Clayton", "Hayden", "Brooke", "Robert", "Glenda", "Ellen", "Harley", "Lorraine" ], "edges": [ [ 0, 8 ], [ 0, 5 ], [ 1, 3 ], [ 3, 9 ], [ 4, 7 ], [ 5, 1 ], [ 7, 2 ], [ 7, 6 ], [ 8, 4 ], [ 10, 18 ], [ 10, 15 ], [ 11, 13 ], [ 13, 19 ], [ 14, 17 ], [ 15, 11 ], [ 17, 12 ], [ 17, 16 ], [ 18, 14 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Herbert knows Colin. Sebastian knows Terry. Herbert knows Samantha. Samantha knows Corinne. Eldon knows Max. Yolanda knows Guy. Randy knows Yolanda. Randy knows Chelsea. Terry knows Wilson. Jim knows Jesse. April knows Skyler. Guy knows April. Jim knows Herbert. Yolanda knows Luna. Samantha knows Virginia. Skyler knows Vernon. Virginia knows Sebastian. Eldon knows Randy. Which of Herbert and Randy can Jim reach?", "answer": "Herbert", "steps": [ "Jim knows Herbert." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Jim", "Wilson", "Jesse", "Colin", "Samantha", "Terry", "Corinne", "Virginia", "Herbert", "Sebastian", "Eldon", "Vernon", "Max", "Chelsea", "Yolanda", "Skyler", "Luna", "Guy", "Randy", "April" ], "edges": [ [ 0, 2 ], [ 0, 8 ], [ 4, 6 ], [ 4, 7 ], [ 5, 1 ], [ 7, 9 ], [ 8, 3 ], [ 8, 4 ], [ 9, 5 ], [ 10, 12 ], [ 10, 18 ], [ 14, 16 ], [ 14, 17 ], [ 15, 11 ], [ 17, 19 ], [ 18, 13 ], [ 18, 14 ], [ 19, 15 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Nora knows Roman. Bruce knows Dick. Louisa knows Jewel. Dick knows Leah. Beverly knows Gene. Michael knows Boris. Jewel knows Wilson. Michael knows Bruce. Glen knows Beverly. Vera knows Glen. Bruce knows Nora. Aspen knows Willard. Vera knows Kara. Glen knows Eugenia. Eugenia knows Benjamin. Eugenia knows Louisa. Dawn knows Aspen. Dick knows Dawn. Which of Dawn and Louisa can Vera reach?", "answer": "Louisa", "steps": [ "Vera knows Glen.", "Glen knows Eugenia.", "Eugenia knows Louisa." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Vera", "Glen", "Jewel", "Eugenia", "Beverly", "Kara", "Benjamin", "Gene", "Wilson", "Louisa", "Michael", "Bruce", "Aspen", "Dick", "Nora", "Boris", "Leah", "Roman", "Willard", "Dawn" ], "edges": [ [ 0, 5 ], [ 0, 1 ], [ 1, 4 ], [ 1, 3 ], [ 2, 8 ], [ 3, 6 ], [ 3, 9 ], [ 4, 7 ], [ 9, 2 ], [ 10, 15 ], [ 10, 11 ], [ 11, 14 ], [ 11, 13 ], [ 12, 18 ], [ 13, 16 ], [ 13, 19 ], [ 14, 17 ], [ 19, 12 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Cruz knows Harris. Harris knows Jenny. Mason knows Cruz. Morgan knows Kit. Mason knows Kenneth. Jacob knows Joaquin. Harris knows Dorian. Clement knows Beau. Constance knows Esme. Darius knows Max. Joaquin knows Greer. Esme knows Jose. Darius knows Jacob. Dorian knows Morgan. Gage knows Craig. Jose knows Clement. Joaquin knows Constance. Kit knows Gage. Which of Harris and Joaquin can Darius reach?", "answer": "Joaquin", "steps": [ "Darius knows Jacob.", "Jacob knows Joaquin." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Darius", "Greer", "Jose", "Jacob", "Max", "Constance", "Clement", "Esme", "Beau", "Joaquin", "Mason", "Jenny", "Kit", "Cruz", "Kenneth", "Dorian", "Gage", "Morgan", "Craig", "Harris" ], "edges": [ [ 0, 4 ], [ 0, 3 ], [ 2, 6 ], [ 3, 9 ], [ 5, 7 ], [ 6, 8 ], [ 7, 2 ], [ 9, 1 ], [ 9, 5 ], [ 10, 14 ], [ 10, 13 ], [ 12, 16 ], [ 13, 19 ], [ 15, 17 ], [ 16, 18 ], [ 17, 12 ], [ 19, 11 ], [ 19, 15 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Mary knows Callum. Joanna knows Eve. Lane knows Anastasia. Lennox knows Gladys. Burt knows Karen. Cordelia knows Lennox. Anastasia knows Burt. Callum knows Hamilton. Joanna knows Antonio. Lennox knows Cristina. Anastasia knows Jeremiah. Karen knows Leander. Annie knows Lisa. Annie knows Guillermo. Karen knows Jewel. Callum knows Cordelia. Cristina knows Joanna. Leander knows Annie. Which of Cordelia and Burt can Mary reach?", "answer": "Cordelia", "steps": [ "Mary knows Callum.", "Callum knows Cordelia." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Mary", "Lennox", "Antonio", "Eve", "Cristina", "Hamilton", "Joanna", "Gladys", "Cordelia", "Callum", "Lane", "Karen", "Lisa", "Guillermo", "Leander", "Jeremiah", "Annie", "Jewel", "Burt", "Anastasia" ], "edges": [ [ 0, 9 ], [ 1, 4 ], [ 1, 7 ], [ 4, 6 ], [ 6, 2 ], [ 6, 3 ], [ 8, 1 ], [ 9, 5 ], [ 9, 8 ], [ 10, 19 ], [ 11, 14 ], [ 11, 17 ], [ 14, 16 ], [ 16, 12 ], [ 16, 13 ], [ 18, 11 ], [ 19, 15 ], [ 19, 18 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Virginia knows Bonnie. Anton knows Wilson. Eloise knows Sara. Percy knows Amy. Glenn knows Virginia. Eloise knows Doris. Josie knows Eloise. Daria knows Erma. Anton knows Evelyn. Percy knows Jill. Sara knows Langston. Virginia knows Preston. Daria knows Percy. Daria knows Brenda. Langston knows Hope. Preston knows Daria. Langston knows Anton. Langston knows Trevor. Which of Anton and Percy can Josie reach?", "answer": "Anton", "steps": [ "Josie knows Eloise.", "Eloise knows Sara.", "Sara knows Langston.", "Langston knows Anton." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Josie", "Doris", "Trevor", "Eloise", "Wilson", "Langston", "Anton", "Hope", "Sara", "Evelyn", "Glenn", "Bonnie", "Erma", "Virginia", "Amy", "Daria", "Percy", "Brenda", "Preston", "Jill" ], "edges": [ [ 0, 3 ], [ 3, 1 ], [ 3, 8 ], [ 5, 2 ], [ 5, 7 ], [ 5, 6 ], [ 6, 4 ], [ 6, 9 ], [ 8, 5 ], [ 10, 13 ], [ 13, 11 ], [ 13, 18 ], [ 15, 12 ], [ 15, 17 ], [ 15, 16 ], [ 16, 14 ], [ 16, 19 ], [ 18, 15 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Greer knows Wade. Zack knows Rufus. Bette knows Tyler. Atlas knows Karl. Gerald knows Livia. Linda knows Zack. Catherine knows Emanuel. Lottie knows Julie. Karl knows Greer. Dewey knows Lottie. Livia knows Catherine. Livia knows Aldo. Zane knows Neil. Greer knows Dewey. Atlas knows Bette. Dewey knows Mildred. Catherine knows Zane. Linda knows Gerald. Which of Karl and Gerald can Atlas reach?", "answer": "Karl", "steps": [ "Atlas knows Karl." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Atlas", "Dewey", "Julie", "Tyler", "Mildred", "Greer", "Karl", "Bette", "Wade", "Lottie", "Linda", "Catherine", "Neil", "Rufus", "Emanuel", "Livia", "Gerald", "Zack", "Aldo", "Zane" ], "edges": [ [ 0, 7 ], [ 0, 6 ], [ 1, 4 ], [ 1, 9 ], [ 5, 8 ], [ 5, 1 ], [ 6, 5 ], [ 7, 3 ], [ 9, 2 ], [ 10, 17 ], [ 10, 16 ], [ 11, 14 ], [ 11, 19 ], [ 15, 18 ], [ 15, 11 ], [ 16, 15 ], [ 17, 13 ], [ 19, 12 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Dawn knows Adam. Gene knows Connor. Adam knows Finn. Finn knows Megan. Fanny knows Dawn. Avery knows Dell. Wilson knows Avery. Marilyn knows Gideon. Megan knows Gene. Gideon knows Lorraine. Etta knows Wilson. Curtis knows James. Lars knows Etta. Connor knows Bonnie. Gene knows Lawson. Francesca knows Fanny. Avery knows Curtis. Lorraine knows Lars. Which of Finn and Etta can Marilyn reach?", "answer": "Etta", "steps": [ "Marilyn knows Gideon.", "Gideon knows Lorraine.", "Lorraine knows Lars.", "Lars knows Etta." ], "difficulty": 4, "original_distance": 8, "idx_to_symbol": [ "Marilyn", "Lorraine", "Etta", "Curtis", "Wilson", "Gideon", "Dell", "James", "Avery", "Lars", "Francesca", "Dawn", "Finn", "Connor", "Megan", "Fanny", "Lawson", "Bonnie", "Gene", "Adam" ], "edges": [ [ 0, 5 ], [ 1, 9 ], [ 2, 4 ], [ 3, 7 ], [ 4, 8 ], [ 5, 1 ], [ 8, 6 ], [ 8, 3 ], [ 9, 2 ], [ 10, 15 ], [ 11, 19 ], [ 12, 14 ], [ 13, 17 ], [ 14, 18 ], [ 15, 11 ], [ 18, 16 ], [ 18, 13 ], [ 19, 12 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Lauren knows Janice. Lauren knows Nell. Lauren knows Reid. Larry knows Merle. Eric knows Drew. Miranda knows Connor. Estelle knows Lauren. Larry knows Eric. Leland knows Joy. Reid knows Joel. Boris knows Larry. Larry knows Leland. Leland knows Miranda. Keegan knows David. Larry knows Joaquin. Reid knows Ashton. Lauren knows Keegan. Joel knows Elias. Which of Connor and Elias can Estelle reach?", "answer": "Elias", "steps": [ "Estelle knows Lauren.", "Lauren knows Reid.", "Reid knows Joel.", "Joel knows Elias." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Estelle", "Keegan", "Ashton", "Janice", "Nell", "Joel", "Elias", "Lauren", "David", "Reid", "Boris", "Eric", "Joy", "Merle", "Joaquin", "Miranda", "Connor", "Larry", "Drew", "Leland" ], "edges": [ [ 0, 7 ], [ 1, 8 ], [ 5, 6 ], [ 7, 3 ], [ 7, 4 ], [ 7, 1 ], [ 7, 9 ], [ 9, 2 ], [ 9, 5 ], [ 10, 17 ], [ 11, 18 ], [ 15, 16 ], [ 17, 13 ], [ 17, 14 ], [ 17, 11 ], [ 17, 19 ], [ 19, 12 ], [ 19, 15 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Catherine knows Cameron. Gunnar knows Walt. Gunnar knows Fraser. Gunnar knows Wade. Beatrice knows Catherine. Brody knows Wesley. Ronald knows Brody. Clark knows Maria. Beatrice knows Dennis. Ronald knows Arthur. Lillian knows Tonya. Dennis knows Harley. Fraser knows Clarissa. Ronald knows Gunnar. Catherine knows Lillian. Beatrice knows Clark. Catherine knows Adrian. Arthur knows Todd. Which of Fraser and Lillian can Ronald reach?", "answer": "Fraser", "steps": [ "Ronald knows Gunnar.", "Gunnar knows Fraser." ], "difficulty": 2, "original_distance": 3, "idx_to_symbol": [ "Ronald", "Gunnar", "Clarissa", "Brody", "Wade", "Wesley", "Todd", "Arthur", "Fraser", "Walt", "Beatrice", "Catherine", "Tonya", "Clark", "Adrian", "Maria", "Harley", "Dennis", "Lillian", "Cameron" ], "edges": [ [ 0, 3 ], [ 0, 7 ], [ 0, 1 ], [ 1, 4 ], [ 1, 8 ], [ 1, 9 ], [ 3, 5 ], [ 7, 6 ], [ 8, 2 ], [ 10, 13 ], [ 10, 17 ], [ 10, 11 ], [ 11, 14 ], [ 11, 18 ], [ 11, 19 ], [ 13, 15 ], [ 17, 16 ], [ 18, 12 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Neil knows Marilyn. Oliver knows Wallace. Marilyn knows Chase. Julio knows Charity. Lawson knows Oliver. Carol knows Neil. Julio knows Harry. Carol knows Mia. Khashayar knows Carrie. Mia knows Wayne. Khashayar knows Martha. Neil knows Julio. Wallace knows Ernie. Asher knows Shawn. Wallace knows Zane. Oliver knows Asher. Lawson knows Khashayar. Mia knows Humphrey. Which of Wallace and Julio can Carol reach?", "answer": "Julio", "steps": [ "Carol knows Neil.", "Neil knows Julio." ], "difficulty": 2, "original_distance": 3, "idx_to_symbol": [ "Carol", "Marilyn", "Neil", "Charity", "Mia", "Wayne", "Harry", "Julio", "Chase", "Humphrey", "Lawson", "Asher", "Oliver", "Zane", "Khashayar", "Carrie", "Ernie", "Wallace", "Shawn", "Martha" ], "edges": [ [ 0, 2 ], [ 0, 4 ], [ 1, 8 ], [ 2, 7 ], [ 2, 1 ], [ 4, 5 ], [ 4, 9 ], [ 7, 3 ], [ 7, 6 ], [ 10, 12 ], [ 10, 14 ], [ 11, 18 ], [ 12, 17 ], [ 12, 11 ], [ 14, 15 ], [ 14, 19 ], [ 17, 13 ], [ 17, 16 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Arturo knows Herbert. Randy knows Ray. Mark knows Arturo. Herbert knows Oliver. Madeline knows Kim. Vivian knows Harry. Herbert knows Arnold. Randy knows Deanna. Eden knows Anna. Deanna knows Madeline. Arturo knows Isaac. Anna knows Isabel. Vivian knows Zane. Zane knows Courtney. Madeline knows Vivian. Eden knows Mark. Oliver knows Clement. Ray knows Paula. Which of Arturo and Madeline can Randy reach?", "answer": "Madeline", "steps": [ "Randy knows Deanna.", "Deanna knows Madeline." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Randy", "Harry", "Ray", "Paula", "Deanna", "Courtney", "Zane", "Madeline", "Vivian", "Kim", "Eden", "Arnold", "Anna", "Isabel", "Mark", "Clement", "Oliver", "Arturo", "Herbert", "Isaac" ], "edges": [ [ 0, 2 ], [ 0, 4 ], [ 2, 3 ], [ 4, 7 ], [ 6, 5 ], [ 7, 8 ], [ 7, 9 ], [ 8, 1 ], [ 8, 6 ], [ 10, 12 ], [ 10, 14 ], [ 12, 13 ], [ 14, 17 ], [ 16, 15 ], [ 17, 18 ], [ 17, 19 ], [ 18, 11 ], [ 18, 16 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Amber knows Hayes. Rosemary knows Amber. Pablo knows Rosemary. Henry knows Rhea. Elodie knows Austin. Henry knows Elodie. Helene knows Claude. Ian knows Joseph. Frances knows Monica. Pablo knows Carl. Henry knows Helene. Carl knows Daphne. Daphne knows Ian. Austin knows Frances. Pablo knows Ellen. Pablo knows Alice. Claude knows Aaron. Henry knows Derek. Which of Daphne and Austin can Pablo reach?", "answer": "Daphne", "steps": [ "Pablo knows Carl.", "Carl knows Daphne." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Pablo", "Alice", "Joseph", "Ian", "Daphne", "Rosemary", "Ellen", "Carl", "Amber", "Hayes", "Henry", "Rhea", "Monica", "Frances", "Austin", "Helene", "Derek", "Elodie", "Claude", "Aaron" ], "edges": [ [ 0, 1 ], [ 0, 6 ], [ 0, 7 ], [ 0, 5 ], [ 3, 2 ], [ 4, 3 ], [ 5, 8 ], [ 7, 4 ], [ 8, 9 ], [ 10, 11 ], [ 10, 16 ], [ 10, 17 ], [ 10, 15 ], [ 13, 12 ], [ 14, 13 ], [ 15, 18 ], [ 17, 14 ], [ 18, 19 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Kristina knows Elena. Keegan knows Gloria. Howard knows Grover. Elena knows Esther. Zane knows Agnes. Kristina knows Patrick. Gloria knows Chance. Howard knows George. Asher knows Ramona. Grover knows Lorenzo. Emanuel knows Keegan. Lorenzo knows Zane. Elena knows Emanuel. Holden knows Abel. Lorenzo knows Luke. Keegan knows Asher. Luke knows Porter. Holden knows Howard. Which of Lorenzo and Keegan can Holden reach?", "answer": "Lorenzo", "steps": [ "Holden knows Howard.", "Howard knows Grover.", "Grover knows Lorenzo." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Holden", "Luke", "George", "Howard", "Zane", "Porter", "Lorenzo", "Abel", "Agnes", "Grover", "Kristina", "Gloria", "Esther", "Elena", "Asher", "Chance", "Keegan", "Patrick", "Ramona", "Emanuel" ], "edges": [ [ 0, 7 ], [ 0, 3 ], [ 1, 5 ], [ 3, 2 ], [ 3, 9 ], [ 4, 8 ], [ 6, 1 ], [ 6, 4 ], [ 9, 6 ], [ 10, 17 ], [ 10, 13 ], [ 11, 15 ], [ 13, 12 ], [ 13, 19 ], [ 14, 18 ], [ 16, 11 ], [ 16, 14 ], [ 19, 16 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Bruno knows Jackson. Lionel knows Cecilia. Ramona knows Bruno. Jackson knows Veronica. Richard knows Todd. Gregory knows Ramona. Veronica knows Eric. Todd knows Chelsea. Eric knows Haven. Erica knows Lionel. Kareem knows Caleb. Lionel knows Dick. Ramona knows Norman. Bruno knows Haley. Dick knows Kareem. Erica knows Delilah. Todd knows Erica. Jackson knows Alyson. Which of Erica and Bruno can Richard reach?", "answer": "Erica", "steps": [ "Richard knows Todd.", "Todd knows Erica." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Richard", "Cecilia", "Todd", "Delilah", "Lionel", "Erica", "Dick", "Chelsea", "Kareem", "Caleb", "Gregory", "Alyson", "Ramona", "Haley", "Jackson", "Bruno", "Veronica", "Norman", "Eric", "Haven" ], "edges": [ [ 0, 2 ], [ 2, 7 ], [ 2, 5 ], [ 4, 1 ], [ 4, 6 ], [ 5, 3 ], [ 5, 4 ], [ 6, 8 ], [ 8, 9 ], [ 10, 12 ], [ 12, 17 ], [ 12, 15 ], [ 14, 11 ], [ 14, 16 ], [ 15, 13 ], [ 15, 14 ], [ 16, 18 ], [ 18, 19 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Jill knows Mae. Kerry knows Jamie. Mae knows Randy. Elise knows Garrett. Jill knows Philip. Randy knows Daniella. Nicholas knows Kerry. Kerry knows Louise. Samantha knows Shawn. Mae knows Mindy. Lane knows Nicholas. Lane knows Samantha. Philip knows Max. Jamie knows Joseph. Daniella knows Elise. Joseph knows Oliver. Nicholas knows Jasper. Randy knows Willis. Which of Garrett and Oliver can Lane reach?", "answer": "Oliver", "steps": [ "Lane knows Nicholas.", "Nicholas knows Kerry.", "Kerry knows Jamie.", "Jamie knows Joseph.", "Joseph knows Oliver." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Lane", "Louise", "Kerry", "Nicholas", "Shawn", "Joseph", "Jasper", "Oliver", "Samantha", "Jamie", "Jill", "Willis", "Randy", "Mae", "Max", "Elise", "Mindy", "Garrett", "Philip", "Daniella" ], "edges": [ [ 0, 8 ], [ 0, 3 ], [ 2, 1 ], [ 2, 9 ], [ 3, 6 ], [ 3, 2 ], [ 5, 7 ], [ 8, 4 ], [ 9, 5 ], [ 10, 18 ], [ 10, 13 ], [ 12, 11 ], [ 12, 19 ], [ 13, 16 ], [ 13, 12 ], [ 15, 17 ], [ 18, 14 ], [ 19, 15 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Ethan knows Odette. Trevor knows Francesca. Ethan knows Fisher. Trevor knows Miranda. Ian knows Kirk. Russ knows Ethan. Emma knows Heidi. Francesca knows Barney. Ethan knows Daisy. Emma knows Livia. Emma knows Ian. Lars knows Russ. Dale knows Emma. Javier knows Fritz. Lars knows Bart. Odette knows Antonio. Trevor knows Dale. Lars knows Javier. Which of Russ and Dale can Lars reach?", "answer": "Russ", "steps": [ "Lars knows Russ." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Lars", "Fritz", "Antonio", "Bart", "Odette", "Javier", "Russ", "Fisher", "Daisy", "Ethan", "Trevor", "Barney", "Kirk", "Miranda", "Ian", "Francesca", "Dale", "Livia", "Heidi", "Emma" ], "edges": [ [ 0, 3 ], [ 0, 5 ], [ 0, 6 ], [ 4, 2 ], [ 5, 1 ], [ 6, 9 ], [ 9, 4 ], [ 9, 7 ], [ 9, 8 ], [ 10, 13 ], [ 10, 15 ], [ 10, 16 ], [ 14, 12 ], [ 15, 11 ], [ 16, 19 ], [ 19, 14 ], [ 19, 17 ], [ 19, 18 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Carol knows Hector. Dustin knows Kirsten. Regina knows Holly. Hadley knows Fisher. Holly knows Darrell. Darrell knows Hendrix. Russell knows Simon. Kirsten knows Morris. Regina knows Hailey. Hailey knows Hadley. Jocelyn knows Russell. Dana knows Julia. Kirsten knows Layla. Hendrix knows Dana. Morris knows Melanie. Dustin knows Jocelyn. Holly knows Diego. Melanie knows Carol. Which of Dana and Carol can Dustin reach?", "answer": "Carol", "steps": [ "Dustin knows Kirsten.", "Kirsten knows Morris.", "Morris knows Melanie.", "Melanie knows Carol." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Dustin", "Layla", "Melanie", "Simon", "Carol", "Kirsten", "Russell", "Morris", "Jocelyn", "Hector", "Regina", "Diego", "Hendrix", "Fisher", "Dana", "Holly", "Hadley", "Darrell", "Hailey", "Julia" ], "edges": [ [ 0, 8 ], [ 0, 5 ], [ 2, 4 ], [ 4, 9 ], [ 5, 1 ], [ 5, 7 ], [ 6, 3 ], [ 7, 2 ], [ 8, 6 ], [ 10, 18 ], [ 10, 15 ], [ 12, 14 ], [ 14, 19 ], [ 15, 11 ], [ 15, 17 ], [ 16, 13 ], [ 17, 12 ], [ 18, 16 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Dennis knows Colin. Dennis knows Kareem. Ruby knows Janice. Ruby knows Duke. Hank knows Edmund. Hank knows Arthur. Dennis knows Amber. Marlene knows Camille. Marlene knows Kevin. Hailey knows Hank. Duke knows Eden. Ruby knows Hector. Clark knows Hailey. Arthur knows Emery. Amber knows Bryan. Bryan knows Ruby. Hank knows Aiden. Marlene knows Clark. Which of Eden and Emery can Marlene reach?", "answer": "Emery", "steps": [ "Marlene knows Clark.", "Clark knows Hailey.", "Hailey knows Hank.", "Hank knows Arthur.", "Arthur knows Emery." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Marlene", "Emery", "Camille", "Clark", "Aiden", "Arthur", "Hank", "Edmund", "Kevin", "Hailey", "Dennis", "Eden", "Colin", "Amber", "Janice", "Duke", "Ruby", "Hector", "Kareem", "Bryan" ], "edges": [ [ 0, 2 ], [ 0, 8 ], [ 0, 3 ], [ 3, 9 ], [ 5, 1 ], [ 6, 4 ], [ 6, 5 ], [ 6, 7 ], [ 9, 6 ], [ 10, 12 ], [ 10, 18 ], [ 10, 13 ], [ 13, 19 ], [ 15, 11 ], [ 16, 14 ], [ 16, 15 ], [ 16, 17 ], [ 19, 16 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Kara knows Jewel. Clyde knows Devin. Effie knows Kara. Jack knows Dudley. Joan knows Carlton. Dakota knows Lloyd. Dudley knows Effie. Carey knows Nelson. Shelby knows Carey. Troy knows Jana. Shelby knows Dakota. Ashley knows Troy. Nelson knows Robin. Kristin knows Shelby. Kristin knows Clyde. Dudley knows Joan. Effie knows Ashley. Donald knows Kristin. Which of Carey and Ashley can Donald reach?", "answer": "Carey", "steps": [ "Donald knows Kristin.", "Kristin knows Shelby.", "Shelby knows Carey." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Donald", "Carey", "Lloyd", "Robin", "Devin", "Clyde", "Kristin", "Dakota", "Nelson", "Shelby", "Jack", "Ashley", "Jewel", "Jana", "Carlton", "Joan", "Dudley", "Kara", "Troy", "Effie" ], "edges": [ [ 0, 6 ], [ 1, 8 ], [ 5, 4 ], [ 6, 5 ], [ 6, 9 ], [ 7, 2 ], [ 8, 3 ], [ 9, 7 ], [ 9, 1 ], [ 10, 16 ], [ 11, 18 ], [ 15, 14 ], [ 16, 15 ], [ 16, 19 ], [ 17, 12 ], [ 18, 13 ], [ 19, 17 ], [ 19, 11 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Freya knows Jarvis. Coral knows Anton. Cynthia knows Tanya. Shaun knows Freya. Tanya knows Nelson. Conner knows Brooks. Livia knows Jasmine. Lydia knows Curtis. Nelson knows Kara. Livia knows Rocco. Shaun knows Dahlia. Fabian knows Roger. Jasmine knows Lydia. Shaun knows Cynthia. Coral knows Livia. Cynthia knows Conner. Rocco knows Lorenzo. Coral knows Fabian. Which of Lydia and Nelson can Shaun reach?", "answer": "Nelson", "steps": [ "Shaun knows Cynthia.", "Cynthia knows Tanya.", "Tanya knows Nelson." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Shaun", "Jarvis", "Conner", "Brooks", "Cynthia", "Freya", "Dahlia", "Kara", "Nelson", "Tanya", "Coral", "Roger", "Rocco", "Lorenzo", "Livia", "Fabian", "Anton", "Curtis", "Lydia", "Jasmine" ], "edges": [ [ 0, 5 ], [ 0, 6 ], [ 0, 4 ], [ 2, 3 ], [ 4, 2 ], [ 4, 9 ], [ 5, 1 ], [ 8, 7 ], [ 9, 8 ], [ 10, 15 ], [ 10, 16 ], [ 10, 14 ], [ 12, 13 ], [ 14, 12 ], [ 14, 19 ], [ 15, 11 ], [ 18, 17 ], [ 19, 18 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Kristina knows Elena. Keegan knows Gloria. Howard knows Grover. Elena knows Esther. Zane knows Agnes. Kristina knows Patrick. Gloria knows Chance. Howard knows George. Asher knows Ramona. Grover knows Lorenzo. Emanuel knows Keegan. Lorenzo knows Zane. Elena knows Emanuel. Holden knows Abel. Lorenzo knows Luke. Keegan knows Asher. Luke knows Porter. Holden knows Howard. Which of Howard and Elena can Holden reach?", "answer": "Howard", "steps": [ "Holden knows Howard." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Holden", "Luke", "George", "Howard", "Zane", "Porter", "Lorenzo", "Abel", "Agnes", "Grover", "Kristina", "Gloria", "Esther", "Elena", "Asher", "Chance", "Keegan", "Patrick", "Ramona", "Emanuel" ], "edges": [ [ 0, 7 ], [ 0, 3 ], [ 1, 5 ], [ 3, 2 ], [ 3, 9 ], [ 4, 8 ], [ 6, 1 ], [ 6, 4 ], [ 9, 6 ], [ 10, 17 ], [ 10, 13 ], [ 11, 15 ], [ 13, 12 ], [ 13, 19 ], [ 14, 18 ], [ 16, 11 ], [ 16, 14 ], [ 19, 16 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Laura knows Howard. Maggie knows Shannon. Bridget knows Bonnie. Hattie knows Jay. Calvin knows Laura. Paige knows Betty. Calvin knows Greta. Hattie knows Chelsea. Luna knows Erin. Howard knows Destiny. Julie knows Hattie. Zachary knows Julie. Erin knows Dylan. Jay knows Bridget. Ben knows Zachary. Jay knows Paige. Dylan knows Calvin. Laura knows Maggie. Which of Erin and Zachary can Luna reach?", "answer": "Erin", "steps": [ "Luna knows Erin." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Luna", "Greta", "Laura", "Shannon", "Dylan", "Calvin", "Destiny", "Erin", "Maggie", "Howard", "Ben", "Chelsea", "Jay", "Betty", "Julie", "Hattie", "Bonnie", "Zachary", "Paige", "Bridget" ], "edges": [ [ 0, 7 ], [ 2, 8 ], [ 2, 9 ], [ 4, 5 ], [ 5, 1 ], [ 5, 2 ], [ 7, 4 ], [ 8, 3 ], [ 9, 6 ], [ 10, 17 ], [ 12, 18 ], [ 12, 19 ], [ 14, 15 ], [ 15, 11 ], [ 15, 12 ], [ 17, 14 ], [ 18, 13 ], [ 19, 16 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Teresa knows Justine. Gavin knows Patrick. Eunice knows Demetrius. Aisha knows Becky. Justine knows Joaquin. Dylan knows Darla. Gavin knows Teresa. Demetrius knows Tristan. Aisha knows Dylan. Joaquin knows Franklin. Eunice knows Aisha. Teresa knows Belinda. Belinda knows Clayton. Patrick knows Colette. Becky knows Aspen. Teresa knows Percy. Darla knows Otto. Aisha knows Alana. Which of Otto and Franklin can Eunice reach?", "answer": "Otto", "steps": [ "Eunice knows Aisha.", "Aisha knows Dylan.", "Dylan knows Darla.", "Darla knows Otto." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Eunice", "Dylan", "Darla", "Otto", "Aisha", "Tristan", "Aspen", "Becky", "Alana", "Demetrius", "Gavin", "Justine", "Joaquin", "Franklin", "Teresa", "Colette", "Clayton", "Belinda", "Percy", "Patrick" ], "edges": [ [ 0, 4 ], [ 0, 9 ], [ 1, 2 ], [ 2, 3 ], [ 4, 1 ], [ 4, 7 ], [ 4, 8 ], [ 7, 6 ], [ 9, 5 ], [ 10, 14 ], [ 10, 19 ], [ 11, 12 ], [ 12, 13 ], [ 14, 11 ], [ 14, 17 ], [ 14, 18 ], [ 17, 16 ], [ 19, 15 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Charlene knows Owen. Mack knows Bruno. Charlene knows Melissa. Charlene knows Jerome. Melissa knows Mack. Mack knows Ariel. Ebony knows Estelle. Donald knows Heidi. Donald knows Haley. Ebony knows Odette. Ebony knows Carmen. Melissa knows Norma. Conner knows Donald. Mack knows Sadie. Conner knows Lorenzo. Conner knows Francis. Melissa knows Gunnar. Donald knows Ebony. Which of Donald and Melissa can Conner reach?", "answer": "Donald", "steps": [ "Conner knows Donald." ], "difficulty": 1, "original_distance": 3, "idx_to_symbol": [ "Conner", "Ebony", "Donald", "Lorenzo", "Heidi", "Carmen", "Haley", "Odette", "Francis", "Estelle", "Charlene", "Mack", "Melissa", "Jerome", "Gunnar", "Bruno", "Norma", "Sadie", "Owen", "Ariel" ], "edges": [ [ 0, 3 ], [ 0, 8 ], [ 0, 2 ], [ 1, 5 ], [ 1, 7 ], [ 1, 9 ], [ 2, 4 ], [ 2, 6 ], [ 2, 1 ], [ 10, 13 ], [ 10, 18 ], [ 10, 12 ], [ 11, 15 ], [ 11, 17 ], [ 11, 19 ], [ 12, 14 ], [ 12, 16 ], [ 12, 11 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Rhea knows Declan. Declan knows Lydia. Enid knows Lyle. Alejandro knows Amelia. Lyle knows Dean. Rhea knows Alejandro. Lillian knows Abigail. Maggie knows Rhea. Maggie knows Valerie. Ira knows Lillian. Amelia knows Jillian. Lyle knows Colby. Dean knows Eunice. Enid knows Jared. Lyle knows Ira. Amelia knows Victor. Rhea knows June. Lillian knows Maria. Which of Maria and Jillian can Maggie reach?", "answer": "Jillian", "steps": [ "Maggie knows Rhea.", "Rhea knows Alejandro.", "Alejandro knows Amelia.", "Amelia knows Jillian." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Maggie", "Lydia", "Jillian", "Amelia", "June", "Alejandro", "Declan", "Victor", "Rhea", "Valerie", "Enid", "Eunice", "Maria", "Lillian", "Colby", "Ira", "Dean", "Abigail", "Lyle", "Jared" ], "edges": [ [ 0, 8 ], [ 0, 9 ], [ 3, 2 ], [ 3, 7 ], [ 5, 3 ], [ 6, 1 ], [ 8, 4 ], [ 8, 6 ], [ 8, 5 ], [ 10, 18 ], [ 10, 19 ], [ 13, 12 ], [ 13, 17 ], [ 15, 13 ], [ 16, 11 ], [ 18, 14 ], [ 18, 16 ], [ 18, 15 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Carmela knows Shaun. Bob knows Abigail. Jaime knows Milton. Zane knows Evan. Carey knows Zane. Abigail knows Alfonso. Carmela knows Daniella. Abigail knows Jaime. Fabian knows Cain. Alfonso knows Maggie. Maggie knows Jakob. Ben knows Etta. Jaime knows Ben. Fabian knows Carey. Carey knows Dora. Kira knows Fabian. Cain knows Carmela. Maggie knows Perry. Which of Alfonso and Cain can Kira reach?", "answer": "Cain", "steps": [ "Kira knows Fabian.", "Fabian knows Cain." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Kira", "Fabian", "Zane", "Carey", "Cain", "Shaun", "Carmela", "Dora", "Evan", "Daniella", "Bob", "Abigail", "Ben", "Jaime", "Alfonso", "Jakob", "Maggie", "Milton", "Etta", "Perry" ], "edges": [ [ 0, 1 ], [ 1, 3 ], [ 1, 4 ], [ 2, 8 ], [ 3, 7 ], [ 3, 2 ], [ 4, 6 ], [ 6, 5 ], [ 6, 9 ], [ 10, 11 ], [ 11, 13 ], [ 11, 14 ], [ 12, 18 ], [ 13, 17 ], [ 13, 12 ], [ 14, 16 ], [ 16, 15 ], [ 16, 19 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Allan knows Franklin. Ada knows Hal. Lily knows Daniella. Franklin knows Ada. Chantal knows Lily. Henrietta knows Heath. Henrietta knows Pearl. Etta knows Chantal. Aurora knows Henrietta. Chantal knows Allan. Aurora knows Cornelius. Alana knows Dahlia. Allan knows Carter. Carter knows Valerie. Cornelius knows Calvin. Heath knows Haley. Alyssa knows Aurora. Pearl knows Alana. Which of Hal and Dahlia can Alyssa reach?", "answer": "Dahlia", "steps": [ "Alyssa knows Aurora.", "Aurora knows Henrietta.", "Henrietta knows Pearl.", "Pearl knows Alana.", "Alana knows Dahlia." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Alyssa", "Aurora", "Haley", "Heath", "Alana", "Pearl", "Henrietta", "Dahlia", "Cornelius", "Calvin", "Etta", "Chantal", "Valerie", "Carter", "Ada", "Franklin", "Allan", "Hal", "Lily", "Daniella" ], "edges": [ [ 0, 1 ], [ 1, 6 ], [ 1, 8 ], [ 3, 2 ], [ 4, 7 ], [ 5, 4 ], [ 6, 3 ], [ 6, 5 ], [ 8, 9 ], [ 10, 11 ], [ 11, 16 ], [ 11, 18 ], [ 13, 12 ], [ 14, 17 ], [ 15, 14 ], [ 16, 13 ], [ 16, 15 ], [ 18, 19 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Joy knows Nora. Elizabeth knows Isiah. Gabriel knows Desmond. Joshua knows Jonas. Norma knows Gabriel. Gabriel knows Mitchell. Eugene knows Lenora. Eugene knows Elizabeth. Yolanda knows Noel. Lenora knows Joshua. Desmond knows Dakota. Eugene knows Jon. Eugene knows Yolanda. Nicole knows Lamont. Vance knows Eugene. Gabriel knows Elaine. Elaine knows Nicole. Gabriel knows Joy. Which of Elaine and Lenora can Norma reach?", "answer": "Elaine", "steps": [ "Norma knows Gabriel.", "Gabriel knows Elaine." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Norma", "Dakota", "Joy", "Lamont", "Elaine", "Mitchell", "Desmond", "Gabriel", "Nicole", "Nora", "Vance", "Noel", "Elizabeth", "Jonas", "Lenora", "Jon", "Yolanda", "Eugene", "Joshua", "Isiah" ], "edges": [ [ 0, 7 ], [ 2, 9 ], [ 4, 8 ], [ 6, 1 ], [ 7, 5 ], [ 7, 6 ], [ 7, 4 ], [ 7, 2 ], [ 8, 3 ], [ 10, 17 ], [ 12, 19 ], [ 14, 18 ], [ 16, 11 ], [ 17, 15 ], [ 17, 16 ], [ 17, 14 ], [ 17, 12 ], [ 18, 13 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Alejandro knows Verna. Emery knows Delilah. Gary knows Arthur. Emery knows Sue. Arthur knows Louise. Verna knows Essie. Edith knows Sonia. Sue knows Gary. Drake knows Alejandro. Alejandro knows Edith. Hilda knows Julio. Delilah knows Bernice. Arthur knows Graeme. Sonia knows Hilda. Donald knows Emery. Hilda knows Jonas. Hilda knows Hal. Arthur knows David. Which of Julio and Louise can Donald reach?", "answer": "Louise", "steps": [ "Donald knows Emery.", "Emery knows Sue.", "Sue knows Gary.", "Gary knows Arthur.", "Arthur knows Louise." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Donald", "Arthur", "Sue", "David", "Bernice", "Gary", "Graeme", "Louise", "Delilah", "Emery", "Drake", "Hilda", "Edith", "Jonas", "Essie", "Sonia", "Hal", "Julio", "Verna", "Alejandro" ], "edges": [ [ 0, 9 ], [ 1, 3 ], [ 1, 6 ], [ 1, 7 ], [ 2, 5 ], [ 5, 1 ], [ 8, 4 ], [ 9, 2 ], [ 9, 8 ], [ 10, 19 ], [ 11, 13 ], [ 11, 16 ], [ 11, 17 ], [ 12, 15 ], [ 15, 11 ], [ 18, 14 ], [ 19, 12 ], [ 19, 18 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Hardy knows Jeff. Sandy knows Hardy. Eleanor knows Austin. Hilda knows Aisha. Hardy knows Judy. June knows Eleanor. Allen knows Kane. Jeff knows Fergus. Judy knows Allen. Hardy knows Demetrius. Eleanor knows Louisa. Austin knows Keegan. Finn knows June. Hilda knows Sandy. Keegan knows Ronald. Finn knows Jolena. Eleanor knows Susan. Louisa knows Layla. Which of June and Sandy can Finn reach?", "answer": "June", "steps": [ "Finn knows June." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Finn", "Louisa", "June", "Eleanor", "Keegan", "Susan", "Layla", "Jolena", "Ronald", "Austin", "Hilda", "Jeff", "Sandy", "Hardy", "Allen", "Demetrius", "Fergus", "Aisha", "Kane", "Judy" ], "edges": [ [ 0, 7 ], [ 0, 2 ], [ 1, 6 ], [ 2, 3 ], [ 3, 5 ], [ 3, 1 ], [ 3, 9 ], [ 4, 8 ], [ 9, 4 ], [ 10, 17 ], [ 10, 12 ], [ 11, 16 ], [ 12, 13 ], [ 13, 15 ], [ 13, 11 ], [ 13, 19 ], [ 14, 18 ], [ 19, 14 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Eloise knows Cameron. Lauren knows Dell. Bernice knows Dalton. Connor knows Alana. Beth knows Connor. Beth knows Dewey. Matthew knows Barney. Katherine knows Bernice. Lauren knows Katherine. Bernice knows Matthew. Alana knows Jake. Dewey knows Gustavo. Eloise knows Ilene. Cameron knows Beth. Barney knows Amber. Dalton knows Erma. Dalton knows Forrest. Dewey knows Landon. Which of Beth and Bernice can Lauren reach?", "answer": "Bernice", "steps": [ "Lauren knows Katherine.", "Katherine knows Bernice." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Lauren", "Dalton", "Katherine", "Bernice", "Erma", "Dell", "Barney", "Forrest", "Matthew", "Amber", "Eloise", "Dewey", "Cameron", "Beth", "Landon", "Ilene", "Alana", "Gustavo", "Connor", "Jake" ], "edges": [ [ 0, 5 ], [ 0, 2 ], [ 1, 4 ], [ 1, 7 ], [ 2, 3 ], [ 3, 1 ], [ 3, 8 ], [ 6, 9 ], [ 8, 6 ], [ 10, 15 ], [ 10, 12 ], [ 11, 14 ], [ 11, 17 ], [ 12, 13 ], [ 13, 11 ], [ 13, 18 ], [ 16, 19 ], [ 18, 16 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Elodie knows June. Ellis knows Alan. Kelly knows Stanley. Sheila knows Henry. Mason knows Kelly. Elliot knows Ellis. Kelly knows Hailey. Hugh knows Graeme. Elvira knows Sheila. Mason knows Boyd. Kelly knows Stephanie. Denver knows Leah. Boyd knows Hugh. Bert knows Denver. Denver knows Elliot. Bert knows Elvira. Stephanie knows Elodie. Denver knows Cruz. Which of Elodie and Ellis can Bert reach?", "answer": "Ellis", "steps": [ "Bert knows Denver.", "Denver knows Elliot.", "Elliot knows Ellis." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Bert", "Alan", "Henry", "Sheila", "Cruz", "Ellis", "Elliot", "Elvira", "Leah", "Denver", "Mason", "June", "Graeme", "Hugh", "Stanley", "Elodie", "Stephanie", "Boyd", "Hailey", "Kelly" ], "edges": [ [ 0, 7 ], [ 0, 9 ], [ 3, 2 ], [ 5, 1 ], [ 6, 5 ], [ 7, 3 ], [ 9, 4 ], [ 9, 6 ], [ 9, 8 ], [ 10, 17 ], [ 10, 19 ], [ 13, 12 ], [ 15, 11 ], [ 16, 15 ], [ 17, 13 ], [ 19, 14 ], [ 19, 16 ], [ 19, 18 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Bruno knows Jackson. Lionel knows Cecilia. Ramona knows Bruno. Jackson knows Veronica. Richard knows Todd. Gregory knows Ramona. Veronica knows Eric. Todd knows Chelsea. Eric knows Haven. Erica knows Lionel. Kareem knows Caleb. Lionel knows Dick. Ramona knows Norman. Bruno knows Haley. Dick knows Kareem. Erica knows Delilah. Todd knows Erica. Jackson knows Alyson. Which of Kareem and Eric can Richard reach?", "answer": "Kareem", "steps": [ "Richard knows Todd.", "Todd knows Erica.", "Erica knows Lionel.", "Lionel knows Dick.", "Dick knows Kareem." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Richard", "Cecilia", "Todd", "Delilah", "Lionel", "Erica", "Dick", "Chelsea", "Kareem", "Caleb", "Gregory", "Alyson", "Ramona", "Haley", "Jackson", "Bruno", "Veronica", "Norman", "Eric", "Haven" ], "edges": [ [ 0, 2 ], [ 2, 7 ], [ 2, 5 ], [ 4, 1 ], [ 4, 6 ], [ 5, 3 ], [ 5, 4 ], [ 6, 8 ], [ 8, 9 ], [ 10, 12 ], [ 12, 17 ], [ 12, 15 ], [ 14, 11 ], [ 14, 16 ], [ 15, 13 ], [ 15, 14 ], [ 16, 18 ], [ 18, 19 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Samuel knows Rachel. Judith knows David. Zachary knows Harlan. David knows Lark. Zachary knows Desmond. Jerry knows Kylie. Jerry knows Isaac. Kylie knows Austin. David knows Samuel. Lark knows Ramona. Susan knows Cindy. Harlan knows Jerry. Judith knows Winston. Eli knows Candice. Jerry knows Susan. Harlan knows Melody. David knows Lucy. Eli knows Judith. Which of David and Jerry can Zachary reach?", "answer": "Jerry", "steps": [ "Zachary knows Harlan.", "Harlan knows Jerry." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Zachary", "Desmond", "Kylie", "Austin", "Melody", "Isaac", "Jerry", "Harlan", "Susan", "Cindy", "Eli", "Candice", "Samuel", "Rachel", "Winston", "Lucy", "David", "Judith", "Lark", "Ramona" ], "edges": [ [ 0, 1 ], [ 0, 7 ], [ 2, 3 ], [ 6, 2 ], [ 6, 5 ], [ 6, 8 ], [ 7, 4 ], [ 7, 6 ], [ 8, 9 ], [ 10, 11 ], [ 10, 17 ], [ 12, 13 ], [ 16, 12 ], [ 16, 15 ], [ 16, 18 ], [ 17, 14 ], [ 17, 16 ], [ 18, 19 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Ross knows Leah. Wilson knows Alma. Cynthia knows Edgar. Riley knows Cynthia. Helene knows Donovan. Edwin knows Frankie. Donovan knows Donald. Blanche knows Autumn. Alma knows Riley. Edgar knows Keira. Kara knows Blanche. Susanne knows Elmer. Edgar knows Archer. Elmer knows Hope. Hope knows Helene. Leah knows Edwin. Donovan knows Ross. Archer knows Kara. Which of Cynthia and Helene can Wilson reach?", "answer": "Cynthia", "steps": [ "Wilson knows Alma.", "Alma knows Riley.", "Riley knows Cynthia." ], "difficulty": 3, "original_distance": 8, "idx_to_symbol": [ "Wilson", "Riley", "Alma", "Blanche", "Archer", "Kara", "Cynthia", "Keira", "Autumn", "Edgar", "Susanne", "Hope", "Elmer", "Edwin", "Ross", "Leah", "Helene", "Donald", "Frankie", "Donovan" ], "edges": [ [ 0, 2 ], [ 1, 6 ], [ 2, 1 ], [ 3, 8 ], [ 4, 5 ], [ 5, 3 ], [ 6, 9 ], [ 9, 7 ], [ 9, 4 ], [ 10, 12 ], [ 11, 16 ], [ 12, 11 ], [ 13, 18 ], [ 14, 15 ], [ 15, 13 ], [ 16, 19 ], [ 19, 17 ], [ 19, 14 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Clay knows Colleen. Carla knows Atlas. Tim knows Curtis. Colleen knows Agnes. Bart knows Carla. Jessie knows Xavier. Martha knows Emmett. Carla knows Walter. Colleen knows Eldon. Atlas knows Tim. Agnes knows Eleanor. Atlas knows Basil. Lewis knows Devon. Colleen knows Lewis. Marvin knows Clay. Carla knows Jessie. Nash knows Bart. Lewis knows Martha. Which of Lewis and Atlas can Nash reach?", "answer": "Atlas", "steps": [ "Nash knows Bart.", "Bart knows Carla.", "Carla knows Atlas." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Nash", "Basil", "Xavier", "Carla", "Atlas", "Walter", "Bart", "Tim", "Jessie", "Curtis", "Marvin", "Devon", "Eleanor", "Colleen", "Lewis", "Eldon", "Clay", "Martha", "Agnes", "Emmett" ], "edges": [ [ 0, 6 ], [ 3, 5 ], [ 3, 8 ], [ 3, 4 ], [ 4, 1 ], [ 4, 7 ], [ 6, 3 ], [ 7, 9 ], [ 8, 2 ], [ 10, 16 ], [ 13, 15 ], [ 13, 18 ], [ 13, 14 ], [ 14, 11 ], [ 14, 17 ], [ 16, 13 ], [ 17, 19 ], [ 18, 12 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Janice knows Ainsley. Graeme knows Blake. Destiny knows Maria. Herbert knows Alice. Carmela knows Janice. Vicki knows Carmela. Elmer knows Estella. Janice knows Graeme. Alice knows Vicki. Wallace knows Elmer. Stefan knows Jennifer. Maria knows Stefan. Elmer knows Scott. Jules knows Glenn. Cate knows Herbert. Stefan knows Jules. Estella knows Destiny. Herbert knows Charity. Which of Vicki and Destiny can Cate reach?", "answer": "Vicki", "steps": [ "Cate knows Herbert.", "Herbert knows Alice.", "Alice knows Vicki." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Cate", "Ainsley", "Alice", "Vicki", "Herbert", "Charity", "Carmela", "Graeme", "Janice", "Blake", "Wallace", "Jennifer", "Estella", "Destiny", "Elmer", "Scott", "Maria", "Jules", "Stefan", "Glenn" ], "edges": [ [ 0, 4 ], [ 2, 3 ], [ 3, 6 ], [ 4, 5 ], [ 4, 2 ], [ 6, 8 ], [ 7, 9 ], [ 8, 1 ], [ 8, 7 ], [ 10, 14 ], [ 12, 13 ], [ 13, 16 ], [ 14, 15 ], [ 14, 12 ], [ 16, 18 ], [ 17, 19 ], [ 18, 11 ], [ 18, 17 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Myrtle knows Elijah. Jacob knows Alfred. Alfred knows Forrest. Alfred knows Anna. Elijah knows Mara. Logan knows Jacob. Yvonne knows Heather. Jennifer knows Hugh. Heather knows Clement. Mara knows Erik. Forrest knows Abel. Walt knows Sheila. Clement knows Callum. Callum knows Jocelyn. Clement knows Hadley. Jocelyn knows Jennifer. Hugh knows Walt. Abel knows Myrtle. Which of Jocelyn and Abel can Yvonne reach?", "answer": "Jocelyn", "steps": [ "Yvonne knows Heather.", "Heather knows Clement.", "Clement knows Callum.", "Callum knows Jocelyn." ], "difficulty": 4, "original_distance": 8, "idx_to_symbol": [ "Yvonne", "Jennifer", "Hadley", "Sheila", "Clement", "Callum", "Hugh", "Jocelyn", "Heather", "Walt", "Logan", "Myrtle", "Anna", "Erik", "Alfred", "Forrest", "Elijah", "Abel", "Jacob", "Mara" ], "edges": [ [ 0, 8 ], [ 1, 6 ], [ 4, 2 ], [ 4, 5 ], [ 5, 7 ], [ 6, 9 ], [ 7, 1 ], [ 8, 4 ], [ 9, 3 ], [ 10, 18 ], [ 11, 16 ], [ 14, 12 ], [ 14, 15 ], [ 15, 17 ], [ 16, 19 ], [ 17, 11 ], [ 18, 14 ], [ 19, 13 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Greta knows Derrick. Fleur knows Jana. Alan knows Leah. Leah knows Beau. Lucia knows Greta. Clayton knows Lucia. Alan knows Irma. Rebecca knows Celeste. Tina knows Yvonne. Greta knows Tina. Celeste knows Hayden. Yvonne knows Bella. Tina knows Emily. Hayden knows Alan. Derrick knows Lambert. Irma knows Mae. Irma knows Fleur. Teresa knows Clayton. Which of Irma and Tina can Teresa reach?", "answer": "Tina", "steps": [ "Teresa knows Clayton.", "Clayton knows Lucia.", "Lucia knows Greta.", "Greta knows Tina." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Teresa", "Lucia", "Clayton", "Derrick", "Tina", "Bella", "Greta", "Emily", "Lambert", "Yvonne", "Rebecca", "Hayden", "Celeste", "Leah", "Irma", "Jana", "Alan", "Mae", "Beau", "Fleur" ], "edges": [ [ 0, 2 ], [ 1, 6 ], [ 2, 1 ], [ 3, 8 ], [ 4, 7 ], [ 4, 9 ], [ 6, 3 ], [ 6, 4 ], [ 9, 5 ], [ 10, 12 ], [ 11, 16 ], [ 12, 11 ], [ 13, 18 ], [ 14, 17 ], [ 14, 19 ], [ 16, 13 ], [ 16, 14 ], [ 19, 15 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Heath knows Duke. Jacques knows Marshall. Devin knows Jodi. Jacques knows Heath. Marshall knows Harvey. Jorge knows Val. Jean knows Greta. Jean knows Thea. Jacques knows Rhonda. Greta knows Kamila. Jorge knows Devin. Heath knows Rod. Marshall knows Daria. Jean knows Jorge. Greta knows Darla. Heath knows Ebony. Daria knows Kenneth. Greta knows Eric. Which of Jodi and Kenneth can Jean reach?", "answer": "Jodi", "steps": [ "Jean knows Jorge.", "Jorge knows Devin.", "Devin knows Jodi." ], "difficulty": 3, "original_distance": 3, "idx_to_symbol": [ "Jean", "Devin", "Val", "Darla", "Eric", "Kamila", "Greta", "Thea", "Jodi", "Jorge", "Jacques", "Daria", "Harvey", "Duke", "Rod", "Ebony", "Heath", "Rhonda", "Kenneth", "Marshall" ], "edges": [ [ 0, 6 ], [ 0, 7 ], [ 0, 9 ], [ 1, 8 ], [ 6, 3 ], [ 6, 4 ], [ 6, 5 ], [ 9, 2 ], [ 9, 1 ], [ 10, 16 ], [ 10, 17 ], [ 10, 19 ], [ 11, 18 ], [ 16, 13 ], [ 16, 14 ], [ 16, 15 ], [ 19, 12 ], [ 19, 11 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Edgar knows Julio. Marshall knows Leon. Gonzalo knows Blaine. Alex knows Will. Blaine knows Alex. Leon knows Sally. Dora knows Myra. Andrea knows Paige. Myra knows Kara. Drew knows Edgar. Kara knows Greg. Sally knows Andrea. Terry knows Dora. Andrea knows Gonzalo. Jocelyn knows Edna. Edgar knows Jocelyn. Blaine knows Peter. Kara knows Drew. Which of Gonzalo and Drew can Terry reach?", "answer": "Drew", "steps": [ "Terry knows Dora.", "Dora knows Myra.", "Myra knows Kara.", "Kara knows Drew." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Terry", "Edgar", "Kara", "Edna", "Julio", "Drew", "Jocelyn", "Myra", "Dora", "Greg", "Marshall", "Blaine", "Andrea", "Will", "Peter", "Gonzalo", "Alex", "Sally", "Leon", "Paige" ], "edges": [ [ 0, 8 ], [ 1, 4 ], [ 1, 6 ], [ 2, 5 ], [ 2, 9 ], [ 5, 1 ], [ 6, 3 ], [ 7, 2 ], [ 8, 7 ], [ 10, 18 ], [ 11, 14 ], [ 11, 16 ], [ 12, 15 ], [ 12, 19 ], [ 15, 11 ], [ 16, 13 ], [ 17, 12 ], [ 18, 17 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Hardy knows Jeff. Sandy knows Hardy. Eleanor knows Austin. Hilda knows Aisha. Hardy knows Judy. June knows Eleanor. Allen knows Kane. Jeff knows Fergus. Judy knows Allen. Hardy knows Demetrius. Eleanor knows Louisa. Austin knows Keegan. Finn knows June. Hilda knows Sandy. Keegan knows Ronald. Finn knows Jolena. Eleanor knows Susan. Louisa knows Layla. Which of Ronald and Kane can Finn reach?", "answer": "Ronald", "steps": [ "Finn knows June.", "June knows Eleanor.", "Eleanor knows Austin.", "Austin knows Keegan.", "Keegan knows Ronald." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Finn", "Louisa", "June", "Eleanor", "Keegan", "Susan", "Layla", "Jolena", "Ronald", "Austin", "Hilda", "Jeff", "Sandy", "Hardy", "Allen", "Demetrius", "Fergus", "Aisha", "Kane", "Judy" ], "edges": [ [ 0, 7 ], [ 0, 2 ], [ 1, 6 ], [ 2, 3 ], [ 3, 5 ], [ 3, 1 ], [ 3, 9 ], [ 4, 8 ], [ 9, 4 ], [ 10, 17 ], [ 10, 12 ], [ 11, 16 ], [ 12, 13 ], [ 13, 15 ], [ 13, 11 ], [ 13, 19 ], [ 14, 18 ], [ 19, 14 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Quinn knows Jonah. Bonnie knows Gail. Desmond knows Rhonda. Dudley knows Iris. Bonnie knows Joseph. Joseph knows Geneva. Gail knows Lance. Iris knows Michelle. Candice knows Cyrus. Dudley knows Lane. Hamilton knows Livia. Dudley knows Desmond. Jonah knows Hamilton. Hamilton knows Dudley. Demetrius knows Bonnie. Cyrus knows Demetrius. Demetrius knows Eloise. Bonnie knows Cordelia. Which of Joseph and Iris can Candice reach?", "answer": "Joseph", "steps": [ "Candice knows Cyrus.", "Cyrus knows Demetrius.", "Demetrius knows Bonnie.", "Bonnie knows Joseph." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Candice", "Lance", "Geneva", "Bonnie", "Eloise", "Cordelia", "Demetrius", "Cyrus", "Gail", "Joseph", "Quinn", "Rhonda", "Michelle", "Dudley", "Livia", "Lane", "Hamilton", "Jonah", "Desmond", "Iris" ], "edges": [ [ 0, 7 ], [ 3, 5 ], [ 3, 8 ], [ 3, 9 ], [ 6, 4 ], [ 6, 3 ], [ 7, 6 ], [ 8, 1 ], [ 9, 2 ], [ 10, 17 ], [ 13, 15 ], [ 13, 18 ], [ 13, 19 ], [ 16, 14 ], [ 16, 13 ], [ 17, 16 ], [ 18, 11 ], [ 19, 12 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Iris knows Vivian. Justine knows Mason. Eli knows Dwight. Dwight knows Ursula. Desmond knows Lily. Justine knows Duke. Gemma knows Herman. Vivian knows Itzel. Luis knows Evelyn. Evelyn knows Desmond. Luis knows Olive. Evelyn knows Justine. Iris knows Eli. Gemma knows Iris. Vivian knows Bella. Lily knows Odette. Eli knows Byron. Desmond knows Pearl. Which of Eli and Desmond can Luis reach?", "answer": "Desmond", "steps": [ "Luis knows Evelyn.", "Evelyn knows Desmond." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Luis", "Lily", "Desmond", "Mason", "Olive", "Odette", "Evelyn", "Justine", "Pearl", "Duke", "Gemma", "Dwight", "Eli", "Bella", "Herman", "Ursula", "Iris", "Vivian", "Byron", "Itzel" ], "edges": [ [ 0, 4 ], [ 0, 6 ], [ 1, 5 ], [ 2, 1 ], [ 2, 8 ], [ 6, 2 ], [ 6, 7 ], [ 7, 3 ], [ 7, 9 ], [ 10, 14 ], [ 10, 16 ], [ 11, 15 ], [ 12, 11 ], [ 12, 18 ], [ 16, 12 ], [ 16, 17 ], [ 17, 13 ], [ 17, 19 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Paige knows Franklin. Ebony knows Eleanor. Marcia knows Beau. Marcia knows Maya. Walter knows Louis. Marcia knows Bonnie. Kristina knows Nicole. Beau knows Clark. Walter knows Marcia. Eleanor knows Eli. Ebony knows Rosa. Ebony knows Chantal. Rosa knows Lucy. Walter knows Hannah. Bonnie knows Ellen. Hannah knows Myra. Paige knows Ebony. Paige knows Kristina. Which of Eleanor and Beau can Walter reach?", "answer": "Beau", "steps": [ "Walter knows Marcia.", "Marcia knows Beau." ], "difficulty": 2, "original_distance": 3, "idx_to_symbol": [ "Walter", "Ellen", "Bonnie", "Myra", "Beau", "Maya", "Marcia", "Clark", "Louis", "Hannah", "Paige", "Lucy", "Rosa", "Nicole", "Eleanor", "Chantal", "Ebony", "Eli", "Franklin", "Kristina" ], "edges": [ [ 0, 6 ], [ 0, 8 ], [ 0, 9 ], [ 2, 1 ], [ 4, 7 ], [ 6, 2 ], [ 6, 5 ], [ 6, 4 ], [ 9, 3 ], [ 10, 16 ], [ 10, 18 ], [ 10, 19 ], [ 12, 11 ], [ 14, 17 ], [ 16, 12 ], [ 16, 15 ], [ 16, 14 ], [ 19, 13 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Samuel knows Rachel. Judith knows David. Zachary knows Harlan. David knows Lark. Zachary knows Desmond. Jerry knows Kylie. Jerry knows Isaac. Kylie knows Austin. David knows Samuel. Lark knows Ramona. Susan knows Cindy. Harlan knows Jerry. Judith knows Winston. Eli knows Candice. Jerry knows Susan. Harlan knows Melody. David knows Lucy. Eli knows Judith. Which of Lark and Susan can Zachary reach?", "answer": "Susan", "steps": [ "Zachary knows Harlan.", "Harlan knows Jerry.", "Jerry knows Susan." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Zachary", "Desmond", "Kylie", "Austin", "Melody", "Isaac", "Jerry", "Harlan", "Susan", "Cindy", "Eli", "Candice", "Samuel", "Rachel", "Winston", "Lucy", "David", "Judith", "Lark", "Ramona" ], "edges": [ [ 0, 1 ], [ 0, 7 ], [ 2, 3 ], [ 6, 2 ], [ 6, 5 ], [ 6, 8 ], [ 7, 4 ], [ 7, 6 ], [ 8, 9 ], [ 10, 11 ], [ 10, 17 ], [ 12, 13 ], [ 16, 12 ], [ 16, 15 ], [ 16, 18 ], [ 17, 14 ], [ 17, 16 ], [ 18, 19 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Arden knows Jason. Fritz knows Carlton. Fritz knows Clarence. Chad knows Virginia. Jason knows Chad. Dwight knows Dustin. Hugo knows Colby. Clarence knows Eleanor. Dustin knows Vincent. Carlton knows Kingsley. Colby knows Brock. Hugo knows Devon. Vincent knows Arturo. Vincent knows Hugo. Vincent knows Eve. Chad knows Fritz. Devon knows Jasmine. Chad knows Caroline. Which of Fritz and Hugo can Arden reach?", "answer": "Fritz", "steps": [ "Arden knows Jason.", "Jason knows Chad.", "Chad knows Fritz." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Arden", "Carlton", "Jason", "Caroline", "Eleanor", "Clarence", "Virginia", "Chad", "Kingsley", "Fritz", "Dwight", "Colby", "Dustin", "Eve", "Jasmine", "Devon", "Arturo", "Vincent", "Brock", "Hugo" ], "edges": [ [ 0, 2 ], [ 1, 8 ], [ 2, 7 ], [ 5, 4 ], [ 7, 3 ], [ 7, 6 ], [ 7, 9 ], [ 9, 5 ], [ 9, 1 ], [ 10, 12 ], [ 11, 18 ], [ 12, 17 ], [ 15, 14 ], [ 17, 13 ], [ 17, 16 ], [ 17, 19 ], [ 19, 15 ], [ 19, 11 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Lambert knows Hailey. Hattie knows Zach. Hattie knows Jay. Anton knows Perry. Lillian knows Aaron. Aaron knows Hayley. Martha knows Lillian. Anton knows Gordon. Wanda knows Alexa. Laverne knows Lambert. Elizabeth knows Hattie. Jay knows Laverne. Gordon knows Lenora. Laverne knows Bart. Aaron knows Wanda. Jay knows Shaun. Rosa knows Elizabeth. Wanda knows Anton. Which of Aaron and Hattie can Rosa reach?", "answer": "Hattie", "steps": [ "Rosa knows Elizabeth.", "Elizabeth knows Hattie." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Rosa", "Jay", "Lambert", "Laverne", "Hattie", "Hailey", "Shaun", "Bart", "Elizabeth", "Zach", "Martha", "Wanda", "Gordon", "Anton", "Aaron", "Lenora", "Alexa", "Perry", "Lillian", "Hayley" ], "edges": [ [ 0, 8 ], [ 1, 6 ], [ 1, 3 ], [ 2, 5 ], [ 3, 2 ], [ 3, 7 ], [ 4, 1 ], [ 4, 9 ], [ 8, 4 ], [ 10, 18 ], [ 11, 16 ], [ 11, 13 ], [ 12, 15 ], [ 13, 12 ], [ 13, 17 ], [ 14, 11 ], [ 14, 19 ], [ 18, 14 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Carrie knows Knox. John knows Bailey. Kane knows Sarah. Gerard knows Vera. Heath knows John. Marion knows Noel. Kane knows Carrie. Bailey knows Kane. John knows Aiden. Bailey knows Blanche. Gerard knows Ira. Ira knows Mary. Noel knows Esme. Esme knows Gerard. Noel knows Lark. Aiden knows Taylor. Lark knows Elise. Esme knows Heather. Which of Carrie and Ira can Heath reach?", "answer": "Carrie", "steps": [ "Heath knows John.", "John knows Bailey.", "Bailey knows Kane.", "Kane knows Carrie." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Heath", "Blanche", "Carrie", "John", "Aiden", "Knox", "Bailey", "Sarah", "Kane", "Taylor", "Marion", "Heather", "Ira", "Noel", "Lark", "Mary", "Esme", "Vera", "Gerard", "Elise" ], "edges": [ [ 0, 3 ], [ 2, 5 ], [ 3, 6 ], [ 3, 4 ], [ 4, 9 ], [ 6, 1 ], [ 6, 8 ], [ 8, 2 ], [ 8, 7 ], [ 10, 13 ], [ 12, 15 ], [ 13, 16 ], [ 13, 14 ], [ 14, 19 ], [ 16, 11 ], [ 16, 18 ], [ 18, 12 ], [ 18, 17 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Laura knows Howard. Maggie knows Shannon. Bridget knows Bonnie. Hattie knows Jay. Calvin knows Laura. Paige knows Betty. Calvin knows Greta. Hattie knows Chelsea. Luna knows Erin. Howard knows Destiny. Julie knows Hattie. Zachary knows Julie. Erin knows Dylan. Jay knows Bridget. Ben knows Zachary. Jay knows Paige. Dylan knows Calvin. Laura knows Maggie. Which of Julie and Dylan can Luna reach?", "answer": "Dylan", "steps": [ "Luna knows Erin.", "Erin knows Dylan." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Luna", "Greta", "Laura", "Shannon", "Dylan", "Calvin", "Destiny", "Erin", "Maggie", "Howard", "Ben", "Chelsea", "Jay", "Betty", "Julie", "Hattie", "Bonnie", "Zachary", "Paige", "Bridget" ], "edges": [ [ 0, 7 ], [ 2, 8 ], [ 2, 9 ], [ 4, 5 ], [ 5, 1 ], [ 5, 2 ], [ 7, 4 ], [ 8, 3 ], [ 9, 6 ], [ 10, 17 ], [ 12, 18 ], [ 12, 19 ], [ 14, 15 ], [ 15, 11 ], [ 15, 12 ], [ 17, 14 ], [ 18, 13 ], [ 19, 16 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Raymond knows Marlene. Dylan knows Howard. Sydney knows Demetrius. Lisa knows Dylan. Fisher knows Nadine. Bruce knows Lisa. Cooper knows Jerry. Craig knows Monroe. Marlene knows Fisher. Craig knows Maggie. Lisa knows Sydney. Jerry knows Stephanie. Monroe knows Kent. Maggie knows Khashayar. Malik knows Craig. Stephanie knows Elaine. Howard knows Cooper. Khashayar knows Raymond. Which of Howard and Khashayar can Bruce reach?", "answer": "Howard", "steps": [ "Bruce knows Lisa.", "Lisa knows Dylan.", "Dylan knows Howard." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Bruce", "Jerry", "Lisa", "Sydney", "Elaine", "Howard", "Stephanie", "Demetrius", "Cooper", "Dylan", "Malik", "Marlene", "Craig", "Monroe", "Nadine", "Khashayar", "Fisher", "Kent", "Raymond", "Maggie" ], "edges": [ [ 0, 2 ], [ 1, 6 ], [ 2, 3 ], [ 2, 9 ], [ 3, 7 ], [ 5, 8 ], [ 6, 4 ], [ 8, 1 ], [ 9, 5 ], [ 10, 12 ], [ 11, 16 ], [ 12, 13 ], [ 12, 19 ], [ 13, 17 ], [ 15, 18 ], [ 16, 14 ], [ 18, 11 ], [ 19, 15 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Frankie knows Gertrude. Jodi knows Emily. Scott knows Austin. Yvette knows Greer. Austin knows Kim. Bob knows Eve. Lloyd knows Jerry. Jerry knows Chantal. Porter knows Bob. Frankie knows Tanya. Clay knows Lloyd. Eve knows Carmen. Clay knows Yvette. Kim knows Clay. Carmen knows Lionel. Tanya knows Porter. Bob knows Jodi. Scott knows Belinda. Which of Kim and Porter can Scott reach?", "answer": "Kim", "steps": [ "Scott knows Austin.", "Austin knows Kim." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Scott", "Kim", "Yvette", "Lloyd", "Chantal", "Belinda", "Jerry", "Greer", "Austin", "Clay", "Frankie", "Porter", "Jodi", "Eve", "Lionel", "Gertrude", "Carmen", "Emily", "Tanya", "Bob" ], "edges": [ [ 0, 5 ], [ 0, 8 ], [ 1, 9 ], [ 2, 7 ], [ 3, 6 ], [ 6, 4 ], [ 8, 1 ], [ 9, 3 ], [ 9, 2 ], [ 10, 15 ], [ 10, 18 ], [ 11, 19 ], [ 12, 17 ], [ 13, 16 ], [ 16, 14 ], [ 18, 11 ], [ 19, 13 ], [ 19, 12 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Kelly knows Alison. Preston knows Drake. Wade knows Preston. Samantha knows Jana. Preston knows Sylvia. Kelly knows Selena. Jana knows Margaret. Catherine knows Evelyn. Drake knows Dwight. Drake knows Catherine. Drake knows Paula. Preston knows Conner. Kelly knows Grover. Sylvia knows Ralph. Samantha knows Jorge. Alison knows Caleb. Samantha knows Kelly. Todd knows Samantha. Which of Evelyn and Caleb can Wade reach?", "answer": "Evelyn", "steps": [ "Wade knows Preston.", "Preston knows Drake.", "Drake knows Catherine.", "Catherine knows Evelyn." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Wade", "Catherine", "Sylvia", "Drake", "Conner", "Paula", "Preston", "Dwight", "Ralph", "Evelyn", "Todd", "Alison", "Jana", "Kelly", "Jorge", "Selena", "Samantha", "Grover", "Margaret", "Caleb" ], "edges": [ [ 0, 6 ], [ 1, 9 ], [ 2, 8 ], [ 3, 5 ], [ 3, 7 ], [ 3, 1 ], [ 6, 4 ], [ 6, 2 ], [ 6, 3 ], [ 10, 16 ], [ 11, 19 ], [ 12, 18 ], [ 13, 15 ], [ 13, 17 ], [ 13, 11 ], [ 16, 14 ], [ 16, 12 ], [ 16, 13 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Ross knows Leah. Wilson knows Alma. Cynthia knows Edgar. Riley knows Cynthia. Helene knows Donovan. Edwin knows Frankie. Donovan knows Donald. Blanche knows Autumn. Alma knows Riley. Edgar knows Keira. Kara knows Blanche. Susanne knows Elmer. Edgar knows Archer. Elmer knows Hope. Hope knows Helene. Leah knows Edwin. Donovan knows Ross. Archer knows Kara. Which of Hope and Riley can Wilson reach?", "answer": "Riley", "steps": [ "Wilson knows Alma.", "Alma knows Riley." ], "difficulty": 2, "original_distance": 8, "idx_to_symbol": [ "Wilson", "Riley", "Alma", "Blanche", "Archer", "Kara", "Cynthia", "Keira", "Autumn", "Edgar", "Susanne", "Hope", "Elmer", "Edwin", "Ross", "Leah", "Helene", "Donald", "Frankie", "Donovan" ], "edges": [ [ 0, 2 ], [ 1, 6 ], [ 2, 1 ], [ 3, 8 ], [ 4, 5 ], [ 5, 3 ], [ 6, 9 ], [ 9, 7 ], [ 9, 4 ], [ 10, 12 ], [ 11, 16 ], [ 12, 11 ], [ 13, 18 ], [ 14, 15 ], [ 15, 13 ], [ 16, 19 ], [ 19, 17 ], [ 19, 14 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Josie knows Matt. Darrell knows Clark. Erma knows Kira. Gary knows Dorothy. Jem knows Gary. Harmony knows Josie. Dorothy knows Kristina. Harriet knows Norman. Clark knows Malcolm. Harmony knows Louisa. Matt knows Erma. Norman knows Dorian. Harriet knows Riley. Dorothy knows Vance. Vance knows Darrell. Dorian knows Harmony. Harlan knows Jem. Harlan knows Kelly. Which of Dorian and Gary can Harlan reach?", "answer": "Gary", "steps": [ "Harlan knows Jem.", "Jem knows Gary." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Harlan", "Clark", "Kelly", "Gary", "Jem", "Vance", "Dorothy", "Malcolm", "Kristina", "Darrell", "Harriet", "Erma", "Riley", "Dorian", "Norman", "Josie", "Harmony", "Kira", "Louisa", "Matt" ], "edges": [ [ 0, 2 ], [ 0, 4 ], [ 1, 7 ], [ 3, 6 ], [ 4, 3 ], [ 5, 9 ], [ 6, 8 ], [ 6, 5 ], [ 9, 1 ], [ 10, 12 ], [ 10, 14 ], [ 11, 17 ], [ 13, 16 ], [ 14, 13 ], [ 15, 19 ], [ 16, 18 ], [ 16, 15 ], [ 19, 11 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Greta knows Derrick. Fleur knows Jana. Alan knows Leah. Leah knows Beau. Lucia knows Greta. Clayton knows Lucia. Alan knows Irma. Rebecca knows Celeste. Tina knows Yvonne. Greta knows Tina. Celeste knows Hayden. Yvonne knows Bella. Tina knows Emily. Hayden knows Alan. Derrick knows Lambert. Irma knows Mae. Irma knows Fleur. Teresa knows Clayton. Which of Bella and Jana can Teresa reach?", "answer": "Bella", "steps": [ "Teresa knows Clayton.", "Clayton knows Lucia.", "Lucia knows Greta.", "Greta knows Tina.", "Tina knows Yvonne.", "Yvonne knows Bella." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Teresa", "Lucia", "Clayton", "Derrick", "Tina", "Bella", "Greta", "Emily", "Lambert", "Yvonne", "Rebecca", "Hayden", "Celeste", "Leah", "Irma", "Jana", "Alan", "Mae", "Beau", "Fleur" ], "edges": [ [ 0, 2 ], [ 1, 6 ], [ 2, 1 ], [ 3, 8 ], [ 4, 7 ], [ 4, 9 ], [ 6, 3 ], [ 6, 4 ], [ 9, 5 ], [ 10, 12 ], [ 11, 16 ], [ 12, 11 ], [ 13, 18 ], [ 14, 17 ], [ 14, 19 ], [ 16, 13 ], [ 16, 14 ], [ 19, 15 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Daria knows Amanda. Joel knows Kevin. Otto knows Ibrahim. Jeffery knows Adelaide. Latoya knows Shaun. Amanda knows Esperanza. Brad knows Vera. Tiffany knows Crystal. Ava knows Latoya. Kevin knows Otto. Otto knows Ava. Esperanza knows Jeffery. Vera knows Tiffany. Esperanza knows Donna. Shaun knows Jenny. Dixie knows Conner. Tiffany knows Daria. Shaun knows Dixie. Which of Daria and Ava can Joel reach?", "answer": "Ava", "steps": [ "Joel knows Kevin.", "Kevin knows Otto.", "Otto knows Ava." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Joel", "Otto", "Dixie", "Kevin", "Shaun", "Latoya", "Conner", "Jenny", "Ibrahim", "Ava", "Brad", "Tiffany", "Jeffery", "Vera", "Esperanza", "Amanda", "Adelaide", "Donna", "Crystal", "Daria" ], "edges": [ [ 0, 3 ], [ 1, 8 ], [ 1, 9 ], [ 2, 6 ], [ 3, 1 ], [ 4, 2 ], [ 4, 7 ], [ 5, 4 ], [ 9, 5 ], [ 10, 13 ], [ 11, 18 ], [ 11, 19 ], [ 12, 16 ], [ 13, 11 ], [ 14, 12 ], [ 14, 17 ], [ 15, 14 ], [ 19, 15 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Nadine knows Ethan. Sebastian knows Howard. Howard knows Adele. Ethan knows Claude. Nadine knows Foster. Hazel knows Bette. Sebastian knows Larry. Justine knows Boris. Zoe knows Leslie. Sebastian knows Mildred. Nadine knows Justine. Zoe knows Sebastian. Zoe knows Gareth. Ethan knows Jasmine. Leslie knows Brynn. Leslie knows Richard. Justine knows Ellen. Justine knows Hazel. Which of Adele and Bette can Nadine reach?", "answer": "Bette", "steps": [ "Nadine knows Justine.", "Justine knows Hazel.", "Hazel knows Bette." ], "difficulty": 3, "original_distance": 3, "idx_to_symbol": [ "Nadine", "Boris", "Foster", "Ethan", "Jasmine", "Bette", "Justine", "Ellen", "Hazel", "Claude", "Zoe", "Mildred", "Gareth", "Leslie", "Richard", "Adele", "Sebastian", "Larry", "Howard", "Brynn" ], "edges": [ [ 0, 2 ], [ 0, 6 ], [ 0, 3 ], [ 3, 4 ], [ 3, 9 ], [ 6, 1 ], [ 6, 7 ], [ 6, 8 ], [ 8, 5 ], [ 10, 12 ], [ 10, 16 ], [ 10, 13 ], [ 13, 14 ], [ 13, 19 ], [ 16, 11 ], [ 16, 17 ], [ 16, 18 ], [ 18, 15 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Courtney knows Selena. Stacy knows Vance. Marlene knows Colette. Ernie knows Peggy. Louis knows Edna. Selena knows Hector. Colette knows Marian. Peggy knows Stacy. Yasmin knows Enid. Dewey knows Courtney. Vance knows Hugh. Daphne knows Iris. Hector knows Audrey. Edna knows Ted. Audrey knows Marlene. Peggy knows Daphne. Ted knows Ernie. Audrey knows Yasmin. Which of Colette and Vance can Dewey reach?", "answer": "Colette", "steps": [ "Dewey knows Courtney.", "Courtney knows Selena.", "Selena knows Hector.", "Hector knows Audrey.", "Audrey knows Marlene.", "Marlene knows Colette." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Dewey", "Hector", "Marian", "Yasmin", "Selena", "Colette", "Enid", "Audrey", "Courtney", "Marlene", "Louis", "Ernie", "Hugh", "Daphne", "Ted", "Vance", "Iris", "Peggy", "Edna", "Stacy" ], "edges": [ [ 0, 8 ], [ 1, 7 ], [ 3, 6 ], [ 4, 1 ], [ 5, 2 ], [ 7, 3 ], [ 7, 9 ], [ 8, 4 ], [ 9, 5 ], [ 10, 18 ], [ 11, 17 ], [ 13, 16 ], [ 14, 11 ], [ 15, 12 ], [ 17, 13 ], [ 17, 19 ], [ 18, 14 ], [ 19, 15 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Tyler knows Regina. Alfonso knows Greg. Patrick knows Tyler. Regina knows Etta. Russell knows Seth. Deirdre knows Hayley. Etta knows Raquel. Frances knows Alfonso. Regina knows Russell. Alfonso knows Bob. Axel knows Lars. Deirdre knows Frances. Patrick knows Blair. Hayley knows Miranda. Raquel knows Cara. Raquel knows Winifred. Lars knows Deirdre. Axel knows Jordan. Which of Cara and Bob can Patrick reach?", "answer": "Cara", "steps": [ "Patrick knows Tyler.", "Tyler knows Regina.", "Regina knows Etta.", "Etta knows Raquel.", "Raquel knows Cara." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Patrick", "Russell", "Tyler", "Cara", "Seth", "Regina", "Etta", "Raquel", "Winifred", "Blair", "Axel", "Hayley", "Lars", "Bob", "Miranda", "Deirdre", "Frances", "Alfonso", "Greg", "Jordan" ], "edges": [ [ 0, 2 ], [ 0, 9 ], [ 1, 4 ], [ 2, 5 ], [ 5, 1 ], [ 5, 6 ], [ 6, 7 ], [ 7, 3 ], [ 7, 8 ], [ 10, 12 ], [ 10, 19 ], [ 11, 14 ], [ 12, 15 ], [ 15, 11 ], [ 15, 16 ], [ 16, 17 ], [ 17, 13 ], [ 17, 18 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Daisy knows Alison. Matthew knows Darrell. Alice knows Carla. Maude knows Marilyn. Daisy knows Demetrius. Drew knows Daisy. Marilyn knows Autumn. Matthew knows Lana. Arthur knows Alice. Lawson knows Iris. Marilyn knows Noah. Bert knows Maude. Lana knows Lawson. Maude knows Hugh. Matthew knows Stuart. Marilyn knows Arthur. Maude knows Zach. Daisy knows Matthew. Which of Lawson and Alice can Drew reach?", "answer": "Lawson", "steps": [ "Drew knows Daisy.", "Daisy knows Matthew.", "Matthew knows Lana.", "Lana knows Lawson." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Drew", "Lana", "Demetrius", "Lawson", "Darrell", "Daisy", "Iris", "Alison", "Matthew", "Stuart", "Bert", "Arthur", "Hugh", "Alice", "Noah", "Maude", "Carla", "Zach", "Marilyn", "Autumn" ], "edges": [ [ 0, 5 ], [ 1, 3 ], [ 3, 6 ], [ 5, 2 ], [ 5, 7 ], [ 5, 8 ], [ 8, 4 ], [ 8, 1 ], [ 8, 9 ], [ 10, 15 ], [ 11, 13 ], [ 13, 16 ], [ 15, 12 ], [ 15, 17 ], [ 15, 18 ], [ 18, 14 ], [ 18, 11 ], [ 18, 19 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Cassidy knows Benjamin. Frank knows Cindy. Yasmin knows Pearl. Boyd knows Colby. Cordelia knows Jewel. Pearl knows Jake. Boyd knows Lola. Lola knows Glen. Roy knows Darla. Davis knows Frank. Gerald knows Cordelia. Benjamin knows Boyd. Darla knows Gerald. Benjamin knows Davis. Gerald knows Yasmin. Jewel knows Fred. Cordelia knows Kai. Desmond knows Cassidy. Which of Benjamin and Gerald can Desmond reach?", "answer": "Benjamin", "steps": [ "Desmond knows Cassidy.", "Cassidy knows Benjamin." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Desmond", "Lola", "Colby", "Benjamin", "Glen", "Frank", "Cassidy", "Davis", "Cindy", "Boyd", "Roy", "Jewel", "Kai", "Gerald", "Fred", "Pearl", "Darla", "Yasmin", "Jake", "Cordelia" ], "edges": [ [ 0, 6 ], [ 1, 4 ], [ 3, 7 ], [ 3, 9 ], [ 5, 8 ], [ 6, 3 ], [ 7, 5 ], [ 9, 2 ], [ 9, 1 ], [ 10, 16 ], [ 11, 14 ], [ 13, 17 ], [ 13, 19 ], [ 15, 18 ], [ 16, 13 ], [ 17, 15 ], [ 19, 12 ], [ 19, 11 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Reid knows Ursula. Doug knows Ivy. Jolena knows Morgan. Freya knows Elliot. Jolena knows Gabe. Lola knows Finn. Lola knows Freya. Darrell knows Jolena. Ivy knows Lola. Andrew knows Hank. Morgan knows Ford. Doug knows Reid. Ivy knows Lawrence. Ford knows Jeremy. Chantal knows Esme. Morgan knows Chantal. Finn knows Dorian. Darrell knows Andrew. Which of Finn and Ford can Doug reach?", "answer": "Finn", "steps": [ "Doug knows Ivy.", "Ivy knows Lola.", "Lola knows Finn." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Doug", "Dorian", "Reid", "Ivy", "Elliot", "Freya", "Lola", "Lawrence", "Ursula", "Finn", "Darrell", "Jeremy", "Andrew", "Jolena", "Esme", "Chantal", "Morgan", "Gabe", "Hank", "Ford" ], "edges": [ [ 0, 2 ], [ 0, 3 ], [ 2, 8 ], [ 3, 7 ], [ 3, 6 ], [ 5, 4 ], [ 6, 5 ], [ 6, 9 ], [ 9, 1 ], [ 10, 12 ], [ 10, 13 ], [ 12, 18 ], [ 13, 17 ], [ 13, 16 ], [ 15, 14 ], [ 16, 15 ], [ 16, 19 ], [ 19, 11 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Dennis knows Florence. Holly knows Andrea. Celeste knows Cliff. Aubrey knows Dennis. Cliff knows Dustin. Florence knows Jean. Jordan knows Devin. Vivian knows Gavin. Esther knows Celeste. Vivian knows Norman. Kerry knows Annette. Cara knows Esther. Jean knows Vivian. Dennis knows Jordan. Jean knows Joan. Esther knows Holly. Cliff knows Kerry. Kerry knows Latoya. Which of Celeste and Florence can Aubrey reach?", "answer": "Florence", "steps": [ "Aubrey knows Dennis.", "Dennis knows Florence." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Aubrey", "Florence", "Devin", "Joan", "Dennis", "Jordan", "Norman", "Vivian", "Jean", "Gavin", "Cara", "Celeste", "Andrea", "Dustin", "Esther", "Holly", "Annette", "Kerry", "Cliff", "Latoya" ], "edges": [ [ 0, 4 ], [ 1, 8 ], [ 4, 5 ], [ 4, 1 ], [ 5, 2 ], [ 7, 6 ], [ 7, 9 ], [ 8, 3 ], [ 8, 7 ], [ 10, 14 ], [ 11, 18 ], [ 14, 15 ], [ 14, 11 ], [ 15, 12 ], [ 17, 16 ], [ 17, 19 ], [ 18, 13 ], [ 18, 17 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Garrison knows Dallas. Wyatt knows Darcy. Fabian knows Wyatt. Leroy knows Quinn. Fabian knows Patrick. Kay knows Garrison. Harriet knows Doug. Garrison knows Denver. Zach knows Leroy. Harriet knows Kirk. Darcy knows Zach. Denver knows Nelson. Doug knows Saul. Kaleb knows Luis. Kirk knows Kay. Zach knows Kaleb. Dallas knows Reed. Patrick knows Luther. Which of Dallas and Kaleb can Harriet reach?", "answer": "Dallas", "steps": [ "Harriet knows Kirk.", "Kirk knows Kay.", "Kay knows Garrison.", "Garrison knows Dallas." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Harriet", "Nelson", "Dallas", "Reed", "Garrison", "Denver", "Saul", "Kirk", "Doug", "Kay", "Fabian", "Quinn", "Kaleb", "Luis", "Zach", "Leroy", "Luther", "Wyatt", "Patrick", "Darcy" ], "edges": [ [ 0, 8 ], [ 0, 7 ], [ 2, 3 ], [ 4, 2 ], [ 4, 5 ], [ 5, 1 ], [ 7, 9 ], [ 8, 6 ], [ 9, 4 ], [ 10, 18 ], [ 10, 17 ], [ 12, 13 ], [ 14, 12 ], [ 14, 15 ], [ 15, 11 ], [ 17, 19 ], [ 18, 16 ], [ 19, 14 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Hayden knows Lorraine. Gabe knows Wesley. Felix knows Juan. Harris knows Robert. Brooke knows Ellen. Sydney knows Herman. Wesley knows Felix. Sydney knows Gabe. Lara knows Lydia. Ellen knows Clayton. Herman knows Lara. Harley knows Brooke. Harris knows Harley. Lydia knows Otto. Ellen knows Glenda. Felix knows Simon. Arturo knows Hayden. Robert knows Arturo. Which of Glenda and Simon can Sydney reach?", "answer": "Simon", "steps": [ "Sydney knows Gabe.", "Gabe knows Wesley.", "Wesley knows Felix.", "Felix knows Simon." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Sydney", "Lara", "Juan", "Lydia", "Wesley", "Herman", "Simon", "Felix", "Gabe", "Otto", "Harris", "Arturo", "Clayton", "Hayden", "Brooke", "Robert", "Glenda", "Ellen", "Harley", "Lorraine" ], "edges": [ [ 0, 8 ], [ 0, 5 ], [ 1, 3 ], [ 3, 9 ], [ 4, 7 ], [ 5, 1 ], [ 7, 2 ], [ 7, 6 ], [ 8, 4 ], [ 10, 18 ], [ 10, 15 ], [ 11, 13 ], [ 13, 19 ], [ 14, 17 ], [ 15, 11 ], [ 17, 12 ], [ 17, 16 ], [ 18, 14 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Neil knows Marilyn. Oliver knows Wallace. Marilyn knows Chase. Julio knows Charity. Lawson knows Oliver. Carol knows Neil. Julio knows Harry. Carol knows Mia. Khashayar knows Carrie. Mia knows Wayne. Khashayar knows Martha. Neil knows Julio. Wallace knows Ernie. Asher knows Shawn. Wallace knows Zane. Oliver knows Asher. Lawson knows Khashayar. Mia knows Humphrey. Which of Harry and Ernie can Carol reach?", "answer": "Harry", "steps": [ "Carol knows Neil.", "Neil knows Julio.", "Julio knows Harry." ], "difficulty": 3, "original_distance": 3, "idx_to_symbol": [ "Carol", "Marilyn", "Neil", "Charity", "Mia", "Wayne", "Harry", "Julio", "Chase", "Humphrey", "Lawson", "Asher", "Oliver", "Zane", "Khashayar", "Carrie", "Ernie", "Wallace", "Shawn", "Martha" ], "edges": [ [ 0, 2 ], [ 0, 4 ], [ 1, 8 ], [ 2, 7 ], [ 2, 1 ], [ 4, 5 ], [ 4, 9 ], [ 7, 3 ], [ 7, 6 ], [ 10, 12 ], [ 10, 14 ], [ 11, 18 ], [ 12, 17 ], [ 12, 11 ], [ 14, 15 ], [ 14, 19 ], [ 17, 13 ], [ 17, 16 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Samuel knows Walt. Dolly knows Sidney. Wilma knows Drake. Samuel knows Quinn. Drake knows Earl. Milton knows Dolly. Earl knows Milton. Samuel knows Albert. Eleanor knows Joyce. Samuel knows Eleanor. George knows Della. Earl knows Elias. Earl knows George. Arden knows Samuel. Joyce knows Jem. Earl knows Eli. Quinn knows Jaime. Stacy knows Arden. Which of Dolly and Joyce can Wilma reach?", "answer": "Dolly", "steps": [ "Wilma knows Drake.", "Drake knows Earl.", "Earl knows Milton.", "Milton knows Dolly." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Wilma", "Della", "Dolly", "George", "Milton", "Earl", "Elias", "Drake", "Eli", "Sidney", "Stacy", "Jaime", "Joyce", "Quinn", "Eleanor", "Samuel", "Albert", "Arden", "Walt", "Jem" ], "edges": [ [ 0, 7 ], [ 2, 9 ], [ 3, 1 ], [ 4, 2 ], [ 5, 3 ], [ 5, 6 ], [ 5, 8 ], [ 5, 4 ], [ 7, 5 ], [ 10, 17 ], [ 12, 19 ], [ 13, 11 ], [ 14, 12 ], [ 15, 13 ], [ 15, 16 ], [ 15, 18 ], [ 15, 14 ], [ 17, 15 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Allan knows Franklin. Ada knows Hal. Lily knows Daniella. Franklin knows Ada. Chantal knows Lily. Henrietta knows Heath. Henrietta knows Pearl. Etta knows Chantal. Aurora knows Henrietta. Chantal knows Allan. Aurora knows Cornelius. Alana knows Dahlia. Allan knows Carter. Carter knows Valerie. Cornelius knows Calvin. Heath knows Haley. Alyssa knows Aurora. Pearl knows Alana. Which of Henrietta and Allan can Alyssa reach?", "answer": "Henrietta", "steps": [ "Alyssa knows Aurora.", "Aurora knows Henrietta." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Alyssa", "Aurora", "Haley", "Heath", "Alana", "Pearl", "Henrietta", "Dahlia", "Cornelius", "Calvin", "Etta", "Chantal", "Valerie", "Carter", "Ada", "Franklin", "Allan", "Hal", "Lily", "Daniella" ], "edges": [ [ 0, 1 ], [ 1, 6 ], [ 1, 8 ], [ 3, 2 ], [ 4, 7 ], [ 5, 4 ], [ 6, 3 ], [ 6, 5 ], [ 8, 9 ], [ 10, 11 ], [ 11, 16 ], [ 11, 18 ], [ 13, 12 ], [ 14, 17 ], [ 15, 14 ], [ 16, 13 ], [ 16, 15 ], [ 18, 19 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Ronald knows Colleen. Hubert knows Willis. Ronald knows Jim. Willis knows Alyssa. Wesley knows Elmer. Lamont knows Elsa. Colleen knows Hubert. Colleen knows Eduardo. Eli knows Gage. Harper knows Cole. Alvin knows Cruz. Lamont knows Alvin. Alyssa knows Wesley. Esme knows Ronald. Cruz knows Eli. Gage knows Harper. Alvin knows Cornelius. Madeline knows Lamont. Which of Gage and Alyssa can Madeline reach?", "answer": "Gage", "steps": [ "Madeline knows Lamont.", "Lamont knows Alvin.", "Alvin knows Cruz.", "Cruz knows Eli.", "Eli knows Gage." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Madeline", "Elsa", "Eli", "Cruz", "Harper", "Lamont", "Cornelius", "Alvin", "Gage", "Cole", "Esme", "Jim", "Willis", "Hubert", "Wesley", "Ronald", "Eduardo", "Colleen", "Alyssa", "Elmer" ], "edges": [ [ 0, 5 ], [ 2, 8 ], [ 3, 2 ], [ 4, 9 ], [ 5, 1 ], [ 5, 7 ], [ 7, 6 ], [ 7, 3 ], [ 8, 4 ], [ 10, 15 ], [ 12, 18 ], [ 13, 12 ], [ 14, 19 ], [ 15, 11 ], [ 15, 17 ], [ 17, 16 ], [ 17, 13 ], [ 18, 14 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Myrtle knows Elijah. Jacob knows Alfred. Alfred knows Forrest. Alfred knows Anna. Elijah knows Mara. Logan knows Jacob. Yvonne knows Heather. Jennifer knows Hugh. Heather knows Clement. Mara knows Erik. Forrest knows Abel. Walt knows Sheila. Clement knows Callum. Callum knows Jocelyn. Clement knows Hadley. Jocelyn knows Jennifer. Hugh knows Walt. Abel knows Myrtle. Which of Jacob and Heather can Yvonne reach?", "answer": "Heather", "steps": [ "Yvonne knows Heather." ], "difficulty": 1, "original_distance": 8, "idx_to_symbol": [ "Yvonne", "Jennifer", "Hadley", "Sheila", "Clement", "Callum", "Hugh", "Jocelyn", "Heather", "Walt", "Logan", "Myrtle", "Anna", "Erik", "Alfred", "Forrest", "Elijah", "Abel", "Jacob", "Mara" ], "edges": [ [ 0, 8 ], [ 1, 6 ], [ 4, 2 ], [ 4, 5 ], [ 5, 7 ], [ 6, 9 ], [ 7, 1 ], [ 8, 4 ], [ 9, 3 ], [ 10, 18 ], [ 11, 16 ], [ 14, 12 ], [ 14, 15 ], [ 15, 17 ], [ 16, 19 ], [ 17, 11 ], [ 18, 14 ], [ 19, 13 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Dennis knows Colin. Dennis knows Kareem. Ruby knows Janice. Ruby knows Duke. Hank knows Edmund. Hank knows Arthur. Dennis knows Amber. Marlene knows Camille. Marlene knows Kevin. Hailey knows Hank. Duke knows Eden. Ruby knows Hector. Clark knows Hailey. Arthur knows Emery. Amber knows Bryan. Bryan knows Ruby. Hank knows Aiden. Marlene knows Clark. Which of Bryan and Hailey can Marlene reach?", "answer": "Hailey", "steps": [ "Marlene knows Clark.", "Clark knows Hailey." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Marlene", "Emery", "Camille", "Clark", "Aiden", "Arthur", "Hank", "Edmund", "Kevin", "Hailey", "Dennis", "Eden", "Colin", "Amber", "Janice", "Duke", "Ruby", "Hector", "Kareem", "Bryan" ], "edges": [ [ 0, 2 ], [ 0, 8 ], [ 0, 3 ], [ 3, 9 ], [ 5, 1 ], [ 6, 4 ], [ 6, 5 ], [ 6, 7 ], [ 9, 6 ], [ 10, 12 ], [ 10, 18 ], [ 10, 13 ], [ 13, 19 ], [ 15, 11 ], [ 16, 14 ], [ 16, 15 ], [ 16, 17 ], [ 19, 16 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Mara knows Heath. Emmett knows Doris. Gregory knows Michelle. Gemma knows Vicki. Gregory knows Darren. Luke knows Mae. Vicki knows Isaac. Mia knows Elaine. Heath knows Mia. Mae knows Autumn. Isaac knows Ira. Luke knows Hadley. Autumn knows Gregory. Doris knows Luke. Doris knows Edward. Isaac knows Mara. Vicki knows Leonard. Mia knows Della. Which of Isaac and Luke can Gemma reach?", "answer": "Isaac", "steps": [ "Gemma knows Vicki.", "Vicki knows Isaac." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Gemma", "Ira", "Leonard", "Mara", "Vicki", "Elaine", "Isaac", "Mia", "Heath", "Della", "Emmett", "Hadley", "Edward", "Mae", "Doris", "Darren", "Luke", "Gregory", "Autumn", "Michelle" ], "edges": [ [ 0, 4 ], [ 3, 8 ], [ 4, 2 ], [ 4, 6 ], [ 6, 1 ], [ 6, 3 ], [ 7, 5 ], [ 7, 9 ], [ 8, 7 ], [ 10, 14 ], [ 13, 18 ], [ 14, 12 ], [ 14, 16 ], [ 16, 11 ], [ 16, 13 ], [ 17, 15 ], [ 17, 19 ], [ 18, 17 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Dennis knows Florence. Holly knows Andrea. Celeste knows Cliff. Aubrey knows Dennis. Cliff knows Dustin. Florence knows Jean. Jordan knows Devin. Vivian knows Gavin. Esther knows Celeste. Vivian knows Norman. Kerry knows Annette. Cara knows Esther. Jean knows Vivian. Dennis knows Jordan. Jean knows Joan. Esther knows Holly. Cliff knows Kerry. Kerry knows Latoya. Which of Kerry and Vivian can Aubrey reach?", "answer": "Vivian", "steps": [ "Aubrey knows Dennis.", "Dennis knows Florence.", "Florence knows Jean.", "Jean knows Vivian." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Aubrey", "Florence", "Devin", "Joan", "Dennis", "Jordan", "Norman", "Vivian", "Jean", "Gavin", "Cara", "Celeste", "Andrea", "Dustin", "Esther", "Holly", "Annette", "Kerry", "Cliff", "Latoya" ], "edges": [ [ 0, 4 ], [ 1, 8 ], [ 4, 5 ], [ 4, 1 ], [ 5, 2 ], [ 7, 6 ], [ 7, 9 ], [ 8, 3 ], [ 8, 7 ], [ 10, 14 ], [ 11, 18 ], [ 14, 15 ], [ 14, 11 ], [ 15, 12 ], [ 17, 16 ], [ 17, 19 ], [ 18, 13 ], [ 18, 17 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Virginia knows Bonnie. Anton knows Wilson. Eloise knows Sara. Percy knows Amy. Glenn knows Virginia. Eloise knows Doris. Josie knows Eloise. Daria knows Erma. Anton knows Evelyn. Percy knows Jill. Sara knows Langston. Virginia knows Preston. Daria knows Percy. Daria knows Brenda. Langston knows Hope. Preston knows Daria. Langston knows Anton. Langston knows Trevor. Which of Virginia and Eloise can Josie reach?", "answer": "Eloise", "steps": [ "Josie knows Eloise." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Josie", "Doris", "Trevor", "Eloise", "Wilson", "Langston", "Anton", "Hope", "Sara", "Evelyn", "Glenn", "Bonnie", "Erma", "Virginia", "Amy", "Daria", "Percy", "Brenda", "Preston", "Jill" ], "edges": [ [ 0, 3 ], [ 3, 1 ], [ 3, 8 ], [ 5, 2 ], [ 5, 7 ], [ 5, 6 ], [ 6, 4 ], [ 6, 9 ], [ 8, 5 ], [ 10, 13 ], [ 13, 11 ], [ 13, 18 ], [ 15, 12 ], [ 15, 17 ], [ 15, 16 ], [ 16, 14 ], [ 16, 19 ], [ 18, 15 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Palmer knows Victoria. Clyde knows George. Vincent knows Teresa. Roy knows Hugh. Palmer knows Ethan. Jeffery knows Nadine. Peggy knows Finn. Brooks knows Jenny. Jack knows Jeffery. Roy knows Palmer. Jeffery knows Jesse. Jack knows Neville. Jack knows Alex. Roy knows Mike. Teresa knows Roy. Jenny knows Peggy. George knows Vincent. Finn knows Jack. Which of Roy and Jack can Clyde reach?", "answer": "Roy", "steps": [ "Clyde knows George.", "George knows Vincent.", "Vincent knows Teresa.", "Teresa knows Roy." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Clyde", "Palmer", "Ethan", "Hugh", "Teresa", "George", "Vincent", "Victoria", "Roy", "Mike", "Brooks", "Jeffery", "Nadine", "Neville", "Finn", "Jenny", "Peggy", "Jesse", "Jack", "Alex" ], "edges": [ [ 0, 5 ], [ 1, 2 ], [ 1, 7 ], [ 4, 8 ], [ 5, 6 ], [ 6, 4 ], [ 8, 3 ], [ 8, 1 ], [ 8, 9 ], [ 10, 15 ], [ 11, 12 ], [ 11, 17 ], [ 14, 18 ], [ 15, 16 ], [ 16, 14 ], [ 18, 13 ], [ 18, 11 ], [ 18, 19 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Tara knows Amy. Lee knows Marie. Jillian knows Margaret. Connor knows India. India knows Jillian. Lee knows Keaton. Houston knows Hilda. Hilda knows Zelda. Lois knows Gareth. Milo knows Houston. Keaton knows Esther. Hilda knows Lucia. Jillian knows Lee. Esther knows Lois. Zelda knows Tara. Amy knows Angelica. Zelda knows Mary. Angelica knows Javier. Which of Jillian and Hilda can Connor reach?", "answer": "Jillian", "steps": [ "Connor knows India.", "India knows Jillian." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Connor", "Lee", "Margaret", "Keaton", "Gareth", "Esther", "Jillian", "Marie", "India", "Lois", "Milo", "Zelda", "Lucia", "Tara", "Javier", "Amy", "Hilda", "Mary", "Houston", "Angelica" ], "edges": [ [ 0, 8 ], [ 1, 7 ], [ 1, 3 ], [ 3, 5 ], [ 5, 9 ], [ 6, 2 ], [ 6, 1 ], [ 8, 6 ], [ 9, 4 ], [ 10, 18 ], [ 11, 17 ], [ 11, 13 ], [ 13, 15 ], [ 15, 19 ], [ 16, 12 ], [ 16, 11 ], [ 18, 16 ], [ 19, 14 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Marshall knows Heather. Ida knows Deanna. Edgar knows Edward. Scott knows Darius. Darius knows Ida. Cole knows Felicia. Samantha knows Cole. Robin knows Scott. Julian knows Blanche. Darius knows Samantha. Felicia knows Morris. Heather knows Luther. Marshall knows Edgar. Aurora knows Marshall. Blanche knows Aurora. Luther knows Fleur. Fleur knows Hilda. Joy knows Robin. Which of Fleur and Felicia can Julian reach?", "answer": "Fleur", "steps": [ "Julian knows Blanche.", "Blanche knows Aurora.", "Aurora knows Marshall.", "Marshall knows Heather.", "Heather knows Luther.", "Luther knows Fleur." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Julian", "Fleur", "Edward", "Marshall", "Luther", "Hilda", "Blanche", "Aurora", "Edgar", "Heather", "Joy", "Felicia", "Deanna", "Darius", "Cole", "Morris", "Robin", "Scott", "Ida", "Samantha" ], "edges": [ [ 0, 6 ], [ 1, 5 ], [ 3, 8 ], [ 3, 9 ], [ 4, 1 ], [ 6, 7 ], [ 7, 3 ], [ 8, 2 ], [ 9, 4 ], [ 10, 16 ], [ 11, 15 ], [ 13, 18 ], [ 13, 19 ], [ 14, 11 ], [ 16, 17 ], [ 17, 13 ], [ 18, 12 ], [ 19, 14 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Sandy knows Cristina. Cristina knows Eleanor. Arlene knows Alder. Eleanor knows Opal. Arlene knows Dewey. Tamara knows Louis. Eleanor knows Gene. Adelaide knows Ellis. Opal knows Adelaide. Stella knows Judy. Dewey knows Tamara. Brenda knows Darcy. Judy knows Arlene. Alder knows Brenda. Peggy knows Abel. Brenda knows Lola. Adelaide knows Allen. Gene knows Peggy. Which of Lola and Ellis can Stella reach?", "answer": "Lola", "steps": [ "Stella knows Judy.", "Judy knows Arlene.", "Arlene knows Alder.", "Alder knows Brenda.", "Brenda knows Lola." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Stella", "Louis", "Arlene", "Lola", "Darcy", "Dewey", "Alder", "Judy", "Tamara", "Brenda", "Sandy", "Abel", "Eleanor", "Ellis", "Allen", "Gene", "Opal", "Cristina", "Peggy", "Adelaide" ], "edges": [ [ 0, 7 ], [ 2, 5 ], [ 2, 6 ], [ 5, 8 ], [ 6, 9 ], [ 7, 2 ], [ 8, 1 ], [ 9, 3 ], [ 9, 4 ], [ 10, 17 ], [ 12, 15 ], [ 12, 16 ], [ 15, 18 ], [ 16, 19 ], [ 17, 12 ], [ 18, 11 ], [ 19, 13 ], [ 19, 14 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Tina knows Gene. Jonah knows Tina. Dale knows Shannon. Tina knows Dale. Hannah knows June. Corey knows Courtney. Cesar knows Hannah. Gene knows Archie. Miranda knows Jonah. June knows Cooper. Jenna knows Jorge. Miranda knows Jameson. Gene knows Dexter. Cesar knows Glen. Cooper knows Connor. Jenna knows Corey. Dexter knows Audrey. June knows Jenna. Which of Audrey and Courtney can Miranda reach?", "answer": "Audrey", "steps": [ "Miranda knows Jonah.", "Jonah knows Tina.", "Tina knows Gene.", "Gene knows Dexter.", "Dexter knows Audrey." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Miranda", "Tina", "Shannon", "Jonah", "Dexter", "Audrey", "Gene", "Dale", "Jameson", "Archie", "Cesar", "June", "Connor", "Hannah", "Corey", "Courtney", "Jenna", "Cooper", "Glen", "Jorge" ], "edges": [ [ 0, 8 ], [ 0, 3 ], [ 1, 7 ], [ 1, 6 ], [ 3, 1 ], [ 4, 5 ], [ 6, 4 ], [ 6, 9 ], [ 7, 2 ], [ 10, 18 ], [ 10, 13 ], [ 11, 17 ], [ 11, 16 ], [ 13, 11 ], [ 14, 15 ], [ 16, 14 ], [ 16, 19 ], [ 17, 12 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Jose knows Ross. Layla knows Clyde. Corinne knows Julia. Lars knows Jose. Dahlia knows Melissa. Yuki knows Lars. Tessa knows Dahlia. Lars knows Layla. Curtis knows Isla. Amelia knows Tessa. Julia knows Yolanda. Ross knows Carlos. Carlos knows Corinne. Isla knows Amanda. Lamar knows Curtis. Brandon knows Clement. Melissa knows Brandon. Curtis knows Amelia. Which of Jose and Amelia can Yuki reach?", "answer": "Jose", "steps": [ "Yuki knows Lars.", "Lars knows Jose." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Yuki", "Carlos", "Julia", "Ross", "Lars", "Yolanda", "Corinne", "Jose", "Clyde", "Layla", "Lamar", "Dahlia", "Brandon", "Tessa", "Curtis", "Clement", "Melissa", "Amelia", "Amanda", "Isla" ], "edges": [ [ 0, 4 ], [ 1, 6 ], [ 2, 5 ], [ 3, 1 ], [ 4, 7 ], [ 4, 9 ], [ 6, 2 ], [ 7, 3 ], [ 9, 8 ], [ 10, 14 ], [ 11, 16 ], [ 12, 15 ], [ 13, 11 ], [ 14, 17 ], [ 14, 19 ], [ 16, 12 ], [ 17, 13 ], [ 19, 18 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Palmer knows Victoria. Clyde knows George. Vincent knows Teresa. Roy knows Hugh. Palmer knows Ethan. Jeffery knows Nadine. Peggy knows Finn. Brooks knows Jenny. Jack knows Jeffery. Roy knows Palmer. Jeffery knows Jesse. Jack knows Neville. Jack knows Alex. Roy knows Mike. Teresa knows Roy. Jenny knows Peggy. George knows Vincent. Finn knows Jack. Which of Peggy and Vincent can Clyde reach?", "answer": "Vincent", "steps": [ "Clyde knows George.", "George knows Vincent." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Clyde", "Palmer", "Ethan", "Hugh", "Teresa", "George", "Vincent", "Victoria", "Roy", "Mike", "Brooks", "Jeffery", "Nadine", "Neville", "Finn", "Jenny", "Peggy", "Jesse", "Jack", "Alex" ], "edges": [ [ 0, 5 ], [ 1, 2 ], [ 1, 7 ], [ 4, 8 ], [ 5, 6 ], [ 6, 4 ], [ 8, 3 ], [ 8, 1 ], [ 8, 9 ], [ 10, 15 ], [ 11, 12 ], [ 11, 17 ], [ 14, 18 ], [ 15, 16 ], [ 16, 14 ], [ 18, 13 ], [ 18, 11 ], [ 18, 19 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Brent knows Cruz. Bella knows Pat. Darla knows Brent. Shaun knows Eleanor. Eleanor knows Parker. Parker knows Vera. Mitchell knows Marion. Boyd knows Todd. Cruz knows Rose. Marion knows Leonard. Darla knows Sam. Rose knows Garland. Todd knows Neil. Bella knows Boyd. Shaun knows Katherine. Garland knows Mitchell. Neil knows Shaun. Garland knows Brian. Which of Neil and Rose can Darla reach?", "answer": "Rose", "steps": [ "Darla knows Brent.", "Brent knows Cruz.", "Cruz knows Rose." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Darla", "Mitchell", "Leonard", "Marion", "Brian", "Cruz", "Brent", "Rose", "Garland", "Sam", "Bella", "Eleanor", "Vera", "Parker", "Katherine", "Todd", "Boyd", "Neil", "Shaun", "Pat" ], "edges": [ [ 0, 6 ], [ 0, 9 ], [ 1, 3 ], [ 3, 2 ], [ 5, 7 ], [ 6, 5 ], [ 7, 8 ], [ 8, 1 ], [ 8, 4 ], [ 10, 16 ], [ 10, 19 ], [ 11, 13 ], [ 13, 12 ], [ 15, 17 ], [ 16, 15 ], [ 17, 18 ], [ 18, 11 ], [ 18, 14 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Eleanor knows Annie. Irma knows Dewey. Kingsley knows Otto. Dewey knows Lola. Lola knows Jenna. Effie knows Keegan. Kingsley knows Garrison. Otto knows Shannon. Garrison knows Jolene. Eleanor knows Irma. Irma knows Garland. Garrison knows Esther. Sadie knows Kingsley. Jolene knows Kirsten. Kirsten knows Jasmine. Shannon knows Sierra. Tiffany knows Eleanor. Annie knows Effie. Which of Garrison and Irma can Sadie reach?", "answer": "Garrison", "steps": [ "Sadie knows Kingsley.", "Kingsley knows Garrison." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Sadie", "Kirsten", "Shannon", "Kingsley", "Otto", "Sierra", "Jolene", "Jasmine", "Garrison", "Esther", "Tiffany", "Lola", "Effie", "Eleanor", "Annie", "Keegan", "Dewey", "Jenna", "Irma", "Garland" ], "edges": [ [ 0, 3 ], [ 1, 7 ], [ 2, 5 ], [ 3, 4 ], [ 3, 8 ], [ 4, 2 ], [ 6, 1 ], [ 8, 6 ], [ 8, 9 ], [ 10, 13 ], [ 11, 17 ], [ 12, 15 ], [ 13, 14 ], [ 13, 18 ], [ 14, 12 ], [ 16, 11 ], [ 18, 16 ], [ 18, 19 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Nicole knows Daniel. Franklin knows Lewis. Lewis knows Adam. Grady knows Willard. Laura knows Bennett. Willard knows Henry. Jacques knows Trevor. Adam knows Laura. Henry knows Ramona. Archer knows Karina. Laura knows Vernon. Cruz knows Nicole. Vernon knows Archer. Franklin knows Ingrid. Henry knows Jacques. Nicole knows Grady. Ethan knows Franklin. Trevor knows Dana. Which of Trevor and Archer can Cruz reach?", "answer": "Trevor", "steps": [ "Cruz knows Nicole.", "Nicole knows Grady.", "Grady knows Willard.", "Willard knows Henry.", "Henry knows Jacques.", "Jacques knows Trevor." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Cruz", "Dana", "Daniel", "Henry", "Trevor", "Ramona", "Grady", "Willard", "Nicole", "Jacques", "Ethan", "Karina", "Ingrid", "Laura", "Archer", "Bennett", "Lewis", "Adam", "Franklin", "Vernon" ], "edges": [ [ 0, 8 ], [ 3, 5 ], [ 3, 9 ], [ 4, 1 ], [ 6, 7 ], [ 7, 3 ], [ 8, 2 ], [ 8, 6 ], [ 9, 4 ], [ 10, 18 ], [ 13, 15 ], [ 13, 19 ], [ 14, 11 ], [ 16, 17 ], [ 17, 13 ], [ 18, 12 ], [ 18, 16 ], [ 19, 14 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "April knows Rick. Gemma knows Fred. Fred knows Agnes. Vernon knows Cassidy. Val knows Lamont. Vernon knows Crystal. Val knows Nicole. Barry knows Eva. Gemma knows Verna. Agnes knows Val. Thomas knows Barry. Barry knows Vernon. April knows Sydney. Gemma knows Victor. Lyric knows Gemma. Fred knows Gustavo. Barry knows Lorna. Crystal knows April. Which of Crystal and Agnes can Thomas reach?", "answer": "Crystal", "steps": [ "Thomas knows Barry.", "Barry knows Vernon.", "Vernon knows Crystal." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Thomas", "Eva", "Rick", "Sydney", "April", "Lorna", "Barry", "Crystal", "Cassidy", "Vernon", "Lyric", "Verna", "Nicole", "Lamont", "Val", "Victor", "Gemma", "Agnes", "Gustavo", "Fred" ], "edges": [ [ 0, 6 ], [ 4, 2 ], [ 4, 3 ], [ 6, 1 ], [ 6, 5 ], [ 6, 9 ], [ 7, 4 ], [ 9, 7 ], [ 9, 8 ], [ 10, 16 ], [ 14, 12 ], [ 14, 13 ], [ 16, 11 ], [ 16, 15 ], [ 16, 19 ], [ 17, 14 ], [ 19, 17 ], [ 19, 18 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Linda knows Malcolm. Linda knows Levi. Estelle knows Isadora. Winston knows Merle. Omar knows Neville. Samantha knows Flora. Eugene knows Damian. Omar knows Dixie. Flora knows Eugene. Damian knows Noel. Levi knows Omar. Lucille knows Winston. Dixie knows Isaac. Noel knows Julio. Isaac knows Estelle. Flora knows Tara. Lucille knows Samantha. Malcolm knows Brent. Which of Damian and Isaac can Lucille reach?", "answer": "Damian", "steps": [ "Lucille knows Samantha.", "Samantha knows Flora.", "Flora knows Eugene.", "Eugene knows Damian." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Lucille", "Tara", "Merle", "Julio", "Winston", "Flora", "Damian", "Eugene", "Samantha", "Noel", "Linda", "Neville", "Brent", "Isadora", "Malcolm", "Omar", "Isaac", "Dixie", "Levi", "Estelle" ], "edges": [ [ 0, 4 ], [ 0, 8 ], [ 4, 2 ], [ 5, 1 ], [ 5, 7 ], [ 6, 9 ], [ 7, 6 ], [ 8, 5 ], [ 9, 3 ], [ 10, 14 ], [ 10, 18 ], [ 14, 12 ], [ 15, 11 ], [ 15, 17 ], [ 16, 19 ], [ 17, 16 ], [ 18, 15 ], [ 19, 13 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Fergus knows Annie. Edith knows Caroline. Ramona knows Preston. Esther knows Dayton. Caroline knows Fergus. Preston knows Duncan. Darwin knows Frank. Frank knows Andrew. Duncan knows Garrett. Hugo knows Isaac. Preston knows Effie. Duncan knows Edith. Frank knows Lamont. Isaac knows Everett. Lamont knows Esther. Edith knows Morgan. Lamont knows Kelsey. Esther knows Hugo. Which of Everett and Annie can Ramona reach?", "answer": "Annie", "steps": [ "Ramona knows Preston.", "Preston knows Duncan.", "Duncan knows Edith.", "Edith knows Caroline.", "Caroline knows Fergus.", "Fergus knows Annie." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Ramona", "Caroline", "Edith", "Fergus", "Garrett", "Effie", "Annie", "Morgan", "Duncan", "Preston", "Darwin", "Hugo", "Esther", "Isaac", "Kelsey", "Andrew", "Everett", "Dayton", "Lamont", "Frank" ], "edges": [ [ 0, 9 ], [ 1, 3 ], [ 2, 1 ], [ 2, 7 ], [ 3, 6 ], [ 8, 4 ], [ 8, 2 ], [ 9, 5 ], [ 9, 8 ], [ 10, 19 ], [ 11, 13 ], [ 12, 11 ], [ 12, 17 ], [ 13, 16 ], [ 18, 14 ], [ 18, 12 ], [ 19, 15 ], [ 19, 18 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Dorian knows Kennedy. Rachel knows Kerry. Hugh knows Dorian. Liam knows Rachel. Jean knows Gladys. Kaleb knows Delia. Willis knows Hugh. Gunnar knows Graeme. Nicole knows Gunnar. Graeme knows Clyde. Yolanda knows Colby. Colby knows Willis. Gladys knows Kaleb. Dustin knows Isadora. Jean knows Liam. Delia knows Cara. Kerry knows Dustin. Yolanda knows Nicole. Which of Kennedy and Isadora can Jean reach?", "answer": "Isadora", "steps": [ "Jean knows Liam.", "Liam knows Rachel.", "Rachel knows Kerry.", "Kerry knows Dustin.", "Dustin knows Isadora." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Jean", "Kerry", "Gladys", "Liam", "Rachel", "Kaleb", "Dustin", "Cara", "Delia", "Isadora", "Yolanda", "Hugh", "Nicole", "Colby", "Willis", "Gunnar", "Dorian", "Clyde", "Graeme", "Kennedy" ], "edges": [ [ 0, 2 ], [ 0, 3 ], [ 1, 6 ], [ 2, 5 ], [ 3, 4 ], [ 4, 1 ], [ 5, 8 ], [ 6, 9 ], [ 8, 7 ], [ 10, 12 ], [ 10, 13 ], [ 11, 16 ], [ 12, 15 ], [ 13, 14 ], [ 14, 11 ], [ 15, 18 ], [ 16, 19 ], [ 18, 17 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Tonya knows Della. Hope knows Winston. Taylor knows Tim. Cora knows Ida. Byron knows Evan. Tonya knows Taylor. Paige knows Shannon. Lewis knows Paige. Tim knows Josie. Daisy knows Marvin. Lucy knows Virgil. Cora knows Dudley. Evan knows Janice. Daisy knows Lewis. Daisy knows Hope. Ida knows Lucy. Hope knows Byron. Cora knows Tonya. Which of Josie and Janice can Cora reach?", "answer": "Josie", "steps": [ "Cora knows Tonya.", "Tonya knows Taylor.", "Taylor knows Tim.", "Tim knows Josie." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Cora", "Josie", "Taylor", "Tim", "Lucy", "Virgil", "Della", "Ida", "Tonya", "Dudley", "Daisy", "Janice", "Byron", "Evan", "Paige", "Shannon", "Winston", "Lewis", "Hope", "Marvin" ], "edges": [ [ 0, 7 ], [ 0, 8 ], [ 0, 9 ], [ 2, 3 ], [ 3, 1 ], [ 4, 5 ], [ 7, 4 ], [ 8, 2 ], [ 8, 6 ], [ 10, 17 ], [ 10, 18 ], [ 10, 19 ], [ 12, 13 ], [ 13, 11 ], [ 14, 15 ], [ 17, 14 ], [ 18, 12 ], [ 18, 16 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Jade knows Oscar. Abby knows Clifford. Jade knows Isaac. Jenny knows Monica. Jenny knows Dewey. Homer knows Ernesto. Conner knows Abby. Dewey knows Homer. Abby knows Valerie. Sue knows Conner. Isaac knows Jenny. Clifford knows Kimberly. Essie knows Jonathan. Dewey knows Donald. Clifford knows Essie. Monica knows Rex. Sue knows Yara. Valerie knows Maureen. Which of Jonathan and Ernesto can Jade reach?", "answer": "Ernesto", "steps": [ "Jade knows Isaac.", "Isaac knows Jenny.", "Jenny knows Dewey.", "Dewey knows Homer.", "Homer knows Ernesto." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Jade", "Jenny", "Donald", "Isaac", "Homer", "Monica", "Dewey", "Oscar", "Rex", "Ernesto", "Sue", "Abby", "Kimberly", "Conner", "Essie", "Valerie", "Clifford", "Yara", "Maureen", "Jonathan" ], "edges": [ [ 0, 7 ], [ 0, 3 ], [ 1, 5 ], [ 1, 6 ], [ 3, 1 ], [ 4, 9 ], [ 5, 8 ], [ 6, 2 ], [ 6, 4 ], [ 10, 17 ], [ 10, 13 ], [ 11, 15 ], [ 11, 16 ], [ 13, 11 ], [ 14, 19 ], [ 15, 18 ], [ 16, 12 ], [ 16, 14 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Maria knows Irma. Alma knows Maria. Irma knows Sylvia. Jolene knows Tanya. Belinda knows Gordon. Irma knows Allen. Harmony knows Dean. Riley knows Tony. Esperanza knows Jolene. Dominic knows Esperanza. Tanya knows Blanche. Harmony knows Belinda. Dominic knows Luna. Esperanza knows Luke. Tanya knows Elias. Riley knows Dominic. Alma knows Taylor. Belinda knows Alma. Which of Blanche and Allen can Harmony reach?", "answer": "Allen", "steps": [ "Harmony knows Belinda.", "Belinda knows Alma.", "Alma knows Maria.", "Maria knows Irma.", "Irma knows Allen." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Harmony", "Allen", "Alma", "Maria", "Belinda", "Taylor", "Irma", "Dean", "Gordon", "Sylvia", "Riley", "Blanche", "Esperanza", "Jolene", "Dominic", "Luke", "Tanya", "Tony", "Luna", "Elias" ], "edges": [ [ 0, 7 ], [ 0, 4 ], [ 2, 5 ], [ 2, 3 ], [ 3, 6 ], [ 4, 8 ], [ 4, 2 ], [ 6, 1 ], [ 6, 9 ], [ 10, 17 ], [ 10, 14 ], [ 12, 15 ], [ 12, 13 ], [ 13, 16 ], [ 14, 18 ], [ 14, 12 ], [ 16, 11 ], [ 16, 19 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Tara knows Amy. Lee knows Marie. Jillian knows Margaret. Connor knows India. India knows Jillian. Lee knows Keaton. Houston knows Hilda. Hilda knows Zelda. Lois knows Gareth. Milo knows Houston. Keaton knows Esther. Hilda knows Lucia. Jillian knows Lee. Esther knows Lois. Zelda knows Tara. Amy knows Angelica. Zelda knows Mary. Angelica knows Javier. Which of Houston and India can Connor reach?", "answer": "India", "steps": [ "Connor knows India." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Connor", "Lee", "Margaret", "Keaton", "Gareth", "Esther", "Jillian", "Marie", "India", "Lois", "Milo", "Zelda", "Lucia", "Tara", "Javier", "Amy", "Hilda", "Mary", "Houston", "Angelica" ], "edges": [ [ 0, 8 ], [ 1, 7 ], [ 1, 3 ], [ 3, 5 ], [ 5, 9 ], [ 6, 2 ], [ 6, 1 ], [ 8, 6 ], [ 9, 4 ], [ 10, 18 ], [ 11, 17 ], [ 11, 13 ], [ 13, 15 ], [ 15, 19 ], [ 16, 12 ], [ 16, 11 ], [ 18, 16 ], [ 19, 14 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Karl knows Dallas. Marvin knows Rosemary. Gabriel knows Adrian. Lennox knows Ramona. Gabriel knows Pam. Kara knows Alvin. Lenora knows Loretta. Pam knows Mary. Marvin knows Chandler. Chandler knows Ted. Ramona knows Evan. Karl knows Jonah. Chandler knows Lenora. Evan knows Marvin. Evan knows Nancy. Alvin knows Karl. Jonah knows Blake. Jonah knows Gabriel. Which of Jonah and Marvin can Kara reach?", "answer": "Jonah", "steps": [ "Kara knows Alvin.", "Alvin knows Karl.", "Karl knows Jonah." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Kara", "Pam", "Karl", "Jonah", "Gabriel", "Dallas", "Blake", "Alvin", "Adrian", "Mary", "Lennox", "Lenora", "Evan", "Marvin", "Chandler", "Nancy", "Rosemary", "Ramona", "Ted", "Loretta" ], "edges": [ [ 0, 7 ], [ 1, 9 ], [ 2, 5 ], [ 2, 3 ], [ 3, 6 ], [ 3, 4 ], [ 4, 8 ], [ 4, 1 ], [ 7, 2 ], [ 10, 17 ], [ 11, 19 ], [ 12, 15 ], [ 12, 13 ], [ 13, 16 ], [ 13, 14 ], [ 14, 18 ], [ 14, 11 ], [ 17, 12 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Susanne knows Knox. Jana knows Jamie. Thea knows Sydney. Sydney knows Larissa. Kobe knows Percy. Knox knows Irene. Percy knows Jeanette. Thea knows Whitney. Shane knows Kobe. Knox knows Jem. Percy knows Howard. Jem knows Thea. Ethan knows Shane. Shane knows Clay. Ashley knows Kelly. Jeanette knows Jack. Jana knows Susanne. Ashley knows Ethan. Which of Jem and Kobe can Jana reach?", "answer": "Jem", "steps": [ "Jana knows Susanne.", "Susanne knows Knox.", "Knox knows Jem." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Jana", "Jamie", "Thea", "Irene", "Larissa", "Whitney", "Sydney", "Jem", "Knox", "Susanne", "Ashley", "Kelly", "Percy", "Clay", "Jack", "Howard", "Jeanette", "Kobe", "Shane", "Ethan" ], "edges": [ [ 0, 1 ], [ 0, 9 ], [ 2, 5 ], [ 2, 6 ], [ 6, 4 ], [ 7, 2 ], [ 8, 3 ], [ 8, 7 ], [ 9, 8 ], [ 10, 11 ], [ 10, 19 ], [ 12, 15 ], [ 12, 16 ], [ 16, 14 ], [ 17, 12 ], [ 18, 13 ], [ 18, 17 ], [ 19, 18 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Oscar knows Marcia. Judy knows Otto. Julie knows Fraser. Lorraine knows Colette. Gunnar knows Oscar. Derek knows Nora. Gunnar knows Derek. Lorraine knows Morgan. Julie knows Brooke. Electra knows Blake. Monica knows Lorraine. Derek knows Sydney. Judy knows Cooper. Blake knows Porter. Electra knows Julie. Sydney knows Monica. Brooke knows Joan. Joan knows Judy. Which of Julie and Derek can Electra reach?", "answer": "Julie", "steps": [ "Electra knows Julie." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Electra", "Fraser", "Brooke", "Judy", "Blake", "Porter", "Otto", "Julie", "Joan", "Cooper", "Gunnar", "Nora", "Sydney", "Lorraine", "Oscar", "Marcia", "Colette", "Derek", "Monica", "Morgan" ], "edges": [ [ 0, 4 ], [ 0, 7 ], [ 2, 8 ], [ 3, 6 ], [ 3, 9 ], [ 4, 5 ], [ 7, 1 ], [ 7, 2 ], [ 8, 3 ], [ 10, 14 ], [ 10, 17 ], [ 12, 18 ], [ 13, 16 ], [ 13, 19 ], [ 14, 15 ], [ 17, 11 ], [ 17, 12 ], [ 18, 13 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Nora knows Cindy. Reed knows Caleb. Conner knows Lucy. Curtis knows Natalie. Eamon knows Reed. Conner knows Gerard. Curtis knows Max. Richard knows Jose. Eamon knows Hamilton. Perry knows Nora. Dell knows Randall. Nora knows Mabel. Natalie knows Ruby. Cindy knows Curtis. Randall knows Conner. Arnold knows Dell. Lucy knows Eamon. Jose knows Perry. Which of Perry and Randall can Richard reach?", "answer": "Perry", "steps": [ "Richard knows Jose.", "Jose knows Perry." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Richard", "Ruby", "Mabel", "Cindy", "Max", "Natalie", "Jose", "Curtis", "Perry", "Nora", "Arnold", "Caleb", "Gerard", "Lucy", "Hamilton", "Reed", "Dell", "Eamon", "Randall", "Conner" ], "edges": [ [ 0, 6 ], [ 3, 7 ], [ 5, 1 ], [ 6, 8 ], [ 7, 4 ], [ 7, 5 ], [ 8, 9 ], [ 9, 2 ], [ 9, 3 ], [ 10, 16 ], [ 13, 17 ], [ 15, 11 ], [ 16, 18 ], [ 17, 14 ], [ 17, 15 ], [ 18, 19 ], [ 19, 12 ], [ 19, 13 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Oscar knows Marcia. Judy knows Otto. Julie knows Fraser. Lorraine knows Colette. Gunnar knows Oscar. Derek knows Nora. Gunnar knows Derek. Lorraine knows Morgan. Julie knows Brooke. Electra knows Blake. Monica knows Lorraine. Derek knows Sydney. Judy knows Cooper. Blake knows Porter. Electra knows Julie. Sydney knows Monica. Brooke knows Joan. Joan knows Judy. Which of Joan and Monica can Electra reach?", "answer": "Joan", "steps": [ "Electra knows Julie.", "Julie knows Brooke.", "Brooke knows Joan." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Electra", "Fraser", "Brooke", "Judy", "Blake", "Porter", "Otto", "Julie", "Joan", "Cooper", "Gunnar", "Nora", "Sydney", "Lorraine", "Oscar", "Marcia", "Colette", "Derek", "Monica", "Morgan" ], "edges": [ [ 0, 4 ], [ 0, 7 ], [ 2, 8 ], [ 3, 6 ], [ 3, 9 ], [ 4, 5 ], [ 7, 1 ], [ 7, 2 ], [ 8, 3 ], [ 10, 14 ], [ 10, 17 ], [ 12, 18 ], [ 13, 16 ], [ 13, 19 ], [ 14, 15 ], [ 17, 11 ], [ 17, 12 ], [ 18, 13 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Julie knows Ted. Terry knows Sharon. Terry knows Julius. Jamie knows Judy. Leah knows Charity. Felicia knows Terry. Gerald knows Barney. Ted knows Gerald. Jamie knows Bridget. Jamie knows James. Gerald knows Hendrix. Gerald knows Felicia. Harriet knows Leah. Leah knows Basil. Terry knows Ashton. Stefan knows Jamie. Leah knows Stefan. Keegan knows Harriet. Which of Stefan and Felicia can Julie reach?", "answer": "Felicia", "steps": [ "Julie knows Ted.", "Ted knows Gerald.", "Gerald knows Felicia." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Julie", "Barney", "Julius", "Terry", "Ashton", "Sharon", "Felicia", "Hendrix", "Gerald", "Ted", "Keegan", "Charity", "James", "Jamie", "Judy", "Bridget", "Stefan", "Basil", "Leah", "Harriet" ], "edges": [ [ 0, 9 ], [ 3, 2 ], [ 3, 4 ], [ 3, 5 ], [ 6, 3 ], [ 8, 1 ], [ 8, 6 ], [ 8, 7 ], [ 9, 8 ], [ 10, 19 ], [ 13, 12 ], [ 13, 14 ], [ 13, 15 ], [ 16, 13 ], [ 18, 11 ], [ 18, 16 ], [ 18, 17 ], [ 19, 18 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Hannah knows Clarissa. Terrence knows Amelia. Dawn knows Norma. Estella knows Eldon. Amelia knows Livia. Livia knows Daphna. Will knows Elise. Clarissa knows Estella. Hannah knows Arnold. Norma knows Jennifer. Jennifer knows Hannah. Jennifer knows Bernard. Amelia knows Marco. Livia knows Olivia. Olivia knows Marion. Olivia knows Karla. Marion knows Will. Norma knows Marvin. Which of Clarissa and Marion can Terrence reach?", "answer": "Marion", "steps": [ "Terrence knows Amelia.", "Amelia knows Livia.", "Livia knows Olivia.", "Olivia knows Marion." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Terrence", "Marion", "Olivia", "Will", "Marco", "Amelia", "Daphna", "Karla", "Elise", "Livia", "Dawn", "Clarissa", "Hannah", "Estella", "Marvin", "Norma", "Bernard", "Arnold", "Eldon", "Jennifer" ], "edges": [ [ 0, 5 ], [ 1, 3 ], [ 2, 7 ], [ 2, 1 ], [ 3, 8 ], [ 5, 4 ], [ 5, 9 ], [ 9, 6 ], [ 9, 2 ], [ 10, 15 ], [ 11, 13 ], [ 12, 17 ], [ 12, 11 ], [ 13, 18 ], [ 15, 14 ], [ 15, 19 ], [ 19, 16 ], [ 19, 12 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Beau knows Kane. Greta knows Cornelius. Garrison knows Aiden. Greta knows Isadora. Constance knows Xander. Kane knows Constance. Garrison knows Knox. Irma knows Antonio. Knox knows Marco. Jim knows Cyrus. Cornelius knows Irma. Jim knows Cristina. Marco knows Beau. Antonio knows Jim. Kane knows Archie. Greta knows Lamont. Cristina knows Parker. Garrison knows Karina. Which of Jim and Kane can Garrison reach?", "answer": "Kane", "steps": [ "Garrison knows Knox.", "Knox knows Marco.", "Marco knows Beau.", "Beau knows Kane." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Garrison", "Constance", "Karina", "Knox", "Kane", "Xander", "Aiden", "Marco", "Beau", "Archie", "Greta", "Cristina", "Isadora", "Cornelius", "Jim", "Parker", "Lamont", "Irma", "Antonio", "Cyrus" ], "edges": [ [ 0, 2 ], [ 0, 6 ], [ 0, 3 ], [ 1, 5 ], [ 3, 7 ], [ 4, 1 ], [ 4, 9 ], [ 7, 8 ], [ 8, 4 ], [ 10, 12 ], [ 10, 16 ], [ 10, 13 ], [ 11, 15 ], [ 13, 17 ], [ 14, 11 ], [ 14, 19 ], [ 17, 18 ], [ 18, 14 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Rhea knows Declan. Declan knows Lydia. Enid knows Lyle. Alejandro knows Amelia. Lyle knows Dean. Rhea knows Alejandro. Lillian knows Abigail. Maggie knows Rhea. Maggie knows Valerie. Ira knows Lillian. Amelia knows Jillian. Lyle knows Colby. Dean knows Eunice. Enid knows Jared. Lyle knows Ira. Amelia knows Victor. Rhea knows June. Lillian knows Maria. Which of Alejandro and Ira can Maggie reach?", "answer": "Alejandro", "steps": [ "Maggie knows Rhea.", "Rhea knows Alejandro." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Maggie", "Lydia", "Jillian", "Amelia", "June", "Alejandro", "Declan", "Victor", "Rhea", "Valerie", "Enid", "Eunice", "Maria", "Lillian", "Colby", "Ira", "Dean", "Abigail", "Lyle", "Jared" ], "edges": [ [ 0, 8 ], [ 0, 9 ], [ 3, 2 ], [ 3, 7 ], [ 5, 3 ], [ 6, 1 ], [ 8, 4 ], [ 8, 6 ], [ 8, 5 ], [ 10, 18 ], [ 10, 19 ], [ 13, 12 ], [ 13, 17 ], [ 15, 13 ], [ 16, 11 ], [ 18, 14 ], [ 18, 16 ], [ 18, 15 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Beau knows Kane. Greta knows Cornelius. Garrison knows Aiden. Greta knows Isadora. Constance knows Xander. Kane knows Constance. Garrison knows Knox. Irma knows Antonio. Knox knows Marco. Jim knows Cyrus. Cornelius knows Irma. Jim knows Cristina. Marco knows Beau. Antonio knows Jim. Kane knows Archie. Greta knows Lamont. Cristina knows Parker. Garrison knows Karina. Which of Beau and Antonio can Garrison reach?", "answer": "Beau", "steps": [ "Garrison knows Knox.", "Knox knows Marco.", "Marco knows Beau." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Garrison", "Constance", "Karina", "Knox", "Kane", "Xander", "Aiden", "Marco", "Beau", "Archie", "Greta", "Cristina", "Isadora", "Cornelius", "Jim", "Parker", "Lamont", "Irma", "Antonio", "Cyrus" ], "edges": [ [ 0, 2 ], [ 0, 6 ], [ 0, 3 ], [ 1, 5 ], [ 3, 7 ], [ 4, 1 ], [ 4, 9 ], [ 7, 8 ], [ 8, 4 ], [ 10, 12 ], [ 10, 16 ], [ 10, 13 ], [ 11, 15 ], [ 13, 17 ], [ 14, 11 ], [ 14, 19 ], [ 17, 18 ], [ 18, 14 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Herbert knows Colin. Sebastian knows Terry. Herbert knows Samantha. Samantha knows Corinne. Eldon knows Max. Yolanda knows Guy. Randy knows Yolanda. Randy knows Chelsea. Terry knows Wilson. Jim knows Jesse. April knows Skyler. Guy knows April. Jim knows Herbert. Yolanda knows Luna. Samantha knows Virginia. Skyler knows Vernon. Virginia knows Sebastian. Eldon knows Randy. Which of Samantha and Yolanda can Jim reach?", "answer": "Samantha", "steps": [ "Jim knows Herbert.", "Herbert knows Samantha." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Jim", "Wilson", "Jesse", "Colin", "Samantha", "Terry", "Corinne", "Virginia", "Herbert", "Sebastian", "Eldon", "Vernon", "Max", "Chelsea", "Yolanda", "Skyler", "Luna", "Guy", "Randy", "April" ], "edges": [ [ 0, 2 ], [ 0, 8 ], [ 4, 6 ], [ 4, 7 ], [ 5, 1 ], [ 7, 9 ], [ 8, 3 ], [ 8, 4 ], [ 9, 5 ], [ 10, 12 ], [ 10, 18 ], [ 14, 16 ], [ 14, 17 ], [ 15, 11 ], [ 17, 19 ], [ 18, 13 ], [ 18, 14 ], [ 19, 15 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Kent knows Spencer. Virginia knows Stanley. Desmond knows Seth. Erwin knows Stuart. Stuart knows Clarissa. Kira knows Harlan. Virginia knows Pierce. Virginia knows Douglas. Douglas knows Amanda. Erwin knows Kent. Kent knows Quinn. Tony knows Erwin. Gage knows Dalton. Seth knows Gage. Kent knows Kira. Virginia knows Chad. Seth knows Virginia. Kent knows Darnell. Which of Erwin and Seth can Tony reach?", "answer": "Erwin", "steps": [ "Tony knows Erwin." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Tony", "Spencer", "Erwin", "Clarissa", "Stuart", "Kent", "Kira", "Harlan", "Darnell", "Quinn", "Desmond", "Pierce", "Seth", "Dalton", "Gage", "Virginia", "Douglas", "Amanda", "Chad", "Stanley" ], "edges": [ [ 0, 2 ], [ 2, 4 ], [ 2, 5 ], [ 4, 3 ], [ 5, 1 ], [ 5, 6 ], [ 5, 8 ], [ 5, 9 ], [ 6, 7 ], [ 10, 12 ], [ 12, 14 ], [ 12, 15 ], [ 14, 13 ], [ 15, 11 ], [ 15, 16 ], [ 15, 18 ], [ 15, 19 ], [ 16, 17 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Fergus knows Annie. Edith knows Caroline. Ramona knows Preston. Esther knows Dayton. Caroline knows Fergus. Preston knows Duncan. Darwin knows Frank. Frank knows Andrew. Duncan knows Garrett. Hugo knows Isaac. Preston knows Effie. Duncan knows Edith. Frank knows Lamont. Isaac knows Everett. Lamont knows Esther. Edith knows Morgan. Lamont knows Kelsey. Esther knows Hugo. Which of Frank and Preston can Ramona reach?", "answer": "Preston", "steps": [ "Ramona knows Preston." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Ramona", "Caroline", "Edith", "Fergus", "Garrett", "Effie", "Annie", "Morgan", "Duncan", "Preston", "Darwin", "Hugo", "Esther", "Isaac", "Kelsey", "Andrew", "Everett", "Dayton", "Lamont", "Frank" ], "edges": [ [ 0, 9 ], [ 1, 3 ], [ 2, 1 ], [ 2, 7 ], [ 3, 6 ], [ 8, 4 ], [ 8, 2 ], [ 9, 5 ], [ 9, 8 ], [ 10, 19 ], [ 11, 13 ], [ 12, 11 ], [ 12, 17 ], [ 13, 16 ], [ 18, 14 ], [ 18, 12 ], [ 19, 15 ], [ 19, 18 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Lola knows Tristan. Tristan knows Arthur. Hal knows Sandra. Eleanor knows Hal. Marcus knows Greg. Regina knows Marcus. Aisha knows Chloe. Greg knows Sally. Beth knows Eleanor. Arthur knows Aisha. Ben knows Grace. Sandra knows Peter. Tristan knows Brandon. Peter knows Ray. Grace knows Beth. Sally knows Lola. Ray knows Edwin. Sandra knows Leo. Which of Edwin and Chloe can Ben reach?", "answer": "Edwin", "steps": [ "Ben knows Grace.", "Grace knows Beth.", "Beth knows Eleanor.", "Eleanor knows Hal.", "Hal knows Sandra.", "Sandra knows Peter.", "Peter knows Ray.", "Ray knows Edwin." ], "difficulty": 8, "original_distance": 8, "idx_to_symbol": [ "Ben", "Peter", "Edwin", "Ray", "Sandra", "Hal", "Grace", "Eleanor", "Beth", "Leo", "Regina", "Arthur", "Chloe", "Aisha", "Tristan", "Lola", "Marcus", "Sally", "Greg", "Brandon" ], "edges": [ [ 0, 6 ], [ 1, 3 ], [ 3, 2 ], [ 4, 1 ], [ 4, 9 ], [ 5, 4 ], [ 6, 8 ], [ 7, 5 ], [ 8, 7 ], [ 10, 16 ], [ 11, 13 ], [ 13, 12 ], [ 14, 11 ], [ 14, 19 ], [ 15, 14 ], [ 16, 18 ], [ 17, 15 ], [ 18, 17 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Norma knows Virgil. Nash knows Brandon. Iris knows Clayton. Maggie knows Pablo. Sandy knows Maggie. Jameson knows Flora. Leah knows Julio. Ezra knows Jameson. Iris knows Ezra. Clayton knows Karl. Justine knows Norma. Nash knows Leah. Justine knows Grace. Maggie knows Nash. Norma knows Iris. Julio knows Jessica. Sandy knows Colin. Brandon knows Reed. Which of Leah and Ezra can Justine reach?", "answer": "Ezra", "steps": [ "Justine knows Norma.", "Norma knows Iris.", "Iris knows Ezra." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Justine", "Norma", "Ezra", "Karl", "Clayton", "Grace", "Jameson", "Flora", "Iris", "Virgil", "Sandy", "Maggie", "Leah", "Reed", "Brandon", "Colin", "Julio", "Jessica", "Nash", "Pablo" ], "edges": [ [ 0, 5 ], [ 0, 1 ], [ 1, 8 ], [ 1, 9 ], [ 2, 6 ], [ 4, 3 ], [ 6, 7 ], [ 8, 4 ], [ 8, 2 ], [ 10, 15 ], [ 10, 11 ], [ 11, 18 ], [ 11, 19 ], [ 12, 16 ], [ 14, 13 ], [ 16, 17 ], [ 18, 14 ], [ 18, 12 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Dorian knows Kennedy. Rachel knows Kerry. Hugh knows Dorian. Liam knows Rachel. Jean knows Gladys. Kaleb knows Delia. Willis knows Hugh. Gunnar knows Graeme. Nicole knows Gunnar. Graeme knows Clyde. Yolanda knows Colby. Colby knows Willis. Gladys knows Kaleb. Dustin knows Isadora. Jean knows Liam. Delia knows Cara. Kerry knows Dustin. Yolanda knows Nicole. Which of Dorian and Dustin can Jean reach?", "answer": "Dustin", "steps": [ "Jean knows Liam.", "Liam knows Rachel.", "Rachel knows Kerry.", "Kerry knows Dustin." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Jean", "Kerry", "Gladys", "Liam", "Rachel", "Kaleb", "Dustin", "Cara", "Delia", "Isadora", "Yolanda", "Hugh", "Nicole", "Colby", "Willis", "Gunnar", "Dorian", "Clyde", "Graeme", "Kennedy" ], "edges": [ [ 0, 2 ], [ 0, 3 ], [ 1, 6 ], [ 2, 5 ], [ 3, 4 ], [ 4, 1 ], [ 5, 8 ], [ 6, 9 ], [ 8, 7 ], [ 10, 12 ], [ 10, 13 ], [ 11, 16 ], [ 12, 15 ], [ 13, 14 ], [ 14, 11 ], [ 15, 18 ], [ 16, 19 ], [ 18, 17 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Carrie knows Knox. John knows Bailey. Kane knows Sarah. Gerard knows Vera. Heath knows John. Marion knows Noel. Kane knows Carrie. Bailey knows Kane. John knows Aiden. Bailey knows Blanche. Gerard knows Ira. Ira knows Mary. Noel knows Esme. Esme knows Gerard. Noel knows Lark. Aiden knows Taylor. Lark knows Elise. Esme knows Heather. Which of Kane and Gerard can Heath reach?", "answer": "Kane", "steps": [ "Heath knows John.", "John knows Bailey.", "Bailey knows Kane." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Heath", "Blanche", "Carrie", "John", "Aiden", "Knox", "Bailey", "Sarah", "Kane", "Taylor", "Marion", "Heather", "Ira", "Noel", "Lark", "Mary", "Esme", "Vera", "Gerard", "Elise" ], "edges": [ [ 0, 3 ], [ 2, 5 ], [ 3, 6 ], [ 3, 4 ], [ 4, 9 ], [ 6, 1 ], [ 6, 8 ], [ 8, 2 ], [ 8, 7 ], [ 10, 13 ], [ 12, 15 ], [ 13, 16 ], [ 13, 14 ], [ 14, 19 ], [ 16, 11 ], [ 16, 18 ], [ 18, 12 ], [ 18, 17 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Tara knows Amy. Lee knows Marie. Jillian knows Margaret. Connor knows India. India knows Jillian. Lee knows Keaton. Houston knows Hilda. Hilda knows Zelda. Lois knows Gareth. Milo knows Houston. Keaton knows Esther. Hilda knows Lucia. Jillian knows Lee. Esther knows Lois. Zelda knows Tara. Amy knows Angelica. Zelda knows Mary. Angelica knows Javier. Which of Angelica and Lois can Connor reach?", "answer": "Lois", "steps": [ "Connor knows India.", "India knows Jillian.", "Jillian knows Lee.", "Lee knows Keaton.", "Keaton knows Esther.", "Esther knows Lois." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Connor", "Lee", "Margaret", "Keaton", "Gareth", "Esther", "Jillian", "Marie", "India", "Lois", "Milo", "Zelda", "Lucia", "Tara", "Javier", "Amy", "Hilda", "Mary", "Houston", "Angelica" ], "edges": [ [ 0, 8 ], [ 1, 7 ], [ 1, 3 ], [ 3, 5 ], [ 5, 9 ], [ 6, 2 ], [ 6, 1 ], [ 8, 6 ], [ 9, 4 ], [ 10, 18 ], [ 11, 17 ], [ 11, 13 ], [ 13, 15 ], [ 15, 19 ], [ 16, 12 ], [ 16, 11 ], [ 18, 16 ], [ 19, 14 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Coral knows Olive. Eldon knows Amy. Clayton knows Kamila. Estelle knows Bernadette. Bernadette knows Jorge. Adele knows Fabian. Guillermo knows Eldon. Dora knows Becky. Burt knows Dora. Becky knows Adele. Archer knows Clayton. Clayton knows Coral. Nancy knows Annie. Kamila knows Nancy. Ariana knows Burt. Fabian knows Paul. Jorge knows Archer. Adele knows Guillermo. Which of Kamila and Guillermo can Estelle reach?", "answer": "Kamila", "steps": [ "Estelle knows Bernadette.", "Bernadette knows Jorge.", "Jorge knows Archer.", "Archer knows Clayton.", "Clayton knows Kamila." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Estelle", "Kamila", "Bernadette", "Olive", "Annie", "Nancy", "Jorge", "Coral", "Clayton", "Archer", "Ariana", "Guillermo", "Burt", "Paul", "Amy", "Eldon", "Dora", "Fabian", "Adele", "Becky" ], "edges": [ [ 0, 2 ], [ 1, 5 ], [ 2, 6 ], [ 5, 4 ], [ 6, 9 ], [ 7, 3 ], [ 8, 1 ], [ 8, 7 ], [ 9, 8 ], [ 10, 12 ], [ 11, 15 ], [ 12, 16 ], [ 15, 14 ], [ 16, 19 ], [ 17, 13 ], [ 18, 11 ], [ 18, 17 ], [ 19, 18 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Freya knows Jarvis. Coral knows Anton. Cynthia knows Tanya. Shaun knows Freya. Tanya knows Nelson. Conner knows Brooks. Livia knows Jasmine. Lydia knows Curtis. Nelson knows Kara. Livia knows Rocco. Shaun knows Dahlia. Fabian knows Roger. Jasmine knows Lydia. Shaun knows Cynthia. Coral knows Livia. Cynthia knows Conner. Rocco knows Lorenzo. Coral knows Fabian. Which of Curtis and Kara can Shaun reach?", "answer": "Kara", "steps": [ "Shaun knows Cynthia.", "Cynthia knows Tanya.", "Tanya knows Nelson.", "Nelson knows Kara." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Shaun", "Jarvis", "Conner", "Brooks", "Cynthia", "Freya", "Dahlia", "Kara", "Nelson", "Tanya", "Coral", "Roger", "Rocco", "Lorenzo", "Livia", "Fabian", "Anton", "Curtis", "Lydia", "Jasmine" ], "edges": [ [ 0, 5 ], [ 0, 6 ], [ 0, 4 ], [ 2, 3 ], [ 4, 2 ], [ 4, 9 ], [ 5, 1 ], [ 8, 7 ], [ 9, 8 ], [ 10, 15 ], [ 10, 16 ], [ 10, 14 ], [ 12, 13 ], [ 14, 12 ], [ 14, 19 ], [ 15, 11 ], [ 18, 17 ], [ 19, 18 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Tanya knows Winston. Nolan knows Byron. Winston knows Daisy. Winston knows Clyde. Adele knows Tanya. Stuart knows Regina. Fritz knows Yara. Isiah knows Christian. Christian knows Samantha. Isiah knows Frank. Fritz knows Matt. Clyde knows Janice. Tara knows Abigail. Tanya knows Stuart. Matt knows Nolan. Byron knows Jean. Nolan knows Isiah. Tara knows Adele. Which of Tanya and Nolan can Fritz reach?", "answer": "Nolan", "steps": [ "Fritz knows Matt.", "Matt knows Nolan." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Fritz", "Yara", "Frank", "Samantha", "Isiah", "Jean", "Nolan", "Matt", "Byron", "Christian", "Tara", "Abigail", "Daisy", "Janice", "Winston", "Regina", "Tanya", "Adele", "Stuart", "Clyde" ], "edges": [ [ 0, 1 ], [ 0, 7 ], [ 4, 2 ], [ 4, 9 ], [ 6, 8 ], [ 6, 4 ], [ 7, 6 ], [ 8, 5 ], [ 9, 3 ], [ 10, 11 ], [ 10, 17 ], [ 14, 12 ], [ 14, 19 ], [ 16, 18 ], [ 16, 14 ], [ 17, 16 ], [ 18, 15 ], [ 19, 13 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Sandy knows Cristina. Cristina knows Eleanor. Arlene knows Alder. Eleanor knows Opal. Arlene knows Dewey. Tamara knows Louis. Eleanor knows Gene. Adelaide knows Ellis. Opal knows Adelaide. Stella knows Judy. Dewey knows Tamara. Brenda knows Darcy. Judy knows Arlene. Alder knows Brenda. Peggy knows Abel. Brenda knows Lola. Adelaide knows Allen. Gene knows Peggy. Which of Adelaide and Brenda can Stella reach?", "answer": "Brenda", "steps": [ "Stella knows Judy.", "Judy knows Arlene.", "Arlene knows Alder.", "Alder knows Brenda." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Stella", "Louis", "Arlene", "Lola", "Darcy", "Dewey", "Alder", "Judy", "Tamara", "Brenda", "Sandy", "Abel", "Eleanor", "Ellis", "Allen", "Gene", "Opal", "Cristina", "Peggy", "Adelaide" ], "edges": [ [ 0, 7 ], [ 2, 5 ], [ 2, 6 ], [ 5, 8 ], [ 6, 9 ], [ 7, 2 ], [ 8, 1 ], [ 9, 3 ], [ 9, 4 ], [ 10, 17 ], [ 12, 15 ], [ 12, 16 ], [ 15, 18 ], [ 16, 19 ], [ 17, 12 ], [ 18, 11 ], [ 19, 13 ], [ 19, 14 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Fred knows Chase. Karla knows Peggy. Kobe knows Hayes. Luke knows Karla. Dylan knows Patrick. Dylan knows Melody. Clay knows Dylan. Melody knows Ernest. Elijah knows Christopher. Dylan knows Kobe. Kobe knows Luke. Ernesto knows Ashley. Elijah knows Fred. Alder knows Pete. Irma knows Ernesto. Elijah knows Alder. Andrea knows Elijah. Fred knows Irma. Which of Ernesto and Karla can Andrea reach?", "answer": "Ernesto", "steps": [ "Andrea knows Elijah.", "Elijah knows Fred.", "Fred knows Irma.", "Irma knows Ernesto." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Andrea", "Fred", "Ernesto", "Irma", "Chase", "Elijah", "Christopher", "Alder", "Pete", "Ashley", "Clay", "Kobe", "Karla", "Luke", "Hayes", "Dylan", "Patrick", "Melody", "Ernest", "Peggy" ], "edges": [ [ 0, 5 ], [ 1, 4 ], [ 1, 3 ], [ 2, 9 ], [ 3, 2 ], [ 5, 6 ], [ 5, 7 ], [ 5, 1 ], [ 7, 8 ], [ 10, 15 ], [ 11, 14 ], [ 11, 13 ], [ 12, 19 ], [ 13, 12 ], [ 15, 16 ], [ 15, 17 ], [ 15, 11 ], [ 17, 18 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Kay knows Ava. Asher knows Francesca. Randall knows Judith. Irving knows Daria. Asher knows Joyce. Francesca knows Destiny. Daria knows Randall. Randall knows Drew. Garland knows Shaun. Drew knows Aria. Drew knows Caroline. Francesca knows Garland. Drew knows Clinton. Shaun knows Gina. Francesca knows Isabel. Cynthia knows Jenny. Ava knows Asher. Clinton knows Cynthia. Which of Jenny and Gina can Kay reach?", "answer": "Gina", "steps": [ "Kay knows Ava.", "Ava knows Asher.", "Asher knows Francesca.", "Francesca knows Garland.", "Garland knows Shaun.", "Shaun knows Gina." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Kay", "Joyce", "Shaun", "Garland", "Asher", "Gina", "Destiny", "Francesca", "Ava", "Isabel", "Irving", "Judith", "Cynthia", "Clinton", "Randall", "Jenny", "Aria", "Drew", "Daria", "Caroline" ], "edges": [ [ 0, 8 ], [ 2, 5 ], [ 3, 2 ], [ 4, 1 ], [ 4, 7 ], [ 7, 3 ], [ 7, 6 ], [ 7, 9 ], [ 8, 4 ], [ 10, 18 ], [ 12, 15 ], [ 13, 12 ], [ 14, 11 ], [ 14, 17 ], [ 17, 13 ], [ 17, 16 ], [ 17, 19 ], [ 18, 14 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Basil knows Trina. Gregory knows Maria. Janelle knows Zach. Zach knows Penny. Selena knows Elvis. Cora knows Daria. Hattie knows Janelle. Kimberly knows Kane. Cora knows Kareem. Alvin knows Hattie. Trina knows Kimberly. Penny knows Gregory. Kimberly knows Coral. Aldo knows Donald. Elvis knows Lambert. Hattie knows Cora. Lambert knows Aldo. Trina knows Selena. Which of Maria and Donald can Alvin reach?", "answer": "Maria", "steps": [ "Alvin knows Hattie.", "Hattie knows Janelle.", "Janelle knows Zach.", "Zach knows Penny.", "Penny knows Gregory.", "Gregory knows Maria." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Alvin", "Daria", "Cora", "Hattie", "Zach", "Maria", "Kareem", "Janelle", "Gregory", "Penny", "Basil", "Kane", "Kimberly", "Trina", "Elvis", "Donald", "Coral", "Selena", "Aldo", "Lambert" ], "edges": [ [ 0, 3 ], [ 2, 1 ], [ 2, 6 ], [ 3, 2 ], [ 3, 7 ], [ 4, 9 ], [ 7, 4 ], [ 8, 5 ], [ 9, 8 ], [ 10, 13 ], [ 12, 11 ], [ 12, 16 ], [ 13, 12 ], [ 13, 17 ], [ 14, 19 ], [ 17, 14 ], [ 18, 15 ], [ 19, 18 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Robin knows Bridget. Darla knows Garrison. Kennedy knows Elsa. Darla knows Roland. Louis knows Robin. Mindy knows Kennedy. Garrett knows Glenda. Emma knows Mae. Kennedy knows Garrett. Garrett knows Jenna. Garrison knows Emma. Emma knows Janet. Marcus knows Kane. Mason knows Marcus. Garrett knows Mason. Marcus knows Iris. Darla knows Nelson. Robin knows Darla. Which of Darla and Garrett can Louis reach?", "answer": "Darla", "steps": [ "Louis knows Robin.", "Robin knows Darla." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Louis", "Emma", "Janet", "Mae", "Bridget", "Nelson", "Roland", "Darla", "Robin", "Garrison", "Mindy", "Marcus", "Iris", "Kane", "Elsa", "Jenna", "Glenda", "Garrett", "Kennedy", "Mason" ], "edges": [ [ 0, 8 ], [ 1, 2 ], [ 1, 3 ], [ 7, 5 ], [ 7, 6 ], [ 7, 9 ], [ 8, 4 ], [ 8, 7 ], [ 9, 1 ], [ 10, 18 ], [ 11, 12 ], [ 11, 13 ], [ 17, 15 ], [ 17, 16 ], [ 17, 19 ], [ 18, 14 ], [ 18, 17 ], [ 19, 11 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Hope knows Edison. Leon knows Eloise. Hope knows Dina. Horace knows Harrison. Zoe knows Alana. Julius knows Nancy. Randy knows Horace. Axel knows Julius. Zoe knows Kennedy. Harrison knows Esperanza. Dina knows Randy. Leon knows Haven. Shelly knows Opal. Dina knows Leon. Alana knows Shelly. Tracy knows Axel. Shelly knows Dustin. Alana knows Tracy. Which of Horace and Axel can Zoe reach?", "answer": "Axel", "steps": [ "Zoe knows Alana.", "Alana knows Tracy.", "Tracy knows Axel." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Zoe", "Alana", "Julius", "Shelly", "Tracy", "Dustin", "Kennedy", "Nancy", "Axel", "Opal", "Hope", "Dina", "Harrison", "Leon", "Randy", "Haven", "Edison", "Esperanza", "Horace", "Eloise" ], "edges": [ [ 0, 6 ], [ 0, 1 ], [ 1, 4 ], [ 1, 3 ], [ 2, 7 ], [ 3, 5 ], [ 3, 9 ], [ 4, 8 ], [ 8, 2 ], [ 10, 16 ], [ 10, 11 ], [ 11, 14 ], [ 11, 13 ], [ 12, 17 ], [ 13, 15 ], [ 13, 19 ], [ 14, 18 ], [ 18, 12 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Roger knows Pierce. Jude knows Barney. Clyde knows Simon. Pierce knows Dewey. Marco knows Clyde. Ibrahim knows Doug. Jude knows Lars. Cyrus knows Roger. Marco knows Elodie. Ibrahim knows Holden. Pierce knows Megan. Cyrus knows Esperanza. Marco knows Jerry. Marco knows Jaime. Clyde knows Will. Pierce knows Gareth. Doug knows Marco. Pierce knows Jude. Which of Jude and Clyde can Cyrus reach?", "answer": "Jude", "steps": [ "Cyrus knows Roger.", "Roger knows Pierce.", "Pierce knows Jude." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Cyrus", "Roger", "Esperanza", "Pierce", "Dewey", "Gareth", "Jude", "Barney", "Lars", "Megan", "Ibrahim", "Doug", "Holden", "Marco", "Jaime", "Jerry", "Clyde", "Simon", "Will", "Elodie" ], "edges": [ [ 0, 2 ], [ 0, 1 ], [ 1, 3 ], [ 3, 4 ], [ 3, 5 ], [ 3, 6 ], [ 3, 9 ], [ 6, 7 ], [ 6, 8 ], [ 10, 12 ], [ 10, 11 ], [ 11, 13 ], [ 13, 14 ], [ 13, 15 ], [ 13, 16 ], [ 13, 19 ], [ 16, 17 ], [ 16, 18 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Hank knows Reed. Elmer knows Mindy. Zachary knows Langston. Blaine knows Finn. Finn knows Geoffrey. Xander knows Elmer. Reed knows Davis. Mindy knows Miriam. Davis knows Fanny. Xander knows Allen. Geoffrey knows Dolores. Zachary knows Val. Glen knows Essie. Celia knows Zachary. Carmen knows Xander. Dolores knows Carmen. Val knows Glen. Fanny knows Celia. Which of Essie and Miriam can Blaine reach?", "answer": "Miriam", "steps": [ "Blaine knows Finn.", "Finn knows Geoffrey.", "Geoffrey knows Dolores.", "Dolores knows Carmen.", "Carmen knows Xander.", "Xander knows Elmer.", "Elmer knows Mindy.", "Mindy knows Miriam." ], "difficulty": 8, "original_distance": 8, "idx_to_symbol": [ "Blaine", "Geoffrey", "Carmen", "Dolores", "Allen", "Miriam", "Elmer", "Xander", "Finn", "Mindy", "Hank", "Davis", "Celia", "Fanny", "Langston", "Essie", "Val", "Zachary", "Reed", "Glen" ], "edges": [ [ 0, 8 ], [ 1, 3 ], [ 2, 7 ], [ 3, 2 ], [ 6, 9 ], [ 7, 4 ], [ 7, 6 ], [ 8, 1 ], [ 9, 5 ], [ 10, 18 ], [ 11, 13 ], [ 12, 17 ], [ 13, 12 ], [ 16, 19 ], [ 17, 14 ], [ 17, 16 ], [ 18, 11 ], [ 19, 15 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Estella knows James. Cain knows Corey. Percy knows Hugh. Irving knows Maureen. Cody knows Melissa. Lara knows Patricia. Yvette knows Irving. Maureen knows Cole. Lara knows Percy. Irving knows Forrest. Maureen knows Estella. Percy knows Karl. Hugh knows Cody. Luz knows Lara. Melissa knows Karina. Maureen knows Hazel. Percy knows Dante. James knows Cain. Which of Estella and Hugh can Luz reach?", "answer": "Hugh", "steps": [ "Luz knows Lara.", "Lara knows Percy.", "Percy knows Hugh." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Luz", "Hugh", "Lara", "Cody", "Melissa", "Patricia", "Percy", "Karl", "Dante", "Karina", "Yvette", "Estella", "Irving", "James", "Cain", "Forrest", "Maureen", "Cole", "Hazel", "Corey" ], "edges": [ [ 0, 2 ], [ 1, 3 ], [ 2, 5 ], [ 2, 6 ], [ 3, 4 ], [ 4, 9 ], [ 6, 7 ], [ 6, 8 ], [ 6, 1 ], [ 10, 12 ], [ 11, 13 ], [ 12, 15 ], [ 12, 16 ], [ 13, 14 ], [ 14, 19 ], [ 16, 17 ], [ 16, 18 ], [ 16, 11 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Lara knows Livia. Cliff knows Alicia. Flora knows Lillian. Corey knows Alvin. Bailey knows Brenda. Flora knows Fabian. Lillian knows Noel. Faith knows Curtis. Noel knows Jasper. Bailey knows Brynn. Livia knows Rocco. Corey knows Faith. Cliff knows Lara. Brynn knows Sue. Corey knows Cliff. Brynn knows James. Bailey knows Flora. Faith knows Valerie. Which of Lara and Lillian can Corey reach?", "answer": "Lara", "steps": [ "Corey knows Cliff.", "Cliff knows Lara." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Corey", "Cliff", "Rocco", "Alicia", "Lara", "Curtis", "Faith", "Valerie", "Alvin", "Livia", "Bailey", "Flora", "Jasper", "Fabian", "Lillian", "James", "Brynn", "Sue", "Brenda", "Noel" ], "edges": [ [ 0, 6 ], [ 0, 8 ], [ 0, 1 ], [ 1, 3 ], [ 1, 4 ], [ 4, 9 ], [ 6, 5 ], [ 6, 7 ], [ 9, 2 ], [ 10, 16 ], [ 10, 18 ], [ 10, 11 ], [ 11, 13 ], [ 11, 14 ], [ 14, 19 ], [ 16, 15 ], [ 16, 17 ], [ 19, 12 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Tanya knows Winston. Nolan knows Byron. Winston knows Daisy. Winston knows Clyde. Adele knows Tanya. Stuart knows Regina. Fritz knows Yara. Isiah knows Christian. Christian knows Samantha. Isiah knows Frank. Fritz knows Matt. Clyde knows Janice. Tara knows Abigail. Tanya knows Stuart. Matt knows Nolan. Byron knows Jean. Nolan knows Isiah. Tara knows Adele. Which of Janice and Samantha can Fritz reach?", "answer": "Samantha", "steps": [ "Fritz knows Matt.", "Matt knows Nolan.", "Nolan knows Isiah.", "Isiah knows Christian.", "Christian knows Samantha." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Fritz", "Yara", "Frank", "Samantha", "Isiah", "Jean", "Nolan", "Matt", "Byron", "Christian", "Tara", "Abigail", "Daisy", "Janice", "Winston", "Regina", "Tanya", "Adele", "Stuart", "Clyde" ], "edges": [ [ 0, 1 ], [ 0, 7 ], [ 4, 2 ], [ 4, 9 ], [ 6, 8 ], [ 6, 4 ], [ 7, 6 ], [ 8, 5 ], [ 9, 3 ], [ 10, 11 ], [ 10, 17 ], [ 14, 12 ], [ 14, 19 ], [ 16, 18 ], [ 16, 14 ], [ 17, 16 ], [ 18, 15 ], [ 19, 13 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Heath knows Duke. Jacques knows Marshall. Devin knows Jodi. Jacques knows Heath. Marshall knows Harvey. Jorge knows Val. Jean knows Greta. Jean knows Thea. Jacques knows Rhonda. Greta knows Kamila. Jorge knows Devin. Heath knows Rod. Marshall knows Daria. Jean knows Jorge. Greta knows Darla. Heath knows Ebony. Daria knows Kenneth. Greta knows Eric. Which of Marshall and Jorge can Jean reach?", "answer": "Jorge", "steps": [ "Jean knows Jorge." ], "difficulty": 1, "original_distance": 3, "idx_to_symbol": [ "Jean", "Devin", "Val", "Darla", "Eric", "Kamila", "Greta", "Thea", "Jodi", "Jorge", "Jacques", "Daria", "Harvey", "Duke", "Rod", "Ebony", "Heath", "Rhonda", "Kenneth", "Marshall" ], "edges": [ [ 0, 6 ], [ 0, 7 ], [ 0, 9 ], [ 1, 8 ], [ 6, 3 ], [ 6, 4 ], [ 6, 5 ], [ 9, 2 ], [ 9, 1 ], [ 10, 16 ], [ 10, 17 ], [ 10, 19 ], [ 11, 18 ], [ 16, 13 ], [ 16, 14 ], [ 16, 15 ], [ 19, 12 ], [ 19, 11 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Mildred knows Annie. Allen knows Daphna. Mildred knows Aspen. Chris knows Jack. Daphna knows Blaine. Sidney knows Faye. Cara knows Allen. Annie knows Cara. Rhonda knows Ella. Alvin knows Mildred. Chantal knows Alejandro. Alejandro knows Sidney. Rhonda knows Rosemary. Della knows Esperanza. Jack knows Rhonda. Bella knows Chris. Esperanza knows Alvin. Ella knows Chantal. Which of Chantal and Cara can Della reach?", "answer": "Cara", "steps": [ "Della knows Esperanza.", "Esperanza knows Alvin.", "Alvin knows Mildred.", "Mildred knows Annie.", "Annie knows Cara." ], "difficulty": 5, "original_distance": 8, "idx_to_symbol": [ "Della", "Blaine", "Daphna", "Mildred", "Aspen", "Esperanza", "Annie", "Cara", "Allen", "Alvin", "Bella", "Faye", "Sidney", "Rhonda", "Rosemary", "Chris", "Ella", "Chantal", "Alejandro", "Jack" ], "edges": [ [ 0, 5 ], [ 2, 1 ], [ 3, 4 ], [ 3, 6 ], [ 5, 9 ], [ 6, 7 ], [ 7, 8 ], [ 8, 2 ], [ 9, 3 ], [ 10, 15 ], [ 12, 11 ], [ 13, 14 ], [ 13, 16 ], [ 15, 19 ], [ 16, 17 ], [ 17, 18 ], [ 18, 12 ], [ 19, 13 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Greer knows Wade. Zack knows Rufus. Bette knows Tyler. Atlas knows Karl. Gerald knows Livia. Linda knows Zack. Catherine knows Emanuel. Lottie knows Julie. Karl knows Greer. Dewey knows Lottie. Livia knows Catherine. Livia knows Aldo. Zane knows Neil. Greer knows Dewey. Atlas knows Bette. Dewey knows Mildred. Catherine knows Zane. Linda knows Gerald. Which of Greer and Livia can Atlas reach?", "answer": "Greer", "steps": [ "Atlas knows Karl.", "Karl knows Greer." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Atlas", "Dewey", "Julie", "Tyler", "Mildred", "Greer", "Karl", "Bette", "Wade", "Lottie", "Linda", "Catherine", "Neil", "Rufus", "Emanuel", "Livia", "Gerald", "Zack", "Aldo", "Zane" ], "edges": [ [ 0, 7 ], [ 0, 6 ], [ 1, 4 ], [ 1, 9 ], [ 5, 8 ], [ 5, 1 ], [ 6, 5 ], [ 7, 3 ], [ 9, 2 ], [ 10, 17 ], [ 10, 16 ], [ 11, 14 ], [ 11, 19 ], [ 15, 18 ], [ 15, 11 ], [ 16, 15 ], [ 17, 13 ], [ 19, 12 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Daisy knows Alison. Matthew knows Darrell. Alice knows Carla. Maude knows Marilyn. Daisy knows Demetrius. Drew knows Daisy. Marilyn knows Autumn. Matthew knows Lana. Arthur knows Alice. Lawson knows Iris. Marilyn knows Noah. Bert knows Maude. Lana knows Lawson. Maude knows Hugh. Matthew knows Stuart. Marilyn knows Arthur. Maude knows Zach. Daisy knows Matthew. Which of Iris and Carla can Drew reach?", "answer": "Iris", "steps": [ "Drew knows Daisy.", "Daisy knows Matthew.", "Matthew knows Lana.", "Lana knows Lawson.", "Lawson knows Iris." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Drew", "Lana", "Demetrius", "Lawson", "Darrell", "Daisy", "Iris", "Alison", "Matthew", "Stuart", "Bert", "Arthur", "Hugh", "Alice", "Noah", "Maude", "Carla", "Zach", "Marilyn", "Autumn" ], "edges": [ [ 0, 5 ], [ 1, 3 ], [ 3, 6 ], [ 5, 2 ], [ 5, 7 ], [ 5, 8 ], [ 8, 4 ], [ 8, 1 ], [ 8, 9 ], [ 10, 15 ], [ 11, 13 ], [ 13, 16 ], [ 15, 12 ], [ 15, 17 ], [ 15, 18 ], [ 18, 14 ], [ 18, 11 ], [ 18, 19 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Lola knows Tristan. Tristan knows Arthur. Hal knows Sandra. Eleanor knows Hal. Marcus knows Greg. Regina knows Marcus. Aisha knows Chloe. Greg knows Sally. Beth knows Eleanor. Arthur knows Aisha. Ben knows Grace. Sandra knows Peter. Tristan knows Brandon. Peter knows Ray. Grace knows Beth. Sally knows Lola. Ray knows Edwin. Sandra knows Leo. Which of Sally and Eleanor can Ben reach?", "answer": "Eleanor", "steps": [ "Ben knows Grace.", "Grace knows Beth.", "Beth knows Eleanor." ], "difficulty": 3, "original_distance": 8, "idx_to_symbol": [ "Ben", "Peter", "Edwin", "Ray", "Sandra", "Hal", "Grace", "Eleanor", "Beth", "Leo", "Regina", "Arthur", "Chloe", "Aisha", "Tristan", "Lola", "Marcus", "Sally", "Greg", "Brandon" ], "edges": [ [ 0, 6 ], [ 1, 3 ], [ 3, 2 ], [ 4, 1 ], [ 4, 9 ], [ 5, 4 ], [ 6, 8 ], [ 7, 5 ], [ 8, 7 ], [ 10, 16 ], [ 11, 13 ], [ 13, 12 ], [ 14, 11 ], [ 14, 19 ], [ 15, 14 ], [ 16, 18 ], [ 17, 15 ], [ 18, 17 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Bryan knows Alyson. Elise knows Pete. Dennis knows Nancy. Sierra knows Clinton. Elise knows Charlotte. Pete knows Dennis. Inez knows Aspen. Irene knows Holly. Joan knows Irene. Joan knows Alder. Bryan knows Neville. Irene knows Elaine. Jackson knows Sierra. Jackson knows Josie. Clinton knows Erica. Holly knows Inez. Dennis knows Jackson. Alyson knows Joan. Which of Inez and Clinton can Elise reach?", "answer": "Clinton", "steps": [ "Elise knows Pete.", "Pete knows Dennis.", "Dennis knows Jackson.", "Jackson knows Sierra.", "Sierra knows Clinton." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Elise", "Erica", "Nancy", "Josie", "Sierra", "Pete", "Charlotte", "Clinton", "Dennis", "Jackson", "Bryan", "Aspen", "Alder", "Elaine", "Holly", "Alyson", "Neville", "Inez", "Joan", "Irene" ], "edges": [ [ 0, 6 ], [ 0, 5 ], [ 4, 7 ], [ 5, 8 ], [ 7, 1 ], [ 8, 2 ], [ 8, 9 ], [ 9, 3 ], [ 9, 4 ], [ 10, 16 ], [ 10, 15 ], [ 14, 17 ], [ 15, 18 ], [ 17, 11 ], [ 18, 12 ], [ 18, 19 ], [ 19, 13 ], [ 19, 14 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Cynthia knows Fisher. Zane knows Milo. Blanche knows Zane. Ernest knows Jewel. Shane knows Ernest. Dawn knows Shelly. Dawn knows Shane. Fisher knows Pedro. Pedro knows Joseph. Shelly knows Troy. Ariana knows Lloyd. Fisher knows Fern. Joseph knows Ruth. Lance knows Ariana. Lloyd knows Molly. Jewel knows Hector. Pedro knows Lance. Zane knows Dawn. Which of Dawn and Pedro can Cynthia reach?", "answer": "Pedro", "steps": [ "Cynthia knows Fisher.", "Fisher knows Pedro." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Cynthia", "Pedro", "Joseph", "Fisher", "Lance", "Ruth", "Lloyd", "Fern", "Ariana", "Molly", "Blanche", "Dawn", "Shelly", "Zane", "Shane", "Troy", "Jewel", "Milo", "Ernest", "Hector" ], "edges": [ [ 0, 3 ], [ 1, 2 ], [ 1, 4 ], [ 2, 5 ], [ 3, 7 ], [ 3, 1 ], [ 4, 8 ], [ 6, 9 ], [ 8, 6 ], [ 10, 13 ], [ 11, 12 ], [ 11, 14 ], [ 12, 15 ], [ 13, 17 ], [ 13, 11 ], [ 14, 18 ], [ 16, 19 ], [ 18, 16 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Sarah knows Natalie. Blake knows Yasmin. Lottie knows Dave. Jenna knows Mildred. Yasmin knows Judith. Declan knows Martha. August knows Patrick. Laura knows Sarah. Dave knows Geraldine. Sarah knows Carson. Patrick knows Lottie. Dean knows Lucia. Kylie knows Laura. Carson knows Declan. Martha knows Dean. Dave knows Blake. Curtis knows Kylie. Judith knows Jenna. Which of Lottie and Laura can August reach?", "answer": "Lottie", "steps": [ "August knows Patrick.", "Patrick knows Lottie." ], "difficulty": 2, "original_distance": 8, "idx_to_symbol": [ "August", "Blake", "Judith", "Geraldine", "Dave", "Lottie", "Mildred", "Jenna", "Yasmin", "Patrick", "Curtis", "Carson", "Martha", "Natalie", "Sarah", "Laura", "Lucia", "Dean", "Declan", "Kylie" ], "edges": [ [ 0, 9 ], [ 1, 8 ], [ 2, 7 ], [ 4, 3 ], [ 4, 1 ], [ 5, 4 ], [ 7, 6 ], [ 8, 2 ], [ 9, 5 ], [ 10, 19 ], [ 11, 18 ], [ 12, 17 ], [ 14, 13 ], [ 14, 11 ], [ 15, 14 ], [ 17, 16 ], [ 18, 12 ], [ 19, 15 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Eleanor knows Annie. Irma knows Dewey. Kingsley knows Otto. Dewey knows Lola. Lola knows Jenna. Effie knows Keegan. Kingsley knows Garrison. Otto knows Shannon. Garrison knows Jolene. Eleanor knows Irma. Irma knows Garland. Garrison knows Esther. Sadie knows Kingsley. Jolene knows Kirsten. Kirsten knows Jasmine. Shannon knows Sierra. Tiffany knows Eleanor. Annie knows Effie. Which of Jenna and Jasmine can Sadie reach?", "answer": "Jasmine", "steps": [ "Sadie knows Kingsley.", "Kingsley knows Garrison.", "Garrison knows Jolene.", "Jolene knows Kirsten.", "Kirsten knows Jasmine." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Sadie", "Kirsten", "Shannon", "Kingsley", "Otto", "Sierra", "Jolene", "Jasmine", "Garrison", "Esther", "Tiffany", "Lola", "Effie", "Eleanor", "Annie", "Keegan", "Dewey", "Jenna", "Irma", "Garland" ], "edges": [ [ 0, 3 ], [ 1, 7 ], [ 2, 5 ], [ 3, 4 ], [ 3, 8 ], [ 4, 2 ], [ 6, 1 ], [ 8, 6 ], [ 8, 9 ], [ 10, 13 ], [ 11, 17 ], [ 12, 15 ], [ 13, 14 ], [ 13, 18 ], [ 14, 12 ], [ 16, 11 ], [ 18, 16 ], [ 18, 19 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Clay knows Colleen. Carla knows Atlas. Tim knows Curtis. Colleen knows Agnes. Bart knows Carla. Jessie knows Xavier. Martha knows Emmett. Carla knows Walter. Colleen knows Eldon. Atlas knows Tim. Agnes knows Eleanor. Atlas knows Basil. Lewis knows Devon. Colleen knows Lewis. Marvin knows Clay. Carla knows Jessie. Nash knows Bart. Lewis knows Martha. Which of Bart and Clay can Nash reach?", "answer": "Bart", "steps": [ "Nash knows Bart." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Nash", "Basil", "Xavier", "Carla", "Atlas", "Walter", "Bart", "Tim", "Jessie", "Curtis", "Marvin", "Devon", "Eleanor", "Colleen", "Lewis", "Eldon", "Clay", "Martha", "Agnes", "Emmett" ], "edges": [ [ 0, 6 ], [ 3, 5 ], [ 3, 8 ], [ 3, 4 ], [ 4, 1 ], [ 4, 7 ], [ 6, 3 ], [ 7, 9 ], [ 8, 2 ], [ 10, 16 ], [ 13, 15 ], [ 13, 18 ], [ 13, 14 ], [ 14, 11 ], [ 14, 17 ], [ 16, 13 ], [ 17, 19 ], [ 18, 12 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Liam knows Shelby. Harlan knows Esther. Zoe knows Tabitha. Whitney knows Kent. Zoe knows Liam. Whitney knows Joyce. Dale knows Ethan. Kent knows Zoe. Harlan knows Carey. Zoe knows Rocco. Shaun knows Audrey. Carey knows Shaun. Ethan knows Harlan. Harlan knows Spencer. Spencer knows Andrea. Dale knows Celia. Tabitha knows Carrie. Shelby knows Caleb. Which of Liam and Carey can Whitney reach?", "answer": "Liam", "steps": [ "Whitney knows Kent.", "Kent knows Zoe.", "Zoe knows Liam." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Whitney", "Shelby", "Carrie", "Joyce", "Liam", "Caleb", "Rocco", "Tabitha", "Zoe", "Kent", "Dale", "Shaun", "Andrea", "Celia", "Carey", "Audrey", "Esther", "Spencer", "Harlan", "Ethan" ], "edges": [ [ 0, 3 ], [ 0, 9 ], [ 1, 5 ], [ 4, 1 ], [ 7, 2 ], [ 8, 4 ], [ 8, 6 ], [ 8, 7 ], [ 9, 8 ], [ 10, 13 ], [ 10, 19 ], [ 11, 15 ], [ 14, 11 ], [ 17, 12 ], [ 18, 14 ], [ 18, 16 ], [ 18, 17 ], [ 19, 18 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Bryan knows Alyson. Elise knows Pete. Dennis knows Nancy. Sierra knows Clinton. Elise knows Charlotte. Pete knows Dennis. Inez knows Aspen. Irene knows Holly. Joan knows Irene. Joan knows Alder. Bryan knows Neville. Irene knows Elaine. Jackson knows Sierra. Jackson knows Josie. Clinton knows Erica. Holly knows Inez. Dennis knows Jackson. Alyson knows Joan. Which of Sierra and Holly can Elise reach?", "answer": "Sierra", "steps": [ "Elise knows Pete.", "Pete knows Dennis.", "Dennis knows Jackson.", "Jackson knows Sierra." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Elise", "Erica", "Nancy", "Josie", "Sierra", "Pete", "Charlotte", "Clinton", "Dennis", "Jackson", "Bryan", "Aspen", "Alder", "Elaine", "Holly", "Alyson", "Neville", "Inez", "Joan", "Irene" ], "edges": [ [ 0, 6 ], [ 0, 5 ], [ 4, 7 ], [ 5, 8 ], [ 7, 1 ], [ 8, 2 ], [ 8, 9 ], [ 9, 3 ], [ 9, 4 ], [ 10, 16 ], [ 10, 15 ], [ 14, 17 ], [ 15, 18 ], [ 17, 11 ], [ 18, 12 ], [ 18, 19 ], [ 19, 13 ], [ 19, 14 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Lamar knows Pete. Darcy knows Hayes. Aaron knows Teresa. Grace knows Hazel. Kara knows Mack. Pete knows Ada. June knows Aaron. Nina knows Israel. Myra knows June. Israel knows Darcy. Myra knows Grace. Mack knows Joshua. Hazel knows Lamar. Kara knows Kamila. Joshua knows Clyde. Joshua knows Serena. Aaron knows Audrey. Kamila knows Nina. Which of Darcy and Pete can Myra reach?", "answer": "Pete", "steps": [ "Myra knows Grace.", "Grace knows Hazel.", "Hazel knows Lamar.", "Lamar knows Pete." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Myra", "Hazel", "Teresa", "Ada", "Grace", "Lamar", "Audrey", "June", "Pete", "Aaron", "Kara", "Nina", "Serena", "Hayes", "Kamila", "Israel", "Clyde", "Mack", "Darcy", "Joshua" ], "edges": [ [ 0, 4 ], [ 0, 7 ], [ 1, 5 ], [ 4, 1 ], [ 5, 8 ], [ 7, 9 ], [ 8, 3 ], [ 9, 2 ], [ 9, 6 ], [ 10, 14 ], [ 10, 17 ], [ 11, 15 ], [ 14, 11 ], [ 15, 18 ], [ 17, 19 ], [ 18, 13 ], [ 19, 12 ], [ 19, 16 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Paige knows Franklin. Ebony knows Eleanor. Marcia knows Beau. Marcia knows Maya. Walter knows Louis. Marcia knows Bonnie. Kristina knows Nicole. Beau knows Clark. Walter knows Marcia. Eleanor knows Eli. Ebony knows Rosa. Ebony knows Chantal. Rosa knows Lucy. Walter knows Hannah. Bonnie knows Ellen. Hannah knows Myra. Paige knows Ebony. Paige knows Kristina. Which of Eli and Clark can Walter reach?", "answer": "Clark", "steps": [ "Walter knows Marcia.", "Marcia knows Beau.", "Beau knows Clark." ], "difficulty": 3, "original_distance": 3, "idx_to_symbol": [ "Walter", "Ellen", "Bonnie", "Myra", "Beau", "Maya", "Marcia", "Clark", "Louis", "Hannah", "Paige", "Lucy", "Rosa", "Nicole", "Eleanor", "Chantal", "Ebony", "Eli", "Franklin", "Kristina" ], "edges": [ [ 0, 6 ], [ 0, 8 ], [ 0, 9 ], [ 2, 1 ], [ 4, 7 ], [ 6, 2 ], [ 6, 5 ], [ 6, 4 ], [ 9, 3 ], [ 10, 16 ], [ 10, 18 ], [ 10, 19 ], [ 12, 11 ], [ 14, 17 ], [ 16, 12 ], [ 16, 15 ], [ 16, 14 ], [ 19, 13 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Bridget knows Grady. Rachel knows Gerard. Ingrid knows Brock. Etta knows Ignacio. Ingrid knows Steve. Percy knows Norman. Carter knows Finn. Carter knows Miles. Finn knows Ira. Norman knows Ada. Norman knows Carter. Gerard knows Ingrid. Steve knows Eloise. Gerard knows Milton. Etta knows Ivan. Carter knows Etta. Steve knows Michelle. Ingrid knows Bridget. Which of Ignacio and Eloise can Rachel reach?", "answer": "Eloise", "steps": [ "Rachel knows Gerard.", "Gerard knows Ingrid.", "Ingrid knows Steve.", "Steve knows Eloise." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Rachel", "Michelle", "Ingrid", "Brock", "Grady", "Gerard", "Milton", "Steve", "Eloise", "Bridget", "Percy", "Ivan", "Carter", "Miles", "Ira", "Norman", "Ada", "Etta", "Ignacio", "Finn" ], "edges": [ [ 0, 5 ], [ 2, 3 ], [ 2, 7 ], [ 2, 9 ], [ 5, 6 ], [ 5, 2 ], [ 7, 1 ], [ 7, 8 ], [ 9, 4 ], [ 10, 15 ], [ 12, 13 ], [ 12, 17 ], [ 12, 19 ], [ 15, 16 ], [ 15, 12 ], [ 17, 11 ], [ 17, 18 ], [ 19, 14 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Ilene knows Crystal. Charlene knows Darnell. Jackson knows Lucille. Fred knows Fraser. Nathan knows Joaquin. Dominic knows Dirk. Fraser knows Milton. Coral knows Nathan. Fred knows Ilene. Harrison knows Vera. Ilene knows Charlene. Jackson knows Mildred. Milton knows Dominic. Harrison knows Estella. Harrison knows Jackson. Lucille knows Justine. Fred knows Elizabeth. Estella knows Coral. Which of Dominic and Nathan can Fred reach?", "answer": "Dominic", "steps": [ "Fred knows Fraser.", "Fraser knows Milton.", "Milton knows Dominic." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Fred", "Dirk", "Darnell", "Charlene", "Crystal", "Ilene", "Elizabeth", "Fraser", "Dominic", "Milton", "Harrison", "Joaquin", "Justine", "Lucille", "Mildred", "Jackson", "Vera", "Estella", "Nathan", "Coral" ], "edges": [ [ 0, 5 ], [ 0, 6 ], [ 0, 7 ], [ 3, 2 ], [ 5, 3 ], [ 5, 4 ], [ 7, 9 ], [ 8, 1 ], [ 9, 8 ], [ 10, 15 ], [ 10, 16 ], [ 10, 17 ], [ 13, 12 ], [ 15, 13 ], [ 15, 14 ], [ 17, 19 ], [ 18, 11 ], [ 19, 18 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Ronald knows Colleen. Hubert knows Willis. Ronald knows Jim. Willis knows Alyssa. Wesley knows Elmer. Lamont knows Elsa. Colleen knows Hubert. Colleen knows Eduardo. Eli knows Gage. Harper knows Cole. Alvin knows Cruz. Lamont knows Alvin. Alyssa knows Wesley. Esme knows Ronald. Cruz knows Eli. Gage knows Harper. Alvin knows Cornelius. Madeline knows Lamont. Which of Alvin and Colleen can Madeline reach?", "answer": "Alvin", "steps": [ "Madeline knows Lamont.", "Lamont knows Alvin." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Madeline", "Elsa", "Eli", "Cruz", "Harper", "Lamont", "Cornelius", "Alvin", "Gage", "Cole", "Esme", "Jim", "Willis", "Hubert", "Wesley", "Ronald", "Eduardo", "Colleen", "Alyssa", "Elmer" ], "edges": [ [ 0, 5 ], [ 2, 8 ], [ 3, 2 ], [ 4, 9 ], [ 5, 1 ], [ 5, 7 ], [ 7, 6 ], [ 7, 3 ], [ 8, 4 ], [ 10, 15 ], [ 12, 18 ], [ 13, 12 ], [ 14, 19 ], [ 15, 11 ], [ 15, 17 ], [ 17, 16 ], [ 17, 13 ], [ 18, 14 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Jose knows Ross. Layla knows Clyde. Corinne knows Julia. Lars knows Jose. Dahlia knows Melissa. Yuki knows Lars. Tessa knows Dahlia. Lars knows Layla. Curtis knows Isla. Amelia knows Tessa. Julia knows Yolanda. Ross knows Carlos. Carlos knows Corinne. Isla knows Amanda. Lamar knows Curtis. Brandon knows Clement. Melissa knows Brandon. Curtis knows Amelia. Which of Brandon and Julia can Yuki reach?", "answer": "Julia", "steps": [ "Yuki knows Lars.", "Lars knows Jose.", "Jose knows Ross.", "Ross knows Carlos.", "Carlos knows Corinne.", "Corinne knows Julia." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Yuki", "Carlos", "Julia", "Ross", "Lars", "Yolanda", "Corinne", "Jose", "Clyde", "Layla", "Lamar", "Dahlia", "Brandon", "Tessa", "Curtis", "Clement", "Melissa", "Amelia", "Amanda", "Isla" ], "edges": [ [ 0, 4 ], [ 1, 6 ], [ 2, 5 ], [ 3, 1 ], [ 4, 7 ], [ 4, 9 ], [ 6, 2 ], [ 7, 3 ], [ 9, 8 ], [ 10, 14 ], [ 11, 16 ], [ 12, 15 ], [ 13, 11 ], [ 14, 17 ], [ 14, 19 ], [ 16, 12 ], [ 17, 13 ], [ 19, 18 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Jillian knows Martin. Esme knows Amy. Tina knows Hayes. Jodi knows Hubert. Hayes knows Anthony. Donald knows Jodi. Houston knows Cornelius. Tina knows Emery. Hubert knows Janelle. Donald knows Alejandro. Donald knows Ember. Ember knows Arturo. Cornelius knows Nina. Tina knows Houston. Ember knows Mildred. Hayes knows Eduardo. Anthony knows Esme. Arturo knows Jillian. Which of Arturo and Anthony can Tina reach?", "answer": "Anthony", "steps": [ "Tina knows Hayes.", "Hayes knows Anthony." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Tina", "Esme", "Hayes", "Houston", "Emery", "Amy", "Eduardo", "Anthony", "Cornelius", "Nina", "Donald", "Jillian", "Ember", "Jodi", "Alejandro", "Martin", "Mildred", "Arturo", "Hubert", "Janelle" ], "edges": [ [ 0, 4 ], [ 0, 2 ], [ 0, 3 ], [ 1, 5 ], [ 2, 6 ], [ 2, 7 ], [ 3, 8 ], [ 7, 1 ], [ 8, 9 ], [ 10, 14 ], [ 10, 12 ], [ 10, 13 ], [ 11, 15 ], [ 12, 16 ], [ 12, 17 ], [ 13, 18 ], [ 17, 11 ], [ 18, 19 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Clarence knows Sam. Ibrahim knows Alfred. Devon knows Fleur. Joy knows Corey. Corey knows Boris. Langston knows Ingrid. Boris knows Dexter. Trina knows Joy. James knows Ibrahim. Corey knows Devon. Joy knows Lisette. Kimberly knows Spencer. Gavin knows Trina. Dexter knows Virgil. Ibrahim knows Kimberly. Sam knows James. James knows Gus. Alfred knows Langston. Which of James and Joy can Clarence reach?", "answer": "James", "steps": [ "Clarence knows Sam.", "Sam knows James." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Clarence", "James", "Alfred", "Ingrid", "Sam", "Gus", "Kimberly", "Langston", "Ibrahim", "Spencer", "Gavin", "Joy", "Boris", "Virgil", "Trina", "Lisette", "Devon", "Dexter", "Corey", "Fleur" ], "edges": [ [ 0, 4 ], [ 1, 5 ], [ 1, 8 ], [ 2, 7 ], [ 4, 1 ], [ 6, 9 ], [ 7, 3 ], [ 8, 2 ], [ 8, 6 ], [ 10, 14 ], [ 11, 15 ], [ 11, 18 ], [ 12, 17 ], [ 14, 11 ], [ 16, 19 ], [ 17, 13 ], [ 18, 12 ], [ 18, 16 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Mara knows Heath. Emmett knows Doris. Gregory knows Michelle. Gemma knows Vicki. Gregory knows Darren. Luke knows Mae. Vicki knows Isaac. Mia knows Elaine. Heath knows Mia. Mae knows Autumn. Isaac knows Ira. Luke knows Hadley. Autumn knows Gregory. Doris knows Luke. Doris knows Edward. Isaac knows Mara. Vicki knows Leonard. Mia knows Della. Which of Vicki and Doris can Gemma reach?", "answer": "Vicki", "steps": [ "Gemma knows Vicki." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Gemma", "Ira", "Leonard", "Mara", "Vicki", "Elaine", "Isaac", "Mia", "Heath", "Della", "Emmett", "Hadley", "Edward", "Mae", "Doris", "Darren", "Luke", "Gregory", "Autumn", "Michelle" ], "edges": [ [ 0, 4 ], [ 3, 8 ], [ 4, 2 ], [ 4, 6 ], [ 6, 1 ], [ 6, 3 ], [ 7, 5 ], [ 7, 9 ], [ 8, 7 ], [ 10, 14 ], [ 13, 18 ], [ 14, 12 ], [ 14, 16 ], [ 16, 11 ], [ 16, 13 ], [ 17, 15 ], [ 17, 19 ], [ 18, 17 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Ronald knows Colleen. Hubert knows Willis. Ronald knows Jim. Willis knows Alyssa. Wesley knows Elmer. Lamont knows Elsa. Colleen knows Hubert. Colleen knows Eduardo. Eli knows Gage. Harper knows Cole. Alvin knows Cruz. Lamont knows Alvin. Alyssa knows Wesley. Esme knows Ronald. Cruz knows Eli. Gage knows Harper. Alvin knows Cornelius. Madeline knows Lamont. Which of Cole and Elmer can Madeline reach?", "answer": "Cole", "steps": [ "Madeline knows Lamont.", "Lamont knows Alvin.", "Alvin knows Cruz.", "Cruz knows Eli.", "Eli knows Gage.", "Gage knows Harper.", "Harper knows Cole." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Madeline", "Elsa", "Eli", "Cruz", "Harper", "Lamont", "Cornelius", "Alvin", "Gage", "Cole", "Esme", "Jim", "Willis", "Hubert", "Wesley", "Ronald", "Eduardo", "Colleen", "Alyssa", "Elmer" ], "edges": [ [ 0, 5 ], [ 2, 8 ], [ 3, 2 ], [ 4, 9 ], [ 5, 1 ], [ 5, 7 ], [ 7, 6 ], [ 7, 3 ], [ 8, 4 ], [ 10, 15 ], [ 12, 18 ], [ 13, 12 ], [ 14, 19 ], [ 15, 11 ], [ 15, 17 ], [ 17, 16 ], [ 17, 13 ], [ 18, 14 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Nathan knows Louisa. Helene knows Anthony. Carl knows Priscilla. Foster knows Darnell. Priscilla knows Humphrey. Foster knows Merle. Jermaine knows Foster. Carl knows Malcolm. Zach knows Ruby. Merle knows Zach. Ruby knows Glenn. Humphrey knows Kane. Jermaine knows Ida. Priscilla knows Wendy. Kane knows Helene. Priscilla knows Fergus. Wendy knows Cliff. Foster knows Nathan. Which of Helene and Ruby can Jermaine reach?", "answer": "Ruby", "steps": [ "Jermaine knows Foster.", "Foster knows Merle.", "Merle knows Zach.", "Zach knows Ruby." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Jermaine", "Ruby", "Foster", "Glenn", "Nathan", "Merle", "Darnell", "Ida", "Zach", "Louisa", "Carl", "Helene", "Priscilla", "Anthony", "Wendy", "Humphrey", "Fergus", "Malcolm", "Kane", "Cliff" ], "edges": [ [ 0, 7 ], [ 0, 2 ], [ 1, 3 ], [ 2, 6 ], [ 2, 5 ], [ 2, 4 ], [ 4, 9 ], [ 5, 8 ], [ 8, 1 ], [ 10, 17 ], [ 10, 12 ], [ 11, 13 ], [ 12, 16 ], [ 12, 15 ], [ 12, 14 ], [ 14, 19 ], [ 15, 18 ], [ 18, 11 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Iris knows Vivian. Justine knows Mason. Eli knows Dwight. Dwight knows Ursula. Desmond knows Lily. Justine knows Duke. Gemma knows Herman. Vivian knows Itzel. Luis knows Evelyn. Evelyn knows Desmond. Luis knows Olive. Evelyn knows Justine. Iris knows Eli. Gemma knows Iris. Vivian knows Bella. Lily knows Odette. Eli knows Byron. Desmond knows Pearl. Which of Evelyn and Iris can Luis reach?", "answer": "Evelyn", "steps": [ "Luis knows Evelyn." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Luis", "Lily", "Desmond", "Mason", "Olive", "Odette", "Evelyn", "Justine", "Pearl", "Duke", "Gemma", "Dwight", "Eli", "Bella", "Herman", "Ursula", "Iris", "Vivian", "Byron", "Itzel" ], "edges": [ [ 0, 4 ], [ 0, 6 ], [ 1, 5 ], [ 2, 1 ], [ 2, 8 ], [ 6, 2 ], [ 6, 7 ], [ 7, 3 ], [ 7, 9 ], [ 10, 14 ], [ 10, 16 ], [ 11, 15 ], [ 12, 11 ], [ 12, 18 ], [ 16, 12 ], [ 16, 17 ], [ 17, 13 ], [ 17, 19 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Goldie knows Faye. Arturo knows Kendrick. Faye knows Victoria. Samantha knows Charlene. Faye knows Gus. Gus knows Cordelia. Knox knows Geneva. Faye knows Colby. Geneva knows Warren. Garrett knows Zach. Victoria knows Hazel. Zach knows Samantha. Samantha knows Knox. Cordelia knows Leander. Samantha knows Arturo. Denise knows Goldie. Samantha knows Dylan. Faye knows Spencer. Which of Warren and Leander can Denise reach?", "answer": "Leander", "steps": [ "Denise knows Goldie.", "Goldie knows Faye.", "Faye knows Gus.", "Gus knows Cordelia.", "Cordelia knows Leander." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Denise", "Cordelia", "Spencer", "Victoria", "Gus", "Faye", "Leander", "Goldie", "Hazel", "Colby", "Garrett", "Geneva", "Dylan", "Arturo", "Knox", "Samantha", "Warren", "Zach", "Kendrick", "Charlene" ], "edges": [ [ 0, 7 ], [ 1, 6 ], [ 3, 8 ], [ 4, 1 ], [ 5, 2 ], [ 5, 4 ], [ 5, 3 ], [ 5, 9 ], [ 7, 5 ], [ 10, 17 ], [ 11, 16 ], [ 13, 18 ], [ 14, 11 ], [ 15, 12 ], [ 15, 14 ], [ 15, 13 ], [ 15, 19 ], [ 17, 15 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Neal knows Dante. Vera knows Harmony. Betty knows Israel. Colby knows Alvin. Betty knows Dolly. Alex knows Imogen. Joy knows Colby. Vera knows Gene. Thomas knows Jewel. Colby knows Carlos. Natalie knows Joy. Molly knows Alex. Dolly knows Neal. Jewel knows Vera. Molly knows Bob. Gene knows Betty. Carlos knows Molly. Imogen knows Grant. Which of Betty and Molly can Thomas reach?", "answer": "Betty", "steps": [ "Thomas knows Jewel.", "Jewel knows Vera.", "Vera knows Gene.", "Gene knows Betty." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Thomas", "Israel", "Dolly", "Vera", "Dante", "Jewel", "Neal", "Betty", "Harmony", "Gene", "Natalie", "Bob", "Alex", "Colby", "Grant", "Joy", "Imogen", "Molly", "Alvin", "Carlos" ], "edges": [ [ 0, 5 ], [ 2, 6 ], [ 3, 8 ], [ 3, 9 ], [ 5, 3 ], [ 6, 4 ], [ 7, 1 ], [ 7, 2 ], [ 9, 7 ], [ 10, 15 ], [ 12, 16 ], [ 13, 18 ], [ 13, 19 ], [ 15, 13 ], [ 16, 14 ], [ 17, 11 ], [ 17, 12 ], [ 19, 17 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Louis knows Clara. Kenzie knows Joy. Ibrahim knows Jeremiah. Trina knows Flora. Joyce knows Enid. Joyce knows Troy. Ibrahim knows Kamila. Natalie knows Louis. Ibrahim knows Donovan. Louis knows Gladys. Vernon knows Lawson. Vernon knows Cruz. Trina knows Joyce. Louis knows Patrick. Kenzie knows Ibrahim. Vernon knows Jeanne. Jeremiah knows Vernon. Joyce knows Natalie. Which of Patrick and Lawson can Kenzie reach?", "answer": "Lawson", "steps": [ "Kenzie knows Ibrahim.", "Ibrahim knows Jeremiah.", "Jeremiah knows Vernon.", "Vernon knows Lawson." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Kenzie", "Joy", "Kamila", "Lawson", "Vernon", "Jeremiah", "Cruz", "Jeanne", "Donovan", "Ibrahim", "Trina", "Flora", "Enid", "Patrick", "Louis", "Natalie", "Gladys", "Clara", "Troy", "Joyce" ], "edges": [ [ 0, 1 ], [ 0, 9 ], [ 4, 3 ], [ 4, 6 ], [ 4, 7 ], [ 5, 4 ], [ 9, 2 ], [ 9, 5 ], [ 9, 8 ], [ 10, 11 ], [ 10, 19 ], [ 14, 13 ], [ 14, 16 ], [ 14, 17 ], [ 15, 14 ], [ 19, 12 ], [ 19, 15 ], [ 19, 18 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Doris knows Hayley. Jacob knows Jonah. Belinda knows Nadine. Jacob knows Aspen. Keith knows Theodore. Aspen knows Haven. Haven knows Edison. Belinda knows Hadley. Don knows Elodie. Theodore knows Zara. Doris knows Raymond. Theodore knows Belinda. Haven knows Chester. Jana knows Don. Don knows Jacob. Theodore knows Alyson. Don knows Elias. Nadine knows Doris. Which of Doris and Haven can Keith reach?", "answer": "Doris", "steps": [ "Keith knows Theodore.", "Theodore knows Belinda.", "Belinda knows Nadine.", "Nadine knows Doris." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Keith", "Nadine", "Zara", "Theodore", "Alyson", "Hadley", "Hayley", "Doris", "Belinda", "Raymond", "Jana", "Aspen", "Elodie", "Don", "Elias", "Jonah", "Chester", "Haven", "Jacob", "Edison" ], "edges": [ [ 0, 3 ], [ 1, 7 ], [ 3, 2 ], [ 3, 4 ], [ 3, 8 ], [ 7, 6 ], [ 7, 9 ], [ 8, 5 ], [ 8, 1 ], [ 10, 13 ], [ 11, 17 ], [ 13, 12 ], [ 13, 14 ], [ 13, 18 ], [ 17, 16 ], [ 17, 19 ], [ 18, 15 ], [ 18, 11 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Adele knows Erwin. Pearl knows Paula. Florence knows Kent. Calvin knows Billy. Casey knows Tabitha. Darla knows Peggy. Peter knows Florence. Billy knows Maude. Paula knows Casey. Erwin knows Marvin. Kent knows Angela. Marvin knows Calvin. Angela knows Julius. Shelby knows Ivy. Peggy knows Adele. Rex knows Pearl. Tabitha knows Peter. Maude knows Shelby. Which of Paula and Adele can Darla reach?", "answer": "Adele", "steps": [ "Darla knows Peggy.", "Peggy knows Adele." ], "difficulty": 2, "original_distance": 9, "idx_to_symbol": [ "Darla", "Adele", "Calvin", "Peggy", "Maude", "Marvin", "Shelby", "Erwin", "Ivy", "Billy", "Rex", "Paula", "Peter", "Pearl", "Kent", "Tabitha", "Angela", "Casey", "Julius", "Florence" ], "edges": [ [ 0, 3 ], [ 1, 7 ], [ 2, 9 ], [ 3, 1 ], [ 4, 6 ], [ 5, 2 ], [ 6, 8 ], [ 7, 5 ], [ 9, 4 ], [ 10, 13 ], [ 11, 17 ], [ 12, 19 ], [ 13, 11 ], [ 14, 16 ], [ 15, 12 ], [ 16, 18 ], [ 17, 15 ], [ 19, 14 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Ellen knows Marcia. Greta knows Amelia. Kurt knows Greta. Ellen knows Austin. Burt knows Fisher. Austin knows Neville. Margaret knows Burt. Hailey knows Jesse. Hailey knows Nelson. Nelson knows Ellen. Kathleen knows Kurt. Jesse knows Jordan. Burt knows Randy. Hendrix knows Dorian. Kurt knows Margaret. Randy knows Keegan. Dorian knows Hailey. Garrison knows Kathleen. Which of Nelson and Margaret can Hendrix reach?", "answer": "Nelson", "steps": [ "Hendrix knows Dorian.", "Dorian knows Hailey.", "Hailey knows Nelson." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Hendrix", "Ellen", "Jesse", "Austin", "Nelson", "Dorian", "Jordan", "Hailey", "Neville", "Marcia", "Garrison", "Burt", "Greta", "Randy", "Margaret", "Kathleen", "Amelia", "Kurt", "Keegan", "Fisher" ], "edges": [ [ 0, 5 ], [ 1, 3 ], [ 1, 9 ], [ 2, 6 ], [ 3, 8 ], [ 4, 1 ], [ 5, 7 ], [ 7, 2 ], [ 7, 4 ], [ 10, 15 ], [ 11, 13 ], [ 11, 19 ], [ 12, 16 ], [ 13, 18 ], [ 14, 11 ], [ 15, 17 ], [ 17, 12 ], [ 17, 14 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Lauren knows Janice. Lauren knows Nell. Lauren knows Reid. Larry knows Merle. Eric knows Drew. Miranda knows Connor. Estelle knows Lauren. Larry knows Eric. Leland knows Joy. Reid knows Joel. Boris knows Larry. Larry knows Leland. Leland knows Miranda. Keegan knows David. Larry knows Joaquin. Reid knows Ashton. Lauren knows Keegan. Joel knows Elias. Which of Joel and Miranda can Estelle reach?", "answer": "Joel", "steps": [ "Estelle knows Lauren.", "Lauren knows Reid.", "Reid knows Joel." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Estelle", "Keegan", "Ashton", "Janice", "Nell", "Joel", "Elias", "Lauren", "David", "Reid", "Boris", "Eric", "Joy", "Merle", "Joaquin", "Miranda", "Connor", "Larry", "Drew", "Leland" ], "edges": [ [ 0, 7 ], [ 1, 8 ], [ 5, 6 ], [ 7, 3 ], [ 7, 4 ], [ 7, 1 ], [ 7, 9 ], [ 9, 2 ], [ 9, 5 ], [ 10, 17 ], [ 11, 18 ], [ 15, 16 ], [ 17, 13 ], [ 17, 14 ], [ 17, 11 ], [ 17, 19 ], [ 19, 12 ], [ 19, 15 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Gemma knows Greta. Annette knows Logan. Bruce knows Gemma. Stephanie knows Dale. Mark knows Myrtle. Greta knows Jacqueline. Erica knows Bruce. Annette knows Sam. Haley knows Audrey. Audrey knows Alicia. Sam knows Stephanie. Wade knows Opal. Wade knows Veronica. Alicia knows Erica. Veronica knows Mark. Dale knows Wade. Bruce knows Ford. Haley knows Andrea. Which of Veronica and Gemma can Haley reach?", "answer": "Gemma", "steps": [ "Haley knows Audrey.", "Audrey knows Alicia.", "Alicia knows Erica.", "Erica knows Bruce.", "Bruce knows Gemma." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Haley", "Audrey", "Greta", "Andrea", "Gemma", "Ford", "Bruce", "Jacqueline", "Alicia", "Erica", "Annette", "Sam", "Mark", "Logan", "Veronica", "Opal", "Wade", "Myrtle", "Stephanie", "Dale" ], "edges": [ [ 0, 3 ], [ 0, 1 ], [ 1, 8 ], [ 2, 7 ], [ 4, 2 ], [ 6, 5 ], [ 6, 4 ], [ 8, 9 ], [ 9, 6 ], [ 10, 13 ], [ 10, 11 ], [ 11, 18 ], [ 12, 17 ], [ 14, 12 ], [ 16, 15 ], [ 16, 14 ], [ 18, 19 ], [ 19, 16 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Eloise knows Cameron. Lauren knows Dell. Bernice knows Dalton. Connor knows Alana. Beth knows Connor. Beth knows Dewey. Matthew knows Barney. Katherine knows Bernice. Lauren knows Katherine. Bernice knows Matthew. Alana knows Jake. Dewey knows Gustavo. Eloise knows Ilene. Cameron knows Beth. Barney knows Amber. Dalton knows Erma. Dalton knows Forrest. Dewey knows Landon. Which of Amber and Jake can Lauren reach?", "answer": "Amber", "steps": [ "Lauren knows Katherine.", "Katherine knows Bernice.", "Bernice knows Matthew.", "Matthew knows Barney.", "Barney knows Amber." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Lauren", "Dalton", "Katherine", "Bernice", "Erma", "Dell", "Barney", "Forrest", "Matthew", "Amber", "Eloise", "Dewey", "Cameron", "Beth", "Landon", "Ilene", "Alana", "Gustavo", "Connor", "Jake" ], "edges": [ [ 0, 5 ], [ 0, 2 ], [ 1, 4 ], [ 1, 7 ], [ 2, 3 ], [ 3, 1 ], [ 3, 8 ], [ 6, 9 ], [ 8, 6 ], [ 10, 15 ], [ 10, 12 ], [ 11, 14 ], [ 11, 17 ], [ 12, 13 ], [ 13, 11 ], [ 13, 18 ], [ 16, 19 ], [ 18, 16 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Lottie knows Aisha. Harlan knows Jermaine. Conrad knows Francesca. Jim knows Alyson. Lisette knows Don. Lisette knows Lewis. Gail knows Benjamin. Lottie knows Janice. Rebecca knows Gail. Harlan knows Conrad. Jim knows Lottie. Alyson knows Bailey. Jermaine knows Donovan. Rebecca knows Elizabeth. Conrad knows Rebecca. Janice knows Lisette. Gail knows Jeremiah. Janice knows Carmen. Which of Don and Jeremiah can Harlan reach?", "answer": "Jeremiah", "steps": [ "Harlan knows Conrad.", "Conrad knows Rebecca.", "Rebecca knows Gail.", "Gail knows Jeremiah." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Harlan", "Conrad", "Jermaine", "Francesca", "Elizabeth", "Jeremiah", "Rebecca", "Donovan", "Benjamin", "Gail", "Jim", "Lottie", "Alyson", "Aisha", "Carmen", "Don", "Janice", "Bailey", "Lewis", "Lisette" ], "edges": [ [ 0, 2 ], [ 0, 1 ], [ 1, 3 ], [ 1, 6 ], [ 2, 7 ], [ 6, 4 ], [ 6, 9 ], [ 9, 5 ], [ 9, 8 ], [ 10, 12 ], [ 10, 11 ], [ 11, 13 ], [ 11, 16 ], [ 12, 17 ], [ 16, 14 ], [ 16, 19 ], [ 19, 15 ], [ 19, 18 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Louis knows Andrea. Doug knows Louis. Chris knows Noah. Noah knows Duncan. Trevor knows Morris. Hardy knows Dina. Hardy knows Tamara. Aspen knows Duke. Trevor knows Geoffrey. Chandler knows Dorothy. Louis knows Hardy. Chris knows Trevor. Virgil knows Doug. Duke knows Cordelia. Andrea knows Miriam. Cordelia knows Chris. Chandler knows Virgil. Aspen knows Delia. Which of Trevor and Hardy can Chandler reach?", "answer": "Hardy", "steps": [ "Chandler knows Virgil.", "Virgil knows Doug.", "Doug knows Louis.", "Louis knows Hardy." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Chandler", "Dina", "Doug", "Tamara", "Andrea", "Miriam", "Virgil", "Louis", "Hardy", "Dorothy", "Aspen", "Morris", "Cordelia", "Geoffrey", "Noah", "Duncan", "Duke", "Chris", "Trevor", "Delia" ], "edges": [ [ 0, 6 ], [ 0, 9 ], [ 2, 7 ], [ 4, 5 ], [ 6, 2 ], [ 7, 4 ], [ 7, 8 ], [ 8, 1 ], [ 8, 3 ], [ 10, 16 ], [ 10, 19 ], [ 12, 17 ], [ 14, 15 ], [ 16, 12 ], [ 17, 14 ], [ 17, 18 ], [ 18, 11 ], [ 18, 13 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Freya knows Arnold. Dorothy knows Jeanne. Lillian knows Max. Arnold knows Anthony. Max knows Val. Aaron knows Megan. Megan knows Rose. Renee knows Valerie. Trudy knows Renee. Eric knows Norman. Angela knows Allan. Norman knows Marion. Val knows Otto. Anthony knows Dorothy. Arnold knows Angela. Dorothy knows Eric. Max knows Aaron. Megan knows Trudy. Which of Megan and Dorothy can Freya reach?", "answer": "Dorothy", "steps": [ "Freya knows Arnold.", "Arnold knows Anthony.", "Anthony knows Dorothy." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Freya", "Arnold", "Eric", "Allan", "Angela", "Jeanne", "Dorothy", "Anthony", "Norman", "Marion", "Lillian", "Max", "Trudy", "Otto", "Val", "Rose", "Megan", "Aaron", "Renee", "Valerie" ], "edges": [ [ 0, 1 ], [ 1, 4 ], [ 1, 7 ], [ 2, 8 ], [ 4, 3 ], [ 6, 5 ], [ 6, 2 ], [ 7, 6 ], [ 8, 9 ], [ 10, 11 ], [ 11, 14 ], [ 11, 17 ], [ 12, 18 ], [ 14, 13 ], [ 16, 15 ], [ 16, 12 ], [ 17, 16 ], [ 18, 19 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Jim knows Ronald. Elsa knows Jeff. Carmela knows Thomas. Anastasia knows Tara. Jeff knows Olivia. Scott knows Cyrus. Anastasia knows Amanda. Lawson knows Fabian. Jeff knows Scott. Michael knows Luke. Jeff knows Carmela. Amanda knows Enid. Carmela knows Louise. Isla knows Jim. Amanda knows Chase. Ronald knows Anastasia. Anastasia knows Michael. Fabian knows Elsa. Which of Elsa and Ronald can Lawson reach?", "answer": "Elsa", "steps": [ "Lawson knows Fabian.", "Fabian knows Elsa." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Lawson", "Elsa", "Thomas", "Fabian", "Jeff", "Cyrus", "Louise", "Carmela", "Scott", "Olivia", "Isla", "Ronald", "Chase", "Jim", "Anastasia", "Luke", "Enid", "Amanda", "Michael", "Tara" ], "edges": [ [ 0, 3 ], [ 1, 4 ], [ 3, 1 ], [ 4, 7 ], [ 4, 8 ], [ 4, 9 ], [ 7, 2 ], [ 7, 6 ], [ 8, 5 ], [ 10, 13 ], [ 11, 14 ], [ 13, 11 ], [ 14, 17 ], [ 14, 18 ], [ 14, 19 ], [ 17, 12 ], [ 17, 16 ], [ 18, 15 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Luther knows Jim. Jessie knows Julius. Norma knows Clay. Jasper knows Mae. Jim knows Virginia. Zoe knows Evan. Dakota knows Zach. Clay knows Fisher. Julius knows Dexter. Dakota knows Zoe. Mae knows Dakota. Virginia knows Brooke. Fisher knows Garland. Brooke knows Jessie. Daisy knows Luther. Rowan knows Daisy. Luther knows Hope. Evan knows Norma. Which of Evan and Virginia can Rowan reach?", "answer": "Virginia", "steps": [ "Rowan knows Daisy.", "Daisy knows Luther.", "Luther knows Jim.", "Jim knows Virginia." ], "difficulty": 4, "original_distance": 8, "idx_to_symbol": [ "Rowan", "Jessie", "Julius", "Brooke", "Jim", "Dexter", "Luther", "Virginia", "Daisy", "Hope", "Jasper", "Clay", "Fisher", "Norma", "Zoe", "Garland", "Dakota", "Evan", "Mae", "Zach" ], "edges": [ [ 0, 8 ], [ 1, 2 ], [ 2, 5 ], [ 3, 1 ], [ 4, 7 ], [ 6, 4 ], [ 6, 9 ], [ 7, 3 ], [ 8, 6 ], [ 10, 18 ], [ 11, 12 ], [ 12, 15 ], [ 13, 11 ], [ 14, 17 ], [ 16, 14 ], [ 16, 19 ], [ 17, 13 ], [ 18, 16 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Nora knows Cindy. Reed knows Caleb. Conner knows Lucy. Curtis knows Natalie. Eamon knows Reed. Conner knows Gerard. Curtis knows Max. Richard knows Jose. Eamon knows Hamilton. Perry knows Nora. Dell knows Randall. Nora knows Mabel. Natalie knows Ruby. Cindy knows Curtis. Randall knows Conner. Arnold knows Dell. Lucy knows Eamon. Jose knows Perry. Which of Caleb and Ruby can Richard reach?", "answer": "Ruby", "steps": [ "Richard knows Jose.", "Jose knows Perry.", "Perry knows Nora.", "Nora knows Cindy.", "Cindy knows Curtis.", "Curtis knows Natalie.", "Natalie knows Ruby." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Richard", "Ruby", "Mabel", "Cindy", "Max", "Natalie", "Jose", "Curtis", "Perry", "Nora", "Arnold", "Caleb", "Gerard", "Lucy", "Hamilton", "Reed", "Dell", "Eamon", "Randall", "Conner" ], "edges": [ [ 0, 6 ], [ 3, 7 ], [ 5, 1 ], [ 6, 8 ], [ 7, 4 ], [ 7, 5 ], [ 8, 9 ], [ 9, 2 ], [ 9, 3 ], [ 10, 16 ], [ 13, 17 ], [ 15, 11 ], [ 16, 18 ], [ 17, 14 ], [ 17, 15 ], [ 18, 19 ], [ 19, 12 ], [ 19, 13 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Alfonso knows Florence. Ben knows Charlene. Dexter knows Ingrid. Garrett knows Hank. Florence knows Norman. Oliver knows Vance. Vance knows Victoria. Vance knows Dexter. George knows Deirdre. Jake knows Garrett. George knows Ivy. Garrett knows Cole. Ivy knows Ben. Jake knows Fisher. Eva knows Jake. Dexter knows George. Cole knows Gordon. Cole knows Alfonso. Which of Dexter and Garrett can Eva reach?", "answer": "Garrett", "steps": [ "Eva knows Jake.", "Jake knows Garrett." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Eva", "Cole", "Gordon", "Alfonso", "Norman", "Fisher", "Florence", "Jake", "Hank", "Garrett", "Oliver", "George", "Deirdre", "Ivy", "Charlene", "Victoria", "Ben", "Vance", "Ingrid", "Dexter" ], "edges": [ [ 0, 7 ], [ 1, 2 ], [ 1, 3 ], [ 3, 6 ], [ 6, 4 ], [ 7, 5 ], [ 7, 9 ], [ 9, 1 ], [ 9, 8 ], [ 10, 17 ], [ 11, 12 ], [ 11, 13 ], [ 13, 16 ], [ 16, 14 ], [ 17, 15 ], [ 17, 19 ], [ 19, 11 ], [ 19, 18 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Myrtle knows Malcolm. Gladys knows John. Courtney knows Mindy. Rosemary knows Sylvia. Geraldine knows Neil. Lacey knows Edwin. Geraldine knows Gladys. Juan knows Rosemary. Gladys knows Kendrick. Neil knows Luna. Kendrick knows Zane. Gladys knows Eric. Kendrick knows Courtney. Myrtle knows Juan. Juan knows Gary. Juan knows Kay. Rosemary knows Lacey. Malcolm knows Elton. Which of Rosemary and Kendrick can Geraldine reach?", "answer": "Kendrick", "steps": [ "Geraldine knows Gladys.", "Gladys knows Kendrick." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Geraldine", "Gladys", "Kendrick", "John", "Mindy", "Eric", "Neil", "Zane", "Luna", "Courtney", "Myrtle", "Juan", "Rosemary", "Gary", "Edwin", "Kay", "Malcolm", "Sylvia", "Elton", "Lacey" ], "edges": [ [ 0, 6 ], [ 0, 1 ], [ 1, 3 ], [ 1, 5 ], [ 1, 2 ], [ 2, 7 ], [ 2, 9 ], [ 6, 8 ], [ 9, 4 ], [ 10, 16 ], [ 10, 11 ], [ 11, 13 ], [ 11, 15 ], [ 11, 12 ], [ 12, 17 ], [ 12, 19 ], [ 16, 18 ], [ 19, 14 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Greta knows Derrick. Fleur knows Jana. Alan knows Leah. Leah knows Beau. Lucia knows Greta. Clayton knows Lucia. Alan knows Irma. Rebecca knows Celeste. Tina knows Yvonne. Greta knows Tina. Celeste knows Hayden. Yvonne knows Bella. Tina knows Emily. Hayden knows Alan. Derrick knows Lambert. Irma knows Mae. Irma knows Fleur. Teresa knows Clayton. Which of Yvonne and Fleur can Teresa reach?", "answer": "Yvonne", "steps": [ "Teresa knows Clayton.", "Clayton knows Lucia.", "Lucia knows Greta.", "Greta knows Tina.", "Tina knows Yvonne." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Teresa", "Lucia", "Clayton", "Derrick", "Tina", "Bella", "Greta", "Emily", "Lambert", "Yvonne", "Rebecca", "Hayden", "Celeste", "Leah", "Irma", "Jana", "Alan", "Mae", "Beau", "Fleur" ], "edges": [ [ 0, 2 ], [ 1, 6 ], [ 2, 1 ], [ 3, 8 ], [ 4, 7 ], [ 4, 9 ], [ 6, 3 ], [ 6, 4 ], [ 9, 5 ], [ 10, 12 ], [ 11, 16 ], [ 12, 11 ], [ 13, 18 ], [ 14, 17 ], [ 14, 19 ], [ 16, 13 ], [ 16, 14 ], [ 19, 15 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Ellen knows Marcia. Greta knows Amelia. Kurt knows Greta. Ellen knows Austin. Burt knows Fisher. Austin knows Neville. Margaret knows Burt. Hailey knows Jesse. Hailey knows Nelson. Nelson knows Ellen. Kathleen knows Kurt. Jesse knows Jordan. Burt knows Randy. Hendrix knows Dorian. Kurt knows Margaret. Randy knows Keegan. Dorian knows Hailey. Garrison knows Kathleen. Which of Keegan and Neville can Hendrix reach?", "answer": "Neville", "steps": [ "Hendrix knows Dorian.", "Dorian knows Hailey.", "Hailey knows Nelson.", "Nelson knows Ellen.", "Ellen knows Austin.", "Austin knows Neville." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Hendrix", "Ellen", "Jesse", "Austin", "Nelson", "Dorian", "Jordan", "Hailey", "Neville", "Marcia", "Garrison", "Burt", "Greta", "Randy", "Margaret", "Kathleen", "Amelia", "Kurt", "Keegan", "Fisher" ], "edges": [ [ 0, 5 ], [ 1, 3 ], [ 1, 9 ], [ 2, 6 ], [ 3, 8 ], [ 4, 1 ], [ 5, 7 ], [ 7, 2 ], [ 7, 4 ], [ 10, 15 ], [ 11, 13 ], [ 11, 19 ], [ 12, 16 ], [ 13, 18 ], [ 14, 11 ], [ 15, 17 ], [ 17, 12 ], [ 17, 14 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Federico knows Heath. Dennis knows Frida. Federico knows Gordon. Alan knows Earl. Cynthia knows Gene. Frida knows Joaquin. Hilda knows Kai. Joaquin knows Tyler. Elise knows Cooper. Kai knows Gina. Cooper knows Cynthia. Kai knows Dennis. Heath knows Elise. Gordon knows Wilson. Wilson knows Fergus. Gina knows Alan. Max knows Federico. Tyler knows Cain. Which of Cooper and Joaquin can Hilda reach?", "answer": "Joaquin", "steps": [ "Hilda knows Kai.", "Kai knows Dennis.", "Dennis knows Frida.", "Frida knows Joaquin." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Hilda", "Alan", "Dennis", "Cain", "Frida", "Kai", "Tyler", "Joaquin", "Gina", "Earl", "Max", "Wilson", "Heath", "Gene", "Elise", "Federico", "Cynthia", "Cooper", "Gordon", "Fergus" ], "edges": [ [ 0, 5 ], [ 1, 9 ], [ 2, 4 ], [ 4, 7 ], [ 5, 2 ], [ 5, 8 ], [ 6, 3 ], [ 7, 6 ], [ 8, 1 ], [ 10, 15 ], [ 11, 19 ], [ 12, 14 ], [ 14, 17 ], [ 15, 12 ], [ 15, 18 ], [ 16, 13 ], [ 17, 16 ], [ 18, 11 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Dell knows Hope. Veronica knows Gage. Gage knows Kelsey. Langston knows Devon. Ricardo knows Samuel. Dell knows Ricardo. Sebastian knows Alder. Sebastian knows Nicole. Hope knows Emery. Gage knows Logan. Devon knows Demetrius. Demetrius knows Sybil. Elena knows Sebastian. Emery knows Elena. Sybil knows Veronica. Denver knows Leo. Devon knows Denver. Hannah knows Dell. Which of Sebastian and Gage can Hannah reach?", "answer": "Sebastian", "steps": [ "Hannah knows Dell.", "Dell knows Hope.", "Hope knows Emery.", "Emery knows Elena.", "Elena knows Sebastian." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Hannah", "Ricardo", "Dell", "Hope", "Sebastian", "Elena", "Alder", "Emery", "Nicole", "Samuel", "Langston", "Denver", "Devon", "Demetrius", "Gage", "Veronica", "Kelsey", "Sybil", "Logan", "Leo" ], "edges": [ [ 0, 2 ], [ 1, 9 ], [ 2, 3 ], [ 2, 1 ], [ 3, 7 ], [ 4, 6 ], [ 4, 8 ], [ 5, 4 ], [ 7, 5 ], [ 10, 12 ], [ 11, 19 ], [ 12, 13 ], [ 12, 11 ], [ 13, 17 ], [ 14, 16 ], [ 14, 18 ], [ 15, 14 ], [ 17, 15 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Joyce knows Louis. Max knows Joyce. Yara knows Parker. Knox knows Sebastian. Susan knows Darius. Grady knows Yara. Jonathan knows Bridget. Yara knows Susan. Knox knows Jonathan. George knows Knox. Evelyn knows Max. Jeremiah knows Grover. Max knows Chandler. George knows Grady. Jeremiah knows Sadie. Alex knows Jeremiah. Evelyn knows Alex. Sadie knows Heidi. Which of Yara and Jeremiah can George reach?", "answer": "Yara", "steps": [ "George knows Grady.", "Grady knows Yara." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "George", "Darius", "Sebastian", "Knox", "Parker", "Yara", "Grady", "Bridget", "Susan", "Jonathan", "Evelyn", "Heidi", "Chandler", "Max", "Grover", "Jeremiah", "Alex", "Louis", "Sadie", "Joyce" ], "edges": [ [ 0, 6 ], [ 0, 3 ], [ 3, 2 ], [ 3, 9 ], [ 5, 4 ], [ 5, 8 ], [ 6, 5 ], [ 8, 1 ], [ 9, 7 ], [ 10, 16 ], [ 10, 13 ], [ 13, 12 ], [ 13, 19 ], [ 15, 14 ], [ 15, 18 ], [ 16, 15 ], [ 18, 11 ], [ 19, 17 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Tara knows Amy. Lee knows Marie. Jillian knows Margaret. Connor knows India. India knows Jillian. Lee knows Keaton. Houston knows Hilda. Hilda knows Zelda. Lois knows Gareth. Milo knows Houston. Keaton knows Esther. Hilda knows Lucia. Jillian knows Lee. Esther knows Lois. Zelda knows Tara. Amy knows Angelica. Zelda knows Mary. Angelica knows Javier. Which of Keaton and Tara can Connor reach?", "answer": "Keaton", "steps": [ "Connor knows India.", "India knows Jillian.", "Jillian knows Lee.", "Lee knows Keaton." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Connor", "Lee", "Margaret", "Keaton", "Gareth", "Esther", "Jillian", "Marie", "India", "Lois", "Milo", "Zelda", "Lucia", "Tara", "Javier", "Amy", "Hilda", "Mary", "Houston", "Angelica" ], "edges": [ [ 0, 8 ], [ 1, 7 ], [ 1, 3 ], [ 3, 5 ], [ 5, 9 ], [ 6, 2 ], [ 6, 1 ], [ 8, 6 ], [ 9, 4 ], [ 10, 18 ], [ 11, 17 ], [ 11, 13 ], [ 13, 15 ], [ 15, 19 ], [ 16, 12 ], [ 16, 11 ], [ 18, 16 ], [ 19, 14 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Tim knows Lucille. Lucille knows Lucy. Jermaine knows Gerald. Kim knows Jermaine. Morgan knows Earl. Randall knows Tim. Jermaine knows Cain. Randall knows Parker. Erwin knows Serena. Cynthia knows Davis. Lucy knows Fraser. Cynthia knows Barney. Erwin knows Kim. Karl knows Audrey. Earl knows Erwin. Lucy knows Electra. Karl knows Morgan. Fraser knows Cynthia. Which of Lucille and Earl can Randall reach?", "answer": "Lucille", "steps": [ "Randall knows Tim.", "Tim knows Lucille." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Randall", "Lucille", "Parker", "Lucy", "Tim", "Cynthia", "Barney", "Electra", "Fraser", "Davis", "Karl", "Earl", "Audrey", "Erwin", "Morgan", "Jermaine", "Gerald", "Serena", "Kim", "Cain" ], "edges": [ [ 0, 2 ], [ 0, 4 ], [ 1, 3 ], [ 3, 7 ], [ 3, 8 ], [ 4, 1 ], [ 5, 6 ], [ 5, 9 ], [ 8, 5 ], [ 10, 12 ], [ 10, 14 ], [ 11, 13 ], [ 13, 17 ], [ 13, 18 ], [ 14, 11 ], [ 15, 16 ], [ 15, 19 ], [ 18, 15 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Felicia knows Clinton. Carmen knows Felicia. Elliot knows Clifford. Stefan knows Elliot. Monica knows Destiny. Darwin knows Monica. Destiny knows Chase. Fraser knows Kara. Kara knows Alfonso. Lena knows Colette. Fraser knows Yara. Yara knows Florence. Florence knows Dolores. Wilma knows Lena. Yara knows Darwin. Colette knows Howard. Stefan knows Carmen. Carmen knows Wilma. Which of Monica and Lena can Stefan reach?", "answer": "Lena", "steps": [ "Stefan knows Carmen.", "Carmen knows Wilma.", "Wilma knows Lena." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Stefan", "Carmen", "Colette", "Felicia", "Clifford", "Wilma", "Lena", "Howard", "Elliot", "Clinton", "Fraser", "Yara", "Destiny", "Florence", "Alfonso", "Darwin", "Monica", "Chase", "Kara", "Dolores" ], "edges": [ [ 0, 8 ], [ 0, 1 ], [ 1, 5 ], [ 1, 3 ], [ 2, 7 ], [ 3, 9 ], [ 5, 6 ], [ 6, 2 ], [ 8, 4 ], [ 10, 18 ], [ 10, 11 ], [ 11, 15 ], [ 11, 13 ], [ 12, 17 ], [ 13, 19 ], [ 15, 16 ], [ 16, 12 ], [ 18, 14 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "James knows Allen. Houston knows Garrett. James knows Brett. Robert knows Della. Wendy knows Houston. Gemma knows Phoebe. Houston knows Francesca. Darnell knows Spencer. Spencer knows Gemma. Gemma knows Quinn. Robert knows Martin. Darnell knows Claude. Robert knows James. Quinn knows Morgan. Gemma knows Jerry. Garrett knows Robert. Amelia knows Darnell. Quinn knows Jeremiah. Which of Quinn and James can Amelia reach?", "answer": "Quinn", "steps": [ "Amelia knows Darnell.", "Darnell knows Spencer.", "Spencer knows Gemma.", "Gemma knows Quinn." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Amelia", "Claude", "Phoebe", "Spencer", "Jerry", "Darnell", "Quinn", "Gemma", "Morgan", "Jeremiah", "Wendy", "Francesca", "Della", "Garrett", "Martin", "Houston", "James", "Robert", "Allen", "Brett" ], "edges": [ [ 0, 5 ], [ 3, 7 ], [ 5, 1 ], [ 5, 3 ], [ 6, 8 ], [ 6, 9 ], [ 7, 2 ], [ 7, 4 ], [ 7, 6 ], [ 10, 15 ], [ 13, 17 ], [ 15, 11 ], [ 15, 13 ], [ 16, 18 ], [ 16, 19 ], [ 17, 12 ], [ 17, 14 ], [ 17, 16 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Alfonso knows Florence. Ben knows Charlene. Dexter knows Ingrid. Garrett knows Hank. Florence knows Norman. Oliver knows Vance. Vance knows Victoria. Vance knows Dexter. George knows Deirdre. Jake knows Garrett. George knows Ivy. Garrett knows Cole. Ivy knows Ben. Jake knows Fisher. Eva knows Jake. Dexter knows George. Cole knows Gordon. Cole knows Alfonso. Which of Norman and Charlene can Eva reach?", "answer": "Norman", "steps": [ "Eva knows Jake.", "Jake knows Garrett.", "Garrett knows Cole.", "Cole knows Alfonso.", "Alfonso knows Florence.", "Florence knows Norman." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Eva", "Cole", "Gordon", "Alfonso", "Norman", "Fisher", "Florence", "Jake", "Hank", "Garrett", "Oliver", "George", "Deirdre", "Ivy", "Charlene", "Victoria", "Ben", "Vance", "Ingrid", "Dexter" ], "edges": [ [ 0, 7 ], [ 1, 2 ], [ 1, 3 ], [ 3, 6 ], [ 6, 4 ], [ 7, 5 ], [ 7, 9 ], [ 9, 1 ], [ 9, 8 ], [ 10, 17 ], [ 11, 12 ], [ 11, 13 ], [ 13, 16 ], [ 16, 14 ], [ 17, 15 ], [ 17, 19 ], [ 19, 11 ], [ 19, 18 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Wade knows Preston. Lee knows Allan. Lee knows Fabian. Kent knows Ida. Preston knows Clement. Jacques knows Kim. Fabian knows Tessa. Ben knows Billy. Nell knows Jacques. Ida knows Alfonso. Jacques knows Wade. Nell knows Ben. Allan knows Darcy. Ursula knows Kent. Billy knows Gail. Ursula knows Lee. Tessa knows Chance. Kim knows Bernadette. Which of Lee and Jacques can Ursula reach?", "answer": "Lee", "steps": [ "Ursula knows Lee." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Ursula", "Ida", "Fabian", "Chance", "Kent", "Lee", "Alfonso", "Tessa", "Darcy", "Allan", "Nell", "Billy", "Wade", "Clement", "Ben", "Jacques", "Gail", "Preston", "Bernadette", "Kim" ], "edges": [ [ 0, 4 ], [ 0, 5 ], [ 1, 6 ], [ 2, 7 ], [ 4, 1 ], [ 5, 2 ], [ 5, 9 ], [ 7, 3 ], [ 9, 8 ], [ 10, 14 ], [ 10, 15 ], [ 11, 16 ], [ 12, 17 ], [ 14, 11 ], [ 15, 12 ], [ 15, 19 ], [ 17, 13 ], [ 19, 18 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Hayden knows Louisa. Louisa knows Kelsey. Milton knows Bart. Peter knows Seth. Layla knows Keaton. Lottie knows Kerry. Amber knows Milton. Jesse knows Sally. Layla knows Joshua. Esperanza knows Darla. Lottie knows Robin. Sally knows Estella. Luella knows Jesse. Darla knows Layla. Seth knows Esperanza. Bart knows Lottie. Estella knows Amber. Kelsey knows Peter. Which of Sally and Kelsey can Hayden reach?", "answer": "Kelsey", "steps": [ "Hayden knows Louisa.", "Louisa knows Kelsey." ], "difficulty": 2, "original_distance": 8, "idx_to_symbol": [ "Hayden", "Esperanza", "Louisa", "Peter", "Kelsey", "Joshua", "Keaton", "Darla", "Layla", "Seth", "Luella", "Milton", "Jesse", "Estella", "Sally", "Robin", "Kerry", "Bart", "Lottie", "Amber" ], "edges": [ [ 0, 2 ], [ 1, 7 ], [ 2, 4 ], [ 3, 9 ], [ 4, 3 ], [ 7, 8 ], [ 8, 5 ], [ 8, 6 ], [ 9, 1 ], [ 10, 12 ], [ 11, 17 ], [ 12, 14 ], [ 13, 19 ], [ 14, 13 ], [ 17, 18 ], [ 18, 15 ], [ 18, 16 ], [ 19, 11 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Hank knows Reed. Elmer knows Mindy. Zachary knows Langston. Blaine knows Finn. Finn knows Geoffrey. Xander knows Elmer. Reed knows Davis. Mindy knows Miriam. Davis knows Fanny. Xander knows Allen. Geoffrey knows Dolores. Zachary knows Val. Glen knows Essie. Celia knows Zachary. Carmen knows Xander. Dolores knows Carmen. Val knows Glen. Fanny knows Celia. Which of Glen and Mindy can Blaine reach?", "answer": "Mindy", "steps": [ "Blaine knows Finn.", "Finn knows Geoffrey.", "Geoffrey knows Dolores.", "Dolores knows Carmen.", "Carmen knows Xander.", "Xander knows Elmer.", "Elmer knows Mindy." ], "difficulty": 7, "original_distance": 8, "idx_to_symbol": [ "Blaine", "Geoffrey", "Carmen", "Dolores", "Allen", "Miriam", "Elmer", "Xander", "Finn", "Mindy", "Hank", "Davis", "Celia", "Fanny", "Langston", "Essie", "Val", "Zachary", "Reed", "Glen" ], "edges": [ [ 0, 8 ], [ 1, 3 ], [ 2, 7 ], [ 3, 2 ], [ 6, 9 ], [ 7, 4 ], [ 7, 6 ], [ 8, 1 ], [ 9, 5 ], [ 10, 18 ], [ 11, 13 ], [ 12, 17 ], [ 13, 12 ], [ 16, 19 ], [ 17, 14 ], [ 17, 16 ], [ 18, 11 ], [ 19, 15 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Nicole knows Daniel. Franklin knows Lewis. Lewis knows Adam. Grady knows Willard. Laura knows Bennett. Willard knows Henry. Jacques knows Trevor. Adam knows Laura. Henry knows Ramona. Archer knows Karina. Laura knows Vernon. Cruz knows Nicole. Vernon knows Archer. Franklin knows Ingrid. Henry knows Jacques. Nicole knows Grady. Ethan knows Franklin. Trevor knows Dana. Which of Grady and Lewis can Cruz reach?", "answer": "Grady", "steps": [ "Cruz knows Nicole.", "Nicole knows Grady." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Cruz", "Dana", "Daniel", "Henry", "Trevor", "Ramona", "Grady", "Willard", "Nicole", "Jacques", "Ethan", "Karina", "Ingrid", "Laura", "Archer", "Bennett", "Lewis", "Adam", "Franklin", "Vernon" ], "edges": [ [ 0, 8 ], [ 3, 5 ], [ 3, 9 ], [ 4, 1 ], [ 6, 7 ], [ 7, 3 ], [ 8, 2 ], [ 8, 6 ], [ 9, 4 ], [ 10, 18 ], [ 13, 15 ], [ 13, 19 ], [ 14, 11 ], [ 16, 17 ], [ 17, 13 ], [ 18, 12 ], [ 18, 16 ], [ 19, 14 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Basil knows Trina. Gregory knows Maria. Janelle knows Zach. Zach knows Penny. Selena knows Elvis. Cora knows Daria. Hattie knows Janelle. Kimberly knows Kane. Cora knows Kareem. Alvin knows Hattie. Trina knows Kimberly. Penny knows Gregory. Kimberly knows Coral. Aldo knows Donald. Elvis knows Lambert. Hattie knows Cora. Lambert knows Aldo. Trina knows Selena. Which of Aldo and Gregory can Alvin reach?", "answer": "Gregory", "steps": [ "Alvin knows Hattie.", "Hattie knows Janelle.", "Janelle knows Zach.", "Zach knows Penny.", "Penny knows Gregory." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Alvin", "Daria", "Cora", "Hattie", "Zach", "Maria", "Kareem", "Janelle", "Gregory", "Penny", "Basil", "Kane", "Kimberly", "Trina", "Elvis", "Donald", "Coral", "Selena", "Aldo", "Lambert" ], "edges": [ [ 0, 3 ], [ 2, 1 ], [ 2, 6 ], [ 3, 2 ], [ 3, 7 ], [ 4, 9 ], [ 7, 4 ], [ 8, 5 ], [ 9, 8 ], [ 10, 13 ], [ 12, 11 ], [ 12, 16 ], [ 13, 12 ], [ 13, 17 ], [ 14, 19 ], [ 17, 14 ], [ 18, 15 ], [ 19, 18 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Luther knows Jim. Jessie knows Julius. Norma knows Clay. Jasper knows Mae. Jim knows Virginia. Zoe knows Evan. Dakota knows Zach. Clay knows Fisher. Julius knows Dexter. Dakota knows Zoe. Mae knows Dakota. Virginia knows Brooke. Fisher knows Garland. Brooke knows Jessie. Daisy knows Luther. Rowan knows Daisy. Luther knows Hope. Evan knows Norma. Which of Dexter and Garland can Rowan reach?", "answer": "Dexter", "steps": [ "Rowan knows Daisy.", "Daisy knows Luther.", "Luther knows Jim.", "Jim knows Virginia.", "Virginia knows Brooke.", "Brooke knows Jessie.", "Jessie knows Julius.", "Julius knows Dexter." ], "difficulty": 8, "original_distance": 8, "idx_to_symbol": [ "Rowan", "Jessie", "Julius", "Brooke", "Jim", "Dexter", "Luther", "Virginia", "Daisy", "Hope", "Jasper", "Clay", "Fisher", "Norma", "Zoe", "Garland", "Dakota", "Evan", "Mae", "Zach" ], "edges": [ [ 0, 8 ], [ 1, 2 ], [ 2, 5 ], [ 3, 1 ], [ 4, 7 ], [ 6, 4 ], [ 6, 9 ], [ 7, 3 ], [ 8, 6 ], [ 10, 18 ], [ 11, 12 ], [ 12, 15 ], [ 13, 11 ], [ 14, 17 ], [ 16, 14 ], [ 16, 19 ], [ 17, 13 ], [ 18, 16 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Carmela knows Shaun. Bob knows Abigail. Jaime knows Milton. Zane knows Evan. Carey knows Zane. Abigail knows Alfonso. Carmela knows Daniella. Abigail knows Jaime. Fabian knows Cain. Alfonso knows Maggie. Maggie knows Jakob. Ben knows Etta. Jaime knows Ben. Fabian knows Carey. Carey knows Dora. Kira knows Fabian. Cain knows Carmela. Maggie knows Perry. Which of Fabian and Abigail can Kira reach?", "answer": "Fabian", "steps": [ "Kira knows Fabian." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Kira", "Fabian", "Zane", "Carey", "Cain", "Shaun", "Carmela", "Dora", "Evan", "Daniella", "Bob", "Abigail", "Ben", "Jaime", "Alfonso", "Jakob", "Maggie", "Milton", "Etta", "Perry" ], "edges": [ [ 0, 1 ], [ 1, 3 ], [ 1, 4 ], [ 2, 8 ], [ 3, 7 ], [ 3, 2 ], [ 4, 6 ], [ 6, 5 ], [ 6, 9 ], [ 10, 11 ], [ 11, 13 ], [ 11, 14 ], [ 12, 18 ], [ 13, 17 ], [ 13, 12 ], [ 14, 16 ], [ 16, 15 ], [ 16, 19 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Carol knows Hector. Dustin knows Kirsten. Regina knows Holly. Hadley knows Fisher. Holly knows Darrell. Darrell knows Hendrix. Russell knows Simon. Kirsten knows Morris. Regina knows Hailey. Hailey knows Hadley. Jocelyn knows Russell. Dana knows Julia. Kirsten knows Layla. Hendrix knows Dana. Morris knows Melanie. Dustin knows Jocelyn. Holly knows Diego. Melanie knows Carol. Which of Morris and Darrell can Dustin reach?", "answer": "Morris", "steps": [ "Dustin knows Kirsten.", "Kirsten knows Morris." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Dustin", "Layla", "Melanie", "Simon", "Carol", "Kirsten", "Russell", "Morris", "Jocelyn", "Hector", "Regina", "Diego", "Hendrix", "Fisher", "Dana", "Holly", "Hadley", "Darrell", "Hailey", "Julia" ], "edges": [ [ 0, 8 ], [ 0, 5 ], [ 2, 4 ], [ 4, 9 ], [ 5, 1 ], [ 5, 7 ], [ 6, 3 ], [ 7, 2 ], [ 8, 6 ], [ 10, 18 ], [ 10, 15 ], [ 12, 14 ], [ 14, 19 ], [ 15, 11 ], [ 15, 17 ], [ 16, 13 ], [ 17, 12 ], [ 18, 16 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Shannon knows Della. Faith knows Dallas. Lola knows Faith. Faith knows Margaret. Jay knows Carson. Shannon knows Latoya. Shannon knows Andrew. Rose knows Shannon. Margaret knows Jay. Reid knows Karina. Demetrius knows Reid. Shannon knows Tina. Faith knows Christopher. Myra knows Virginia. Dawn knows Cooper. Della knows Dawn. Latoya knows Myra. Faith knows Demetrius. Which of Demetrius and Della can Lola reach?", "answer": "Demetrius", "steps": [ "Lola knows Faith.", "Faith knows Demetrius." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Lola", "Faith", "Margaret", "Reid", "Dallas", "Karina", "Demetrius", "Christopher", "Carson", "Jay", "Rose", "Shannon", "Latoya", "Dawn", "Andrew", "Cooper", "Della", "Tina", "Virginia", "Myra" ], "edges": [ [ 0, 1 ], [ 1, 4 ], [ 1, 6 ], [ 1, 7 ], [ 1, 2 ], [ 2, 9 ], [ 3, 5 ], [ 6, 3 ], [ 9, 8 ], [ 10, 11 ], [ 11, 14 ], [ 11, 16 ], [ 11, 17 ], [ 11, 12 ], [ 12, 19 ], [ 13, 15 ], [ 16, 13 ], [ 19, 18 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Carol knows Hector. Dustin knows Kirsten. Regina knows Holly. Hadley knows Fisher. Holly knows Darrell. Darrell knows Hendrix. Russell knows Simon. Kirsten knows Morris. Regina knows Hailey. Hailey knows Hadley. Jocelyn knows Russell. Dana knows Julia. Kirsten knows Layla. Hendrix knows Dana. Morris knows Melanie. Dustin knows Jocelyn. Holly knows Diego. Melanie knows Carol. Which of Holly and Kirsten can Dustin reach?", "answer": "Kirsten", "steps": [ "Dustin knows Kirsten." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Dustin", "Layla", "Melanie", "Simon", "Carol", "Kirsten", "Russell", "Morris", "Jocelyn", "Hector", "Regina", "Diego", "Hendrix", "Fisher", "Dana", "Holly", "Hadley", "Darrell", "Hailey", "Julia" ], "edges": [ [ 0, 8 ], [ 0, 5 ], [ 2, 4 ], [ 4, 9 ], [ 5, 1 ], [ 5, 7 ], [ 6, 3 ], [ 7, 2 ], [ 8, 6 ], [ 10, 18 ], [ 10, 15 ], [ 12, 14 ], [ 14, 19 ], [ 15, 11 ], [ 15, 17 ], [ 16, 13 ], [ 17, 12 ], [ 18, 16 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Lionel knows Miranda. Lionel knows Ivan. Brent knows Clifford. Kristina knows Skyler. Daphna knows Brent. Miranda knows Elmer. Denver knows Dolly. Homer knows Dixie. Denver knows India. Lionel knows Bella. Allan knows Loretta. Allan knows Homer. Dolly knows Daphna. Allan knows Denver. Miranda knows Bette. Bette knows Fern. Fern knows Kristina. Bella knows Violet. Which of Miranda and Denver can Allan reach?", "answer": "Denver", "steps": [ "Allan knows Denver." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Allan", "Daphna", "Dolly", "Brent", "Clifford", "Denver", "Dixie", "Homer", "Loretta", "India", "Lionel", "Fern", "Bette", "Kristina", "Skyler", "Miranda", "Violet", "Bella", "Ivan", "Elmer" ], "edges": [ [ 0, 7 ], [ 0, 8 ], [ 0, 5 ], [ 1, 3 ], [ 2, 1 ], [ 3, 4 ], [ 5, 2 ], [ 5, 9 ], [ 7, 6 ], [ 10, 17 ], [ 10, 18 ], [ 10, 15 ], [ 11, 13 ], [ 12, 11 ], [ 13, 14 ], [ 15, 12 ], [ 15, 19 ], [ 17, 16 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Reid knows Ursula. Doug knows Ivy. Jolena knows Morgan. Freya knows Elliot. Jolena knows Gabe. Lola knows Finn. Lola knows Freya. Darrell knows Jolena. Ivy knows Lola. Andrew knows Hank. Morgan knows Ford. Doug knows Reid. Ivy knows Lawrence. Ford knows Jeremy. Chantal knows Esme. Morgan knows Chantal. Finn knows Dorian. Darrell knows Andrew. Which of Lola and Morgan can Doug reach?", "answer": "Lola", "steps": [ "Doug knows Ivy.", "Ivy knows Lola." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Doug", "Dorian", "Reid", "Ivy", "Elliot", "Freya", "Lola", "Lawrence", "Ursula", "Finn", "Darrell", "Jeremy", "Andrew", "Jolena", "Esme", "Chantal", "Morgan", "Gabe", "Hank", "Ford" ], "edges": [ [ 0, 2 ], [ 0, 3 ], [ 2, 8 ], [ 3, 7 ], [ 3, 6 ], [ 5, 4 ], [ 6, 5 ], [ 6, 9 ], [ 9, 1 ], [ 10, 12 ], [ 10, 13 ], [ 12, 18 ], [ 13, 17 ], [ 13, 16 ], [ 15, 14 ], [ 16, 15 ], [ 16, 19 ], [ 19, 11 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Fred knows Chase. Karla knows Peggy. Kobe knows Hayes. Luke knows Karla. Dylan knows Patrick. Dylan knows Melody. Clay knows Dylan. Melody knows Ernest. Elijah knows Christopher. Dylan knows Kobe. Kobe knows Luke. Ernesto knows Ashley. Elijah knows Fred. Alder knows Pete. Irma knows Ernesto. Elijah knows Alder. Andrea knows Elijah. Fred knows Irma. Which of Irma and Luke can Andrea reach?", "answer": "Irma", "steps": [ "Andrea knows Elijah.", "Elijah knows Fred.", "Fred knows Irma." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Andrea", "Fred", "Ernesto", "Irma", "Chase", "Elijah", "Christopher", "Alder", "Pete", "Ashley", "Clay", "Kobe", "Karla", "Luke", "Hayes", "Dylan", "Patrick", "Melody", "Ernest", "Peggy" ], "edges": [ [ 0, 5 ], [ 1, 4 ], [ 1, 3 ], [ 2, 9 ], [ 3, 2 ], [ 5, 6 ], [ 5, 7 ], [ 5, 1 ], [ 7, 8 ], [ 10, 15 ], [ 11, 14 ], [ 11, 13 ], [ 12, 19 ], [ 13, 12 ], [ 15, 16 ], [ 15, 17 ], [ 15, 11 ], [ 17, 18 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Chase knows Eve. Gloria knows Fern. Elodie knows Loretta. Clifford knows Holden. Elodie knows Clifford. Jasper knows Eduardo. Lynn knows Alice. Holden knows Owen. Eduardo knows Rufus. Eve knows Elodie. Rufus knows Gloria. Dave knows Lynn. Chase knows Jacques. Rufus knows Vance. Kurt knows Chase. Lynn knows Jasper. Eduardo knows Heath. Clifford knows Kareem. Which of Chase and Lynn can Kurt reach?", "answer": "Chase", "steps": [ "Kurt knows Chase." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Kurt", "Chase", "Clifford", "Jacques", "Elodie", "Owen", "Holden", "Kareem", "Eve", "Loretta", "Dave", "Lynn", "Rufus", "Alice", "Eduardo", "Fern", "Gloria", "Vance", "Jasper", "Heath" ], "edges": [ [ 0, 1 ], [ 1, 3 ], [ 1, 8 ], [ 2, 6 ], [ 2, 7 ], [ 4, 2 ], [ 4, 9 ], [ 6, 5 ], [ 8, 4 ], [ 10, 11 ], [ 11, 13 ], [ 11, 18 ], [ 12, 16 ], [ 12, 17 ], [ 14, 12 ], [ 14, 19 ], [ 16, 15 ], [ 18, 14 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Cassidy knows Benjamin. Frank knows Cindy. Yasmin knows Pearl. Boyd knows Colby. Cordelia knows Jewel. Pearl knows Jake. Boyd knows Lola. Lola knows Glen. Roy knows Darla. Davis knows Frank. Gerald knows Cordelia. Benjamin knows Boyd. Darla knows Gerald. Benjamin knows Davis. Gerald knows Yasmin. Jewel knows Fred. Cordelia knows Kai. Desmond knows Cassidy. Which of Cassidy and Darla can Desmond reach?", "answer": "Cassidy", "steps": [ "Desmond knows Cassidy." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Desmond", "Lola", "Colby", "Benjamin", "Glen", "Frank", "Cassidy", "Davis", "Cindy", "Boyd", "Roy", "Jewel", "Kai", "Gerald", "Fred", "Pearl", "Darla", "Yasmin", "Jake", "Cordelia" ], "edges": [ [ 0, 6 ], [ 1, 4 ], [ 3, 7 ], [ 3, 9 ], [ 5, 8 ], [ 6, 3 ], [ 7, 5 ], [ 9, 2 ], [ 9, 1 ], [ 10, 16 ], [ 11, 14 ], [ 13, 17 ], [ 13, 19 ], [ 15, 18 ], [ 16, 13 ], [ 17, 15 ], [ 19, 12 ], [ 19, 11 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Jade knows Oscar. Abby knows Clifford. Jade knows Isaac. Jenny knows Monica. Jenny knows Dewey. Homer knows Ernesto. Conner knows Abby. Dewey knows Homer. Abby knows Valerie. Sue knows Conner. Isaac knows Jenny. Clifford knows Kimberly. Essie knows Jonathan. Dewey knows Donald. Clifford knows Essie. Monica knows Rex. Sue knows Yara. Valerie knows Maureen. Which of Conner and Isaac can Jade reach?", "answer": "Isaac", "steps": [ "Jade knows Isaac." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Jade", "Jenny", "Donald", "Isaac", "Homer", "Monica", "Dewey", "Oscar", "Rex", "Ernesto", "Sue", "Abby", "Kimberly", "Conner", "Essie", "Valerie", "Clifford", "Yara", "Maureen", "Jonathan" ], "edges": [ [ 0, 7 ], [ 0, 3 ], [ 1, 5 ], [ 1, 6 ], [ 3, 1 ], [ 4, 9 ], [ 5, 8 ], [ 6, 2 ], [ 6, 4 ], [ 10, 17 ], [ 10, 13 ], [ 11, 15 ], [ 11, 16 ], [ 13, 11 ], [ 14, 19 ], [ 15, 18 ], [ 16, 12 ], [ 16, 14 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Cecilia knows Miriam. Leopold knows Violet. Elvis knows Ariana. Cecilia knows Wendell. Violet knows Katherine. Marie knows Luz. Destiny knows Kristina. Miriam knows Destiny. Yvette knows Kieran. Kieran knows Alder. Katherine knows Dirk. Elvis knows Loretta. Yvette knows Elvis. Marie knows Yasmin. Isabel knows Marie. Isabel knows Cecilia. Kieran knows Leopold. Kristina knows Katrina. Which of Kristina and Katherine can Yvette reach?", "answer": "Katherine", "steps": [ "Yvette knows Kieran.", "Kieran knows Leopold.", "Leopold knows Violet.", "Violet knows Katherine." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Yvette", "Violet", "Alder", "Kieran", "Loretta", "Ariana", "Katherine", "Leopold", "Dirk", "Elvis", "Isabel", "Destiny", "Wendell", "Cecilia", "Yasmin", "Luz", "Kristina", "Miriam", "Katrina", "Marie" ], "edges": [ [ 0, 3 ], [ 0, 9 ], [ 1, 6 ], [ 3, 2 ], [ 3, 7 ], [ 6, 8 ], [ 7, 1 ], [ 9, 4 ], [ 9, 5 ], [ 10, 13 ], [ 10, 19 ], [ 11, 16 ], [ 13, 12 ], [ 13, 17 ], [ 16, 18 ], [ 17, 11 ], [ 19, 14 ], [ 19, 15 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Flora knows Lucia. Russell knows Owen. Neal knows Desmond. Zara knows Bonnie. Bonnie knows Dana. Maria knows Flora. Livia knows Katrina. Martin knows Maria. Knox knows Charles. Owen knows Livia. Bonnie knows Allan. Livia knows Peggy. Katrina knows Neal. Knox knows Zara. Desmond knows Will. Dana knows Martin. Russell knows Chelsea. Will knows Colin. Which of Will and Flora can Knox reach?", "answer": "Flora", "steps": [ "Knox knows Zara.", "Zara knows Bonnie.", "Bonnie knows Dana.", "Dana knows Martin.", "Martin knows Maria.", "Maria knows Flora." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Knox", "Flora", "Allan", "Dana", "Bonnie", "Zara", "Maria", "Lucia", "Charles", "Martin", "Russell", "Will", "Peggy", "Katrina", "Livia", "Owen", "Desmond", "Colin", "Chelsea", "Neal" ], "edges": [ [ 0, 8 ], [ 0, 5 ], [ 1, 7 ], [ 3, 9 ], [ 4, 2 ], [ 4, 3 ], [ 5, 4 ], [ 6, 1 ], [ 9, 6 ], [ 10, 18 ], [ 10, 15 ], [ 11, 17 ], [ 13, 19 ], [ 14, 12 ], [ 14, 13 ], [ 15, 14 ], [ 16, 11 ], [ 19, 16 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Opal knows Bart. Duncan knows June. Dina knows Linda. Bart knows Samantha. Linda knows Ava. Gloria knows Stacy. Cecilia knows Natalie. Tristan knows Jacqueline. Duncan knows Lana. Stephen knows Opal. Stephen knows Gina. June knows Sharon. Opal knows Cecilia. Ava knows Garrison. Bart knows Gloria. Dina knows Duncan. Natalie knows Colby. Tristan knows Dina. Which of June and Gloria can Stephen reach?", "answer": "Gloria", "steps": [ "Stephen knows Opal.", "Opal knows Bart.", "Bart knows Gloria." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Stephen", "Colby", "Gloria", "Natalie", "Opal", "Bart", "Stacy", "Cecilia", "Gina", "Samantha", "Tristan", "Garrison", "June", "Ava", "Dina", "Duncan", "Sharon", "Linda", "Jacqueline", "Lana" ], "edges": [ [ 0, 8 ], [ 0, 4 ], [ 2, 6 ], [ 3, 1 ], [ 4, 7 ], [ 4, 5 ], [ 5, 2 ], [ 5, 9 ], [ 7, 3 ], [ 10, 18 ], [ 10, 14 ], [ 12, 16 ], [ 13, 11 ], [ 14, 17 ], [ 14, 15 ], [ 15, 12 ], [ 15, 19 ], [ 17, 13 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Ilene knows Crystal. Charlene knows Darnell. Jackson knows Lucille. Fred knows Fraser. Nathan knows Joaquin. Dominic knows Dirk. Fraser knows Milton. Coral knows Nathan. Fred knows Ilene. Harrison knows Vera. Ilene knows Charlene. Jackson knows Mildred. Milton knows Dominic. Harrison knows Estella. Harrison knows Jackson. Lucille knows Justine. Fred knows Elizabeth. Estella knows Coral. Which of Estella and Fraser can Fred reach?", "answer": "Fraser", "steps": [ "Fred knows Fraser." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Fred", "Dirk", "Darnell", "Charlene", "Crystal", "Ilene", "Elizabeth", "Fraser", "Dominic", "Milton", "Harrison", "Joaquin", "Justine", "Lucille", "Mildred", "Jackson", "Vera", "Estella", "Nathan", "Coral" ], "edges": [ [ 0, 5 ], [ 0, 6 ], [ 0, 7 ], [ 3, 2 ], [ 5, 3 ], [ 5, 4 ], [ 7, 9 ], [ 8, 1 ], [ 9, 8 ], [ 10, 15 ], [ 10, 16 ], [ 10, 17 ], [ 13, 12 ], [ 15, 13 ], [ 15, 14 ], [ 17, 19 ], [ 18, 11 ], [ 19, 18 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Terry knows Blake. Haven knows Penny. Jolene knows Ira. Jolene knows Edison. Fritz knows Terry. Brittany knows Fritz. Bruce knows Kaleb. Haven knows Shannon. Hunter knows Brittany. Riley knows Terrence. Penny knows Livia. Blake knows Jolene. Marie knows Haven. Edison knows Elvira. Hunter knows Hannah. Terrence knows Isla. Isla knows Marie. Bruce knows Riley. Which of Penny and Edison can Hunter reach?", "answer": "Edison", "steps": [ "Hunter knows Brittany.", "Brittany knows Fritz.", "Fritz knows Terry.", "Terry knows Blake.", "Blake knows Jolene.", "Jolene knows Edison." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Hunter", "Hannah", "Brittany", "Fritz", "Jolene", "Edison", "Terry", "Blake", "Elvira", "Ira", "Bruce", "Kaleb", "Riley", "Terrence", "Haven", "Penny", "Isla", "Marie", "Livia", "Shannon" ], "edges": [ [ 0, 1 ], [ 0, 2 ], [ 2, 3 ], [ 3, 6 ], [ 4, 5 ], [ 4, 9 ], [ 5, 8 ], [ 6, 7 ], [ 7, 4 ], [ 10, 11 ], [ 10, 12 ], [ 12, 13 ], [ 13, 16 ], [ 14, 15 ], [ 14, 19 ], [ 15, 18 ], [ 16, 17 ], [ 17, 14 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Leander knows Henry. Arthur knows India. Joseph knows Delilah. Lewis knows Daniel. Martin knows Leander. Alison knows Arthur. Kendra knows Joseph. Leander knows Susan. Lewis knows Gerard. Christian knows Kieran. Delilah knows Heath. Boyd knows Christian. Arthur knows Lewis. Susan knows Fabian. Daniel knows Boyd. Joseph knows Chloe. Boyd knows Walt. Susan knows Kendra. Which of Boyd and Joseph can Alison reach?", "answer": "Boyd", "steps": [ "Alison knows Arthur.", "Arthur knows Lewis.", "Lewis knows Daniel.", "Daniel knows Boyd." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Alison", "India", "Gerard", "Arthur", "Daniel", "Kieran", "Lewis", "Christian", "Walt", "Boyd", "Martin", "Henry", "Fabian", "Leander", "Kendra", "Heath", "Susan", "Delilah", "Chloe", "Joseph" ], "edges": [ [ 0, 3 ], [ 3, 1 ], [ 3, 6 ], [ 4, 9 ], [ 6, 2 ], [ 6, 4 ], [ 7, 5 ], [ 9, 7 ], [ 9, 8 ], [ 10, 13 ], [ 13, 11 ], [ 13, 16 ], [ 14, 19 ], [ 16, 12 ], [ 16, 14 ], [ 17, 15 ], [ 19, 17 ], [ 19, 18 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Laura knows Howard. Maggie knows Shannon. Bridget knows Bonnie. Hattie knows Jay. Calvin knows Laura. Paige knows Betty. Calvin knows Greta. Hattie knows Chelsea. Luna knows Erin. Howard knows Destiny. Julie knows Hattie. Zachary knows Julie. Erin knows Dylan. Jay knows Bridget. Ben knows Zachary. Jay knows Paige. Dylan knows Calvin. Laura knows Maggie. Which of Laura and Jay can Luna reach?", "answer": "Laura", "steps": [ "Luna knows Erin.", "Erin knows Dylan.", "Dylan knows Calvin.", "Calvin knows Laura." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Luna", "Greta", "Laura", "Shannon", "Dylan", "Calvin", "Destiny", "Erin", "Maggie", "Howard", "Ben", "Chelsea", "Jay", "Betty", "Julie", "Hattie", "Bonnie", "Zachary", "Paige", "Bridget" ], "edges": [ [ 0, 7 ], [ 2, 8 ], [ 2, 9 ], [ 4, 5 ], [ 5, 1 ], [ 5, 2 ], [ 7, 4 ], [ 8, 3 ], [ 9, 6 ], [ 10, 17 ], [ 12, 18 ], [ 12, 19 ], [ 14, 15 ], [ 15, 11 ], [ 15, 12 ], [ 17, 14 ], [ 18, 13 ], [ 19, 16 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Naomi knows Joyce. Dennis knows Rocco. Joyce knows Andre. Paul knows Eldon. Candice knows Milo. Sadie knows Fleur. Desmond knows Chester. Joyce knows Kent. Sadie knows Desmond. Clark knows Dennis. Rocco knows Sadie. Milo knows Naomi. Fleur knows Diego. Sadie knows Lionel. Lionel knows Yasmin. Kent knows Darren. Joyce knows Paul. Andre knows Holly. Which of Kent and Lionel can Candice reach?", "answer": "Kent", "steps": [ "Candice knows Milo.", "Milo knows Naomi.", "Naomi knows Joyce.", "Joyce knows Kent." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Candice", "Naomi", "Darren", "Joyce", "Milo", "Kent", "Andre", "Eldon", "Holly", "Paul", "Clark", "Rocco", "Yasmin", "Sadie", "Dennis", "Lionel", "Desmond", "Diego", "Chester", "Fleur" ], "edges": [ [ 0, 4 ], [ 1, 3 ], [ 3, 5 ], [ 3, 6 ], [ 3, 9 ], [ 4, 1 ], [ 5, 2 ], [ 6, 8 ], [ 9, 7 ], [ 10, 14 ], [ 11, 13 ], [ 13, 15 ], [ 13, 16 ], [ 13, 19 ], [ 14, 11 ], [ 15, 12 ], [ 16, 18 ], [ 19, 17 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Kate knows Archer. Zoe knows Eva. Joel knows Annie. Yara knows Iris. Imogen knows Katrina. Archer knows Penny. Joyce knows Della. Joel knows Yara. Joyce knows Alejandro. Della knows Mary. Katrina knows Ada. Holden knows Imogen. Holly knows Ernie. Eva knows Joyce. Imogen knows Holly. Knox knows Kate. Kate knows Zoe. Ada knows Joel. Which of Ada and Eva can Holden reach?", "answer": "Ada", "steps": [ "Holden knows Imogen.", "Imogen knows Katrina.", "Katrina knows Ada." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Holden", "Annie", "Ada", "Ernie", "Iris", "Imogen", "Yara", "Joel", "Holly", "Katrina", "Knox", "Alejandro", "Eva", "Penny", "Mary", "Kate", "Della", "Joyce", "Archer", "Zoe" ], "edges": [ [ 0, 5 ], [ 2, 7 ], [ 5, 8 ], [ 5, 9 ], [ 6, 4 ], [ 7, 1 ], [ 7, 6 ], [ 8, 3 ], [ 9, 2 ], [ 10, 15 ], [ 12, 17 ], [ 15, 18 ], [ 15, 19 ], [ 16, 14 ], [ 17, 11 ], [ 17, 16 ], [ 18, 13 ], [ 19, 12 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Jarvis knows Marshall. Brandon knows Lambert. Charlene knows Kirk. Owen knows Amelia. Edison knows Derek. Charlene knows William. Jackson knows Owen. Jarvis knows Eli. Marshall knows Preston. Finn knows Ella. Virginia knows Edison. Finn knows Virginia. Finn knows Carrie. William knows Jarvis. Carrie knows Brandon. Edison knows Doug. Charlene knows Jackson. Doug knows Kathleen. Which of William and Virginia can Finn reach?", "answer": "Virginia", "steps": [ "Finn knows Virginia." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Finn", "Derek", "Virginia", "Brandon", "Kathleen", "Carrie", "Lambert", "Ella", "Doug", "Edison", "Charlene", "Eli", "William", "Owen", "Preston", "Jackson", "Amelia", "Kirk", "Marshall", "Jarvis" ], "edges": [ [ 0, 5 ], [ 0, 7 ], [ 0, 2 ], [ 2, 9 ], [ 3, 6 ], [ 5, 3 ], [ 8, 4 ], [ 9, 1 ], [ 9, 8 ], [ 10, 15 ], [ 10, 17 ], [ 10, 12 ], [ 12, 19 ], [ 13, 16 ], [ 15, 13 ], [ 18, 14 ], [ 19, 11 ], [ 19, 18 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Maggie knows Darrell. Willis knows India. Clara knows Joseph. Cassidy knows Clara. India knows Cassidy. Joseph knows Juan. Megan knows Mabel. Mabel knows Carrie. Megan knows Marshall. Joseph knows Alvin. Theodore knows Megan. Theodore knows Jules. Clarissa knows Theodore. Mabel knows Leroy. Cassidy knows Charlene. Clara knows Maggie. Marshall knows Dirk. Riley knows Clarissa. Which of India and Clarissa can Riley reach?", "answer": "Clarissa", "steps": [ "Riley knows Clarissa." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Riley", "Marshall", "Mabel", "Dirk", "Clarissa", "Leroy", "Jules", "Megan", "Carrie", "Theodore", "Willis", "Maggie", "Joseph", "Darrell", "India", "Juan", "Charlene", "Clara", "Alvin", "Cassidy" ], "edges": [ [ 0, 4 ], [ 1, 3 ], [ 2, 5 ], [ 2, 8 ], [ 4, 9 ], [ 7, 1 ], [ 7, 2 ], [ 9, 6 ], [ 9, 7 ], [ 10, 14 ], [ 11, 13 ], [ 12, 15 ], [ 12, 18 ], [ 14, 19 ], [ 17, 11 ], [ 17, 12 ], [ 19, 16 ], [ 19, 17 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Lola knows Tristan. Tristan knows Arthur. Hal knows Sandra. Eleanor knows Hal. Marcus knows Greg. Regina knows Marcus. Aisha knows Chloe. Greg knows Sally. Beth knows Eleanor. Arthur knows Aisha. Ben knows Grace. Sandra knows Peter. Tristan knows Brandon. Peter knows Ray. Grace knows Beth. Sally knows Lola. Ray knows Edwin. Sandra knows Leo. Which of Aisha and Ray can Ben reach?", "answer": "Ray", "steps": [ "Ben knows Grace.", "Grace knows Beth.", "Beth knows Eleanor.", "Eleanor knows Hal.", "Hal knows Sandra.", "Sandra knows Peter.", "Peter knows Ray." ], "difficulty": 7, "original_distance": 8, "idx_to_symbol": [ "Ben", "Peter", "Edwin", "Ray", "Sandra", "Hal", "Grace", "Eleanor", "Beth", "Leo", "Regina", "Arthur", "Chloe", "Aisha", "Tristan", "Lola", "Marcus", "Sally", "Greg", "Brandon" ], "edges": [ [ 0, 6 ], [ 1, 3 ], [ 3, 2 ], [ 4, 1 ], [ 4, 9 ], [ 5, 4 ], [ 6, 8 ], [ 7, 5 ], [ 8, 7 ], [ 10, 16 ], [ 11, 13 ], [ 13, 12 ], [ 14, 11 ], [ 14, 19 ], [ 15, 14 ], [ 16, 18 ], [ 17, 15 ], [ 18, 17 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Joyce knows Louis. Max knows Joyce. Yara knows Parker. Knox knows Sebastian. Susan knows Darius. Grady knows Yara. Jonathan knows Bridget. Yara knows Susan. Knox knows Jonathan. George knows Knox. Evelyn knows Max. Jeremiah knows Grover. Max knows Chandler. George knows Grady. Jeremiah knows Sadie. Alex knows Jeremiah. Evelyn knows Alex. Sadie knows Heidi. Which of Alex and Grady can George reach?", "answer": "Grady", "steps": [ "George knows Grady." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "George", "Darius", "Sebastian", "Knox", "Parker", "Yara", "Grady", "Bridget", "Susan", "Jonathan", "Evelyn", "Heidi", "Chandler", "Max", "Grover", "Jeremiah", "Alex", "Louis", "Sadie", "Joyce" ], "edges": [ [ 0, 6 ], [ 0, 3 ], [ 3, 2 ], [ 3, 9 ], [ 5, 4 ], [ 5, 8 ], [ 6, 5 ], [ 8, 1 ], [ 9, 7 ], [ 10, 16 ], [ 10, 13 ], [ 13, 12 ], [ 13, 19 ], [ 15, 14 ], [ 15, 18 ], [ 16, 15 ], [ 18, 11 ], [ 19, 17 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Basil knows Trina. Gregory knows Maria. Janelle knows Zach. Zach knows Penny. Selena knows Elvis. Cora knows Daria. Hattie knows Janelle. Kimberly knows Kane. Cora knows Kareem. Alvin knows Hattie. Trina knows Kimberly. Penny knows Gregory. Kimberly knows Coral. Aldo knows Donald. Elvis knows Lambert. Hattie knows Cora. Lambert knows Aldo. Trina knows Selena. Which of Elvis and Zach can Alvin reach?", "answer": "Zach", "steps": [ "Alvin knows Hattie.", "Hattie knows Janelle.", "Janelle knows Zach." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Alvin", "Daria", "Cora", "Hattie", "Zach", "Maria", "Kareem", "Janelle", "Gregory", "Penny", "Basil", "Kane", "Kimberly", "Trina", "Elvis", "Donald", "Coral", "Selena", "Aldo", "Lambert" ], "edges": [ [ 0, 3 ], [ 2, 1 ], [ 2, 6 ], [ 3, 2 ], [ 3, 7 ], [ 4, 9 ], [ 7, 4 ], [ 8, 5 ], [ 9, 8 ], [ 10, 13 ], [ 12, 11 ], [ 12, 16 ], [ 13, 12 ], [ 13, 17 ], [ 14, 19 ], [ 17, 14 ], [ 18, 15 ], [ 19, 18 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Barbara knows Holden. Miranda knows Drew. Peggy knows Gail. Barbara knows Peggy. Gwen knows Demetrius. Elsa knows Steve. Kathleen knows Barbara. Jude knows Kathleen. Riley knows Travis. Demetrius knows Riley. Andrew knows Tamara. Alejandro knows Andrew. Elsa knows Miranda. Tamara knows Elsa. Peggy knows Gwen. Hazel knows Hayes. Tamara knows Brody. Drew knows Hazel. Which of Tamara and Barbara can Alejandro reach?", "answer": "Tamara", "steps": [ "Alejandro knows Andrew.", "Andrew knows Tamara." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Alejandro", "Drew", "Tamara", "Hayes", "Andrew", "Brody", "Steve", "Elsa", "Miranda", "Hazel", "Jude", "Demetrius", "Barbara", "Travis", "Kathleen", "Holden", "Gail", "Peggy", "Gwen", "Riley" ], "edges": [ [ 0, 4 ], [ 1, 9 ], [ 2, 5 ], [ 2, 7 ], [ 4, 2 ], [ 7, 6 ], [ 7, 8 ], [ 8, 1 ], [ 9, 3 ], [ 10, 14 ], [ 11, 19 ], [ 12, 15 ], [ 12, 17 ], [ 14, 12 ], [ 17, 16 ], [ 17, 18 ], [ 18, 11 ], [ 19, 13 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Diane knows Julian. Chelsea knows Diane. Diane knows Guy. Sidney knows Ursula. Lyle knows Jordan. Julian knows Beatrice. Beatrice knows Elton. Elton knows Lawson. Sally knows Lyle. Guy knows Rena. Allen knows Oscar. Julian knows Eden. Eden knows Itzel. Holden knows Sam. Oscar knows Holden. Oscar knows Sidney. Holden knows Sally. Sam knows Hugh. Which of Jordan and Lawson can Chelsea reach?", "answer": "Lawson", "steps": [ "Chelsea knows Diane.", "Diane knows Julian.", "Julian knows Beatrice.", "Beatrice knows Elton.", "Elton knows Lawson." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Chelsea", "Eden", "Beatrice", "Itzel", "Julian", "Diane", "Elton", "Guy", "Rena", "Lawson", "Allen", "Sam", "Sally", "Hugh", "Holden", "Oscar", "Lyle", "Sidney", "Ursula", "Jordan" ], "edges": [ [ 0, 5 ], [ 1, 3 ], [ 2, 6 ], [ 4, 1 ], [ 4, 2 ], [ 5, 7 ], [ 5, 4 ], [ 6, 9 ], [ 7, 8 ], [ 10, 15 ], [ 11, 13 ], [ 12, 16 ], [ 14, 11 ], [ 14, 12 ], [ 15, 17 ], [ 15, 14 ], [ 16, 19 ], [ 17, 18 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Julie knows Ted. Terry knows Sharon. Terry knows Julius. Jamie knows Judy. Leah knows Charity. Felicia knows Terry. Gerald knows Barney. Ted knows Gerald. Jamie knows Bridget. Jamie knows James. Gerald knows Hendrix. Gerald knows Felicia. Harriet knows Leah. Leah knows Basil. Terry knows Ashton. Stefan knows Jamie. Leah knows Stefan. Keegan knows Harriet. Which of Terry and Jamie can Julie reach?", "answer": "Terry", "steps": [ "Julie knows Ted.", "Ted knows Gerald.", "Gerald knows Felicia.", "Felicia knows Terry." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Julie", "Barney", "Julius", "Terry", "Ashton", "Sharon", "Felicia", "Hendrix", "Gerald", "Ted", "Keegan", "Charity", "James", "Jamie", "Judy", "Bridget", "Stefan", "Basil", "Leah", "Harriet" ], "edges": [ [ 0, 9 ], [ 3, 2 ], [ 3, 4 ], [ 3, 5 ], [ 6, 3 ], [ 8, 1 ], [ 8, 6 ], [ 8, 7 ], [ 9, 8 ], [ 10, 19 ], [ 13, 12 ], [ 13, 14 ], [ 13, 15 ], [ 16, 13 ], [ 18, 11 ], [ 18, 16 ], [ 18, 17 ], [ 19, 18 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Jillian knows Martin. Esme knows Amy. Tina knows Hayes. Jodi knows Hubert. Hayes knows Anthony. Donald knows Jodi. Houston knows Cornelius. Tina knows Emery. Hubert knows Janelle. Donald knows Alejandro. Donald knows Ember. Ember knows Arturo. Cornelius knows Nina. Tina knows Houston. Ember knows Mildred. Hayes knows Eduardo. Anthony knows Esme. Arturo knows Jillian. Which of Esme and Jillian can Tina reach?", "answer": "Esme", "steps": [ "Tina knows Hayes.", "Hayes knows Anthony.", "Anthony knows Esme." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Tina", "Esme", "Hayes", "Houston", "Emery", "Amy", "Eduardo", "Anthony", "Cornelius", "Nina", "Donald", "Jillian", "Ember", "Jodi", "Alejandro", "Martin", "Mildred", "Arturo", "Hubert", "Janelle" ], "edges": [ [ 0, 4 ], [ 0, 2 ], [ 0, 3 ], [ 1, 5 ], [ 2, 6 ], [ 2, 7 ], [ 3, 8 ], [ 7, 1 ], [ 8, 9 ], [ 10, 14 ], [ 10, 12 ], [ 10, 13 ], [ 11, 15 ], [ 12, 16 ], [ 12, 17 ], [ 13, 18 ], [ 17, 11 ], [ 18, 19 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Alyssa knows Ariana. Barbara knows Houston. Violet knows Gertrude. Gertrude knows Garrett. Dakota knows Raymond. Barbara knows Violet. Garrett knows Isla. Ariana knows Fabian. Xavier knows Porter. Xavier knows Colby. Violet knows Dorothy. Garrett knows Melody. Dorothy knows Rita. Rita knows Anita. Colby knows Alyssa. Cassidy knows Dakota. Dakota knows Abby. Colby knows Cassidy. Which of Raymond and Melody can Barbara reach?", "answer": "Melody", "steps": [ "Barbara knows Violet.", "Violet knows Gertrude.", "Gertrude knows Garrett.", "Garrett knows Melody." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Barbara", "Anita", "Garrett", "Houston", "Gertrude", "Rita", "Melody", "Isla", "Violet", "Dorothy", "Xavier", "Fabian", "Dakota", "Porter", "Cassidy", "Ariana", "Raymond", "Abby", "Colby", "Alyssa" ], "edges": [ [ 0, 3 ], [ 0, 8 ], [ 2, 6 ], [ 2, 7 ], [ 4, 2 ], [ 5, 1 ], [ 8, 4 ], [ 8, 9 ], [ 9, 5 ], [ 10, 13 ], [ 10, 18 ], [ 12, 16 ], [ 12, 17 ], [ 14, 12 ], [ 15, 11 ], [ 18, 14 ], [ 18, 19 ], [ 19, 15 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Curtis knows Kenneth. Benjamin knows Larry. Jared knows Chance. Richard knows Marcia. Juan knows Benjamin. Hayley knows Kent. Jacob knows Curtis. Chance knows Abigail. Kenneth knows Shawn. Juan knows Horace. Shawn knows Richard. Kenneth knows Zoe. Catherine knows Joan. Juan knows Hayley. Curtis knows Marian. Curtis knows Catherine. Hayley knows Jared. Julie knows Juan. Which of Abigail and Marcia can Jacob reach?", "answer": "Marcia", "steps": [ "Jacob knows Curtis.", "Curtis knows Kenneth.", "Kenneth knows Shawn.", "Shawn knows Richard.", "Richard knows Marcia." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Jacob", "Marian", "Shawn", "Richard", "Curtis", "Marcia", "Kenneth", "Catherine", "Zoe", "Joan", "Julie", "Horace", "Jared", "Chance", "Juan", "Abigail", "Hayley", "Benjamin", "Kent", "Larry" ], "edges": [ [ 0, 4 ], [ 2, 3 ], [ 3, 5 ], [ 4, 1 ], [ 4, 6 ], [ 4, 7 ], [ 6, 2 ], [ 6, 8 ], [ 7, 9 ], [ 10, 14 ], [ 12, 13 ], [ 13, 15 ], [ 14, 11 ], [ 14, 16 ], [ 14, 17 ], [ 16, 12 ], [ 16, 18 ], [ 17, 19 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Chase knows Eve. Gloria knows Fern. Elodie knows Loretta. Clifford knows Holden. Elodie knows Clifford. Jasper knows Eduardo. Lynn knows Alice. Holden knows Owen. Eduardo knows Rufus. Eve knows Elodie. Rufus knows Gloria. Dave knows Lynn. Chase knows Jacques. Rufus knows Vance. Kurt knows Chase. Lynn knows Jasper. Eduardo knows Heath. Clifford knows Kareem. Which of Owen and Fern can Kurt reach?", "answer": "Owen", "steps": [ "Kurt knows Chase.", "Chase knows Eve.", "Eve knows Elodie.", "Elodie knows Clifford.", "Clifford knows Holden.", "Holden knows Owen." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Kurt", "Chase", "Clifford", "Jacques", "Elodie", "Owen", "Holden", "Kareem", "Eve", "Loretta", "Dave", "Lynn", "Rufus", "Alice", "Eduardo", "Fern", "Gloria", "Vance", "Jasper", "Heath" ], "edges": [ [ 0, 1 ], [ 1, 3 ], [ 1, 8 ], [ 2, 6 ], [ 2, 7 ], [ 4, 2 ], [ 4, 9 ], [ 6, 5 ], [ 8, 4 ], [ 10, 11 ], [ 11, 13 ], [ 11, 18 ], [ 12, 16 ], [ 12, 17 ], [ 14, 12 ], [ 14, 19 ], [ 16, 15 ], [ 18, 14 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Edgar knows Julio. Marshall knows Leon. Gonzalo knows Blaine. Alex knows Will. Blaine knows Alex. Leon knows Sally. Dora knows Myra. Andrea knows Paige. Myra knows Kara. Drew knows Edgar. Kara knows Greg. Sally knows Andrea. Terry knows Dora. Andrea knows Gonzalo. Jocelyn knows Edna. Edgar knows Jocelyn. Blaine knows Peter. Kara knows Drew. Which of Will and Edna can Terry reach?", "answer": "Edna", "steps": [ "Terry knows Dora.", "Dora knows Myra.", "Myra knows Kara.", "Kara knows Drew.", "Drew knows Edgar.", "Edgar knows Jocelyn.", "Jocelyn knows Edna." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Terry", "Edgar", "Kara", "Edna", "Julio", "Drew", "Jocelyn", "Myra", "Dora", "Greg", "Marshall", "Blaine", "Andrea", "Will", "Peter", "Gonzalo", "Alex", "Sally", "Leon", "Paige" ], "edges": [ [ 0, 8 ], [ 1, 4 ], [ 1, 6 ], [ 2, 5 ], [ 2, 9 ], [ 5, 1 ], [ 6, 3 ], [ 7, 2 ], [ 8, 7 ], [ 10, 18 ], [ 11, 14 ], [ 11, 16 ], [ 12, 15 ], [ 12, 19 ], [ 15, 11 ], [ 16, 13 ], [ 17, 12 ], [ 18, 17 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Leon knows Richard. Carrie knows Eldon. Carrie knows Freya. Conrad knows Zoe. Eldon knows Marian. Inez knows Leon. Dahlia knows Beatrice. Kieran knows Erma. Emery knows Vincent. Beatrice knows Kieran. Frankie knows Emery. Erma knows Goldie. Richard knows Bailey. Dahlia knows Conrad. Marian knows Neal. Freya knows Yolanda. Goldie knows Frankie. Neal knows Inez. Which of Eldon and Beatrice can Dahlia reach?", "answer": "Beatrice", "steps": [ "Dahlia knows Beatrice." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Dahlia", "Erma", "Conrad", "Goldie", "Kieran", "Beatrice", "Emery", "Vincent", "Zoe", "Frankie", "Carrie", "Neal", "Freya", "Inez", "Marian", "Eldon", "Richard", "Bailey", "Yolanda", "Leon" ], "edges": [ [ 0, 2 ], [ 0, 5 ], [ 1, 3 ], [ 2, 8 ], [ 3, 9 ], [ 4, 1 ], [ 5, 4 ], [ 6, 7 ], [ 9, 6 ], [ 10, 12 ], [ 10, 15 ], [ 11, 13 ], [ 12, 18 ], [ 13, 19 ], [ 14, 11 ], [ 15, 14 ], [ 16, 17 ], [ 19, 16 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Palmer knows Victoria. Clyde knows George. Vincent knows Teresa. Roy knows Hugh. Palmer knows Ethan. Jeffery knows Nadine. Peggy knows Finn. Brooks knows Jenny. Jack knows Jeffery. Roy knows Palmer. Jeffery knows Jesse. Jack knows Neville. Jack knows Alex. Roy knows Mike. Teresa knows Roy. Jenny knows Peggy. George knows Vincent. Finn knows Jack. Which of Jenny and George can Clyde reach?", "answer": "George", "steps": [ "Clyde knows George." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Clyde", "Palmer", "Ethan", "Hugh", "Teresa", "George", "Vincent", "Victoria", "Roy", "Mike", "Brooks", "Jeffery", "Nadine", "Neville", "Finn", "Jenny", "Peggy", "Jesse", "Jack", "Alex" ], "edges": [ [ 0, 5 ], [ 1, 2 ], [ 1, 7 ], [ 4, 8 ], [ 5, 6 ], [ 6, 4 ], [ 8, 3 ], [ 8, 1 ], [ 8, 9 ], [ 10, 15 ], [ 11, 12 ], [ 11, 17 ], [ 14, 18 ], [ 15, 16 ], [ 16, 14 ], [ 18, 13 ], [ 18, 11 ], [ 18, 19 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Clement knows Isla. Zane knows Pat. Kira knows Lillian. Cassidy knows Edna. Cassidy knows Phoebe. Ebony knows Clement. Isaac knows Gemma. Brittany knows Kira. Gemma knows Ebony. Pat knows Cassidy. Isla knows Kirsten. Kirsten knows Carter. Kira knows Kenneth. Kirsten knows Max. Gemma knows Mark. Phoebe knows Brittany. Ebony knows Gerald. Pat knows Kylie. Which of Pat and Gemma can Isaac reach?", "answer": "Gemma", "steps": [ "Isaac knows Gemma." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Isaac", "Kirsten", "Ebony", "Max", "Mark", "Gemma", "Isla", "Gerald", "Clement", "Carter", "Zane", "Kira", "Cassidy", "Kenneth", "Kylie", "Pat", "Brittany", "Edna", "Phoebe", "Lillian" ], "edges": [ [ 0, 5 ], [ 1, 3 ], [ 1, 9 ], [ 2, 7 ], [ 2, 8 ], [ 5, 4 ], [ 5, 2 ], [ 6, 1 ], [ 8, 6 ], [ 10, 15 ], [ 11, 13 ], [ 11, 19 ], [ 12, 17 ], [ 12, 18 ], [ 15, 14 ], [ 15, 12 ], [ 16, 11 ], [ 18, 16 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Drake knows Kai. Dante knows Tessa. Lennox knows Christian. Wendell knows Dante. Sylvia knows Drake. Drake knows Felicia. Sylvia knows Hayley. Christina knows Stephen. Wendell knows Barbara. Louise knows Fraser. Drake knows Rebecca. Wendell knows Ellis. Barbara knows Christina. Victor knows Wendell. Wendell knows Gary. Kai knows Lennox. Drake knows Louise. Victor knows Jim. Which of Christian and Stephen can Sylvia reach?", "answer": "Christian", "steps": [ "Sylvia knows Drake.", "Drake knows Kai.", "Kai knows Lennox.", "Lennox knows Christian." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Sylvia", "Louise", "Drake", "Kai", "Hayley", "Christian", "Lennox", "Felicia", "Fraser", "Rebecca", "Victor", "Dante", "Wendell", "Barbara", "Jim", "Stephen", "Christina", "Gary", "Tessa", "Ellis" ], "edges": [ [ 0, 4 ], [ 0, 2 ], [ 1, 8 ], [ 2, 3 ], [ 2, 7 ], [ 2, 1 ], [ 2, 9 ], [ 3, 6 ], [ 6, 5 ], [ 10, 14 ], [ 10, 12 ], [ 11, 18 ], [ 12, 13 ], [ 12, 17 ], [ 12, 11 ], [ 12, 19 ], [ 13, 16 ], [ 16, 15 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Trina knows Martin. Ruby knows Christina. Christina knows Ariel. Enrique knows Celia. Enrique knows Arnold. Jermaine knows Andre. Arnold knows Tonya. Malik knows Enrique. Eric knows Edwin. Christina knows Tara. Ariel knows Eric. Kenneth knows Lynn. Tonya knows Cornelius. Dolly knows Pat. Tara knows Jermaine. Cornelius knows Trina. Celia knows Kenneth. Andre knows Dolly. Which of Arnold and Tara can Malik reach?", "answer": "Arnold", "steps": [ "Malik knows Enrique.", "Enrique knows Arnold." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Malik", "Lynn", "Celia", "Kenneth", "Cornelius", "Arnold", "Enrique", "Trina", "Martin", "Tonya", "Ruby", "Edwin", "Ariel", "Eric", "Andre", "Tara", "Christina", "Dolly", "Pat", "Jermaine" ], "edges": [ [ 0, 6 ], [ 2, 3 ], [ 3, 1 ], [ 4, 7 ], [ 5, 9 ], [ 6, 2 ], [ 6, 5 ], [ 7, 8 ], [ 9, 4 ], [ 10, 16 ], [ 12, 13 ], [ 13, 11 ], [ 14, 17 ], [ 15, 19 ], [ 16, 12 ], [ 16, 15 ], [ 17, 18 ], [ 19, 14 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Carmela knows Shaun. Bob knows Abigail. Jaime knows Milton. Zane knows Evan. Carey knows Zane. Abigail knows Alfonso. Carmela knows Daniella. Abigail knows Jaime. Fabian knows Cain. Alfonso knows Maggie. Maggie knows Jakob. Ben knows Etta. Jaime knows Ben. Fabian knows Carey. Carey knows Dora. Kira knows Fabian. Cain knows Carmela. Maggie knows Perry. Which of Carmela and Maggie can Kira reach?", "answer": "Carmela", "steps": [ "Kira knows Fabian.", "Fabian knows Cain.", "Cain knows Carmela." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Kira", "Fabian", "Zane", "Carey", "Cain", "Shaun", "Carmela", "Dora", "Evan", "Daniella", "Bob", "Abigail", "Ben", "Jaime", "Alfonso", "Jakob", "Maggie", "Milton", "Etta", "Perry" ], "edges": [ [ 0, 1 ], [ 1, 3 ], [ 1, 4 ], [ 2, 8 ], [ 3, 7 ], [ 3, 2 ], [ 4, 6 ], [ 6, 5 ], [ 6, 9 ], [ 10, 11 ], [ 11, 13 ], [ 11, 14 ], [ 12, 18 ], [ 13, 17 ], [ 13, 12 ], [ 14, 16 ], [ 16, 15 ], [ 16, 19 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Elena knows Jessica. Rosa knows Jeanne. Lawrence knows Celia. Maude knows Elena. Angela knows Maude. Faye knows Florence. Ebony knows Faye. Celia knows Brooke. Angela knows Rosa. Travis knows Robin. Brooke knows Aaron. Florence knows Chad. Jenny knows August. Jeanne knows Travis. Kevin knows Angela. Leroy knows Kevin. August knows Lawrence. Lawrence knows Ebony. Which of August and Kevin can Jenny reach?", "answer": "August", "steps": [ "Jenny knows August." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Jenny", "Florence", "Lawrence", "Brooke", "Faye", "Ebony", "Chad", "Celia", "Aaron", "August", "Leroy", "Travis", "Angela", "Elena", "Jeanne", "Rosa", "Robin", "Maude", "Jessica", "Kevin" ], "edges": [ [ 0, 9 ], [ 1, 6 ], [ 2, 5 ], [ 2, 7 ], [ 3, 8 ], [ 4, 1 ], [ 5, 4 ], [ 7, 3 ], [ 9, 2 ], [ 10, 19 ], [ 11, 16 ], [ 12, 15 ], [ 12, 17 ], [ 13, 18 ], [ 14, 11 ], [ 15, 14 ], [ 17, 13 ], [ 19, 12 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Joy knows Edwin. Ada knows Spencer. Gloria knows Kelly. Darius knows Joy. Allan knows Henrietta. Reid knows Camden. Reid knows Dominic. Lorraine knows Reid. Lillian knows Darius. Lillian knows Pam. Blanche knows Gloria. Joy knows Carter. Allan knows Drew. Spencer knows Lorraine. Henrietta knows Lillian. Spencer knows Caroline. Blanche knows Ada. Drew knows Shelly. Which of Reid and Joy can Blanche reach?", "answer": "Reid", "steps": [ "Blanche knows Ada.", "Ada knows Spencer.", "Spencer knows Lorraine.", "Lorraine knows Reid." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Blanche", "Lorraine", "Ada", "Spencer", "Gloria", "Dominic", "Camden", "Kelly", "Caroline", "Reid", "Allan", "Darius", "Henrietta", "Lillian", "Drew", "Carter", "Edwin", "Shelly", "Pam", "Joy" ], "edges": [ [ 0, 4 ], [ 0, 2 ], [ 1, 9 ], [ 2, 3 ], [ 3, 8 ], [ 3, 1 ], [ 4, 7 ], [ 9, 5 ], [ 9, 6 ], [ 10, 14 ], [ 10, 12 ], [ 11, 19 ], [ 12, 13 ], [ 13, 18 ], [ 13, 11 ], [ 14, 17 ], [ 19, 15 ], [ 19, 16 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Eldon knows Yvonne. Chris knows Mara. Yvonne knows Imogen. Jessica knows Fraser. Vicki knows Veronica. Alma knows Duke. Zack knows Alma. Elvira knows Anita. Mara knows Celeste. Mara knows Jessica. Yvonne knows Luz. Mara knows Eileen. Mara knows Diane. Veronica knows Gene. Alma knows Chris. Yvonne knows Helen. Veronica knows Eldon. Yvonne knows Elvira. Which of Jessica and Elvira can Vicki reach?", "answer": "Elvira", "steps": [ "Vicki knows Veronica.", "Veronica knows Eldon.", "Eldon knows Yvonne.", "Yvonne knows Elvira." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Vicki", "Gene", "Luz", "Elvira", "Helen", "Veronica", "Yvonne", "Eldon", "Anita", "Imogen", "Zack", "Duke", "Diane", "Jessica", "Eileen", "Alma", "Mara", "Chris", "Fraser", "Celeste" ], "edges": [ [ 0, 5 ], [ 3, 8 ], [ 5, 1 ], [ 5, 7 ], [ 6, 2 ], [ 6, 4 ], [ 6, 3 ], [ 6, 9 ], [ 7, 6 ], [ 10, 15 ], [ 13, 18 ], [ 15, 11 ], [ 15, 17 ], [ 16, 12 ], [ 16, 14 ], [ 16, 13 ], [ 16, 19 ], [ 17, 16 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Jerry knows Heath. Annie knows Mary. Edwin knows Erma. Hampton knows Lennox. Bonnie knows Nathan. Nicole knows Tanya. Nathan knows Lucy. Bonnie knows Jacqueline. Nicole knows Elton. Heath knows Edwin. Hampton knows Edna. Jacqueline knows Ibrahim. Tanya knows Bonnie. Edwin knows Hampton. Elton knows Mason. Jerry knows Annie. Erma knows April. Nathan knows Hunter. Which of Heath and Tanya can Nicole reach?", "answer": "Tanya", "steps": [ "Nicole knows Tanya." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Nicole", "Ibrahim", "Bonnie", "Hunter", "Tanya", "Jacqueline", "Nathan", "Mason", "Elton", "Lucy", "Jerry", "April", "Edwin", "Edna", "Heath", "Erma", "Hampton", "Mary", "Annie", "Lennox" ], "edges": [ [ 0, 8 ], [ 0, 4 ], [ 2, 5 ], [ 2, 6 ], [ 4, 2 ], [ 5, 1 ], [ 6, 3 ], [ 6, 9 ], [ 8, 7 ], [ 10, 18 ], [ 10, 14 ], [ 12, 15 ], [ 12, 16 ], [ 14, 12 ], [ 15, 11 ], [ 16, 13 ], [ 16, 19 ], [ 18, 17 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Desmond knows Darwin. Joanna knows Delia. Brett knows Lawson. Joyce knows Annette. Horace knows Joyce. Trudy knows Rosa. Joanna knows Hardy. Delia knows Desmond. Hardy knows Horace. Connor knows Jim. Lawson knows Bob. Jim knows Gabriel. Delia knows Kieran. Brett knows Trudy. Kieran knows Clay. Gabriel knows Bart. Connor knows Brett. Bart knows Terrence. Which of Horace and Gabriel can Joanna reach?", "answer": "Horace", "steps": [ "Joanna knows Hardy.", "Hardy knows Horace." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Joanna", "Horace", "Darwin", "Hardy", "Joyce", "Annette", "Kieran", "Clay", "Delia", "Desmond", "Connor", "Gabriel", "Rosa", "Jim", "Bart", "Terrence", "Lawson", "Bob", "Brett", "Trudy" ], "edges": [ [ 0, 3 ], [ 0, 8 ], [ 1, 4 ], [ 3, 1 ], [ 4, 5 ], [ 6, 7 ], [ 8, 6 ], [ 8, 9 ], [ 9, 2 ], [ 10, 13 ], [ 10, 18 ], [ 11, 14 ], [ 13, 11 ], [ 14, 15 ], [ 16, 17 ], [ 18, 16 ], [ 18, 19 ], [ 19, 12 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Eloise knows Cameron. Lauren knows Dell. Bernice knows Dalton. Connor knows Alana. Beth knows Connor. Beth knows Dewey. Matthew knows Barney. Katherine knows Bernice. Lauren knows Katherine. Bernice knows Matthew. Alana knows Jake. Dewey knows Gustavo. Eloise knows Ilene. Cameron knows Beth. Barney knows Amber. Dalton knows Erma. Dalton knows Forrest. Dewey knows Landon. Which of Barney and Alana can Lauren reach?", "answer": "Barney", "steps": [ "Lauren knows Katherine.", "Katherine knows Bernice.", "Bernice knows Matthew.", "Matthew knows Barney." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Lauren", "Dalton", "Katherine", "Bernice", "Erma", "Dell", "Barney", "Forrest", "Matthew", "Amber", "Eloise", "Dewey", "Cameron", "Beth", "Landon", "Ilene", "Alana", "Gustavo", "Connor", "Jake" ], "edges": [ [ 0, 5 ], [ 0, 2 ], [ 1, 4 ], [ 1, 7 ], [ 2, 3 ], [ 3, 1 ], [ 3, 8 ], [ 6, 9 ], [ 8, 6 ], [ 10, 15 ], [ 10, 12 ], [ 11, 14 ], [ 11, 17 ], [ 12, 13 ], [ 13, 11 ], [ 13, 18 ], [ 16, 19 ], [ 18, 16 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Jeff knows Harrison. Deirdre knows Camille. Joanna knows Marvin. Fergus knows Virginia. Molly knows Melody. Dayton knows Jennifer. Jonathan knows Dayton. Molly knows Dina. Joanna knows Molly. Patrick knows Naomi. Melody knows Ainsley. Naomi knows Pablo. Jeff knows Fergus. Corey knows Deirdre. Molly knows Patrick. Ainsley knows Tina. Fergus knows Corey. Fergus knows Jonathan. Which of Deirdre and Ainsley can Jeff reach?", "answer": "Deirdre", "steps": [ "Jeff knows Fergus.", "Fergus knows Corey.", "Corey knows Deirdre." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Jeff", "Corey", "Virginia", "Jennifer", "Deirdre", "Camille", "Harrison", "Jonathan", "Fergus", "Dayton", "Joanna", "Melody", "Dina", "Pablo", "Ainsley", "Tina", "Marvin", "Patrick", "Molly", "Naomi" ], "edges": [ [ 0, 6 ], [ 0, 8 ], [ 1, 4 ], [ 4, 5 ], [ 7, 9 ], [ 8, 2 ], [ 8, 1 ], [ 8, 7 ], [ 9, 3 ], [ 10, 16 ], [ 10, 18 ], [ 11, 14 ], [ 14, 15 ], [ 17, 19 ], [ 18, 12 ], [ 18, 11 ], [ 18, 17 ], [ 19, 13 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Willis knows Kay. Virginia knows Elliot. Isaac knows Alex. Houston knows Marvin. Carson knows Houston. Alex knows Willis. Constance knows Axel. Kay knows Malcolm. Constance knows Teresa. Willis knows Clara. Marvin knows Electra. Axel knows Isaac. Marvin knows Virginia. Mitchell knows Curtis. Virginia knows Leticia. Mitchell knows Mae. Kay knows Eve. Curtis knows Carson. Which of Carson and Isaac can Constance reach?", "answer": "Isaac", "steps": [ "Constance knows Axel.", "Axel knows Isaac." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Constance", "Clara", "Kay", "Isaac", "Teresa", "Axel", "Alex", "Eve", "Malcolm", "Willis", "Mitchell", "Electra", "Virginia", "Carson", "Mae", "Curtis", "Houston", "Elliot", "Leticia", "Marvin" ], "edges": [ [ 0, 4 ], [ 0, 5 ], [ 2, 7 ], [ 2, 8 ], [ 3, 6 ], [ 5, 3 ], [ 6, 9 ], [ 9, 1 ], [ 9, 2 ], [ 10, 14 ], [ 10, 15 ], [ 12, 17 ], [ 12, 18 ], [ 13, 16 ], [ 15, 13 ], [ 16, 19 ], [ 19, 11 ], [ 19, 12 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Coral knows Olive. Eldon knows Amy. Clayton knows Kamila. Estelle knows Bernadette. Bernadette knows Jorge. Adele knows Fabian. Guillermo knows Eldon. Dora knows Becky. Burt knows Dora. Becky knows Adele. Archer knows Clayton. Clayton knows Coral. Nancy knows Annie. Kamila knows Nancy. Ariana knows Burt. Fabian knows Paul. Jorge knows Archer. Adele knows Guillermo. Which of Amy and Annie can Estelle reach?", "answer": "Annie", "steps": [ "Estelle knows Bernadette.", "Bernadette knows Jorge.", "Jorge knows Archer.", "Archer knows Clayton.", "Clayton knows Kamila.", "Kamila knows Nancy.", "Nancy knows Annie." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Estelle", "Kamila", "Bernadette", "Olive", "Annie", "Nancy", "Jorge", "Coral", "Clayton", "Archer", "Ariana", "Guillermo", "Burt", "Paul", "Amy", "Eldon", "Dora", "Fabian", "Adele", "Becky" ], "edges": [ [ 0, 2 ], [ 1, 5 ], [ 2, 6 ], [ 5, 4 ], [ 6, 9 ], [ 7, 3 ], [ 8, 1 ], [ 8, 7 ], [ 9, 8 ], [ 10, 12 ], [ 11, 15 ], [ 12, 16 ], [ 15, 14 ], [ 16, 19 ], [ 17, 13 ], [ 18, 11 ], [ 18, 17 ], [ 19, 18 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Felicia knows Clinton. Carmen knows Felicia. Elliot knows Clifford. Stefan knows Elliot. Monica knows Destiny. Darwin knows Monica. Destiny knows Chase. Fraser knows Kara. Kara knows Alfonso. Lena knows Colette. Fraser knows Yara. Yara knows Florence. Florence knows Dolores. Wilma knows Lena. Yara knows Darwin. Colette knows Howard. Stefan knows Carmen. Carmen knows Wilma. Which of Destiny and Colette can Stefan reach?", "answer": "Colette", "steps": [ "Stefan knows Carmen.", "Carmen knows Wilma.", "Wilma knows Lena.", "Lena knows Colette." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Stefan", "Carmen", "Colette", "Felicia", "Clifford", "Wilma", "Lena", "Howard", "Elliot", "Clinton", "Fraser", "Yara", "Destiny", "Florence", "Alfonso", "Darwin", "Monica", "Chase", "Kara", "Dolores" ], "edges": [ [ 0, 8 ], [ 0, 1 ], [ 1, 5 ], [ 1, 3 ], [ 2, 7 ], [ 3, 9 ], [ 5, 6 ], [ 6, 2 ], [ 8, 4 ], [ 10, 18 ], [ 10, 11 ], [ 11, 15 ], [ 11, 13 ], [ 12, 17 ], [ 13, 19 ], [ 15, 16 ], [ 16, 12 ], [ 18, 14 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Goldie knows Faye. Arturo knows Kendrick. Faye knows Victoria. Samantha knows Charlene. Faye knows Gus. Gus knows Cordelia. Knox knows Geneva. Faye knows Colby. Geneva knows Warren. Garrett knows Zach. Victoria knows Hazel. Zach knows Samantha. Samantha knows Knox. Cordelia knows Leander. Samantha knows Arturo. Denise knows Goldie. Samantha knows Dylan. Faye knows Spencer. Which of Goldie and Zach can Denise reach?", "answer": "Goldie", "steps": [ "Denise knows Goldie." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Denise", "Cordelia", "Spencer", "Victoria", "Gus", "Faye", "Leander", "Goldie", "Hazel", "Colby", "Garrett", "Geneva", "Dylan", "Arturo", "Knox", "Samantha", "Warren", "Zach", "Kendrick", "Charlene" ], "edges": [ [ 0, 7 ], [ 1, 6 ], [ 3, 8 ], [ 4, 1 ], [ 5, 2 ], [ 5, 4 ], [ 5, 3 ], [ 5, 9 ], [ 7, 5 ], [ 10, 17 ], [ 11, 16 ], [ 13, 18 ], [ 14, 11 ], [ 15, 12 ], [ 15, 14 ], [ 15, 13 ], [ 15, 19 ], [ 17, 15 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Harris knows Jon. Lark knows Ian. Sharon knows Kelly. Phoebe knows Valerie. Mark knows Drake. Phoebe knows Lark. Lola knows Sharon. Andre knows Damien. Kelly knows Lyric. Jon knows Anastasia. Lola knows Mark. Jon knows Boyd. Lark knows Julie. Andre knows Eloise. Ian knows Winston. Julie knows Andre. Sharon knows Harris. Valerie knows Wayne. Which of Andre and Jon can Phoebe reach?", "answer": "Andre", "steps": [ "Phoebe knows Lark.", "Lark knows Julie.", "Julie knows Andre." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Phoebe", "Wayne", "Lark", "Ian", "Winston", "Eloise", "Julie", "Damien", "Valerie", "Andre", "Lola", "Drake", "Sharon", "Kelly", "Lyric", "Boyd", "Harris", "Anastasia", "Mark", "Jon" ], "edges": [ [ 0, 8 ], [ 0, 2 ], [ 2, 3 ], [ 2, 6 ], [ 3, 4 ], [ 6, 9 ], [ 8, 1 ], [ 9, 5 ], [ 9, 7 ], [ 10, 18 ], [ 10, 12 ], [ 12, 13 ], [ 12, 16 ], [ 13, 14 ], [ 16, 19 ], [ 18, 11 ], [ 19, 15 ], [ 19, 17 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Tara knows Amy. Lee knows Marie. Jillian knows Margaret. Connor knows India. India knows Jillian. Lee knows Keaton. Houston knows Hilda. Hilda knows Zelda. Lois knows Gareth. Milo knows Houston. Keaton knows Esther. Hilda knows Lucia. Jillian knows Lee. Esther knows Lois. Zelda knows Tara. Amy knows Angelica. Zelda knows Mary. Angelica knows Javier. Which of Amy and Esther can Connor reach?", "answer": "Esther", "steps": [ "Connor knows India.", "India knows Jillian.", "Jillian knows Lee.", "Lee knows Keaton.", "Keaton knows Esther." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Connor", "Lee", "Margaret", "Keaton", "Gareth", "Esther", "Jillian", "Marie", "India", "Lois", "Milo", "Zelda", "Lucia", "Tara", "Javier", "Amy", "Hilda", "Mary", "Houston", "Angelica" ], "edges": [ [ 0, 8 ], [ 1, 7 ], [ 1, 3 ], [ 3, 5 ], [ 5, 9 ], [ 6, 2 ], [ 6, 1 ], [ 8, 6 ], [ 9, 4 ], [ 10, 18 ], [ 11, 17 ], [ 11, 13 ], [ 13, 15 ], [ 15, 19 ], [ 16, 12 ], [ 16, 11 ], [ 18, 16 ], [ 19, 14 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Edgar knows Julio. Marshall knows Leon. Gonzalo knows Blaine. Alex knows Will. Blaine knows Alex. Leon knows Sally. Dora knows Myra. Andrea knows Paige. Myra knows Kara. Drew knows Edgar. Kara knows Greg. Sally knows Andrea. Terry knows Dora. Andrea knows Gonzalo. Jocelyn knows Edna. Edgar knows Jocelyn. Blaine knows Peter. Kara knows Drew. Which of Sally and Myra can Terry reach?", "answer": "Myra", "steps": [ "Terry knows Dora.", "Dora knows Myra." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Terry", "Edgar", "Kara", "Edna", "Julio", "Drew", "Jocelyn", "Myra", "Dora", "Greg", "Marshall", "Blaine", "Andrea", "Will", "Peter", "Gonzalo", "Alex", "Sally", "Leon", "Paige" ], "edges": [ [ 0, 8 ], [ 1, 4 ], [ 1, 6 ], [ 2, 5 ], [ 2, 9 ], [ 5, 1 ], [ 6, 3 ], [ 7, 2 ], [ 8, 7 ], [ 10, 18 ], [ 11, 14 ], [ 11, 16 ], [ 12, 15 ], [ 12, 19 ], [ 15, 11 ], [ 16, 13 ], [ 17, 12 ], [ 18, 17 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Fabian knows Joel. Iris knows Joshua. Iris knows Kareem. Hunter knows Kingsley. Kingsley knows Belinda. Joel knows Tamara. Gina knows Edison. Kingsley knows Dalton. Eleanor knows Antonio. Iris knows Zack. Belinda knows Iris. Joel knows Earl. Alder knows Hunter. Gina knows Eleanor. Alder knows Jamie. Antonio knows Edgar. Joel knows Jack. Antonio knows Fabian. Which of Tamara and Kareem can Gina reach?", "answer": "Tamara", "steps": [ "Gina knows Eleanor.", "Eleanor knows Antonio.", "Antonio knows Fabian.", "Fabian knows Joel.", "Joel knows Tamara." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Gina", "Tamara", "Edison", "Fabian", "Antonio", "Jack", "Edgar", "Joel", "Eleanor", "Earl", "Alder", "Kareem", "Jamie", "Belinda", "Kingsley", "Joshua", "Dalton", "Iris", "Hunter", "Zack" ], "edges": [ [ 0, 2 ], [ 0, 8 ], [ 3, 7 ], [ 4, 6 ], [ 4, 3 ], [ 7, 1 ], [ 7, 5 ], [ 7, 9 ], [ 8, 4 ], [ 10, 12 ], [ 10, 18 ], [ 13, 17 ], [ 14, 16 ], [ 14, 13 ], [ 17, 11 ], [ 17, 15 ], [ 17, 19 ], [ 18, 14 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Vivian knows June. Gareth knows Burt. Glen knows Aisha. Gilbert knows Glen. Karl knows Henry. Layla knows Alice. June knows Caleb. Blair knows Cate. Blair knows Mitchell. Jackson knows Karl. Mitchell knows Vivian. Cate knows Layla. Aisha knows Gareth. Jack knows Rowan. Burt knows Hudson. Rowan knows Blair. Glen knows Jackson. Jolena knows Gilbert. Which of Aisha and Mitchell can Jack reach?", "answer": "Mitchell", "steps": [ "Jack knows Rowan.", "Rowan knows Blair.", "Blair knows Mitchell." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Jack", "Vivian", "Layla", "Rowan", "Blair", "Cate", "Caleb", "June", "Alice", "Mitchell", "Jolena", "Gareth", "Karl", "Gilbert", "Glen", "Jackson", "Hudson", "Burt", "Henry", "Aisha" ], "edges": [ [ 0, 3 ], [ 1, 7 ], [ 2, 8 ], [ 3, 4 ], [ 4, 5 ], [ 4, 9 ], [ 5, 2 ], [ 7, 6 ], [ 9, 1 ], [ 10, 13 ], [ 11, 17 ], [ 12, 18 ], [ 13, 14 ], [ 14, 15 ], [ 14, 19 ], [ 15, 12 ], [ 17, 16 ], [ 19, 11 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Luna knows Beatrice. Sadie knows Axel. Javier knows Julius. Ivy knows Loretta. Julia knows Louise. Olive knows Morris. Cornelius knows Curtis. Cornelius knows Ivy. Donald knows Cornelius. Nora knows Donald. Rita knows Javier. Nora knows Sadie. Beatrice knows Olive. Curtis knows Willis. Julius knows Max. Beatrice knows Rita. Cindy knows Nora. Javier knows Julia. Which of Louise and Loretta can Cindy reach?", "answer": "Loretta", "steps": [ "Cindy knows Nora.", "Nora knows Donald.", "Donald knows Cornelius.", "Cornelius knows Ivy.", "Ivy knows Loretta." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Cindy", "Nora", "Donald", "Ivy", "Loretta", "Willis", "Cornelius", "Sadie", "Axel", "Curtis", "Luna", "Beatrice", "Rita", "Julia", "Louise", "Max", "Javier", "Olive", "Morris", "Julius" ], "edges": [ [ 0, 1 ], [ 1, 7 ], [ 1, 2 ], [ 2, 6 ], [ 3, 4 ], [ 6, 3 ], [ 6, 9 ], [ 7, 8 ], [ 9, 5 ], [ 10, 11 ], [ 11, 17 ], [ 11, 12 ], [ 12, 16 ], [ 13, 14 ], [ 16, 13 ], [ 16, 19 ], [ 17, 18 ], [ 19, 15 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Rita knows Olive. Malik knows Reid. Emma knows Theodore. Tara knows Marie. Marie knows Rita. Reid knows Damien. Corey knows Samantha. Samantha knows Malik. Tara knows Nolan. Rita knows Troy. Reid knows Edgar. Samantha knows Emma. Howard knows Tara. Troy knows Kennedy. Nolan knows Vanessa. Edgar knows Elijah. Emma knows Ezra. Nolan knows Adele. Which of Elijah and Kennedy can Howard reach?", "answer": "Kennedy", "steps": [ "Howard knows Tara.", "Tara knows Marie.", "Marie knows Rita.", "Rita knows Troy.", "Troy knows Kennedy." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Howard", "Rita", "Tara", "Nolan", "Marie", "Vanessa", "Adele", "Olive", "Kennedy", "Troy", "Corey", "Reid", "Samantha", "Emma", "Malik", "Theodore", "Ezra", "Damien", "Elijah", "Edgar" ], "edges": [ [ 0, 2 ], [ 1, 7 ], [ 1, 9 ], [ 2, 3 ], [ 2, 4 ], [ 3, 5 ], [ 3, 6 ], [ 4, 1 ], [ 9, 8 ], [ 10, 12 ], [ 11, 17 ], [ 11, 19 ], [ 12, 13 ], [ 12, 14 ], [ 13, 15 ], [ 13, 16 ], [ 14, 11 ], [ 19, 18 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Jeffery knows Enrique. Aubrey knows Benjamin. Dane knows Aubrey. Keith knows Abel. Abel knows Louisa. Wendy knows Freya. Devon knows Dane. Keith knows Graeme. Aubrey knows Wendy. Benjamin knows Sheila. Aubrey knows Simon. Kylie knows Albert. Wendy knows Julian. Abel knows Karina. Sheila knows Kira. Albert knows Marlene. Enrique knows Keith. Keith knows Kylie. Which of Benjamin and Kylie can Jeffery reach?", "answer": "Kylie", "steps": [ "Jeffery knows Enrique.", "Enrique knows Keith.", "Keith knows Kylie." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Jeffery", "Graeme", "Enrique", "Abel", "Albert", "Kylie", "Karina", "Marlene", "Louisa", "Keith", "Devon", "Simon", "Dane", "Wendy", "Sheila", "Benjamin", "Freya", "Kira", "Julian", "Aubrey" ], "edges": [ [ 0, 2 ], [ 2, 9 ], [ 3, 6 ], [ 3, 8 ], [ 4, 7 ], [ 5, 4 ], [ 9, 1 ], [ 9, 5 ], [ 9, 3 ], [ 10, 12 ], [ 12, 19 ], [ 13, 16 ], [ 13, 18 ], [ 14, 17 ], [ 15, 14 ], [ 19, 11 ], [ 19, 15 ], [ 19, 13 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Henrietta knows Janet. Brad knows Harvey. Abel knows Alan. Cole knows Brad. Emily knows Henrietta. Kamila knows Clement. Clement knows Rick. Tim knows Connor. Hailey knows Carter. Trudy knows Emily. Janet knows Jay. Carter knows Tim. Tim knows Trudy. Alan knows Shaun. Clement knows Abel. Stephanie knows Kamila. Jay knows Earle. Shaun knows Cole. Which of Shaun and Henrietta can Hailey reach?", "answer": "Henrietta", "steps": [ "Hailey knows Carter.", "Carter knows Tim.", "Tim knows Trudy.", "Trudy knows Emily.", "Emily knows Henrietta." ], "difficulty": 5, "original_distance": 8, "idx_to_symbol": [ "Hailey", "Connor", "Janet", "Tim", "Emily", "Earle", "Henrietta", "Trudy", "Carter", "Jay", "Stephanie", "Rick", "Cole", "Clement", "Alan", "Harvey", "Shaun", "Abel", "Kamila", "Brad" ], "edges": [ [ 0, 8 ], [ 2, 9 ], [ 3, 1 ], [ 3, 7 ], [ 4, 6 ], [ 6, 2 ], [ 7, 4 ], [ 8, 3 ], [ 9, 5 ], [ 10, 18 ], [ 12, 19 ], [ 13, 11 ], [ 13, 17 ], [ 14, 16 ], [ 16, 12 ], [ 17, 14 ], [ 18, 13 ], [ 19, 15 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Stella knows Chandler. Bridget knows Laura. Antonio knows Kit. Stella knows Heath. Hampton knows Jade. Heath knows Daniella. Laura knows Hampton. Shannon knows Stella. Heath knows Saul. Tonya knows Bridget. Reed knows Bart. Kit knows Sara. Farrah knows Shannon. Laura knows Antonio. Chandler knows Reed. Jade knows Zoe. Antonio knows Eunice. Daniella knows Jose. Which of Zoe and Bart can Farrah reach?", "answer": "Bart", "steps": [ "Farrah knows Shannon.", "Shannon knows Stella.", "Stella knows Chandler.", "Chandler knows Reed.", "Reed knows Bart." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Farrah", "Chandler", "Bart", "Jose", "Shannon", "Heath", "Reed", "Daniella", "Saul", "Stella", "Tonya", "Hampton", "Zoe", "Sara", "Bridget", "Antonio", "Jade", "Kit", "Eunice", "Laura" ], "edges": [ [ 0, 4 ], [ 1, 6 ], [ 4, 9 ], [ 5, 7 ], [ 5, 8 ], [ 6, 2 ], [ 7, 3 ], [ 9, 1 ], [ 9, 5 ], [ 10, 14 ], [ 11, 16 ], [ 14, 19 ], [ 15, 17 ], [ 15, 18 ], [ 16, 12 ], [ 17, 13 ], [ 19, 11 ], [ 19, 15 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Will knows Thea. Thea knows Knox. Corinne knows Brooks. Jerome knows Eloise. Corinne knows Boyd. Sharon knows Vicki. Thea knows Kingsley. Lola knows Morgan. Jerome knows Lola. Will knows Carrie. Eloise knows Marcia. Lola knows Corinne. Marcia knows Harlan. Vicki knows Franklin. Kingsley knows Leticia. Jerome knows Alfred. Kingsley knows Desmond. Will knows Sharon. Which of Corinne and Kingsley can Will reach?", "answer": "Kingsley", "steps": [ "Will knows Thea.", "Thea knows Kingsley." ], "difficulty": 2, "original_distance": 3, "idx_to_symbol": [ "Will", "Sharon", "Vicki", "Kingsley", "Knox", "Desmond", "Franklin", "Thea", "Carrie", "Leticia", "Jerome", "Eloise", "Marcia", "Corinne", "Morgan", "Boyd", "Harlan", "Lola", "Alfred", "Brooks" ], "edges": [ [ 0, 1 ], [ 0, 8 ], [ 0, 7 ], [ 1, 2 ], [ 2, 6 ], [ 3, 5 ], [ 3, 9 ], [ 7, 4 ], [ 7, 3 ], [ 10, 11 ], [ 10, 18 ], [ 10, 17 ], [ 11, 12 ], [ 12, 16 ], [ 13, 15 ], [ 13, 19 ], [ 17, 14 ], [ 17, 13 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Henrietta knows Janet. Brad knows Harvey. Abel knows Alan. Cole knows Brad. Emily knows Henrietta. Kamila knows Clement. Clement knows Rick. Tim knows Connor. Hailey knows Carter. Trudy knows Emily. Janet knows Jay. Carter knows Tim. Tim knows Trudy. Alan knows Shaun. Clement knows Abel. Stephanie knows Kamila. Jay knows Earle. Shaun knows Cole. Which of Trudy and Abel can Hailey reach?", "answer": "Trudy", "steps": [ "Hailey knows Carter.", "Carter knows Tim.", "Tim knows Trudy." ], "difficulty": 3, "original_distance": 8, "idx_to_symbol": [ "Hailey", "Connor", "Janet", "Tim", "Emily", "Earle", "Henrietta", "Trudy", "Carter", "Jay", "Stephanie", "Rick", "Cole", "Clement", "Alan", "Harvey", "Shaun", "Abel", "Kamila", "Brad" ], "edges": [ [ 0, 8 ], [ 2, 9 ], [ 3, 1 ], [ 3, 7 ], [ 4, 6 ], [ 6, 2 ], [ 7, 4 ], [ 8, 3 ], [ 9, 5 ], [ 10, 18 ], [ 12, 19 ], [ 13, 11 ], [ 13, 17 ], [ 14, 16 ], [ 16, 12 ], [ 17, 14 ], [ 18, 13 ], [ 19, 15 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Myrtle knows Malcolm. Gladys knows John. Courtney knows Mindy. Rosemary knows Sylvia. Geraldine knows Neil. Lacey knows Edwin. Geraldine knows Gladys. Juan knows Rosemary. Gladys knows Kendrick. Neil knows Luna. Kendrick knows Zane. Gladys knows Eric. Kendrick knows Courtney. Myrtle knows Juan. Juan knows Gary. Juan knows Kay. Rosemary knows Lacey. Malcolm knows Elton. Which of Gladys and Juan can Geraldine reach?", "answer": "Gladys", "steps": [ "Geraldine knows Gladys." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Geraldine", "Gladys", "Kendrick", "John", "Mindy", "Eric", "Neil", "Zane", "Luna", "Courtney", "Myrtle", "Juan", "Rosemary", "Gary", "Edwin", "Kay", "Malcolm", "Sylvia", "Elton", "Lacey" ], "edges": [ [ 0, 6 ], [ 0, 1 ], [ 1, 3 ], [ 1, 5 ], [ 1, 2 ], [ 2, 7 ], [ 2, 9 ], [ 6, 8 ], [ 9, 4 ], [ 10, 16 ], [ 10, 11 ], [ 11, 13 ], [ 11, 15 ], [ 11, 12 ], [ 12, 17 ], [ 12, 19 ], [ 16, 18 ], [ 19, 14 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Rita knows Olive. Malik knows Reid. Emma knows Theodore. Tara knows Marie. Marie knows Rita. Reid knows Damien. Corey knows Samantha. Samantha knows Malik. Tara knows Nolan. Rita knows Troy. Reid knows Edgar. Samantha knows Emma. Howard knows Tara. Troy knows Kennedy. Nolan knows Vanessa. Edgar knows Elijah. Emma knows Ezra. Nolan knows Adele. Which of Edgar and Troy can Howard reach?", "answer": "Troy", "steps": [ "Howard knows Tara.", "Tara knows Marie.", "Marie knows Rita.", "Rita knows Troy." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Howard", "Rita", "Tara", "Nolan", "Marie", "Vanessa", "Adele", "Olive", "Kennedy", "Troy", "Corey", "Reid", "Samantha", "Emma", "Malik", "Theodore", "Ezra", "Damien", "Elijah", "Edgar" ], "edges": [ [ 0, 2 ], [ 1, 7 ], [ 1, 9 ], [ 2, 3 ], [ 2, 4 ], [ 3, 5 ], [ 3, 6 ], [ 4, 1 ], [ 9, 8 ], [ 10, 12 ], [ 11, 17 ], [ 11, 19 ], [ 12, 13 ], [ 12, 14 ], [ 13, 15 ], [ 13, 16 ], [ 14, 11 ], [ 19, 18 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Raymond knows Marlene. Dylan knows Howard. Sydney knows Demetrius. Lisa knows Dylan. Fisher knows Nadine. Bruce knows Lisa. Cooper knows Jerry. Craig knows Monroe. Marlene knows Fisher. Craig knows Maggie. Lisa knows Sydney. Jerry knows Stephanie. Monroe knows Kent. Maggie knows Khashayar. Malik knows Craig. Stephanie knows Elaine. Howard knows Cooper. Khashayar knows Raymond. Which of Dylan and Maggie can Bruce reach?", "answer": "Dylan", "steps": [ "Bruce knows Lisa.", "Lisa knows Dylan." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Bruce", "Jerry", "Lisa", "Sydney", "Elaine", "Howard", "Stephanie", "Demetrius", "Cooper", "Dylan", "Malik", "Marlene", "Craig", "Monroe", "Nadine", "Khashayar", "Fisher", "Kent", "Raymond", "Maggie" ], "edges": [ [ 0, 2 ], [ 1, 6 ], [ 2, 3 ], [ 2, 9 ], [ 3, 7 ], [ 5, 8 ], [ 6, 4 ], [ 8, 1 ], [ 9, 5 ], [ 10, 12 ], [ 11, 16 ], [ 12, 13 ], [ 12, 19 ], [ 13, 17 ], [ 15, 18 ], [ 16, 14 ], [ 18, 11 ], [ 19, 15 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Jade knows Oscar. Abby knows Clifford. Jade knows Isaac. Jenny knows Monica. Jenny knows Dewey. Homer knows Ernesto. Conner knows Abby. Dewey knows Homer. Abby knows Valerie. Sue knows Conner. Isaac knows Jenny. Clifford knows Kimberly. Essie knows Jonathan. Dewey knows Donald. Clifford knows Essie. Monica knows Rex. Sue knows Yara. Valerie knows Maureen. Which of Clifford and Dewey can Jade reach?", "answer": "Dewey", "steps": [ "Jade knows Isaac.", "Isaac knows Jenny.", "Jenny knows Dewey." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Jade", "Jenny", "Donald", "Isaac", "Homer", "Monica", "Dewey", "Oscar", "Rex", "Ernesto", "Sue", "Abby", "Kimberly", "Conner", "Essie", "Valerie", "Clifford", "Yara", "Maureen", "Jonathan" ], "edges": [ [ 0, 7 ], [ 0, 3 ], [ 1, 5 ], [ 1, 6 ], [ 3, 1 ], [ 4, 9 ], [ 5, 8 ], [ 6, 2 ], [ 6, 4 ], [ 10, 17 ], [ 10, 13 ], [ 11, 15 ], [ 11, 16 ], [ 13, 11 ], [ 14, 19 ], [ 15, 18 ], [ 16, 12 ], [ 16, 14 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Trina knows Martin. Ruby knows Christina. Christina knows Ariel. Enrique knows Celia. Enrique knows Arnold. Jermaine knows Andre. Arnold knows Tonya. Malik knows Enrique. Eric knows Edwin. Christina knows Tara. Ariel knows Eric. Kenneth knows Lynn. Tonya knows Cornelius. Dolly knows Pat. Tara knows Jermaine. Cornelius knows Trina. Celia knows Kenneth. Andre knows Dolly. Which of Trina and Dolly can Malik reach?", "answer": "Trina", "steps": [ "Malik knows Enrique.", "Enrique knows Arnold.", "Arnold knows Tonya.", "Tonya knows Cornelius.", "Cornelius knows Trina." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Malik", "Lynn", "Celia", "Kenneth", "Cornelius", "Arnold", "Enrique", "Trina", "Martin", "Tonya", "Ruby", "Edwin", "Ariel", "Eric", "Andre", "Tara", "Christina", "Dolly", "Pat", "Jermaine" ], "edges": [ [ 0, 6 ], [ 2, 3 ], [ 3, 1 ], [ 4, 7 ], [ 5, 9 ], [ 6, 2 ], [ 6, 5 ], [ 7, 8 ], [ 9, 4 ], [ 10, 16 ], [ 12, 13 ], [ 13, 11 ], [ 14, 17 ], [ 15, 19 ], [ 16, 12 ], [ 16, 15 ], [ 17, 18 ], [ 19, 14 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Beau knows Kane. Greta knows Cornelius. Garrison knows Aiden. Greta knows Isadora. Constance knows Xander. Kane knows Constance. Garrison knows Knox. Irma knows Antonio. Knox knows Marco. Jim knows Cyrus. Cornelius knows Irma. Jim knows Cristina. Marco knows Beau. Antonio knows Jim. Kane knows Archie. Greta knows Lamont. Cristina knows Parker. Garrison knows Karina. Which of Marco and Irma can Garrison reach?", "answer": "Marco", "steps": [ "Garrison knows Knox.", "Knox knows Marco." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Garrison", "Constance", "Karina", "Knox", "Kane", "Xander", "Aiden", "Marco", "Beau", "Archie", "Greta", "Cristina", "Isadora", "Cornelius", "Jim", "Parker", "Lamont", "Irma", "Antonio", "Cyrus" ], "edges": [ [ 0, 2 ], [ 0, 6 ], [ 0, 3 ], [ 1, 5 ], [ 3, 7 ], [ 4, 1 ], [ 4, 9 ], [ 7, 8 ], [ 8, 4 ], [ 10, 12 ], [ 10, 16 ], [ 10, 13 ], [ 11, 15 ], [ 13, 17 ], [ 14, 11 ], [ 14, 19 ], [ 17, 18 ], [ 18, 14 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Alice knows Simon. Kylie knows Glen. Simon knows Kevin. Ellen knows Fernando. Alice knows Tom. Kylie knows Roland. Kylie knows Alexa. Roland knows Dennis. Alice knows Ellen. Glen knows Jessica. Autumn knows Catherine. Maya knows Rhonda. Rhonda knows Giselle. Maya knows Kylie. Catherine knows Denise. Autumn knows Alice. Glen knows Raymond. Simon knows Ashton. Which of Kylie and Alice can Autumn reach?", "answer": "Alice", "steps": [ "Autumn knows Alice." ], "difficulty": 1, "original_distance": 3, "idx_to_symbol": [ "Autumn", "Ellen", "Alice", "Catherine", "Denise", "Fernando", "Ashton", "Tom", "Simon", "Kevin", "Maya", "Roland", "Kylie", "Rhonda", "Giselle", "Dennis", "Raymond", "Alexa", "Glen", "Jessica" ], "edges": [ [ 0, 3 ], [ 0, 2 ], [ 1, 5 ], [ 2, 1 ], [ 2, 7 ], [ 2, 8 ], [ 3, 4 ], [ 8, 6 ], [ 8, 9 ], [ 10, 13 ], [ 10, 12 ], [ 11, 15 ], [ 12, 11 ], [ 12, 17 ], [ 12, 18 ], [ 13, 14 ], [ 18, 16 ], [ 18, 19 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Faye knows Mack. Ramona knows Eamon. Aisha knows Frankie. Hampton knows Jonathan. Frankie knows Roman. Olive knows Kirk. Kirk knows Ramona. Ted knows Sebastian. Olive knows Jerry. Frankie knows Hampton. Aisha knows Val. Faye knows Olive. Sebastian knows Aisha. Katrina knows Faye. Jonathan knows Ford. Ramona knows Rosa. Jonathan knows Percy. Emanuel knows Katrina. Which of Katrina and Sebastian can Emanuel reach?", "answer": "Katrina", "steps": [ "Emanuel knows Katrina." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Emanuel", "Katrina", "Ramona", "Jerry", "Mack", "Kirk", "Rosa", "Eamon", "Olive", "Faye", "Ted", "Sebastian", "Jonathan", "Roman", "Val", "Hampton", "Ford", "Percy", "Frankie", "Aisha" ], "edges": [ [ 0, 1 ], [ 1, 9 ], [ 2, 6 ], [ 2, 7 ], [ 5, 2 ], [ 8, 3 ], [ 8, 5 ], [ 9, 4 ], [ 9, 8 ], [ 10, 11 ], [ 11, 19 ], [ 12, 16 ], [ 12, 17 ], [ 15, 12 ], [ 18, 13 ], [ 18, 15 ], [ 19, 14 ], [ 19, 18 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Miranda knows Stella. Keaton knows Lena. Wilson knows Estella. Francesca knows Hank. Marion knows Miranda. Lena knows Wilson. Gary knows Ben. Marion knows Joyce. Francesca knows Leroy. Gary knows Atlas. Ben knows Evan. Wilson knows Marion. Joyce knows Iris. Hank knows Samuel. Keaton knows Jenna. Samuel knows Gary. Atlas knows Cara. Samuel knows Luz. Which of Cara and Iris can Francesca reach?", "answer": "Cara", "steps": [ "Francesca knows Hank.", "Hank knows Samuel.", "Samuel knows Gary.", "Gary knows Atlas.", "Atlas knows Cara." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Francesca", "Cara", "Ben", "Evan", "Hank", "Luz", "Atlas", "Samuel", "Leroy", "Gary", "Keaton", "Iris", "Miranda", "Stella", "Lena", "Estella", "Joyce", "Wilson", "Jenna", "Marion" ], "edges": [ [ 0, 8 ], [ 0, 4 ], [ 2, 3 ], [ 4, 7 ], [ 6, 1 ], [ 7, 5 ], [ 7, 9 ], [ 9, 2 ], [ 9, 6 ], [ 10, 18 ], [ 10, 14 ], [ 12, 13 ], [ 14, 17 ], [ 16, 11 ], [ 17, 15 ], [ 17, 19 ], [ 19, 12 ], [ 19, 16 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Liam knows Eleanor. Gilbert knows Milton. Xander knows India. Tracy knows Liam. Gilbert knows Harvey. Jesse knows Brooke. Evan knows Carlton. Nolan knows Sheryl. Harvey knows Chance. Evan knows Noah. Brooke knows Nolan. Liam knows Fisher. Milton knows Tracy. Evan knows Arden. Alejandro knows Gilbert. Sheryl knows Evan. Liam knows Pat. Brooke knows Xander. Which of Liam and Evan can Alejandro reach?", "answer": "Liam", "steps": [ "Alejandro knows Gilbert.", "Gilbert knows Milton.", "Milton knows Tracy.", "Tracy knows Liam." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Alejandro", "Gilbert", "Liam", "Pat", "Eleanor", "Chance", "Milton", "Harvey", "Tracy", "Fisher", "Jesse", "Brooke", "Evan", "Noah", "Arden", "India", "Nolan", "Xander", "Sheryl", "Carlton" ], "edges": [ [ 0, 1 ], [ 1, 7 ], [ 1, 6 ], [ 2, 3 ], [ 2, 4 ], [ 2, 9 ], [ 6, 8 ], [ 7, 5 ], [ 8, 2 ], [ 10, 11 ], [ 11, 17 ], [ 11, 16 ], [ 12, 13 ], [ 12, 14 ], [ 12, 19 ], [ 16, 18 ], [ 17, 15 ], [ 18, 12 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Whitney knows Giselle. Preston knows Bonnie. Laura knows Jakob. Whitney knows Rick. Zara knows Benjamin. William knows Kirsten. Hilda knows Whitney. Benjamin knows Dixie. Bailey knows Hilda. Laura knows Erica. William knows Maureen. Griffith knows Zara. Laura knows Lorenzo. Zara knows Laura. Hilda knows William. Jakob knows Alice. Benjamin knows Elizabeth. Whitney knows Preston. Which of Preston and Jakob can Bailey reach?", "answer": "Preston", "steps": [ "Bailey knows Hilda.", "Hilda knows Whitney.", "Whitney knows Preston." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Bailey", "William", "Maureen", "Whitney", "Kirsten", "Bonnie", "Giselle", "Rick", "Hilda", "Preston", "Griffith", "Benjamin", "Elizabeth", "Laura", "Dixie", "Alice", "Lorenzo", "Erica", "Zara", "Jakob" ], "edges": [ [ 0, 8 ], [ 1, 2 ], [ 1, 4 ], [ 3, 6 ], [ 3, 7 ], [ 3, 9 ], [ 8, 1 ], [ 8, 3 ], [ 9, 5 ], [ 10, 18 ], [ 11, 12 ], [ 11, 14 ], [ 13, 16 ], [ 13, 17 ], [ 13, 19 ], [ 18, 11 ], [ 18, 13 ], [ 19, 15 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Tony knows Kamila. Kamila knows Lamar. Brynn knows Zach. Ralph knows Edison. Sybil knows Joanna. Olive knows Tony. Kamila knows Wayne. Zach knows Cliff. Dalton knows Carrie. Edison knows Mae. Zach knows Dalton. Pam knows Gloria. Mae knows Brynn. Arlene knows Olive. Jason knows Pam. Lamar knows Jason. Fabian knows Arlene. Carrie knows Sybil. Which of Sybil and Pam can Ralph reach?", "answer": "Sybil", "steps": [ "Ralph knows Edison.", "Edison knows Mae.", "Mae knows Brynn.", "Brynn knows Zach.", "Zach knows Dalton.", "Dalton knows Carrie.", "Carrie knows Sybil." ], "difficulty": 7, "original_distance": 8, "idx_to_symbol": [ "Ralph", "Joanna", "Zach", "Cliff", "Sybil", "Mae", "Carrie", "Dalton", "Brynn", "Edison", "Fabian", "Gloria", "Kamila", "Wayne", "Pam", "Olive", "Jason", "Lamar", "Tony", "Arlene" ], "edges": [ [ 0, 9 ], [ 2, 3 ], [ 2, 7 ], [ 4, 1 ], [ 5, 8 ], [ 6, 4 ], [ 7, 6 ], [ 8, 2 ], [ 9, 5 ], [ 10, 19 ], [ 12, 13 ], [ 12, 17 ], [ 14, 11 ], [ 15, 18 ], [ 16, 14 ], [ 17, 16 ], [ 18, 12 ], [ 19, 15 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Opal knows Bart. Duncan knows June. Dina knows Linda. Bart knows Samantha. Linda knows Ava. Gloria knows Stacy. Cecilia knows Natalie. Tristan knows Jacqueline. Duncan knows Lana. Stephen knows Opal. Stephen knows Gina. June knows Sharon. Opal knows Cecilia. Ava knows Garrison. Bart knows Gloria. Dina knows Duncan. Natalie knows Colby. Tristan knows Dina. Which of Dina and Opal can Stephen reach?", "answer": "Opal", "steps": [ "Stephen knows Opal." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Stephen", "Colby", "Gloria", "Natalie", "Opal", "Bart", "Stacy", "Cecilia", "Gina", "Samantha", "Tristan", "Garrison", "June", "Ava", "Dina", "Duncan", "Sharon", "Linda", "Jacqueline", "Lana" ], "edges": [ [ 0, 8 ], [ 0, 4 ], [ 2, 6 ], [ 3, 1 ], [ 4, 7 ], [ 4, 5 ], [ 5, 2 ], [ 5, 9 ], [ 7, 3 ], [ 10, 18 ], [ 10, 14 ], [ 12, 16 ], [ 13, 11 ], [ 14, 17 ], [ 14, 15 ], [ 15, 12 ], [ 15, 19 ], [ 17, 13 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Cynthia knows Fisher. Zane knows Milo. Blanche knows Zane. Ernest knows Jewel. Shane knows Ernest. Dawn knows Shelly. Dawn knows Shane. Fisher knows Pedro. Pedro knows Joseph. Shelly knows Troy. Ariana knows Lloyd. Fisher knows Fern. Joseph knows Ruth. Lance knows Ariana. Lloyd knows Molly. Jewel knows Hector. Pedro knows Lance. Zane knows Dawn. Which of Ariana and Ernest can Cynthia reach?", "answer": "Ariana", "steps": [ "Cynthia knows Fisher.", "Fisher knows Pedro.", "Pedro knows Lance.", "Lance knows Ariana." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Cynthia", "Pedro", "Joseph", "Fisher", "Lance", "Ruth", "Lloyd", "Fern", "Ariana", "Molly", "Blanche", "Dawn", "Shelly", "Zane", "Shane", "Troy", "Jewel", "Milo", "Ernest", "Hector" ], "edges": [ [ 0, 3 ], [ 1, 2 ], [ 1, 4 ], [ 2, 5 ], [ 3, 7 ], [ 3, 1 ], [ 4, 8 ], [ 6, 9 ], [ 8, 6 ], [ 10, 13 ], [ 11, 12 ], [ 11, 14 ], [ 12, 15 ], [ 13, 17 ], [ 13, 11 ], [ 14, 18 ], [ 16, 19 ], [ 18, 16 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Miranda knows Stella. Keaton knows Lena. Wilson knows Estella. Francesca knows Hank. Marion knows Miranda. Lena knows Wilson. Gary knows Ben. Marion knows Joyce. Francesca knows Leroy. Gary knows Atlas. Ben knows Evan. Wilson knows Marion. Joyce knows Iris. Hank knows Samuel. Keaton knows Jenna. Samuel knows Gary. Atlas knows Cara. Samuel knows Luz. Which of Hank and Lena can Francesca reach?", "answer": "Hank", "steps": [ "Francesca knows Hank." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Francesca", "Cara", "Ben", "Evan", "Hank", "Luz", "Atlas", "Samuel", "Leroy", "Gary", "Keaton", "Iris", "Miranda", "Stella", "Lena", "Estella", "Joyce", "Wilson", "Jenna", "Marion" ], "edges": [ [ 0, 8 ], [ 0, 4 ], [ 2, 3 ], [ 4, 7 ], [ 6, 1 ], [ 7, 5 ], [ 7, 9 ], [ 9, 2 ], [ 9, 6 ], [ 10, 18 ], [ 10, 14 ], [ 12, 13 ], [ 14, 17 ], [ 16, 11 ], [ 17, 15 ], [ 17, 19 ], [ 19, 12 ], [ 19, 16 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Daria knows Amanda. Joel knows Kevin. Otto knows Ibrahim. Jeffery knows Adelaide. Latoya knows Shaun. Amanda knows Esperanza. Brad knows Vera. Tiffany knows Crystal. Ava knows Latoya. Kevin knows Otto. Otto knows Ava. Esperanza knows Jeffery. Vera knows Tiffany. Esperanza knows Donna. Shaun knows Jenny. Dixie knows Conner. Tiffany knows Daria. Shaun knows Dixie. Which of Latoya and Amanda can Joel reach?", "answer": "Latoya", "steps": [ "Joel knows Kevin.", "Kevin knows Otto.", "Otto knows Ava.", "Ava knows Latoya." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Joel", "Otto", "Dixie", "Kevin", "Shaun", "Latoya", "Conner", "Jenny", "Ibrahim", "Ava", "Brad", "Tiffany", "Jeffery", "Vera", "Esperanza", "Amanda", "Adelaide", "Donna", "Crystal", "Daria" ], "edges": [ [ 0, 3 ], [ 1, 8 ], [ 1, 9 ], [ 2, 6 ], [ 3, 1 ], [ 4, 2 ], [ 4, 7 ], [ 5, 4 ], [ 9, 5 ], [ 10, 13 ], [ 11, 18 ], [ 11, 19 ], [ 12, 16 ], [ 13, 11 ], [ 14, 12 ], [ 14, 17 ], [ 15, 14 ], [ 19, 15 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Brent knows Cruz. Bella knows Pat. Darla knows Brent. Shaun knows Eleanor. Eleanor knows Parker. Parker knows Vera. Mitchell knows Marion. Boyd knows Todd. Cruz knows Rose. Marion knows Leonard. Darla knows Sam. Rose knows Garland. Todd knows Neil. Bella knows Boyd. Shaun knows Katherine. Garland knows Mitchell. Neil knows Shaun. Garland knows Brian. Which of Shaun and Garland can Darla reach?", "answer": "Garland", "steps": [ "Darla knows Brent.", "Brent knows Cruz.", "Cruz knows Rose.", "Rose knows Garland." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Darla", "Mitchell", "Leonard", "Marion", "Brian", "Cruz", "Brent", "Rose", "Garland", "Sam", "Bella", "Eleanor", "Vera", "Parker", "Katherine", "Todd", "Boyd", "Neil", "Shaun", "Pat" ], "edges": [ [ 0, 6 ], [ 0, 9 ], [ 1, 3 ], [ 3, 2 ], [ 5, 7 ], [ 6, 5 ], [ 7, 8 ], [ 8, 1 ], [ 8, 4 ], [ 10, 16 ], [ 10, 19 ], [ 11, 13 ], [ 13, 12 ], [ 15, 17 ], [ 16, 15 ], [ 17, 18 ], [ 18, 11 ], [ 18, 14 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Jeffery knows Enrique. Aubrey knows Benjamin. Dane knows Aubrey. Keith knows Abel. Abel knows Louisa. Wendy knows Freya. Devon knows Dane. Keith knows Graeme. Aubrey knows Wendy. Benjamin knows Sheila. Aubrey knows Simon. Kylie knows Albert. Wendy knows Julian. Abel knows Karina. Sheila knows Kira. Albert knows Marlene. Enrique knows Keith. Keith knows Kylie. Which of Enrique and Dane can Jeffery reach?", "answer": "Enrique", "steps": [ "Jeffery knows Enrique." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Jeffery", "Graeme", "Enrique", "Abel", "Albert", "Kylie", "Karina", "Marlene", "Louisa", "Keith", "Devon", "Simon", "Dane", "Wendy", "Sheila", "Benjamin", "Freya", "Kira", "Julian", "Aubrey" ], "edges": [ [ 0, 2 ], [ 2, 9 ], [ 3, 6 ], [ 3, 8 ], [ 4, 7 ], [ 5, 4 ], [ 9, 1 ], [ 9, 5 ], [ 9, 3 ], [ 10, 12 ], [ 12, 19 ], [ 13, 16 ], [ 13, 18 ], [ 14, 17 ], [ 15, 14 ], [ 19, 11 ], [ 19, 15 ], [ 19, 13 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Reed knows Humphrey. Itzel knows Theodore. Itzel knows Malik. Dakota knows Angelica. Cara knows Camden. Malik knows Melissa. Forrest knows Harris. Itzel knows Forrest. Reed knows Alana. Cara knows Reed. Cara knows Dakota. Reed knows Marc. Forrest knows Cecilia. Malik knows Vivian. Dakota knows Viola. Viola knows Laura. Forrest knows Jillian. Vivian knows Elvira. Which of Elvira and Laura can Cara reach?", "answer": "Laura", "steps": [ "Cara knows Dakota.", "Dakota knows Viola.", "Viola knows Laura." ], "difficulty": 3, "original_distance": 3, "idx_to_symbol": [ "Cara", "Humphrey", "Alana", "Viola", "Camden", "Marc", "Laura", "Angelica", "Reed", "Dakota", "Itzel", "Jillian", "Cecilia", "Vivian", "Theodore", "Harris", "Elvira", "Melissa", "Forrest", "Malik" ], "edges": [ [ 0, 4 ], [ 0, 8 ], [ 0, 9 ], [ 3, 6 ], [ 8, 1 ], [ 8, 2 ], [ 8, 5 ], [ 9, 3 ], [ 9, 7 ], [ 10, 14 ], [ 10, 18 ], [ 10, 19 ], [ 13, 16 ], [ 18, 11 ], [ 18, 12 ], [ 18, 15 ], [ 19, 13 ], [ 19, 17 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Jenny knows Edwin. Whitney knows Ivan. Walt knows Elodie. Kirsten knows Jenny. Kirsten knows Luz. Walt knows Lacey. Luz knows Stuart. Whitney knows Clarence. Joy knows Whitney. Camille knows Ember. Ember knows Duke. Walt knows Camille. Edwin knows Julius. Lacey knows Robin. Robin knows Edmund. Elodie knows Louis. Robin knows Eduardo. Kirsten knows Joy. Which of Lacey and Joy can Walt reach?", "answer": "Lacey", "steps": [ "Walt knows Lacey." ], "difficulty": 1, "original_distance": 3, "idx_to_symbol": [ "Walt", "Eduardo", "Edmund", "Camille", "Elodie", "Louis", "Duke", "Lacey", "Ember", "Robin", "Kirsten", "Ivan", "Clarence", "Jenny", "Luz", "Stuart", "Julius", "Joy", "Edwin", "Whitney" ], "edges": [ [ 0, 4 ], [ 0, 3 ], [ 0, 7 ], [ 3, 8 ], [ 4, 5 ], [ 7, 9 ], [ 8, 6 ], [ 9, 1 ], [ 9, 2 ], [ 10, 14 ], [ 10, 13 ], [ 10, 17 ], [ 13, 18 ], [ 14, 15 ], [ 17, 19 ], [ 18, 16 ], [ 19, 11 ], [ 19, 12 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Priscilla knows Julius. Brooks knows Ted. Daisy knows Haven. Viola knows Guy. Davis knows Reed. Guy knows Jamie. Bruce knows Lacey. Grant knows Grace. Julia knows Ibrahim. Lara knows Julia. Viola knows Dakota. Grace knows Daisy. Brooks knows Priscilla. Ted knows Cecilia. Priscilla knows Davis. Ibrahim knows Brooks. Lacey knows Grant. Grace knows Viola. Which of Ibrahim and Grant can Lara reach?", "answer": "Ibrahim", "steps": [ "Lara knows Julia.", "Julia knows Ibrahim." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Lara", "Ted", "Julia", "Brooks", "Reed", "Priscilla", "Julius", "Cecilia", "Ibrahim", "Davis", "Bruce", "Daisy", "Lacey", "Grace", "Jamie", "Viola", "Dakota", "Haven", "Grant", "Guy" ], "edges": [ [ 0, 2 ], [ 1, 7 ], [ 2, 8 ], [ 3, 1 ], [ 3, 5 ], [ 5, 6 ], [ 5, 9 ], [ 8, 3 ], [ 9, 4 ], [ 10, 12 ], [ 11, 17 ], [ 12, 18 ], [ 13, 11 ], [ 13, 15 ], [ 15, 16 ], [ 15, 19 ], [ 18, 13 ], [ 19, 14 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Tony knows Kamila. Kamila knows Lamar. Brynn knows Zach. Ralph knows Edison. Sybil knows Joanna. Olive knows Tony. Kamila knows Wayne. Zach knows Cliff. Dalton knows Carrie. Edison knows Mae. Zach knows Dalton. Pam knows Gloria. Mae knows Brynn. Arlene knows Olive. Jason knows Pam. Lamar knows Jason. Fabian knows Arlene. Carrie knows Sybil. Which of Zach and Kamila can Ralph reach?", "answer": "Zach", "steps": [ "Ralph knows Edison.", "Edison knows Mae.", "Mae knows Brynn.", "Brynn knows Zach." ], "difficulty": 4, "original_distance": 8, "idx_to_symbol": [ "Ralph", "Joanna", "Zach", "Cliff", "Sybil", "Mae", "Carrie", "Dalton", "Brynn", "Edison", "Fabian", "Gloria", "Kamila", "Wayne", "Pam", "Olive", "Jason", "Lamar", "Tony", "Arlene" ], "edges": [ [ 0, 9 ], [ 2, 3 ], [ 2, 7 ], [ 4, 1 ], [ 5, 8 ], [ 6, 4 ], [ 7, 6 ], [ 8, 2 ], [ 9, 5 ], [ 10, 19 ], [ 12, 13 ], [ 12, 17 ], [ 14, 11 ], [ 15, 18 ], [ 16, 14 ], [ 17, 16 ], [ 18, 12 ], [ 19, 15 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Hannah knows Clarissa. Terrence knows Amelia. Dawn knows Norma. Estella knows Eldon. Amelia knows Livia. Livia knows Daphna. Will knows Elise. Clarissa knows Estella. Hannah knows Arnold. Norma knows Jennifer. Jennifer knows Hannah. Jennifer knows Bernard. Amelia knows Marco. Livia knows Olivia. Olivia knows Marion. Olivia knows Karla. Marion knows Will. Norma knows Marvin. Which of Elise and Eldon can Terrence reach?", "answer": "Elise", "steps": [ "Terrence knows Amelia.", "Amelia knows Livia.", "Livia knows Olivia.", "Olivia knows Marion.", "Marion knows Will.", "Will knows Elise." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Terrence", "Marion", "Olivia", "Will", "Marco", "Amelia", "Daphna", "Karla", "Elise", "Livia", "Dawn", "Clarissa", "Hannah", "Estella", "Marvin", "Norma", "Bernard", "Arnold", "Eldon", "Jennifer" ], "edges": [ [ 0, 5 ], [ 1, 3 ], [ 2, 7 ], [ 2, 1 ], [ 3, 8 ], [ 5, 4 ], [ 5, 9 ], [ 9, 6 ], [ 9, 2 ], [ 10, 15 ], [ 11, 13 ], [ 12, 17 ], [ 12, 11 ], [ 13, 18 ], [ 15, 14 ], [ 15, 19 ], [ 19, 16 ], [ 19, 12 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Judith knows Lillian. Kendra knows Dora. Dudley knows Judith. Darcy knows Hector. Lance knows Kendra. Declan knows Jem. Ford knows Giselle. Chelsea knows Ford. Mike knows Kim. Kendra knows Chelsea. Kim knows Lance. Russell knows Mike. Declan knows Dudley. Jon knows Darcy. Kim knows Patricia. Judith knows Jon. Paula knows Elias. Elias knows Declan. Which of Elias and Mike can Russell reach?", "answer": "Mike", "steps": [ "Russell knows Mike." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Russell", "Lance", "Kendra", "Ford", "Patricia", "Dora", "Mike", "Kim", "Giselle", "Chelsea", "Paula", "Dudley", "Judith", "Darcy", "Jem", "Lillian", "Elias", "Declan", "Hector", "Jon" ], "edges": [ [ 0, 6 ], [ 1, 2 ], [ 2, 5 ], [ 2, 9 ], [ 3, 8 ], [ 6, 7 ], [ 7, 4 ], [ 7, 1 ], [ 9, 3 ], [ 10, 16 ], [ 11, 12 ], [ 12, 15 ], [ 12, 19 ], [ 13, 18 ], [ 16, 17 ], [ 17, 14 ], [ 17, 11 ], [ 19, 13 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Drake knows Kai. Dante knows Tessa. Lennox knows Christian. Wendell knows Dante. Sylvia knows Drake. Drake knows Felicia. Sylvia knows Hayley. Christina knows Stephen. Wendell knows Barbara. Louise knows Fraser. Drake knows Rebecca. Wendell knows Ellis. Barbara knows Christina. Victor knows Wendell. Wendell knows Gary. Kai knows Lennox. Drake knows Louise. Victor knows Jim. Which of Kai and Barbara can Sylvia reach?", "answer": "Kai", "steps": [ "Sylvia knows Drake.", "Drake knows Kai." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Sylvia", "Louise", "Drake", "Kai", "Hayley", "Christian", "Lennox", "Felicia", "Fraser", "Rebecca", "Victor", "Dante", "Wendell", "Barbara", "Jim", "Stephen", "Christina", "Gary", "Tessa", "Ellis" ], "edges": [ [ 0, 4 ], [ 0, 2 ], [ 1, 8 ], [ 2, 3 ], [ 2, 7 ], [ 2, 1 ], [ 2, 9 ], [ 3, 6 ], [ 6, 5 ], [ 10, 14 ], [ 10, 12 ], [ 11, 18 ], [ 12, 13 ], [ 12, 17 ], [ 12, 11 ], [ 12, 19 ], [ 13, 16 ], [ 16, 15 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Nora knows Cindy. Reed knows Caleb. Conner knows Lucy. Curtis knows Natalie. Eamon knows Reed. Conner knows Gerard. Curtis knows Max. Richard knows Jose. Eamon knows Hamilton. Perry knows Nora. Dell knows Randall. Nora knows Mabel. Natalie knows Ruby. Cindy knows Curtis. Randall knows Conner. Arnold knows Dell. Lucy knows Eamon. Jose knows Perry. Which of Eamon and Curtis can Richard reach?", "answer": "Curtis", "steps": [ "Richard knows Jose.", "Jose knows Perry.", "Perry knows Nora.", "Nora knows Cindy.", "Cindy knows Curtis." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Richard", "Ruby", "Mabel", "Cindy", "Max", "Natalie", "Jose", "Curtis", "Perry", "Nora", "Arnold", "Caleb", "Gerard", "Lucy", "Hamilton", "Reed", "Dell", "Eamon", "Randall", "Conner" ], "edges": [ [ 0, 6 ], [ 3, 7 ], [ 5, 1 ], [ 6, 8 ], [ 7, 4 ], [ 7, 5 ], [ 8, 9 ], [ 9, 2 ], [ 9, 3 ], [ 10, 16 ], [ 13, 17 ], [ 15, 11 ], [ 16, 18 ], [ 17, 14 ], [ 17, 15 ], [ 18, 19 ], [ 19, 12 ], [ 19, 13 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Arthur knows Elvira. Karen knows Earl. Kennedy knows Arthur. Zachary knows India. Karen knows Derrick. Electra knows Ruth. Derrick knows Liam. Karen knows Mildred. Leslie knows Jonah. Camille knows Taylor. Earl knows Clay. Clay knows Electra. Leslie knows Kennedy. Leslie knows Zachary. India knows Cole. Jonah knows Alison. Mildred knows Camille. Cole knows Claude. Which of Clay and India can Leslie reach?", "answer": "India", "steps": [ "Leslie knows Zachary.", "Zachary knows India." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Leslie", "Alison", "Zachary", "Elvira", "India", "Cole", "Kennedy", "Claude", "Jonah", "Arthur", "Karen", "Liam", "Earl", "Taylor", "Clay", "Electra", "Mildred", "Ruth", "Derrick", "Camille" ], "edges": [ [ 0, 2 ], [ 0, 8 ], [ 0, 6 ], [ 2, 4 ], [ 4, 5 ], [ 5, 7 ], [ 6, 9 ], [ 8, 1 ], [ 9, 3 ], [ 10, 12 ], [ 10, 18 ], [ 10, 16 ], [ 12, 14 ], [ 14, 15 ], [ 15, 17 ], [ 16, 19 ], [ 18, 11 ], [ 19, 13 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Sarah knows Natalie. Blake knows Yasmin. Lottie knows Dave. Jenna knows Mildred. Yasmin knows Judith. Declan knows Martha. August knows Patrick. Laura knows Sarah. Dave knows Geraldine. Sarah knows Carson. Patrick knows Lottie. Dean knows Lucia. Kylie knows Laura. Carson knows Declan. Martha knows Dean. Dave knows Blake. Curtis knows Kylie. Judith knows Jenna. Which of Lucia and Mildred can August reach?", "answer": "Mildred", "steps": [ "August knows Patrick.", "Patrick knows Lottie.", "Lottie knows Dave.", "Dave knows Blake.", "Blake knows Yasmin.", "Yasmin knows Judith.", "Judith knows Jenna.", "Jenna knows Mildred." ], "difficulty": 8, "original_distance": 8, "idx_to_symbol": [ "August", "Blake", "Judith", "Geraldine", "Dave", "Lottie", "Mildred", "Jenna", "Yasmin", "Patrick", "Curtis", "Carson", "Martha", "Natalie", "Sarah", "Laura", "Lucia", "Dean", "Declan", "Kylie" ], "edges": [ [ 0, 9 ], [ 1, 8 ], [ 2, 7 ], [ 4, 3 ], [ 4, 1 ], [ 5, 4 ], [ 7, 6 ], [ 8, 2 ], [ 9, 5 ], [ 10, 19 ], [ 11, 18 ], [ 12, 17 ], [ 14, 13 ], [ 14, 11 ], [ 15, 14 ], [ 17, 16 ], [ 18, 12 ], [ 19, 15 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Jose knows Ross. Layla knows Clyde. Corinne knows Julia. Lars knows Jose. Dahlia knows Melissa. Yuki knows Lars. Tessa knows Dahlia. Lars knows Layla. Curtis knows Isla. Amelia knows Tessa. Julia knows Yolanda. Ross knows Carlos. Carlos knows Corinne. Isla knows Amanda. Lamar knows Curtis. Brandon knows Clement. Melissa knows Brandon. Curtis knows Amelia. Which of Curtis and Lars can Yuki reach?", "answer": "Lars", "steps": [ "Yuki knows Lars." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Yuki", "Carlos", "Julia", "Ross", "Lars", "Yolanda", "Corinne", "Jose", "Clyde", "Layla", "Lamar", "Dahlia", "Brandon", "Tessa", "Curtis", "Clement", "Melissa", "Amelia", "Amanda", "Isla" ], "edges": [ [ 0, 4 ], [ 1, 6 ], [ 2, 5 ], [ 3, 1 ], [ 4, 7 ], [ 4, 9 ], [ 6, 2 ], [ 7, 3 ], [ 9, 8 ], [ 10, 14 ], [ 11, 16 ], [ 12, 15 ], [ 13, 11 ], [ 14, 17 ], [ 14, 19 ], [ 16, 12 ], [ 17, 13 ], [ 19, 18 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Clark knows Arlene. Lambert knows Isadora. Hayes knows Deanna. Trudy knows Monica. Livia knows Lamont. Alan knows Livia. Trudy knows Hayes. Lamont knows Lionel. William knows Lambert. Lionel knows Trudy. William knows Liam. Sebastian knows William. Kendrick knows Sebastian. Lambert knows Hudson. Alan knows Phoebe. Arlene knows Kendrick. Hayes knows Brandon. Clark knows India. Which of Lamont and Kendrick can Clark reach?", "answer": "Kendrick", "steps": [ "Clark knows Arlene.", "Arlene knows Kendrick." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Clark", "Liam", "India", "Lambert", "Isadora", "Kendrick", "William", "Hudson", "Arlene", "Sebastian", "Alan", "Monica", "Phoebe", "Hayes", "Deanna", "Lamont", "Trudy", "Brandon", "Livia", "Lionel" ], "edges": [ [ 0, 2 ], [ 0, 8 ], [ 3, 4 ], [ 3, 7 ], [ 5, 9 ], [ 6, 1 ], [ 6, 3 ], [ 8, 5 ], [ 9, 6 ], [ 10, 12 ], [ 10, 18 ], [ 13, 14 ], [ 13, 17 ], [ 15, 19 ], [ 16, 11 ], [ 16, 13 ], [ 18, 15 ], [ 19, 16 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Dean knows Geneva. Grant knows Tanya. Destiny knows Alyson. Annie knows Dustin. Tanya knows Ford. Paula knows Rachel. Randy knows Delilah. Destiny knows Melody. Ford knows Paul. Dina knows Grant. Luis knows Annie. Rachel knows Randy. Dina knows Gregory. Randy knows Christopher. Ford knows Norma. Annie knows Paula. Melody knows Dina. Dean knows Luis. Which of Randy and Ford can Destiny reach?", "answer": "Ford", "steps": [ "Destiny knows Melody.", "Melody knows Dina.", "Dina knows Grant.", "Grant knows Tanya.", "Tanya knows Ford." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Destiny", "Ford", "Melody", "Gregory", "Norma", "Paul", "Grant", "Dina", "Alyson", "Tanya", "Dean", "Randy", "Luis", "Dustin", "Delilah", "Christopher", "Paula", "Annie", "Geneva", "Rachel" ], "edges": [ [ 0, 8 ], [ 0, 2 ], [ 1, 4 ], [ 1, 5 ], [ 2, 7 ], [ 6, 9 ], [ 7, 3 ], [ 7, 6 ], [ 9, 1 ], [ 10, 18 ], [ 10, 12 ], [ 11, 14 ], [ 11, 15 ], [ 12, 17 ], [ 16, 19 ], [ 17, 13 ], [ 17, 16 ], [ 19, 11 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Charlotte knows Archie. Abby knows Callum. Derrick knows Claire. Rose knows Virginia. Callum knows Linda. Ralph knows Abby. Joseph knows Ronald. Linda knows Irving. Rita knows Lucille. Ronald knows Derrick. Charlotte knows Henry. Derrick knows Rose. Irving knows Charlotte. Irving knows Brandon. Rose knows Connor. Charlotte knows Ainsley. Lucille knows Joseph. Rose knows Lilia. Which of Joseph and Callum can Ralph reach?", "answer": "Callum", "steps": [ "Ralph knows Abby.", "Abby knows Callum." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Ralph", "Ainsley", "Charlotte", "Callum", "Irving", "Archie", "Henry", "Linda", "Abby", "Brandon", "Rita", "Virginia", "Rose", "Joseph", "Derrick", "Connor", "Lilia", "Ronald", "Lucille", "Claire" ], "edges": [ [ 0, 8 ], [ 2, 1 ], [ 2, 5 ], [ 2, 6 ], [ 3, 7 ], [ 4, 2 ], [ 4, 9 ], [ 7, 4 ], [ 8, 3 ], [ 10, 18 ], [ 12, 11 ], [ 12, 15 ], [ 12, 16 ], [ 13, 17 ], [ 14, 12 ], [ 14, 19 ], [ 17, 14 ], [ 18, 13 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Ross knows Leah. Wilson knows Alma. Cynthia knows Edgar. Riley knows Cynthia. Helene knows Donovan. Edwin knows Frankie. Donovan knows Donald. Blanche knows Autumn. Alma knows Riley. Edgar knows Keira. Kara knows Blanche. Susanne knows Elmer. Edgar knows Archer. Elmer knows Hope. Hope knows Helene. Leah knows Edwin. Donovan knows Ross. Archer knows Kara. Which of Kara and Leah can Wilson reach?", "answer": "Kara", "steps": [ "Wilson knows Alma.", "Alma knows Riley.", "Riley knows Cynthia.", "Cynthia knows Edgar.", "Edgar knows Archer.", "Archer knows Kara." ], "difficulty": 6, "original_distance": 8, "idx_to_symbol": [ "Wilson", "Riley", "Alma", "Blanche", "Archer", "Kara", "Cynthia", "Keira", "Autumn", "Edgar", "Susanne", "Hope", "Elmer", "Edwin", "Ross", "Leah", "Helene", "Donald", "Frankie", "Donovan" ], "edges": [ [ 0, 2 ], [ 1, 6 ], [ 2, 1 ], [ 3, 8 ], [ 4, 5 ], [ 5, 3 ], [ 6, 9 ], [ 9, 7 ], [ 9, 4 ], [ 10, 12 ], [ 11, 16 ], [ 12, 11 ], [ 13, 18 ], [ 14, 15 ], [ 15, 13 ], [ 16, 19 ], [ 19, 17 ], [ 19, 14 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Edgar knows Julio. Marshall knows Leon. Gonzalo knows Blaine. Alex knows Will. Blaine knows Alex. Leon knows Sally. Dora knows Myra. Andrea knows Paige. Myra knows Kara. Drew knows Edgar. Kara knows Greg. Sally knows Andrea. Terry knows Dora. Andrea knows Gonzalo. Jocelyn knows Edna. Edgar knows Jocelyn. Blaine knows Peter. Kara knows Drew. Which of Jocelyn and Alex can Terry reach?", "answer": "Jocelyn", "steps": [ "Terry knows Dora.", "Dora knows Myra.", "Myra knows Kara.", "Kara knows Drew.", "Drew knows Edgar.", "Edgar knows Jocelyn." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Terry", "Edgar", "Kara", "Edna", "Julio", "Drew", "Jocelyn", "Myra", "Dora", "Greg", "Marshall", "Blaine", "Andrea", "Will", "Peter", "Gonzalo", "Alex", "Sally", "Leon", "Paige" ], "edges": [ [ 0, 8 ], [ 1, 4 ], [ 1, 6 ], [ 2, 5 ], [ 2, 9 ], [ 5, 1 ], [ 6, 3 ], [ 7, 2 ], [ 8, 7 ], [ 10, 18 ], [ 11, 14 ], [ 11, 16 ], [ 12, 15 ], [ 12, 19 ], [ 15, 11 ], [ 16, 13 ], [ 17, 12 ], [ 18, 17 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Boris knows Corinne. Irving knows Gus. Roland knows Riley. Lionel knows Craig. Corinne knows Winifred. Clarence knows Juan. Peter knows Devon. Roland knows Gwen. Devon knows Owen. Willard knows Ariel. Clarence knows Courtney. Roland knows Boris. Irving knows Lionel. Craig knows Jodi. Courtney knows Constance. Craig knows Willard. Irving knows Peter. Riley knows Clarence. Which of Craig and Clarence can Roland reach?", "answer": "Clarence", "steps": [ "Roland knows Riley.", "Riley knows Clarence." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Roland", "Constance", "Boris", "Riley", "Winifred", "Corinne", "Juan", "Clarence", "Courtney", "Gwen", "Irving", "Ariel", "Peter", "Lionel", "Owen", "Devon", "Jodi", "Craig", "Willard", "Gus" ], "edges": [ [ 0, 2 ], [ 0, 3 ], [ 0, 9 ], [ 2, 5 ], [ 3, 7 ], [ 5, 4 ], [ 7, 6 ], [ 7, 8 ], [ 8, 1 ], [ 10, 12 ], [ 10, 13 ], [ 10, 19 ], [ 12, 15 ], [ 13, 17 ], [ 15, 14 ], [ 17, 16 ], [ 17, 18 ], [ 18, 11 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Liam knows Shelby. Harlan knows Esther. Zoe knows Tabitha. Whitney knows Kent. Zoe knows Liam. Whitney knows Joyce. Dale knows Ethan. Kent knows Zoe. Harlan knows Carey. Zoe knows Rocco. Shaun knows Audrey. Carey knows Shaun. Ethan knows Harlan. Harlan knows Spencer. Spencer knows Andrea. Dale knows Celia. Tabitha knows Carrie. Shelby knows Caleb. Which of Caleb and Audrey can Whitney reach?", "answer": "Caleb", "steps": [ "Whitney knows Kent.", "Kent knows Zoe.", "Zoe knows Liam.", "Liam knows Shelby.", "Shelby knows Caleb." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Whitney", "Shelby", "Carrie", "Joyce", "Liam", "Caleb", "Rocco", "Tabitha", "Zoe", "Kent", "Dale", "Shaun", "Andrea", "Celia", "Carey", "Audrey", "Esther", "Spencer", "Harlan", "Ethan" ], "edges": [ [ 0, 3 ], [ 0, 9 ], [ 1, 5 ], [ 4, 1 ], [ 7, 2 ], [ 8, 4 ], [ 8, 6 ], [ 8, 7 ], [ 9, 8 ], [ 10, 13 ], [ 10, 19 ], [ 11, 15 ], [ 14, 11 ], [ 17, 12 ], [ 18, 14 ], [ 18, 16 ], [ 18, 17 ], [ 19, 18 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Andrea knows Zelda. Graham knows Harris. Tony knows Etta. Layla knows Darius. Andrea knows Graham. Pam knows Tiffany. Allen knows Layla. Zara knows Gemma. Tiffany knows Cynthia. Zelda knows Cyrus. Tony knows Andrea. Allen knows Audrey. Cyrus knows Zara. Vernon knows Liam. Cyrus knows Clifford. Tiffany knows Vernon. Pam knows Alice. Cynthia knows Allen. Which of Tiffany and Andrea can Pam reach?", "answer": "Tiffany", "steps": [ "Pam knows Tiffany." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Pam", "Audrey", "Cynthia", "Tiffany", "Alice", "Allen", "Liam", "Darius", "Vernon", "Layla", "Tony", "Clifford", "Zelda", "Andrea", "Etta", "Cyrus", "Harris", "Gemma", "Graham", "Zara" ], "edges": [ [ 0, 4 ], [ 0, 3 ], [ 2, 5 ], [ 3, 8 ], [ 3, 2 ], [ 5, 1 ], [ 5, 9 ], [ 8, 6 ], [ 9, 7 ], [ 10, 14 ], [ 10, 13 ], [ 12, 15 ], [ 13, 18 ], [ 13, 12 ], [ 15, 11 ], [ 15, 19 ], [ 18, 16 ], [ 19, 17 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Elton knows Keira. Gregory knows Fritz. Glen knows Austin. Shaun knows Elton. Keira knows Rocco. Hazel knows Shaun. Blake knows August. Shaun knows Emily. Celeste knows Houston. Barry knows Israel. Rosa knows Celeste. Bennett knows Bob. Gregory knows Blake. Fritz knows Drake. Houston knows Bennett. Bennett knows Gregory. Elton knows Barry. Austin knows Hazel. Which of Hazel and Houston can Glen reach?", "answer": "Hazel", "steps": [ "Glen knows Austin.", "Austin knows Hazel." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Glen", "Hazel", "Austin", "Israel", "Rocco", "Elton", "Shaun", "Barry", "Emily", "Keira", "Rosa", "Houston", "Celeste", "Drake", "August", "Gregory", "Bennett", "Fritz", "Bob", "Blake" ], "edges": [ [ 0, 2 ], [ 1, 6 ], [ 2, 1 ], [ 5, 7 ], [ 5, 9 ], [ 6, 8 ], [ 6, 5 ], [ 7, 3 ], [ 9, 4 ], [ 10, 12 ], [ 11, 16 ], [ 12, 11 ], [ 15, 17 ], [ 15, 19 ], [ 16, 18 ], [ 16, 15 ], [ 17, 13 ], [ 19, 14 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Eldon knows Yvonne. Chris knows Mara. Yvonne knows Imogen. Jessica knows Fraser. Vicki knows Veronica. Alma knows Duke. Zack knows Alma. Elvira knows Anita. Mara knows Celeste. Mara knows Jessica. Yvonne knows Luz. Mara knows Eileen. Mara knows Diane. Veronica knows Gene. Alma knows Chris. Yvonne knows Helen. Veronica knows Eldon. Yvonne knows Elvira. Which of Anita and Fraser can Vicki reach?", "answer": "Anita", "steps": [ "Vicki knows Veronica.", "Veronica knows Eldon.", "Eldon knows Yvonne.", "Yvonne knows Elvira.", "Elvira knows Anita." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Vicki", "Gene", "Luz", "Elvira", "Helen", "Veronica", "Yvonne", "Eldon", "Anita", "Imogen", "Zack", "Duke", "Diane", "Jessica", "Eileen", "Alma", "Mara", "Chris", "Fraser", "Celeste" ], "edges": [ [ 0, 5 ], [ 3, 8 ], [ 5, 1 ], [ 5, 7 ], [ 6, 2 ], [ 6, 4 ], [ 6, 3 ], [ 6, 9 ], [ 7, 6 ], [ 10, 15 ], [ 13, 18 ], [ 15, 11 ], [ 15, 17 ], [ 16, 12 ], [ 16, 14 ], [ 16, 13 ], [ 16, 19 ], [ 17, 16 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Arden knows Jason. Fritz knows Carlton. Fritz knows Clarence. Chad knows Virginia. Jason knows Chad. Dwight knows Dustin. Hugo knows Colby. Clarence knows Eleanor. Dustin knows Vincent. Carlton knows Kingsley. Colby knows Brock. Hugo knows Devon. Vincent knows Arturo. Vincent knows Hugo. Vincent knows Eve. Chad knows Fritz. Devon knows Jasmine. Chad knows Caroline. Which of Brock and Kingsley can Arden reach?", "answer": "Kingsley", "steps": [ "Arden knows Jason.", "Jason knows Chad.", "Chad knows Fritz.", "Fritz knows Carlton.", "Carlton knows Kingsley." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Arden", "Carlton", "Jason", "Caroline", "Eleanor", "Clarence", "Virginia", "Chad", "Kingsley", "Fritz", "Dwight", "Colby", "Dustin", "Eve", "Jasmine", "Devon", "Arturo", "Vincent", "Brock", "Hugo" ], "edges": [ [ 0, 2 ], [ 1, 8 ], [ 2, 7 ], [ 5, 4 ], [ 7, 3 ], [ 7, 6 ], [ 7, 9 ], [ 9, 5 ], [ 9, 1 ], [ 10, 12 ], [ 11, 18 ], [ 12, 17 ], [ 15, 14 ], [ 17, 13 ], [ 17, 16 ], [ 17, 19 ], [ 19, 15 ], [ 19, 11 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Jim knows Jeffery. Darren knows Chloe. Vernon knows Miriam. Vernon knows Ernesto. Vernon knows Marco. Leticia knows Colleen. Leticia knows Kai. Jim knows Alfonso. Abby knows Darren. Abby knows Effie. Belinda knows Frank. Jeffery knows Belinda. Abby knows Marian. Effie knows Vernon. Jim knows Leticia. Belinda knows Megan. Darren knows Jeanne. Belinda knows Ember. Which of Vernon and Belinda can Jim reach?", "answer": "Belinda", "steps": [ "Jim knows Jeffery.", "Jeffery knows Belinda." ], "difficulty": 2, "original_distance": 3, "idx_to_symbol": [ "Jim", "Belinda", "Alfonso", "Megan", "Ember", "Kai", "Colleen", "Jeffery", "Frank", "Leticia", "Abby", "Vernon", "Marian", "Marco", "Ernesto", "Jeanne", "Chloe", "Effie", "Miriam", "Darren" ], "edges": [ [ 0, 2 ], [ 0, 7 ], [ 0, 9 ], [ 1, 3 ], [ 1, 4 ], [ 1, 8 ], [ 7, 1 ], [ 9, 5 ], [ 9, 6 ], [ 10, 12 ], [ 10, 17 ], [ 10, 19 ], [ 11, 13 ], [ 11, 14 ], [ 11, 18 ], [ 17, 11 ], [ 19, 15 ], [ 19, 16 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Jorge knows Willis. Willis knows Gonzalo. Dolores knows Barry. Jorge knows Jocelyn. Grace knows Dane. Dane knows Aurora. Deirdre knows Grace. Lacey knows Jorge. Dolores knows Deirdre. Jeanne knows Iris. Jeanne knows Georgia. Willis knows Jeanne. Grace knows Harris. Deirdre knows Boris. Lacey knows Leah. Dane knows Geoffrey. Barry knows Agnes. Leah knows Donald. Which of Deirdre and Jorge can Dolores reach?", "answer": "Deirdre", "steps": [ "Dolores knows Deirdre." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Dolores", "Dane", "Grace", "Agnes", "Geoffrey", "Barry", "Boris", "Aurora", "Harris", "Deirdre", "Lacey", "Jeanne", "Willis", "Donald", "Georgia", "Leah", "Jocelyn", "Iris", "Gonzalo", "Jorge" ], "edges": [ [ 0, 5 ], [ 0, 9 ], [ 1, 4 ], [ 1, 7 ], [ 2, 1 ], [ 2, 8 ], [ 5, 3 ], [ 9, 6 ], [ 9, 2 ], [ 10, 15 ], [ 10, 19 ], [ 11, 14 ], [ 11, 17 ], [ 12, 11 ], [ 12, 18 ], [ 15, 13 ], [ 19, 16 ], [ 19, 12 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Jim knows Ronald. Elsa knows Jeff. Carmela knows Thomas. Anastasia knows Tara. Jeff knows Olivia. Scott knows Cyrus. Anastasia knows Amanda. Lawson knows Fabian. Jeff knows Scott. Michael knows Luke. Jeff knows Carmela. Amanda knows Enid. Carmela knows Louise. Isla knows Jim. Amanda knows Chase. Ronald knows Anastasia. Anastasia knows Michael. Fabian knows Elsa. Which of Amanda and Carmela can Lawson reach?", "answer": "Carmela", "steps": [ "Lawson knows Fabian.", "Fabian knows Elsa.", "Elsa knows Jeff.", "Jeff knows Carmela." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Lawson", "Elsa", "Thomas", "Fabian", "Jeff", "Cyrus", "Louise", "Carmela", "Scott", "Olivia", "Isla", "Ronald", "Chase", "Jim", "Anastasia", "Luke", "Enid", "Amanda", "Michael", "Tara" ], "edges": [ [ 0, 3 ], [ 1, 4 ], [ 3, 1 ], [ 4, 7 ], [ 4, 8 ], [ 4, 9 ], [ 7, 2 ], [ 7, 6 ], [ 8, 5 ], [ 10, 13 ], [ 11, 14 ], [ 13, 11 ], [ 14, 17 ], [ 14, 18 ], [ 14, 19 ], [ 17, 12 ], [ 17, 16 ], [ 18, 15 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Mildred knows Gabriel. Louise knows Nash. Sharon knows Gustavo. Boris knows Angela. Louise knows Kobe. Corey knows Horace. Boris knows Selena. Gail knows Bryan. Gail knows Gavin. Corey knows Wilbur. Corey knows John. Boris knows Lois. Lars knows Boris. Nash knows Gail. Sharon knows Emmett. Mildred knows Lars. Nash knows Corey. Lars knows Sharon. Which of Nash and Lars can Mildred reach?", "answer": "Lars", "steps": [ "Mildred knows Lars." ], "difficulty": 1, "original_distance": 3, "idx_to_symbol": [ "Mildred", "Angela", "Sharon", "Lars", "Emmett", "Gustavo", "Lois", "Selena", "Boris", "Gabriel", "Louise", "Wilbur", "Gail", "Nash", "Bryan", "Gavin", "John", "Horace", "Corey", "Kobe" ], "edges": [ [ 0, 3 ], [ 0, 9 ], [ 2, 4 ], [ 2, 5 ], [ 3, 2 ], [ 3, 8 ], [ 8, 1 ], [ 8, 6 ], [ 8, 7 ], [ 10, 13 ], [ 10, 19 ], [ 12, 14 ], [ 12, 15 ], [ 13, 12 ], [ 13, 18 ], [ 18, 11 ], [ 18, 16 ], [ 18, 17 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Stuart knows Ryan. Clark knows Colby. Adam knows Jarvis. Stuart knows Herbert. Rosemary knows Jameson. Zane knows Stuart. Zane knows Ian. Felix knows Adam. Jarvis knows Irene. Irene knows Clark. Zane knows Alyssa. Ryan knows Oscar. Colby knows Clay. Jarvis knows Damian. Jameson knows Zane. Jarvis knows Simon. Oscar knows Livia. Irene knows Alison. Which of Livia and Clay can Felix reach?", "answer": "Clay", "steps": [ "Felix knows Adam.", "Adam knows Jarvis.", "Jarvis knows Irene.", "Irene knows Clark.", "Clark knows Colby.", "Colby knows Clay." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Felix", "Colby", "Simon", "Clark", "Alison", "Adam", "Irene", "Damian", "Clay", "Jarvis", "Rosemary", "Oscar", "Ian", "Ryan", "Herbert", "Jameson", "Stuart", "Alyssa", "Livia", "Zane" ], "edges": [ [ 0, 5 ], [ 1, 8 ], [ 3, 1 ], [ 5, 9 ], [ 6, 4 ], [ 6, 3 ], [ 9, 2 ], [ 9, 7 ], [ 9, 6 ], [ 10, 15 ], [ 11, 18 ], [ 13, 11 ], [ 15, 19 ], [ 16, 14 ], [ 16, 13 ], [ 19, 12 ], [ 19, 17 ], [ 19, 16 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Freya knows Everett. Gonzalo knows Hardy. Freya knows Kay. Morgan knows Houston. Hannah knows Elton. Will knows Evelyn. Everett knows Hannah. Hardy knows Morgan. Beverly knows Harper. Zach knows Preston. Morgan knows Beth. Kay knows Beverly. Walt knows Katherine. Gonzalo knows Zach. Preston knows Will. Elton knows Diana. Beverly knows Walt. Houston knows Herbert. Which of Beverly and Morgan can Freya reach?", "answer": "Beverly", "steps": [ "Freya knows Kay.", "Kay knows Beverly." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Freya", "Beverly", "Kay", "Diana", "Everett", "Harper", "Walt", "Elton", "Katherine", "Hannah", "Gonzalo", "Morgan", "Hardy", "Evelyn", "Zach", "Beth", "Houston", "Will", "Herbert", "Preston" ], "edges": [ [ 0, 2 ], [ 0, 4 ], [ 1, 5 ], [ 1, 6 ], [ 2, 1 ], [ 4, 9 ], [ 6, 8 ], [ 7, 3 ], [ 9, 7 ], [ 10, 12 ], [ 10, 14 ], [ 11, 15 ], [ 11, 16 ], [ 12, 11 ], [ 14, 19 ], [ 16, 18 ], [ 17, 13 ], [ 19, 17 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Tony knows Kamila. Kamila knows Lamar. Brynn knows Zach. Ralph knows Edison. Sybil knows Joanna. Olive knows Tony. Kamila knows Wayne. Zach knows Cliff. Dalton knows Carrie. Edison knows Mae. Zach knows Dalton. Pam knows Gloria. Mae knows Brynn. Arlene knows Olive. Jason knows Pam. Lamar knows Jason. Fabian knows Arlene. Carrie knows Sybil. Which of Joanna and Gloria can Ralph reach?", "answer": "Joanna", "steps": [ "Ralph knows Edison.", "Edison knows Mae.", "Mae knows Brynn.", "Brynn knows Zach.", "Zach knows Dalton.", "Dalton knows Carrie.", "Carrie knows Sybil.", "Sybil knows Joanna." ], "difficulty": 8, "original_distance": 8, "idx_to_symbol": [ "Ralph", "Joanna", "Zach", "Cliff", "Sybil", "Mae", "Carrie", "Dalton", "Brynn", "Edison", "Fabian", "Gloria", "Kamila", "Wayne", "Pam", "Olive", "Jason", "Lamar", "Tony", "Arlene" ], "edges": [ [ 0, 9 ], [ 2, 3 ], [ 2, 7 ], [ 4, 1 ], [ 5, 8 ], [ 6, 4 ], [ 7, 6 ], [ 8, 2 ], [ 9, 5 ], [ 10, 19 ], [ 12, 13 ], [ 12, 17 ], [ 14, 11 ], [ 15, 18 ], [ 16, 14 ], [ 17, 16 ], [ 18, 12 ], [ 19, 15 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Brent knows Cruz. Bella knows Pat. Darla knows Brent. Shaun knows Eleanor. Eleanor knows Parker. Parker knows Vera. Mitchell knows Marion. Boyd knows Todd. Cruz knows Rose. Marion knows Leonard. Darla knows Sam. Rose knows Garland. Todd knows Neil. Bella knows Boyd. Shaun knows Katherine. Garland knows Mitchell. Neil knows Shaun. Garland knows Brian. Which of Vera and Leonard can Darla reach?", "answer": "Leonard", "steps": [ "Darla knows Brent.", "Brent knows Cruz.", "Cruz knows Rose.", "Rose knows Garland.", "Garland knows Mitchell.", "Mitchell knows Marion.", "Marion knows Leonard." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Darla", "Mitchell", "Leonard", "Marion", "Brian", "Cruz", "Brent", "Rose", "Garland", "Sam", "Bella", "Eleanor", "Vera", "Parker", "Katherine", "Todd", "Boyd", "Neil", "Shaun", "Pat" ], "edges": [ [ 0, 6 ], [ 0, 9 ], [ 1, 3 ], [ 3, 2 ], [ 5, 7 ], [ 6, 5 ], [ 7, 8 ], [ 8, 1 ], [ 8, 4 ], [ 10, 16 ], [ 10, 19 ], [ 11, 13 ], [ 13, 12 ], [ 15, 17 ], [ 16, 15 ], [ 17, 18 ], [ 18, 11 ], [ 18, 14 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Jillian knows Martin. Esme knows Amy. Tina knows Hayes. Jodi knows Hubert. Hayes knows Anthony. Donald knows Jodi. Houston knows Cornelius. Tina knows Emery. Hubert knows Janelle. Donald knows Alejandro. Donald knows Ember. Ember knows Arturo. Cornelius knows Nina. Tina knows Houston. Ember knows Mildred. Hayes knows Eduardo. Anthony knows Esme. Arturo knows Jillian. Which of Martin and Amy can Tina reach?", "answer": "Amy", "steps": [ "Tina knows Hayes.", "Hayes knows Anthony.", "Anthony knows Esme.", "Esme knows Amy." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Tina", "Esme", "Hayes", "Houston", "Emery", "Amy", "Eduardo", "Anthony", "Cornelius", "Nina", "Donald", "Jillian", "Ember", "Jodi", "Alejandro", "Martin", "Mildred", "Arturo", "Hubert", "Janelle" ], "edges": [ [ 0, 4 ], [ 0, 2 ], [ 0, 3 ], [ 1, 5 ], [ 2, 6 ], [ 2, 7 ], [ 3, 8 ], [ 7, 1 ], [ 8, 9 ], [ 10, 14 ], [ 10, 12 ], [ 10, 13 ], [ 11, 15 ], [ 12, 16 ], [ 12, 17 ], [ 13, 18 ], [ 17, 11 ], [ 18, 19 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "April knows Rick. Gemma knows Fred. Fred knows Agnes. Vernon knows Cassidy. Val knows Lamont. Vernon knows Crystal. Val knows Nicole. Barry knows Eva. Gemma knows Verna. Agnes knows Val. Thomas knows Barry. Barry knows Vernon. April knows Sydney. Gemma knows Victor. Lyric knows Gemma. Fred knows Gustavo. Barry knows Lorna. Crystal knows April. Which of Rick and Nicole can Thomas reach?", "answer": "Rick", "steps": [ "Thomas knows Barry.", "Barry knows Vernon.", "Vernon knows Crystal.", "Crystal knows April.", "April knows Rick." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Thomas", "Eva", "Rick", "Sydney", "April", "Lorna", "Barry", "Crystal", "Cassidy", "Vernon", "Lyric", "Verna", "Nicole", "Lamont", "Val", "Victor", "Gemma", "Agnes", "Gustavo", "Fred" ], "edges": [ [ 0, 6 ], [ 4, 2 ], [ 4, 3 ], [ 6, 1 ], [ 6, 5 ], [ 6, 9 ], [ 7, 4 ], [ 9, 7 ], [ 9, 8 ], [ 10, 16 ], [ 14, 12 ], [ 14, 13 ], [ 16, 11 ], [ 16, 15 ], [ 16, 19 ], [ 17, 14 ], [ 19, 17 ], [ 19, 18 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Joyce knows Sara. Harris knows Wendell. Bernard knows Marion. Donna knows Merle. Harris knows Ray. Wendell knows Estella. Leonard knows Lorraine. Geoffrey knows Jerry. Harris knows Floyd. Merle knows Geoffrey. Ray knows Fabian. Merle knows Joyce. Fabian knows Marilyn. Floyd knows Derek. Bernard knows Harris. Lorraine knows Israel. Donna knows Beau. Merle knows Leonard. Which of Merle and Harris can Donna reach?", "answer": "Merle", "steps": [ "Donna knows Merle." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Donna", "Geoffrey", "Sara", "Beau", "Jerry", "Leonard", "Israel", "Lorraine", "Merle", "Joyce", "Bernard", "Floyd", "Estella", "Marion", "Derek", "Ray", "Marilyn", "Fabian", "Harris", "Wendell" ], "edges": [ [ 0, 3 ], [ 0, 8 ], [ 1, 4 ], [ 5, 7 ], [ 7, 6 ], [ 8, 1 ], [ 8, 5 ], [ 8, 9 ], [ 9, 2 ], [ 10, 13 ], [ 10, 18 ], [ 11, 14 ], [ 15, 17 ], [ 17, 16 ], [ 18, 11 ], [ 18, 15 ], [ 18, 19 ], [ 19, 12 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Maria knows Irma. Alma knows Maria. Irma knows Sylvia. Jolene knows Tanya. Belinda knows Gordon. Irma knows Allen. Harmony knows Dean. Riley knows Tony. Esperanza knows Jolene. Dominic knows Esperanza. Tanya knows Blanche. Harmony knows Belinda. Dominic knows Luna. Esperanza knows Luke. Tanya knows Elias. Riley knows Dominic. Alma knows Taylor. Belinda knows Alma. Which of Belinda and Dominic can Harmony reach?", "answer": "Belinda", "steps": [ "Harmony knows Belinda." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Harmony", "Allen", "Alma", "Maria", "Belinda", "Taylor", "Irma", "Dean", "Gordon", "Sylvia", "Riley", "Blanche", "Esperanza", "Jolene", "Dominic", "Luke", "Tanya", "Tony", "Luna", "Elias" ], "edges": [ [ 0, 7 ], [ 0, 4 ], [ 2, 5 ], [ 2, 3 ], [ 3, 6 ], [ 4, 8 ], [ 4, 2 ], [ 6, 1 ], [ 6, 9 ], [ 10, 17 ], [ 10, 14 ], [ 12, 15 ], [ 12, 13 ], [ 13, 16 ], [ 14, 18 ], [ 14, 12 ], [ 16, 11 ], [ 16, 19 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Maria knows Irma. Alma knows Maria. Irma knows Sylvia. Jolene knows Tanya. Belinda knows Gordon. Irma knows Allen. Harmony knows Dean. Riley knows Tony. Esperanza knows Jolene. Dominic knows Esperanza. Tanya knows Blanche. Harmony knows Belinda. Dominic knows Luna. Esperanza knows Luke. Tanya knows Elias. Riley knows Dominic. Alma knows Taylor. Belinda knows Alma. Which of Alma and Esperanza can Harmony reach?", "answer": "Alma", "steps": [ "Harmony knows Belinda.", "Belinda knows Alma." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Harmony", "Allen", "Alma", "Maria", "Belinda", "Taylor", "Irma", "Dean", "Gordon", "Sylvia", "Riley", "Blanche", "Esperanza", "Jolene", "Dominic", "Luke", "Tanya", "Tony", "Luna", "Elias" ], "edges": [ [ 0, 7 ], [ 0, 4 ], [ 2, 5 ], [ 2, 3 ], [ 3, 6 ], [ 4, 8 ], [ 4, 2 ], [ 6, 1 ], [ 6, 9 ], [ 10, 17 ], [ 10, 14 ], [ 12, 15 ], [ 12, 13 ], [ 13, 16 ], [ 14, 18 ], [ 14, 12 ], [ 16, 11 ], [ 16, 19 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Reid knows Ursula. Doug knows Ivy. Jolena knows Morgan. Freya knows Elliot. Jolena knows Gabe. Lola knows Finn. Lola knows Freya. Darrell knows Jolena. Ivy knows Lola. Andrew knows Hank. Morgan knows Ford. Doug knows Reid. Ivy knows Lawrence. Ford knows Jeremy. Chantal knows Esme. Morgan knows Chantal. Finn knows Dorian. Darrell knows Andrew. Which of Dorian and Jeremy can Doug reach?", "answer": "Dorian", "steps": [ "Doug knows Ivy.", "Ivy knows Lola.", "Lola knows Finn.", "Finn knows Dorian." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Doug", "Dorian", "Reid", "Ivy", "Elliot", "Freya", "Lola", "Lawrence", "Ursula", "Finn", "Darrell", "Jeremy", "Andrew", "Jolena", "Esme", "Chantal", "Morgan", "Gabe", "Hank", "Ford" ], "edges": [ [ 0, 2 ], [ 0, 3 ], [ 2, 8 ], [ 3, 7 ], [ 3, 6 ], [ 5, 4 ], [ 6, 5 ], [ 6, 9 ], [ 9, 1 ], [ 10, 12 ], [ 10, 13 ], [ 12, 18 ], [ 13, 17 ], [ 13, 16 ], [ 15, 14 ], [ 16, 15 ], [ 16, 19 ], [ 19, 11 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Zack knows Jesse. Ezra knows Veronica. Diane knows Vivian. Malik knows Paige. Elijah knows Elliot. Jenny knows Corinne. Malik knows Hope. Charlene knows Joseph. Corinne knows Jane. Diane knows Charlene. Vivian knows Erwin. Jenny knows Ezra. Zack knows Malik. Elijah knows Keira. Joseph knows Elijah. Elliot knows Sarah. Elliot knows Opal. Jane knows Zack. Which of Joseph and Jane can Jenny reach?", "answer": "Jane", "steps": [ "Jenny knows Corinne.", "Corinne knows Jane." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Jenny", "Corinne", "Paige", "Hope", "Veronica", "Malik", "Ezra", "Zack", "Jane", "Jesse", "Diane", "Charlene", "Sarah", "Opal", "Erwin", "Elliot", "Vivian", "Elijah", "Joseph", "Keira" ], "edges": [ [ 0, 6 ], [ 0, 1 ], [ 1, 8 ], [ 5, 2 ], [ 5, 3 ], [ 6, 4 ], [ 7, 5 ], [ 7, 9 ], [ 8, 7 ], [ 10, 16 ], [ 10, 11 ], [ 11, 18 ], [ 15, 12 ], [ 15, 13 ], [ 16, 14 ], [ 17, 15 ], [ 17, 19 ], [ 18, 17 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Hope knows Edison. Leon knows Eloise. Hope knows Dina. Horace knows Harrison. Zoe knows Alana. Julius knows Nancy. Randy knows Horace. Axel knows Julius. Zoe knows Kennedy. Harrison knows Esperanza. Dina knows Randy. Leon knows Haven. Shelly knows Opal. Dina knows Leon. Alana knows Shelly. Tracy knows Axel. Shelly knows Dustin. Alana knows Tracy. Which of Tracy and Randy can Zoe reach?", "answer": "Tracy", "steps": [ "Zoe knows Alana.", "Alana knows Tracy." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Zoe", "Alana", "Julius", "Shelly", "Tracy", "Dustin", "Kennedy", "Nancy", "Axel", "Opal", "Hope", "Dina", "Harrison", "Leon", "Randy", "Haven", "Edison", "Esperanza", "Horace", "Eloise" ], "edges": [ [ 0, 6 ], [ 0, 1 ], [ 1, 4 ], [ 1, 3 ], [ 2, 7 ], [ 3, 5 ], [ 3, 9 ], [ 4, 8 ], [ 8, 2 ], [ 10, 16 ], [ 10, 11 ], [ 11, 14 ], [ 11, 13 ], [ 12, 17 ], [ 13, 15 ], [ 13, 19 ], [ 14, 18 ], [ 18, 12 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Tamara knows Palmer. Earle knows Odette. Brenda knows Jack. Loretta knows Shaun. Jocelyn knows Tamara. Odette knows Amelia. Amelia knows Dahlia. Riley knows Saul. Caleb knows Rhonda. Odette knows Brenda. Laurel knows Julius. Tamara knows Laurel. Jeremy knows Loretta. Dahlia knows Whitney. Palmer knows Caleb. Dahlia knows Riley. Saul knows Esme. Caleb knows Jeremy. Which of Amelia and Palmer can Earle reach?", "answer": "Amelia", "steps": [ "Earle knows Odette.", "Odette knows Amelia." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Earle", "Amelia", "Odette", "Dahlia", "Riley", "Esme", "Saul", "Brenda", "Jack", "Whitney", "Jocelyn", "Palmer", "Tamara", "Caleb", "Jeremy", "Shaun", "Loretta", "Laurel", "Julius", "Rhonda" ], "edges": [ [ 0, 2 ], [ 1, 3 ], [ 2, 7 ], [ 2, 1 ], [ 3, 4 ], [ 3, 9 ], [ 4, 6 ], [ 6, 5 ], [ 7, 8 ], [ 10, 12 ], [ 11, 13 ], [ 12, 17 ], [ 12, 11 ], [ 13, 14 ], [ 13, 19 ], [ 14, 16 ], [ 16, 15 ], [ 17, 18 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Myrtle knows Elijah. Jacob knows Alfred. Alfred knows Forrest. Alfred knows Anna. Elijah knows Mara. Logan knows Jacob. Yvonne knows Heather. Jennifer knows Hugh. Heather knows Clement. Mara knows Erik. Forrest knows Abel. Walt knows Sheila. Clement knows Callum. Callum knows Jocelyn. Clement knows Hadley. Jocelyn knows Jennifer. Hugh knows Walt. Abel knows Myrtle. Which of Clement and Alfred can Yvonne reach?", "answer": "Clement", "steps": [ "Yvonne knows Heather.", "Heather knows Clement." ], "difficulty": 2, "original_distance": 8, "idx_to_symbol": [ "Yvonne", "Jennifer", "Hadley", "Sheila", "Clement", "Callum", "Hugh", "Jocelyn", "Heather", "Walt", "Logan", "Myrtle", "Anna", "Erik", "Alfred", "Forrest", "Elijah", "Abel", "Jacob", "Mara" ], "edges": [ [ 0, 8 ], [ 1, 6 ], [ 4, 2 ], [ 4, 5 ], [ 5, 7 ], [ 6, 9 ], [ 7, 1 ], [ 8, 4 ], [ 9, 3 ], [ 10, 18 ], [ 11, 16 ], [ 14, 12 ], [ 14, 15 ], [ 15, 17 ], [ 16, 19 ], [ 17, 11 ], [ 18, 14 ], [ 19, 13 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Kendrick knows Mitchell. Todd knows Lance. Todd knows Melody. Rena knows Abby. Rena knows Hector. Ariana knows Milton. Todd knows Dorian. Katherine knows Neville. Cameron knows Brian. Ariana knows Katherine. Humphrey knows Ariana. Kendrick knows Todd. Katherine knows Livia. Humphrey knows Kate. Ariana knows Cameron. Ariana knows Frida. Todd knows Rena. Dorian knows Trina. Which of Rena and Katherine can Humphrey reach?", "answer": "Katherine", "steps": [ "Humphrey knows Ariana.", "Ariana knows Katherine." ], "difficulty": 2, "original_distance": 3, "idx_to_symbol": [ "Humphrey", "Cameron", "Kate", "Brian", "Neville", "Milton", "Livia", "Frida", "Katherine", "Ariana", "Kendrick", "Dorian", "Mitchell", "Trina", "Abby", "Lance", "Hector", "Melody", "Rena", "Todd" ], "edges": [ [ 0, 2 ], [ 0, 9 ], [ 1, 3 ], [ 8, 4 ], [ 8, 6 ], [ 9, 1 ], [ 9, 5 ], [ 9, 7 ], [ 9, 8 ], [ 10, 12 ], [ 10, 19 ], [ 11, 13 ], [ 18, 14 ], [ 18, 16 ], [ 19, 11 ], [ 19, 15 ], [ 19, 17 ], [ 19, 18 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Frida knows Jewel. Morgan knows Frida. Blanche knows Bert. Angela knows Horace. Bert knows Morgan. Clement knows Blanche. Bernadette knows Lloyd. Jewel knows Magdalena. Amber knows Rita. Archer knows Angela. Lloyd knows Juan. Angela knows Lilia. Lilia knows Melody. Melody knows Jeffery. Yvette knows Amber. Horace knows Violet. Violet knows Bernadette. Blanche knows Yvette. Which of Bert and Horace can Archer reach?", "answer": "Horace", "steps": [ "Archer knows Angela.", "Angela knows Horace." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Archer", "Angela", "Juan", "Bernadette", "Violet", "Melody", "Jeffery", "Horace", "Lloyd", "Lilia", "Clement", "Blanche", "Magdalena", "Frida", "Morgan", "Amber", "Rita", "Bert", "Jewel", "Yvette" ], "edges": [ [ 0, 1 ], [ 1, 7 ], [ 1, 9 ], [ 3, 8 ], [ 4, 3 ], [ 5, 6 ], [ 7, 4 ], [ 8, 2 ], [ 9, 5 ], [ 10, 11 ], [ 11, 17 ], [ 11, 19 ], [ 13, 18 ], [ 14, 13 ], [ 15, 16 ], [ 17, 14 ], [ 18, 12 ], [ 19, 15 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Tim knows Lucille. Lucille knows Lucy. Jermaine knows Gerald. Kim knows Jermaine. Morgan knows Earl. Randall knows Tim. Jermaine knows Cain. Randall knows Parker. Erwin knows Serena. Cynthia knows Davis. Lucy knows Fraser. Cynthia knows Barney. Erwin knows Kim. Karl knows Audrey. Earl knows Erwin. Lucy knows Electra. Karl knows Morgan. Fraser knows Cynthia. Which of Jermaine and Cynthia can Randall reach?", "answer": "Cynthia", "steps": [ "Randall knows Tim.", "Tim knows Lucille.", "Lucille knows Lucy.", "Lucy knows Fraser.", "Fraser knows Cynthia." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Randall", "Lucille", "Parker", "Lucy", "Tim", "Cynthia", "Barney", "Electra", "Fraser", "Davis", "Karl", "Earl", "Audrey", "Erwin", "Morgan", "Jermaine", "Gerald", "Serena", "Kim", "Cain" ], "edges": [ [ 0, 2 ], [ 0, 4 ], [ 1, 3 ], [ 3, 7 ], [ 3, 8 ], [ 4, 1 ], [ 5, 6 ], [ 5, 9 ], [ 8, 5 ], [ 10, 12 ], [ 10, 14 ], [ 11, 13 ], [ 13, 17 ], [ 13, 18 ], [ 14, 11 ], [ 15, 16 ], [ 15, 19 ], [ 18, 15 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Reid knows Ursula. Doug knows Ivy. Jolena knows Morgan. Freya knows Elliot. Jolena knows Gabe. Lola knows Finn. Lola knows Freya. Darrell knows Jolena. Ivy knows Lola. Andrew knows Hank. Morgan knows Ford. Doug knows Reid. Ivy knows Lawrence. Ford knows Jeremy. Chantal knows Esme. Morgan knows Chantal. Finn knows Dorian. Darrell knows Andrew. Which of Ivy and Jolena can Doug reach?", "answer": "Ivy", "steps": [ "Doug knows Ivy." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Doug", "Dorian", "Reid", "Ivy", "Elliot", "Freya", "Lola", "Lawrence", "Ursula", "Finn", "Darrell", "Jeremy", "Andrew", "Jolena", "Esme", "Chantal", "Morgan", "Gabe", "Hank", "Ford" ], "edges": [ [ 0, 2 ], [ 0, 3 ], [ 2, 8 ], [ 3, 7 ], [ 3, 6 ], [ 5, 4 ], [ 6, 5 ], [ 6, 9 ], [ 9, 1 ], [ 10, 12 ], [ 10, 13 ], [ 12, 18 ], [ 13, 17 ], [ 13, 16 ], [ 15, 14 ], [ 16, 15 ], [ 16, 19 ], [ 19, 11 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Ronald knows Colleen. Hubert knows Willis. Ronald knows Jim. Willis knows Alyssa. Wesley knows Elmer. Lamont knows Elsa. Colleen knows Hubert. Colleen knows Eduardo. Eli knows Gage. Harper knows Cole. Alvin knows Cruz. Lamont knows Alvin. Alyssa knows Wesley. Esme knows Ronald. Cruz knows Eli. Gage knows Harper. Alvin knows Cornelius. Madeline knows Lamont. Which of Willis and Eli can Madeline reach?", "answer": "Eli", "steps": [ "Madeline knows Lamont.", "Lamont knows Alvin.", "Alvin knows Cruz.", "Cruz knows Eli." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Madeline", "Elsa", "Eli", "Cruz", "Harper", "Lamont", "Cornelius", "Alvin", "Gage", "Cole", "Esme", "Jim", "Willis", "Hubert", "Wesley", "Ronald", "Eduardo", "Colleen", "Alyssa", "Elmer" ], "edges": [ [ 0, 5 ], [ 2, 8 ], [ 3, 2 ], [ 4, 9 ], [ 5, 1 ], [ 5, 7 ], [ 7, 6 ], [ 7, 3 ], [ 8, 4 ], [ 10, 15 ], [ 12, 18 ], [ 13, 12 ], [ 14, 19 ], [ 15, 11 ], [ 15, 17 ], [ 17, 16 ], [ 17, 13 ], [ 18, 14 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Maude knows Elmer. Brittany knows Zara. Bonnie knows Julian. Zara knows Bonnie. Lena knows Brittany. Larissa knows Fred. Louisa knows Dolores. Bonnie knows Jerome. Louisa knows Sam. Julian knows Elias. Larissa knows Barney. Barney knows Jon. Brittany knows Odette. Brittany knows Maude. Audrey knows Larissa. Louisa knows Audrey. Henrietta knows Louisa. Sam knows Gary. Which of Jon and Elias can Henrietta reach?", "answer": "Jon", "steps": [ "Henrietta knows Louisa.", "Louisa knows Audrey.", "Audrey knows Larissa.", "Larissa knows Barney.", "Barney knows Jon." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Henrietta", "Larissa", "Louisa", "Dolores", "Barney", "Fred", "Sam", "Gary", "Audrey", "Jon", "Lena", "Bonnie", "Brittany", "Odette", "Julian", "Jerome", "Maude", "Elmer", "Zara", "Elias" ], "edges": [ [ 0, 2 ], [ 1, 5 ], [ 1, 4 ], [ 2, 3 ], [ 2, 6 ], [ 2, 8 ], [ 4, 9 ], [ 6, 7 ], [ 8, 1 ], [ 10, 12 ], [ 11, 15 ], [ 11, 14 ], [ 12, 13 ], [ 12, 16 ], [ 12, 18 ], [ 14, 19 ], [ 16, 17 ], [ 18, 11 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Perry knows Evan. Perry knows Bette. Cooper knows Perry. Charles knows Steve. Rosa knows Carmela. Cooper knows Vera. Vera knows Lyric. Logan knows Janice. Logan knows Lucia. Rosa knows Daniella. Lucia knows Cooper. Hayes knows Charles. Janice knows Claude. Tonya knows Haven. Hayes knows Francesca. Steve knows Tonya. Francesca knows Kelly. Steve knows Rosa. Which of Charles and Lucia can Hayes reach?", "answer": "Charles", "steps": [ "Hayes knows Charles." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Hayes", "Charles", "Tonya", "Carmela", "Haven", "Francesca", "Steve", "Rosa", "Daniella", "Kelly", "Logan", "Lucia", "Vera", "Evan", "Lyric", "Janice", "Cooper", "Perry", "Bette", "Claude" ], "edges": [ [ 0, 1 ], [ 0, 5 ], [ 1, 6 ], [ 2, 4 ], [ 5, 9 ], [ 6, 2 ], [ 6, 7 ], [ 7, 3 ], [ 7, 8 ], [ 10, 11 ], [ 10, 15 ], [ 11, 16 ], [ 12, 14 ], [ 15, 19 ], [ 16, 12 ], [ 16, 17 ], [ 17, 13 ], [ 17, 18 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Jose knows Ross. Layla knows Clyde. Corinne knows Julia. Lars knows Jose. Dahlia knows Melissa. Yuki knows Lars. Tessa knows Dahlia. Lars knows Layla. Curtis knows Isla. Amelia knows Tessa. Julia knows Yolanda. Ross knows Carlos. Carlos knows Corinne. Isla knows Amanda. Lamar knows Curtis. Brandon knows Clement. Melissa knows Brandon. Curtis knows Amelia. Which of Corinne and Melissa can Yuki reach?", "answer": "Corinne", "steps": [ "Yuki knows Lars.", "Lars knows Jose.", "Jose knows Ross.", "Ross knows Carlos.", "Carlos knows Corinne." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Yuki", "Carlos", "Julia", "Ross", "Lars", "Yolanda", "Corinne", "Jose", "Clyde", "Layla", "Lamar", "Dahlia", "Brandon", "Tessa", "Curtis", "Clement", "Melissa", "Amelia", "Amanda", "Isla" ], "edges": [ [ 0, 4 ], [ 1, 6 ], [ 2, 5 ], [ 3, 1 ], [ 4, 7 ], [ 4, 9 ], [ 6, 2 ], [ 7, 3 ], [ 9, 8 ], [ 10, 14 ], [ 11, 16 ], [ 12, 15 ], [ 13, 11 ], [ 14, 17 ], [ 14, 19 ], [ 16, 12 ], [ 17, 13 ], [ 19, 18 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Miranda knows Stella. Keaton knows Lena. Wilson knows Estella. Francesca knows Hank. Marion knows Miranda. Lena knows Wilson. Gary knows Ben. Marion knows Joyce. Francesca knows Leroy. Gary knows Atlas. Ben knows Evan. Wilson knows Marion. Joyce knows Iris. Hank knows Samuel. Keaton knows Jenna. Samuel knows Gary. Atlas knows Cara. Samuel knows Luz. Which of Joyce and Atlas can Francesca reach?", "answer": "Atlas", "steps": [ "Francesca knows Hank.", "Hank knows Samuel.", "Samuel knows Gary.", "Gary knows Atlas." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Francesca", "Cara", "Ben", "Evan", "Hank", "Luz", "Atlas", "Samuel", "Leroy", "Gary", "Keaton", "Iris", "Miranda", "Stella", "Lena", "Estella", "Joyce", "Wilson", "Jenna", "Marion" ], "edges": [ [ 0, 8 ], [ 0, 4 ], [ 2, 3 ], [ 4, 7 ], [ 6, 1 ], [ 7, 5 ], [ 7, 9 ], [ 9, 2 ], [ 9, 6 ], [ 10, 18 ], [ 10, 14 ], [ 12, 13 ], [ 14, 17 ], [ 16, 11 ], [ 17, 15 ], [ 17, 19 ], [ 19, 12 ], [ 19, 16 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Faith knows Charles. Isadora knows Yasmin. Tony knows Theodore. Bella knows Thea. Faith knows Vance. Yasmin knows Faith. Fraser knows Basil. Yasmin knows Lola. Basil knows Vincent. Thea knows Bonnie. Fraser knows Whitney. Bonnie knows Fraser. Isadora knows Will. Faith knows Tony. Fraser knows Jeremiah. Bonnie knows Jack. Anastasia knows Isadora. Thea knows Hank. Which of Faith and Fraser can Bella reach?", "answer": "Fraser", "steps": [ "Bella knows Thea.", "Thea knows Bonnie.", "Bonnie knows Fraser." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Bella", "Hank", "Fraser", "Thea", "Basil", "Whitney", "Vincent", "Jack", "Jeremiah", "Bonnie", "Anastasia", "Will", "Faith", "Isadora", "Tony", "Charles", "Theodore", "Lola", "Vance", "Yasmin" ], "edges": [ [ 0, 3 ], [ 2, 5 ], [ 2, 4 ], [ 2, 8 ], [ 3, 1 ], [ 3, 9 ], [ 4, 6 ], [ 9, 7 ], [ 9, 2 ], [ 10, 13 ], [ 12, 15 ], [ 12, 14 ], [ 12, 18 ], [ 13, 11 ], [ 13, 19 ], [ 14, 16 ], [ 19, 17 ], [ 19, 12 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Dell knows Hope. Veronica knows Gage. Gage knows Kelsey. Langston knows Devon. Ricardo knows Samuel. Dell knows Ricardo. Sebastian knows Alder. Sebastian knows Nicole. Hope knows Emery. Gage knows Logan. Devon knows Demetrius. Demetrius knows Sybil. Elena knows Sebastian. Emery knows Elena. Sybil knows Veronica. Denver knows Leo. Devon knows Denver. Hannah knows Dell. Which of Dell and Devon can Hannah reach?", "answer": "Dell", "steps": [ "Hannah knows Dell." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Hannah", "Ricardo", "Dell", "Hope", "Sebastian", "Elena", "Alder", "Emery", "Nicole", "Samuel", "Langston", "Denver", "Devon", "Demetrius", "Gage", "Veronica", "Kelsey", "Sybil", "Logan", "Leo" ], "edges": [ [ 0, 2 ], [ 1, 9 ], [ 2, 3 ], [ 2, 1 ], [ 3, 7 ], [ 4, 6 ], [ 4, 8 ], [ 5, 4 ], [ 7, 5 ], [ 10, 12 ], [ 11, 19 ], [ 12, 13 ], [ 12, 11 ], [ 13, 17 ], [ 14, 16 ], [ 14, 18 ], [ 15, 14 ], [ 17, 15 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Flora knows Lucia. Russell knows Owen. Neal knows Desmond. Zara knows Bonnie. Bonnie knows Dana. Maria knows Flora. Livia knows Katrina. Martin knows Maria. Knox knows Charles. Owen knows Livia. Bonnie knows Allan. Livia knows Peggy. Katrina knows Neal. Knox knows Zara. Desmond knows Will. Dana knows Martin. Russell knows Chelsea. Will knows Colin. Which of Martin and Neal can Knox reach?", "answer": "Martin", "steps": [ "Knox knows Zara.", "Zara knows Bonnie.", "Bonnie knows Dana.", "Dana knows Martin." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Knox", "Flora", "Allan", "Dana", "Bonnie", "Zara", "Maria", "Lucia", "Charles", "Martin", "Russell", "Will", "Peggy", "Katrina", "Livia", "Owen", "Desmond", "Colin", "Chelsea", "Neal" ], "edges": [ [ 0, 8 ], [ 0, 5 ], [ 1, 7 ], [ 3, 9 ], [ 4, 2 ], [ 4, 3 ], [ 5, 4 ], [ 6, 1 ], [ 9, 6 ], [ 10, 18 ], [ 10, 15 ], [ 11, 17 ], [ 13, 19 ], [ 14, 12 ], [ 14, 13 ], [ 15, 14 ], [ 16, 11 ], [ 19, 16 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Bryan knows Alyson. Elise knows Pete. Dennis knows Nancy. Sierra knows Clinton. Elise knows Charlotte. Pete knows Dennis. Inez knows Aspen. Irene knows Holly. Joan knows Irene. Joan knows Alder. Bryan knows Neville. Irene knows Elaine. Jackson knows Sierra. Jackson knows Josie. Clinton knows Erica. Holly knows Inez. Dennis knows Jackson. Alyson knows Joan. Which of Erica and Aspen can Elise reach?", "answer": "Erica", "steps": [ "Elise knows Pete.", "Pete knows Dennis.", "Dennis knows Jackson.", "Jackson knows Sierra.", "Sierra knows Clinton.", "Clinton knows Erica." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Elise", "Erica", "Nancy", "Josie", "Sierra", "Pete", "Charlotte", "Clinton", "Dennis", "Jackson", "Bryan", "Aspen", "Alder", "Elaine", "Holly", "Alyson", "Neville", "Inez", "Joan", "Irene" ], "edges": [ [ 0, 6 ], [ 0, 5 ], [ 4, 7 ], [ 5, 8 ], [ 7, 1 ], [ 8, 2 ], [ 8, 9 ], [ 9, 3 ], [ 9, 4 ], [ 10, 16 ], [ 10, 15 ], [ 14, 17 ], [ 15, 18 ], [ 17, 11 ], [ 18, 12 ], [ 18, 19 ], [ 19, 13 ], [ 19, 14 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Priscilla knows Julius. Brooks knows Ted. Daisy knows Haven. Viola knows Guy. Davis knows Reed. Guy knows Jamie. Bruce knows Lacey. Grant knows Grace. Julia knows Ibrahim. Lara knows Julia. Viola knows Dakota. Grace knows Daisy. Brooks knows Priscilla. Ted knows Cecilia. Priscilla knows Davis. Ibrahim knows Brooks. Lacey knows Grant. Grace knows Viola. Which of Davis and Guy can Lara reach?", "answer": "Davis", "steps": [ "Lara knows Julia.", "Julia knows Ibrahim.", "Ibrahim knows Brooks.", "Brooks knows Priscilla.", "Priscilla knows Davis." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Lara", "Ted", "Julia", "Brooks", "Reed", "Priscilla", "Julius", "Cecilia", "Ibrahim", "Davis", "Bruce", "Daisy", "Lacey", "Grace", "Jamie", "Viola", "Dakota", "Haven", "Grant", "Guy" ], "edges": [ [ 0, 2 ], [ 1, 7 ], [ 2, 8 ], [ 3, 1 ], [ 3, 5 ], [ 5, 6 ], [ 5, 9 ], [ 8, 3 ], [ 9, 4 ], [ 10, 12 ], [ 11, 17 ], [ 12, 18 ], [ 13, 11 ], [ 13, 15 ], [ 15, 16 ], [ 15, 19 ], [ 18, 13 ], [ 19, 14 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Luther knows Jim. Jessie knows Julius. Norma knows Clay. Jasper knows Mae. Jim knows Virginia. Zoe knows Evan. Dakota knows Zach. Clay knows Fisher. Julius knows Dexter. Dakota knows Zoe. Mae knows Dakota. Virginia knows Brooke. Fisher knows Garland. Brooke knows Jessie. Daisy knows Luther. Rowan knows Daisy. Luther knows Hope. Evan knows Norma. Which of Mae and Daisy can Rowan reach?", "answer": "Daisy", "steps": [ "Rowan knows Daisy." ], "difficulty": 1, "original_distance": 8, "idx_to_symbol": [ "Rowan", "Jessie", "Julius", "Brooke", "Jim", "Dexter", "Luther", "Virginia", "Daisy", "Hope", "Jasper", "Clay", "Fisher", "Norma", "Zoe", "Garland", "Dakota", "Evan", "Mae", "Zach" ], "edges": [ [ 0, 8 ], [ 1, 2 ], [ 2, 5 ], [ 3, 1 ], [ 4, 7 ], [ 6, 4 ], [ 6, 9 ], [ 7, 3 ], [ 8, 6 ], [ 10, 18 ], [ 11, 12 ], [ 12, 15 ], [ 13, 11 ], [ 14, 17 ], [ 16, 14 ], [ 16, 19 ], [ 17, 13 ], [ 18, 16 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Lola knows Tristan. Tristan knows Arthur. Hal knows Sandra. Eleanor knows Hal. Marcus knows Greg. Regina knows Marcus. Aisha knows Chloe. Greg knows Sally. Beth knows Eleanor. Arthur knows Aisha. Ben knows Grace. Sandra knows Peter. Tristan knows Brandon. Peter knows Ray. Grace knows Beth. Sally knows Lola. Ray knows Edwin. Sandra knows Leo. Which of Tristan and Sandra can Ben reach?", "answer": "Sandra", "steps": [ "Ben knows Grace.", "Grace knows Beth.", "Beth knows Eleanor.", "Eleanor knows Hal.", "Hal knows Sandra." ], "difficulty": 5, "original_distance": 8, "idx_to_symbol": [ "Ben", "Peter", "Edwin", "Ray", "Sandra", "Hal", "Grace", "Eleanor", "Beth", "Leo", "Regina", "Arthur", "Chloe", "Aisha", "Tristan", "Lola", "Marcus", "Sally", "Greg", "Brandon" ], "edges": [ [ 0, 6 ], [ 1, 3 ], [ 3, 2 ], [ 4, 1 ], [ 4, 9 ], [ 5, 4 ], [ 6, 8 ], [ 7, 5 ], [ 8, 7 ], [ 10, 16 ], [ 11, 13 ], [ 13, 12 ], [ 14, 11 ], [ 14, 19 ], [ 15, 14 ], [ 16, 18 ], [ 17, 15 ], [ 18, 17 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Kara knows Malcolm. Cate knows Vanessa. Anita knows Hilda. Alejandro knows Grady. Jordan knows Houston. Conner knows Sheila. Hilda knows Felix. Eamon knows Cate. Grady knows Conner. Eamon knows Roy. Roy knows Darius. Houston knows Alejandro. Vanessa knows Randall. Hugo knows Anita. Roy knows Hugo. Malcolm knows Cordelia. Houston knows Clark. Jordan knows Kara. Which of Alejandro and Hugo can Eamon reach?", "answer": "Hugo", "steps": [ "Eamon knows Roy.", "Roy knows Hugo." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Eamon", "Felix", "Hilda", "Cate", "Anita", "Darius", "Hugo", "Roy", "Vanessa", "Randall", "Jordan", "Sheila", "Conner", "Kara", "Grady", "Clark", "Alejandro", "Houston", "Malcolm", "Cordelia" ], "edges": [ [ 0, 7 ], [ 0, 3 ], [ 2, 1 ], [ 3, 8 ], [ 4, 2 ], [ 6, 4 ], [ 7, 5 ], [ 7, 6 ], [ 8, 9 ], [ 10, 17 ], [ 10, 13 ], [ 12, 11 ], [ 13, 18 ], [ 14, 12 ], [ 16, 14 ], [ 17, 15 ], [ 17, 16 ], [ 18, 19 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Darren knows Hunter. Lee knows Dick. Howard knows Cordelia. Howard knows Lee. Diana knows Inez. Herman knows Lorenzo. Howard knows Conrad. Lorenzo knows Paula. Dick knows Janet. Conrad knows Uma. Howard knows Cody. Herman knows Rebecca. Dick knows Emmett. Paula knows Hampton. Emmett knows Duncan. Herman knows Louis. Paula knows Diana. Herman knows Darren. Which of Paula and Dick can Herman reach?", "answer": "Paula", "steps": [ "Herman knows Lorenzo.", "Lorenzo knows Paula." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Herman", "Paula", "Inez", "Louis", "Rebecca", "Hampton", "Diana", "Darren", "Lorenzo", "Hunter", "Howard", "Dick", "Duncan", "Cody", "Cordelia", "Janet", "Emmett", "Conrad", "Lee", "Uma" ], "edges": [ [ 0, 3 ], [ 0, 4 ], [ 0, 8 ], [ 0, 7 ], [ 1, 5 ], [ 1, 6 ], [ 6, 2 ], [ 7, 9 ], [ 8, 1 ], [ 10, 13 ], [ 10, 14 ], [ 10, 18 ], [ 10, 17 ], [ 11, 15 ], [ 11, 16 ], [ 16, 12 ], [ 17, 19 ], [ 18, 11 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Tanya knows Winston. Nolan knows Byron. Winston knows Daisy. Winston knows Clyde. Adele knows Tanya. Stuart knows Regina. Fritz knows Yara. Isiah knows Christian. Christian knows Samantha. Isiah knows Frank. Fritz knows Matt. Clyde knows Janice. Tara knows Abigail. Tanya knows Stuart. Matt knows Nolan. Byron knows Jean. Nolan knows Isiah. Tara knows Adele. Which of Clyde and Christian can Fritz reach?", "answer": "Christian", "steps": [ "Fritz knows Matt.", "Matt knows Nolan.", "Nolan knows Isiah.", "Isiah knows Christian." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Fritz", "Yara", "Frank", "Samantha", "Isiah", "Jean", "Nolan", "Matt", "Byron", "Christian", "Tara", "Abigail", "Daisy", "Janice", "Winston", "Regina", "Tanya", "Adele", "Stuart", "Clyde" ], "edges": [ [ 0, 1 ], [ 0, 7 ], [ 4, 2 ], [ 4, 9 ], [ 6, 8 ], [ 6, 4 ], [ 7, 6 ], [ 8, 5 ], [ 9, 3 ], [ 10, 11 ], [ 10, 17 ], [ 14, 12 ], [ 14, 19 ], [ 16, 18 ], [ 16, 14 ], [ 17, 16 ], [ 18, 15 ], [ 19, 13 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Angelica knows Judy. Howard knows Elton. Langston knows Simon. Dick knows Emery. Taylor knows Howard. Monroe knows Angelica. Judy knows Imogen. Howard knows Darwin. Dick knows Neal. Simon knows June. Dick knows Pablo. Warren knows Leah. Emery knows Warren. Imogen knows Tonya. Monroe knows Taylor. Neal knows Langston. Warren knows Laurel. Monroe knows Tina. Which of June and Tonya can Dick reach?", "answer": "June", "steps": [ "Dick knows Neal.", "Neal knows Langston.", "Langston knows Simon.", "Simon knows June." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Dick", "Neal", "Laurel", "Emery", "June", "Langston", "Leah", "Simon", "Warren", "Pablo", "Monroe", "Angelica", "Darwin", "Taylor", "Tonya", "Judy", "Elton", "Imogen", "Howard", "Tina" ], "edges": [ [ 0, 1 ], [ 0, 3 ], [ 0, 9 ], [ 1, 5 ], [ 3, 8 ], [ 5, 7 ], [ 7, 4 ], [ 8, 2 ], [ 8, 6 ], [ 10, 11 ], [ 10, 13 ], [ 10, 19 ], [ 11, 15 ], [ 13, 18 ], [ 15, 17 ], [ 17, 14 ], [ 18, 12 ], [ 18, 16 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Skyler knows Annie. Skyler knows Rod. Skyler knows Daphna. Esther knows Isaac. Austin knows Dana. Esther knows Chester. Annie knows Spencer. Skyler knows Rowan. Arthur knows Russell. Marvin knows Edison. Chester knows Doris. Chester knows Elise. Austin knows Marvin. Marvin knows Skyler. Chester knows Kim. Arthur knows Esther. Chester knows Terry. Kim knows Gustavo. Which of Marvin and Esther can Austin reach?", "answer": "Marvin", "steps": [ "Austin knows Marvin." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Austin", "Dana", "Spencer", "Rod", "Marvin", "Skyler", "Daphna", "Rowan", "Annie", "Edison", "Arthur", "Russell", "Gustavo", "Terry", "Esther", "Chester", "Elise", "Doris", "Kim", "Isaac" ], "edges": [ [ 0, 1 ], [ 0, 4 ], [ 4, 5 ], [ 4, 9 ], [ 5, 3 ], [ 5, 6 ], [ 5, 7 ], [ 5, 8 ], [ 8, 2 ], [ 10, 11 ], [ 10, 14 ], [ 14, 15 ], [ 14, 19 ], [ 15, 13 ], [ 15, 16 ], [ 15, 17 ], [ 15, 18 ], [ 18, 12 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Lionel knows Miranda. Lionel knows Ivan. Brent knows Clifford. Kristina knows Skyler. Daphna knows Brent. Miranda knows Elmer. Denver knows Dolly. Homer knows Dixie. Denver knows India. Lionel knows Bella. Allan knows Loretta. Allan knows Homer. Dolly knows Daphna. Allan knows Denver. Miranda knows Bette. Bette knows Fern. Fern knows Kristina. Bella knows Violet. Which of Fern and Daphna can Allan reach?", "answer": "Daphna", "steps": [ "Allan knows Denver.", "Denver knows Dolly.", "Dolly knows Daphna." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Allan", "Daphna", "Dolly", "Brent", "Clifford", "Denver", "Dixie", "Homer", "Loretta", "India", "Lionel", "Fern", "Bette", "Kristina", "Skyler", "Miranda", "Violet", "Bella", "Ivan", "Elmer" ], "edges": [ [ 0, 7 ], [ 0, 8 ], [ 0, 5 ], [ 1, 3 ], [ 2, 1 ], [ 3, 4 ], [ 5, 2 ], [ 5, 9 ], [ 7, 6 ], [ 10, 17 ], [ 10, 18 ], [ 10, 15 ], [ 11, 13 ], [ 12, 11 ], [ 13, 14 ], [ 15, 12 ], [ 15, 19 ], [ 17, 16 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Priscilla knows Julius. Brooks knows Ted. Daisy knows Haven. Viola knows Guy. Davis knows Reed. Guy knows Jamie. Bruce knows Lacey. Grant knows Grace. Julia knows Ibrahim. Lara knows Julia. Viola knows Dakota. Grace knows Daisy. Brooks knows Priscilla. Ted knows Cecilia. Priscilla knows Davis. Ibrahim knows Brooks. Lacey knows Grant. Grace knows Viola. Which of Julia and Lacey can Lara reach?", "answer": "Julia", "steps": [ "Lara knows Julia." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Lara", "Ted", "Julia", "Brooks", "Reed", "Priscilla", "Julius", "Cecilia", "Ibrahim", "Davis", "Bruce", "Daisy", "Lacey", "Grace", "Jamie", "Viola", "Dakota", "Haven", "Grant", "Guy" ], "edges": [ [ 0, 2 ], [ 1, 7 ], [ 2, 8 ], [ 3, 1 ], [ 3, 5 ], [ 5, 6 ], [ 5, 9 ], [ 8, 3 ], [ 9, 4 ], [ 10, 12 ], [ 11, 17 ], [ 12, 18 ], [ 13, 11 ], [ 13, 15 ], [ 15, 16 ], [ 15, 19 ], [ 18, 13 ], [ 19, 14 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Joy knows Edwin. Ada knows Spencer. Gloria knows Kelly. Darius knows Joy. Allan knows Henrietta. Reid knows Camden. Reid knows Dominic. Lorraine knows Reid. Lillian knows Darius. Lillian knows Pam. Blanche knows Gloria. Joy knows Carter. Allan knows Drew. Spencer knows Lorraine. Henrietta knows Lillian. Spencer knows Caroline. Blanche knows Ada. Drew knows Shelly. Which of Spencer and Lillian can Blanche reach?", "answer": "Spencer", "steps": [ "Blanche knows Ada.", "Ada knows Spencer." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Blanche", "Lorraine", "Ada", "Spencer", "Gloria", "Dominic", "Camden", "Kelly", "Caroline", "Reid", "Allan", "Darius", "Henrietta", "Lillian", "Drew", "Carter", "Edwin", "Shelly", "Pam", "Joy" ], "edges": [ [ 0, 4 ], [ 0, 2 ], [ 1, 9 ], [ 2, 3 ], [ 3, 8 ], [ 3, 1 ], [ 4, 7 ], [ 9, 5 ], [ 9, 6 ], [ 10, 14 ], [ 10, 12 ], [ 11, 19 ], [ 12, 13 ], [ 13, 18 ], [ 13, 11 ], [ 14, 17 ], [ 19, 15 ], [ 19, 16 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Cara knows Mark. Keaton knows Melody. Nelson knows Cristina. Keaton knows Adrian. Adrian knows Latoya. Herbert knows Dale. Kristina knows Aurora. Aurora knows Cara. Herbert knows Morris. Lauren knows Bennett. Dustin knows Grant. Morris knows Dustin. Miles knows Lauren. Nelson knows Jameson. Jameson knows Keaton. Kristina knows Leticia. Cara knows Herbert. Adrian knows Miles. Which of Morris and Miles can Nelson reach?", "answer": "Miles", "steps": [ "Nelson knows Jameson.", "Jameson knows Keaton.", "Keaton knows Adrian.", "Adrian knows Miles." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Nelson", "Melody", "Latoya", "Miles", "Bennett", "Adrian", "Jameson", "Cristina", "Keaton", "Lauren", "Kristina", "Mark", "Dale", "Morris", "Grant", "Herbert", "Aurora", "Leticia", "Cara", "Dustin" ], "edges": [ [ 0, 7 ], [ 0, 6 ], [ 3, 9 ], [ 5, 2 ], [ 5, 3 ], [ 6, 8 ], [ 8, 1 ], [ 8, 5 ], [ 9, 4 ], [ 10, 17 ], [ 10, 16 ], [ 13, 19 ], [ 15, 12 ], [ 15, 13 ], [ 16, 18 ], [ 18, 11 ], [ 18, 15 ], [ 19, 14 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Lauren knows Janice. Lauren knows Nell. Lauren knows Reid. Larry knows Merle. Eric knows Drew. Miranda knows Connor. Estelle knows Lauren. Larry knows Eric. Leland knows Joy. Reid knows Joel. Boris knows Larry. Larry knows Leland. Leland knows Miranda. Keegan knows David. Larry knows Joaquin. Reid knows Ashton. Lauren knows Keegan. Joel knows Elias. Which of Leland and Reid can Estelle reach?", "answer": "Reid", "steps": [ "Estelle knows Lauren.", "Lauren knows Reid." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Estelle", "Keegan", "Ashton", "Janice", "Nell", "Joel", "Elias", "Lauren", "David", "Reid", "Boris", "Eric", "Joy", "Merle", "Joaquin", "Miranda", "Connor", "Larry", "Drew", "Leland" ], "edges": [ [ 0, 7 ], [ 1, 8 ], [ 5, 6 ], [ 7, 3 ], [ 7, 4 ], [ 7, 1 ], [ 7, 9 ], [ 9, 2 ], [ 9, 5 ], [ 10, 17 ], [ 11, 18 ], [ 15, 16 ], [ 17, 13 ], [ 17, 14 ], [ 17, 11 ], [ 17, 19 ], [ 19, 12 ], [ 19, 15 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Monica knows Malcolm. Kristina knows Ebony. Jackson knows Logan. Lance knows Matt. Matt knows Brooks. Ebony knows Geneva. Jacob knows Jackson. Brad knows Rena. Lance knows Kristina. Dane knows Nadine. Logan knows Monica. Brad knows Dane. Pearl knows Mindy. Jacob knows Enrique. Rena knows Jacob. Ebony knows Virgil. Virgil knows Alyson. Alyson knows Pearl. Which of Ebony and Jacob can Lance reach?", "answer": "Ebony", "steps": [ "Lance knows Kristina.", "Kristina knows Ebony." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Lance", "Alyson", "Brooks", "Mindy", "Matt", "Kristina", "Virgil", "Pearl", "Ebony", "Geneva", "Brad", "Logan", "Nadine", "Malcolm", "Dane", "Rena", "Jackson", "Monica", "Jacob", "Enrique" ], "edges": [ [ 0, 4 ], [ 0, 5 ], [ 1, 7 ], [ 4, 2 ], [ 5, 8 ], [ 6, 1 ], [ 7, 3 ], [ 8, 6 ], [ 8, 9 ], [ 10, 14 ], [ 10, 15 ], [ 11, 17 ], [ 14, 12 ], [ 15, 18 ], [ 16, 11 ], [ 17, 13 ], [ 18, 16 ], [ 18, 19 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Bridget knows Grady. Rachel knows Gerard. Ingrid knows Brock. Etta knows Ignacio. Ingrid knows Steve. Percy knows Norman. Carter knows Finn. Carter knows Miles. Finn knows Ira. Norman knows Ada. Norman knows Carter. Gerard knows Ingrid. Steve knows Eloise. Gerard knows Milton. Etta knows Ivan. Carter knows Etta. Steve knows Michelle. Ingrid knows Bridget. Which of Gerard and Norman can Rachel reach?", "answer": "Gerard", "steps": [ "Rachel knows Gerard." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Rachel", "Michelle", "Ingrid", "Brock", "Grady", "Gerard", "Milton", "Steve", "Eloise", "Bridget", "Percy", "Ivan", "Carter", "Miles", "Ira", "Norman", "Ada", "Etta", "Ignacio", "Finn" ], "edges": [ [ 0, 5 ], [ 2, 3 ], [ 2, 7 ], [ 2, 9 ], [ 5, 6 ], [ 5, 2 ], [ 7, 1 ], [ 7, 8 ], [ 9, 4 ], [ 10, 15 ], [ 12, 13 ], [ 12, 17 ], [ 12, 19 ], [ 15, 16 ], [ 15, 12 ], [ 17, 11 ], [ 17, 18 ], [ 19, 14 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Karen knows Doris. Clinton knows Troy. Troy knows Luke. Elizabeth knows Paige. Faye knows Uma. Paige knows Alex. Faye knows Harold. Karen knows Julian. Harold knows Angelica. Alex knows Clinton. Clinton knows Karen. Wilma knows Bart. Bart knows Harlan. Uma knows Jermaine. Marvin knows Catherine. Doris knows Marlene. Uma knows Marvin. Harlan knows Faye. Which of Harlan and Alex can Elizabeth reach?", "answer": "Alex", "steps": [ "Elizabeth knows Paige.", "Paige knows Alex." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Elizabeth", "Clinton", "Marlene", "Julian", "Alex", "Doris", "Karen", "Paige", "Luke", "Troy", "Wilma", "Faye", "Catherine", "Jermaine", "Harlan", "Marvin", "Uma", "Bart", "Angelica", "Harold" ], "edges": [ [ 0, 7 ], [ 1, 6 ], [ 1, 9 ], [ 4, 1 ], [ 5, 2 ], [ 6, 3 ], [ 6, 5 ], [ 7, 4 ], [ 9, 8 ], [ 10, 17 ], [ 11, 16 ], [ 11, 19 ], [ 14, 11 ], [ 15, 12 ], [ 16, 13 ], [ 16, 15 ], [ 17, 14 ], [ 19, 18 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Susanne knows Knox. Jana knows Jamie. Thea knows Sydney. Sydney knows Larissa. Kobe knows Percy. Knox knows Irene. Percy knows Jeanette. Thea knows Whitney. Shane knows Kobe. Knox knows Jem. Percy knows Howard. Jem knows Thea. Ethan knows Shane. Shane knows Clay. Ashley knows Kelly. Jeanette knows Jack. Jana knows Susanne. Ashley knows Ethan. Which of Jack and Larissa can Jana reach?", "answer": "Larissa", "steps": [ "Jana knows Susanne.", "Susanne knows Knox.", "Knox knows Jem.", "Jem knows Thea.", "Thea knows Sydney.", "Sydney knows Larissa." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Jana", "Jamie", "Thea", "Irene", "Larissa", "Whitney", "Sydney", "Jem", "Knox", "Susanne", "Ashley", "Kelly", "Percy", "Clay", "Jack", "Howard", "Jeanette", "Kobe", "Shane", "Ethan" ], "edges": [ [ 0, 1 ], [ 0, 9 ], [ 2, 5 ], [ 2, 6 ], [ 6, 4 ], [ 7, 2 ], [ 8, 3 ], [ 8, 7 ], [ 9, 8 ], [ 10, 11 ], [ 10, 19 ], [ 12, 15 ], [ 12, 16 ], [ 16, 14 ], [ 17, 12 ], [ 18, 13 ], [ 18, 17 ], [ 19, 18 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Skyler knows Annie. Skyler knows Rod. Skyler knows Daphna. Esther knows Isaac. Austin knows Dana. Esther knows Chester. Annie knows Spencer. Skyler knows Rowan. Arthur knows Russell. Marvin knows Edison. Chester knows Doris. Chester knows Elise. Austin knows Marvin. Marvin knows Skyler. Chester knows Kim. Arthur knows Esther. Chester knows Terry. Kim knows Gustavo. Which of Chester and Skyler can Austin reach?", "answer": "Skyler", "steps": [ "Austin knows Marvin.", "Marvin knows Skyler." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Austin", "Dana", "Spencer", "Rod", "Marvin", "Skyler", "Daphna", "Rowan", "Annie", "Edison", "Arthur", "Russell", "Gustavo", "Terry", "Esther", "Chester", "Elise", "Doris", "Kim", "Isaac" ], "edges": [ [ 0, 1 ], [ 0, 4 ], [ 4, 5 ], [ 4, 9 ], [ 5, 3 ], [ 5, 6 ], [ 5, 7 ], [ 5, 8 ], [ 8, 2 ], [ 10, 11 ], [ 10, 14 ], [ 14, 15 ], [ 14, 19 ], [ 15, 13 ], [ 15, 16 ], [ 15, 17 ], [ 15, 18 ], [ 18, 12 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Greer knows Wade. Zack knows Rufus. Bette knows Tyler. Atlas knows Karl. Gerald knows Livia. Linda knows Zack. Catherine knows Emanuel. Lottie knows Julie. Karl knows Greer. Dewey knows Lottie. Livia knows Catherine. Livia knows Aldo. Zane knows Neil. Greer knows Dewey. Atlas knows Bette. Dewey knows Mildred. Catherine knows Zane. Linda knows Gerald. Which of Neil and Julie can Atlas reach?", "answer": "Julie", "steps": [ "Atlas knows Karl.", "Karl knows Greer.", "Greer knows Dewey.", "Dewey knows Lottie.", "Lottie knows Julie." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Atlas", "Dewey", "Julie", "Tyler", "Mildred", "Greer", "Karl", "Bette", "Wade", "Lottie", "Linda", "Catherine", "Neil", "Rufus", "Emanuel", "Livia", "Gerald", "Zack", "Aldo", "Zane" ], "edges": [ [ 0, 7 ], [ 0, 6 ], [ 1, 4 ], [ 1, 9 ], [ 5, 8 ], [ 5, 1 ], [ 6, 5 ], [ 7, 3 ], [ 9, 2 ], [ 10, 17 ], [ 10, 16 ], [ 11, 14 ], [ 11, 19 ], [ 15, 18 ], [ 15, 11 ], [ 16, 15 ], [ 17, 13 ], [ 19, 12 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Daisy knows Alison. Matthew knows Darrell. Alice knows Carla. Maude knows Marilyn. Daisy knows Demetrius. Drew knows Daisy. Marilyn knows Autumn. Matthew knows Lana. Arthur knows Alice. Lawson knows Iris. Marilyn knows Noah. Bert knows Maude. Lana knows Lawson. Maude knows Hugh. Matthew knows Stuart. Marilyn knows Arthur. Maude knows Zach. Daisy knows Matthew. Which of Matthew and Marilyn can Drew reach?", "answer": "Matthew", "steps": [ "Drew knows Daisy.", "Daisy knows Matthew." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Drew", "Lana", "Demetrius", "Lawson", "Darrell", "Daisy", "Iris", "Alison", "Matthew", "Stuart", "Bert", "Arthur", "Hugh", "Alice", "Noah", "Maude", "Carla", "Zach", "Marilyn", "Autumn" ], "edges": [ [ 0, 5 ], [ 1, 3 ], [ 3, 6 ], [ 5, 2 ], [ 5, 7 ], [ 5, 8 ], [ 8, 4 ], [ 8, 1 ], [ 8, 9 ], [ 10, 15 ], [ 11, 13 ], [ 13, 16 ], [ 15, 12 ], [ 15, 17 ], [ 15, 18 ], [ 18, 14 ], [ 18, 11 ], [ 18, 19 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Karen knows Doris. Clinton knows Troy. Troy knows Luke. Elizabeth knows Paige. Faye knows Uma. Paige knows Alex. Faye knows Harold. Karen knows Julian. Harold knows Angelica. Alex knows Clinton. Clinton knows Karen. Wilma knows Bart. Bart knows Harlan. Uma knows Jermaine. Marvin knows Catherine. Doris knows Marlene. Uma knows Marvin. Harlan knows Faye. Which of Marvin and Doris can Elizabeth reach?", "answer": "Doris", "steps": [ "Elizabeth knows Paige.", "Paige knows Alex.", "Alex knows Clinton.", "Clinton knows Karen.", "Karen knows Doris." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Elizabeth", "Clinton", "Marlene", "Julian", "Alex", "Doris", "Karen", "Paige", "Luke", "Troy", "Wilma", "Faye", "Catherine", "Jermaine", "Harlan", "Marvin", "Uma", "Bart", "Angelica", "Harold" ], "edges": [ [ 0, 7 ], [ 1, 6 ], [ 1, 9 ], [ 4, 1 ], [ 5, 2 ], [ 6, 3 ], [ 6, 5 ], [ 7, 4 ], [ 9, 8 ], [ 10, 17 ], [ 11, 16 ], [ 11, 19 ], [ 14, 11 ], [ 15, 12 ], [ 16, 13 ], [ 16, 15 ], [ 17, 14 ], [ 19, 18 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Joel knows Nadine. Hubert knows Wayne. Deirdre knows Jill. Darius knows Joseph. Wayne knows Darius. Nadine knows Tracy. Darius knows Julius. Jill knows Omar. Deirdre knows Dale. Ronald knows Colin. Colin knows Lisette. Justin knows Ronald. Omar knows Maude. Tracy knows Riley. Deirdre knows Justin. Joel knows Aspen. Joel knows Hubert. Colin knows Dallas. Which of Wayne and Ronald can Joel reach?", "answer": "Wayne", "steps": [ "Joel knows Hubert.", "Hubert knows Wayne." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Joel", "Aspen", "Hubert", "Nadine", "Tracy", "Riley", "Julius", "Darius", "Joseph", "Wayne", "Deirdre", "Dale", "Justin", "Jill", "Omar", "Maude", "Lisette", "Colin", "Dallas", "Ronald" ], "edges": [ [ 0, 1 ], [ 0, 3 ], [ 0, 2 ], [ 2, 9 ], [ 3, 4 ], [ 4, 5 ], [ 7, 6 ], [ 7, 8 ], [ 9, 7 ], [ 10, 11 ], [ 10, 13 ], [ 10, 12 ], [ 12, 19 ], [ 13, 14 ], [ 14, 15 ], [ 17, 16 ], [ 17, 18 ], [ 19, 17 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Charlotte knows Archie. Abby knows Callum. Derrick knows Claire. Rose knows Virginia. Callum knows Linda. Ralph knows Abby. Joseph knows Ronald. Linda knows Irving. Rita knows Lucille. Ronald knows Derrick. Charlotte knows Henry. Derrick knows Rose. Irving knows Charlotte. Irving knows Brandon. Rose knows Connor. Charlotte knows Ainsley. Lucille knows Joseph. Rose knows Lilia. Which of Abby and Lucille can Ralph reach?", "answer": "Abby", "steps": [ "Ralph knows Abby." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Ralph", "Ainsley", "Charlotte", "Callum", "Irving", "Archie", "Henry", "Linda", "Abby", "Brandon", "Rita", "Virginia", "Rose", "Joseph", "Derrick", "Connor", "Lilia", "Ronald", "Lucille", "Claire" ], "edges": [ [ 0, 8 ], [ 2, 1 ], [ 2, 5 ], [ 2, 6 ], [ 3, 7 ], [ 4, 2 ], [ 4, 9 ], [ 7, 4 ], [ 8, 3 ], [ 10, 18 ], [ 12, 11 ], [ 12, 15 ], [ 12, 16 ], [ 13, 17 ], [ 14, 12 ], [ 14, 19 ], [ 17, 14 ], [ 18, 13 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Tyler knows Regina. Alfonso knows Greg. Patrick knows Tyler. Regina knows Etta. Russell knows Seth. Deirdre knows Hayley. Etta knows Raquel. Frances knows Alfonso. Regina knows Russell. Alfonso knows Bob. Axel knows Lars. Deirdre knows Frances. Patrick knows Blair. Hayley knows Miranda. Raquel knows Cara. Raquel knows Winifred. Lars knows Deirdre. Axel knows Jordan. Which of Alfonso and Raquel can Patrick reach?", "answer": "Raquel", "steps": [ "Patrick knows Tyler.", "Tyler knows Regina.", "Regina knows Etta.", "Etta knows Raquel." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Patrick", "Russell", "Tyler", "Cara", "Seth", "Regina", "Etta", "Raquel", "Winifred", "Blair", "Axel", "Hayley", "Lars", "Bob", "Miranda", "Deirdre", "Frances", "Alfonso", "Greg", "Jordan" ], "edges": [ [ 0, 2 ], [ 0, 9 ], [ 1, 4 ], [ 2, 5 ], [ 5, 1 ], [ 5, 6 ], [ 6, 7 ], [ 7, 3 ], [ 7, 8 ], [ 10, 12 ], [ 10, 19 ], [ 11, 14 ], [ 12, 15 ], [ 15, 11 ], [ 15, 16 ], [ 16, 17 ], [ 17, 13 ], [ 17, 18 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Joyce knows Louis. Max knows Joyce. Yara knows Parker. Knox knows Sebastian. Susan knows Darius. Grady knows Yara. Jonathan knows Bridget. Yara knows Susan. Knox knows Jonathan. George knows Knox. Evelyn knows Max. Jeremiah knows Grover. Max knows Chandler. George knows Grady. Jeremiah knows Sadie. Alex knows Jeremiah. Evelyn knows Alex. Sadie knows Heidi. Which of Heidi and Darius can George reach?", "answer": "Darius", "steps": [ "George knows Grady.", "Grady knows Yara.", "Yara knows Susan.", "Susan knows Darius." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "George", "Darius", "Sebastian", "Knox", "Parker", "Yara", "Grady", "Bridget", "Susan", "Jonathan", "Evelyn", "Heidi", "Chandler", "Max", "Grover", "Jeremiah", "Alex", "Louis", "Sadie", "Joyce" ], "edges": [ [ 0, 6 ], [ 0, 3 ], [ 3, 2 ], [ 3, 9 ], [ 5, 4 ], [ 5, 8 ], [ 6, 5 ], [ 8, 1 ], [ 9, 7 ], [ 10, 16 ], [ 10, 13 ], [ 13, 12 ], [ 13, 19 ], [ 15, 14 ], [ 15, 18 ], [ 16, 15 ], [ 18, 11 ], [ 19, 17 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Josie knows Gideon. Benjamin knows Chris. Fletcher knows Peter. Lloyd knows Hadley. Lark knows Bruno. Gideon knows Reed. Chris knows Archie. Tabitha knows Zara. Benjamin knows Tabitha. Gideon knows Fletcher. Peter knows Cara. Bruno knows Benjamin. Lloyd knows Ariel. Fletcher knows Lloyd. Tabitha knows Chad. Bruno knows Troy. Lloyd knows Rose. Tabitha knows Anita. Which of Fletcher and Benjamin can Lark reach?", "answer": "Benjamin", "steps": [ "Lark knows Bruno.", "Bruno knows Benjamin." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Lark", "Troy", "Archie", "Chad", "Anita", "Zara", "Tabitha", "Benjamin", "Chris", "Bruno", "Josie", "Reed", "Cara", "Hadley", "Rose", "Ariel", "Lloyd", "Fletcher", "Peter", "Gideon" ], "edges": [ [ 0, 9 ], [ 6, 3 ], [ 6, 4 ], [ 6, 5 ], [ 7, 6 ], [ 7, 8 ], [ 8, 2 ], [ 9, 1 ], [ 9, 7 ], [ 10, 19 ], [ 16, 13 ], [ 16, 14 ], [ 16, 15 ], [ 17, 16 ], [ 17, 18 ], [ 18, 12 ], [ 19, 11 ], [ 19, 17 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Karen knows Doris. Clinton knows Troy. Troy knows Luke. Elizabeth knows Paige. Faye knows Uma. Paige knows Alex. Faye knows Harold. Karen knows Julian. Harold knows Angelica. Alex knows Clinton. Clinton knows Karen. Wilma knows Bart. Bart knows Harlan. Uma knows Jermaine. Marvin knows Catherine. Doris knows Marlene. Uma knows Marvin. Harlan knows Faye. Which of Catherine and Marlene can Elizabeth reach?", "answer": "Marlene", "steps": [ "Elizabeth knows Paige.", "Paige knows Alex.", "Alex knows Clinton.", "Clinton knows Karen.", "Karen knows Doris.", "Doris knows Marlene." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Elizabeth", "Clinton", "Marlene", "Julian", "Alex", "Doris", "Karen", "Paige", "Luke", "Troy", "Wilma", "Faye", "Catherine", "Jermaine", "Harlan", "Marvin", "Uma", "Bart", "Angelica", "Harold" ], "edges": [ [ 0, 7 ], [ 1, 6 ], [ 1, 9 ], [ 4, 1 ], [ 5, 2 ], [ 6, 3 ], [ 6, 5 ], [ 7, 4 ], [ 9, 8 ], [ 10, 17 ], [ 11, 16 ], [ 11, 19 ], [ 14, 11 ], [ 15, 12 ], [ 16, 13 ], [ 16, 15 ], [ 17, 14 ], [ 19, 18 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Goldie knows Faye. Arturo knows Kendrick. Faye knows Victoria. Samantha knows Charlene. Faye knows Gus. Gus knows Cordelia. Knox knows Geneva. Faye knows Colby. Geneva knows Warren. Garrett knows Zach. Victoria knows Hazel. Zach knows Samantha. Samantha knows Knox. Cordelia knows Leander. Samantha knows Arturo. Denise knows Goldie. Samantha knows Dylan. Faye knows Spencer. Which of Faye and Samantha can Denise reach?", "answer": "Faye", "steps": [ "Denise knows Goldie.", "Goldie knows Faye." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Denise", "Cordelia", "Spencer", "Victoria", "Gus", "Faye", "Leander", "Goldie", "Hazel", "Colby", "Garrett", "Geneva", "Dylan", "Arturo", "Knox", "Samantha", "Warren", "Zach", "Kendrick", "Charlene" ], "edges": [ [ 0, 7 ], [ 1, 6 ], [ 3, 8 ], [ 4, 1 ], [ 5, 2 ], [ 5, 4 ], [ 5, 3 ], [ 5, 9 ], [ 7, 5 ], [ 10, 17 ], [ 11, 16 ], [ 13, 18 ], [ 14, 11 ], [ 15, 12 ], [ 15, 14 ], [ 15, 13 ], [ 15, 19 ], [ 17, 15 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Myra knows Dalton. Jeremiah knows Ted. Georgia knows Elena. Aubrey knows Drake. Aria knows August. Georgia knows Mark. Drake knows Kenneth. Madeline knows Aria. Leigh knows Kaleb. Drake knows Humphrey. Ted knows Georgia. Kaleb knows Aubrey. Myra knows Deborah. August knows Jon. Kenneth knows Myra. Jeremiah knows Emanuel. Fabian knows Leigh. Jon knows Jeremiah. Which of Jon and Aubrey can Fabian reach?", "answer": "Aubrey", "steps": [ "Fabian knows Leigh.", "Leigh knows Kaleb.", "Kaleb knows Aubrey." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Fabian", "Leigh", "Myra", "Aubrey", "Humphrey", "Drake", "Kenneth", "Deborah", "Dalton", "Kaleb", "Madeline", "Aria", "Georgia", "Jon", "Emanuel", "Jeremiah", "Ted", "Elena", "Mark", "August" ], "edges": [ [ 0, 1 ], [ 1, 9 ], [ 2, 7 ], [ 2, 8 ], [ 3, 5 ], [ 5, 4 ], [ 5, 6 ], [ 6, 2 ], [ 9, 3 ], [ 10, 11 ], [ 11, 19 ], [ 12, 17 ], [ 12, 18 ], [ 13, 15 ], [ 15, 14 ], [ 15, 16 ], [ 16, 12 ], [ 19, 13 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Karen knows Doris. Clinton knows Troy. Troy knows Luke. Elizabeth knows Paige. Faye knows Uma. Paige knows Alex. Faye knows Harold. Karen knows Julian. Harold knows Angelica. Alex knows Clinton. Clinton knows Karen. Wilma knows Bart. Bart knows Harlan. Uma knows Jermaine. Marvin knows Catherine. Doris knows Marlene. Uma knows Marvin. Harlan knows Faye. Which of Karen and Uma can Elizabeth reach?", "answer": "Karen", "steps": [ "Elizabeth knows Paige.", "Paige knows Alex.", "Alex knows Clinton.", "Clinton knows Karen." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Elizabeth", "Clinton", "Marlene", "Julian", "Alex", "Doris", "Karen", "Paige", "Luke", "Troy", "Wilma", "Faye", "Catherine", "Jermaine", "Harlan", "Marvin", "Uma", "Bart", "Angelica", "Harold" ], "edges": [ [ 0, 7 ], [ 1, 6 ], [ 1, 9 ], [ 4, 1 ], [ 5, 2 ], [ 6, 3 ], [ 6, 5 ], [ 7, 4 ], [ 9, 8 ], [ 10, 17 ], [ 11, 16 ], [ 11, 19 ], [ 14, 11 ], [ 15, 12 ], [ 16, 13 ], [ 16, 15 ], [ 17, 14 ], [ 19, 18 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Ross knows Leah. Wilson knows Alma. Cynthia knows Edgar. Riley knows Cynthia. Helene knows Donovan. Edwin knows Frankie. Donovan knows Donald. Blanche knows Autumn. Alma knows Riley. Edgar knows Keira. Kara knows Blanche. Susanne knows Elmer. Edgar knows Archer. Elmer knows Hope. Hope knows Helene. Leah knows Edwin. Donovan knows Ross. Archer knows Kara. Which of Edgar and Donovan can Wilson reach?", "answer": "Edgar", "steps": [ "Wilson knows Alma.", "Alma knows Riley.", "Riley knows Cynthia.", "Cynthia knows Edgar." ], "difficulty": 4, "original_distance": 8, "idx_to_symbol": [ "Wilson", "Riley", "Alma", "Blanche", "Archer", "Kara", "Cynthia", "Keira", "Autumn", "Edgar", "Susanne", "Hope", "Elmer", "Edwin", "Ross", "Leah", "Helene", "Donald", "Frankie", "Donovan" ], "edges": [ [ 0, 2 ], [ 1, 6 ], [ 2, 1 ], [ 3, 8 ], [ 4, 5 ], [ 5, 3 ], [ 6, 9 ], [ 9, 7 ], [ 9, 4 ], [ 10, 12 ], [ 11, 16 ], [ 12, 11 ], [ 13, 18 ], [ 14, 15 ], [ 15, 13 ], [ 16, 19 ], [ 19, 17 ], [ 19, 14 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Vivian knows June. Gareth knows Burt. Glen knows Aisha. Gilbert knows Glen. Karl knows Henry. Layla knows Alice. June knows Caleb. Blair knows Cate. Blair knows Mitchell. Jackson knows Karl. Mitchell knows Vivian. Cate knows Layla. Aisha knows Gareth. Jack knows Rowan. Burt knows Hudson. Rowan knows Blair. Glen knows Jackson. Jolena knows Gilbert. Which of Gareth and Vivian can Jack reach?", "answer": "Vivian", "steps": [ "Jack knows Rowan.", "Rowan knows Blair.", "Blair knows Mitchell.", "Mitchell knows Vivian." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Jack", "Vivian", "Layla", "Rowan", "Blair", "Cate", "Caleb", "June", "Alice", "Mitchell", "Jolena", "Gareth", "Karl", "Gilbert", "Glen", "Jackson", "Hudson", "Burt", "Henry", "Aisha" ], "edges": [ [ 0, 3 ], [ 1, 7 ], [ 2, 8 ], [ 3, 4 ], [ 4, 5 ], [ 4, 9 ], [ 5, 2 ], [ 7, 6 ], [ 9, 1 ], [ 10, 13 ], [ 11, 17 ], [ 12, 18 ], [ 13, 14 ], [ 14, 15 ], [ 14, 19 ], [ 15, 12 ], [ 17, 16 ], [ 19, 11 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Floyd knows Gloria. Gloria knows Gabriel. Jenny knows Bruce. Jorge knows Dahlia. Anastasia knows Tessa. Bruce knows Damian. Justin knows Jeffery. Gabriel knows Virginia. Floyd knows Marc. Bruce knows Dawn. Yvonne knows Jenny. Marc knows Pierce. Gabriel knows Hope. Kate knows Floyd. Yvonne knows Justin. Anastasia knows Yvonne. Tessa knows Duke. Kate knows Jorge. Which of Hope and Damian can Anastasia reach?", "answer": "Damian", "steps": [ "Anastasia knows Yvonne.", "Yvonne knows Jenny.", "Jenny knows Bruce.", "Bruce knows Damian." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Anastasia", "Yvonne", "Damian", "Tessa", "Duke", "Bruce", "Justin", "Jenny", "Jeffery", "Dawn", "Kate", "Floyd", "Hope", "Jorge", "Dahlia", "Gabriel", "Marc", "Gloria", "Pierce", "Virginia" ], "edges": [ [ 0, 3 ], [ 0, 1 ], [ 1, 6 ], [ 1, 7 ], [ 3, 4 ], [ 5, 2 ], [ 5, 9 ], [ 6, 8 ], [ 7, 5 ], [ 10, 13 ], [ 10, 11 ], [ 11, 16 ], [ 11, 17 ], [ 13, 14 ], [ 15, 12 ], [ 15, 19 ], [ 16, 18 ], [ 17, 15 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Goldie knows Faye. Arturo knows Kendrick. Faye knows Victoria. Samantha knows Charlene. Faye knows Gus. Gus knows Cordelia. Knox knows Geneva. Faye knows Colby. Geneva knows Warren. Garrett knows Zach. Victoria knows Hazel. Zach knows Samantha. Samantha knows Knox. Cordelia knows Leander. Samantha knows Arturo. Denise knows Goldie. Samantha knows Dylan. Faye knows Spencer. Which of Gus and Knox can Denise reach?", "answer": "Gus", "steps": [ "Denise knows Goldie.", "Goldie knows Faye.", "Faye knows Gus." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Denise", "Cordelia", "Spencer", "Victoria", "Gus", "Faye", "Leander", "Goldie", "Hazel", "Colby", "Garrett", "Geneva", "Dylan", "Arturo", "Knox", "Samantha", "Warren", "Zach", "Kendrick", "Charlene" ], "edges": [ [ 0, 7 ], [ 1, 6 ], [ 3, 8 ], [ 4, 1 ], [ 5, 2 ], [ 5, 4 ], [ 5, 3 ], [ 5, 9 ], [ 7, 5 ], [ 10, 17 ], [ 11, 16 ], [ 13, 18 ], [ 14, 11 ], [ 15, 12 ], [ 15, 14 ], [ 15, 13 ], [ 15, 19 ], [ 17, 15 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Barbara knows Holden. Miranda knows Drew. Peggy knows Gail. Barbara knows Peggy. Gwen knows Demetrius. Elsa knows Steve. Kathleen knows Barbara. Jude knows Kathleen. Riley knows Travis. Demetrius knows Riley. Andrew knows Tamara. Alejandro knows Andrew. Elsa knows Miranda. Tamara knows Elsa. Peggy knows Gwen. Hazel knows Hayes. Tamara knows Brody. Drew knows Hazel. Which of Kathleen and Andrew can Alejandro reach?", "answer": "Andrew", "steps": [ "Alejandro knows Andrew." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Alejandro", "Drew", "Tamara", "Hayes", "Andrew", "Brody", "Steve", "Elsa", "Miranda", "Hazel", "Jude", "Demetrius", "Barbara", "Travis", "Kathleen", "Holden", "Gail", "Peggy", "Gwen", "Riley" ], "edges": [ [ 0, 4 ], [ 1, 9 ], [ 2, 5 ], [ 2, 7 ], [ 4, 2 ], [ 7, 6 ], [ 7, 8 ], [ 8, 1 ], [ 9, 3 ], [ 10, 14 ], [ 11, 19 ], [ 12, 15 ], [ 12, 17 ], [ 14, 12 ], [ 17, 16 ], [ 17, 18 ], [ 18, 11 ], [ 19, 13 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Dick knows Kirsten. Wendell knows Darren. Darren knows Isiah. Dolores knows Teresa. Dolores knows Bernadette. Alyson knows Nicholas. Clark knows Malcolm. Nicholas knows Ignacio. Christopher knows Clark. Teresa knows Carrie. Malcolm knows Lars. Clark knows Perry. Kirsten knows Wendell. Ignacio knows Dick. Wendell knows Nash. Lamar knows Dolores. Lars knows Lamar. Nicholas knows Layla. Which of Dick and Lars can Christopher reach?", "answer": "Lars", "steps": [ "Christopher knows Clark.", "Clark knows Malcolm.", "Malcolm knows Lars." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Christopher", "Malcolm", "Lamar", "Dolores", "Bernadette", "Teresa", "Clark", "Perry", "Lars", "Carrie", "Alyson", "Ignacio", "Kirsten", "Wendell", "Nash", "Darren", "Nicholas", "Layla", "Dick", "Isiah" ], "edges": [ [ 0, 6 ], [ 1, 8 ], [ 2, 3 ], [ 3, 4 ], [ 3, 5 ], [ 5, 9 ], [ 6, 7 ], [ 6, 1 ], [ 8, 2 ], [ 10, 16 ], [ 11, 18 ], [ 12, 13 ], [ 13, 14 ], [ 13, 15 ], [ 15, 19 ], [ 16, 17 ], [ 16, 11 ], [ 18, 12 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Jenna knows Teresa. Brittany knows Daisy. Lucia knows Brittany. Brittany knows Alice. Brittany knows Hamilton. Hampton knows Mike. Teresa knows Kaleb. Teresa knows Drew. Brittany knows Jeremiah. Kaleb knows Ernesto. Kaleb knows Angela. Raquel knows Wendy. Teresa knows Ariel. Hamilton knows Raquel. Teresa knows Hampton. Mike knows Cornelius. Alice knows Blanche. Alice knows Karen. Which of Brittany and Teresa can Jenna reach?", "answer": "Teresa", "steps": [ "Jenna knows Teresa." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Jenna", "Ariel", "Ernesto", "Hampton", "Drew", "Cornelius", "Angela", "Mike", "Teresa", "Kaleb", "Lucia", "Jeremiah", "Karen", "Hamilton", "Daisy", "Wendy", "Blanche", "Raquel", "Brittany", "Alice" ], "edges": [ [ 0, 8 ], [ 3, 7 ], [ 7, 5 ], [ 8, 1 ], [ 8, 4 ], [ 8, 3 ], [ 8, 9 ], [ 9, 2 ], [ 9, 6 ], [ 10, 18 ], [ 13, 17 ], [ 17, 15 ], [ 18, 11 ], [ 18, 14 ], [ 18, 13 ], [ 18, 19 ], [ 19, 12 ], [ 19, 16 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Maude knows Elmer. Brittany knows Zara. Bonnie knows Julian. Zara knows Bonnie. Lena knows Brittany. Larissa knows Fred. Louisa knows Dolores. Bonnie knows Jerome. Louisa knows Sam. Julian knows Elias. Larissa knows Barney. Barney knows Jon. Brittany knows Odette. Brittany knows Maude. Audrey knows Larissa. Louisa knows Audrey. Henrietta knows Louisa. Sam knows Gary. Which of Bonnie and Larissa can Henrietta reach?", "answer": "Larissa", "steps": [ "Henrietta knows Louisa.", "Louisa knows Audrey.", "Audrey knows Larissa." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Henrietta", "Larissa", "Louisa", "Dolores", "Barney", "Fred", "Sam", "Gary", "Audrey", "Jon", "Lena", "Bonnie", "Brittany", "Odette", "Julian", "Jerome", "Maude", "Elmer", "Zara", "Elias" ], "edges": [ [ 0, 2 ], [ 1, 5 ], [ 1, 4 ], [ 2, 3 ], [ 2, 6 ], [ 2, 8 ], [ 4, 9 ], [ 6, 7 ], [ 8, 1 ], [ 10, 12 ], [ 11, 15 ], [ 11, 14 ], [ 12, 13 ], [ 12, 16 ], [ 12, 18 ], [ 14, 19 ], [ 16, 17 ], [ 18, 11 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Lottie knows Aisha. Harlan knows Jermaine. Conrad knows Francesca. Jim knows Alyson. Lisette knows Don. Lisette knows Lewis. Gail knows Benjamin. Lottie knows Janice. Rebecca knows Gail. Harlan knows Conrad. Jim knows Lottie. Alyson knows Bailey. Jermaine knows Donovan. Rebecca knows Elizabeth. Conrad knows Rebecca. Janice knows Lisette. Gail knows Jeremiah. Janice knows Carmen. Which of Janice and Rebecca can Harlan reach?", "answer": "Rebecca", "steps": [ "Harlan knows Conrad.", "Conrad knows Rebecca." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Harlan", "Conrad", "Jermaine", "Francesca", "Elizabeth", "Jeremiah", "Rebecca", "Donovan", "Benjamin", "Gail", "Jim", "Lottie", "Alyson", "Aisha", "Carmen", "Don", "Janice", "Bailey", "Lewis", "Lisette" ], "edges": [ [ 0, 2 ], [ 0, 1 ], [ 1, 3 ], [ 1, 6 ], [ 2, 7 ], [ 6, 4 ], [ 6, 9 ], [ 9, 5 ], [ 9, 8 ], [ 10, 12 ], [ 10, 11 ], [ 11, 13 ], [ 11, 16 ], [ 12, 17 ], [ 16, 14 ], [ 16, 19 ], [ 19, 15 ], [ 19, 18 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Edgar knows Julio. Marshall knows Leon. Gonzalo knows Blaine. Alex knows Will. Blaine knows Alex. Leon knows Sally. Dora knows Myra. Andrea knows Paige. Myra knows Kara. Drew knows Edgar. Kara knows Greg. Sally knows Andrea. Terry knows Dora. Andrea knows Gonzalo. Jocelyn knows Edna. Edgar knows Jocelyn. Blaine knows Peter. Kara knows Drew. Which of Edgar and Blaine can Terry reach?", "answer": "Edgar", "steps": [ "Terry knows Dora.", "Dora knows Myra.", "Myra knows Kara.", "Kara knows Drew.", "Drew knows Edgar." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Terry", "Edgar", "Kara", "Edna", "Julio", "Drew", "Jocelyn", "Myra", "Dora", "Greg", "Marshall", "Blaine", "Andrea", "Will", "Peter", "Gonzalo", "Alex", "Sally", "Leon", "Paige" ], "edges": [ [ 0, 8 ], [ 1, 4 ], [ 1, 6 ], [ 2, 5 ], [ 2, 9 ], [ 5, 1 ], [ 6, 3 ], [ 7, 2 ], [ 8, 7 ], [ 10, 18 ], [ 11, 14 ], [ 11, 16 ], [ 12, 15 ], [ 12, 19 ], [ 15, 11 ], [ 16, 13 ], [ 17, 12 ], [ 18, 17 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Dwight knows Wendy. Neal knows Caleb. Isla knows Antonio. Katherine knows Colin. Dwight knows Edmund. Edmund knows Ursula. Neal knows Natalie. Annette knows Neal. Desmond knows Dwight. Colin knows Desmond. Lara knows Max. Edmund knows Vanessa. Dwight knows Irving. Antonio knows Annette. Neal knows Lara. Lara knows Tina. Max knows Lewis. Vanessa knows Jonathan. Which of Annette and Desmond can Isla reach?", "answer": "Annette", "steps": [ "Isla knows Antonio.", "Antonio knows Annette." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Isla", "Lara", "Caleb", "Annette", "Neal", "Natalie", "Lewis", "Tina", "Max", "Antonio", "Katherine", "Edmund", "Irving", "Desmond", "Dwight", "Wendy", "Jonathan", "Ursula", "Vanessa", "Colin" ], "edges": [ [ 0, 9 ], [ 1, 7 ], [ 1, 8 ], [ 3, 4 ], [ 4, 2 ], [ 4, 5 ], [ 4, 1 ], [ 8, 6 ], [ 9, 3 ], [ 10, 19 ], [ 11, 17 ], [ 11, 18 ], [ 13, 14 ], [ 14, 12 ], [ 14, 15 ], [ 14, 11 ], [ 18, 16 ], [ 19, 13 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Dorian knows Kennedy. Rachel knows Kerry. Hugh knows Dorian. Liam knows Rachel. Jean knows Gladys. Kaleb knows Delia. Willis knows Hugh. Gunnar knows Graeme. Nicole knows Gunnar. Graeme knows Clyde. Yolanda knows Colby. Colby knows Willis. Gladys knows Kaleb. Dustin knows Isadora. Jean knows Liam. Delia knows Cara. Kerry knows Dustin. Yolanda knows Nicole. Which of Colby and Liam can Jean reach?", "answer": "Liam", "steps": [ "Jean knows Liam." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Jean", "Kerry", "Gladys", "Liam", "Rachel", "Kaleb", "Dustin", "Cara", "Delia", "Isadora", "Yolanda", "Hugh", "Nicole", "Colby", "Willis", "Gunnar", "Dorian", "Clyde", "Graeme", "Kennedy" ], "edges": [ [ 0, 2 ], [ 0, 3 ], [ 1, 6 ], [ 2, 5 ], [ 3, 4 ], [ 4, 1 ], [ 5, 8 ], [ 6, 9 ], [ 8, 7 ], [ 10, 12 ], [ 10, 13 ], [ 11, 16 ], [ 12, 15 ], [ 13, 14 ], [ 14, 11 ], [ 15, 18 ], [ 16, 19 ], [ 18, 17 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Kara knows Malcolm. Cate knows Vanessa. Anita knows Hilda. Alejandro knows Grady. Jordan knows Houston. Conner knows Sheila. Hilda knows Felix. Eamon knows Cate. Grady knows Conner. Eamon knows Roy. Roy knows Darius. Houston knows Alejandro. Vanessa knows Randall. Hugo knows Anita. Roy knows Hugo. Malcolm knows Cordelia. Houston knows Clark. Jordan knows Kara. Which of Conner and Hilda can Eamon reach?", "answer": "Hilda", "steps": [ "Eamon knows Roy.", "Roy knows Hugo.", "Hugo knows Anita.", "Anita knows Hilda." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Eamon", "Felix", "Hilda", "Cate", "Anita", "Darius", "Hugo", "Roy", "Vanessa", "Randall", "Jordan", "Sheila", "Conner", "Kara", "Grady", "Clark", "Alejandro", "Houston", "Malcolm", "Cordelia" ], "edges": [ [ 0, 7 ], [ 0, 3 ], [ 2, 1 ], [ 3, 8 ], [ 4, 2 ], [ 6, 4 ], [ 7, 5 ], [ 7, 6 ], [ 8, 9 ], [ 10, 17 ], [ 10, 13 ], [ 12, 11 ], [ 13, 18 ], [ 14, 12 ], [ 16, 14 ], [ 17, 15 ], [ 17, 16 ], [ 18, 19 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Emma knows Diana. Arthur knows Kieran. Leo knows Boyd. Kieran knows Harlan. Diana knows Hadley. Alfred knows Stefan. Keaton knows Olive. Keaton knows Dick. Harlan knows Charles. Gage knows Kyle. Aria knows Marilyn. Gage knows Aria. Keaton knows Arthur. Megan knows Emma. Kyle knows Alfred. Dick knows Leo. Gage knows Megan. Olive knows Annette. Which of Harlan and Diana can Keaton reach?", "answer": "Harlan", "steps": [ "Keaton knows Arthur.", "Arthur knows Kieran.", "Kieran knows Harlan." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Keaton", "Arthur", "Harlan", "Boyd", "Charles", "Dick", "Annette", "Kieran", "Olive", "Leo", "Gage", "Megan", "Diana", "Stefan", "Hadley", "Kyle", "Marilyn", "Emma", "Aria", "Alfred" ], "edges": [ [ 0, 1 ], [ 0, 8 ], [ 0, 5 ], [ 1, 7 ], [ 2, 4 ], [ 5, 9 ], [ 7, 2 ], [ 8, 6 ], [ 9, 3 ], [ 10, 11 ], [ 10, 18 ], [ 10, 15 ], [ 11, 17 ], [ 12, 14 ], [ 15, 19 ], [ 17, 12 ], [ 18, 16 ], [ 19, 13 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Naomi knows Joyce. Dennis knows Rocco. Joyce knows Andre. Paul knows Eldon. Candice knows Milo. Sadie knows Fleur. Desmond knows Chester. Joyce knows Kent. Sadie knows Desmond. Clark knows Dennis. Rocco knows Sadie. Milo knows Naomi. Fleur knows Diego. Sadie knows Lionel. Lionel knows Yasmin. Kent knows Darren. Joyce knows Paul. Andre knows Holly. Which of Joyce and Sadie can Candice reach?", "answer": "Joyce", "steps": [ "Candice knows Milo.", "Milo knows Naomi.", "Naomi knows Joyce." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Candice", "Naomi", "Darren", "Joyce", "Milo", "Kent", "Andre", "Eldon", "Holly", "Paul", "Clark", "Rocco", "Yasmin", "Sadie", "Dennis", "Lionel", "Desmond", "Diego", "Chester", "Fleur" ], "edges": [ [ 0, 4 ], [ 1, 3 ], [ 3, 5 ], [ 3, 6 ], [ 3, 9 ], [ 4, 1 ], [ 5, 2 ], [ 6, 8 ], [ 9, 7 ], [ 10, 14 ], [ 11, 13 ], [ 13, 15 ], [ 13, 16 ], [ 13, 19 ], [ 14, 11 ], [ 15, 12 ], [ 16, 18 ], [ 19, 17 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Arthur knows Elvira. Karen knows Earl. Kennedy knows Arthur. Zachary knows India. Karen knows Derrick. Electra knows Ruth. Derrick knows Liam. Karen knows Mildred. Leslie knows Jonah. Camille knows Taylor. Earl knows Clay. Clay knows Electra. Leslie knows Kennedy. Leslie knows Zachary. India knows Cole. Jonah knows Alison. Mildred knows Camille. Cole knows Claude. Which of Electra and Cole can Leslie reach?", "answer": "Cole", "steps": [ "Leslie knows Zachary.", "Zachary knows India.", "India knows Cole." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Leslie", "Alison", "Zachary", "Elvira", "India", "Cole", "Kennedy", "Claude", "Jonah", "Arthur", "Karen", "Liam", "Earl", "Taylor", "Clay", "Electra", "Mildred", "Ruth", "Derrick", "Camille" ], "edges": [ [ 0, 2 ], [ 0, 8 ], [ 0, 6 ], [ 2, 4 ], [ 4, 5 ], [ 5, 7 ], [ 6, 9 ], [ 8, 1 ], [ 9, 3 ], [ 10, 12 ], [ 10, 18 ], [ 10, 16 ], [ 12, 14 ], [ 14, 15 ], [ 15, 17 ], [ 16, 19 ], [ 18, 11 ], [ 19, 13 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Louis knows Andrea. Doug knows Louis. Chris knows Noah. Noah knows Duncan. Trevor knows Morris. Hardy knows Dina. Hardy knows Tamara. Aspen knows Duke. Trevor knows Geoffrey. Chandler knows Dorothy. Louis knows Hardy. Chris knows Trevor. Virgil knows Doug. Duke knows Cordelia. Andrea knows Miriam. Cordelia knows Chris. Chandler knows Virgil. Aspen knows Delia. Which of Doug and Cordelia can Chandler reach?", "answer": "Doug", "steps": [ "Chandler knows Virgil.", "Virgil knows Doug." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Chandler", "Dina", "Doug", "Tamara", "Andrea", "Miriam", "Virgil", "Louis", "Hardy", "Dorothy", "Aspen", "Morris", "Cordelia", "Geoffrey", "Noah", "Duncan", "Duke", "Chris", "Trevor", "Delia" ], "edges": [ [ 0, 6 ], [ 0, 9 ], [ 2, 7 ], [ 4, 5 ], [ 6, 2 ], [ 7, 4 ], [ 7, 8 ], [ 8, 1 ], [ 8, 3 ], [ 10, 16 ], [ 10, 19 ], [ 12, 17 ], [ 14, 15 ], [ 16, 12 ], [ 17, 14 ], [ 17, 18 ], [ 18, 11 ], [ 18, 13 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Roger knows Pierce. Jude knows Barney. Clyde knows Simon. Pierce knows Dewey. Marco knows Clyde. Ibrahim knows Doug. Jude knows Lars. Cyrus knows Roger. Marco knows Elodie. Ibrahim knows Holden. Pierce knows Megan. Cyrus knows Esperanza. Marco knows Jerry. Marco knows Jaime. Clyde knows Will. Pierce knows Gareth. Doug knows Marco. Pierce knows Jude. Which of Roger and Doug can Cyrus reach?", "answer": "Roger", "steps": [ "Cyrus knows Roger." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Cyrus", "Roger", "Esperanza", "Pierce", "Dewey", "Gareth", "Jude", "Barney", "Lars", "Megan", "Ibrahim", "Doug", "Holden", "Marco", "Jaime", "Jerry", "Clyde", "Simon", "Will", "Elodie" ], "edges": [ [ 0, 2 ], [ 0, 1 ], [ 1, 3 ], [ 3, 4 ], [ 3, 5 ], [ 3, 6 ], [ 3, 9 ], [ 6, 7 ], [ 6, 8 ], [ 10, 12 ], [ 10, 11 ], [ 11, 13 ], [ 13, 14 ], [ 13, 15 ], [ 13, 16 ], [ 13, 19 ], [ 16, 17 ], [ 16, 18 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Jim knows Ronald. Elsa knows Jeff. Carmela knows Thomas. Anastasia knows Tara. Jeff knows Olivia. Scott knows Cyrus. Anastasia knows Amanda. Lawson knows Fabian. Jeff knows Scott. Michael knows Luke. Jeff knows Carmela. Amanda knows Enid. Carmela knows Louise. Isla knows Jim. Amanda knows Chase. Ronald knows Anastasia. Anastasia knows Michael. Fabian knows Elsa. Which of Thomas and Chase can Lawson reach?", "answer": "Thomas", "steps": [ "Lawson knows Fabian.", "Fabian knows Elsa.", "Elsa knows Jeff.", "Jeff knows Carmela.", "Carmela knows Thomas." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Lawson", "Elsa", "Thomas", "Fabian", "Jeff", "Cyrus", "Louise", "Carmela", "Scott", "Olivia", "Isla", "Ronald", "Chase", "Jim", "Anastasia", "Luke", "Enid", "Amanda", "Michael", "Tara" ], "edges": [ [ 0, 3 ], [ 1, 4 ], [ 3, 1 ], [ 4, 7 ], [ 4, 8 ], [ 4, 9 ], [ 7, 2 ], [ 7, 6 ], [ 8, 5 ], [ 10, 13 ], [ 11, 14 ], [ 13, 11 ], [ 14, 17 ], [ 14, 18 ], [ 14, 19 ], [ 17, 12 ], [ 17, 16 ], [ 18, 15 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Jarvis knows Marshall. Brandon knows Lambert. Charlene knows Kirk. Owen knows Amelia. Edison knows Derek. Charlene knows William. Jackson knows Owen. Jarvis knows Eli. Marshall knows Preston. Finn knows Ella. Virginia knows Edison. Finn knows Virginia. Finn knows Carrie. William knows Jarvis. Carrie knows Brandon. Edison knows Doug. Charlene knows Jackson. Doug knows Kathleen. Which of Jarvis and Edison can Finn reach?", "answer": "Edison", "steps": [ "Finn knows Virginia.", "Virginia knows Edison." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Finn", "Derek", "Virginia", "Brandon", "Kathleen", "Carrie", "Lambert", "Ella", "Doug", "Edison", "Charlene", "Eli", "William", "Owen", "Preston", "Jackson", "Amelia", "Kirk", "Marshall", "Jarvis" ], "edges": [ [ 0, 5 ], [ 0, 7 ], [ 0, 2 ], [ 2, 9 ], [ 3, 6 ], [ 5, 3 ], [ 8, 4 ], [ 9, 1 ], [ 9, 8 ], [ 10, 15 ], [ 10, 17 ], [ 10, 12 ], [ 12, 19 ], [ 13, 16 ], [ 15, 13 ], [ 18, 14 ], [ 19, 11 ], [ 19, 18 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Tamara knows Palmer. Earle knows Odette. Brenda knows Jack. Loretta knows Shaun. Jocelyn knows Tamara. Odette knows Amelia. Amelia knows Dahlia. Riley knows Saul. Caleb knows Rhonda. Odette knows Brenda. Laurel knows Julius. Tamara knows Laurel. Jeremy knows Loretta. Dahlia knows Whitney. Palmer knows Caleb. Dahlia knows Riley. Saul knows Esme. Caleb knows Jeremy. Which of Esme and Shaun can Earle reach?", "answer": "Esme", "steps": [ "Earle knows Odette.", "Odette knows Amelia.", "Amelia knows Dahlia.", "Dahlia knows Riley.", "Riley knows Saul.", "Saul knows Esme." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Earle", "Amelia", "Odette", "Dahlia", "Riley", "Esme", "Saul", "Brenda", "Jack", "Whitney", "Jocelyn", "Palmer", "Tamara", "Caleb", "Jeremy", "Shaun", "Loretta", "Laurel", "Julius", "Rhonda" ], "edges": [ [ 0, 2 ], [ 1, 3 ], [ 2, 7 ], [ 2, 1 ], [ 3, 4 ], [ 3, 9 ], [ 4, 6 ], [ 6, 5 ], [ 7, 8 ], [ 10, 12 ], [ 11, 13 ], [ 12, 17 ], [ 12, 11 ], [ 13, 14 ], [ 13, 19 ], [ 14, 16 ], [ 16, 15 ], [ 17, 18 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Hank knows Reed. Elmer knows Mindy. Zachary knows Langston. Blaine knows Finn. Finn knows Geoffrey. Xander knows Elmer. Reed knows Davis. Mindy knows Miriam. Davis knows Fanny. Xander knows Allen. Geoffrey knows Dolores. Zachary knows Val. Glen knows Essie. Celia knows Zachary. Carmen knows Xander. Dolores knows Carmen. Val knows Glen. Fanny knows Celia. Which of Val and Elmer can Blaine reach?", "answer": "Elmer", "steps": [ "Blaine knows Finn.", "Finn knows Geoffrey.", "Geoffrey knows Dolores.", "Dolores knows Carmen.", "Carmen knows Xander.", "Xander knows Elmer." ], "difficulty": 6, "original_distance": 8, "idx_to_symbol": [ "Blaine", "Geoffrey", "Carmen", "Dolores", "Allen", "Miriam", "Elmer", "Xander", "Finn", "Mindy", "Hank", "Davis", "Celia", "Fanny", "Langston", "Essie", "Val", "Zachary", "Reed", "Glen" ], "edges": [ [ 0, 8 ], [ 1, 3 ], [ 2, 7 ], [ 3, 2 ], [ 6, 9 ], [ 7, 4 ], [ 7, 6 ], [ 8, 1 ], [ 9, 5 ], [ 10, 18 ], [ 11, 13 ], [ 12, 17 ], [ 13, 12 ], [ 16, 19 ], [ 17, 14 ], [ 17, 16 ], [ 18, 11 ], [ 19, 15 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Ronald knows Colleen. Hubert knows Willis. Ronald knows Jim. Willis knows Alyssa. Wesley knows Elmer. Lamont knows Elsa. Colleen knows Hubert. Colleen knows Eduardo. Eli knows Gage. Harper knows Cole. Alvin knows Cruz. Lamont knows Alvin. Alyssa knows Wesley. Esme knows Ronald. Cruz knows Eli. Gage knows Harper. Alvin knows Cornelius. Madeline knows Lamont. Which of Harper and Wesley can Madeline reach?", "answer": "Harper", "steps": [ "Madeline knows Lamont.", "Lamont knows Alvin.", "Alvin knows Cruz.", "Cruz knows Eli.", "Eli knows Gage.", "Gage knows Harper." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Madeline", "Elsa", "Eli", "Cruz", "Harper", "Lamont", "Cornelius", "Alvin", "Gage", "Cole", "Esme", "Jim", "Willis", "Hubert", "Wesley", "Ronald", "Eduardo", "Colleen", "Alyssa", "Elmer" ], "edges": [ [ 0, 5 ], [ 2, 8 ], [ 3, 2 ], [ 4, 9 ], [ 5, 1 ], [ 5, 7 ], [ 7, 6 ], [ 7, 3 ], [ 8, 4 ], [ 10, 15 ], [ 12, 18 ], [ 13, 12 ], [ 14, 19 ], [ 15, 11 ], [ 15, 17 ], [ 17, 16 ], [ 17, 13 ], [ 18, 14 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Harry knows Ben. Daphna knows Keira. Daphna knows Axel. Ezra knows Justine. Lambert knows James. James knows Vicki. Keira knows Edison. Wilbur knows Carey. Gwen knows Ezra. Ben knows Gene. Selena knows Dominic. Carey knows Harry. Wilbur knows Barry. Wilbur knows Eve. Barry knows Gwen. Vicki knows Ramona. Edison knows Selena. Daphna knows Lambert. Which of Vicki and Ezra can Wilbur reach?", "answer": "Ezra", "steps": [ "Wilbur knows Barry.", "Barry knows Gwen.", "Gwen knows Ezra." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Wilbur", "Justine", "Eve", "Gene", "Barry", "Gwen", "Harry", "Ezra", "Ben", "Carey", "Daphna", "Ramona", "Axel", "Dominic", "Lambert", "James", "Edison", "Vicki", "Selena", "Keira" ], "edges": [ [ 0, 2 ], [ 0, 4 ], [ 0, 9 ], [ 4, 5 ], [ 5, 7 ], [ 6, 8 ], [ 7, 1 ], [ 8, 3 ], [ 9, 6 ], [ 10, 12 ], [ 10, 14 ], [ 10, 19 ], [ 14, 15 ], [ 15, 17 ], [ 16, 18 ], [ 17, 11 ], [ 18, 13 ], [ 19, 16 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Flora knows Lucia. Russell knows Owen. Neal knows Desmond. Zara knows Bonnie. Bonnie knows Dana. Maria knows Flora. Livia knows Katrina. Martin knows Maria. Knox knows Charles. Owen knows Livia. Bonnie knows Allan. Livia knows Peggy. Katrina knows Neal. Knox knows Zara. Desmond knows Will. Dana knows Martin. Russell knows Chelsea. Will knows Colin. Which of Katrina and Dana can Knox reach?", "answer": "Dana", "steps": [ "Knox knows Zara.", "Zara knows Bonnie.", "Bonnie knows Dana." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Knox", "Flora", "Allan", "Dana", "Bonnie", "Zara", "Maria", "Lucia", "Charles", "Martin", "Russell", "Will", "Peggy", "Katrina", "Livia", "Owen", "Desmond", "Colin", "Chelsea", "Neal" ], "edges": [ [ 0, 8 ], [ 0, 5 ], [ 1, 7 ], [ 3, 9 ], [ 4, 2 ], [ 4, 3 ], [ 5, 4 ], [ 6, 1 ], [ 9, 6 ], [ 10, 18 ], [ 10, 15 ], [ 11, 17 ], [ 13, 19 ], [ 14, 12 ], [ 14, 13 ], [ 15, 14 ], [ 16, 11 ], [ 19, 16 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Vivian knows June. Gareth knows Burt. Glen knows Aisha. Gilbert knows Glen. Karl knows Henry. Layla knows Alice. June knows Caleb. Blair knows Cate. Blair knows Mitchell. Jackson knows Karl. Mitchell knows Vivian. Cate knows Layla. Aisha knows Gareth. Jack knows Rowan. Burt knows Hudson. Rowan knows Blair. Glen knows Jackson. Jolena knows Gilbert. Which of Blair and Glen can Jack reach?", "answer": "Blair", "steps": [ "Jack knows Rowan.", "Rowan knows Blair." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Jack", "Vivian", "Layla", "Rowan", "Blair", "Cate", "Caleb", "June", "Alice", "Mitchell", "Jolena", "Gareth", "Karl", "Gilbert", "Glen", "Jackson", "Hudson", "Burt", "Henry", "Aisha" ], "edges": [ [ 0, 3 ], [ 1, 7 ], [ 2, 8 ], [ 3, 4 ], [ 4, 5 ], [ 4, 9 ], [ 5, 2 ], [ 7, 6 ], [ 9, 1 ], [ 10, 13 ], [ 11, 17 ], [ 12, 18 ], [ 13, 14 ], [ 14, 15 ], [ 14, 19 ], [ 15, 12 ], [ 17, 16 ], [ 19, 11 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Denise knows Eldon. Gene knows Denise. Chad knows Shelby. Chad knows Erwin. Gertrude knows Hank. Reed knows Lottie. Gertrude knows James. Jane knows Claire. Chad knows Gene. James knows Nelson. Nelson knows Enrique. Claire knows Gordon. Kimberly knows Chad. Kimberly knows Reed. Gertrude knows Kendra. Lottie knows Alexa. Jane knows Gertrude. Gordon knows Kane. Which of Denise and Nelson can Jane reach?", "answer": "Nelson", "steps": [ "Jane knows Gertrude.", "Gertrude knows James.", "James knows Nelson." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Jane", "Gertrude", "Kane", "Enrique", "Claire", "Hank", "Kendra", "James", "Nelson", "Gordon", "Kimberly", "Chad", "Alexa", "Eldon", "Reed", "Erwin", "Shelby", "Gene", "Denise", "Lottie" ], "edges": [ [ 0, 1 ], [ 0, 4 ], [ 1, 5 ], [ 1, 6 ], [ 1, 7 ], [ 4, 9 ], [ 7, 8 ], [ 8, 3 ], [ 9, 2 ], [ 10, 11 ], [ 10, 14 ], [ 11, 15 ], [ 11, 16 ], [ 11, 17 ], [ 14, 19 ], [ 17, 18 ], [ 18, 13 ], [ 19, 12 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Jarvis knows Clay. Will knows Kendrick. Philip knows Dirk. June knows Brooks. Marshall knows Loretta. Tony knows Lyle. Milton knows Jarvis. Kendrick knows Marshall. Marco knows Will. Israel knows Marco. Kendrick knows Gene. Milton knows Seth. Will knows Lola. Laverne knows Jorge. June knows Milton. Clay knows Laverne. Dirk knows June. Loretta knows Tony. Which of Kendrick and Milton can Israel reach?", "answer": "Kendrick", "steps": [ "Israel knows Marco.", "Marco knows Will.", "Will knows Kendrick." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Israel", "Lyle", "Will", "Gene", "Tony", "Kendrick", "Marshall", "Marco", "Lola", "Loretta", "Philip", "Jorge", "June", "Seth", "Laverne", "Milton", "Jarvis", "Dirk", "Brooks", "Clay" ], "edges": [ [ 0, 7 ], [ 2, 8 ], [ 2, 5 ], [ 4, 1 ], [ 5, 3 ], [ 5, 6 ], [ 6, 9 ], [ 7, 2 ], [ 9, 4 ], [ 10, 17 ], [ 12, 18 ], [ 12, 15 ], [ 14, 11 ], [ 15, 13 ], [ 15, 16 ], [ 16, 19 ], [ 17, 12 ], [ 19, 14 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Frida knows Gonzalo. Nadine knows Greta. Shannon knows Harley. George knows Raymond. Carlton knows Celia. Carol knows Carlton. Nadine knows Kenzie. Gonzalo knows George. Joel knows Riley. Carlton knows Bryan. Robert knows Kennedy. Gonzalo knows Shannon. Shannon knows Jorge. Celia knows Jessica. Carol knows Nadine. Riley knows Carol. Gemma knows Frida. George knows Robert. Which of Robert and Celia can Gemma reach?", "answer": "Robert", "steps": [ "Gemma knows Frida.", "Frida knows Gonzalo.", "Gonzalo knows George.", "George knows Robert." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Gemma", "Raymond", "Frida", "Harley", "George", "Shannon", "Robert", "Kennedy", "Jorge", "Gonzalo", "Joel", "Bryan", "Riley", "Kenzie", "Carlton", "Nadine", "Celia", "Jessica", "Greta", "Carol" ], "edges": [ [ 0, 2 ], [ 2, 9 ], [ 4, 1 ], [ 4, 6 ], [ 5, 3 ], [ 5, 8 ], [ 6, 7 ], [ 9, 4 ], [ 9, 5 ], [ 10, 12 ], [ 12, 19 ], [ 14, 11 ], [ 14, 16 ], [ 15, 13 ], [ 15, 18 ], [ 16, 17 ], [ 19, 14 ], [ 19, 15 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Darren knows Hunter. Lee knows Dick. Howard knows Cordelia. Howard knows Lee. Diana knows Inez. Herman knows Lorenzo. Howard knows Conrad. Lorenzo knows Paula. Dick knows Janet. Conrad knows Uma. Howard knows Cody. Herman knows Rebecca. Dick knows Emmett. Paula knows Hampton. Emmett knows Duncan. Herman knows Louis. Paula knows Diana. Herman knows Darren. Which of Emmett and Diana can Herman reach?", "answer": "Diana", "steps": [ "Herman knows Lorenzo.", "Lorenzo knows Paula.", "Paula knows Diana." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Herman", "Paula", "Inez", "Louis", "Rebecca", "Hampton", "Diana", "Darren", "Lorenzo", "Hunter", "Howard", "Dick", "Duncan", "Cody", "Cordelia", "Janet", "Emmett", "Conrad", "Lee", "Uma" ], "edges": [ [ 0, 3 ], [ 0, 4 ], [ 0, 8 ], [ 0, 7 ], [ 1, 5 ], [ 1, 6 ], [ 6, 2 ], [ 7, 9 ], [ 8, 1 ], [ 10, 13 ], [ 10, 14 ], [ 10, 18 ], [ 10, 17 ], [ 11, 15 ], [ 11, 16 ], [ 16, 12 ], [ 17, 19 ], [ 18, 11 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Clark knows Arlene. Lambert knows Isadora. Hayes knows Deanna. Trudy knows Monica. Livia knows Lamont. Alan knows Livia. Trudy knows Hayes. Lamont knows Lionel. William knows Lambert. Lionel knows Trudy. William knows Liam. Sebastian knows William. Kendrick knows Sebastian. Lambert knows Hudson. Alan knows Phoebe. Arlene knows Kendrick. Hayes knows Brandon. Clark knows India. Which of Sebastian and Lionel can Clark reach?", "answer": "Sebastian", "steps": [ "Clark knows Arlene.", "Arlene knows Kendrick.", "Kendrick knows Sebastian." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Clark", "Liam", "India", "Lambert", "Isadora", "Kendrick", "William", "Hudson", "Arlene", "Sebastian", "Alan", "Monica", "Phoebe", "Hayes", "Deanna", "Lamont", "Trudy", "Brandon", "Livia", "Lionel" ], "edges": [ [ 0, 2 ], [ 0, 8 ], [ 3, 4 ], [ 3, 7 ], [ 5, 9 ], [ 6, 1 ], [ 6, 3 ], [ 8, 5 ], [ 9, 6 ], [ 10, 12 ], [ 10, 18 ], [ 13, 14 ], [ 13, 17 ], [ 15, 19 ], [ 16, 11 ], [ 16, 13 ], [ 18, 15 ], [ 19, 16 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Frankie knows Gertrude. Jodi knows Emily. Scott knows Austin. Yvette knows Greer. Austin knows Kim. Bob knows Eve. Lloyd knows Jerry. Jerry knows Chantal. Porter knows Bob. Frankie knows Tanya. Clay knows Lloyd. Eve knows Carmen. Clay knows Yvette. Kim knows Clay. Carmen knows Lionel. Tanya knows Porter. Bob knows Jodi. Scott knows Belinda. Which of Lionel and Chantal can Scott reach?", "answer": "Chantal", "steps": [ "Scott knows Austin.", "Austin knows Kim.", "Kim knows Clay.", "Clay knows Lloyd.", "Lloyd knows Jerry.", "Jerry knows Chantal." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Scott", "Kim", "Yvette", "Lloyd", "Chantal", "Belinda", "Jerry", "Greer", "Austin", "Clay", "Frankie", "Porter", "Jodi", "Eve", "Lionel", "Gertrude", "Carmen", "Emily", "Tanya", "Bob" ], "edges": [ [ 0, 5 ], [ 0, 8 ], [ 1, 9 ], [ 2, 7 ], [ 3, 6 ], [ 6, 4 ], [ 8, 1 ], [ 9, 3 ], [ 9, 2 ], [ 10, 15 ], [ 10, 18 ], [ 11, 19 ], [ 12, 17 ], [ 13, 16 ], [ 16, 14 ], [ 18, 11 ], [ 19, 13 ], [ 19, 12 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Hannah knows Leroy. Ronald knows Graeme. Ray knows Terry. Hannah knows Daisy. Troy knows Ronald. Graeme knows Rose. Terry knows Yvonne. Anna knows Ray. Ethan knows Archer. Rose knows Ethan. Candice knows Anna. Archer knows Chris. Candice knows Clarence. Yvonne knows Nelson. Hannah knows Troy. Nelson knows Skyler. Candice knows Patricia. Skyler knows Billy. Which of Archer and Skyler can Hannah reach?", "answer": "Archer", "steps": [ "Hannah knows Troy.", "Troy knows Ronald.", "Ronald knows Graeme.", "Graeme knows Rose.", "Rose knows Ethan.", "Ethan knows Archer." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Hannah", "Ethan", "Troy", "Rose", "Ronald", "Archer", "Chris", "Daisy", "Graeme", "Leroy", "Candice", "Nelson", "Anna", "Yvonne", "Ray", "Skyler", "Billy", "Patricia", "Terry", "Clarence" ], "edges": [ [ 0, 7 ], [ 0, 2 ], [ 0, 9 ], [ 1, 5 ], [ 2, 4 ], [ 3, 1 ], [ 4, 8 ], [ 5, 6 ], [ 8, 3 ], [ 10, 17 ], [ 10, 12 ], [ 10, 19 ], [ 11, 15 ], [ 12, 14 ], [ 13, 11 ], [ 14, 18 ], [ 15, 16 ], [ 18, 13 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Lauren knows Janice. Lauren knows Nell. Lauren knows Reid. Larry knows Merle. Eric knows Drew. Miranda knows Connor. Estelle knows Lauren. Larry knows Eric. Leland knows Joy. Reid knows Joel. Boris knows Larry. Larry knows Leland. Leland knows Miranda. Keegan knows David. Larry knows Joaquin. Reid knows Ashton. Lauren knows Keegan. Joel knows Elias. Which of Lauren and Larry can Estelle reach?", "answer": "Lauren", "steps": [ "Estelle knows Lauren." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Estelle", "Keegan", "Ashton", "Janice", "Nell", "Joel", "Elias", "Lauren", "David", "Reid", "Boris", "Eric", "Joy", "Merle", "Joaquin", "Miranda", "Connor", "Larry", "Drew", "Leland" ], "edges": [ [ 0, 7 ], [ 1, 8 ], [ 5, 6 ], [ 7, 3 ], [ 7, 4 ], [ 7, 1 ], [ 7, 9 ], [ 9, 2 ], [ 9, 5 ], [ 10, 17 ], [ 11, 18 ], [ 15, 16 ], [ 17, 13 ], [ 17, 14 ], [ 17, 11 ], [ 17, 19 ], [ 19, 12 ], [ 19, 15 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Tim knows Susanne. Emery knows Dawn. Susanne knows Franklin. Susanne knows Odette. Electra knows Philip. Arlene knows Carmen. Jasper knows Emery. Barbara knows Emanuel. Gladys knows Nelson. Electra knows Bart. Arlene knows Jasper. Odette knows Barbara. Carmen knows Electra. Franklin knows Steve. Steve knows Mia. Ivy knows Tim. Nelson knows Arlene. Barbara knows Jakob. Which of Steve and Emery can Gladys reach?", "answer": "Emery", "steps": [ "Gladys knows Nelson.", "Nelson knows Arlene.", "Arlene knows Jasper.", "Jasper knows Emery." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Gladys", "Philip", "Carmen", "Electra", "Dawn", "Arlene", "Emery", "Bart", "Nelson", "Jasper", "Ivy", "Jakob", "Odette", "Barbara", "Mia", "Susanne", "Steve", "Emanuel", "Tim", "Franklin" ], "edges": [ [ 0, 8 ], [ 2, 3 ], [ 3, 1 ], [ 3, 7 ], [ 5, 2 ], [ 5, 9 ], [ 6, 4 ], [ 8, 5 ], [ 9, 6 ], [ 10, 18 ], [ 12, 13 ], [ 13, 11 ], [ 13, 17 ], [ 15, 12 ], [ 15, 19 ], [ 16, 14 ], [ 18, 15 ], [ 19, 16 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Bridget knows Grady. Rachel knows Gerard. Ingrid knows Brock. Etta knows Ignacio. Ingrid knows Steve. Percy knows Norman. Carter knows Finn. Carter knows Miles. Finn knows Ira. Norman knows Ada. Norman knows Carter. Gerard knows Ingrid. Steve knows Eloise. Gerard knows Milton. Etta knows Ivan. Carter knows Etta. Steve knows Michelle. Ingrid knows Bridget. Which of Etta and Steve can Rachel reach?", "answer": "Steve", "steps": [ "Rachel knows Gerard.", "Gerard knows Ingrid.", "Ingrid knows Steve." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Rachel", "Michelle", "Ingrid", "Brock", "Grady", "Gerard", "Milton", "Steve", "Eloise", "Bridget", "Percy", "Ivan", "Carter", "Miles", "Ira", "Norman", "Ada", "Etta", "Ignacio", "Finn" ], "edges": [ [ 0, 5 ], [ 2, 3 ], [ 2, 7 ], [ 2, 9 ], [ 5, 6 ], [ 5, 2 ], [ 7, 1 ], [ 7, 8 ], [ 9, 4 ], [ 10, 15 ], [ 12, 13 ], [ 12, 17 ], [ 12, 19 ], [ 15, 16 ], [ 15, 12 ], [ 17, 11 ], [ 17, 18 ], [ 19, 14 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Nolan knows Keaton. Jim knows Fraser. Jim knows Davis. Davis knows Kara. Hayden knows Alvin. Hayden knows Archie. Nolan knows Lee. Nolan knows Tonya. Hayden knows Effie. Brody knows Nolan. Beth knows Hardy. Beth knows Loretta. Davis knows Homer. Effie knows Norma. Fraser knows Hayden. Karina knows Brody. Tonya knows Kenneth. Karina knows Beth. Which of Hayden and Nolan can Karina reach?", "answer": "Nolan", "steps": [ "Karina knows Brody.", "Brody knows Nolan." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Karina", "Lee", "Loretta", "Kenneth", "Keaton", "Brody", "Beth", "Nolan", "Tonya", "Hardy", "Jim", "Alvin", "Kara", "Norma", "Archie", "Fraser", "Davis", "Hayden", "Effie", "Homer" ], "edges": [ [ 0, 5 ], [ 0, 6 ], [ 5, 7 ], [ 6, 2 ], [ 6, 9 ], [ 7, 1 ], [ 7, 4 ], [ 7, 8 ], [ 8, 3 ], [ 10, 15 ], [ 10, 16 ], [ 15, 17 ], [ 16, 12 ], [ 16, 19 ], [ 17, 11 ], [ 17, 14 ], [ 17, 18 ], [ 18, 13 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Mario knows Victor. Lorna knows Zach. Jacqueline knows Marc. Jacqueline knows Ellis. Daniella knows Mario. Jacob knows Graham. Teresa knows Bonnie. Devin knows Dahlia. Lucas knows Teresa. Marc knows Daniel. Gordon knows Lucille. Daniella knows Lucas. Teresa knows Gordon. Devin knows Lorna. Daniel knows Jacob. Victor knows Lark. Ellis knows Devin. Lark knows Cesar. Which of Lucille and Zach can Daniella reach?", "answer": "Lucille", "steps": [ "Daniella knows Lucas.", "Lucas knows Teresa.", "Teresa knows Gordon.", "Gordon knows Lucille." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Daniella", "Cesar", "Teresa", "Bonnie", "Lucille", "Gordon", "Victor", "Lark", "Mario", "Lucas", "Jacqueline", "Graham", "Devin", "Dahlia", "Zach", "Lorna", "Daniel", "Jacob", "Marc", "Ellis" ], "edges": [ [ 0, 8 ], [ 0, 9 ], [ 2, 3 ], [ 2, 5 ], [ 5, 4 ], [ 6, 7 ], [ 7, 1 ], [ 8, 6 ], [ 9, 2 ], [ 10, 18 ], [ 10, 19 ], [ 12, 13 ], [ 12, 15 ], [ 15, 14 ], [ 16, 17 ], [ 17, 11 ], [ 18, 16 ], [ 19, 12 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Frankie knows Gertrude. Jodi knows Emily. Scott knows Austin. Yvette knows Greer. Austin knows Kim. Bob knows Eve. Lloyd knows Jerry. Jerry knows Chantal. Porter knows Bob. Frankie knows Tanya. Clay knows Lloyd. Eve knows Carmen. Clay knows Yvette. Kim knows Clay. Carmen knows Lionel. Tanya knows Porter. Bob knows Jodi. Scott knows Belinda. Which of Lloyd and Eve can Scott reach?", "answer": "Lloyd", "steps": [ "Scott knows Austin.", "Austin knows Kim.", "Kim knows Clay.", "Clay knows Lloyd." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Scott", "Kim", "Yvette", "Lloyd", "Chantal", "Belinda", "Jerry", "Greer", "Austin", "Clay", "Frankie", "Porter", "Jodi", "Eve", "Lionel", "Gertrude", "Carmen", "Emily", "Tanya", "Bob" ], "edges": [ [ 0, 5 ], [ 0, 8 ], [ 1, 9 ], [ 2, 7 ], [ 3, 6 ], [ 6, 4 ], [ 8, 1 ], [ 9, 3 ], [ 9, 2 ], [ 10, 15 ], [ 10, 18 ], [ 11, 19 ], [ 12, 17 ], [ 13, 16 ], [ 16, 14 ], [ 18, 11 ], [ 19, 13 ], [ 19, 12 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Daniel knows Haley. Kelly knows Vance. Axel knows Bryan. Nina knows Wayne. Axel knows Sheila. Sheila knows Richard. Electra knows Jon. Kelly knows Edward. Wayne knows Dana. Vance knows Nina. Hailey knows Tyler. Gemma knows Naomi. Daniel knows Kate. Electra knows Hailey. Haley knows Fisher. Fisher knows Axel. Wayne knows Electra. Sheila knows Gemma. Which of Wayne and Axel can Daniel reach?", "answer": "Axel", "steps": [ "Daniel knows Haley.", "Haley knows Fisher.", "Fisher knows Axel." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Daniel", "Sheila", "Naomi", "Richard", "Haley", "Bryan", "Fisher", "Gemma", "Axel", "Kate", "Kelly", "Electra", "Tyler", "Jon", "Vance", "Dana", "Nina", "Hailey", "Wayne", "Edward" ], "edges": [ [ 0, 4 ], [ 0, 9 ], [ 1, 3 ], [ 1, 7 ], [ 4, 6 ], [ 6, 8 ], [ 7, 2 ], [ 8, 5 ], [ 8, 1 ], [ 10, 14 ], [ 10, 19 ], [ 11, 13 ], [ 11, 17 ], [ 14, 16 ], [ 16, 18 ], [ 17, 12 ], [ 18, 15 ], [ 18, 11 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Livia knows Aisha. Jim knows Liam. Dana knows Thomas. Tabitha knows Karl. Frida knows Pete. Dana knows Tabitha. Liam knows Gonzalo. Joyce knows Dana. Aisha knows Jeremiah. Livia knows Isla. Gonzalo knows Julio. Jim knows Leopold. Asher knows Joyce. Arden knows Jolene. Joyce knows Frida. Gonzalo knows Livia. Arden knows Asher. Julio knows Devin. Which of Liam and Asher can Arden reach?", "answer": "Asher", "steps": [ "Arden knows Asher." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Arden", "Asher", "Frida", "Tabitha", "Dana", "Joyce", "Jolene", "Pete", "Karl", "Thomas", "Jim", "Liam", "Julio", "Aisha", "Livia", "Gonzalo", "Leopold", "Devin", "Jeremiah", "Isla" ], "edges": [ [ 0, 6 ], [ 0, 1 ], [ 1, 5 ], [ 2, 7 ], [ 3, 8 ], [ 4, 3 ], [ 4, 9 ], [ 5, 2 ], [ 5, 4 ], [ 10, 16 ], [ 10, 11 ], [ 11, 15 ], [ 12, 17 ], [ 13, 18 ], [ 14, 13 ], [ 14, 19 ], [ 15, 12 ], [ 15, 14 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Eloise knows Cameron. Lauren knows Dell. Bernice knows Dalton. Connor knows Alana. Beth knows Connor. Beth knows Dewey. Matthew knows Barney. Katherine knows Bernice. Lauren knows Katherine. Bernice knows Matthew. Alana knows Jake. Dewey knows Gustavo. Eloise knows Ilene. Cameron knows Beth. Barney knows Amber. Dalton knows Erma. Dalton knows Forrest. Dewey knows Landon. Which of Katherine and Cameron can Lauren reach?", "answer": "Katherine", "steps": [ "Lauren knows Katherine." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Lauren", "Dalton", "Katherine", "Bernice", "Erma", "Dell", "Barney", "Forrest", "Matthew", "Amber", "Eloise", "Dewey", "Cameron", "Beth", "Landon", "Ilene", "Alana", "Gustavo", "Connor", "Jake" ], "edges": [ [ 0, 5 ], [ 0, 2 ], [ 1, 4 ], [ 1, 7 ], [ 2, 3 ], [ 3, 1 ], [ 3, 8 ], [ 6, 9 ], [ 8, 6 ], [ 10, 15 ], [ 10, 12 ], [ 11, 14 ], [ 11, 17 ], [ 12, 13 ], [ 13, 11 ], [ 13, 18 ], [ 16, 19 ], [ 18, 16 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Bernadette knows Darren. Annette knows Colby. Bernadette knows Marlene. Hayes knows Maya. Ilene knows Nadine. Joel knows Amanda. Hayes knows Annette. Roy knows Stefan. Mabel knows Randall. Joel knows Mabel. Hayes knows Wesley. Ilene knows Trevor. Joel knows Roy. Maya knows Reid. Ilene knows Joel. Bernadette knows Hayes. Joel knows Glenda. Hayes knows Jason. Which of Hayes and Joel can Bernadette reach?", "answer": "Hayes", "steps": [ "Bernadette knows Hayes." ], "difficulty": 1, "original_distance": 3, "idx_to_symbol": [ "Bernadette", "Darren", "Annette", "Colby", "Jason", "Wesley", "Maya", "Reid", "Hayes", "Marlene", "Ilene", "Nadine", "Roy", "Stefan", "Amanda", "Glenda", "Mabel", "Randall", "Joel", "Trevor" ], "edges": [ [ 0, 1 ], [ 0, 8 ], [ 0, 9 ], [ 2, 3 ], [ 6, 7 ], [ 8, 2 ], [ 8, 4 ], [ 8, 5 ], [ 8, 6 ], [ 10, 11 ], [ 10, 18 ], [ 10, 19 ], [ 12, 13 ], [ 16, 17 ], [ 18, 12 ], [ 18, 14 ], [ 18, 15 ], [ 18, 16 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Hubert knows Vivian. Victoria knows Becky. Cornelius knows Lark. Alyssa knows Caroline. Dana knows Lorraine. Lark knows Ruth. Allen knows Hendrix. Sebastian knows Victoria. Vivian knows Tabitha. Harris knows Dana. Becky knows Eamon. Eamon knows Alyssa. Lorraine knows Lawrence. Caroline knows Chloe. Lorraine knows Cornelius. Lawrence knows Randy. Alyssa knows Hubert. Hendrix knows Harris. Which of Alyssa and Lorraine can Allen reach?", "answer": "Lorraine", "steps": [ "Allen knows Hendrix.", "Hendrix knows Harris.", "Harris knows Dana.", "Dana knows Lorraine." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Allen", "Lawrence", "Cornelius", "Harris", "Lark", "Dana", "Ruth", "Lorraine", "Hendrix", "Randy", "Sebastian", "Caroline", "Hubert", "Becky", "Vivian", "Eamon", "Tabitha", "Alyssa", "Victoria", "Chloe" ], "edges": [ [ 0, 8 ], [ 1, 9 ], [ 2, 4 ], [ 3, 5 ], [ 4, 6 ], [ 5, 7 ], [ 7, 2 ], [ 7, 1 ], [ 8, 3 ], [ 10, 18 ], [ 11, 19 ], [ 12, 14 ], [ 13, 15 ], [ 14, 16 ], [ 15, 17 ], [ 17, 12 ], [ 17, 11 ], [ 18, 13 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Felicia knows Clinton. Carmen knows Felicia. Elliot knows Clifford. Stefan knows Elliot. Monica knows Destiny. Darwin knows Monica. Destiny knows Chase. Fraser knows Kara. Kara knows Alfonso. Lena knows Colette. Fraser knows Yara. Yara knows Florence. Florence knows Dolores. Wilma knows Lena. Yara knows Darwin. Colette knows Howard. Stefan knows Carmen. Carmen knows Wilma. Which of Darwin and Wilma can Stefan reach?", "answer": "Wilma", "steps": [ "Stefan knows Carmen.", "Carmen knows Wilma." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Stefan", "Carmen", "Colette", "Felicia", "Clifford", "Wilma", "Lena", "Howard", "Elliot", "Clinton", "Fraser", "Yara", "Destiny", "Florence", "Alfonso", "Darwin", "Monica", "Chase", "Kara", "Dolores" ], "edges": [ [ 0, 8 ], [ 0, 1 ], [ 1, 5 ], [ 1, 3 ], [ 2, 7 ], [ 3, 9 ], [ 5, 6 ], [ 6, 2 ], [ 8, 4 ], [ 10, 18 ], [ 10, 11 ], [ 11, 15 ], [ 11, 13 ], [ 12, 17 ], [ 13, 19 ], [ 15, 16 ], [ 16, 12 ], [ 18, 14 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Faith knows Charles. Isadora knows Yasmin. Tony knows Theodore. Bella knows Thea. Faith knows Vance. Yasmin knows Faith. Fraser knows Basil. Yasmin knows Lola. Basil knows Vincent. Thea knows Bonnie. Fraser knows Whitney. Bonnie knows Fraser. Isadora knows Will. Faith knows Tony. Fraser knows Jeremiah. Bonnie knows Jack. Anastasia knows Isadora. Thea knows Hank. Which of Bonnie and Yasmin can Bella reach?", "answer": "Bonnie", "steps": [ "Bella knows Thea.", "Thea knows Bonnie." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Bella", "Hank", "Fraser", "Thea", "Basil", "Whitney", "Vincent", "Jack", "Jeremiah", "Bonnie", "Anastasia", "Will", "Faith", "Isadora", "Tony", "Charles", "Theodore", "Lola", "Vance", "Yasmin" ], "edges": [ [ 0, 3 ], [ 2, 5 ], [ 2, 4 ], [ 2, 8 ], [ 3, 1 ], [ 3, 9 ], [ 4, 6 ], [ 9, 7 ], [ 9, 2 ], [ 10, 13 ], [ 12, 15 ], [ 12, 14 ], [ 12, 18 ], [ 13, 11 ], [ 13, 19 ], [ 14, 16 ], [ 19, 17 ], [ 19, 12 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Foster knows Mindy. Lois knows Foster. Livia knows Erik. Cooper knows Opal. Rick knows Ilene. Wyatt knows Tracy. Ilene knows Chris. Chris knows Lois. Tracy knows Dirk. Alan knows Heidi. Heidi knows Wyatt. Wyatt knows Livia. Erik knows Sara. Opal knows Shaun. Dirk knows Homer. Foster knows Audrey. Erik knows Jennifer. Chris knows Cooper. Which of Lois and Livia can Rick reach?", "answer": "Lois", "steps": [ "Rick knows Ilene.", "Ilene knows Chris.", "Chris knows Lois." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Rick", "Audrey", "Foster", "Ilene", "Mindy", "Shaun", "Lois", "Chris", "Opal", "Cooper", "Alan", "Sara", "Erik", "Heidi", "Jennifer", "Homer", "Livia", "Wyatt", "Dirk", "Tracy" ], "edges": [ [ 0, 3 ], [ 2, 1 ], [ 2, 4 ], [ 3, 7 ], [ 6, 2 ], [ 7, 6 ], [ 7, 9 ], [ 8, 5 ], [ 9, 8 ], [ 10, 13 ], [ 12, 11 ], [ 12, 14 ], [ 13, 17 ], [ 16, 12 ], [ 17, 16 ], [ 17, 19 ], [ 18, 15 ], [ 19, 18 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Sylvia knows June. Gerard knows Luke. Carl knows Eve. Drew knows Brody. Luke knows Rufus. Sarah knows Sylvia. Brody knows Tonya. Miles knows Drew. Lark knows Carl. Sylvia knows Bert. Drew knows Austin. Rocco knows Colby. Sarah knows Lark. Brody knows Garrison. Drew knows Joy. Miles knows Gerard. Sylvia knows Rocco. Rocco knows Fern. Which of Rufus and Eve can Sarah reach?", "answer": "Eve", "steps": [ "Sarah knows Lark.", "Lark knows Carl.", "Carl knows Eve." ], "difficulty": 3, "original_distance": 3, "idx_to_symbol": [ "Sarah", "Lark", "Fern", "Rocco", "Eve", "Sylvia", "Bert", "Colby", "June", "Carl", "Miles", "Gerard", "Garrison", "Brody", "Rufus", "Drew", "Austin", "Tonya", "Joy", "Luke" ], "edges": [ [ 0, 5 ], [ 0, 1 ], [ 1, 9 ], [ 3, 2 ], [ 3, 7 ], [ 5, 6 ], [ 5, 3 ], [ 5, 8 ], [ 9, 4 ], [ 10, 15 ], [ 10, 11 ], [ 11, 19 ], [ 13, 12 ], [ 13, 17 ], [ 15, 16 ], [ 15, 13 ], [ 15, 18 ], [ 19, 14 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Tim knows Lucille. Lucille knows Lucy. Jermaine knows Gerald. Kim knows Jermaine. Morgan knows Earl. Randall knows Tim. Jermaine knows Cain. Randall knows Parker. Erwin knows Serena. Cynthia knows Davis. Lucy knows Fraser. Cynthia knows Barney. Erwin knows Kim. Karl knows Audrey. Earl knows Erwin. Lucy knows Electra. Karl knows Morgan. Fraser knows Cynthia. Which of Morgan and Tim can Randall reach?", "answer": "Tim", "steps": [ "Randall knows Tim." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Randall", "Lucille", "Parker", "Lucy", "Tim", "Cynthia", "Barney", "Electra", "Fraser", "Davis", "Karl", "Earl", "Audrey", "Erwin", "Morgan", "Jermaine", "Gerald", "Serena", "Kim", "Cain" ], "edges": [ [ 0, 2 ], [ 0, 4 ], [ 1, 3 ], [ 3, 7 ], [ 3, 8 ], [ 4, 1 ], [ 5, 6 ], [ 5, 9 ], [ 8, 5 ], [ 10, 12 ], [ 10, 14 ], [ 11, 13 ], [ 13, 17 ], [ 13, 18 ], [ 14, 11 ], [ 15, 16 ], [ 15, 19 ], [ 18, 15 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Henrietta knows Janet. Brad knows Harvey. Abel knows Alan. Cole knows Brad. Emily knows Henrietta. Kamila knows Clement. Clement knows Rick. Tim knows Connor. Hailey knows Carter. Trudy knows Emily. Janet knows Jay. Carter knows Tim. Tim knows Trudy. Alan knows Shaun. Clement knows Abel. Stephanie knows Kamila. Jay knows Earle. Shaun knows Cole. Which of Janet and Cole can Hailey reach?", "answer": "Janet", "steps": [ "Hailey knows Carter.", "Carter knows Tim.", "Tim knows Trudy.", "Trudy knows Emily.", "Emily knows Henrietta.", "Henrietta knows Janet." ], "difficulty": 6, "original_distance": 8, "idx_to_symbol": [ "Hailey", "Connor", "Janet", "Tim", "Emily", "Earle", "Henrietta", "Trudy", "Carter", "Jay", "Stephanie", "Rick", "Cole", "Clement", "Alan", "Harvey", "Shaun", "Abel", "Kamila", "Brad" ], "edges": [ [ 0, 8 ], [ 2, 9 ], [ 3, 1 ], [ 3, 7 ], [ 4, 6 ], [ 6, 2 ], [ 7, 4 ], [ 8, 3 ], [ 9, 5 ], [ 10, 18 ], [ 12, 19 ], [ 13, 11 ], [ 13, 17 ], [ 14, 16 ], [ 16, 12 ], [ 17, 14 ], [ 18, 13 ], [ 19, 15 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Leander knows Henry. Arthur knows India. Joseph knows Delilah. Lewis knows Daniel. Martin knows Leander. Alison knows Arthur. Kendra knows Joseph. Leander knows Susan. Lewis knows Gerard. Christian knows Kieran. Delilah knows Heath. Boyd knows Christian. Arthur knows Lewis. Susan knows Fabian. Daniel knows Boyd. Joseph knows Chloe. Boyd knows Walt. Susan knows Kendra. Which of Heath and Kieran can Alison reach?", "answer": "Kieran", "steps": [ "Alison knows Arthur.", "Arthur knows Lewis.", "Lewis knows Daniel.", "Daniel knows Boyd.", "Boyd knows Christian.", "Christian knows Kieran." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Alison", "India", "Gerard", "Arthur", "Daniel", "Kieran", "Lewis", "Christian", "Walt", "Boyd", "Martin", "Henry", "Fabian", "Leander", "Kendra", "Heath", "Susan", "Delilah", "Chloe", "Joseph" ], "edges": [ [ 0, 3 ], [ 3, 1 ], [ 3, 6 ], [ 4, 9 ], [ 6, 2 ], [ 6, 4 ], [ 7, 5 ], [ 9, 7 ], [ 9, 8 ], [ 10, 13 ], [ 13, 11 ], [ 13, 16 ], [ 14, 19 ], [ 16, 12 ], [ 16, 14 ], [ 17, 15 ], [ 19, 17 ], [ 19, 18 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Fern knows Pierce. Adelaide knows Freya. Lisa knows Pablo. Lisa knows Dylan. Priscilla knows Eric. Fern knows Homer. Eric knows Basil. Brynn knows Jodi. Basil knows Brynn. Christian knows Adelaide. Holly knows Kelsey. Jodi knows Hubert. Brynn knows Doris. Holly knows Maureen. Brynn knows Holly. Freya knows Fern. Pierce knows Kathleen. Fern knows Lisa. Which of Freya and Basil can Priscilla reach?", "answer": "Basil", "steps": [ "Priscilla knows Eric.", "Eric knows Basil." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Priscilla", "Hubert", "Jodi", "Brynn", "Holly", "Doris", "Eric", "Kelsey", "Maureen", "Basil", "Christian", "Kathleen", "Pierce", "Fern", "Lisa", "Homer", "Adelaide", "Dylan", "Pablo", "Freya" ], "edges": [ [ 0, 6 ], [ 2, 1 ], [ 3, 2 ], [ 3, 5 ], [ 3, 4 ], [ 4, 7 ], [ 4, 8 ], [ 6, 9 ], [ 9, 3 ], [ 10, 16 ], [ 12, 11 ], [ 13, 12 ], [ 13, 15 ], [ 13, 14 ], [ 14, 17 ], [ 14, 18 ], [ 16, 19 ], [ 19, 13 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Burt knows Beth. Langston knows Jamie. Ford knows Kelly. Enrique knows Langston. Langston knows Whitney. Jamie knows Anita. Eunice knows Robin. Langston knows Dakota. Enrique knows Adelaide. Anita knows Burt. Kelly knows Eunice. Jamie knows Belinda. Eunice knows Ilene. Ilene knows Sue. Ford knows Bob. Sue knows Harold. Kelly knows Jem. Kelly knows Nora. Which of Ilene and Anita can Ford reach?", "answer": "Ilene", "steps": [ "Ford knows Kelly.", "Kelly knows Eunice.", "Eunice knows Ilene." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Ford", "Harold", "Eunice", "Nora", "Jem", "Kelly", "Bob", "Ilene", "Robin", "Sue", "Enrique", "Beth", "Jamie", "Whitney", "Dakota", "Langston", "Adelaide", "Anita", "Belinda", "Burt" ], "edges": [ [ 0, 6 ], [ 0, 5 ], [ 2, 8 ], [ 2, 7 ], [ 5, 3 ], [ 5, 4 ], [ 5, 2 ], [ 7, 9 ], [ 9, 1 ], [ 10, 16 ], [ 10, 15 ], [ 12, 18 ], [ 12, 17 ], [ 15, 13 ], [ 15, 14 ], [ 15, 12 ], [ 17, 19 ], [ 19, 11 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Mario knows Victor. Lorna knows Zach. Jacqueline knows Marc. Jacqueline knows Ellis. Daniella knows Mario. Jacob knows Graham. Teresa knows Bonnie. Devin knows Dahlia. Lucas knows Teresa. Marc knows Daniel. Gordon knows Lucille. Daniella knows Lucas. Teresa knows Gordon. Devin knows Lorna. Daniel knows Jacob. Victor knows Lark. Ellis knows Devin. Lark knows Cesar. Which of Lucas and Ellis can Daniella reach?", "answer": "Lucas", "steps": [ "Daniella knows Lucas." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Daniella", "Cesar", "Teresa", "Bonnie", "Lucille", "Gordon", "Victor", "Lark", "Mario", "Lucas", "Jacqueline", "Graham", "Devin", "Dahlia", "Zach", "Lorna", "Daniel", "Jacob", "Marc", "Ellis" ], "edges": [ [ 0, 8 ], [ 0, 9 ], [ 2, 3 ], [ 2, 5 ], [ 5, 4 ], [ 6, 7 ], [ 7, 1 ], [ 8, 6 ], [ 9, 2 ], [ 10, 18 ], [ 10, 19 ], [ 12, 13 ], [ 12, 15 ], [ 15, 14 ], [ 16, 17 ], [ 17, 11 ], [ 18, 16 ], [ 19, 12 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Freya knows Jarvis. Coral knows Anton. Cynthia knows Tanya. Shaun knows Freya. Tanya knows Nelson. Conner knows Brooks. Livia knows Jasmine. Lydia knows Curtis. Nelson knows Kara. Livia knows Rocco. Shaun knows Dahlia. Fabian knows Roger. Jasmine knows Lydia. Shaun knows Cynthia. Coral knows Livia. Cynthia knows Conner. Rocco knows Lorenzo. Coral knows Fabian. Which of Cynthia and Livia can Shaun reach?", "answer": "Cynthia", "steps": [ "Shaun knows Cynthia." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Shaun", "Jarvis", "Conner", "Brooks", "Cynthia", "Freya", "Dahlia", "Kara", "Nelson", "Tanya", "Coral", "Roger", "Rocco", "Lorenzo", "Livia", "Fabian", "Anton", "Curtis", "Lydia", "Jasmine" ], "edges": [ [ 0, 5 ], [ 0, 6 ], [ 0, 4 ], [ 2, 3 ], [ 4, 2 ], [ 4, 9 ], [ 5, 1 ], [ 8, 7 ], [ 9, 8 ], [ 10, 15 ], [ 10, 16 ], [ 10, 14 ], [ 12, 13 ], [ 14, 12 ], [ 14, 19 ], [ 15, 11 ], [ 18, 17 ], [ 19, 18 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Magdalena knows Daphne. Alma knows Jeremiah. Lois knows Alma. Brian knows Lois. Dee knows Jodi. Marcus knows Ernest. Jennifer knows Marcus. Mildred knows Dee. Brian knows Jennifer. Roland knows Langston. Jodi knows Magdalena. Eli knows Palmer. Kara knows Brian. Mindy knows Roland. Lois knows Eli. Dee knows Mindy. Scott knows Dina. Jodi knows Scott. Which of Daphne and Palmer can Kara reach?", "answer": "Palmer", "steps": [ "Kara knows Brian.", "Brian knows Lois.", "Lois knows Eli.", "Eli knows Palmer." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Kara", "Brian", "Eli", "Marcus", "Alma", "Jennifer", "Lois", "Jeremiah", "Ernest", "Palmer", "Mildred", "Dee", "Magdalena", "Roland", "Scott", "Mindy", "Jodi", "Dina", "Langston", "Daphne" ], "edges": [ [ 0, 1 ], [ 1, 5 ], [ 1, 6 ], [ 2, 9 ], [ 3, 8 ], [ 4, 7 ], [ 5, 3 ], [ 6, 4 ], [ 6, 2 ], [ 10, 11 ], [ 11, 15 ], [ 11, 16 ], [ 12, 19 ], [ 13, 18 ], [ 14, 17 ], [ 15, 13 ], [ 16, 14 ], [ 16, 12 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Leah knows Val. Joy knows Leah. Beth knows Kirsten. Leah knows Dennis. Gwen knows Calvin. Daria knows Colleen. Harlan knows Vernon. Val knows Hazel. Cara knows Laurel. Harlan knows Edison. Vernon knows Gwen. Holly knows Joy. Beth knows Daria. Holly knows Leander. Leander knows Lionel. Leander knows Cara. Vernon knows Ralph. Edison knows Beth. Which of Edison and Joy can Harlan reach?", "answer": "Edison", "steps": [ "Harlan knows Edison." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Harlan", "Calvin", "Beth", "Edison", "Gwen", "Daria", "Colleen", "Kirsten", "Vernon", "Ralph", "Holly", "Laurel", "Leah", "Joy", "Cara", "Val", "Hazel", "Dennis", "Leander", "Lionel" ], "edges": [ [ 0, 3 ], [ 0, 8 ], [ 2, 5 ], [ 2, 7 ], [ 3, 2 ], [ 4, 1 ], [ 5, 6 ], [ 8, 4 ], [ 8, 9 ], [ 10, 13 ], [ 10, 18 ], [ 12, 15 ], [ 12, 17 ], [ 13, 12 ], [ 14, 11 ], [ 15, 16 ], [ 18, 14 ], [ 18, 19 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Leah knows Val. Joy knows Leah. Beth knows Kirsten. Leah knows Dennis. Gwen knows Calvin. Daria knows Colleen. Harlan knows Vernon. Val knows Hazel. Cara knows Laurel. Harlan knows Edison. Vernon knows Gwen. Holly knows Joy. Beth knows Daria. Holly knows Leander. Leander knows Lionel. Leander knows Cara. Vernon knows Ralph. Edison knows Beth. Which of Daria and Val can Harlan reach?", "answer": "Daria", "steps": [ "Harlan knows Edison.", "Edison knows Beth.", "Beth knows Daria." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Harlan", "Calvin", "Beth", "Edison", "Gwen", "Daria", "Colleen", "Kirsten", "Vernon", "Ralph", "Holly", "Laurel", "Leah", "Joy", "Cara", "Val", "Hazel", "Dennis", "Leander", "Lionel" ], "edges": [ [ 0, 3 ], [ 0, 8 ], [ 2, 5 ], [ 2, 7 ], [ 3, 2 ], [ 4, 1 ], [ 5, 6 ], [ 8, 4 ], [ 8, 9 ], [ 10, 13 ], [ 10, 18 ], [ 12, 15 ], [ 12, 17 ], [ 13, 12 ], [ 14, 11 ], [ 15, 16 ], [ 18, 14 ], [ 18, 19 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Tara knows Amy. Lee knows Marie. Jillian knows Margaret. Connor knows India. India knows Jillian. Lee knows Keaton. Houston knows Hilda. Hilda knows Zelda. Lois knows Gareth. Milo knows Houston. Keaton knows Esther. Hilda knows Lucia. Jillian knows Lee. Esther knows Lois. Zelda knows Tara. Amy knows Angelica. Zelda knows Mary. Angelica knows Javier. Which of Zelda and Lee can Connor reach?", "answer": "Lee", "steps": [ "Connor knows India.", "India knows Jillian.", "Jillian knows Lee." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Connor", "Lee", "Margaret", "Keaton", "Gareth", "Esther", "Jillian", "Marie", "India", "Lois", "Milo", "Zelda", "Lucia", "Tara", "Javier", "Amy", "Hilda", "Mary", "Houston", "Angelica" ], "edges": [ [ 0, 8 ], [ 1, 7 ], [ 1, 3 ], [ 3, 5 ], [ 5, 9 ], [ 6, 2 ], [ 6, 1 ], [ 8, 6 ], [ 9, 4 ], [ 10, 18 ], [ 11, 17 ], [ 11, 13 ], [ 13, 15 ], [ 15, 19 ], [ 16, 12 ], [ 16, 11 ], [ 18, 16 ], [ 19, 14 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Willis knows Kay. Virginia knows Elliot. Isaac knows Alex. Houston knows Marvin. Carson knows Houston. Alex knows Willis. Constance knows Axel. Kay knows Malcolm. Constance knows Teresa. Willis knows Clara. Marvin knows Electra. Axel knows Isaac. Marvin knows Virginia. Mitchell knows Curtis. Virginia knows Leticia. Mitchell knows Mae. Kay knows Eve. Curtis knows Carson. Which of Marvin and Willis can Constance reach?", "answer": "Willis", "steps": [ "Constance knows Axel.", "Axel knows Isaac.", "Isaac knows Alex.", "Alex knows Willis." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Constance", "Clara", "Kay", "Isaac", "Teresa", "Axel", "Alex", "Eve", "Malcolm", "Willis", "Mitchell", "Electra", "Virginia", "Carson", "Mae", "Curtis", "Houston", "Elliot", "Leticia", "Marvin" ], "edges": [ [ 0, 4 ], [ 0, 5 ], [ 2, 7 ], [ 2, 8 ], [ 3, 6 ], [ 5, 3 ], [ 6, 9 ], [ 9, 1 ], [ 9, 2 ], [ 10, 14 ], [ 10, 15 ], [ 12, 17 ], [ 12, 18 ], [ 13, 16 ], [ 15, 13 ], [ 16, 19 ], [ 19, 11 ], [ 19, 12 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Carrie knows Knox. John knows Bailey. Kane knows Sarah. Gerard knows Vera. Heath knows John. Marion knows Noel. Kane knows Carrie. Bailey knows Kane. John knows Aiden. Bailey knows Blanche. Gerard knows Ira. Ira knows Mary. Noel knows Esme. Esme knows Gerard. Noel knows Lark. Aiden knows Taylor. Lark knows Elise. Esme knows Heather. Which of John and Noel can Heath reach?", "answer": "John", "steps": [ "Heath knows John." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Heath", "Blanche", "Carrie", "John", "Aiden", "Knox", "Bailey", "Sarah", "Kane", "Taylor", "Marion", "Heather", "Ira", "Noel", "Lark", "Mary", "Esme", "Vera", "Gerard", "Elise" ], "edges": [ [ 0, 3 ], [ 2, 5 ], [ 3, 6 ], [ 3, 4 ], [ 4, 9 ], [ 6, 1 ], [ 6, 8 ], [ 8, 2 ], [ 8, 7 ], [ 10, 13 ], [ 12, 15 ], [ 13, 16 ], [ 13, 14 ], [ 14, 19 ], [ 16, 11 ], [ 16, 18 ], [ 18, 12 ], [ 18, 17 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Clark knows Diego. Gunnar knows Joanna. Jeremy knows Raquel. Kara knows Rufus. Clark knows Aria. Kara knows Ricardo. Rufus knows Dakota. Joanna knows Jermaine. Aria knows Cliff. Ricardo knows Deirdre. Diego knows Jamie. Gunnar knows Jerome. Rufus knows Brian. Jeremy knows Brad. Raquel knows Clark. Brad knows Fred. Jerome knows Kara. Aria knows Howard. Which of Brian and Cliff can Gunnar reach?", "answer": "Brian", "steps": [ "Gunnar knows Jerome.", "Jerome knows Kara.", "Kara knows Rufus.", "Rufus knows Brian." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Gunnar", "Rufus", "Ricardo", "Jermaine", "Joanna", "Deirdre", "Dakota", "Jerome", "Brian", "Kara", "Jeremy", "Aria", "Diego", "Fred", "Brad", "Jamie", "Howard", "Raquel", "Cliff", "Clark" ], "edges": [ [ 0, 4 ], [ 0, 7 ], [ 1, 6 ], [ 1, 8 ], [ 2, 5 ], [ 4, 3 ], [ 7, 9 ], [ 9, 2 ], [ 9, 1 ], [ 10, 14 ], [ 10, 17 ], [ 11, 16 ], [ 11, 18 ], [ 12, 15 ], [ 14, 13 ], [ 17, 19 ], [ 19, 12 ], [ 19, 11 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Doris knows Hayley. Jacob knows Jonah. Belinda knows Nadine. Jacob knows Aspen. Keith knows Theodore. Aspen knows Haven. Haven knows Edison. Belinda knows Hadley. Don knows Elodie. Theodore knows Zara. Doris knows Raymond. Theodore knows Belinda. Haven knows Chester. Jana knows Don. Don knows Jacob. Theodore knows Alyson. Don knows Elias. Nadine knows Doris. Which of Nadine and Aspen can Keith reach?", "answer": "Nadine", "steps": [ "Keith knows Theodore.", "Theodore knows Belinda.", "Belinda knows Nadine." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Keith", "Nadine", "Zara", "Theodore", "Alyson", "Hadley", "Hayley", "Doris", "Belinda", "Raymond", "Jana", "Aspen", "Elodie", "Don", "Elias", "Jonah", "Chester", "Haven", "Jacob", "Edison" ], "edges": [ [ 0, 3 ], [ 1, 7 ], [ 3, 2 ], [ 3, 4 ], [ 3, 8 ], [ 7, 6 ], [ 7, 9 ], [ 8, 5 ], [ 8, 1 ], [ 10, 13 ], [ 11, 17 ], [ 13, 12 ], [ 13, 14 ], [ 13, 18 ], [ 17, 16 ], [ 17, 19 ], [ 18, 15 ], [ 18, 11 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Laura knows Howard. Maggie knows Shannon. Bridget knows Bonnie. Hattie knows Jay. Calvin knows Laura. Paige knows Betty. Calvin knows Greta. Hattie knows Chelsea. Luna knows Erin. Howard knows Destiny. Julie knows Hattie. Zachary knows Julie. Erin knows Dylan. Jay knows Bridget. Ben knows Zachary. Jay knows Paige. Dylan knows Calvin. Laura knows Maggie. Which of Howard and Bridget can Luna reach?", "answer": "Howard", "steps": [ "Luna knows Erin.", "Erin knows Dylan.", "Dylan knows Calvin.", "Calvin knows Laura.", "Laura knows Howard." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Luna", "Greta", "Laura", "Shannon", "Dylan", "Calvin", "Destiny", "Erin", "Maggie", "Howard", "Ben", "Chelsea", "Jay", "Betty", "Julie", "Hattie", "Bonnie", "Zachary", "Paige", "Bridget" ], "edges": [ [ 0, 7 ], [ 2, 8 ], [ 2, 9 ], [ 4, 5 ], [ 5, 1 ], [ 5, 2 ], [ 7, 4 ], [ 8, 3 ], [ 9, 6 ], [ 10, 17 ], [ 12, 18 ], [ 12, 19 ], [ 14, 15 ], [ 15, 11 ], [ 15, 12 ], [ 17, 14 ], [ 18, 13 ], [ 19, 16 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Palmer knows Victoria. Clyde knows George. Vincent knows Teresa. Roy knows Hugh. Palmer knows Ethan. Jeffery knows Nadine. Peggy knows Finn. Brooks knows Jenny. Jack knows Jeffery. Roy knows Palmer. Jeffery knows Jesse. Jack knows Neville. Jack knows Alex. Roy knows Mike. Teresa knows Roy. Jenny knows Peggy. George knows Vincent. Finn knows Jack. Which of Victoria and Jesse can Clyde reach?", "answer": "Victoria", "steps": [ "Clyde knows George.", "George knows Vincent.", "Vincent knows Teresa.", "Teresa knows Roy.", "Roy knows Palmer.", "Palmer knows Victoria." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Clyde", "Palmer", "Ethan", "Hugh", "Teresa", "George", "Vincent", "Victoria", "Roy", "Mike", "Brooks", "Jeffery", "Nadine", "Neville", "Finn", "Jenny", "Peggy", "Jesse", "Jack", "Alex" ], "edges": [ [ 0, 5 ], [ 1, 2 ], [ 1, 7 ], [ 4, 8 ], [ 5, 6 ], [ 6, 4 ], [ 8, 3 ], [ 8, 1 ], [ 8, 9 ], [ 10, 15 ], [ 11, 12 ], [ 11, 17 ], [ 14, 18 ], [ 15, 16 ], [ 16, 14 ], [ 18, 13 ], [ 18, 11 ], [ 18, 19 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Greer knows Wade. Zack knows Rufus. Bette knows Tyler. Atlas knows Karl. Gerald knows Livia. Linda knows Zack. Catherine knows Emanuel. Lottie knows Julie. Karl knows Greer. Dewey knows Lottie. Livia knows Catherine. Livia knows Aldo. Zane knows Neil. Greer knows Dewey. Atlas knows Bette. Dewey knows Mildred. Catherine knows Zane. Linda knows Gerald. Which of Catherine and Dewey can Atlas reach?", "answer": "Dewey", "steps": [ "Atlas knows Karl.", "Karl knows Greer.", "Greer knows Dewey." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Atlas", "Dewey", "Julie", "Tyler", "Mildred", "Greer", "Karl", "Bette", "Wade", "Lottie", "Linda", "Catherine", "Neil", "Rufus", "Emanuel", "Livia", "Gerald", "Zack", "Aldo", "Zane" ], "edges": [ [ 0, 7 ], [ 0, 6 ], [ 1, 4 ], [ 1, 9 ], [ 5, 8 ], [ 5, 1 ], [ 6, 5 ], [ 7, 3 ], [ 9, 2 ], [ 10, 17 ], [ 10, 16 ], [ 11, 14 ], [ 11, 19 ], [ 15, 18 ], [ 15, 11 ], [ 16, 15 ], [ 17, 13 ], [ 19, 12 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Nadine knows Ethan. Sebastian knows Howard. Howard knows Adele. Ethan knows Claude. Nadine knows Foster. Hazel knows Bette. Sebastian knows Larry. Justine knows Boris. Zoe knows Leslie. Sebastian knows Mildred. Nadine knows Justine. Zoe knows Sebastian. Zoe knows Gareth. Ethan knows Jasmine. Leslie knows Brynn. Leslie knows Richard. Justine knows Ellen. Justine knows Hazel. Which of Justine and Sebastian can Nadine reach?", "answer": "Justine", "steps": [ "Nadine knows Justine." ], "difficulty": 1, "original_distance": 3, "idx_to_symbol": [ "Nadine", "Boris", "Foster", "Ethan", "Jasmine", "Bette", "Justine", "Ellen", "Hazel", "Claude", "Zoe", "Mildred", "Gareth", "Leslie", "Richard", "Adele", "Sebastian", "Larry", "Howard", "Brynn" ], "edges": [ [ 0, 2 ], [ 0, 6 ], [ 0, 3 ], [ 3, 4 ], [ 3, 9 ], [ 6, 1 ], [ 6, 7 ], [ 6, 8 ], [ 8, 5 ], [ 10, 12 ], [ 10, 16 ], [ 10, 13 ], [ 13, 14 ], [ 13, 19 ], [ 16, 11 ], [ 16, 17 ], [ 16, 18 ], [ 18, 15 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Tim knows Lucille. Lucille knows Lucy. Jermaine knows Gerald. Kim knows Jermaine. Morgan knows Earl. Randall knows Tim. Jermaine knows Cain. Randall knows Parker. Erwin knows Serena. Cynthia knows Davis. Lucy knows Fraser. Cynthia knows Barney. Erwin knows Kim. Karl knows Audrey. Earl knows Erwin. Lucy knows Electra. Karl knows Morgan. Fraser knows Cynthia. Which of Gerald and Barney can Randall reach?", "answer": "Barney", "steps": [ "Randall knows Tim.", "Tim knows Lucille.", "Lucille knows Lucy.", "Lucy knows Fraser.", "Fraser knows Cynthia.", "Cynthia knows Barney." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Randall", "Lucille", "Parker", "Lucy", "Tim", "Cynthia", "Barney", "Electra", "Fraser", "Davis", "Karl", "Earl", "Audrey", "Erwin", "Morgan", "Jermaine", "Gerald", "Serena", "Kim", "Cain" ], "edges": [ [ 0, 2 ], [ 0, 4 ], [ 1, 3 ], [ 3, 7 ], [ 3, 8 ], [ 4, 1 ], [ 5, 6 ], [ 5, 9 ], [ 8, 5 ], [ 10, 12 ], [ 10, 14 ], [ 11, 13 ], [ 13, 17 ], [ 13, 18 ], [ 14, 11 ], [ 15, 16 ], [ 15, 19 ], [ 18, 15 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Nora knows Cindy. Reed knows Caleb. Conner knows Lucy. Curtis knows Natalie. Eamon knows Reed. Conner knows Gerard. Curtis knows Max. Richard knows Jose. Eamon knows Hamilton. Perry knows Nora. Dell knows Randall. Nora knows Mabel. Natalie knows Ruby. Cindy knows Curtis. Randall knows Conner. Arnold knows Dell. Lucy knows Eamon. Jose knows Perry. Which of Reed and Natalie can Richard reach?", "answer": "Natalie", "steps": [ "Richard knows Jose.", "Jose knows Perry.", "Perry knows Nora.", "Nora knows Cindy.", "Cindy knows Curtis.", "Curtis knows Natalie." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Richard", "Ruby", "Mabel", "Cindy", "Max", "Natalie", "Jose", "Curtis", "Perry", "Nora", "Arnold", "Caleb", "Gerard", "Lucy", "Hamilton", "Reed", "Dell", "Eamon", "Randall", "Conner" ], "edges": [ [ 0, 6 ], [ 3, 7 ], [ 5, 1 ], [ 6, 8 ], [ 7, 4 ], [ 7, 5 ], [ 8, 9 ], [ 9, 2 ], [ 9, 3 ], [ 10, 16 ], [ 13, 17 ], [ 15, 11 ], [ 16, 18 ], [ 17, 14 ], [ 17, 15 ], [ 18, 19 ], [ 19, 12 ], [ 19, 13 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Ellen knows Marcia. Greta knows Amelia. Kurt knows Greta. Ellen knows Austin. Burt knows Fisher. Austin knows Neville. Margaret knows Burt. Hailey knows Jesse. Hailey knows Nelson. Nelson knows Ellen. Kathleen knows Kurt. Jesse knows Jordan. Burt knows Randy. Hendrix knows Dorian. Kurt knows Margaret. Randy knows Keegan. Dorian knows Hailey. Garrison knows Kathleen. Which of Austin and Randy can Hendrix reach?", "answer": "Austin", "steps": [ "Hendrix knows Dorian.", "Dorian knows Hailey.", "Hailey knows Nelson.", "Nelson knows Ellen.", "Ellen knows Austin." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Hendrix", "Ellen", "Jesse", "Austin", "Nelson", "Dorian", "Jordan", "Hailey", "Neville", "Marcia", "Garrison", "Burt", "Greta", "Randy", "Margaret", "Kathleen", "Amelia", "Kurt", "Keegan", "Fisher" ], "edges": [ [ 0, 5 ], [ 1, 3 ], [ 1, 9 ], [ 2, 6 ], [ 3, 8 ], [ 4, 1 ], [ 5, 7 ], [ 7, 2 ], [ 7, 4 ], [ 10, 15 ], [ 11, 13 ], [ 11, 19 ], [ 12, 16 ], [ 13, 18 ], [ 14, 11 ], [ 15, 17 ], [ 17, 12 ], [ 17, 14 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Charlotte knows Archie. Abby knows Callum. Derrick knows Claire. Rose knows Virginia. Callum knows Linda. Ralph knows Abby. Joseph knows Ronald. Linda knows Irving. Rita knows Lucille. Ronald knows Derrick. Charlotte knows Henry. Derrick knows Rose. Irving knows Charlotte. Irving knows Brandon. Rose knows Connor. Charlotte knows Ainsley. Lucille knows Joseph. Rose knows Lilia. Which of Henry and Lilia can Ralph reach?", "answer": "Henry", "steps": [ "Ralph knows Abby.", "Abby knows Callum.", "Callum knows Linda.", "Linda knows Irving.", "Irving knows Charlotte.", "Charlotte knows Henry." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Ralph", "Ainsley", "Charlotte", "Callum", "Irving", "Archie", "Henry", "Linda", "Abby", "Brandon", "Rita", "Virginia", "Rose", "Joseph", "Derrick", "Connor", "Lilia", "Ronald", "Lucille", "Claire" ], "edges": [ [ 0, 8 ], [ 2, 1 ], [ 2, 5 ], [ 2, 6 ], [ 3, 7 ], [ 4, 2 ], [ 4, 9 ], [ 7, 4 ], [ 8, 3 ], [ 10, 18 ], [ 12, 11 ], [ 12, 15 ], [ 12, 16 ], [ 13, 17 ], [ 14, 12 ], [ 14, 19 ], [ 17, 14 ], [ 18, 13 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Neal knows Dante. Vera knows Harmony. Betty knows Israel. Colby knows Alvin. Betty knows Dolly. Alex knows Imogen. Joy knows Colby. Vera knows Gene. Thomas knows Jewel. Colby knows Carlos. Natalie knows Joy. Molly knows Alex. Dolly knows Neal. Jewel knows Vera. Molly knows Bob. Gene knows Betty. Carlos knows Molly. Imogen knows Grant. Which of Neal and Imogen can Thomas reach?", "answer": "Neal", "steps": [ "Thomas knows Jewel.", "Jewel knows Vera.", "Vera knows Gene.", "Gene knows Betty.", "Betty knows Dolly.", "Dolly knows Neal." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Thomas", "Israel", "Dolly", "Vera", "Dante", "Jewel", "Neal", "Betty", "Harmony", "Gene", "Natalie", "Bob", "Alex", "Colby", "Grant", "Joy", "Imogen", "Molly", "Alvin", "Carlos" ], "edges": [ [ 0, 5 ], [ 2, 6 ], [ 3, 8 ], [ 3, 9 ], [ 5, 3 ], [ 6, 4 ], [ 7, 1 ], [ 7, 2 ], [ 9, 7 ], [ 10, 15 ], [ 12, 16 ], [ 13, 18 ], [ 13, 19 ], [ 15, 13 ], [ 16, 14 ], [ 17, 11 ], [ 17, 12 ], [ 19, 17 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Joshua knows Ariel. Liam knows Monroe. Elvira knows Frida. Otto knows Goldie. Ariel knows Liam. Anton knows Otto. Ilene knows Carla. Monroe knows Hunter. Anton knows Norma. Anton knows Hardy. Liam knows Gregory. Ilene knows Anton. Ray knows Jeremiah. Monroe knows Lawson. Monroe knows Elvira. Norma knows Harrison. Hunter knows Dustin. Jeremiah knows Ilene. Which of Dustin and Goldie can Ray reach?", "answer": "Goldie", "steps": [ "Ray knows Jeremiah.", "Jeremiah knows Ilene.", "Ilene knows Anton.", "Anton knows Otto.", "Otto knows Goldie." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Ray", "Norma", "Carla", "Jeremiah", "Ilene", "Hardy", "Anton", "Harrison", "Otto", "Goldie", "Joshua", "Elvira", "Gregory", "Ariel", "Liam", "Lawson", "Monroe", "Frida", "Hunter", "Dustin" ], "edges": [ [ 0, 3 ], [ 1, 7 ], [ 3, 4 ], [ 4, 2 ], [ 4, 6 ], [ 6, 5 ], [ 6, 1 ], [ 6, 8 ], [ 8, 9 ], [ 10, 13 ], [ 11, 17 ], [ 13, 14 ], [ 14, 12 ], [ 14, 16 ], [ 16, 15 ], [ 16, 11 ], [ 16, 18 ], [ 18, 19 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Terry knows Blake. Haven knows Penny. Jolene knows Ira. Jolene knows Edison. Fritz knows Terry. Brittany knows Fritz. Bruce knows Kaleb. Haven knows Shannon. Hunter knows Brittany. Riley knows Terrence. Penny knows Livia. Blake knows Jolene. Marie knows Haven. Edison knows Elvira. Hunter knows Hannah. Terrence knows Isla. Isla knows Marie. Bruce knows Riley. Which of Livia and Elvira can Hunter reach?", "answer": "Elvira", "steps": [ "Hunter knows Brittany.", "Brittany knows Fritz.", "Fritz knows Terry.", "Terry knows Blake.", "Blake knows Jolene.", "Jolene knows Edison.", "Edison knows Elvira." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Hunter", "Hannah", "Brittany", "Fritz", "Jolene", "Edison", "Terry", "Blake", "Elvira", "Ira", "Bruce", "Kaleb", "Riley", "Terrence", "Haven", "Penny", "Isla", "Marie", "Livia", "Shannon" ], "edges": [ [ 0, 1 ], [ 0, 2 ], [ 2, 3 ], [ 3, 6 ], [ 4, 5 ], [ 4, 9 ], [ 5, 8 ], [ 6, 7 ], [ 7, 4 ], [ 10, 11 ], [ 10, 12 ], [ 12, 13 ], [ 13, 16 ], [ 14, 15 ], [ 14, 19 ], [ 15, 18 ], [ 16, 17 ], [ 17, 14 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Claudia knows Esperanza. Annette knows Janelle. Eden knows Elias. Felicia knows Annette. Rachel knows Eden. Clayton knows Rachel. Elias knows Wyatt. Esperanza knows Felicia. Annette knows Darren. Langston knows Clayton. Rachel knows Emma. Felicia knows Verna. Rachel knows Chance. Felicia knows Vincent. Darren knows Guy. Clarissa knows Etta. Eden knows Clarissa. Janelle knows Beth. Which of Felicia and Rachel can Langston reach?", "answer": "Rachel", "steps": [ "Langston knows Clayton.", "Clayton knows Rachel." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Langston", "Elias", "Etta", "Chance", "Wyatt", "Emma", "Eden", "Rachel", "Clarissa", "Clayton", "Claudia", "Darren", "Beth", "Verna", "Guy", "Vincent", "Annette", "Felicia", "Janelle", "Esperanza" ], "edges": [ [ 0, 9 ], [ 1, 4 ], [ 6, 1 ], [ 6, 8 ], [ 7, 3 ], [ 7, 5 ], [ 7, 6 ], [ 8, 2 ], [ 9, 7 ], [ 10, 19 ], [ 11, 14 ], [ 16, 11 ], [ 16, 18 ], [ 17, 13 ], [ 17, 15 ], [ 17, 16 ], [ 18, 12 ], [ 19, 17 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Shannon knows Della. Faith knows Dallas. Lola knows Faith. Faith knows Margaret. Jay knows Carson. Shannon knows Latoya. Shannon knows Andrew. Rose knows Shannon. Margaret knows Jay. Reid knows Karina. Demetrius knows Reid. Shannon knows Tina. Faith knows Christopher. Myra knows Virginia. Dawn knows Cooper. Della knows Dawn. Latoya knows Myra. Faith knows Demetrius. Which of Faith and Shannon can Lola reach?", "answer": "Faith", "steps": [ "Lola knows Faith." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Lola", "Faith", "Margaret", "Reid", "Dallas", "Karina", "Demetrius", "Christopher", "Carson", "Jay", "Rose", "Shannon", "Latoya", "Dawn", "Andrew", "Cooper", "Della", "Tina", "Virginia", "Myra" ], "edges": [ [ 0, 1 ], [ 1, 4 ], [ 1, 6 ], [ 1, 7 ], [ 1, 2 ], [ 2, 9 ], [ 3, 5 ], [ 6, 3 ], [ 9, 8 ], [ 10, 11 ], [ 11, 14 ], [ 11, 16 ], [ 11, 17 ], [ 11, 12 ], [ 12, 19 ], [ 13, 15 ], [ 16, 13 ], [ 19, 18 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Jenna knows Teresa. Brittany knows Daisy. Lucia knows Brittany. Brittany knows Alice. Brittany knows Hamilton. Hampton knows Mike. Teresa knows Kaleb. Teresa knows Drew. Brittany knows Jeremiah. Kaleb knows Ernesto. Kaleb knows Angela. Raquel knows Wendy. Teresa knows Ariel. Hamilton knows Raquel. Teresa knows Hampton. Mike knows Cornelius. Alice knows Blanche. Alice knows Karen. Which of Wendy and Cornelius can Jenna reach?", "answer": "Cornelius", "steps": [ "Jenna knows Teresa.", "Teresa knows Hampton.", "Hampton knows Mike.", "Mike knows Cornelius." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Jenna", "Ariel", "Ernesto", "Hampton", "Drew", "Cornelius", "Angela", "Mike", "Teresa", "Kaleb", "Lucia", "Jeremiah", "Karen", "Hamilton", "Daisy", "Wendy", "Blanche", "Raquel", "Brittany", "Alice" ], "edges": [ [ 0, 8 ], [ 3, 7 ], [ 7, 5 ], [ 8, 1 ], [ 8, 4 ], [ 8, 3 ], [ 8, 9 ], [ 9, 2 ], [ 9, 6 ], [ 10, 18 ], [ 13, 17 ], [ 17, 15 ], [ 18, 11 ], [ 18, 14 ], [ 18, 13 ], [ 18, 19 ], [ 19, 12 ], [ 19, 16 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Dick knows Kirsten. Wendell knows Darren. Darren knows Isiah. Dolores knows Teresa. Dolores knows Bernadette. Alyson knows Nicholas. Clark knows Malcolm. Nicholas knows Ignacio. Christopher knows Clark. Teresa knows Carrie. Malcolm knows Lars. Clark knows Perry. Kirsten knows Wendell. Ignacio knows Dick. Wendell knows Nash. Lamar knows Dolores. Lars knows Lamar. Nicholas knows Layla. Which of Clark and Nicholas can Christopher reach?", "answer": "Clark", "steps": [ "Christopher knows Clark." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Christopher", "Malcolm", "Lamar", "Dolores", "Bernadette", "Teresa", "Clark", "Perry", "Lars", "Carrie", "Alyson", "Ignacio", "Kirsten", "Wendell", "Nash", "Darren", "Nicholas", "Layla", "Dick", "Isiah" ], "edges": [ [ 0, 6 ], [ 1, 8 ], [ 2, 3 ], [ 3, 4 ], [ 3, 5 ], [ 5, 9 ], [ 6, 7 ], [ 6, 1 ], [ 8, 2 ], [ 10, 16 ], [ 11, 18 ], [ 12, 13 ], [ 13, 14 ], [ 13, 15 ], [ 15, 19 ], [ 16, 17 ], [ 16, 11 ], [ 18, 12 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Aiden knows Mildred. Raquel knows Regina. Bonnie knows Lyle. Lana knows Aiden. Lyle knows Calvin. Lana knows Kelly. Lyle knows Elton. Bonnie knows Marvin. Jackson knows Sidney. Mildred knows Clinton. Luz knows Raquel. Lana knows Luz. Luz knows Jackson. Bonnie knows Cindy. Marvin knows Juan. Calvin knows Malik. Elton knows Marlene. Juan knows Paula. Which of Marvin and Aiden can Lana reach?", "answer": "Aiden", "steps": [ "Lana knows Aiden." ], "difficulty": 1, "original_distance": 3, "idx_to_symbol": [ "Lana", "Jackson", "Aiden", "Kelly", "Sidney", "Regina", "Mildred", "Luz", "Clinton", "Raquel", "Bonnie", "Elton", "Marvin", "Cindy", "Marlene", "Malik", "Juan", "Lyle", "Paula", "Calvin" ], "edges": [ [ 0, 3 ], [ 0, 2 ], [ 0, 7 ], [ 1, 4 ], [ 2, 6 ], [ 6, 8 ], [ 7, 1 ], [ 7, 9 ], [ 9, 5 ], [ 10, 13 ], [ 10, 12 ], [ 10, 17 ], [ 11, 14 ], [ 12, 16 ], [ 16, 18 ], [ 17, 11 ], [ 17, 19 ], [ 19, 15 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Garrison knows Dallas. Wyatt knows Darcy. Fabian knows Wyatt. Leroy knows Quinn. Fabian knows Patrick. Kay knows Garrison. Harriet knows Doug. Garrison knows Denver. Zach knows Leroy. Harriet knows Kirk. Darcy knows Zach. Denver knows Nelson. Doug knows Saul. Kaleb knows Luis. Kirk knows Kay. Zach knows Kaleb. Dallas knows Reed. Patrick knows Luther. Which of Kay and Darcy can Harriet reach?", "answer": "Kay", "steps": [ "Harriet knows Kirk.", "Kirk knows Kay." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Harriet", "Nelson", "Dallas", "Reed", "Garrison", "Denver", "Saul", "Kirk", "Doug", "Kay", "Fabian", "Quinn", "Kaleb", "Luis", "Zach", "Leroy", "Luther", "Wyatt", "Patrick", "Darcy" ], "edges": [ [ 0, 8 ], [ 0, 7 ], [ 2, 3 ], [ 4, 2 ], [ 4, 5 ], [ 5, 1 ], [ 7, 9 ], [ 8, 6 ], [ 9, 4 ], [ 10, 18 ], [ 10, 17 ], [ 12, 13 ], [ 14, 12 ], [ 14, 15 ], [ 15, 11 ], [ 17, 19 ], [ 18, 16 ], [ 19, 14 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Hannah knows Leroy. Ronald knows Graeme. Ray knows Terry. Hannah knows Daisy. Troy knows Ronald. Graeme knows Rose. Terry knows Yvonne. Anna knows Ray. Ethan knows Archer. Rose knows Ethan. Candice knows Anna. Archer knows Chris. Candice knows Clarence. Yvonne knows Nelson. Hannah knows Troy. Nelson knows Skyler. Candice knows Patricia. Skyler knows Billy. Which of Yvonne and Rose can Hannah reach?", "answer": "Rose", "steps": [ "Hannah knows Troy.", "Troy knows Ronald.", "Ronald knows Graeme.", "Graeme knows Rose." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Hannah", "Ethan", "Troy", "Rose", "Ronald", "Archer", "Chris", "Daisy", "Graeme", "Leroy", "Candice", "Nelson", "Anna", "Yvonne", "Ray", "Skyler", "Billy", "Patricia", "Terry", "Clarence" ], "edges": [ [ 0, 7 ], [ 0, 2 ], [ 0, 9 ], [ 1, 5 ], [ 2, 4 ], [ 3, 1 ], [ 4, 8 ], [ 5, 6 ], [ 8, 3 ], [ 10, 17 ], [ 10, 12 ], [ 10, 19 ], [ 11, 15 ], [ 12, 14 ], [ 13, 11 ], [ 14, 18 ], [ 15, 16 ], [ 18, 13 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Fergus knows Annie. Edith knows Caroline. Ramona knows Preston. Esther knows Dayton. Caroline knows Fergus. Preston knows Duncan. Darwin knows Frank. Frank knows Andrew. Duncan knows Garrett. Hugo knows Isaac. Preston knows Effie. Duncan knows Edith. Frank knows Lamont. Isaac knows Everett. Lamont knows Esther. Edith knows Morgan. Lamont knows Kelsey. Esther knows Hugo. Which of Isaac and Fergus can Ramona reach?", "answer": "Fergus", "steps": [ "Ramona knows Preston.", "Preston knows Duncan.", "Duncan knows Edith.", "Edith knows Caroline.", "Caroline knows Fergus." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Ramona", "Caroline", "Edith", "Fergus", "Garrett", "Effie", "Annie", "Morgan", "Duncan", "Preston", "Darwin", "Hugo", "Esther", "Isaac", "Kelsey", "Andrew", "Everett", "Dayton", "Lamont", "Frank" ], "edges": [ [ 0, 9 ], [ 1, 3 ], [ 2, 1 ], [ 2, 7 ], [ 3, 6 ], [ 8, 4 ], [ 8, 2 ], [ 9, 5 ], [ 9, 8 ], [ 10, 19 ], [ 11, 13 ], [ 12, 11 ], [ 12, 17 ], [ 13, 16 ], [ 18, 14 ], [ 18, 12 ], [ 19, 15 ], [ 19, 18 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Eldon knows Yvonne. Chris knows Mara. Yvonne knows Imogen. Jessica knows Fraser. Vicki knows Veronica. Alma knows Duke. Zack knows Alma. Elvira knows Anita. Mara knows Celeste. Mara knows Jessica. Yvonne knows Luz. Mara knows Eileen. Mara knows Diane. Veronica knows Gene. Alma knows Chris. Yvonne knows Helen. Veronica knows Eldon. Yvonne knows Elvira. Which of Mara and Yvonne can Vicki reach?", "answer": "Yvonne", "steps": [ "Vicki knows Veronica.", "Veronica knows Eldon.", "Eldon knows Yvonne." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Vicki", "Gene", "Luz", "Elvira", "Helen", "Veronica", "Yvonne", "Eldon", "Anita", "Imogen", "Zack", "Duke", "Diane", "Jessica", "Eileen", "Alma", "Mara", "Chris", "Fraser", "Celeste" ], "edges": [ [ 0, 5 ], [ 3, 8 ], [ 5, 1 ], [ 5, 7 ], [ 6, 2 ], [ 6, 4 ], [ 6, 3 ], [ 6, 9 ], [ 7, 6 ], [ 10, 15 ], [ 13, 18 ], [ 15, 11 ], [ 15, 17 ], [ 16, 12 ], [ 16, 14 ], [ 16, 13 ], [ 16, 19 ], [ 17, 16 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Imogen knows William. Daisy knows Cameron. Cameron knows Tina. Nelson knows Winston. Lorenzo knows Fabian. Leigh knows Daisy. Ibrahim knows Lucy. Imogen knows Declan. Fabian knows Imogen. Cameron knows Christopher. Cameron knows Lorenzo. Rosemary knows Ibrahim. Winston knows Molly. Molly knows Damien. Ibrahim knows Ted. Ibrahim knows Nelson. Damian knows Rosemary. Molly knows Scott. Which of Lorenzo and Nelson can Damian reach?", "answer": "Nelson", "steps": [ "Damian knows Rosemary.", "Rosemary knows Ibrahim.", "Ibrahim knows Nelson." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Damian", "Ibrahim", "Scott", "Ted", "Winston", "Nelson", "Molly", "Rosemary", "Damien", "Lucy", "Leigh", "Cameron", "Declan", "Tina", "Fabian", "Lorenzo", "Imogen", "Daisy", "William", "Christopher" ], "edges": [ [ 0, 7 ], [ 1, 3 ], [ 1, 5 ], [ 1, 9 ], [ 4, 6 ], [ 5, 4 ], [ 6, 2 ], [ 6, 8 ], [ 7, 1 ], [ 10, 17 ], [ 11, 13 ], [ 11, 15 ], [ 11, 19 ], [ 14, 16 ], [ 15, 14 ], [ 16, 12 ], [ 16, 18 ], [ 17, 11 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Kelsey knows Kristin. Gwen knows Christian. Ted knows Kelsey. Stacy knows Donovan. Christian knows Larissa. Veronica knows Knox. Jude knows Stacy. Bruno knows Maya. Stacy knows Ted. Julius knows Bruno. Chance knows Dick. Larissa knows Greta. Kristin knows Veronica. Stacy knows Chance. Greta knows Fiona. Wanda knows Julius. Julius knows Gwen. Julius knows Hardy. Which of Julius and Stacy can Wanda reach?", "answer": "Julius", "steps": [ "Wanda knows Julius." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Wanda", "Fiona", "Greta", "Maya", "Hardy", "Julius", "Gwen", "Larissa", "Christian", "Bruno", "Jude", "Knox", "Veronica", "Dick", "Donovan", "Stacy", "Ted", "Kristin", "Kelsey", "Chance" ], "edges": [ [ 0, 5 ], [ 2, 1 ], [ 5, 4 ], [ 5, 6 ], [ 5, 9 ], [ 6, 8 ], [ 7, 2 ], [ 8, 7 ], [ 9, 3 ], [ 10, 15 ], [ 12, 11 ], [ 15, 14 ], [ 15, 16 ], [ 15, 19 ], [ 16, 18 ], [ 17, 12 ], [ 18, 17 ], [ 19, 13 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Liam knows Shelby. Harlan knows Esther. Zoe knows Tabitha. Whitney knows Kent. Zoe knows Liam. Whitney knows Joyce. Dale knows Ethan. Kent knows Zoe. Harlan knows Carey. Zoe knows Rocco. Shaun knows Audrey. Carey knows Shaun. Ethan knows Harlan. Harlan knows Spencer. Spencer knows Andrea. Dale knows Celia. Tabitha knows Carrie. Shelby knows Caleb. Which of Shelby and Shaun can Whitney reach?", "answer": "Shelby", "steps": [ "Whitney knows Kent.", "Kent knows Zoe.", "Zoe knows Liam.", "Liam knows Shelby." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Whitney", "Shelby", "Carrie", "Joyce", "Liam", "Caleb", "Rocco", "Tabitha", "Zoe", "Kent", "Dale", "Shaun", "Andrea", "Celia", "Carey", "Audrey", "Esther", "Spencer", "Harlan", "Ethan" ], "edges": [ [ 0, 3 ], [ 0, 9 ], [ 1, 5 ], [ 4, 1 ], [ 7, 2 ], [ 8, 4 ], [ 8, 6 ], [ 8, 7 ], [ 9, 8 ], [ 10, 13 ], [ 10, 19 ], [ 11, 15 ], [ 14, 11 ], [ 17, 12 ], [ 18, 14 ], [ 18, 16 ], [ 18, 17 ], [ 19, 18 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "April knows Rick. Gemma knows Fred. Fred knows Agnes. Vernon knows Cassidy. Val knows Lamont. Vernon knows Crystal. Val knows Nicole. Barry knows Eva. Gemma knows Verna. Agnes knows Val. Thomas knows Barry. Barry knows Vernon. April knows Sydney. Gemma knows Victor. Lyric knows Gemma. Fred knows Gustavo. Barry knows Lorna. Crystal knows April. Which of Val and April can Thomas reach?", "answer": "April", "steps": [ "Thomas knows Barry.", "Barry knows Vernon.", "Vernon knows Crystal.", "Crystal knows April." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Thomas", "Eva", "Rick", "Sydney", "April", "Lorna", "Barry", "Crystal", "Cassidy", "Vernon", "Lyric", "Verna", "Nicole", "Lamont", "Val", "Victor", "Gemma", "Agnes", "Gustavo", "Fred" ], "edges": [ [ 0, 6 ], [ 4, 2 ], [ 4, 3 ], [ 6, 1 ], [ 6, 5 ], [ 6, 9 ], [ 7, 4 ], [ 9, 7 ], [ 9, 8 ], [ 10, 16 ], [ 14, 12 ], [ 14, 13 ], [ 16, 11 ], [ 16, 15 ], [ 16, 19 ], [ 17, 14 ], [ 19, 17 ], [ 19, 18 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Perry knows Evan. Perry knows Bette. Cooper knows Perry. Charles knows Steve. Rosa knows Carmela. Cooper knows Vera. Vera knows Lyric. Logan knows Janice. Logan knows Lucia. Rosa knows Daniella. Lucia knows Cooper. Hayes knows Charles. Janice knows Claude. Tonya knows Haven. Hayes knows Francesca. Steve knows Tonya. Francesca knows Kelly. Steve knows Rosa. Which of Carmela and Evan can Hayes reach?", "answer": "Carmela", "steps": [ "Hayes knows Charles.", "Charles knows Steve.", "Steve knows Rosa.", "Rosa knows Carmela." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Hayes", "Charles", "Tonya", "Carmela", "Haven", "Francesca", "Steve", "Rosa", "Daniella", "Kelly", "Logan", "Lucia", "Vera", "Evan", "Lyric", "Janice", "Cooper", "Perry", "Bette", "Claude" ], "edges": [ [ 0, 1 ], [ 0, 5 ], [ 1, 6 ], [ 2, 4 ], [ 5, 9 ], [ 6, 2 ], [ 6, 7 ], [ 7, 3 ], [ 7, 8 ], [ 10, 11 ], [ 10, 15 ], [ 11, 16 ], [ 12, 14 ], [ 15, 19 ], [ 16, 12 ], [ 16, 17 ], [ 17, 13 ], [ 17, 18 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Willis knows Kay. Virginia knows Elliot. Isaac knows Alex. Houston knows Marvin. Carson knows Houston. Alex knows Willis. Constance knows Axel. Kay knows Malcolm. Constance knows Teresa. Willis knows Clara. Marvin knows Electra. Axel knows Isaac. Marvin knows Virginia. Mitchell knows Curtis. Virginia knows Leticia. Mitchell knows Mae. Kay knows Eve. Curtis knows Carson. Which of Houston and Alex can Constance reach?", "answer": "Alex", "steps": [ "Constance knows Axel.", "Axel knows Isaac.", "Isaac knows Alex." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Constance", "Clara", "Kay", "Isaac", "Teresa", "Axel", "Alex", "Eve", "Malcolm", "Willis", "Mitchell", "Electra", "Virginia", "Carson", "Mae", "Curtis", "Houston", "Elliot", "Leticia", "Marvin" ], "edges": [ [ 0, 4 ], [ 0, 5 ], [ 2, 7 ], [ 2, 8 ], [ 3, 6 ], [ 5, 3 ], [ 6, 9 ], [ 9, 1 ], [ 9, 2 ], [ 10, 14 ], [ 10, 15 ], [ 12, 17 ], [ 12, 18 ], [ 13, 16 ], [ 15, 13 ], [ 16, 19 ], [ 19, 11 ], [ 19, 12 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Justine knows Cristina. Morgan knows Rita. Claude knows Carter. Zachary knows Agnes. Brenda knows Zachary. Zachary knows Lacey. Farrah knows Rowan. Cristina knows Robin. Agnes knows Earl. Justine knows Sebastian. Gail knows Farrah. Charles knows Edwin. Farrah knows Charles. Lacey knows Aldo. Rowan knows Pierce. Brenda knows Justine. Gail knows Morgan. Morgan knows Claude. Which of Zachary and Farrah can Brenda reach?", "answer": "Zachary", "steps": [ "Brenda knows Zachary." ], "difficulty": 1, "original_distance": 3, "idx_to_symbol": [ "Brenda", "Earl", "Robin", "Justine", "Aldo", "Zachary", "Agnes", "Sebastian", "Cristina", "Lacey", "Gail", "Pierce", "Carter", "Morgan", "Edwin", "Farrah", "Rowan", "Rita", "Claude", "Charles" ], "edges": [ [ 0, 3 ], [ 0, 5 ], [ 3, 7 ], [ 3, 8 ], [ 5, 6 ], [ 5, 9 ], [ 6, 1 ], [ 8, 2 ], [ 9, 4 ], [ 10, 13 ], [ 10, 15 ], [ 13, 17 ], [ 13, 18 ], [ 15, 16 ], [ 15, 19 ], [ 16, 11 ], [ 18, 12 ], [ 19, 14 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Linda knows Malcolm. Linda knows Levi. Estelle knows Isadora. Winston knows Merle. Omar knows Neville. Samantha knows Flora. Eugene knows Damian. Omar knows Dixie. Flora knows Eugene. Damian knows Noel. Levi knows Omar. Lucille knows Winston. Dixie knows Isaac. Noel knows Julio. Isaac knows Estelle. Flora knows Tara. Lucille knows Samantha. Malcolm knows Brent. Which of Noel and Estelle can Lucille reach?", "answer": "Noel", "steps": [ "Lucille knows Samantha.", "Samantha knows Flora.", "Flora knows Eugene.", "Eugene knows Damian.", "Damian knows Noel." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Lucille", "Tara", "Merle", "Julio", "Winston", "Flora", "Damian", "Eugene", "Samantha", "Noel", "Linda", "Neville", "Brent", "Isadora", "Malcolm", "Omar", "Isaac", "Dixie", "Levi", "Estelle" ], "edges": [ [ 0, 4 ], [ 0, 8 ], [ 4, 2 ], [ 5, 1 ], [ 5, 7 ], [ 6, 9 ], [ 7, 6 ], [ 8, 5 ], [ 9, 3 ], [ 10, 14 ], [ 10, 18 ], [ 14, 12 ], [ 15, 11 ], [ 15, 17 ], [ 16, 19 ], [ 17, 16 ], [ 18, 15 ], [ 19, 13 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Barbara knows Holden. Miranda knows Drew. Peggy knows Gail. Barbara knows Peggy. Gwen knows Demetrius. Elsa knows Steve. Kathleen knows Barbara. Jude knows Kathleen. Riley knows Travis. Demetrius knows Riley. Andrew knows Tamara. Alejandro knows Andrew. Elsa knows Miranda. Tamara knows Elsa. Peggy knows Gwen. Hazel knows Hayes. Tamara knows Brody. Drew knows Hazel. Which of Gwen and Miranda can Alejandro reach?", "answer": "Miranda", "steps": [ "Alejandro knows Andrew.", "Andrew knows Tamara.", "Tamara knows Elsa.", "Elsa knows Miranda." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Alejandro", "Drew", "Tamara", "Hayes", "Andrew", "Brody", "Steve", "Elsa", "Miranda", "Hazel", "Jude", "Demetrius", "Barbara", "Travis", "Kathleen", "Holden", "Gail", "Peggy", "Gwen", "Riley" ], "edges": [ [ 0, 4 ], [ 1, 9 ], [ 2, 5 ], [ 2, 7 ], [ 4, 2 ], [ 7, 6 ], [ 7, 8 ], [ 8, 1 ], [ 9, 3 ], [ 10, 14 ], [ 11, 19 ], [ 12, 15 ], [ 12, 17 ], [ 14, 12 ], [ 17, 16 ], [ 17, 18 ], [ 18, 11 ], [ 19, 13 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Clement knows Isla. Zane knows Pat. Kira knows Lillian. Cassidy knows Edna. Cassidy knows Phoebe. Ebony knows Clement. Isaac knows Gemma. Brittany knows Kira. Gemma knows Ebony. Pat knows Cassidy. Isla knows Kirsten. Kirsten knows Carter. Kira knows Kenneth. Kirsten knows Max. Gemma knows Mark. Phoebe knows Brittany. Ebony knows Gerald. Pat knows Kylie. Which of Lillian and Carter can Isaac reach?", "answer": "Carter", "steps": [ "Isaac knows Gemma.", "Gemma knows Ebony.", "Ebony knows Clement.", "Clement knows Isla.", "Isla knows Kirsten.", "Kirsten knows Carter." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Isaac", "Kirsten", "Ebony", "Max", "Mark", "Gemma", "Isla", "Gerald", "Clement", "Carter", "Zane", "Kira", "Cassidy", "Kenneth", "Kylie", "Pat", "Brittany", "Edna", "Phoebe", "Lillian" ], "edges": [ [ 0, 5 ], [ 1, 3 ], [ 1, 9 ], [ 2, 7 ], [ 2, 8 ], [ 5, 4 ], [ 5, 2 ], [ 6, 1 ], [ 8, 6 ], [ 10, 15 ], [ 11, 13 ], [ 11, 19 ], [ 12, 17 ], [ 12, 18 ], [ 15, 14 ], [ 15, 12 ], [ 16, 11 ], [ 18, 16 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Ruth knows Cole. Dakota knows Ruth. Harriet knows Pat. Harriet knows Bryan. Bryan knows Leo. Ruth knows Dolores. Chloe knows Ella. Jean knows Dakota. Jean knows Kylie. Jean knows Ray. Ray knows Chloe. Abby knows Joyce. Pat knows Abby. Bryan knows India. Abby knows Jermaine. India knows Rena. Ray knows Mindy. Harriet knows Sadie. Which of Dakota and Pat can Jean reach?", "answer": "Dakota", "steps": [ "Jean knows Dakota." ], "difficulty": 1, "original_distance": 3, "idx_to_symbol": [ "Jean", "Mindy", "Kylie", "Ella", "Dolores", "Ruth", "Ray", "Chloe", "Dakota", "Cole", "Harriet", "Leo", "Sadie", "Rena", "Jermaine", "Abby", "Bryan", "India", "Pat", "Joyce" ], "edges": [ [ 0, 2 ], [ 0, 6 ], [ 0, 8 ], [ 5, 4 ], [ 5, 9 ], [ 6, 1 ], [ 6, 7 ], [ 7, 3 ], [ 8, 5 ], [ 10, 12 ], [ 10, 16 ], [ 10, 18 ], [ 15, 14 ], [ 15, 19 ], [ 16, 11 ], [ 16, 17 ], [ 17, 13 ], [ 18, 15 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Henrietta knows Janet. Brad knows Harvey. Abel knows Alan. Cole knows Brad. Emily knows Henrietta. Kamila knows Clement. Clement knows Rick. Tim knows Connor. Hailey knows Carter. Trudy knows Emily. Janet knows Jay. Carter knows Tim. Tim knows Trudy. Alan knows Shaun. Clement knows Abel. Stephanie knows Kamila. Jay knows Earle. Shaun knows Cole. Which of Kamila and Carter can Hailey reach?", "answer": "Carter", "steps": [ "Hailey knows Carter." ], "difficulty": 1, "original_distance": 8, "idx_to_symbol": [ "Hailey", "Connor", "Janet", "Tim", "Emily", "Earle", "Henrietta", "Trudy", "Carter", "Jay", "Stephanie", "Rick", "Cole", "Clement", "Alan", "Harvey", "Shaun", "Abel", "Kamila", "Brad" ], "edges": [ [ 0, 8 ], [ 2, 9 ], [ 3, 1 ], [ 3, 7 ], [ 4, 6 ], [ 6, 2 ], [ 7, 4 ], [ 8, 3 ], [ 9, 5 ], [ 10, 18 ], [ 12, 19 ], [ 13, 11 ], [ 13, 17 ], [ 14, 16 ], [ 16, 12 ], [ 17, 14 ], [ 18, 13 ], [ 19, 15 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Ronald knows Colleen. Hubert knows Willis. Ronald knows Jim. Willis knows Alyssa. Wesley knows Elmer. Lamont knows Elsa. Colleen knows Hubert. Colleen knows Eduardo. Eli knows Gage. Harper knows Cole. Alvin knows Cruz. Lamont knows Alvin. Alyssa knows Wesley. Esme knows Ronald. Cruz knows Eli. Gage knows Harper. Alvin knows Cornelius. Madeline knows Lamont. Which of Ronald and Lamont can Madeline reach?", "answer": "Lamont", "steps": [ "Madeline knows Lamont." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Madeline", "Elsa", "Eli", "Cruz", "Harper", "Lamont", "Cornelius", "Alvin", "Gage", "Cole", "Esme", "Jim", "Willis", "Hubert", "Wesley", "Ronald", "Eduardo", "Colleen", "Alyssa", "Elmer" ], "edges": [ [ 0, 5 ], [ 2, 8 ], [ 3, 2 ], [ 4, 9 ], [ 5, 1 ], [ 5, 7 ], [ 7, 6 ], [ 7, 3 ], [ 8, 4 ], [ 10, 15 ], [ 12, 18 ], [ 13, 12 ], [ 14, 19 ], [ 15, 11 ], [ 15, 17 ], [ 17, 16 ], [ 17, 13 ], [ 18, 14 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Joy knows Nora. Elizabeth knows Isiah. Gabriel knows Desmond. Joshua knows Jonas. Norma knows Gabriel. Gabriel knows Mitchell. Eugene knows Lenora. Eugene knows Elizabeth. Yolanda knows Noel. Lenora knows Joshua. Desmond knows Dakota. Eugene knows Jon. Eugene knows Yolanda. Nicole knows Lamont. Vance knows Eugene. Gabriel knows Elaine. Elaine knows Nicole. Gabriel knows Joy. Which of Nicole and Joshua can Norma reach?", "answer": "Nicole", "steps": [ "Norma knows Gabriel.", "Gabriel knows Elaine.", "Elaine knows Nicole." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Norma", "Dakota", "Joy", "Lamont", "Elaine", "Mitchell", "Desmond", "Gabriel", "Nicole", "Nora", "Vance", "Noel", "Elizabeth", "Jonas", "Lenora", "Jon", "Yolanda", "Eugene", "Joshua", "Isiah" ], "edges": [ [ 0, 7 ], [ 2, 9 ], [ 4, 8 ], [ 6, 1 ], [ 7, 5 ], [ 7, 6 ], [ 7, 4 ], [ 7, 2 ], [ 8, 3 ], [ 10, 17 ], [ 12, 19 ], [ 14, 18 ], [ 16, 11 ], [ 17, 15 ], [ 17, 16 ], [ 17, 14 ], [ 17, 12 ], [ 18, 13 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Tim knows Susanne. Emery knows Dawn. Susanne knows Franklin. Susanne knows Odette. Electra knows Philip. Arlene knows Carmen. Jasper knows Emery. Barbara knows Emanuel. Gladys knows Nelson. Electra knows Bart. Arlene knows Jasper. Odette knows Barbara. Carmen knows Electra. Franklin knows Steve. Steve knows Mia. Ivy knows Tim. Nelson knows Arlene. Barbara knows Jakob. Which of Mia and Dawn can Gladys reach?", "answer": "Dawn", "steps": [ "Gladys knows Nelson.", "Nelson knows Arlene.", "Arlene knows Jasper.", "Jasper knows Emery.", "Emery knows Dawn." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Gladys", "Philip", "Carmen", "Electra", "Dawn", "Arlene", "Emery", "Bart", "Nelson", "Jasper", "Ivy", "Jakob", "Odette", "Barbara", "Mia", "Susanne", "Steve", "Emanuel", "Tim", "Franklin" ], "edges": [ [ 0, 8 ], [ 2, 3 ], [ 3, 1 ], [ 3, 7 ], [ 5, 2 ], [ 5, 9 ], [ 6, 4 ], [ 8, 5 ], [ 9, 6 ], [ 10, 18 ], [ 12, 13 ], [ 13, 11 ], [ 13, 17 ], [ 15, 12 ], [ 15, 19 ], [ 16, 14 ], [ 18, 15 ], [ 19, 16 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Etta knows Todd. Dean knows Jillian. Denise knows Harrison. Fern knows Lance. Fern knows Arturo. Lance knows Gustavo. Gustavo knows Trina. Jack knows Denise. Denise knows Kate. Fern knows Glenda. Etta knows Fern. Dean knows Cooper. Harrison knows Dean. Kate knows Darcy. Glenda knows Trevor. Gustavo knows Tina. Denise knows Keegan. Jack knows Gerald. Which of Trina and Jillian can Jack reach?", "answer": "Jillian", "steps": [ "Jack knows Denise.", "Denise knows Harrison.", "Harrison knows Dean.", "Dean knows Jillian." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Jack", "Darcy", "Keegan", "Denise", "Harrison", "Dean", "Jillian", "Cooper", "Gerald", "Kate", "Etta", "Trevor", "Arturo", "Fern", "Lance", "Gustavo", "Trina", "Tina", "Todd", "Glenda" ], "edges": [ [ 0, 8 ], [ 0, 3 ], [ 3, 2 ], [ 3, 4 ], [ 3, 9 ], [ 4, 5 ], [ 5, 6 ], [ 5, 7 ], [ 9, 1 ], [ 10, 18 ], [ 10, 13 ], [ 13, 12 ], [ 13, 14 ], [ 13, 19 ], [ 14, 15 ], [ 15, 16 ], [ 15, 17 ], [ 19, 11 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Cole knows Deanna. Heather knows Anthony. Lawrence knows Cole. Odette knows Harry. Rachel knows Valerie. Harry knows Rachel. Valerie knows Brittany. Carl knows Ramon. Cole knows Carl. Anthony knows Lawrence. Dewey knows Ebony. Ebony knows Odette. Rachel knows Jodi. Valerie knows Kate. Valerie knows Annette. Taylor knows Heather. Carl knows Madeline. Carl knows Marlene. Which of Harry and Lawrence can Dewey reach?", "answer": "Harry", "steps": [ "Dewey knows Ebony.", "Ebony knows Odette.", "Odette knows Harry." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Dewey", "Odette", "Annette", "Valerie", "Harry", "Rachel", "Ebony", "Jodi", "Brittany", "Kate", "Taylor", "Anthony", "Madeline", "Carl", "Lawrence", "Cole", "Heather", "Deanna", "Ramon", "Marlene" ], "edges": [ [ 0, 6 ], [ 1, 4 ], [ 3, 2 ], [ 3, 8 ], [ 3, 9 ], [ 4, 5 ], [ 5, 7 ], [ 5, 3 ], [ 6, 1 ], [ 10, 16 ], [ 11, 14 ], [ 13, 12 ], [ 13, 18 ], [ 13, 19 ], [ 14, 15 ], [ 15, 17 ], [ 15, 13 ], [ 16, 11 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Barbara knows Holden. Miranda knows Drew. Peggy knows Gail. Barbara knows Peggy. Gwen knows Demetrius. Elsa knows Steve. Kathleen knows Barbara. Jude knows Kathleen. Riley knows Travis. Demetrius knows Riley. Andrew knows Tamara. Alejandro knows Andrew. Elsa knows Miranda. Tamara knows Elsa. Peggy knows Gwen. Hazel knows Hayes. Tamara knows Brody. Drew knows Hazel. Which of Travis and Hayes can Alejandro reach?", "answer": "Hayes", "steps": [ "Alejandro knows Andrew.", "Andrew knows Tamara.", "Tamara knows Elsa.", "Elsa knows Miranda.", "Miranda knows Drew.", "Drew knows Hazel.", "Hazel knows Hayes." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Alejandro", "Drew", "Tamara", "Hayes", "Andrew", "Brody", "Steve", "Elsa", "Miranda", "Hazel", "Jude", "Demetrius", "Barbara", "Travis", "Kathleen", "Holden", "Gail", "Peggy", "Gwen", "Riley" ], "edges": [ [ 0, 4 ], [ 1, 9 ], [ 2, 5 ], [ 2, 7 ], [ 4, 2 ], [ 7, 6 ], [ 7, 8 ], [ 8, 1 ], [ 9, 3 ], [ 10, 14 ], [ 11, 19 ], [ 12, 15 ], [ 12, 17 ], [ 14, 12 ], [ 17, 16 ], [ 17, 18 ], [ 18, 11 ], [ 19, 13 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "James knows Allen. Houston knows Garrett. James knows Brett. Robert knows Della. Wendy knows Houston. Gemma knows Phoebe. Houston knows Francesca. Darnell knows Spencer. Spencer knows Gemma. Gemma knows Quinn. Robert knows Martin. Darnell knows Claude. Robert knows James. Quinn knows Morgan. Gemma knows Jerry. Garrett knows Robert. Amelia knows Darnell. Quinn knows Jeremiah. Which of Spencer and Garrett can Amelia reach?", "answer": "Spencer", "steps": [ "Amelia knows Darnell.", "Darnell knows Spencer." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Amelia", "Claude", "Phoebe", "Spencer", "Jerry", "Darnell", "Quinn", "Gemma", "Morgan", "Jeremiah", "Wendy", "Francesca", "Della", "Garrett", "Martin", "Houston", "James", "Robert", "Allen", "Brett" ], "edges": [ [ 0, 5 ], [ 3, 7 ], [ 5, 1 ], [ 5, 3 ], [ 6, 8 ], [ 6, 9 ], [ 7, 2 ], [ 7, 4 ], [ 7, 6 ], [ 10, 15 ], [ 13, 17 ], [ 15, 11 ], [ 15, 13 ], [ 16, 18 ], [ 16, 19 ], [ 17, 12 ], [ 17, 14 ], [ 17, 16 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Stella knows Chandler. Bridget knows Laura. Antonio knows Kit. Stella knows Heath. Hampton knows Jade. Heath knows Daniella. Laura knows Hampton. Shannon knows Stella. Heath knows Saul. Tonya knows Bridget. Reed knows Bart. Kit knows Sara. Farrah knows Shannon. Laura knows Antonio. Chandler knows Reed. Jade knows Zoe. Antonio knows Eunice. Daniella knows Jose. Which of Hampton and Chandler can Farrah reach?", "answer": "Chandler", "steps": [ "Farrah knows Shannon.", "Shannon knows Stella.", "Stella knows Chandler." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Farrah", "Chandler", "Bart", "Jose", "Shannon", "Heath", "Reed", "Daniella", "Saul", "Stella", "Tonya", "Hampton", "Zoe", "Sara", "Bridget", "Antonio", "Jade", "Kit", "Eunice", "Laura" ], "edges": [ [ 0, 4 ], [ 1, 6 ], [ 4, 9 ], [ 5, 7 ], [ 5, 8 ], [ 6, 2 ], [ 7, 3 ], [ 9, 1 ], [ 9, 5 ], [ 10, 14 ], [ 11, 16 ], [ 14, 19 ], [ 15, 17 ], [ 15, 18 ], [ 16, 12 ], [ 17, 13 ], [ 19, 11 ], [ 19, 15 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Daniel knows Haley. Kelly knows Vance. Axel knows Bryan. Nina knows Wayne. Axel knows Sheila. Sheila knows Richard. Electra knows Jon. Kelly knows Edward. Wayne knows Dana. Vance knows Nina. Hailey knows Tyler. Gemma knows Naomi. Daniel knows Kate. Electra knows Hailey. Haley knows Fisher. Fisher knows Axel. Wayne knows Electra. Sheila knows Gemma. Which of Naomi and Tyler can Daniel reach?", "answer": "Naomi", "steps": [ "Daniel knows Haley.", "Haley knows Fisher.", "Fisher knows Axel.", "Axel knows Sheila.", "Sheila knows Gemma.", "Gemma knows Naomi." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Daniel", "Sheila", "Naomi", "Richard", "Haley", "Bryan", "Fisher", "Gemma", "Axel", "Kate", "Kelly", "Electra", "Tyler", "Jon", "Vance", "Dana", "Nina", "Hailey", "Wayne", "Edward" ], "edges": [ [ 0, 4 ], [ 0, 9 ], [ 1, 3 ], [ 1, 7 ], [ 4, 6 ], [ 6, 8 ], [ 7, 2 ], [ 8, 5 ], [ 8, 1 ], [ 10, 14 ], [ 10, 19 ], [ 11, 13 ], [ 11, 17 ], [ 14, 16 ], [ 16, 18 ], [ 17, 12 ], [ 18, 15 ], [ 18, 11 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Fabian knows Joel. Iris knows Joshua. Iris knows Kareem. Hunter knows Kingsley. Kingsley knows Belinda. Joel knows Tamara. Gina knows Edison. Kingsley knows Dalton. Eleanor knows Antonio. Iris knows Zack. Belinda knows Iris. Joel knows Earl. Alder knows Hunter. Gina knows Eleanor. Alder knows Jamie. Antonio knows Edgar. Joel knows Jack. Antonio knows Fabian. Which of Iris and Joel can Gina reach?", "answer": "Joel", "steps": [ "Gina knows Eleanor.", "Eleanor knows Antonio.", "Antonio knows Fabian.", "Fabian knows Joel." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Gina", "Tamara", "Edison", "Fabian", "Antonio", "Jack", "Edgar", "Joel", "Eleanor", "Earl", "Alder", "Kareem", "Jamie", "Belinda", "Kingsley", "Joshua", "Dalton", "Iris", "Hunter", "Zack" ], "edges": [ [ 0, 2 ], [ 0, 8 ], [ 3, 7 ], [ 4, 6 ], [ 4, 3 ], [ 7, 1 ], [ 7, 5 ], [ 7, 9 ], [ 8, 4 ], [ 10, 12 ], [ 10, 18 ], [ 13, 17 ], [ 14, 16 ], [ 14, 13 ], [ 17, 11 ], [ 17, 15 ], [ 17, 19 ], [ 18, 14 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Clement knows Isla. Zane knows Pat. Kira knows Lillian. Cassidy knows Edna. Cassidy knows Phoebe. Ebony knows Clement. Isaac knows Gemma. Brittany knows Kira. Gemma knows Ebony. Pat knows Cassidy. Isla knows Kirsten. Kirsten knows Carter. Kira knows Kenneth. Kirsten knows Max. Gemma knows Mark. Phoebe knows Brittany. Ebony knows Gerald. Pat knows Kylie. Which of Ebony and Cassidy can Isaac reach?", "answer": "Ebony", "steps": [ "Isaac knows Gemma.", "Gemma knows Ebony." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Isaac", "Kirsten", "Ebony", "Max", "Mark", "Gemma", "Isla", "Gerald", "Clement", "Carter", "Zane", "Kira", "Cassidy", "Kenneth", "Kylie", "Pat", "Brittany", "Edna", "Phoebe", "Lillian" ], "edges": [ [ 0, 5 ], [ 1, 3 ], [ 1, 9 ], [ 2, 7 ], [ 2, 8 ], [ 5, 4 ], [ 5, 2 ], [ 6, 1 ], [ 8, 6 ], [ 10, 15 ], [ 11, 13 ], [ 11, 19 ], [ 12, 17 ], [ 12, 18 ], [ 15, 14 ], [ 15, 12 ], [ 16, 11 ], [ 18, 16 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Eve knows Glen. Jolena knows Florence. Frank knows Spencer. Milton knows Lucia. Milton knows Carlos. Beth knows Ursula. Winifred knows Frank. Carlos knows Nicholas. Edmund knows Vanessa. Aisha knows Lucas. Lucas knows Harmony. Edmund knows Eve. Jolena knows Aisha. Beth knows Winifred. Edmund knows Jolena. Edmund knows Darwin. Milton knows Beth. Milton knows Marvin. Which of Aisha and Winifred can Milton reach?", "answer": "Winifred", "steps": [ "Milton knows Beth.", "Beth knows Winifred." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Milton", "Frank", "Carlos", "Spencer", "Nicholas", "Beth", "Ursula", "Marvin", "Winifred", "Lucia", "Edmund", "Lucas", "Eve", "Harmony", "Glen", "Jolena", "Florence", "Vanessa", "Aisha", "Darwin" ], "edges": [ [ 0, 2 ], [ 0, 7 ], [ 0, 5 ], [ 0, 9 ], [ 1, 3 ], [ 2, 4 ], [ 5, 6 ], [ 5, 8 ], [ 8, 1 ], [ 10, 12 ], [ 10, 17 ], [ 10, 15 ], [ 10, 19 ], [ 11, 13 ], [ 12, 14 ], [ 15, 16 ], [ 15, 18 ], [ 18, 11 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Greta knows Derrick. Fleur knows Jana. Alan knows Leah. Leah knows Beau. Lucia knows Greta. Clayton knows Lucia. Alan knows Irma. Rebecca knows Celeste. Tina knows Yvonne. Greta knows Tina. Celeste knows Hayden. Yvonne knows Bella. Tina knows Emily. Hayden knows Alan. Derrick knows Lambert. Irma knows Mae. Irma knows Fleur. Teresa knows Clayton. Which of Greta and Alan can Teresa reach?", "answer": "Greta", "steps": [ "Teresa knows Clayton.", "Clayton knows Lucia.", "Lucia knows Greta." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Teresa", "Lucia", "Clayton", "Derrick", "Tina", "Bella", "Greta", "Emily", "Lambert", "Yvonne", "Rebecca", "Hayden", "Celeste", "Leah", "Irma", "Jana", "Alan", "Mae", "Beau", "Fleur" ], "edges": [ [ 0, 2 ], [ 1, 6 ], [ 2, 1 ], [ 3, 8 ], [ 4, 7 ], [ 4, 9 ], [ 6, 3 ], [ 6, 4 ], [ 9, 5 ], [ 10, 12 ], [ 11, 16 ], [ 12, 11 ], [ 13, 18 ], [ 14, 17 ], [ 14, 19 ], [ 16, 13 ], [ 16, 14 ], [ 19, 15 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Cassidy knows Xavier. Brett knows Flora. Axel knows Yvonne. Yvonne knows Ingrid. Luther knows Julie. James knows George. George knows Axel. Rocco knows Cassidy. Miranda knows Teresa. Flora knows Darcy. Itzel knows Rocco. Darcy knows Autumn. Itzel knows Brett. Merle knows Miranda. Bella knows James. Bella knows Merle. Teresa knows Holden. Xavier knows Luther. Which of George and Cassidy can Itzel reach?", "answer": "Cassidy", "steps": [ "Itzel knows Rocco.", "Rocco knows Cassidy." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Itzel", "Brett", "Luther", "Julie", "Cassidy", "Autumn", "Darcy", "Rocco", "Xavier", "Flora", "Bella", "Merle", "Yvonne", "Ingrid", "George", "Holden", "Teresa", "James", "Axel", "Miranda" ], "edges": [ [ 0, 7 ], [ 0, 1 ], [ 1, 9 ], [ 2, 3 ], [ 4, 8 ], [ 6, 5 ], [ 7, 4 ], [ 8, 2 ], [ 9, 6 ], [ 10, 17 ], [ 10, 11 ], [ 11, 19 ], [ 12, 13 ], [ 14, 18 ], [ 16, 15 ], [ 17, 14 ], [ 18, 12 ], [ 19, 16 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Clement knows Isla. Zane knows Pat. Kira knows Lillian. Cassidy knows Edna. Cassidy knows Phoebe. Ebony knows Clement. Isaac knows Gemma. Brittany knows Kira. Gemma knows Ebony. Pat knows Cassidy. Isla knows Kirsten. Kirsten knows Carter. Kira knows Kenneth. Kirsten knows Max. Gemma knows Mark. Phoebe knows Brittany. Ebony knows Gerald. Pat knows Kylie. Which of Kirsten and Kira can Isaac reach?", "answer": "Kirsten", "steps": [ "Isaac knows Gemma.", "Gemma knows Ebony.", "Ebony knows Clement.", "Clement knows Isla.", "Isla knows Kirsten." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Isaac", "Kirsten", "Ebony", "Max", "Mark", "Gemma", "Isla", "Gerald", "Clement", "Carter", "Zane", "Kira", "Cassidy", "Kenneth", "Kylie", "Pat", "Brittany", "Edna", "Phoebe", "Lillian" ], "edges": [ [ 0, 5 ], [ 1, 3 ], [ 1, 9 ], [ 2, 7 ], [ 2, 8 ], [ 5, 4 ], [ 5, 2 ], [ 6, 1 ], [ 8, 6 ], [ 10, 15 ], [ 11, 13 ], [ 11, 19 ], [ 12, 17 ], [ 12, 18 ], [ 15, 14 ], [ 15, 12 ], [ 16, 11 ], [ 18, 16 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Alejandro knows Verna. Emery knows Delilah. Gary knows Arthur. Emery knows Sue. Arthur knows Louise. Verna knows Essie. Edith knows Sonia. Sue knows Gary. Drake knows Alejandro. Alejandro knows Edith. Hilda knows Julio. Delilah knows Bernice. Arthur knows Graeme. Sonia knows Hilda. Donald knows Emery. Hilda knows Jonas. Hilda knows Hal. Arthur knows David. Which of Sue and Edith can Donald reach?", "answer": "Sue", "steps": [ "Donald knows Emery.", "Emery knows Sue." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Donald", "Arthur", "Sue", "David", "Bernice", "Gary", "Graeme", "Louise", "Delilah", "Emery", "Drake", "Hilda", "Edith", "Jonas", "Essie", "Sonia", "Hal", "Julio", "Verna", "Alejandro" ], "edges": [ [ 0, 9 ], [ 1, 3 ], [ 1, 6 ], [ 1, 7 ], [ 2, 5 ], [ 5, 1 ], [ 8, 4 ], [ 9, 2 ], [ 9, 8 ], [ 10, 19 ], [ 11, 13 ], [ 11, 16 ], [ 11, 17 ], [ 12, 15 ], [ 15, 11 ], [ 18, 14 ], [ 19, 12 ], [ 19, 18 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Lorenzo knows Wilma. Sheryl knows Phoebe. Aubrey knows Alvin. Alyssa knows Celia. Wilma knows Irene. Chandler knows Ezra. Phoebe knows Zara. Ida knows Nelson. Alvin knows Ida. Agnes knows Lorenzo. Dirk knows Kai. Ezra knows Sheryl. Nelson knows Agnes. Adele knows Chandler. Etta knows Winston. Sheryl knows Dirk. Nelson knows Alyssa. Zara knows Etta. Which of Winston and Irene can Aubrey reach?", "answer": "Irene", "steps": [ "Aubrey knows Alvin.", "Alvin knows Ida.", "Ida knows Nelson.", "Nelson knows Agnes.", "Agnes knows Lorenzo.", "Lorenzo knows Wilma.", "Wilma knows Irene." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Aubrey", "Nelson", "Wilma", "Lorenzo", "Irene", "Alvin", "Alyssa", "Celia", "Agnes", "Ida", "Adele", "Sheryl", "Etta", "Zara", "Winston", "Chandler", "Dirk", "Kai", "Phoebe", "Ezra" ], "edges": [ [ 0, 5 ], [ 1, 6 ], [ 1, 8 ], [ 2, 4 ], [ 3, 2 ], [ 5, 9 ], [ 6, 7 ], [ 8, 3 ], [ 9, 1 ], [ 10, 15 ], [ 11, 16 ], [ 11, 18 ], [ 12, 14 ], [ 13, 12 ], [ 15, 19 ], [ 16, 17 ], [ 18, 13 ], [ 19, 11 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Carrie knows Colin. Lucy knows Federico. Carrie knows Willard. Erik knows Claude. Garrett knows Carla. Sydney knows Horace. Sydney knows Carrie. Leon knows Matt. Lucy knows Jill. Lorenzo knows Sydney. Leon knows Rose. Garrett knows Ava. Julia knows Leon. Leon knows Lucy. Erik knows Gemma. Leon knows Erik. Sydney knows Garrett. Sydney knows Raymond. Which of Leon and Sydney can Julia reach?", "answer": "Leon", "steps": [ "Julia knows Leon." ], "difficulty": 1, "original_distance": 3, "idx_to_symbol": [ "Julia", "Leon", "Claude", "Erik", "Federico", "Rose", "Matt", "Lucy", "Jill", "Gemma", "Lorenzo", "Sydney", "Colin", "Carrie", "Ava", "Horace", "Raymond", "Garrett", "Carla", "Willard" ], "edges": [ [ 0, 1 ], [ 1, 5 ], [ 1, 6 ], [ 1, 7 ], [ 1, 3 ], [ 3, 2 ], [ 3, 9 ], [ 7, 4 ], [ 7, 8 ], [ 10, 11 ], [ 11, 15 ], [ 11, 16 ], [ 11, 17 ], [ 11, 13 ], [ 13, 12 ], [ 13, 19 ], [ 17, 14 ], [ 17, 18 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Karl knows Dallas. Marvin knows Rosemary. Gabriel knows Adrian. Lennox knows Ramona. Gabriel knows Pam. Kara knows Alvin. Lenora knows Loretta. Pam knows Mary. Marvin knows Chandler. Chandler knows Ted. Ramona knows Evan. Karl knows Jonah. Chandler knows Lenora. Evan knows Marvin. Evan knows Nancy. Alvin knows Karl. Jonah knows Blake. Jonah knows Gabriel. Which of Mary and Loretta can Kara reach?", "answer": "Mary", "steps": [ "Kara knows Alvin.", "Alvin knows Karl.", "Karl knows Jonah.", "Jonah knows Gabriel.", "Gabriel knows Pam.", "Pam knows Mary." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Kara", "Pam", "Karl", "Jonah", "Gabriel", "Dallas", "Blake", "Alvin", "Adrian", "Mary", "Lennox", "Lenora", "Evan", "Marvin", "Chandler", "Nancy", "Rosemary", "Ramona", "Ted", "Loretta" ], "edges": [ [ 0, 7 ], [ 1, 9 ], [ 2, 5 ], [ 2, 3 ], [ 3, 6 ], [ 3, 4 ], [ 4, 8 ], [ 4, 1 ], [ 7, 2 ], [ 10, 17 ], [ 11, 19 ], [ 12, 15 ], [ 12, 13 ], [ 13, 16 ], [ 13, 14 ], [ 14, 18 ], [ 14, 11 ], [ 17, 12 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Edgar knows Julio. Marshall knows Leon. Gonzalo knows Blaine. Alex knows Will. Blaine knows Alex. Leon knows Sally. Dora knows Myra. Andrea knows Paige. Myra knows Kara. Drew knows Edgar. Kara knows Greg. Sally knows Andrea. Terry knows Dora. Andrea knows Gonzalo. Jocelyn knows Edna. Edgar knows Jocelyn. Blaine knows Peter. Kara knows Drew. Which of Kara and Andrea can Terry reach?", "answer": "Kara", "steps": [ "Terry knows Dora.", "Dora knows Myra.", "Myra knows Kara." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Terry", "Edgar", "Kara", "Edna", "Julio", "Drew", "Jocelyn", "Myra", "Dora", "Greg", "Marshall", "Blaine", "Andrea", "Will", "Peter", "Gonzalo", "Alex", "Sally", "Leon", "Paige" ], "edges": [ [ 0, 8 ], [ 1, 4 ], [ 1, 6 ], [ 2, 5 ], [ 2, 9 ], [ 5, 1 ], [ 6, 3 ], [ 7, 2 ], [ 8, 7 ], [ 10, 18 ], [ 11, 14 ], [ 11, 16 ], [ 12, 15 ], [ 12, 19 ], [ 15, 11 ], [ 16, 13 ], [ 17, 12 ], [ 18, 17 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Janice knows Ainsley. Graeme knows Blake. Destiny knows Maria. Herbert knows Alice. Carmela knows Janice. Vicki knows Carmela. Elmer knows Estella. Janice knows Graeme. Alice knows Vicki. Wallace knows Elmer. Stefan knows Jennifer. Maria knows Stefan. Elmer knows Scott. Jules knows Glenn. Cate knows Herbert. Stefan knows Jules. Estella knows Destiny. Herbert knows Charity. Which of Janice and Stefan can Cate reach?", "answer": "Janice", "steps": [ "Cate knows Herbert.", "Herbert knows Alice.", "Alice knows Vicki.", "Vicki knows Carmela.", "Carmela knows Janice." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Cate", "Ainsley", "Alice", "Vicki", "Herbert", "Charity", "Carmela", "Graeme", "Janice", "Blake", "Wallace", "Jennifer", "Estella", "Destiny", "Elmer", "Scott", "Maria", "Jules", "Stefan", "Glenn" ], "edges": [ [ 0, 4 ], [ 2, 3 ], [ 3, 6 ], [ 4, 5 ], [ 4, 2 ], [ 6, 8 ], [ 7, 9 ], [ 8, 1 ], [ 8, 7 ], [ 10, 14 ], [ 12, 13 ], [ 13, 16 ], [ 14, 15 ], [ 14, 12 ], [ 16, 18 ], [ 17, 19 ], [ 18, 11 ], [ 18, 17 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Myra knows Dalton. Jeremiah knows Ted. Georgia knows Elena. Aubrey knows Drake. Aria knows August. Georgia knows Mark. Drake knows Kenneth. Madeline knows Aria. Leigh knows Kaleb. Drake knows Humphrey. Ted knows Georgia. Kaleb knows Aubrey. Myra knows Deborah. August knows Jon. Kenneth knows Myra. Jeremiah knows Emanuel. Fabian knows Leigh. Jon knows Jeremiah. Which of Jeremiah and Drake can Fabian reach?", "answer": "Drake", "steps": [ "Fabian knows Leigh.", "Leigh knows Kaleb.", "Kaleb knows Aubrey.", "Aubrey knows Drake." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Fabian", "Leigh", "Myra", "Aubrey", "Humphrey", "Drake", "Kenneth", "Deborah", "Dalton", "Kaleb", "Madeline", "Aria", "Georgia", "Jon", "Emanuel", "Jeremiah", "Ted", "Elena", "Mark", "August" ], "edges": [ [ 0, 1 ], [ 1, 9 ], [ 2, 7 ], [ 2, 8 ], [ 3, 5 ], [ 5, 4 ], [ 5, 6 ], [ 6, 2 ], [ 9, 3 ], [ 10, 11 ], [ 11, 19 ], [ 12, 17 ], [ 12, 18 ], [ 13, 15 ], [ 15, 14 ], [ 15, 16 ], [ 16, 12 ], [ 19, 13 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Calvin knows Harvey. Brynn knows Frankie. Harvey knows Ira. Regina knows Dolores. Nell knows Sarah. Monroe knows Regina. Sarah knows Jeff. Vivian knows Nell. Frankie knows Alana. Jackson knows Monroe. Sarah knows Magdalena. Hamilton knows Brynn. Carey knows Hamilton. Clement knows Calvin. Carey knows Clement. Jackson knows Vivian. Frankie knows Gloria. Dolores knows Kurt. Which of Vivian and Hamilton can Carey reach?", "answer": "Hamilton", "steps": [ "Carey knows Hamilton." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Carey", "Calvin", "Hamilton", "Gloria", "Ira", "Alana", "Brynn", "Clement", "Harvey", "Frankie", "Jackson", "Regina", "Vivian", "Jeff", "Kurt", "Magdalena", "Nell", "Monroe", "Dolores", "Sarah" ], "edges": [ [ 0, 7 ], [ 0, 2 ], [ 1, 8 ], [ 2, 6 ], [ 6, 9 ], [ 7, 1 ], [ 8, 4 ], [ 9, 3 ], [ 9, 5 ], [ 10, 17 ], [ 10, 12 ], [ 11, 18 ], [ 12, 16 ], [ 16, 19 ], [ 17, 11 ], [ 18, 14 ], [ 19, 13 ], [ 19, 15 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Arden knows Jason. Fritz knows Carlton. Fritz knows Clarence. Chad knows Virginia. Jason knows Chad. Dwight knows Dustin. Hugo knows Colby. Clarence knows Eleanor. Dustin knows Vincent. Carlton knows Kingsley. Colby knows Brock. Hugo knows Devon. Vincent knows Arturo. Vincent knows Hugo. Vincent knows Eve. Chad knows Fritz. Devon knows Jasmine. Chad knows Caroline. Which of Chad and Vincent can Arden reach?", "answer": "Chad", "steps": [ "Arden knows Jason.", "Jason knows Chad." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Arden", "Carlton", "Jason", "Caroline", "Eleanor", "Clarence", "Virginia", "Chad", "Kingsley", "Fritz", "Dwight", "Colby", "Dustin", "Eve", "Jasmine", "Devon", "Arturo", "Vincent", "Brock", "Hugo" ], "edges": [ [ 0, 2 ], [ 1, 8 ], [ 2, 7 ], [ 5, 4 ], [ 7, 3 ], [ 7, 6 ], [ 7, 9 ], [ 9, 5 ], [ 9, 1 ], [ 10, 12 ], [ 11, 18 ], [ 12, 17 ], [ 15, 14 ], [ 17, 13 ], [ 17, 16 ], [ 17, 19 ], [ 19, 15 ], [ 19, 11 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Kelly knows Alison. Preston knows Drake. Wade knows Preston. Samantha knows Jana. Preston knows Sylvia. Kelly knows Selena. Jana knows Margaret. Catherine knows Evelyn. Drake knows Dwight. Drake knows Catherine. Drake knows Paula. Preston knows Conner. Kelly knows Grover. Sylvia knows Ralph. Samantha knows Jorge. Alison knows Caleb. Samantha knows Kelly. Todd knows Samantha. Which of Drake and Kelly can Wade reach?", "answer": "Drake", "steps": [ "Wade knows Preston.", "Preston knows Drake." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Wade", "Catherine", "Sylvia", "Drake", "Conner", "Paula", "Preston", "Dwight", "Ralph", "Evelyn", "Todd", "Alison", "Jana", "Kelly", "Jorge", "Selena", "Samantha", "Grover", "Margaret", "Caleb" ], "edges": [ [ 0, 6 ], [ 1, 9 ], [ 2, 8 ], [ 3, 5 ], [ 3, 7 ], [ 3, 1 ], [ 6, 4 ], [ 6, 2 ], [ 6, 3 ], [ 10, 16 ], [ 11, 19 ], [ 12, 18 ], [ 13, 15 ], [ 13, 17 ], [ 13, 11 ], [ 16, 14 ], [ 16, 12 ], [ 16, 13 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Alejandro knows Verna. Emery knows Delilah. Gary knows Arthur. Emery knows Sue. Arthur knows Louise. Verna knows Essie. Edith knows Sonia. Sue knows Gary. Drake knows Alejandro. Alejandro knows Edith. Hilda knows Julio. Delilah knows Bernice. Arthur knows Graeme. Sonia knows Hilda. Donald knows Emery. Hilda knows Jonas. Hilda knows Hal. Arthur knows David. Which of Alejandro and Emery can Donald reach?", "answer": "Emery", "steps": [ "Donald knows Emery." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Donald", "Arthur", "Sue", "David", "Bernice", "Gary", "Graeme", "Louise", "Delilah", "Emery", "Drake", "Hilda", "Edith", "Jonas", "Essie", "Sonia", "Hal", "Julio", "Verna", "Alejandro" ], "edges": [ [ 0, 9 ], [ 1, 3 ], [ 1, 6 ], [ 1, 7 ], [ 2, 5 ], [ 5, 1 ], [ 8, 4 ], [ 9, 2 ], [ 9, 8 ], [ 10, 19 ], [ 11, 13 ], [ 11, 16 ], [ 11, 17 ], [ 12, 15 ], [ 15, 11 ], [ 18, 14 ], [ 19, 12 ], [ 19, 18 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Jenny knows Edwin. Whitney knows Ivan. Walt knows Elodie. Kirsten knows Jenny. Kirsten knows Luz. Walt knows Lacey. Luz knows Stuart. Whitney knows Clarence. Joy knows Whitney. Camille knows Ember. Ember knows Duke. Walt knows Camille. Edwin knows Julius. Lacey knows Robin. Robin knows Edmund. Elodie knows Louis. Robin knows Eduardo. Kirsten knows Joy. Which of Whitney and Robin can Walt reach?", "answer": "Robin", "steps": [ "Walt knows Lacey.", "Lacey knows Robin." ], "difficulty": 2, "original_distance": 3, "idx_to_symbol": [ "Walt", "Eduardo", "Edmund", "Camille", "Elodie", "Louis", "Duke", "Lacey", "Ember", "Robin", "Kirsten", "Ivan", "Clarence", "Jenny", "Luz", "Stuart", "Julius", "Joy", "Edwin", "Whitney" ], "edges": [ [ 0, 4 ], [ 0, 3 ], [ 0, 7 ], [ 3, 8 ], [ 4, 5 ], [ 7, 9 ], [ 8, 6 ], [ 9, 1 ], [ 9, 2 ], [ 10, 14 ], [ 10, 13 ], [ 10, 17 ], [ 13, 18 ], [ 14, 15 ], [ 17, 19 ], [ 18, 16 ], [ 19, 11 ], [ 19, 12 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Cecilia knows Miriam. Leopold knows Violet. Elvis knows Ariana. Cecilia knows Wendell. Violet knows Katherine. Marie knows Luz. Destiny knows Kristina. Miriam knows Destiny. Yvette knows Kieran. Kieran knows Alder. Katherine knows Dirk. Elvis knows Loretta. Yvette knows Elvis. Marie knows Yasmin. Isabel knows Marie. Isabel knows Cecilia. Kieran knows Leopold. Kristina knows Katrina. Which of Katrina and Dirk can Yvette reach?", "answer": "Dirk", "steps": [ "Yvette knows Kieran.", "Kieran knows Leopold.", "Leopold knows Violet.", "Violet knows Katherine.", "Katherine knows Dirk." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Yvette", "Violet", "Alder", "Kieran", "Loretta", "Ariana", "Katherine", "Leopold", "Dirk", "Elvis", "Isabel", "Destiny", "Wendell", "Cecilia", "Yasmin", "Luz", "Kristina", "Miriam", "Katrina", "Marie" ], "edges": [ [ 0, 3 ], [ 0, 9 ], [ 1, 6 ], [ 3, 2 ], [ 3, 7 ], [ 6, 8 ], [ 7, 1 ], [ 9, 4 ], [ 9, 5 ], [ 10, 13 ], [ 10, 19 ], [ 11, 16 ], [ 13, 12 ], [ 13, 17 ], [ 16, 18 ], [ 17, 11 ], [ 19, 14 ], [ 19, 15 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Andrea knows Zelda. Graham knows Harris. Tony knows Etta. Layla knows Darius. Andrea knows Graham. Pam knows Tiffany. Allen knows Layla. Zara knows Gemma. Tiffany knows Cynthia. Zelda knows Cyrus. Tony knows Andrea. Allen knows Audrey. Cyrus knows Zara. Vernon knows Liam. Cyrus knows Clifford. Tiffany knows Vernon. Pam knows Alice. Cynthia knows Allen. Which of Zelda and Cynthia can Pam reach?", "answer": "Cynthia", "steps": [ "Pam knows Tiffany.", "Tiffany knows Cynthia." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Pam", "Audrey", "Cynthia", "Tiffany", "Alice", "Allen", "Liam", "Darius", "Vernon", "Layla", "Tony", "Clifford", "Zelda", "Andrea", "Etta", "Cyrus", "Harris", "Gemma", "Graham", "Zara" ], "edges": [ [ 0, 4 ], [ 0, 3 ], [ 2, 5 ], [ 3, 8 ], [ 3, 2 ], [ 5, 1 ], [ 5, 9 ], [ 8, 6 ], [ 9, 7 ], [ 10, 14 ], [ 10, 13 ], [ 12, 15 ], [ 13, 18 ], [ 13, 12 ], [ 15, 11 ], [ 15, 19 ], [ 18, 16 ], [ 19, 17 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Robin knows Bridget. Darla knows Garrison. Kennedy knows Elsa. Darla knows Roland. Louis knows Robin. Mindy knows Kennedy. Garrett knows Glenda. Emma knows Mae. Kennedy knows Garrett. Garrett knows Jenna. Garrison knows Emma. Emma knows Janet. Marcus knows Kane. Mason knows Marcus. Garrett knows Mason. Marcus knows Iris. Darla knows Nelson. Robin knows Darla. Which of Kennedy and Robin can Louis reach?", "answer": "Robin", "steps": [ "Louis knows Robin." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Louis", "Emma", "Janet", "Mae", "Bridget", "Nelson", "Roland", "Darla", "Robin", "Garrison", "Mindy", "Marcus", "Iris", "Kane", "Elsa", "Jenna", "Glenda", "Garrett", "Kennedy", "Mason" ], "edges": [ [ 0, 8 ], [ 1, 2 ], [ 1, 3 ], [ 7, 5 ], [ 7, 6 ], [ 7, 9 ], [ 8, 4 ], [ 8, 7 ], [ 9, 1 ], [ 10, 18 ], [ 11, 12 ], [ 11, 13 ], [ 17, 15 ], [ 17, 16 ], [ 17, 19 ], [ 18, 14 ], [ 18, 17 ], [ 19, 11 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Jarvis knows Clay. Will knows Kendrick. Philip knows Dirk. June knows Brooks. Marshall knows Loretta. Tony knows Lyle. Milton knows Jarvis. Kendrick knows Marshall. Marco knows Will. Israel knows Marco. Kendrick knows Gene. Milton knows Seth. Will knows Lola. Laverne knows Jorge. June knows Milton. Clay knows Laverne. Dirk knows June. Loretta knows Tony. Which of Dirk and Marco can Israel reach?", "answer": "Marco", "steps": [ "Israel knows Marco." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Israel", "Lyle", "Will", "Gene", "Tony", "Kendrick", "Marshall", "Marco", "Lola", "Loretta", "Philip", "Jorge", "June", "Seth", "Laverne", "Milton", "Jarvis", "Dirk", "Brooks", "Clay" ], "edges": [ [ 0, 7 ], [ 2, 8 ], [ 2, 5 ], [ 4, 1 ], [ 5, 3 ], [ 5, 6 ], [ 6, 9 ], [ 7, 2 ], [ 9, 4 ], [ 10, 17 ], [ 12, 18 ], [ 12, 15 ], [ 14, 11 ], [ 15, 13 ], [ 15, 16 ], [ 16, 19 ], [ 17, 12 ], [ 19, 14 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Elton knows Keira. Gregory knows Fritz. Glen knows Austin. Shaun knows Elton. Keira knows Rocco. Hazel knows Shaun. Blake knows August. Shaun knows Emily. Celeste knows Houston. Barry knows Israel. Rosa knows Celeste. Bennett knows Bob. Gregory knows Blake. Fritz knows Drake. Houston knows Bennett. Bennett knows Gregory. Elton knows Barry. Austin knows Hazel. Which of Fritz and Barry can Glen reach?", "answer": "Barry", "steps": [ "Glen knows Austin.", "Austin knows Hazel.", "Hazel knows Shaun.", "Shaun knows Elton.", "Elton knows Barry." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Glen", "Hazel", "Austin", "Israel", "Rocco", "Elton", "Shaun", "Barry", "Emily", "Keira", "Rosa", "Houston", "Celeste", "Drake", "August", "Gregory", "Bennett", "Fritz", "Bob", "Blake" ], "edges": [ [ 0, 2 ], [ 1, 6 ], [ 2, 1 ], [ 5, 7 ], [ 5, 9 ], [ 6, 8 ], [ 6, 5 ], [ 7, 3 ], [ 9, 4 ], [ 10, 12 ], [ 11, 16 ], [ 12, 11 ], [ 15, 17 ], [ 15, 19 ], [ 16, 18 ], [ 16, 15 ], [ 17, 13 ], [ 19, 14 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Dennis knows Florence. Holly knows Andrea. Celeste knows Cliff. Aubrey knows Dennis. Cliff knows Dustin. Florence knows Jean. Jordan knows Devin. Vivian knows Gavin. Esther knows Celeste. Vivian knows Norman. Kerry knows Annette. Cara knows Esther. Jean knows Vivian. Dennis knows Jordan. Jean knows Joan. Esther knows Holly. Cliff knows Kerry. Kerry knows Latoya. Which of Jean and Cliff can Aubrey reach?", "answer": "Jean", "steps": [ "Aubrey knows Dennis.", "Dennis knows Florence.", "Florence knows Jean." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Aubrey", "Florence", "Devin", "Joan", "Dennis", "Jordan", "Norman", "Vivian", "Jean", "Gavin", "Cara", "Celeste", "Andrea", "Dustin", "Esther", "Holly", "Annette", "Kerry", "Cliff", "Latoya" ], "edges": [ [ 0, 4 ], [ 1, 8 ], [ 4, 5 ], [ 4, 1 ], [ 5, 2 ], [ 7, 6 ], [ 7, 9 ], [ 8, 3 ], [ 8, 7 ], [ 10, 14 ], [ 11, 18 ], [ 14, 15 ], [ 14, 11 ], [ 15, 12 ], [ 17, 16 ], [ 17, 19 ], [ 18, 13 ], [ 18, 17 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Aaron knows Robert. Keira knows Bonnie. Doug knows Kim. Aubrey knows Roy. Aaron knows Doug. Hector knows Blake. Robert knows Keith. Lydia knows George. Evan knows Aaron. Roy knows Hector. Blake knows Keira. Doug knows Kirk. Chance knows Evan. Blake knows Luz. Kim knows Russ. Luz knows Percy. Joyce knows Chance. Luz knows Lydia. Which of Aaron and Blake can Joyce reach?", "answer": "Aaron", "steps": [ "Joyce knows Chance.", "Chance knows Evan.", "Evan knows Aaron." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Joyce", "Keith", "Kirk", "Robert", "Doug", "Russ", "Aaron", "Chance", "Evan", "Kim", "Aubrey", "Bonnie", "Percy", "Keira", "Luz", "George", "Blake", "Roy", "Hector", "Lydia" ], "edges": [ [ 0, 7 ], [ 3, 1 ], [ 4, 2 ], [ 4, 9 ], [ 6, 3 ], [ 6, 4 ], [ 7, 8 ], [ 8, 6 ], [ 9, 5 ], [ 10, 17 ], [ 13, 11 ], [ 14, 12 ], [ 14, 19 ], [ 16, 13 ], [ 16, 14 ], [ 17, 18 ], [ 18, 16 ], [ 19, 15 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Ruth knows Cole. Dakota knows Ruth. Harriet knows Pat. Harriet knows Bryan. Bryan knows Leo. Ruth knows Dolores. Chloe knows Ella. Jean knows Dakota. Jean knows Kylie. Jean knows Ray. Ray knows Chloe. Abby knows Joyce. Pat knows Abby. Bryan knows India. Abby knows Jermaine. India knows Rena. Ray knows Mindy. Harriet knows Sadie. Which of Abby and Ruth can Jean reach?", "answer": "Ruth", "steps": [ "Jean knows Dakota.", "Dakota knows Ruth." ], "difficulty": 2, "original_distance": 3, "idx_to_symbol": [ "Jean", "Mindy", "Kylie", "Ella", "Dolores", "Ruth", "Ray", "Chloe", "Dakota", "Cole", "Harriet", "Leo", "Sadie", "Rena", "Jermaine", "Abby", "Bryan", "India", "Pat", "Joyce" ], "edges": [ [ 0, 2 ], [ 0, 6 ], [ 0, 8 ], [ 5, 4 ], [ 5, 9 ], [ 6, 1 ], [ 6, 7 ], [ 7, 3 ], [ 8, 5 ], [ 10, 12 ], [ 10, 16 ], [ 10, 18 ], [ 15, 14 ], [ 15, 19 ], [ 16, 11 ], [ 16, 17 ], [ 17, 13 ], [ 18, 15 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Nathan knows Noel. Judy knows Karl. Adam knows Holden. Abigail knows Hope. Karl knows Rick. Nathan knows Madeline. Brynn knows Michelle. Raymond knows Anthony. Judy knows Abigail. Anthony knows Harry. Karl knows Connor. Nathan knows Darius. Adam knows Enid. Karl knows Colin. Harry knows Nathan. Harry knows Brynn. Raymond knows Emmett. Enid knows Judy. Which of Abigail and Brynn can Adam reach?", "answer": "Abigail", "steps": [ "Adam knows Enid.", "Enid knows Judy.", "Judy knows Abigail." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Adam", "Abigail", "Colin", "Judy", "Connor", "Karl", "Rick", "Holden", "Hope", "Enid", "Raymond", "Brynn", "Darius", "Harry", "Madeline", "Nathan", "Noel", "Emmett", "Michelle", "Anthony" ], "edges": [ [ 0, 7 ], [ 0, 9 ], [ 1, 8 ], [ 3, 5 ], [ 3, 1 ], [ 5, 2 ], [ 5, 4 ], [ 5, 6 ], [ 9, 3 ], [ 10, 17 ], [ 10, 19 ], [ 11, 18 ], [ 13, 15 ], [ 13, 11 ], [ 15, 12 ], [ 15, 14 ], [ 15, 16 ], [ 19, 13 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Phoebe knows Esperanza. Roger knows Vivian. Esperanza knows Archie. Esperanza knows Harris. Gavin knows Humphrey. Olive knows Abigail. Archie knows Gavin. Lyric knows Walter. Virgil knows Mindy. Imogen knows Lucy. Lucy knows Olive. Harris knows Robert. Mindy knows Lyric. Mindy knows Imogen. Roger knows Phoebe. Jim knows Atlas. Jim knows Virgil. Humphrey knows Jonathan. Which of Esperanza and Mindy can Roger reach?", "answer": "Esperanza", "steps": [ "Roger knows Phoebe.", "Phoebe knows Esperanza." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Roger", "Vivian", "Gavin", "Jonathan", "Archie", "Esperanza", "Phoebe", "Harris", "Humphrey", "Robert", "Jim", "Atlas", "Lucy", "Abigail", "Imogen", "Mindy", "Virgil", "Lyric", "Olive", "Walter" ], "edges": [ [ 0, 1 ], [ 0, 6 ], [ 2, 8 ], [ 4, 2 ], [ 5, 4 ], [ 5, 7 ], [ 6, 5 ], [ 7, 9 ], [ 8, 3 ], [ 10, 11 ], [ 10, 16 ], [ 12, 18 ], [ 14, 12 ], [ 15, 14 ], [ 15, 17 ], [ 16, 15 ], [ 17, 19 ], [ 18, 13 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Imogen knows William. Daisy knows Cameron. Cameron knows Tina. Nelson knows Winston. Lorenzo knows Fabian. Leigh knows Daisy. Ibrahim knows Lucy. Imogen knows Declan. Fabian knows Imogen. Cameron knows Christopher. Cameron knows Lorenzo. Rosemary knows Ibrahim. Winston knows Molly. Molly knows Damien. Ibrahim knows Ted. Ibrahim knows Nelson. Damian knows Rosemary. Molly knows Scott. Which of Fabian and Winston can Damian reach?", "answer": "Winston", "steps": [ "Damian knows Rosemary.", "Rosemary knows Ibrahim.", "Ibrahim knows Nelson.", "Nelson knows Winston." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Damian", "Ibrahim", "Scott", "Ted", "Winston", "Nelson", "Molly", "Rosemary", "Damien", "Lucy", "Leigh", "Cameron", "Declan", "Tina", "Fabian", "Lorenzo", "Imogen", "Daisy", "William", "Christopher" ], "edges": [ [ 0, 7 ], [ 1, 3 ], [ 1, 5 ], [ 1, 9 ], [ 4, 6 ], [ 5, 4 ], [ 6, 2 ], [ 6, 8 ], [ 7, 1 ], [ 10, 17 ], [ 11, 13 ], [ 11, 15 ], [ 11, 19 ], [ 14, 16 ], [ 15, 14 ], [ 16, 12 ], [ 16, 18 ], [ 17, 11 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Dell knows Hope. Veronica knows Gage. Gage knows Kelsey. Langston knows Devon. Ricardo knows Samuel. Dell knows Ricardo. Sebastian knows Alder. Sebastian knows Nicole. Hope knows Emery. Gage knows Logan. Devon knows Demetrius. Demetrius knows Sybil. Elena knows Sebastian. Emery knows Elena. Sybil knows Veronica. Denver knows Leo. Devon knows Denver. Hannah knows Dell. Which of Alder and Kelsey can Hannah reach?", "answer": "Alder", "steps": [ "Hannah knows Dell.", "Dell knows Hope.", "Hope knows Emery.", "Emery knows Elena.", "Elena knows Sebastian.", "Sebastian knows Alder." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Hannah", "Ricardo", "Dell", "Hope", "Sebastian", "Elena", "Alder", "Emery", "Nicole", "Samuel", "Langston", "Denver", "Devon", "Demetrius", "Gage", "Veronica", "Kelsey", "Sybil", "Logan", "Leo" ], "edges": [ [ 0, 2 ], [ 1, 9 ], [ 2, 3 ], [ 2, 1 ], [ 3, 7 ], [ 4, 6 ], [ 4, 8 ], [ 5, 4 ], [ 7, 5 ], [ 10, 12 ], [ 11, 19 ], [ 12, 13 ], [ 12, 11 ], [ 13, 17 ], [ 14, 16 ], [ 14, 18 ], [ 15, 14 ], [ 17, 15 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "James knows Allen. Houston knows Garrett. James knows Brett. Robert knows Della. Wendy knows Houston. Gemma knows Phoebe. Houston knows Francesca. Darnell knows Spencer. Spencer knows Gemma. Gemma knows Quinn. Robert knows Martin. Darnell knows Claude. Robert knows James. Quinn knows Morgan. Gemma knows Jerry. Garrett knows Robert. Amelia knows Darnell. Quinn knows Jeremiah. Which of Jeremiah and Brett can Amelia reach?", "answer": "Jeremiah", "steps": [ "Amelia knows Darnell.", "Darnell knows Spencer.", "Spencer knows Gemma.", "Gemma knows Quinn.", "Quinn knows Jeremiah." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Amelia", "Claude", "Phoebe", "Spencer", "Jerry", "Darnell", "Quinn", "Gemma", "Morgan", "Jeremiah", "Wendy", "Francesca", "Della", "Garrett", "Martin", "Houston", "James", "Robert", "Allen", "Brett" ], "edges": [ [ 0, 5 ], [ 3, 7 ], [ 5, 1 ], [ 5, 3 ], [ 6, 8 ], [ 6, 9 ], [ 7, 2 ], [ 7, 4 ], [ 7, 6 ], [ 10, 15 ], [ 13, 17 ], [ 15, 11 ], [ 15, 13 ], [ 16, 18 ], [ 16, 19 ], [ 17, 12 ], [ 17, 14 ], [ 17, 16 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Susanne knows Knox. Jana knows Jamie. Thea knows Sydney. Sydney knows Larissa. Kobe knows Percy. Knox knows Irene. Percy knows Jeanette. Thea knows Whitney. Shane knows Kobe. Knox knows Jem. Percy knows Howard. Jem knows Thea. Ethan knows Shane. Shane knows Clay. Ashley knows Kelly. Jeanette knows Jack. Jana knows Susanne. Ashley knows Ethan. Which of Sydney and Jeanette can Jana reach?", "answer": "Sydney", "steps": [ "Jana knows Susanne.", "Susanne knows Knox.", "Knox knows Jem.", "Jem knows Thea.", "Thea knows Sydney." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Jana", "Jamie", "Thea", "Irene", "Larissa", "Whitney", "Sydney", "Jem", "Knox", "Susanne", "Ashley", "Kelly", "Percy", "Clay", "Jack", "Howard", "Jeanette", "Kobe", "Shane", "Ethan" ], "edges": [ [ 0, 1 ], [ 0, 9 ], [ 2, 5 ], [ 2, 6 ], [ 6, 4 ], [ 7, 2 ], [ 8, 3 ], [ 8, 7 ], [ 9, 8 ], [ 10, 11 ], [ 10, 19 ], [ 12, 15 ], [ 12, 16 ], [ 16, 14 ], [ 17, 12 ], [ 18, 13 ], [ 18, 17 ], [ 19, 18 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Cecilia knows Miriam. Leopold knows Violet. Elvis knows Ariana. Cecilia knows Wendell. Violet knows Katherine. Marie knows Luz. Destiny knows Kristina. Miriam knows Destiny. Yvette knows Kieran. Kieran knows Alder. Katherine knows Dirk. Elvis knows Loretta. Yvette knows Elvis. Marie knows Yasmin. Isabel knows Marie. Isabel knows Cecilia. Kieran knows Leopold. Kristina knows Katrina. Which of Violet and Destiny can Yvette reach?", "answer": "Violet", "steps": [ "Yvette knows Kieran.", "Kieran knows Leopold.", "Leopold knows Violet." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Yvette", "Violet", "Alder", "Kieran", "Loretta", "Ariana", "Katherine", "Leopold", "Dirk", "Elvis", "Isabel", "Destiny", "Wendell", "Cecilia", "Yasmin", "Luz", "Kristina", "Miriam", "Katrina", "Marie" ], "edges": [ [ 0, 3 ], [ 0, 9 ], [ 1, 6 ], [ 3, 2 ], [ 3, 7 ], [ 6, 8 ], [ 7, 1 ], [ 9, 4 ], [ 9, 5 ], [ 10, 13 ], [ 10, 19 ], [ 11, 16 ], [ 13, 12 ], [ 13, 17 ], [ 16, 18 ], [ 17, 11 ], [ 19, 14 ], [ 19, 15 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Randy knows Tim. Carmen knows Jean. Tim knows Jeanette. Carl knows Randy. Judy knows Ariel. Jeanette knows Carmen. Ariel knows Cristina. Randy knows Miriam. Lee knows Tristan. Lee knows Ronald. Judy knows Wendy. Carl knows Hampton. Carmen knows Francis. Hampton knows Rosemary. Joshua knows Judy. Joshua knows Cesar. Cesar knows Thea. Cristina knows Lee. Which of Francis and Tristan can Joshua reach?", "answer": "Tristan", "steps": [ "Joshua knows Judy.", "Judy knows Ariel.", "Ariel knows Cristina.", "Cristina knows Lee.", "Lee knows Tristan." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Joshua", "Judy", "Cristina", "Tristan", "Wendy", "Ronald", "Cesar", "Ariel", "Lee", "Thea", "Carl", "Randy", "Jeanette", "Francis", "Miriam", "Jean", "Hampton", "Tim", "Carmen", "Rosemary" ], "edges": [ [ 0, 1 ], [ 0, 6 ], [ 1, 4 ], [ 1, 7 ], [ 2, 8 ], [ 6, 9 ], [ 7, 2 ], [ 8, 3 ], [ 8, 5 ], [ 10, 11 ], [ 10, 16 ], [ 11, 14 ], [ 11, 17 ], [ 12, 18 ], [ 16, 19 ], [ 17, 12 ], [ 18, 13 ], [ 18, 15 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Aiden knows Mildred. Raquel knows Regina. Bonnie knows Lyle. Lana knows Aiden. Lyle knows Calvin. Lana knows Kelly. Lyle knows Elton. Bonnie knows Marvin. Jackson knows Sidney. Mildred knows Clinton. Luz knows Raquel. Lana knows Luz. Luz knows Jackson. Bonnie knows Cindy. Marvin knows Juan. Calvin knows Malik. Elton knows Marlene. Juan knows Paula. Which of Clinton and Paula can Lana reach?", "answer": "Clinton", "steps": [ "Lana knows Aiden.", "Aiden knows Mildred.", "Mildred knows Clinton." ], "difficulty": 3, "original_distance": 3, "idx_to_symbol": [ "Lana", "Jackson", "Aiden", "Kelly", "Sidney", "Regina", "Mildred", "Luz", "Clinton", "Raquel", "Bonnie", "Elton", "Marvin", "Cindy", "Marlene", "Malik", "Juan", "Lyle", "Paula", "Calvin" ], "edges": [ [ 0, 3 ], [ 0, 2 ], [ 0, 7 ], [ 1, 4 ], [ 2, 6 ], [ 6, 8 ], [ 7, 1 ], [ 7, 9 ], [ 9, 5 ], [ 10, 13 ], [ 10, 12 ], [ 10, 17 ], [ 11, 14 ], [ 12, 16 ], [ 16, 18 ], [ 17, 11 ], [ 17, 19 ], [ 19, 15 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Bruno knows Jackson. Lionel knows Cecilia. Ramona knows Bruno. Jackson knows Veronica. Richard knows Todd. Gregory knows Ramona. Veronica knows Eric. Todd knows Chelsea. Eric knows Haven. Erica knows Lionel. Kareem knows Caleb. Lionel knows Dick. Ramona knows Norman. Bruno knows Haley. Dick knows Kareem. Erica knows Delilah. Todd knows Erica. Jackson knows Alyson. Which of Veronica and Dick can Richard reach?", "answer": "Dick", "steps": [ "Richard knows Todd.", "Todd knows Erica.", "Erica knows Lionel.", "Lionel knows Dick." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Richard", "Cecilia", "Todd", "Delilah", "Lionel", "Erica", "Dick", "Chelsea", "Kareem", "Caleb", "Gregory", "Alyson", "Ramona", "Haley", "Jackson", "Bruno", "Veronica", "Norman", "Eric", "Haven" ], "edges": [ [ 0, 2 ], [ 2, 7 ], [ 2, 5 ], [ 4, 1 ], [ 4, 6 ], [ 5, 3 ], [ 5, 4 ], [ 6, 8 ], [ 8, 9 ], [ 10, 12 ], [ 12, 17 ], [ 12, 15 ], [ 14, 11 ], [ 14, 16 ], [ 15, 13 ], [ 15, 14 ], [ 16, 18 ], [ 18, 19 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Hardy knows Jeff. Sandy knows Hardy. Eleanor knows Austin. Hilda knows Aisha. Hardy knows Judy. June knows Eleanor. Allen knows Kane. Jeff knows Fergus. Judy knows Allen. Hardy knows Demetrius. Eleanor knows Louisa. Austin knows Keegan. Finn knows June. Hilda knows Sandy. Keegan knows Ronald. Finn knows Jolena. Eleanor knows Susan. Louisa knows Layla. Which of Allen and Keegan can Finn reach?", "answer": "Keegan", "steps": [ "Finn knows June.", "June knows Eleanor.", "Eleanor knows Austin.", "Austin knows Keegan." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Finn", "Louisa", "June", "Eleanor", "Keegan", "Susan", "Layla", "Jolena", "Ronald", "Austin", "Hilda", "Jeff", "Sandy", "Hardy", "Allen", "Demetrius", "Fergus", "Aisha", "Kane", "Judy" ], "edges": [ [ 0, 7 ], [ 0, 2 ], [ 1, 6 ], [ 2, 3 ], [ 3, 5 ], [ 3, 1 ], [ 3, 9 ], [ 4, 8 ], [ 9, 4 ], [ 10, 17 ], [ 10, 12 ], [ 11, 16 ], [ 12, 13 ], [ 13, 15 ], [ 13, 11 ], [ 13, 19 ], [ 14, 18 ], [ 19, 14 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Tony knows Kamila. Kamila knows Lamar. Brynn knows Zach. Ralph knows Edison. Sybil knows Joanna. Olive knows Tony. Kamila knows Wayne. Zach knows Cliff. Dalton knows Carrie. Edison knows Mae. Zach knows Dalton. Pam knows Gloria. Mae knows Brynn. Arlene knows Olive. Jason knows Pam. Lamar knows Jason. Fabian knows Arlene. Carrie knows Sybil. Which of Arlene and Edison can Ralph reach?", "answer": "Edison", "steps": [ "Ralph knows Edison." ], "difficulty": 1, "original_distance": 8, "idx_to_symbol": [ "Ralph", "Joanna", "Zach", "Cliff", "Sybil", "Mae", "Carrie", "Dalton", "Brynn", "Edison", "Fabian", "Gloria", "Kamila", "Wayne", "Pam", "Olive", "Jason", "Lamar", "Tony", "Arlene" ], "edges": [ [ 0, 9 ], [ 2, 3 ], [ 2, 7 ], [ 4, 1 ], [ 5, 8 ], [ 6, 4 ], [ 7, 6 ], [ 8, 2 ], [ 9, 5 ], [ 10, 19 ], [ 12, 13 ], [ 12, 17 ], [ 14, 11 ], [ 15, 18 ], [ 16, 14 ], [ 17, 16 ], [ 18, 12 ], [ 19, 15 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Nora knows Cindy. Reed knows Caleb. Conner knows Lucy. Curtis knows Natalie. Eamon knows Reed. Conner knows Gerard. Curtis knows Max. Richard knows Jose. Eamon knows Hamilton. Perry knows Nora. Dell knows Randall. Nora knows Mabel. Natalie knows Ruby. Cindy knows Curtis. Randall knows Conner. Arnold knows Dell. Lucy knows Eamon. Jose knows Perry. Which of Conner and Nora can Richard reach?", "answer": "Nora", "steps": [ "Richard knows Jose.", "Jose knows Perry.", "Perry knows Nora." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Richard", "Ruby", "Mabel", "Cindy", "Max", "Natalie", "Jose", "Curtis", "Perry", "Nora", "Arnold", "Caleb", "Gerard", "Lucy", "Hamilton", "Reed", "Dell", "Eamon", "Randall", "Conner" ], "edges": [ [ 0, 6 ], [ 3, 7 ], [ 5, 1 ], [ 6, 8 ], [ 7, 4 ], [ 7, 5 ], [ 8, 9 ], [ 9, 2 ], [ 9, 3 ], [ 10, 16 ], [ 13, 17 ], [ 15, 11 ], [ 16, 18 ], [ 17, 14 ], [ 17, 15 ], [ 18, 19 ], [ 19, 12 ], [ 19, 13 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Allan knows Franklin. Ada knows Hal. Lily knows Daniella. Franklin knows Ada. Chantal knows Lily. Henrietta knows Heath. Henrietta knows Pearl. Etta knows Chantal. Aurora knows Henrietta. Chantal knows Allan. Aurora knows Cornelius. Alana knows Dahlia. Allan knows Carter. Carter knows Valerie. Cornelius knows Calvin. Heath knows Haley. Alyssa knows Aurora. Pearl knows Alana. Which of Pearl and Franklin can Alyssa reach?", "answer": "Pearl", "steps": [ "Alyssa knows Aurora.", "Aurora knows Henrietta.", "Henrietta knows Pearl." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Alyssa", "Aurora", "Haley", "Heath", "Alana", "Pearl", "Henrietta", "Dahlia", "Cornelius", "Calvin", "Etta", "Chantal", "Valerie", "Carter", "Ada", "Franklin", "Allan", "Hal", "Lily", "Daniella" ], "edges": [ [ 0, 1 ], [ 1, 6 ], [ 1, 8 ], [ 3, 2 ], [ 4, 7 ], [ 5, 4 ], [ 6, 3 ], [ 6, 5 ], [ 8, 9 ], [ 10, 11 ], [ 11, 16 ], [ 11, 18 ], [ 13, 12 ], [ 14, 17 ], [ 15, 14 ], [ 16, 13 ], [ 16, 15 ], [ 18, 19 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Aaron knows Robert. Keira knows Bonnie. Doug knows Kim. Aubrey knows Roy. Aaron knows Doug. Hector knows Blake. Robert knows Keith. Lydia knows George. Evan knows Aaron. Roy knows Hector. Blake knows Keira. Doug knows Kirk. Chance knows Evan. Blake knows Luz. Kim knows Russ. Luz knows Percy. Joyce knows Chance. Luz knows Lydia. Which of George and Russ can Joyce reach?", "answer": "Russ", "steps": [ "Joyce knows Chance.", "Chance knows Evan.", "Evan knows Aaron.", "Aaron knows Doug.", "Doug knows Kim.", "Kim knows Russ." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Joyce", "Keith", "Kirk", "Robert", "Doug", "Russ", "Aaron", "Chance", "Evan", "Kim", "Aubrey", "Bonnie", "Percy", "Keira", "Luz", "George", "Blake", "Roy", "Hector", "Lydia" ], "edges": [ [ 0, 7 ], [ 3, 1 ], [ 4, 2 ], [ 4, 9 ], [ 6, 3 ], [ 6, 4 ], [ 7, 8 ], [ 8, 6 ], [ 9, 5 ], [ 10, 17 ], [ 13, 11 ], [ 14, 12 ], [ 14, 19 ], [ 16, 13 ], [ 16, 14 ], [ 17, 18 ], [ 18, 16 ], [ 19, 15 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Raymond knows Marlene. Dylan knows Howard. Sydney knows Demetrius. Lisa knows Dylan. Fisher knows Nadine. Bruce knows Lisa. Cooper knows Jerry. Craig knows Monroe. Marlene knows Fisher. Craig knows Maggie. Lisa knows Sydney. Jerry knows Stephanie. Monroe knows Kent. Maggie knows Khashayar. Malik knows Craig. Stephanie knows Elaine. Howard knows Cooper. Khashayar knows Raymond. Which of Raymond and Cooper can Bruce reach?", "answer": "Cooper", "steps": [ "Bruce knows Lisa.", "Lisa knows Dylan.", "Dylan knows Howard.", "Howard knows Cooper." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Bruce", "Jerry", "Lisa", "Sydney", "Elaine", "Howard", "Stephanie", "Demetrius", "Cooper", "Dylan", "Malik", "Marlene", "Craig", "Monroe", "Nadine", "Khashayar", "Fisher", "Kent", "Raymond", "Maggie" ], "edges": [ [ 0, 2 ], [ 1, 6 ], [ 2, 3 ], [ 2, 9 ], [ 3, 7 ], [ 5, 8 ], [ 6, 4 ], [ 8, 1 ], [ 9, 5 ], [ 10, 12 ], [ 11, 16 ], [ 12, 13 ], [ 12, 19 ], [ 13, 17 ], [ 15, 18 ], [ 16, 14 ], [ 18, 11 ], [ 19, 15 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Clark knows Arlene. Lambert knows Isadora. Hayes knows Deanna. Trudy knows Monica. Livia knows Lamont. Alan knows Livia. Trudy knows Hayes. Lamont knows Lionel. William knows Lambert. Lionel knows Trudy. William knows Liam. Sebastian knows William. Kendrick knows Sebastian. Lambert knows Hudson. Alan knows Phoebe. Arlene knows Kendrick. Hayes knows Brandon. Clark knows India. Which of Trudy and William can Clark reach?", "answer": "William", "steps": [ "Clark knows Arlene.", "Arlene knows Kendrick.", "Kendrick knows Sebastian.", "Sebastian knows William." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Clark", "Liam", "India", "Lambert", "Isadora", "Kendrick", "William", "Hudson", "Arlene", "Sebastian", "Alan", "Monica", "Phoebe", "Hayes", "Deanna", "Lamont", "Trudy", "Brandon", "Livia", "Lionel" ], "edges": [ [ 0, 2 ], [ 0, 8 ], [ 3, 4 ], [ 3, 7 ], [ 5, 9 ], [ 6, 1 ], [ 6, 3 ], [ 8, 5 ], [ 9, 6 ], [ 10, 12 ], [ 10, 18 ], [ 13, 14 ], [ 13, 17 ], [ 15, 19 ], [ 16, 11 ], [ 16, 13 ], [ 18, 15 ], [ 19, 16 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Dean knows Geneva. Grant knows Tanya. Destiny knows Alyson. Annie knows Dustin. Tanya knows Ford. Paula knows Rachel. Randy knows Delilah. Destiny knows Melody. Ford knows Paul. Dina knows Grant. Luis knows Annie. Rachel knows Randy. Dina knows Gregory. Randy knows Christopher. Ford knows Norma. Annie knows Paula. Melody knows Dina. Dean knows Luis. Which of Melody and Luis can Destiny reach?", "answer": "Melody", "steps": [ "Destiny knows Melody." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Destiny", "Ford", "Melody", "Gregory", "Norma", "Paul", "Grant", "Dina", "Alyson", "Tanya", "Dean", "Randy", "Luis", "Dustin", "Delilah", "Christopher", "Paula", "Annie", "Geneva", "Rachel" ], "edges": [ [ 0, 8 ], [ 0, 2 ], [ 1, 4 ], [ 1, 5 ], [ 2, 7 ], [ 6, 9 ], [ 7, 3 ], [ 7, 6 ], [ 9, 1 ], [ 10, 18 ], [ 10, 12 ], [ 11, 14 ], [ 11, 15 ], [ 12, 17 ], [ 16, 19 ], [ 17, 13 ], [ 17, 16 ], [ 19, 11 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Jim knows Jeffery. Darren knows Chloe. Vernon knows Miriam. Vernon knows Ernesto. Vernon knows Marco. Leticia knows Colleen. Leticia knows Kai. Jim knows Alfonso. Abby knows Darren. Abby knows Effie. Belinda knows Frank. Jeffery knows Belinda. Abby knows Marian. Effie knows Vernon. Jim knows Leticia. Belinda knows Megan. Darren knows Jeanne. Belinda knows Ember. Which of Effie and Jeffery can Jim reach?", "answer": "Jeffery", "steps": [ "Jim knows Jeffery." ], "difficulty": 1, "original_distance": 3, "idx_to_symbol": [ "Jim", "Belinda", "Alfonso", "Megan", "Ember", "Kai", "Colleen", "Jeffery", "Frank", "Leticia", "Abby", "Vernon", "Marian", "Marco", "Ernesto", "Jeanne", "Chloe", "Effie", "Miriam", "Darren" ], "edges": [ [ 0, 2 ], [ 0, 7 ], [ 0, 9 ], [ 1, 3 ], [ 1, 4 ], [ 1, 8 ], [ 7, 1 ], [ 9, 5 ], [ 9, 6 ], [ 10, 12 ], [ 10, 17 ], [ 10, 19 ], [ 11, 13 ], [ 11, 14 ], [ 11, 18 ], [ 17, 11 ], [ 19, 15 ], [ 19, 16 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Sarah knows Natalie. Blake knows Yasmin. Lottie knows Dave. Jenna knows Mildred. Yasmin knows Judith. Declan knows Martha. August knows Patrick. Laura knows Sarah. Dave knows Geraldine. Sarah knows Carson. Patrick knows Lottie. Dean knows Lucia. Kylie knows Laura. Carson knows Declan. Martha knows Dean. Dave knows Blake. Curtis knows Kylie. Judith knows Jenna. Which of Carson and Blake can August reach?", "answer": "Blake", "steps": [ "August knows Patrick.", "Patrick knows Lottie.", "Lottie knows Dave.", "Dave knows Blake." ], "difficulty": 4, "original_distance": 8, "idx_to_symbol": [ "August", "Blake", "Judith", "Geraldine", "Dave", "Lottie", "Mildred", "Jenna", "Yasmin", "Patrick", "Curtis", "Carson", "Martha", "Natalie", "Sarah", "Laura", "Lucia", "Dean", "Declan", "Kylie" ], "edges": [ [ 0, 9 ], [ 1, 8 ], [ 2, 7 ], [ 4, 3 ], [ 4, 1 ], [ 5, 4 ], [ 7, 6 ], [ 8, 2 ], [ 9, 5 ], [ 10, 19 ], [ 11, 18 ], [ 12, 17 ], [ 14, 13 ], [ 14, 11 ], [ 15, 14 ], [ 17, 16 ], [ 18, 12 ], [ 19, 15 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Cole knows Deanna. Heather knows Anthony. Lawrence knows Cole. Odette knows Harry. Rachel knows Valerie. Harry knows Rachel. Valerie knows Brittany. Carl knows Ramon. Cole knows Carl. Anthony knows Lawrence. Dewey knows Ebony. Ebony knows Odette. Rachel knows Jodi. Valerie knows Kate. Valerie knows Annette. Taylor knows Heather. Carl knows Madeline. Carl knows Marlene. Which of Ebony and Heather can Dewey reach?", "answer": "Ebony", "steps": [ "Dewey knows Ebony." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Dewey", "Odette", "Annette", "Valerie", "Harry", "Rachel", "Ebony", "Jodi", "Brittany", "Kate", "Taylor", "Anthony", "Madeline", "Carl", "Lawrence", "Cole", "Heather", "Deanna", "Ramon", "Marlene" ], "edges": [ [ 0, 6 ], [ 1, 4 ], [ 3, 2 ], [ 3, 8 ], [ 3, 9 ], [ 4, 5 ], [ 5, 7 ], [ 5, 3 ], [ 6, 1 ], [ 10, 16 ], [ 11, 14 ], [ 13, 12 ], [ 13, 18 ], [ 13, 19 ], [ 14, 15 ], [ 15, 17 ], [ 15, 13 ], [ 16, 11 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Adele knows Erwin. Pearl knows Paula. Florence knows Kent. Calvin knows Billy. Casey knows Tabitha. Darla knows Peggy. Peter knows Florence. Billy knows Maude. Paula knows Casey. Erwin knows Marvin. Kent knows Angela. Marvin knows Calvin. Angela knows Julius. Shelby knows Ivy. Peggy knows Adele. Rex knows Pearl. Tabitha knows Peter. Maude knows Shelby. Which of Kent and Maude can Darla reach?", "answer": "Maude", "steps": [ "Darla knows Peggy.", "Peggy knows Adele.", "Adele knows Erwin.", "Erwin knows Marvin.", "Marvin knows Calvin.", "Calvin knows Billy.", "Billy knows Maude." ], "difficulty": 7, "original_distance": 9, "idx_to_symbol": [ "Darla", "Adele", "Calvin", "Peggy", "Maude", "Marvin", "Shelby", "Erwin", "Ivy", "Billy", "Rex", "Paula", "Peter", "Pearl", "Kent", "Tabitha", "Angela", "Casey", "Julius", "Florence" ], "edges": [ [ 0, 3 ], [ 1, 7 ], [ 2, 9 ], [ 3, 1 ], [ 4, 6 ], [ 5, 2 ], [ 6, 8 ], [ 7, 5 ], [ 9, 4 ], [ 10, 13 ], [ 11, 17 ], [ 12, 19 ], [ 13, 11 ], [ 14, 16 ], [ 15, 12 ], [ 16, 18 ], [ 17, 15 ], [ 19, 14 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Frankie knows Gertrude. Jodi knows Emily. Scott knows Austin. Yvette knows Greer. Austin knows Kim. Bob knows Eve. Lloyd knows Jerry. Jerry knows Chantal. Porter knows Bob. Frankie knows Tanya. Clay knows Lloyd. Eve knows Carmen. Clay knows Yvette. Kim knows Clay. Carmen knows Lionel. Tanya knows Porter. Bob knows Jodi. Scott knows Belinda. Which of Jerry and Carmen can Scott reach?", "answer": "Jerry", "steps": [ "Scott knows Austin.", "Austin knows Kim.", "Kim knows Clay.", "Clay knows Lloyd.", "Lloyd knows Jerry." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Scott", "Kim", "Yvette", "Lloyd", "Chantal", "Belinda", "Jerry", "Greer", "Austin", "Clay", "Frankie", "Porter", "Jodi", "Eve", "Lionel", "Gertrude", "Carmen", "Emily", "Tanya", "Bob" ], "edges": [ [ 0, 5 ], [ 0, 8 ], [ 1, 9 ], [ 2, 7 ], [ 3, 6 ], [ 6, 4 ], [ 8, 1 ], [ 9, 3 ], [ 9, 2 ], [ 10, 15 ], [ 10, 18 ], [ 11, 19 ], [ 12, 17 ], [ 13, 16 ], [ 16, 14 ], [ 18, 11 ], [ 19, 13 ], [ 19, 12 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Freya knows Arnold. Dorothy knows Jeanne. Lillian knows Max. Arnold knows Anthony. Max knows Val. Aaron knows Megan. Megan knows Rose. Renee knows Valerie. Trudy knows Renee. Eric knows Norman. Angela knows Allan. Norman knows Marion. Val knows Otto. Anthony knows Dorothy. Arnold knows Angela. Dorothy knows Eric. Max knows Aaron. Megan knows Trudy. Which of Anthony and Aaron can Freya reach?", "answer": "Anthony", "steps": [ "Freya knows Arnold.", "Arnold knows Anthony." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Freya", "Arnold", "Eric", "Allan", "Angela", "Jeanne", "Dorothy", "Anthony", "Norman", "Marion", "Lillian", "Max", "Trudy", "Otto", "Val", "Rose", "Megan", "Aaron", "Renee", "Valerie" ], "edges": [ [ 0, 1 ], [ 1, 4 ], [ 1, 7 ], [ 2, 8 ], [ 4, 3 ], [ 6, 5 ], [ 6, 2 ], [ 7, 6 ], [ 8, 9 ], [ 10, 11 ], [ 11, 14 ], [ 11, 17 ], [ 12, 18 ], [ 14, 13 ], [ 16, 15 ], [ 16, 12 ], [ 17, 16 ], [ 18, 19 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Eve knows Glen. Jolena knows Florence. Frank knows Spencer. Milton knows Lucia. Milton knows Carlos. Beth knows Ursula. Winifred knows Frank. Carlos knows Nicholas. Edmund knows Vanessa. Aisha knows Lucas. Lucas knows Harmony. Edmund knows Eve. Jolena knows Aisha. Beth knows Winifred. Edmund knows Jolena. Edmund knows Darwin. Milton knows Beth. Milton knows Marvin. Which of Spencer and Harmony can Milton reach?", "answer": "Spencer", "steps": [ "Milton knows Beth.", "Beth knows Winifred.", "Winifred knows Frank.", "Frank knows Spencer." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Milton", "Frank", "Carlos", "Spencer", "Nicholas", "Beth", "Ursula", "Marvin", "Winifred", "Lucia", "Edmund", "Lucas", "Eve", "Harmony", "Glen", "Jolena", "Florence", "Vanessa", "Aisha", "Darwin" ], "edges": [ [ 0, 2 ], [ 0, 7 ], [ 0, 5 ], [ 0, 9 ], [ 1, 3 ], [ 2, 4 ], [ 5, 6 ], [ 5, 8 ], [ 8, 1 ], [ 10, 12 ], [ 10, 17 ], [ 10, 15 ], [ 10, 19 ], [ 11, 13 ], [ 12, 14 ], [ 15, 16 ], [ 15, 18 ], [ 18, 11 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Clarence knows Sam. Ibrahim knows Alfred. Devon knows Fleur. Joy knows Corey. Corey knows Boris. Langston knows Ingrid. Boris knows Dexter. Trina knows Joy. James knows Ibrahim. Corey knows Devon. Joy knows Lisette. Kimberly knows Spencer. Gavin knows Trina. Dexter knows Virgil. Ibrahim knows Kimberly. Sam knows James. James knows Gus. Alfred knows Langston. Which of Ingrid and Virgil can Clarence reach?", "answer": "Ingrid", "steps": [ "Clarence knows Sam.", "Sam knows James.", "James knows Ibrahim.", "Ibrahim knows Alfred.", "Alfred knows Langston.", "Langston knows Ingrid." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Clarence", "James", "Alfred", "Ingrid", "Sam", "Gus", "Kimberly", "Langston", "Ibrahim", "Spencer", "Gavin", "Joy", "Boris", "Virgil", "Trina", "Lisette", "Devon", "Dexter", "Corey", "Fleur" ], "edges": [ [ 0, 4 ], [ 1, 5 ], [ 1, 8 ], [ 2, 7 ], [ 4, 1 ], [ 6, 9 ], [ 7, 3 ], [ 8, 2 ], [ 8, 6 ], [ 10, 14 ], [ 11, 15 ], [ 11, 18 ], [ 12, 17 ], [ 14, 11 ], [ 16, 19 ], [ 17, 13 ], [ 18, 12 ], [ 18, 16 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Hayden knows Lorraine. Gabe knows Wesley. Felix knows Juan. Harris knows Robert. Brooke knows Ellen. Sydney knows Herman. Wesley knows Felix. Sydney knows Gabe. Lara knows Lydia. Ellen knows Clayton. Herman knows Lara. Harley knows Brooke. Harris knows Harley. Lydia knows Otto. Ellen knows Glenda. Felix knows Simon. Arturo knows Hayden. Robert knows Arturo. Which of Harley and Gabe can Sydney reach?", "answer": "Gabe", "steps": [ "Sydney knows Gabe." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Sydney", "Lara", "Juan", "Lydia", "Wesley", "Herman", "Simon", "Felix", "Gabe", "Otto", "Harris", "Arturo", "Clayton", "Hayden", "Brooke", "Robert", "Glenda", "Ellen", "Harley", "Lorraine" ], "edges": [ [ 0, 8 ], [ 0, 5 ], [ 1, 3 ], [ 3, 9 ], [ 4, 7 ], [ 5, 1 ], [ 7, 2 ], [ 7, 6 ], [ 8, 4 ], [ 10, 18 ], [ 10, 15 ], [ 11, 13 ], [ 13, 19 ], [ 14, 17 ], [ 15, 11 ], [ 17, 12 ], [ 17, 16 ], [ 18, 14 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Ira knows Hayes. Farrah knows Perry. Hayes knows Gareth. Paula knows Jude. Allison knows Jolena. Dell knows Xavier. Gareth knows Esme. August knows Lily. Jolena knows Avery. Jude knows August. Rick knows Farrah. Kurt knows Essie. Perry knows Allison. Jude knows Leopold. Kurt knows Rick. Rick knows Dell. Leopold knows Ira. Paula knows Priscilla. Which of Esme and Avery can Kurt reach?", "answer": "Avery", "steps": [ "Kurt knows Rick.", "Rick knows Farrah.", "Farrah knows Perry.", "Perry knows Allison.", "Allison knows Jolena.", "Jolena knows Avery." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Kurt", "Jolena", "Rick", "Xavier", "Dell", "Allison", "Perry", "Farrah", "Essie", "Avery", "Paula", "Gareth", "Jude", "Lily", "August", "Hayes", "Ira", "Leopold", "Priscilla", "Esme" ], "edges": [ [ 0, 8 ], [ 0, 2 ], [ 1, 9 ], [ 2, 4 ], [ 2, 7 ], [ 4, 3 ], [ 5, 1 ], [ 6, 5 ], [ 7, 6 ], [ 10, 18 ], [ 10, 12 ], [ 11, 19 ], [ 12, 14 ], [ 12, 17 ], [ 14, 13 ], [ 15, 11 ], [ 16, 15 ], [ 17, 16 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Laura knows Howard. Maggie knows Shannon. Bridget knows Bonnie. Hattie knows Jay. Calvin knows Laura. Paige knows Betty. Calvin knows Greta. Hattie knows Chelsea. Luna knows Erin. Howard knows Destiny. Julie knows Hattie. Zachary knows Julie. Erin knows Dylan. Jay knows Bridget. Ben knows Zachary. Jay knows Paige. Dylan knows Calvin. Laura knows Maggie. Which of Hattie and Calvin can Luna reach?", "answer": "Calvin", "steps": [ "Luna knows Erin.", "Erin knows Dylan.", "Dylan knows Calvin." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Luna", "Greta", "Laura", "Shannon", "Dylan", "Calvin", "Destiny", "Erin", "Maggie", "Howard", "Ben", "Chelsea", "Jay", "Betty", "Julie", "Hattie", "Bonnie", "Zachary", "Paige", "Bridget" ], "edges": [ [ 0, 7 ], [ 2, 8 ], [ 2, 9 ], [ 4, 5 ], [ 5, 1 ], [ 5, 2 ], [ 7, 4 ], [ 8, 3 ], [ 9, 6 ], [ 10, 17 ], [ 12, 18 ], [ 12, 19 ], [ 14, 15 ], [ 15, 11 ], [ 15, 12 ], [ 17, 14 ], [ 18, 13 ], [ 19, 16 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Susan knows Cooper. Bennett knows Jeremiah. Cliff knows Jessie. Jessie knows Bernice. Jessie knows Howard. Fritz knows Susan. Jeremiah knows Lane. Barbara knows Pedro. Lane knows Skyler. Barbara knows Bennett. Barbara knows Jolene. Jessie knows Fritz. Pedro knows Fabian. Bernice knows Hudson. Cooper knows Herbert. Hudson knows Keegan. Fabian knows Jarvis. Aurora knows Barbara. Which of Jeremiah and Susan can Aurora reach?", "answer": "Jeremiah", "steps": [ "Aurora knows Barbara.", "Barbara knows Bennett.", "Bennett knows Jeremiah." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Aurora", "Fabian", "Barbara", "Pedro", "Skyler", "Lane", "Bennett", "Jeremiah", "Jolene", "Jarvis", "Cliff", "Hudson", "Jessie", "Bernice", "Herbert", "Cooper", "Fritz", "Susan", "Howard", "Keegan" ], "edges": [ [ 0, 2 ], [ 1, 9 ], [ 2, 6 ], [ 2, 8 ], [ 2, 3 ], [ 3, 1 ], [ 5, 4 ], [ 6, 7 ], [ 7, 5 ], [ 10, 12 ], [ 11, 19 ], [ 12, 16 ], [ 12, 18 ], [ 12, 13 ], [ 13, 11 ], [ 15, 14 ], [ 16, 17 ], [ 17, 15 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Chase knows Eve. Gloria knows Fern. Elodie knows Loretta. Clifford knows Holden. Elodie knows Clifford. Jasper knows Eduardo. Lynn knows Alice. Holden knows Owen. Eduardo knows Rufus. Eve knows Elodie. Rufus knows Gloria. Dave knows Lynn. Chase knows Jacques. Rufus knows Vance. Kurt knows Chase. Lynn knows Jasper. Eduardo knows Heath. Clifford knows Kareem. Which of Jasper and Eve can Kurt reach?", "answer": "Eve", "steps": [ "Kurt knows Chase.", "Chase knows Eve." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Kurt", "Chase", "Clifford", "Jacques", "Elodie", "Owen", "Holden", "Kareem", "Eve", "Loretta", "Dave", "Lynn", "Rufus", "Alice", "Eduardo", "Fern", "Gloria", "Vance", "Jasper", "Heath" ], "edges": [ [ 0, 1 ], [ 1, 3 ], [ 1, 8 ], [ 2, 6 ], [ 2, 7 ], [ 4, 2 ], [ 4, 9 ], [ 6, 5 ], [ 8, 4 ], [ 10, 11 ], [ 11, 13 ], [ 11, 18 ], [ 12, 16 ], [ 12, 17 ], [ 14, 12 ], [ 14, 19 ], [ 16, 15 ], [ 18, 14 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Kim knows Tanya. Pearl knows Darcy. Helene knows Larissa. Larissa knows Rhea. Darcy knows Dorothy. Kim knows Ariana. Javier knows Lana. Dante knows Edna. Yasmin knows Jaime. Cristina knows Charity. Charity knows Dante. Dante knows Yasmin. Ramon knows Pearl. Lana knows Kim. Jermaine knows Javier. Ramon knows Cristina. Tanya knows Nancy. Jermaine knows Helene. Which of Lana and Charity can Jermaine reach?", "answer": "Lana", "steps": [ "Jermaine knows Javier.", "Javier knows Lana." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Jermaine", "Ariana", "Larissa", "Tanya", "Javier", "Lana", "Nancy", "Helene", "Rhea", "Kim", "Ramon", "Edna", "Darcy", "Yasmin", "Cristina", "Charity", "Jaime", "Pearl", "Dorothy", "Dante" ], "edges": [ [ 0, 7 ], [ 0, 4 ], [ 2, 8 ], [ 3, 6 ], [ 4, 5 ], [ 5, 9 ], [ 7, 2 ], [ 9, 1 ], [ 9, 3 ], [ 10, 17 ], [ 10, 14 ], [ 12, 18 ], [ 13, 16 ], [ 14, 15 ], [ 15, 19 ], [ 17, 12 ], [ 19, 11 ], [ 19, 13 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Vanessa knows Lacey. Yuki knows Ashton. Randall knows Nora. Ivan knows Dorian. Emma knows Ivan. Ella knows Ernie. Nora knows Ella. Alfonso knows Vanessa. Yuki knows Reed. Ivan knows Alfonso. Bob knows Yuki. Randall knows Emma. Desmond knows Alder. Ashton knows Aspen. Renee knows Quinn. Aspen knows Irma. Alder knows Renee. Desmond knows Bob. Which of Lacey and Irma can Desmond reach?", "answer": "Irma", "steps": [ "Desmond knows Bob.", "Bob knows Yuki.", "Yuki knows Ashton.", "Ashton knows Aspen.", "Aspen knows Irma." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Desmond", "Alder", "Aspen", "Ashton", "Irma", "Renee", "Yuki", "Reed", "Quinn", "Bob", "Randall", "Nora", "Vanessa", "Alfonso", "Lacey", "Ella", "Ivan", "Dorian", "Ernie", "Emma" ], "edges": [ [ 0, 1 ], [ 0, 9 ], [ 1, 5 ], [ 2, 4 ], [ 3, 2 ], [ 5, 8 ], [ 6, 3 ], [ 6, 7 ], [ 9, 6 ], [ 10, 11 ], [ 10, 19 ], [ 11, 15 ], [ 12, 14 ], [ 13, 12 ], [ 15, 18 ], [ 16, 13 ], [ 16, 17 ], [ 19, 16 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Bruno knows Jackson. Lionel knows Cecilia. Ramona knows Bruno. Jackson knows Veronica. Richard knows Todd. Gregory knows Ramona. Veronica knows Eric. Todd knows Chelsea. Eric knows Haven. Erica knows Lionel. Kareem knows Caleb. Lionel knows Dick. Ramona knows Norman. Bruno knows Haley. Dick knows Kareem. Erica knows Delilah. Todd knows Erica. Jackson knows Alyson. Which of Ramona and Todd can Richard reach?", "answer": "Todd", "steps": [ "Richard knows Todd." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Richard", "Cecilia", "Todd", "Delilah", "Lionel", "Erica", "Dick", "Chelsea", "Kareem", "Caleb", "Gregory", "Alyson", "Ramona", "Haley", "Jackson", "Bruno", "Veronica", "Norman", "Eric", "Haven" ], "edges": [ [ 0, 2 ], [ 2, 7 ], [ 2, 5 ], [ 4, 1 ], [ 4, 6 ], [ 5, 3 ], [ 5, 4 ], [ 6, 8 ], [ 8, 9 ], [ 10, 12 ], [ 12, 17 ], [ 12, 15 ], [ 14, 11 ], [ 14, 16 ], [ 15, 13 ], [ 15, 14 ], [ 16, 18 ], [ 18, 19 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Guy knows Emmett. Cooper knows Erik. Xander knows Ava. Cliff knows Devon. Fiona knows Arturo. Celia knows Edward. Edward knows Xander. Cliff knows Damien. Damien knows Israel. Devon knows Billy. Alyson knows Harry. Arturo knows Celia. Celia knows Alyson. Edward knows Samuel. Erik knows Guy. Guy knows Cliff. Emmett knows Mae. Samuel knows Kevin. Which of Edward and Cliff can Cooper reach?", "answer": "Cliff", "steps": [ "Cooper knows Erik.", "Erik knows Guy.", "Guy knows Cliff." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Cooper", "Guy", "Billy", "Erik", "Devon", "Cliff", "Damien", "Emmett", "Israel", "Mae", "Fiona", "Celia", "Ava", "Arturo", "Xander", "Edward", "Samuel", "Alyson", "Kevin", "Harry" ], "edges": [ [ 0, 3 ], [ 1, 5 ], [ 1, 7 ], [ 3, 1 ], [ 4, 2 ], [ 5, 4 ], [ 5, 6 ], [ 6, 8 ], [ 7, 9 ], [ 10, 13 ], [ 11, 15 ], [ 11, 17 ], [ 13, 11 ], [ 14, 12 ], [ 15, 14 ], [ 15, 16 ], [ 16, 18 ], [ 17, 19 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Kara knows Malcolm. Cate knows Vanessa. Anita knows Hilda. Alejandro knows Grady. Jordan knows Houston. Conner knows Sheila. Hilda knows Felix. Eamon knows Cate. Grady knows Conner. Eamon knows Roy. Roy knows Darius. Houston knows Alejandro. Vanessa knows Randall. Hugo knows Anita. Roy knows Hugo. Malcolm knows Cordelia. Houston knows Clark. Jordan knows Kara. Which of Anita and Grady can Eamon reach?", "answer": "Anita", "steps": [ "Eamon knows Roy.", "Roy knows Hugo.", "Hugo knows Anita." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Eamon", "Felix", "Hilda", "Cate", "Anita", "Darius", "Hugo", "Roy", "Vanessa", "Randall", "Jordan", "Sheila", "Conner", "Kara", "Grady", "Clark", "Alejandro", "Houston", "Malcolm", "Cordelia" ], "edges": [ [ 0, 7 ], [ 0, 3 ], [ 2, 1 ], [ 3, 8 ], [ 4, 2 ], [ 6, 4 ], [ 7, 5 ], [ 7, 6 ], [ 8, 9 ], [ 10, 17 ], [ 10, 13 ], [ 12, 11 ], [ 13, 18 ], [ 14, 12 ], [ 16, 14 ], [ 17, 15 ], [ 17, 16 ], [ 18, 19 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Naomi knows Joyce. Dennis knows Rocco. Joyce knows Andre. Paul knows Eldon. Candice knows Milo. Sadie knows Fleur. Desmond knows Chester. Joyce knows Kent. Sadie knows Desmond. Clark knows Dennis. Rocco knows Sadie. Milo knows Naomi. Fleur knows Diego. Sadie knows Lionel. Lionel knows Yasmin. Kent knows Darren. Joyce knows Paul. Andre knows Holly. Which of Milo and Dennis can Candice reach?", "answer": "Milo", "steps": [ "Candice knows Milo." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Candice", "Naomi", "Darren", "Joyce", "Milo", "Kent", "Andre", "Eldon", "Holly", "Paul", "Clark", "Rocco", "Yasmin", "Sadie", "Dennis", "Lionel", "Desmond", "Diego", "Chester", "Fleur" ], "edges": [ [ 0, 4 ], [ 1, 3 ], [ 3, 5 ], [ 3, 6 ], [ 3, 9 ], [ 4, 1 ], [ 5, 2 ], [ 6, 8 ], [ 9, 7 ], [ 10, 14 ], [ 11, 13 ], [ 13, 15 ], [ 13, 16 ], [ 13, 19 ], [ 14, 11 ], [ 15, 12 ], [ 16, 18 ], [ 19, 17 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Mildred knows Annie. Allen knows Daphna. Mildred knows Aspen. Chris knows Jack. Daphna knows Blaine. Sidney knows Faye. Cara knows Allen. Annie knows Cara. Rhonda knows Ella. Alvin knows Mildred. Chantal knows Alejandro. Alejandro knows Sidney. Rhonda knows Rosemary. Della knows Esperanza. Jack knows Rhonda. Bella knows Chris. Esperanza knows Alvin. Ella knows Chantal. Which of Blaine and Faye can Della reach?", "answer": "Blaine", "steps": [ "Della knows Esperanza.", "Esperanza knows Alvin.", "Alvin knows Mildred.", "Mildred knows Annie.", "Annie knows Cara.", "Cara knows Allen.", "Allen knows Daphna.", "Daphna knows Blaine." ], "difficulty": 8, "original_distance": 8, "idx_to_symbol": [ "Della", "Blaine", "Daphna", "Mildred", "Aspen", "Esperanza", "Annie", "Cara", "Allen", "Alvin", "Bella", "Faye", "Sidney", "Rhonda", "Rosemary", "Chris", "Ella", "Chantal", "Alejandro", "Jack" ], "edges": [ [ 0, 5 ], [ 2, 1 ], [ 3, 4 ], [ 3, 6 ], [ 5, 9 ], [ 6, 7 ], [ 7, 8 ], [ 8, 2 ], [ 9, 3 ], [ 10, 15 ], [ 12, 11 ], [ 13, 14 ], [ 13, 16 ], [ 15, 19 ], [ 16, 17 ], [ 17, 18 ], [ 18, 12 ], [ 19, 13 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Skyler knows Annie. Skyler knows Rod. Skyler knows Daphna. Esther knows Isaac. Austin knows Dana. Esther knows Chester. Annie knows Spencer. Skyler knows Rowan. Arthur knows Russell. Marvin knows Edison. Chester knows Doris. Chester knows Elise. Austin knows Marvin. Marvin knows Skyler. Chester knows Kim. Arthur knows Esther. Chester knows Terry. Kim knows Gustavo. Which of Gustavo and Spencer can Austin reach?", "answer": "Spencer", "steps": [ "Austin knows Marvin.", "Marvin knows Skyler.", "Skyler knows Annie.", "Annie knows Spencer." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Austin", "Dana", "Spencer", "Rod", "Marvin", "Skyler", "Daphna", "Rowan", "Annie", "Edison", "Arthur", "Russell", "Gustavo", "Terry", "Esther", "Chester", "Elise", "Doris", "Kim", "Isaac" ], "edges": [ [ 0, 1 ], [ 0, 4 ], [ 4, 5 ], [ 4, 9 ], [ 5, 3 ], [ 5, 6 ], [ 5, 7 ], [ 5, 8 ], [ 8, 2 ], [ 10, 11 ], [ 10, 14 ], [ 14, 15 ], [ 14, 19 ], [ 15, 13 ], [ 15, 16 ], [ 15, 17 ], [ 15, 18 ], [ 18, 12 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Harry knows Ben. Daphna knows Keira. Daphna knows Axel. Ezra knows Justine. Lambert knows James. James knows Vicki. Keira knows Edison. Wilbur knows Carey. Gwen knows Ezra. Ben knows Gene. Selena knows Dominic. Carey knows Harry. Wilbur knows Barry. Wilbur knows Eve. Barry knows Gwen. Vicki knows Ramona. Edison knows Selena. Daphna knows Lambert. Which of Lambert and Barry can Wilbur reach?", "answer": "Barry", "steps": [ "Wilbur knows Barry." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Wilbur", "Justine", "Eve", "Gene", "Barry", "Gwen", "Harry", "Ezra", "Ben", "Carey", "Daphna", "Ramona", "Axel", "Dominic", "Lambert", "James", "Edison", "Vicki", "Selena", "Keira" ], "edges": [ [ 0, 2 ], [ 0, 4 ], [ 0, 9 ], [ 4, 5 ], [ 5, 7 ], [ 6, 8 ], [ 7, 1 ], [ 8, 3 ], [ 9, 6 ], [ 10, 12 ], [ 10, 14 ], [ 10, 19 ], [ 14, 15 ], [ 15, 17 ], [ 16, 18 ], [ 17, 11 ], [ 18, 13 ], [ 19, 16 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Dorian knows Kennedy. Rachel knows Kerry. Hugh knows Dorian. Liam knows Rachel. Jean knows Gladys. Kaleb knows Delia. Willis knows Hugh. Gunnar knows Graeme. Nicole knows Gunnar. Graeme knows Clyde. Yolanda knows Colby. Colby knows Willis. Gladys knows Kaleb. Dustin knows Isadora. Jean knows Liam. Delia knows Cara. Kerry knows Dustin. Yolanda knows Nicole. Which of Kerry and Hugh can Jean reach?", "answer": "Kerry", "steps": [ "Jean knows Liam.", "Liam knows Rachel.", "Rachel knows Kerry." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Jean", "Kerry", "Gladys", "Liam", "Rachel", "Kaleb", "Dustin", "Cara", "Delia", "Isadora", "Yolanda", "Hugh", "Nicole", "Colby", "Willis", "Gunnar", "Dorian", "Clyde", "Graeme", "Kennedy" ], "edges": [ [ 0, 2 ], [ 0, 3 ], [ 1, 6 ], [ 2, 5 ], [ 3, 4 ], [ 4, 1 ], [ 5, 8 ], [ 6, 9 ], [ 8, 7 ], [ 10, 12 ], [ 10, 13 ], [ 11, 16 ], [ 12, 15 ], [ 13, 14 ], [ 14, 11 ], [ 15, 18 ], [ 16, 19 ], [ 18, 17 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Randy knows Tim. Carmen knows Jean. Tim knows Jeanette. Carl knows Randy. Judy knows Ariel. Jeanette knows Carmen. Ariel knows Cristina. Randy knows Miriam. Lee knows Tristan. Lee knows Ronald. Judy knows Wendy. Carl knows Hampton. Carmen knows Francis. Hampton knows Rosemary. Joshua knows Judy. Joshua knows Cesar. Cesar knows Thea. Cristina knows Lee. Which of Randy and Judy can Joshua reach?", "answer": "Judy", "steps": [ "Joshua knows Judy." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Joshua", "Judy", "Cristina", "Tristan", "Wendy", "Ronald", "Cesar", "Ariel", "Lee", "Thea", "Carl", "Randy", "Jeanette", "Francis", "Miriam", "Jean", "Hampton", "Tim", "Carmen", "Rosemary" ], "edges": [ [ 0, 1 ], [ 0, 6 ], [ 1, 4 ], [ 1, 7 ], [ 2, 8 ], [ 6, 9 ], [ 7, 2 ], [ 8, 3 ], [ 8, 5 ], [ 10, 11 ], [ 10, 16 ], [ 11, 14 ], [ 11, 17 ], [ 12, 18 ], [ 16, 19 ], [ 17, 12 ], [ 18, 13 ], [ 18, 15 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Gideon knows Alma. Yolanda knows Harmony. Tony knows Harlan. Yolanda knows Tony. Clarence knows Denise. Hampton knows Jessie. Kenzie knows Cain. Vance knows Yolanda. Vance knows Hampton. Gideon knows Inez. Inez knows Wanda. Harlan knows Basil. Clarence knows Kenzie. Denise knows Anna. Tony knows Olive. Gideon knows Elvis. Denise knows Gideon. Tony knows Dakota. Which of Wanda and Basil can Clarence reach?", "answer": "Wanda", "steps": [ "Clarence knows Denise.", "Denise knows Gideon.", "Gideon knows Inez.", "Inez knows Wanda." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Clarence", "Wanda", "Denise", "Elvis", "Inez", "Alma", "Kenzie", "Cain", "Anna", "Gideon", "Vance", "Basil", "Yolanda", "Olive", "Harlan", "Dakota", "Hampton", "Jessie", "Harmony", "Tony" ], "edges": [ [ 0, 6 ], [ 0, 2 ], [ 2, 8 ], [ 2, 9 ], [ 4, 1 ], [ 6, 7 ], [ 9, 3 ], [ 9, 4 ], [ 9, 5 ], [ 10, 16 ], [ 10, 12 ], [ 12, 18 ], [ 12, 19 ], [ 14, 11 ], [ 16, 17 ], [ 19, 13 ], [ 19, 14 ], [ 19, 15 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Trina knows Martin. Ruby knows Christina. Christina knows Ariel. Enrique knows Celia. Enrique knows Arnold. Jermaine knows Andre. Arnold knows Tonya. Malik knows Enrique. Eric knows Edwin. Christina knows Tara. Ariel knows Eric. Kenneth knows Lynn. Tonya knows Cornelius. Dolly knows Pat. Tara knows Jermaine. Cornelius knows Trina. Celia knows Kenneth. Andre knows Dolly. Which of Pat and Martin can Malik reach?", "answer": "Martin", "steps": [ "Malik knows Enrique.", "Enrique knows Arnold.", "Arnold knows Tonya.", "Tonya knows Cornelius.", "Cornelius knows Trina.", "Trina knows Martin." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Malik", "Lynn", "Celia", "Kenneth", "Cornelius", "Arnold", "Enrique", "Trina", "Martin", "Tonya", "Ruby", "Edwin", "Ariel", "Eric", "Andre", "Tara", "Christina", "Dolly", "Pat", "Jermaine" ], "edges": [ [ 0, 6 ], [ 2, 3 ], [ 3, 1 ], [ 4, 7 ], [ 5, 9 ], [ 6, 2 ], [ 6, 5 ], [ 7, 8 ], [ 9, 4 ], [ 10, 16 ], [ 12, 13 ], [ 13, 11 ], [ 14, 17 ], [ 15, 19 ], [ 16, 12 ], [ 16, 15 ], [ 17, 18 ], [ 19, 14 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Fergus knows Guillermo. Fergus knows Aiden. Ivan knows Israel. Ivan knows Fergus. Duke knows Ilene. Camden knows Val. Renee knows Fleur. Duke knows Gabriel. Fleur knows Jude. Israel knows Duke. Fergus knows Katrina. Renee knows Camden. Val knows Eileen. Fleur knows Latoya. Gabriel knows Miles. Jem knows Dora. Fleur knows Cindy. Val knows Jem. Which of Jem and Gabriel can Ivan reach?", "answer": "Gabriel", "steps": [ "Ivan knows Israel.", "Israel knows Duke.", "Duke knows Gabriel." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Ivan", "Duke", "Gabriel", "Fergus", "Miles", "Ilene", "Katrina", "Aiden", "Israel", "Guillermo", "Renee", "Val", "Jem", "Fleur", "Dora", "Eileen", "Latoya", "Jude", "Camden", "Cindy" ], "edges": [ [ 0, 8 ], [ 0, 3 ], [ 1, 2 ], [ 1, 5 ], [ 2, 4 ], [ 3, 6 ], [ 3, 7 ], [ 3, 9 ], [ 8, 1 ], [ 10, 18 ], [ 10, 13 ], [ 11, 12 ], [ 11, 15 ], [ 12, 14 ], [ 13, 16 ], [ 13, 17 ], [ 13, 19 ], [ 18, 11 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Kay knows Ava. Asher knows Francesca. Randall knows Judith. Irving knows Daria. Asher knows Joyce. Francesca knows Destiny. Daria knows Randall. Randall knows Drew. Garland knows Shaun. Drew knows Aria. Drew knows Caroline. Francesca knows Garland. Drew knows Clinton. Shaun knows Gina. Francesca knows Isabel. Cynthia knows Jenny. Ava knows Asher. Clinton knows Cynthia. Which of Francesca and Drew can Kay reach?", "answer": "Francesca", "steps": [ "Kay knows Ava.", "Ava knows Asher.", "Asher knows Francesca." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Kay", "Joyce", "Shaun", "Garland", "Asher", "Gina", "Destiny", "Francesca", "Ava", "Isabel", "Irving", "Judith", "Cynthia", "Clinton", "Randall", "Jenny", "Aria", "Drew", "Daria", "Caroline" ], "edges": [ [ 0, 8 ], [ 2, 5 ], [ 3, 2 ], [ 4, 1 ], [ 4, 7 ], [ 7, 3 ], [ 7, 6 ], [ 7, 9 ], [ 8, 4 ], [ 10, 18 ], [ 12, 15 ], [ 13, 12 ], [ 14, 11 ], [ 14, 17 ], [ 17, 13 ], [ 17, 16 ], [ 17, 19 ], [ 18, 14 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Zack knows Jesse. Ezra knows Veronica. Diane knows Vivian. Malik knows Paige. Elijah knows Elliot. Jenny knows Corinne. Malik knows Hope. Charlene knows Joseph. Corinne knows Jane. Diane knows Charlene. Vivian knows Erwin. Jenny knows Ezra. Zack knows Malik. Elijah knows Keira. Joseph knows Elijah. Elliot knows Sarah. Elliot knows Opal. Jane knows Zack. Which of Sarah and Paige can Jenny reach?", "answer": "Paige", "steps": [ "Jenny knows Corinne.", "Corinne knows Jane.", "Jane knows Zack.", "Zack knows Malik.", "Malik knows Paige." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Jenny", "Corinne", "Paige", "Hope", "Veronica", "Malik", "Ezra", "Zack", "Jane", "Jesse", "Diane", "Charlene", "Sarah", "Opal", "Erwin", "Elliot", "Vivian", "Elijah", "Joseph", "Keira" ], "edges": [ [ 0, 6 ], [ 0, 1 ], [ 1, 8 ], [ 5, 2 ], [ 5, 3 ], [ 6, 4 ], [ 7, 5 ], [ 7, 9 ], [ 8, 7 ], [ 10, 16 ], [ 10, 11 ], [ 11, 18 ], [ 15, 12 ], [ 15, 13 ], [ 16, 14 ], [ 17, 15 ], [ 17, 19 ], [ 18, 17 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Gemma knows Greta. Annette knows Logan. Bruce knows Gemma. Stephanie knows Dale. Mark knows Myrtle. Greta knows Jacqueline. Erica knows Bruce. Annette knows Sam. Haley knows Audrey. Audrey knows Alicia. Sam knows Stephanie. Wade knows Opal. Wade knows Veronica. Alicia knows Erica. Veronica knows Mark. Dale knows Wade. Bruce knows Ford. Haley knows Andrea. Which of Audrey and Sam can Haley reach?", "answer": "Audrey", "steps": [ "Haley knows Audrey." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Haley", "Audrey", "Greta", "Andrea", "Gemma", "Ford", "Bruce", "Jacqueline", "Alicia", "Erica", "Annette", "Sam", "Mark", "Logan", "Veronica", "Opal", "Wade", "Myrtle", "Stephanie", "Dale" ], "edges": [ [ 0, 3 ], [ 0, 1 ], [ 1, 8 ], [ 2, 7 ], [ 4, 2 ], [ 6, 5 ], [ 6, 4 ], [ 8, 9 ], [ 9, 6 ], [ 10, 13 ], [ 10, 11 ], [ 11, 18 ], [ 12, 17 ], [ 14, 12 ], [ 16, 15 ], [ 16, 14 ], [ 18, 19 ], [ 19, 16 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Charlene knows Owen. Mack knows Bruno. Charlene knows Melissa. Charlene knows Jerome. Melissa knows Mack. Mack knows Ariel. Ebony knows Estelle. Donald knows Heidi. Donald knows Haley. Ebony knows Odette. Ebony knows Carmen. Melissa knows Norma. Conner knows Donald. Mack knows Sadie. Conner knows Lorenzo. Conner knows Francis. Melissa knows Gunnar. Donald knows Ebony. Which of Bruno and Carmen can Conner reach?", "answer": "Carmen", "steps": [ "Conner knows Donald.", "Donald knows Ebony.", "Ebony knows Carmen." ], "difficulty": 3, "original_distance": 3, "idx_to_symbol": [ "Conner", "Ebony", "Donald", "Lorenzo", "Heidi", "Carmen", "Haley", "Odette", "Francis", "Estelle", "Charlene", "Mack", "Melissa", "Jerome", "Gunnar", "Bruno", "Norma", "Sadie", "Owen", "Ariel" ], "edges": [ [ 0, 3 ], [ 0, 8 ], [ 0, 2 ], [ 1, 5 ], [ 1, 7 ], [ 1, 9 ], [ 2, 4 ], [ 2, 6 ], [ 2, 1 ], [ 10, 13 ], [ 10, 18 ], [ 10, 12 ], [ 11, 15 ], [ 11, 17 ], [ 11, 19 ], [ 12, 14 ], [ 12, 16 ], [ 12, 11 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Faye knows Mack. Ramona knows Eamon. Aisha knows Frankie. Hampton knows Jonathan. Frankie knows Roman. Olive knows Kirk. Kirk knows Ramona. Ted knows Sebastian. Olive knows Jerry. Frankie knows Hampton. Aisha knows Val. Faye knows Olive. Sebastian knows Aisha. Katrina knows Faye. Jonathan knows Ford. Ramona knows Rosa. Jonathan knows Percy. Emanuel knows Katrina. Which of Hampton and Kirk can Emanuel reach?", "answer": "Kirk", "steps": [ "Emanuel knows Katrina.", "Katrina knows Faye.", "Faye knows Olive.", "Olive knows Kirk." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Emanuel", "Katrina", "Ramona", "Jerry", "Mack", "Kirk", "Rosa", "Eamon", "Olive", "Faye", "Ted", "Sebastian", "Jonathan", "Roman", "Val", "Hampton", "Ford", "Percy", "Frankie", "Aisha" ], "edges": [ [ 0, 1 ], [ 1, 9 ], [ 2, 6 ], [ 2, 7 ], [ 5, 2 ], [ 8, 3 ], [ 8, 5 ], [ 9, 4 ], [ 9, 8 ], [ 10, 11 ], [ 11, 19 ], [ 12, 16 ], [ 12, 17 ], [ 15, 12 ], [ 18, 13 ], [ 18, 15 ], [ 19, 14 ], [ 19, 18 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Willis knows Kay. Virginia knows Elliot. Isaac knows Alex. Houston knows Marvin. Carson knows Houston. Alex knows Willis. Constance knows Axel. Kay knows Malcolm. Constance knows Teresa. Willis knows Clara. Marvin knows Electra. Axel knows Isaac. Marvin knows Virginia. Mitchell knows Curtis. Virginia knows Leticia. Mitchell knows Mae. Kay knows Eve. Curtis knows Carson. Which of Eve and Elliot can Constance reach?", "answer": "Eve", "steps": [ "Constance knows Axel.", "Axel knows Isaac.", "Isaac knows Alex.", "Alex knows Willis.", "Willis knows Kay.", "Kay knows Eve." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Constance", "Clara", "Kay", "Isaac", "Teresa", "Axel", "Alex", "Eve", "Malcolm", "Willis", "Mitchell", "Electra", "Virginia", "Carson", "Mae", "Curtis", "Houston", "Elliot", "Leticia", "Marvin" ], "edges": [ [ 0, 4 ], [ 0, 5 ], [ 2, 7 ], [ 2, 8 ], [ 3, 6 ], [ 5, 3 ], [ 6, 9 ], [ 9, 1 ], [ 9, 2 ], [ 10, 14 ], [ 10, 15 ], [ 12, 17 ], [ 12, 18 ], [ 13, 16 ], [ 15, 13 ], [ 16, 19 ], [ 19, 11 ], [ 19, 12 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Liam knows Shelby. Harlan knows Esther. Zoe knows Tabitha. Whitney knows Kent. Zoe knows Liam. Whitney knows Joyce. Dale knows Ethan. Kent knows Zoe. Harlan knows Carey. Zoe knows Rocco. Shaun knows Audrey. Carey knows Shaun. Ethan knows Harlan. Harlan knows Spencer. Spencer knows Andrea. Dale knows Celia. Tabitha knows Carrie. Shelby knows Caleb. Which of Zoe and Harlan can Whitney reach?", "answer": "Zoe", "steps": [ "Whitney knows Kent.", "Kent knows Zoe." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Whitney", "Shelby", "Carrie", "Joyce", "Liam", "Caleb", "Rocco", "Tabitha", "Zoe", "Kent", "Dale", "Shaun", "Andrea", "Celia", "Carey", "Audrey", "Esther", "Spencer", "Harlan", "Ethan" ], "edges": [ [ 0, 3 ], [ 0, 9 ], [ 1, 5 ], [ 4, 1 ], [ 7, 2 ], [ 8, 4 ], [ 8, 6 ], [ 8, 7 ], [ 9, 8 ], [ 10, 13 ], [ 10, 19 ], [ 11, 15 ], [ 14, 11 ], [ 17, 12 ], [ 18, 14 ], [ 18, 16 ], [ 18, 17 ], [ 19, 18 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Hubert knows Vivian. Victoria knows Becky. Cornelius knows Lark. Alyssa knows Caroline. Dana knows Lorraine. Lark knows Ruth. Allen knows Hendrix. Sebastian knows Victoria. Vivian knows Tabitha. Harris knows Dana. Becky knows Eamon. Eamon knows Alyssa. Lorraine knows Lawrence. Caroline knows Chloe. Lorraine knows Cornelius. Lawrence knows Randy. Alyssa knows Hubert. Hendrix knows Harris. Which of Hendrix and Victoria can Allen reach?", "answer": "Hendrix", "steps": [ "Allen knows Hendrix." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Allen", "Lawrence", "Cornelius", "Harris", "Lark", "Dana", "Ruth", "Lorraine", "Hendrix", "Randy", "Sebastian", "Caroline", "Hubert", "Becky", "Vivian", "Eamon", "Tabitha", "Alyssa", "Victoria", "Chloe" ], "edges": [ [ 0, 8 ], [ 1, 9 ], [ 2, 4 ], [ 3, 5 ], [ 4, 6 ], [ 5, 7 ], [ 7, 2 ], [ 7, 1 ], [ 8, 3 ], [ 10, 18 ], [ 11, 19 ], [ 12, 14 ], [ 13, 15 ], [ 14, 16 ], [ 15, 17 ], [ 17, 12 ], [ 17, 11 ], [ 18, 13 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Louis knows Andrea. Doug knows Louis. Chris knows Noah. Noah knows Duncan. Trevor knows Morris. Hardy knows Dina. Hardy knows Tamara. Aspen knows Duke. Trevor knows Geoffrey. Chandler knows Dorothy. Louis knows Hardy. Chris knows Trevor. Virgil knows Doug. Duke knows Cordelia. Andrea knows Miriam. Cordelia knows Chris. Chandler knows Virgil. Aspen knows Delia. Which of Morris and Dina can Chandler reach?", "answer": "Dina", "steps": [ "Chandler knows Virgil.", "Virgil knows Doug.", "Doug knows Louis.", "Louis knows Hardy.", "Hardy knows Dina." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Chandler", "Dina", "Doug", "Tamara", "Andrea", "Miriam", "Virgil", "Louis", "Hardy", "Dorothy", "Aspen", "Morris", "Cordelia", "Geoffrey", "Noah", "Duncan", "Duke", "Chris", "Trevor", "Delia" ], "edges": [ [ 0, 6 ], [ 0, 9 ], [ 2, 7 ], [ 4, 5 ], [ 6, 2 ], [ 7, 4 ], [ 7, 8 ], [ 8, 1 ], [ 8, 3 ], [ 10, 16 ], [ 10, 19 ], [ 12, 17 ], [ 14, 15 ], [ 16, 12 ], [ 17, 14 ], [ 17, 18 ], [ 18, 11 ], [ 18, 13 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Elvira knows Anthony. Anthony knows Cindy. Eunice knows Anastasia. Rhonda knows Eunice. Clyde knows Jade. Clyde knows Selena. Willard knows Diego. Eunice knows Lionel. Trina knows Rhonda. Denver knows Owen. Itzel knows Trina. Itzel knows Joan. Phoebe knows Elvira. Denver knows Oliver. Phoebe knows Clyde. Owen knows Phoebe. Diego knows Richard. Rhonda knows Willard. Which of Owen and Trina can Itzel reach?", "answer": "Trina", "steps": [ "Itzel knows Trina." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Itzel", "Lionel", "Rhonda", "Richard", "Diego", "Joan", "Anastasia", "Trina", "Willard", "Eunice", "Denver", "Selena", "Phoebe", "Cindy", "Anthony", "Oliver", "Jade", "Owen", "Elvira", "Clyde" ], "edges": [ [ 0, 5 ], [ 0, 7 ], [ 2, 8 ], [ 2, 9 ], [ 4, 3 ], [ 7, 2 ], [ 8, 4 ], [ 9, 1 ], [ 9, 6 ], [ 10, 15 ], [ 10, 17 ], [ 12, 18 ], [ 12, 19 ], [ 14, 13 ], [ 17, 12 ], [ 18, 14 ], [ 19, 11 ], [ 19, 16 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Basil knows Trina. Gregory knows Maria. Janelle knows Zach. Zach knows Penny. Selena knows Elvis. Cora knows Daria. Hattie knows Janelle. Kimberly knows Kane. Cora knows Kareem. Alvin knows Hattie. Trina knows Kimberly. Penny knows Gregory. Kimberly knows Coral. Aldo knows Donald. Elvis knows Lambert. Hattie knows Cora. Lambert knows Aldo. Trina knows Selena. Which of Trina and Hattie can Alvin reach?", "answer": "Hattie", "steps": [ "Alvin knows Hattie." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Alvin", "Daria", "Cora", "Hattie", "Zach", "Maria", "Kareem", "Janelle", "Gregory", "Penny", "Basil", "Kane", "Kimberly", "Trina", "Elvis", "Donald", "Coral", "Selena", "Aldo", "Lambert" ], "edges": [ [ 0, 3 ], [ 2, 1 ], [ 2, 6 ], [ 3, 2 ], [ 3, 7 ], [ 4, 9 ], [ 7, 4 ], [ 8, 5 ], [ 9, 8 ], [ 10, 13 ], [ 12, 11 ], [ 12, 16 ], [ 13, 12 ], [ 13, 17 ], [ 14, 19 ], [ 17, 14 ], [ 18, 15 ], [ 19, 18 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Nicole knows Daniel. Franklin knows Lewis. Lewis knows Adam. Grady knows Willard. Laura knows Bennett. Willard knows Henry. Jacques knows Trevor. Adam knows Laura. Henry knows Ramona. Archer knows Karina. Laura knows Vernon. Cruz knows Nicole. Vernon knows Archer. Franklin knows Ingrid. Henry knows Jacques. Nicole knows Grady. Ethan knows Franklin. Trevor knows Dana. Which of Adam and Willard can Cruz reach?", "answer": "Willard", "steps": [ "Cruz knows Nicole.", "Nicole knows Grady.", "Grady knows Willard." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Cruz", "Dana", "Daniel", "Henry", "Trevor", "Ramona", "Grady", "Willard", "Nicole", "Jacques", "Ethan", "Karina", "Ingrid", "Laura", "Archer", "Bennett", "Lewis", "Adam", "Franklin", "Vernon" ], "edges": [ [ 0, 8 ], [ 3, 5 ], [ 3, 9 ], [ 4, 1 ], [ 6, 7 ], [ 7, 3 ], [ 8, 2 ], [ 8, 6 ], [ 9, 4 ], [ 10, 18 ], [ 13, 15 ], [ 13, 19 ], [ 14, 11 ], [ 16, 17 ], [ 17, 13 ], [ 18, 12 ], [ 18, 16 ], [ 19, 14 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Mildred knows Annie. Allen knows Daphna. Mildred knows Aspen. Chris knows Jack. Daphna knows Blaine. Sidney knows Faye. Cara knows Allen. Annie knows Cara. Rhonda knows Ella. Alvin knows Mildred. Chantal knows Alejandro. Alejandro knows Sidney. Rhonda knows Rosemary. Della knows Esperanza. Jack knows Rhonda. Bella knows Chris. Esperanza knows Alvin. Ella knows Chantal. Which of Alejandro and Allen can Della reach?", "answer": "Allen", "steps": [ "Della knows Esperanza.", "Esperanza knows Alvin.", "Alvin knows Mildred.", "Mildred knows Annie.", "Annie knows Cara.", "Cara knows Allen." ], "difficulty": 6, "original_distance": 8, "idx_to_symbol": [ "Della", "Blaine", "Daphna", "Mildred", "Aspen", "Esperanza", "Annie", "Cara", "Allen", "Alvin", "Bella", "Faye", "Sidney", "Rhonda", "Rosemary", "Chris", "Ella", "Chantal", "Alejandro", "Jack" ], "edges": [ [ 0, 5 ], [ 2, 1 ], [ 3, 4 ], [ 3, 6 ], [ 5, 9 ], [ 6, 7 ], [ 7, 8 ], [ 8, 2 ], [ 9, 3 ], [ 10, 15 ], [ 12, 11 ], [ 13, 14 ], [ 13, 16 ], [ 15, 19 ], [ 16, 17 ], [ 17, 18 ], [ 18, 12 ], [ 19, 13 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Carmela knows Shaun. Bob knows Abigail. Jaime knows Milton. Zane knows Evan. Carey knows Zane. Abigail knows Alfonso. Carmela knows Daniella. Abigail knows Jaime. Fabian knows Cain. Alfonso knows Maggie. Maggie knows Jakob. Ben knows Etta. Jaime knows Ben. Fabian knows Carey. Carey knows Dora. Kira knows Fabian. Cain knows Carmela. Maggie knows Perry. Which of Jakob and Shaun can Kira reach?", "answer": "Shaun", "steps": [ "Kira knows Fabian.", "Fabian knows Cain.", "Cain knows Carmela.", "Carmela knows Shaun." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Kira", "Fabian", "Zane", "Carey", "Cain", "Shaun", "Carmela", "Dora", "Evan", "Daniella", "Bob", "Abigail", "Ben", "Jaime", "Alfonso", "Jakob", "Maggie", "Milton", "Etta", "Perry" ], "edges": [ [ 0, 1 ], [ 1, 3 ], [ 1, 4 ], [ 2, 8 ], [ 3, 7 ], [ 3, 2 ], [ 4, 6 ], [ 6, 5 ], [ 6, 9 ], [ 10, 11 ], [ 11, 13 ], [ 11, 14 ], [ 12, 18 ], [ 13, 17 ], [ 13, 12 ], [ 14, 16 ], [ 16, 15 ], [ 16, 19 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Hannah knows Clarissa. Terrence knows Amelia. Dawn knows Norma. Estella knows Eldon. Amelia knows Livia. Livia knows Daphna. Will knows Elise. Clarissa knows Estella. Hannah knows Arnold. Norma knows Jennifer. Jennifer knows Hannah. Jennifer knows Bernard. Amelia knows Marco. Livia knows Olivia. Olivia knows Marion. Olivia knows Karla. Marion knows Will. Norma knows Marvin. Which of Amelia and Norma can Terrence reach?", "answer": "Amelia", "steps": [ "Terrence knows Amelia." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Terrence", "Marion", "Olivia", "Will", "Marco", "Amelia", "Daphna", "Karla", "Elise", "Livia", "Dawn", "Clarissa", "Hannah", "Estella", "Marvin", "Norma", "Bernard", "Arnold", "Eldon", "Jennifer" ], "edges": [ [ 0, 5 ], [ 1, 3 ], [ 2, 7 ], [ 2, 1 ], [ 3, 8 ], [ 5, 4 ], [ 5, 9 ], [ 9, 6 ], [ 9, 2 ], [ 10, 15 ], [ 11, 13 ], [ 12, 17 ], [ 12, 11 ], [ 13, 18 ], [ 15, 14 ], [ 15, 19 ], [ 19, 16 ], [ 19, 12 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Jakob knows Wilma. Darren knows Marcia. Foster knows Yara. Julio knows Jakob. Elvis knows Dora. Ruth knows Darren. Julius knows Enrique. Abel knows Ingrid. Elvis knows Abel. Darren knows Elvis. Bernadette knows Ruth. Blaine knows Bernadette. Jeremiah knows Julius. Dora knows Jolene. Yara knows Jeremiah. Julio knows Glenn. Julius knows Julio. Glenn knows Clement. Which of Yara and Bernadette can Foster reach?", "answer": "Yara", "steps": [ "Foster knows Yara." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Foster", "Wilma", "Enrique", "Jakob", "Clement", "Julio", "Glenn", "Yara", "Jeremiah", "Julius", "Blaine", "Ingrid", "Marcia", "Abel", "Jolene", "Elvis", "Dora", "Bernadette", "Ruth", "Darren" ], "edges": [ [ 0, 7 ], [ 3, 1 ], [ 5, 3 ], [ 5, 6 ], [ 6, 4 ], [ 7, 8 ], [ 8, 9 ], [ 9, 2 ], [ 9, 5 ], [ 10, 17 ], [ 13, 11 ], [ 15, 13 ], [ 15, 16 ], [ 16, 14 ], [ 17, 18 ], [ 18, 19 ], [ 19, 12 ], [ 19, 15 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Doris knows Hayley. Jacob knows Jonah. Belinda knows Nadine. Jacob knows Aspen. Keith knows Theodore. Aspen knows Haven. Haven knows Edison. Belinda knows Hadley. Don knows Elodie. Theodore knows Zara. Doris knows Raymond. Theodore knows Belinda. Haven knows Chester. Jana knows Don. Don knows Jacob. Theodore knows Alyson. Don knows Elias. Nadine knows Doris. Which of Belinda and Jacob can Keith reach?", "answer": "Belinda", "steps": [ "Keith knows Theodore.", "Theodore knows Belinda." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Keith", "Nadine", "Zara", "Theodore", "Alyson", "Hadley", "Hayley", "Doris", "Belinda", "Raymond", "Jana", "Aspen", "Elodie", "Don", "Elias", "Jonah", "Chester", "Haven", "Jacob", "Edison" ], "edges": [ [ 0, 3 ], [ 1, 7 ], [ 3, 2 ], [ 3, 4 ], [ 3, 8 ], [ 7, 6 ], [ 7, 9 ], [ 8, 5 ], [ 8, 1 ], [ 10, 13 ], [ 11, 17 ], [ 13, 12 ], [ 13, 14 ], [ 13, 18 ], [ 17, 16 ], [ 17, 19 ], [ 18, 15 ], [ 18, 11 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Myra knows Dalton. Jeremiah knows Ted. Georgia knows Elena. Aubrey knows Drake. Aria knows August. Georgia knows Mark. Drake knows Kenneth. Madeline knows Aria. Leigh knows Kaleb. Drake knows Humphrey. Ted knows Georgia. Kaleb knows Aubrey. Myra knows Deborah. August knows Jon. Kenneth knows Myra. Jeremiah knows Emanuel. Fabian knows Leigh. Jon knows Jeremiah. Which of Kaleb and August can Fabian reach?", "answer": "Kaleb", "steps": [ "Fabian knows Leigh.", "Leigh knows Kaleb." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Fabian", "Leigh", "Myra", "Aubrey", "Humphrey", "Drake", "Kenneth", "Deborah", "Dalton", "Kaleb", "Madeline", "Aria", "Georgia", "Jon", "Emanuel", "Jeremiah", "Ted", "Elena", "Mark", "August" ], "edges": [ [ 0, 1 ], [ 1, 9 ], [ 2, 7 ], [ 2, 8 ], [ 3, 5 ], [ 5, 4 ], [ 5, 6 ], [ 6, 2 ], [ 9, 3 ], [ 10, 11 ], [ 11, 19 ], [ 12, 17 ], [ 12, 18 ], [ 13, 15 ], [ 15, 14 ], [ 15, 16 ], [ 16, 12 ], [ 19, 13 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Kristina knows Elena. Keegan knows Gloria. Howard knows Grover. Elena knows Esther. Zane knows Agnes. Kristina knows Patrick. Gloria knows Chance. Howard knows George. Asher knows Ramona. Grover knows Lorenzo. Emanuel knows Keegan. Lorenzo knows Zane. Elena knows Emanuel. Holden knows Abel. Lorenzo knows Luke. Keegan knows Asher. Luke knows Porter. Holden knows Howard. Which of Ramona and Agnes can Holden reach?", "answer": "Agnes", "steps": [ "Holden knows Howard.", "Howard knows Grover.", "Grover knows Lorenzo.", "Lorenzo knows Zane.", "Zane knows Agnes." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Holden", "Luke", "George", "Howard", "Zane", "Porter", "Lorenzo", "Abel", "Agnes", "Grover", "Kristina", "Gloria", "Esther", "Elena", "Asher", "Chance", "Keegan", "Patrick", "Ramona", "Emanuel" ], "edges": [ [ 0, 7 ], [ 0, 3 ], [ 1, 5 ], [ 3, 2 ], [ 3, 9 ], [ 4, 8 ], [ 6, 1 ], [ 6, 4 ], [ 9, 6 ], [ 10, 17 ], [ 10, 13 ], [ 11, 15 ], [ 13, 12 ], [ 13, 19 ], [ 14, 18 ], [ 16, 11 ], [ 16, 14 ], [ 19, 16 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Jordan knows Emma. Duncan knows Jacqueline. Gina knows Jerome. Russ knows Gina. Emma knows Pat. Gina knows Griffith. Emma knows Conrad. Paula knows Homer. Pat knows Mabel. Mabel knows Russ. Jacqueline knows Cyrus. Daniella knows Fergus. Daniella knows Gabe. Lillian knows Daniella. Jacqueline knows Paula. Gina knows Mae. Homer knows Lillian. Daniella knows Elvira. Which of Daniella and Gina can Duncan reach?", "answer": "Daniella", "steps": [ "Duncan knows Jacqueline.", "Jacqueline knows Paula.", "Paula knows Homer.", "Homer knows Lillian.", "Lillian knows Daniella." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Duncan", "Daniella", "Paula", "Homer", "Jacqueline", "Gabe", "Fergus", "Elvira", "Lillian", "Cyrus", "Jordan", "Gina", "Pat", "Mabel", "Emma", "Mae", "Griffith", "Jerome", "Russ", "Conrad" ], "edges": [ [ 0, 4 ], [ 1, 5 ], [ 1, 6 ], [ 1, 7 ], [ 2, 3 ], [ 3, 8 ], [ 4, 2 ], [ 4, 9 ], [ 8, 1 ], [ 10, 14 ], [ 11, 15 ], [ 11, 16 ], [ 11, 17 ], [ 12, 13 ], [ 13, 18 ], [ 14, 12 ], [ 14, 19 ], [ 18, 11 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Angelica knows Judy. Howard knows Elton. Langston knows Simon. Dick knows Emery. Taylor knows Howard. Monroe knows Angelica. Judy knows Imogen. Howard knows Darwin. Dick knows Neal. Simon knows June. Dick knows Pablo. Warren knows Leah. Emery knows Warren. Imogen knows Tonya. Monroe knows Taylor. Neal knows Langston. Warren knows Laurel. Monroe knows Tina. Which of Neal and Angelica can Dick reach?", "answer": "Neal", "steps": [ "Dick knows Neal." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Dick", "Neal", "Laurel", "Emery", "June", "Langston", "Leah", "Simon", "Warren", "Pablo", "Monroe", "Angelica", "Darwin", "Taylor", "Tonya", "Judy", "Elton", "Imogen", "Howard", "Tina" ], "edges": [ [ 0, 1 ], [ 0, 3 ], [ 0, 9 ], [ 1, 5 ], [ 3, 8 ], [ 5, 7 ], [ 7, 4 ], [ 8, 2 ], [ 8, 6 ], [ 10, 11 ], [ 10, 13 ], [ 10, 19 ], [ 11, 15 ], [ 13, 18 ], [ 15, 17 ], [ 17, 14 ], [ 18, 12 ], [ 18, 16 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Elvira knows Anthony. Anthony knows Cindy. Eunice knows Anastasia. Rhonda knows Eunice. Clyde knows Jade. Clyde knows Selena. Willard knows Diego. Eunice knows Lionel. Trina knows Rhonda. Denver knows Owen. Itzel knows Trina. Itzel knows Joan. Phoebe knows Elvira. Denver knows Oliver. Phoebe knows Clyde. Owen knows Phoebe. Diego knows Richard. Rhonda knows Willard. Which of Phoebe and Rhonda can Itzel reach?", "answer": "Rhonda", "steps": [ "Itzel knows Trina.", "Trina knows Rhonda." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Itzel", "Lionel", "Rhonda", "Richard", "Diego", "Joan", "Anastasia", "Trina", "Willard", "Eunice", "Denver", "Selena", "Phoebe", "Cindy", "Anthony", "Oliver", "Jade", "Owen", "Elvira", "Clyde" ], "edges": [ [ 0, 5 ], [ 0, 7 ], [ 2, 8 ], [ 2, 9 ], [ 4, 3 ], [ 7, 2 ], [ 8, 4 ], [ 9, 1 ], [ 9, 6 ], [ 10, 15 ], [ 10, 17 ], [ 12, 18 ], [ 12, 19 ], [ 14, 13 ], [ 17, 12 ], [ 18, 14 ], [ 19, 11 ], [ 19, 16 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Linda knows Malcolm. Linda knows Levi. Estelle knows Isadora. Winston knows Merle. Omar knows Neville. Samantha knows Flora. Eugene knows Damian. Omar knows Dixie. Flora knows Eugene. Damian knows Noel. Levi knows Omar. Lucille knows Winston. Dixie knows Isaac. Noel knows Julio. Isaac knows Estelle. Flora knows Tara. Lucille knows Samantha. Malcolm knows Brent. Which of Omar and Flora can Lucille reach?", "answer": "Flora", "steps": [ "Lucille knows Samantha.", "Samantha knows Flora." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Lucille", "Tara", "Merle", "Julio", "Winston", "Flora", "Damian", "Eugene", "Samantha", "Noel", "Linda", "Neville", "Brent", "Isadora", "Malcolm", "Omar", "Isaac", "Dixie", "Levi", "Estelle" ], "edges": [ [ 0, 4 ], [ 0, 8 ], [ 4, 2 ], [ 5, 1 ], [ 5, 7 ], [ 6, 9 ], [ 7, 6 ], [ 8, 5 ], [ 9, 3 ], [ 10, 14 ], [ 10, 18 ], [ 14, 12 ], [ 15, 11 ], [ 15, 17 ], [ 16, 19 ], [ 17, 16 ], [ 18, 15 ], [ 19, 13 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Opal knows Victor. Norman knows Nash. Opal knows Clark. Linda knows India. Tristan knows Fern. India knows Janelle. Davis knows Shelby. Harriet knows Cruz. India knows Lee. Fern knows Sybil. Janelle knows Ricardo. Davis knows Harriet. Shaun knows Linda. Shaun knows Conner. Davis knows Tristan. Shaun knows Norman. Fern knows Opal. Janelle knows Miriam. Which of Opal and Janelle can Shaun reach?", "answer": "Janelle", "steps": [ "Shaun knows Linda.", "Linda knows India.", "India knows Janelle." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Shaun", "Ricardo", "Miriam", "India", "Nash", "Lee", "Linda", "Conner", "Janelle", "Norman", "Davis", "Clark", "Victor", "Fern", "Cruz", "Sybil", "Tristan", "Shelby", "Opal", "Harriet" ], "edges": [ [ 0, 7 ], [ 0, 6 ], [ 0, 9 ], [ 3, 5 ], [ 3, 8 ], [ 6, 3 ], [ 8, 1 ], [ 8, 2 ], [ 9, 4 ], [ 10, 17 ], [ 10, 16 ], [ 10, 19 ], [ 13, 15 ], [ 13, 18 ], [ 16, 13 ], [ 18, 11 ], [ 18, 12 ], [ 19, 14 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Joy knows Edwin. Ada knows Spencer. Gloria knows Kelly. Darius knows Joy. Allan knows Henrietta. Reid knows Camden. Reid knows Dominic. Lorraine knows Reid. Lillian knows Darius. Lillian knows Pam. Blanche knows Gloria. Joy knows Carter. Allan knows Drew. Spencer knows Lorraine. Henrietta knows Lillian. Spencer knows Caroline. Blanche knows Ada. Drew knows Shelly. Which of Ada and Henrietta can Blanche reach?", "answer": "Ada", "steps": [ "Blanche knows Ada." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Blanche", "Lorraine", "Ada", "Spencer", "Gloria", "Dominic", "Camden", "Kelly", "Caroline", "Reid", "Allan", "Darius", "Henrietta", "Lillian", "Drew", "Carter", "Edwin", "Shelly", "Pam", "Joy" ], "edges": [ [ 0, 4 ], [ 0, 2 ], [ 1, 9 ], [ 2, 3 ], [ 3, 8 ], [ 3, 1 ], [ 4, 7 ], [ 9, 5 ], [ 9, 6 ], [ 10, 14 ], [ 10, 12 ], [ 11, 19 ], [ 12, 13 ], [ 13, 18 ], [ 13, 11 ], [ 14, 17 ], [ 19, 15 ], [ 19, 16 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Samuel knows Walt. Dolly knows Sidney. Wilma knows Drake. Samuel knows Quinn. Drake knows Earl. Milton knows Dolly. Earl knows Milton. Samuel knows Albert. Eleanor knows Joyce. Samuel knows Eleanor. George knows Della. Earl knows Elias. Earl knows George. Arden knows Samuel. Joyce knows Jem. Earl knows Eli. Quinn knows Jaime. Stacy knows Arden. Which of Sidney and Jem can Wilma reach?", "answer": "Sidney", "steps": [ "Wilma knows Drake.", "Drake knows Earl.", "Earl knows Milton.", "Milton knows Dolly.", "Dolly knows Sidney." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Wilma", "Della", "Dolly", "George", "Milton", "Earl", "Elias", "Drake", "Eli", "Sidney", "Stacy", "Jaime", "Joyce", "Quinn", "Eleanor", "Samuel", "Albert", "Arden", "Walt", "Jem" ], "edges": [ [ 0, 7 ], [ 2, 9 ], [ 3, 1 ], [ 4, 2 ], [ 5, 3 ], [ 5, 6 ], [ 5, 8 ], [ 5, 4 ], [ 7, 5 ], [ 10, 17 ], [ 12, 19 ], [ 13, 11 ], [ 14, 12 ], [ 15, 13 ], [ 15, 16 ], [ 15, 18 ], [ 15, 14 ], [ 17, 15 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Marshall knows Heather. Ida knows Deanna. Edgar knows Edward. Scott knows Darius. Darius knows Ida. Cole knows Felicia. Samantha knows Cole. Robin knows Scott. Julian knows Blanche. Darius knows Samantha. Felicia knows Morris. Heather knows Luther. Marshall knows Edgar. Aurora knows Marshall. Blanche knows Aurora. Luther knows Fleur. Fleur knows Hilda. Joy knows Robin. Which of Robin and Blanche can Julian reach?", "answer": "Blanche", "steps": [ "Julian knows Blanche." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Julian", "Fleur", "Edward", "Marshall", "Luther", "Hilda", "Blanche", "Aurora", "Edgar", "Heather", "Joy", "Felicia", "Deanna", "Darius", "Cole", "Morris", "Robin", "Scott", "Ida", "Samantha" ], "edges": [ [ 0, 6 ], [ 1, 5 ], [ 3, 8 ], [ 3, 9 ], [ 4, 1 ], [ 6, 7 ], [ 7, 3 ], [ 8, 2 ], [ 9, 4 ], [ 10, 16 ], [ 11, 15 ], [ 13, 18 ], [ 13, 19 ], [ 14, 11 ], [ 16, 17 ], [ 17, 13 ], [ 18, 12 ], [ 19, 14 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Nathan knows Louisa. Helene knows Anthony. Carl knows Priscilla. Foster knows Darnell. Priscilla knows Humphrey. Foster knows Merle. Jermaine knows Foster. Carl knows Malcolm. Zach knows Ruby. Merle knows Zach. Ruby knows Glenn. Humphrey knows Kane. Jermaine knows Ida. Priscilla knows Wendy. Kane knows Helene. Priscilla knows Fergus. Wendy knows Cliff. Foster knows Nathan. Which of Humphrey and Merle can Jermaine reach?", "answer": "Merle", "steps": [ "Jermaine knows Foster.", "Foster knows Merle." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Jermaine", "Ruby", "Foster", "Glenn", "Nathan", "Merle", "Darnell", "Ida", "Zach", "Louisa", "Carl", "Helene", "Priscilla", "Anthony", "Wendy", "Humphrey", "Fergus", "Malcolm", "Kane", "Cliff" ], "edges": [ [ 0, 7 ], [ 0, 2 ], [ 1, 3 ], [ 2, 6 ], [ 2, 5 ], [ 2, 4 ], [ 4, 9 ], [ 5, 8 ], [ 8, 1 ], [ 10, 17 ], [ 10, 12 ], [ 11, 13 ], [ 12, 16 ], [ 12, 15 ], [ 12, 14 ], [ 14, 19 ], [ 15, 18 ], [ 18, 11 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Elvira knows Anthony. Anthony knows Cindy. Eunice knows Anastasia. Rhonda knows Eunice. Clyde knows Jade. Clyde knows Selena. Willard knows Diego. Eunice knows Lionel. Trina knows Rhonda. Denver knows Owen. Itzel knows Trina. Itzel knows Joan. Phoebe knows Elvira. Denver knows Oliver. Phoebe knows Clyde. Owen knows Phoebe. Diego knows Richard. Rhonda knows Willard. Which of Richard and Cindy can Itzel reach?", "answer": "Richard", "steps": [ "Itzel knows Trina.", "Trina knows Rhonda.", "Rhonda knows Willard.", "Willard knows Diego.", "Diego knows Richard." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Itzel", "Lionel", "Rhonda", "Richard", "Diego", "Joan", "Anastasia", "Trina", "Willard", "Eunice", "Denver", "Selena", "Phoebe", "Cindy", "Anthony", "Oliver", "Jade", "Owen", "Elvira", "Clyde" ], "edges": [ [ 0, 5 ], [ 0, 7 ], [ 2, 8 ], [ 2, 9 ], [ 4, 3 ], [ 7, 2 ], [ 8, 4 ], [ 9, 1 ], [ 9, 6 ], [ 10, 15 ], [ 10, 17 ], [ 12, 18 ], [ 12, 19 ], [ 14, 13 ], [ 17, 12 ], [ 18, 14 ], [ 19, 11 ], [ 19, 16 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Alfonso knows Florence. Ben knows Charlene. Dexter knows Ingrid. Garrett knows Hank. Florence knows Norman. Oliver knows Vance. Vance knows Victoria. Vance knows Dexter. George knows Deirdre. Jake knows Garrett. George knows Ivy. Garrett knows Cole. Ivy knows Ben. Jake knows Fisher. Eva knows Jake. Dexter knows George. Cole knows Gordon. Cole knows Alfonso. Which of Alfonso and Ivy can Eva reach?", "answer": "Alfonso", "steps": [ "Eva knows Jake.", "Jake knows Garrett.", "Garrett knows Cole.", "Cole knows Alfonso." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Eva", "Cole", "Gordon", "Alfonso", "Norman", "Fisher", "Florence", "Jake", "Hank", "Garrett", "Oliver", "George", "Deirdre", "Ivy", "Charlene", "Victoria", "Ben", "Vance", "Ingrid", "Dexter" ], "edges": [ [ 0, 7 ], [ 1, 2 ], [ 1, 3 ], [ 3, 6 ], [ 6, 4 ], [ 7, 5 ], [ 7, 9 ], [ 9, 1 ], [ 9, 8 ], [ 10, 17 ], [ 11, 12 ], [ 11, 13 ], [ 13, 16 ], [ 16, 14 ], [ 17, 15 ], [ 17, 19 ], [ 19, 11 ], [ 19, 18 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Leander knows Henry. Arthur knows India. Joseph knows Delilah. Lewis knows Daniel. Martin knows Leander. Alison knows Arthur. Kendra knows Joseph. Leander knows Susan. Lewis knows Gerard. Christian knows Kieran. Delilah knows Heath. Boyd knows Christian. Arthur knows Lewis. Susan knows Fabian. Daniel knows Boyd. Joseph knows Chloe. Boyd knows Walt. Susan knows Kendra. Which of Arthur and Leander can Alison reach?", "answer": "Arthur", "steps": [ "Alison knows Arthur." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Alison", "India", "Gerard", "Arthur", "Daniel", "Kieran", "Lewis", "Christian", "Walt", "Boyd", "Martin", "Henry", "Fabian", "Leander", "Kendra", "Heath", "Susan", "Delilah", "Chloe", "Joseph" ], "edges": [ [ 0, 3 ], [ 3, 1 ], [ 3, 6 ], [ 4, 9 ], [ 6, 2 ], [ 6, 4 ], [ 7, 5 ], [ 9, 7 ], [ 9, 8 ], [ 10, 13 ], [ 13, 11 ], [ 13, 16 ], [ 14, 19 ], [ 16, 12 ], [ 16, 14 ], [ 17, 15 ], [ 19, 17 ], [ 19, 18 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Leah knows Val. Joy knows Leah. Beth knows Kirsten. Leah knows Dennis. Gwen knows Calvin. Daria knows Colleen. Harlan knows Vernon. Val knows Hazel. Cara knows Laurel. Harlan knows Edison. Vernon knows Gwen. Holly knows Joy. Beth knows Daria. Holly knows Leander. Leander knows Lionel. Leander knows Cara. Vernon knows Ralph. Edison knows Beth. Which of Hazel and Colleen can Harlan reach?", "answer": "Colleen", "steps": [ "Harlan knows Edison.", "Edison knows Beth.", "Beth knows Daria.", "Daria knows Colleen." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Harlan", "Calvin", "Beth", "Edison", "Gwen", "Daria", "Colleen", "Kirsten", "Vernon", "Ralph", "Holly", "Laurel", "Leah", "Joy", "Cara", "Val", "Hazel", "Dennis", "Leander", "Lionel" ], "edges": [ [ 0, 3 ], [ 0, 8 ], [ 2, 5 ], [ 2, 7 ], [ 3, 2 ], [ 4, 1 ], [ 5, 6 ], [ 8, 4 ], [ 8, 9 ], [ 10, 13 ], [ 10, 18 ], [ 12, 15 ], [ 12, 17 ], [ 13, 12 ], [ 14, 11 ], [ 15, 16 ], [ 18, 14 ], [ 18, 19 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Reid knows Autumn. Selena knows Duke. Autumn knows Emanuel. Goldie knows Kenneth. Goldie knows Farrah. Thea knows Grover. Kendra knows Thea. Jean knows Doug. Kendra knows Amanda. Kenneth knows Stefan. Autumn knows Harold. Kendra knows Reid. Goldie knows Selena. Jean knows Palmer. Amanda knows Catherine. Jean knows Ursula. Farrah knows Jean. Autumn knows Winifred. Which of Farrah and Reid can Goldie reach?", "answer": "Farrah", "steps": [ "Goldie knows Farrah." ], "difficulty": 1, "original_distance": 3, "idx_to_symbol": [ "Goldie", "Palmer", "Duke", "Jean", "Stefan", "Kenneth", "Selena", "Doug", "Farrah", "Ursula", "Kendra", "Harold", "Grover", "Autumn", "Catherine", "Amanda", "Thea", "Winifred", "Reid", "Emanuel" ], "edges": [ [ 0, 5 ], [ 0, 6 ], [ 0, 8 ], [ 3, 1 ], [ 3, 7 ], [ 3, 9 ], [ 5, 4 ], [ 6, 2 ], [ 8, 3 ], [ 10, 15 ], [ 10, 16 ], [ 10, 18 ], [ 13, 11 ], [ 13, 17 ], [ 13, 19 ], [ 15, 14 ], [ 16, 12 ], [ 18, 13 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Hope knows Edison. Leon knows Eloise. Hope knows Dina. Horace knows Harrison. Zoe knows Alana. Julius knows Nancy. Randy knows Horace. Axel knows Julius. Zoe knows Kennedy. Harrison knows Esperanza. Dina knows Randy. Leon knows Haven. Shelly knows Opal. Dina knows Leon. Alana knows Shelly. Tracy knows Axel. Shelly knows Dustin. Alana knows Tracy. Which of Dina and Alana can Zoe reach?", "answer": "Alana", "steps": [ "Zoe knows Alana." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Zoe", "Alana", "Julius", "Shelly", "Tracy", "Dustin", "Kennedy", "Nancy", "Axel", "Opal", "Hope", "Dina", "Harrison", "Leon", "Randy", "Haven", "Edison", "Esperanza", "Horace", "Eloise" ], "edges": [ [ 0, 6 ], [ 0, 1 ], [ 1, 4 ], [ 1, 3 ], [ 2, 7 ], [ 3, 5 ], [ 3, 9 ], [ 4, 8 ], [ 8, 2 ], [ 10, 16 ], [ 10, 11 ], [ 11, 14 ], [ 11, 13 ], [ 12, 17 ], [ 13, 15 ], [ 13, 19 ], [ 14, 18 ], [ 18, 12 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Kate knows Archer. Zoe knows Eva. Joel knows Annie. Yara knows Iris. Imogen knows Katrina. Archer knows Penny. Joyce knows Della. Joel knows Yara. Joyce knows Alejandro. Della knows Mary. Katrina knows Ada. Holden knows Imogen. Holly knows Ernie. Eva knows Joyce. Imogen knows Holly. Knox knows Kate. Kate knows Zoe. Ada knows Joel. Which of Iris and Mary can Holden reach?", "answer": "Iris", "steps": [ "Holden knows Imogen.", "Imogen knows Katrina.", "Katrina knows Ada.", "Ada knows Joel.", "Joel knows Yara.", "Yara knows Iris." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Holden", "Annie", "Ada", "Ernie", "Iris", "Imogen", "Yara", "Joel", "Holly", "Katrina", "Knox", "Alejandro", "Eva", "Penny", "Mary", "Kate", "Della", "Joyce", "Archer", "Zoe" ], "edges": [ [ 0, 5 ], [ 2, 7 ], [ 5, 8 ], [ 5, 9 ], [ 6, 4 ], [ 7, 1 ], [ 7, 6 ], [ 8, 3 ], [ 9, 2 ], [ 10, 15 ], [ 12, 17 ], [ 15, 18 ], [ 15, 19 ], [ 16, 14 ], [ 17, 11 ], [ 17, 16 ], [ 18, 13 ], [ 19, 12 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Karl knows Dallas. Marvin knows Rosemary. Gabriel knows Adrian. Lennox knows Ramona. Gabriel knows Pam. Kara knows Alvin. Lenora knows Loretta. Pam knows Mary. Marvin knows Chandler. Chandler knows Ted. Ramona knows Evan. Karl knows Jonah. Chandler knows Lenora. Evan knows Marvin. Evan knows Nancy. Alvin knows Karl. Jonah knows Blake. Jonah knows Gabriel. Which of Karl and Evan can Kara reach?", "answer": "Karl", "steps": [ "Kara knows Alvin.", "Alvin knows Karl." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Kara", "Pam", "Karl", "Jonah", "Gabriel", "Dallas", "Blake", "Alvin", "Adrian", "Mary", "Lennox", "Lenora", "Evan", "Marvin", "Chandler", "Nancy", "Rosemary", "Ramona", "Ted", "Loretta" ], "edges": [ [ 0, 7 ], [ 1, 9 ], [ 2, 5 ], [ 2, 3 ], [ 3, 6 ], [ 3, 4 ], [ 4, 8 ], [ 4, 1 ], [ 7, 2 ], [ 10, 17 ], [ 11, 19 ], [ 12, 15 ], [ 12, 13 ], [ 13, 16 ], [ 13, 14 ], [ 14, 18 ], [ 14, 11 ], [ 17, 12 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Gideon knows Alma. Yolanda knows Harmony. Tony knows Harlan. Yolanda knows Tony. Clarence knows Denise. Hampton knows Jessie. Kenzie knows Cain. Vance knows Yolanda. Vance knows Hampton. Gideon knows Inez. Inez knows Wanda. Harlan knows Basil. Clarence knows Kenzie. Denise knows Anna. Tony knows Olive. Gideon knows Elvis. Denise knows Gideon. Tony knows Dakota. Which of Denise and Yolanda can Clarence reach?", "answer": "Denise", "steps": [ "Clarence knows Denise." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Clarence", "Wanda", "Denise", "Elvis", "Inez", "Alma", "Kenzie", "Cain", "Anna", "Gideon", "Vance", "Basil", "Yolanda", "Olive", "Harlan", "Dakota", "Hampton", "Jessie", "Harmony", "Tony" ], "edges": [ [ 0, 6 ], [ 0, 2 ], [ 2, 8 ], [ 2, 9 ], [ 4, 1 ], [ 6, 7 ], [ 9, 3 ], [ 9, 4 ], [ 9, 5 ], [ 10, 16 ], [ 10, 12 ], [ 12, 18 ], [ 12, 19 ], [ 14, 11 ], [ 16, 17 ], [ 19, 13 ], [ 19, 14 ], [ 19, 15 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Kay knows Ava. Asher knows Francesca. Randall knows Judith. Irving knows Daria. Asher knows Joyce. Francesca knows Destiny. Daria knows Randall. Randall knows Drew. Garland knows Shaun. Drew knows Aria. Drew knows Caroline. Francesca knows Garland. Drew knows Clinton. Shaun knows Gina. Francesca knows Isabel. Cynthia knows Jenny. Ava knows Asher. Clinton knows Cynthia. Which of Ava and Daria can Kay reach?", "answer": "Ava", "steps": [ "Kay knows Ava." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Kay", "Joyce", "Shaun", "Garland", "Asher", "Gina", "Destiny", "Francesca", "Ava", "Isabel", "Irving", "Judith", "Cynthia", "Clinton", "Randall", "Jenny", "Aria", "Drew", "Daria", "Caroline" ], "edges": [ [ 0, 8 ], [ 2, 5 ], [ 3, 2 ], [ 4, 1 ], [ 4, 7 ], [ 7, 3 ], [ 7, 6 ], [ 7, 9 ], [ 8, 4 ], [ 10, 18 ], [ 12, 15 ], [ 13, 12 ], [ 14, 11 ], [ 14, 17 ], [ 17, 13 ], [ 17, 16 ], [ 17, 19 ], [ 18, 14 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Iris knows Vivian. Justine knows Mason. Eli knows Dwight. Dwight knows Ursula. Desmond knows Lily. Justine knows Duke. Gemma knows Herman. Vivian knows Itzel. Luis knows Evelyn. Evelyn knows Desmond. Luis knows Olive. Evelyn knows Justine. Iris knows Eli. Gemma knows Iris. Vivian knows Bella. Lily knows Odette. Eli knows Byron. Desmond knows Pearl. Which of Lily and Dwight can Luis reach?", "answer": "Lily", "steps": [ "Luis knows Evelyn.", "Evelyn knows Desmond.", "Desmond knows Lily." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Luis", "Lily", "Desmond", "Mason", "Olive", "Odette", "Evelyn", "Justine", "Pearl", "Duke", "Gemma", "Dwight", "Eli", "Bella", "Herman", "Ursula", "Iris", "Vivian", "Byron", "Itzel" ], "edges": [ [ 0, 4 ], [ 0, 6 ], [ 1, 5 ], [ 2, 1 ], [ 2, 8 ], [ 6, 2 ], [ 6, 7 ], [ 7, 3 ], [ 7, 9 ], [ 10, 14 ], [ 10, 16 ], [ 11, 15 ], [ 12, 11 ], [ 12, 18 ], [ 16, 12 ], [ 16, 17 ], [ 17, 13 ], [ 17, 19 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Natalie knows Trina. Philip knows Kelsey. Xander knows Lawson. Charles knows Harmony. Harris knows Gareth. Kelsey knows Natalie. Antonio knows Gonzalo. Veronica knows Daria. Philip knows Veronica. Kelsey knows Blake. Charles knows Joaquin. Lawson knows Alice. Trina knows Michelle. Harris knows Philip. Harmony knows Antonio. Alice knows Perry. Xander knows Heath. Lawson knows Charles. Which of Trina and Antonio can Harris reach?", "answer": "Trina", "steps": [ "Harris knows Philip.", "Philip knows Kelsey.", "Kelsey knows Natalie.", "Natalie knows Trina." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Harris", "Philip", "Daria", "Veronica", "Trina", "Blake", "Gareth", "Kelsey", "Natalie", "Michelle", "Xander", "Lawson", "Perry", "Alice", "Antonio", "Joaquin", "Heath", "Charles", "Harmony", "Gonzalo" ], "edges": [ [ 0, 6 ], [ 0, 1 ], [ 1, 3 ], [ 1, 7 ], [ 3, 2 ], [ 4, 9 ], [ 7, 5 ], [ 7, 8 ], [ 8, 4 ], [ 10, 16 ], [ 10, 11 ], [ 11, 13 ], [ 11, 17 ], [ 13, 12 ], [ 14, 19 ], [ 17, 15 ], [ 17, 18 ], [ 18, 14 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Norma knows Virgil. Nash knows Brandon. Iris knows Clayton. Maggie knows Pablo. Sandy knows Maggie. Jameson knows Flora. Leah knows Julio. Ezra knows Jameson. Iris knows Ezra. Clayton knows Karl. Justine knows Norma. Nash knows Leah. Justine knows Grace. Maggie knows Nash. Norma knows Iris. Julio knows Jessica. Sandy knows Colin. Brandon knows Reed. Which of Maggie and Norma can Justine reach?", "answer": "Norma", "steps": [ "Justine knows Norma." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Justine", "Norma", "Ezra", "Karl", "Clayton", "Grace", "Jameson", "Flora", "Iris", "Virgil", "Sandy", "Maggie", "Leah", "Reed", "Brandon", "Colin", "Julio", "Jessica", "Nash", "Pablo" ], "edges": [ [ 0, 5 ], [ 0, 1 ], [ 1, 8 ], [ 1, 9 ], [ 2, 6 ], [ 4, 3 ], [ 6, 7 ], [ 8, 4 ], [ 8, 2 ], [ 10, 15 ], [ 10, 11 ], [ 11, 18 ], [ 11, 19 ], [ 12, 16 ], [ 14, 13 ], [ 16, 17 ], [ 18, 14 ], [ 18, 12 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Janice knows Ainsley. Graeme knows Blake. Destiny knows Maria. Herbert knows Alice. Carmela knows Janice. Vicki knows Carmela. Elmer knows Estella. Janice knows Graeme. Alice knows Vicki. Wallace knows Elmer. Stefan knows Jennifer. Maria knows Stefan. Elmer knows Scott. Jules knows Glenn. Cate knows Herbert. Stefan knows Jules. Estella knows Destiny. Herbert knows Charity. Which of Blake and Glenn can Cate reach?", "answer": "Blake", "steps": [ "Cate knows Herbert.", "Herbert knows Alice.", "Alice knows Vicki.", "Vicki knows Carmela.", "Carmela knows Janice.", "Janice knows Graeme.", "Graeme knows Blake." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Cate", "Ainsley", "Alice", "Vicki", "Herbert", "Charity", "Carmela", "Graeme", "Janice", "Blake", "Wallace", "Jennifer", "Estella", "Destiny", "Elmer", "Scott", "Maria", "Jules", "Stefan", "Glenn" ], "edges": [ [ 0, 4 ], [ 2, 3 ], [ 3, 6 ], [ 4, 5 ], [ 4, 2 ], [ 6, 8 ], [ 7, 9 ], [ 8, 1 ], [ 8, 7 ], [ 10, 14 ], [ 12, 13 ], [ 13, 16 ], [ 14, 15 ], [ 14, 12 ], [ 16, 18 ], [ 17, 19 ], [ 18, 11 ], [ 18, 17 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Raymond knows Florence. Esperanza knows Cliff. Dolores knows David. Cliff knows Harley. Esperanza knows Carla. Porter knows Raymond. Kevin knows Spencer. Porter knows Penny. Cliff knows Gerard. Cliff knows Gertrude. Carla knows Kevin. Raymond knows Vera. Vera knows Jeff. Jeff knows Kyle. Brent knows Trevor. Penny knows Dolores. Harley knows Brent. Raymond knows Larissa. Which of Trevor and Kyle can Porter reach?", "answer": "Kyle", "steps": [ "Porter knows Raymond.", "Raymond knows Vera.", "Vera knows Jeff.", "Jeff knows Kyle." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Porter", "Jeff", "Raymond", "Vera", "Larissa", "Dolores", "David", "Florence", "Penny", "Kyle", "Esperanza", "Brent", "Cliff", "Harley", "Gertrude", "Kevin", "Spencer", "Gerard", "Carla", "Trevor" ], "edges": [ [ 0, 8 ], [ 0, 2 ], [ 1, 9 ], [ 2, 4 ], [ 2, 7 ], [ 2, 3 ], [ 3, 1 ], [ 5, 6 ], [ 8, 5 ], [ 10, 18 ], [ 10, 12 ], [ 11, 19 ], [ 12, 14 ], [ 12, 17 ], [ 12, 13 ], [ 13, 11 ], [ 15, 16 ], [ 18, 15 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Lionel knows Miranda. Lionel knows Ivan. Brent knows Clifford. Kristina knows Skyler. Daphna knows Brent. Miranda knows Elmer. Denver knows Dolly. Homer knows Dixie. Denver knows India. Lionel knows Bella. Allan knows Loretta. Allan knows Homer. Dolly knows Daphna. Allan knows Denver. Miranda knows Bette. Bette knows Fern. Fern knows Kristina. Bella knows Violet. Which of Clifford and Skyler can Allan reach?", "answer": "Clifford", "steps": [ "Allan knows Denver.", "Denver knows Dolly.", "Dolly knows Daphna.", "Daphna knows Brent.", "Brent knows Clifford." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Allan", "Daphna", "Dolly", "Brent", "Clifford", "Denver", "Dixie", "Homer", "Loretta", "India", "Lionel", "Fern", "Bette", "Kristina", "Skyler", "Miranda", "Violet", "Bella", "Ivan", "Elmer" ], "edges": [ [ 0, 7 ], [ 0, 8 ], [ 0, 5 ], [ 1, 3 ], [ 2, 1 ], [ 3, 4 ], [ 5, 2 ], [ 5, 9 ], [ 7, 6 ], [ 10, 17 ], [ 10, 18 ], [ 10, 15 ], [ 11, 13 ], [ 12, 11 ], [ 13, 14 ], [ 15, 12 ], [ 15, 19 ], [ 17, 16 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Doris knows Hayley. Jacob knows Jonah. Belinda knows Nadine. Jacob knows Aspen. Keith knows Theodore. Aspen knows Haven. Haven knows Edison. Belinda knows Hadley. Don knows Elodie. Theodore knows Zara. Doris knows Raymond. Theodore knows Belinda. Haven knows Chester. Jana knows Don. Don knows Jacob. Theodore knows Alyson. Don knows Elias. Nadine knows Doris. Which of Hayley and Chester can Keith reach?", "answer": "Hayley", "steps": [ "Keith knows Theodore.", "Theodore knows Belinda.", "Belinda knows Nadine.", "Nadine knows Doris.", "Doris knows Hayley." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Keith", "Nadine", "Zara", "Theodore", "Alyson", "Hadley", "Hayley", "Doris", "Belinda", "Raymond", "Jana", "Aspen", "Elodie", "Don", "Elias", "Jonah", "Chester", "Haven", "Jacob", "Edison" ], "edges": [ [ 0, 3 ], [ 1, 7 ], [ 3, 2 ], [ 3, 4 ], [ 3, 8 ], [ 7, 6 ], [ 7, 9 ], [ 8, 5 ], [ 8, 1 ], [ 10, 13 ], [ 11, 17 ], [ 13, 12 ], [ 13, 14 ], [ 13, 18 ], [ 17, 16 ], [ 17, 19 ], [ 18, 15 ], [ 18, 11 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Jarvis knows Clay. Will knows Kendrick. Philip knows Dirk. June knows Brooks. Marshall knows Loretta. Tony knows Lyle. Milton knows Jarvis. Kendrick knows Marshall. Marco knows Will. Israel knows Marco. Kendrick knows Gene. Milton knows Seth. Will knows Lola. Laverne knows Jorge. June knows Milton. Clay knows Laverne. Dirk knows June. Loretta knows Tony. Which of Lyle and Jorge can Israel reach?", "answer": "Lyle", "steps": [ "Israel knows Marco.", "Marco knows Will.", "Will knows Kendrick.", "Kendrick knows Marshall.", "Marshall knows Loretta.", "Loretta knows Tony.", "Tony knows Lyle." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Israel", "Lyle", "Will", "Gene", "Tony", "Kendrick", "Marshall", "Marco", "Lola", "Loretta", "Philip", "Jorge", "June", "Seth", "Laverne", "Milton", "Jarvis", "Dirk", "Brooks", "Clay" ], "edges": [ [ 0, 7 ], [ 2, 8 ], [ 2, 5 ], [ 4, 1 ], [ 5, 3 ], [ 5, 6 ], [ 6, 9 ], [ 7, 2 ], [ 9, 4 ], [ 10, 17 ], [ 12, 18 ], [ 12, 15 ], [ 14, 11 ], [ 15, 13 ], [ 15, 16 ], [ 16, 19 ], [ 17, 12 ], [ 19, 14 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Fergus knows Annie. Edith knows Caroline. Ramona knows Preston. Esther knows Dayton. Caroline knows Fergus. Preston knows Duncan. Darwin knows Frank. Frank knows Andrew. Duncan knows Garrett. Hugo knows Isaac. Preston knows Effie. Duncan knows Edith. Frank knows Lamont. Isaac knows Everett. Lamont knows Esther. Edith knows Morgan. Lamont knows Kelsey. Esther knows Hugo. Which of Esther and Edith can Ramona reach?", "answer": "Edith", "steps": [ "Ramona knows Preston.", "Preston knows Duncan.", "Duncan knows Edith." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Ramona", "Caroline", "Edith", "Fergus", "Garrett", "Effie", "Annie", "Morgan", "Duncan", "Preston", "Darwin", "Hugo", "Esther", "Isaac", "Kelsey", "Andrew", "Everett", "Dayton", "Lamont", "Frank" ], "edges": [ [ 0, 9 ], [ 1, 3 ], [ 2, 1 ], [ 2, 7 ], [ 3, 6 ], [ 8, 4 ], [ 8, 2 ], [ 9, 5 ], [ 9, 8 ], [ 10, 19 ], [ 11, 13 ], [ 12, 11 ], [ 12, 17 ], [ 13, 16 ], [ 18, 14 ], [ 18, 12 ], [ 19, 15 ], [ 19, 18 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Felicia knows Clinton. Carmen knows Felicia. Elliot knows Clifford. Stefan knows Elliot. Monica knows Destiny. Darwin knows Monica. Destiny knows Chase. Fraser knows Kara. Kara knows Alfonso. Lena knows Colette. Fraser knows Yara. Yara knows Florence. Florence knows Dolores. Wilma knows Lena. Yara knows Darwin. Colette knows Howard. Stefan knows Carmen. Carmen knows Wilma. Which of Carmen and Yara can Stefan reach?", "answer": "Carmen", "steps": [ "Stefan knows Carmen." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Stefan", "Carmen", "Colette", "Felicia", "Clifford", "Wilma", "Lena", "Howard", "Elliot", "Clinton", "Fraser", "Yara", "Destiny", "Florence", "Alfonso", "Darwin", "Monica", "Chase", "Kara", "Dolores" ], "edges": [ [ 0, 8 ], [ 0, 1 ], [ 1, 5 ], [ 1, 3 ], [ 2, 7 ], [ 3, 9 ], [ 5, 6 ], [ 6, 2 ], [ 8, 4 ], [ 10, 18 ], [ 10, 11 ], [ 11, 15 ], [ 11, 13 ], [ 12, 17 ], [ 13, 19 ], [ 15, 16 ], [ 16, 12 ], [ 18, 14 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Quinn knows Jonah. Bonnie knows Gail. Desmond knows Rhonda. Dudley knows Iris. Bonnie knows Joseph. Joseph knows Geneva. Gail knows Lance. Iris knows Michelle. Candice knows Cyrus. Dudley knows Lane. Hamilton knows Livia. Dudley knows Desmond. Jonah knows Hamilton. Hamilton knows Dudley. Demetrius knows Bonnie. Cyrus knows Demetrius. Demetrius knows Eloise. Bonnie knows Cordelia. Which of Michelle and Geneva can Candice reach?", "answer": "Geneva", "steps": [ "Candice knows Cyrus.", "Cyrus knows Demetrius.", "Demetrius knows Bonnie.", "Bonnie knows Joseph.", "Joseph knows Geneva." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Candice", "Lance", "Geneva", "Bonnie", "Eloise", "Cordelia", "Demetrius", "Cyrus", "Gail", "Joseph", "Quinn", "Rhonda", "Michelle", "Dudley", "Livia", "Lane", "Hamilton", "Jonah", "Desmond", "Iris" ], "edges": [ [ 0, 7 ], [ 3, 5 ], [ 3, 8 ], [ 3, 9 ], [ 6, 4 ], [ 6, 3 ], [ 7, 6 ], [ 8, 1 ], [ 9, 2 ], [ 10, 17 ], [ 13, 15 ], [ 13, 18 ], [ 13, 19 ], [ 16, 14 ], [ 16, 13 ], [ 17, 16 ], [ 18, 11 ], [ 19, 12 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Andrea knows Zelda. Graham knows Harris. Tony knows Etta. Layla knows Darius. Andrea knows Graham. Pam knows Tiffany. Allen knows Layla. Zara knows Gemma. Tiffany knows Cynthia. Zelda knows Cyrus. Tony knows Andrea. Allen knows Audrey. Cyrus knows Zara. Vernon knows Liam. Cyrus knows Clifford. Tiffany knows Vernon. Pam knows Alice. Cynthia knows Allen. Which of Cyrus and Allen can Pam reach?", "answer": "Allen", "steps": [ "Pam knows Tiffany.", "Tiffany knows Cynthia.", "Cynthia knows Allen." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Pam", "Audrey", "Cynthia", "Tiffany", "Alice", "Allen", "Liam", "Darius", "Vernon", "Layla", "Tony", "Clifford", "Zelda", "Andrea", "Etta", "Cyrus", "Harris", "Gemma", "Graham", "Zara" ], "edges": [ [ 0, 4 ], [ 0, 3 ], [ 2, 5 ], [ 3, 8 ], [ 3, 2 ], [ 5, 1 ], [ 5, 9 ], [ 8, 6 ], [ 9, 7 ], [ 10, 14 ], [ 10, 13 ], [ 12, 15 ], [ 13, 18 ], [ 13, 12 ], [ 15, 11 ], [ 15, 19 ], [ 18, 16 ], [ 19, 17 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Jerry knows Heath. Annie knows Mary. Edwin knows Erma. Hampton knows Lennox. Bonnie knows Nathan. Nicole knows Tanya. Nathan knows Lucy. Bonnie knows Jacqueline. Nicole knows Elton. Heath knows Edwin. Hampton knows Edna. Jacqueline knows Ibrahim. Tanya knows Bonnie. Edwin knows Hampton. Elton knows Mason. Jerry knows Annie. Erma knows April. Nathan knows Hunter. Which of April and Ibrahim can Nicole reach?", "answer": "Ibrahim", "steps": [ "Nicole knows Tanya.", "Tanya knows Bonnie.", "Bonnie knows Jacqueline.", "Jacqueline knows Ibrahim." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Nicole", "Ibrahim", "Bonnie", "Hunter", "Tanya", "Jacqueline", "Nathan", "Mason", "Elton", "Lucy", "Jerry", "April", "Edwin", "Edna", "Heath", "Erma", "Hampton", "Mary", "Annie", "Lennox" ], "edges": [ [ 0, 8 ], [ 0, 4 ], [ 2, 5 ], [ 2, 6 ], [ 4, 2 ], [ 5, 1 ], [ 6, 3 ], [ 6, 9 ], [ 8, 7 ], [ 10, 18 ], [ 10, 14 ], [ 12, 15 ], [ 12, 16 ], [ 14, 12 ], [ 15, 11 ], [ 16, 13 ], [ 16, 19 ], [ 18, 17 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Kristina knows Elena. Keegan knows Gloria. Howard knows Grover. Elena knows Esther. Zane knows Agnes. Kristina knows Patrick. Gloria knows Chance. Howard knows George. Asher knows Ramona. Grover knows Lorenzo. Emanuel knows Keegan. Lorenzo knows Zane. Elena knows Emanuel. Holden knows Abel. Lorenzo knows Luke. Keegan knows Asher. Luke knows Porter. Holden knows Howard. Which of Zane and Asher can Holden reach?", "answer": "Zane", "steps": [ "Holden knows Howard.", "Howard knows Grover.", "Grover knows Lorenzo.", "Lorenzo knows Zane." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Holden", "Luke", "George", "Howard", "Zane", "Porter", "Lorenzo", "Abel", "Agnes", "Grover", "Kristina", "Gloria", "Esther", "Elena", "Asher", "Chance", "Keegan", "Patrick", "Ramona", "Emanuel" ], "edges": [ [ 0, 7 ], [ 0, 3 ], [ 1, 5 ], [ 3, 2 ], [ 3, 9 ], [ 4, 8 ], [ 6, 1 ], [ 6, 4 ], [ 9, 6 ], [ 10, 17 ], [ 10, 13 ], [ 11, 15 ], [ 13, 12 ], [ 13, 19 ], [ 14, 18 ], [ 16, 11 ], [ 16, 14 ], [ 19, 16 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Iris knows Vivian. Justine knows Mason. Eli knows Dwight. Dwight knows Ursula. Desmond knows Lily. Justine knows Duke. Gemma knows Herman. Vivian knows Itzel. Luis knows Evelyn. Evelyn knows Desmond. Luis knows Olive. Evelyn knows Justine. Iris knows Eli. Gemma knows Iris. Vivian knows Bella. Lily knows Odette. Eli knows Byron. Desmond knows Pearl. Which of Odette and Ursula can Luis reach?", "answer": "Odette", "steps": [ "Luis knows Evelyn.", "Evelyn knows Desmond.", "Desmond knows Lily.", "Lily knows Odette." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Luis", "Lily", "Desmond", "Mason", "Olive", "Odette", "Evelyn", "Justine", "Pearl", "Duke", "Gemma", "Dwight", "Eli", "Bella", "Herman", "Ursula", "Iris", "Vivian", "Byron", "Itzel" ], "edges": [ [ 0, 4 ], [ 0, 6 ], [ 1, 5 ], [ 2, 1 ], [ 2, 8 ], [ 6, 2 ], [ 6, 7 ], [ 7, 3 ], [ 7, 9 ], [ 10, 14 ], [ 10, 16 ], [ 11, 15 ], [ 12, 11 ], [ 12, 18 ], [ 16, 12 ], [ 16, 17 ], [ 17, 13 ], [ 17, 19 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Emma knows Diana. Arthur knows Kieran. Leo knows Boyd. Kieran knows Harlan. Diana knows Hadley. Alfred knows Stefan. Keaton knows Olive. Keaton knows Dick. Harlan knows Charles. Gage knows Kyle. Aria knows Marilyn. Gage knows Aria. Keaton knows Arthur. Megan knows Emma. Kyle knows Alfred. Dick knows Leo. Gage knows Megan. Olive knows Annette. Which of Megan and Arthur can Keaton reach?", "answer": "Arthur", "steps": [ "Keaton knows Arthur." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Keaton", "Arthur", "Harlan", "Boyd", "Charles", "Dick", "Annette", "Kieran", "Olive", "Leo", "Gage", "Megan", "Diana", "Stefan", "Hadley", "Kyle", "Marilyn", "Emma", "Aria", "Alfred" ], "edges": [ [ 0, 1 ], [ 0, 8 ], [ 0, 5 ], [ 1, 7 ], [ 2, 4 ], [ 5, 9 ], [ 7, 2 ], [ 8, 6 ], [ 9, 3 ], [ 10, 11 ], [ 10, 18 ], [ 10, 15 ], [ 11, 17 ], [ 12, 14 ], [ 15, 19 ], [ 17, 12 ], [ 18, 16 ], [ 19, 13 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Rita knows Olive. Malik knows Reid. Emma knows Theodore. Tara knows Marie. Marie knows Rita. Reid knows Damien. Corey knows Samantha. Samantha knows Malik. Tara knows Nolan. Rita knows Troy. Reid knows Edgar. Samantha knows Emma. Howard knows Tara. Troy knows Kennedy. Nolan knows Vanessa. Edgar knows Elijah. Emma knows Ezra. Nolan knows Adele. Which of Tara and Samantha can Howard reach?", "answer": "Tara", "steps": [ "Howard knows Tara." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Howard", "Rita", "Tara", "Nolan", "Marie", "Vanessa", "Adele", "Olive", "Kennedy", "Troy", "Corey", "Reid", "Samantha", "Emma", "Malik", "Theodore", "Ezra", "Damien", "Elijah", "Edgar" ], "edges": [ [ 0, 2 ], [ 1, 7 ], [ 1, 9 ], [ 2, 3 ], [ 2, 4 ], [ 3, 5 ], [ 3, 6 ], [ 4, 1 ], [ 9, 8 ], [ 10, 12 ], [ 11, 17 ], [ 11, 19 ], [ 12, 13 ], [ 12, 14 ], [ 13, 15 ], [ 13, 16 ], [ 14, 11 ], [ 19, 18 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Karen knows Doris. Clinton knows Troy. Troy knows Luke. Elizabeth knows Paige. Faye knows Uma. Paige knows Alex. Faye knows Harold. Karen knows Julian. Harold knows Angelica. Alex knows Clinton. Clinton knows Karen. Wilma knows Bart. Bart knows Harlan. Uma knows Jermaine. Marvin knows Catherine. Doris knows Marlene. Uma knows Marvin. Harlan knows Faye. Which of Bart and Paige can Elizabeth reach?", "answer": "Paige", "steps": [ "Elizabeth knows Paige." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Elizabeth", "Clinton", "Marlene", "Julian", "Alex", "Doris", "Karen", "Paige", "Luke", "Troy", "Wilma", "Faye", "Catherine", "Jermaine", "Harlan", "Marvin", "Uma", "Bart", "Angelica", "Harold" ], "edges": [ [ 0, 7 ], [ 1, 6 ], [ 1, 9 ], [ 4, 1 ], [ 5, 2 ], [ 6, 3 ], [ 6, 5 ], [ 7, 4 ], [ 9, 8 ], [ 10, 17 ], [ 11, 16 ], [ 11, 19 ], [ 14, 11 ], [ 15, 12 ], [ 16, 13 ], [ 16, 15 ], [ 17, 14 ], [ 19, 18 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Heidi knows Lucia. Marcus knows Joy. Mark knows Rita. Keaton knows Lyle. Lyle knows Ross. Ida knows Fletcher. Erwin knows Dolores. Brittany knows Irving. Leigh knows Oliver. Garland knows Brittany. Erwin knows Leigh. Dolores knows Milo. Milo knows Marcus. Lucia knows Keaton. Keaton knows Ida. Irving knows Erwin. Milton knows Heidi. Ross knows Mark. Which of Dolores and Lyle can Milton reach?", "answer": "Lyle", "steps": [ "Milton knows Heidi.", "Heidi knows Lucia.", "Lucia knows Keaton.", "Keaton knows Lyle." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Milton", "Heidi", "Ross", "Mark", "Fletcher", "Lyle", "Rita", "Lucia", "Keaton", "Ida", "Garland", "Brittany", "Milo", "Marcus", "Oliver", "Dolores", "Joy", "Irving", "Erwin", "Leigh" ], "edges": [ [ 0, 1 ], [ 1, 7 ], [ 2, 3 ], [ 3, 6 ], [ 5, 2 ], [ 7, 8 ], [ 8, 5 ], [ 8, 9 ], [ 9, 4 ], [ 10, 11 ], [ 11, 17 ], [ 12, 13 ], [ 13, 16 ], [ 15, 12 ], [ 17, 18 ], [ 18, 15 ], [ 18, 19 ], [ 19, 14 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Floyd knows Gloria. Gloria knows Gabriel. Jenny knows Bruce. Jorge knows Dahlia. Anastasia knows Tessa. Bruce knows Damian. Justin knows Jeffery. Gabriel knows Virginia. Floyd knows Marc. Bruce knows Dawn. Yvonne knows Jenny. Marc knows Pierce. Gabriel knows Hope. Kate knows Floyd. Yvonne knows Justin. Anastasia knows Yvonne. Tessa knows Duke. Kate knows Jorge. Which of Gloria and Jenny can Anastasia reach?", "answer": "Jenny", "steps": [ "Anastasia knows Yvonne.", "Yvonne knows Jenny." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Anastasia", "Yvonne", "Damian", "Tessa", "Duke", "Bruce", "Justin", "Jenny", "Jeffery", "Dawn", "Kate", "Floyd", "Hope", "Jorge", "Dahlia", "Gabriel", "Marc", "Gloria", "Pierce", "Virginia" ], "edges": [ [ 0, 3 ], [ 0, 1 ], [ 1, 6 ], [ 1, 7 ], [ 3, 4 ], [ 5, 2 ], [ 5, 9 ], [ 6, 8 ], [ 7, 5 ], [ 10, 13 ], [ 10, 11 ], [ 11, 16 ], [ 11, 17 ], [ 13, 14 ], [ 15, 12 ], [ 15, 19 ], [ 16, 18 ], [ 17, 15 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Inez knows Yolanda. Demetrius knows Eve. Demetrius knows Linda. Latoya knows Graeme. Linda knows Crystal. Matthew knows Annie. Penny knows Jarvis. Linda knows Laura. Maya knows Penny. Annie knows Jeffery. Yolanda knows Erma. Leticia knows Kylie. Eve knows Leticia. Penny knows Julian. Wilbur knows Latoya. Laura knows Inez. Jarvis knows Matthew. Maya knows Wilbur. Which of Annie and Yolanda can Maya reach?", "answer": "Annie", "steps": [ "Maya knows Penny.", "Penny knows Jarvis.", "Jarvis knows Matthew.", "Matthew knows Annie." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Maya", "Jarvis", "Wilbur", "Matthew", "Penny", "Jeffery", "Annie", "Graeme", "Julian", "Latoya", "Demetrius", "Laura", "Eve", "Inez", "Linda", "Erma", "Yolanda", "Kylie", "Crystal", "Leticia" ], "edges": [ [ 0, 4 ], [ 0, 2 ], [ 1, 3 ], [ 2, 9 ], [ 3, 6 ], [ 4, 1 ], [ 4, 8 ], [ 6, 5 ], [ 9, 7 ], [ 10, 14 ], [ 10, 12 ], [ 11, 13 ], [ 12, 19 ], [ 13, 16 ], [ 14, 11 ], [ 14, 18 ], [ 16, 15 ], [ 19, 17 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Jose knows Ross. Layla knows Clyde. Corinne knows Julia. Lars knows Jose. Dahlia knows Melissa. Yuki knows Lars. Tessa knows Dahlia. Lars knows Layla. Curtis knows Isla. Amelia knows Tessa. Julia knows Yolanda. Ross knows Carlos. Carlos knows Corinne. Isla knows Amanda. Lamar knows Curtis. Brandon knows Clement. Melissa knows Brandon. Curtis knows Amelia. Which of Tessa and Ross can Yuki reach?", "answer": "Ross", "steps": [ "Yuki knows Lars.", "Lars knows Jose.", "Jose knows Ross." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Yuki", "Carlos", "Julia", "Ross", "Lars", "Yolanda", "Corinne", "Jose", "Clyde", "Layla", "Lamar", "Dahlia", "Brandon", "Tessa", "Curtis", "Clement", "Melissa", "Amelia", "Amanda", "Isla" ], "edges": [ [ 0, 4 ], [ 1, 6 ], [ 2, 5 ], [ 3, 1 ], [ 4, 7 ], [ 4, 9 ], [ 6, 2 ], [ 7, 3 ], [ 9, 8 ], [ 10, 14 ], [ 11, 16 ], [ 12, 15 ], [ 13, 11 ], [ 14, 17 ], [ 14, 19 ], [ 16, 12 ], [ 17, 13 ], [ 19, 18 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Elton knows Keira. Gregory knows Fritz. Glen knows Austin. Shaun knows Elton. Keira knows Rocco. Hazel knows Shaun. Blake knows August. Shaun knows Emily. Celeste knows Houston. Barry knows Israel. Rosa knows Celeste. Bennett knows Bob. Gregory knows Blake. Fritz knows Drake. Houston knows Bennett. Bennett knows Gregory. Elton knows Barry. Austin knows Hazel. Which of Israel and Drake can Glen reach?", "answer": "Israel", "steps": [ "Glen knows Austin.", "Austin knows Hazel.", "Hazel knows Shaun.", "Shaun knows Elton.", "Elton knows Barry.", "Barry knows Israel." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Glen", "Hazel", "Austin", "Israel", "Rocco", "Elton", "Shaun", "Barry", "Emily", "Keira", "Rosa", "Houston", "Celeste", "Drake", "August", "Gregory", "Bennett", "Fritz", "Bob", "Blake" ], "edges": [ [ 0, 2 ], [ 1, 6 ], [ 2, 1 ], [ 5, 7 ], [ 5, 9 ], [ 6, 8 ], [ 6, 5 ], [ 7, 3 ], [ 9, 4 ], [ 10, 12 ], [ 11, 16 ], [ 12, 11 ], [ 15, 17 ], [ 15, 19 ], [ 16, 18 ], [ 16, 15 ], [ 17, 13 ], [ 19, 14 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Arden knows Jason. Fritz knows Carlton. Fritz knows Clarence. Chad knows Virginia. Jason knows Chad. Dwight knows Dustin. Hugo knows Colby. Clarence knows Eleanor. Dustin knows Vincent. Carlton knows Kingsley. Colby knows Brock. Hugo knows Devon. Vincent knows Arturo. Vincent knows Hugo. Vincent knows Eve. Chad knows Fritz. Devon knows Jasmine. Chad knows Caroline. Which of Carlton and Colby can Arden reach?", "answer": "Carlton", "steps": [ "Arden knows Jason.", "Jason knows Chad.", "Chad knows Fritz.", "Fritz knows Carlton." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Arden", "Carlton", "Jason", "Caroline", "Eleanor", "Clarence", "Virginia", "Chad", "Kingsley", "Fritz", "Dwight", "Colby", "Dustin", "Eve", "Jasmine", "Devon", "Arturo", "Vincent", "Brock", "Hugo" ], "edges": [ [ 0, 2 ], [ 1, 8 ], [ 2, 7 ], [ 5, 4 ], [ 7, 3 ], [ 7, 6 ], [ 7, 9 ], [ 9, 5 ], [ 9, 1 ], [ 10, 12 ], [ 11, 18 ], [ 12, 17 ], [ 15, 14 ], [ 17, 13 ], [ 17, 16 ], [ 17, 19 ], [ 19, 15 ], [ 19, 11 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Arden knows Wendy. Herman knows Andre. Dawn knows Jacob. Bert knows Clarissa. Damien knows Faith. Elise knows Dawn. Dawn knows Selena. Clarissa knows Harper. Bert knows Arden. Justine knows Darwin. Trevor knows Justine. Wendy knows Claudia. Elise knows Hector. Trevor knows Damien. Faith knows Elise. Claudia knows Ernie. Claudia knows Herman. Herman knows Priscilla. Which of Dawn and Herman can Bert reach?", "answer": "Herman", "steps": [ "Bert knows Arden.", "Arden knows Wendy.", "Wendy knows Claudia.", "Claudia knows Herman." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Bert", "Clarissa", "Claudia", "Wendy", "Ernie", "Andre", "Priscilla", "Harper", "Herman", "Arden", "Trevor", "Justine", "Elise", "Faith", "Hector", "Selena", "Jacob", "Darwin", "Dawn", "Damien" ], "edges": [ [ 0, 1 ], [ 0, 9 ], [ 1, 7 ], [ 2, 4 ], [ 2, 8 ], [ 3, 2 ], [ 8, 5 ], [ 8, 6 ], [ 9, 3 ], [ 10, 11 ], [ 10, 19 ], [ 11, 17 ], [ 12, 14 ], [ 12, 18 ], [ 13, 12 ], [ 18, 15 ], [ 18, 16 ], [ 19, 13 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Wade knows Preston. Lee knows Allan. Lee knows Fabian. Kent knows Ida. Preston knows Clement. Jacques knows Kim. Fabian knows Tessa. Ben knows Billy. Nell knows Jacques. Ida knows Alfonso. Jacques knows Wade. Nell knows Ben. Allan knows Darcy. Ursula knows Kent. Billy knows Gail. Ursula knows Lee. Tessa knows Chance. Kim knows Bernadette. Which of Preston and Tessa can Ursula reach?", "answer": "Tessa", "steps": [ "Ursula knows Lee.", "Lee knows Fabian.", "Fabian knows Tessa." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Ursula", "Ida", "Fabian", "Chance", "Kent", "Lee", "Alfonso", "Tessa", "Darcy", "Allan", "Nell", "Billy", "Wade", "Clement", "Ben", "Jacques", "Gail", "Preston", "Bernadette", "Kim" ], "edges": [ [ 0, 4 ], [ 0, 5 ], [ 1, 6 ], [ 2, 7 ], [ 4, 1 ], [ 5, 2 ], [ 5, 9 ], [ 7, 3 ], [ 9, 8 ], [ 10, 14 ], [ 10, 15 ], [ 11, 16 ], [ 12, 17 ], [ 14, 11 ], [ 15, 12 ], [ 15, 19 ], [ 17, 13 ], [ 19, 18 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Cole knows Deanna. Heather knows Anthony. Lawrence knows Cole. Odette knows Harry. Rachel knows Valerie. Harry knows Rachel. Valerie knows Brittany. Carl knows Ramon. Cole knows Carl. Anthony knows Lawrence. Dewey knows Ebony. Ebony knows Odette. Rachel knows Jodi. Valerie knows Kate. Valerie knows Annette. Taylor knows Heather. Carl knows Madeline. Carl knows Marlene. Which of Marlene and Kate can Dewey reach?", "answer": "Kate", "steps": [ "Dewey knows Ebony.", "Ebony knows Odette.", "Odette knows Harry.", "Harry knows Rachel.", "Rachel knows Valerie.", "Valerie knows Kate." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Dewey", "Odette", "Annette", "Valerie", "Harry", "Rachel", "Ebony", "Jodi", "Brittany", "Kate", "Taylor", "Anthony", "Madeline", "Carl", "Lawrence", "Cole", "Heather", "Deanna", "Ramon", "Marlene" ], "edges": [ [ 0, 6 ], [ 1, 4 ], [ 3, 2 ], [ 3, 8 ], [ 3, 9 ], [ 4, 5 ], [ 5, 7 ], [ 5, 3 ], [ 6, 1 ], [ 10, 16 ], [ 11, 14 ], [ 13, 12 ], [ 13, 18 ], [ 13, 19 ], [ 14, 15 ], [ 15, 17 ], [ 15, 13 ], [ 16, 11 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Dean knows Geneva. Grant knows Tanya. Destiny knows Alyson. Annie knows Dustin. Tanya knows Ford. Paula knows Rachel. Randy knows Delilah. Destiny knows Melody. Ford knows Paul. Dina knows Grant. Luis knows Annie. Rachel knows Randy. Dina knows Gregory. Randy knows Christopher. Ford knows Norma. Annie knows Paula. Melody knows Dina. Dean knows Luis. Which of Rachel and Tanya can Destiny reach?", "answer": "Tanya", "steps": [ "Destiny knows Melody.", "Melody knows Dina.", "Dina knows Grant.", "Grant knows Tanya." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Destiny", "Ford", "Melody", "Gregory", "Norma", "Paul", "Grant", "Dina", "Alyson", "Tanya", "Dean", "Randy", "Luis", "Dustin", "Delilah", "Christopher", "Paula", "Annie", "Geneva", "Rachel" ], "edges": [ [ 0, 8 ], [ 0, 2 ], [ 1, 4 ], [ 1, 5 ], [ 2, 7 ], [ 6, 9 ], [ 7, 3 ], [ 7, 6 ], [ 9, 1 ], [ 10, 18 ], [ 10, 12 ], [ 11, 14 ], [ 11, 15 ], [ 12, 17 ], [ 16, 19 ], [ 17, 13 ], [ 17, 16 ], [ 19, 11 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Virginia knows Bonnie. Anton knows Wilson. Eloise knows Sara. Percy knows Amy. Glenn knows Virginia. Eloise knows Doris. Josie knows Eloise. Daria knows Erma. Anton knows Evelyn. Percy knows Jill. Sara knows Langston. Virginia knows Preston. Daria knows Percy. Daria knows Brenda. Langston knows Hope. Preston knows Daria. Langston knows Anton. Langston knows Trevor. Which of Sara and Preston can Josie reach?", "answer": "Sara", "steps": [ "Josie knows Eloise.", "Eloise knows Sara." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Josie", "Doris", "Trevor", "Eloise", "Wilson", "Langston", "Anton", "Hope", "Sara", "Evelyn", "Glenn", "Bonnie", "Erma", "Virginia", "Amy", "Daria", "Percy", "Brenda", "Preston", "Jill" ], "edges": [ [ 0, 3 ], [ 3, 1 ], [ 3, 8 ], [ 5, 2 ], [ 5, 7 ], [ 5, 6 ], [ 6, 4 ], [ 6, 9 ], [ 8, 5 ], [ 10, 13 ], [ 13, 11 ], [ 13, 18 ], [ 15, 12 ], [ 15, 17 ], [ 15, 16 ], [ 16, 14 ], [ 16, 19 ], [ 18, 15 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Cole knows Deanna. Heather knows Anthony. Lawrence knows Cole. Odette knows Harry. Rachel knows Valerie. Harry knows Rachel. Valerie knows Brittany. Carl knows Ramon. Cole knows Carl. Anthony knows Lawrence. Dewey knows Ebony. Ebony knows Odette. Rachel knows Jodi. Valerie knows Kate. Valerie knows Annette. Taylor knows Heather. Carl knows Madeline. Carl knows Marlene. Which of Valerie and Carl can Dewey reach?", "answer": "Valerie", "steps": [ "Dewey knows Ebony.", "Ebony knows Odette.", "Odette knows Harry.", "Harry knows Rachel.", "Rachel knows Valerie." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Dewey", "Odette", "Annette", "Valerie", "Harry", "Rachel", "Ebony", "Jodi", "Brittany", "Kate", "Taylor", "Anthony", "Madeline", "Carl", "Lawrence", "Cole", "Heather", "Deanna", "Ramon", "Marlene" ], "edges": [ [ 0, 6 ], [ 1, 4 ], [ 3, 2 ], [ 3, 8 ], [ 3, 9 ], [ 4, 5 ], [ 5, 7 ], [ 5, 3 ], [ 6, 1 ], [ 10, 16 ], [ 11, 14 ], [ 13, 12 ], [ 13, 18 ], [ 13, 19 ], [ 14, 15 ], [ 15, 17 ], [ 15, 13 ], [ 16, 11 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Curtis knows Kenneth. Benjamin knows Larry. Jared knows Chance. Richard knows Marcia. Juan knows Benjamin. Hayley knows Kent. Jacob knows Curtis. Chance knows Abigail. Kenneth knows Shawn. Juan knows Horace. Shawn knows Richard. Kenneth knows Zoe. Catherine knows Joan. Juan knows Hayley. Curtis knows Marian. Curtis knows Catherine. Hayley knows Jared. Julie knows Juan. Which of Shawn and Jared can Jacob reach?", "answer": "Shawn", "steps": [ "Jacob knows Curtis.", "Curtis knows Kenneth.", "Kenneth knows Shawn." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Jacob", "Marian", "Shawn", "Richard", "Curtis", "Marcia", "Kenneth", "Catherine", "Zoe", "Joan", "Julie", "Horace", "Jared", "Chance", "Juan", "Abigail", "Hayley", "Benjamin", "Kent", "Larry" ], "edges": [ [ 0, 4 ], [ 2, 3 ], [ 3, 5 ], [ 4, 1 ], [ 4, 6 ], [ 4, 7 ], [ 6, 2 ], [ 6, 8 ], [ 7, 9 ], [ 10, 14 ], [ 12, 13 ], [ 13, 15 ], [ 14, 11 ], [ 14, 16 ], [ 14, 17 ], [ 16, 12 ], [ 16, 18 ], [ 17, 19 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Trina knows Martin. Ruby knows Christina. Christina knows Ariel. Enrique knows Celia. Enrique knows Arnold. Jermaine knows Andre. Arnold knows Tonya. Malik knows Enrique. Eric knows Edwin. Christina knows Tara. Ariel knows Eric. Kenneth knows Lynn. Tonya knows Cornelius. Dolly knows Pat. Tara knows Jermaine. Cornelius knows Trina. Celia knows Kenneth. Andre knows Dolly. Which of Enrique and Christina can Malik reach?", "answer": "Enrique", "steps": [ "Malik knows Enrique." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Malik", "Lynn", "Celia", "Kenneth", "Cornelius", "Arnold", "Enrique", "Trina", "Martin", "Tonya", "Ruby", "Edwin", "Ariel", "Eric", "Andre", "Tara", "Christina", "Dolly", "Pat", "Jermaine" ], "edges": [ [ 0, 6 ], [ 2, 3 ], [ 3, 1 ], [ 4, 7 ], [ 5, 9 ], [ 6, 2 ], [ 6, 5 ], [ 7, 8 ], [ 9, 4 ], [ 10, 16 ], [ 12, 13 ], [ 13, 11 ], [ 14, 17 ], [ 15, 19 ], [ 16, 12 ], [ 16, 15 ], [ 17, 18 ], [ 19, 14 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Burt knows Beth. Langston knows Jamie. Ford knows Kelly. Enrique knows Langston. Langston knows Whitney. Jamie knows Anita. Eunice knows Robin. Langston knows Dakota. Enrique knows Adelaide. Anita knows Burt. Kelly knows Eunice. Jamie knows Belinda. Eunice knows Ilene. Ilene knows Sue. Ford knows Bob. Sue knows Harold. Kelly knows Jem. Kelly knows Nora. Which of Kelly and Langston can Ford reach?", "answer": "Kelly", "steps": [ "Ford knows Kelly." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Ford", "Harold", "Eunice", "Nora", "Jem", "Kelly", "Bob", "Ilene", "Robin", "Sue", "Enrique", "Beth", "Jamie", "Whitney", "Dakota", "Langston", "Adelaide", "Anita", "Belinda", "Burt" ], "edges": [ [ 0, 6 ], [ 0, 5 ], [ 2, 8 ], [ 2, 7 ], [ 5, 3 ], [ 5, 4 ], [ 5, 2 ], [ 7, 9 ], [ 9, 1 ], [ 10, 16 ], [ 10, 15 ], [ 12, 18 ], [ 12, 17 ], [ 15, 13 ], [ 15, 14 ], [ 15, 12 ], [ 17, 19 ], [ 19, 11 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Natalie knows Trina. Philip knows Kelsey. Xander knows Lawson. Charles knows Harmony. Harris knows Gareth. Kelsey knows Natalie. Antonio knows Gonzalo. Veronica knows Daria. Philip knows Veronica. Kelsey knows Blake. Charles knows Joaquin. Lawson knows Alice. Trina knows Michelle. Harris knows Philip. Harmony knows Antonio. Alice knows Perry. Xander knows Heath. Lawson knows Charles. Which of Natalie and Harmony can Harris reach?", "answer": "Natalie", "steps": [ "Harris knows Philip.", "Philip knows Kelsey.", "Kelsey knows Natalie." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Harris", "Philip", "Daria", "Veronica", "Trina", "Blake", "Gareth", "Kelsey", "Natalie", "Michelle", "Xander", "Lawson", "Perry", "Alice", "Antonio", "Joaquin", "Heath", "Charles", "Harmony", "Gonzalo" ], "edges": [ [ 0, 6 ], [ 0, 1 ], [ 1, 3 ], [ 1, 7 ], [ 3, 2 ], [ 4, 9 ], [ 7, 5 ], [ 7, 8 ], [ 8, 4 ], [ 10, 16 ], [ 10, 11 ], [ 11, 13 ], [ 11, 17 ], [ 13, 12 ], [ 14, 19 ], [ 17, 15 ], [ 17, 18 ], [ 18, 14 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Imogen knows William. Daisy knows Cameron. Cameron knows Tina. Nelson knows Winston. Lorenzo knows Fabian. Leigh knows Daisy. Ibrahim knows Lucy. Imogen knows Declan. Fabian knows Imogen. Cameron knows Christopher. Cameron knows Lorenzo. Rosemary knows Ibrahim. Winston knows Molly. Molly knows Damien. Ibrahim knows Ted. Ibrahim knows Nelson. Damian knows Rosemary. Molly knows Scott. Which of Declan and Scott can Damian reach?", "answer": "Scott", "steps": [ "Damian knows Rosemary.", "Rosemary knows Ibrahim.", "Ibrahim knows Nelson.", "Nelson knows Winston.", "Winston knows Molly.", "Molly knows Scott." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Damian", "Ibrahim", "Scott", "Ted", "Winston", "Nelson", "Molly", "Rosemary", "Damien", "Lucy", "Leigh", "Cameron", "Declan", "Tina", "Fabian", "Lorenzo", "Imogen", "Daisy", "William", "Christopher" ], "edges": [ [ 0, 7 ], [ 1, 3 ], [ 1, 5 ], [ 1, 9 ], [ 4, 6 ], [ 5, 4 ], [ 6, 2 ], [ 6, 8 ], [ 7, 1 ], [ 10, 17 ], [ 11, 13 ], [ 11, 15 ], [ 11, 19 ], [ 14, 16 ], [ 15, 14 ], [ 16, 12 ], [ 16, 18 ], [ 17, 11 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Dick knows Kirsten. Wendell knows Darren. Darren knows Isiah. Dolores knows Teresa. Dolores knows Bernadette. Alyson knows Nicholas. Clark knows Malcolm. Nicholas knows Ignacio. Christopher knows Clark. Teresa knows Carrie. Malcolm knows Lars. Clark knows Perry. Kirsten knows Wendell. Ignacio knows Dick. Wendell knows Nash. Lamar knows Dolores. Lars knows Lamar. Nicholas knows Layla. Which of Ignacio and Malcolm can Christopher reach?", "answer": "Malcolm", "steps": [ "Christopher knows Clark.", "Clark knows Malcolm." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Christopher", "Malcolm", "Lamar", "Dolores", "Bernadette", "Teresa", "Clark", "Perry", "Lars", "Carrie", "Alyson", "Ignacio", "Kirsten", "Wendell", "Nash", "Darren", "Nicholas", "Layla", "Dick", "Isiah" ], "edges": [ [ 0, 6 ], [ 1, 8 ], [ 2, 3 ], [ 3, 4 ], [ 3, 5 ], [ 5, 9 ], [ 6, 7 ], [ 6, 1 ], [ 8, 2 ], [ 10, 16 ], [ 11, 18 ], [ 12, 13 ], [ 13, 14 ], [ 13, 15 ], [ 15, 19 ], [ 16, 17 ], [ 16, 11 ], [ 18, 12 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Courtney knows Selena. Stacy knows Vance. Marlene knows Colette. Ernie knows Peggy. Louis knows Edna. Selena knows Hector. Colette knows Marian. Peggy knows Stacy. Yasmin knows Enid. Dewey knows Courtney. Vance knows Hugh. Daphne knows Iris. Hector knows Audrey. Edna knows Ted. Audrey knows Marlene. Peggy knows Daphne. Ted knows Ernie. Audrey knows Yasmin. Which of Edna and Courtney can Dewey reach?", "answer": "Courtney", "steps": [ "Dewey knows Courtney." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Dewey", "Hector", "Marian", "Yasmin", "Selena", "Colette", "Enid", "Audrey", "Courtney", "Marlene", "Louis", "Ernie", "Hugh", "Daphne", "Ted", "Vance", "Iris", "Peggy", "Edna", "Stacy" ], "edges": [ [ 0, 8 ], [ 1, 7 ], [ 3, 6 ], [ 4, 1 ], [ 5, 2 ], [ 7, 3 ], [ 7, 9 ], [ 8, 4 ], [ 9, 5 ], [ 10, 18 ], [ 11, 17 ], [ 13, 16 ], [ 14, 11 ], [ 15, 12 ], [ 17, 13 ], [ 17, 19 ], [ 18, 14 ], [ 19, 15 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Rosemary knows Maria. William knows Tiffany. Georgia knows Ricardo. Ricardo knows Sadie. Mitchell knows Rosemary. Zack knows William. Sadie knows Colby. Ricardo knows Leigh. Rosemary knows Zack. William knows Miles. Victoria knows Dallas. Duncan knows Victoria. Victoria knows Georgia. Victoria knows Clarissa. Olivia knows Mitchell. Paula knows Duncan. Rosemary knows Garrison. Miles knows Anna. Which of Sadie and Miles can Olivia reach?", "answer": "Miles", "steps": [ "Olivia knows Mitchell.", "Mitchell knows Rosemary.", "Rosemary knows Zack.", "Zack knows William.", "William knows Miles." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Olivia", "Mitchell", "Anna", "Zack", "William", "Rosemary", "Tiffany", "Miles", "Maria", "Garrison", "Paula", "Duncan", "Colby", "Georgia", "Ricardo", "Victoria", "Leigh", "Sadie", "Clarissa", "Dallas" ], "edges": [ [ 0, 1 ], [ 1, 5 ], [ 3, 4 ], [ 4, 6 ], [ 4, 7 ], [ 5, 3 ], [ 5, 8 ], [ 5, 9 ], [ 7, 2 ], [ 10, 11 ], [ 11, 15 ], [ 13, 14 ], [ 14, 16 ], [ 14, 17 ], [ 15, 13 ], [ 15, 18 ], [ 15, 19 ], [ 17, 12 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Gemma knows Greta. Annette knows Logan. Bruce knows Gemma. Stephanie knows Dale. Mark knows Myrtle. Greta knows Jacqueline. Erica knows Bruce. Annette knows Sam. Haley knows Audrey. Audrey knows Alicia. Sam knows Stephanie. Wade knows Opal. Wade knows Veronica. Alicia knows Erica. Veronica knows Mark. Dale knows Wade. Bruce knows Ford. Haley knows Andrea. Which of Erica and Dale can Haley reach?", "answer": "Erica", "steps": [ "Haley knows Audrey.", "Audrey knows Alicia.", "Alicia knows Erica." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Haley", "Audrey", "Greta", "Andrea", "Gemma", "Ford", "Bruce", "Jacqueline", "Alicia", "Erica", "Annette", "Sam", "Mark", "Logan", "Veronica", "Opal", "Wade", "Myrtle", "Stephanie", "Dale" ], "edges": [ [ 0, 3 ], [ 0, 1 ], [ 1, 8 ], [ 2, 7 ], [ 4, 2 ], [ 6, 5 ], [ 6, 4 ], [ 8, 9 ], [ 9, 6 ], [ 10, 13 ], [ 10, 11 ], [ 11, 18 ], [ 12, 17 ], [ 14, 12 ], [ 16, 15 ], [ 16, 14 ], [ 18, 19 ], [ 19, 16 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Cassidy knows Xavier. Brett knows Flora. Axel knows Yvonne. Yvonne knows Ingrid. Luther knows Julie. James knows George. George knows Axel. Rocco knows Cassidy. Miranda knows Teresa. Flora knows Darcy. Itzel knows Rocco. Darcy knows Autumn. Itzel knows Brett. Merle knows Miranda. Bella knows James. Bella knows Merle. Teresa knows Holden. Xavier knows Luther. Which of Axel and Xavier can Itzel reach?", "answer": "Xavier", "steps": [ "Itzel knows Rocco.", "Rocco knows Cassidy.", "Cassidy knows Xavier." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Itzel", "Brett", "Luther", "Julie", "Cassidy", "Autumn", "Darcy", "Rocco", "Xavier", "Flora", "Bella", "Merle", "Yvonne", "Ingrid", "George", "Holden", "Teresa", "James", "Axel", "Miranda" ], "edges": [ [ 0, 7 ], [ 0, 1 ], [ 1, 9 ], [ 2, 3 ], [ 4, 8 ], [ 6, 5 ], [ 7, 4 ], [ 8, 2 ], [ 9, 6 ], [ 10, 17 ], [ 10, 11 ], [ 11, 19 ], [ 12, 13 ], [ 14, 18 ], [ 16, 15 ], [ 17, 14 ], [ 18, 12 ], [ 19, 16 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Drake knows Kai. Dante knows Tessa. Lennox knows Christian. Wendell knows Dante. Sylvia knows Drake. Drake knows Felicia. Sylvia knows Hayley. Christina knows Stephen. Wendell knows Barbara. Louise knows Fraser. Drake knows Rebecca. Wendell knows Ellis. Barbara knows Christina. Victor knows Wendell. Wendell knows Gary. Kai knows Lennox. Drake knows Louise. Victor knows Jim. Which of Wendell and Drake can Sylvia reach?", "answer": "Drake", "steps": [ "Sylvia knows Drake." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Sylvia", "Louise", "Drake", "Kai", "Hayley", "Christian", "Lennox", "Felicia", "Fraser", "Rebecca", "Victor", "Dante", "Wendell", "Barbara", "Jim", "Stephen", "Christina", "Gary", "Tessa", "Ellis" ], "edges": [ [ 0, 4 ], [ 0, 2 ], [ 1, 8 ], [ 2, 3 ], [ 2, 7 ], [ 2, 1 ], [ 2, 9 ], [ 3, 6 ], [ 6, 5 ], [ 10, 14 ], [ 10, 12 ], [ 11, 18 ], [ 12, 13 ], [ 12, 17 ], [ 12, 11 ], [ 12, 19 ], [ 13, 16 ], [ 16, 15 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Kara knows Malcolm. Cate knows Vanessa. Anita knows Hilda. Alejandro knows Grady. Jordan knows Houston. Conner knows Sheila. Hilda knows Felix. Eamon knows Cate. Grady knows Conner. Eamon knows Roy. Roy knows Darius. Houston knows Alejandro. Vanessa knows Randall. Hugo knows Anita. Roy knows Hugo. Malcolm knows Cordelia. Houston knows Clark. Jordan knows Kara. Which of Roy and Houston can Eamon reach?", "answer": "Roy", "steps": [ "Eamon knows Roy." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Eamon", "Felix", "Hilda", "Cate", "Anita", "Darius", "Hugo", "Roy", "Vanessa", "Randall", "Jordan", "Sheila", "Conner", "Kara", "Grady", "Clark", "Alejandro", "Houston", "Malcolm", "Cordelia" ], "edges": [ [ 0, 7 ], [ 0, 3 ], [ 2, 1 ], [ 3, 8 ], [ 4, 2 ], [ 6, 4 ], [ 7, 5 ], [ 7, 6 ], [ 8, 9 ], [ 10, 17 ], [ 10, 13 ], [ 12, 11 ], [ 13, 18 ], [ 14, 12 ], [ 16, 14 ], [ 17, 15 ], [ 17, 16 ], [ 18, 19 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Eve knows Glen. Jolena knows Florence. Frank knows Spencer. Milton knows Lucia. Milton knows Carlos. Beth knows Ursula. Winifred knows Frank. Carlos knows Nicholas. Edmund knows Vanessa. Aisha knows Lucas. Lucas knows Harmony. Edmund knows Eve. Jolena knows Aisha. Beth knows Winifred. Edmund knows Jolena. Edmund knows Darwin. Milton knows Beth. Milton knows Marvin. Which of Lucas and Frank can Milton reach?", "answer": "Frank", "steps": [ "Milton knows Beth.", "Beth knows Winifred.", "Winifred knows Frank." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Milton", "Frank", "Carlos", "Spencer", "Nicholas", "Beth", "Ursula", "Marvin", "Winifred", "Lucia", "Edmund", "Lucas", "Eve", "Harmony", "Glen", "Jolena", "Florence", "Vanessa", "Aisha", "Darwin" ], "edges": [ [ 0, 2 ], [ 0, 7 ], [ 0, 5 ], [ 0, 9 ], [ 1, 3 ], [ 2, 4 ], [ 5, 6 ], [ 5, 8 ], [ 8, 1 ], [ 10, 12 ], [ 10, 17 ], [ 10, 15 ], [ 10, 19 ], [ 11, 13 ], [ 12, 14 ], [ 15, 16 ], [ 15, 18 ], [ 18, 11 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Helene knows Constance. Lorraine knows Annette. Lorraine knows Donna. Helene knows Harrison. Helene knows Kristina. Helene knows Harmony. Harrison knows Winifred. Lorraine knows Humphrey. Annette knows Yara. Donna knows Eleanor. Humphrey knows Nathan. Nathan knows Gideon. Winifred knows Franklin. Harrison knows Belinda. Constance knows Dell. Harmony knows Esperanza. Lorraine knows Clay. Humphrey knows Wayne. Which of Gideon and Franklin can Lorraine reach?", "answer": "Gideon", "steps": [ "Lorraine knows Humphrey.", "Humphrey knows Nathan.", "Nathan knows Gideon." ], "difficulty": 3, "original_distance": 3, "idx_to_symbol": [ "Lorraine", "Gideon", "Donna", "Wayne", "Clay", "Yara", "Annette", "Eleanor", "Humphrey", "Nathan", "Helene", "Franklin", "Harmony", "Belinda", "Kristina", "Dell", "Constance", "Esperanza", "Harrison", "Winifred" ], "edges": [ [ 0, 4 ], [ 0, 6 ], [ 0, 2 ], [ 0, 8 ], [ 2, 7 ], [ 6, 5 ], [ 8, 3 ], [ 8, 9 ], [ 9, 1 ], [ 10, 14 ], [ 10, 16 ], [ 10, 12 ], [ 10, 18 ], [ 12, 17 ], [ 16, 15 ], [ 18, 13 ], [ 18, 19 ], [ 19, 11 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Magdalena knows Daphne. Alma knows Jeremiah. Lois knows Alma. Brian knows Lois. Dee knows Jodi. Marcus knows Ernest. Jennifer knows Marcus. Mildred knows Dee. Brian knows Jennifer. Roland knows Langston. Jodi knows Magdalena. Eli knows Palmer. Kara knows Brian. Mindy knows Roland. Lois knows Eli. Dee knows Mindy. Scott knows Dina. Jodi knows Scott. Which of Magdalena and Eli can Kara reach?", "answer": "Eli", "steps": [ "Kara knows Brian.", "Brian knows Lois.", "Lois knows Eli." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Kara", "Brian", "Eli", "Marcus", "Alma", "Jennifer", "Lois", "Jeremiah", "Ernest", "Palmer", "Mildred", "Dee", "Magdalena", "Roland", "Scott", "Mindy", "Jodi", "Dina", "Langston", "Daphne" ], "edges": [ [ 0, 1 ], [ 1, 5 ], [ 1, 6 ], [ 2, 9 ], [ 3, 8 ], [ 4, 7 ], [ 5, 3 ], [ 6, 4 ], [ 6, 2 ], [ 10, 11 ], [ 11, 15 ], [ 11, 16 ], [ 12, 19 ], [ 13, 18 ], [ 14, 17 ], [ 15, 13 ], [ 16, 14 ], [ 16, 12 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Jodi knows Daniella. Archer knows Trina. Gustavo knows Emma. Archie knows Isadora. Gustavo knows Khashayar. Gustavo knows Archer. Trina knows Harmony. Trina knows Vance. Emma knows Clement. Harmony knows Charles. Isadora knows Haley. Jennifer knows Gavin. Jennifer knows Herman. Isadora knows Arden. Haley knows Skyler. Jennifer knows Archie. Jennifer knows Jodi. Gustavo knows Scott. Which of Isadora and Trina can Gustavo reach?", "answer": "Trina", "steps": [ "Gustavo knows Archer.", "Archer knows Trina." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Gustavo", "Emma", "Khashayar", "Clement", "Trina", "Charles", "Scott", "Archer", "Harmony", "Vance", "Jennifer", "Jodi", "Gavin", "Daniella", "Isadora", "Skyler", "Herman", "Archie", "Haley", "Arden" ], "edges": [ [ 0, 2 ], [ 0, 1 ], [ 0, 6 ], [ 0, 7 ], [ 1, 3 ], [ 4, 8 ], [ 4, 9 ], [ 7, 4 ], [ 8, 5 ], [ 10, 12 ], [ 10, 11 ], [ 10, 16 ], [ 10, 17 ], [ 11, 13 ], [ 14, 18 ], [ 14, 19 ], [ 17, 14 ], [ 18, 15 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Veronica knows Dell. Forrest knows Keegan. Barney knows Claudia. Lara knows Chloe. Dell knows Yvette. Chloe knows Paige. Yvette knows Margaret. Keegan knows Barney. Claudia knows Nina. Hope knows Mason. Courtney knows Hope. Claudia knows Courtney. Forrest knows Lamar. Eva knows Jeff. Jeff knows Veronica. Jeff knows Winston. Yvette knows Lara. Dale knows Forrest. Which of Mason and Paige can Dale reach?", "answer": "Mason", "steps": [ "Dale knows Forrest.", "Forrest knows Keegan.", "Keegan knows Barney.", "Barney knows Claudia.", "Claudia knows Courtney.", "Courtney knows Hope.", "Hope knows Mason." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Dale", "Courtney", "Lamar", "Claudia", "Mason", "Keegan", "Barney", "Hope", "Nina", "Forrest", "Eva", "Lara", "Winston", "Yvette", "Paige", "Veronica", "Dell", "Chloe", "Margaret", "Jeff" ], "edges": [ [ 0, 9 ], [ 1, 7 ], [ 3, 1 ], [ 3, 8 ], [ 5, 6 ], [ 6, 3 ], [ 7, 4 ], [ 9, 2 ], [ 9, 5 ], [ 10, 19 ], [ 11, 17 ], [ 13, 11 ], [ 13, 18 ], [ 15, 16 ], [ 16, 13 ], [ 17, 14 ], [ 19, 12 ], [ 19, 15 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Dwight knows Wendy. Neal knows Caleb. Isla knows Antonio. Katherine knows Colin. Dwight knows Edmund. Edmund knows Ursula. Neal knows Natalie. Annette knows Neal. Desmond knows Dwight. Colin knows Desmond. Lara knows Max. Edmund knows Vanessa. Dwight knows Irving. Antonio knows Annette. Neal knows Lara. Lara knows Tina. Max knows Lewis. Vanessa knows Jonathan. Which of Neal and Dwight can Isla reach?", "answer": "Neal", "steps": [ "Isla knows Antonio.", "Antonio knows Annette.", "Annette knows Neal." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Isla", "Lara", "Caleb", "Annette", "Neal", "Natalie", "Lewis", "Tina", "Max", "Antonio", "Katherine", "Edmund", "Irving", "Desmond", "Dwight", "Wendy", "Jonathan", "Ursula", "Vanessa", "Colin" ], "edges": [ [ 0, 9 ], [ 1, 7 ], [ 1, 8 ], [ 3, 4 ], [ 4, 2 ], [ 4, 5 ], [ 4, 1 ], [ 8, 6 ], [ 9, 3 ], [ 10, 19 ], [ 11, 17 ], [ 11, 18 ], [ 13, 14 ], [ 14, 12 ], [ 14, 15 ], [ 14, 11 ], [ 18, 16 ], [ 19, 13 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Phoebe knows Esperanza. Roger knows Vivian. Esperanza knows Archie. Esperanza knows Harris. Gavin knows Humphrey. Olive knows Abigail. Archie knows Gavin. Lyric knows Walter. Virgil knows Mindy. Imogen knows Lucy. Lucy knows Olive. Harris knows Robert. Mindy knows Lyric. Mindy knows Imogen. Roger knows Phoebe. Jim knows Atlas. Jim knows Virgil. Humphrey knows Jonathan. Which of Virgil and Phoebe can Roger reach?", "answer": "Phoebe", "steps": [ "Roger knows Phoebe." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Roger", "Vivian", "Gavin", "Jonathan", "Archie", "Esperanza", "Phoebe", "Harris", "Humphrey", "Robert", "Jim", "Atlas", "Lucy", "Abigail", "Imogen", "Mindy", "Virgil", "Lyric", "Olive", "Walter" ], "edges": [ [ 0, 1 ], [ 0, 6 ], [ 2, 8 ], [ 4, 2 ], [ 5, 4 ], [ 5, 7 ], [ 6, 5 ], [ 7, 9 ], [ 8, 3 ], [ 10, 11 ], [ 10, 16 ], [ 12, 18 ], [ 14, 12 ], [ 15, 14 ], [ 15, 17 ], [ 16, 15 ], [ 17, 19 ], [ 18, 13 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Nadine knows Ethan. Sebastian knows Howard. Howard knows Adele. Ethan knows Claude. Nadine knows Foster. Hazel knows Bette. Sebastian knows Larry. Justine knows Boris. Zoe knows Leslie. Sebastian knows Mildred. Nadine knows Justine. Zoe knows Sebastian. Zoe knows Gareth. Ethan knows Jasmine. Leslie knows Brynn. Leslie knows Richard. Justine knows Ellen. Justine knows Hazel. Which of Hazel and Howard can Nadine reach?", "answer": "Hazel", "steps": [ "Nadine knows Justine.", "Justine knows Hazel." ], "difficulty": 2, "original_distance": 3, "idx_to_symbol": [ "Nadine", "Boris", "Foster", "Ethan", "Jasmine", "Bette", "Justine", "Ellen", "Hazel", "Claude", "Zoe", "Mildred", "Gareth", "Leslie", "Richard", "Adele", "Sebastian", "Larry", "Howard", "Brynn" ], "edges": [ [ 0, 2 ], [ 0, 6 ], [ 0, 3 ], [ 3, 4 ], [ 3, 9 ], [ 6, 1 ], [ 6, 7 ], [ 6, 8 ], [ 8, 5 ], [ 10, 12 ], [ 10, 16 ], [ 10, 13 ], [ 13, 14 ], [ 13, 19 ], [ 16, 11 ], [ 16, 17 ], [ 16, 18 ], [ 18, 15 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Leah knows Val. Joy knows Leah. Beth knows Kirsten. Leah knows Dennis. Gwen knows Calvin. Daria knows Colleen. Harlan knows Vernon. Val knows Hazel. Cara knows Laurel. Harlan knows Edison. Vernon knows Gwen. Holly knows Joy. Beth knows Daria. Holly knows Leander. Leander knows Lionel. Leander knows Cara. Vernon knows Ralph. Edison knows Beth. Which of Beth and Leah can Harlan reach?", "answer": "Beth", "steps": [ "Harlan knows Edison.", "Edison knows Beth." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Harlan", "Calvin", "Beth", "Edison", "Gwen", "Daria", "Colleen", "Kirsten", "Vernon", "Ralph", "Holly", "Laurel", "Leah", "Joy", "Cara", "Val", "Hazel", "Dennis", "Leander", "Lionel" ], "edges": [ [ 0, 3 ], [ 0, 8 ], [ 2, 5 ], [ 2, 7 ], [ 3, 2 ], [ 4, 1 ], [ 5, 6 ], [ 8, 4 ], [ 8, 9 ], [ 10, 13 ], [ 10, 18 ], [ 12, 15 ], [ 12, 17 ], [ 13, 12 ], [ 14, 11 ], [ 15, 16 ], [ 18, 14 ], [ 18, 19 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Hubert knows Vivian. Victoria knows Becky. Cornelius knows Lark. Alyssa knows Caroline. Dana knows Lorraine. Lark knows Ruth. Allen knows Hendrix. Sebastian knows Victoria. Vivian knows Tabitha. Harris knows Dana. Becky knows Eamon. Eamon knows Alyssa. Lorraine knows Lawrence. Caroline knows Chloe. Lorraine knows Cornelius. Lawrence knows Randy. Alyssa knows Hubert. Hendrix knows Harris. Which of Hubert and Cornelius can Allen reach?", "answer": "Cornelius", "steps": [ "Allen knows Hendrix.", "Hendrix knows Harris.", "Harris knows Dana.", "Dana knows Lorraine.", "Lorraine knows Cornelius." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Allen", "Lawrence", "Cornelius", "Harris", "Lark", "Dana", "Ruth", "Lorraine", "Hendrix", "Randy", "Sebastian", "Caroline", "Hubert", "Becky", "Vivian", "Eamon", "Tabitha", "Alyssa", "Victoria", "Chloe" ], "edges": [ [ 0, 8 ], [ 1, 9 ], [ 2, 4 ], [ 3, 5 ], [ 4, 6 ], [ 5, 7 ], [ 7, 2 ], [ 7, 1 ], [ 8, 3 ], [ 10, 18 ], [ 11, 19 ], [ 12, 14 ], [ 13, 15 ], [ 14, 16 ], [ 15, 17 ], [ 17, 12 ], [ 17, 11 ], [ 18, 13 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Liam knows Eleanor. Gilbert knows Milton. Xander knows India. Tracy knows Liam. Gilbert knows Harvey. Jesse knows Brooke. Evan knows Carlton. Nolan knows Sheryl. Harvey knows Chance. Evan knows Noah. Brooke knows Nolan. Liam knows Fisher. Milton knows Tracy. Evan knows Arden. Alejandro knows Gilbert. Sheryl knows Evan. Liam knows Pat. Brooke knows Xander. Which of Milton and Nolan can Alejandro reach?", "answer": "Milton", "steps": [ "Alejandro knows Gilbert.", "Gilbert knows Milton." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Alejandro", "Gilbert", "Liam", "Pat", "Eleanor", "Chance", "Milton", "Harvey", "Tracy", "Fisher", "Jesse", "Brooke", "Evan", "Noah", "Arden", "India", "Nolan", "Xander", "Sheryl", "Carlton" ], "edges": [ [ 0, 1 ], [ 1, 7 ], [ 1, 6 ], [ 2, 3 ], [ 2, 4 ], [ 2, 9 ], [ 6, 8 ], [ 7, 5 ], [ 8, 2 ], [ 10, 11 ], [ 11, 17 ], [ 11, 16 ], [ 12, 13 ], [ 12, 14 ], [ 12, 19 ], [ 16, 18 ], [ 17, 15 ], [ 18, 12 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Maggie knows Darrell. Willis knows India. Clara knows Joseph. Cassidy knows Clara. India knows Cassidy. Joseph knows Juan. Megan knows Mabel. Mabel knows Carrie. Megan knows Marshall. Joseph knows Alvin. Theodore knows Megan. Theodore knows Jules. Clarissa knows Theodore. Mabel knows Leroy. Cassidy knows Charlene. Clara knows Maggie. Marshall knows Dirk. Riley knows Clarissa. Which of Megan and Clara can Riley reach?", "answer": "Megan", "steps": [ "Riley knows Clarissa.", "Clarissa knows Theodore.", "Theodore knows Megan." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Riley", "Marshall", "Mabel", "Dirk", "Clarissa", "Leroy", "Jules", "Megan", "Carrie", "Theodore", "Willis", "Maggie", "Joseph", "Darrell", "India", "Juan", "Charlene", "Clara", "Alvin", "Cassidy" ], "edges": [ [ 0, 4 ], [ 1, 3 ], [ 2, 5 ], [ 2, 8 ], [ 4, 9 ], [ 7, 1 ], [ 7, 2 ], [ 9, 6 ], [ 9, 7 ], [ 10, 14 ], [ 11, 13 ], [ 12, 15 ], [ 12, 18 ], [ 14, 19 ], [ 17, 11 ], [ 17, 12 ], [ 19, 16 ], [ 19, 17 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Lola knows Tristan. Tristan knows Arthur. Hal knows Sandra. Eleanor knows Hal. Marcus knows Greg. Regina knows Marcus. Aisha knows Chloe. Greg knows Sally. Beth knows Eleanor. Arthur knows Aisha. Ben knows Grace. Sandra knows Peter. Tristan knows Brandon. Peter knows Ray. Grace knows Beth. Sally knows Lola. Ray knows Edwin. Sandra knows Leo. Which of Peter and Arthur can Ben reach?", "answer": "Peter", "steps": [ "Ben knows Grace.", "Grace knows Beth.", "Beth knows Eleanor.", "Eleanor knows Hal.", "Hal knows Sandra.", "Sandra knows Peter." ], "difficulty": 6, "original_distance": 8, "idx_to_symbol": [ "Ben", "Peter", "Edwin", "Ray", "Sandra", "Hal", "Grace", "Eleanor", "Beth", "Leo", "Regina", "Arthur", "Chloe", "Aisha", "Tristan", "Lola", "Marcus", "Sally", "Greg", "Brandon" ], "edges": [ [ 0, 6 ], [ 1, 3 ], [ 3, 2 ], [ 4, 1 ], [ 4, 9 ], [ 5, 4 ], [ 6, 8 ], [ 7, 5 ], [ 8, 7 ], [ 10, 16 ], [ 11, 13 ], [ 13, 12 ], [ 14, 11 ], [ 14, 19 ], [ 15, 14 ], [ 16, 18 ], [ 17, 15 ], [ 18, 17 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Flora knows Lucia. Russell knows Owen. Neal knows Desmond. Zara knows Bonnie. Bonnie knows Dana. Maria knows Flora. Livia knows Katrina. Martin knows Maria. Knox knows Charles. Owen knows Livia. Bonnie knows Allan. Livia knows Peggy. Katrina knows Neal. Knox knows Zara. Desmond knows Will. Dana knows Martin. Russell knows Chelsea. Will knows Colin. Which of Maria and Desmond can Knox reach?", "answer": "Maria", "steps": [ "Knox knows Zara.", "Zara knows Bonnie.", "Bonnie knows Dana.", "Dana knows Martin.", "Martin knows Maria." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Knox", "Flora", "Allan", "Dana", "Bonnie", "Zara", "Maria", "Lucia", "Charles", "Martin", "Russell", "Will", "Peggy", "Katrina", "Livia", "Owen", "Desmond", "Colin", "Chelsea", "Neal" ], "edges": [ [ 0, 8 ], [ 0, 5 ], [ 1, 7 ], [ 3, 9 ], [ 4, 2 ], [ 4, 3 ], [ 5, 4 ], [ 6, 1 ], [ 9, 6 ], [ 10, 18 ], [ 10, 15 ], [ 11, 17 ], [ 13, 19 ], [ 14, 12 ], [ 14, 13 ], [ 15, 14 ], [ 16, 11 ], [ 19, 16 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Josie knows Matt. Darrell knows Clark. Erma knows Kira. Gary knows Dorothy. Jem knows Gary. Harmony knows Josie. Dorothy knows Kristina. Harriet knows Norman. Clark knows Malcolm. Harmony knows Louisa. Matt knows Erma. Norman knows Dorian. Harriet knows Riley. Dorothy knows Vance. Vance knows Darrell. Dorian knows Harmony. Harlan knows Jem. Harlan knows Kelly. Which of Josie and Vance can Harlan reach?", "answer": "Vance", "steps": [ "Harlan knows Jem.", "Jem knows Gary.", "Gary knows Dorothy.", "Dorothy knows Vance." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Harlan", "Clark", "Kelly", "Gary", "Jem", "Vance", "Dorothy", "Malcolm", "Kristina", "Darrell", "Harriet", "Erma", "Riley", "Dorian", "Norman", "Josie", "Harmony", "Kira", "Louisa", "Matt" ], "edges": [ [ 0, 2 ], [ 0, 4 ], [ 1, 7 ], [ 3, 6 ], [ 4, 3 ], [ 5, 9 ], [ 6, 8 ], [ 6, 5 ], [ 9, 1 ], [ 10, 12 ], [ 10, 14 ], [ 11, 17 ], [ 13, 16 ], [ 14, 13 ], [ 15, 19 ], [ 16, 18 ], [ 16, 15 ], [ 19, 11 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Harris knows Jon. Lark knows Ian. Sharon knows Kelly. Phoebe knows Valerie. Mark knows Drake. Phoebe knows Lark. Lola knows Sharon. Andre knows Damien. Kelly knows Lyric. Jon knows Anastasia. Lola knows Mark. Jon knows Boyd. Lark knows Julie. Andre knows Eloise. Ian knows Winston. Julie knows Andre. Sharon knows Harris. Valerie knows Wayne. Which of Sharon and Lark can Phoebe reach?", "answer": "Lark", "steps": [ "Phoebe knows Lark." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Phoebe", "Wayne", "Lark", "Ian", "Winston", "Eloise", "Julie", "Damien", "Valerie", "Andre", "Lola", "Drake", "Sharon", "Kelly", "Lyric", "Boyd", "Harris", "Anastasia", "Mark", "Jon" ], "edges": [ [ 0, 8 ], [ 0, 2 ], [ 2, 3 ], [ 2, 6 ], [ 3, 4 ], [ 6, 9 ], [ 8, 1 ], [ 9, 5 ], [ 9, 7 ], [ 10, 18 ], [ 10, 12 ], [ 12, 13 ], [ 12, 16 ], [ 13, 14 ], [ 16, 19 ], [ 18, 11 ], [ 19, 15 ], [ 19, 17 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Tony knows Kamila. Kamila knows Lamar. Brynn knows Zach. Ralph knows Edison. Sybil knows Joanna. Olive knows Tony. Kamila knows Wayne. Zach knows Cliff. Dalton knows Carrie. Edison knows Mae. Zach knows Dalton. Pam knows Gloria. Mae knows Brynn. Arlene knows Olive. Jason knows Pam. Lamar knows Jason. Fabian knows Arlene. Carrie knows Sybil. Which of Lamar and Dalton can Ralph reach?", "answer": "Dalton", "steps": [ "Ralph knows Edison.", "Edison knows Mae.", "Mae knows Brynn.", "Brynn knows Zach.", "Zach knows Dalton." ], "difficulty": 5, "original_distance": 8, "idx_to_symbol": [ "Ralph", "Joanna", "Zach", "Cliff", "Sybil", "Mae", "Carrie", "Dalton", "Brynn", "Edison", "Fabian", "Gloria", "Kamila", "Wayne", "Pam", "Olive", "Jason", "Lamar", "Tony", "Arlene" ], "edges": [ [ 0, 9 ], [ 2, 3 ], [ 2, 7 ], [ 4, 1 ], [ 5, 8 ], [ 6, 4 ], [ 7, 6 ], [ 8, 2 ], [ 9, 5 ], [ 10, 19 ], [ 12, 13 ], [ 12, 17 ], [ 14, 11 ], [ 15, 18 ], [ 16, 14 ], [ 17, 16 ], [ 18, 12 ], [ 19, 15 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Joy knows Nora. Elizabeth knows Isiah. Gabriel knows Desmond. Joshua knows Jonas. Norma knows Gabriel. Gabriel knows Mitchell. Eugene knows Lenora. Eugene knows Elizabeth. Yolanda knows Noel. Lenora knows Joshua. Desmond knows Dakota. Eugene knows Jon. Eugene knows Yolanda. Nicole knows Lamont. Vance knows Eugene. Gabriel knows Elaine. Elaine knows Nicole. Gabriel knows Joy. Which of Jonas and Lamont can Norma reach?", "answer": "Lamont", "steps": [ "Norma knows Gabriel.", "Gabriel knows Elaine.", "Elaine knows Nicole.", "Nicole knows Lamont." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Norma", "Dakota", "Joy", "Lamont", "Elaine", "Mitchell", "Desmond", "Gabriel", "Nicole", "Nora", "Vance", "Noel", "Elizabeth", "Jonas", "Lenora", "Jon", "Yolanda", "Eugene", "Joshua", "Isiah" ], "edges": [ [ 0, 7 ], [ 2, 9 ], [ 4, 8 ], [ 6, 1 ], [ 7, 5 ], [ 7, 6 ], [ 7, 4 ], [ 7, 2 ], [ 8, 3 ], [ 10, 17 ], [ 12, 19 ], [ 14, 18 ], [ 16, 11 ], [ 17, 15 ], [ 17, 16 ], [ 17, 14 ], [ 17, 12 ], [ 18, 13 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Vanessa knows Lacey. Yuki knows Ashton. Randall knows Nora. Ivan knows Dorian. Emma knows Ivan. Ella knows Ernie. Nora knows Ella. Alfonso knows Vanessa. Yuki knows Reed. Ivan knows Alfonso. Bob knows Yuki. Randall knows Emma. Desmond knows Alder. Ashton knows Aspen. Renee knows Quinn. Aspen knows Irma. Alder knows Renee. Desmond knows Bob. Which of Aspen and Vanessa can Desmond reach?", "answer": "Aspen", "steps": [ "Desmond knows Bob.", "Bob knows Yuki.", "Yuki knows Ashton.", "Ashton knows Aspen." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Desmond", "Alder", "Aspen", "Ashton", "Irma", "Renee", "Yuki", "Reed", "Quinn", "Bob", "Randall", "Nora", "Vanessa", "Alfonso", "Lacey", "Ella", "Ivan", "Dorian", "Ernie", "Emma" ], "edges": [ [ 0, 1 ], [ 0, 9 ], [ 1, 5 ], [ 2, 4 ], [ 3, 2 ], [ 5, 8 ], [ 6, 3 ], [ 6, 7 ], [ 9, 6 ], [ 10, 11 ], [ 10, 19 ], [ 11, 15 ], [ 12, 14 ], [ 13, 12 ], [ 15, 18 ], [ 16, 13 ], [ 16, 17 ], [ 19, 16 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Wanda knows Rufus. Clement knows Wanda. Hayes knows Freya. Vera knows Maureen. Vicki knows Miranda. Vera knows Doug. Patricia knows Otto. Wanda knows Vera. Leigh knows Colette. Vicki knows William. Clement knows Alexa. Leigh knows Lambert. Colette knows Mike. Clement knows Vicki. Hayes knows Leigh. Colette knows Eloise. Patricia knows Holly. Hayes knows Patricia. Which of Wanda and Leigh can Hayes reach?", "answer": "Leigh", "steps": [ "Hayes knows Leigh." ], "difficulty": 1, "original_distance": 3, "idx_to_symbol": [ "Hayes", "Eloise", "Mike", "Patricia", "Lambert", "Freya", "Holly", "Leigh", "Otto", "Colette", "Clement", "Doug", "Maureen", "Vicki", "Rufus", "Alexa", "William", "Wanda", "Miranda", "Vera" ], "edges": [ [ 0, 5 ], [ 0, 3 ], [ 0, 7 ], [ 3, 6 ], [ 3, 8 ], [ 7, 4 ], [ 7, 9 ], [ 9, 1 ], [ 9, 2 ], [ 10, 15 ], [ 10, 13 ], [ 10, 17 ], [ 13, 16 ], [ 13, 18 ], [ 17, 14 ], [ 17, 19 ], [ 19, 11 ], [ 19, 12 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Daniel knows Haley. Kelly knows Vance. Axel knows Bryan. Nina knows Wayne. Axel knows Sheila. Sheila knows Richard. Electra knows Jon. Kelly knows Edward. Wayne knows Dana. Vance knows Nina. Hailey knows Tyler. Gemma knows Naomi. Daniel knows Kate. Electra knows Hailey. Haley knows Fisher. Fisher knows Axel. Wayne knows Electra. Sheila knows Gemma. Which of Hailey and Gemma can Daniel reach?", "answer": "Gemma", "steps": [ "Daniel knows Haley.", "Haley knows Fisher.", "Fisher knows Axel.", "Axel knows Sheila.", "Sheila knows Gemma." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Daniel", "Sheila", "Naomi", "Richard", "Haley", "Bryan", "Fisher", "Gemma", "Axel", "Kate", "Kelly", "Electra", "Tyler", "Jon", "Vance", "Dana", "Nina", "Hailey", "Wayne", "Edward" ], "edges": [ [ 0, 4 ], [ 0, 9 ], [ 1, 3 ], [ 1, 7 ], [ 4, 6 ], [ 6, 8 ], [ 7, 2 ], [ 8, 5 ], [ 8, 1 ], [ 10, 14 ], [ 10, 19 ], [ 11, 13 ], [ 11, 17 ], [ 14, 16 ], [ 16, 18 ], [ 17, 12 ], [ 18, 15 ], [ 18, 11 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Dick knows Kirsten. Wendell knows Darren. Darren knows Isiah. Dolores knows Teresa. Dolores knows Bernadette. Alyson knows Nicholas. Clark knows Malcolm. Nicholas knows Ignacio. Christopher knows Clark. Teresa knows Carrie. Malcolm knows Lars. Clark knows Perry. Kirsten knows Wendell. Ignacio knows Dick. Wendell knows Nash. Lamar knows Dolores. Lars knows Lamar. Nicholas knows Layla. Which of Wendell and Dolores can Christopher reach?", "answer": "Dolores", "steps": [ "Christopher knows Clark.", "Clark knows Malcolm.", "Malcolm knows Lars.", "Lars knows Lamar.", "Lamar knows Dolores." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Christopher", "Malcolm", "Lamar", "Dolores", "Bernadette", "Teresa", "Clark", "Perry", "Lars", "Carrie", "Alyson", "Ignacio", "Kirsten", "Wendell", "Nash", "Darren", "Nicholas", "Layla", "Dick", "Isiah" ], "edges": [ [ 0, 6 ], [ 1, 8 ], [ 2, 3 ], [ 3, 4 ], [ 3, 5 ], [ 5, 9 ], [ 6, 7 ], [ 6, 1 ], [ 8, 2 ], [ 10, 16 ], [ 11, 18 ], [ 12, 13 ], [ 13, 14 ], [ 13, 15 ], [ 15, 19 ], [ 16, 17 ], [ 16, 11 ], [ 18, 12 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Garrison knows Dallas. Wyatt knows Darcy. Fabian knows Wyatt. Leroy knows Quinn. Fabian knows Patrick. Kay knows Garrison. Harriet knows Doug. Garrison knows Denver. Zach knows Leroy. Harriet knows Kirk. Darcy knows Zach. Denver knows Nelson. Doug knows Saul. Kaleb knows Luis. Kirk knows Kay. Zach knows Kaleb. Dallas knows Reed. Patrick knows Luther. Which of Luis and Reed can Harriet reach?", "answer": "Reed", "steps": [ "Harriet knows Kirk.", "Kirk knows Kay.", "Kay knows Garrison.", "Garrison knows Dallas.", "Dallas knows Reed." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Harriet", "Nelson", "Dallas", "Reed", "Garrison", "Denver", "Saul", "Kirk", "Doug", "Kay", "Fabian", "Quinn", "Kaleb", "Luis", "Zach", "Leroy", "Luther", "Wyatt", "Patrick", "Darcy" ], "edges": [ [ 0, 8 ], [ 0, 7 ], [ 2, 3 ], [ 4, 2 ], [ 4, 5 ], [ 5, 1 ], [ 7, 9 ], [ 8, 6 ], [ 9, 4 ], [ 10, 18 ], [ 10, 17 ], [ 12, 13 ], [ 14, 12 ], [ 14, 15 ], [ 15, 11 ], [ 17, 19 ], [ 18, 16 ], [ 19, 14 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Lola knows Tristan. Tristan knows Arthur. Hal knows Sandra. Eleanor knows Hal. Marcus knows Greg. Regina knows Marcus. Aisha knows Chloe. Greg knows Sally. Beth knows Eleanor. Arthur knows Aisha. Ben knows Grace. Sandra knows Peter. Tristan knows Brandon. Peter knows Ray. Grace knows Beth. Sally knows Lola. Ray knows Edwin. Sandra knows Leo. Which of Grace and Marcus can Ben reach?", "answer": "Grace", "steps": [ "Ben knows Grace." ], "difficulty": 1, "original_distance": 8, "idx_to_symbol": [ "Ben", "Peter", "Edwin", "Ray", "Sandra", "Hal", "Grace", "Eleanor", "Beth", "Leo", "Regina", "Arthur", "Chloe", "Aisha", "Tristan", "Lola", "Marcus", "Sally", "Greg", "Brandon" ], "edges": [ [ 0, 6 ], [ 1, 3 ], [ 3, 2 ], [ 4, 1 ], [ 4, 9 ], [ 5, 4 ], [ 6, 8 ], [ 7, 5 ], [ 8, 7 ], [ 10, 16 ], [ 11, 13 ], [ 13, 12 ], [ 14, 11 ], [ 14, 19 ], [ 15, 14 ], [ 16, 18 ], [ 17, 15 ], [ 18, 17 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Emery knows Megan. Elvis knows Dayton. Lyric knows Jon. Nadine knows Lyric. Kerry knows Ainsley. Callum knows Nadine. Judith knows Carter. Lyric knows Andre. Elvis knows Leroy. Elvis knows Kerry. Megan knows Nelson. Andre knows Keira. Callum knows Bridget. Dayton knows Alex. Bridget knows Yolanda. Leroy knows Emery. Callum knows Judith. Emery knows Grover. Which of Leroy and Nadine can Elvis reach?", "answer": "Leroy", "steps": [ "Elvis knows Leroy." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Elvis", "Leroy", "Grover", "Kerry", "Emery", "Dayton", "Nelson", "Ainsley", "Megan", "Alex", "Callum", "Nadine", "Jon", "Bridget", "Lyric", "Judith", "Keira", "Yolanda", "Andre", "Carter" ], "edges": [ [ 0, 3 ], [ 0, 1 ], [ 0, 5 ], [ 1, 4 ], [ 3, 7 ], [ 4, 2 ], [ 4, 8 ], [ 5, 9 ], [ 8, 6 ], [ 10, 13 ], [ 10, 11 ], [ 10, 15 ], [ 11, 14 ], [ 13, 17 ], [ 14, 12 ], [ 14, 18 ], [ 15, 19 ], [ 18, 16 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Hannah knows Leroy. Ronald knows Graeme. Ray knows Terry. Hannah knows Daisy. Troy knows Ronald. Graeme knows Rose. Terry knows Yvonne. Anna knows Ray. Ethan knows Archer. Rose knows Ethan. Candice knows Anna. Archer knows Chris. Candice knows Clarence. Yvonne knows Nelson. Hannah knows Troy. Nelson knows Skyler. Candice knows Patricia. Skyler knows Billy. Which of Ronald and Ray can Hannah reach?", "answer": "Ronald", "steps": [ "Hannah knows Troy.", "Troy knows Ronald." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Hannah", "Ethan", "Troy", "Rose", "Ronald", "Archer", "Chris", "Daisy", "Graeme", "Leroy", "Candice", "Nelson", "Anna", "Yvonne", "Ray", "Skyler", "Billy", "Patricia", "Terry", "Clarence" ], "edges": [ [ 0, 7 ], [ 0, 2 ], [ 0, 9 ], [ 1, 5 ], [ 2, 4 ], [ 3, 1 ], [ 4, 8 ], [ 5, 6 ], [ 8, 3 ], [ 10, 17 ], [ 10, 12 ], [ 10, 19 ], [ 11, 15 ], [ 12, 14 ], [ 13, 11 ], [ 14, 18 ], [ 15, 16 ], [ 18, 13 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Nicole knows Daniel. Franklin knows Lewis. Lewis knows Adam. Grady knows Willard. Laura knows Bennett. Willard knows Henry. Jacques knows Trevor. Adam knows Laura. Henry knows Ramona. Archer knows Karina. Laura knows Vernon. Cruz knows Nicole. Vernon knows Archer. Franklin knows Ingrid. Henry knows Jacques. Nicole knows Grady. Ethan knows Franklin. Trevor knows Dana. Which of Vernon and Jacques can Cruz reach?", "answer": "Jacques", "steps": [ "Cruz knows Nicole.", "Nicole knows Grady.", "Grady knows Willard.", "Willard knows Henry.", "Henry knows Jacques." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Cruz", "Dana", "Daniel", "Henry", "Trevor", "Ramona", "Grady", "Willard", "Nicole", "Jacques", "Ethan", "Karina", "Ingrid", "Laura", "Archer", "Bennett", "Lewis", "Adam", "Franklin", "Vernon" ], "edges": [ [ 0, 8 ], [ 3, 5 ], [ 3, 9 ], [ 4, 1 ], [ 6, 7 ], [ 7, 3 ], [ 8, 2 ], [ 8, 6 ], [ 9, 4 ], [ 10, 18 ], [ 13, 15 ], [ 13, 19 ], [ 14, 11 ], [ 16, 17 ], [ 17, 13 ], [ 18, 12 ], [ 18, 16 ], [ 19, 14 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Laura knows Howard. Maggie knows Shannon. Bridget knows Bonnie. Hattie knows Jay. Calvin knows Laura. Paige knows Betty. Calvin knows Greta. Hattie knows Chelsea. Luna knows Erin. Howard knows Destiny. Julie knows Hattie. Zachary knows Julie. Erin knows Dylan. Jay knows Bridget. Ben knows Zachary. Jay knows Paige. Dylan knows Calvin. Laura knows Maggie. Which of Bonnie and Destiny can Luna reach?", "answer": "Destiny", "steps": [ "Luna knows Erin.", "Erin knows Dylan.", "Dylan knows Calvin.", "Calvin knows Laura.", "Laura knows Howard.", "Howard knows Destiny." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Luna", "Greta", "Laura", "Shannon", "Dylan", "Calvin", "Destiny", "Erin", "Maggie", "Howard", "Ben", "Chelsea", "Jay", "Betty", "Julie", "Hattie", "Bonnie", "Zachary", "Paige", "Bridget" ], "edges": [ [ 0, 7 ], [ 2, 8 ], [ 2, 9 ], [ 4, 5 ], [ 5, 1 ], [ 5, 2 ], [ 7, 4 ], [ 8, 3 ], [ 9, 6 ], [ 10, 17 ], [ 12, 18 ], [ 12, 19 ], [ 14, 15 ], [ 15, 11 ], [ 15, 12 ], [ 17, 14 ], [ 18, 13 ], [ 19, 16 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Terry knows Blake. Haven knows Penny. Jolene knows Ira. Jolene knows Edison. Fritz knows Terry. Brittany knows Fritz. Bruce knows Kaleb. Haven knows Shannon. Hunter knows Brittany. Riley knows Terrence. Penny knows Livia. Blake knows Jolene. Marie knows Haven. Edison knows Elvira. Hunter knows Hannah. Terrence knows Isla. Isla knows Marie. Bruce knows Riley. Which of Jolene and Haven can Hunter reach?", "answer": "Jolene", "steps": [ "Hunter knows Brittany.", "Brittany knows Fritz.", "Fritz knows Terry.", "Terry knows Blake.", "Blake knows Jolene." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Hunter", "Hannah", "Brittany", "Fritz", "Jolene", "Edison", "Terry", "Blake", "Elvira", "Ira", "Bruce", "Kaleb", "Riley", "Terrence", "Haven", "Penny", "Isla", "Marie", "Livia", "Shannon" ], "edges": [ [ 0, 1 ], [ 0, 2 ], [ 2, 3 ], [ 3, 6 ], [ 4, 5 ], [ 4, 9 ], [ 5, 8 ], [ 6, 7 ], [ 7, 4 ], [ 10, 11 ], [ 10, 12 ], [ 12, 13 ], [ 13, 16 ], [ 14, 15 ], [ 14, 19 ], [ 15, 18 ], [ 16, 17 ], [ 17, 14 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Jenny knows Edwin. Whitney knows Ivan. Walt knows Elodie. Kirsten knows Jenny. Kirsten knows Luz. Walt knows Lacey. Luz knows Stuart. Whitney knows Clarence. Joy knows Whitney. Camille knows Ember. Ember knows Duke. Walt knows Camille. Edwin knows Julius. Lacey knows Robin. Robin knows Edmund. Elodie knows Louis. Robin knows Eduardo. Kirsten knows Joy. Which of Edmund and Clarence can Walt reach?", "answer": "Edmund", "steps": [ "Walt knows Lacey.", "Lacey knows Robin.", "Robin knows Edmund." ], "difficulty": 3, "original_distance": 3, "idx_to_symbol": [ "Walt", "Eduardo", "Edmund", "Camille", "Elodie", "Louis", "Duke", "Lacey", "Ember", "Robin", "Kirsten", "Ivan", "Clarence", "Jenny", "Luz", "Stuart", "Julius", "Joy", "Edwin", "Whitney" ], "edges": [ [ 0, 4 ], [ 0, 3 ], [ 0, 7 ], [ 3, 8 ], [ 4, 5 ], [ 7, 9 ], [ 8, 6 ], [ 9, 1 ], [ 9, 2 ], [ 10, 14 ], [ 10, 13 ], [ 10, 17 ], [ 13, 18 ], [ 14, 15 ], [ 17, 19 ], [ 18, 16 ], [ 19, 11 ], [ 19, 12 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Tamara knows Palmer. Earle knows Odette. Brenda knows Jack. Loretta knows Shaun. Jocelyn knows Tamara. Odette knows Amelia. Amelia knows Dahlia. Riley knows Saul. Caleb knows Rhonda. Odette knows Brenda. Laurel knows Julius. Tamara knows Laurel. Jeremy knows Loretta. Dahlia knows Whitney. Palmer knows Caleb. Dahlia knows Riley. Saul knows Esme. Caleb knows Jeremy. Which of Odette and Tamara can Earle reach?", "answer": "Odette", "steps": [ "Earle knows Odette." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Earle", "Amelia", "Odette", "Dahlia", "Riley", "Esme", "Saul", "Brenda", "Jack", "Whitney", "Jocelyn", "Palmer", "Tamara", "Caleb", "Jeremy", "Shaun", "Loretta", "Laurel", "Julius", "Rhonda" ], "edges": [ [ 0, 2 ], [ 1, 3 ], [ 2, 7 ], [ 2, 1 ], [ 3, 4 ], [ 3, 9 ], [ 4, 6 ], [ 6, 5 ], [ 7, 8 ], [ 10, 12 ], [ 11, 13 ], [ 12, 17 ], [ 12, 11 ], [ 13, 14 ], [ 13, 19 ], [ 14, 16 ], [ 16, 15 ], [ 17, 18 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Marilyn knows Mabel. Judith knows Graeme. Caleb knows Marilyn. Parsa knows Daisy. Sandra knows Derek. Derek knows Sue. Caleb knows Spencer. Sandra knows Caleb. Derek knows Alder. Judith knows Susan. Sally knows Bernice. Burt knows Sally. Caleb knows Rex. Bernice knows Sylvia. Sally knows Parsa. Sally knows Wesley. Spencer knows Jaime. Burt knows Judith. Which of Spencer and Parsa can Sandra reach?", "answer": "Spencer", "steps": [ "Sandra knows Caleb.", "Caleb knows Spencer." ], "difficulty": 2, "original_distance": 3, "idx_to_symbol": [ "Sandra", "Sue", "Alder", "Jaime", "Rex", "Caleb", "Mabel", "Spencer", "Marilyn", "Derek", "Burt", "Susan", "Graeme", "Daisy", "Wesley", "Sally", "Sylvia", "Parsa", "Bernice", "Judith" ], "edges": [ [ 0, 5 ], [ 0, 9 ], [ 5, 4 ], [ 5, 7 ], [ 5, 8 ], [ 7, 3 ], [ 8, 6 ], [ 9, 1 ], [ 9, 2 ], [ 10, 15 ], [ 10, 19 ], [ 15, 14 ], [ 15, 17 ], [ 15, 18 ], [ 17, 13 ], [ 18, 16 ], [ 19, 11 ], [ 19, 12 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Ira knows Christina. Fiona knows Tiffany. Camille knows Coral. Janice knows Ira. Barry knows Robert. Tessa knows Madeline. Grace knows Jeanne. Madeline knows Alyssa. Robert knows Grace. Tessa knows Lana. Coral knows Tristan. Alyssa knows Fiona. Christina knows Diane. Camille knows Antonio. Camille knows Janice. Tessa knows Barry. Jonah knows Ramon. Tristan knows Jonah. Which of Robert and Tristan can Camille reach?", "answer": "Tristan", "steps": [ "Camille knows Coral.", "Coral knows Tristan." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Camille", "Coral", "Christina", "Jonah", "Ramon", "Diane", "Antonio", "Ira", "Janice", "Tristan", "Tessa", "Barry", "Fiona", "Grace", "Jeanne", "Tiffany", "Lana", "Alyssa", "Madeline", "Robert" ], "edges": [ [ 0, 6 ], [ 0, 8 ], [ 0, 1 ], [ 1, 9 ], [ 2, 5 ], [ 3, 4 ], [ 7, 2 ], [ 8, 7 ], [ 9, 3 ], [ 10, 16 ], [ 10, 18 ], [ 10, 11 ], [ 11, 19 ], [ 12, 15 ], [ 13, 14 ], [ 17, 12 ], [ 18, 17 ], [ 19, 13 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Federico knows Heath. Dennis knows Frida. Federico knows Gordon. Alan knows Earl. Cynthia knows Gene. Frida knows Joaquin. Hilda knows Kai. Joaquin knows Tyler. Elise knows Cooper. Kai knows Gina. Cooper knows Cynthia. Kai knows Dennis. Heath knows Elise. Gordon knows Wilson. Wilson knows Fergus. Gina knows Alan. Max knows Federico. Tyler knows Cain. Which of Dennis and Heath can Hilda reach?", "answer": "Dennis", "steps": [ "Hilda knows Kai.", "Kai knows Dennis." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Hilda", "Alan", "Dennis", "Cain", "Frida", "Kai", "Tyler", "Joaquin", "Gina", "Earl", "Max", "Wilson", "Heath", "Gene", "Elise", "Federico", "Cynthia", "Cooper", "Gordon", "Fergus" ], "edges": [ [ 0, 5 ], [ 1, 9 ], [ 2, 4 ], [ 4, 7 ], [ 5, 2 ], [ 5, 8 ], [ 6, 3 ], [ 7, 6 ], [ 8, 1 ], [ 10, 15 ], [ 11, 19 ], [ 12, 14 ], [ 14, 17 ], [ 15, 12 ], [ 15, 18 ], [ 16, 13 ], [ 17, 16 ], [ 18, 11 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Gideon knows Alma. Yolanda knows Harmony. Tony knows Harlan. Yolanda knows Tony. Clarence knows Denise. Hampton knows Jessie. Kenzie knows Cain. Vance knows Yolanda. Vance knows Hampton. Gideon knows Inez. Inez knows Wanda. Harlan knows Basil. Clarence knows Kenzie. Denise knows Anna. Tony knows Olive. Gideon knows Elvis. Denise knows Gideon. Tony knows Dakota. Which of Inez and Harlan can Clarence reach?", "answer": "Inez", "steps": [ "Clarence knows Denise.", "Denise knows Gideon.", "Gideon knows Inez." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Clarence", "Wanda", "Denise", "Elvis", "Inez", "Alma", "Kenzie", "Cain", "Anna", "Gideon", "Vance", "Basil", "Yolanda", "Olive", "Harlan", "Dakota", "Hampton", "Jessie", "Harmony", "Tony" ], "edges": [ [ 0, 6 ], [ 0, 2 ], [ 2, 8 ], [ 2, 9 ], [ 4, 1 ], [ 6, 7 ], [ 9, 3 ], [ 9, 4 ], [ 9, 5 ], [ 10, 16 ], [ 10, 12 ], [ 12, 18 ], [ 12, 19 ], [ 14, 11 ], [ 16, 17 ], [ 19, 13 ], [ 19, 14 ], [ 19, 15 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Jakob knows Wilma. Darren knows Marcia. Foster knows Yara. Julio knows Jakob. Elvis knows Dora. Ruth knows Darren. Julius knows Enrique. Abel knows Ingrid. Elvis knows Abel. Darren knows Elvis. Bernadette knows Ruth. Blaine knows Bernadette. Jeremiah knows Julius. Dora knows Jolene. Yara knows Jeremiah. Julio knows Glenn. Julius knows Julio. Glenn knows Clement. Which of Julius and Darren can Foster reach?", "answer": "Julius", "steps": [ "Foster knows Yara.", "Yara knows Jeremiah.", "Jeremiah knows Julius." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Foster", "Wilma", "Enrique", "Jakob", "Clement", "Julio", "Glenn", "Yara", "Jeremiah", "Julius", "Blaine", "Ingrid", "Marcia", "Abel", "Jolene", "Elvis", "Dora", "Bernadette", "Ruth", "Darren" ], "edges": [ [ 0, 7 ], [ 3, 1 ], [ 5, 3 ], [ 5, 6 ], [ 6, 4 ], [ 7, 8 ], [ 8, 9 ], [ 9, 2 ], [ 9, 5 ], [ 10, 17 ], [ 13, 11 ], [ 15, 13 ], [ 15, 16 ], [ 16, 14 ], [ 17, 18 ], [ 18, 19 ], [ 19, 12 ], [ 19, 15 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Lorenzo knows Wilma. Sheryl knows Phoebe. Aubrey knows Alvin. Alyssa knows Celia. Wilma knows Irene. Chandler knows Ezra. Phoebe knows Zara. Ida knows Nelson. Alvin knows Ida. Agnes knows Lorenzo. Dirk knows Kai. Ezra knows Sheryl. Nelson knows Agnes. Adele knows Chandler. Etta knows Winston. Sheryl knows Dirk. Nelson knows Alyssa. Zara knows Etta. Which of Lorenzo and Zara can Aubrey reach?", "answer": "Lorenzo", "steps": [ "Aubrey knows Alvin.", "Alvin knows Ida.", "Ida knows Nelson.", "Nelson knows Agnes.", "Agnes knows Lorenzo." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Aubrey", "Nelson", "Wilma", "Lorenzo", "Irene", "Alvin", "Alyssa", "Celia", "Agnes", "Ida", "Adele", "Sheryl", "Etta", "Zara", "Winston", "Chandler", "Dirk", "Kai", "Phoebe", "Ezra" ], "edges": [ [ 0, 5 ], [ 1, 6 ], [ 1, 8 ], [ 2, 4 ], [ 3, 2 ], [ 5, 9 ], [ 6, 7 ], [ 8, 3 ], [ 9, 1 ], [ 10, 15 ], [ 11, 16 ], [ 11, 18 ], [ 12, 14 ], [ 13, 12 ], [ 15, 19 ], [ 16, 17 ], [ 18, 13 ], [ 19, 11 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Helene knows Constance. Lorraine knows Annette. Lorraine knows Donna. Helene knows Harrison. Helene knows Kristina. Helene knows Harmony. Harrison knows Winifred. Lorraine knows Humphrey. Annette knows Yara. Donna knows Eleanor. Humphrey knows Nathan. Nathan knows Gideon. Winifred knows Franklin. Harrison knows Belinda. Constance knows Dell. Harmony knows Esperanza. Lorraine knows Clay. Humphrey knows Wayne. Which of Harrison and Humphrey can Lorraine reach?", "answer": "Humphrey", "steps": [ "Lorraine knows Humphrey." ], "difficulty": 1, "original_distance": 3, "idx_to_symbol": [ "Lorraine", "Gideon", "Donna", "Wayne", "Clay", "Yara", "Annette", "Eleanor", "Humphrey", "Nathan", "Helene", "Franklin", "Harmony", "Belinda", "Kristina", "Dell", "Constance", "Esperanza", "Harrison", "Winifred" ], "edges": [ [ 0, 4 ], [ 0, 6 ], [ 0, 2 ], [ 0, 8 ], [ 2, 7 ], [ 6, 5 ], [ 8, 3 ], [ 8, 9 ], [ 9, 1 ], [ 10, 14 ], [ 10, 16 ], [ 10, 12 ], [ 10, 18 ], [ 12, 17 ], [ 16, 15 ], [ 18, 13 ], [ 18, 19 ], [ 19, 11 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Jolene knows Hunter. Rocco knows Dylan. Hunter knows Scott. Kate knows Molly. Jolene knows Kathleen. Lucille knows Erica. Lars knows Elodie. Lars knows Jolene. Victor knows Kate. Kate knows Charles. Charles knows Rocco. Elodie knows Hubert. Victor knows Lucille. Kathleen knows Graeme. Molly knows Fiona. Scott knows Karla. Graeme knows Jerry. Fiona knows Edwin. Which of Graeme and Rocco can Victor reach?", "answer": "Rocco", "steps": [ "Victor knows Kate.", "Kate knows Charles.", "Charles knows Rocco." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Victor", "Fiona", "Edwin", "Lucille", "Kate", "Rocco", "Erica", "Charles", "Molly", "Dylan", "Lars", "Scott", "Karla", "Elodie", "Jolene", "Graeme", "Hubert", "Kathleen", "Hunter", "Jerry" ], "edges": [ [ 0, 3 ], [ 0, 4 ], [ 1, 2 ], [ 3, 6 ], [ 4, 8 ], [ 4, 7 ], [ 5, 9 ], [ 7, 5 ], [ 8, 1 ], [ 10, 13 ], [ 10, 14 ], [ 11, 12 ], [ 13, 16 ], [ 14, 18 ], [ 14, 17 ], [ 15, 19 ], [ 17, 15 ], [ 18, 11 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Judith knows Lillian. Kendra knows Dora. Dudley knows Judith. Darcy knows Hector. Lance knows Kendra. Declan knows Jem. Ford knows Giselle. Chelsea knows Ford. Mike knows Kim. Kendra knows Chelsea. Kim knows Lance. Russell knows Mike. Declan knows Dudley. Jon knows Darcy. Kim knows Patricia. Judith knows Jon. Paula knows Elias. Elias knows Declan. Which of Judith and Kendra can Russell reach?", "answer": "Kendra", "steps": [ "Russell knows Mike.", "Mike knows Kim.", "Kim knows Lance.", "Lance knows Kendra." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Russell", "Lance", "Kendra", "Ford", "Patricia", "Dora", "Mike", "Kim", "Giselle", "Chelsea", "Paula", "Dudley", "Judith", "Darcy", "Jem", "Lillian", "Elias", "Declan", "Hector", "Jon" ], "edges": [ [ 0, 6 ], [ 1, 2 ], [ 2, 5 ], [ 2, 9 ], [ 3, 8 ], [ 6, 7 ], [ 7, 4 ], [ 7, 1 ], [ 9, 3 ], [ 10, 16 ], [ 11, 12 ], [ 12, 15 ], [ 12, 19 ], [ 13, 18 ], [ 16, 17 ], [ 17, 14 ], [ 17, 11 ], [ 19, 13 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Maude knows Amelia. Will knows Louisa. Abby knows Gerald. Valerie knows Charles. Cain knows Florence. Ezra knows Elsa. Lars knows Will. Ingrid knows Jolena. Pat knows Cain. Maude knows Abby. Louisa knows Julius. Abby knows Ingrid. Abby knows Lawson. Celeste knows Luz. Lawson knows Pat. Celeste knows Ezra. Celeste knows Lars. Valerie knows Celeste. Which of Pat and Will can Valerie reach?", "answer": "Will", "steps": [ "Valerie knows Celeste.", "Celeste knows Lars.", "Lars knows Will." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Valerie", "Lars", "Julius", "Luz", "Elsa", "Charles", "Will", "Louisa", "Ezra", "Celeste", "Maude", "Lawson", "Florence", "Gerald", "Jolena", "Amelia", "Pat", "Cain", "Ingrid", "Abby" ], "edges": [ [ 0, 5 ], [ 0, 9 ], [ 1, 6 ], [ 6, 7 ], [ 7, 2 ], [ 8, 4 ], [ 9, 3 ], [ 9, 1 ], [ 9, 8 ], [ 10, 15 ], [ 10, 19 ], [ 11, 16 ], [ 16, 17 ], [ 17, 12 ], [ 18, 14 ], [ 19, 13 ], [ 19, 11 ], [ 19, 18 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Daisy knows Alison. Matthew knows Darrell. Alice knows Carla. Maude knows Marilyn. Daisy knows Demetrius. Drew knows Daisy. Marilyn knows Autumn. Matthew knows Lana. Arthur knows Alice. Lawson knows Iris. Marilyn knows Noah. Bert knows Maude. Lana knows Lawson. Maude knows Hugh. Matthew knows Stuart. Marilyn knows Arthur. Maude knows Zach. Daisy knows Matthew. Which of Daisy and Maude can Drew reach?", "answer": "Daisy", "steps": [ "Drew knows Daisy." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Drew", "Lana", "Demetrius", "Lawson", "Darrell", "Daisy", "Iris", "Alison", "Matthew", "Stuart", "Bert", "Arthur", "Hugh", "Alice", "Noah", "Maude", "Carla", "Zach", "Marilyn", "Autumn" ], "edges": [ [ 0, 5 ], [ 1, 3 ], [ 3, 6 ], [ 5, 2 ], [ 5, 7 ], [ 5, 8 ], [ 8, 4 ], [ 8, 1 ], [ 8, 9 ], [ 10, 15 ], [ 11, 13 ], [ 13, 16 ], [ 15, 12 ], [ 15, 17 ], [ 15, 18 ], [ 18, 14 ], [ 18, 11 ], [ 18, 19 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Josie knows Matt. Darrell knows Clark. Erma knows Kira. Gary knows Dorothy. Jem knows Gary. Harmony knows Josie. Dorothy knows Kristina. Harriet knows Norman. Clark knows Malcolm. Harmony knows Louisa. Matt knows Erma. Norman knows Dorian. Harriet knows Riley. Dorothy knows Vance. Vance knows Darrell. Dorian knows Harmony. Harlan knows Jem. Harlan knows Kelly. Which of Erma and Clark can Harlan reach?", "answer": "Clark", "steps": [ "Harlan knows Jem.", "Jem knows Gary.", "Gary knows Dorothy.", "Dorothy knows Vance.", "Vance knows Darrell.", "Darrell knows Clark." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Harlan", "Clark", "Kelly", "Gary", "Jem", "Vance", "Dorothy", "Malcolm", "Kristina", "Darrell", "Harriet", "Erma", "Riley", "Dorian", "Norman", "Josie", "Harmony", "Kira", "Louisa", "Matt" ], "edges": [ [ 0, 2 ], [ 0, 4 ], [ 1, 7 ], [ 3, 6 ], [ 4, 3 ], [ 5, 9 ], [ 6, 8 ], [ 6, 5 ], [ 9, 1 ], [ 10, 12 ], [ 10, 14 ], [ 11, 17 ], [ 13, 16 ], [ 14, 13 ], [ 15, 19 ], [ 16, 18 ], [ 16, 15 ], [ 19, 11 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Eleanor knows Annie. Irma knows Dewey. Kingsley knows Otto. Dewey knows Lola. Lola knows Jenna. Effie knows Keegan. Kingsley knows Garrison. Otto knows Shannon. Garrison knows Jolene. Eleanor knows Irma. Irma knows Garland. Garrison knows Esther. Sadie knows Kingsley. Jolene knows Kirsten. Kirsten knows Jasmine. Shannon knows Sierra. Tiffany knows Eleanor. Annie knows Effie. Which of Kirsten and Lola can Sadie reach?", "answer": "Kirsten", "steps": [ "Sadie knows Kingsley.", "Kingsley knows Garrison.", "Garrison knows Jolene.", "Jolene knows Kirsten." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Sadie", "Kirsten", "Shannon", "Kingsley", "Otto", "Sierra", "Jolene", "Jasmine", "Garrison", "Esther", "Tiffany", "Lola", "Effie", "Eleanor", "Annie", "Keegan", "Dewey", "Jenna", "Irma", "Garland" ], "edges": [ [ 0, 3 ], [ 1, 7 ], [ 2, 5 ], [ 3, 4 ], [ 3, 8 ], [ 4, 2 ], [ 6, 1 ], [ 8, 6 ], [ 8, 9 ], [ 10, 13 ], [ 11, 17 ], [ 12, 15 ], [ 13, 14 ], [ 13, 18 ], [ 14, 12 ], [ 16, 11 ], [ 18, 16 ], [ 18, 19 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Claudia knows Esperanza. Annette knows Janelle. Eden knows Elias. Felicia knows Annette. Rachel knows Eden. Clayton knows Rachel. Elias knows Wyatt. Esperanza knows Felicia. Annette knows Darren. Langston knows Clayton. Rachel knows Emma. Felicia knows Verna. Rachel knows Chance. Felicia knows Vincent. Darren knows Guy. Clarissa knows Etta. Eden knows Clarissa. Janelle knows Beth. Which of Eden and Annette can Langston reach?", "answer": "Eden", "steps": [ "Langston knows Clayton.", "Clayton knows Rachel.", "Rachel knows Eden." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Langston", "Elias", "Etta", "Chance", "Wyatt", "Emma", "Eden", "Rachel", "Clarissa", "Clayton", "Claudia", "Darren", "Beth", "Verna", "Guy", "Vincent", "Annette", "Felicia", "Janelle", "Esperanza" ], "edges": [ [ 0, 9 ], [ 1, 4 ], [ 6, 1 ], [ 6, 8 ], [ 7, 3 ], [ 7, 5 ], [ 7, 6 ], [ 8, 2 ], [ 9, 7 ], [ 10, 19 ], [ 11, 14 ], [ 16, 11 ], [ 16, 18 ], [ 17, 13 ], [ 17, 15 ], [ 17, 16 ], [ 18, 12 ], [ 19, 17 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Nora knows Roman. Bruce knows Dick. Louisa knows Jewel. Dick knows Leah. Beverly knows Gene. Michael knows Boris. Jewel knows Wilson. Michael knows Bruce. Glen knows Beverly. Vera knows Glen. Bruce knows Nora. Aspen knows Willard. Vera knows Kara. Glen knows Eugenia. Eugenia knows Benjamin. Eugenia knows Louisa. Dawn knows Aspen. Dick knows Dawn. Which of Eugenia and Dick can Vera reach?", "answer": "Eugenia", "steps": [ "Vera knows Glen.", "Glen knows Eugenia." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Vera", "Glen", "Jewel", "Eugenia", "Beverly", "Kara", "Benjamin", "Gene", "Wilson", "Louisa", "Michael", "Bruce", "Aspen", "Dick", "Nora", "Boris", "Leah", "Roman", "Willard", "Dawn" ], "edges": [ [ 0, 5 ], [ 0, 1 ], [ 1, 4 ], [ 1, 3 ], [ 2, 8 ], [ 3, 6 ], [ 3, 9 ], [ 4, 7 ], [ 9, 2 ], [ 10, 15 ], [ 10, 11 ], [ 11, 14 ], [ 11, 13 ], [ 12, 18 ], [ 13, 16 ], [ 13, 19 ], [ 14, 17 ], [ 19, 12 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Nora knows Roman. Bruce knows Dick. Louisa knows Jewel. Dick knows Leah. Beverly knows Gene. Michael knows Boris. Jewel knows Wilson. Michael knows Bruce. Glen knows Beverly. Vera knows Glen. Bruce knows Nora. Aspen knows Willard. Vera knows Kara. Glen knows Eugenia. Eugenia knows Benjamin. Eugenia knows Louisa. Dawn knows Aspen. Dick knows Dawn. Which of Jewel and Aspen can Vera reach?", "answer": "Jewel", "steps": [ "Vera knows Glen.", "Glen knows Eugenia.", "Eugenia knows Louisa.", "Louisa knows Jewel." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Vera", "Glen", "Jewel", "Eugenia", "Beverly", "Kara", "Benjamin", "Gene", "Wilson", "Louisa", "Michael", "Bruce", "Aspen", "Dick", "Nora", "Boris", "Leah", "Roman", "Willard", "Dawn" ], "edges": [ [ 0, 5 ], [ 0, 1 ], [ 1, 4 ], [ 1, 3 ], [ 2, 8 ], [ 3, 6 ], [ 3, 9 ], [ 4, 7 ], [ 9, 2 ], [ 10, 15 ], [ 10, 11 ], [ 11, 14 ], [ 11, 13 ], [ 12, 18 ], [ 13, 16 ], [ 13, 19 ], [ 14, 17 ], [ 19, 12 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Clay knows Colleen. Carla knows Atlas. Tim knows Curtis. Colleen knows Agnes. Bart knows Carla. Jessie knows Xavier. Martha knows Emmett. Carla knows Walter. Colleen knows Eldon. Atlas knows Tim. Agnes knows Eleanor. Atlas knows Basil. Lewis knows Devon. Colleen knows Lewis. Marvin knows Clay. Carla knows Jessie. Nash knows Bart. Lewis knows Martha. Which of Tim and Martha can Nash reach?", "answer": "Tim", "steps": [ "Nash knows Bart.", "Bart knows Carla.", "Carla knows Atlas.", "Atlas knows Tim." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Nash", "Basil", "Xavier", "Carla", "Atlas", "Walter", "Bart", "Tim", "Jessie", "Curtis", "Marvin", "Devon", "Eleanor", "Colleen", "Lewis", "Eldon", "Clay", "Martha", "Agnes", "Emmett" ], "edges": [ [ 0, 6 ], [ 3, 5 ], [ 3, 8 ], [ 3, 4 ], [ 4, 1 ], [ 4, 7 ], [ 6, 3 ], [ 7, 9 ], [ 8, 2 ], [ 10, 16 ], [ 13, 15 ], [ 13, 18 ], [ 13, 14 ], [ 14, 11 ], [ 14, 17 ], [ 16, 13 ], [ 17, 19 ], [ 18, 12 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Julie knows Ted. Terry knows Sharon. Terry knows Julius. Jamie knows Judy. Leah knows Charity. Felicia knows Terry. Gerald knows Barney. Ted knows Gerald. Jamie knows Bridget. Jamie knows James. Gerald knows Hendrix. Gerald knows Felicia. Harriet knows Leah. Leah knows Basil. Terry knows Ashton. Stefan knows Jamie. Leah knows Stefan. Keegan knows Harriet. Which of Gerald and Leah can Julie reach?", "answer": "Gerald", "steps": [ "Julie knows Ted.", "Ted knows Gerald." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Julie", "Barney", "Julius", "Terry", "Ashton", "Sharon", "Felicia", "Hendrix", "Gerald", "Ted", "Keegan", "Charity", "James", "Jamie", "Judy", "Bridget", "Stefan", "Basil", "Leah", "Harriet" ], "edges": [ [ 0, 9 ], [ 3, 2 ], [ 3, 4 ], [ 3, 5 ], [ 6, 3 ], [ 8, 1 ], [ 8, 6 ], [ 8, 7 ], [ 9, 8 ], [ 10, 19 ], [ 13, 12 ], [ 13, 14 ], [ 13, 15 ], [ 16, 13 ], [ 18, 11 ], [ 18, 16 ], [ 18, 17 ], [ 19, 18 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Arturo knows Herbert. Randy knows Ray. Mark knows Arturo. Herbert knows Oliver. Madeline knows Kim. Vivian knows Harry. Herbert knows Arnold. Randy knows Deanna. Eden knows Anna. Deanna knows Madeline. Arturo knows Isaac. Anna knows Isabel. Vivian knows Zane. Zane knows Courtney. Madeline knows Vivian. Eden knows Mark. Oliver knows Clement. Ray knows Paula. Which of Mark and Deanna can Randy reach?", "answer": "Deanna", "steps": [ "Randy knows Deanna." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Randy", "Harry", "Ray", "Paula", "Deanna", "Courtney", "Zane", "Madeline", "Vivian", "Kim", "Eden", "Arnold", "Anna", "Isabel", "Mark", "Clement", "Oliver", "Arturo", "Herbert", "Isaac" ], "edges": [ [ 0, 2 ], [ 0, 4 ], [ 2, 3 ], [ 4, 7 ], [ 6, 5 ], [ 7, 8 ], [ 7, 9 ], [ 8, 1 ], [ 8, 6 ], [ 10, 12 ], [ 10, 14 ], [ 12, 13 ], [ 14, 17 ], [ 16, 15 ], [ 17, 18 ], [ 17, 19 ], [ 18, 11 ], [ 18, 16 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Lola knows Tristan. Tristan knows Arthur. Hal knows Sandra. Eleanor knows Hal. Marcus knows Greg. Regina knows Marcus. Aisha knows Chloe. Greg knows Sally. Beth knows Eleanor. Arthur knows Aisha. Ben knows Grace. Sandra knows Peter. Tristan knows Brandon. Peter knows Ray. Grace knows Beth. Sally knows Lola. Ray knows Edwin. Sandra knows Leo. Which of Greg and Beth can Ben reach?", "answer": "Beth", "steps": [ "Ben knows Grace.", "Grace knows Beth." ], "difficulty": 2, "original_distance": 8, "idx_to_symbol": [ "Ben", "Peter", "Edwin", "Ray", "Sandra", "Hal", "Grace", "Eleanor", "Beth", "Leo", "Regina", "Arthur", "Chloe", "Aisha", "Tristan", "Lola", "Marcus", "Sally", "Greg", "Brandon" ], "edges": [ [ 0, 6 ], [ 1, 3 ], [ 3, 2 ], [ 4, 1 ], [ 4, 9 ], [ 5, 4 ], [ 6, 8 ], [ 7, 5 ], [ 8, 7 ], [ 10, 16 ], [ 11, 13 ], [ 13, 12 ], [ 14, 11 ], [ 14, 19 ], [ 15, 14 ], [ 16, 18 ], [ 17, 15 ], [ 18, 17 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Adele knows Erwin. Pearl knows Paula. Florence knows Kent. Calvin knows Billy. Casey knows Tabitha. Darla knows Peggy. Peter knows Florence. Billy knows Maude. Paula knows Casey. Erwin knows Marvin. Kent knows Angela. Marvin knows Calvin. Angela knows Julius. Shelby knows Ivy. Peggy knows Adele. Rex knows Pearl. Tabitha knows Peter. Maude knows Shelby. Which of Pearl and Peggy can Darla reach?", "answer": "Peggy", "steps": [ "Darla knows Peggy." ], "difficulty": 1, "original_distance": 9, "idx_to_symbol": [ "Darla", "Adele", "Calvin", "Peggy", "Maude", "Marvin", "Shelby", "Erwin", "Ivy", "Billy", "Rex", "Paula", "Peter", "Pearl", "Kent", "Tabitha", "Angela", "Casey", "Julius", "Florence" ], "edges": [ [ 0, 3 ], [ 1, 7 ], [ 2, 9 ], [ 3, 1 ], [ 4, 6 ], [ 5, 2 ], [ 6, 8 ], [ 7, 5 ], [ 9, 4 ], [ 10, 13 ], [ 11, 17 ], [ 12, 19 ], [ 13, 11 ], [ 14, 16 ], [ 15, 12 ], [ 16, 18 ], [ 17, 15 ], [ 19, 14 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Hayden knows Louisa. Louisa knows Kelsey. Milton knows Bart. Peter knows Seth. Layla knows Keaton. Lottie knows Kerry. Amber knows Milton. Jesse knows Sally. Layla knows Joshua. Esperanza knows Darla. Lottie knows Robin. Sally knows Estella. Luella knows Jesse. Darla knows Layla. Seth knows Esperanza. Bart knows Lottie. Estella knows Amber. Kelsey knows Peter. Which of Lottie and Layla can Hayden reach?", "answer": "Layla", "steps": [ "Hayden knows Louisa.", "Louisa knows Kelsey.", "Kelsey knows Peter.", "Peter knows Seth.", "Seth knows Esperanza.", "Esperanza knows Darla.", "Darla knows Layla." ], "difficulty": 7, "original_distance": 8, "idx_to_symbol": [ "Hayden", "Esperanza", "Louisa", "Peter", "Kelsey", "Joshua", "Keaton", "Darla", "Layla", "Seth", "Luella", "Milton", "Jesse", "Estella", "Sally", "Robin", "Kerry", "Bart", "Lottie", "Amber" ], "edges": [ [ 0, 2 ], [ 1, 7 ], [ 2, 4 ], [ 3, 9 ], [ 4, 3 ], [ 7, 8 ], [ 8, 5 ], [ 8, 6 ], [ 9, 1 ], [ 10, 12 ], [ 11, 17 ], [ 12, 14 ], [ 13, 19 ], [ 14, 13 ], [ 17, 18 ], [ 18, 15 ], [ 18, 16 ], [ 19, 11 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Jesse knows Aria. Wendy knows Austin. Viola knows Sandy. Miranda knows Perry. Drew knows Carmela. Matthew knows Fritz. Mario knows Camden. Perry knows Jordan. Perry knows Craig. Jesse knows Daisy. Drew knows Wendy. Daisy knows Viola. Essie knows Matthew. Carmela knows Miranda. Carmela knows Mario. Aria knows Trudy. Matthew knows Cooper. Daisy knows Essie. Which of Perry and Matthew can Jesse reach?", "answer": "Matthew", "steps": [ "Jesse knows Daisy.", "Daisy knows Essie.", "Essie knows Matthew." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Jesse", "Essie", "Sandy", "Viola", "Daisy", "Trudy", "Fritz", "Matthew", "Cooper", "Aria", "Drew", "Miranda", "Camden", "Mario", "Carmela", "Austin", "Craig", "Perry", "Jordan", "Wendy" ], "edges": [ [ 0, 4 ], [ 0, 9 ], [ 1, 7 ], [ 3, 2 ], [ 4, 3 ], [ 4, 1 ], [ 7, 6 ], [ 7, 8 ], [ 9, 5 ], [ 10, 14 ], [ 10, 19 ], [ 11, 17 ], [ 13, 12 ], [ 14, 13 ], [ 14, 11 ], [ 17, 16 ], [ 17, 18 ], [ 19, 15 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Kate knows Archer. Zoe knows Eva. Joel knows Annie. Yara knows Iris. Imogen knows Katrina. Archer knows Penny. Joyce knows Della. Joel knows Yara. Joyce knows Alejandro. Della knows Mary. Katrina knows Ada. Holden knows Imogen. Holly knows Ernie. Eva knows Joyce. Imogen knows Holly. Knox knows Kate. Kate knows Zoe. Ada knows Joel. Which of Kate and Imogen can Holden reach?", "answer": "Imogen", "steps": [ "Holden knows Imogen." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Holden", "Annie", "Ada", "Ernie", "Iris", "Imogen", "Yara", "Joel", "Holly", "Katrina", "Knox", "Alejandro", "Eva", "Penny", "Mary", "Kate", "Della", "Joyce", "Archer", "Zoe" ], "edges": [ [ 0, 5 ], [ 2, 7 ], [ 5, 8 ], [ 5, 9 ], [ 6, 4 ], [ 7, 1 ], [ 7, 6 ], [ 8, 3 ], [ 9, 2 ], [ 10, 15 ], [ 12, 17 ], [ 15, 18 ], [ 15, 19 ], [ 16, 14 ], [ 17, 11 ], [ 17, 16 ], [ 18, 13 ], [ 19, 12 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Norma knows Virgil. Nash knows Brandon. Iris knows Clayton. Maggie knows Pablo. Sandy knows Maggie. Jameson knows Flora. Leah knows Julio. Ezra knows Jameson. Iris knows Ezra. Clayton knows Karl. Justine knows Norma. Nash knows Leah. Justine knows Grace. Maggie knows Nash. Norma knows Iris. Julio knows Jessica. Sandy knows Colin. Brandon knows Reed. Which of Iris and Nash can Justine reach?", "answer": "Iris", "steps": [ "Justine knows Norma.", "Norma knows Iris." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Justine", "Norma", "Ezra", "Karl", "Clayton", "Grace", "Jameson", "Flora", "Iris", "Virgil", "Sandy", "Maggie", "Leah", "Reed", "Brandon", "Colin", "Julio", "Jessica", "Nash", "Pablo" ], "edges": [ [ 0, 5 ], [ 0, 1 ], [ 1, 8 ], [ 1, 9 ], [ 2, 6 ], [ 4, 3 ], [ 6, 7 ], [ 8, 4 ], [ 8, 2 ], [ 10, 15 ], [ 10, 11 ], [ 11, 18 ], [ 11, 19 ], [ 12, 16 ], [ 14, 13 ], [ 16, 17 ], [ 18, 14 ], [ 18, 12 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Leon knows Richard. Carrie knows Eldon. Carrie knows Freya. Conrad knows Zoe. Eldon knows Marian. Inez knows Leon. Dahlia knows Beatrice. Kieran knows Erma. Emery knows Vincent. Beatrice knows Kieran. Frankie knows Emery. Erma knows Goldie. Richard knows Bailey. Dahlia knows Conrad. Marian knows Neal. Freya knows Yolanda. Goldie knows Frankie. Neal knows Inez. Which of Neal and Erma can Dahlia reach?", "answer": "Erma", "steps": [ "Dahlia knows Beatrice.", "Beatrice knows Kieran.", "Kieran knows Erma." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Dahlia", "Erma", "Conrad", "Goldie", "Kieran", "Beatrice", "Emery", "Vincent", "Zoe", "Frankie", "Carrie", "Neal", "Freya", "Inez", "Marian", "Eldon", "Richard", "Bailey", "Yolanda", "Leon" ], "edges": [ [ 0, 2 ], [ 0, 5 ], [ 1, 3 ], [ 2, 8 ], [ 3, 9 ], [ 4, 1 ], [ 5, 4 ], [ 6, 7 ], [ 9, 6 ], [ 10, 12 ], [ 10, 15 ], [ 11, 13 ], [ 12, 18 ], [ 13, 19 ], [ 14, 11 ], [ 15, 14 ], [ 16, 17 ], [ 19, 16 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Myrtle knows Elijah. Jacob knows Alfred. Alfred knows Forrest. Alfred knows Anna. Elijah knows Mara. Logan knows Jacob. Yvonne knows Heather. Jennifer knows Hugh. Heather knows Clement. Mara knows Erik. Forrest knows Abel. Walt knows Sheila. Clement knows Callum. Callum knows Jocelyn. Clement knows Hadley. Jocelyn knows Jennifer. Hugh knows Walt. Abel knows Myrtle. Which of Hugh and Elijah can Yvonne reach?", "answer": "Hugh", "steps": [ "Yvonne knows Heather.", "Heather knows Clement.", "Clement knows Callum.", "Callum knows Jocelyn.", "Jocelyn knows Jennifer.", "Jennifer knows Hugh." ], "difficulty": 6, "original_distance": 8, "idx_to_symbol": [ "Yvonne", "Jennifer", "Hadley", "Sheila", "Clement", "Callum", "Hugh", "Jocelyn", "Heather", "Walt", "Logan", "Myrtle", "Anna", "Erik", "Alfred", "Forrest", "Elijah", "Abel", "Jacob", "Mara" ], "edges": [ [ 0, 8 ], [ 1, 6 ], [ 4, 2 ], [ 4, 5 ], [ 5, 7 ], [ 6, 9 ], [ 7, 1 ], [ 8, 4 ], [ 9, 3 ], [ 10, 18 ], [ 11, 16 ], [ 14, 12 ], [ 14, 15 ], [ 15, 17 ], [ 16, 19 ], [ 17, 11 ], [ 18, 14 ], [ 19, 13 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Lara knows Lucia. Philip knows Clement. Clement knows Karla. Caleb knows Laverne. Clement knows Lenora. Lucia knows Travis. Jane knows Lara. Colleen knows Jane. Philip knows Caleb. Lucia knows Monroe. Dora knows Emily. Laverne knows Joel. Lara knows Mack. Taylor knows Abel. Laverne knows Riley. Taylor knows Lee. Emily knows Philip. Mack knows Taylor. Which of Jane and Emily can Colleen reach?", "answer": "Jane", "steps": [ "Colleen knows Jane." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Colleen", "Lee", "Mack", "Monroe", "Travis", "Jane", "Abel", "Lucia", "Lara", "Taylor", "Dora", "Riley", "Caleb", "Karla", "Lenora", "Emily", "Joel", "Clement", "Philip", "Laverne" ], "edges": [ [ 0, 5 ], [ 2, 9 ], [ 5, 8 ], [ 7, 3 ], [ 7, 4 ], [ 8, 7 ], [ 8, 2 ], [ 9, 1 ], [ 9, 6 ], [ 10, 15 ], [ 12, 19 ], [ 15, 18 ], [ 17, 13 ], [ 17, 14 ], [ 18, 17 ], [ 18, 12 ], [ 19, 11 ], [ 19, 16 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Hardy knows Jeff. Sandy knows Hardy. Eleanor knows Austin. Hilda knows Aisha. Hardy knows Judy. June knows Eleanor. Allen knows Kane. Jeff knows Fergus. Judy knows Allen. Hardy knows Demetrius. Eleanor knows Louisa. Austin knows Keegan. Finn knows June. Hilda knows Sandy. Keegan knows Ronald. Finn knows Jolena. Eleanor knows Susan. Louisa knows Layla. Which of Judy and Austin can Finn reach?", "answer": "Austin", "steps": [ "Finn knows June.", "June knows Eleanor.", "Eleanor knows Austin." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Finn", "Louisa", "June", "Eleanor", "Keegan", "Susan", "Layla", "Jolena", "Ronald", "Austin", "Hilda", "Jeff", "Sandy", "Hardy", "Allen", "Demetrius", "Fergus", "Aisha", "Kane", "Judy" ], "edges": [ [ 0, 7 ], [ 0, 2 ], [ 1, 6 ], [ 2, 3 ], [ 3, 5 ], [ 3, 1 ], [ 3, 9 ], [ 4, 8 ], [ 9, 4 ], [ 10, 17 ], [ 10, 12 ], [ 11, 16 ], [ 12, 13 ], [ 13, 15 ], [ 13, 11 ], [ 13, 19 ], [ 14, 18 ], [ 19, 14 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Clark knows Diego. Gunnar knows Joanna. Jeremy knows Raquel. Kara knows Rufus. Clark knows Aria. Kara knows Ricardo. Rufus knows Dakota. Joanna knows Jermaine. Aria knows Cliff. Ricardo knows Deirdre. Diego knows Jamie. Gunnar knows Jerome. Rufus knows Brian. Jeremy knows Brad. Raquel knows Clark. Brad knows Fred. Jerome knows Kara. Aria knows Howard. Which of Kara and Clark can Gunnar reach?", "answer": "Kara", "steps": [ "Gunnar knows Jerome.", "Jerome knows Kara." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Gunnar", "Rufus", "Ricardo", "Jermaine", "Joanna", "Deirdre", "Dakota", "Jerome", "Brian", "Kara", "Jeremy", "Aria", "Diego", "Fred", "Brad", "Jamie", "Howard", "Raquel", "Cliff", "Clark" ], "edges": [ [ 0, 4 ], [ 0, 7 ], [ 1, 6 ], [ 1, 8 ], [ 2, 5 ], [ 4, 3 ], [ 7, 9 ], [ 9, 2 ], [ 9, 1 ], [ 10, 14 ], [ 10, 17 ], [ 11, 16 ], [ 11, 18 ], [ 12, 15 ], [ 14, 13 ], [ 17, 19 ], [ 19, 12 ], [ 19, 11 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Diane knows Julian. Chelsea knows Diane. Diane knows Guy. Sidney knows Ursula. Lyle knows Jordan. Julian knows Beatrice. Beatrice knows Elton. Elton knows Lawson. Sally knows Lyle. Guy knows Rena. Allen knows Oscar. Julian knows Eden. Eden knows Itzel. Holden knows Sam. Oscar knows Holden. Oscar knows Sidney. Holden knows Sally. Sam knows Hugh. Which of Oscar and Diane can Chelsea reach?", "answer": "Diane", "steps": [ "Chelsea knows Diane." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Chelsea", "Eden", "Beatrice", "Itzel", "Julian", "Diane", "Elton", "Guy", "Rena", "Lawson", "Allen", "Sam", "Sally", "Hugh", "Holden", "Oscar", "Lyle", "Sidney", "Ursula", "Jordan" ], "edges": [ [ 0, 5 ], [ 1, 3 ], [ 2, 6 ], [ 4, 1 ], [ 4, 2 ], [ 5, 7 ], [ 5, 4 ], [ 6, 9 ], [ 7, 8 ], [ 10, 15 ], [ 11, 13 ], [ 12, 16 ], [ 14, 11 ], [ 14, 12 ], [ 15, 17 ], [ 15, 14 ], [ 16, 19 ], [ 17, 18 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Darren knows Hunter. Lee knows Dick. Howard knows Cordelia. Howard knows Lee. Diana knows Inez. Herman knows Lorenzo. Howard knows Conrad. Lorenzo knows Paula. Dick knows Janet. Conrad knows Uma. Howard knows Cody. Herman knows Rebecca. Dick knows Emmett. Paula knows Hampton. Emmett knows Duncan. Herman knows Louis. Paula knows Diana. Herman knows Darren. Which of Inez and Duncan can Herman reach?", "answer": "Inez", "steps": [ "Herman knows Lorenzo.", "Lorenzo knows Paula.", "Paula knows Diana.", "Diana knows Inez." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Herman", "Paula", "Inez", "Louis", "Rebecca", "Hampton", "Diana", "Darren", "Lorenzo", "Hunter", "Howard", "Dick", "Duncan", "Cody", "Cordelia", "Janet", "Emmett", "Conrad", "Lee", "Uma" ], "edges": [ [ 0, 3 ], [ 0, 4 ], [ 0, 8 ], [ 0, 7 ], [ 1, 5 ], [ 1, 6 ], [ 6, 2 ], [ 7, 9 ], [ 8, 1 ], [ 10, 13 ], [ 10, 14 ], [ 10, 18 ], [ 10, 17 ], [ 11, 15 ], [ 11, 16 ], [ 16, 12 ], [ 17, 19 ], [ 18, 11 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Sarah knows Natalie. Blake knows Yasmin. Lottie knows Dave. Jenna knows Mildred. Yasmin knows Judith. Declan knows Martha. August knows Patrick. Laura knows Sarah. Dave knows Geraldine. Sarah knows Carson. Patrick knows Lottie. Dean knows Lucia. Kylie knows Laura. Carson knows Declan. Martha knows Dean. Dave knows Blake. Curtis knows Kylie. Judith knows Jenna. Which of Declan and Yasmin can August reach?", "answer": "Yasmin", "steps": [ "August knows Patrick.", "Patrick knows Lottie.", "Lottie knows Dave.", "Dave knows Blake.", "Blake knows Yasmin." ], "difficulty": 5, "original_distance": 8, "idx_to_symbol": [ "August", "Blake", "Judith", "Geraldine", "Dave", "Lottie", "Mildred", "Jenna", "Yasmin", "Patrick", "Curtis", "Carson", "Martha", "Natalie", "Sarah", "Laura", "Lucia", "Dean", "Declan", "Kylie" ], "edges": [ [ 0, 9 ], [ 1, 8 ], [ 2, 7 ], [ 4, 3 ], [ 4, 1 ], [ 5, 4 ], [ 7, 6 ], [ 8, 2 ], [ 9, 5 ], [ 10, 19 ], [ 11, 18 ], [ 12, 17 ], [ 14, 13 ], [ 14, 11 ], [ 15, 14 ], [ 17, 16 ], [ 18, 12 ], [ 19, 15 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Monica knows Malcolm. Kristina knows Ebony. Jackson knows Logan. Lance knows Matt. Matt knows Brooks. Ebony knows Geneva. Jacob knows Jackson. Brad knows Rena. Lance knows Kristina. Dane knows Nadine. Logan knows Monica. Brad knows Dane. Pearl knows Mindy. Jacob knows Enrique. Rena knows Jacob. Ebony knows Virgil. Virgil knows Alyson. Alyson knows Pearl. Which of Jackson and Virgil can Lance reach?", "answer": "Virgil", "steps": [ "Lance knows Kristina.", "Kristina knows Ebony.", "Ebony knows Virgil." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Lance", "Alyson", "Brooks", "Mindy", "Matt", "Kristina", "Virgil", "Pearl", "Ebony", "Geneva", "Brad", "Logan", "Nadine", "Malcolm", "Dane", "Rena", "Jackson", "Monica", "Jacob", "Enrique" ], "edges": [ [ 0, 4 ], [ 0, 5 ], [ 1, 7 ], [ 4, 2 ], [ 5, 8 ], [ 6, 1 ], [ 7, 3 ], [ 8, 6 ], [ 8, 9 ], [ 10, 14 ], [ 10, 15 ], [ 11, 17 ], [ 14, 12 ], [ 15, 18 ], [ 16, 11 ], [ 17, 13 ], [ 18, 16 ], [ 18, 19 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Hubert knows Vivian. Victoria knows Becky. Cornelius knows Lark. Alyssa knows Caroline. Dana knows Lorraine. Lark knows Ruth. Allen knows Hendrix. Sebastian knows Victoria. Vivian knows Tabitha. Harris knows Dana. Becky knows Eamon. Eamon knows Alyssa. Lorraine knows Lawrence. Caroline knows Chloe. Lorraine knows Cornelius. Lawrence knows Randy. Alyssa knows Hubert. Hendrix knows Harris. Which of Vivian and Lark can Allen reach?", "answer": "Lark", "steps": [ "Allen knows Hendrix.", "Hendrix knows Harris.", "Harris knows Dana.", "Dana knows Lorraine.", "Lorraine knows Cornelius.", "Cornelius knows Lark." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Allen", "Lawrence", "Cornelius", "Harris", "Lark", "Dana", "Ruth", "Lorraine", "Hendrix", "Randy", "Sebastian", "Caroline", "Hubert", "Becky", "Vivian", "Eamon", "Tabitha", "Alyssa", "Victoria", "Chloe" ], "edges": [ [ 0, 8 ], [ 1, 9 ], [ 2, 4 ], [ 3, 5 ], [ 4, 6 ], [ 5, 7 ], [ 7, 2 ], [ 7, 1 ], [ 8, 3 ], [ 10, 18 ], [ 11, 19 ], [ 12, 14 ], [ 13, 15 ], [ 14, 16 ], [ 15, 17 ], [ 17, 12 ], [ 17, 11 ], [ 18, 13 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Reed knows Humphrey. Itzel knows Theodore. Itzel knows Malik. Dakota knows Angelica. Cara knows Camden. Malik knows Melissa. Forrest knows Harris. Itzel knows Forrest. Reed knows Alana. Cara knows Reed. Cara knows Dakota. Reed knows Marc. Forrest knows Cecilia. Malik knows Vivian. Dakota knows Viola. Viola knows Laura. Forrest knows Jillian. Vivian knows Elvira. Which of Dakota and Malik can Cara reach?", "answer": "Dakota", "steps": [ "Cara knows Dakota." ], "difficulty": 1, "original_distance": 3, "idx_to_symbol": [ "Cara", "Humphrey", "Alana", "Viola", "Camden", "Marc", "Laura", "Angelica", "Reed", "Dakota", "Itzel", "Jillian", "Cecilia", "Vivian", "Theodore", "Harris", "Elvira", "Melissa", "Forrest", "Malik" ], "edges": [ [ 0, 4 ], [ 0, 8 ], [ 0, 9 ], [ 3, 6 ], [ 8, 1 ], [ 8, 2 ], [ 8, 5 ], [ 9, 3 ], [ 9, 7 ], [ 10, 14 ], [ 10, 18 ], [ 10, 19 ], [ 13, 16 ], [ 18, 11 ], [ 18, 12 ], [ 18, 15 ], [ 19, 13 ], [ 19, 17 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Louis knows Clara. Kenzie knows Joy. Ibrahim knows Jeremiah. Trina knows Flora. Joyce knows Enid. Joyce knows Troy. Ibrahim knows Kamila. Natalie knows Louis. Ibrahim knows Donovan. Louis knows Gladys. Vernon knows Lawson. Vernon knows Cruz. Trina knows Joyce. Louis knows Patrick. Kenzie knows Ibrahim. Vernon knows Jeanne. Jeremiah knows Vernon. Joyce knows Natalie. Which of Jeremiah and Natalie can Kenzie reach?", "answer": "Jeremiah", "steps": [ "Kenzie knows Ibrahim.", "Ibrahim knows Jeremiah." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Kenzie", "Joy", "Kamila", "Lawson", "Vernon", "Jeremiah", "Cruz", "Jeanne", "Donovan", "Ibrahim", "Trina", "Flora", "Enid", "Patrick", "Louis", "Natalie", "Gladys", "Clara", "Troy", "Joyce" ], "edges": [ [ 0, 1 ], [ 0, 9 ], [ 4, 3 ], [ 4, 6 ], [ 4, 7 ], [ 5, 4 ], [ 9, 2 ], [ 9, 5 ], [ 9, 8 ], [ 10, 11 ], [ 10, 19 ], [ 14, 13 ], [ 14, 16 ], [ 14, 17 ], [ 15, 14 ], [ 19, 12 ], [ 19, 15 ], [ 19, 18 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Diane knows Julian. Chelsea knows Diane. Diane knows Guy. Sidney knows Ursula. Lyle knows Jordan. Julian knows Beatrice. Beatrice knows Elton. Elton knows Lawson. Sally knows Lyle. Guy knows Rena. Allen knows Oscar. Julian knows Eden. Eden knows Itzel. Holden knows Sam. Oscar knows Holden. Oscar knows Sidney. Holden knows Sally. Sam knows Hugh. Which of Elton and Lyle can Chelsea reach?", "answer": "Elton", "steps": [ "Chelsea knows Diane.", "Diane knows Julian.", "Julian knows Beatrice.", "Beatrice knows Elton." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Chelsea", "Eden", "Beatrice", "Itzel", "Julian", "Diane", "Elton", "Guy", "Rena", "Lawson", "Allen", "Sam", "Sally", "Hugh", "Holden", "Oscar", "Lyle", "Sidney", "Ursula", "Jordan" ], "edges": [ [ 0, 5 ], [ 1, 3 ], [ 2, 6 ], [ 4, 1 ], [ 4, 2 ], [ 5, 7 ], [ 5, 4 ], [ 6, 9 ], [ 7, 8 ], [ 10, 15 ], [ 11, 13 ], [ 12, 16 ], [ 14, 11 ], [ 14, 12 ], [ 15, 17 ], [ 15, 14 ], [ 16, 19 ], [ 17, 18 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Monica knows Malcolm. Kristina knows Ebony. Jackson knows Logan. Lance knows Matt. Matt knows Brooks. Ebony knows Geneva. Jacob knows Jackson. Brad knows Rena. Lance knows Kristina. Dane knows Nadine. Logan knows Monica. Brad knows Dane. Pearl knows Mindy. Jacob knows Enrique. Rena knows Jacob. Ebony knows Virgil. Virgil knows Alyson. Alyson knows Pearl. Which of Kristina and Rena can Lance reach?", "answer": "Kristina", "steps": [ "Lance knows Kristina." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Lance", "Alyson", "Brooks", "Mindy", "Matt", "Kristina", "Virgil", "Pearl", "Ebony", "Geneva", "Brad", "Logan", "Nadine", "Malcolm", "Dane", "Rena", "Jackson", "Monica", "Jacob", "Enrique" ], "edges": [ [ 0, 4 ], [ 0, 5 ], [ 1, 7 ], [ 4, 2 ], [ 5, 8 ], [ 6, 1 ], [ 7, 3 ], [ 8, 6 ], [ 8, 9 ], [ 10, 14 ], [ 10, 15 ], [ 11, 17 ], [ 14, 12 ], [ 15, 18 ], [ 16, 11 ], [ 17, 13 ], [ 18, 16 ], [ 18, 19 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Elton knows Keira. Gregory knows Fritz. Glen knows Austin. Shaun knows Elton. Keira knows Rocco. Hazel knows Shaun. Blake knows August. Shaun knows Emily. Celeste knows Houston. Barry knows Israel. Rosa knows Celeste. Bennett knows Bob. Gregory knows Blake. Fritz knows Drake. Houston knows Bennett. Bennett knows Gregory. Elton knows Barry. Austin knows Hazel. Which of Bennett and Shaun can Glen reach?", "answer": "Shaun", "steps": [ "Glen knows Austin.", "Austin knows Hazel.", "Hazel knows Shaun." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Glen", "Hazel", "Austin", "Israel", "Rocco", "Elton", "Shaun", "Barry", "Emily", "Keira", "Rosa", "Houston", "Celeste", "Drake", "August", "Gregory", "Bennett", "Fritz", "Bob", "Blake" ], "edges": [ [ 0, 2 ], [ 1, 6 ], [ 2, 1 ], [ 5, 7 ], [ 5, 9 ], [ 6, 8 ], [ 6, 5 ], [ 7, 3 ], [ 9, 4 ], [ 10, 12 ], [ 11, 16 ], [ 12, 11 ], [ 15, 17 ], [ 15, 19 ], [ 16, 18 ], [ 16, 15 ], [ 17, 13 ], [ 19, 14 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Tanya knows Winston. Nolan knows Byron. Winston knows Daisy. Winston knows Clyde. Adele knows Tanya. Stuart knows Regina. Fritz knows Yara. Isiah knows Christian. Christian knows Samantha. Isiah knows Frank. Fritz knows Matt. Clyde knows Janice. Tara knows Abigail. Tanya knows Stuart. Matt knows Nolan. Byron knows Jean. Nolan knows Isiah. Tara knows Adele. Which of Adele and Matt can Fritz reach?", "answer": "Matt", "steps": [ "Fritz knows Matt." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Fritz", "Yara", "Frank", "Samantha", "Isiah", "Jean", "Nolan", "Matt", "Byron", "Christian", "Tara", "Abigail", "Daisy", "Janice", "Winston", "Regina", "Tanya", "Adele", "Stuart", "Clyde" ], "edges": [ [ 0, 1 ], [ 0, 7 ], [ 4, 2 ], [ 4, 9 ], [ 6, 8 ], [ 6, 4 ], [ 7, 6 ], [ 8, 5 ], [ 9, 3 ], [ 10, 11 ], [ 10, 17 ], [ 14, 12 ], [ 14, 19 ], [ 16, 18 ], [ 16, 14 ], [ 17, 16 ], [ 18, 15 ], [ 19, 13 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Opal knows Bart. Duncan knows June. Dina knows Linda. Bart knows Samantha. Linda knows Ava. Gloria knows Stacy. Cecilia knows Natalie. Tristan knows Jacqueline. Duncan knows Lana. Stephen knows Opal. Stephen knows Gina. June knows Sharon. Opal knows Cecilia. Ava knows Garrison. Bart knows Gloria. Dina knows Duncan. Natalie knows Colby. Tristan knows Dina. Which of Stacy and Sharon can Stephen reach?", "answer": "Stacy", "steps": [ "Stephen knows Opal.", "Opal knows Bart.", "Bart knows Gloria.", "Gloria knows Stacy." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Stephen", "Colby", "Gloria", "Natalie", "Opal", "Bart", "Stacy", "Cecilia", "Gina", "Samantha", "Tristan", "Garrison", "June", "Ava", "Dina", "Duncan", "Sharon", "Linda", "Jacqueline", "Lana" ], "edges": [ [ 0, 8 ], [ 0, 4 ], [ 2, 6 ], [ 3, 1 ], [ 4, 7 ], [ 4, 5 ], [ 5, 2 ], [ 5, 9 ], [ 7, 3 ], [ 10, 18 ], [ 10, 14 ], [ 12, 16 ], [ 13, 11 ], [ 14, 17 ], [ 14, 15 ], [ 15, 12 ], [ 15, 19 ], [ 17, 13 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Kay knows Ava. Asher knows Francesca. Randall knows Judith. Irving knows Daria. Asher knows Joyce. Francesca knows Destiny. Daria knows Randall. Randall knows Drew. Garland knows Shaun. Drew knows Aria. Drew knows Caroline. Francesca knows Garland. Drew knows Clinton. Shaun knows Gina. Francesca knows Isabel. Cynthia knows Jenny. Ava knows Asher. Clinton knows Cynthia. Which of Cynthia and Shaun can Kay reach?", "answer": "Shaun", "steps": [ "Kay knows Ava.", "Ava knows Asher.", "Asher knows Francesca.", "Francesca knows Garland.", "Garland knows Shaun." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Kay", "Joyce", "Shaun", "Garland", "Asher", "Gina", "Destiny", "Francesca", "Ava", "Isabel", "Irving", "Judith", "Cynthia", "Clinton", "Randall", "Jenny", "Aria", "Drew", "Daria", "Caroline" ], "edges": [ [ 0, 8 ], [ 2, 5 ], [ 3, 2 ], [ 4, 1 ], [ 4, 7 ], [ 7, 3 ], [ 7, 6 ], [ 7, 9 ], [ 8, 4 ], [ 10, 18 ], [ 12, 15 ], [ 13, 12 ], [ 14, 11 ], [ 14, 17 ], [ 17, 13 ], [ 17, 16 ], [ 17, 19 ], [ 18, 14 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Teresa knows Justine. Gavin knows Patrick. Eunice knows Demetrius. Aisha knows Becky. Justine knows Joaquin. Dylan knows Darla. Gavin knows Teresa. Demetrius knows Tristan. Aisha knows Dylan. Joaquin knows Franklin. Eunice knows Aisha. Teresa knows Belinda. Belinda knows Clayton. Patrick knows Colette. Becky knows Aspen. Teresa knows Percy. Darla knows Otto. Aisha knows Alana. Which of Aisha and Teresa can Eunice reach?", "answer": "Aisha", "steps": [ "Eunice knows Aisha." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Eunice", "Dylan", "Darla", "Otto", "Aisha", "Tristan", "Aspen", "Becky", "Alana", "Demetrius", "Gavin", "Justine", "Joaquin", "Franklin", "Teresa", "Colette", "Clayton", "Belinda", "Percy", "Patrick" ], "edges": [ [ 0, 4 ], [ 0, 9 ], [ 1, 2 ], [ 2, 3 ], [ 4, 1 ], [ 4, 7 ], [ 4, 8 ], [ 7, 6 ], [ 9, 5 ], [ 10, 14 ], [ 10, 19 ], [ 11, 12 ], [ 12, 13 ], [ 14, 11 ], [ 14, 17 ], [ 14, 18 ], [ 17, 16 ], [ 19, 15 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Elvira knows Anthony. Anthony knows Cindy. Eunice knows Anastasia. Rhonda knows Eunice. Clyde knows Jade. Clyde knows Selena. Willard knows Diego. Eunice knows Lionel. Trina knows Rhonda. Denver knows Owen. Itzel knows Trina. Itzel knows Joan. Phoebe knows Elvira. Denver knows Oliver. Phoebe knows Clyde. Owen knows Phoebe. Diego knows Richard. Rhonda knows Willard. Which of Anthony and Diego can Itzel reach?", "answer": "Diego", "steps": [ "Itzel knows Trina.", "Trina knows Rhonda.", "Rhonda knows Willard.", "Willard knows Diego." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Itzel", "Lionel", "Rhonda", "Richard", "Diego", "Joan", "Anastasia", "Trina", "Willard", "Eunice", "Denver", "Selena", "Phoebe", "Cindy", "Anthony", "Oliver", "Jade", "Owen", "Elvira", "Clyde" ], "edges": [ [ 0, 5 ], [ 0, 7 ], [ 2, 8 ], [ 2, 9 ], [ 4, 3 ], [ 7, 2 ], [ 8, 4 ], [ 9, 1 ], [ 9, 6 ], [ 10, 15 ], [ 10, 17 ], [ 12, 18 ], [ 12, 19 ], [ 14, 13 ], [ 17, 12 ], [ 18, 14 ], [ 19, 11 ], [ 19, 16 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Vernon knows Paula. Electra knows Don. Greer knows Iris. Kate knows Seth. Electra knows Jakob. Gus knows Electra. April knows Greer. Paula knows Nolan. Electra knows Harry. Kate knows Milton. James knows Peggy. Kate knows Travis. Electra knows Ann. Corey knows Kate. April knows Corey. Kate knows James. Vernon knows Gus. Don knows Thomas. Which of Peggy and Thomas can April reach?", "answer": "Peggy", "steps": [ "April knows Corey.", "Corey knows Kate.", "Kate knows James.", "James knows Peggy." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "April", "Kate", "Milton", "Seth", "Corey", "Iris", "Greer", "Travis", "James", "Peggy", "Vernon", "Electra", "Harry", "Ann", "Gus", "Nolan", "Paula", "Jakob", "Don", "Thomas" ], "edges": [ [ 0, 6 ], [ 0, 4 ], [ 1, 2 ], [ 1, 3 ], [ 1, 7 ], [ 1, 8 ], [ 4, 1 ], [ 6, 5 ], [ 8, 9 ], [ 10, 16 ], [ 10, 14 ], [ 11, 12 ], [ 11, 13 ], [ 11, 17 ], [ 11, 18 ], [ 14, 11 ], [ 16, 15 ], [ 18, 19 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Charlotte knows Archie. Abby knows Callum. Derrick knows Claire. Rose knows Virginia. Callum knows Linda. Ralph knows Abby. Joseph knows Ronald. Linda knows Irving. Rita knows Lucille. Ronald knows Derrick. Charlotte knows Henry. Derrick knows Rose. Irving knows Charlotte. Irving knows Brandon. Rose knows Connor. Charlotte knows Ainsley. Lucille knows Joseph. Rose knows Lilia. Which of Charlotte and Rose can Ralph reach?", "answer": "Charlotte", "steps": [ "Ralph knows Abby.", "Abby knows Callum.", "Callum knows Linda.", "Linda knows Irving.", "Irving knows Charlotte." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Ralph", "Ainsley", "Charlotte", "Callum", "Irving", "Archie", "Henry", "Linda", "Abby", "Brandon", "Rita", "Virginia", "Rose", "Joseph", "Derrick", "Connor", "Lilia", "Ronald", "Lucille", "Claire" ], "edges": [ [ 0, 8 ], [ 2, 1 ], [ 2, 5 ], [ 2, 6 ], [ 3, 7 ], [ 4, 2 ], [ 4, 9 ], [ 7, 4 ], [ 8, 3 ], [ 10, 18 ], [ 12, 11 ], [ 12, 15 ], [ 12, 16 ], [ 13, 17 ], [ 14, 12 ], [ 14, 19 ], [ 17, 14 ], [ 18, 13 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Russ knows Bennett. Walt knows Harley. Russ knows Aria. Ramona knows Serena. Ford knows Selena. Serena knows Andrew. Harris knows Ramona. Jewel knows Chantal. Humphrey knows Carson. Ford knows Walt. Jose knows Russ. Selena knows Humphrey. Alison knows Jewel. Jewel knows Harris. Bennett knows Ford. Goldie knows Lewis. Hank knows Goldie. Ramona knows Hank. Which of Humphrey and Goldie can Alison reach?", "answer": "Goldie", "steps": [ "Alison knows Jewel.", "Jewel knows Harris.", "Harris knows Ramona.", "Ramona knows Hank.", "Hank knows Goldie." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Alison", "Harris", "Jewel", "Serena", "Lewis", "Chantal", "Ramona", "Andrew", "Hank", "Goldie", "Jose", "Bennett", "Russ", "Walt", "Carson", "Aria", "Ford", "Harley", "Selena", "Humphrey" ], "edges": [ [ 0, 2 ], [ 1, 6 ], [ 2, 5 ], [ 2, 1 ], [ 3, 7 ], [ 6, 3 ], [ 6, 8 ], [ 8, 9 ], [ 9, 4 ], [ 10, 12 ], [ 11, 16 ], [ 12, 15 ], [ 12, 11 ], [ 13, 17 ], [ 16, 13 ], [ 16, 18 ], [ 18, 19 ], [ 19, 14 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Estella knows James. Cain knows Corey. Percy knows Hugh. Irving knows Maureen. Cody knows Melissa. Lara knows Patricia. Yvette knows Irving. Maureen knows Cole. Lara knows Percy. Irving knows Forrest. Maureen knows Estella. Percy knows Karl. Hugh knows Cody. Luz knows Lara. Melissa knows Karina. Maureen knows Hazel. Percy knows Dante. James knows Cain. Which of Lara and Irving can Luz reach?", "answer": "Lara", "steps": [ "Luz knows Lara." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Luz", "Hugh", "Lara", "Cody", "Melissa", "Patricia", "Percy", "Karl", "Dante", "Karina", "Yvette", "Estella", "Irving", "James", "Cain", "Forrest", "Maureen", "Cole", "Hazel", "Corey" ], "edges": [ [ 0, 2 ], [ 1, 3 ], [ 2, 5 ], [ 2, 6 ], [ 3, 4 ], [ 4, 9 ], [ 6, 7 ], [ 6, 8 ], [ 6, 1 ], [ 10, 12 ], [ 11, 13 ], [ 12, 15 ], [ 12, 16 ], [ 13, 14 ], [ 14, 19 ], [ 16, 17 ], [ 16, 18 ], [ 16, 11 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Louis knows Andrea. Doug knows Louis. Chris knows Noah. Noah knows Duncan. Trevor knows Morris. Hardy knows Dina. Hardy knows Tamara. Aspen knows Duke. Trevor knows Geoffrey. Chandler knows Dorothy. Louis knows Hardy. Chris knows Trevor. Virgil knows Doug. Duke knows Cordelia. Andrea knows Miriam. Cordelia knows Chris. Chandler knows Virgil. Aspen knows Delia. Which of Virgil and Duke can Chandler reach?", "answer": "Virgil", "steps": [ "Chandler knows Virgil." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Chandler", "Dina", "Doug", "Tamara", "Andrea", "Miriam", "Virgil", "Louis", "Hardy", "Dorothy", "Aspen", "Morris", "Cordelia", "Geoffrey", "Noah", "Duncan", "Duke", "Chris", "Trevor", "Delia" ], "edges": [ [ 0, 6 ], [ 0, 9 ], [ 2, 7 ], [ 4, 5 ], [ 6, 2 ], [ 7, 4 ], [ 7, 8 ], [ 8, 1 ], [ 8, 3 ], [ 10, 16 ], [ 10, 19 ], [ 12, 17 ], [ 14, 15 ], [ 16, 12 ], [ 17, 14 ], [ 17, 18 ], [ 18, 11 ], [ 18, 13 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Jesse knows Aria. Wendy knows Austin. Viola knows Sandy. Miranda knows Perry. Drew knows Carmela. Matthew knows Fritz. Mario knows Camden. Perry knows Jordan. Perry knows Craig. Jesse knows Daisy. Drew knows Wendy. Daisy knows Viola. Essie knows Matthew. Carmela knows Miranda. Carmela knows Mario. Aria knows Trudy. Matthew knows Cooper. Daisy knows Essie. Which of Carmela and Daisy can Jesse reach?", "answer": "Daisy", "steps": [ "Jesse knows Daisy." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Jesse", "Essie", "Sandy", "Viola", "Daisy", "Trudy", "Fritz", "Matthew", "Cooper", "Aria", "Drew", "Miranda", "Camden", "Mario", "Carmela", "Austin", "Craig", "Perry", "Jordan", "Wendy" ], "edges": [ [ 0, 4 ], [ 0, 9 ], [ 1, 7 ], [ 3, 2 ], [ 4, 3 ], [ 4, 1 ], [ 7, 6 ], [ 7, 8 ], [ 9, 5 ], [ 10, 14 ], [ 10, 19 ], [ 11, 17 ], [ 13, 12 ], [ 14, 13 ], [ 14, 11 ], [ 17, 16 ], [ 17, 18 ], [ 19, 15 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Jorge knows Willis. Willis knows Gonzalo. Dolores knows Barry. Jorge knows Jocelyn. Grace knows Dane. Dane knows Aurora. Deirdre knows Grace. Lacey knows Jorge. Dolores knows Deirdre. Jeanne knows Iris. Jeanne knows Georgia. Willis knows Jeanne. Grace knows Harris. Deirdre knows Boris. Lacey knows Leah. Dane knows Geoffrey. Barry knows Agnes. Leah knows Donald. Which of Grace and Willis can Dolores reach?", "answer": "Grace", "steps": [ "Dolores knows Deirdre.", "Deirdre knows Grace." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Dolores", "Dane", "Grace", "Agnes", "Geoffrey", "Barry", "Boris", "Aurora", "Harris", "Deirdre", "Lacey", "Jeanne", "Willis", "Donald", "Georgia", "Leah", "Jocelyn", "Iris", "Gonzalo", "Jorge" ], "edges": [ [ 0, 5 ], [ 0, 9 ], [ 1, 4 ], [ 1, 7 ], [ 2, 1 ], [ 2, 8 ], [ 5, 3 ], [ 9, 6 ], [ 9, 2 ], [ 10, 15 ], [ 10, 19 ], [ 11, 14 ], [ 11, 17 ], [ 12, 11 ], [ 12, 18 ], [ 15, 13 ], [ 19, 16 ], [ 19, 12 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Barbara knows Norma. Burt knows Lawrence. Louis knows Fernando. Karl knows Patricia. Dale knows Sheryl. Dale knows Eric. Barbara knows Louis. Karl knows Laura. Burt knows Ralph. Lawrence knows Ellen. Barbara knows Claude. Barbara knows Betty. Karl knows Kamila. Kamila knows Burt. Sheryl knows Lyric. Kamila knows Beverly. Louis knows Dale. Karl knows Vivian. Which of Lyric and Ellen can Barbara reach?", "answer": "Lyric", "steps": [ "Barbara knows Louis.", "Louis knows Dale.", "Dale knows Sheryl.", "Sheryl knows Lyric." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Barbara", "Dale", "Claude", "Lyric", "Betty", "Eric", "Fernando", "Louis", "Sheryl", "Norma", "Karl", "Burt", "Patricia", "Ellen", "Laura", "Ralph", "Beverly", "Kamila", "Lawrence", "Vivian" ], "edges": [ [ 0, 2 ], [ 0, 4 ], [ 0, 7 ], [ 0, 9 ], [ 1, 5 ], [ 1, 8 ], [ 7, 6 ], [ 7, 1 ], [ 8, 3 ], [ 10, 12 ], [ 10, 14 ], [ 10, 17 ], [ 10, 19 ], [ 11, 15 ], [ 11, 18 ], [ 17, 16 ], [ 17, 11 ], [ 18, 13 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Frida knows Gonzalo. Nadine knows Greta. Shannon knows Harley. George knows Raymond. Carlton knows Celia. Carol knows Carlton. Nadine knows Kenzie. Gonzalo knows George. Joel knows Riley. Carlton knows Bryan. Robert knows Kennedy. Gonzalo knows Shannon. Shannon knows Jorge. Celia knows Jessica. Carol knows Nadine. Riley knows Carol. Gemma knows Frida. George knows Robert. Which of Riley and Frida can Gemma reach?", "answer": "Frida", "steps": [ "Gemma knows Frida." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Gemma", "Raymond", "Frida", "Harley", "George", "Shannon", "Robert", "Kennedy", "Jorge", "Gonzalo", "Joel", "Bryan", "Riley", "Kenzie", "Carlton", "Nadine", "Celia", "Jessica", "Greta", "Carol" ], "edges": [ [ 0, 2 ], [ 2, 9 ], [ 4, 1 ], [ 4, 6 ], [ 5, 3 ], [ 5, 8 ], [ 6, 7 ], [ 9, 4 ], [ 9, 5 ], [ 10, 12 ], [ 12, 19 ], [ 14, 11 ], [ 14, 16 ], [ 15, 13 ], [ 15, 18 ], [ 16, 17 ], [ 19, 14 ], [ 19, 15 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Ernest knows Delilah. Ernest knows Abel. Eunice knows Frances. Sara knows Larry. Reid knows Oscar. Reid knows Loretta. Reid knows Edward. Parker knows Reid. Ernest knows Lawson. Lola knows Parker. Ernest knows Adrian. Graeme knows Gage. Frances knows Laura. Loretta knows William. Lawson knows Sara. Gage knows Ernest. Reid knows Eunice. Abel knows Tara. Which of Frances and Sara can Lola reach?", "answer": "Frances", "steps": [ "Lola knows Parker.", "Parker knows Reid.", "Reid knows Eunice.", "Eunice knows Frances." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Lola", "Frances", "Reid", "Laura", "Loretta", "Parker", "Eunice", "Edward", "William", "Oscar", "Graeme", "Sara", "Ernest", "Larry", "Abel", "Gage", "Lawson", "Adrian", "Tara", "Delilah" ], "edges": [ [ 0, 5 ], [ 1, 3 ], [ 2, 6 ], [ 2, 7 ], [ 2, 4 ], [ 2, 9 ], [ 4, 8 ], [ 5, 2 ], [ 6, 1 ], [ 10, 15 ], [ 11, 13 ], [ 12, 16 ], [ 12, 17 ], [ 12, 14 ], [ 12, 19 ], [ 14, 18 ], [ 15, 12 ], [ 16, 11 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Lorenzo knows Wilma. Sheryl knows Phoebe. Aubrey knows Alvin. Alyssa knows Celia. Wilma knows Irene. Chandler knows Ezra. Phoebe knows Zara. Ida knows Nelson. Alvin knows Ida. Agnes knows Lorenzo. Dirk knows Kai. Ezra knows Sheryl. Nelson knows Agnes. Adele knows Chandler. Etta knows Winston. Sheryl knows Dirk. Nelson knows Alyssa. Zara knows Etta. Which of Chandler and Alvin can Aubrey reach?", "answer": "Alvin", "steps": [ "Aubrey knows Alvin." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Aubrey", "Nelson", "Wilma", "Lorenzo", "Irene", "Alvin", "Alyssa", "Celia", "Agnes", "Ida", "Adele", "Sheryl", "Etta", "Zara", "Winston", "Chandler", "Dirk", "Kai", "Phoebe", "Ezra" ], "edges": [ [ 0, 5 ], [ 1, 6 ], [ 1, 8 ], [ 2, 4 ], [ 3, 2 ], [ 5, 9 ], [ 6, 7 ], [ 8, 3 ], [ 9, 1 ], [ 10, 15 ], [ 11, 16 ], [ 11, 18 ], [ 12, 14 ], [ 13, 12 ], [ 15, 19 ], [ 16, 17 ], [ 18, 13 ], [ 19, 11 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Reed knows Humphrey. Itzel knows Theodore. Itzel knows Malik. Dakota knows Angelica. Cara knows Camden. Malik knows Melissa. Forrest knows Harris. Itzel knows Forrest. Reed knows Alana. Cara knows Reed. Cara knows Dakota. Reed knows Marc. Forrest knows Cecilia. Malik knows Vivian. Dakota knows Viola. Viola knows Laura. Forrest knows Jillian. Vivian knows Elvira. Which of Viola and Vivian can Cara reach?", "answer": "Viola", "steps": [ "Cara knows Dakota.", "Dakota knows Viola." ], "difficulty": 2, "original_distance": 3, "idx_to_symbol": [ "Cara", "Humphrey", "Alana", "Viola", "Camden", "Marc", "Laura", "Angelica", "Reed", "Dakota", "Itzel", "Jillian", "Cecilia", "Vivian", "Theodore", "Harris", "Elvira", "Melissa", "Forrest", "Malik" ], "edges": [ [ 0, 4 ], [ 0, 8 ], [ 0, 9 ], [ 3, 6 ], [ 8, 1 ], [ 8, 2 ], [ 8, 5 ], [ 9, 3 ], [ 9, 7 ], [ 10, 14 ], [ 10, 18 ], [ 10, 19 ], [ 13, 16 ], [ 18, 11 ], [ 18, 12 ], [ 18, 15 ], [ 19, 13 ], [ 19, 17 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Alyssa knows Ariana. Barbara knows Houston. Violet knows Gertrude. Gertrude knows Garrett. Dakota knows Raymond. Barbara knows Violet. Garrett knows Isla. Ariana knows Fabian. Xavier knows Porter. Xavier knows Colby. Violet knows Dorothy. Garrett knows Melody. Dorothy knows Rita. Rita knows Anita. Colby knows Alyssa. Cassidy knows Dakota. Dakota knows Abby. Colby knows Cassidy. Which of Violet and Colby can Barbara reach?", "answer": "Violet", "steps": [ "Barbara knows Violet." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Barbara", "Anita", "Garrett", "Houston", "Gertrude", "Rita", "Melody", "Isla", "Violet", "Dorothy", "Xavier", "Fabian", "Dakota", "Porter", "Cassidy", "Ariana", "Raymond", "Abby", "Colby", "Alyssa" ], "edges": [ [ 0, 3 ], [ 0, 8 ], [ 2, 6 ], [ 2, 7 ], [ 4, 2 ], [ 5, 1 ], [ 8, 4 ], [ 8, 9 ], [ 9, 5 ], [ 10, 13 ], [ 10, 18 ], [ 12, 16 ], [ 12, 17 ], [ 14, 12 ], [ 15, 11 ], [ 18, 14 ], [ 18, 19 ], [ 19, 15 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Eloise knows Cameron. Lauren knows Dell. Bernice knows Dalton. Connor knows Alana. Beth knows Connor. Beth knows Dewey. Matthew knows Barney. Katherine knows Bernice. Lauren knows Katherine. Bernice knows Matthew. Alana knows Jake. Dewey knows Gustavo. Eloise knows Ilene. Cameron knows Beth. Barney knows Amber. Dalton knows Erma. Dalton knows Forrest. Dewey knows Landon. Which of Connor and Matthew can Lauren reach?", "answer": "Matthew", "steps": [ "Lauren knows Katherine.", "Katherine knows Bernice.", "Bernice knows Matthew." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Lauren", "Dalton", "Katherine", "Bernice", "Erma", "Dell", "Barney", "Forrest", "Matthew", "Amber", "Eloise", "Dewey", "Cameron", "Beth", "Landon", "Ilene", "Alana", "Gustavo", "Connor", "Jake" ], "edges": [ [ 0, 5 ], [ 0, 2 ], [ 1, 4 ], [ 1, 7 ], [ 2, 3 ], [ 3, 1 ], [ 3, 8 ], [ 6, 9 ], [ 8, 6 ], [ 10, 15 ], [ 10, 12 ], [ 11, 14 ], [ 11, 17 ], [ 12, 13 ], [ 13, 11 ], [ 13, 18 ], [ 16, 19 ], [ 18, 16 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Willis knows Kay. Virginia knows Elliot. Isaac knows Alex. Houston knows Marvin. Carson knows Houston. Alex knows Willis. Constance knows Axel. Kay knows Malcolm. Constance knows Teresa. Willis knows Clara. Marvin knows Electra. Axel knows Isaac. Marvin knows Virginia. Mitchell knows Curtis. Virginia knows Leticia. Mitchell knows Mae. Kay knows Eve. Curtis knows Carson. Which of Axel and Curtis can Constance reach?", "answer": "Axel", "steps": [ "Constance knows Axel." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Constance", "Clara", "Kay", "Isaac", "Teresa", "Axel", "Alex", "Eve", "Malcolm", "Willis", "Mitchell", "Electra", "Virginia", "Carson", "Mae", "Curtis", "Houston", "Elliot", "Leticia", "Marvin" ], "edges": [ [ 0, 4 ], [ 0, 5 ], [ 2, 7 ], [ 2, 8 ], [ 3, 6 ], [ 5, 3 ], [ 6, 9 ], [ 9, 1 ], [ 9, 2 ], [ 10, 14 ], [ 10, 15 ], [ 12, 17 ], [ 12, 18 ], [ 13, 16 ], [ 15, 13 ], [ 16, 19 ], [ 19, 11 ], [ 19, 12 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Lorenzo knows Wilma. Sheryl knows Phoebe. Aubrey knows Alvin. Alyssa knows Celia. Wilma knows Irene. Chandler knows Ezra. Phoebe knows Zara. Ida knows Nelson. Alvin knows Ida. Agnes knows Lorenzo. Dirk knows Kai. Ezra knows Sheryl. Nelson knows Agnes. Adele knows Chandler. Etta knows Winston. Sheryl knows Dirk. Nelson knows Alyssa. Zara knows Etta. Which of Phoebe and Agnes can Aubrey reach?", "answer": "Agnes", "steps": [ "Aubrey knows Alvin.", "Alvin knows Ida.", "Ida knows Nelson.", "Nelson knows Agnes." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Aubrey", "Nelson", "Wilma", "Lorenzo", "Irene", "Alvin", "Alyssa", "Celia", "Agnes", "Ida", "Adele", "Sheryl", "Etta", "Zara", "Winston", "Chandler", "Dirk", "Kai", "Phoebe", "Ezra" ], "edges": [ [ 0, 5 ], [ 1, 6 ], [ 1, 8 ], [ 2, 4 ], [ 3, 2 ], [ 5, 9 ], [ 6, 7 ], [ 8, 3 ], [ 9, 1 ], [ 10, 15 ], [ 11, 16 ], [ 11, 18 ], [ 12, 14 ], [ 13, 12 ], [ 15, 19 ], [ 16, 17 ], [ 18, 13 ], [ 19, 11 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Kate knows Archer. Zoe knows Eva. Joel knows Annie. Yara knows Iris. Imogen knows Katrina. Archer knows Penny. Joyce knows Della. Joel knows Yara. Joyce knows Alejandro. Della knows Mary. Katrina knows Ada. Holden knows Imogen. Holly knows Ernie. Eva knows Joyce. Imogen knows Holly. Knox knows Kate. Kate knows Zoe. Ada knows Joel. Which of Joyce and Joel can Holden reach?", "answer": "Joel", "steps": [ "Holden knows Imogen.", "Imogen knows Katrina.", "Katrina knows Ada.", "Ada knows Joel." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Holden", "Annie", "Ada", "Ernie", "Iris", "Imogen", "Yara", "Joel", "Holly", "Katrina", "Knox", "Alejandro", "Eva", "Penny", "Mary", "Kate", "Della", "Joyce", "Archer", "Zoe" ], "edges": [ [ 0, 5 ], [ 2, 7 ], [ 5, 8 ], [ 5, 9 ], [ 6, 4 ], [ 7, 1 ], [ 7, 6 ], [ 8, 3 ], [ 9, 2 ], [ 10, 15 ], [ 12, 17 ], [ 15, 18 ], [ 15, 19 ], [ 16, 14 ], [ 17, 11 ], [ 17, 16 ], [ 18, 13 ], [ 19, 12 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Bryan knows Alyson. Elise knows Pete. Dennis knows Nancy. Sierra knows Clinton. Elise knows Charlotte. Pete knows Dennis. Inez knows Aspen. Irene knows Holly. Joan knows Irene. Joan knows Alder. Bryan knows Neville. Irene knows Elaine. Jackson knows Sierra. Jackson knows Josie. Clinton knows Erica. Holly knows Inez. Dennis knows Jackson. Alyson knows Joan. Which of Jackson and Irene can Elise reach?", "answer": "Jackson", "steps": [ "Elise knows Pete.", "Pete knows Dennis.", "Dennis knows Jackson." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Elise", "Erica", "Nancy", "Josie", "Sierra", "Pete", "Charlotte", "Clinton", "Dennis", "Jackson", "Bryan", "Aspen", "Alder", "Elaine", "Holly", "Alyson", "Neville", "Inez", "Joan", "Irene" ], "edges": [ [ 0, 6 ], [ 0, 5 ], [ 4, 7 ], [ 5, 8 ], [ 7, 1 ], [ 8, 2 ], [ 8, 9 ], [ 9, 3 ], [ 9, 4 ], [ 10, 16 ], [ 10, 15 ], [ 14, 17 ], [ 15, 18 ], [ 17, 11 ], [ 18, 12 ], [ 18, 19 ], [ 19, 13 ], [ 19, 14 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Luna knows Beatrice. Sadie knows Axel. Javier knows Julius. Ivy knows Loretta. Julia knows Louise. Olive knows Morris. Cornelius knows Curtis. Cornelius knows Ivy. Donald knows Cornelius. Nora knows Donald. Rita knows Javier. Nora knows Sadie. Beatrice knows Olive. Curtis knows Willis. Julius knows Max. Beatrice knows Rita. Cindy knows Nora. Javier knows Julia. Which of Rita and Donald can Cindy reach?", "answer": "Donald", "steps": [ "Cindy knows Nora.", "Nora knows Donald." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Cindy", "Nora", "Donald", "Ivy", "Loretta", "Willis", "Cornelius", "Sadie", "Axel", "Curtis", "Luna", "Beatrice", "Rita", "Julia", "Louise", "Max", "Javier", "Olive", "Morris", "Julius" ], "edges": [ [ 0, 1 ], [ 1, 7 ], [ 1, 2 ], [ 2, 6 ], [ 3, 4 ], [ 6, 3 ], [ 6, 9 ], [ 7, 8 ], [ 9, 5 ], [ 10, 11 ], [ 11, 17 ], [ 11, 12 ], [ 12, 16 ], [ 13, 14 ], [ 16, 13 ], [ 16, 19 ], [ 17, 18 ], [ 19, 15 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Ethan knows Odette. Trevor knows Francesca. Ethan knows Fisher. Trevor knows Miranda. Ian knows Kirk. Russ knows Ethan. Emma knows Heidi. Francesca knows Barney. Ethan knows Daisy. Emma knows Livia. Emma knows Ian. Lars knows Russ. Dale knows Emma. Javier knows Fritz. Lars knows Bart. Odette knows Antonio. Trevor knows Dale. Lars knows Javier. Which of Odette and Ian can Lars reach?", "answer": "Odette", "steps": [ "Lars knows Russ.", "Russ knows Ethan.", "Ethan knows Odette." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Lars", "Fritz", "Antonio", "Bart", "Odette", "Javier", "Russ", "Fisher", "Daisy", "Ethan", "Trevor", "Barney", "Kirk", "Miranda", "Ian", "Francesca", "Dale", "Livia", "Heidi", "Emma" ], "edges": [ [ 0, 3 ], [ 0, 5 ], [ 0, 6 ], [ 4, 2 ], [ 5, 1 ], [ 6, 9 ], [ 9, 4 ], [ 9, 7 ], [ 9, 8 ], [ 10, 13 ], [ 10, 15 ], [ 10, 16 ], [ 14, 12 ], [ 15, 11 ], [ 16, 19 ], [ 19, 14 ], [ 19, 17 ], [ 19, 18 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Kara knows Malcolm. Cate knows Vanessa. Anita knows Hilda. Alejandro knows Grady. Jordan knows Houston. Conner knows Sheila. Hilda knows Felix. Eamon knows Cate. Grady knows Conner. Eamon knows Roy. Roy knows Darius. Houston knows Alejandro. Vanessa knows Randall. Hugo knows Anita. Roy knows Hugo. Malcolm knows Cordelia. Houston knows Clark. Jordan knows Kara. Which of Sheila and Felix can Eamon reach?", "answer": "Felix", "steps": [ "Eamon knows Roy.", "Roy knows Hugo.", "Hugo knows Anita.", "Anita knows Hilda.", "Hilda knows Felix." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Eamon", "Felix", "Hilda", "Cate", "Anita", "Darius", "Hugo", "Roy", "Vanessa", "Randall", "Jordan", "Sheila", "Conner", "Kara", "Grady", "Clark", "Alejandro", "Houston", "Malcolm", "Cordelia" ], "edges": [ [ 0, 7 ], [ 0, 3 ], [ 2, 1 ], [ 3, 8 ], [ 4, 2 ], [ 6, 4 ], [ 7, 5 ], [ 7, 6 ], [ 8, 9 ], [ 10, 17 ], [ 10, 13 ], [ 12, 11 ], [ 13, 18 ], [ 14, 12 ], [ 16, 14 ], [ 17, 15 ], [ 17, 16 ], [ 18, 19 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Leon knows Richard. Carrie knows Eldon. Carrie knows Freya. Conrad knows Zoe. Eldon knows Marian. Inez knows Leon. Dahlia knows Beatrice. Kieran knows Erma. Emery knows Vincent. Beatrice knows Kieran. Frankie knows Emery. Erma knows Goldie. Richard knows Bailey. Dahlia knows Conrad. Marian knows Neal. Freya knows Yolanda. Goldie knows Frankie. Neal knows Inez. Which of Kieran and Marian can Dahlia reach?", "answer": "Kieran", "steps": [ "Dahlia knows Beatrice.", "Beatrice knows Kieran." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Dahlia", "Erma", "Conrad", "Goldie", "Kieran", "Beatrice", "Emery", "Vincent", "Zoe", "Frankie", "Carrie", "Neal", "Freya", "Inez", "Marian", "Eldon", "Richard", "Bailey", "Yolanda", "Leon" ], "edges": [ [ 0, 2 ], [ 0, 5 ], [ 1, 3 ], [ 2, 8 ], [ 3, 9 ], [ 4, 1 ], [ 5, 4 ], [ 6, 7 ], [ 9, 6 ], [ 10, 12 ], [ 10, 15 ], [ 11, 13 ], [ 12, 18 ], [ 13, 19 ], [ 14, 11 ], [ 15, 14 ], [ 16, 17 ], [ 19, 16 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Jill knows Mae. Kerry knows Jamie. Mae knows Randy. Elise knows Garrett. Jill knows Philip. Randy knows Daniella. Nicholas knows Kerry. Kerry knows Louise. Samantha knows Shawn. Mae knows Mindy. Lane knows Nicholas. Lane knows Samantha. Philip knows Max. Jamie knows Joseph. Daniella knows Elise. Joseph knows Oliver. Nicholas knows Jasper. Randy knows Willis. Which of Kerry and Randy can Lane reach?", "answer": "Kerry", "steps": [ "Lane knows Nicholas.", "Nicholas knows Kerry." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Lane", "Louise", "Kerry", "Nicholas", "Shawn", "Joseph", "Jasper", "Oliver", "Samantha", "Jamie", "Jill", "Willis", "Randy", "Mae", "Max", "Elise", "Mindy", "Garrett", "Philip", "Daniella" ], "edges": [ [ 0, 8 ], [ 0, 3 ], [ 2, 1 ], [ 2, 9 ], [ 3, 6 ], [ 3, 2 ], [ 5, 7 ], [ 8, 4 ], [ 9, 5 ], [ 10, 18 ], [ 10, 13 ], [ 12, 11 ], [ 12, 19 ], [ 13, 16 ], [ 13, 12 ], [ 15, 17 ], [ 18, 14 ], [ 19, 15 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Livia knows Aisha. Jim knows Liam. Dana knows Thomas. Tabitha knows Karl. Frida knows Pete. Dana knows Tabitha. Liam knows Gonzalo. Joyce knows Dana. Aisha knows Jeremiah. Livia knows Isla. Gonzalo knows Julio. Jim knows Leopold. Asher knows Joyce. Arden knows Jolene. Joyce knows Frida. Gonzalo knows Livia. Arden knows Asher. Julio knows Devin. Which of Karl and Jeremiah can Arden reach?", "answer": "Karl", "steps": [ "Arden knows Asher.", "Asher knows Joyce.", "Joyce knows Dana.", "Dana knows Tabitha.", "Tabitha knows Karl." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Arden", "Asher", "Frida", "Tabitha", "Dana", "Joyce", "Jolene", "Pete", "Karl", "Thomas", "Jim", "Liam", "Julio", "Aisha", "Livia", "Gonzalo", "Leopold", "Devin", "Jeremiah", "Isla" ], "edges": [ [ 0, 6 ], [ 0, 1 ], [ 1, 5 ], [ 2, 7 ], [ 3, 8 ], [ 4, 3 ], [ 4, 9 ], [ 5, 2 ], [ 5, 4 ], [ 10, 16 ], [ 10, 11 ], [ 11, 15 ], [ 12, 17 ], [ 13, 18 ], [ 14, 13 ], [ 14, 19 ], [ 15, 12 ], [ 15, 14 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Neil knows Jessie. Jessie knows Val. Carol knows Eileen. Neil knows Jack. Yuki knows Owen. Ron knows Carmela. Jack knows Carol. Carmela knows Katrina. Arlene knows Ricardo. Colin knows Ron. Beth knows Jem. Ron knows Arlene. Jack knows Beth. Carmela knows Samantha. Carmela knows Yuki. Jack knows Cora. Darwin knows Neil. Katrina knows Bernard. Which of Carmela and Jack can Darwin reach?", "answer": "Jack", "steps": [ "Darwin knows Neil.", "Neil knows Jack." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Darwin", "Val", "Jack", "Neil", "Jem", "Carol", "Beth", "Eileen", "Cora", "Jessie", "Colin", "Ricardo", "Carmela", "Ron", "Bernard", "Yuki", "Katrina", "Owen", "Samantha", "Arlene" ], "edges": [ [ 0, 3 ], [ 2, 6 ], [ 2, 5 ], [ 2, 8 ], [ 3, 2 ], [ 3, 9 ], [ 5, 7 ], [ 6, 4 ], [ 9, 1 ], [ 10, 13 ], [ 12, 16 ], [ 12, 15 ], [ 12, 18 ], [ 13, 12 ], [ 13, 19 ], [ 15, 17 ], [ 16, 14 ], [ 19, 11 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Harry knows Ben. Daphna knows Keira. Daphna knows Axel. Ezra knows Justine. Lambert knows James. James knows Vicki. Keira knows Edison. Wilbur knows Carey. Gwen knows Ezra. Ben knows Gene. Selena knows Dominic. Carey knows Harry. Wilbur knows Barry. Wilbur knows Eve. Barry knows Gwen. Vicki knows Ramona. Edison knows Selena. Daphna knows Lambert. Which of Gwen and James can Wilbur reach?", "answer": "Gwen", "steps": [ "Wilbur knows Barry.", "Barry knows Gwen." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Wilbur", "Justine", "Eve", "Gene", "Barry", "Gwen", "Harry", "Ezra", "Ben", "Carey", "Daphna", "Ramona", "Axel", "Dominic", "Lambert", "James", "Edison", "Vicki", "Selena", "Keira" ], "edges": [ [ 0, 2 ], [ 0, 4 ], [ 0, 9 ], [ 4, 5 ], [ 5, 7 ], [ 6, 8 ], [ 7, 1 ], [ 8, 3 ], [ 9, 6 ], [ 10, 12 ], [ 10, 14 ], [ 10, 19 ], [ 14, 15 ], [ 15, 17 ], [ 16, 18 ], [ 17, 11 ], [ 18, 13 ], [ 19, 16 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Fern knows Pierce. Adelaide knows Freya. Lisa knows Pablo. Lisa knows Dylan. Priscilla knows Eric. Fern knows Homer. Eric knows Basil. Brynn knows Jodi. Basil knows Brynn. Christian knows Adelaide. Holly knows Kelsey. Jodi knows Hubert. Brynn knows Doris. Holly knows Maureen. Brynn knows Holly. Freya knows Fern. Pierce knows Kathleen. Fern knows Lisa. Which of Pierce and Jodi can Priscilla reach?", "answer": "Jodi", "steps": [ "Priscilla knows Eric.", "Eric knows Basil.", "Basil knows Brynn.", "Brynn knows Jodi." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Priscilla", "Hubert", "Jodi", "Brynn", "Holly", "Doris", "Eric", "Kelsey", "Maureen", "Basil", "Christian", "Kathleen", "Pierce", "Fern", "Lisa", "Homer", "Adelaide", "Dylan", "Pablo", "Freya" ], "edges": [ [ 0, 6 ], [ 2, 1 ], [ 3, 2 ], [ 3, 5 ], [ 3, 4 ], [ 4, 7 ], [ 4, 8 ], [ 6, 9 ], [ 9, 3 ], [ 10, 16 ], [ 12, 11 ], [ 13, 12 ], [ 13, 15 ], [ 13, 14 ], [ 14, 17 ], [ 14, 18 ], [ 16, 19 ], [ 19, 13 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Jerry knows Heath. Annie knows Mary. Edwin knows Erma. Hampton knows Lennox. Bonnie knows Nathan. Nicole knows Tanya. Nathan knows Lucy. Bonnie knows Jacqueline. Nicole knows Elton. Heath knows Edwin. Hampton knows Edna. Jacqueline knows Ibrahim. Tanya knows Bonnie. Edwin knows Hampton. Elton knows Mason. Jerry knows Annie. Erma knows April. Nathan knows Hunter. Which of Erma and Jacqueline can Nicole reach?", "answer": "Jacqueline", "steps": [ "Nicole knows Tanya.", "Tanya knows Bonnie.", "Bonnie knows Jacqueline." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Nicole", "Ibrahim", "Bonnie", "Hunter", "Tanya", "Jacqueline", "Nathan", "Mason", "Elton", "Lucy", "Jerry", "April", "Edwin", "Edna", "Heath", "Erma", "Hampton", "Mary", "Annie", "Lennox" ], "edges": [ [ 0, 8 ], [ 0, 4 ], [ 2, 5 ], [ 2, 6 ], [ 4, 2 ], [ 5, 1 ], [ 6, 3 ], [ 6, 9 ], [ 8, 7 ], [ 10, 18 ], [ 10, 14 ], [ 12, 15 ], [ 12, 16 ], [ 14, 12 ], [ 15, 11 ], [ 16, 13 ], [ 16, 19 ], [ 18, 17 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Herbert knows Colin. Sebastian knows Terry. Herbert knows Samantha. Samantha knows Corinne. Eldon knows Max. Yolanda knows Guy. Randy knows Yolanda. Randy knows Chelsea. Terry knows Wilson. Jim knows Jesse. April knows Skyler. Guy knows April. Jim knows Herbert. Yolanda knows Luna. Samantha knows Virginia. Skyler knows Vernon. Virginia knows Sebastian. Eldon knows Randy. Which of Virginia and Guy can Jim reach?", "answer": "Virginia", "steps": [ "Jim knows Herbert.", "Herbert knows Samantha.", "Samantha knows Virginia." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Jim", "Wilson", "Jesse", "Colin", "Samantha", "Terry", "Corinne", "Virginia", "Herbert", "Sebastian", "Eldon", "Vernon", "Max", "Chelsea", "Yolanda", "Skyler", "Luna", "Guy", "Randy", "April" ], "edges": [ [ 0, 2 ], [ 0, 8 ], [ 4, 6 ], [ 4, 7 ], [ 5, 1 ], [ 7, 9 ], [ 8, 3 ], [ 8, 4 ], [ 9, 5 ], [ 10, 12 ], [ 10, 18 ], [ 14, 16 ], [ 14, 17 ], [ 15, 11 ], [ 17, 19 ], [ 18, 13 ], [ 18, 14 ], [ 19, 15 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Aaron knows Robert. Keira knows Bonnie. Doug knows Kim. Aubrey knows Roy. Aaron knows Doug. Hector knows Blake. Robert knows Keith. Lydia knows George. Evan knows Aaron. Roy knows Hector. Blake knows Keira. Doug knows Kirk. Chance knows Evan. Blake knows Luz. Kim knows Russ. Luz knows Percy. Joyce knows Chance. Luz knows Lydia. Which of Chance and Roy can Joyce reach?", "answer": "Chance", "steps": [ "Joyce knows Chance." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Joyce", "Keith", "Kirk", "Robert", "Doug", "Russ", "Aaron", "Chance", "Evan", "Kim", "Aubrey", "Bonnie", "Percy", "Keira", "Luz", "George", "Blake", "Roy", "Hector", "Lydia" ], "edges": [ [ 0, 7 ], [ 3, 1 ], [ 4, 2 ], [ 4, 9 ], [ 6, 3 ], [ 6, 4 ], [ 7, 8 ], [ 8, 6 ], [ 9, 5 ], [ 10, 17 ], [ 13, 11 ], [ 14, 12 ], [ 14, 19 ], [ 16, 13 ], [ 16, 14 ], [ 17, 18 ], [ 18, 16 ], [ 19, 15 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Kendrick knows Mitchell. Todd knows Lance. Todd knows Melody. Rena knows Abby. Rena knows Hector. Ariana knows Milton. Todd knows Dorian. Katherine knows Neville. Cameron knows Brian. Ariana knows Katherine. Humphrey knows Ariana. Kendrick knows Todd. Katherine knows Livia. Humphrey knows Kate. Ariana knows Cameron. Ariana knows Frida. Todd knows Rena. Dorian knows Trina. Which of Abby and Neville can Humphrey reach?", "answer": "Neville", "steps": [ "Humphrey knows Ariana.", "Ariana knows Katherine.", "Katherine knows Neville." ], "difficulty": 3, "original_distance": 3, "idx_to_symbol": [ "Humphrey", "Cameron", "Kate", "Brian", "Neville", "Milton", "Livia", "Frida", "Katherine", "Ariana", "Kendrick", "Dorian", "Mitchell", "Trina", "Abby", "Lance", "Hector", "Melody", "Rena", "Todd" ], "edges": [ [ 0, 2 ], [ 0, 9 ], [ 1, 3 ], [ 8, 4 ], [ 8, 6 ], [ 9, 1 ], [ 9, 5 ], [ 9, 7 ], [ 9, 8 ], [ 10, 12 ], [ 10, 19 ], [ 11, 13 ], [ 18, 14 ], [ 18, 16 ], [ 19, 11 ], [ 19, 15 ], [ 19, 17 ], [ 19, 18 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Erik knows Nicole. Kerry knows Martin. Lyle knows Jacqueline. Pablo knows Eugenia. Hayden knows Carlton. Bart knows Alan. Kerry knows Darius. Zane knows Nadine. Richard knows Shelly. Zane knows Pablo. Martin knows Wanda. Stefan knows Zane. Kerry knows Bart. Stefan knows Erik. Zane knows Richard. Lyle knows Hayden. Lyle knows Kerry. Stefan knows Liam. Which of Shelly and Alan can Lyle reach?", "answer": "Alan", "steps": [ "Lyle knows Kerry.", "Kerry knows Bart.", "Bart knows Alan." ], "difficulty": 3, "original_distance": 3, "idx_to_symbol": [ "Lyle", "Carlton", "Bart", "Hayden", "Kerry", "Alan", "Martin", "Darius", "Jacqueline", "Wanda", "Stefan", "Nicole", "Richard", "Erik", "Zane", "Shelly", "Pablo", "Nadine", "Liam", "Eugenia" ], "edges": [ [ 0, 3 ], [ 0, 8 ], [ 0, 4 ], [ 2, 5 ], [ 3, 1 ], [ 4, 2 ], [ 4, 7 ], [ 4, 6 ], [ 6, 9 ], [ 10, 13 ], [ 10, 18 ], [ 10, 14 ], [ 12, 15 ], [ 13, 11 ], [ 14, 12 ], [ 14, 17 ], [ 14, 16 ], [ 16, 19 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Ross knows Leah. Wilson knows Alma. Cynthia knows Edgar. Riley knows Cynthia. Helene knows Donovan. Edwin knows Frankie. Donovan knows Donald. Blanche knows Autumn. Alma knows Riley. Edgar knows Keira. Kara knows Blanche. Susanne knows Elmer. Edgar knows Archer. Elmer knows Hope. Hope knows Helene. Leah knows Edwin. Donovan knows Ross. Archer knows Kara. Which of Archer and Ross can Wilson reach?", "answer": "Archer", "steps": [ "Wilson knows Alma.", "Alma knows Riley.", "Riley knows Cynthia.", "Cynthia knows Edgar.", "Edgar knows Archer." ], "difficulty": 5, "original_distance": 8, "idx_to_symbol": [ "Wilson", "Riley", "Alma", "Blanche", "Archer", "Kara", "Cynthia", "Keira", "Autumn", "Edgar", "Susanne", "Hope", "Elmer", "Edwin", "Ross", "Leah", "Helene", "Donald", "Frankie", "Donovan" ], "edges": [ [ 0, 2 ], [ 1, 6 ], [ 2, 1 ], [ 3, 8 ], [ 4, 5 ], [ 5, 3 ], [ 6, 9 ], [ 9, 7 ], [ 9, 4 ], [ 10, 12 ], [ 11, 16 ], [ 12, 11 ], [ 13, 18 ], [ 14, 15 ], [ 15, 13 ], [ 16, 19 ], [ 19, 17 ], [ 19, 14 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Frida knows Jewel. Morgan knows Frida. Blanche knows Bert. Angela knows Horace. Bert knows Morgan. Clement knows Blanche. Bernadette knows Lloyd. Jewel knows Magdalena. Amber knows Rita. Archer knows Angela. Lloyd knows Juan. Angela knows Lilia. Lilia knows Melody. Melody knows Jeffery. Yvette knows Amber. Horace knows Violet. Violet knows Bernadette. Blanche knows Yvette. Which of Angela and Blanche can Archer reach?", "answer": "Angela", "steps": [ "Archer knows Angela." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Archer", "Angela", "Juan", "Bernadette", "Violet", "Melody", "Jeffery", "Horace", "Lloyd", "Lilia", "Clement", "Blanche", "Magdalena", "Frida", "Morgan", "Amber", "Rita", "Bert", "Jewel", "Yvette" ], "edges": [ [ 0, 1 ], [ 1, 7 ], [ 1, 9 ], [ 3, 8 ], [ 4, 3 ], [ 5, 6 ], [ 7, 4 ], [ 8, 2 ], [ 9, 5 ], [ 10, 11 ], [ 11, 17 ], [ 11, 19 ], [ 13, 18 ], [ 14, 13 ], [ 15, 16 ], [ 17, 14 ], [ 18, 12 ], [ 19, 15 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Cruz knows Harris. Harris knows Jenny. Mason knows Cruz. Morgan knows Kit. Mason knows Kenneth. Jacob knows Joaquin. Harris knows Dorian. Clement knows Beau. Constance knows Esme. Darius knows Max. Joaquin knows Greer. Esme knows Jose. Darius knows Jacob. Dorian knows Morgan. Gage knows Craig. Jose knows Clement. Joaquin knows Constance. Kit knows Gage. Which of Beau and Craig can Darius reach?", "answer": "Beau", "steps": [ "Darius knows Jacob.", "Jacob knows Joaquin.", "Joaquin knows Constance.", "Constance knows Esme.", "Esme knows Jose.", "Jose knows Clement.", "Clement knows Beau." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Darius", "Greer", "Jose", "Jacob", "Max", "Constance", "Clement", "Esme", "Beau", "Joaquin", "Mason", "Jenny", "Kit", "Cruz", "Kenneth", "Dorian", "Gage", "Morgan", "Craig", "Harris" ], "edges": [ [ 0, 4 ], [ 0, 3 ], [ 2, 6 ], [ 3, 9 ], [ 5, 7 ], [ 6, 8 ], [ 7, 2 ], [ 9, 1 ], [ 9, 5 ], [ 10, 14 ], [ 10, 13 ], [ 12, 16 ], [ 13, 19 ], [ 15, 17 ], [ 16, 18 ], [ 17, 12 ], [ 19, 11 ], [ 19, 15 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Myrtle knows Elijah. Jacob knows Alfred. Alfred knows Forrest. Alfred knows Anna. Elijah knows Mara. Logan knows Jacob. Yvonne knows Heather. Jennifer knows Hugh. Heather knows Clement. Mara knows Erik. Forrest knows Abel. Walt knows Sheila. Clement knows Callum. Callum knows Jocelyn. Clement knows Hadley. Jocelyn knows Jennifer. Hugh knows Walt. Abel knows Myrtle. Which of Jennifer and Myrtle can Yvonne reach?", "answer": "Jennifer", "steps": [ "Yvonne knows Heather.", "Heather knows Clement.", "Clement knows Callum.", "Callum knows Jocelyn.", "Jocelyn knows Jennifer." ], "difficulty": 5, "original_distance": 8, "idx_to_symbol": [ "Yvonne", "Jennifer", "Hadley", "Sheila", "Clement", "Callum", "Hugh", "Jocelyn", "Heather", "Walt", "Logan", "Myrtle", "Anna", "Erik", "Alfred", "Forrest", "Elijah", "Abel", "Jacob", "Mara" ], "edges": [ [ 0, 8 ], [ 1, 6 ], [ 4, 2 ], [ 4, 5 ], [ 5, 7 ], [ 6, 9 ], [ 7, 1 ], [ 8, 4 ], [ 9, 3 ], [ 10, 18 ], [ 11, 16 ], [ 14, 12 ], [ 14, 15 ], [ 15, 17 ], [ 16, 19 ], [ 17, 11 ], [ 18, 14 ], [ 19, 13 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Garrison knows Dallas. Wyatt knows Darcy. Fabian knows Wyatt. Leroy knows Quinn. Fabian knows Patrick. Kay knows Garrison. Harriet knows Doug. Garrison knows Denver. Zach knows Leroy. Harriet knows Kirk. Darcy knows Zach. Denver knows Nelson. Doug knows Saul. Kaleb knows Luis. Kirk knows Kay. Zach knows Kaleb. Dallas knows Reed. Patrick knows Luther. Which of Wyatt and Kirk can Harriet reach?", "answer": "Kirk", "steps": [ "Harriet knows Kirk." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Harriet", "Nelson", "Dallas", "Reed", "Garrison", "Denver", "Saul", "Kirk", "Doug", "Kay", "Fabian", "Quinn", "Kaleb", "Luis", "Zach", "Leroy", "Luther", "Wyatt", "Patrick", "Darcy" ], "edges": [ [ 0, 8 ], [ 0, 7 ], [ 2, 3 ], [ 4, 2 ], [ 4, 5 ], [ 5, 1 ], [ 7, 9 ], [ 8, 6 ], [ 9, 4 ], [ 10, 18 ], [ 10, 17 ], [ 12, 13 ], [ 14, 12 ], [ 14, 15 ], [ 15, 11 ], [ 17, 19 ], [ 18, 16 ], [ 19, 14 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Herbert knows Colin. Sebastian knows Terry. Herbert knows Samantha. Samantha knows Corinne. Eldon knows Max. Yolanda knows Guy. Randy knows Yolanda. Randy knows Chelsea. Terry knows Wilson. Jim knows Jesse. April knows Skyler. Guy knows April. Jim knows Herbert. Yolanda knows Luna. Samantha knows Virginia. Skyler knows Vernon. Virginia knows Sebastian. Eldon knows Randy. Which of Skyler and Terry can Jim reach?", "answer": "Terry", "steps": [ "Jim knows Herbert.", "Herbert knows Samantha.", "Samantha knows Virginia.", "Virginia knows Sebastian.", "Sebastian knows Terry." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Jim", "Wilson", "Jesse", "Colin", "Samantha", "Terry", "Corinne", "Virginia", "Herbert", "Sebastian", "Eldon", "Vernon", "Max", "Chelsea", "Yolanda", "Skyler", "Luna", "Guy", "Randy", "April" ], "edges": [ [ 0, 2 ], [ 0, 8 ], [ 4, 6 ], [ 4, 7 ], [ 5, 1 ], [ 7, 9 ], [ 8, 3 ], [ 8, 4 ], [ 9, 5 ], [ 10, 12 ], [ 10, 18 ], [ 14, 16 ], [ 14, 17 ], [ 15, 11 ], [ 17, 19 ], [ 18, 13 ], [ 18, 14 ], [ 19, 15 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Lorenzo knows Wilma. Sheryl knows Phoebe. Aubrey knows Alvin. Alyssa knows Celia. Wilma knows Irene. Chandler knows Ezra. Phoebe knows Zara. Ida knows Nelson. Alvin knows Ida. Agnes knows Lorenzo. Dirk knows Kai. Ezra knows Sheryl. Nelson knows Agnes. Adele knows Chandler. Etta knows Winston. Sheryl knows Dirk. Nelson knows Alyssa. Zara knows Etta. Which of Nelson and Sheryl can Aubrey reach?", "answer": "Nelson", "steps": [ "Aubrey knows Alvin.", "Alvin knows Ida.", "Ida knows Nelson." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Aubrey", "Nelson", "Wilma", "Lorenzo", "Irene", "Alvin", "Alyssa", "Celia", "Agnes", "Ida", "Adele", "Sheryl", "Etta", "Zara", "Winston", "Chandler", "Dirk", "Kai", "Phoebe", "Ezra" ], "edges": [ [ 0, 5 ], [ 1, 6 ], [ 1, 8 ], [ 2, 4 ], [ 3, 2 ], [ 5, 9 ], [ 6, 7 ], [ 8, 3 ], [ 9, 1 ], [ 10, 15 ], [ 11, 16 ], [ 11, 18 ], [ 12, 14 ], [ 13, 12 ], [ 15, 19 ], [ 16, 17 ], [ 18, 13 ], [ 19, 11 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Myra knows Dalton. Jeremiah knows Ted. Georgia knows Elena. Aubrey knows Drake. Aria knows August. Georgia knows Mark. Drake knows Kenneth. Madeline knows Aria. Leigh knows Kaleb. Drake knows Humphrey. Ted knows Georgia. Kaleb knows Aubrey. Myra knows Deborah. August knows Jon. Kenneth knows Myra. Jeremiah knows Emanuel. Fabian knows Leigh. Jon knows Jeremiah. Which of Aria and Leigh can Fabian reach?", "answer": "Leigh", "steps": [ "Fabian knows Leigh." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Fabian", "Leigh", "Myra", "Aubrey", "Humphrey", "Drake", "Kenneth", "Deborah", "Dalton", "Kaleb", "Madeline", "Aria", "Georgia", "Jon", "Emanuel", "Jeremiah", "Ted", "Elena", "Mark", "August" ], "edges": [ [ 0, 1 ], [ 1, 9 ], [ 2, 7 ], [ 2, 8 ], [ 3, 5 ], [ 5, 4 ], [ 5, 6 ], [ 6, 2 ], [ 9, 3 ], [ 10, 11 ], [ 11, 19 ], [ 12, 17 ], [ 12, 18 ], [ 13, 15 ], [ 15, 14 ], [ 15, 16 ], [ 16, 12 ], [ 19, 13 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Josie knows Gideon. Benjamin knows Chris. Fletcher knows Peter. Lloyd knows Hadley. Lark knows Bruno. Gideon knows Reed. Chris knows Archie. Tabitha knows Zara. Benjamin knows Tabitha. Gideon knows Fletcher. Peter knows Cara. Bruno knows Benjamin. Lloyd knows Ariel. Fletcher knows Lloyd. Tabitha knows Chad. Bruno knows Troy. Lloyd knows Rose. Tabitha knows Anita. Which of Bruno and Gideon can Lark reach?", "answer": "Bruno", "steps": [ "Lark knows Bruno." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Lark", "Troy", "Archie", "Chad", "Anita", "Zara", "Tabitha", "Benjamin", "Chris", "Bruno", "Josie", "Reed", "Cara", "Hadley", "Rose", "Ariel", "Lloyd", "Fletcher", "Peter", "Gideon" ], "edges": [ [ 0, 9 ], [ 6, 3 ], [ 6, 4 ], [ 6, 5 ], [ 7, 6 ], [ 7, 8 ], [ 8, 2 ], [ 9, 1 ], [ 9, 7 ], [ 10, 19 ], [ 16, 13 ], [ 16, 14 ], [ 16, 15 ], [ 17, 16 ], [ 17, 18 ], [ 18, 12 ], [ 19, 11 ], [ 19, 17 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Hubert knows Vivian. Victoria knows Becky. Cornelius knows Lark. Alyssa knows Caroline. Dana knows Lorraine. Lark knows Ruth. Allen knows Hendrix. Sebastian knows Victoria. Vivian knows Tabitha. Harris knows Dana. Becky knows Eamon. Eamon knows Alyssa. Lorraine knows Lawrence. Caroline knows Chloe. Lorraine knows Cornelius. Lawrence knows Randy. Alyssa knows Hubert. Hendrix knows Harris. Which of Eamon and Dana can Allen reach?", "answer": "Dana", "steps": [ "Allen knows Hendrix.", "Hendrix knows Harris.", "Harris knows Dana." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Allen", "Lawrence", "Cornelius", "Harris", "Lark", "Dana", "Ruth", "Lorraine", "Hendrix", "Randy", "Sebastian", "Caroline", "Hubert", "Becky", "Vivian", "Eamon", "Tabitha", "Alyssa", "Victoria", "Chloe" ], "edges": [ [ 0, 8 ], [ 1, 9 ], [ 2, 4 ], [ 3, 5 ], [ 4, 6 ], [ 5, 7 ], [ 7, 2 ], [ 7, 1 ], [ 8, 3 ], [ 10, 18 ], [ 11, 19 ], [ 12, 14 ], [ 13, 15 ], [ 14, 16 ], [ 15, 17 ], [ 17, 12 ], [ 17, 11 ], [ 18, 13 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Hope knows Edison. Leon knows Eloise. Hope knows Dina. Horace knows Harrison. Zoe knows Alana. Julius knows Nancy. Randy knows Horace. Axel knows Julius. Zoe knows Kennedy. Harrison knows Esperanza. Dina knows Randy. Leon knows Haven. Shelly knows Opal. Dina knows Leon. Alana knows Shelly. Tracy knows Axel. Shelly knows Dustin. Alana knows Tracy. Which of Esperanza and Nancy can Zoe reach?", "answer": "Nancy", "steps": [ "Zoe knows Alana.", "Alana knows Tracy.", "Tracy knows Axel.", "Axel knows Julius.", "Julius knows Nancy." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Zoe", "Alana", "Julius", "Shelly", "Tracy", "Dustin", "Kennedy", "Nancy", "Axel", "Opal", "Hope", "Dina", "Harrison", "Leon", "Randy", "Haven", "Edison", "Esperanza", "Horace", "Eloise" ], "edges": [ [ 0, 6 ], [ 0, 1 ], [ 1, 4 ], [ 1, 3 ], [ 2, 7 ], [ 3, 5 ], [ 3, 9 ], [ 4, 8 ], [ 8, 2 ], [ 10, 16 ], [ 10, 11 ], [ 11, 14 ], [ 11, 13 ], [ 12, 17 ], [ 13, 15 ], [ 13, 19 ], [ 14, 18 ], [ 18, 12 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Kent knows Spencer. Virginia knows Stanley. Desmond knows Seth. Erwin knows Stuart. Stuart knows Clarissa. Kira knows Harlan. Virginia knows Pierce. Virginia knows Douglas. Douglas knows Amanda. Erwin knows Kent. Kent knows Quinn. Tony knows Erwin. Gage knows Dalton. Seth knows Gage. Kent knows Kira. Virginia knows Chad. Seth knows Virginia. Kent knows Darnell. Which of Amanda and Harlan can Tony reach?", "answer": "Harlan", "steps": [ "Tony knows Erwin.", "Erwin knows Kent.", "Kent knows Kira.", "Kira knows Harlan." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Tony", "Spencer", "Erwin", "Clarissa", "Stuart", "Kent", "Kira", "Harlan", "Darnell", "Quinn", "Desmond", "Pierce", "Seth", "Dalton", "Gage", "Virginia", "Douglas", "Amanda", "Chad", "Stanley" ], "edges": [ [ 0, 2 ], [ 2, 4 ], [ 2, 5 ], [ 4, 3 ], [ 5, 1 ], [ 5, 6 ], [ 5, 8 ], [ 5, 9 ], [ 6, 7 ], [ 10, 12 ], [ 12, 14 ], [ 12, 15 ], [ 14, 13 ], [ 15, 11 ], [ 15, 16 ], [ 15, 18 ], [ 15, 19 ], [ 16, 17 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Dean knows Geneva. Grant knows Tanya. Destiny knows Alyson. Annie knows Dustin. Tanya knows Ford. Paula knows Rachel. Randy knows Delilah. Destiny knows Melody. Ford knows Paul. Dina knows Grant. Luis knows Annie. Rachel knows Randy. Dina knows Gregory. Randy knows Christopher. Ford knows Norma. Annie knows Paula. Melody knows Dina. Dean knows Luis. Which of Paul and Christopher can Destiny reach?", "answer": "Paul", "steps": [ "Destiny knows Melody.", "Melody knows Dina.", "Dina knows Grant.", "Grant knows Tanya.", "Tanya knows Ford.", "Ford knows Paul." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Destiny", "Ford", "Melody", "Gregory", "Norma", "Paul", "Grant", "Dina", "Alyson", "Tanya", "Dean", "Randy", "Luis", "Dustin", "Delilah", "Christopher", "Paula", "Annie", "Geneva", "Rachel" ], "edges": [ [ 0, 8 ], [ 0, 2 ], [ 1, 4 ], [ 1, 5 ], [ 2, 7 ], [ 6, 9 ], [ 7, 3 ], [ 7, 6 ], [ 9, 1 ], [ 10, 18 ], [ 10, 12 ], [ 11, 14 ], [ 11, 15 ], [ 12, 17 ], [ 16, 19 ], [ 17, 13 ], [ 17, 16 ], [ 19, 11 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Daria knows Amanda. Joel knows Kevin. Otto knows Ibrahim. Jeffery knows Adelaide. Latoya knows Shaun. Amanda knows Esperanza. Brad knows Vera. Tiffany knows Crystal. Ava knows Latoya. Kevin knows Otto. Otto knows Ava. Esperanza knows Jeffery. Vera knows Tiffany. Esperanza knows Donna. Shaun knows Jenny. Dixie knows Conner. Tiffany knows Daria. Shaun knows Dixie. Which of Adelaide and Conner can Joel reach?", "answer": "Conner", "steps": [ "Joel knows Kevin.", "Kevin knows Otto.", "Otto knows Ava.", "Ava knows Latoya.", "Latoya knows Shaun.", "Shaun knows Dixie.", "Dixie knows Conner." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Joel", "Otto", "Dixie", "Kevin", "Shaun", "Latoya", "Conner", "Jenny", "Ibrahim", "Ava", "Brad", "Tiffany", "Jeffery", "Vera", "Esperanza", "Amanda", "Adelaide", "Donna", "Crystal", "Daria" ], "edges": [ [ 0, 3 ], [ 1, 8 ], [ 1, 9 ], [ 2, 6 ], [ 3, 1 ], [ 4, 2 ], [ 4, 7 ], [ 5, 4 ], [ 9, 5 ], [ 10, 13 ], [ 11, 18 ], [ 11, 19 ], [ 12, 16 ], [ 13, 11 ], [ 14, 12 ], [ 14, 17 ], [ 15, 14 ], [ 19, 15 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Cara knows Mark. Keaton knows Melody. Nelson knows Cristina. Keaton knows Adrian. Adrian knows Latoya. Herbert knows Dale. Kristina knows Aurora. Aurora knows Cara. Herbert knows Morris. Lauren knows Bennett. Dustin knows Grant. Morris knows Dustin. Miles knows Lauren. Nelson knows Jameson. Jameson knows Keaton. Kristina knows Leticia. Cara knows Herbert. Adrian knows Miles. Which of Dustin and Lauren can Nelson reach?", "answer": "Lauren", "steps": [ "Nelson knows Jameson.", "Jameson knows Keaton.", "Keaton knows Adrian.", "Adrian knows Miles.", "Miles knows Lauren." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Nelson", "Melody", "Latoya", "Miles", "Bennett", "Adrian", "Jameson", "Cristina", "Keaton", "Lauren", "Kristina", "Mark", "Dale", "Morris", "Grant", "Herbert", "Aurora", "Leticia", "Cara", "Dustin" ], "edges": [ [ 0, 7 ], [ 0, 6 ], [ 3, 9 ], [ 5, 2 ], [ 5, 3 ], [ 6, 8 ], [ 8, 1 ], [ 8, 5 ], [ 9, 4 ], [ 10, 17 ], [ 10, 16 ], [ 13, 19 ], [ 15, 12 ], [ 15, 13 ], [ 16, 18 ], [ 18, 11 ], [ 18, 15 ], [ 19, 14 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Reid knows Autumn. Selena knows Duke. Autumn knows Emanuel. Goldie knows Kenneth. Goldie knows Farrah. Thea knows Grover. Kendra knows Thea. Jean knows Doug. Kendra knows Amanda. Kenneth knows Stefan. Autumn knows Harold. Kendra knows Reid. Goldie knows Selena. Jean knows Palmer. Amanda knows Catherine. Jean knows Ursula. Farrah knows Jean. Autumn knows Winifred. Which of Jean and Autumn can Goldie reach?", "answer": "Jean", "steps": [ "Goldie knows Farrah.", "Farrah knows Jean." ], "difficulty": 2, "original_distance": 3, "idx_to_symbol": [ "Goldie", "Palmer", "Duke", "Jean", "Stefan", "Kenneth", "Selena", "Doug", "Farrah", "Ursula", "Kendra", "Harold", "Grover", "Autumn", "Catherine", "Amanda", "Thea", "Winifred", "Reid", "Emanuel" ], "edges": [ [ 0, 5 ], [ 0, 6 ], [ 0, 8 ], [ 3, 1 ], [ 3, 7 ], [ 3, 9 ], [ 5, 4 ], [ 6, 2 ], [ 8, 3 ], [ 10, 15 ], [ 10, 16 ], [ 10, 18 ], [ 13, 11 ], [ 13, 17 ], [ 13, 19 ], [ 15, 14 ], [ 16, 12 ], [ 18, 13 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Stuart knows Ryan. Clark knows Colby. Adam knows Jarvis. Stuart knows Herbert. Rosemary knows Jameson. Zane knows Stuart. Zane knows Ian. Felix knows Adam. Jarvis knows Irene. Irene knows Clark. Zane knows Alyssa. Ryan knows Oscar. Colby knows Clay. Jarvis knows Damian. Jameson knows Zane. Jarvis knows Simon. Oscar knows Livia. Irene knows Alison. Which of Jarvis and Zane can Felix reach?", "answer": "Jarvis", "steps": [ "Felix knows Adam.", "Adam knows Jarvis." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Felix", "Colby", "Simon", "Clark", "Alison", "Adam", "Irene", "Damian", "Clay", "Jarvis", "Rosemary", "Oscar", "Ian", "Ryan", "Herbert", "Jameson", "Stuart", "Alyssa", "Livia", "Zane" ], "edges": [ [ 0, 5 ], [ 1, 8 ], [ 3, 1 ], [ 5, 9 ], [ 6, 4 ], [ 6, 3 ], [ 9, 2 ], [ 9, 7 ], [ 9, 6 ], [ 10, 15 ], [ 11, 18 ], [ 13, 11 ], [ 15, 19 ], [ 16, 14 ], [ 16, 13 ], [ 19, 12 ], [ 19, 17 ], [ 19, 16 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Elvira knows Anthony. Anthony knows Cindy. Eunice knows Anastasia. Rhonda knows Eunice. Clyde knows Jade. Clyde knows Selena. Willard knows Diego. Eunice knows Lionel. Trina knows Rhonda. Denver knows Owen. Itzel knows Trina. Itzel knows Joan. Phoebe knows Elvira. Denver knows Oliver. Phoebe knows Clyde. Owen knows Phoebe. Diego knows Richard. Rhonda knows Willard. Which of Willard and Elvira can Itzel reach?", "answer": "Willard", "steps": [ "Itzel knows Trina.", "Trina knows Rhonda.", "Rhonda knows Willard." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Itzel", "Lionel", "Rhonda", "Richard", "Diego", "Joan", "Anastasia", "Trina", "Willard", "Eunice", "Denver", "Selena", "Phoebe", "Cindy", "Anthony", "Oliver", "Jade", "Owen", "Elvira", "Clyde" ], "edges": [ [ 0, 5 ], [ 0, 7 ], [ 2, 8 ], [ 2, 9 ], [ 4, 3 ], [ 7, 2 ], [ 8, 4 ], [ 9, 1 ], [ 9, 6 ], [ 10, 15 ], [ 10, 17 ], [ 12, 18 ], [ 12, 19 ], [ 14, 13 ], [ 17, 12 ], [ 18, 14 ], [ 19, 11 ], [ 19, 16 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Vivian knows June. Gareth knows Burt. Glen knows Aisha. Gilbert knows Glen. Karl knows Henry. Layla knows Alice. June knows Caleb. Blair knows Cate. Blair knows Mitchell. Jackson knows Karl. Mitchell knows Vivian. Cate knows Layla. Aisha knows Gareth. Jack knows Rowan. Burt knows Hudson. Rowan knows Blair. Glen knows Jackson. Jolena knows Gilbert. Which of Gilbert and Rowan can Jack reach?", "answer": "Rowan", "steps": [ "Jack knows Rowan." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Jack", "Vivian", "Layla", "Rowan", "Blair", "Cate", "Caleb", "June", "Alice", "Mitchell", "Jolena", "Gareth", "Karl", "Gilbert", "Glen", "Jackson", "Hudson", "Burt", "Henry", "Aisha" ], "edges": [ [ 0, 3 ], [ 1, 7 ], [ 2, 8 ], [ 3, 4 ], [ 4, 5 ], [ 4, 9 ], [ 5, 2 ], [ 7, 6 ], [ 9, 1 ], [ 10, 13 ], [ 11, 17 ], [ 12, 18 ], [ 13, 14 ], [ 14, 15 ], [ 14, 19 ], [ 15, 12 ], [ 17, 16 ], [ 19, 11 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Hank knows Reed. Elmer knows Mindy. Zachary knows Langston. Blaine knows Finn. Finn knows Geoffrey. Xander knows Elmer. Reed knows Davis. Mindy knows Miriam. Davis knows Fanny. Xander knows Allen. Geoffrey knows Dolores. Zachary knows Val. Glen knows Essie. Celia knows Zachary. Carmen knows Xander. Dolores knows Carmen. Val knows Glen. Fanny knows Celia. Which of Xander and Zachary can Blaine reach?", "answer": "Xander", "steps": [ "Blaine knows Finn.", "Finn knows Geoffrey.", "Geoffrey knows Dolores.", "Dolores knows Carmen.", "Carmen knows Xander." ], "difficulty": 5, "original_distance": 8, "idx_to_symbol": [ "Blaine", "Geoffrey", "Carmen", "Dolores", "Allen", "Miriam", "Elmer", "Xander", "Finn", "Mindy", "Hank", "Davis", "Celia", "Fanny", "Langston", "Essie", "Val", "Zachary", "Reed", "Glen" ], "edges": [ [ 0, 8 ], [ 1, 3 ], [ 2, 7 ], [ 3, 2 ], [ 6, 9 ], [ 7, 4 ], [ 7, 6 ], [ 8, 1 ], [ 9, 5 ], [ 10, 18 ], [ 11, 13 ], [ 12, 17 ], [ 13, 12 ], [ 16, 19 ], [ 17, 14 ], [ 17, 16 ], [ 18, 11 ], [ 19, 15 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Leon knows Richard. Carrie knows Eldon. Carrie knows Freya. Conrad knows Zoe. Eldon knows Marian. Inez knows Leon. Dahlia knows Beatrice. Kieran knows Erma. Emery knows Vincent. Beatrice knows Kieran. Frankie knows Emery. Erma knows Goldie. Richard knows Bailey. Dahlia knows Conrad. Marian knows Neal. Freya knows Yolanda. Goldie knows Frankie. Neal knows Inez. Which of Richard and Emery can Dahlia reach?", "answer": "Emery", "steps": [ "Dahlia knows Beatrice.", "Beatrice knows Kieran.", "Kieran knows Erma.", "Erma knows Goldie.", "Goldie knows Frankie.", "Frankie knows Emery." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Dahlia", "Erma", "Conrad", "Goldie", "Kieran", "Beatrice", "Emery", "Vincent", "Zoe", "Frankie", "Carrie", "Neal", "Freya", "Inez", "Marian", "Eldon", "Richard", "Bailey", "Yolanda", "Leon" ], "edges": [ [ 0, 2 ], [ 0, 5 ], [ 1, 3 ], [ 2, 8 ], [ 3, 9 ], [ 4, 1 ], [ 5, 4 ], [ 6, 7 ], [ 9, 6 ], [ 10, 12 ], [ 10, 15 ], [ 11, 13 ], [ 12, 18 ], [ 13, 19 ], [ 14, 11 ], [ 15, 14 ], [ 16, 17 ], [ 19, 16 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Lamar knows Pete. Darcy knows Hayes. Aaron knows Teresa. Grace knows Hazel. Kara knows Mack. Pete knows Ada. June knows Aaron. Nina knows Israel. Myra knows June. Israel knows Darcy. Myra knows Grace. Mack knows Joshua. Hazel knows Lamar. Kara knows Kamila. Joshua knows Clyde. Joshua knows Serena. Aaron knows Audrey. Kamila knows Nina. Which of Nina and Hazel can Myra reach?", "answer": "Hazel", "steps": [ "Myra knows Grace.", "Grace knows Hazel." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Myra", "Hazel", "Teresa", "Ada", "Grace", "Lamar", "Audrey", "June", "Pete", "Aaron", "Kara", "Nina", "Serena", "Hayes", "Kamila", "Israel", "Clyde", "Mack", "Darcy", "Joshua" ], "edges": [ [ 0, 4 ], [ 0, 7 ], [ 1, 5 ], [ 4, 1 ], [ 5, 8 ], [ 7, 9 ], [ 8, 3 ], [ 9, 2 ], [ 9, 6 ], [ 10, 14 ], [ 10, 17 ], [ 11, 15 ], [ 14, 11 ], [ 15, 18 ], [ 17, 19 ], [ 18, 13 ], [ 19, 12 ], [ 19, 16 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Joyce knows Sara. Harris knows Wendell. Bernard knows Marion. Donna knows Merle. Harris knows Ray. Wendell knows Estella. Leonard knows Lorraine. Geoffrey knows Jerry. Harris knows Floyd. Merle knows Geoffrey. Ray knows Fabian. Merle knows Joyce. Fabian knows Marilyn. Floyd knows Derek. Bernard knows Harris. Lorraine knows Israel. Donna knows Beau. Merle knows Leonard. Which of Leonard and Ray can Donna reach?", "answer": "Leonard", "steps": [ "Donna knows Merle.", "Merle knows Leonard." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Donna", "Geoffrey", "Sara", "Beau", "Jerry", "Leonard", "Israel", "Lorraine", "Merle", "Joyce", "Bernard", "Floyd", "Estella", "Marion", "Derek", "Ray", "Marilyn", "Fabian", "Harris", "Wendell" ], "edges": [ [ 0, 3 ], [ 0, 8 ], [ 1, 4 ], [ 5, 7 ], [ 7, 6 ], [ 8, 1 ], [ 8, 5 ], [ 8, 9 ], [ 9, 2 ], [ 10, 13 ], [ 10, 18 ], [ 11, 14 ], [ 15, 17 ], [ 17, 16 ], [ 18, 11 ], [ 18, 15 ], [ 18, 19 ], [ 19, 12 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Dennis knows Florence. Holly knows Andrea. Celeste knows Cliff. Aubrey knows Dennis. Cliff knows Dustin. Florence knows Jean. Jordan knows Devin. Vivian knows Gavin. Esther knows Celeste. Vivian knows Norman. Kerry knows Annette. Cara knows Esther. Jean knows Vivian. Dennis knows Jordan. Jean knows Joan. Esther knows Holly. Cliff knows Kerry. Kerry knows Latoya. Which of Dennis and Esther can Aubrey reach?", "answer": "Dennis", "steps": [ "Aubrey knows Dennis." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Aubrey", "Florence", "Devin", "Joan", "Dennis", "Jordan", "Norman", "Vivian", "Jean", "Gavin", "Cara", "Celeste", "Andrea", "Dustin", "Esther", "Holly", "Annette", "Kerry", "Cliff", "Latoya" ], "edges": [ [ 0, 4 ], [ 1, 8 ], [ 4, 5 ], [ 4, 1 ], [ 5, 2 ], [ 7, 6 ], [ 7, 9 ], [ 8, 3 ], [ 8, 7 ], [ 10, 14 ], [ 11, 18 ], [ 14, 15 ], [ 14, 11 ], [ 15, 12 ], [ 17, 16 ], [ 17, 19 ], [ 18, 13 ], [ 18, 17 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Imogen knows William. Daisy knows Cameron. Cameron knows Tina. Nelson knows Winston. Lorenzo knows Fabian. Leigh knows Daisy. Ibrahim knows Lucy. Imogen knows Declan. Fabian knows Imogen. Cameron knows Christopher. Cameron knows Lorenzo. Rosemary knows Ibrahim. Winston knows Molly. Molly knows Damien. Ibrahim knows Ted. Ibrahim knows Nelson. Damian knows Rosemary. Molly knows Scott. Which of Ibrahim and Cameron can Damian reach?", "answer": "Ibrahim", "steps": [ "Damian knows Rosemary.", "Rosemary knows Ibrahim." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Damian", "Ibrahim", "Scott", "Ted", "Winston", "Nelson", "Molly", "Rosemary", "Damien", "Lucy", "Leigh", "Cameron", "Declan", "Tina", "Fabian", "Lorenzo", "Imogen", "Daisy", "William", "Christopher" ], "edges": [ [ 0, 7 ], [ 1, 3 ], [ 1, 5 ], [ 1, 9 ], [ 4, 6 ], [ 5, 4 ], [ 6, 2 ], [ 6, 8 ], [ 7, 1 ], [ 10, 17 ], [ 11, 13 ], [ 11, 15 ], [ 11, 19 ], [ 14, 16 ], [ 15, 14 ], [ 16, 12 ], [ 16, 18 ], [ 17, 11 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Ira knows Hayes. Farrah knows Perry. Hayes knows Gareth. Paula knows Jude. Allison knows Jolena. Dell knows Xavier. Gareth knows Esme. August knows Lily. Jolena knows Avery. Jude knows August. Rick knows Farrah. Kurt knows Essie. Perry knows Allison. Jude knows Leopold. Kurt knows Rick. Rick knows Dell. Leopold knows Ira. Paula knows Priscilla. Which of Jolena and Gareth can Kurt reach?", "answer": "Jolena", "steps": [ "Kurt knows Rick.", "Rick knows Farrah.", "Farrah knows Perry.", "Perry knows Allison.", "Allison knows Jolena." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Kurt", "Jolena", "Rick", "Xavier", "Dell", "Allison", "Perry", "Farrah", "Essie", "Avery", "Paula", "Gareth", "Jude", "Lily", "August", "Hayes", "Ira", "Leopold", "Priscilla", "Esme" ], "edges": [ [ 0, 8 ], [ 0, 2 ], [ 1, 9 ], [ 2, 4 ], [ 2, 7 ], [ 4, 3 ], [ 5, 1 ], [ 6, 5 ], [ 7, 6 ], [ 10, 18 ], [ 10, 12 ], [ 11, 19 ], [ 12, 14 ], [ 12, 17 ], [ 14, 13 ], [ 15, 11 ], [ 16, 15 ], [ 17, 16 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Alice knows Simon. Kylie knows Glen. Simon knows Kevin. Ellen knows Fernando. Alice knows Tom. Kylie knows Roland. Kylie knows Alexa. Roland knows Dennis. Alice knows Ellen. Glen knows Jessica. Autumn knows Catherine. Maya knows Rhonda. Rhonda knows Giselle. Maya knows Kylie. Catherine knows Denise. Autumn knows Alice. Glen knows Raymond. Simon knows Ashton. Which of Ashton and Raymond can Autumn reach?", "answer": "Ashton", "steps": [ "Autumn knows Alice.", "Alice knows Simon.", "Simon knows Ashton." ], "difficulty": 3, "original_distance": 3, "idx_to_symbol": [ "Autumn", "Ellen", "Alice", "Catherine", "Denise", "Fernando", "Ashton", "Tom", "Simon", "Kevin", "Maya", "Roland", "Kylie", "Rhonda", "Giselle", "Dennis", "Raymond", "Alexa", "Glen", "Jessica" ], "edges": [ [ 0, 3 ], [ 0, 2 ], [ 1, 5 ], [ 2, 1 ], [ 2, 7 ], [ 2, 8 ], [ 3, 4 ], [ 8, 6 ], [ 8, 9 ], [ 10, 13 ], [ 10, 12 ], [ 11, 15 ], [ 12, 11 ], [ 12, 17 ], [ 12, 18 ], [ 13, 14 ], [ 18, 16 ], [ 18, 19 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Natalie knows Trina. Philip knows Kelsey. Xander knows Lawson. Charles knows Harmony. Harris knows Gareth. Kelsey knows Natalie. Antonio knows Gonzalo. Veronica knows Daria. Philip knows Veronica. Kelsey knows Blake. Charles knows Joaquin. Lawson knows Alice. Trina knows Michelle. Harris knows Philip. Harmony knows Antonio. Alice knows Perry. Xander knows Heath. Lawson knows Charles. Which of Kelsey and Charles can Harris reach?", "answer": "Kelsey", "steps": [ "Harris knows Philip.", "Philip knows Kelsey." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Harris", "Philip", "Daria", "Veronica", "Trina", "Blake", "Gareth", "Kelsey", "Natalie", "Michelle", "Xander", "Lawson", "Perry", "Alice", "Antonio", "Joaquin", "Heath", "Charles", "Harmony", "Gonzalo" ], "edges": [ [ 0, 6 ], [ 0, 1 ], [ 1, 3 ], [ 1, 7 ], [ 3, 2 ], [ 4, 9 ], [ 7, 5 ], [ 7, 8 ], [ 8, 4 ], [ 10, 16 ], [ 10, 11 ], [ 11, 13 ], [ 11, 17 ], [ 13, 12 ], [ 14, 19 ], [ 17, 15 ], [ 17, 18 ], [ 18, 14 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Frida knows Jewel. Morgan knows Frida. Blanche knows Bert. Angela knows Horace. Bert knows Morgan. Clement knows Blanche. Bernadette knows Lloyd. Jewel knows Magdalena. Amber knows Rita. Archer knows Angela. Lloyd knows Juan. Angela knows Lilia. Lilia knows Melody. Melody knows Jeffery. Yvette knows Amber. Horace knows Violet. Violet knows Bernadette. Blanche knows Yvette. Which of Jewel and Lloyd can Archer reach?", "answer": "Lloyd", "steps": [ "Archer knows Angela.", "Angela knows Horace.", "Horace knows Violet.", "Violet knows Bernadette.", "Bernadette knows Lloyd." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Archer", "Angela", "Juan", "Bernadette", "Violet", "Melody", "Jeffery", "Horace", "Lloyd", "Lilia", "Clement", "Blanche", "Magdalena", "Frida", "Morgan", "Amber", "Rita", "Bert", "Jewel", "Yvette" ], "edges": [ [ 0, 1 ], [ 1, 7 ], [ 1, 9 ], [ 3, 8 ], [ 4, 3 ], [ 5, 6 ], [ 7, 4 ], [ 8, 2 ], [ 9, 5 ], [ 10, 11 ], [ 11, 17 ], [ 11, 19 ], [ 13, 18 ], [ 14, 13 ], [ 15, 16 ], [ 17, 14 ], [ 18, 12 ], [ 19, 15 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Ernesto knows Gerald. Sadie knows Jenna. Bernard knows Theodore. Karen knows Gloria. Steve knows Daisy. Yvonne knows Eloise. Bernard knows Steve. Gertrude knows Dorothy. Sadie knows Allison. Jenna knows Ernesto. Jenna knows Irene. Erin knows Yvonne. Allison knows Karen. Jenna knows Gus. Theodore knows Gertrude. Steve knows Erin. Steve knows Leander. Gerald knows Kaleb. Which of Jenna and Steve can Sadie reach?", "answer": "Jenna", "steps": [ "Sadie knows Jenna." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Sadie", "Gloria", "Gus", "Jenna", "Irene", "Allison", "Gerald", "Ernesto", "Kaleb", "Karen", "Bernard", "Dorothy", "Leander", "Steve", "Daisy", "Theodore", "Yvonne", "Erin", "Eloise", "Gertrude" ], "edges": [ [ 0, 3 ], [ 0, 5 ], [ 3, 2 ], [ 3, 4 ], [ 3, 7 ], [ 5, 9 ], [ 6, 8 ], [ 7, 6 ], [ 9, 1 ], [ 10, 13 ], [ 10, 15 ], [ 13, 12 ], [ 13, 14 ], [ 13, 17 ], [ 15, 19 ], [ 16, 18 ], [ 17, 16 ], [ 19, 11 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Dawn knows Adam. Gene knows Connor. Adam knows Finn. Finn knows Megan. Fanny knows Dawn. Avery knows Dell. Wilson knows Avery. Marilyn knows Gideon. Megan knows Gene. Gideon knows Lorraine. Etta knows Wilson. Curtis knows James. Lars knows Etta. Connor knows Bonnie. Gene knows Lawson. Francesca knows Fanny. Avery knows Curtis. Lorraine knows Lars. Which of Dawn and Lorraine can Marilyn reach?", "answer": "Lorraine", "steps": [ "Marilyn knows Gideon.", "Gideon knows Lorraine." ], "difficulty": 2, "original_distance": 8, "idx_to_symbol": [ "Marilyn", "Lorraine", "Etta", "Curtis", "Wilson", "Gideon", "Dell", "James", "Avery", "Lars", "Francesca", "Dawn", "Finn", "Connor", "Megan", "Fanny", "Lawson", "Bonnie", "Gene", "Adam" ], "edges": [ [ 0, 5 ], [ 1, 9 ], [ 2, 4 ], [ 3, 7 ], [ 4, 8 ], [ 5, 1 ], [ 8, 6 ], [ 8, 3 ], [ 9, 2 ], [ 10, 15 ], [ 11, 19 ], [ 12, 14 ], [ 13, 17 ], [ 14, 18 ], [ 15, 11 ], [ 18, 16 ], [ 18, 13 ], [ 19, 12 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Joshua knows Ariel. Liam knows Monroe. Elvira knows Frida. Otto knows Goldie. Ariel knows Liam. Anton knows Otto. Ilene knows Carla. Monroe knows Hunter. Anton knows Norma. Anton knows Hardy. Liam knows Gregory. Ilene knows Anton. Ray knows Jeremiah. Monroe knows Lawson. Monroe knows Elvira. Norma knows Harrison. Hunter knows Dustin. Jeremiah knows Ilene. Which of Monroe and Anton can Ray reach?", "answer": "Anton", "steps": [ "Ray knows Jeremiah.", "Jeremiah knows Ilene.", "Ilene knows Anton." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Ray", "Norma", "Carla", "Jeremiah", "Ilene", "Hardy", "Anton", "Harrison", "Otto", "Goldie", "Joshua", "Elvira", "Gregory", "Ariel", "Liam", "Lawson", "Monroe", "Frida", "Hunter", "Dustin" ], "edges": [ [ 0, 3 ], [ 1, 7 ], [ 3, 4 ], [ 4, 2 ], [ 4, 6 ], [ 6, 5 ], [ 6, 1 ], [ 6, 8 ], [ 8, 9 ], [ 10, 13 ], [ 11, 17 ], [ 13, 14 ], [ 14, 12 ], [ 14, 16 ], [ 16, 15 ], [ 16, 11 ], [ 16, 18 ], [ 18, 19 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Judith knows Lillian. Kendra knows Dora. Dudley knows Judith. Darcy knows Hector. Lance knows Kendra. Declan knows Jem. Ford knows Giselle. Chelsea knows Ford. Mike knows Kim. Kendra knows Chelsea. Kim knows Lance. Russell knows Mike. Declan knows Dudley. Jon knows Darcy. Kim knows Patricia. Judith knows Jon. Paula knows Elias. Elias knows Declan. Which of Hector and Giselle can Russell reach?", "answer": "Giselle", "steps": [ "Russell knows Mike.", "Mike knows Kim.", "Kim knows Lance.", "Lance knows Kendra.", "Kendra knows Chelsea.", "Chelsea knows Ford.", "Ford knows Giselle." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Russell", "Lance", "Kendra", "Ford", "Patricia", "Dora", "Mike", "Kim", "Giselle", "Chelsea", "Paula", "Dudley", "Judith", "Darcy", "Jem", "Lillian", "Elias", "Declan", "Hector", "Jon" ], "edges": [ [ 0, 6 ], [ 1, 2 ], [ 2, 5 ], [ 2, 9 ], [ 3, 8 ], [ 6, 7 ], [ 7, 4 ], [ 7, 1 ], [ 9, 3 ], [ 10, 16 ], [ 11, 12 ], [ 12, 15 ], [ 12, 19 ], [ 13, 18 ], [ 16, 17 ], [ 17, 14 ], [ 17, 11 ], [ 19, 13 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Mara knows Heath. Emmett knows Doris. Gregory knows Michelle. Gemma knows Vicki. Gregory knows Darren. Luke knows Mae. Vicki knows Isaac. Mia knows Elaine. Heath knows Mia. Mae knows Autumn. Isaac knows Ira. Luke knows Hadley. Autumn knows Gregory. Doris knows Luke. Doris knows Edward. Isaac knows Mara. Vicki knows Leonard. Mia knows Della. Which of Della and Michelle can Gemma reach?", "answer": "Della", "steps": [ "Gemma knows Vicki.", "Vicki knows Isaac.", "Isaac knows Mara.", "Mara knows Heath.", "Heath knows Mia.", "Mia knows Della." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Gemma", "Ira", "Leonard", "Mara", "Vicki", "Elaine", "Isaac", "Mia", "Heath", "Della", "Emmett", "Hadley", "Edward", "Mae", "Doris", "Darren", "Luke", "Gregory", "Autumn", "Michelle" ], "edges": [ [ 0, 4 ], [ 3, 8 ], [ 4, 2 ], [ 4, 6 ], [ 6, 1 ], [ 6, 3 ], [ 7, 5 ], [ 7, 9 ], [ 8, 7 ], [ 10, 14 ], [ 13, 18 ], [ 14, 12 ], [ 14, 16 ], [ 16, 11 ], [ 16, 13 ], [ 17, 15 ], [ 17, 19 ], [ 18, 17 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Kara knows Jewel. Clyde knows Devin. Effie knows Kara. Jack knows Dudley. Joan knows Carlton. Dakota knows Lloyd. Dudley knows Effie. Carey knows Nelson. Shelby knows Carey. Troy knows Jana. Shelby knows Dakota. Ashley knows Troy. Nelson knows Robin. Kristin knows Shelby. Kristin knows Clyde. Dudley knows Joan. Effie knows Ashley. Donald knows Kristin. Which of Kristin and Dudley can Donald reach?", "answer": "Kristin", "steps": [ "Donald knows Kristin." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Donald", "Carey", "Lloyd", "Robin", "Devin", "Clyde", "Kristin", "Dakota", "Nelson", "Shelby", "Jack", "Ashley", "Jewel", "Jana", "Carlton", "Joan", "Dudley", "Kara", "Troy", "Effie" ], "edges": [ [ 0, 6 ], [ 1, 8 ], [ 5, 4 ], [ 6, 5 ], [ 6, 9 ], [ 7, 2 ], [ 8, 3 ], [ 9, 7 ], [ 9, 1 ], [ 10, 16 ], [ 11, 18 ], [ 15, 14 ], [ 16, 15 ], [ 16, 19 ], [ 17, 12 ], [ 18, 13 ], [ 19, 17 ], [ 19, 11 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Coral knows Olive. Eldon knows Amy. Clayton knows Kamila. Estelle knows Bernadette. Bernadette knows Jorge. Adele knows Fabian. Guillermo knows Eldon. Dora knows Becky. Burt knows Dora. Becky knows Adele. Archer knows Clayton. Clayton knows Coral. Nancy knows Annie. Kamila knows Nancy. Ariana knows Burt. Fabian knows Paul. Jorge knows Archer. Adele knows Guillermo. Which of Eldon and Nancy can Estelle reach?", "answer": "Nancy", "steps": [ "Estelle knows Bernadette.", "Bernadette knows Jorge.", "Jorge knows Archer.", "Archer knows Clayton.", "Clayton knows Kamila.", "Kamila knows Nancy." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Estelle", "Kamila", "Bernadette", "Olive", "Annie", "Nancy", "Jorge", "Coral", "Clayton", "Archer", "Ariana", "Guillermo", "Burt", "Paul", "Amy", "Eldon", "Dora", "Fabian", "Adele", "Becky" ], "edges": [ [ 0, 2 ], [ 1, 5 ], [ 2, 6 ], [ 5, 4 ], [ 6, 9 ], [ 7, 3 ], [ 8, 1 ], [ 8, 7 ], [ 9, 8 ], [ 10, 12 ], [ 11, 15 ], [ 12, 16 ], [ 15, 14 ], [ 16, 19 ], [ 17, 13 ], [ 18, 11 ], [ 18, 17 ], [ 19, 18 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Susan knows Cooper. Bennett knows Jeremiah. Cliff knows Jessie. Jessie knows Bernice. Jessie knows Howard. Fritz knows Susan. Jeremiah knows Lane. Barbara knows Pedro. Lane knows Skyler. Barbara knows Bennett. Barbara knows Jolene. Jessie knows Fritz. Pedro knows Fabian. Bernice knows Hudson. Cooper knows Herbert. Hudson knows Keegan. Fabian knows Jarvis. Aurora knows Barbara. Which of Bennett and Fritz can Aurora reach?", "answer": "Bennett", "steps": [ "Aurora knows Barbara.", "Barbara knows Bennett." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Aurora", "Fabian", "Barbara", "Pedro", "Skyler", "Lane", "Bennett", "Jeremiah", "Jolene", "Jarvis", "Cliff", "Hudson", "Jessie", "Bernice", "Herbert", "Cooper", "Fritz", "Susan", "Howard", "Keegan" ], "edges": [ [ 0, 2 ], [ 1, 9 ], [ 2, 6 ], [ 2, 8 ], [ 2, 3 ], [ 3, 1 ], [ 5, 4 ], [ 6, 7 ], [ 7, 5 ], [ 10, 12 ], [ 11, 19 ], [ 12, 16 ], [ 12, 18 ], [ 12, 13 ], [ 13, 11 ], [ 15, 14 ], [ 16, 17 ], [ 17, 15 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Stella knows Chandler. Bridget knows Laura. Antonio knows Kit. Stella knows Heath. Hampton knows Jade. Heath knows Daniella. Laura knows Hampton. Shannon knows Stella. Heath knows Saul. Tonya knows Bridget. Reed knows Bart. Kit knows Sara. Farrah knows Shannon. Laura knows Antonio. Chandler knows Reed. Jade knows Zoe. Antonio knows Eunice. Daniella knows Jose. Which of Shannon and Bridget can Farrah reach?", "answer": "Shannon", "steps": [ "Farrah knows Shannon." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Farrah", "Chandler", "Bart", "Jose", "Shannon", "Heath", "Reed", "Daniella", "Saul", "Stella", "Tonya", "Hampton", "Zoe", "Sara", "Bridget", "Antonio", "Jade", "Kit", "Eunice", "Laura" ], "edges": [ [ 0, 4 ], [ 1, 6 ], [ 4, 9 ], [ 5, 7 ], [ 5, 8 ], [ 6, 2 ], [ 7, 3 ], [ 9, 1 ], [ 9, 5 ], [ 10, 14 ], [ 11, 16 ], [ 14, 19 ], [ 15, 17 ], [ 15, 18 ], [ 16, 12 ], [ 17, 13 ], [ 19, 11 ], [ 19, 15 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Dorian knows Kennedy. Rachel knows Kerry. Hugh knows Dorian. Liam knows Rachel. Jean knows Gladys. Kaleb knows Delia. Willis knows Hugh. Gunnar knows Graeme. Nicole knows Gunnar. Graeme knows Clyde. Yolanda knows Colby. Colby knows Willis. Gladys knows Kaleb. Dustin knows Isadora. Jean knows Liam. Delia knows Cara. Kerry knows Dustin. Yolanda knows Nicole. Which of Rachel and Willis can Jean reach?", "answer": "Rachel", "steps": [ "Jean knows Liam.", "Liam knows Rachel." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Jean", "Kerry", "Gladys", "Liam", "Rachel", "Kaleb", "Dustin", "Cara", "Delia", "Isadora", "Yolanda", "Hugh", "Nicole", "Colby", "Willis", "Gunnar", "Dorian", "Clyde", "Graeme", "Kennedy" ], "edges": [ [ 0, 2 ], [ 0, 3 ], [ 1, 6 ], [ 2, 5 ], [ 3, 4 ], [ 4, 1 ], [ 5, 8 ], [ 6, 9 ], [ 8, 7 ], [ 10, 12 ], [ 10, 13 ], [ 11, 16 ], [ 12, 15 ], [ 13, 14 ], [ 14, 11 ], [ 15, 18 ], [ 16, 19 ], [ 18, 17 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Linda knows Malcolm. Linda knows Levi. Estelle knows Isadora. Winston knows Merle. Omar knows Neville. Samantha knows Flora. Eugene knows Damian. Omar knows Dixie. Flora knows Eugene. Damian knows Noel. Levi knows Omar. Lucille knows Winston. Dixie knows Isaac. Noel knows Julio. Isaac knows Estelle. Flora knows Tara. Lucille knows Samantha. Malcolm knows Brent. Which of Eugene and Dixie can Lucille reach?", "answer": "Eugene", "steps": [ "Lucille knows Samantha.", "Samantha knows Flora.", "Flora knows Eugene." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Lucille", "Tara", "Merle", "Julio", "Winston", "Flora", "Damian", "Eugene", "Samantha", "Noel", "Linda", "Neville", "Brent", "Isadora", "Malcolm", "Omar", "Isaac", "Dixie", "Levi", "Estelle" ], "edges": [ [ 0, 4 ], [ 0, 8 ], [ 4, 2 ], [ 5, 1 ], [ 5, 7 ], [ 6, 9 ], [ 7, 6 ], [ 8, 5 ], [ 9, 3 ], [ 10, 14 ], [ 10, 18 ], [ 14, 12 ], [ 15, 11 ], [ 15, 17 ], [ 16, 19 ], [ 17, 16 ], [ 18, 15 ], [ 19, 13 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Allan knows Franklin. Ada knows Hal. Lily knows Daniella. Franklin knows Ada. Chantal knows Lily. Henrietta knows Heath. Henrietta knows Pearl. Etta knows Chantal. Aurora knows Henrietta. Chantal knows Allan. Aurora knows Cornelius. Alana knows Dahlia. Allan knows Carter. Carter knows Valerie. Cornelius knows Calvin. Heath knows Haley. Alyssa knows Aurora. Pearl knows Alana. Which of Ada and Alana can Alyssa reach?", "answer": "Alana", "steps": [ "Alyssa knows Aurora.", "Aurora knows Henrietta.", "Henrietta knows Pearl.", "Pearl knows Alana." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Alyssa", "Aurora", "Haley", "Heath", "Alana", "Pearl", "Henrietta", "Dahlia", "Cornelius", "Calvin", "Etta", "Chantal", "Valerie", "Carter", "Ada", "Franklin", "Allan", "Hal", "Lily", "Daniella" ], "edges": [ [ 0, 1 ], [ 1, 6 ], [ 1, 8 ], [ 3, 2 ], [ 4, 7 ], [ 5, 4 ], [ 6, 3 ], [ 6, 5 ], [ 8, 9 ], [ 10, 11 ], [ 11, 16 ], [ 11, 18 ], [ 13, 12 ], [ 14, 17 ], [ 15, 14 ], [ 16, 13 ], [ 16, 15 ], [ 18, 19 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Daria knows Amanda. Joel knows Kevin. Otto knows Ibrahim. Jeffery knows Adelaide. Latoya knows Shaun. Amanda knows Esperanza. Brad knows Vera. Tiffany knows Crystal. Ava knows Latoya. Kevin knows Otto. Otto knows Ava. Esperanza knows Jeffery. Vera knows Tiffany. Esperanza knows Donna. Shaun knows Jenny. Dixie knows Conner. Tiffany knows Daria. Shaun knows Dixie. Which of Shaun and Esperanza can Joel reach?", "answer": "Shaun", "steps": [ "Joel knows Kevin.", "Kevin knows Otto.", "Otto knows Ava.", "Ava knows Latoya.", "Latoya knows Shaun." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Joel", "Otto", "Dixie", "Kevin", "Shaun", "Latoya", "Conner", "Jenny", "Ibrahim", "Ava", "Brad", "Tiffany", "Jeffery", "Vera", "Esperanza", "Amanda", "Adelaide", "Donna", "Crystal", "Daria" ], "edges": [ [ 0, 3 ], [ 1, 8 ], [ 1, 9 ], [ 2, 6 ], [ 3, 1 ], [ 4, 2 ], [ 4, 7 ], [ 5, 4 ], [ 9, 5 ], [ 10, 13 ], [ 11, 18 ], [ 11, 19 ], [ 12, 16 ], [ 13, 11 ], [ 14, 12 ], [ 14, 17 ], [ 15, 14 ], [ 19, 15 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Russ knows Bennett. Walt knows Harley. Russ knows Aria. Ramona knows Serena. Ford knows Selena. Serena knows Andrew. Harris knows Ramona. Jewel knows Chantal. Humphrey knows Carson. Ford knows Walt. Jose knows Russ. Selena knows Humphrey. Alison knows Jewel. Jewel knows Harris. Bennett knows Ford. Goldie knows Lewis. Hank knows Goldie. Ramona knows Hank. Which of Hank and Selena can Alison reach?", "answer": "Hank", "steps": [ "Alison knows Jewel.", "Jewel knows Harris.", "Harris knows Ramona.", "Ramona knows Hank." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Alison", "Harris", "Jewel", "Serena", "Lewis", "Chantal", "Ramona", "Andrew", "Hank", "Goldie", "Jose", "Bennett", "Russ", "Walt", "Carson", "Aria", "Ford", "Harley", "Selena", "Humphrey" ], "edges": [ [ 0, 2 ], [ 1, 6 ], [ 2, 5 ], [ 2, 1 ], [ 3, 7 ], [ 6, 3 ], [ 6, 8 ], [ 8, 9 ], [ 9, 4 ], [ 10, 12 ], [ 11, 16 ], [ 12, 15 ], [ 12, 11 ], [ 13, 17 ], [ 16, 13 ], [ 16, 18 ], [ 18, 19 ], [ 19, 14 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Josie knows Matt. Darrell knows Clark. Erma knows Kira. Gary knows Dorothy. Jem knows Gary. Harmony knows Josie. Dorothy knows Kristina. Harriet knows Norman. Clark knows Malcolm. Harmony knows Louisa. Matt knows Erma. Norman knows Dorian. Harriet knows Riley. Dorothy knows Vance. Vance knows Darrell. Dorian knows Harmony. Harlan knows Jem. Harlan knows Kelly. Which of Norman and Jem can Harlan reach?", "answer": "Jem", "steps": [ "Harlan knows Jem." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Harlan", "Clark", "Kelly", "Gary", "Jem", "Vance", "Dorothy", "Malcolm", "Kristina", "Darrell", "Harriet", "Erma", "Riley", "Dorian", "Norman", "Josie", "Harmony", "Kira", "Louisa", "Matt" ], "edges": [ [ 0, 2 ], [ 0, 4 ], [ 1, 7 ], [ 3, 6 ], [ 4, 3 ], [ 5, 9 ], [ 6, 8 ], [ 6, 5 ], [ 9, 1 ], [ 10, 12 ], [ 10, 14 ], [ 11, 17 ], [ 13, 16 ], [ 14, 13 ], [ 15, 19 ], [ 16, 18 ], [ 16, 15 ], [ 19, 11 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Lara knows Lucia. Philip knows Clement. Clement knows Karla. Caleb knows Laverne. Clement knows Lenora. Lucia knows Travis. Jane knows Lara. Colleen knows Jane. Philip knows Caleb. Lucia knows Monroe. Dora knows Emily. Laverne knows Joel. Lara knows Mack. Taylor knows Abel. Laverne knows Riley. Taylor knows Lee. Emily knows Philip. Mack knows Taylor. Which of Laverne and Taylor can Colleen reach?", "answer": "Taylor", "steps": [ "Colleen knows Jane.", "Jane knows Lara.", "Lara knows Mack.", "Mack knows Taylor." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Colleen", "Lee", "Mack", "Monroe", "Travis", "Jane", "Abel", "Lucia", "Lara", "Taylor", "Dora", "Riley", "Caleb", "Karla", "Lenora", "Emily", "Joel", "Clement", "Philip", "Laverne" ], "edges": [ [ 0, 5 ], [ 2, 9 ], [ 5, 8 ], [ 7, 3 ], [ 7, 4 ], [ 8, 7 ], [ 8, 2 ], [ 9, 1 ], [ 9, 6 ], [ 10, 15 ], [ 12, 19 ], [ 15, 18 ], [ 17, 13 ], [ 17, 14 ], [ 18, 17 ], [ 18, 12 ], [ 19, 11 ], [ 19, 16 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Nathan knows Noel. Judy knows Karl. Adam knows Holden. Abigail knows Hope. Karl knows Rick. Nathan knows Madeline. Brynn knows Michelle. Raymond knows Anthony. Judy knows Abigail. Anthony knows Harry. Karl knows Connor. Nathan knows Darius. Adam knows Enid. Karl knows Colin. Harry knows Nathan. Harry knows Brynn. Raymond knows Emmett. Enid knows Judy. Which of Harry and Judy can Adam reach?", "answer": "Judy", "steps": [ "Adam knows Enid.", "Enid knows Judy." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Adam", "Abigail", "Colin", "Judy", "Connor", "Karl", "Rick", "Holden", "Hope", "Enid", "Raymond", "Brynn", "Darius", "Harry", "Madeline", "Nathan", "Noel", "Emmett", "Michelle", "Anthony" ], "edges": [ [ 0, 7 ], [ 0, 9 ], [ 1, 8 ], [ 3, 5 ], [ 3, 1 ], [ 5, 2 ], [ 5, 4 ], [ 5, 6 ], [ 9, 3 ], [ 10, 17 ], [ 10, 19 ], [ 11, 18 ], [ 13, 15 ], [ 13, 11 ], [ 15, 12 ], [ 15, 14 ], [ 15, 16 ], [ 19, 13 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Angelica knows Judy. Howard knows Elton. Langston knows Simon. Dick knows Emery. Taylor knows Howard. Monroe knows Angelica. Judy knows Imogen. Howard knows Darwin. Dick knows Neal. Simon knows June. Dick knows Pablo. Warren knows Leah. Emery knows Warren. Imogen knows Tonya. Monroe knows Taylor. Neal knows Langston. Warren knows Laurel. Monroe knows Tina. Which of Langston and Judy can Dick reach?", "answer": "Langston", "steps": [ "Dick knows Neal.", "Neal knows Langston." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Dick", "Neal", "Laurel", "Emery", "June", "Langston", "Leah", "Simon", "Warren", "Pablo", "Monroe", "Angelica", "Darwin", "Taylor", "Tonya", "Judy", "Elton", "Imogen", "Howard", "Tina" ], "edges": [ [ 0, 1 ], [ 0, 3 ], [ 0, 9 ], [ 1, 5 ], [ 3, 8 ], [ 5, 7 ], [ 7, 4 ], [ 8, 2 ], [ 8, 6 ], [ 10, 11 ], [ 10, 13 ], [ 10, 19 ], [ 11, 15 ], [ 13, 18 ], [ 15, 17 ], [ 17, 14 ], [ 18, 12 ], [ 18, 16 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Myrtle knows Malcolm. Gladys knows John. Courtney knows Mindy. Rosemary knows Sylvia. Geraldine knows Neil. Lacey knows Edwin. Geraldine knows Gladys. Juan knows Rosemary. Gladys knows Kendrick. Neil knows Luna. Kendrick knows Zane. Gladys knows Eric. Kendrick knows Courtney. Myrtle knows Juan. Juan knows Gary. Juan knows Kay. Rosemary knows Lacey. Malcolm knows Elton. Which of Lacey and Courtney can Geraldine reach?", "answer": "Courtney", "steps": [ "Geraldine knows Gladys.", "Gladys knows Kendrick.", "Kendrick knows Courtney." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Geraldine", "Gladys", "Kendrick", "John", "Mindy", "Eric", "Neil", "Zane", "Luna", "Courtney", "Myrtle", "Juan", "Rosemary", "Gary", "Edwin", "Kay", "Malcolm", "Sylvia", "Elton", "Lacey" ], "edges": [ [ 0, 6 ], [ 0, 1 ], [ 1, 3 ], [ 1, 5 ], [ 1, 2 ], [ 2, 7 ], [ 2, 9 ], [ 6, 8 ], [ 9, 4 ], [ 10, 16 ], [ 10, 11 ], [ 11, 13 ], [ 11, 15 ], [ 11, 12 ], [ 12, 17 ], [ 12, 19 ], [ 16, 18 ], [ 19, 14 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Kelsey knows Kristin. Gwen knows Christian. Ted knows Kelsey. Stacy knows Donovan. Christian knows Larissa. Veronica knows Knox. Jude knows Stacy. Bruno knows Maya. Stacy knows Ted. Julius knows Bruno. Chance knows Dick. Larissa knows Greta. Kristin knows Veronica. Stacy knows Chance. Greta knows Fiona. Wanda knows Julius. Julius knows Gwen. Julius knows Hardy. Which of Kelsey and Christian can Wanda reach?", "answer": "Christian", "steps": [ "Wanda knows Julius.", "Julius knows Gwen.", "Gwen knows Christian." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Wanda", "Fiona", "Greta", "Maya", "Hardy", "Julius", "Gwen", "Larissa", "Christian", "Bruno", "Jude", "Knox", "Veronica", "Dick", "Donovan", "Stacy", "Ted", "Kristin", "Kelsey", "Chance" ], "edges": [ [ 0, 5 ], [ 2, 1 ], [ 5, 4 ], [ 5, 6 ], [ 5, 9 ], [ 6, 8 ], [ 7, 2 ], [ 8, 7 ], [ 9, 3 ], [ 10, 15 ], [ 12, 11 ], [ 15, 14 ], [ 15, 16 ], [ 15, 19 ], [ 16, 18 ], [ 17, 12 ], [ 18, 17 ], [ 19, 13 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Daniel knows Haley. Kelly knows Vance. Axel knows Bryan. Nina knows Wayne. Axel knows Sheila. Sheila knows Richard. Electra knows Jon. Kelly knows Edward. Wayne knows Dana. Vance knows Nina. Hailey knows Tyler. Gemma knows Naomi. Daniel knows Kate. Electra knows Hailey. Haley knows Fisher. Fisher knows Axel. Wayne knows Electra. Sheila knows Gemma. Which of Vance and Haley can Daniel reach?", "answer": "Haley", "steps": [ "Daniel knows Haley." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Daniel", "Sheila", "Naomi", "Richard", "Haley", "Bryan", "Fisher", "Gemma", "Axel", "Kate", "Kelly", "Electra", "Tyler", "Jon", "Vance", "Dana", "Nina", "Hailey", "Wayne", "Edward" ], "edges": [ [ 0, 4 ], [ 0, 9 ], [ 1, 3 ], [ 1, 7 ], [ 4, 6 ], [ 6, 8 ], [ 7, 2 ], [ 8, 5 ], [ 8, 1 ], [ 10, 14 ], [ 10, 19 ], [ 11, 13 ], [ 11, 17 ], [ 14, 16 ], [ 16, 18 ], [ 17, 12 ], [ 18, 15 ], [ 18, 11 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Lambert knows Hailey. Hattie knows Zach. Hattie knows Jay. Anton knows Perry. Lillian knows Aaron. Aaron knows Hayley. Martha knows Lillian. Anton knows Gordon. Wanda knows Alexa. Laverne knows Lambert. Elizabeth knows Hattie. Jay knows Laverne. Gordon knows Lenora. Laverne knows Bart. Aaron knows Wanda. Jay knows Shaun. Rosa knows Elizabeth. Wanda knows Anton. Which of Lambert and Gordon can Rosa reach?", "answer": "Lambert", "steps": [ "Rosa knows Elizabeth.", "Elizabeth knows Hattie.", "Hattie knows Jay.", "Jay knows Laverne.", "Laverne knows Lambert." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Rosa", "Jay", "Lambert", "Laverne", "Hattie", "Hailey", "Shaun", "Bart", "Elizabeth", "Zach", "Martha", "Wanda", "Gordon", "Anton", "Aaron", "Lenora", "Alexa", "Perry", "Lillian", "Hayley" ], "edges": [ [ 0, 8 ], [ 1, 6 ], [ 1, 3 ], [ 2, 5 ], [ 3, 2 ], [ 3, 7 ], [ 4, 1 ], [ 4, 9 ], [ 8, 4 ], [ 10, 18 ], [ 11, 16 ], [ 11, 13 ], [ 12, 15 ], [ 13, 12 ], [ 13, 17 ], [ 14, 11 ], [ 14, 19 ], [ 18, 14 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Andrea knows Zelda. Graham knows Harris. Tony knows Etta. Layla knows Darius. Andrea knows Graham. Pam knows Tiffany. Allen knows Layla. Zara knows Gemma. Tiffany knows Cynthia. Zelda knows Cyrus. Tony knows Andrea. Allen knows Audrey. Cyrus knows Zara. Vernon knows Liam. Cyrus knows Clifford. Tiffany knows Vernon. Pam knows Alice. Cynthia knows Allen. Which of Gemma and Darius can Pam reach?", "answer": "Darius", "steps": [ "Pam knows Tiffany.", "Tiffany knows Cynthia.", "Cynthia knows Allen.", "Allen knows Layla.", "Layla knows Darius." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Pam", "Audrey", "Cynthia", "Tiffany", "Alice", "Allen", "Liam", "Darius", "Vernon", "Layla", "Tony", "Clifford", "Zelda", "Andrea", "Etta", "Cyrus", "Harris", "Gemma", "Graham", "Zara" ], "edges": [ [ 0, 4 ], [ 0, 3 ], [ 2, 5 ], [ 3, 8 ], [ 3, 2 ], [ 5, 1 ], [ 5, 9 ], [ 8, 6 ], [ 9, 7 ], [ 10, 14 ], [ 10, 13 ], [ 12, 15 ], [ 13, 18 ], [ 13, 12 ], [ 15, 11 ], [ 15, 19 ], [ 18, 16 ], [ 19, 17 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Etta knows Todd. Dean knows Jillian. Denise knows Harrison. Fern knows Lance. Fern knows Arturo. Lance knows Gustavo. Gustavo knows Trina. Jack knows Denise. Denise knows Kate. Fern knows Glenda. Etta knows Fern. Dean knows Cooper. Harrison knows Dean. Kate knows Darcy. Glenda knows Trevor. Gustavo knows Tina. Denise knows Keegan. Jack knows Gerald. Which of Denise and Fern can Jack reach?", "answer": "Denise", "steps": [ "Jack knows Denise." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Jack", "Darcy", "Keegan", "Denise", "Harrison", "Dean", "Jillian", "Cooper", "Gerald", "Kate", "Etta", "Trevor", "Arturo", "Fern", "Lance", "Gustavo", "Trina", "Tina", "Todd", "Glenda" ], "edges": [ [ 0, 8 ], [ 0, 3 ], [ 3, 2 ], [ 3, 4 ], [ 3, 9 ], [ 4, 5 ], [ 5, 6 ], [ 5, 7 ], [ 9, 1 ], [ 10, 18 ], [ 10, 13 ], [ 13, 12 ], [ 13, 14 ], [ 13, 19 ], [ 14, 15 ], [ 15, 16 ], [ 15, 17 ], [ 19, 11 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Rhea knows Declan. Declan knows Lydia. Enid knows Lyle. Alejandro knows Amelia. Lyle knows Dean. Rhea knows Alejandro. Lillian knows Abigail. Maggie knows Rhea. Maggie knows Valerie. Ira knows Lillian. Amelia knows Jillian. Lyle knows Colby. Dean knows Eunice. Enid knows Jared. Lyle knows Ira. Amelia knows Victor. Rhea knows June. Lillian knows Maria. Which of Amelia and Lillian can Maggie reach?", "answer": "Amelia", "steps": [ "Maggie knows Rhea.", "Rhea knows Alejandro.", "Alejandro knows Amelia." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Maggie", "Lydia", "Jillian", "Amelia", "June", "Alejandro", "Declan", "Victor", "Rhea", "Valerie", "Enid", "Eunice", "Maria", "Lillian", "Colby", "Ira", "Dean", "Abigail", "Lyle", "Jared" ], "edges": [ [ 0, 8 ], [ 0, 9 ], [ 3, 2 ], [ 3, 7 ], [ 5, 3 ], [ 6, 1 ], [ 8, 4 ], [ 8, 6 ], [ 8, 5 ], [ 10, 18 ], [ 10, 19 ], [ 13, 12 ], [ 13, 17 ], [ 15, 13 ], [ 16, 11 ], [ 18, 14 ], [ 18, 16 ], [ 18, 15 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Chase knows Eve. Gloria knows Fern. Elodie knows Loretta. Clifford knows Holden. Elodie knows Clifford. Jasper knows Eduardo. Lynn knows Alice. Holden knows Owen. Eduardo knows Rufus. Eve knows Elodie. Rufus knows Gloria. Dave knows Lynn. Chase knows Jacques. Rufus knows Vance. Kurt knows Chase. Lynn knows Jasper. Eduardo knows Heath. Clifford knows Kareem. Which of Elodie and Eduardo can Kurt reach?", "answer": "Elodie", "steps": [ "Kurt knows Chase.", "Chase knows Eve.", "Eve knows Elodie." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Kurt", "Chase", "Clifford", "Jacques", "Elodie", "Owen", "Holden", "Kareem", "Eve", "Loretta", "Dave", "Lynn", "Rufus", "Alice", "Eduardo", "Fern", "Gloria", "Vance", "Jasper", "Heath" ], "edges": [ [ 0, 1 ], [ 1, 3 ], [ 1, 8 ], [ 2, 6 ], [ 2, 7 ], [ 4, 2 ], [ 4, 9 ], [ 6, 5 ], [ 8, 4 ], [ 10, 11 ], [ 11, 13 ], [ 11, 18 ], [ 12, 16 ], [ 12, 17 ], [ 14, 12 ], [ 14, 19 ], [ 16, 15 ], [ 18, 14 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Denise knows Eldon. Gene knows Denise. Chad knows Shelby. Chad knows Erwin. Gertrude knows Hank. Reed knows Lottie. Gertrude knows James. Jane knows Claire. Chad knows Gene. James knows Nelson. Nelson knows Enrique. Claire knows Gordon. Kimberly knows Chad. Kimberly knows Reed. Gertrude knows Kendra. Lottie knows Alexa. Jane knows Gertrude. Gordon knows Kane. Which of Enrique and Eldon can Jane reach?", "answer": "Enrique", "steps": [ "Jane knows Gertrude.", "Gertrude knows James.", "James knows Nelson.", "Nelson knows Enrique." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Jane", "Gertrude", "Kane", "Enrique", "Claire", "Hank", "Kendra", "James", "Nelson", "Gordon", "Kimberly", "Chad", "Alexa", "Eldon", "Reed", "Erwin", "Shelby", "Gene", "Denise", "Lottie" ], "edges": [ [ 0, 1 ], [ 0, 4 ], [ 1, 5 ], [ 1, 6 ], [ 1, 7 ], [ 4, 9 ], [ 7, 8 ], [ 8, 3 ], [ 9, 2 ], [ 10, 11 ], [ 10, 14 ], [ 11, 15 ], [ 11, 16 ], [ 11, 17 ], [ 14, 19 ], [ 17, 18 ], [ 18, 13 ], [ 19, 12 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Josie knows Matt. Darrell knows Clark. Erma knows Kira. Gary knows Dorothy. Jem knows Gary. Harmony knows Josie. Dorothy knows Kristina. Harriet knows Norman. Clark knows Malcolm. Harmony knows Louisa. Matt knows Erma. Norman knows Dorian. Harriet knows Riley. Dorothy knows Vance. Vance knows Darrell. Dorian knows Harmony. Harlan knows Jem. Harlan knows Kelly. Which of Malcolm and Kira can Harlan reach?", "answer": "Malcolm", "steps": [ "Harlan knows Jem.", "Jem knows Gary.", "Gary knows Dorothy.", "Dorothy knows Vance.", "Vance knows Darrell.", "Darrell knows Clark.", "Clark knows Malcolm." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Harlan", "Clark", "Kelly", "Gary", "Jem", "Vance", "Dorothy", "Malcolm", "Kristina", "Darrell", "Harriet", "Erma", "Riley", "Dorian", "Norman", "Josie", "Harmony", "Kira", "Louisa", "Matt" ], "edges": [ [ 0, 2 ], [ 0, 4 ], [ 1, 7 ], [ 3, 6 ], [ 4, 3 ], [ 5, 9 ], [ 6, 8 ], [ 6, 5 ], [ 9, 1 ], [ 10, 12 ], [ 10, 14 ], [ 11, 17 ], [ 13, 16 ], [ 14, 13 ], [ 15, 19 ], [ 16, 18 ], [ 16, 15 ], [ 19, 11 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Myrtle knows Elijah. Jacob knows Alfred. Alfred knows Forrest. Alfred knows Anna. Elijah knows Mara. Logan knows Jacob. Yvonne knows Heather. Jennifer knows Hugh. Heather knows Clement. Mara knows Erik. Forrest knows Abel. Walt knows Sheila. Clement knows Callum. Callum knows Jocelyn. Clement knows Hadley. Jocelyn knows Jennifer. Hugh knows Walt. Abel knows Myrtle. Which of Erik and Sheila can Yvonne reach?", "answer": "Sheila", "steps": [ "Yvonne knows Heather.", "Heather knows Clement.", "Clement knows Callum.", "Callum knows Jocelyn.", "Jocelyn knows Jennifer.", "Jennifer knows Hugh.", "Hugh knows Walt.", "Walt knows Sheila." ], "difficulty": 8, "original_distance": 8, "idx_to_symbol": [ "Yvonne", "Jennifer", "Hadley", "Sheila", "Clement", "Callum", "Hugh", "Jocelyn", "Heather", "Walt", "Logan", "Myrtle", "Anna", "Erik", "Alfred", "Forrest", "Elijah", "Abel", "Jacob", "Mara" ], "edges": [ [ 0, 8 ], [ 1, 6 ], [ 4, 2 ], [ 4, 5 ], [ 5, 7 ], [ 6, 9 ], [ 7, 1 ], [ 8, 4 ], [ 9, 3 ], [ 10, 18 ], [ 11, 16 ], [ 14, 12 ], [ 14, 15 ], [ 15, 17 ], [ 16, 19 ], [ 17, 11 ], [ 18, 14 ], [ 19, 13 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Jose knows Ross. Layla knows Clyde. Corinne knows Julia. Lars knows Jose. Dahlia knows Melissa. Yuki knows Lars. Tessa knows Dahlia. Lars knows Layla. Curtis knows Isla. Amelia knows Tessa. Julia knows Yolanda. Ross knows Carlos. Carlos knows Corinne. Isla knows Amanda. Lamar knows Curtis. Brandon knows Clement. Melissa knows Brandon. Curtis knows Amelia. Which of Dahlia and Carlos can Yuki reach?", "answer": "Carlos", "steps": [ "Yuki knows Lars.", "Lars knows Jose.", "Jose knows Ross.", "Ross knows Carlos." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Yuki", "Carlos", "Julia", "Ross", "Lars", "Yolanda", "Corinne", "Jose", "Clyde", "Layla", "Lamar", "Dahlia", "Brandon", "Tessa", "Curtis", "Clement", "Melissa", "Amelia", "Amanda", "Isla" ], "edges": [ [ 0, 4 ], [ 1, 6 ], [ 2, 5 ], [ 3, 1 ], [ 4, 7 ], [ 4, 9 ], [ 6, 2 ], [ 7, 3 ], [ 9, 8 ], [ 10, 14 ], [ 11, 16 ], [ 12, 15 ], [ 13, 11 ], [ 14, 17 ], [ 14, 19 ], [ 16, 12 ], [ 17, 13 ], [ 19, 18 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Diane knows Julian. Chelsea knows Diane. Diane knows Guy. Sidney knows Ursula. Lyle knows Jordan. Julian knows Beatrice. Beatrice knows Elton. Elton knows Lawson. Sally knows Lyle. Guy knows Rena. Allen knows Oscar. Julian knows Eden. Eden knows Itzel. Holden knows Sam. Oscar knows Holden. Oscar knows Sidney. Holden knows Sally. Sam knows Hugh. Which of Julian and Holden can Chelsea reach?", "answer": "Julian", "steps": [ "Chelsea knows Diane.", "Diane knows Julian." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Chelsea", "Eden", "Beatrice", "Itzel", "Julian", "Diane", "Elton", "Guy", "Rena", "Lawson", "Allen", "Sam", "Sally", "Hugh", "Holden", "Oscar", "Lyle", "Sidney", "Ursula", "Jordan" ], "edges": [ [ 0, 5 ], [ 1, 3 ], [ 2, 6 ], [ 4, 1 ], [ 4, 2 ], [ 5, 7 ], [ 5, 4 ], [ 6, 9 ], [ 7, 8 ], [ 10, 15 ], [ 11, 13 ], [ 12, 16 ], [ 14, 11 ], [ 14, 12 ], [ 15, 17 ], [ 15, 14 ], [ 16, 19 ], [ 17, 18 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Jill knows Mae. Kerry knows Jamie. Mae knows Randy. Elise knows Garrett. Jill knows Philip. Randy knows Daniella. Nicholas knows Kerry. Kerry knows Louise. Samantha knows Shawn. Mae knows Mindy. Lane knows Nicholas. Lane knows Samantha. Philip knows Max. Jamie knows Joseph. Daniella knows Elise. Joseph knows Oliver. Nicholas knows Jasper. Randy knows Willis. Which of Joseph and Elise can Lane reach?", "answer": "Joseph", "steps": [ "Lane knows Nicholas.", "Nicholas knows Kerry.", "Kerry knows Jamie.", "Jamie knows Joseph." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Lane", "Louise", "Kerry", "Nicholas", "Shawn", "Joseph", "Jasper", "Oliver", "Samantha", "Jamie", "Jill", "Willis", "Randy", "Mae", "Max", "Elise", "Mindy", "Garrett", "Philip", "Daniella" ], "edges": [ [ 0, 8 ], [ 0, 3 ], [ 2, 1 ], [ 2, 9 ], [ 3, 6 ], [ 3, 2 ], [ 5, 7 ], [ 8, 4 ], [ 9, 5 ], [ 10, 18 ], [ 10, 13 ], [ 12, 11 ], [ 12, 19 ], [ 13, 16 ], [ 13, 12 ], [ 15, 17 ], [ 18, 14 ], [ 19, 15 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Kim knows Tanya. Pearl knows Darcy. Helene knows Larissa. Larissa knows Rhea. Darcy knows Dorothy. Kim knows Ariana. Javier knows Lana. Dante knows Edna. Yasmin knows Jaime. Cristina knows Charity. Charity knows Dante. Dante knows Yasmin. Ramon knows Pearl. Lana knows Kim. Jermaine knows Javier. Ramon knows Cristina. Tanya knows Nancy. Jermaine knows Helene. Which of Yasmin and Tanya can Jermaine reach?", "answer": "Tanya", "steps": [ "Jermaine knows Javier.", "Javier knows Lana.", "Lana knows Kim.", "Kim knows Tanya." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Jermaine", "Ariana", "Larissa", "Tanya", "Javier", "Lana", "Nancy", "Helene", "Rhea", "Kim", "Ramon", "Edna", "Darcy", "Yasmin", "Cristina", "Charity", "Jaime", "Pearl", "Dorothy", "Dante" ], "edges": [ [ 0, 7 ], [ 0, 4 ], [ 2, 8 ], [ 3, 6 ], [ 4, 5 ], [ 5, 9 ], [ 7, 2 ], [ 9, 1 ], [ 9, 3 ], [ 10, 17 ], [ 10, 14 ], [ 12, 18 ], [ 13, 16 ], [ 14, 15 ], [ 15, 19 ], [ 17, 12 ], [ 19, 11 ], [ 19, 13 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Virginia knows Bonnie. Anton knows Wilson. Eloise knows Sara. Percy knows Amy. Glenn knows Virginia. Eloise knows Doris. Josie knows Eloise. Daria knows Erma. Anton knows Evelyn. Percy knows Jill. Sara knows Langston. Virginia knows Preston. Daria knows Percy. Daria knows Brenda. Langston knows Hope. Preston knows Daria. Langston knows Anton. Langston knows Trevor. Which of Amy and Wilson can Josie reach?", "answer": "Wilson", "steps": [ "Josie knows Eloise.", "Eloise knows Sara.", "Sara knows Langston.", "Langston knows Anton.", "Anton knows Wilson." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Josie", "Doris", "Trevor", "Eloise", "Wilson", "Langston", "Anton", "Hope", "Sara", "Evelyn", "Glenn", "Bonnie", "Erma", "Virginia", "Amy", "Daria", "Percy", "Brenda", "Preston", "Jill" ], "edges": [ [ 0, 3 ], [ 3, 1 ], [ 3, 8 ], [ 5, 2 ], [ 5, 7 ], [ 5, 6 ], [ 6, 4 ], [ 6, 9 ], [ 8, 5 ], [ 10, 13 ], [ 13, 11 ], [ 13, 18 ], [ 15, 12 ], [ 15, 17 ], [ 15, 16 ], [ 16, 14 ], [ 16, 19 ], [ 18, 15 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Alice knows Simon. Kylie knows Glen. Simon knows Kevin. Ellen knows Fernando. Alice knows Tom. Kylie knows Roland. Kylie knows Alexa. Roland knows Dennis. Alice knows Ellen. Glen knows Jessica. Autumn knows Catherine. Maya knows Rhonda. Rhonda knows Giselle. Maya knows Kylie. Catherine knows Denise. Autumn knows Alice. Glen knows Raymond. Simon knows Ashton. Which of Glen and Simon can Autumn reach?", "answer": "Simon", "steps": [ "Autumn knows Alice.", "Alice knows Simon." ], "difficulty": 2, "original_distance": 3, "idx_to_symbol": [ "Autumn", "Ellen", "Alice", "Catherine", "Denise", "Fernando", "Ashton", "Tom", "Simon", "Kevin", "Maya", "Roland", "Kylie", "Rhonda", "Giselle", "Dennis", "Raymond", "Alexa", "Glen", "Jessica" ], "edges": [ [ 0, 3 ], [ 0, 2 ], [ 1, 5 ], [ 2, 1 ], [ 2, 7 ], [ 2, 8 ], [ 3, 4 ], [ 8, 6 ], [ 8, 9 ], [ 10, 13 ], [ 10, 12 ], [ 11, 15 ], [ 12, 11 ], [ 12, 17 ], [ 12, 18 ], [ 13, 14 ], [ 18, 16 ], [ 18, 19 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Heidi knows Lucia. Marcus knows Joy. Mark knows Rita. Keaton knows Lyle. Lyle knows Ross. Ida knows Fletcher. Erwin knows Dolores. Brittany knows Irving. Leigh knows Oliver. Garland knows Brittany. Erwin knows Leigh. Dolores knows Milo. Milo knows Marcus. Lucia knows Keaton. Keaton knows Ida. Irving knows Erwin. Milton knows Heidi. Ross knows Mark. Which of Heidi and Brittany can Milton reach?", "answer": "Heidi", "steps": [ "Milton knows Heidi." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Milton", "Heidi", "Ross", "Mark", "Fletcher", "Lyle", "Rita", "Lucia", "Keaton", "Ida", "Garland", "Brittany", "Milo", "Marcus", "Oliver", "Dolores", "Joy", "Irving", "Erwin", "Leigh" ], "edges": [ [ 0, 1 ], [ 1, 7 ], [ 2, 3 ], [ 3, 6 ], [ 5, 2 ], [ 7, 8 ], [ 8, 5 ], [ 8, 9 ], [ 9, 4 ], [ 10, 11 ], [ 11, 17 ], [ 12, 13 ], [ 13, 16 ], [ 15, 12 ], [ 17, 18 ], [ 18, 15 ], [ 18, 19 ], [ 19, 14 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Dell knows Hope. Veronica knows Gage. Gage knows Kelsey. Langston knows Devon. Ricardo knows Samuel. Dell knows Ricardo. Sebastian knows Alder. Sebastian knows Nicole. Hope knows Emery. Gage knows Logan. Devon knows Demetrius. Demetrius knows Sybil. Elena knows Sebastian. Emery knows Elena. Sybil knows Veronica. Denver knows Leo. Devon knows Denver. Hannah knows Dell. Which of Emery and Sybil can Hannah reach?", "answer": "Emery", "steps": [ "Hannah knows Dell.", "Dell knows Hope.", "Hope knows Emery." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Hannah", "Ricardo", "Dell", "Hope", "Sebastian", "Elena", "Alder", "Emery", "Nicole", "Samuel", "Langston", "Denver", "Devon", "Demetrius", "Gage", "Veronica", "Kelsey", "Sybil", "Logan", "Leo" ], "edges": [ [ 0, 2 ], [ 1, 9 ], [ 2, 3 ], [ 2, 1 ], [ 3, 7 ], [ 4, 6 ], [ 4, 8 ], [ 5, 4 ], [ 7, 5 ], [ 10, 12 ], [ 11, 19 ], [ 12, 13 ], [ 12, 11 ], [ 13, 17 ], [ 14, 16 ], [ 14, 18 ], [ 15, 14 ], [ 17, 15 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Luther knows Jim. Jessie knows Julius. Norma knows Clay. Jasper knows Mae. Jim knows Virginia. Zoe knows Evan. Dakota knows Zach. Clay knows Fisher. Julius knows Dexter. Dakota knows Zoe. Mae knows Dakota. Virginia knows Brooke. Fisher knows Garland. Brooke knows Jessie. Daisy knows Luther. Rowan knows Daisy. Luther knows Hope. Evan knows Norma. Which of Clay and Jessie can Rowan reach?", "answer": "Jessie", "steps": [ "Rowan knows Daisy.", "Daisy knows Luther.", "Luther knows Jim.", "Jim knows Virginia.", "Virginia knows Brooke.", "Brooke knows Jessie." ], "difficulty": 6, "original_distance": 8, "idx_to_symbol": [ "Rowan", "Jessie", "Julius", "Brooke", "Jim", "Dexter", "Luther", "Virginia", "Daisy", "Hope", "Jasper", "Clay", "Fisher", "Norma", "Zoe", "Garland", "Dakota", "Evan", "Mae", "Zach" ], "edges": [ [ 0, 8 ], [ 1, 2 ], [ 2, 5 ], [ 3, 1 ], [ 4, 7 ], [ 6, 4 ], [ 6, 9 ], [ 7, 3 ], [ 8, 6 ], [ 10, 18 ], [ 11, 12 ], [ 12, 15 ], [ 13, 11 ], [ 14, 17 ], [ 16, 14 ], [ 16, 19 ], [ 17, 13 ], [ 18, 16 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Dick knows Kirsten. Wendell knows Darren. Darren knows Isiah. Dolores knows Teresa. Dolores knows Bernadette. Alyson knows Nicholas. Clark knows Malcolm. Nicholas knows Ignacio. Christopher knows Clark. Teresa knows Carrie. Malcolm knows Lars. Clark knows Perry. Kirsten knows Wendell. Ignacio knows Dick. Wendell knows Nash. Lamar knows Dolores. Lars knows Lamar. Nicholas knows Layla. Which of Darren and Teresa can Christopher reach?", "answer": "Teresa", "steps": [ "Christopher knows Clark.", "Clark knows Malcolm.", "Malcolm knows Lars.", "Lars knows Lamar.", "Lamar knows Dolores.", "Dolores knows Teresa." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Christopher", "Malcolm", "Lamar", "Dolores", "Bernadette", "Teresa", "Clark", "Perry", "Lars", "Carrie", "Alyson", "Ignacio", "Kirsten", "Wendell", "Nash", "Darren", "Nicholas", "Layla", "Dick", "Isiah" ], "edges": [ [ 0, 6 ], [ 1, 8 ], [ 2, 3 ], [ 3, 4 ], [ 3, 5 ], [ 5, 9 ], [ 6, 7 ], [ 6, 1 ], [ 8, 2 ], [ 10, 16 ], [ 11, 18 ], [ 12, 13 ], [ 13, 14 ], [ 13, 15 ], [ 15, 19 ], [ 16, 17 ], [ 16, 11 ], [ 18, 12 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Coral knows Olive. Eldon knows Amy. Clayton knows Kamila. Estelle knows Bernadette. Bernadette knows Jorge. Adele knows Fabian. Guillermo knows Eldon. Dora knows Becky. Burt knows Dora. Becky knows Adele. Archer knows Clayton. Clayton knows Coral. Nancy knows Annie. Kamila knows Nancy. Ariana knows Burt. Fabian knows Paul. Jorge knows Archer. Adele knows Guillermo. Which of Jorge and Dora can Estelle reach?", "answer": "Jorge", "steps": [ "Estelle knows Bernadette.", "Bernadette knows Jorge." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Estelle", "Kamila", "Bernadette", "Olive", "Annie", "Nancy", "Jorge", "Coral", "Clayton", "Archer", "Ariana", "Guillermo", "Burt", "Paul", "Amy", "Eldon", "Dora", "Fabian", "Adele", "Becky" ], "edges": [ [ 0, 2 ], [ 1, 5 ], [ 2, 6 ], [ 5, 4 ], [ 6, 9 ], [ 7, 3 ], [ 8, 1 ], [ 8, 7 ], [ 9, 8 ], [ 10, 12 ], [ 11, 15 ], [ 12, 16 ], [ 15, 14 ], [ 16, 19 ], [ 17, 13 ], [ 18, 11 ], [ 18, 17 ], [ 19, 18 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Tina knows Gene. Jonah knows Tina. Dale knows Shannon. Tina knows Dale. Hannah knows June. Corey knows Courtney. Cesar knows Hannah. Gene knows Archie. Miranda knows Jonah. June knows Cooper. Jenna knows Jorge. Miranda knows Jameson. Gene knows Dexter. Cesar knows Glen. Cooper knows Connor. Jenna knows Corey. Dexter knows Audrey. June knows Jenna. Which of Dexter and Corey can Miranda reach?", "answer": "Dexter", "steps": [ "Miranda knows Jonah.", "Jonah knows Tina.", "Tina knows Gene.", "Gene knows Dexter." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Miranda", "Tina", "Shannon", "Jonah", "Dexter", "Audrey", "Gene", "Dale", "Jameson", "Archie", "Cesar", "June", "Connor", "Hannah", "Corey", "Courtney", "Jenna", "Cooper", "Glen", "Jorge" ], "edges": [ [ 0, 8 ], [ 0, 3 ], [ 1, 7 ], [ 1, 6 ], [ 3, 1 ], [ 4, 5 ], [ 6, 4 ], [ 6, 9 ], [ 7, 2 ], [ 10, 18 ], [ 10, 13 ], [ 11, 17 ], [ 11, 16 ], [ 13, 11 ], [ 14, 15 ], [ 16, 14 ], [ 16, 19 ], [ 17, 12 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Karl knows Dallas. Marvin knows Rosemary. Gabriel knows Adrian. Lennox knows Ramona. Gabriel knows Pam. Kara knows Alvin. Lenora knows Loretta. Pam knows Mary. Marvin knows Chandler. Chandler knows Ted. Ramona knows Evan. Karl knows Jonah. Chandler knows Lenora. Evan knows Marvin. Evan knows Nancy. Alvin knows Karl. Jonah knows Blake. Jonah knows Gabriel. Which of Gabriel and Chandler can Kara reach?", "answer": "Gabriel", "steps": [ "Kara knows Alvin.", "Alvin knows Karl.", "Karl knows Jonah.", "Jonah knows Gabriel." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Kara", "Pam", "Karl", "Jonah", "Gabriel", "Dallas", "Blake", "Alvin", "Adrian", "Mary", "Lennox", "Lenora", "Evan", "Marvin", "Chandler", "Nancy", "Rosemary", "Ramona", "Ted", "Loretta" ], "edges": [ [ 0, 7 ], [ 1, 9 ], [ 2, 5 ], [ 2, 3 ], [ 3, 6 ], [ 3, 4 ], [ 4, 8 ], [ 4, 1 ], [ 7, 2 ], [ 10, 17 ], [ 11, 19 ], [ 12, 15 ], [ 12, 13 ], [ 13, 16 ], [ 13, 14 ], [ 14, 18 ], [ 14, 11 ], [ 17, 12 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Neal knows Dante. Vera knows Harmony. Betty knows Israel. Colby knows Alvin. Betty knows Dolly. Alex knows Imogen. Joy knows Colby. Vera knows Gene. Thomas knows Jewel. Colby knows Carlos. Natalie knows Joy. Molly knows Alex. Dolly knows Neal. Jewel knows Vera. Molly knows Bob. Gene knows Betty. Carlos knows Molly. Imogen knows Grant. Which of Carlos and Gene can Thomas reach?", "answer": "Gene", "steps": [ "Thomas knows Jewel.", "Jewel knows Vera.", "Vera knows Gene." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Thomas", "Israel", "Dolly", "Vera", "Dante", "Jewel", "Neal", "Betty", "Harmony", "Gene", "Natalie", "Bob", "Alex", "Colby", "Grant", "Joy", "Imogen", "Molly", "Alvin", "Carlos" ], "edges": [ [ 0, 5 ], [ 2, 6 ], [ 3, 8 ], [ 3, 9 ], [ 5, 3 ], [ 6, 4 ], [ 7, 1 ], [ 7, 2 ], [ 9, 7 ], [ 10, 15 ], [ 12, 16 ], [ 13, 18 ], [ 13, 19 ], [ 15, 13 ], [ 16, 14 ], [ 17, 11 ], [ 17, 12 ], [ 19, 17 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Karl knows Dallas. Marvin knows Rosemary. Gabriel knows Adrian. Lennox knows Ramona. Gabriel knows Pam. Kara knows Alvin. Lenora knows Loretta. Pam knows Mary. Marvin knows Chandler. Chandler knows Ted. Ramona knows Evan. Karl knows Jonah. Chandler knows Lenora. Evan knows Marvin. Evan knows Nancy. Alvin knows Karl. Jonah knows Blake. Jonah knows Gabriel. Which of Pam and Lenora can Kara reach?", "answer": "Pam", "steps": [ "Kara knows Alvin.", "Alvin knows Karl.", "Karl knows Jonah.", "Jonah knows Gabriel.", "Gabriel knows Pam." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Kara", "Pam", "Karl", "Jonah", "Gabriel", "Dallas", "Blake", "Alvin", "Adrian", "Mary", "Lennox", "Lenora", "Evan", "Marvin", "Chandler", "Nancy", "Rosemary", "Ramona", "Ted", "Loretta" ], "edges": [ [ 0, 7 ], [ 1, 9 ], [ 2, 5 ], [ 2, 3 ], [ 3, 6 ], [ 3, 4 ], [ 4, 8 ], [ 4, 1 ], [ 7, 2 ], [ 10, 17 ], [ 11, 19 ], [ 12, 15 ], [ 12, 13 ], [ 13, 16 ], [ 13, 14 ], [ 14, 18 ], [ 14, 11 ], [ 17, 12 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Gemma knows Greta. Annette knows Logan. Bruce knows Gemma. Stephanie knows Dale. Mark knows Myrtle. Greta knows Jacqueline. Erica knows Bruce. Annette knows Sam. Haley knows Audrey. Audrey knows Alicia. Sam knows Stephanie. Wade knows Opal. Wade knows Veronica. Alicia knows Erica. Veronica knows Mark. Dale knows Wade. Bruce knows Ford. Haley knows Andrea. Which of Wade and Bruce can Haley reach?", "answer": "Bruce", "steps": [ "Haley knows Audrey.", "Audrey knows Alicia.", "Alicia knows Erica.", "Erica knows Bruce." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Haley", "Audrey", "Greta", "Andrea", "Gemma", "Ford", "Bruce", "Jacqueline", "Alicia", "Erica", "Annette", "Sam", "Mark", "Logan", "Veronica", "Opal", "Wade", "Myrtle", "Stephanie", "Dale" ], "edges": [ [ 0, 3 ], [ 0, 1 ], [ 1, 8 ], [ 2, 7 ], [ 4, 2 ], [ 6, 5 ], [ 6, 4 ], [ 8, 9 ], [ 9, 6 ], [ 10, 13 ], [ 10, 11 ], [ 11, 18 ], [ 12, 17 ], [ 14, 12 ], [ 16, 15 ], [ 16, 14 ], [ 18, 19 ], [ 19, 16 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Faye knows Mack. Ramona knows Eamon. Aisha knows Frankie. Hampton knows Jonathan. Frankie knows Roman. Olive knows Kirk. Kirk knows Ramona. Ted knows Sebastian. Olive knows Jerry. Frankie knows Hampton. Aisha knows Val. Faye knows Olive. Sebastian knows Aisha. Katrina knows Faye. Jonathan knows Ford. Ramona knows Rosa. Jonathan knows Percy. Emanuel knows Katrina. Which of Faye and Aisha can Emanuel reach?", "answer": "Faye", "steps": [ "Emanuel knows Katrina.", "Katrina knows Faye." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Emanuel", "Katrina", "Ramona", "Jerry", "Mack", "Kirk", "Rosa", "Eamon", "Olive", "Faye", "Ted", "Sebastian", "Jonathan", "Roman", "Val", "Hampton", "Ford", "Percy", "Frankie", "Aisha" ], "edges": [ [ 0, 1 ], [ 1, 9 ], [ 2, 6 ], [ 2, 7 ], [ 5, 2 ], [ 8, 3 ], [ 8, 5 ], [ 9, 4 ], [ 9, 8 ], [ 10, 11 ], [ 11, 19 ], [ 12, 16 ], [ 12, 17 ], [ 15, 12 ], [ 18, 13 ], [ 18, 15 ], [ 19, 14 ], [ 19, 18 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Diane knows Julian. Chelsea knows Diane. Diane knows Guy. Sidney knows Ursula. Lyle knows Jordan. Julian knows Beatrice. Beatrice knows Elton. Elton knows Lawson. Sally knows Lyle. Guy knows Rena. Allen knows Oscar. Julian knows Eden. Eden knows Itzel. Holden knows Sam. Oscar knows Holden. Oscar knows Sidney. Holden knows Sally. Sam knows Hugh. Which of Beatrice and Sally can Chelsea reach?", "answer": "Beatrice", "steps": [ "Chelsea knows Diane.", "Diane knows Julian.", "Julian knows Beatrice." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Chelsea", "Eden", "Beatrice", "Itzel", "Julian", "Diane", "Elton", "Guy", "Rena", "Lawson", "Allen", "Sam", "Sally", "Hugh", "Holden", "Oscar", "Lyle", "Sidney", "Ursula", "Jordan" ], "edges": [ [ 0, 5 ], [ 1, 3 ], [ 2, 6 ], [ 4, 1 ], [ 4, 2 ], [ 5, 7 ], [ 5, 4 ], [ 6, 9 ], [ 7, 8 ], [ 10, 15 ], [ 11, 13 ], [ 12, 16 ], [ 14, 11 ], [ 14, 12 ], [ 15, 17 ], [ 15, 14 ], [ 16, 19 ], [ 17, 18 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Luke knows Javier. Zoe knows Greg. Kylie knows Cecilia. Daniella knows Kylie. Tristan knows Daniella. Javier knows Zoe. Keaton knows Emily. Keaton knows Gavin. Rosa knows Tristan. Emily knows Luke. Luke knows Eunice. Leopold knows Michael. Cecilia knows Leopold. Kylie knows Devon. Luke knows Damien. Tristan knows Caleb. Ken knows Keaton. Kylie knows Lottie. Which of Leopold and Zoe can Rosa reach?", "answer": "Leopold", "steps": [ "Rosa knows Tristan.", "Tristan knows Daniella.", "Daniella knows Kylie.", "Kylie knows Cecilia.", "Cecilia knows Leopold." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Rosa", "Lottie", "Tristan", "Leopold", "Kylie", "Daniella", "Michael", "Cecilia", "Caleb", "Devon", "Ken", "Eunice", "Keaton", "Zoe", "Luke", "Emily", "Greg", "Javier", "Gavin", "Damien" ], "edges": [ [ 0, 2 ], [ 2, 8 ], [ 2, 5 ], [ 3, 6 ], [ 4, 1 ], [ 4, 7 ], [ 4, 9 ], [ 5, 4 ], [ 7, 3 ], [ 10, 12 ], [ 12, 18 ], [ 12, 15 ], [ 13, 16 ], [ 14, 11 ], [ 14, 17 ], [ 14, 19 ], [ 15, 14 ], [ 17, 13 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Adele knows Erwin. Pearl knows Paula. Florence knows Kent. Calvin knows Billy. Casey knows Tabitha. Darla knows Peggy. Peter knows Florence. Billy knows Maude. Paula knows Casey. Erwin knows Marvin. Kent knows Angela. Marvin knows Calvin. Angela knows Julius. Shelby knows Ivy. Peggy knows Adele. Rex knows Pearl. Tabitha knows Peter. Maude knows Shelby. Which of Erwin and Casey can Darla reach?", "answer": "Erwin", "steps": [ "Darla knows Peggy.", "Peggy knows Adele.", "Adele knows Erwin." ], "difficulty": 3, "original_distance": 9, "idx_to_symbol": [ "Darla", "Adele", "Calvin", "Peggy", "Maude", "Marvin", "Shelby", "Erwin", "Ivy", "Billy", "Rex", "Paula", "Peter", "Pearl", "Kent", "Tabitha", "Angela", "Casey", "Julius", "Florence" ], "edges": [ [ 0, 3 ], [ 1, 7 ], [ 2, 9 ], [ 3, 1 ], [ 4, 6 ], [ 5, 2 ], [ 6, 8 ], [ 7, 5 ], [ 9, 4 ], [ 10, 13 ], [ 11, 17 ], [ 12, 19 ], [ 13, 11 ], [ 14, 16 ], [ 15, 12 ], [ 16, 18 ], [ 17, 15 ], [ 19, 14 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Barbara knows Norma. Burt knows Lawrence. Louis knows Fernando. Karl knows Patricia. Dale knows Sheryl. Dale knows Eric. Barbara knows Louis. Karl knows Laura. Burt knows Ralph. Lawrence knows Ellen. Barbara knows Claude. Barbara knows Betty. Karl knows Kamila. Kamila knows Burt. Sheryl knows Lyric. Kamila knows Beverly. Louis knows Dale. Karl knows Vivian. Which of Burt and Dale can Barbara reach?", "answer": "Dale", "steps": [ "Barbara knows Louis.", "Louis knows Dale." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Barbara", "Dale", "Claude", "Lyric", "Betty", "Eric", "Fernando", "Louis", "Sheryl", "Norma", "Karl", "Burt", "Patricia", "Ellen", "Laura", "Ralph", "Beverly", "Kamila", "Lawrence", "Vivian" ], "edges": [ [ 0, 2 ], [ 0, 4 ], [ 0, 7 ], [ 0, 9 ], [ 1, 5 ], [ 1, 8 ], [ 7, 6 ], [ 7, 1 ], [ 8, 3 ], [ 10, 12 ], [ 10, 14 ], [ 10, 17 ], [ 10, 19 ], [ 11, 15 ], [ 11, 18 ], [ 17, 16 ], [ 17, 11 ], [ 18, 13 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Frankie knows Gertrude. Jodi knows Emily. Scott knows Austin. Yvette knows Greer. Austin knows Kim. Bob knows Eve. Lloyd knows Jerry. Jerry knows Chantal. Porter knows Bob. Frankie knows Tanya. Clay knows Lloyd. Eve knows Carmen. Clay knows Yvette. Kim knows Clay. Carmen knows Lionel. Tanya knows Porter. Bob knows Jodi. Scott knows Belinda. Which of Clay and Bob can Scott reach?", "answer": "Clay", "steps": [ "Scott knows Austin.", "Austin knows Kim.", "Kim knows Clay." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Scott", "Kim", "Yvette", "Lloyd", "Chantal", "Belinda", "Jerry", "Greer", "Austin", "Clay", "Frankie", "Porter", "Jodi", "Eve", "Lionel", "Gertrude", "Carmen", "Emily", "Tanya", "Bob" ], "edges": [ [ 0, 5 ], [ 0, 8 ], [ 1, 9 ], [ 2, 7 ], [ 3, 6 ], [ 6, 4 ], [ 8, 1 ], [ 9, 3 ], [ 9, 2 ], [ 10, 15 ], [ 10, 18 ], [ 11, 19 ], [ 12, 17 ], [ 13, 16 ], [ 16, 14 ], [ 18, 11 ], [ 19, 13 ], [ 19, 12 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Raymond knows Florence. Esperanza knows Cliff. Dolores knows David. Cliff knows Harley. Esperanza knows Carla. Porter knows Raymond. Kevin knows Spencer. Porter knows Penny. Cliff knows Gerard. Cliff knows Gertrude. Carla knows Kevin. Raymond knows Vera. Vera knows Jeff. Jeff knows Kyle. Brent knows Trevor. Penny knows Dolores. Harley knows Brent. Raymond knows Larissa. Which of Cliff and Raymond can Porter reach?", "answer": "Raymond", "steps": [ "Porter knows Raymond." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Porter", "Jeff", "Raymond", "Vera", "Larissa", "Dolores", "David", "Florence", "Penny", "Kyle", "Esperanza", "Brent", "Cliff", "Harley", "Gertrude", "Kevin", "Spencer", "Gerard", "Carla", "Trevor" ], "edges": [ [ 0, 8 ], [ 0, 2 ], [ 1, 9 ], [ 2, 4 ], [ 2, 7 ], [ 2, 3 ], [ 3, 1 ], [ 5, 6 ], [ 8, 5 ], [ 10, 18 ], [ 10, 12 ], [ 11, 19 ], [ 12, 14 ], [ 12, 17 ], [ 12, 13 ], [ 13, 11 ], [ 15, 16 ], [ 18, 15 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Judith knows Lillian. Kendra knows Dora. Dudley knows Judith. Darcy knows Hector. Lance knows Kendra. Declan knows Jem. Ford knows Giselle. Chelsea knows Ford. Mike knows Kim. Kendra knows Chelsea. Kim knows Lance. Russell knows Mike. Declan knows Dudley. Jon knows Darcy. Kim knows Patricia. Judith knows Jon. Paula knows Elias. Elias knows Declan. Which of Lance and Dudley can Russell reach?", "answer": "Lance", "steps": [ "Russell knows Mike.", "Mike knows Kim.", "Kim knows Lance." ], "difficulty": 3, "original_distance": 7, "idx_to_symbol": [ "Russell", "Lance", "Kendra", "Ford", "Patricia", "Dora", "Mike", "Kim", "Giselle", "Chelsea", "Paula", "Dudley", "Judith", "Darcy", "Jem", "Lillian", "Elias", "Declan", "Hector", "Jon" ], "edges": [ [ 0, 6 ], [ 1, 2 ], [ 2, 5 ], [ 2, 9 ], [ 3, 8 ], [ 6, 7 ], [ 7, 4 ], [ 7, 1 ], [ 9, 3 ], [ 10, 16 ], [ 11, 12 ], [ 12, 15 ], [ 12, 19 ], [ 13, 18 ], [ 16, 17 ], [ 17, 14 ], [ 17, 11 ], [ 19, 13 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Inez knows Yolanda. Demetrius knows Eve. Demetrius knows Linda. Latoya knows Graeme. Linda knows Crystal. Matthew knows Annie. Penny knows Jarvis. Linda knows Laura. Maya knows Penny. Annie knows Jeffery. Yolanda knows Erma. Leticia knows Kylie. Eve knows Leticia. Penny knows Julian. Wilbur knows Latoya. Laura knows Inez. Jarvis knows Matthew. Maya knows Wilbur. Which of Jarvis and Laura can Maya reach?", "answer": "Jarvis", "steps": [ "Maya knows Penny.", "Penny knows Jarvis." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Maya", "Jarvis", "Wilbur", "Matthew", "Penny", "Jeffery", "Annie", "Graeme", "Julian", "Latoya", "Demetrius", "Laura", "Eve", "Inez", "Linda", "Erma", "Yolanda", "Kylie", "Crystal", "Leticia" ], "edges": [ [ 0, 4 ], [ 0, 2 ], [ 1, 3 ], [ 2, 9 ], [ 3, 6 ], [ 4, 1 ], [ 4, 8 ], [ 6, 5 ], [ 9, 7 ], [ 10, 14 ], [ 10, 12 ], [ 11, 13 ], [ 12, 19 ], [ 13, 16 ], [ 14, 11 ], [ 14, 18 ], [ 16, 15 ], [ 19, 17 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Cruz knows Harris. Harris knows Jenny. Mason knows Cruz. Morgan knows Kit. Mason knows Kenneth. Jacob knows Joaquin. Harris knows Dorian. Clement knows Beau. Constance knows Esme. Darius knows Max. Joaquin knows Greer. Esme knows Jose. Darius knows Jacob. Dorian knows Morgan. Gage knows Craig. Jose knows Clement. Joaquin knows Constance. Kit knows Gage. Which of Esme and Morgan can Darius reach?", "answer": "Esme", "steps": [ "Darius knows Jacob.", "Jacob knows Joaquin.", "Joaquin knows Constance.", "Constance knows Esme." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Darius", "Greer", "Jose", "Jacob", "Max", "Constance", "Clement", "Esme", "Beau", "Joaquin", "Mason", "Jenny", "Kit", "Cruz", "Kenneth", "Dorian", "Gage", "Morgan", "Craig", "Harris" ], "edges": [ [ 0, 4 ], [ 0, 3 ], [ 2, 6 ], [ 3, 9 ], [ 5, 7 ], [ 6, 8 ], [ 7, 2 ], [ 9, 1 ], [ 9, 5 ], [ 10, 14 ], [ 10, 13 ], [ 12, 16 ], [ 13, 19 ], [ 15, 17 ], [ 16, 18 ], [ 17, 12 ], [ 19, 11 ], [ 19, 15 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Alejandro knows Verna. Emery knows Delilah. Gary knows Arthur. Emery knows Sue. Arthur knows Louise. Verna knows Essie. Edith knows Sonia. Sue knows Gary. Drake knows Alejandro. Alejandro knows Edith. Hilda knows Julio. Delilah knows Bernice. Arthur knows Graeme. Sonia knows Hilda. Donald knows Emery. Hilda knows Jonas. Hilda knows Hal. Arthur knows David. Which of Sonia and Gary can Donald reach?", "answer": "Gary", "steps": [ "Donald knows Emery.", "Emery knows Sue.", "Sue knows Gary." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Donald", "Arthur", "Sue", "David", "Bernice", "Gary", "Graeme", "Louise", "Delilah", "Emery", "Drake", "Hilda", "Edith", "Jonas", "Essie", "Sonia", "Hal", "Julio", "Verna", "Alejandro" ], "edges": [ [ 0, 9 ], [ 1, 3 ], [ 1, 6 ], [ 1, 7 ], [ 2, 5 ], [ 5, 1 ], [ 8, 4 ], [ 9, 2 ], [ 9, 8 ], [ 10, 19 ], [ 11, 13 ], [ 11, 16 ], [ 11, 17 ], [ 12, 15 ], [ 15, 11 ], [ 18, 14 ], [ 19, 12 ], [ 19, 18 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Neil knows Marilyn. Oliver knows Wallace. Marilyn knows Chase. Julio knows Charity. Lawson knows Oliver. Carol knows Neil. Julio knows Harry. Carol knows Mia. Khashayar knows Carrie. Mia knows Wayne. Khashayar knows Martha. Neil knows Julio. Wallace knows Ernie. Asher knows Shawn. Wallace knows Zane. Oliver knows Asher. Lawson knows Khashayar. Mia knows Humphrey. Which of Oliver and Neil can Carol reach?", "answer": "Neil", "steps": [ "Carol knows Neil." ], "difficulty": 1, "original_distance": 3, "idx_to_symbol": [ "Carol", "Marilyn", "Neil", "Charity", "Mia", "Wayne", "Harry", "Julio", "Chase", "Humphrey", "Lawson", "Asher", "Oliver", "Zane", "Khashayar", "Carrie", "Ernie", "Wallace", "Shawn", "Martha" ], "edges": [ [ 0, 2 ], [ 0, 4 ], [ 1, 8 ], [ 2, 7 ], [ 2, 1 ], [ 4, 5 ], [ 4, 9 ], [ 7, 3 ], [ 7, 6 ], [ 10, 12 ], [ 10, 14 ], [ 11, 18 ], [ 12, 17 ], [ 12, 11 ], [ 14, 15 ], [ 14, 19 ], [ 17, 13 ], [ 17, 16 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Louis knows Clara. Kenzie knows Joy. Ibrahim knows Jeremiah. Trina knows Flora. Joyce knows Enid. Joyce knows Troy. Ibrahim knows Kamila. Natalie knows Louis. Ibrahim knows Donovan. Louis knows Gladys. Vernon knows Lawson. Vernon knows Cruz. Trina knows Joyce. Louis knows Patrick. Kenzie knows Ibrahim. Vernon knows Jeanne. Jeremiah knows Vernon. Joyce knows Natalie. Which of Vernon and Louis can Kenzie reach?", "answer": "Vernon", "steps": [ "Kenzie knows Ibrahim.", "Ibrahim knows Jeremiah.", "Jeremiah knows Vernon." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Kenzie", "Joy", "Kamila", "Lawson", "Vernon", "Jeremiah", "Cruz", "Jeanne", "Donovan", "Ibrahim", "Trina", "Flora", "Enid", "Patrick", "Louis", "Natalie", "Gladys", "Clara", "Troy", "Joyce" ], "edges": [ [ 0, 1 ], [ 0, 9 ], [ 4, 3 ], [ 4, 6 ], [ 4, 7 ], [ 5, 4 ], [ 9, 2 ], [ 9, 5 ], [ 9, 8 ], [ 10, 11 ], [ 10, 19 ], [ 14, 13 ], [ 14, 16 ], [ 14, 17 ], [ 15, 14 ], [ 19, 12 ], [ 19, 15 ], [ 19, 18 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Kara knows Jewel. Clyde knows Devin. Effie knows Kara. Jack knows Dudley. Joan knows Carlton. Dakota knows Lloyd. Dudley knows Effie. Carey knows Nelson. Shelby knows Carey. Troy knows Jana. Shelby knows Dakota. Ashley knows Troy. Nelson knows Robin. Kristin knows Shelby. Kristin knows Clyde. Dudley knows Joan. Effie knows Ashley. Donald knows Kristin. Which of Shelby and Effie can Donald reach?", "answer": "Shelby", "steps": [ "Donald knows Kristin.", "Kristin knows Shelby." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Donald", "Carey", "Lloyd", "Robin", "Devin", "Clyde", "Kristin", "Dakota", "Nelson", "Shelby", "Jack", "Ashley", "Jewel", "Jana", "Carlton", "Joan", "Dudley", "Kara", "Troy", "Effie" ], "edges": [ [ 0, 6 ], [ 1, 8 ], [ 5, 4 ], [ 6, 5 ], [ 6, 9 ], [ 7, 2 ], [ 8, 3 ], [ 9, 7 ], [ 9, 1 ], [ 10, 16 ], [ 11, 18 ], [ 15, 14 ], [ 16, 15 ], [ 16, 19 ], [ 17, 12 ], [ 18, 13 ], [ 19, 17 ], [ 19, 11 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Brent knows Cruz. Bella knows Pat. Darla knows Brent. Shaun knows Eleanor. Eleanor knows Parker. Parker knows Vera. Mitchell knows Marion. Boyd knows Todd. Cruz knows Rose. Marion knows Leonard. Darla knows Sam. Rose knows Garland. Todd knows Neil. Bella knows Boyd. Shaun knows Katherine. Garland knows Mitchell. Neil knows Shaun. Garland knows Brian. Which of Todd and Cruz can Darla reach?", "answer": "Cruz", "steps": [ "Darla knows Brent.", "Brent knows Cruz." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Darla", "Mitchell", "Leonard", "Marion", "Brian", "Cruz", "Brent", "Rose", "Garland", "Sam", "Bella", "Eleanor", "Vera", "Parker", "Katherine", "Todd", "Boyd", "Neil", "Shaun", "Pat" ], "edges": [ [ 0, 6 ], [ 0, 9 ], [ 1, 3 ], [ 3, 2 ], [ 5, 7 ], [ 6, 5 ], [ 7, 8 ], [ 8, 1 ], [ 8, 4 ], [ 10, 16 ], [ 10, 19 ], [ 11, 13 ], [ 13, 12 ], [ 15, 17 ], [ 16, 15 ], [ 17, 18 ], [ 18, 11 ], [ 18, 14 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Jarvis knows Marshall. Brandon knows Lambert. Charlene knows Kirk. Owen knows Amelia. Edison knows Derek. Charlene knows William. Jackson knows Owen. Jarvis knows Eli. Marshall knows Preston. Finn knows Ella. Virginia knows Edison. Finn knows Virginia. Finn knows Carrie. William knows Jarvis. Carrie knows Brandon. Edison knows Doug. Charlene knows Jackson. Doug knows Kathleen. Which of Kathleen and Preston can Finn reach?", "answer": "Kathleen", "steps": [ "Finn knows Virginia.", "Virginia knows Edison.", "Edison knows Doug.", "Doug knows Kathleen." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Finn", "Derek", "Virginia", "Brandon", "Kathleen", "Carrie", "Lambert", "Ella", "Doug", "Edison", "Charlene", "Eli", "William", "Owen", "Preston", "Jackson", "Amelia", "Kirk", "Marshall", "Jarvis" ], "edges": [ [ 0, 5 ], [ 0, 7 ], [ 0, 2 ], [ 2, 9 ], [ 3, 6 ], [ 5, 3 ], [ 8, 4 ], [ 9, 1 ], [ 9, 8 ], [ 10, 15 ], [ 10, 17 ], [ 10, 12 ], [ 12, 19 ], [ 13, 16 ], [ 15, 13 ], [ 18, 14 ], [ 19, 11 ], [ 19, 18 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Boris knows Corinne. Irving knows Gus. Roland knows Riley. Lionel knows Craig. Corinne knows Winifred. Clarence knows Juan. Peter knows Devon. Roland knows Gwen. Devon knows Owen. Willard knows Ariel. Clarence knows Courtney. Roland knows Boris. Irving knows Lionel. Craig knows Jodi. Courtney knows Constance. Craig knows Willard. Irving knows Peter. Riley knows Clarence. Which of Willard and Courtney can Roland reach?", "answer": "Courtney", "steps": [ "Roland knows Riley.", "Riley knows Clarence.", "Clarence knows Courtney." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Roland", "Constance", "Boris", "Riley", "Winifred", "Corinne", "Juan", "Clarence", "Courtney", "Gwen", "Irving", "Ariel", "Peter", "Lionel", "Owen", "Devon", "Jodi", "Craig", "Willard", "Gus" ], "edges": [ [ 0, 2 ], [ 0, 3 ], [ 0, 9 ], [ 2, 5 ], [ 3, 7 ], [ 5, 4 ], [ 7, 6 ], [ 7, 8 ], [ 8, 1 ], [ 10, 12 ], [ 10, 13 ], [ 10, 19 ], [ 12, 15 ], [ 13, 17 ], [ 15, 14 ], [ 17, 16 ], [ 17, 18 ], [ 18, 11 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Kay knows Ava. Asher knows Francesca. Randall knows Judith. Irving knows Daria. Asher knows Joyce. Francesca knows Destiny. Daria knows Randall. Randall knows Drew. Garland knows Shaun. Drew knows Aria. Drew knows Caroline. Francesca knows Garland. Drew knows Clinton. Shaun knows Gina. Francesca knows Isabel. Cynthia knows Jenny. Ava knows Asher. Clinton knows Cynthia. Which of Garland and Clinton can Kay reach?", "answer": "Garland", "steps": [ "Kay knows Ava.", "Ava knows Asher.", "Asher knows Francesca.", "Francesca knows Garland." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Kay", "Joyce", "Shaun", "Garland", "Asher", "Gina", "Destiny", "Francesca", "Ava", "Isabel", "Irving", "Judith", "Cynthia", "Clinton", "Randall", "Jenny", "Aria", "Drew", "Daria", "Caroline" ], "edges": [ [ 0, 8 ], [ 2, 5 ], [ 3, 2 ], [ 4, 1 ], [ 4, 7 ], [ 7, 3 ], [ 7, 6 ], [ 7, 9 ], [ 8, 4 ], [ 10, 18 ], [ 12, 15 ], [ 13, 12 ], [ 14, 11 ], [ 14, 17 ], [ 17, 13 ], [ 17, 16 ], [ 17, 19 ], [ 18, 14 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Clement knows Isla. Zane knows Pat. Kira knows Lillian. Cassidy knows Edna. Cassidy knows Phoebe. Ebony knows Clement. Isaac knows Gemma. Brittany knows Kira. Gemma knows Ebony. Pat knows Cassidy. Isla knows Kirsten. Kirsten knows Carter. Kira knows Kenneth. Kirsten knows Max. Gemma knows Mark. Phoebe knows Brittany. Ebony knows Gerald. Pat knows Kylie. Which of Isla and Brittany can Isaac reach?", "answer": "Isla", "steps": [ "Isaac knows Gemma.", "Gemma knows Ebony.", "Ebony knows Clement.", "Clement knows Isla." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Isaac", "Kirsten", "Ebony", "Max", "Mark", "Gemma", "Isla", "Gerald", "Clement", "Carter", "Zane", "Kira", "Cassidy", "Kenneth", "Kylie", "Pat", "Brittany", "Edna", "Phoebe", "Lillian" ], "edges": [ [ 0, 5 ], [ 1, 3 ], [ 1, 9 ], [ 2, 7 ], [ 2, 8 ], [ 5, 4 ], [ 5, 2 ], [ 6, 1 ], [ 8, 6 ], [ 10, 15 ], [ 11, 13 ], [ 11, 19 ], [ 12, 17 ], [ 12, 18 ], [ 15, 14 ], [ 15, 12 ], [ 16, 11 ], [ 18, 16 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Mildred knows Annie. Allen knows Daphna. Mildred knows Aspen. Chris knows Jack. Daphna knows Blaine. Sidney knows Faye. Cara knows Allen. Annie knows Cara. Rhonda knows Ella. Alvin knows Mildred. Chantal knows Alejandro. Alejandro knows Sidney. Rhonda knows Rosemary. Della knows Esperanza. Jack knows Rhonda. Bella knows Chris. Esperanza knows Alvin. Ella knows Chantal. Which of Jack and Alvin can Della reach?", "answer": "Alvin", "steps": [ "Della knows Esperanza.", "Esperanza knows Alvin." ], "difficulty": 2, "original_distance": 8, "idx_to_symbol": [ "Della", "Blaine", "Daphna", "Mildred", "Aspen", "Esperanza", "Annie", "Cara", "Allen", "Alvin", "Bella", "Faye", "Sidney", "Rhonda", "Rosemary", "Chris", "Ella", "Chantal", "Alejandro", "Jack" ], "edges": [ [ 0, 5 ], [ 2, 1 ], [ 3, 4 ], [ 3, 6 ], [ 5, 9 ], [ 6, 7 ], [ 7, 8 ], [ 8, 2 ], [ 9, 3 ], [ 10, 15 ], [ 12, 11 ], [ 13, 14 ], [ 13, 16 ], [ 15, 19 ], [ 16, 17 ], [ 17, 18 ], [ 18, 12 ], [ 19, 13 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Elton knows Keira. Gregory knows Fritz. Glen knows Austin. Shaun knows Elton. Keira knows Rocco. Hazel knows Shaun. Blake knows August. Shaun knows Emily. Celeste knows Houston. Barry knows Israel. Rosa knows Celeste. Bennett knows Bob. Gregory knows Blake. Fritz knows Drake. Houston knows Bennett. Bennett knows Gregory. Elton knows Barry. Austin knows Hazel. Which of Elton and Gregory can Glen reach?", "answer": "Elton", "steps": [ "Glen knows Austin.", "Austin knows Hazel.", "Hazel knows Shaun.", "Shaun knows Elton." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Glen", "Hazel", "Austin", "Israel", "Rocco", "Elton", "Shaun", "Barry", "Emily", "Keira", "Rosa", "Houston", "Celeste", "Drake", "August", "Gregory", "Bennett", "Fritz", "Bob", "Blake" ], "edges": [ [ 0, 2 ], [ 1, 6 ], [ 2, 1 ], [ 5, 7 ], [ 5, 9 ], [ 6, 8 ], [ 6, 5 ], [ 7, 3 ], [ 9, 4 ], [ 10, 12 ], [ 11, 16 ], [ 12, 11 ], [ 15, 17 ], [ 15, 19 ], [ 16, 18 ], [ 16, 15 ], [ 17, 13 ], [ 19, 14 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Basil knows Trina. Gregory knows Maria. Janelle knows Zach. Zach knows Penny. Selena knows Elvis. Cora knows Daria. Hattie knows Janelle. Kimberly knows Kane. Cora knows Kareem. Alvin knows Hattie. Trina knows Kimberly. Penny knows Gregory. Kimberly knows Coral. Aldo knows Donald. Elvis knows Lambert. Hattie knows Cora. Lambert knows Aldo. Trina knows Selena. Which of Penny and Lambert can Alvin reach?", "answer": "Penny", "steps": [ "Alvin knows Hattie.", "Hattie knows Janelle.", "Janelle knows Zach.", "Zach knows Penny." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Alvin", "Daria", "Cora", "Hattie", "Zach", "Maria", "Kareem", "Janelle", "Gregory", "Penny", "Basil", "Kane", "Kimberly", "Trina", "Elvis", "Donald", "Coral", "Selena", "Aldo", "Lambert" ], "edges": [ [ 0, 3 ], [ 2, 1 ], [ 2, 6 ], [ 3, 2 ], [ 3, 7 ], [ 4, 9 ], [ 7, 4 ], [ 8, 5 ], [ 9, 8 ], [ 10, 13 ], [ 12, 11 ], [ 12, 16 ], [ 13, 12 ], [ 13, 17 ], [ 14, 19 ], [ 17, 14 ], [ 18, 15 ], [ 19, 18 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Cassidy knows Xavier. Brett knows Flora. Axel knows Yvonne. Yvonne knows Ingrid. Luther knows Julie. James knows George. George knows Axel. Rocco knows Cassidy. Miranda knows Teresa. Flora knows Darcy. Itzel knows Rocco. Darcy knows Autumn. Itzel knows Brett. Merle knows Miranda. Bella knows James. Bella knows Merle. Teresa knows Holden. Xavier knows Luther. Which of Luther and Yvonne can Itzel reach?", "answer": "Luther", "steps": [ "Itzel knows Rocco.", "Rocco knows Cassidy.", "Cassidy knows Xavier.", "Xavier knows Luther." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Itzel", "Brett", "Luther", "Julie", "Cassidy", "Autumn", "Darcy", "Rocco", "Xavier", "Flora", "Bella", "Merle", "Yvonne", "Ingrid", "George", "Holden", "Teresa", "James", "Axel", "Miranda" ], "edges": [ [ 0, 7 ], [ 0, 1 ], [ 1, 9 ], [ 2, 3 ], [ 4, 8 ], [ 6, 5 ], [ 7, 4 ], [ 8, 2 ], [ 9, 6 ], [ 10, 17 ], [ 10, 11 ], [ 11, 19 ], [ 12, 13 ], [ 14, 18 ], [ 16, 15 ], [ 17, 14 ], [ 18, 12 ], [ 19, 16 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Tonya knows Della. Hope knows Winston. Taylor knows Tim. Cora knows Ida. Byron knows Evan. Tonya knows Taylor. Paige knows Shannon. Lewis knows Paige. Tim knows Josie. Daisy knows Marvin. Lucy knows Virgil. Cora knows Dudley. Evan knows Janice. Daisy knows Lewis. Daisy knows Hope. Ida knows Lucy. Hope knows Byron. Cora knows Tonya. Which of Tonya and Hope can Cora reach?", "answer": "Tonya", "steps": [ "Cora knows Tonya." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Cora", "Josie", "Taylor", "Tim", "Lucy", "Virgil", "Della", "Ida", "Tonya", "Dudley", "Daisy", "Janice", "Byron", "Evan", "Paige", "Shannon", "Winston", "Lewis", "Hope", "Marvin" ], "edges": [ [ 0, 7 ], [ 0, 8 ], [ 0, 9 ], [ 2, 3 ], [ 3, 1 ], [ 4, 5 ], [ 7, 4 ], [ 8, 2 ], [ 8, 6 ], [ 10, 17 ], [ 10, 18 ], [ 10, 19 ], [ 12, 13 ], [ 13, 11 ], [ 14, 15 ], [ 17, 14 ], [ 18, 12 ], [ 18, 16 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Eleanor knows Annie. Irma knows Dewey. Kingsley knows Otto. Dewey knows Lola. Lola knows Jenna. Effie knows Keegan. Kingsley knows Garrison. Otto knows Shannon. Garrison knows Jolene. Eleanor knows Irma. Irma knows Garland. Garrison knows Esther. Sadie knows Kingsley. Jolene knows Kirsten. Kirsten knows Jasmine. Shannon knows Sierra. Tiffany knows Eleanor. Annie knows Effie. Which of Kingsley and Eleanor can Sadie reach?", "answer": "Kingsley", "steps": [ "Sadie knows Kingsley." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Sadie", "Kirsten", "Shannon", "Kingsley", "Otto", "Sierra", "Jolene", "Jasmine", "Garrison", "Esther", "Tiffany", "Lola", "Effie", "Eleanor", "Annie", "Keegan", "Dewey", "Jenna", "Irma", "Garland" ], "edges": [ [ 0, 3 ], [ 1, 7 ], [ 2, 5 ], [ 3, 4 ], [ 3, 8 ], [ 4, 2 ], [ 6, 1 ], [ 8, 6 ], [ 8, 9 ], [ 10, 13 ], [ 11, 17 ], [ 12, 15 ], [ 13, 14 ], [ 13, 18 ], [ 14, 12 ], [ 16, 11 ], [ 18, 16 ], [ 18, 19 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Dawn knows Adam. Gene knows Connor. Adam knows Finn. Finn knows Megan. Fanny knows Dawn. Avery knows Dell. Wilson knows Avery. Marilyn knows Gideon. Megan knows Gene. Gideon knows Lorraine. Etta knows Wilson. Curtis knows James. Lars knows Etta. Connor knows Bonnie. Gene knows Lawson. Francesca knows Fanny. Avery knows Curtis. Lorraine knows Lars. Which of Curtis and Connor can Marilyn reach?", "answer": "Curtis", "steps": [ "Marilyn knows Gideon.", "Gideon knows Lorraine.", "Lorraine knows Lars.", "Lars knows Etta.", "Etta knows Wilson.", "Wilson knows Avery.", "Avery knows Curtis." ], "difficulty": 7, "original_distance": 8, "idx_to_symbol": [ "Marilyn", "Lorraine", "Etta", "Curtis", "Wilson", "Gideon", "Dell", "James", "Avery", "Lars", "Francesca", "Dawn", "Finn", "Connor", "Megan", "Fanny", "Lawson", "Bonnie", "Gene", "Adam" ], "edges": [ [ 0, 5 ], [ 1, 9 ], [ 2, 4 ], [ 3, 7 ], [ 4, 8 ], [ 5, 1 ], [ 8, 6 ], [ 8, 3 ], [ 9, 2 ], [ 10, 15 ], [ 11, 19 ], [ 12, 14 ], [ 13, 17 ], [ 14, 18 ], [ 15, 11 ], [ 18, 16 ], [ 18, 13 ], [ 19, 12 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Faye knows Mack. Ramona knows Eamon. Aisha knows Frankie. Hampton knows Jonathan. Frankie knows Roman. Olive knows Kirk. Kirk knows Ramona. Ted knows Sebastian. Olive knows Jerry. Frankie knows Hampton. Aisha knows Val. Faye knows Olive. Sebastian knows Aisha. Katrina knows Faye. Jonathan knows Ford. Ramona knows Rosa. Jonathan knows Percy. Emanuel knows Katrina. Which of Ramona and Jonathan can Emanuel reach?", "answer": "Ramona", "steps": [ "Emanuel knows Katrina.", "Katrina knows Faye.", "Faye knows Olive.", "Olive knows Kirk.", "Kirk knows Ramona." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Emanuel", "Katrina", "Ramona", "Jerry", "Mack", "Kirk", "Rosa", "Eamon", "Olive", "Faye", "Ted", "Sebastian", "Jonathan", "Roman", "Val", "Hampton", "Ford", "Percy", "Frankie", "Aisha" ], "edges": [ [ 0, 1 ], [ 1, 9 ], [ 2, 6 ], [ 2, 7 ], [ 5, 2 ], [ 8, 3 ], [ 8, 5 ], [ 9, 4 ], [ 9, 8 ], [ 10, 11 ], [ 11, 19 ], [ 12, 16 ], [ 12, 17 ], [ 15, 12 ], [ 18, 13 ], [ 18, 15 ], [ 19, 14 ], [ 19, 18 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Russ knows Bennett. Walt knows Harley. Russ knows Aria. Ramona knows Serena. Ford knows Selena. Serena knows Andrew. Harris knows Ramona. Jewel knows Chantal. Humphrey knows Carson. Ford knows Walt. Jose knows Russ. Selena knows Humphrey. Alison knows Jewel. Jewel knows Harris. Bennett knows Ford. Goldie knows Lewis. Hank knows Goldie. Ramona knows Hank. Which of Russ and Jewel can Alison reach?", "answer": "Jewel", "steps": [ "Alison knows Jewel." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Alison", "Harris", "Jewel", "Serena", "Lewis", "Chantal", "Ramona", "Andrew", "Hank", "Goldie", "Jose", "Bennett", "Russ", "Walt", "Carson", "Aria", "Ford", "Harley", "Selena", "Humphrey" ], "edges": [ [ 0, 2 ], [ 1, 6 ], [ 2, 5 ], [ 2, 1 ], [ 3, 7 ], [ 6, 3 ], [ 6, 8 ], [ 8, 9 ], [ 9, 4 ], [ 10, 12 ], [ 11, 16 ], [ 12, 15 ], [ 12, 11 ], [ 13, 17 ], [ 16, 13 ], [ 16, 18 ], [ 18, 19 ], [ 19, 14 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Arthur knows Elvira. Karen knows Earl. Kennedy knows Arthur. Zachary knows India. Karen knows Derrick. Electra knows Ruth. Derrick knows Liam. Karen knows Mildred. Leslie knows Jonah. Camille knows Taylor. Earl knows Clay. Clay knows Electra. Leslie knows Kennedy. Leslie knows Zachary. India knows Cole. Jonah knows Alison. Mildred knows Camille. Cole knows Claude. Which of Earl and Zachary can Leslie reach?", "answer": "Zachary", "steps": [ "Leslie knows Zachary." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Leslie", "Alison", "Zachary", "Elvira", "India", "Cole", "Kennedy", "Claude", "Jonah", "Arthur", "Karen", "Liam", "Earl", "Taylor", "Clay", "Electra", "Mildred", "Ruth", "Derrick", "Camille" ], "edges": [ [ 0, 2 ], [ 0, 8 ], [ 0, 6 ], [ 2, 4 ], [ 4, 5 ], [ 5, 7 ], [ 6, 9 ], [ 8, 1 ], [ 9, 3 ], [ 10, 12 ], [ 10, 18 ], [ 10, 16 ], [ 12, 14 ], [ 14, 15 ], [ 15, 17 ], [ 16, 19 ], [ 18, 11 ], [ 19, 13 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Cassidy knows Xavier. Brett knows Flora. Axel knows Yvonne. Yvonne knows Ingrid. Luther knows Julie. James knows George. George knows Axel. Rocco knows Cassidy. Miranda knows Teresa. Flora knows Darcy. Itzel knows Rocco. Darcy knows Autumn. Itzel knows Brett. Merle knows Miranda. Bella knows James. Bella knows Merle. Teresa knows Holden. Xavier knows Luther. Which of Ingrid and Julie can Itzel reach?", "answer": "Julie", "steps": [ "Itzel knows Rocco.", "Rocco knows Cassidy.", "Cassidy knows Xavier.", "Xavier knows Luther.", "Luther knows Julie." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Itzel", "Brett", "Luther", "Julie", "Cassidy", "Autumn", "Darcy", "Rocco", "Xavier", "Flora", "Bella", "Merle", "Yvonne", "Ingrid", "George", "Holden", "Teresa", "James", "Axel", "Miranda" ], "edges": [ [ 0, 7 ], [ 0, 1 ], [ 1, 9 ], [ 2, 3 ], [ 4, 8 ], [ 6, 5 ], [ 7, 4 ], [ 8, 2 ], [ 9, 6 ], [ 10, 17 ], [ 10, 11 ], [ 11, 19 ], [ 12, 13 ], [ 14, 18 ], [ 16, 15 ], [ 17, 14 ], [ 18, 12 ], [ 19, 16 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Alyssa knows Ariana. Barbara knows Houston. Violet knows Gertrude. Gertrude knows Garrett. Dakota knows Raymond. Barbara knows Violet. Garrett knows Isla. Ariana knows Fabian. Xavier knows Porter. Xavier knows Colby. Violet knows Dorothy. Garrett knows Melody. Dorothy knows Rita. Rita knows Anita. Colby knows Alyssa. Cassidy knows Dakota. Dakota knows Abby. Colby knows Cassidy. Which of Garrett and Dakota can Barbara reach?", "answer": "Garrett", "steps": [ "Barbara knows Violet.", "Violet knows Gertrude.", "Gertrude knows Garrett." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Barbara", "Anita", "Garrett", "Houston", "Gertrude", "Rita", "Melody", "Isla", "Violet", "Dorothy", "Xavier", "Fabian", "Dakota", "Porter", "Cassidy", "Ariana", "Raymond", "Abby", "Colby", "Alyssa" ], "edges": [ [ 0, 3 ], [ 0, 8 ], [ 2, 6 ], [ 2, 7 ], [ 4, 2 ], [ 5, 1 ], [ 8, 4 ], [ 8, 9 ], [ 9, 5 ], [ 10, 13 ], [ 10, 18 ], [ 12, 16 ], [ 12, 17 ], [ 14, 12 ], [ 15, 11 ], [ 18, 14 ], [ 18, 19 ], [ 19, 15 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Lara knows Lucia. Philip knows Clement. Clement knows Karla. Caleb knows Laverne. Clement knows Lenora. Lucia knows Travis. Jane knows Lara. Colleen knows Jane. Philip knows Caleb. Lucia knows Monroe. Dora knows Emily. Laverne knows Joel. Lara knows Mack. Taylor knows Abel. Laverne knows Riley. Taylor knows Lee. Emily knows Philip. Mack knows Taylor. Which of Joel and Abel can Colleen reach?", "answer": "Abel", "steps": [ "Colleen knows Jane.", "Jane knows Lara.", "Lara knows Mack.", "Mack knows Taylor.", "Taylor knows Abel." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Colleen", "Lee", "Mack", "Monroe", "Travis", "Jane", "Abel", "Lucia", "Lara", "Taylor", "Dora", "Riley", "Caleb", "Karla", "Lenora", "Emily", "Joel", "Clement", "Philip", "Laverne" ], "edges": [ [ 0, 5 ], [ 2, 9 ], [ 5, 8 ], [ 7, 3 ], [ 7, 4 ], [ 8, 7 ], [ 8, 2 ], [ 9, 1 ], [ 9, 6 ], [ 10, 15 ], [ 12, 19 ], [ 15, 18 ], [ 17, 13 ], [ 17, 14 ], [ 18, 17 ], [ 18, 12 ], [ 19, 11 ], [ 19, 16 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Bruno knows Jackson. Lionel knows Cecilia. Ramona knows Bruno. Jackson knows Veronica. Richard knows Todd. Gregory knows Ramona. Veronica knows Eric. Todd knows Chelsea. Eric knows Haven. Erica knows Lionel. Kareem knows Caleb. Lionel knows Dick. Ramona knows Norman. Bruno knows Haley. Dick knows Kareem. Erica knows Delilah. Todd knows Erica. Jackson knows Alyson. Which of Lionel and Jackson can Richard reach?", "answer": "Lionel", "steps": [ "Richard knows Todd.", "Todd knows Erica.", "Erica knows Lionel." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Richard", "Cecilia", "Todd", "Delilah", "Lionel", "Erica", "Dick", "Chelsea", "Kareem", "Caleb", "Gregory", "Alyson", "Ramona", "Haley", "Jackson", "Bruno", "Veronica", "Norman", "Eric", "Haven" ], "edges": [ [ 0, 2 ], [ 2, 7 ], [ 2, 5 ], [ 4, 1 ], [ 4, 6 ], [ 5, 3 ], [ 5, 4 ], [ 6, 8 ], [ 8, 9 ], [ 10, 12 ], [ 12, 17 ], [ 12, 15 ], [ 14, 11 ], [ 14, 16 ], [ 15, 13 ], [ 15, 14 ], [ 16, 18 ], [ 18, 19 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Mary knows Callum. Joanna knows Eve. Lane knows Anastasia. Lennox knows Gladys. Burt knows Karen. Cordelia knows Lennox. Anastasia knows Burt. Callum knows Hamilton. Joanna knows Antonio. Lennox knows Cristina. Anastasia knows Jeremiah. Karen knows Leander. Annie knows Lisa. Annie knows Guillermo. Karen knows Jewel. Callum knows Cordelia. Cristina knows Joanna. Leander knows Annie. Which of Cristina and Leander can Mary reach?", "answer": "Cristina", "steps": [ "Mary knows Callum.", "Callum knows Cordelia.", "Cordelia knows Lennox.", "Lennox knows Cristina." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Mary", "Lennox", "Antonio", "Eve", "Cristina", "Hamilton", "Joanna", "Gladys", "Cordelia", "Callum", "Lane", "Karen", "Lisa", "Guillermo", "Leander", "Jeremiah", "Annie", "Jewel", "Burt", "Anastasia" ], "edges": [ [ 0, 9 ], [ 1, 4 ], [ 1, 7 ], [ 4, 6 ], [ 6, 2 ], [ 6, 3 ], [ 8, 1 ], [ 9, 5 ], [ 9, 8 ], [ 10, 19 ], [ 11, 14 ], [ 11, 17 ], [ 14, 16 ], [ 16, 12 ], [ 16, 13 ], [ 18, 11 ], [ 19, 15 ], [ 19, 18 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Elodie knows June. Ellis knows Alan. Kelly knows Stanley. Sheila knows Henry. Mason knows Kelly. Elliot knows Ellis. Kelly knows Hailey. Hugh knows Graeme. Elvira knows Sheila. Mason knows Boyd. Kelly knows Stephanie. Denver knows Leah. Boyd knows Hugh. Bert knows Denver. Denver knows Elliot. Bert knows Elvira. Stephanie knows Elodie. Denver knows Cruz. Which of Elliot and Stephanie can Bert reach?", "answer": "Elliot", "steps": [ "Bert knows Denver.", "Denver knows Elliot." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Bert", "Alan", "Henry", "Sheila", "Cruz", "Ellis", "Elliot", "Elvira", "Leah", "Denver", "Mason", "June", "Graeme", "Hugh", "Stanley", "Elodie", "Stephanie", "Boyd", "Hailey", "Kelly" ], "edges": [ [ 0, 7 ], [ 0, 9 ], [ 3, 2 ], [ 5, 1 ], [ 6, 5 ], [ 7, 3 ], [ 9, 4 ], [ 9, 6 ], [ 9, 8 ], [ 10, 17 ], [ 10, 19 ], [ 13, 12 ], [ 15, 11 ], [ 16, 15 ], [ 17, 13 ], [ 19, 14 ], [ 19, 16 ], [ 19, 18 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Frida knows Gonzalo. Nadine knows Greta. Shannon knows Harley. George knows Raymond. Carlton knows Celia. Carol knows Carlton. Nadine knows Kenzie. Gonzalo knows George. Joel knows Riley. Carlton knows Bryan. Robert knows Kennedy. Gonzalo knows Shannon. Shannon knows Jorge. Celia knows Jessica. Carol knows Nadine. Riley knows Carol. Gemma knows Frida. George knows Robert. Which of Kennedy and Jessica can Gemma reach?", "answer": "Kennedy", "steps": [ "Gemma knows Frida.", "Frida knows Gonzalo.", "Gonzalo knows George.", "George knows Robert.", "Robert knows Kennedy." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Gemma", "Raymond", "Frida", "Harley", "George", "Shannon", "Robert", "Kennedy", "Jorge", "Gonzalo", "Joel", "Bryan", "Riley", "Kenzie", "Carlton", "Nadine", "Celia", "Jessica", "Greta", "Carol" ], "edges": [ [ 0, 2 ], [ 2, 9 ], [ 4, 1 ], [ 4, 6 ], [ 5, 3 ], [ 5, 8 ], [ 6, 7 ], [ 9, 4 ], [ 9, 5 ], [ 10, 12 ], [ 12, 19 ], [ 14, 11 ], [ 14, 16 ], [ 15, 13 ], [ 15, 18 ], [ 16, 17 ], [ 19, 14 ], [ 19, 15 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Holly knows Mara. Luz knows Sandy. Clara knows Gail. Wallace knows Chelsea. Terrence knows Dewey. Chelsea knows Christopher. Grady knows Chester. Humphrey knows Luz. Chelsea knows Dina. Chester knows Terrence. Sandy knows Clara. Grady knows Humphrey. Pam knows Wallace. Clara knows Shaun. Yolanda knows Ellis. Francis knows Pam. Ellis knows Holly. Yolanda knows Francis. Which of Pam and Luz can Yolanda reach?", "answer": "Pam", "steps": [ "Yolanda knows Francis.", "Francis knows Pam." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Yolanda", "Pam", "Wallace", "Mara", "Christopher", "Holly", "Chelsea", "Ellis", "Dina", "Francis", "Grady", "Luz", "Sandy", "Dewey", "Shaun", "Terrence", "Clara", "Chester", "Gail", "Humphrey" ], "edges": [ [ 0, 7 ], [ 0, 9 ], [ 1, 2 ], [ 2, 6 ], [ 5, 3 ], [ 6, 4 ], [ 6, 8 ], [ 7, 5 ], [ 9, 1 ], [ 10, 17 ], [ 10, 19 ], [ 11, 12 ], [ 12, 16 ], [ 15, 13 ], [ 16, 14 ], [ 16, 18 ], [ 17, 15 ], [ 19, 11 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Tonya knows Della. Hope knows Winston. Taylor knows Tim. Cora knows Ida. Byron knows Evan. Tonya knows Taylor. Paige knows Shannon. Lewis knows Paige. Tim knows Josie. Daisy knows Marvin. Lucy knows Virgil. Cora knows Dudley. Evan knows Janice. Daisy knows Lewis. Daisy knows Hope. Ida knows Lucy. Hope knows Byron. Cora knows Tonya. Which of Evan and Tim can Cora reach?", "answer": "Tim", "steps": [ "Cora knows Tonya.", "Tonya knows Taylor.", "Taylor knows Tim." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Cora", "Josie", "Taylor", "Tim", "Lucy", "Virgil", "Della", "Ida", "Tonya", "Dudley", "Daisy", "Janice", "Byron", "Evan", "Paige", "Shannon", "Winston", "Lewis", "Hope", "Marvin" ], "edges": [ [ 0, 7 ], [ 0, 8 ], [ 0, 9 ], [ 2, 3 ], [ 3, 1 ], [ 4, 5 ], [ 7, 4 ], [ 8, 2 ], [ 8, 6 ], [ 10, 17 ], [ 10, 18 ], [ 10, 19 ], [ 12, 13 ], [ 13, 11 ], [ 14, 15 ], [ 17, 14 ], [ 18, 12 ], [ 18, 16 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Nora knows Cindy. Reed knows Caleb. Conner knows Lucy. Curtis knows Natalie. Eamon knows Reed. Conner knows Gerard. Curtis knows Max. Richard knows Jose. Eamon knows Hamilton. Perry knows Nora. Dell knows Randall. Nora knows Mabel. Natalie knows Ruby. Cindy knows Curtis. Randall knows Conner. Arnold knows Dell. Lucy knows Eamon. Jose knows Perry. Which of Jose and Dell can Richard reach?", "answer": "Jose", "steps": [ "Richard knows Jose." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Richard", "Ruby", "Mabel", "Cindy", "Max", "Natalie", "Jose", "Curtis", "Perry", "Nora", "Arnold", "Caleb", "Gerard", "Lucy", "Hamilton", "Reed", "Dell", "Eamon", "Randall", "Conner" ], "edges": [ [ 0, 6 ], [ 3, 7 ], [ 5, 1 ], [ 6, 8 ], [ 7, 4 ], [ 7, 5 ], [ 8, 9 ], [ 9, 2 ], [ 9, 3 ], [ 10, 16 ], [ 13, 17 ], [ 15, 11 ], [ 16, 18 ], [ 17, 14 ], [ 17, 15 ], [ 18, 19 ], [ 19, 12 ], [ 19, 13 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Mara knows Heath. Emmett knows Doris. Gregory knows Michelle. Gemma knows Vicki. Gregory knows Darren. Luke knows Mae. Vicki knows Isaac. Mia knows Elaine. Heath knows Mia. Mae knows Autumn. Isaac knows Ira. Luke knows Hadley. Autumn knows Gregory. Doris knows Luke. Doris knows Edward. Isaac knows Mara. Vicki knows Leonard. Mia knows Della. Which of Gregory and Mia can Gemma reach?", "answer": "Mia", "steps": [ "Gemma knows Vicki.", "Vicki knows Isaac.", "Isaac knows Mara.", "Mara knows Heath.", "Heath knows Mia." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Gemma", "Ira", "Leonard", "Mara", "Vicki", "Elaine", "Isaac", "Mia", "Heath", "Della", "Emmett", "Hadley", "Edward", "Mae", "Doris", "Darren", "Luke", "Gregory", "Autumn", "Michelle" ], "edges": [ [ 0, 4 ], [ 3, 8 ], [ 4, 2 ], [ 4, 6 ], [ 6, 1 ], [ 6, 3 ], [ 7, 5 ], [ 7, 9 ], [ 8, 7 ], [ 10, 14 ], [ 13, 18 ], [ 14, 12 ], [ 14, 16 ], [ 16, 11 ], [ 16, 13 ], [ 17, 15 ], [ 17, 19 ], [ 18, 17 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Joy knows Edwin. Ada knows Spencer. Gloria knows Kelly. Darius knows Joy. Allan knows Henrietta. Reid knows Camden. Reid knows Dominic. Lorraine knows Reid. Lillian knows Darius. Lillian knows Pam. Blanche knows Gloria. Joy knows Carter. Allan knows Drew. Spencer knows Lorraine. Henrietta knows Lillian. Spencer knows Caroline. Blanche knows Ada. Drew knows Shelly. Which of Lorraine and Darius can Blanche reach?", "answer": "Lorraine", "steps": [ "Blanche knows Ada.", "Ada knows Spencer.", "Spencer knows Lorraine." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Blanche", "Lorraine", "Ada", "Spencer", "Gloria", "Dominic", "Camden", "Kelly", "Caroline", "Reid", "Allan", "Darius", "Henrietta", "Lillian", "Drew", "Carter", "Edwin", "Shelly", "Pam", "Joy" ], "edges": [ [ 0, 4 ], [ 0, 2 ], [ 1, 9 ], [ 2, 3 ], [ 3, 8 ], [ 3, 1 ], [ 4, 7 ], [ 9, 5 ], [ 9, 6 ], [ 10, 14 ], [ 10, 12 ], [ 11, 19 ], [ 12, 13 ], [ 13, 18 ], [ 13, 11 ], [ 14, 17 ], [ 19, 15 ], [ 19, 16 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Federico knows Heath. Dennis knows Frida. Federico knows Gordon. Alan knows Earl. Cynthia knows Gene. Frida knows Joaquin. Hilda knows Kai. Joaquin knows Tyler. Elise knows Cooper. Kai knows Gina. Cooper knows Cynthia. Kai knows Dennis. Heath knows Elise. Gordon knows Wilson. Wilson knows Fergus. Gina knows Alan. Max knows Federico. Tyler knows Cain. Which of Elise and Frida can Hilda reach?", "answer": "Frida", "steps": [ "Hilda knows Kai.", "Kai knows Dennis.", "Dennis knows Frida." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Hilda", "Alan", "Dennis", "Cain", "Frida", "Kai", "Tyler", "Joaquin", "Gina", "Earl", "Max", "Wilson", "Heath", "Gene", "Elise", "Federico", "Cynthia", "Cooper", "Gordon", "Fergus" ], "edges": [ [ 0, 5 ], [ 1, 9 ], [ 2, 4 ], [ 4, 7 ], [ 5, 2 ], [ 5, 8 ], [ 6, 3 ], [ 7, 6 ], [ 8, 1 ], [ 10, 15 ], [ 11, 19 ], [ 12, 14 ], [ 14, 17 ], [ 15, 12 ], [ 15, 18 ], [ 16, 13 ], [ 17, 16 ], [ 18, 11 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Oscar knows Marcia. Judy knows Otto. Julie knows Fraser. Lorraine knows Colette. Gunnar knows Oscar. Derek knows Nora. Gunnar knows Derek. Lorraine knows Morgan. Julie knows Brooke. Electra knows Blake. Monica knows Lorraine. Derek knows Sydney. Judy knows Cooper. Blake knows Porter. Electra knows Julie. Sydney knows Monica. Brooke knows Joan. Joan knows Judy. Which of Otto and Colette can Electra reach?", "answer": "Otto", "steps": [ "Electra knows Julie.", "Julie knows Brooke.", "Brooke knows Joan.", "Joan knows Judy.", "Judy knows Otto." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Electra", "Fraser", "Brooke", "Judy", "Blake", "Porter", "Otto", "Julie", "Joan", "Cooper", "Gunnar", "Nora", "Sydney", "Lorraine", "Oscar", "Marcia", "Colette", "Derek", "Monica", "Morgan" ], "edges": [ [ 0, 4 ], [ 0, 7 ], [ 2, 8 ], [ 3, 6 ], [ 3, 9 ], [ 4, 5 ], [ 7, 1 ], [ 7, 2 ], [ 8, 3 ], [ 10, 14 ], [ 10, 17 ], [ 12, 18 ], [ 13, 16 ], [ 13, 19 ], [ 14, 15 ], [ 17, 11 ], [ 17, 12 ], [ 18, 13 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Hayden knows Lorraine. Gabe knows Wesley. Felix knows Juan. Harris knows Robert. Brooke knows Ellen. Sydney knows Herman. Wesley knows Felix. Sydney knows Gabe. Lara knows Lydia. Ellen knows Clayton. Herman knows Lara. Harley knows Brooke. Harris knows Harley. Lydia knows Otto. Ellen knows Glenda. Felix knows Simon. Arturo knows Hayden. Robert knows Arturo. Which of Brooke and Wesley can Sydney reach?", "answer": "Wesley", "steps": [ "Sydney knows Gabe.", "Gabe knows Wesley." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Sydney", "Lara", "Juan", "Lydia", "Wesley", "Herman", "Simon", "Felix", "Gabe", "Otto", "Harris", "Arturo", "Clayton", "Hayden", "Brooke", "Robert", "Glenda", "Ellen", "Harley", "Lorraine" ], "edges": [ [ 0, 8 ], [ 0, 5 ], [ 1, 3 ], [ 3, 9 ], [ 4, 7 ], [ 5, 1 ], [ 7, 2 ], [ 7, 6 ], [ 8, 4 ], [ 10, 18 ], [ 10, 15 ], [ 11, 13 ], [ 13, 19 ], [ 14, 17 ], [ 15, 11 ], [ 17, 12 ], [ 17, 16 ], [ 18, 14 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Andrea knows Zelda. Graham knows Harris. Tony knows Etta. Layla knows Darius. Andrea knows Graham. Pam knows Tiffany. Allen knows Layla. Zara knows Gemma. Tiffany knows Cynthia. Zelda knows Cyrus. Tony knows Andrea. Allen knows Audrey. Cyrus knows Zara. Vernon knows Liam. Cyrus knows Clifford. Tiffany knows Vernon. Pam knows Alice. Cynthia knows Allen. Which of Layla and Zara can Pam reach?", "answer": "Layla", "steps": [ "Pam knows Tiffany.", "Tiffany knows Cynthia.", "Cynthia knows Allen.", "Allen knows Layla." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Pam", "Audrey", "Cynthia", "Tiffany", "Alice", "Allen", "Liam", "Darius", "Vernon", "Layla", "Tony", "Clifford", "Zelda", "Andrea", "Etta", "Cyrus", "Harris", "Gemma", "Graham", "Zara" ], "edges": [ [ 0, 4 ], [ 0, 3 ], [ 2, 5 ], [ 3, 8 ], [ 3, 2 ], [ 5, 1 ], [ 5, 9 ], [ 8, 6 ], [ 9, 7 ], [ 10, 14 ], [ 10, 13 ], [ 12, 15 ], [ 13, 18 ], [ 13, 12 ], [ 15, 11 ], [ 15, 19 ], [ 18, 16 ], [ 19, 17 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Randy knows Tim. Carmen knows Jean. Tim knows Jeanette. Carl knows Randy. Judy knows Ariel. Jeanette knows Carmen. Ariel knows Cristina. Randy knows Miriam. Lee knows Tristan. Lee knows Ronald. Judy knows Wendy. Carl knows Hampton. Carmen knows Francis. Hampton knows Rosemary. Joshua knows Judy. Joshua knows Cesar. Cesar knows Thea. Cristina knows Lee. Which of Tim and Ariel can Joshua reach?", "answer": "Ariel", "steps": [ "Joshua knows Judy.", "Judy knows Ariel." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Joshua", "Judy", "Cristina", "Tristan", "Wendy", "Ronald", "Cesar", "Ariel", "Lee", "Thea", "Carl", "Randy", "Jeanette", "Francis", "Miriam", "Jean", "Hampton", "Tim", "Carmen", "Rosemary" ], "edges": [ [ 0, 1 ], [ 0, 6 ], [ 1, 4 ], [ 1, 7 ], [ 2, 8 ], [ 6, 9 ], [ 7, 2 ], [ 8, 3 ], [ 8, 5 ], [ 10, 11 ], [ 10, 16 ], [ 11, 14 ], [ 11, 17 ], [ 12, 18 ], [ 16, 19 ], [ 17, 12 ], [ 18, 13 ], [ 18, 15 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Ernest knows Delilah. Ernest knows Abel. Eunice knows Frances. Sara knows Larry. Reid knows Oscar. Reid knows Loretta. Reid knows Edward. Parker knows Reid. Ernest knows Lawson. Lola knows Parker. Ernest knows Adrian. Graeme knows Gage. Frances knows Laura. Loretta knows William. Lawson knows Sara. Gage knows Ernest. Reid knows Eunice. Abel knows Tara. Which of Laura and Larry can Lola reach?", "answer": "Laura", "steps": [ "Lola knows Parker.", "Parker knows Reid.", "Reid knows Eunice.", "Eunice knows Frances.", "Frances knows Laura." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Lola", "Frances", "Reid", "Laura", "Loretta", "Parker", "Eunice", "Edward", "William", "Oscar", "Graeme", "Sara", "Ernest", "Larry", "Abel", "Gage", "Lawson", "Adrian", "Tara", "Delilah" ], "edges": [ [ 0, 5 ], [ 1, 3 ], [ 2, 6 ], [ 2, 7 ], [ 2, 4 ], [ 2, 9 ], [ 4, 8 ], [ 5, 2 ], [ 6, 1 ], [ 10, 15 ], [ 11, 13 ], [ 12, 16 ], [ 12, 17 ], [ 12, 14 ], [ 12, 19 ], [ 14, 18 ], [ 15, 12 ], [ 16, 11 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Clarence knows Sam. Ibrahim knows Alfred. Devon knows Fleur. Joy knows Corey. Corey knows Boris. Langston knows Ingrid. Boris knows Dexter. Trina knows Joy. James knows Ibrahim. Corey knows Devon. Joy knows Lisette. Kimberly knows Spencer. Gavin knows Trina. Dexter knows Virgil. Ibrahim knows Kimberly. Sam knows James. James knows Gus. Alfred knows Langston. Which of Langston and Dexter can Clarence reach?", "answer": "Langston", "steps": [ "Clarence knows Sam.", "Sam knows James.", "James knows Ibrahim.", "Ibrahim knows Alfred.", "Alfred knows Langston." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Clarence", "James", "Alfred", "Ingrid", "Sam", "Gus", "Kimberly", "Langston", "Ibrahim", "Spencer", "Gavin", "Joy", "Boris", "Virgil", "Trina", "Lisette", "Devon", "Dexter", "Corey", "Fleur" ], "edges": [ [ 0, 4 ], [ 1, 5 ], [ 1, 8 ], [ 2, 7 ], [ 4, 1 ], [ 6, 9 ], [ 7, 3 ], [ 8, 2 ], [ 8, 6 ], [ 10, 14 ], [ 11, 15 ], [ 11, 18 ], [ 12, 17 ], [ 14, 11 ], [ 16, 19 ], [ 17, 13 ], [ 18, 12 ], [ 18, 16 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Rosemary knows Maria. William knows Tiffany. Georgia knows Ricardo. Ricardo knows Sadie. Mitchell knows Rosemary. Zack knows William. Sadie knows Colby. Ricardo knows Leigh. Rosemary knows Zack. William knows Miles. Victoria knows Dallas. Duncan knows Victoria. Victoria knows Georgia. Victoria knows Clarissa. Olivia knows Mitchell. Paula knows Duncan. Rosemary knows Garrison. Miles knows Anna. Which of Rosemary and Victoria can Olivia reach?", "answer": "Rosemary", "steps": [ "Olivia knows Mitchell.", "Mitchell knows Rosemary." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Olivia", "Mitchell", "Anna", "Zack", "William", "Rosemary", "Tiffany", "Miles", "Maria", "Garrison", "Paula", "Duncan", "Colby", "Georgia", "Ricardo", "Victoria", "Leigh", "Sadie", "Clarissa", "Dallas" ], "edges": [ [ 0, 1 ], [ 1, 5 ], [ 3, 4 ], [ 4, 6 ], [ 4, 7 ], [ 5, 3 ], [ 5, 8 ], [ 5, 9 ], [ 7, 2 ], [ 10, 11 ], [ 11, 15 ], [ 13, 14 ], [ 14, 16 ], [ 14, 17 ], [ 15, 13 ], [ 15, 18 ], [ 15, 19 ], [ 17, 12 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Teresa knows Justine. Gavin knows Patrick. Eunice knows Demetrius. Aisha knows Becky. Justine knows Joaquin. Dylan knows Darla. Gavin knows Teresa. Demetrius knows Tristan. Aisha knows Dylan. Joaquin knows Franklin. Eunice knows Aisha. Teresa knows Belinda. Belinda knows Clayton. Patrick knows Colette. Becky knows Aspen. Teresa knows Percy. Darla knows Otto. Aisha knows Alana. Which of Joaquin and Darla can Eunice reach?", "answer": "Darla", "steps": [ "Eunice knows Aisha.", "Aisha knows Dylan.", "Dylan knows Darla." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Eunice", "Dylan", "Darla", "Otto", "Aisha", "Tristan", "Aspen", "Becky", "Alana", "Demetrius", "Gavin", "Justine", "Joaquin", "Franklin", "Teresa", "Colette", "Clayton", "Belinda", "Percy", "Patrick" ], "edges": [ [ 0, 4 ], [ 0, 9 ], [ 1, 2 ], [ 2, 3 ], [ 4, 1 ], [ 4, 7 ], [ 4, 8 ], [ 7, 6 ], [ 9, 5 ], [ 10, 14 ], [ 10, 19 ], [ 11, 12 ], [ 12, 13 ], [ 14, 11 ], [ 14, 17 ], [ 14, 18 ], [ 17, 16 ], [ 19, 15 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Rosemary knows Maria. William knows Tiffany. Georgia knows Ricardo. Ricardo knows Sadie. Mitchell knows Rosemary. Zack knows William. Sadie knows Colby. Ricardo knows Leigh. Rosemary knows Zack. William knows Miles. Victoria knows Dallas. Duncan knows Victoria. Victoria knows Georgia. Victoria knows Clarissa. Olivia knows Mitchell. Paula knows Duncan. Rosemary knows Garrison. Miles knows Anna. Which of Anna and Colby can Olivia reach?", "answer": "Anna", "steps": [ "Olivia knows Mitchell.", "Mitchell knows Rosemary.", "Rosemary knows Zack.", "Zack knows William.", "William knows Miles.", "Miles knows Anna." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Olivia", "Mitchell", "Anna", "Zack", "William", "Rosemary", "Tiffany", "Miles", "Maria", "Garrison", "Paula", "Duncan", "Colby", "Georgia", "Ricardo", "Victoria", "Leigh", "Sadie", "Clarissa", "Dallas" ], "edges": [ [ 0, 1 ], [ 1, 5 ], [ 3, 4 ], [ 4, 6 ], [ 4, 7 ], [ 5, 3 ], [ 5, 8 ], [ 5, 9 ], [ 7, 2 ], [ 10, 11 ], [ 11, 15 ], [ 13, 14 ], [ 14, 16 ], [ 14, 17 ], [ 15, 13 ], [ 15, 18 ], [ 15, 19 ], [ 17, 12 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Raymond knows Marlene. Dylan knows Howard. Sydney knows Demetrius. Lisa knows Dylan. Fisher knows Nadine. Bruce knows Lisa. Cooper knows Jerry. Craig knows Monroe. Marlene knows Fisher. Craig knows Maggie. Lisa knows Sydney. Jerry knows Stephanie. Monroe knows Kent. Maggie knows Khashayar. Malik knows Craig. Stephanie knows Elaine. Howard knows Cooper. Khashayar knows Raymond. Which of Jerry and Marlene can Bruce reach?", "answer": "Jerry", "steps": [ "Bruce knows Lisa.", "Lisa knows Dylan.", "Dylan knows Howard.", "Howard knows Cooper.", "Cooper knows Jerry." ], "difficulty": 5, "original_distance": 7, "idx_to_symbol": [ "Bruce", "Jerry", "Lisa", "Sydney", "Elaine", "Howard", "Stephanie", "Demetrius", "Cooper", "Dylan", "Malik", "Marlene", "Craig", "Monroe", "Nadine", "Khashayar", "Fisher", "Kent", "Raymond", "Maggie" ], "edges": [ [ 0, 2 ], [ 1, 6 ], [ 2, 3 ], [ 2, 9 ], [ 3, 7 ], [ 5, 8 ], [ 6, 4 ], [ 8, 1 ], [ 9, 5 ], [ 10, 12 ], [ 11, 16 ], [ 12, 13 ], [ 12, 19 ], [ 13, 17 ], [ 15, 18 ], [ 16, 14 ], [ 18, 11 ], [ 19, 15 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Lottie knows Aisha. Harlan knows Jermaine. Conrad knows Francesca. Jim knows Alyson. Lisette knows Don. Lisette knows Lewis. Gail knows Benjamin. Lottie knows Janice. Rebecca knows Gail. Harlan knows Conrad. Jim knows Lottie. Alyson knows Bailey. Jermaine knows Donovan. Rebecca knows Elizabeth. Conrad knows Rebecca. Janice knows Lisette. Gail knows Jeremiah. Janice knows Carmen. Which of Lottie and Conrad can Harlan reach?", "answer": "Conrad", "steps": [ "Harlan knows Conrad." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Harlan", "Conrad", "Jermaine", "Francesca", "Elizabeth", "Jeremiah", "Rebecca", "Donovan", "Benjamin", "Gail", "Jim", "Lottie", "Alyson", "Aisha", "Carmen", "Don", "Janice", "Bailey", "Lewis", "Lisette" ], "edges": [ [ 0, 2 ], [ 0, 1 ], [ 1, 3 ], [ 1, 6 ], [ 2, 7 ], [ 6, 4 ], [ 6, 9 ], [ 9, 5 ], [ 9, 8 ], [ 10, 12 ], [ 10, 11 ], [ 11, 13 ], [ 11, 16 ], [ 12, 17 ], [ 16, 14 ], [ 16, 19 ], [ 19, 15 ], [ 19, 18 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Carrie knows Colin. Lucy knows Federico. Carrie knows Willard. Erik knows Claude. Garrett knows Carla. Sydney knows Horace. Sydney knows Carrie. Leon knows Matt. Lucy knows Jill. Lorenzo knows Sydney. Leon knows Rose. Garrett knows Ava. Julia knows Leon. Leon knows Lucy. Erik knows Gemma. Leon knows Erik. Sydney knows Garrett. Sydney knows Raymond. Which of Erik and Carrie can Julia reach?", "answer": "Erik", "steps": [ "Julia knows Leon.", "Leon knows Erik." ], "difficulty": 2, "original_distance": 3, "idx_to_symbol": [ "Julia", "Leon", "Claude", "Erik", "Federico", "Rose", "Matt", "Lucy", "Jill", "Gemma", "Lorenzo", "Sydney", "Colin", "Carrie", "Ava", "Horace", "Raymond", "Garrett", "Carla", "Willard" ], "edges": [ [ 0, 1 ], [ 1, 5 ], [ 1, 6 ], [ 1, 7 ], [ 1, 3 ], [ 3, 2 ], [ 3, 9 ], [ 7, 4 ], [ 7, 8 ], [ 10, 11 ], [ 11, 15 ], [ 11, 16 ], [ 11, 17 ], [ 11, 13 ], [ 13, 12 ], [ 13, 19 ], [ 17, 14 ], [ 17, 18 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Beau knows Kane. Greta knows Cornelius. Garrison knows Aiden. Greta knows Isadora. Constance knows Xander. Kane knows Constance. Garrison knows Knox. Irma knows Antonio. Knox knows Marco. Jim knows Cyrus. Cornelius knows Irma. Jim knows Cristina. Marco knows Beau. Antonio knows Jim. Kane knows Archie. Greta knows Lamont. Cristina knows Parker. Garrison knows Karina. Which of Cristina and Constance can Garrison reach?", "answer": "Constance", "steps": [ "Garrison knows Knox.", "Knox knows Marco.", "Marco knows Beau.", "Beau knows Kane.", "Kane knows Constance." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Garrison", "Constance", "Karina", "Knox", "Kane", "Xander", "Aiden", "Marco", "Beau", "Archie", "Greta", "Cristina", "Isadora", "Cornelius", "Jim", "Parker", "Lamont", "Irma", "Antonio", "Cyrus" ], "edges": [ [ 0, 2 ], [ 0, 6 ], [ 0, 3 ], [ 1, 5 ], [ 3, 7 ], [ 4, 1 ], [ 4, 9 ], [ 7, 8 ], [ 8, 4 ], [ 10, 12 ], [ 10, 16 ], [ 10, 13 ], [ 11, 15 ], [ 13, 17 ], [ 14, 11 ], [ 14, 19 ], [ 17, 18 ], [ 18, 14 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Dawn knows Adam. Gene knows Connor. Adam knows Finn. Finn knows Megan. Fanny knows Dawn. Avery knows Dell. Wilson knows Avery. Marilyn knows Gideon. Megan knows Gene. Gideon knows Lorraine. Etta knows Wilson. Curtis knows James. Lars knows Etta. Connor knows Bonnie. Gene knows Lawson. Francesca knows Fanny. Avery knows Curtis. Lorraine knows Lars. Which of Gideon and Fanny can Marilyn reach?", "answer": "Gideon", "steps": [ "Marilyn knows Gideon." ], "difficulty": 1, "original_distance": 8, "idx_to_symbol": [ "Marilyn", "Lorraine", "Etta", "Curtis", "Wilson", "Gideon", "Dell", "James", "Avery", "Lars", "Francesca", "Dawn", "Finn", "Connor", "Megan", "Fanny", "Lawson", "Bonnie", "Gene", "Adam" ], "edges": [ [ 0, 5 ], [ 1, 9 ], [ 2, 4 ], [ 3, 7 ], [ 4, 8 ], [ 5, 1 ], [ 8, 6 ], [ 8, 3 ], [ 9, 2 ], [ 10, 15 ], [ 11, 19 ], [ 12, 14 ], [ 13, 17 ], [ 14, 18 ], [ 15, 11 ], [ 18, 16 ], [ 18, 13 ], [ 19, 12 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Jim knows Ronald. Elsa knows Jeff. Carmela knows Thomas. Anastasia knows Tara. Jeff knows Olivia. Scott knows Cyrus. Anastasia knows Amanda. Lawson knows Fabian. Jeff knows Scott. Michael knows Luke. Jeff knows Carmela. Amanda knows Enid. Carmela knows Louise. Isla knows Jim. Amanda knows Chase. Ronald knows Anastasia. Anastasia knows Michael. Fabian knows Elsa. Which of Fabian and Jim can Lawson reach?", "answer": "Fabian", "steps": [ "Lawson knows Fabian." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Lawson", "Elsa", "Thomas", "Fabian", "Jeff", "Cyrus", "Louise", "Carmela", "Scott", "Olivia", "Isla", "Ronald", "Chase", "Jim", "Anastasia", "Luke", "Enid", "Amanda", "Michael", "Tara" ], "edges": [ [ 0, 3 ], [ 1, 4 ], [ 3, 1 ], [ 4, 7 ], [ 4, 8 ], [ 4, 9 ], [ 7, 2 ], [ 7, 6 ], [ 8, 5 ], [ 10, 13 ], [ 11, 14 ], [ 13, 11 ], [ 14, 17 ], [ 14, 18 ], [ 14, 19 ], [ 17, 12 ], [ 17, 16 ], [ 18, 15 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Tim knows Susanne. Emery knows Dawn. Susanne knows Franklin. Susanne knows Odette. Electra knows Philip. Arlene knows Carmen. Jasper knows Emery. Barbara knows Emanuel. Gladys knows Nelson. Electra knows Bart. Arlene knows Jasper. Odette knows Barbara. Carmen knows Electra. Franklin knows Steve. Steve knows Mia. Ivy knows Tim. Nelson knows Arlene. Barbara knows Jakob. Which of Nelson and Tim can Gladys reach?", "answer": "Nelson", "steps": [ "Gladys knows Nelson." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Gladys", "Philip", "Carmen", "Electra", "Dawn", "Arlene", "Emery", "Bart", "Nelson", "Jasper", "Ivy", "Jakob", "Odette", "Barbara", "Mia", "Susanne", "Steve", "Emanuel", "Tim", "Franklin" ], "edges": [ [ 0, 8 ], [ 2, 3 ], [ 3, 1 ], [ 3, 7 ], [ 5, 2 ], [ 5, 9 ], [ 6, 4 ], [ 8, 5 ], [ 9, 6 ], [ 10, 18 ], [ 12, 13 ], [ 13, 11 ], [ 13, 17 ], [ 15, 12 ], [ 15, 19 ], [ 16, 14 ], [ 18, 15 ], [ 19, 16 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Marshall knows Heather. Ida knows Deanna. Edgar knows Edward. Scott knows Darius. Darius knows Ida. Cole knows Felicia. Samantha knows Cole. Robin knows Scott. Julian knows Blanche. Darius knows Samantha. Felicia knows Morris. Heather knows Luther. Marshall knows Edgar. Aurora knows Marshall. Blanche knows Aurora. Luther knows Fleur. Fleur knows Hilda. Joy knows Robin. Which of Samantha and Heather can Julian reach?", "answer": "Heather", "steps": [ "Julian knows Blanche.", "Blanche knows Aurora.", "Aurora knows Marshall.", "Marshall knows Heather." ], "difficulty": 4, "original_distance": 7, "idx_to_symbol": [ "Julian", "Fleur", "Edward", "Marshall", "Luther", "Hilda", "Blanche", "Aurora", "Edgar", "Heather", "Joy", "Felicia", "Deanna", "Darius", "Cole", "Morris", "Robin", "Scott", "Ida", "Samantha" ], "edges": [ [ 0, 6 ], [ 1, 5 ], [ 3, 8 ], [ 3, 9 ], [ 4, 1 ], [ 6, 7 ], [ 7, 3 ], [ 8, 2 ], [ 9, 4 ], [ 10, 16 ], [ 11, 15 ], [ 13, 18 ], [ 13, 19 ], [ 14, 11 ], [ 16, 17 ], [ 17, 13 ], [ 18, 12 ], [ 19, 14 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Amber knows Hayes. Rosemary knows Amber. Pablo knows Rosemary. Henry knows Rhea. Elodie knows Austin. Henry knows Elodie. Helene knows Claude. Ian knows Joseph. Frances knows Monica. Pablo knows Carl. Henry knows Helene. Carl knows Daphne. Daphne knows Ian. Austin knows Frances. Pablo knows Ellen. Pablo knows Alice. Claude knows Aaron. Henry knows Derek. Which of Carl and Elodie can Pablo reach?", "answer": "Carl", "steps": [ "Pablo knows Carl." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Pablo", "Alice", "Joseph", "Ian", "Daphne", "Rosemary", "Ellen", "Carl", "Amber", "Hayes", "Henry", "Rhea", "Monica", "Frances", "Austin", "Helene", "Derek", "Elodie", "Claude", "Aaron" ], "edges": [ [ 0, 1 ], [ 0, 6 ], [ 0, 7 ], [ 0, 5 ], [ 3, 2 ], [ 4, 3 ], [ 5, 8 ], [ 7, 4 ], [ 8, 9 ], [ 10, 11 ], [ 10, 16 ], [ 10, 17 ], [ 10, 15 ], [ 13, 12 ], [ 14, 13 ], [ 15, 18 ], [ 17, 14 ], [ 18, 19 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Hayden knows Louisa. Louisa knows Kelsey. Milton knows Bart. Peter knows Seth. Layla knows Keaton. Lottie knows Kerry. Amber knows Milton. Jesse knows Sally. Layla knows Joshua. Esperanza knows Darla. Lottie knows Robin. Sally knows Estella. Luella knows Jesse. Darla knows Layla. Seth knows Esperanza. Bart knows Lottie. Estella knows Amber. Kelsey knows Peter. Which of Kerry and Keaton can Hayden reach?", "answer": "Keaton", "steps": [ "Hayden knows Louisa.", "Louisa knows Kelsey.", "Kelsey knows Peter.", "Peter knows Seth.", "Seth knows Esperanza.", "Esperanza knows Darla.", "Darla knows Layla.", "Layla knows Keaton." ], "difficulty": 8, "original_distance": 8, "idx_to_symbol": [ "Hayden", "Esperanza", "Louisa", "Peter", "Kelsey", "Joshua", "Keaton", "Darla", "Layla", "Seth", "Luella", "Milton", "Jesse", "Estella", "Sally", "Robin", "Kerry", "Bart", "Lottie", "Amber" ], "edges": [ [ 0, 2 ], [ 1, 7 ], [ 2, 4 ], [ 3, 9 ], [ 4, 3 ], [ 7, 8 ], [ 8, 5 ], [ 8, 6 ], [ 9, 1 ], [ 10, 12 ], [ 11, 17 ], [ 12, 14 ], [ 13, 19 ], [ 14, 13 ], [ 17, 18 ], [ 18, 15 ], [ 18, 16 ], [ 19, 11 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Arturo knows Herbert. Randy knows Ray. Mark knows Arturo. Herbert knows Oliver. Madeline knows Kim. Vivian knows Harry. Herbert knows Arnold. Randy knows Deanna. Eden knows Anna. Deanna knows Madeline. Arturo knows Isaac. Anna knows Isabel. Vivian knows Zane. Zane knows Courtney. Madeline knows Vivian. Eden knows Mark. Oliver knows Clement. Ray knows Paula. Which of Courtney and Clement can Randy reach?", "answer": "Courtney", "steps": [ "Randy knows Deanna.", "Deanna knows Madeline.", "Madeline knows Vivian.", "Vivian knows Zane.", "Zane knows Courtney." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Randy", "Harry", "Ray", "Paula", "Deanna", "Courtney", "Zane", "Madeline", "Vivian", "Kim", "Eden", "Arnold", "Anna", "Isabel", "Mark", "Clement", "Oliver", "Arturo", "Herbert", "Isaac" ], "edges": [ [ 0, 2 ], [ 0, 4 ], [ 2, 3 ], [ 4, 7 ], [ 6, 5 ], [ 7, 8 ], [ 7, 9 ], [ 8, 1 ], [ 8, 6 ], [ 10, 12 ], [ 10, 14 ], [ 12, 13 ], [ 14, 17 ], [ 16, 15 ], [ 17, 18 ], [ 17, 19 ], [ 18, 11 ], [ 18, 16 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Mildred knows Annie. Allen knows Daphna. Mildred knows Aspen. Chris knows Jack. Daphna knows Blaine. Sidney knows Faye. Cara knows Allen. Annie knows Cara. Rhonda knows Ella. Alvin knows Mildred. Chantal knows Alejandro. Alejandro knows Sidney. Rhonda knows Rosemary. Della knows Esperanza. Jack knows Rhonda. Bella knows Chris. Esperanza knows Alvin. Ella knows Chantal. Which of Mildred and Rhonda can Della reach?", "answer": "Mildred", "steps": [ "Della knows Esperanza.", "Esperanza knows Alvin.", "Alvin knows Mildred." ], "difficulty": 3, "original_distance": 8, "idx_to_symbol": [ "Della", "Blaine", "Daphna", "Mildred", "Aspen", "Esperanza", "Annie", "Cara", "Allen", "Alvin", "Bella", "Faye", "Sidney", "Rhonda", "Rosemary", "Chris", "Ella", "Chantal", "Alejandro", "Jack" ], "edges": [ [ 0, 5 ], [ 2, 1 ], [ 3, 4 ], [ 3, 6 ], [ 5, 9 ], [ 6, 7 ], [ 7, 8 ], [ 8, 2 ], [ 9, 3 ], [ 10, 15 ], [ 12, 11 ], [ 13, 14 ], [ 13, 16 ], [ 15, 19 ], [ 16, 17 ], [ 17, 18 ], [ 18, 12 ], [ 19, 13 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Curtis knows Kenneth. Benjamin knows Larry. Jared knows Chance. Richard knows Marcia. Juan knows Benjamin. Hayley knows Kent. Jacob knows Curtis. Chance knows Abigail. Kenneth knows Shawn. Juan knows Horace. Shawn knows Richard. Kenneth knows Zoe. Catherine knows Joan. Juan knows Hayley. Curtis knows Marian. Curtis knows Catherine. Hayley knows Jared. Julie knows Juan. Which of Kenneth and Hayley can Jacob reach?", "answer": "Kenneth", "steps": [ "Jacob knows Curtis.", "Curtis knows Kenneth." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Jacob", "Marian", "Shawn", "Richard", "Curtis", "Marcia", "Kenneth", "Catherine", "Zoe", "Joan", "Julie", "Horace", "Jared", "Chance", "Juan", "Abigail", "Hayley", "Benjamin", "Kent", "Larry" ], "edges": [ [ 0, 4 ], [ 2, 3 ], [ 3, 5 ], [ 4, 1 ], [ 4, 6 ], [ 4, 7 ], [ 6, 2 ], [ 6, 8 ], [ 7, 9 ], [ 10, 14 ], [ 12, 13 ], [ 13, 15 ], [ 14, 11 ], [ 14, 16 ], [ 14, 17 ], [ 16, 12 ], [ 16, 18 ], [ 17, 19 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Maude knows Amelia. Will knows Louisa. Abby knows Gerald. Valerie knows Charles. Cain knows Florence. Ezra knows Elsa. Lars knows Will. Ingrid knows Jolena. Pat knows Cain. Maude knows Abby. Louisa knows Julius. Abby knows Ingrid. Abby knows Lawson. Celeste knows Luz. Lawson knows Pat. Celeste knows Ezra. Celeste knows Lars. Valerie knows Celeste. Which of Lawson and Lars can Valerie reach?", "answer": "Lars", "steps": [ "Valerie knows Celeste.", "Celeste knows Lars." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Valerie", "Lars", "Julius", "Luz", "Elsa", "Charles", "Will", "Louisa", "Ezra", "Celeste", "Maude", "Lawson", "Florence", "Gerald", "Jolena", "Amelia", "Pat", "Cain", "Ingrid", "Abby" ], "edges": [ [ 0, 5 ], [ 0, 9 ], [ 1, 6 ], [ 6, 7 ], [ 7, 2 ], [ 8, 4 ], [ 9, 3 ], [ 9, 1 ], [ 9, 8 ], [ 10, 15 ], [ 10, 19 ], [ 11, 16 ], [ 16, 17 ], [ 17, 12 ], [ 18, 14 ], [ 19, 13 ], [ 19, 11 ], [ 19, 18 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Boris knows Corinne. Irving knows Gus. Roland knows Riley. Lionel knows Craig. Corinne knows Winifred. Clarence knows Juan. Peter knows Devon. Roland knows Gwen. Devon knows Owen. Willard knows Ariel. Clarence knows Courtney. Roland knows Boris. Irving knows Lionel. Craig knows Jodi. Courtney knows Constance. Craig knows Willard. Irving knows Peter. Riley knows Clarence. Which of Constance and Ariel can Roland reach?", "answer": "Constance", "steps": [ "Roland knows Riley.", "Riley knows Clarence.", "Clarence knows Courtney.", "Courtney knows Constance." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Roland", "Constance", "Boris", "Riley", "Winifred", "Corinne", "Juan", "Clarence", "Courtney", "Gwen", "Irving", "Ariel", "Peter", "Lionel", "Owen", "Devon", "Jodi", "Craig", "Willard", "Gus" ], "edges": [ [ 0, 2 ], [ 0, 3 ], [ 0, 9 ], [ 2, 5 ], [ 3, 7 ], [ 5, 4 ], [ 7, 6 ], [ 7, 8 ], [ 8, 1 ], [ 10, 12 ], [ 10, 13 ], [ 10, 19 ], [ 12, 15 ], [ 13, 17 ], [ 15, 14 ], [ 17, 16 ], [ 17, 18 ], [ 18, 11 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Dawn knows Adam. Gene knows Connor. Adam knows Finn. Finn knows Megan. Fanny knows Dawn. Avery knows Dell. Wilson knows Avery. Marilyn knows Gideon. Megan knows Gene. Gideon knows Lorraine. Etta knows Wilson. Curtis knows James. Lars knows Etta. Connor knows Bonnie. Gene knows Lawson. Francesca knows Fanny. Avery knows Curtis. Lorraine knows Lars. Which of James and Bonnie can Marilyn reach?", "answer": "James", "steps": [ "Marilyn knows Gideon.", "Gideon knows Lorraine.", "Lorraine knows Lars.", "Lars knows Etta.", "Etta knows Wilson.", "Wilson knows Avery.", "Avery knows Curtis.", "Curtis knows James." ], "difficulty": 8, "original_distance": 8, "idx_to_symbol": [ "Marilyn", "Lorraine", "Etta", "Curtis", "Wilson", "Gideon", "Dell", "James", "Avery", "Lars", "Francesca", "Dawn", "Finn", "Connor", "Megan", "Fanny", "Lawson", "Bonnie", "Gene", "Adam" ], "edges": [ [ 0, 5 ], [ 1, 9 ], [ 2, 4 ], [ 3, 7 ], [ 4, 8 ], [ 5, 1 ], [ 8, 6 ], [ 8, 3 ], [ 9, 2 ], [ 10, 15 ], [ 11, 19 ], [ 12, 14 ], [ 13, 17 ], [ 14, 18 ], [ 15, 11 ], [ 18, 16 ], [ 18, 13 ], [ 19, 12 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Kennedy knows Curtis. Jason knows Stefan. Dave knows Kennedy. Zara knows Quinn. Malcolm knows Malik. Ann knows Malcolm. Iris knows Brett. Malik knows Zara. Malik knows Olivia. Stefan knows Anna. Roger knows Jason. Brett knows Roger. Preston knows Crystal. Erik knows Iris. Sybil knows Preston. Brett knows Sybil. Quinn knows Alfonso. Olivia knows Dave. Which of Iris and Malcolm can Ann reach?", "answer": "Malcolm", "steps": [ "Ann knows Malcolm." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Ann", "Malik", "Olivia", "Curtis", "Zara", "Alfonso", "Malcolm", "Quinn", "Dave", "Kennedy", "Erik", "Brett", "Roger", "Anna", "Sybil", "Crystal", "Iris", "Preston", "Jason", "Stefan" ], "edges": [ [ 0, 6 ], [ 1, 4 ], [ 1, 2 ], [ 2, 8 ], [ 4, 7 ], [ 6, 1 ], [ 7, 5 ], [ 8, 9 ], [ 9, 3 ], [ 10, 16 ], [ 11, 14 ], [ 11, 12 ], [ 12, 18 ], [ 14, 17 ], [ 16, 11 ], [ 17, 15 ], [ 18, 19 ], [ 19, 13 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Judith knows Lillian. Kendra knows Dora. Dudley knows Judith. Darcy knows Hector. Lance knows Kendra. Declan knows Jem. Ford knows Giselle. Chelsea knows Ford. Mike knows Kim. Kendra knows Chelsea. Kim knows Lance. Russell knows Mike. Declan knows Dudley. Jon knows Darcy. Kim knows Patricia. Judith knows Jon. Paula knows Elias. Elias knows Declan. Which of Declan and Kim can Russell reach?", "answer": "Kim", "steps": [ "Russell knows Mike.", "Mike knows Kim." ], "difficulty": 2, "original_distance": 7, "idx_to_symbol": [ "Russell", "Lance", "Kendra", "Ford", "Patricia", "Dora", "Mike", "Kim", "Giselle", "Chelsea", "Paula", "Dudley", "Judith", "Darcy", "Jem", "Lillian", "Elias", "Declan", "Hector", "Jon" ], "edges": [ [ 0, 6 ], [ 1, 2 ], [ 2, 5 ], [ 2, 9 ], [ 3, 8 ], [ 6, 7 ], [ 7, 4 ], [ 7, 1 ], [ 9, 3 ], [ 10, 16 ], [ 11, 12 ], [ 12, 15 ], [ 12, 19 ], [ 13, 18 ], [ 16, 17 ], [ 17, 14 ], [ 17, 11 ], [ 19, 13 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Cruz knows Harris. Harris knows Jenny. Mason knows Cruz. Morgan knows Kit. Mason knows Kenneth. Jacob knows Joaquin. Harris knows Dorian. Clement knows Beau. Constance knows Esme. Darius knows Max. Joaquin knows Greer. Esme knows Jose. Darius knows Jacob. Dorian knows Morgan. Gage knows Craig. Jose knows Clement. Joaquin knows Constance. Kit knows Gage. Which of Clement and Gage can Darius reach?", "answer": "Clement", "steps": [ "Darius knows Jacob.", "Jacob knows Joaquin.", "Joaquin knows Constance.", "Constance knows Esme.", "Esme knows Jose.", "Jose knows Clement." ], "difficulty": 6, "original_distance": 7, "idx_to_symbol": [ "Darius", "Greer", "Jose", "Jacob", "Max", "Constance", "Clement", "Esme", "Beau", "Joaquin", "Mason", "Jenny", "Kit", "Cruz", "Kenneth", "Dorian", "Gage", "Morgan", "Craig", "Harris" ], "edges": [ [ 0, 4 ], [ 0, 3 ], [ 2, 6 ], [ 3, 9 ], [ 5, 7 ], [ 6, 8 ], [ 7, 2 ], [ 9, 1 ], [ 9, 5 ], [ 10, 14 ], [ 10, 13 ], [ 12, 16 ], [ 13, 19 ], [ 15, 17 ], [ 16, 18 ], [ 17, 12 ], [ 19, 11 ], [ 19, 15 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Clarence knows Sam. Ibrahim knows Alfred. Devon knows Fleur. Joy knows Corey. Corey knows Boris. Langston knows Ingrid. Boris knows Dexter. Trina knows Joy. James knows Ibrahim. Corey knows Devon. Joy knows Lisette. Kimberly knows Spencer. Gavin knows Trina. Dexter knows Virgil. Ibrahim knows Kimberly. Sam knows James. James knows Gus. Alfred knows Langston. Which of Alfred and Boris can Clarence reach?", "answer": "Alfred", "steps": [ "Clarence knows Sam.", "Sam knows James.", "James knows Ibrahim.", "Ibrahim knows Alfred." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Clarence", "James", "Alfred", "Ingrid", "Sam", "Gus", "Kimberly", "Langston", "Ibrahim", "Spencer", "Gavin", "Joy", "Boris", "Virgil", "Trina", "Lisette", "Devon", "Dexter", "Corey", "Fleur" ], "edges": [ [ 0, 4 ], [ 1, 5 ], [ 1, 8 ], [ 2, 7 ], [ 4, 1 ], [ 6, 9 ], [ 7, 3 ], [ 8, 2 ], [ 8, 6 ], [ 10, 14 ], [ 11, 15 ], [ 11, 18 ], [ 12, 17 ], [ 14, 11 ], [ 16, 19 ], [ 17, 13 ], [ 18, 12 ], [ 18, 16 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Elena knows Jessica. Rosa knows Jeanne. Lawrence knows Celia. Maude knows Elena. Angela knows Maude. Faye knows Florence. Ebony knows Faye. Celia knows Brooke. Angela knows Rosa. Travis knows Robin. Brooke knows Aaron. Florence knows Chad. Jenny knows August. Jeanne knows Travis. Kevin knows Angela. Leroy knows Kevin. August knows Lawrence. Lawrence knows Ebony. Which of Lawrence and Angela can Jenny reach?", "answer": "Lawrence", "steps": [ "Jenny knows August.", "August knows Lawrence." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Jenny", "Florence", "Lawrence", "Brooke", "Faye", "Ebony", "Chad", "Celia", "Aaron", "August", "Leroy", "Travis", "Angela", "Elena", "Jeanne", "Rosa", "Robin", "Maude", "Jessica", "Kevin" ], "edges": [ [ 0, 9 ], [ 1, 6 ], [ 2, 5 ], [ 2, 7 ], [ 3, 8 ], [ 4, 1 ], [ 5, 4 ], [ 7, 3 ], [ 9, 2 ], [ 10, 19 ], [ 11, 16 ], [ 12, 15 ], [ 12, 17 ], [ 13, 18 ], [ 14, 11 ], [ 15, 14 ], [ 17, 13 ], [ 19, 12 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Luna knows Beatrice. Sadie knows Axel. Javier knows Julius. Ivy knows Loretta. Julia knows Louise. Olive knows Morris. Cornelius knows Curtis. Cornelius knows Ivy. Donald knows Cornelius. Nora knows Donald. Rita knows Javier. Nora knows Sadie. Beatrice knows Olive. Curtis knows Willis. Julius knows Max. Beatrice knows Rita. Cindy knows Nora. Javier knows Julia. Which of Nora and Beatrice can Cindy reach?", "answer": "Nora", "steps": [ "Cindy knows Nora." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Cindy", "Nora", "Donald", "Ivy", "Loretta", "Willis", "Cornelius", "Sadie", "Axel", "Curtis", "Luna", "Beatrice", "Rita", "Julia", "Louise", "Max", "Javier", "Olive", "Morris", "Julius" ], "edges": [ [ 0, 1 ], [ 1, 7 ], [ 1, 2 ], [ 2, 6 ], [ 3, 4 ], [ 6, 3 ], [ 6, 9 ], [ 7, 8 ], [ 9, 5 ], [ 10, 11 ], [ 11, 17 ], [ 11, 12 ], [ 12, 16 ], [ 13, 14 ], [ 16, 13 ], [ 16, 19 ], [ 17, 18 ], [ 19, 15 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Susan knows Cooper. Bennett knows Jeremiah. Cliff knows Jessie. Jessie knows Bernice. Jessie knows Howard. Fritz knows Susan. Jeremiah knows Lane. Barbara knows Pedro. Lane knows Skyler. Barbara knows Bennett. Barbara knows Jolene. Jessie knows Fritz. Pedro knows Fabian. Bernice knows Hudson. Cooper knows Herbert. Hudson knows Keegan. Fabian knows Jarvis. Aurora knows Barbara. Which of Herbert and Skyler can Aurora reach?", "answer": "Skyler", "steps": [ "Aurora knows Barbara.", "Barbara knows Bennett.", "Bennett knows Jeremiah.", "Jeremiah knows Lane.", "Lane knows Skyler." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Aurora", "Fabian", "Barbara", "Pedro", "Skyler", "Lane", "Bennett", "Jeremiah", "Jolene", "Jarvis", "Cliff", "Hudson", "Jessie", "Bernice", "Herbert", "Cooper", "Fritz", "Susan", "Howard", "Keegan" ], "edges": [ [ 0, 2 ], [ 1, 9 ], [ 2, 6 ], [ 2, 8 ], [ 2, 3 ], [ 3, 1 ], [ 5, 4 ], [ 6, 7 ], [ 7, 5 ], [ 10, 12 ], [ 11, 19 ], [ 12, 16 ], [ 12, 18 ], [ 12, 13 ], [ 13, 11 ], [ 15, 14 ], [ 16, 17 ], [ 17, 15 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Samuel knows Rachel. Judith knows David. Zachary knows Harlan. David knows Lark. Zachary knows Desmond. Jerry knows Kylie. Jerry knows Isaac. Kylie knows Austin. David knows Samuel. Lark knows Ramona. Susan knows Cindy. Harlan knows Jerry. Judith knows Winston. Eli knows Candice. Jerry knows Susan. Harlan knows Melody. David knows Lucy. Eli knows Judith. Which of Harlan and Judith can Zachary reach?", "answer": "Harlan", "steps": [ "Zachary knows Harlan." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Zachary", "Desmond", "Kylie", "Austin", "Melody", "Isaac", "Jerry", "Harlan", "Susan", "Cindy", "Eli", "Candice", "Samuel", "Rachel", "Winston", "Lucy", "David", "Judith", "Lark", "Ramona" ], "edges": [ [ 0, 1 ], [ 0, 7 ], [ 2, 3 ], [ 6, 2 ], [ 6, 5 ], [ 6, 8 ], [ 7, 4 ], [ 7, 6 ], [ 8, 9 ], [ 10, 11 ], [ 10, 17 ], [ 12, 13 ], [ 16, 12 ], [ 16, 15 ], [ 16, 18 ], [ 17, 14 ], [ 17, 16 ], [ 18, 19 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Samuel knows Walt. Dolly knows Sidney. Wilma knows Drake. Samuel knows Quinn. Drake knows Earl. Milton knows Dolly. Earl knows Milton. Samuel knows Albert. Eleanor knows Joyce. Samuel knows Eleanor. George knows Della. Earl knows Elias. Earl knows George. Arden knows Samuel. Joyce knows Jem. Earl knows Eli. Quinn knows Jaime. Stacy knows Arden. Which of Samuel and Earl can Wilma reach?", "answer": "Earl", "steps": [ "Wilma knows Drake.", "Drake knows Earl." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Wilma", "Della", "Dolly", "George", "Milton", "Earl", "Elias", "Drake", "Eli", "Sidney", "Stacy", "Jaime", "Joyce", "Quinn", "Eleanor", "Samuel", "Albert", "Arden", "Walt", "Jem" ], "edges": [ [ 0, 7 ], [ 2, 9 ], [ 3, 1 ], [ 4, 2 ], [ 5, 3 ], [ 5, 6 ], [ 5, 8 ], [ 5, 4 ], [ 7, 5 ], [ 10, 17 ], [ 12, 19 ], [ 13, 11 ], [ 14, 12 ], [ 15, 13 ], [ 15, 16 ], [ 15, 18 ], [ 15, 14 ], [ 17, 15 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Tara knows Amy. Lee knows Marie. Jillian knows Margaret. Connor knows India. India knows Jillian. Lee knows Keaton. Houston knows Hilda. Hilda knows Zelda. Lois knows Gareth. Milo knows Houston. Keaton knows Esther. Hilda knows Lucia. Jillian knows Lee. Esther knows Lois. Zelda knows Tara. Amy knows Angelica. Zelda knows Mary. Angelica knows Javier. Which of Gareth and Javier can Connor reach?", "answer": "Gareth", "steps": [ "Connor knows India.", "India knows Jillian.", "Jillian knows Lee.", "Lee knows Keaton.", "Keaton knows Esther.", "Esther knows Lois.", "Lois knows Gareth." ], "difficulty": 7, "original_distance": 7, "idx_to_symbol": [ "Connor", "Lee", "Margaret", "Keaton", "Gareth", "Esther", "Jillian", "Marie", "India", "Lois", "Milo", "Zelda", "Lucia", "Tara", "Javier", "Amy", "Hilda", "Mary", "Houston", "Angelica" ], "edges": [ [ 0, 8 ], [ 1, 7 ], [ 1, 3 ], [ 3, 5 ], [ 5, 9 ], [ 6, 2 ], [ 6, 1 ], [ 8, 6 ], [ 9, 4 ], [ 10, 18 ], [ 11, 17 ], [ 11, 13 ], [ 13, 15 ], [ 15, 19 ], [ 16, 12 ], [ 16, 11 ], [ 18, 16 ], [ 19, 14 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Nolan knows Keaton. Jim knows Fraser. Jim knows Davis. Davis knows Kara. Hayden knows Alvin. Hayden knows Archie. Nolan knows Lee. Nolan knows Tonya. Hayden knows Effie. Brody knows Nolan. Beth knows Hardy. Beth knows Loretta. Davis knows Homer. Effie knows Norma. Fraser knows Hayden. Karina knows Brody. Tonya knows Kenneth. Karina knows Beth. Which of Norma and Kenneth can Karina reach?", "answer": "Kenneth", "steps": [ "Karina knows Brody.", "Brody knows Nolan.", "Nolan knows Tonya.", "Tonya knows Kenneth." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Karina", "Lee", "Loretta", "Kenneth", "Keaton", "Brody", "Beth", "Nolan", "Tonya", "Hardy", "Jim", "Alvin", "Kara", "Norma", "Archie", "Fraser", "Davis", "Hayden", "Effie", "Homer" ], "edges": [ [ 0, 5 ], [ 0, 6 ], [ 5, 7 ], [ 6, 2 ], [ 6, 9 ], [ 7, 1 ], [ 7, 4 ], [ 7, 8 ], [ 8, 3 ], [ 10, 15 ], [ 10, 16 ], [ 15, 17 ], [ 16, 12 ], [ 16, 19 ], [ 17, 11 ], [ 17, 14 ], [ 17, 18 ], [ 18, 13 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Mildred knows Annie. Allen knows Daphna. Mildred knows Aspen. Chris knows Jack. Daphna knows Blaine. Sidney knows Faye. Cara knows Allen. Annie knows Cara. Rhonda knows Ella. Alvin knows Mildred. Chantal knows Alejandro. Alejandro knows Sidney. Rhonda knows Rosemary. Della knows Esperanza. Jack knows Rhonda. Bella knows Chris. Esperanza knows Alvin. Ella knows Chantal. Which of Annie and Ella can Della reach?", "answer": "Annie", "steps": [ "Della knows Esperanza.", "Esperanza knows Alvin.", "Alvin knows Mildred.", "Mildred knows Annie." ], "difficulty": 4, "original_distance": 8, "idx_to_symbol": [ "Della", "Blaine", "Daphna", "Mildred", "Aspen", "Esperanza", "Annie", "Cara", "Allen", "Alvin", "Bella", "Faye", "Sidney", "Rhonda", "Rosemary", "Chris", "Ella", "Chantal", "Alejandro", "Jack" ], "edges": [ [ 0, 5 ], [ 2, 1 ], [ 3, 4 ], [ 3, 6 ], [ 5, 9 ], [ 6, 7 ], [ 7, 8 ], [ 8, 2 ], [ 9, 3 ], [ 10, 15 ], [ 12, 11 ], [ 13, 14 ], [ 13, 16 ], [ 15, 19 ], [ 16, 17 ], [ 17, 18 ], [ 18, 12 ], [ 19, 13 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Natalie knows Trina. Philip knows Kelsey. Xander knows Lawson. Charles knows Harmony. Harris knows Gareth. Kelsey knows Natalie. Antonio knows Gonzalo. Veronica knows Daria. Philip knows Veronica. Kelsey knows Blake. Charles knows Joaquin. Lawson knows Alice. Trina knows Michelle. Harris knows Philip. Harmony knows Antonio. Alice knows Perry. Xander knows Heath. Lawson knows Charles. Which of Michelle and Gonzalo can Harris reach?", "answer": "Michelle", "steps": [ "Harris knows Philip.", "Philip knows Kelsey.", "Kelsey knows Natalie.", "Natalie knows Trina.", "Trina knows Michelle." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Harris", "Philip", "Daria", "Veronica", "Trina", "Blake", "Gareth", "Kelsey", "Natalie", "Michelle", "Xander", "Lawson", "Perry", "Alice", "Antonio", "Joaquin", "Heath", "Charles", "Harmony", "Gonzalo" ], "edges": [ [ 0, 6 ], [ 0, 1 ], [ 1, 3 ], [ 1, 7 ], [ 3, 2 ], [ 4, 9 ], [ 7, 5 ], [ 7, 8 ], [ 8, 4 ], [ 10, 16 ], [ 10, 11 ], [ 11, 13 ], [ 11, 17 ], [ 13, 12 ], [ 14, 19 ], [ 17, 15 ], [ 17, 18 ], [ 18, 14 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Joyce knows Sara. Harris knows Wendell. Bernard knows Marion. Donna knows Merle. Harris knows Ray. Wendell knows Estella. Leonard knows Lorraine. Geoffrey knows Jerry. Harris knows Floyd. Merle knows Geoffrey. Ray knows Fabian. Merle knows Joyce. Fabian knows Marilyn. Floyd knows Derek. Bernard knows Harris. Lorraine knows Israel. Donna knows Beau. Merle knows Leonard. Which of Marilyn and Israel can Donna reach?", "answer": "Israel", "steps": [ "Donna knows Merle.", "Merle knows Leonard.", "Leonard knows Lorraine.", "Lorraine knows Israel." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Donna", "Geoffrey", "Sara", "Beau", "Jerry", "Leonard", "Israel", "Lorraine", "Merle", "Joyce", "Bernard", "Floyd", "Estella", "Marion", "Derek", "Ray", "Marilyn", "Fabian", "Harris", "Wendell" ], "edges": [ [ 0, 3 ], [ 0, 8 ], [ 1, 4 ], [ 5, 7 ], [ 7, 6 ], [ 8, 1 ], [ 8, 5 ], [ 8, 9 ], [ 9, 2 ], [ 10, 13 ], [ 10, 18 ], [ 11, 14 ], [ 15, 17 ], [ 17, 16 ], [ 18, 11 ], [ 18, 15 ], [ 18, 19 ], [ 19, 12 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Bridget knows Grady. Rachel knows Gerard. Ingrid knows Brock. Etta knows Ignacio. Ingrid knows Steve. Percy knows Norman. Carter knows Finn. Carter knows Miles. Finn knows Ira. Norman knows Ada. Norman knows Carter. Gerard knows Ingrid. Steve knows Eloise. Gerard knows Milton. Etta knows Ivan. Carter knows Etta. Steve knows Michelle. Ingrid knows Bridget. Which of Carter and Ingrid can Rachel reach?", "answer": "Ingrid", "steps": [ "Rachel knows Gerard.", "Gerard knows Ingrid." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Rachel", "Michelle", "Ingrid", "Brock", "Grady", "Gerard", "Milton", "Steve", "Eloise", "Bridget", "Percy", "Ivan", "Carter", "Miles", "Ira", "Norman", "Ada", "Etta", "Ignacio", "Finn" ], "edges": [ [ 0, 5 ], [ 2, 3 ], [ 2, 7 ], [ 2, 9 ], [ 5, 6 ], [ 5, 2 ], [ 7, 1 ], [ 7, 8 ], [ 9, 4 ], [ 10, 15 ], [ 12, 13 ], [ 12, 17 ], [ 12, 19 ], [ 15, 16 ], [ 15, 12 ], [ 17, 11 ], [ 17, 18 ], [ 19, 14 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Calvin knows Harvey. Brynn knows Frankie. Harvey knows Ira. Regina knows Dolores. Nell knows Sarah. Monroe knows Regina. Sarah knows Jeff. Vivian knows Nell. Frankie knows Alana. Jackson knows Monroe. Sarah knows Magdalena. Hamilton knows Brynn. Carey knows Hamilton. Clement knows Calvin. Carey knows Clement. Jackson knows Vivian. Frankie knows Gloria. Dolores knows Kurt. Which of Alana and Magdalena can Carey reach?", "answer": "Alana", "steps": [ "Carey knows Hamilton.", "Hamilton knows Brynn.", "Brynn knows Frankie.", "Frankie knows Alana." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Carey", "Calvin", "Hamilton", "Gloria", "Ira", "Alana", "Brynn", "Clement", "Harvey", "Frankie", "Jackson", "Regina", "Vivian", "Jeff", "Kurt", "Magdalena", "Nell", "Monroe", "Dolores", "Sarah" ], "edges": [ [ 0, 7 ], [ 0, 2 ], [ 1, 8 ], [ 2, 6 ], [ 6, 9 ], [ 7, 1 ], [ 8, 4 ], [ 9, 3 ], [ 9, 5 ], [ 10, 17 ], [ 10, 12 ], [ 11, 18 ], [ 12, 16 ], [ 16, 19 ], [ 17, 11 ], [ 18, 14 ], [ 19, 13 ], [ 19, 15 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Foster knows Mindy. Lois knows Foster. Livia knows Erik. Cooper knows Opal. Rick knows Ilene. Wyatt knows Tracy. Ilene knows Chris. Chris knows Lois. Tracy knows Dirk. Alan knows Heidi. Heidi knows Wyatt. Wyatt knows Livia. Erik knows Sara. Opal knows Shaun. Dirk knows Homer. Foster knows Audrey. Erik knows Jennifer. Chris knows Cooper. Which of Erik and Foster can Rick reach?", "answer": "Foster", "steps": [ "Rick knows Ilene.", "Ilene knows Chris.", "Chris knows Lois.", "Lois knows Foster." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Rick", "Audrey", "Foster", "Ilene", "Mindy", "Shaun", "Lois", "Chris", "Opal", "Cooper", "Alan", "Sara", "Erik", "Heidi", "Jennifer", "Homer", "Livia", "Wyatt", "Dirk", "Tracy" ], "edges": [ [ 0, 3 ], [ 2, 1 ], [ 2, 4 ], [ 3, 7 ], [ 6, 2 ], [ 7, 6 ], [ 7, 9 ], [ 8, 5 ], [ 9, 8 ], [ 10, 13 ], [ 12, 11 ], [ 12, 14 ], [ 13, 17 ], [ 16, 12 ], [ 17, 16 ], [ 17, 19 ], [ 18, 15 ], [ 19, 18 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Vanessa knows Lacey. Yuki knows Ashton. Randall knows Nora. Ivan knows Dorian. Emma knows Ivan. Ella knows Ernie. Nora knows Ella. Alfonso knows Vanessa. Yuki knows Reed. Ivan knows Alfonso. Bob knows Yuki. Randall knows Emma. Desmond knows Alder. Ashton knows Aspen. Renee knows Quinn. Aspen knows Irma. Alder knows Renee. Desmond knows Bob. Which of Ivan and Yuki can Desmond reach?", "answer": "Yuki", "steps": [ "Desmond knows Bob.", "Bob knows Yuki." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Desmond", "Alder", "Aspen", "Ashton", "Irma", "Renee", "Yuki", "Reed", "Quinn", "Bob", "Randall", "Nora", "Vanessa", "Alfonso", "Lacey", "Ella", "Ivan", "Dorian", "Ernie", "Emma" ], "edges": [ [ 0, 1 ], [ 0, 9 ], [ 1, 5 ], [ 2, 4 ], [ 3, 2 ], [ 5, 8 ], [ 6, 3 ], [ 6, 7 ], [ 9, 6 ], [ 10, 11 ], [ 10, 19 ], [ 11, 15 ], [ 12, 14 ], [ 13, 12 ], [ 15, 18 ], [ 16, 13 ], [ 16, 17 ], [ 19, 16 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Estella knows James. Cain knows Corey. Percy knows Hugh. Irving knows Maureen. Cody knows Melissa. Lara knows Patricia. Yvette knows Irving. Maureen knows Cole. Lara knows Percy. Irving knows Forrest. Maureen knows Estella. Percy knows Karl. Hugh knows Cody. Luz knows Lara. Melissa knows Karina. Maureen knows Hazel. Percy knows Dante. James knows Cain. Which of Cody and James can Luz reach?", "answer": "Cody", "steps": [ "Luz knows Lara.", "Lara knows Percy.", "Percy knows Hugh.", "Hugh knows Cody." ], "difficulty": 4, "original_distance": 6, "idx_to_symbol": [ "Luz", "Hugh", "Lara", "Cody", "Melissa", "Patricia", "Percy", "Karl", "Dante", "Karina", "Yvette", "Estella", "Irving", "James", "Cain", "Forrest", "Maureen", "Cole", "Hazel", "Corey" ], "edges": [ [ 0, 2 ], [ 1, 3 ], [ 2, 5 ], [ 2, 6 ], [ 3, 4 ], [ 4, 9 ], [ 6, 7 ], [ 6, 8 ], [ 6, 1 ], [ 10, 12 ], [ 11, 13 ], [ 12, 15 ], [ 12, 16 ], [ 13, 14 ], [ 14, 19 ], [ 16, 17 ], [ 16, 18 ], [ 16, 11 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Stephanie knows Cooper. Karl knows Fraser. Colleen knows Wilson. Katherine knows Cindy. Blake knows Leon. Dawn knows Stephanie. Colleen knows Jessie. Dawn knows Rose. Cooper knows Jacob. Dawn knows Colleen. Kenzie knows Bonnie. Jacob knows Kay. Blake knows Kenzie. Kenzie knows Ainsley. Colleen knows Amelia. Cindy knows Karl. Blake knows Katherine. Kenzie knows Holden. Which of Katherine and Stephanie can Dawn reach?", "answer": "Stephanie", "steps": [ "Dawn knows Stephanie." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Dawn", "Jessie", "Stephanie", "Cooper", "Wilson", "Jacob", "Amelia", "Colleen", "Rose", "Kay", "Blake", "Holden", "Katherine", "Cindy", "Ainsley", "Karl", "Bonnie", "Kenzie", "Leon", "Fraser" ], "edges": [ [ 0, 7 ], [ 0, 8 ], [ 0, 2 ], [ 2, 3 ], [ 3, 5 ], [ 5, 9 ], [ 7, 1 ], [ 7, 4 ], [ 7, 6 ], [ 10, 17 ], [ 10, 18 ], [ 10, 12 ], [ 12, 13 ], [ 13, 15 ], [ 15, 19 ], [ 17, 11 ], [ 17, 14 ], [ 17, 16 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Lamar knows Pete. Darcy knows Hayes. Aaron knows Teresa. Grace knows Hazel. Kara knows Mack. Pete knows Ada. June knows Aaron. Nina knows Israel. Myra knows June. Israel knows Darcy. Myra knows Grace. Mack knows Joshua. Hazel knows Lamar. Kara knows Kamila. Joshua knows Clyde. Joshua knows Serena. Aaron knows Audrey. Kamila knows Nina. Which of Kamila and Grace can Myra reach?", "answer": "Grace", "steps": [ "Myra knows Grace." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Myra", "Hazel", "Teresa", "Ada", "Grace", "Lamar", "Audrey", "June", "Pete", "Aaron", "Kara", "Nina", "Serena", "Hayes", "Kamila", "Israel", "Clyde", "Mack", "Darcy", "Joshua" ], "edges": [ [ 0, 4 ], [ 0, 7 ], [ 1, 5 ], [ 4, 1 ], [ 5, 8 ], [ 7, 9 ], [ 8, 3 ], [ 9, 2 ], [ 9, 6 ], [ 10, 14 ], [ 10, 17 ], [ 11, 15 ], [ 14, 11 ], [ 15, 18 ], [ 17, 19 ], [ 18, 13 ], [ 19, 12 ], [ 19, 16 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Hank knows Reed. Elmer knows Mindy. Zachary knows Langston. Blaine knows Finn. Finn knows Geoffrey. Xander knows Elmer. Reed knows Davis. Mindy knows Miriam. Davis knows Fanny. Xander knows Allen. Geoffrey knows Dolores. Zachary knows Val. Glen knows Essie. Celia knows Zachary. Carmen knows Xander. Dolores knows Carmen. Val knows Glen. Fanny knows Celia. Which of Reed and Finn can Blaine reach?", "answer": "Finn", "steps": [ "Blaine knows Finn." ], "difficulty": 1, "original_distance": 8, "idx_to_symbol": [ "Blaine", "Geoffrey", "Carmen", "Dolores", "Allen", "Miriam", "Elmer", "Xander", "Finn", "Mindy", "Hank", "Davis", "Celia", "Fanny", "Langston", "Essie", "Val", "Zachary", "Reed", "Glen" ], "edges": [ [ 0, 8 ], [ 1, 3 ], [ 2, 7 ], [ 3, 2 ], [ 6, 9 ], [ 7, 4 ], [ 7, 6 ], [ 8, 1 ], [ 9, 5 ], [ 10, 18 ], [ 11, 13 ], [ 12, 17 ], [ 13, 12 ], [ 16, 19 ], [ 17, 14 ], [ 17, 16 ], [ 18, 11 ], [ 19, 15 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Hannah knows Leroy. Ronald knows Graeme. Ray knows Terry. Hannah knows Daisy. Troy knows Ronald. Graeme knows Rose. Terry knows Yvonne. Anna knows Ray. Ethan knows Archer. Rose knows Ethan. Candice knows Anna. Archer knows Chris. Candice knows Clarence. Yvonne knows Nelson. Hannah knows Troy. Nelson knows Skyler. Candice knows Patricia. Skyler knows Billy. Which of Anna and Troy can Hannah reach?", "answer": "Troy", "steps": [ "Hannah knows Troy." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Hannah", "Ethan", "Troy", "Rose", "Ronald", "Archer", "Chris", "Daisy", "Graeme", "Leroy", "Candice", "Nelson", "Anna", "Yvonne", "Ray", "Skyler", "Billy", "Patricia", "Terry", "Clarence" ], "edges": [ [ 0, 7 ], [ 0, 2 ], [ 0, 9 ], [ 1, 5 ], [ 2, 4 ], [ 3, 1 ], [ 4, 8 ], [ 5, 6 ], [ 8, 3 ], [ 10, 17 ], [ 10, 12 ], [ 10, 19 ], [ 11, 15 ], [ 12, 14 ], [ 13, 11 ], [ 14, 18 ], [ 15, 16 ], [ 18, 13 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Cara knows Mark. Keaton knows Melody. Nelson knows Cristina. Keaton knows Adrian. Adrian knows Latoya. Herbert knows Dale. Kristina knows Aurora. Aurora knows Cara. Herbert knows Morris. Lauren knows Bennett. Dustin knows Grant. Morris knows Dustin. Miles knows Lauren. Nelson knows Jameson. Jameson knows Keaton. Kristina knows Leticia. Cara knows Herbert. Adrian knows Miles. Which of Adrian and Herbert can Nelson reach?", "answer": "Adrian", "steps": [ "Nelson knows Jameson.", "Jameson knows Keaton.", "Keaton knows Adrian." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Nelson", "Melody", "Latoya", "Miles", "Bennett", "Adrian", "Jameson", "Cristina", "Keaton", "Lauren", "Kristina", "Mark", "Dale", "Morris", "Grant", "Herbert", "Aurora", "Leticia", "Cara", "Dustin" ], "edges": [ [ 0, 7 ], [ 0, 6 ], [ 3, 9 ], [ 5, 2 ], [ 5, 3 ], [ 6, 8 ], [ 8, 1 ], [ 8, 5 ], [ 9, 4 ], [ 10, 17 ], [ 10, 16 ], [ 13, 19 ], [ 15, 12 ], [ 15, 13 ], [ 16, 18 ], [ 18, 11 ], [ 18, 15 ], [ 19, 14 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Hank knows Reed. Elmer knows Mindy. Zachary knows Langston. Blaine knows Finn. Finn knows Geoffrey. Xander knows Elmer. Reed knows Davis. Mindy knows Miriam. Davis knows Fanny. Xander knows Allen. Geoffrey knows Dolores. Zachary knows Val. Glen knows Essie. Celia knows Zachary. Carmen knows Xander. Dolores knows Carmen. Val knows Glen. Fanny knows Celia. Which of Fanny and Dolores can Blaine reach?", "answer": "Dolores", "steps": [ "Blaine knows Finn.", "Finn knows Geoffrey.", "Geoffrey knows Dolores." ], "difficulty": 3, "original_distance": 8, "idx_to_symbol": [ "Blaine", "Geoffrey", "Carmen", "Dolores", "Allen", "Miriam", "Elmer", "Xander", "Finn", "Mindy", "Hank", "Davis", "Celia", "Fanny", "Langston", "Essie", "Val", "Zachary", "Reed", "Glen" ], "edges": [ [ 0, 8 ], [ 1, 3 ], [ 2, 7 ], [ 3, 2 ], [ 6, 9 ], [ 7, 4 ], [ 7, 6 ], [ 8, 1 ], [ 9, 5 ], [ 10, 18 ], [ 11, 13 ], [ 12, 17 ], [ 13, 12 ], [ 16, 19 ], [ 17, 14 ], [ 17, 16 ], [ 18, 11 ], [ 19, 15 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Bryan knows Alyson. Elise knows Pete. Dennis knows Nancy. Sierra knows Clinton. Elise knows Charlotte. Pete knows Dennis. Inez knows Aspen. Irene knows Holly. Joan knows Irene. Joan knows Alder. Bryan knows Neville. Irene knows Elaine. Jackson knows Sierra. Jackson knows Josie. Clinton knows Erica. Holly knows Inez. Dennis knows Jackson. Alyson knows Joan. Which of Pete and Alyson can Elise reach?", "answer": "Pete", "steps": [ "Elise knows Pete." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Elise", "Erica", "Nancy", "Josie", "Sierra", "Pete", "Charlotte", "Clinton", "Dennis", "Jackson", "Bryan", "Aspen", "Alder", "Elaine", "Holly", "Alyson", "Neville", "Inez", "Joan", "Irene" ], "edges": [ [ 0, 6 ], [ 0, 5 ], [ 4, 7 ], [ 5, 8 ], [ 7, 1 ], [ 8, 2 ], [ 8, 9 ], [ 9, 3 ], [ 9, 4 ], [ 10, 16 ], [ 10, 15 ], [ 14, 17 ], [ 15, 18 ], [ 17, 11 ], [ 18, 12 ], [ 18, 19 ], [ 19, 13 ], [ 19, 14 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Denise knows Eldon. Gene knows Denise. Chad knows Shelby. Chad knows Erwin. Gertrude knows Hank. Reed knows Lottie. Gertrude knows James. Jane knows Claire. Chad knows Gene. James knows Nelson. Nelson knows Enrique. Claire knows Gordon. Kimberly knows Chad. Kimberly knows Reed. Gertrude knows Kendra. Lottie knows Alexa. Jane knows Gertrude. Gordon knows Kane. Which of Gene and James can Jane reach?", "answer": "James", "steps": [ "Jane knows Gertrude.", "Gertrude knows James." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Jane", "Gertrude", "Kane", "Enrique", "Claire", "Hank", "Kendra", "James", "Nelson", "Gordon", "Kimberly", "Chad", "Alexa", "Eldon", "Reed", "Erwin", "Shelby", "Gene", "Denise", "Lottie" ], "edges": [ [ 0, 1 ], [ 0, 4 ], [ 1, 5 ], [ 1, 6 ], [ 1, 7 ], [ 4, 9 ], [ 7, 8 ], [ 8, 3 ], [ 9, 2 ], [ 10, 11 ], [ 10, 14 ], [ 11, 15 ], [ 11, 16 ], [ 11, 17 ], [ 14, 19 ], [ 17, 18 ], [ 18, 13 ], [ 19, 12 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Russ knows Bennett. Walt knows Harley. Russ knows Aria. Ramona knows Serena. Ford knows Selena. Serena knows Andrew. Harris knows Ramona. Jewel knows Chantal. Humphrey knows Carson. Ford knows Walt. Jose knows Russ. Selena knows Humphrey. Alison knows Jewel. Jewel knows Harris. Bennett knows Ford. Goldie knows Lewis. Hank knows Goldie. Ramona knows Hank. Which of Lewis and Carson can Alison reach?", "answer": "Lewis", "steps": [ "Alison knows Jewel.", "Jewel knows Harris.", "Harris knows Ramona.", "Ramona knows Hank.", "Hank knows Goldie.", "Goldie knows Lewis." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Alison", "Harris", "Jewel", "Serena", "Lewis", "Chantal", "Ramona", "Andrew", "Hank", "Goldie", "Jose", "Bennett", "Russ", "Walt", "Carson", "Aria", "Ford", "Harley", "Selena", "Humphrey" ], "edges": [ [ 0, 2 ], [ 1, 6 ], [ 2, 5 ], [ 2, 1 ], [ 3, 7 ], [ 6, 3 ], [ 6, 8 ], [ 8, 9 ], [ 9, 4 ], [ 10, 12 ], [ 11, 16 ], [ 12, 15 ], [ 12, 11 ], [ 13, 17 ], [ 16, 13 ], [ 16, 18 ], [ 18, 19 ], [ 19, 14 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Billy knows Renee. Wyatt knows Ernest. Evan knows Edison. Wyatt knows Linda. Erwin knows Andre. Hampton knows Evan. Maya knows Hampton. Ryan knows Carlton. Maya knows Leigh. Leigh knows Bernice. Leigh knows Kieran. Renee knows Erwin. Leigh knows Sonia. Wyatt knows Alvin. Renee knows Estelle. Billy knows Wyatt. Estelle knows Marc. Hampton knows Ryan. Which of Erwin and Evan can Billy reach?", "answer": "Erwin", "steps": [ "Billy knows Renee.", "Renee knows Erwin." ], "difficulty": 2, "original_distance": 3, "idx_to_symbol": [ "Billy", "Estelle", "Renee", "Marc", "Erwin", "Andre", "Ernest", "Wyatt", "Alvin", "Linda", "Maya", "Ryan", "Hampton", "Carlton", "Evan", "Edison", "Sonia", "Leigh", "Bernice", "Kieran" ], "edges": [ [ 0, 2 ], [ 0, 7 ], [ 1, 3 ], [ 2, 1 ], [ 2, 4 ], [ 4, 5 ], [ 7, 6 ], [ 7, 8 ], [ 7, 9 ], [ 10, 12 ], [ 10, 17 ], [ 11, 13 ], [ 12, 11 ], [ 12, 14 ], [ 14, 15 ], [ 17, 16 ], [ 17, 18 ], [ 17, 19 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Randy knows Tim. Carmen knows Jean. Tim knows Jeanette. Carl knows Randy. Judy knows Ariel. Jeanette knows Carmen. Ariel knows Cristina. Randy knows Miriam. Lee knows Tristan. Lee knows Ronald. Judy knows Wendy. Carl knows Hampton. Carmen knows Francis. Hampton knows Rosemary. Joshua knows Judy. Joshua knows Cesar. Cesar knows Thea. Cristina knows Lee. Which of Lee and Carmen can Joshua reach?", "answer": "Lee", "steps": [ "Joshua knows Judy.", "Judy knows Ariel.", "Ariel knows Cristina.", "Cristina knows Lee." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Joshua", "Judy", "Cristina", "Tristan", "Wendy", "Ronald", "Cesar", "Ariel", "Lee", "Thea", "Carl", "Randy", "Jeanette", "Francis", "Miriam", "Jean", "Hampton", "Tim", "Carmen", "Rosemary" ], "edges": [ [ 0, 1 ], [ 0, 6 ], [ 1, 4 ], [ 1, 7 ], [ 2, 8 ], [ 6, 9 ], [ 7, 2 ], [ 8, 3 ], [ 8, 5 ], [ 10, 11 ], [ 10, 16 ], [ 11, 14 ], [ 11, 17 ], [ 12, 18 ], [ 16, 19 ], [ 17, 12 ], [ 18, 13 ], [ 18, 15 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Roger knows Pierce. Jude knows Barney. Clyde knows Simon. Pierce knows Dewey. Marco knows Clyde. Ibrahim knows Doug. Jude knows Lars. Cyrus knows Roger. Marco knows Elodie. Ibrahim knows Holden. Pierce knows Megan. Cyrus knows Esperanza. Marco knows Jerry. Marco knows Jaime. Clyde knows Will. Pierce knows Gareth. Doug knows Marco. Pierce knows Jude. Which of Barney and Simon can Cyrus reach?", "answer": "Barney", "steps": [ "Cyrus knows Roger.", "Roger knows Pierce.", "Pierce knows Jude.", "Jude knows Barney." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Cyrus", "Roger", "Esperanza", "Pierce", "Dewey", "Gareth", "Jude", "Barney", "Lars", "Megan", "Ibrahim", "Doug", "Holden", "Marco", "Jaime", "Jerry", "Clyde", "Simon", "Will", "Elodie" ], "edges": [ [ 0, 2 ], [ 0, 1 ], [ 1, 3 ], [ 3, 4 ], [ 3, 5 ], [ 3, 6 ], [ 3, 9 ], [ 6, 7 ], [ 6, 8 ], [ 10, 12 ], [ 10, 11 ], [ 11, 13 ], [ 13, 14 ], [ 13, 15 ], [ 13, 16 ], [ 13, 19 ], [ 16, 17 ], [ 16, 18 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Rosa knows Ava. Bert knows Albert. Albert knows Felicia. Ira knows Priscilla. Gina knows Bert. Brooke knows Itzel. Felicia knows Lana. Aaron knows Tina. Ira knows Carla. Brooke knows Preston. Ira knows Brooke. Bert knows Dina. Albert knows Kenneth. Aaron knows Ira. Brooke knows Rosa. Bert knows Barney. Albert knows Janice. Gina knows Viola. Which of Ira and Bert can Aaron reach?", "answer": "Ira", "steps": [ "Aaron knows Ira." ], "difficulty": 1, "original_distance": 4, "idx_to_symbol": [ "Aaron", "Ira", "Brooke", "Itzel", "Preston", "Ava", "Carla", "Priscilla", "Rosa", "Tina", "Gina", "Bert", "Albert", "Kenneth", "Janice", "Lana", "Dina", "Barney", "Felicia", "Viola" ], "edges": [ [ 0, 1 ], [ 0, 9 ], [ 1, 6 ], [ 1, 7 ], [ 1, 2 ], [ 2, 3 ], [ 2, 4 ], [ 2, 8 ], [ 8, 5 ], [ 10, 11 ], [ 10, 19 ], [ 11, 16 ], [ 11, 17 ], [ 11, 12 ], [ 12, 13 ], [ 12, 14 ], [ 12, 18 ], [ 18, 15 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Cruz knows Harris. Harris knows Jenny. Mason knows Cruz. Morgan knows Kit. Mason knows Kenneth. Jacob knows Joaquin. Harris knows Dorian. Clement knows Beau. Constance knows Esme. Darius knows Max. Joaquin knows Greer. Esme knows Jose. Darius knows Jacob. Dorian knows Morgan. Gage knows Craig. Jose knows Clement. Joaquin knows Constance. Kit knows Gage. Which of Jacob and Cruz can Darius reach?", "answer": "Jacob", "steps": [ "Darius knows Jacob." ], "difficulty": 1, "original_distance": 7, "idx_to_symbol": [ "Darius", "Greer", "Jose", "Jacob", "Max", "Constance", "Clement", "Esme", "Beau", "Joaquin", "Mason", "Jenny", "Kit", "Cruz", "Kenneth", "Dorian", "Gage", "Morgan", "Craig", "Harris" ], "edges": [ [ 0, 4 ], [ 0, 3 ], [ 2, 6 ], [ 3, 9 ], [ 5, 7 ], [ 6, 8 ], [ 7, 2 ], [ 9, 1 ], [ 9, 5 ], [ 10, 14 ], [ 10, 13 ], [ 12, 16 ], [ 13, 19 ], [ 15, 17 ], [ 16, 18 ], [ 17, 12 ], [ 19, 11 ], [ 19, 15 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Joyce knows Louis. Max knows Joyce. Yara knows Parker. Knox knows Sebastian. Susan knows Darius. Grady knows Yara. Jonathan knows Bridget. Yara knows Susan. Knox knows Jonathan. George knows Knox. Evelyn knows Max. Jeremiah knows Grover. Max knows Chandler. George knows Grady. Jeremiah knows Sadie. Alex knows Jeremiah. Evelyn knows Alex. Sadie knows Heidi. Which of Susan and Sadie can George reach?", "answer": "Susan", "steps": [ "George knows Grady.", "Grady knows Yara.", "Yara knows Susan." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "George", "Darius", "Sebastian", "Knox", "Parker", "Yara", "Grady", "Bridget", "Susan", "Jonathan", "Evelyn", "Heidi", "Chandler", "Max", "Grover", "Jeremiah", "Alex", "Louis", "Sadie", "Joyce" ], "edges": [ [ 0, 6 ], [ 0, 3 ], [ 3, 2 ], [ 3, 9 ], [ 5, 4 ], [ 5, 8 ], [ 6, 5 ], [ 8, 1 ], [ 9, 7 ], [ 10, 16 ], [ 10, 13 ], [ 13, 12 ], [ 13, 19 ], [ 15, 14 ], [ 15, 18 ], [ 16, 15 ], [ 18, 11 ], [ 19, 17 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Frida knows Jewel. Morgan knows Frida. Blanche knows Bert. Angela knows Horace. Bert knows Morgan. Clement knows Blanche. Bernadette knows Lloyd. Jewel knows Magdalena. Amber knows Rita. Archer knows Angela. Lloyd knows Juan. Angela knows Lilia. Lilia knows Melody. Melody knows Jeffery. Yvette knows Amber. Horace knows Violet. Violet knows Bernadette. Blanche knows Yvette. Which of Violet and Morgan can Archer reach?", "answer": "Violet", "steps": [ "Archer knows Angela.", "Angela knows Horace.", "Horace knows Violet." ], "difficulty": 3, "original_distance": 6, "idx_to_symbol": [ "Archer", "Angela", "Juan", "Bernadette", "Violet", "Melody", "Jeffery", "Horace", "Lloyd", "Lilia", "Clement", "Blanche", "Magdalena", "Frida", "Morgan", "Amber", "Rita", "Bert", "Jewel", "Yvette" ], "edges": [ [ 0, 1 ], [ 1, 7 ], [ 1, 9 ], [ 3, 8 ], [ 4, 3 ], [ 5, 6 ], [ 7, 4 ], [ 8, 2 ], [ 9, 5 ], [ 10, 11 ], [ 11, 17 ], [ 11, 19 ], [ 13, 18 ], [ 14, 13 ], [ 15, 16 ], [ 17, 14 ], [ 18, 12 ], [ 19, 15 ] ], "start": 0, "target": 4, "neg_target": 14, "graph_type": "random_tree" }, { "question": "Hayden knows Louisa. Louisa knows Kelsey. Milton knows Bart. Peter knows Seth. Layla knows Keaton. Lottie knows Kerry. Amber knows Milton. Jesse knows Sally. Layla knows Joshua. Esperanza knows Darla. Lottie knows Robin. Sally knows Estella. Luella knows Jesse. Darla knows Layla. Seth knows Esperanza. Bart knows Lottie. Estella knows Amber. Kelsey knows Peter. Which of Bart and Darla can Hayden reach?", "answer": "Darla", "steps": [ "Hayden knows Louisa.", "Louisa knows Kelsey.", "Kelsey knows Peter.", "Peter knows Seth.", "Seth knows Esperanza.", "Esperanza knows Darla." ], "difficulty": 6, "original_distance": 8, "idx_to_symbol": [ "Hayden", "Esperanza", "Louisa", "Peter", "Kelsey", "Joshua", "Keaton", "Darla", "Layla", "Seth", "Luella", "Milton", "Jesse", "Estella", "Sally", "Robin", "Kerry", "Bart", "Lottie", "Amber" ], "edges": [ [ 0, 2 ], [ 1, 7 ], [ 2, 4 ], [ 3, 9 ], [ 4, 3 ], [ 7, 8 ], [ 8, 5 ], [ 8, 6 ], [ 9, 1 ], [ 10, 12 ], [ 11, 17 ], [ 12, 14 ], [ 13, 19 ], [ 14, 13 ], [ 17, 18 ], [ 18, 15 ], [ 18, 16 ], [ 19, 11 ] ], "start": 0, "target": 7, "neg_target": 17, "graph_type": "random_tree" }, { "question": "Joshua knows Ariel. Liam knows Monroe. Elvira knows Frida. Otto knows Goldie. Ariel knows Liam. Anton knows Otto. Ilene knows Carla. Monroe knows Hunter. Anton knows Norma. Anton knows Hardy. Liam knows Gregory. Ilene knows Anton. Ray knows Jeremiah. Monroe knows Lawson. Monroe knows Elvira. Norma knows Harrison. Hunter knows Dustin. Jeremiah knows Ilene. Which of Otto and Hunter can Ray reach?", "answer": "Otto", "steps": [ "Ray knows Jeremiah.", "Jeremiah knows Ilene.", "Ilene knows Anton.", "Anton knows Otto." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Ray", "Norma", "Carla", "Jeremiah", "Ilene", "Hardy", "Anton", "Harrison", "Otto", "Goldie", "Joshua", "Elvira", "Gregory", "Ariel", "Liam", "Lawson", "Monroe", "Frida", "Hunter", "Dustin" ], "edges": [ [ 0, 3 ], [ 1, 7 ], [ 3, 4 ], [ 4, 2 ], [ 4, 6 ], [ 6, 5 ], [ 6, 1 ], [ 6, 8 ], [ 8, 9 ], [ 10, 13 ], [ 11, 17 ], [ 13, 14 ], [ 14, 12 ], [ 14, 16 ], [ 16, 15 ], [ 16, 11 ], [ 16, 18 ], [ 18, 19 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Clark knows Diego. Gunnar knows Joanna. Jeremy knows Raquel. Kara knows Rufus. Clark knows Aria. Kara knows Ricardo. Rufus knows Dakota. Joanna knows Jermaine. Aria knows Cliff. Ricardo knows Deirdre. Diego knows Jamie. Gunnar knows Jerome. Rufus knows Brian. Jeremy knows Brad. Raquel knows Clark. Brad knows Fred. Jerome knows Kara. Aria knows Howard. Which of Aria and Rufus can Gunnar reach?", "answer": "Rufus", "steps": [ "Gunnar knows Jerome.", "Jerome knows Kara.", "Kara knows Rufus." ], "difficulty": 3, "original_distance": 4, "idx_to_symbol": [ "Gunnar", "Rufus", "Ricardo", "Jermaine", "Joanna", "Deirdre", "Dakota", "Jerome", "Brian", "Kara", "Jeremy", "Aria", "Diego", "Fred", "Brad", "Jamie", "Howard", "Raquel", "Cliff", "Clark" ], "edges": [ [ 0, 4 ], [ 0, 7 ], [ 1, 6 ], [ 1, 8 ], [ 2, 5 ], [ 4, 3 ], [ 7, 9 ], [ 9, 2 ], [ 9, 1 ], [ 10, 14 ], [ 10, 17 ], [ 11, 16 ], [ 11, 18 ], [ 12, 15 ], [ 14, 13 ], [ 17, 19 ], [ 19, 12 ], [ 19, 11 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Lionel knows Miranda. Lionel knows Ivan. Brent knows Clifford. Kristina knows Skyler. Daphna knows Brent. Miranda knows Elmer. Denver knows Dolly. Homer knows Dixie. Denver knows India. Lionel knows Bella. Allan knows Loretta. Allan knows Homer. Dolly knows Daphna. Allan knows Denver. Miranda knows Bette. Bette knows Fern. Fern knows Kristina. Bella knows Violet. Which of Kristina and Brent can Allan reach?", "answer": "Brent", "steps": [ "Allan knows Denver.", "Denver knows Dolly.", "Dolly knows Daphna.", "Daphna knows Brent." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Allan", "Daphna", "Dolly", "Brent", "Clifford", "Denver", "Dixie", "Homer", "Loretta", "India", "Lionel", "Fern", "Bette", "Kristina", "Skyler", "Miranda", "Violet", "Bella", "Ivan", "Elmer" ], "edges": [ [ 0, 7 ], [ 0, 8 ], [ 0, 5 ], [ 1, 3 ], [ 2, 1 ], [ 3, 4 ], [ 5, 2 ], [ 5, 9 ], [ 7, 6 ], [ 10, 17 ], [ 10, 18 ], [ 10, 15 ], [ 11, 13 ], [ 12, 11 ], [ 13, 14 ], [ 15, 12 ], [ 15, 19 ], [ 17, 16 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Frida knows Jewel. Morgan knows Frida. Blanche knows Bert. Angela knows Horace. Bert knows Morgan. Clement knows Blanche. Bernadette knows Lloyd. Jewel knows Magdalena. Amber knows Rita. Archer knows Angela. Lloyd knows Juan. Angela knows Lilia. Lilia knows Melody. Melody knows Jeffery. Yvette knows Amber. Horace knows Violet. Violet knows Bernadette. Blanche knows Yvette. Which of Magdalena and Juan can Archer reach?", "answer": "Juan", "steps": [ "Archer knows Angela.", "Angela knows Horace.", "Horace knows Violet.", "Violet knows Bernadette.", "Bernadette knows Lloyd.", "Lloyd knows Juan." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Archer", "Angela", "Juan", "Bernadette", "Violet", "Melody", "Jeffery", "Horace", "Lloyd", "Lilia", "Clement", "Blanche", "Magdalena", "Frida", "Morgan", "Amber", "Rita", "Bert", "Jewel", "Yvette" ], "edges": [ [ 0, 1 ], [ 1, 7 ], [ 1, 9 ], [ 3, 8 ], [ 4, 3 ], [ 5, 6 ], [ 7, 4 ], [ 8, 2 ], [ 9, 5 ], [ 10, 11 ], [ 11, 17 ], [ 11, 19 ], [ 13, 18 ], [ 14, 13 ], [ 15, 16 ], [ 17, 14 ], [ 18, 12 ], [ 19, 15 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Joel knows Nadine. Hubert knows Wayne. Deirdre knows Jill. Darius knows Joseph. Wayne knows Darius. Nadine knows Tracy. Darius knows Julius. Jill knows Omar. Deirdre knows Dale. Ronald knows Colin. Colin knows Lisette. Justin knows Ronald. Omar knows Maude. Tracy knows Riley. Deirdre knows Justin. Joel knows Aspen. Joel knows Hubert. Colin knows Dallas. Which of Dallas and Joseph can Joel reach?", "answer": "Joseph", "steps": [ "Joel knows Hubert.", "Hubert knows Wayne.", "Wayne knows Darius.", "Darius knows Joseph." ], "difficulty": 4, "original_distance": 4, "idx_to_symbol": [ "Joel", "Aspen", "Hubert", "Nadine", "Tracy", "Riley", "Julius", "Darius", "Joseph", "Wayne", "Deirdre", "Dale", "Justin", "Jill", "Omar", "Maude", "Lisette", "Colin", "Dallas", "Ronald" ], "edges": [ [ 0, 1 ], [ 0, 3 ], [ 0, 2 ], [ 2, 9 ], [ 3, 4 ], [ 4, 5 ], [ 7, 6 ], [ 7, 8 ], [ 9, 7 ], [ 10, 11 ], [ 10, 13 ], [ 10, 12 ], [ 12, 19 ], [ 13, 14 ], [ 14, 15 ], [ 17, 16 ], [ 17, 18 ], [ 19, 17 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Aaron knows Robert. Keira knows Bonnie. Doug knows Kim. Aubrey knows Roy. Aaron knows Doug. Hector knows Blake. Robert knows Keith. Lydia knows George. Evan knows Aaron. Roy knows Hector. Blake knows Keira. Doug knows Kirk. Chance knows Evan. Blake knows Luz. Kim knows Russ. Luz knows Percy. Joyce knows Chance. Luz knows Lydia. Which of Evan and Hector can Joyce reach?", "answer": "Evan", "steps": [ "Joyce knows Chance.", "Chance knows Evan." ], "difficulty": 2, "original_distance": 6, "idx_to_symbol": [ "Joyce", "Keith", "Kirk", "Robert", "Doug", "Russ", "Aaron", "Chance", "Evan", "Kim", "Aubrey", "Bonnie", "Percy", "Keira", "Luz", "George", "Blake", "Roy", "Hector", "Lydia" ], "edges": [ [ 0, 7 ], [ 3, 1 ], [ 4, 2 ], [ 4, 9 ], [ 6, 3 ], [ 6, 4 ], [ 7, 8 ], [ 8, 6 ], [ 9, 5 ], [ 10, 17 ], [ 13, 11 ], [ 14, 12 ], [ 14, 19 ], [ 16, 13 ], [ 16, 14 ], [ 17, 18 ], [ 18, 16 ], [ 19, 15 ] ], "start": 0, "target": 8, "neg_target": 18, "graph_type": "random_tree" }, { "question": "Kelsey knows Kristin. Gwen knows Christian. Ted knows Kelsey. Stacy knows Donovan. Christian knows Larissa. Veronica knows Knox. Jude knows Stacy. Bruno knows Maya. Stacy knows Ted. Julius knows Bruno. Chance knows Dick. Larissa knows Greta. Kristin knows Veronica. Stacy knows Chance. Greta knows Fiona. Wanda knows Julius. Julius knows Gwen. Julius knows Hardy. Which of Greta and Veronica can Wanda reach?", "answer": "Greta", "steps": [ "Wanda knows Julius.", "Julius knows Gwen.", "Gwen knows Christian.", "Christian knows Larissa.", "Larissa knows Greta." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Wanda", "Fiona", "Greta", "Maya", "Hardy", "Julius", "Gwen", "Larissa", "Christian", "Bruno", "Jude", "Knox", "Veronica", "Dick", "Donovan", "Stacy", "Ted", "Kristin", "Kelsey", "Chance" ], "edges": [ [ 0, 5 ], [ 2, 1 ], [ 5, 4 ], [ 5, 6 ], [ 5, 9 ], [ 6, 8 ], [ 7, 2 ], [ 8, 7 ], [ 9, 3 ], [ 10, 15 ], [ 12, 11 ], [ 15, 14 ], [ 15, 16 ], [ 15, 19 ], [ 16, 18 ], [ 17, 12 ], [ 18, 17 ], [ 19, 13 ] ], "start": 0, "target": 2, "neg_target": 12, "graph_type": "random_tree" }, { "question": "Wanda knows Rufus. Clement knows Wanda. Hayes knows Freya. Vera knows Maureen. Vicki knows Miranda. Vera knows Doug. Patricia knows Otto. Wanda knows Vera. Leigh knows Colette. Vicki knows William. Clement knows Alexa. Leigh knows Lambert. Colette knows Mike. Clement knows Vicki. Hayes knows Leigh. Colette knows Eloise. Patricia knows Holly. Hayes knows Patricia. Which of Colette and Vera can Hayes reach?", "answer": "Colette", "steps": [ "Hayes knows Leigh.", "Leigh knows Colette." ], "difficulty": 2, "original_distance": 3, "idx_to_symbol": [ "Hayes", "Eloise", "Mike", "Patricia", "Lambert", "Freya", "Holly", "Leigh", "Otto", "Colette", "Clement", "Doug", "Maureen", "Vicki", "Rufus", "Alexa", "William", "Wanda", "Miranda", "Vera" ], "edges": [ [ 0, 5 ], [ 0, 3 ], [ 0, 7 ], [ 3, 6 ], [ 3, 8 ], [ 7, 4 ], [ 7, 9 ], [ 9, 1 ], [ 9, 2 ], [ 10, 15 ], [ 10, 13 ], [ 10, 17 ], [ 13, 16 ], [ 13, 18 ], [ 17, 14 ], [ 17, 19 ], [ 19, 11 ], [ 19, 12 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Faith knows Charles. Isadora knows Yasmin. Tony knows Theodore. Bella knows Thea. Faith knows Vance. Yasmin knows Faith. Fraser knows Basil. Yasmin knows Lola. Basil knows Vincent. Thea knows Bonnie. Fraser knows Whitney. Bonnie knows Fraser. Isadora knows Will. Faith knows Tony. Fraser knows Jeremiah. Bonnie knows Jack. Anastasia knows Isadora. Thea knows Hank. Which of Theodore and Vincent can Bella reach?", "answer": "Vincent", "steps": [ "Bella knows Thea.", "Thea knows Bonnie.", "Bonnie knows Fraser.", "Fraser knows Basil.", "Basil knows Vincent." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Bella", "Hank", "Fraser", "Thea", "Basil", "Whitney", "Vincent", "Jack", "Jeremiah", "Bonnie", "Anastasia", "Will", "Faith", "Isadora", "Tony", "Charles", "Theodore", "Lola", "Vance", "Yasmin" ], "edges": [ [ 0, 3 ], [ 2, 5 ], [ 2, 4 ], [ 2, 8 ], [ 3, 1 ], [ 3, 9 ], [ 4, 6 ], [ 9, 7 ], [ 9, 2 ], [ 10, 13 ], [ 12, 15 ], [ 12, 14 ], [ 12, 18 ], [ 13, 11 ], [ 13, 19 ], [ 14, 16 ], [ 19, 17 ], [ 19, 12 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Freya knows Arnold. Dorothy knows Jeanne. Lillian knows Max. Arnold knows Anthony. Max knows Val. Aaron knows Megan. Megan knows Rose. Renee knows Valerie. Trudy knows Renee. Eric knows Norman. Angela knows Allan. Norman knows Marion. Val knows Otto. Anthony knows Dorothy. Arnold knows Angela. Dorothy knows Eric. Max knows Aaron. Megan knows Trudy. Which of Arnold and Max can Freya reach?", "answer": "Arnold", "steps": [ "Freya knows Arnold." ], "difficulty": 1, "original_distance": 6, "idx_to_symbol": [ "Freya", "Arnold", "Eric", "Allan", "Angela", "Jeanne", "Dorothy", "Anthony", "Norman", "Marion", "Lillian", "Max", "Trudy", "Otto", "Val", "Rose", "Megan", "Aaron", "Renee", "Valerie" ], "edges": [ [ 0, 1 ], [ 1, 4 ], [ 1, 7 ], [ 2, 8 ], [ 4, 3 ], [ 6, 5 ], [ 6, 2 ], [ 7, 6 ], [ 8, 9 ], [ 10, 11 ], [ 11, 14 ], [ 11, 17 ], [ 12, 18 ], [ 14, 13 ], [ 16, 15 ], [ 16, 12 ], [ 17, 16 ], [ 18, 19 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Kara knows Jewel. Clyde knows Devin. Effie knows Kara. Jack knows Dudley. Joan knows Carlton. Dakota knows Lloyd. Dudley knows Effie. Carey knows Nelson. Shelby knows Carey. Troy knows Jana. Shelby knows Dakota. Ashley knows Troy. Nelson knows Robin. Kristin knows Shelby. Kristin knows Clyde. Dudley knows Joan. Effie knows Ashley. Donald knows Kristin. Which of Robin and Jana can Donald reach?", "answer": "Robin", "steps": [ "Donald knows Kristin.", "Kristin knows Shelby.", "Shelby knows Carey.", "Carey knows Nelson.", "Nelson knows Robin." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Donald", "Carey", "Lloyd", "Robin", "Devin", "Clyde", "Kristin", "Dakota", "Nelson", "Shelby", "Jack", "Ashley", "Jewel", "Jana", "Carlton", "Joan", "Dudley", "Kara", "Troy", "Effie" ], "edges": [ [ 0, 6 ], [ 1, 8 ], [ 5, 4 ], [ 6, 5 ], [ 6, 9 ], [ 7, 2 ], [ 8, 3 ], [ 9, 7 ], [ 9, 1 ], [ 10, 16 ], [ 11, 18 ], [ 15, 14 ], [ 16, 15 ], [ 16, 19 ], [ 17, 12 ], [ 18, 13 ], [ 19, 17 ], [ 19, 11 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" }, { "question": "Dwight knows Wendy. Neal knows Caleb. Isla knows Antonio. Katherine knows Colin. Dwight knows Edmund. Edmund knows Ursula. Neal knows Natalie. Annette knows Neal. Desmond knows Dwight. Colin knows Desmond. Lara knows Max. Edmund knows Vanessa. Dwight knows Irving. Antonio knows Annette. Neal knows Lara. Lara knows Tina. Max knows Lewis. Vanessa knows Jonathan. Which of Jonathan and Lewis can Isla reach?", "answer": "Lewis", "steps": [ "Isla knows Antonio.", "Antonio knows Annette.", "Annette knows Neal.", "Neal knows Lara.", "Lara knows Max.", "Max knows Lewis." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Isla", "Lara", "Caleb", "Annette", "Neal", "Natalie", "Lewis", "Tina", "Max", "Antonio", "Katherine", "Edmund", "Irving", "Desmond", "Dwight", "Wendy", "Jonathan", "Ursula", "Vanessa", "Colin" ], "edges": [ [ 0, 9 ], [ 1, 7 ], [ 1, 8 ], [ 3, 4 ], [ 4, 2 ], [ 4, 5 ], [ 4, 1 ], [ 8, 6 ], [ 9, 3 ], [ 10, 19 ], [ 11, 17 ], [ 11, 18 ], [ 13, 14 ], [ 14, 12 ], [ 14, 15 ], [ 14, 11 ], [ 18, 16 ], [ 19, 13 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Alma knows Melody. Haley knows Gina. Tanya knows Kane. Yara knows Evan. Greer knows Zara. Kane knows Aaron. David knows Jenny. Tanya knows Maggie. Zara knows Tanya. Amanda knows Haley. Melody knows David. Maggie knows Bruce. Aaron knows Monroe. Greer knows Selena. Kane knows Uma. Yara knows Alma. Amanda knows Abby. Melody knows Amanda. Which of Gina and Monroe can Greer reach?", "answer": "Monroe", "steps": [ "Greer knows Zara.", "Zara knows Tanya.", "Tanya knows Kane.", "Kane knows Aaron.", "Aaron knows Monroe." ], "difficulty": 5, "original_distance": 5, "idx_to_symbol": [ "Greer", "Zara", "Tanya", "Uma", "Kane", "Maggie", "Monroe", "Bruce", "Selena", "Aaron", "Yara", "Alma", "Melody", "Abby", "Amanda", "David", "Gina", "Jenny", "Evan", "Haley" ], "edges": [ [ 0, 8 ], [ 0, 1 ], [ 1, 2 ], [ 2, 5 ], [ 2, 4 ], [ 4, 3 ], [ 4, 9 ], [ 5, 7 ], [ 9, 6 ], [ 10, 18 ], [ 10, 11 ], [ 11, 12 ], [ 12, 15 ], [ 12, 14 ], [ 14, 13 ], [ 14, 19 ], [ 15, 17 ], [ 19, 16 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Elena knows Jessica. Rosa knows Jeanne. Lawrence knows Celia. Maude knows Elena. Angela knows Maude. Faye knows Florence. Ebony knows Faye. Celia knows Brooke. Angela knows Rosa. Travis knows Robin. Brooke knows Aaron. Florence knows Chad. Jenny knows August. Jeanne knows Travis. Kevin knows Angela. Leroy knows Kevin. August knows Lawrence. Lawrence knows Ebony. Which of Robin and Chad can Jenny reach?", "answer": "Chad", "steps": [ "Jenny knows August.", "August knows Lawrence.", "Lawrence knows Ebony.", "Ebony knows Faye.", "Faye knows Florence.", "Florence knows Chad." ], "difficulty": 6, "original_distance": 6, "idx_to_symbol": [ "Jenny", "Florence", "Lawrence", "Brooke", "Faye", "Ebony", "Chad", "Celia", "Aaron", "August", "Leroy", "Travis", "Angela", "Elena", "Jeanne", "Rosa", "Robin", "Maude", "Jessica", "Kevin" ], "edges": [ [ 0, 9 ], [ 1, 6 ], [ 2, 5 ], [ 2, 7 ], [ 3, 8 ], [ 4, 1 ], [ 5, 4 ], [ 7, 3 ], [ 9, 2 ], [ 10, 19 ], [ 11, 16 ], [ 12, 15 ], [ 12, 17 ], [ 13, 18 ], [ 14, 11 ], [ 15, 14 ], [ 17, 13 ], [ 19, 12 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Guy knows Emmett. Cooper knows Erik. Xander knows Ava. Cliff knows Devon. Fiona knows Arturo. Celia knows Edward. Edward knows Xander. Cliff knows Damien. Damien knows Israel. Devon knows Billy. Alyson knows Harry. Arturo knows Celia. Celia knows Alyson. Edward knows Samuel. Erik knows Guy. Guy knows Cliff. Emmett knows Mae. Samuel knows Kevin. Which of Guy and Celia can Cooper reach?", "answer": "Guy", "steps": [ "Cooper knows Erik.", "Erik knows Guy." ], "difficulty": 2, "original_distance": 5, "idx_to_symbol": [ "Cooper", "Guy", "Billy", "Erik", "Devon", "Cliff", "Damien", "Emmett", "Israel", "Mae", "Fiona", "Celia", "Ava", "Arturo", "Xander", "Edward", "Samuel", "Alyson", "Kevin", "Harry" ], "edges": [ [ 0, 3 ], [ 1, 5 ], [ 1, 7 ], [ 3, 1 ], [ 4, 2 ], [ 5, 4 ], [ 5, 6 ], [ 6, 8 ], [ 7, 9 ], [ 10, 13 ], [ 11, 15 ], [ 11, 17 ], [ 13, 11 ], [ 14, 12 ], [ 15, 14 ], [ 15, 16 ], [ 16, 18 ], [ 17, 19 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Imogen knows William. Daisy knows Cameron. Cameron knows Tina. Nelson knows Winston. Lorenzo knows Fabian. Leigh knows Daisy. Ibrahim knows Lucy. Imogen knows Declan. Fabian knows Imogen. Cameron knows Christopher. Cameron knows Lorenzo. Rosemary knows Ibrahim. Winston knows Molly. Molly knows Damien. Ibrahim knows Ted. Ibrahim knows Nelson. Damian knows Rosemary. Molly knows Scott. Which of Imogen and Molly can Damian reach?", "answer": "Molly", "steps": [ "Damian knows Rosemary.", "Rosemary knows Ibrahim.", "Ibrahim knows Nelson.", "Nelson knows Winston.", "Winston knows Molly." ], "difficulty": 5, "original_distance": 6, "idx_to_symbol": [ "Damian", "Ibrahim", "Scott", "Ted", "Winston", "Nelson", "Molly", "Rosemary", "Damien", "Lucy", "Leigh", "Cameron", "Declan", "Tina", "Fabian", "Lorenzo", "Imogen", "Daisy", "William", "Christopher" ], "edges": [ [ 0, 7 ], [ 1, 3 ], [ 1, 5 ], [ 1, 9 ], [ 4, 6 ], [ 5, 4 ], [ 6, 2 ], [ 6, 8 ], [ 7, 1 ], [ 10, 17 ], [ 11, 13 ], [ 11, 15 ], [ 11, 19 ], [ 14, 16 ], [ 15, 14 ], [ 16, 12 ], [ 16, 18 ], [ 17, 11 ] ], "start": 0, "target": 6, "neg_target": 16, "graph_type": "random_tree" }, { "question": "Ernest knows Delilah. Ernest knows Abel. Eunice knows Frances. Sara knows Larry. Reid knows Oscar. Reid knows Loretta. Reid knows Edward. Parker knows Reid. Ernest knows Lawson. Lola knows Parker. Ernest knows Adrian. Graeme knows Gage. Frances knows Laura. Loretta knows William. Lawson knows Sara. Gage knows Ernest. Reid knows Eunice. Abel knows Tara. Which of Parker and Gage can Lola reach?", "answer": "Parker", "steps": [ "Lola knows Parker." ], "difficulty": 1, "original_distance": 5, "idx_to_symbol": [ "Lola", "Frances", "Reid", "Laura", "Loretta", "Parker", "Eunice", "Edward", "William", "Oscar", "Graeme", "Sara", "Ernest", "Larry", "Abel", "Gage", "Lawson", "Adrian", "Tara", "Delilah" ], "edges": [ [ 0, 5 ], [ 1, 3 ], [ 2, 6 ], [ 2, 7 ], [ 2, 4 ], [ 2, 9 ], [ 4, 8 ], [ 5, 2 ], [ 6, 1 ], [ 10, 15 ], [ 11, 13 ], [ 12, 16 ], [ 12, 17 ], [ 12, 14 ], [ 12, 19 ], [ 14, 18 ], [ 15, 12 ], [ 16, 11 ] ], "start": 0, "target": 5, "neg_target": 15, "graph_type": "random_tree" }, { "question": "Jeff knows Harrison. Deirdre knows Camille. Joanna knows Marvin. Fergus knows Virginia. Molly knows Melody. Dayton knows Jennifer. Jonathan knows Dayton. Molly knows Dina. Joanna knows Molly. Patrick knows Naomi. Melody knows Ainsley. Naomi knows Pablo. Jeff knows Fergus. Corey knows Deirdre. Molly knows Patrick. Ainsley knows Tina. Fergus knows Corey. Fergus knows Jonathan. Which of Corey and Melody can Jeff reach?", "answer": "Corey", "steps": [ "Jeff knows Fergus.", "Fergus knows Corey." ], "difficulty": 2, "original_distance": 4, "idx_to_symbol": [ "Jeff", "Corey", "Virginia", "Jennifer", "Deirdre", "Camille", "Harrison", "Jonathan", "Fergus", "Dayton", "Joanna", "Melody", "Dina", "Pablo", "Ainsley", "Tina", "Marvin", "Patrick", "Molly", "Naomi" ], "edges": [ [ 0, 6 ], [ 0, 8 ], [ 1, 4 ], [ 4, 5 ], [ 7, 9 ], [ 8, 2 ], [ 8, 1 ], [ 8, 7 ], [ 9, 3 ], [ 10, 16 ], [ 10, 18 ], [ 11, 14 ], [ 14, 15 ], [ 17, 19 ], [ 18, 12 ], [ 18, 11 ], [ 18, 17 ], [ 19, 13 ] ], "start": 0, "target": 1, "neg_target": 11, "graph_type": "random_tree" }, { "question": "Tim knows Susanne. Emery knows Dawn. Susanne knows Franklin. Susanne knows Odette. Electra knows Philip. Arlene knows Carmen. Jasper knows Emery. Barbara knows Emanuel. Gladys knows Nelson. Electra knows Bart. Arlene knows Jasper. Odette knows Barbara. Carmen knows Electra. Franklin knows Steve. Steve knows Mia. Ivy knows Tim. Nelson knows Arlene. Barbara knows Jakob. Which of Franklin and Jasper can Gladys reach?", "answer": "Jasper", "steps": [ "Gladys knows Nelson.", "Nelson knows Arlene.", "Arlene knows Jasper." ], "difficulty": 3, "original_distance": 5, "idx_to_symbol": [ "Gladys", "Philip", "Carmen", "Electra", "Dawn", "Arlene", "Emery", "Bart", "Nelson", "Jasper", "Ivy", "Jakob", "Odette", "Barbara", "Mia", "Susanne", "Steve", "Emanuel", "Tim", "Franklin" ], "edges": [ [ 0, 8 ], [ 2, 3 ], [ 3, 1 ], [ 3, 7 ], [ 5, 2 ], [ 5, 9 ], [ 6, 4 ], [ 8, 5 ], [ 9, 6 ], [ 10, 18 ], [ 12, 13 ], [ 13, 11 ], [ 13, 17 ], [ 15, 12 ], [ 15, 19 ], [ 16, 14 ], [ 18, 15 ], [ 19, 16 ] ], "start": 0, "target": 9, "neg_target": 19, "graph_type": "random_tree" }, { "question": "Oscar knows Marcia. Judy knows Otto. Julie knows Fraser. Lorraine knows Colette. Gunnar knows Oscar. Derek knows Nora. Gunnar knows Derek. Lorraine knows Morgan. Julie knows Brooke. Electra knows Blake. Monica knows Lorraine. Derek knows Sydney. Judy knows Cooper. Blake knows Porter. Electra knows Julie. Sydney knows Monica. Brooke knows Joan. Joan knows Judy. Which of Judy and Lorraine can Electra reach?", "answer": "Judy", "steps": [ "Electra knows Julie.", "Julie knows Brooke.", "Brooke knows Joan.", "Joan knows Judy." ], "difficulty": 4, "original_distance": 5, "idx_to_symbol": [ "Electra", "Fraser", "Brooke", "Judy", "Blake", "Porter", "Otto", "Julie", "Joan", "Cooper", "Gunnar", "Nora", "Sydney", "Lorraine", "Oscar", "Marcia", "Colette", "Derek", "Monica", "Morgan" ], "edges": [ [ 0, 4 ], [ 0, 7 ], [ 2, 8 ], [ 3, 6 ], [ 3, 9 ], [ 4, 5 ], [ 7, 1 ], [ 7, 2 ], [ 8, 3 ], [ 10, 14 ], [ 10, 17 ], [ 12, 18 ], [ 13, 16 ], [ 13, 19 ], [ 14, 15 ], [ 17, 11 ], [ 17, 12 ], [ 18, 13 ] ], "start": 0, "target": 3, "neg_target": 13, "graph_type": "random_tree" } ]