“DeepSeek Operator” How did DeepSeek and I solve the problem of generating 29 pentacubes
Abstract
Solving programming problems “together with DeepSeek” is what we call the creative process, which consists in solving a problem step by step, checking all the auxiliary programs generated by DeepSeek, at least on some tests each. At the same time, the result of such joint work, according to the author of this paper, turns out to be very good: and first of all, this result is manifested in a significant reduction in the development time of the final program. The author of the article calls this role “DeepSeek operator”. A specific complex problem (of the level of complex student laboratory work) is described, which consists in creating a program for generating all 29 pentacubes. Of course, it is not the result that matters here (it has been known for a long time), or the resulting program (it is complicated, of course, but an experienced programmer does it from scratch in a few hours); it is the process of creating it with the help of an AI assistant who takes on all the long and “uninteresting” subproblems that arise during the creation of the program. The paper describes the process of creating this program, presented as a developer’s dialogue with an AI assistant (DeepSeek). Moreover, the design of this dialogue in the form of a blank article was entrusted to the same DeepSeek, but, of course, it was finalized by the author.
Full Text:
PDF (Russian)References
Gardner M. Entertaining Mathematical Puzzles. – Gloucester: Peter
Smith Pub Inc, 1986.
Bouwkamp C. Packing Handed Pentacubes. – In: D. Klarner (Ed.).
The Mathematical Gardner. Boston: Prindle, Weber & Schmidt, 1981.
Knuth D.E. The Art of Computer Programming, Volume 4A:
Combinatorial Algorithms, Part 1. – Boston: Addison-Wesley
Professional, 2011.
https://rtomas.web.cern.ch/Ypentacubes/
Melnikov B., Korabelshchikova S., Dolgov V. On the task of
extracting the root from the language. – International Journal of Open
Information Technologies. 2019. Vol. 7. No 3. P. 1–6.
Nagornov Yu., Melnikov B., Zolotov A. An approach to modeling the
formation of nanocrystals in the process of carbonation of porous
silicon. – Vector of Science of Togliatti State University. 2012. No. 4
(22). P. 89–93.
Polák L. Minimalizations of NFA using the universal automaton. –
Int. J. Found. Comput. Sci. 2005. Vol. 16. No. 5. P. 999–1010.
Lombardy S., Sakarovitch J. The universal automaton. – 2008.
Amsterdam University Press.
Dolgov V., Melnikov B. Construction of a universal finite automaton.
II. Examples of how algorithms work. – Bulletin of Voronezh State
University. Series: Physics. Mathematics. 2014. No. 1. P. 78–85.
Bulynin A., Melnikov B., Meshchanin V., Terentyeva Yu.
Optimization problems arising in the design of high-dimensional
communication networks and some heuristic methods for their
solution. – Informatization and Communication. 2020. No. 1. P.
–40.
Refbacks
- There are currently no refbacks.
Abava Кибербезопасность ИТ-КОНГРЕСС ВМК МГУ 2026 СНЭ
ISSN: 2307-8162