Hey there! Sign in to join this conversationNew here? Join for free
    • Thread Starter
    Offline

    0
    ReputationRep:
    I have no idea how to beginn with this...
    We have a network 8x8 of a big chessboard. The 81 grid points are the crossroads. The crossroads are linked with the neighboring crossroads through edges of 1 m length horizontally and vertically. The horizontal streets can be crossed in both directions. The vertical 1st, 3rd, 5th, 7th and 9th streets from up to down and the 2nd, 4th, 6th, 8th from down to up. In this described graph can only the four fields in the centre of the chessboard turn clockwise to 90 degrees including the street orientation. The minimum number of visited edges of the optimal solution of this graph's chinese postman problem's is then:


    22

    23

    24
 
 
 
Poll
Do you agree with the PM's proposal to cut tuition fees for some courses?

The Student Room, Get Revising and Marked by Teachers are trading names of The Student Room Group Ltd.

Register Number: 04666380 (England and Wales), VAT No. 806 8067 22 Registered Office: International House, Queens Road, Brighton, BN1 3XE

Write a reply...
Reply
Hide
Reputation gems: You get these gems as you gain rep from other members for making good contributions and giving helpful advice.