Closed Monochromatic Bishops Tours

Similar documents
The University of Sydney MATH 2009

Divided. diamonds. Mimic the look of facets in a bracelet that s deceptively deep RIGHT-ANGLE WEAVE. designed by Peggy Brinkman Matteliano

Theorem 1. An undirected graph is a tree if and only if there is a unique simple path between any two of its vertices.

4.1 Interval Scheduling. Chapter 4. Greedy Algorithms. Interval Scheduling: Greedy Algorithms. Interval Scheduling. Interval scheduling.

Lecture 20: Minimum Spanning Trees (CLRS 23)

5/1/2018. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees

In which direction do compass needles always align? Why?

Depth First Search. Yufei Tao. Department of Computer Science and Engineering Chinese University of Hong Kong

Weighted Graphs. Weighted graphs may be either directed or undirected.

Platform Controls. 1-1 Joystick Controllers. Boom Up/Down Controller Adjustments

Improving Union. Implementation. Union-by-size Code. Union-by-Size Find Analysis. Path Compression! Improving Find find(e)

Graphs Depth First Search

BASIC CAGE DETAILS SHOWN 3D MODEL: PSM ASY INNER WALL TABS ARE COINED OVER BASE AND COVER FOR RIGIDITY SPRING FINGERS CLOSED TOP

Spanning Trees. BFS, DFS spanning tree Minimum spanning tree. March 28, 2018 Cinda Heeren / Geoffrey Tien 1

(Minimum) Spanning Trees

CMSC 451: Lecture 4 Bridges and 2-Edge Connectivity Thursday, Sep 7, 2017

BASIC CAGE DETAILS D C SHOWN CLOSED TOP SPRING FINGERS INNER WALL TABS ARE COINED OVER BASE AND COVER FOR RIGIDITY

CHELOURANYAN CALENDAR FOR YEAR 3335 YEAR OF SAI RHAVË

d e c b a d c b a d e c b a a c a d c c e b

On Hamiltonian Tetrahedralizations Of Convex Polyhedra

L.3922 M.C. L.3922 M.C. L.2996 M.C. L.3909 M.C. L.5632 M.C. L M.C. L.5632 M.C. L M.C. DRIVE STAR NORTH STAR NORTH NORTH DRIVE

Strongly connected components. Finding strongly-connected components

Designing A Uniformly Loaded Arch Or Cable

Applications of trees

Planar convex hulls (I)

CMPS 2200 Fall Graphs. Carola Wenk. Slides courtesy of Charles Leiserson with changes and additions by Carola Wenk

Sheet Title: Building Renderings M. AS SHOWN Status: A.R.H.P.B. SUBMITTAL August 9, :07 pm

Having a glimpse of some of the possibilities for solutions of linear systems, we move to methods of finding these solutions. The basic idea we shall

Dental PBRN Study: Reasons for replacement or repair of dental restorations

24CKT POLARIZATION OPTIONS SHOWN BELOW ARE REPRESENTATIVE FOR 16 AND 20CKT

MAT3707. Tutorial letter 201/1/2017 DISCRETE MATHEMATICS: COMBINATORICS. Semester 1. Department of Mathematical Sciences MAT3707/201/1/2017

Telecommunications BUILDING INTERCOM CALL BUTTON WITH 3/4"C AND PULL STRING TO ACCESSIBLE CEILING SPACE. MOUNT 48" AFF.

Differentiation of allergenic fungal spores by image analysis, with application to aerobiological counts

Housing Market Monitor

CS 103 BFS Alorithm. Mark Redekopp

P a g e 5 1 of R e p o r t P B 4 / 0 9

COMP 250. Lecture 29. graph traversal. Nov. 15/16, 2017

Telecommunications 1-1/4" RACEWAY WITH DOUBLE-GANG ADAPTER PLATE AND A/V CABLING.

SOCKET WELD OR THREADED BODY TYPE (3051SFP FLOWMETER SHOWN THROUGHOUT / 3051CFP, 2051CFP AVAILABLE)

Exam 2 Solutions. Jonathan Turner 4/2/2012. CS 542 Advanced Data Structures and Algorithms

Computer Graphics. Viewing & Projections

CSE 332. Data Structures and Parallelism

CSE 332. Graphs 1: What is a Graph? DFS and BFS. Data Abstractions. CSE 332: Data Abstractions. A Graph is a Thingy... 2

SHELL CANADA PIPING AND INSTRUMENT DIAGRAM QUEST CCS PROJECT LEGENDS AND SYMBOLS QUEST CCS PROJECT UNIT COMMON "!!

Ash Wednesday. First Introit thing. * Dómi- nos. di- di- nos, tú- ré- spi- Ps. ne. Dó- mi- Sál- vum. intra-vé-runt. Gló- ri-

learning objectives learn what graphs are in mathematical terms learn how to represent graphs in computers learn about typical graph algorithms

MATERIAL SEE BOM ANGLES = 2 FINISH N/A

T h e C S E T I P r o j e c t

VOID CABLE REQUIREMENTS

An action with positive kinetic energy term for general relativity. T. Mei

16.unified Introduction to Computers and Programming. SOLUTIONS to Examination 4/30/04 9:05am - 10:00am

(4, 2)-choosability of planar graphs with forbidden structures

I M P O R T A N T S A F E T Y I N S T R U C T I O N S W h e n u s i n g t h i s e l e c t r o n i c d e v i c e, b a s i c p r e c a u t i o n s s h o

Determination of slot leakage inductance for three-phase induction motor winding using an analytical method

The R-Tree. Yufei Tao. ITEE University of Queensland. INFS4205/7205, Uni of Queensland

/99 $10.00 (c) 1999 IEEE

Math 166 Week in Review 2 Sections 1.1b, 1.2, 1.3, & 1.4

P a g e 3 6 of R e p o r t P B 4 / 0 9

SAMPLE CSc 340 EXAM QUESTIONS WITH SOLUTIONS: part 2

Cycles and Simple Cycles. Paths and Simple Paths. Trees. Problem: There is No Completely Standard Terminology!

Minimum Spanning Trees (CLRS 23)

A L A BA M A L A W R E V IE W

2 Trees and Their Applications

A ' / 1 6 " 5 ' / 4 " A4.2 48' - 0" 3 12' - 7" 13' - 11" 10' - 0" 9' - 0" 2' - 6" 1. 2: 12 INDICATES SHOW MELT TYP ABV ABV

Graph Search (6A) Young Won Lim 5/18/18

Single Source Shortest Paths (with Positive Weights)

Tangram Fractions Overview: Students will analyze standard and nonstandard

L...,,...lllM" l)-""" Si_...,...

DOCUMENT STATUS: RELEASE

Lecture II: Minimium Spanning Tree Algorithms

Graph Search Algorithms

Maximum Matching Width: new characterizations and a fast algorithm for dominating set

Graphs Breadth First Search

ADORO TE DEVOTE (Godhead Here in Hiding) te, stus bat mas, la te. in so non mor Je nunc. la in. tis. ne, su a. tum. tas: tur: tas: or: ni, ne, o:

SAN JOSE CITY COLLEGE PHYSICAL EDUCATION BUILDING AND RENOVATED LAB BUILDING SYMBOL LIST & GENERAL NOTES - MECHANICAL

Available online Journal of Scientific and Engineering Research, 2016, 3(6): Research Article

ELECTRONIC SUPPLEMENTARY INFORMATION

Grade 7/8 Math Circles March 4/5, Graph Theory I- Solutions

FL/VAL ~RA1::1. Professor INTERVI of. Professor It Fr recru. sor Social,, first of all, was. Sys SDC? Yes, as a. was a. assumee.

Paths. Connectivity. Euler and Hamilton Paths. Planar graphs.

1 Introduction to Modulo 7 Arithmetic

Outline. 1 Introduction. 2 Min-Cost Spanning Trees. 4 Example

Verification of DAG Structures in Cooperative Belief Network Based Multi-agent Systems

ROSEMOUNT 3051S SCALABLE OR 3051SMV MULTIVARIABLE COPLANAR PRESSURE TRANSMITTER COPLANAR FLANGE PROCESS CONNECTION

PART NUMBERS ACCESSORIES: Genuine & Optomize

Decimals DECIMALS.

I N A C O M P L E X W O R L D

Doran Warning Light Monitor

, each of which is a tree, and whose roots r 1. , respectively, are children of r. Data Structures & File Management

UNCONTROLLED COPY. ERGON ENERGY SUBSTATION STANDARD CIVIL WORKS - STRUCTURES AND POLES 66kV EARTHING TRANSFORMER CABLE SUPPORT STEELWORK DETAILS

Aquauno Video 6 Plus Page 1

Minimum Spanning Trees (CLRS 23)

CSE 332. Graphs 1: What is a Graph? DFS and BFS. Data Abstractions. CSE 332: Data Abstractions. A Graph is a Thingy... 2

SAMPLE LITANY OF THE SAINTS E/G. Dadd9/F. Aadd9. cy. Christ, have. Lord, have mer cy. Christ, have A/E. Dadd9. Aadd9/C Bm E. 1. Ma ry and. mer cy.

A301 A301 A402 A201 A402 EHU STUDIO - TYPE B UNIT G15 88' - 0" A205 ELEV. EQUIP G14 CAR WASH EQUIPMENT 16 A573 CLUB ELEVATOR 1 WS0 25 VAN 88' - 0"

CS150 Sp 98 R. Newton & K. Pister 1

NORTHLAKE APARTMENTS

Present state Next state Q + M N

w x a f f s t p q 4 r u v 5 i l h m o k j d g DT Competition, 1.8/1.6 Stainless, Black S, M, L, XL Matte Raw/Yellow

12/3/12. Outline. Part 10. Graphs. Circuits. Euler paths/circuits. Euler s bridge problem (Bridges of Konigsberg Problem)

Transcription:

Cos Monoromt Bsops Tours Jo DMo Dprtmnt o Mtmts n Sttsts Knnsw Stt Unvrsty, Knnsw, Gor, 0, USA mo@nnsw.u My, 00 Astrt In ss, t sop s unqu s t s o to sn oor on t n wt or. Ts ms os tour n w t sop vsts vry squr on t or xty on n rturns to ts strtn poston mposs. Wn n two sops, on n on wt, y vst vry squr (o tr rsptv oors) xty on n rturn to tr strtn postons? Su tour w os monoromt sop s tour. In ts ppr nssry n su nt ontons or t xstn o monoromt sop s tour or t rtnur mn or r provn. Furtrmor, monoromt nt s mov s n or t tr mnson ssor n os monoromt nt s tour s prov or t u o s. Introuton Puzzs on t ssor v on n stu y mtmtns. T survy pprs Comntor Proms on Cssors [] n Comntor Proms on Cssors II [] prov xnt ntroutons to t vrous typs o proms. T os nt s tour s on o ts mu stu n mous proms n t r o ssor puzzs. For w ors n nt y vst vry squr xty on n rturn to ts strtn poston? Swn ompty nswr ts quston or rtnur ors n. Torm An m n ssor wt m n s os nt s tour unss on or mor o t oown tr ontons o: () m n n r ot o; () m ; ; ; () m = n n ; ; : T unqu movmnt o t nt ms or ntrstn stuy w os tours or t n, qun n roo r trv to onstrut. T sop s oor

o n ry nnot tour vry squr on t or. Lt s n t quston sty. Wn n two sops, on n on wt, y vst vry squr (o tr rsptv oors) xty on n rturn to tr strtn postons? Su tour w os monoromt sops tour. Osony w w n monoromt tour tt vsts vry squr xty on ut os not rturn to ts strtn poston. Su tour s n opn monoromt sops tour. For ts ppr w w ssum t top t squr s wys n n nt m n ssor wt m n. T Cs o m = ; For t n ssor, t sops r un to m sn mov n no os monoromt sops tour xsts. For t n ssor t sops r to mov own t or ut r un to rturn wtout rptn squr. Tus, xpt or t ssor, no os monoromt sops tour xsts or m =. T Cs o m = No os monoromt sops tour xsts or m = n =. W tour o t wt squrs s poss (n sy), t squrs prov to troumrs. T our ornr squrs v ony two poss movs, on o w s to t ntr squr. For tour to xst ornr must pr or su y t ntr squr. Ts ors t ntr squr to vst mor tn on n no os monoromt sops tour xsts. Gvn t or ow, w n onstrut ny nt n 0 mo opn monoromt sops tour y pn ops o ts or s y s. Connt t pts y movn rom o t t or to o t rt or n rom o t t or to o t rt or. T sm movs w so onnt t wt pts. It s smp to onnt t two pts on t rtmost s y onstrutn t. Conntn t two wt pts rqurs t mor. Frst, t t n rt t n s. W r now t wt n opn monoromt sops tour wt ns on t tmost s o t or t n or ot t n wt tours.

B Wt Fur : T Bor to Crt t Opn Tour To rt os tour or ny n mo, prpn t pproprt r or or r n mo n oow t rt to os o t opn ns o t tour. x r x r x y s y s y z t z t z Fur : Bors to Prpn to Opn n Tour n mo Dt B Crt B 0 ; non y; y non t, t y, r y, r non y, t y, t, r; r n mo Dt Wt Crt Wt 0 non x; z; z; x non z, s z, s x, x non z, z, s, s, x, x E n or n xtn to m n or or m 0 mo. Not tt vry n or s rtmost s s nt. Crt two n ors p ntws. For ot n wt tours t t rtmost s n t top tours n t rtmost s n t ottom tours. Now rt t n s. Ts ys onstruton or os monoromt sops tours or t m n or or m 0 mo n n. T Cs o m =

0 0 m o 0 n p n 0 m Fur : Bs Css or m = Fur provs us wt v rnt os monoromt tours o nt n vryn wts. As wt t n ors, ts s ss n sy xtn to os monoromt sops tour or ny n or. T rt ow nts ow to us t os monoromt sops tour o t or to rt os monoromt sops tour or ny n or. n mo Dt B Crt B 0 n t n; n rt ; n t n; n rt ; n t n; n rt ; n t n; n rt ; n mo Dt Wt Crt Wt 0 n t n; n rt ; n t n; n rt ; n t n; n rt ; n t n; n rt ; Just t n ors, w n xtn ts n ors to ny m n or or m 0 mo n n xpt or t or. Ts nsstt t nuson o t s s. St two ors top to ottom s or. For t sop, t n t tmost s o t ottom or. In t top or, t n t tmost s t 0,, or (pnn upon t s s). Nxt onstrut t 0 n s (or otr s pnn upon t s s) to xtn t sops tour. For t wt sop, rmov t rom t tmost top or n t,, m n or o p (pnn upon t s s). Nxt onstrut t n s (or otr s pnn upon t s s) to xtn t wt sops tour. Ts onstruton wou not wor on t or s w wou n to t t tw.

Fronus Comntons I w n tt ts n n n tours to otr tn ny mn tour or m n onstrut rom t s ors s t Fronus numr (; ) = ( ) ( ) =. Fortunty, ts s sy to omps. P t pproprt numr o ops o t n tours ntws oow y t pproprt numr o n tours. On t rtmost s o t ors or t ottommost n or n upprmost n or oow t rt to omn t tours. Not tt t oor o t squrs or t n or w swt s on n mo. n mo Dt B Crt B 0 n n, n n ; n n, n n ; n n; n n ; n n; n n, n mo Dt Wt Crt Wt 0 n n, n n ; n n, n n ; n n; n n ; n n; n n ; T Cs o m = Unortunty, t Fronus numr (; ) = os notn to v os monoromt sops tours o t n or. So, on n, w prsnt s ss n mto to xtn tm to ny n or. Sn ts ours t t rt-most n o t n ors t os xst s outn wn rtn t os n ors:

0 0 n o 0 q 0 o m m p n Fur : Bs Css or m = n mo Dt B Crt B 0 t n; rt ; t n; rt ; t n; rt ; t n; rt ; n mo Dt Wt Crt Wt 0 t n; rt ; t n; rt ; t n; rt ; t n; rt ; Summry n Futur Wor T ov wor s to vry smr oon torm or sops s t on provn y Swn or nts. Torm An m n ssor wt m n s os monoromt sops tour unss on o t oown tr ontons o: () m = ; () m = n n = ; () m = n n = : Bsops on t m n ssor s not t ony sttn wr os monoromt tour ms sns. Gnrzn t squr ssor to

tr-mnson u so s ntury to os monoromt tour prom not ony or sops ut so or nts. T xtnson o t sops movmnt nto tr mnsons s sy to m n ry st oor o. T xtnson o nt s mov s not s ovous. On opton s to p t sm mov o nt w ms t nt trnt oors on mov. In 00, Qn n Wtns prov t xstn o os nt s tour o t sx xtror s o t rtnur prsm n [] w usn t nt. In t sm ppr, Qn n Wtns prov nt s tour o t u o s. In 00, DMo prov os nt s tour n t u o s n usn t nt xsts n ony n n vn []. Wy o ntr rts us t nt? Bus t nt s movs n t u o not trnt oor wt t nt! Just t sop, t nt s oor o. T nxt stp n ts rsr o monoromt tours s to trmn w us mt os monoromt tours wt t nt. As tsr, I v you wt n xmp o os monoromt nt s tour o t u o s, t smst u tt mts su tour. Gvn t symmtry o t u ony t tour s vn ow. Rott t u 0 rs or t wt tour. 0 0 0 0 Lv Lv 0 0 0 0 0 0 0 0 00 Lv Lv 0 0 0 0 0 Lv Lv Fur : A Cos Monoromt Knt s Tour n t Cu o S n =

Rrns [] J. DMo, W Cssors v Cos Knt s Tour wtn t Cu?, T Etron Journ o Comntors, Voum, (00) R [] G. H. Fr, S. M. Htnm, S. T. Htnm, A. A. MR, C. K. Ws, M. S. Joson, W. W. Mrtn, n W. D. Wy, Comntor Proms on Cssors: A Br Survy. Grp Tory, Comntors n Apptons () 0-. [] S. M. Htnm, S. T. Htnm, R. Rynos, Comntor Proms on Cssors: II, Domnton n Grps; Avn Tops, Mr Dr, In., Nw Yor,. [] A. J. Swn, W Rtnur Cssors v Knt s Tour? Mtmts Mzn : (Dmr ) -. [] Y. Qn n J.J. Wtns, Knt s Tours or Cus n Boxs, Conrssus Numrntum (00) - [] J. J. Wtns, Aross t Bor: T Mtmts o Cssor Proms, Prnton Unvrsty Prss, Prnton, 00. [] Wsstn, Er W. "Fronus Numr." From MtWor A Worm W Rsour. ttp://mtwor.worm.om/fronusnumr.tm