mersenneforum.org  

Go Back   mersenneforum.org > Fun Stuff > Puzzles

Reply
 
Thread Tools
Old 2014-11-11, 22:25   #1
henryzz
Just call me Henry
 
henryzz's Avatar
 
"David"
Sep 2007
Cambridge (GMT/BST)

23·3·5·72 Posts
Default Digital Logic Design

I came across an interesting game recently and though people might like a try at it.
https://e504b5feb2438f1aba61c35ddd55...JYVzNPcW5rRmc/
http://www.reddit.com/r/dldtg/
The coding language is a little hard to understand at first but it is quite a fun puzzle to try and find optimal solutions. I am upto MUX41 so far.
The developer seems to be around but not actively developing. If there was activity and ideas I think he would add more puzzles.
henryzz is offline   Reply With Quote
Old 2014-11-11, 22:35   #2
Xyzzy
 
Xyzzy's Avatar
 
"Mike"
Aug 2002

25·257 Posts
Default





Xyzzy is offline   Reply With Quote
Old 2014-11-12, 13:21   #3
Mini-Geek
Account Deleted
 
Mini-Geek's Avatar
 
"Tim Sorbera"
Aug 2006
San Antonio, TX USA

426710 Posts
Default

Minimizing code is hard.

I've gotten as far as completing MUX21, but I'm way over-par on TRUTH_TABLE3 (mine is 17, best 6 IIRC) and MUX21 (8, best 4), so I don't feel like clicking enough to unlock the next puzzle.

Also, the programming language is needlessly difficult to write in. Why not just let me write something like OR(NAND(A,B),NOT(A))? Instead, it takes like a half dozen lines to do something like that.

Last fiddled with by Mini-Geek on 2014-11-12 at 13:22
Mini-Geek is offline   Reply With Quote
Old 2014-11-12, 15:20   #4
science_man_88
 
science_man_88's Avatar
 
"Forget I exist"
Jul 2009
Dumbassville

26×131 Posts
Default

Quote:
Originally Posted by Mini-Geek View Post
Minimizing code is hard.

I've gotten as far as completing MUX21, but I'm way over-par on TRUTH_TABLE3 (mine is 17, best 6 IIRC) and MUX21 (8, best 4), so I don't feel like clicking enough to unlock the next puzzle.

Also, the programming language is needlessly difficult to write in. Why not just let me write something like OR(NAND(A,B),NOT(A))? Instead, it takes like a half dozen lines to do something like that.
if you saved up you could use the upgrade to get an autominer etc.
science_man_88 is offline   Reply With Quote
Old 2014-11-12, 15:29   #5
bsquared
 
bsquared's Avatar
 
"Ben"
Feb 2007

66718 Posts
Default

Quote:
Originally Posted by Mini-Geek View Post
Minimizing code is hard.

...

Also, the programming language is needlessly difficult to write in. Why not just let me write something like OR(NAND(A,B),NOT(A))? Instead, it takes like a half dozen lines to do something like that.
Welcome to the world of digital logic design!
bsquared is offline   Reply With Quote
Old 2014-11-12, 15:46   #6
science_man_88
 
science_man_88's Avatar
 
"Forget I exist"
Jul 2009
Dumbassville

26·131 Posts
Default

I wish I had enough intelligence to figure out the not gate lol
science_man_88 is offline   Reply With Quote
Old 2014-11-12, 21:43   #7
science_man_88
 
science_man_88's Avatar
 
"Forget I exist"
Jul 2009
Dumbassville

203008 Posts
Default

Quote:
Originally Posted by Mini-Geek View Post
Minimizing code is hard.

I've gotten as far as completing MUX21, but I'm way over-par on TRUTH_TABLE3 (mine is 17, best 6 IIRC) and MUX21 (8, best 4), so I don't feel like clicking enough to unlock the next puzzle.

Also, the programming language is needlessly difficult to write in. Why not just let me write something like OR(NAND(A,B),NOT(A))? Instead, it takes like a half dozen lines to do something like that.
there's a flaw they talk about on the info page where you can click what you want to sell ( for me it was not once I got it since it didn't cost any Si and then hold enter to continue selling without clicking and for me that makes Si pointless now it's just me trying to wrap my head around the programming.
science_man_88 is offline   Reply With Quote
Old 2014-11-17, 19:22   #8
henryzz
Just call me Henry
 
henryzz's Avatar
 
"David"
Sep 2007
Cambridge (GMT/BST)

10110111110002 Posts
Default

I have now completed DEMUX14 although not optimally yet.
The coding isn't that hard it just takes a lot of copying.
henryzz is offline   Reply With Quote
Old 2014-12-03, 22:04   #9
TheJudger
 
TheJudger's Avatar
 
"Oliver"
Mar 2005
Germany

45716 Posts
Default

Cool puzzles!
  • At start I had some problems with XOR to get par.
  • Did "DEMUX12", "DEMUX14" and "DEMUX18x8" one under par.
  • I'm totally lost at those latches and flip flops.
  • "BIN_TO_7SEG" is kind of broken. DLD(TG) suggest 166 NAND gates but can be done with 37 NAND gates which totally breaks economics (if you care).
  • Didn't try ALUx8 so far.

Oliver
TheJudger is offline   Reply With Quote
Old 2014-12-04, 20:56   #10
henryzz
Just call me Henry
 
henryzz's Avatar
 
"David"
Sep 2007
Cambridge (GMT/BST)

16F816 Posts
Default

Quote:
Originally Posted by TheJudger View Post
Cool puzzles!
  • At start I had some problems with XOR to get par.
  • Did "DEMUX12", "DEMUX14" and "DEMUX18x8" one under par.
  • I'm totally lost at those latches and flip flops.
  • "BIN_TO_7SEG" is kind of broken. DLD(TG) suggest 166 NAND gates but can be done with 37 NAND gates which totally breaks economics (if you care).
  • Didn't try ALUx8 so far.

Oliver
You're doing well
Might be worth posting http://www.reddit.com/r/dldtg/commen...d_bin_to_7seg/ about smashing the record.
henryzz is offline   Reply With Quote
Reply



Similar Threads
Thread Thread Starter Forum Replies Last Post
a question about some logic MattcAnderson Homework Help 9 2019-02-15 22:36
Database design xilman Astronomy 1 2017-04-30 22:25
Wired digital cock has appeared on certain Windows applications kladner Information & Answers 20 2015-01-22 19:24
Yet another new factoring algorithm\primality test:Digital Coding ?? tServo Miscellaneous Math 3 2014-04-10 18:52
Digital Billboards kladner Soap Box 15 2013-11-15 13:29

All times are UTC. The time now is 03:53.


Sat Jul 17 03:53:34 UTC 2021 up 50 days, 1:40, 1 user, load averages: 2.04, 1.93, 1.76

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.