algorithm - binary representation of all states in tower of hanoi -


in modified toh have 4 pegs. in turn have total of 4^n disk positions. in 1 of solutions going through, given state represented using below code - 

for(int disc = 0; disc < n; disc++){         state += tower[disc]<<(disc*2);     }

tower[disc] --> tower disc located, can (0,1,2,3)

if use n=3 in above code, gives me 63, 4^n -1. formula works, i.e 0-63 64 positions can represented. not able understand mathematical correlation.

can please explain how above formula can represent possible disk positions , how change if further change number of pegs or n lets 5.

since have 4 pegs, position of disk can encoded in 2 bits (00, 01, 10, 11 => 0, 1, 2, 3). multiplication 2 gives each disk 2 bits of independent memory space within integer state, first disk starting @ bit 0, second @ bit 2, , on... ith disk @ (i - 1) * 2. left shift << moves data each disk correct bit position.

however code can "unsafe" - if there mistake in game logic somewhere else caused value of tower greater 3, when shifted overflow designated 2 bits of space. prevent this, bitwise , clamp data [0, 3]:

state += (tower[disc] & 3) << (i * 2);

note can use bitwise or instead of addition - state |= ....

from example n = 3 provided looks plates starting peg 4 (i.e. tower[3]). if change n = 5 once again give 4^n - 1 = 1023, bits below n * 2 set 1.


Comments

Post a Comment

Popular posts from this blog

android - InAppBilling registering BroadcastReceiver in AndroidManifest -

i'm implementing inapp billing in android app. works well, however, i'm trying decouple broadcast receiver activity manifest. suggestion in android's trivialdrive sample: // important: dynamically register broadcast messages updated purchases. // register receiver here instead of <receiver> in manifest // because call getpurchases() @ startup, therefore can ignore // broadcasts sent while app isn't running. // note: registering listener in activity bad idea, done here // because sample. regardless, receiver must registered after // iabhelper setup, before first call getpurchases(). currently there's class extends broadcastreceiver : public class iabbroadcastreceiver extends broadcastreceiver { /** * intent action receiver should filter for. */ public static final string action = "com.android.vending.billing.purchases_updated"; private final iabbroadcastlistener mlistener; public iabbroadcastreceiver(iabbroadcastlistener listener) { m...
Read more

python Tkinter Capturing keyboard events save as one single string -

is possible store keyboard events 1 string? code below stores 1 char , prints it. card reader or bar code reader, contains collection of character/ string not 1 character @ time. goal save char pressed text variable. from tkinter import * root = tk() def key(event): text= event.char text+= event.char print ("pressed", text) def callback(event): frame.focus_set() print ("clicked at", event.x, event.y) frame = frame(root, width=100, height=100) frame.bind("<key>", key) frame.bind("<button-1>", callback) frame.pack() root.mainloop() currently, creating text variable , everytime key() function gets called, , text stores last character typed. you can define text module level variable , , use module level text inside key function - text = '' def key(event): global text text+= event.char print("pressed", text)
Read more

sql server - Why does Linq-to-SQL add unnecessary COUNT()? -

here tables: create table customer ( cid int primary key, name varchar(32) ) create table ord ( oid int primary key, cid int foreign key references customer, address varchar(20) ) here's linq-to-sql statement: var aaa = c in db.customer select new { c, o = c.ord.tolist() }; and here's inexplicable query generated linq-to-sql: select [t0].[cid] [cid], [t0].[name] [name], [t1].[oid] [oid], [t1].[cid] [cid2], [t1].[address] [address], (select count(*) [dbo].[ord] [t2] [t2].[cid] = [t0].[cid]) [value] [dbo].[customer] [t0] left outer join [dbo].[ord] [t1] on [t1].[cid] = [t0].[cid] order [t0].[cid], [t1].[oid] i want understand how rid of count(*) part. it's entirely uncalled for! linq needs count(*) in order determine number of entries returned o = c.ord.tolist() .
Read more