{"id":"https://openalex.org/W2082424953","doi":"https://doi.org/10.1080/0899340920030307","title":"Getting More From the Missionary/Cannibal Problem","display_name":"Getting More From the Missionary/Cannibal Problem","publication_year":1992,"publication_date":"1992-01-01","ids":{"openalex":"https://openalex.org/W2082424953","doi":"https://doi.org/10.1080/0899340920030307","mag":"2082424953"},"language":"en","primary_location":{"id":"doi:10.1080/0899340920030307","is_oa":false,"landing_page_url":"https://doi.org/10.1080/0899340920030307","pdf_url":null,"source":{"id":"https://openalex.org/S97147119","display_name":"Computer Science Education","issn_l":"0899-3408","issn":["0899-3408","1744-5175"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computer Science Education","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5008456338","display_name":"Ronald A. Mann","orcid":null},"institutions":[{"id":"https://openalex.org/I4210143137","display_name":"University of Louisville Hospital","ror":"https://ror.org/04sq8k219","country_code":"US","type":"healthcare","lineage":["https://openalex.org/I4210143137"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ronald A. Mann","raw_affiliation_strings":["University of Louisville"],"affiliations":[{"raw_affiliation_string":"University of Louisville","institution_ids":["https://openalex.org/I4210143137"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5008456338"],"corresponding_institution_ids":["https://openalex.org/I4210143137"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.30711462,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"3","issue":"3","first_page":"285","last_page":"296"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10130","display_name":"Mathematics Education and Teaching Techniques","score":0.9204000234603882,"subfield":{"id":"https://openalex.org/subfields/3304","display_name":"Education"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10130","display_name":"Mathematics Education and Teaching Techniques","score":0.9204000234603882,"subfield":{"id":"https://openalex.org/subfields/3304","display_name":"Education"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10533","display_name":"Teaching and Learning Programming","score":0.907800018787384,"subfield":{"id":"https://openalex.org/subfields/1706","display_name":"Computer Science Applications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.7474480271339417},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.721916675567627},{"id":"https://openalex.org/keywords/adjacency-matrix","display_name":"Adjacency matrix","score":0.6791911721229553},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.581467866897583},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5686869621276855},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5407983660697937},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.49510636925697327},{"id":"https://openalex.org/keywords/visualization","display_name":"Visualization","score":0.4895116090774536},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4048405885696411},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.15232890844345093}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.7474480271339417},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.721916675567627},{"id":"https://openalex.org/C180356752","wikidata":"https://www.wikidata.org/wiki/Q727035","display_name":"Adjacency matrix","level":3,"score":0.6791911721229553},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.581467866897583},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5686869621276855},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5407983660697937},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.49510636925697327},{"id":"https://openalex.org/C36464697","wikidata":"https://www.wikidata.org/wiki/Q451553","display_name":"Visualization","level":2,"score":0.4895116090774536},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4048405885696411},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.15232890844345093}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/0899340920030307","is_oa":false,"landing_page_url":"https://doi.org/10.1080/0899340920030307","pdf_url":null,"source":{"id":"https://openalex.org/S97147119","display_name":"Computer Science Education","issn_l":"0899-3408","issn":["0899-3408","1744-5175"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computer Science Education","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/4","score":0.5600000023841858,"display_name":"Quality Education"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W276915140","https://openalex.org/W1493663459","https://openalex.org/W1581366099","https://openalex.org/W2038218207","https://openalex.org/W2131520551","https://openalex.org/W2153120691","https://openalex.org/W2400908863","https://openalex.org/W3111901986"],"related_works":["https://openalex.org/W4377019474","https://openalex.org/W2602709848","https://openalex.org/W4281939267","https://openalex.org/W3209137076","https://openalex.org/W4223969905","https://openalex.org/W2374560440","https://openalex.org/W2079771573","https://openalex.org/W1490490684","https://openalex.org/W2998460306","https://openalex.org/W2038143369"],"abstract_inverted_index":{"The":[0,53,97],"missionary/cannibal":[1],"type":[2],"of":[3,42,48,55,65,113],"problem":[4,25,78,98],"is":[5,26,70,83,99],"a":[6,32],"pedagogical":[7],"tour\u2010de\u2010force":[8],"for":[9],"the":[10,24,43,63,66,74,77,104,110],"discrete":[11],"mathematics":[12],"course.":[13],"In":[14],"its":[15],"standard":[16],"form":[17],"involving":[18],"two":[19,22],"missionaries":[20,94],"and":[21,95,109],"cannibals,":[23],"modeled":[27],"by":[28,40,46,61],"an":[29],"automaton":[30],"having":[31],"bipartite":[33],"state":[34],"graph.":[35],"Solutions":[36],"can":[37,58],"be":[38,59],"obtained":[39,60],"visualization":[41],"graph":[44],"or":[45],"use":[47],"Dijkstra's":[49],"shortest":[50],"path":[51],"algorithm.":[52],"number":[54],"distinct":[56],"solutions":[57,87],"examining":[62],"powers":[64],"adjacency":[67],"matrix.":[68],"It":[69],"instructive":[71],"to":[72],"show":[73],"student":[75,105],"that":[76,82,106],"does":[79],"not":[80],"scale\u2010up,":[81],"there":[84,89],"are":[85,90,116],"no":[86],"when":[88],"more":[91],"than":[92],"three":[93],"cannibals.":[96],"particularly":[100],"beneficial":[101],"in":[102],"convincing":[103],"existence":[107],"theorems":[108],"proper":[111],"application":[112],"inductive":[114],"principles":[115],"important.":[117]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}