Knapsack 0-1 JavaScript binary & rosettacode & WE
Classic Knapsack problem is solved in many ways
My newest program synthesizes all ciphers from 0 & 1
adding an extra register and 0 remain on left in cipher
Number of comparisons decreases from N! to 2^N
for example N=10 & N!=3628800 >> 2^N=1024
Random values origin are automatically assigned
quantity...
DANILIN
Last Activity: May 14 '23, 11:17 PM
Joined: Oct 30 '18
Location:
-
Knapsack 0-1 JavaScript binary & rosettacode & WE
-
Quantum random observe principles of binomial distribution -
Knapsack 0-1 C++ binary & WE
Knapsack 0-1 C++ binary & WE
Classic Knapsack problem is solved in many ways
My newest program synthesizes all ciphers from 0 & 1
adding an extra register and 0 remain on left in cipher
Feature of algorithm:
converts whole into a string
and converts string into a whole
what will help in other programs
Number of comparisons decreases from N! to 2^N
... -
Knapsack 0-1 Python binary & rosettacode & WE
Knapsack 0-1 Python binary & rosettacode & WE
Classic Knapsack problem is solved in many ways
My newest program synthesizes all ciphers from 0 & 1
adding an extra register and 0 remain on left in cipher
Number of comparisons decreases from N! to 2^N
for example N=10 & N!=3628800 >> 2^N=1024
Random values origin are automatically assigned
quantity... -
Python version of Knapsack was offered by me
in branch
https://bytes.com/topic/python/insights/
however it has not been published yet
Please promote my Python theme
or I will post algorithm in this topic for a month
Plus I created simplest version for Excel...Leave a comment:
-
Knapsack 0-1 C# binary & rosettacode & WE
Knapsack 0-1 C# binary & rosettacode & WE
Classic Knapsack problem is solved in many ways
My newest program synthesizes all ciphers from 0 & 1
adding an extra register and 0 remain on left in cipher
Number of comparisons decreases from N! to 2^N
for example N=10 & N!=3628800 >> 2^N=1024
Random values origin are automatically assigned
quantity and... -
Knapsack 0-1 & rosettacode & qbasic qb64 & WE
Classic Knapsack problem is solved in many ways
Contents: http://rosettacode.org/wiki/Knapsack_problem
Long read: rosettacode.org/wiki/Knapsack_proble m/0-1
My newest program synthesizes all ciphers from 0 & 1
adding an extra register and 0 remain on left in cipher
Number of comparisons decreases from N! to 2^N...Leave a comment:
-
Checking in Wolframalpha
Reliability win and lose
both probability of winning and losing create 4 combinations:
C+p^N=1
(1-C)+p^N=1
C+(1-p)^N=1
(1-C)+(1-p)^N=1
Everything is interchangeable :
C=1-c
c=1-C
P=1-p
p=1-P
Artificial intelligence of Wolframalpha knows logarithm:
solve C+(1-p)^N=1 for N
...Leave a comment:
-
Number of consecutive matches is calculated by formula N = log(1-C)/log(1-P),
where N is step, P is probability, C is reliability of probability.
Substituting C and P: N = log(1-0.99)/log(1-0.5) = 6.7 = natural value 7,
that means that 7th step of distribution should include
about 1% of half data, due to counting repetitions and 0 and 1, in amount of 100%.
Distribution step number:
at C...Leave a comment:
-
Program for distribution spectra of random
number of consecutive identical features
less \ more and even \ odd
number of numbers depends on seconds
and counts 10 ^ 5 elements per second
and I imagine what will happen in fast languages
...Code:'datable99.bas RANDOMIZE TIMER tb = TIMER: s = 0 OPEN "zz99.txt" FOR OUTPUT AS #2 n = VAL(MID$(TIME$, 7, 2))
Leave a comment:
-
Developments of several years issued on new year's weekend
received a state certificate of registration of computer system
Research and transformation of sorting of pseudorandom sequences
and formula is fixed on internet N=LOG(1-c)/LOG(1-p)
Abstract includes tables and formulas and graphs
therefore it is possible to publish images of pages
Research and transformation...Leave a comment:
-
Nearest step: shuffling by weak algorithm
weak randomness is randomness of normal
Sequence is bad
and inserted into Excel in 2 columns at a distance
and to left end-to-end of 2nd column is a column of numbers in a row
and columns are sorted end to end from maximum to minimum
Grouped together: reverse and forward sequences
and then sort both by ordering reverse
sequence...Leave a comment:
-
Invented by me at random algorithm of RNG
where is trigonometry used
check shows distribution is bad
comparing even\odd and small\large
but shuffling turns array into a normal one
I came up with an algorithm Blizzard at school
in last century even under old regime and in our century
about same too foreign called vortex
Blizzard algorithm: number 1 is random and...Leave a comment:
-
Check for randomness of digits of number of PI
Using 55,000 digits of pi
first in Word translated to column by replacement
Excel compiles formulas for dividing into:
even \ odd and small \ big
and then my tables are used
at same time comparing with theoretical separation
Results: average for both divisions: 0.5
and separation matches chance by true
and it’s still...Leave a comment:
-
Falsification of probability
Falsification of probability
exploring possibility of falsification of random
qbasic qb64 programs were created in an hour
and a table using formulas
= CASEBETWEEN(0;1 )
= IF (B3 = B2; C2 + 1; 0)
= COUNTIF (C$3: C$55000; D2)
= SUM(E2:E10)
= E2 / E3
idea: fake a 50% chance
results:
research E green pure excel:
... -
in Russia compile using bat:
inside folder
C:\Windows\Micr osoft.NET\Frame work64\v4.0.303 19
attention: Framework ... 64
bat for windows c#:
bat for dos c#:Code:csc.exe /target:winexe program.cs pause
I hope it helps to shape your startCode:csc.exe /nologo program.cs pause
Leave a comment:
-
c# version of "guess my number game" 1 line
...Code:using System; using System.Text;namespace GURU { class Program { static void Main(string[] args) { Random rand = new Random(); int Russia = 0; int n = 0; int num = 0; dav: if(Russia == 0) {Russia = 2222; num = rand.Next(100)+1; goto dav; }else if (Russia != 0) {Console.Write("? "); n = Convert.ToInt32(Console.ReadLine());} if (n < num) { Console.WriteLine("MORE");Leave a comment:
-
we draw 5D relief creating a random array of heights
on QB64 in 5 minutes and plus in an hour
beauty and versatility
[IMG][/IMG]
...Code:' 5d relief and array SCREEN 12: RANDOMIZE TIMER: DIM a(12,12) FOR t=1 TO 12 ' quantity FOR x=1 TO 12: FOR y=1 TO 12 a(x,y)=INT(RND*20)'heights NEXT: NEXT: CLS FOR y=1 TO 12: FOR x=1 TO 11 LINE (50+20*x+20*y,Leave a comment:
-
...Code:'milliard & billion qb64 DAV guess 1 number of 1'OOO'000'ooo by 30 steps RANDOMIZE TIMER h2 = INT(RND * 10 ^ 9) h1 = 0 c = INT(RND * h2) 'comp h = INT(RND * h2) 'human t = 0 10 t = t + 1 PRINT t, c, h, IF h < c THEN PRINT "MORE": a = h: h = INT((h + h2) / 2): h1 = a: GOTO 10 IF h > c THEN PRINT "less": a = h: h = INT((h1 + h)
Leave a comment:
-
qb64 for 1 minute created main lines and for minutes issued
C# in 3 hours created by internet tips with new ideas
...Code:'qb64 dav guess number from 0 to 100 with counting of steps RANDOMIZE TIMER s = INT(RND * 100) t = 0 10 PRINT: t = t + 1: INPUT "your variant"; a IF a < s THEN PRINT "need MORE": GOTO 10 IF a > s THEN PRINT "need less":
Leave a comment:
No activity results to display
Leave a comment: