From -2203104882549199381 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: f78e5,bc7f33e526b0f946,start X-Google-Attributes: gidf78e5,public X-Google-ArrivalTime: 1995-03-29 20:42:38 PST Path: nntp.gmd.de!Germany.EU.net!howland.reston.ans.net!ix.netcom.com!netnews From: mcorcora@ix.netcom.com (Marian Corcoran) Newsgroups: comp.std.c++ Subject: Re: Solving Karnaugh Maps with C++ Date: 30 Mar 1995 04:42:38 GMT Organization: Netcom Lines: 33 Distribution: world Message-ID: <3ldcru$lcn@ixnews4.ix.netcom.com> References: <3l08rl$753@newsbf02.news.aol.com> <3l0eps$shp@nova.umuc.edu> <3l0f0g$shp@nova.umuc.edu> <3ld83c$j4p@ixnews4.ix.netcom.com> NNTP-Posting-Host: ix-sj16-19.ix.netcom.com > >In <3l0f0g$shp@nova.umuc.edu> COATES@EUROPA.UMUC.EDU (Ell) writes: > >> >>In <3l08rl$753@newsbf02.news.aol.com> ruthifren@aol.com writes: >> >>> Karnaugh maps are kind of a visual, intuitive implementation of the >>> same basics that underlie the Quine-Mclkesky (sp?) procedure for >>> minimization.. The Quine-Mclesky procedure is more suited to >>>translation into algorithms. There is pseudocode in almost every >>>digital design book for quine-mclesky. check it out >>> ___________________________________________________________ >>> Jon Gamble: lowly CS student UAH >> >>Karnaugh maps transform a set of logical input values into logical >>output values based on the configuration of the intervening logic >>circuitry. They simplify and transform minterms and maxterms into >>a logical solution. >> >>Elliott >> >> I checked with Maurice Karnaugh and he says he thinks that Jon Gamble is correct. He says one might try to simulate human problem solving behavior and use Karnaugh maps, but he does not recommend it. Actually he expressed the latter in far more humorous terms, but I think you get the idea. mc