Applying Retrograde Analysis to Nine Men's Morris. 1. Introduction
|
|
- Briana Harrington
- 6 years ago
- Views:
Transcription
1 Applyin Rtror Anlysis to Nin Mn's Morris Rlph Gssr Inormtik ETH 809 Zürih Switzrln Astrt This ppr prsnts rsults in throuh rtror nlysis o Nin Mn's Morris. First, I sri som o th mthos mploy to lrt th lultions, or xmpl runlnth noin o th tss. Son, th rsults thmslvs r xmin. Whil mny humn plyrs intuitivly rr Nin Mn's Morris s rthr simpl, rwn m, my rsults sm to sust othrwis. Som o th optiml ply is lrly yon humn ility, somtims rquirin ovr 0 plis o sminly rnom movs or win is rh.. Introution Work on this sujt oriinlly volv rom my Nin Mn's Morris prorm [Gssr 90]. Du to th irnt phss o th m, it ws vint tht th mim vlution untion lon ws insuiint. It ws prtiulrly unsuit urin th nm. Inst o imprtly tunin th vlution untion to ths ss, I i to solv th prolm y xhustivly nlyzin rtin nm positions. Rtror nlysis is thniqu whih hs om quit populr rntly or solvin suh xhustiv nlysis prolms. It is muh ppli to hss, whr som intrstin n unsuspt rsults hv turn up. For summry s [Hrik 8]. Som o ths rsults hv or FIDE, th Intrntionl Chss Frtion, to hn thir ruls [Hrik 89]. Althouh mny popl hv lry work on rtror nlysis, it sms to m tht th mploy lorithms still hv th potntil or improvmnt. Som improvmnts will rthr prolm spii, whil othrs my hv ror pplition. Alon ths lins, rtror nlysis or Nin Mn's Morris ws implmnt. I will xplin how run-lnth omprssion ws us to sp up th pross n isuss othr mor prolm pnnt onsirtions. Atrwrs, th rsults in or Nin Mn's Morris r prsnt. Althouh ths rsults o not yt hv ny inlun on th qustion o whthr th omplt m o Nin Mn's Morris is rw or not, thy o sust tht Nin Mn's Morris is muh rihr in possiilitis thn most humn plyrs suspt. Prtiulrly th sum whr oth plyrs hv only stons on th or is hrly vr (0.%) rw, ut or humns, inin win is xtrmly iiult.
2 . Nin Mn's Morris Nin Mn's Morris is ply on or with points whr stons my pl (Fi.). Initilly th or is mpty n h o th two plyrs rivs nin stons. Th plyr with th whit stons strts. Th m onsists o thr phss: opnin phs mim phs nm phs Durin th opnin phs, plyrs ltrntly pl thir stons on ny vnt point. Atr ll stons hv n pl, th or miht look s in Fi.. Now ply pros to th mim phs. Hr plyr my sli ny on o his stons to n jnt vnt point. I t ny tim urin th m, plyr sus in rrnin thr o his stons in row, lso ll "losin mill", h must rmov n opponnt's ston. Any ston whih is not likwis prt o mill my rmov. I ll th opponnt's stons r prt o mills, ny ston my rmov. In Fi., Whit hs just ply to (opnin phs) n n now rmov Blk's ston on, ut not th on on. Fi. Th mpty or Fi. Atr th opnin phs As soon s t lst on plyr hs only thr stons lt, w pro to th nm phs. Whn it is his turn, th plyr with thr stons my tk on o his stons n jump to ny vnt point on th or. I h loss mill, h my, s usul, rmov n opponnt's ston. Th m ns in th ollowin wys: Th irst plyr who hs lss thn thr stons loss. Th irst plyr who nnot mk ll mov loss (Fi. ). I rptition o position ours, th m is rw. Fi. Whit movs to Eithr or is rmov Fi. Blk to mov No ll movs vill
3 .. Wht is rtror nlysis?. Rtror Anlysis Th xprssion "rtror nlysis" is us xtnsivly in omputr hss irls, whr it stns or mtho o lultion whih ins th optiml ply or ll possil or positions in spii nm. In omputr sin, th somwht nloous trm "ynmi prormmin" is otn us. Th hrtristi o this mtho is tht kwr lultion is prorm. On strts with ll positions tht r immit wins or losss. From ths, ll won or lost positions in ply n lult n thn with ll ths positions, th positions tht r won or lost in plis t. Thr r two min rsons or pplyin this mtho to Nin Mn's Morris. First, it sms possil tht nw insihts into th mtho miht in tht r not s sily visil usin hss. Son, Nin Mn's Morris is onsirly lss omplx thn hss. This smllr omin ttrt m, us in th lon run thr is hn o solvin th m ompltly... Stnr rtror nlysis Rtror nlysis is omplish y th ollowin thr prours: Initiliztion Loss kup Win kup Th initiliztion loop os throuh ll ors n intiis trminl positions, whr on plyr hs ithr won or lost. In Nin Mn's Morris ths trminl position r ithr positions whr th plyr to mov is lok n thror loss (Fi. ) or positions whr th plyr to mov n los mill n thry ru his opponnt to lss thn thr stons. Th loss kup prour srhs or ll positions in whih th plyr to mov hs lost in spii numr o plis. For ths positions ll ll prssor positions r nrt. All o ths prssor positions r wins. Whit to mov Nwly intii won position Blk to mov Lost position
4 Th win kup prour is th most prossin intnsiv. First, th won positions or spii ply-pth r intii, n thir prssor positions nrt. For prssor position to loss, ll o its possil sussor positions must wins. Blk to mov Nwly intii lost position Whit to mov Won position Whit to mov Won position Rtror nlysis is omplish y rptly pplyin th loss n win kup prours to ll or positions. Th lorithm trmints whn no nw wins or losss r intii.. Possil Improvmnts This stion ls with possil improvmnts to th stnr mtho sri ov. Thy r not ll qully pplil to othr ms or othr hrwr oniurtions, ut wr spiilly tilor to Nin Mn's Morris n th Appl Mintosh's oprtin systm.... Initiliztion In th lst stion, w sw tht th irst stp in rtror nlysis is to initiliz ll th immit won/lost position. As irst pproh this n solv y lookin t vry possil or position n trminin i it is won or lost. Th ost o oin this initiliztion n hih prnt o th totl run-tim o rtror nlysis, spilly i most positions r rws (i.. th win n loss kup loops on't rquir muh tim). An xmpl o suh sitution ours in th - sum o Nin Mn's Morris whr only 88 o th ''9 positions r non-rws. To in n ltrntiv, lt's tk look t spii st o our inst our positions. Fi. shows possil oniurtion o our whit stons. Thr r 8 possil wys o plin th our lk stons. I it is Whit's turn to mov w woul normlly lult ll 8 possil positions n or h o thm tst i Whit is lok. Thr is str wy howvr. Fi. shows tht w n t lst 9 lk stons to rnr ll th whit stons immoil, thror non o th lk ston oniurtions n lok th our whit stons. A similr pross n us whn it is Blk's turn to mov. In Fi. w s how th our whit stons prtition th or into rs. Th rs ontin, n mpty squrs. It is thror possil to pl,,,,8,9 or 0 lk stons so tht thy hv no jnt n vnt squrs, i.. thy r lok. But thr is no wy or Whit's stons to lok our lk stons. So on in, w n rpily trmin tht non o th 8 lk oniurtions rsult in Blk in lok.
5 Fi. Whit ston oniurtion Fi. Minimum mount o lk stons n to lok Whit Fi. Whit nnot lok lk stons This mtho o lookin t multitu o similr positions simultnously is mittly rthr prolm pnnt. But th min i n proly otn us in on orm or othr. It is rtinly lso pplil to hss. For instn, tr plin ll pis o on olor, on n trmin sust o th opponnt's possil kin positions, so tht mt n only our y plin th kin on position in this sust.... Win kup In th stnr win kup prour, w o throuh ll ors intiyin th positions whih win in spii numr o plis. For h o ths, w nrt thir possil prssor positions. For vry prssor position whih hs not yt n intii s win or loss w nrt its sussor positions. I ll th sussor positions r wins, w hv nwly intii loss. Th omplxity o this lultion is : O ( #Wins * #AvPr * #AvSu ) whr # Wins : numr o winnin positions in spii numr o plis # AvPr : vr numr o prssor positions # AvSu : vr numr o sussor positions Thr is nothr wy o hivin th sm rsult. Inst o strtin with th won positions, kin thm up n hkin i thy r so r unintii, w n simply o throuh th il srhin or unintii positions. For ll ths positions w thn prorm th sm hk with thir sussor positions. Doin th win kup this wy rsults in th ollowin omplxity: O ( #Unintii * #AvSu ) Rouhly spkin, this susts tht th son mtho is str i #Win * #AvPr > #Unintii. In Nin Mn's Morris suh situtions n our. For xmpl in th - sum w hv som 0 million positions n th numr o wins in plis is out 900'000. Sin #AvPr is out 0 it is justii to intiy th losss in plis usin th son mtho.... Run-lnth noin My lultions wr on on n Appl Mintosh, whih ws lso us or othr tsks, so tht only 0-0 MByts o hr isk stor pity ws vill. Thror lultin tss with 0 million positions (with yt pr position to irntit twn plis) wsn't possil without som sort o t omprssion. Run-lnth omprssion sms irly wll suit to Nin Mn's Morris, us thr r mny rwn positions whih n stronly omprss. I lso tri to trnslt 'similr' or positions to jnt il positions. Hr 'similr' ors r thos whih rquir n intil numr o plis until th m ns. I this n on, run-lnth omprssion is mor tiv.
6 Stnr run-lnth noin trnsorms squn o intil vlus into only on opy o th vlu plus th lnth o th squn. It nrts lr svins or lon squns, ut or short squns (or xmpl squn lnth o on) it my tully us mor mmory. Exminin th Nin Mn's Morris tss show tht thr wr mny irly short squns n lso tht rtin vlus (thos orrsponin to low ply numrs) wr mor rqunt. Cominin run-lnth noin with vril lnth noin miht thror oo i. Ths is l to th oin shm isply low. Vlu Ino Lnth Ino X Vlu 0 Lnth X Vlu - 0 Lnth Lnth This is silly run-lnth noin, ut sin most positions will ithr rwn or won/lost in smll numr o plis, ths mor rqunt vlus r stor usin only on yt. Svn its r us to stor rws n wins/losss rom 0 to plis. For up to 8 plis son yt is us. Sin thr r mny runs o lnth on, it in th vlu ino (it X) ws us to init run-lnth o on. I th run-lnth is rtr thn on, on yt is us or run-lnths rom 0-. Two yts or 0-'8 n our yts or vn lonr runs. This o hs rtin runny, ut hs prov suiint. Blow th rsultin omprssion tors r list or th lult sums. A sum is hrtriz y th numr o stons on th or, i.. th - sum hs stons o on olor n o th othr. Sum Unomprss Fil Siz Comprss Fil Siz Comprssion tor - 0'0 89'80. - ''90 9' ''.8 - '8'0 8'. - '98'0 ' '9'8 9'.0 - '90'0 9'.8 - '9'880 ''8. Run-lnth noin hs prviously n sust or omprssin th inl tss [Mrris 89]. As r s I m wr, no prvious ttmpts wr m to prorm rtror nlysis usin omprss t. Any tim urin rtror nlysis whn w prorm squntil srh throuh th il, or xmpl whn w n ll or positions with ivn vlu, run-lnth omprssion sps our srh us th il is smllr. A prolm only ours whn w n th vlu o spii or position. Whn usin unomprss tss, w know xtly t whih position th vlu n oun. Usin run-lnth omprssion, w must silly srh throuh th whol il until w rh th rquir position. By usin n inx whih points into th omprss il t numrous pls w n sp this up. With this inx, w n rstrit th squntil srh to smllr prt o th il. I th omprssion tor is lr nouh, this squntil srh n still str thn usin unomprss t, us lrr prt o th il n hl in th mmory h, limintin slow isk sss. Anothr t to kp in min is tht th omprss il siz is smll t th innin o rtror nlysis n rows lrr th mor nw positions w intiy. This mns tht or smll ply-pths, whn most nw positions will oun, w still hv smll il i.. st ss. Whn th omprss il rows lrr with inrsin ply-pth, th numr o positions tht w hv to hk usully rows smllr, so tht st ss rows lss ritil.
7 . Rsults Th ollowin rsults wr ll otin usin Mintosh IIx with 8 MByts o mmory. Th run-tims vri rom w minuts (- sum) to wks (- sum). Mor xt timin is not vill us this prorm ws only run whn th omputr ws not othrwis us. For h ts, som ri sttistis lon with n xmpl o on o th most iiult positions r ivn. Whn thr is mor thn on optiml mov, th ltrntivs r innt. Th trminoloy is s ollows: A W-B sum inlus ll or positions whr thr r W whit stons n B lk stons i.. th - sum ompriss ll positions with whit stons n lk stons. Th positions with lk n whit stons n trnsorm to - positions y swithin ston olors. A position is ll 'won' i th plyr to mov n win, likwis or losss. Th 'Mx Win Ply' n 'Mx Loss Ply' olumns iv th lonst winnin or losin squn or position in th sum. Plyin this squn n rsult in losin mills n ntrin irnt sums. 'Mx Win Ply' n 'Mx Loss Ply' msur th numr o plis until win/loss is inlly rh n not th numr o plis until th sum hns. Ths rsults isprov mny sttmnts oun in [Müllr 8]. It sms tht humns r not spilly oo t ths omintoril ms... - Sum This ws th irst sum to xmin n to t it is lso th most intrstin, i.. th prnt o rws is xtrmly low (out 0.%). This ontrits humn intuition, whih susts tht th - sum is lmost lwys ti. # Wins # Drws # Losss Mx Win Ply Mx Loss Ply Whit To Mov ' 9 9'9 An xmpl o win position in plis is shown low lon with possil winnin squn: Whit to mov win in plis.. - Sum This sum is somwht lss intrstin thn -, ut w n still in som nw insihts rom this ts. First, osrv tht th plyr with stons hs mximum win ply o i.. h n only win i it's his turn n h hs n opn mill, rthr ptholoil s whih proly won't our urin tul m plyin. Son, i it's Blk's ( stons) turn, h n't
8 los! Oviously th itionl moility in y hvin th ility to jump (i.. stons lt) is quit vlul. # Wins # Drws # Losss Mx Win Ply Mx Loss Ply Whit To Mov '9 8'90 '09 Blk To Mov 0'8 8' 0 - An xmpl o win position in plis is shown low lon with possil winnin squn: Whit to mov win in plis.. - Sum This is rthr orin sum. Thr r hrly ny winnin positions (out 0.00%) n vn wr losin positions. But th wins tht n rh r o irnt ntur thn or. Wins r not hiv y rmovin n opponnt's ston, ut rthr y lokin his pis. # Wins # Drws # Losss Mx Win Ply Mx Loss Ply Whit To Mov 9 '' Th ollowin xmpl shows tht vn th lonst winnin squns r sily roniz y humn.
9 Whit to mov win in 9 plis.. - Sum Th - sum is similr to th - sum. Th plyr with stons hs mny winnin positions, ut sin thy r t suh shllow pths, it sms unlikly tht thy will rh in tul ply. Th plyr with stons hs intrstin winnin squns, ut thr r so w o thm tht this sum is ssntilly ti. # Wins # Drws # Losss Mx Win Ply Mx Loss Ply Whit To Mov 80'0 '999'0 0 - Blk To Mov '0 '' 9' Th ollowin xmpl shows tht to win this sum, th opponnt must irst ru to stons. This susts mtho o winnin rwn position inst n imprt opponnt: th plyr with stons shoul try to ru his opponnt to stons, us orrt - (or -) ply is mor iiult thn orrt - ply. Whit to mov win in plis
10 .. - Sum Th - sum is lso silly ti. All possil wins r rh y lokin th opponnt. # Wins # Drws # Losss Mx Win Ply Mx Loss Ply Whit To Mov 9'889 0'00' Blk To Mov 0'08'9 '0 8 Whit to mov win in 9 plis.. - Sum Th - sum is similr to th - sum. But thnks to th itionl ston, Whit nnot los. Th possil wins r t shllow pths, ut strnly nouh humns sm to in optiml ply rthr iiult. # Wins # Drws # Losss Mx Win Ply Mx Loss Ply Whit To Mov '' '' Blk To Mov 0 '8'0 9'000 - Whit to mov win in plis
11 .. - Sum All wins r hiv y lokin th opponnt. # Wins # Drws # Losss Mx Win Ply Mx Loss Ply Whit To Mov 8'89 0'88'800 '9 Whit to mov win in plis.8. - Sum This is th sum tht to t hs th lonst winnin squn, nmly plis. Th tsts I hv prorm init tht inin winnin squn is lrly yon humn ility. # Wins # Drws # Losss Mx Win Ply Mx Loss Ply Whit To Mov '98'9 9'80'9 Blk To Mov ''98 '9'9
12 Whit to mov win in plis Unortuntly, th winnin squn is muh too lort to shown hr, ut n otin rom th uthor.. Conlusion On purpos o this work ws to ttr unrstn th ilitis n limittions o rtror nlysis. Usin th improvmnts sri rlir n othr Mintosh spii justmnts, th sp o th rtror lultions ws inrs y mor thn tor 0. Furthr work will ous on nrlizin th xprin in in Nin Mn's Morris to othr pplitions o rtror nlysis. A son, irly lon trm, ol o this work is th omplt nlysis o Nin Mn's Morris. Whthr or not this n hiv in th nr utur pns rt l on th m itsl. I Nin Mn's Morris is rw, thn mny or vn most positions will rws n th runlnth noin shm will prov tiv in oth spin lultions n in ruin mmory sp rquirmnts. At prsnt I sm to pprohin th limits impos y th Mintosh. In th utur I will ithr hv to port my o to str mhin or sp up my lultions. A urthr spup my hiv y not irntitin twn th numr o plis rquir to win, ut rthr to lssiy positions only s wins,losss or rws.. Rrns [Gssr 90] [Hrik 8] [Hrik 89] [Mrris 89] Gssr, R., "Huristi Srh n Rtror Anlysis: thir pplition to Nin Mn's Morris", Diplom thsis, ETH Zürih, Frury 990. vn n Hrik H.J. n Hrshr I.S.,"A t s on t ss", ICCA Journl 9(), p. 9 (Mrh 98). vn n Hrik H.J. n Hrshr I.S.,"Th 0-mov rul rvisit", ICCA Journl (), p. 9 (Sptmr 989). Mrris, C.A.,"Comprssin hss-nm ts", ICCA Journl (), p. (Mrh 989). [Müllr 8] Müllr, R.F., "Mühl", ECON Tshnuh Vrl, Otor 98.
Present state Next state Q + M N
Qustion 1. An M-N lip-lop works s ollows: I MN=00, th nxt stt o th lip lop is 0. I MN=01, th nxt stt o th lip-lop is th sm s th prsnt stt I MN=10, th nxt stt o th lip-lop is th omplmnt o th prsnt stt I
More information, each of which is a tree, and whose roots r 1. , respectively, are children of r. Data Structures & File Management
nrl tr T is init st o on or mor nos suh tht thr is on sint no r, ll th root o T, n th rminin nos r prtition into n isjoint susts T, T,, T n, h o whih is tr, n whos roots r, r,, r n, rsptivly, r hilrn o
More information1 Introduction to Modulo 7 Arithmetic
1 Introution to Moulo 7 Arithmti Bor w try our hn t solvin som hr Moulr KnKns, lt s tk los look t on moulr rithmti, mo 7 rithmti. You ll s in this sminr tht rithmti moulo prim is quit irnt rom th ons w
More informationCycles and Simple Cycles. Paths and Simple Paths. Trees. Problem: There is No Completely Standard Terminology!
Outlin Computr Sin 331, Spnnin, n Surphs Mik Joson Dprtmnt o Computr Sin Univrsity o Clry Ltur #30 1 Introution 2 3 Dinition 4 Spnnin 5 6 Mik Joson (Univrsity o Clry) Computr Sin 331 Ltur #30 1 / 20 Mik
More informationOutline. Computer Science 331. Computation of Min-Cost Spanning Trees. Costs of Spanning Trees in Weighted Graphs
Outlin Computr Sin 33 Computtion o Minimum-Cost Spnnin Trs Prim s Mik Joson Dprtmnt o Computr Sin Univrsity o Clry Ltur #34 Introution Min-Cost Spnnin Trs 3 Gnrl Constrution 4 5 Trmintion n Eiiny 6 Aitionl
More informationSeven-Segment Display Driver
7-Smnt Disply Drivr, Ron s in 7-Smnt Disply Drivr, Ron s in Prolm 62. 00 0 0 00 0000 000 00 000 0 000 00 0 00 00 0 0 0 000 00 0 00 BCD Diits in inry Dsin Drivr Loi 4 inputs, 7 outputs 7 mps, h with 6 on
More informationOutline. 1 Introduction. 2 Min-Cost Spanning Trees. 4 Example
Outlin Computr Sin 33 Computtion o Minimum-Cost Spnnin Trs Prim's Alorithm Introution Mik Joson Dprtmnt o Computr Sin Univrsity o Clry Ltur #33 3 Alorithm Gnrl Constrution Mik Joson (Univrsity o Clry)
More informationECE COMBINATIONAL BUILDING BLOCKS - INVEST 13 DECODERS AND ENCODERS
C 24 - COMBINATIONAL BUILDING BLOCKS - INVST 3 DCODS AND NCODS FALL 23 AP FLZ To o "wll" on this invstition you must not only t th riht nswrs ut must lso o nt, omplt n onis writups tht mk ovious wht h
More informationAn undirected graph G = (V, E) V a set of vertices E a set of unordered edges (v,w) where v, w in V
Unirt Grphs An unirt grph G = (V, E) V st o vrtis E st o unorr gs (v,w) whr v, w in V USE: to mol symmtri rltionships twn ntitis vrtis v n w r jnt i thr is n g (v,w) [or (w,v)] th g (v,w) is inint upon
More information# 1 ' 10 ' 100. Decimal point = 4 hundred. = 6 tens (or sixty) = 5 ones (or five) = 2 tenths. = 7 hundredths.
How os it work? Pl vlu o imls rprsnt prts o whol numr or ojt # 0 000 Tns o thousns # 000 # 00 Thousns Hunrs Tns Ons # 0 Diml point st iml pl: ' 0 # 0 on tnth n iml pl: ' 0 # 00 on hunrth r iml pl: ' 0
More informationCSE 373: AVL trees. Warmup: Warmup. Interlude: Exploring the balance invariant. AVL Trees: Invariants. AVL tree invariants review
rmup CSE 7: AVL trs rmup: ht is n invrint? Mihl L Friy, Jn 9, 0 ht r th AVL tr invrints, xtly? Disuss with your nighor. AVL Trs: Invrints Intrlu: Exploring th ln invrint Cor i: xtr invrint to BSTs tht
More informationConstructive Geometric Constraint Solving
Construtiv Gomtri Constrint Solving Antoni Soto i Rir Dprtmnt Llngutgs i Sistms Inormàtis Univrsitt Politèni Ctluny Brlon, Sptmr 2002 CGCS p.1/37 Prliminris CGCS p.2/37 Gomtri onstrint prolm C 2 D L BC
More informationEE1000 Project 4 Digital Volt Meter
Ovrviw EE1000 Projt 4 Diitl Volt Mtr In this projt, w mk vi tht n msur volts in th rn o 0 to 4 Volts with on iit o ury. Th input is n nlo volt n th output is sinl 7-smnt iit tht tlls us wht tht input s
More informationCSE 373. Graphs 1: Concepts, Depth/Breadth-First Search reading: Weiss Ch. 9. slides created by Marty Stepp
CSE 373 Grphs 1: Conpts, Dpth/Brth-First Srh ring: Wiss Ch. 9 slis rt y Mrty Stpp http://www.s.wshington.u/373/ Univrsity o Wshington, ll rights rsrv. 1 Wht is grph? 56 Tokyo Sttl Soul 128 16 30 181 140
More informationCSE 373: More on graphs; DFS and BFS. Michael Lee Wednesday, Feb 14, 2018
CSE 373: Mor on grphs; DFS n BFS Mihl L Wnsy, F 14, 2018 1 Wrmup Wrmup: Disuss with your nighor: Rmin your nighor: wht is simpl grph? Suppos w hv simpl, irt grph with x nos. Wht is th mximum numr of gs
More informationPlanar Upward Drawings
C.S. 252 Pro. Rorto Tmssi Computtionl Gomtry Sm. II, 1992 1993 Dt: My 3, 1993 Sri: Shmsi Moussvi Plnr Upwr Drwings 1 Thorm: G is yli i n only i it hs upwr rwing. Proo: 1. An upwr rwing is yli. Follow th
More information(2) If we multiplied a row of B by λ, then the value is also multiplied by λ(here lambda could be 0). namely
. DETERMINANT.. Dtrminnt. Introution:I you think row vtor o mtrix s oorint o vtors in sp, thn th gomtri mning o th rnk o th mtrix is th imnsion o th prlllppi spnn y thm. But w r not only r out th imnsion,
More informationCS September 2018
Loil los Distriut Systms 06. Loil los Assin squn numrs to msss All ooprtin prosss n r on orr o vnts vs. physil los: rport tim o y Assum no ntrl tim sour Eh systm mintins its own lol lo No totl orrin o
More informationModule graph.py. 1 Introduction. 2 Graph basics. 3 Module graph.py. 3.1 Objects. CS 231 Naomi Nishimura
Moul grph.py CS 231 Nomi Nishimur 1 Introution Just lik th Python list n th Python itionry provi wys of storing, ssing, n moifying t, grph n viw s wy of storing, ssing, n moifying t. Bus Python os not
More informationQUESTIONS BEGIN HERE!
Points miss: Stunt's Nm: Totl sor: /100 points Est Tnnss Stt Univrsity Dprtmnt o Computr n Inormtion Sins CSCI 2710 (Trno) Disrt Struturs TEST or Sprin Smstr, 2005 R this or strtin! This tst is los ook
More informationThe University of Sydney MATH2969/2069. Graph Theory Tutorial 5 (Week 12) Solutions 2008
Th Univrsity o Syny MATH2969/2069 Grph Thory Tutoril 5 (Wk 12) Solutions 2008 1. (i) Lt G th isonnt plnr grph shown. Drw its ul G, n th ul o th ul (G ). (ii) Show tht i G is isonnt plnr grph, thn G is
More informationMultipoint Alternate Marking method for passive and hybrid performance monitoring
Multipoint Altrnt Mrkin mtho or pssiv n hyri prormn monitorin rt-iool-ippm-multipoint-lt-mrk-00 Pru, Jul 2017, IETF 99 Giuspp Fiool (Tlom Itli) Muro Coilio (Tlom Itli) Amo Spio (Politnio i Torino) Riro
More informationPaths. Connectivity. Euler and Hamilton Paths. Planar graphs.
Pths.. Eulr n Hmilton Pths.. Pth D. A pth rom s to t is squn o gs {x 0, x 1 }, {x 1, x 2 },... {x n 1, x n }, whr x 0 = s, n x n = t. D. Th lngth o pth is th numr o gs in it. {, } {, } {, } {, } {, } {,
More informationDesigning A Concrete Arch Bridge
This is th mous Shwnh ri in Switzrln, sin y Rort Millrt in 1933. It spns 37.4 mtrs (122 t) n ws sin usin th sm rphil mths tht will monstrt in this lsson. To pro with this lsson, lik on th Nxt utton hr
More information12. Traffic engineering
lt2.ppt S-38. Introution to Tltrffi Thory Spring 200 2 Topology Pths A tlommunition ntwork onsists of nos n links Lt N not th st of nos in with n Lt J not th st of nos in with j N = {,,,,} J = {,2,3,,2}
More informationDecimals DECIMALS.
Dimls DECIMALS www.mthltis.o.uk ow os it work? Solutions Dimls P qustions Pl vlu o imls 0 000 00 000 0 000 00 0 000 00 0 000 00 0 000 tnths or 0 thousnths or 000 hunrths or 00 hunrths or 00 0 tn thousnths
More informationExam 1 Solution. CS 542 Advanced Data Structures and Algorithms 2/14/2013
CS Avn Dt Struturs n Algorithms Exm Solution Jon Turnr //. ( points) Suppos you r givn grph G=(V,E) with g wights w() n minimum spnning tr T o G. Now, suppos nw g {u,v} is to G. Dsri (in wors) mtho or
More informationQUESTIONS BEGIN HERE!
Points miss: Stunt's Nm: Totl sor: /100 points Est Tnnss Stt Univrsity Dprtmnt of Computr n Informtion Sins CSCI 710 (Trnoff) Disrt Struturs TEST for Fll Smstr, 00 R this for strtin! This tst is los ook
More informationDUET WITH DIAMONDS COLOR SHIFTING BRACELET By Leslie Rogalski
Dut with Dimons Brlt DUET WITH DIAMONDS COLOR SHIFTING BRACELET By Lsli Roglski Photo y Anrw Wirth Supruo DUETS TM from BSmith rt olor shifting fft tht mks your work tk on lif of its own s you mov! This
More informationCOMPLEXITY OF COUNTING PLANAR TILINGS BY TWO BARS
OMPLXITY O OUNTING PLNR TILINGS Y TWO RS KYL MYR strt. W show tht th prolm o trmining th numr o wys o tiling plnr igur with horizontl n vrtil r is #P-omplt. W uil o o th rsults o uquir, Nivt, Rmil, n Roson
More informationProblem solving by search
Prolm solving y srh Tomáš voo Dprtmnt o Cyrntis, Vision or Roots n Autonomous ystms Mrh 5, 208 / 3 Outlin rh prolm. tt sp grphs. rh trs. trtgis, whih tr rnhs to hoos? trtgy/algorithm proprtis? Progrmming
More informationWhy the Junction Tree Algorithm? The Junction Tree Algorithm. Clique Potential Representation. Overview. Chris Williams 1.
Why th Juntion Tr lgorithm? Th Juntion Tr lgorithm hris Willims 1 Shool of Informtis, Univrsity of Einurgh Otor 2009 Th JT is gnrl-purpos lgorithm for omputing (onitionl) mrginls on grphs. It os this y
More informationV={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)}
Introution Computr Sin & Enginring 423/823 Dsign n Anlysis of Algorithms Ltur 03 Elmntry Grph Algorithms (Chptr 22) Stphn Sott (Apt from Vinohnrn N. Vriym) I Grphs r strt t typs tht r pplil to numrous
More informationS i m p l i f y i n g A l g e b r a SIMPLIFYING ALGEBRA.
S i m p l i y i n g A l g r SIMPLIFYING ALGEBRA www.mthltis.o.nz Simpliying SIMPLIFYING Algr ALGEBRA Algr is mthmtis with mor thn just numrs. Numrs hv ix vlu, ut lgr introus vrils whos vlus n hng. Ths
More informationMath 61 : Discrete Structures Final Exam Instructor: Ciprian Manolescu. You have 180 minutes.
Nm: UCA ID Numr: Stion lttr: th 61 : Disrt Struturs Finl Exm Instrutor: Ciprin nolsu You hv 180 minuts. No ooks, nots or lultors r llow. Do not us your own srth ppr. 1. (2 points h) Tru/Fls: Cirl th right
More information5/1/2018. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees
/1/018 W usully no strns y ssnn -lnt os to ll rtrs n t lpt (or mpl, 8-t on n ASCII). Howvr, rnt rtrs our wt rnt rquns, w n sv mmory n ru trnsmttl tm y usn vrl-lnt non. T s to ssn sortr os to rtrs tt our
More informationCSC Design and Analysis of Algorithms. Example: Change-Making Problem
CSC 801- Dsign n Anlysis of Algorithms Ltur 11 Gry Thniqu Exmpl: Chng-Mking Prolm Givn unlimit mounts of oins of nomintions 1 > > m, giv hng for mount n with th lst numr of oins Exmpl: 1 = 25, 2 =10, =
More information5/7/13. Part 10. Graphs. Theorem Theorem Graphs Describing Precedence. Outline. Theorem 10-1: The Handshaking Theorem
Thorm 10-1: Th Hnshkin Thorm Lt G=(V,E) n unirt rph. Thn Prt 10. Grphs CS 200 Alorithms n Dt Struturs v V (v) = 2 E How mny s r thr in rph with 10 vrtis h of r six? 10 * 6 /2= 30 1 Thorm 10-2 An unirt
More informationGraph Isomorphism. Graphs - II. Cayley s Formula. Planar Graphs. Outline. Is K 5 planar? The number of labeled trees on n nodes is n n-2
Grt Thortil Is In Computr Sin Vitor Amhik CS 15-251 Ltur 9 Grphs - II Crngi Mllon Univrsity Grph Isomorphism finition. Two simpl grphs G n H r isomorphi G H if thr is vrtx ijtion V H ->V G tht prsrvs jny
More informationMAT3707. Tutorial letter 201/1/2017 DISCRETE MATHEMATICS: COMBINATORICS. Semester 1. Department of Mathematical Sciences MAT3707/201/1/2017
MAT3707/201/1/2017 Tutoril lttr 201/1/2017 DISCRETE MATHEMATICS: COMBINATORICS MAT3707 Smstr 1 Dprtmnt o Mtmtil Sins SOLUTIONS TO ASSIGNMENT 01 BARCODE Din tomorrow. univrsity o sout ri SOLUTIONS TO ASSIGNMENT
More informationV={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)}
s s of s Computr Sin & Enginring 423/823 Dsign n Anlysis of Ltur 03 (Chptr 22) Stphn Sott (Apt from Vinohnrn N. Vriym) s of s s r strt t typs tht r pplil to numrous prolms Cn ptur ntitis, rltionships twn
More informationUsing the Printable Sticker Function. Using the Edit Screen. Computer. Tablet. ScanNCutCanvas
SnNCutCnvs Using th Printl Stikr Funtion On-o--kin stikrs n sily rt y using your inkjt printr n th Dirt Cut untion o th SnNCut mhin. For inormtion on si oprtions o th SnNCutCnvs, rr to th Hlp. To viw th
More informationAlgorithmic and NP-Completeness Aspects of a Total Lict Domination Number of a Graph
Intrntionl J.Mth. Comin. Vol.1(2014), 80-86 Algorithmi n NP-Compltnss Aspts of Totl Lit Domintion Numr of Grph Girish.V.R. (PES Institut of Thnology(South Cmpus), Bnglor, Krntk Stt, Ini) P.Ush (Dprtmnt
More informationCS 241 Analysis of Algorithms
CS 241 Anlysis o Algorithms Prossor Eri Aron Ltur T Th 9:00m Ltur Mting Lotion: OLB 205 Businss HW6 u lry HW7 out tr Thnksgiving Ring: Ch. 22.1-22.3 1 Grphs (S S. B.4) Grphs ommonly rprsnt onntions mong
More information0.1. Exercise 1: the distances between four points in a graph
Mth 707 Spring 2017 (Drij Grinrg): mitrm 3 pg 1 Mth 707 Spring 2017 (Drij Grinrg): mitrm 3 u: W, 3 My 2017, in lss or y mil (grinr@umn.u) or lss S th wsit or rlvnt mtril. Rsults provn in th nots, or in
More informationCS 461, Lecture 17. Today s Outline. Example Run
Prim s Algorithm CS 461, Ltur 17 Jr Si Univrsity o Nw Mxio In Prim s lgorithm, th st A mintin y th lgorithm orms singl tr. Th tr strts rom n ritrry root vrtx n grows until it spns ll th vrtis in V At h
More informationComplete Solutions for MATH 3012 Quiz 2, October 25, 2011, WTT
Complt Solutions or MATH 012 Quiz 2, Otor 25, 2011, WTT Not. T nswrs ivn r r mor omplt tn is xpt on n tul xm. It is intn tt t mor omprnsiv solutions prsnt r will vlul to stunts in stuyin or t inl xm. In
More information16.unified Introduction to Computers and Programming. SOLUTIONS to Examination 4/30/04 9:05am - 10:00am
16.unii Introution to Computrs n Prormmin SOLUTIONS to Exmintion /30/0 9:05m - 10:00m Pro. I. Kristin Lunqvist Sprin 00 Grin Stion: Qustion 1 (5) Qustion (15) Qustion 3 (10) Qustion (35) Qustion 5 (10)
More informationd e c b a d c b a d e c b a a c a d c c e b
FLAT PEYOTE STITCH Bin y mkin stoppr -- sw trou n pull it lon t tr until it is out 6 rom t n. Sw trou t in witout splittin t tr. You soul l to sli it up n own t tr ut it will sty in pl wn lt lon. Evn-Count
More informationA Simple Code Generator. Code generation Algorithm. Register and Address Descriptors. Example 3/31/2008. Code Generation
A Simpl Co Gnrtor Co Gnrtion Chptr 8 II Gnrt o for singl si lok How to us rgistrs? In most mhin rhitturs, som or ll of th oprnsmust in rgistrs Rgistrs mk goo tmporris Hol vlus tht r omput in on si lok
More informationMath 166 Week in Review 2 Sections 1.1b, 1.2, 1.3, & 1.4
Mt 166 WIR, Sprin 2012, Bnjmin urisp Mt 166 Wk in Rviw 2 Stions 1.1, 1.2, 1.3, & 1.4 1. S t pproprit rions in Vnn irm tt orrspon to o t ollowin sts. () (B ) B () ( ) B B () (B ) B 1 Mt 166 WIR, Sprin 2012,
More informationSAMPLE PAGES. Primary. Primary Maths Basics Series THE SUBTRACTION BOOK. A progression of subtraction skills. written by Jillian Cockings
PAGES Primry Primry Mths Bsis Sris THE SUBTRACTION BOOK A prorssion o sutrtion skills writtn y Jillin Cokins INTRODUCTION This ook is intn to hlp sur th mthmtil onpt o sutrtion in hilrn o ll s. Th mstry
More informationlearning objectives learn what graphs are in mathematical terms learn how to represent graphs in computers learn about typical graph algorithms
rp loritms lrnin ojtivs loritms your sotwr systm sotwr rwr lrn wt rps r in mtmtil trms lrn ow to rprsnt rps in omputrs lrn out typil rp loritms wy rps? intuitivly, rp is orm y vrtis n s twn vrtis rps r
More informationCOMP108 Algorithmic Foundations
Grdy mthods Prudn Wong http://www.s.liv..uk/~pwong/thing/omp108/01617 Coin Chng Prolm Suppos w hv 3 typs of oins 10p 0p 50p Minimum numr of oins to mk 0.8, 1.0, 1.? Grdy mthod Lrning outoms Undrstnd wht
More informationThe Plan. Honey, I Shrunk the Data. Why Compress. Data Compression Concepts. Braille Example. Braille. x y xˆ
h ln ony, hrunk th t ihr nr omputr in n nginring nivrsity of shington t omprssion onpts ossy t omprssion osslss t omprssion rfix os uffmn os th y 24 2 t omprssion onpts originl omprss o x y xˆ nor or omprss
More informationOrganization. Dominators. Control-flow graphs 8/30/2010. Dominators, control-dependence. Dominator relation of CFGs
Orniztion Domintors, ontrol-pnn n SSA orm Domintor rltion o CFGs postomintor rltion Domintor tr Computin omintor rltion n tr Dtlow lorithm Lnur n Trjn lorithm Control-pnn rltion SSA orm Control-low rphs
More informationGraphs. Graphs. Graphs: Basic Terminology. Directed Graphs. Dr Papalaskari 1
CSC 00 Disrt Struturs : Introuon to Grph Thory Grphs Grphs CSC 00 Disrt Struturs Villnov Univrsity Grphs r isrt struturs onsisng o vrs n gs tht onnt ths vrs. Grphs n us to mol: omputr systms/ntworks mthml
More informationIntegration Continued. Integration by Parts Solving Definite Integrals: Area Under a Curve Improper Integrals
Intgrtion Continud Intgrtion y Prts Solving Dinit Intgrls: Ar Undr Curv Impropr Intgrls Intgrtion y Prts Prticulrly usul whn you r trying to tk th intgrl o som unction tht is th product o n lgric prssion
More informationb. How many ternary words of length 23 with eight 0 s, nine 1 s and six 2 s?
MATH 3012 Finl Exm, My 4, 2006, WTT Stunt Nm n ID Numr 1. All our prts o this prolm r onrn with trnry strings o lngth n, i.., wors o lngth n with lttrs rom th lpht {0, 1, 2}.. How mny trnry wors o lngth
More informationOutline. Binary Tree
Outlin Similrity Srh Th Binry Brnh Distn Nikolus Austn nikolus.ustn@s..t Dpt. o Computr Sins Univrsity o Slzur http://rsrh.uni-slzur.t 1 Binry Brnh Distn Binry Rprsnttion o Tr Binry Brnhs Lowr Boun or
More information12/3/12. Outline. Part 10. Graphs. Circuits. Euler paths/circuits. Euler s bridge problem (Bridges of Konigsberg Problem)
12/3/12 Outlin Prt 10. Grphs CS 200 Algorithms n Dt Struturs Introution Trminology Implmnting Grphs Grph Trvrsls Topologil Sorting Shortst Pths Spnning Trs Minimum Spnning Trs Ciruits 1 Ciruits Cyl 2 Eulr
More informationRegister Allocation. Register Allocation. Principle Phases. Principle Phases. Example: Build. Spills 11/14/2012
Rgistr Allotion W now r l to o rgistr llotion on our intrfrn grph. W wnt to l with two typs of onstrints: 1. Two vlus r liv t ovrlpping points (intrfrn grph) 2. A vlu must or must not in prtiulr rhitturl
More information5/9/13. Part 10. Graphs. Outline. Circuits. Introduction Terminology Implementing Graphs
Prt 10. Grphs CS 200 Algorithms n Dt Struturs 1 Introution Trminology Implmnting Grphs Outlin Grph Trvrsls Topologil Sorting Shortst Pths Spnning Trs Minimum Spnning Trs Ciruits 2 Ciruits Cyl A spil yl
More informationBASIC CAGE DETAILS D C SHOWN CLOSED TOP SPRING FINGERS INNER WALL TABS ARE COINED OVER BASE AND COVER FOR RIGIDITY
SI TIS SOWN OS TOP SPRIN INRS INNR W TS R OIN OVR S N OVR OR RIIITY. R IMNSIONS O INNR SIN TO UNTION WIT QU SM ORM-TOR (zqsp+) TRNSIVR. R. RR S OPTION (S T ON ST ) TURS US WIT OPTION T SINS. R (INSI TO
More informationTangram Fractions Overview: Students will analyze standard and nonstandard
ACTIVITY 1 Mtrils: Stunt opis o tnrm mstrs trnsprnis o tnrm mstrs sissors PROCEDURE Skills: Dsriin n nmin polyons Stuyin onrun Comprin rtions Tnrm Frtions Ovrviw: Stunts will nlyz stnr n nonstnr tnrms
More informationSolutions for HW11. Exercise 34. (a) Use the recurrence relation t(g) = t(g e) + t(g/e) to count the number of spanning trees of v 1
Solutions for HW Exris. () Us th rurrn rltion t(g) = t(g ) + t(g/) to ount th numr of spnning trs of v v v u u u Rmmr to kp multipl gs!! First rrw G so tht non of th gs ross: v u v Rursing on = (v, u ):
More informationGarnir Polynomial and their Properties
Univrsity of Cliforni, Dvis Dprtmnt of Mthmtis Grnir Polynomil n thir Proprtis Author: Yu Wng Suprvisor: Prof. Gorsky Eugny My 8, 07 Grnir Polynomil n thir Proprtis Yu Wng mil: uywng@uvis.u. In this ppr,
More informationThe University of Sydney MATH 2009
T Unvrsty o Syny MATH 2009 APH THEOY Tutorl 7 Solutons 2004 1. Lt t sonnt plnr rp sown. Drw ts ul, n t ul o t ul ( ). Sow tt s sonnt plnr rp, tn s onnt. Du tt ( ) s not somorp to. ( ) A onnt rp s on n
More informationOpenMx Matrices and Operators
OpnMx Mtris n Oprtors Sr Mln Mtris: t uilin loks Mny typs? Dnots r lmnt mxmtrix( typ= Zro", nrow=, nol=, nm="" ) mxmtrix( typ= Unit", nrow=, nol=, nm="" ) mxmtrix( typ= Int", nrow=, nol=, nm="" ) mxmtrix(
More informationNefertiti. Echoes of. Regal components evoke visions of the past MULTIPLE STITCHES. designed by Helena Tang-Lim
MULTIPLE STITCHES Nrtiti Ehos o Rgl omponnts vok visions o th pst sign y Hln Tng-Lim Us vrity o stiths to rt this rgl yt wrl sign. Prt sping llows squr s to mk roun omponnts tht rp utiully. FCT-SC-030617-07
More informationBASIC CAGE DETAILS SHOWN 3D MODEL: PSM ASY INNER WALL TABS ARE COINED OVER BASE AND COVER FOR RIGIDITY SPRING FINGERS CLOSED TOP
MO: PSM SY SI TIS SOWN SPRIN INRS OS TOP INNR W TS R OIN OVR S N OVR OR RIIITY. R TURS US WIT OPTION T SINS. R (UNOMPRSS) RR S OPTION (S T ON ST ) IMNSIONS O INNR SIN TO UNTION WIT QU SM ORM-TOR (zqsp+)
More informationN=4 L=4. Our first non-linear data structure! A graph G consists of two sets G = {V, E} A set of V vertices, or nodes f
lulu jwtt pnlton sin towr ounrs hpl lpp lu Our irst non-linr t strutur! rph G onsists o two sts G = {V, E} st o V vrtis, or nos st o E s, rltionships twn nos surph G onsists o sust o th vrtis n s o G jnt
More informationGraph Contraction and Connectivity
Chptr 17 Grph Contrtion n Conntivity So r w hv mostly ovr thniqus or solving prolms on grphs tht wr vlop in th ontxt o squntil lgorithms. Som o thm r sy to prllliz whil othrs r not. For xmpl, w sw tht
More informationGrade 7/8 Math Circles March 4/5, Graph Theory I- Solutions
ulty o Mtmtis Wtrloo, Ontrio N ntr or ution in Mtmtis n omputin r / Mt irls Mr /, 0 rp Tory - Solutions * inits lln qustion. Tr t ollowin wlks on t rp low. or on, stt wtr it is pt? ow o you know? () n
More informationECE Experiment #6 Kitchen Timer
ECE 367 - Exprimnt #6 Kithn Timr Sprin 2006 Smstr Introution This xprimnt hs you onstrut iruit intrfin nin I/O lins from th 68HC11 with two svn smnt isplys n mtrix kyp, n writ ssmbly lnu o to rliz prormmbl
More informationWeighted Graphs. Weighted graphs may be either directed or undirected.
1 In mny ppltons, o rp s n ssot numrl vlu, ll wt. Usully, t wts r nonntv ntrs. Wt rps my tr rt or unrt. T wt o n s otn rrr to s t "ost" o t. In ppltons, t wt my msur o t lnt o rout, t pty o ln, t nry rqur
More informationAquauno Video 6 Plus Page 1
Connt th timr to th tp. Aquuno Vio 6 Plus Pg 1 Usr mnul 3 lik! For Aquuno Vio 6 (p/n): 8456 For Aquuno Vio 6 Plus (p/n): 8413 Opn th timr unit y prssing th two uttons on th sis, n fit 9V lklin ttry. Whn
More informationNumbering Boundary Nodes
Numring Bounry Nos Lh MBri Empori Stt Univrsity August 10, 2001 1 Introution Th purpos of this ppr is to xplor how numring ltril rsistor ntworks ffts thir rspons mtrix, Λ. Morovr, wht n lrn from Λ out
More informationGraphs. CSC 1300 Discrete Structures Villanova University. Villanova CSC Dr Papalaskari
Grphs CSC 1300 Disrt Struturs Villnov Univrsity Grphs Grphs r isrt struturs onsis?ng of vr?s n gs tht onnt ths vr?s. Grphs n us to mol: omputr systms/ntworks mthm?l rl?ons logi iruit lyout jos/prosss f
More informationRegister Allocation. How to assign variables to finitely many registers? What to do when it can t be done? How to do so efficiently?
Rgistr Allotion Rgistr Allotion How to ssign vrils to initly mny rgistrs? Wht to o whn it n t on? How to o so iintly? Mony, Jun 3, 13 Mmory Wll Disprity twn CPU sp n mmory ss sp improvmnt Mony, Jun 3,
More informationRAM Model. I/O Model. Real Machine Example: Nehalem : Algorithms in the Real World 4/9/13
4//3 RAM Mol 5-853: Algorithms in th Rl Worl Lolity I: Ch-wr lgorithms Introution Sorting List rnking B-trs Bur trs Stnr thortil mol or nlyzing lgorithms: Ininit mmory siz Uniorm ss ost Evlut n lgorithm
More informationA 4-state solution to the Firing Squad Synchronization Problem based on hybrid rule 60 and 102 cellular automata
A 4-stt solution to th Firing Squ Synhroniztion Prolm s on hyri rul 60 n 102 llulr utomt LI Ning 1, LIANG Shi-li 1*, CUI Shung 1, XU Mi-ling 1, ZHANG Ling 2 (1. Dprtmnt o Physis, Northst Norml Univrsity,
More informationEXAMPLE 87.5" APPROVAL SHEET APPROVED BY /150HP DUAL VFD CONTROL ASSEMBLY CUSTOMER NAME: CAL POLY SLO FINISH: F 20
XMPL XMPL RVISIONS ZON RV. SRIPTION T PPROV 0.00 THIS IS N PPROVL RWING OR YOUR ORR. OR MNUTURING N GIN, THIS RWING MUST SIGN N RTURN TO MOTION INUSTRIS. NY HNGS M TO THIS RWING, TR MNUTURING HS GUN WILL
More informationCS200: Graphs. Graphs. Directed Graphs. Graphs/Networks Around Us. What can this represent? Sometimes we want to represent directionality:
CS2: Grphs Prihr Ch. 4 Rosn Ch. Grphs A olltion of nos n gs Wht n this rprsnt? n A omputr ntwork n Astrtion of mp n Soil ntwork CS2 - Hsh Tls 2 Dirt Grphs Grphs/Ntworks Aroun Us A olltion of nos n irt
More informationCS 103 BFS Alorithm. Mark Redekopp
CS 3 BFS Aloritm Mrk Rkopp Brt-First Sr (BFS) HIGHLIGHTED ALGORITHM 3 Pt Plnnin W'v sn BFS in t ontxt o inin t sortst pt trou mz? S?? 4 Pt Plnnin W xplor t 4 niors s on irtion 3 3 3 S 3 3 3 3 3 F I you
More informationWalk Like a Mathematician Learning Task:
Gori Dprtmnt of Euction Wlk Lik Mthmticin Lrnin Tsk: Mtrics llow us to prform mny usful mthmticl tsks which orinrily rquir lr numbr of computtions. Som typs of problms which cn b on fficintly with mtrics
More informationPage 1. Question 19.1b Electric Charge II Question 19.2a Conductors I. ConcepTest Clicker Questions Chapter 19. Physics, 4 th Edition James S.
ConTst Clikr ustions Chtr 19 Physis, 4 th Eition Jms S. Wlkr ustion 19.1 Two hrg blls r rlling h othr s thy hng from th iling. Wht n you sy bout thir hrgs? Eltri Chrg I on is ositiv, th othr is ngtiv both
More informationb.) v d =? Example 2 l = 50 m, D = 1.0 mm, E = 6 V, " = 1.72 #10 $8 % & m, and r = 0.5 % a.) R =? c.) V ab =? a.) R eq =?
xmpl : An 8-gug oppr wr hs nomnl mtr o. mm. Ths wr rrs onstnt urrnt o.67 A to W lmp. Th nsty o r ltrons s 8.5 x 8 ltrons pr u mtr. Fn th mgntu o. th urrnt nsty. th rt vloty xmpl D. mm,.67 A, n N 8.5" 8
More informationWeighted graphs -- reminder. Data Structures LECTURE 15. Shortest paths algorithms. Example: weighted graph. Two basic properties of shortest paths
Dt Strutur LECTURE Shortt pth lgorithm Proprti of hortt pth Bllmn-For lgorithm Dijktr lgorithm Chptr in th txtook (pp ). Wight grph -- rminr A wight grph i grph in whih g hv wight (ot) w(v i, v j ) >.
More informationFSA. CmSc 365 Theory of Computation. Finite State Automata and Regular Expressions (Chapter 2, Section 2.3) ALPHABET operations: U, concatenation, *
CmSc 365 Thory of Computtion Finit Stt Automt nd Rgulr Exprssions (Chptr 2, Sction 2.3) ALPHABET oprtions: U, conctntion, * otin otin Strings Form Rgulr xprssions dscri Closd undr U, conctntion nd * (if
More informationSection 10.4 Connectivity (up to paths and isomorphism, not including)
Toy w will isuss two stions: Stion 10.3 Rprsnting Grphs n Grph Isomorphism Stion 10.4 Conntivity (up to pths n isomorphism, not inluing) 1 10.3 Rprsnting Grphs n Grph Isomorphism Whn w r working on n lgorithm
More informationSteinberg s Conjecture is false
Stinrg s Conjtur is als arxiv:1604.05108v2 [math.co] 19 Apr 2016 Vinnt Cohn-Aa Mihal Hig Danil Král Zhntao Li Estan Salgao Astrat Stinrg onjtur in 1976 that vry planar graph with no yls o lngth our or
More informationGreedy Algorithms, Activity Selection, Minimum Spanning Trees Scribes: Logan Short (2015), Virginia Date: May 18, 2016
Ltur 4 Gry Algorithms, Ativity Sltion, Minimum Spnning Trs Sris: Logn Short (5), Virgini Dt: My, Gry Algorithms Suppos w wnt to solv prolm, n w r l to om up with som rursiv ormultion o th prolm tht woul
More information10/30/12. Today. CS/ENGRD 2110 Object- Oriented Programming and Data Structures Fall 2012 Doug James. DFS algorithm. Reachability Algorithms
0/0/ CS/ENGRD 0 Ojt- Orint Prormmin n Dt Strutur Fll 0 Dou Jm Ltur 9: DFS, BFS & Shortt Pth Toy Rhility Dpth-Firt Srh Brth-Firt Srh Shortt Pth Unwiht rph Wiht rph Dijktr lorithm Rhility Alorithm Dpth Firt
More informationLecture 20: Minimum Spanning Trees (CLRS 23)
Ltur 0: Mnmum Spnnn Trs (CLRS 3) Jun, 00 Grps Lst tm w n (wt) rps (unrt/rt) n ntrou s rp voulry (vrtx,, r, pt, onnt omponnts,... ) W lso suss jny lst n jny mtrx rprsntton W wll us jny lst rprsntton unlss
More informationfor Performance Potsdam, NY Urbana, IL can be connected to the inputs and outputs of the LUT to
Thnoloy Mppin o Squntil Ciruits or LUT-s FPGAs or Prormn Pihn Pn C. L. Liu Dpt. o Eltril & Computr En. Dpt. o Computr Sin Clrkson Univrsity Univrsity o Illinois t Urn-Chmpin Potsm, NY 13699 Urn, IL 61801
More informationEdge-Triggered D Flip-flop. Formal Analysis. Fundamental-Mode Sequential Circuits. D latch: How do flip-flops work?
E-Trir D Flip-Flop Funamntal-Mo Squntial Ciruits PR A How o lip-lops work? How to analys aviour o lip-lops? R How to sin unamntal-mo iruits? Funamntal mo rstrition - only on input an an at a tim; iruit
More informationCS61B Lecture #33. Administrivia: Autograder will run this evening. Today s Readings: Graph Structures: DSIJ, Chapter 12
Aministrivi: CS61B Ltur #33 Autogrr will run this vning. Toy s Rings: Grph Struturs: DSIJ, Chptr 12 Lst moifi: W Nov 8 00:39:28 2017 CS61B: Ltur #33 1 Why Grphs? For xprssing non-hirrhilly rlt itms Exmpls:
More informationOutline. Circuits. Euler paths/circuits 4/25/12. Part 10. Graphs. Euler s bridge problem (Bridges of Konigsberg Problem)
4/25/12 Outlin Prt 10. Grphs CS 200 Algorithms n Dt Struturs Introution Trminology Implmnting Grphs Grph Trvrsls Topologil Sorting Shortst Pths Spnning Trs Minimum Spnning Trs Ciruits 1 2 Eulr s rig prolm
More informationSection 3: Antiderivatives of Formulas
Chptr Th Intgrl Appli Clculus 96 Sction : Antirivtivs of Formuls Now w cn put th is of rs n ntirivtivs togthr to gt wy of vluting finit intgrls tht is ct n oftn sy. To vlut finit intgrl f(t) t, w cn fin
More information